Search

Degenerate two-dimensional electron liquids are theoretically established to possess two vastly distinct collisional electron mean free paths, where even-parity deformations of the Fermi surface are hydrodynamic with a short collisional mean free path but odd-parity deformations remain near ballistic (known as the "tomographic" transport regime). Predicted signatures of this regime rely on the scaling of observables with temperature or device dimension, both of which are difficult to establish with certainty. Here, we consider magnetotransport in a minimal model of tomographic electrons and show that even a small magnetic field suppresses tomographic transport signatures and thus acts as a sensitive and unique probe of this regime. Fundamentally, the magnetic field breaks time-reversal invariance, which is a prerequisite for the odd-even parity effect in the collisional relaxation. We analyze in detail the scaling of the transverse conductivity, which has been linked to small-channel conductance of interaction-dominated electrons, and show that a tomographic scaling regime at intermediate wavenumbers is quickly suppressed with magnetic field to a hydrodynamic or collisionless form. We confirm that the suppression occurs at relatively small magnetic fields when the cyclotron radius is comparable to the ballistic mean free path of the dominant odd-parity mode. This occurs at a much smaller magnetic field than the magnetic field strength required to suppress hydrodynamic electron transport, which suggests an experimental protocol to extract the odd-parity mean free path., Comment: 17 pages, 7 figures

Single-layer semiconducting transition-metal dichalcogenides, lacking point inversion symmetry, provide an efficient platform for valleytronics, where the electronic, magnetic, valley and lattice degrees of freedom can be selectively manipulated by using polarized light. This task is however thought to be limited in parent bulk compounds where the point inversion symmetry is restored. Exploiting the underlying quantum physics in bulk materials is thus one of the biggest paradigmatic challenges. Here we show that a sizable optical Kerr rotation can be efficiently generated in a wide energy range on ultrafast timescales in bulk WSe$_2$, by means of circularly-polarized light. We rationalize these findings as a result of the hidden spin/layer/valley quantum entanglement. The spectral analysis reveals clear features at the three characteristic frequencies corresponding to the A-, B- and C-exciton edges. The origin and the relative sign of all these features is shown to stem from the selective Pauli blocking of intralayer and interlayer optical transitions. The long lifetime of the broadband Kerr response ($\tau \sim 500$ fs) provides a strong indication that coupled photo-induced electron and hole densities survive in bulk compounds longer than previously expected. The present report demonstrates that a hidden quantum entanglement is operative also in bulk centrosymmetric layered materials, opening the way for an effective exploitation of bulk WSe$_2$ in optoelectronic applications., Comment: 14+3 pages, 3+3 figures

Multilingual machine translation models often outperform traditional bilingual models by leveraging translation knowledge transfer. Recent advancements have led to these models supporting hundreds of languages and achieving state-of-the-art results across various translation directions. However, as these models grow larger, their inference operations become increasingly costly. In many use cases, there is no need to support such a wide range of language pairs, as translation is typically needed in only a few selected directions. In this paper, we present CULL-MT, a compression method for machine translation models based on structural layer pruning and selected language directions. Our approach identifies and prunes unimportant layers using a greedy strategy, then mitigates the impact by applying knowledge distillation from the original model along with parameter-efficient fine-tuning. We apply CULL-MT to the NLLB-3.3B and LLaMA3.1-8B-Instruct models. In a multi-way translation scenario (Persian, French, and German to English), we find the NLLB-3.3B model to be robust, allowing 25% of layers to be pruned with only a 0.9 spBLEU drop. However, LLaMA3.1-8B-Instruct is more sensitive, with a 2.0 spBLEU drop after pruning 5 layers.

Speech is the most natural way of expressing ourselves as humans. Identifying emotion from speech is a nontrivial task due to the ambiguous definition of emotion itself. Speaker Emotion Recognition (SER) is essential for understanding human emotional behavior. The SER task is challenging due to the variety of speakers, background noise, complexity of emotions, and speaking styles. It has many applications in education, healthcare, customer service, and Human-Computer Interaction (HCI). Previously, conventional machine learning methods such as SVM, HMM, and KNN have been used for the SER task. In recent years, deep learning methods have become popular, with convolutional neural networks and recurrent neural networks being used for SER tasks. The input of these methods is mostly spectrograms and hand-crafted features. In this work, we study the use of self-supervised transformer-based models, Wav2Vec2 and HuBERT, to determine the emotion of speakers from their voice. The models automatically extract features from raw audio signals, which are then used for the classification task. The proposed solution is evaluated on reputable datasets, including RAVDESS, SHEMO, SAVEE, AESDD, and Emo-DB. The results show the effectiveness of the proposed method on different datasets. Moreover, the model has been used for real-world applications like call center conversations, and the results demonstrate that the model accurately predicts emotions.

Modulation classification is a very challenging task since the signals intertwine with various ambient noises. Methods are required that can classify them without adding extra steps like denoising, which introduces computational complexity. In this study, we propose a vision transformer (ViT) based model named NMformer to predict the channel modulation images with different noise levels in wireless communication. Since ViTs are most effective for RGB images, we generated constellation diagrams from the modulated signals. The diagrams provide the information from the signals in a 2-D representation form. We trained NMformer on 106, 800 modulation images to build the base classifier and only used 3, 000 images to fine-tune for specific tasks. Our proposed model has two different kinds of prediction setups: in-distribution and out-of-distribution. Our model achieves 4.67% higher accuracy than the base classifier when finetuned and tested on high signal-to-noise ratios (SNRs) in-distribution classes. Moreover, the fine-tuned low SNR task achieves a higher accuracy than the base classifier. The fine-tuned classifier becomes much more effective than the base classifier by achieving higher accuracy when predicted, even on unseen data from out-of-distribution classes. Extensive experiments show the effectiveness of NMformer for a wide range of SNRs.

Hardware-level memory vulnerabilities severely threaten computing systems. However, hardware patching is inefficient or difficult postfabrication. We investigate the effectiveness of hardware fuzzing in detecting hardware memory vulnerabilities and highlight challenges and potential future research directions to enhance hardware fuzzing for memory safety.

