Searcharxiv⌕ Search

arXiv subjects

Li Wang

Publications and source records attributed to Li Wang.

At least 217 records · Page 12Linked to original sources

Scaling laws for the sound generation of bio-inspired flapping wings

Bio-inspired flapping wings have been extensively studied for their remarkable aerodynamic performance. Recently, their noise emission has attracted growing interest, but a careful analysis of scaling laws for their sound generation is missing. This work presents scaling laws for the sound generation of bio-inspired flapping wings during hovering flight based on the potential flow theory and Ffowcs Williams-Hawkings acoustic analogy. Direct numerical simulations considering a range of parameters including the Reynolds number, Mach number and wing kinematics confirms that the proposed scaling laws capture the major physics involved and their predictions agree well with the numerical results. The scaling laws can be used as a powerful tool for engineers in the design of micro-aerial vehicles considering both aerodynamics and acoustics performances simultaneously.

physics.flu-dyn↗

SpMis: An Investigation of Synthetic Spoken Misinformation Detection

In recent years, speech generation technology has advanced rapidly, fueled by generative models and large-scale training techniques. While these developments have enabled the production of high-quality synthetic speech, they have also raised concerns about the misuse of this technology, particularly for generating synthetic misinformation. Current research primarily focuses on distinguishing machine-generated speech from human-produced speech, but the more urgent challenge is detecting misinformation within spoken content. This task requires a thorough analysis of factors such as speaker identity, topic, and synthesis. To address this need, we conduct an initial investigation into synthetic spoken misinformation detection by introducing an open-source dataset, SpMis. SpMis includes speech synthesized from over 1,000 speakers across five common topics, utilizing state-of-the-art text-to-speech systems. Although our results show promising detection capabilities, they also reveal substantial challenges for practical implementation, underscoring the importance of ongoing research in this critical area.

cs.CL↗

Robust Coulomb Gap and Varied-temperature Study of Epitaxial 1T'-WSe$_2$ Monolayers

The transition metal dichalcogenides (TMDCs) with a 1T' structural phase are predicted to be two-dimensional topological insulators at zero temperature. Although the quantized edge conductance of 1T'-WTe$_2$ has been confirmed to survive up to 100 K, this temperature is still relatively low for industrial applications. Addressing the limited studies on temperature effects in 1T'-TMDCs, our research focuses on the electronic and crystal properties of the epitaxial 1T'-WSe$_2$ monolayers grown on bilayer graphene (BLG) and SrTiO$_3$(100) substrates at various temperatures. For the 1T'-WSe$_2$ grown on BLG, we observed a significant thermal expansion effect on its band structures with a thermal expansion coefficient of $\sim$60$\times$10$^{-6}$ K$^{-1}$. In contrast, the 1T'-WSe$_2$ grown on SrTiO$_3$(100) exhibits minimal changes with varied temperatures due to the enhanced strain exerted by the substrate. Besides, A significant Coulomb gap (CG) was observed pinned at the Fermi level in the angle-resolved photoemission spectroscopy (ARPES) and scanning tunneling spectroscopy (STS). The CG was founded to decrease with increasing temperatures, and can persist up to 200 K for 1T'-WSe$_2$/BLG, consistent with our Monte Carlo simulations. The robustness of the CG and the positive fundamental gap endow the epitaxial 1T'-WSe$_2$ monolayers with huge potential for realizing the quantum spin Hall devices.

cond-mat.mes-hall↗

On the Convergence Analysis of Over-Parameterized Variational Autoencoders: A Neural Tangent Kernel Perspective

Variational Auto-Encoders (VAEs) have emerged as powerful probabilistic models for generative tasks. However, their convergence properties have not been rigorously proven. The challenge of proving convergence is inherently difficult due to the highly non-convex nature of the training objective and the implementation of a Stochastic Neural Network (SNN) within VAE architectures. This paper addresses these challenges by characterizing the optimization trajectory of SNNs utilized in VAEs through the lens of Neural Tangent Kernel (NTK) techniques. These techniques govern the optimization and generalization behaviors of ultra-wide neural networks. We provide a mathematical proof of VAE convergence under mild assumptions, thus advancing the theoretical understanding of VAE optimization dynamics. Furthermore, we establish a novel connection between the optimization problem faced by over-parameterized SNNs and the Kernel Ridge Regression (KRR) problem. Our findings not only contribute to the theoretical foundation of VAEs but also open new avenues for investigating the optimization of generative models using advanced kernel methods. Our theoretical claims are verified by experimental simulations.

