Search

Generative Artificial Intelligence (GAI) has recently emerged as a promising solution to address critical challenges of blockchain technology, including scalability, security, privacy, and interoperability. In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains. Then, we discuss emerging solutions that demonstrate the effectiveness of GAI in addressing various challenges of blockchain, such as detecting unknown blockchain attacks and smart contract vulnerabilities, designing key secret sharing schemes, and enhancing privacy. Moreover, we present a case study to demonstrate that GAI, specifically the generative diffusion model, can be employed to optimize blockchain network performance metrics. Experimental results clearly show that, compared to a baseline traditional AI approach, the proposed generative diffusion model approach can converge faster, achieve higher rewards, and significantly improve the throughput and latency of the blockchain network. Additionally, we highlight future research directions for GAI in blockchain applications, including personalized GAI-enabled blockchains, GAI-blockchain synergy, and privacy and security considerations within blockchain ecosystems.

This paper is devoted to studying the well-posedness, conservation of magnetic helicity, inviscid limit and asymptotic stability of the generalized Navier-Stokes-Maxwell (NSM) equations with the standard Ohm's law in $\mathbb{R}^d$ for $d \in \{2,3\}$. More precisely, the global well-posedness is established in case of fractional Laplacian velocity $(-\Delta)^\alpha v$ with $\alpha = \frac{d}{2}$ for suitable data. In addition, the local well-posedness in the inviscid case is also provided for sufficient smooth data, which allows us to study the inviscid limit of associated positive viscosity solutions in the case $\alpha = 1$, where an explicit bound on the difference is given. Furthermore, in three dimensions if the initial data satisfies futher suitable conditions then magnetic helicity is conserved as the electric conductivity goes to infinity. On the other hand, in the case $\alpha = 0$ the stability near a magnetohydrostatic equilibrium with a constant (or equivalently bounded) magnetic field is also obtained in which nonhomogeneous Sobolev norms of the velocity and electric fields, and for $p \in (2,\infty]$ the $L^p$ norm of the magnetic field converge to zero as time goes to infinity with an implicit rate. In this velocity damping case, the situation is different both in case of the two and a half, and three-dimensional (Hall)-magnetohydrodynamics ((H)-MHD) system, where an explicit rate of convergence in infinite time is computed for both the velocity and magnetic fields in nonhomogeneous Sobolev norms. Therefore, it seems that there is a gap between NSM and MHD in terms of the norm convergence of the magnetic field and the rate of decaying in time, even the latter equations can be proved as a limiting system of the former one in the sense of distributions as the speed of light tends to infinity.

This work proposes an interval observer design for nonlinear discrete-time systems based on the Kazantzis-Kravaris/Luenberger (KKL) paradigm. Our design extends to generic nonlinear systems without any assumption on the structure of its dynamics and output maps. Relying on a transformation putting the system into a target form where an interval observer can be directly designed, we then propose a method to reconstruct the bounds in the original coordinates using the bounds in the target coordinates, thanks to the Lipschitz injectivity of this transformation achieved under Lipschitz distinguishability when the target dynamics have a high enough dimension and are pushed sufficiently fast. An academic example serves to illustrate our methods., Comment: 7 pages, 1 figure, IEEE Control Systems Letters with 63rd IEEE Conference on Decision and Control

Web 3.0 is the third generation of the World Wide Web (WWW), concentrating on the critical concepts of decentralization, availability, and increasing client usability. Although Web 3.0 is undoubtedly an essential component of the future Internet, it currently faces critical challenges, including decentralized data collection and management. To overcome these challenges, blockchain has emerged as one of the core technologies for the future development of Web 3.0. In this paper, we propose a novel blockchain-based information management framework, namely Smart Blockchain-based Web, to manage information in Web 3.0 effectively, enhance the security and privacy of users data, bring additional profits, and incentivize users to contribute information to the websites. Particularly, SBW utilizes blockchain technology and smart contracts to manage the decentralized data collection process for Web 3.0 effectively. Moreover, in this framework, we develop an effective consensus mechanism based on Proof-of-Stake to reward the user's information contribution and conduct game theoretical analysis to analyze the users behavior in the considered system. Additionally, we conduct simulations to assess the performance of SBW and investigate the impact of critical parameters on information contribution. The findings confirm our theoretical analysis and demonstrate that our proposed consensus mechanism can incentivize the nodes and users to contribute more information to our systems.

We have repeated the experiment performed recently by Krasznahorkay et al., (Phys. Rev. Lett. 116, 042501 (2016)), which may indicate a new particle called X17 in the literature. In order to get a reliable, and independent result, we used a different type of electron-positron pair spectrometer which have a more simple acceptance/efficiency as a function of the correlation angle, but the other conditions of the experiment were very similar to the published ones. We could confirm the presence of the anomaly measured at the E$_x$=18.15 MeV resonance, and also confirm their absence at the E$_x$=17.6 MeV resonance, and at E$_p$= 800 keV off resonance energies., Comment: Invited talk at the 52nd ISMD, Gy\"ongy\"os, Hungary, August 2023

The use of low-rank adaptation (LoRA) with frozen pretrained language models (PLMs) has become increasing popular as a mainstream, resource-efficient modeling approach for memory-constrained hardware. In this study, we first explore how to enhance model performance by introducing various LoRA training strategies, achieving relative word error rate reductions of 3.50\% on the public Librispeech dataset and of 3.67\% on an internal dataset in the messaging domain. To further characterize the stability of LoRA-based second-pass speech recognition models, we examine robustness against input perturbations. These perturbations are rooted in homophone replacements and a novel metric called N-best Perturbation-based Rescoring Robustness (NPRR), both designed to measure the relative degradation in the performance of rescoring models. Our experimental results indicate that while advanced variants of LoRA, such as dynamic rank-allocated LoRA, lead to performance degradation in $1$-best perturbation, they alleviate the degradation in $N$-best perturbation. This finding is in comparison to fully-tuned models and vanilla LoRA tuning baselines, suggesting that a comprehensive selection is needed when using LoRA-based adaptation for compute-cost savings and robust language modeling.

