SearcharxivSearch

arXiv subjects

Jie Cui

Publications and source records attributed to Jie Cui.

At least 19 recordsLinked to original sources

Confusion-Geometry Rebalancing for Long-Tailed Adversarial Training

Adversarial training under long tailed distributions suffers from a dual imbalance: the class imbalance skews the training objective toward head classes, and the adversarial inner maximization may further amplify this bias. Existing methods mitigate this issue by correcting class priors or adapting class wise robust supervision, yet they treat each class in isolation and fail to identify which boundaries drive long tailed collapse. We propose a Confusion Geometry Rebalancing method (CGRm) for long tail adversarial training, a plug in framework that leverages directed robust errors as training signals. CGRm leverages periodic robust evaluations to derive source class loss weights, class wise robust coefficients, and a directed confusion geometry graph. The method then couples feedback weighted robust optimization with graph guided margin correction, thereby boosting the robustness of vulnerable classes and sharpening the critical boundaries that drive long tailed performance degradation. Experiments on long tailed benchmarks show that CGRm achieves consistent robust performance gains over existing methods, with ablations validating the contribution of each component. We provide the code in the supplement.

cs.LG

ViroBench: Benchmarking Nucleotide Foundation Models on Viral Genomics Tasks

Nucleotide sequences constitute the fundamental genetic basis of biological systems, rendering viral genomic analysis critical for biomedical advancement. Despite progress in biological foundation models, specifically nucleotide foundation models (NFMs), the field lacks a unified standard for viral genomics to facilitate community development and enforce biosecurity constraints. To address this, we introduce ViroBench, the first comprehensive and large-scale benchmark specifically designed for NFMs in viral settings. ViroBench evaluates models across two critical dimensions: biological understanding and latent biosecurity risk, covering 18 diverse scenarios within 4 task types. Extensive evaluation of 66 NFMs across diverse architectures yields three critical conclusions. Firstly, NFMs exhibit a performance degradation in biological understanding under phylogenetic and temporal shifts, indicating weak extrapolation capabilities. Secondly, generation tasks reveal a decoupling between statistical likelihood and biological functional validity, posing latent biosecurity risks. Thirdly, controlled ablation studies reveal that taxonomic diversity in pretraining data outweighs parameter scale. Specifically, a lightweight baseline trained on diverse data achieves a 67.5% performance gain over its original model. Overall, ViroBench provides interpretable, diagnostic evaluations and a reproducible measurement framework for future research on viral nucleotide foundation models. The datasets and code are publicly available at https://github.com/QIANJINYDX/ViroBench.

cs.LG

TERS-ABNet: A Deep Learning Approach for Automated Single-Molecule Structure Reconstruction with Atomic Precision from TERS Mapping

Determining the chemical structure for a single molecule on surface from spectroscopic data represents a challenging high-dimensional inverse problem. Tip-enhanced Raman spectroscopy (TERS) enables chemically specific imaging of single molecules with sub-nanometer spatial resolution, yet reconstructing complete molecular structures from TERS maps remains difficult owing to the ambiguous vibrational signatures and reliance on expert interpretation. Here, we introduce TERS-ABNet, a deep-learning framework that formulates single-molecule structure determination from spectroscopic images as an image-to-graph inference task. Using a "two-track" architecture, the model jointly predicts probabilistic atom and bond maps, enabling direct construction of explicit atom-bond graphs without relying on predefined chemical rules. Trained on simulated datasets, TERS-ABNet achieves about 94% atom-type classification accuracy (with a mean coordinate error of about 0.23 \AA), enabling to reliably recovering molecular connectivity and fully reconstruct single-molecule structure from its TERS maps. The framework generalizes across varying spatial resolutions and structural complexity through transfer learning, and successfully reconstructs the atomic structure of a single porphyrin molecule from experimental TERS data. This work establishes a general deep-learning strategy for inferring explicit atom-bond graph representations from high-dimensional spectroscopic imaging data, providing a new pathway towards automated molecular structure determination in nanoscale characterization.

physics.chem-ph

TreeMind: Automatically Reproducing Android Bug Reports via LLM-empowered Monte Carlo Tree Search