cs.LG↗

Room temperature synthesis of gallium oxide film with a fluidic exfoliation method

Two-dimensional metal oxides play an important role in electronics and optoelectronics, and it is still a challenge to obtain thin oxides film. Here, a fluidic exfoliation method is applied to synthesis the metal oxides film by using galinstan as the reactant, and Ga2O3 film with ~1 cm size is obtained. Optical microscope and scanning electron microscope images show that the Ga2O3 film is exfoliated from the galinstan without any droplets left. Energy Dispersive X-Ray measurements confirm the existence of the Ga2O3 film. Transmission electron microscope and selected area electron diffraction patterns indicate the oxidation process do not have a prior direction. The alloy liquid based fluidic exfoliation method in room temperature provide a promising route for the synthesis of two-dimensional mental oxides, which shows significant applications in electronic and photoelectronic devices.

cond-mat.mtrl-sci↗

Role of Data-driven Regional Growth Model in Shaping Brain Folding Patterns

The surface morphology of the developing mammalian brain is crucial for understanding brain function and dysfunction. Computational modeling offers valuable insights into the underlying mechanisms for early brain folding. Recent findings indicate significant regional variations in brain tissue growth, while the role of these variations in cortical development remains unclear. In this study, we unprecedently explored how regional cortical growth affects brain folding patterns using computational simulation. We first developed growth models for typical cortical regions using machine learning (ML)-assisted symbolic regression, based on longitudinal real surface expansion and cortical thickness data from prenatal and infant brains derived from over 1,000 MRI scans of 735 pediatric subjects with ages ranging from 29 post-menstrual weeks to 24 months. These models were subsequently integrated into computational software to simulate cortical development with anatomically realistic geometric models. We comprehensively quantified the resulting folding patterns using multiple metrics such as mean curvature, sulcal depth, and gyrification index. Our results demonstrate that regional growth models generate complex brain folding patterns that more closely match actual brains structures, both quantitatively and qualitatively, compared to conventional uniform growth models. Growth magnitude plays a dominant role in shaping folding patterns, while growth trajectory has a minor influence. Moreover, multi-region models better capture the intricacies of brain folding than single-region models. Our results underscore the necessity and importance of incorporating regional growth heterogeneity into brain folding simulations, which could enhance early diagnosis and treatment of cortical malformations and neurodevelopmental disorders such as cerebral palsy and autism.

q-bio.NC↗

Quotients of extriangulated categories induced by selforthogonal subcategories

Let C be an extriangulated category. We prove that two quotient categories of extriangu?lated categories induced by selforthogonal subcategories are equivalent to module categories by restriction of two functors E and Hom, respectively. Moreover, if the selforthogonal sub?category is contravariantly finite, then one of the two quotient categories is abelian. This result can be regarded as a generalization of Demonet-Liu and Zhou-Zhu.

math.RA↗

Federated User Preference Modeling for Privacy-Preserving Cross-Domain Recommendation

Cross-domain recommendation (CDR) aims to address the data-sparsity problem by transferring knowledge across domains. Existing CDR methods generally assume that the user-item interaction data is shareable between domains, which leads to privacy leakage. Recently, some privacy-preserving CDR (PPCDR) models have been proposed to solve this problem. However, they primarily transfer simple representations learned only from user-item interaction histories, overlooking other useful side information, leading to inaccurate user preferences. Additionally, they transfer differentially private user-item interaction matrices or embeddings across domains to protect privacy. However, these methods offer limited privacy protection, as attackers may exploit external information to infer the original data. To address these challenges, we propose a novel Federated User Preference Modeling (FUPM) framework. In FUPM, first, a novel comprehensive preference exploration module is proposed to learn users' comprehensive preferences from both interaction data and additional data including review texts and potentially positive items. Next, a private preference transfer module is designed to first learn differentially private local and global prototypes, and then privately transfer the global prototypes using a federated learning strategy. These prototypes are generalized representations of user groups, making it difficult for attackers to infer individual information. Extensive experiments on four CDR tasks conducted on the Amazon and Douban datasets validate the superiority of FUPM over SOTA baselines. Code is available at https://github.com/Lili1013/FUPM.