Microarchitectural attacks represent a challenging and persistent threat to modern processors, exploiting inherent design vulnerabilities in processors to leak sensitive information or compromise systems. Of particular concern is the susceptibility of Speculative Execution, a fundamental part of performance enhancement, to such attacks. We introduce Specure, a novel pre-silicon verification method composing hardware fuzzing with Information Flow Tracking (IFT) to address speculative execution leakages. Integrating IFT enables two significant and non-trivial enhancements over the existing fuzzing approaches: i) automatic detection of microarchitectural information leakages vulnerabilities without golden model and ii) a novel Leakage Path coverage metric for efficient vulnerability detection. Specure identifies previously overlooked speculative execution vulnerabilities on the RISC-V BOOM processor and explores the vulnerability search space 6.45x faster than existing fuzzing techniques. Moreover, Specure detected known vulnerabilities 20x faster.

Fluid antenna system (FAS) is gaining attention as an innovative technology for boosting diversity and multiplexing gains. As a key innovation, it presents the possibility to overcome interference by position reconfigurability on one radio frequency (RF) chain, giving rise to the concept of fluid antenna multiple access (FAMA). While FAMA is originally designed to deal with interference mainly by position change and treat interference as noise, this is not rate optimal, especially when suffering from a strong interference channel (IC) where all positions have strong interference. To tackle this, this paper considers a two-user strong IC where FAMA is used in conjunction with simultaneous nonunique decoding (SND). Specifically, we analyze the key statistics for the signal-to-noise ratio (SNR) and interference-to-noise ratio (INR) for a canonical two-user IC setup, and subsequently derive the delay outage rate (DOR), outage probability (OP) and ergodic capacity (EC) of the FAMA-IC. Our numerical results illustrate huge benefits of FAMA with SND over traditional fixed-position antenna systems (TAS) with SND in the fading IC.

The bimodal metallicity distribution of globular clusters (GCs) in massive galaxies implies two distinct sub-populations: metal-poor and metal-rich. Using the recent data of \textit{Gaia} we highlighted three distinct dissimilarities between metal-poor and metal-rich GCs in the Milky Way (MW). Half-mass (light) radii of metal-poor GCs exhibit, on average, $\simeq 52 \pm$5 ($60 \pm$3) per cent more expansion than metal-rich ones. Furthermore, the lack of metal-poor GCs at low Galactocentric distances ($R_\mathrm{G}$) follows a triangular pattern in $R_\mathrm{G}$-[Fe/H] space, indicating that GCs with lower metallicities appear further away from the Galactic center. Metal-poor GCs are more susceptible to destruction by the tidal field in the inner part of the MW. We perform a series of \Nbody simulations of star clusters, to study the impact of the BHs' natal kicks on the long-term evolution of low- and high-metallicity GCs to explain these observational aspects. We found that the retention of BHs inside the cluster is crucial to reproducing the observed dissimilarities. The heavier and less expanded BH sub-system (BHSub) in metal-poor clusters leads to more intense few-body encounters, injecting more kinetic energy into the stellar population. Consequently, they experience larger expansion and higher evaporation rates rather than metal-rich clusters. The higher energy production within the BHSub of metal-poor GCs causes them to dissolve before a Hubble time near the Galactic center, leading to a triangular pattern in $R_\mathrm{G}$-[Fe/H] space., Comment: 11 pages, 9 figures, 1 table. Accepted for publication in MNRAS

In this article, we consider the problem of unconstrained time-varying convex optimization, where the cost function changes with time. We provide an in-depth technical analysis of the problem and argue why freezing the cost at each time step and taking finite steps toward the minimizer is not the best tracking solution for this problem. We propose a set of algorithms that by taking into account the temporal variation of the cost aim to reduce the tracking error of the time-varying minimizer of the problem. The main contribution of our work is that our proposed algorithms only require the first-order derivatives of the cost function with respect to the decision variable. This approach significantly reduces computational cost compared to the existing algorithms, which use the inverse of the Hessian of the cost. Specifically, the proposed algorithms reduce the computational cost from $O(n^3)$ to $O(n)$ per timestep, where $n$ is the size of the decision variable. Avoiding the inverse of the Hessian also makes our algorithms applicable to non-convex optimization problems. We refer to these algorithms as $O(n)$-algorithms. These $O(n)$-algorithms are designed to solve the problem for different scenarios based on the available temporal information about the cost. We illustrate our results through various examples, including the solution of a model predictive control problem framed as a convex optimization problem with a streaming time-varying cost function., Comment: arXiv admin note: text overlap with arXiv:2310.07925

This paper introduces a robust stress detection system utilizing a Convolutional Neural Network (CNN) designed for the analysis of Photoplethysmogram (PPG) signals. Employing the WESAD dataset, we applied Continuous Wavelet Transform (CWT) to extract informative features from wrist PPG signals, demonstrating enhanced stress detection and learning compared to conventional techniques. Notably, the CNN achieved an impressive accuracy of 93.7% after five epochs, post-implementation on a resource-constrained microcontroller. The optimization process, including pruning and Post-Train Quantization, was crucial to reduce the model size to 1.6 megabytes, overcoming the microcontroller's limited resources of 2 megabytes of Flash memory and 512 kilobytes of RAM. This optimized model not only addresses resource constraints but also outperforms traditional signal processing methods, positioning it as a promising solution for real-time stress monitoring on wearable devices., Comment: 5 figures, implemented on Microcontroller

Manual annotation of 3D medical images for segmentation tasks is tedious and time-consuming. Moreover, data privacy limits the applicability of crowd sourcing to perform data annotation in medical domains. As a result, training deep neural networks for medical image segmentation can be challenging. We introduce a new source-free Unsupervised Domain Adaptation (UDA) method to address this problem. Our idea is based on estimating the internally learned distribution of a relevant source domain by a base model and then generating pseudo-labels that are used for enhancing the model refinement through self-training. We demonstrate that our approach leads to SOTA performance on a real-world 3D medical dataset.