Automatically reproducing Android app crashes from textual bug reports is challenging, particularly when the reports are incomplete and the modern UI exhibits high combinatorial complexity. Existing approaches based solely on reinforcement learning or large language models (LLMs) exhibit limitations in such scenarios. They struggle to infer unobserved steps and reconstruct the underlying user action sequences to navigate the vast UI interaction space, primarily due to limited goal-directed reasoning and planning. We present TreeMind, a novel technique that integrates LLMs with an adapted Monte Carlo Tree Search (MCTS) algorithm to achieve strategic UI exploration in bug reproduction. To the best of our knowledge, this is the first work to combine external decision-making with LLM semantic reasoning for reliable and accurate reproduction processes. We formulate the reproduction task as a target-driven search problem, leveraging MCTS as the core planning mechanism to iteratively refine action sequences. To enhance MCTS with semantic reasoning, we introduce two LLM-guided agents with distinct roles: Expander generates top-k promising actions based on the current UI state and exploration history, while Simulator estimates the likelihood that each candidate action leads toward successful reproduction by additionally leveraging dynamic environment feedback. By incorporating multi-modal UI inputs and tailored prompting strategies, TreeMind performs feedback-aware navigation that identifies essential user actions and incrementally reconstructs reproduction paths. We evaluate TreeMind on a dataset of 93 real-world Android bug reports from three widely-used benchmarks. Experimental results show that it significantly outperforms four state-of-the-art baselines, including ReBL, ReActDroid, AdbGPT, and ReproBot, in reproduction success rate.

cs.SE

MalFlows: Context-aware Fusion of Heterogeneous Flow Semantics for Android Malware Detection

Static analysis, a fundamental technique in Android app examination, enables the extraction of control flows, data flows, and inter-component communications (ICCs), all of which are essential for malware detection. However, existing methods struggle to leverage the semantic complementarity across different types of flows for representing program behaviors, and their context-unaware nature further hinders the accuracy of cross-flow semantic integration. We propose and implement MalFlows, a novel technique that achieves context-aware fusion of heterogeneous flow semantics for Android malware detection. Our goal is to leverage complementary strengths of the three types of flow-related information for precise app profiling. We adopt a heterogeneous information network (HIN) to model the rich semantics across these program flows. We further propose flow2vec, a context-aware HIN embedding technique that distinguishes the semantics of HIN entities as needed based on contextual constraints across different flows and learns accurate app representations through the joint use of multiple meta-paths. The representations are finally fed into a channel-attention-based deep neural network for malware classification. To the best of our knowledge, this is the first study to comprehensively aggregate the strengths of diverse flow-related information for assessing maliciousness within apps. We evaluate MalFlows on a large-scale dataset comprising over 20 million flow instances extracted from more than 31,000 real-world apps. Experimental results demonstrate that MalFlows outperforms representative baselines in Android malware detection, and meanwhile, validate the effectiveness of flow2vec in accurately learning app representations from the HIN constructed over the heterogeneous flows.

cs.CR

Impact of Radio Frequency Power on Columnar and Filamentary Modes in Atmospheric Pressure Very Low Frequency Plasma within Pores

The impact of radio frequency (RF) power on columnar and filamentary modes of very low frequency (VLF) plasma within pores is investigated in this work. The 12.5 kHz VLF discharge under various RF powers (13.56 MHz) was analyzed using optical photography and current-voltage measurements. Two-dimensional electron densities were derived using optical emission spectroscopy combined with collisional radiation modeling methods. It is found that RF power and very low frequency voltage (VVLF) significantly influence the plasma and its discharge modes within the 200 {\mu}m pore. Under low VVLF conditions, the plasma is more intense within the pore, and the discharge mode is columnar discharge. With increasing RF power, the reciprocal motion of electrons counteracts the local enhancement effect of columnar discharge, the discharge transforms into RF discharge, the pore is completely wrapped by the sheath, and the plasma inside is gradually quenched. Under high VVLF conditions, the electron density within the pore is low and the discharge mode is filamentary discharge. RF introduction reduces plasma intensity within the pores firstly. As RF power increases, more ion trapping in the pore increases the field strength distortion and enhances the plasma intensity inside the pore, this enhancement effects becomes more obvious with increasing RF power. In addition, the above effects were observed for all pore widths from 100 um to 1000 um. These findings provide key insights for controlling plasma in pores and offer new methodologies for plasma technology applications.

physics.plasm-ph

Hide in Plain Sight: Clean-Label Backdoor for Auditing Membership Inference