cs.IR↗

Scalable Multivariate Fronthaul Quantization for Cell-Free Massive MIMO

The conventional approach to the fronthaul design for cell-free massive MIMO system follows the compress-and-precode (CP) paradigm. Accordingly, encoded bits and precoding coefficients are shared by the distributed unit (DU) on the fronthaul links, and precoding takes place at the radio units (RUs). Previous theoretical work has shown that CP can be potentially improved by a significant margin by precode-and-compress (PC) methods, in which all baseband processing is carried out at the DU, which compresses the precoded signals for transmission on the fronthaul links. The theoretical performance gain of PC methods are particularly pronounced when the DU implements multivariate quantization (MQ), applying joint quantization across the signals for all the RUs. However, existing solutions for MQ are characterized by a computational complexity that grows exponentially with the sum-fronthaul capacity from the DU to all RUs. This work sets out to design scalable MQ strategies for PC-based cell-free massive MIMO systems. For the low-fronthaul capacity regime, we present alpha-parallel MQ (alpha-PMQ), whose complexity is exponential only in the fronthaul capacity towards an individual RU, while performing close to full MQ. alpha-PMQ tailors MQ to the topology of the network by allowing for parallel local quantization steps for RUs that do not interfere too much with each other. For the high-fronthaul capacity regime, we then introduce neural MQ, which replaces the exhaustive search in MQ with gradient-based updates for a neural-network-based decoder, attaining a complexity that grows linearly with the sum-fronthaul capacity. Numerical results demonstrate that the proposed scalable MQ strategies outperform CP for both the low and high-fronthaul capacity regimes at the cost of increased computational complexity at the DU (but not at the RUs).

cs.IT↗

In-Field Gyroscope Autocalibration with Iterative Attitude Estimation

This paper presents an efficient in-field calibration method tailored for low-cost triaxial MEMS gyroscopes often used in healthcare applications. Traditional calibration techniques are challenging to implement in clinical settings due to the unavailability of high-precision equipment. Unlike the auto-calibration approaches used for triaxial MEMS accelerometers, which rely on local gravity, gyroscopes lack a reliable reference since the Earth's self-rotation speed is insufficient for accurate calibration. To address this limitation, we propose a novel method that uses manual rotation of the MEMS gyroscope to a specific angle (360°) as the calibration reference. This approach iteratively estimates the sensor's attitude without requiring any external equipment. Numerical simulations and empirical tests validate that the calibration error is low and that parameter estimation is unbiased. The method can be implemented in real-time on a low-energy microcontroller and completed in under 30 seconds. Comparative results demonstrate that the proposed technique outperforms existing state-of-the-art methods, achieving scale factor and bias errors of less than $2.5\times10^{-2}$ for LSM9DS1 and less than $1\times10^{-2}$ for ICM20948.

eess.SY↗

Robustness-Aware 3D Object Detection in Autonomous Driving: A Review and Outlook

In the realm of modern autonomous driving, the perception system is indispensable for accurately assessing the state of the surrounding environment, thereby enabling informed prediction and planning. The key step to this system is related to 3D object detection that utilizes vehicle-mounted sensors such as LiDAR and cameras to identify the size, the category, and the location of nearby objects. Despite the surge in 3D object detection methods aimed at enhancing detection precision and efficiency, there is a gap in the literature that systematically examines their resilience against environmental variations, noise, and weather changes. This study emphasizes the importance of robustness, alongside accuracy and latency, in evaluating perception systems under practical scenarios. Our work presents an extensive survey of camera-only, LiDAR-only, and multi-modal 3D object detection algorithms, thoroughly evaluating their trade-off between accuracy, latency, and robustness, particularly on datasets like KITTI-C and nuScenes-C to ensure fair comparisons. Among these, multi-modal 3D detection approaches exhibit superior robustness, and a novel taxonomy is introduced to reorganize the literature for enhanced clarity. This survey aims to offer a more practical perspective on the current capabilities and the constraints of 3D object detection algorithms in real-world applications, thus steering future research towards robustness-centric advancements.