Unsupervised Domain Adaptation (UDA) is crucial for reducing the need for extensive manual data annotation when training deep networks on point cloud data. A significant challenge of UDA lies in effectively bridging the domain gap. To tackle this challenge, we propose \textbf{C}urvature \textbf{D}iversity-Driven \textbf{N}uclear-Norm Wasserstein \textbf{D}omain Alignment (CDND). Our approach first introduces a \textit{\textbf{Curv}ature Diversity-driven Deformation \textbf{Rec}onstruction (CurvRec)} task, which effectively mitigates the gap between the source and target domains by enabling the model to extract salient features from semantically rich regions of a given point cloud. We then propose \textit{\textbf{D}eformation-based \textbf{N}uclear-norm \textbf{W}asserstein \textbf{D}iscrepancy (D-NWD)}, which applies the Nuclear-norm Wasserstein Discrepancy to both \textit{deformed and original} data samples to align the source and target domains. Furthermore, we contribute a theoretical justification for the effectiveness of D-NWD in distribution alignment and demonstrate that it is \textit{generic} enough to be applied to \textbf{any} deformations. To validate our method, we conduct extensive experiments on two public domain adaptation datasets for point cloud classification and segmentation tasks. Empirical experiment results show that our CDND achieves state-of-the-art performance by a noticeable margin over existing approaches.

Federated learning (FL) has gained considerable popularity for distributed machine learning due to its ability to preserve the privacy of participating agents by eliminating the need for data aggregation. Nevertheless, communication costs between agents and the central server in FL are substantial in large-scale problems and remain a limiting factor for this algorithm. This paper introduces an innovative algorithm, called \emph{FedScalar}, within the federated learning framework aimed at improving communication efficiency. Unlike traditional FL methods that require agents to send high-dimensional vectors to the server, \emph{FedScalar} enables agents to communicate updates using a single scalar. Each agent encodes its updated model parameters into a scalar through the inner product between its local update difference and a random vector, which is then transmitted to the server. The server decodes this information by projecting the averaged scalar values onto the random vector. Our method thereby significantly reduces communication overhead. Technically, we demonstrate that the proposed algorithm achieves a convergence rate of $O(1/\sqrt{K})$ to a stationary point for smooth, non-convex loss functions. Additionally, our analysis shows that altering the underlying distribution of the random vector generated by the server can reduce the variance during the aggregation step of the algorithm. Finally, we validate the performance and communication efficiency of our algorithm with numerical simulations.

We investigate the impact of primordial mass segregation on the formation and evolution of dark star clusters (DSCs). Considering a wide range of initial conditions, we conducted $N$-body simulations of globular clusters (GCs) around the Milky Way. In particular, we assume a canonical IMF for all GCs without natal kicks for supernovae remnants, namely neutron stars or black holes. Our results demonstrate that clusters with larger degrees of primordial mass segregation reach their DSC phase earlier and spend a larger fraction of their dissolution time in such a phase, compared to clusters without mass segregation. In primordially segregated clusters, the maximum Galactocentric distance that the clusters can have to enter the DSC phase is almost twice that of the clusters without primordial mass segregation. Primordially segregated clusters evolve with a higher number of stellar mass black holes, accelerating energy creation in their central regions and consequently increasing evaporation rates and cluster sizes during dark phases. The simulations reveal that aggregating heavy components at the centre doubles the time spent in the dark phase. Additionally, the study identifies potential links between simulated dark clusters and initial conditions of Milky Way globular clusters, suggesting some may transition to dark phases before dissolution. Higher primordial mass segregation coefficients amplify the average binary black hole formation rate by 2.5 times, raising higher expectations for gravitational wave emissions., Comment: 10 pages, 7 Figures, 1 Table, Accepted for publication in MNRAS

Backscatter communication (BC) emerges as a pivotal technology for ultra-low-power energy harvesting applications, but its practical deployment is often hampered by notable security vulnerabilities. Physical layer authentication (PLA) offers a promising solution for securing BC by leveraging the unique characteristics of the communication medium. However, existing PLA approaches often fall short due to limited signal strength in practical BC scenarios and performance deterioration with increasing distance between the tag and the reader. Moreover, achieving mutual authentication has been largely neglected in current PLA schemes, given the passive nature of tags and their limited computational and energy resources. This paper introduces a reconfigurable intelligent surfaces (RIS)-aided PLA scheme based on the physical features of received signals at legitimate endpoints through cascade links in monostatic BC (MBC) systems. By considering a RIS operating in its near-optimal conditions between a tag and a reader, the proposed PLA leverages the RIS-enhanced power delivery detected by the tag's energy detector and the optimized received signal strength (RSS) at the reader's signal processing unit, addressing the conventional challenges of mutual authentication, low PLA performance, and limited secure coverage area inherent in BC systems. Through theoretical analysis and extensive simulations, we show that as long as RIS is controlled by a trusted party in the network, it can boost the authentication performance across different system settings and strengthen the security features. Additionally, we analyze to explore the potential security threats when the RIS is compromised by an adversary, assessing its impact on the system's PLA performance and secrecy capacity, providing a comprehensive understanding of the security implications for RIS-aided MBC under such circumstances.