Membership inference attacks (MIAs) are critical tools for assessing privacy risks and ensuring compliance with regulations like the General Data Protection Regulation (GDPR). However, their potential for auditing unauthorized use of data remains under explored. To bridge this gap, we propose a novel clean-label backdoor-based approach for MIAs, designed specifically for robust and stealthy data auditing. Unlike conventional methods that rely on detectable poisoned samples with altered labels, our approach retains natural labels, enhancing stealthiness even at low poisoning rates. Our approach employs an optimal trigger generated by a shadow model that mimics the target model's behavior. This design minimizes the feature-space distance between triggered samples and the source class while preserving the original data labels. The result is a powerful and undetectable auditing mechanism that overcomes limitations of existing approaches, such as label inconsistencies and visual artifacts in poisoned samples. The proposed method enables robust data auditing through black-box access, achieving high attack success rates across diverse datasets and model architectures. Additionally, it addresses challenges related to trigger stealthiness and poisoning durability, establishing itself as a practical and effective solution for data auditing. Comprehensive experiments validate the efficacy and generalizability of our approach, outperforming several baseline methods in both stealth and attack success metrics.

cs.CR

CLMIA: Membership Inference Attacks via Unsupervised Contrastive Learning

Since machine learning model is often trained on a limited data set, the model is trained multiple times on the same data sample, which causes the model to memorize most of the training set data. Membership Inference Attacks (MIAs) exploit this feature to determine whether a data sample is used for training a machine learning model. However, in realistic scenarios, it is difficult for the adversary to obtain enough qualified samples that mark accurate identity information, especially since most samples are non-members in real world applications. To address this limitation, in this paper, we propose a new attack method called CLMIA, which uses unsupervised contrastive learning to train an attack model without using extra membership status information. Meanwhile, in CLMIA, we require only a small amount of data with known membership status to fine-tune the attack model. Experimental results demonstrate that CLMIA performs better than existing attack methods for different datasets and model structures, especially with data with less marked identity information. In addition, we experimentally find that the attack performs differently for different proportions of labeled identity information for member and non-member data. More analysis proves that our attack method performs better with less labeled identity information, which applies to more realistic scenarios.

cs.LG

Detecting Android Malware by Visualizing App Behaviors from Multiple Complementary Views

Deep learning has emerged as a promising technology for achieving Android malware detection. To further unleash its detection potentials, software visualization can be integrated for analyzing the details of app behaviors clearly. However, facing increasingly sophisticated malware, existing visualization-based methods, analyzing from one or randomly-selected few views, can only detect limited attack types. We propose and implement LensDroid, a novel technique that detects Android malware by visualizing app behaviors from multiple complementary views. Our goal is to harness the power of combining deep learning and software visualization to automatically capture and aggregate high-level features that are not inherently linked, thereby revealing hidden maliciousness of Android app behaviors. To thoroughly comprehend the details of apps, we visualize app behaviors from three related but distinct views of behavioral sensitivities, operational contexts and supported environments. We then extract high-order semantics based on the views accordingly. To exploit semantic complementarity of the views, we design a deep neural network based model for fusing the visualized features from local to global based on their contributions to downstream tasks. A comprehensive comparison with five baseline techniques is performed on datasets of more than 51K apps in three real-world typical scenarios, including overall threats, app evolution and zero-day malware. The experimental results show that the overall performance of LensDroid is better than the baseline techniques. We also validate the complementarity of the views and demonstrate that the multi-view fusion in LensDroid enhances Android malware detection.

cs.CR

DTN: Deep Multiple Task-specific Feature Interactions Network for Multi-Task Recommendation

Neural-based multi-task learning (MTL) has been successfully applied to many recommendation applications. However, these MTL models (e.g., MMoE, PLE) did not consider feature interaction during the optimization, which is crucial for capturing complex high-order features and has been widely used in ranking models for real-world recommender systems. Moreover, through feature importance analysis across various tasks in MTL, we have observed an interesting divergence phenomenon that the same feature can have significantly different importance across different tasks in MTL. To address these issues, we propose Deep Multiple Task-specific Feature Interactions Network (DTN) with a novel model structure design. DTN introduces multiple diversified task-specific feature interaction methods and task-sensitive network in MTL networks, enabling the model to learn task-specific diversified feature interaction representations, which improves the efficiency of joint representation learning in a general setup. We applied DTN to our company's real-world E-commerce recommendation dataset, which consisted of over 6.3 billion samples, the results demonstrated that DTN significantly outperformed state-of-the-art MTL models. Moreover, during online evaluation of DTN in a large-scale E-commerce recommender system, we observed a 3.28% in clicks, a 3.10% increase in orders and a 2.70% increase in GMV (Gross Merchandise Value) compared to the state-of-the-art MTL models. Finally, extensive offline experiments conducted on public benchmark datasets demonstrate that DTN can be applied to various scenarios beyond recommendations, enhancing the performance of ranking models.

cs.IR