cs.CV↗

Effective medium theory for embedded obstacles in electromagnetic scattering with applications

This paper focuses on the time-harmonic electromagnetic (EM) scattering problem in a general medium which may possess a nontrivial topological structure. We model this by an inhomogeneous and possibly anisotropic medium with embedded obstacles and the EM waves cannot penetrate inside the obstacles. Such a situation naturally arises in studying inverse EM scattering problems from complex mediums with partial boundary measurements, or inverse problems from EM mediums with metal inclusions. We develop a novel theoretical framework by showing that the embedded obstacles can be effectively approximated by a certain isotropic medium with a specific choice of material parameters. We derive sharp estimates to verify this effective approximation and also discuss the practical implications of our results to the inverse problems mentioned above, which are longstanding topics in inverse scattering theory.

math.AP↗

Model Based and Physics Informed Deep Learning Neural Network Structures

Neural Networks (NN) has been used in many areas with great success. When a NN's structure (Model) is given, during the training steps, the parameters of the model are determined using an appropriate criterion and an optimization algorithm (Training). Then, the trained model can be used for the prediction or inference step (Testing). As there are also many hyperparameters, related to the optimization criteria and optimization algorithms, a validation step is necessary before its final use. One of the great difficulties is the choice of the NN's structure. Even if there are many "on the shelf" networks, selecting or proposing a new appropriate network for a given data, signal or image processing, is still an open problem. In this work, we consider this problem using model based signal and image processing and inverse problems methods. We classify the methods in five classes, based on: i) Explicit analytical solutions, ii) Transform domain decomposition, iii) Operator Decomposition, iv) Optimization algorithms unfolding, and v) Physics Informed NN methods (PINN). Few examples in each category are explained.

cs.LG↗

Multimodal generative semantic communication based on latent diffusion model

In emergencies, the ability to quickly and accurately gather environmental data and command information, and to make timely decisions, is particularly critical. Traditional semantic communication frameworks, primarily based on a single modality, are susceptible to complex environments and lighting conditions, thereby limiting decision accuracy. To this end, this paper introduces a multimodal generative semantic communication framework named mm-GESCO. The framework ingests streams of visible and infrared modal image data, generates fused semantic segmentation maps, and transmits them using a combination of one-hot encoding and zlib compression techniques to enhance data transmission efficiency. At the receiving end, the framework can reconstruct the original multimodal images based on the semantic maps. Additionally, a latent diffusion model based on contrastive learning is designed to align different modal data within the latent space, allowing mm-GESCO to reconstruct latent features of any modality presented at the input. Experimental results demonstrate that mm-GESCO achieves a compression ratio of up to 200 times, surpassing the performance of existing semantic communication frameworks and exhibiting excellent performance in downstream tasks such as object classification and detection.

cs.CV↗

Accuracy and Consistency of LLMs in the Registered Dietitian Exam: The Impact of Prompt Engineering and Knowledge Retrieval