Backscatter communication (BC) has emerged as a pivotal wireless communication paradigm owing to its low-power and cost-effective characteristics. However, BC faces various challenges from its low signal detection rate to its security vulnerabilities. Recently, reconfigurable intelligent surfaces (RIS) have surfaced as a transformative technology addressing power and communication performance issues in BC. However, the potential of RIS in addressing the security challenges of BC remains uncharted. This paper investigates the secrecy performance of RIS-aided BC, where all channels are distributed according to the Fisher-Snedecor $\mathcal{F}$ distribution. Specifically, we consider a RIS with $N$ reflecting elements to help a backscatter device (BD) establish a smart environment and enhance the secrecy performance in BC. Due to the nature of BC systems, our analysis considers two possible scenarios (i) in the absence of direct links and (ii) in the presence of direct links. In both cases, we first derive compact analytical expressions of the probability density function (PDF) and cumulative distribution function (CDF) for the received signal-to-noise ratio (SNR) at both a legitimate receiver and an eavesdropper. Then, to analyze the secrecy performance, we further derive analytical expressions of the average secrecy capacity (ASC) and secrecy outage probability (SOP) for both mentioned scenarios. In addition, regarding the importance of system behavior in a high SNR regime, we provide an asymptotic analysis of the SOP and ASC. Eventually, the Monte-Carlo simulation is used to validate the analytical results, revealing that utilizing RIS can greatly improve the secrecy performance of the BC system relative to traditional BC setups that do not incorporate RIS.

Multi-task learning (MTL) is a machine learning paradigm that aims to improve the generalization performance of a model on multiple related tasks by training it simultaneously on those tasks. Unlike MTL, where the model has instant access to the training data of all tasks, continual learning (CL) involves adapting to new sequentially arriving tasks over time without forgetting the previously acquired knowledge. Despite the wide practical adoption of CL and MTL and extensive literature on both areas, there remains a gap in the theoretical understanding of these methods when used with overparameterized models such as deep neural networks. This paper studies the overparameterized linear models as a proxy for more complex models. We develop theoretical results describing the effect of various system parameters on the model's performance in an MTL setup. Specifically, we study the impact of model size, dataset size, and task similarity on the generalization error and knowledge transfer. Additionally, we present theoretical results to characterize the performance of replay-based CL models. Our results reveal the impact of buffer size and model capacity on the forgetting rate in a CL setup and help shed light on some of the state-of-the-art CL methods. Finally, through extensive empirical evaluations, we demonstrate that our theoretical findings are also applicable to deep neural networks, offering valuable guidance for designing MTL and CL models in practice., Comment: 41 pages, 21 figures

Backscattering tag-to-tag networks (BTTNs) represent a passive radio frequency identification (RFID) system that enables direct communication between tags within an external radio frequency (RF) field. However, low spectral efficiency and short-range communication capabilities, along with the ultra-low power nature of the tags, create significant challenges for reliable and practical applications of BTTNs. To address these challenges, this paper introduces integrating an indoor reconfigurable intelligent surface (RIS) into BTTN and studying RIS's impact on the system's performance. To that end, we first derive compact analytical expressions of the probability density function (PDF) and cumulative distribution function (CDF) for the received signal-to-noise ratio (SNR) at the receiver tag by exploiting the moment matching technique. Then, based on the derived PDF and CDF, we further derive analytical expressions of outage probability (OP), bit error rate (BER), and average capacity (AC) rate. Eventually, the Monte Carlo simulation is used to validate the accuracy of the analytical results, revealing that utilizing RIS can greatly improve the performance of BTTNs in terms of AC, BER, OP, and coverage region relative to traditional BTTNs setups that do not incorporate RIS.

This paper examines the impact of emerging fluid antenna systems (FAS) on reconfigurable intelligent surface (RIS)-aided secure communications. Specifically, we consider a classic wiretap channel, where a fixed-antenna transmitter sends confidential information to an FAS-equipped legitimate user with the help of an RIS, while an FAS-equipped eavesdropper attempts to decode the message. To evaluate the proposed wireless scenario, we first introduce the cumulative distribution function (CDF) and probability density function (PDF) of the signal-to-noise ratio (SNR) at each node, using the central limit theorem and the Gaussian copula function. We then derive a compact analytical expression for the secrecy outage probability (SOP). Our numerical results reveal how the incorporation of FAS and RIS can significantly enhance the performance of secure communications.

Large vision-language models (VLMs) have shown significant performance boost in various application domains. However, adopting them to deal with several sequentially encountered tasks has been challenging because finetuning a VLM on a task normally leads to reducing its generalization power and the capacity of learning new tasks as well as causing catastrophic forgetting on previously learned tasks. Enabling using VLMs in multimodal continual learning (CL) settings can help to address such scenarios. To improve generalization capacity and prevent catastrophic forgetting, we propose a novel prompt-based CL method for VLMs, namely $\textbf{Clu}$ster-based $\textbf{Mo}$dality Fusion Prompt (\textbf{CluMo}). We design a novel \textbf{Key-Key-Prompt} pair, where each prompt is associated with a visual prompt key and a textual prompt key. We adopt a two-stage training strategy. During the first stage, the single-modal keys are trained via $K$-means clustering algorithm to help select the best semantically matched prompt. During the second stage, the prompt keys are frozen, the selected prompt is attached to the input for training the VLM in the CL scenario. Experiments on two benchmarks demonstrate that our method achieves SOTA performance.

This paper investigates a two-user downlink system for integrated sensing and communication (ISAC) in which the two users deploy a fluid antenna system (FAS) and adopt the nonorthogonal multiple access (NOMA) strategy. Specifically, the integrated sensing and backscatter communication (ISABC) model is considered, where a dual-functional base station (BS) serves to communicate the two users and sense a tag's surrounding. In contrast to conventional ISAC, the backscattering tag reflects the signals transmitted by the BS to the NOMA users and enhances their communication performance. Furthermore, the BS extracts environmental information from the same backscatter signal in the sensing stage. Firstly, we derive closed-form expressions for both the cumulative distribution function (CDF) and probability density function (PDF) of the equivalent channel at the users utilizing the moment matching method and the Gaussian copula. Then in the communication stage, we obtain closed-form expressions for both the outage probability and for the corresponding asymptotic expressions in the high signal-to-noise ratio (SNR) regime. Moreover, using numerical integration techniques such as the Gauss-Laguerre quadrature (GLQ), we have series-form expressions for the user ergodic communication rates (ECRs). In addition, we get a closed-form expression for the ergodic sensing rate (ESR) using the Cramer-Rao lower bound (CRLB). Finally, the accuracy of our analytical results is validated numerically, and we confirm the superiority of employing FAS over traditional fixed-position antenna systems in both ISAC and ISABC.