Artificial Intelligence (AI) in healthcare, especially in white blood cell cancer diagnosis, is hindered by two primary challenges: the lack of large-scale labeled datasets for white blood cell (WBC) segmentation and outdated segmentation methods. These challenges inhibit the development of more accurate and modern techniques to diagnose cancer relating to white blood cells. To address the first challenge, a semi-supervised learning framework should be devised to efficiently capitalize on the scarcity of the dataset available. In this work, we address this issue by proposing a novel self-training pipeline with the incorporation of FixMatch. Self-training is a technique that utilizes the model trained on labeled data to generate pseudo-labels for the unlabeled data and then re-train on both of them. FixMatch is a consistency-regularization algorithm to enforce the model's robustness against variations in the input image. We discover that by incorporating FixMatch in the self-training pipeline, the performance improves in the majority of cases. Our performance achieved the best performance with the self-training scheme with consistency on DeepLab-V3 architecture and ResNet-50, reaching 90.69%, 87.37%, and 76.49% on Zheng 1, Zheng 2, and LISC datasets, respectively.

We prove that the Gauss map of a non-flat complete minimal surface immersed in $\mathbb{R}^n$ can omit a generic hypersurface $D$ of degree at most $ n^{n+2}(n+1)^{n+2}$., Comment: 13 pages, comments are welcome. arXiv admin note: text overlap with arXiv:2012.12656, arXiv:1704.03358

Deep Reinforcement Learning (DRL) algorithms have recently made significant strides in improving network performance. Nonetheless, their practical use is still limited in the absence of safe exploration and safe decision-making. In the context of commercial solutions, reliable and safe-to-operate systems are of paramount importance. Taking this problem into account, we propose a safe learning-based load balancing algorithm for Software Defined-Wide Area Network (SD-WAN), which is empowered by Deep Reinforcement Learning (DRL) combined with a Control Barrier Function (CBF). It safely projects unsafe actions into feasible ones during both training and testing, and it guides learning towards safe policies. We successfully implemented the solution on GPU to accelerate training by approximately 110x times and achieve model updates for on-policy methods within a few seconds, making the solution practical. We show that our approach delivers near-optimal Quality-of-Service (QoS performance in terms of end-to-end delay while respecting safety requirements related to link capacity constraints. We also demonstrated that on-policy learning based on Proximal Policy Optimization (PPO) performs better than off-policy learning with Deep Deterministic Policy Gradient (DDPG) when both are combined with a CBF for safe load balancing., Comment: Accepted to IEEE/IFIP NOMS 2024

Wireless communications are particularly vulnerable to eavesdropping attacks due to their broadcast nature. To effectively deal with eavesdroppers, existing security techniques usually require accurate channel state information (CSI), e.g., for friendly jamming (FJ), and/or additional computing resources at transceivers, e.g., cryptography-based solutions, which unfortunately may not be feasible in practice. This challenge is even more acute in low-end IoT devices. We thus introduce a novel deep learning-based FJ framework that can effectively defeat eavesdropping attacks with imperfect CSI and even without CSI of legitimate channels. In particular, we first develop an autoencoder-based communication architecture with FJ, namely AEFJ, to jointly maximize the secrecy rate and minimize the block error rate at the receiver without requiring perfect CSI of the legitimate channels. In addition, to deal with the case without CSI, we leverage the mutual information neural estimation (MINE) concept and design a MINE-based FJ scheme that can achieve comparable security performance to the conventional FJ methods that require perfect CSI. Extensive simulations in a multiple-input multiple-output (MIMO) system demonstrate that our proposed solution can effectively deal with eavesdropping attacks in various settings. Moreover, the proposed framework can seamlessly integrate MIMO security and detection tasks into a unified end-to-end learning process. This integrated approach can significantly maximize the throughput and minimize the block error rate, offering a good solution for enhancing communication security in wireless communication systems., Comment: 12 pages, 15 figures

Intrusion detection systems (IDSs) play a critical role in protecting billions of IoT devices from malicious attacks. However, the IDSs for IoT devices face inherent challenges of IoT systems, including the heterogeneity of IoT data/devices, the high dimensionality of training data, and the imbalanced data. Moreover, the deployment of IDSs on IoT systems is challenging, and sometimes impossible, due to the limited resources such as memory/storage and computing capability of typical IoT devices. To tackle these challenges, this article proposes a novel deep neural network/architecture called Constrained Twin Variational Auto-Encoder (CTVAE) that can feed classifiers of IDSs with more separable/distinguishable and lower-dimensional representation data. Additionally, in comparison to the state-of-the-art neural networks used in IDSs, CTVAE requires less memory/storage and computing power, hence making it more suitable for IoT IDS systems. Extensive experiments with the 11 most popular IoT botnet datasets show that CTVAE can boost around 1% in terms of accuracy and Fscore in detection attack compared to the state-of-the-art machine learning and representation learning methods, whilst the running time for attack detection is lower than 2E-6 seconds and the model size is lower than 1 MB. We also further investigate various characteristics of CTVAE in the latent space and in the reconstruction representation to demonstrate its efficacy compared with current well-known methods.