M${}^2$NuFFT: A Computationally Efficient Suboptimal Power Spectrum Estimator for Fast Exploration of Nonuniformly Sampled Time Series

Nonuniformly sampled signals are prevalent in real-world applications. However, estimating their power spectra from finite samples poses a significant challenge. The optimal solution-Bronez Generalized Prolate Spheroidal Sequence (GPSS) by solving the associated Generalized Eigenvalue Problem (GEP)-is computationally intensive and thus impractical for large datasets. This paper describes a fast, nonparametric method: Multiband-Multitaper Nonuniform Fast Fourier Transform (M${}^2$NuFFT), which substantially reduces computational burden while maintaining statistical efficiency. The algorithm partitions the signal frequency band into multiple sub-bands. Within each sub-band, optimal tapers are computed at a nominal analysis band and shifted to other analysis bands using the Nonuniform Fast Fourier Transform (NuFFT), avoiding repeated GEP computations. Spectral power within the analysis band is then estimated as the average power across the taper outputs. For the special case where the nominal band is centered at zero frequency, tapers can be approximated via cubic spline interpolation of Discrete Prolate Spheroidal Sequence (DPSS), eliminating GEP computation entirely. This reduces the complexity from $O(N^4)$ to $O(N \log N + N \log(1/\epsilon))$. Statistical properties of the estimator, assessed using Bronez GPSS theory, reveal that the bias and variance bound of the M2NuFFT estimator are identical to those of the optimal estimator. Additionally, the degradation of bias bound indicates deviation from optimality. Finally, we propose an extension of Thomson F-test to test periodicity in nonuniform samples. The estimator's performance is validated through simulation and real-world data, demonstrating its practical applicability. The MATLAB code of the fast algorithm is available on GitHub (https://github.com/jiecui/mtnufft).

eess.SP

An ultraviolet photodetector based on conductive hydrogenated TiO$_2$ film prepared by radio frequency atmospheric pressure plasma

The growing demand for real-time ultraviolet (UV) monitoring calls for a simple, rapid, and low-cost strategy to prepare UV photodetectors. We prepare a wearable real-time UV photodetector based on hydrogenated titanium dioxide film synthesized by radio frequency atmospheric pressure plasma. The conductivity of our hydrogenated titanium dioxide is improved to 10.2 S cm$^{-1}$, 9 orders of magnitude higher than that of pristine titanium dioxide after 10 min plasma treatment. Plasma hydrogenation disrupts the surface crystal structure, introducing oxygen vacancies (OVs) that create self-doped titanium(III) and titanium (II) species. First-principles calculations indicate the OVs raise the Fermi level of TiO$_2$ and distort the lattice nearby. Our optimized film has a distinctive periodic switching characteristic under intermittent illumination and good responsivity from 280 - 400 nm, peaking at 632.35 mA W^{-1}$ at 365 nm. The fabricated wearable sensor based on the optimized film effectively performs the monitoring of the daily variation of ambient UV intensity in three typical weather types and transferring its data to a smartphone via Wi-Fi.

physics.plasm-ph

Manipulating Spin Chirality of Magnetic Skyrmion Bubbles by In-Plane Re-versed Magnetic Fields in (Mn$_{1-x}$Ni$_x$)$_{65}$Ga$_{35}$ ($x = 0.45$) magnet

Understanding the dynamics of the magnetic skyrmion, a particle-like topologically stable spin texture, and its response dynamics to external fields are indis-pensable for the applications in spintronic devices. In this letter, the Lorentz transmis-sion electron microscopy (LTEM) was used to investigate the spin chirality of the mag-netic skyrmion bubbles (SKBs) in the centrosymmetric magnet MnNiGa at room tem-perature. The reversal of SKBs excited by the in-plane magnetic field has been revealed. Moreover, the collective behavior of interacting spin chirality can be manipulated by reversing the directions of the magnetic fields on a wedge-shaped thin plate. The dy-namic behavior of the bubbles at different position of the thin plate has been explored with the micromagnetic simulation, indicating a non-uniform and nontrivial dynamic magnetization on the surfaces and center of the thin plate during the spin chirality re-versal. The results suggest that the controllable symmetry breaking of the SKBs arising from thickness variation provides an ability to manipulate the collective behavior of the spin chirality with small external fields, leading to a promising application in nonvola-tile spintronic devices for magnetic skyrmions.

physics.app-ph

Magnetic hard nanobubble: a possible magnetization structure behind the bi-skyrmion