The breakup dynamics of viscous liquid bridges on solid surfaces is studied experimentally. It is found that the dynamics bears similarities to the breakup of free liquid bridges in the viscous regime. Nevertheless, the dynamics is significantly influenced by the wettability of the solid substrate. Therefore, it is essential to take into account the interaction between the solid and the liquid, especially at the three-phase contact line. It is shown that when the breakup velocity is low and the solid surface is hydrophobic, the dominant channel of energy dissipation is likely due to thermally activated jumping of molecules, as described by the Molecular Kinetic Theory. Nevertheless, the viscous dissipation in the bulk due to axial flow along the bridge can be of importance for long bridges. In view of this, a scaling relation for the time dependence of the minimum width of the liquid bridge is derived. For high viscosities, the scaling relation captures the time evolution of the minimum width very well. Furthermore, it is found that external geometrical constraints alter the dynamic behavior of low and high viscosity liquid bridges in a different fashion. This discrepancy is explained by considering the dominant forces in each regime. Lastly, the morphology of the satellite droplets deposited on the surface is qualitatively compared to that of free liquid bridges.

In the realm of thermal expansion determination, the quasiharmonic approximation (QHA) stands as a widely embraced method for discerning minima of free energies across diverse temperatures such that the temperature dependence of lattice parameters as well as internal atomic positions can be determined. However, this methodology often imposes substantial computational demand, necessitating numerous costly calculations of full phonon spectra in a possibly many-dimensional geometry parameter space. Focusing on the volumetric thermal expansion only, the volume-constrained zero static internal stress approximation (v-ZSISA) within QHA allows one to limit significantly the number of phonon spectra determinations to typically less than 10. The linear Gruneisen approach goes even further with only two phonon spectra determinations to find the volumetric thermal expansion, but a deterioration of the accuracy of the computed thermal expansion is observed, except at low temperatures. We streamline this process by introducing further intermediate approximations between the linear Gruneisen and the v-ZSISA-QHA, corresponding to different orders of the Taylor expansion. The minimal number of phonon spectra calculations that is needed to maintain precise outcomes is investigated. The different approximations are tested on a representative set of 12 materials. For the majority of materials, three full phonon spectra, corresponding to quadratic order, is enough to determine the thermal expansion in reasonable agreement with the v-ZSISA-QHA method up to 800 K. Near perfect agreement is obtained with five phonon spectra. This study paves the way to multidimensional generalizations, beyond the volumetric case, with the expectation of much bigger benefits.

The advent of the sixth-generation (6G) networks presents another round of revolution for the mobile communication landscape, promising an immersive experience, robust reliability, minimal latency, extreme connectivity, ubiquitous coverage, and capabilities beyond communication, including intelligence and sensing. To achieve these ambitious goals, it is apparent that 6G networks need to incorporate the state-of-the-art technologies. One of the technologies that has garnered rising interest is fluid antenna system (FAS) which represents any software-controllable fluidic, conductive, or dielectric structure capable of dynamically changing its shape and position to reconfigure essential radio-frequency (RF) characteristics. Compared to traditional antenna systems (TASs) with fixed-position radiating elements, the core idea of FAS revolves around the unique flexibility of reconfiguring the radiating elements within a given space. One recent driver of FAS is the recognition of its position-flexibility as a new degree of freedom (dof) to harness diversity and multiplexing gains. In this paper, we provide a comprehensive tutorial, covering channel modeling, signal processing and estimation methods, information-theoretic insights, new multiple access techniques, and hardware designs. Moreover, we delineate the challenges of FAS and explore the potential of using FAS to improve the performance of other contemporary technologies. By providing insights and guidance, this tutorial paper serves to inspire researchers to explore new horizons and fully unleash the potential of FAS., Comment: 53 pages, 45 figures, 5 tables. Accepted by IEEE Communications Surveys and Tutorials

This letter investigates the secret communication problem for a fluid antenna system (FAS)-assisted wiretap channel, where the legitimate transmitter transmits an information-bearing signal to the legitimate receiver, and at the same time, transmits a jamming signal to interfere with the eavesdropper (Eve). Unlike the conventional jamming scheme, which usually transmits Gaussian noise that interferes not only with Eve but also with the legitimate receiver, in this letter, we consider that encoded codewords are transmitted to jam Eve. Then, by employing appropriate coding schemes, the legitimate receiver can successfully decode the jamming signal and then cancel the interference, while Eve cannot, even if it knows the codebooks. We aim to maximize the secrecy rate through port selection and power control. Although the problem is non-convex, we show that the optimal solution can be found. Simulation results show that by using the FAS technique and the proposed jamming scheme, the secrecy rate of the system can be significantly increased., Comment: 6 pages, 3 figures, this paper has been accepted by IEEE Communications Letters

Over the past decade, there has been a severe staffing shortage in mental healthcare, exacerbated by increased demand for mental health services due to COVID-19. This demand is projected to increase over the next decade or so, necessitating proactive workforce planning to ensure sufficient staffing for ongoing service delivery. Despite the subject's critical significance, the present literature lacks thorough research dedicated to developing a model that addresses the long-term workforce needs required for efficient mental healthcare planning. Furthermore, our interactions with mental health practitioners within the United Kingdom's National Health Service (NHS) revealed the practical need for such a model. To address this gap, we aim to develop a hybrid predictive and prescriptive modelling framework, which combines long-term probabilistic forecasting with an analytical stock-flow model, designed specifically for mental health workforce planning. Given the vital role of nurses, who account for one-third of the total mental health workforce, we focus on modelling the headcount of nurses, but the proposed model can be generalised to other types of workforce planning in the healthcare sector. Using statistical and machine learning approaches and real-world data from NHS, we first identify factors contributing to variations in workforce requirements, then develop a long-term forecasting model to estimate future workforce needs, and finally integrate it into an analytical stock-flow method to provide policy analysis. Our findings highlight the unsustainable nature of present staffing plans, showing a growing nursing shortage. Furthermore, the policy analysis demonstrates the ineffectiveness of blanket remedies, highlighting the need for regional-level policy developments., Comment: Under review