Large language models (LLMs) are fundamentally transforming human-facing applications in the health and well-being domains: boosting patient engagement, accelerating clinical decision-making, and facilitating medical education. Although state-of-the-art LLMs have shown superior performance in several conversational applications, evaluations within nutrition and diet applications are still insufficient. In this paper, we propose to employ the Registered Dietitian (RD) exam to conduct a standard and comprehensive evaluation of state-of-the-art LLMs, GPT-4o, Claude 3.5 Sonnet, and Gemini 1.5 Pro, assessing both accuracy and consistency in nutrition queries. Our evaluation includes 1050 RD exam questions encompassing several nutrition topics and proficiency levels. In addition, for the first time, we examine the impact of Zero-Shot (ZS), Chain of Thought (CoT), Chain of Thought with Self Consistency (CoT-SC), and Retrieval Augmented Prompting (RAP) on both accuracy and consistency of the responses. Our findings revealed that while these LLMs obtained acceptable overall performance, their results varied considerably with different prompts and question domains. GPT-4o with CoT-SC prompting outperformed the other approaches, whereas Gemini 1.5 Pro with ZS recorded the highest consistency. For GPT-4o and Claude 3.5, CoT improved the accuracy, and CoT-SC improved both accuracy and consistency. RAP was particularly effective for GPT-4o to answer Expert level questions. Consequently, choosing the appropriate LLM and prompting technique, tailored to the proficiency level and specific domain, can mitigate errors and potential risks in diet and nutrition chatbots.

cs.CL↗

MIMNet: Multi-Interest Meta Network with Multi-Granularity Target-Guided Attention for Cross-domain Recommendation

Cross-domain recommendation (CDR) plays a critical role in alleviating the sparsity and cold-start problem and substantially boosting the performance of recommender systems. Existing CDR methods prefer to either learn a common preference bridge shared by all users or a personalized preference bridge tailored for each user to transfer user preference from the source domain to the target domain. Although these methods significantly improve the recommendation performance, there are still some limitations. First, these methods usually assume a user only has a unique interest, while ignoring the fact that a user may interact with items with different interest preferences. Second, they learn transformed preference representation mainly relies on the source domain signals, while neglecting the rich information available in the target domain. To handle these issues, in this paper, we propose a novel method named Multi-interest Meta Network with Multi-granularity Target-guided Attention (MIMNet) for cross-domain recommendation. To be specific, we employ the capsule network to learn user multiple interests in the source domain, which will be fed into a meta network to generate multiple interest-level preference bridges. Then, we transfer user representations from the source domain to the target domain based on these multi-interest bridges. In addition, we introduce both fine-grained and coarse-grained target signals to aggregate user transformed interest-level representations by incorporating a novel multi-granularity target-guided attention network. We conduct extensive experimental results on three real-world CDR tasks, and the results show that our proposed approach MIMNet consistently outperforms all baseline methods. The source code of MIMNet is released at https://github.com/marqu22/MIMNet.

cs.IR↗

Towards Faithful Explanations: Boosting Rationalization with Shortcuts Discovery

The remarkable success in neural networks provokes the selective rationalization. It explains the prediction results by identifying a small subset of the inputs sufficient to support them. Since existing methods still suffer from adopting the shortcuts in data to compose rationales and limited large-scale annotated rationales by human, in this paper, we propose a Shortcuts-fused Selective Rationalization (SSR) method, which boosts the rationalization by discovering and exploiting potential shortcuts. Specifically, SSR first designs a shortcuts discovery approach to detect several potential shortcuts. Then, by introducing the identified shortcuts, we propose two strategies to mitigate the problem of utilizing shortcuts to compose rationales. Finally, we develop two data augmentations methods to close the gap in the number of annotated rationales. Extensive experimental results on real-world datasets clearly validate the effectiveness of our proposed method.

cs.LG↗

Approximate Partially Decentralized Linear EZF Precoding for Massive MU-MIMO Systems

Massive multi-user multiple-input multiple-output (MU-MIMO) systems enable high spatial resolution, high spectral efficiency, and improved link reliability compared to traditional MIMO systems due to the large number of antenna elements deployed at the base station (BS). Nevertheless, conventional massive MU-MIMO BS transceiver designs rely on centralized linear precoding algorithms, which entail high interconnect data rates and a prohibitive complexity at the centralized baseband processing unit. In this paper, we consider an MU-MIMO system, where each user device is served with multiple independent data streams in the downlink. To address the aforementioned challenges, we propose a novel decentralized BS architecture, and develop a novel decentralized precoding algorithm based on eigen-zero-forcing (EZF). Our proposed approach relies on parallelizing the baseband processing tasks across multiple antenna clusters at the BS, while minimizing the interconnection requirements between the clusters, and is shown to closely approach the performance of centralized EZF.

eess.SP↗