Transport of intensity equation (TIE) has been applied to process the simulated and experimental images of the magnetic hard nanobubbles, which were acquired in the Lorentz transmission electron microscope (LTEM). Systematic studies demonstrated that the processing parameter in TIE can modulate the features of the retrieved magnetization and induce the bi-spiral structures which may be identified as the bi-skyrmions.

cond-mat.mtrl-sci

Differentially Private Double Spectrum Auction with Approximate Social Welfare Maximization

Spectrum auction is an effective approach to improving spectrum utilization, by leasing idle spectrum from primary users to secondary users. Recently, a few differentially private spectrum auction mechanisms have been proposed, but, as far as we know, none of them addressed the differential privacy in the setting of double spectrum auctions. In this paper, we combine the concept of differential privacy with double spectrum auction design, and present a Differentially private Double spectrum auction mechanism with approximate Social welfare Maximization (DDSM). Specifically, we design the mechanism by employing the exponential mechanism to select clearing prices for the double spectrum auction with probabilities exponentially proportional to the related social welfare values, and then improve the mechanism in several aspects like the designs of the auction algorithm, the utility function and the buyer grouping algorithm. Through theoretical analysis, we prove that DDSM achieves differential privacy, approximate truthfulness, approximate social welfare maximization. Extensive experimental evaluations show that DDSM achieves a good performance in term of social welfare.

cs.CR

Making Double Spectrum Auction Practical: Both Privacy and Efficiency Matter

Truthful spectrum auction is believed to be an effective method for spectrum redistribution. However, privacy concerns have largely hampered the practical applications of truthful spectrum auctions. In this paper, to make the applications of double spectrum auctions practical, we present a privacy-preserving and socially efficient double spectrum auction design, SDSA. Specifically, by combining three security techniques: homomorphic encryption, secret sharing and garbled circuits, we design a secure two-party protocol computing a socially efficient double spectrum auction, TDSA, without leaking any information about sellers' requests or buyers' bids beyond the auction outcome. We give the formal security definition in our context, and theoretically prove the security that our design achieves. Experimental results show that our design is also efficient in performance, even for large-scale double spectrum auctions.

cs.CR

Linear $(2,p,p)$-AONTs do Exist

A $(t,s,v)$-all-or-nothing transform (AONT) is a bijective mapping defined on $s$-tuples over an alphabet of size $v$, which satisfies that if any $s-t$ of the $s$ outputs are given, then the values of any $t$ inputs are completely undetermined. When $t$ and $v$ are fixed, to determine the maximum integer $s$ such that a $(t,s,v)$-AONT exists is the main research objective. In this paper, we solve three open problems proposed in [IEEE Trans. Inform. Theory 64 (2018), 3136-3143.] and show that there do exist linear $(2,p,p)$-AONTs. Then for the size of the alphabet being a prime power, we give the first infinite class of linear AONTs which is better than the linear AONTs defined by Cauchy matrices. Besides, we also present a recursive construction for general AONTs and a new relationship between AONTs and orthogonal arrays.

cs.IT

Biosignal Analysis with Matching-Pursuit Based Adaptive Chirplet Transform

Chirping phenomena, in which the instantaneous frequencies of a signal change with time, are abundant in signals related to biological systems. Biosignals are non-stationary in nature and the time-frequency analysis is a viable tool to analyze them. It is well understood that Gaussian chirplet function is critical in describing chirp signals. Despite the theory of adaptive chirplet transform (ACT) has been established for more than two decades and is well accepted in the community of signal processing, application of ACT to bio-/biomedical signal analysis is still quite limited, probably because that the power of ACT, as an emerging tool for biosignal analysis, has not yet been fully appreciated by the researchers in the field of biomedical engineering. In this paper, we describe a novel ACT algorithm based on the "coarse-refinement" scheme. Namely, the initial estimate of a chirplet is implemented with the matching-pursuit (MP) algorithm and subsequently it is refined using the expectation-maximization (EM) algorithm, which we coin as MPEM algorithm. We emphasize the robustness enhancement of the algorithm in face of noise, which is important to biosignal analysis, as they are usually embedded in strong background noise. We then demonstrate the capability of our algorithm by applying it to the analysis of representative biosignals, including visual evoked potentials (bioelectrical signals), audible heart sounds and bat ultrasonic echolocation signals (bioacoustic signals), and human speech. The results show that the MPEM algorithm provides more compact representation of signals under investigation and clearer visualization of their time-frequency structures, indicating considerable promise of ACT in biosignal analysis. The MATLAB code repository is hosted on GitHub for free download (https://github.com/jiecui/mpact).

eess.SP