Deep reinforcement learning has shown promise in various engineering applications, including vehicular traffic control. The non-stationary nature of traffic, especially in the lane-free environment with more degrees of freedom in vehicle behaviors, poses challenges for decision-making since a wrong action might lead to a catastrophic failure. In this paper, we propose a novel driving strategy for Connected and Automated Vehicles (CAVs) based on a competitive Multi-Agent Deep Deterministic Policy Gradient approach. The developed multi-agent deep reinforcement learning algorithm creates a dynamic and non-stationary scenario, mirroring real-world traffic complexities and making trained agents more robust. The algorithm's reward function is strategically and uniquely formulated to cover multiple vehicle control tasks, including maintaining desired speeds, overtaking, collision avoidance, and merging and diverging maneuvers. Moreover, additional considerations for both lateral and longitudinal passenger comfort and safety criteria are taken into account. We employed inter-vehicle forces, known as nudging and repulsive forces, to manage the maneuvers of CAVs in a lane-free traffic environment. The proposed driving algorithm is trained and evaluated on lane-free roads using the Simulation of Urban Mobility platform. Experimental results demonstrate the algorithm's efficacy in handling different objectives, highlighting its potential to enhance safety and efficiency in autonomous driving within lane-free traffic environments.

The Transformer architecture has dominated machine learning in a wide range of tasks. The specific characteristic of this architecture is an expensive scaled dot-product attention mechanism that models the inter-token interactions, which is known to be the reason behind its success. However, such a mechanism does not have a direct parallel to the human brain which brings the question if the scaled-dot product is necessary for intelligence with strong expressive power. Inspired by the lateralization of the human brain, we propose a new simple but effective architecture called the Lateralization MLP (L-MLP). Stacking L-MLP blocks can generate complex architectures. Each L-MLP block is based on a multi-layer perceptron (MLP) that permutes data dimensions, processes each dimension in parallel, merges them, and finally passes through a joint MLP. We discover that this specific design outperforms other MLP variants and performs comparably to a transformer-based architecture in the challenging diffusion task while being highly efficient. We conduct experiments using text-to-image generation tasks to demonstrate the effectiveness and efficiency of L-MLP. Further, we look into the model behavior and discover a connection to the function of the human brain. Our code is publicly available: \url{https://github.com/zizhao-hu/L-MLP}

Fluid antenna system (FAS) has recently surfaced as a promising technology for the upcoming sixth generation (6G) wireless networks. Unlike traditional antenna system (TAS) with fixed antenna location, FAS introduces a flexible component in which the radiating element can switch its position within a predefined space. This capability allows FAS to achieve additional diversity and multiplexing gains. Nevertheless, to fully reap the benefits of FAS, obtaining channel state information (CSI) over the predefined space is crucial. In this paper, we study the system with a transmitter equipped with a traditional fixed antenna and a receiver with a fluid antenna by considering an electromagnetic-compliant channel model. We address the challenges of channel estimation and reconstruction using Nyquist sampling and maximum likelihood estimation (MLE) methods. Our analysis reveals a fundamental tradeoff between the accuracy of the reconstructed channel and the number of estimated channels, indicating that half-wavelength sampling is insufficient for perfect reconstruction and that oversampling is essential to enhance accuracy. Despite its advantages, oversampling can introduce practical challenges. Consequently, we propose a suboptimal sampling distance that facilitates efficient channel reconstruction. In addition, we employ the MLE method to bound the channel estimation error by $\epsilon$, with a specific confidence interval (CI). Our findings enable us to determine the minimum number of estimated channels and the total number of pilot symbols required for efficient channel reconstruction in a given space. Lastly, we investigate the rate performance of FAS and TAS and demonstrate that FAS with imperfect CSI can outperform TAS with perfect CSI. In contrast to existing works, we also show that there is an optimal fluid antenna size that maximizes the achievable rate., Comment: 13 pages, 16 figures - including subfigures. Accepted by IEEE TWC

This paper studies the performance of a wireless powered communication network (WPCN) under the non-orthogonal multiple access (NOMA) scheme, where users take advantage of an emerging fluid antenna system (FAS). More precisely, we consider a scenario where a transmitter is powered by a remote power beacon (PB) to send information to the planar NOMA FAS-equipped users through Rayleigh fading channels. After introducing the distribution of the equivalent channel coefficients to the users, we derive compact analytical expressions for the outage probability (OP) in order to evaluate the system performance. Additionally, we present asymptotic OP in the high signal-to-noise ratio (SNR) regime. Eventually, results reveal that deploying the FAS with only one activated port in NOMA users can significantly enhance the WPCN performance compared with using traditional antenna systems (TAS)., Comment: This manuscript has been submitted to the 20th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)

In magnetic topological insulators, the surface states can exhibit a gap due to the breaking of time-reversal symmetry. Various experiments, while suggesting the existence of the surface gap, have raised questions about its underlying mechanism in the presence of different magnetic orderings. Here, we demonstrate that magnon-mediated electron-electron interactions, whose effects are not limited to the surfaces perpendicular to the magnetic ordering, can significantly influence surface states and their effective gaps. On the surfaces perpendicular to the spin quantization axis, many-body interactions can enhance the band gap to a degree that surpasses the non-interacting scenario. Then, on surfaces parallel to the magnetic ordering, we find that strong magnon-induced fermionic interactions can lead to features resembling a massless-like gap. These remarkable results largely stem from the fact that magnon-mediated interactions exhibit considerable long-range behavior compared to direct Coulomb interactions among electrons, thereby dominating the many-body properties at the surface of magnetic topological insulators., Comment: 10+8 pages, 3+3 figures

High peak-to-average power ratio (PAPR) is one of the main factors limiting cell coverage for cellular systems, especially in the uplink direction. Discrete Fourier transform spread orthogonal frequency-domain multiplexing (DFT-s-OFDM) with spectrally-extended frequency-domain spectrum shaping (FDSS) is one of the efficient techniques deployed to lower the PAPR of the uplink waveforms. In this work, we propose a machine learning-based framework to determine the FDSS filter, optimizing a tradeoff between the symbol error rate (SER), the PAPR, and the spectral flatness requirements. Our end-to-end optimization framework considers multiple important design constraints, including the Nyquist zero-ISI (inter-symbol interference) condition. The numerical results show that learned FDSS filters lower the PAPR compared to conventional baselines, with minimal SER degradation. Tuning the parameters of the optimization also helps us understand the fundamental limitations and characteristics of the FDSS filters for PAPR reduction., Comment: 5 pages, under review

The Spitzer instability leads to the formation of a black hole sub-system (BHSub) at the center of a star cluster providing energy to luminous stars (LSs) and increasing their rate of evaporation. When the self-depletion time of the BHSub exceeds the evaporation time of the LSs, a dark star cluster (DSC) will appear. Using the NBODY7 code, we performed a comprehensive set of direct \Nbody simulations over a wide range of initial conditions to study the pure effect of the top-heaviness of the IMF on the formation of the DSC phase. In the Galactic tidal field, top-heavy IMFs lead to the fast evaporation of LSs and the formation of DSCs. Therefore, DSCs can be present even in the outer region of the Milky Way (MW). To successfully transition to the DSC phase, the MW Globular Clusters (GCs) must possess an initial BH mass fraction of $\widetilde{\mathit{M}}_\mathrm{BH}(0)>0.05$. For star clusters with $\widetilde{\mathit{M}}_\mathrm{BH}(0)>0.08$, the DSC phase will be created for any given initial density of the cluster and Galactocentric distance. The duration of the cluster's lifetime spent in the DSC phase shows a negative (positive) correlation with the initial density, and Galactocentric distance of the star cluster if $\widetilde{\mathit{M}}_\mathrm{BH}(0)\leq 0.12$ ($\widetilde{\mathit{M}}_\mathrm{BH}(0)\geq 0.15$). Considering the canonical IMF, it is unlikely for any MW GCs to enter the DSC phase. We discuss the BH retention fraction in view of the observed properties of the GCs of the MW., Comment: 16 pages, 13 Figures, 2 Tables, Accepted for publications in MNRAS

Hardware-aware Neural Architecture Search approaches (HW-NAS) automate the design of deep learning architectures, tailored specifically to a given target hardware platform. Yet, these techniques demand substantial computational resources, primarily due to the expensive process of assessing the performance of identified architectures. To alleviate this problem, a recent direction in the literature has employed representation similarity metric for efficiently evaluating architecture performance. Nonetheless, since it is inherently a single objective method, it requires multiple runs to identify the optimal architecture set satisfying the diverse hardware cost constraints, thereby increasing the search cost. Furthermore, simply converting the single objective into a multi-objective approach results in an under-explored architectural search space. In this study, we propose a Multi-Objective method to address the HW-NAS problem, called MO-HDNAS, to identify the trade-off set of architectures in a single run with low computational cost. This is achieved by optimizing three objectives: maximizing the representation similarity metric, minimizing hardware cost, and maximizing the hardware cost diversity. The third objective, i.e. hardware cost diversity, is used to facilitate a better exploration of the architecture search space. Experimental results demonstrate the effectiveness of our proposed method in efficiently addressing the HW-NAS problem across six edge devices for the image classification task., Comment: Accepted at the CVPR 2024 Workshop, called "Efficient Deep Learning for Computer Vision (ECV)"

Modern computing systems heavily rely on hardware as the root of trust. However, their increasing complexity has given rise to security-critical vulnerabilities that cross-layer at-tacks can exploit. Traditional hardware vulnerability detection methods, such as random regression and formal verification, have limitations. Random regression, while scalable, is slow in exploring hardware, and formal verification techniques are often concerned with manual effort and state explosions. Hardware fuzzing has emerged as an effective approach to exploring and detecting security vulnerabilities in large-scale designs like modern processors. They outperform traditional methods regarding coverage, scalability, and efficiency. However, state-of-the-art fuzzers struggle to achieve comprehensive coverage of intricate hardware designs within a practical timeframe, often falling short of a 70% coverage threshold. We propose a novel ML-based hardware fuzzer, ChatFuzz, to address this challenge. Ourapproach leverages LLMs like ChatGPT to understand processor language, focusing on machine codes and generating assembly code sequences. RL is integrated to guide the input generation process by rewarding the inputs using code coverage metrics. We use the open-source RISCV-based RocketCore processor as our testbed. ChatFuzz achieves condition coverage rate of 75% in just 52 minutes compared to a state-of-the-art fuzzer, which requires a lengthy 30-hour window to reach a similar condition coverage. Furthermore, our fuzzer can attain 80% coverage when provided with a limited pool of 10 simulation instances/licenses within a 130-hour window. During this time, it conducted a total of 199K test cases, of which 6K produced discrepancies with the processor's golden model. Our analysis identified more than 10 unique mismatches, including two new bugs in the RocketCore and discrepancies from the RISC-V ISA Simulator.

It is fascinating to predict the mass and width of the ordinary and exotic mesons solely based on their quark content and quantum numbers. Such prediction goes beyond conventional methodologies traditionally employed in hadron physics for calculating or estimating these quantities. The relation between the quantum numbers and the properties of the mesons, such as the mass and width, is complicated in the world of particle physics. However, the deep neural network (DNN) as a subfield of machine learning techniques provides a solution to this problem. By analyzing large datasets, deep learning algorithms can automatically identify complex patterns among the particles' quantum numbers, and their mass and width, that would otherwise require complex calculations. In this study, we present two approaches using the DNNs to estimate the mass of some ordinary and exotic mesons. Also for the first time, the DNNs are trained to predict the width of ordinary and exotic mesons, whose widths have not been experimentally known. Our predictions obtained through the DNNs, will be useful for future experimental searches., Comment: 29 Pages, 4 Figures and 17 Tables

This letter investigates the performance of content caching in a heterogeneous cellular network (HetNet) consisting of fluid antenna system (FAS)-equipped mobile users (MUs) and millimeter-wave (mm-wave) single-antenna small base stations (SBSs), distributed according to the independent homogeneous Poisson point processes (HPPP). In particular, it is assumed that the most popular contents are cached in the SBSs to serve the FAS-equipped MUs requests. To assess the system performance, we derive compact expressions for the successful content delivery probability (SCDP) and the content delivery delay (CDD) using the Gauss-Laguerre quadrature technique. Our numerical results show that the performance of cache-enabled mm-wave HetNets can be greatly improved, when the FAS is utilized at the MUs instead of traditional fixed-antenna system deployment.

Diffusion models have been widely used for conditional data cross-modal generation tasks such as text-to-image and text-to-video. However, state-of-the-art models still fail to align the generated visual concepts with high-level semantics in a language such as object count, spatial relationship, etc. We approach this problem from a multimodal data fusion perspective and investigate how different fusion strategies can affect vision-language alignment. We discover that compared to the widely used early fusion of conditioning text in a pretrained image feature space, a specially designed intermediate fusion can: (i) boost text-to-image alignment with improved generation quality and (ii) improve training and inference efficiency by reducing low-rank text-to-image attention calculations. We perform experiments using a text-to-image generation task on the MS-COCO dataset. We compare our intermediate fusion mechanism with the classic early fusion mechanism on two common conditioning methods on a U-shaped ViT backbone. Our intermediate fusion model achieves a higher CLIP Score and lower FID, with 20% reduced FLOPs, and 50% increased training speed compared to a strong U-ViT baseline with an early fusion.

Cross-modal feature extraction and integration have led to steady performance improvements in few-shot learning tasks due to generating richer features. However, existing multi-modal object detection (MM-OD) methods degrade when facing significant domain-shift and are sample insufficient. We hypothesize that rich text information could more effectively help the model to build a knowledge relationship between the vision instance and its language description and can help mitigate domain shift. Specifically, we study the Cross-Domain few-shot generalization of MM-OD (CDMM-FSOD) and propose a meta-learning based multi-modal few-shot object detection method that utilizes rich text semantic information as an auxiliary modality to achieve domain adaptation in the context of FSOD. Our proposed network contains (i) a multi-modal feature aggregation module that aligns the vision and language support feature embeddings and (ii) a rich text semantic rectify module that utilizes bidirectional text feature generation to reinforce multi-modal feature alignment and thus to enhance the model's language understanding capability. We evaluate our model on common standard cross-domain object detection datasets and demonstrate that our approach considerably outperforms existing FSOD methods.

Three-dimensional (3D) clustering characteristics of large-stokes number sprays interacting with turbulent swirling co-flows are investigated experimentally. The Astigmatic Interferometric Particle Imaging (AIPI) technique is utilized for simultaneous measurement of the spray droplets position in 3D space and their corresponding diameter. The Stokes number estimated based on the Kolmogorov time scale varies from 34 to 142. The results show that the degree of droplet clustering plateaus at about 0.4 and at large Stokes numbers. It is obtained that the mean length scale of the clusters normalized by the Kolmogorov length scale follows a power-law relation with the Stokes number, and the mean void length scale normalized by the integral length scale plateaus at about 1.5. It is shown that the ratio of the number density of the droplets residing within the clusters to the global number density increases with increasing the Stokes number and is about 8 for the largest stokes number examined in this study. The joint characteristics of cluster's normalized volume and the mean diameter of droplets residing within the clusters show that small-volume clusters accommodate droplets with a relatively broad range of diameter. However, large clusters carry droplets with the most probable diameter. The developed AIPI technique in the present study and the corresponding spray characteristics are of importance for engineering applications that aim to understand the 3D clustering characteristics of large-stokes number droplets sprayed into turbulent swirling co-flows.

This paper aims to enhance the use of the Frank-Wolfe (FW) algorithm for training deep neural networks. Similar to any gradient-based optimization algorithm, FW suffers from high computational and memory costs when computing gradients for DNNs. This paper introduces the application of the recently proposed projected forward gradient (Projected-FG) method to the FW framework, offering reduced computational cost similar to backpropagation and low memory utilization akin to forward propagation. Our results show that trivial application of the Projected-FG introduces non-vanishing convergence error due to the stochastic noise that the Projected-FG method introduces in the process. This noise results in an non-vanishing variance in the Projected-FG estimated gradient. To address this, we propose a variance reduction approach by aggregating historical Projected-FG directions. We demonstrate rigorously that this approach ensures convergence to the optimal solution for convex functions and to a stationary point for non-convex functions. These convergence properties are validated through a numerical example, showcasing the approach's effectiveness and efficiency.

Clustered Regularly Interspaced Short Palindromic Repeats (CRISPR) is a gene editing technology that has revolutionized the fields of biology and medicine. However, one of the challenges of using CRISPR is predicting the on-target efficacy and off-target sensitivity of single-guide RNAs (sgRNAs). This is because most existing methods are trained on separate datasets with different genes and cells, which limits their generalizability. In this paper, we propose a novel ensemble learning method for sgRNA design that is accurate and generalizable. Our method combines the predictions of multiple machine learning models to produce a single, more robust prediction. This approach allows us to learn from a wider range of data, which improves the generalizability of our model. We evaluated our method on a benchmark dataset of sgRNA designs and found that it outperformed existing methods in terms of both accuracy and generalizability. Our results suggest that our method can be used to design sgRNAs with high sensitivity and specificity, even for new genes or cells. This could have important implications for the clinical use of CRISPR, as it would allow researchers to design more effective and safer treatments for a variety of diseases.