arXiv subjects

Yang Liu

Publications and source records attributed to Yang Liu.

At least 1,063 records · Page 59Linked to original sources

arXiv2025

Orbital-selective charge transfer drives two-step negative thermal expansion structural transitions in PbTa2Se4

The negative thermal expansion (NTE) effect has been found generally combined with structural phase transitions. However, the charge and orbital freedoms of the NTE has not been well studied. This study employs angle-resolved photoemission spectroscopy and first-principles calculations to elucidate the charge and orbital kinetics of the anomalous two-step negative thermal expansion structural phase transitions in PbTa2Se4. As the temperature decreases, each transition undergoes a similar block-layer sliding, although the charge transfer behaviors differ significantly. During the first transition, charge is mainly transferred from the Pb 6pz orbital to an M-shaped band below the Fermi level, barely altering the Fermi surface. In contrast, the second transition involves modifications to both the Fermi surface and charge-transfer orbitals, with charge selectively transferred from Pb 6px/py orbitals to Ta 5dz2 orbitals and a decrease of the Fermi pockets formed by Pb 6px/py orbitals. Furthermore, a small pressure can easily tune the base structure phase among the three phases and the corresponding superconductivity. Therefore, our findings reveal that the orbital-selective charge transfer drives the unusual structure transition in PbTa2Se4, offering new insights into the NTE mechanisms and providing a unique window to study the pressure-tuned superconductivity in this metal-intercalated transition chalcogenides.

cond-mat.mtrl-sci↗

arXiv2025

MAAD: Automate Software Architecture Design through Knowledge-Driven Multi-Agent Collaboration

Software architecture design is a critical, yet inherently complex and knowledge-intensive phase of software development. It requires deep domain expertise, development experience, architectural knowledge, careful trade-offs among competing quality attributes, and the ability to adapt to evolving requirements. Traditionally, this process is time-consuming and labor-intensive, and relies heavily on architects, often resulting in limited design alternatives, especially under the pressures of agile development. While Large Language Model (LLM)-based agents have shown promising performance across various SE tasks, their application to architecture design remains relatively scarce and requires more exploration, particularly in light of diverse domain knowledge and complex decision-making. To address the challenges, we proposed MAAD (Multi-Agent Architecture Design), an automated framework that employs a knowledge-driven Multi-Agent System (MAS) for architecture design. MAAD orchestrates four specialized agents (i.e., Analyst, Modeler, Designer and Evaluator) to collaboratively interpret requirements specifications and produce architectural blueprints enriched with quality attributes-based evaluation reports. We then evaluated MAAD through a case study and comparative experiments against MetaGPT, a state-of-the-art MAS baseline. Our results show that MAAD's superiority lies in generating comprehensive architectural components and delivering insightful and structured architecture evaluation reports. Feedback from industrial architects across 11 requirements specifications further reinforces MAAD's practical usability. We finally explored the performance of the MAAD framework with three LLMs (GPT-4o, DeepSeek-R1, and Llama 3.3) and found that GPT-4o exhibits better performance in producing architecture design, emphasizing the importance of LLM selection in MAS-driven architecture design.

cs.SE↗

arXiv2025

Measuring and Explaining the Effects of Android App Transformations in Online Malware Detection

It is well known that antivirus engines are vulnerable to evasion techniques (e.g., obfuscation) that transform malware into its variants. However, it cannot be necessarily attributed to the effectiveness of these evasions, and the limits of engines may also make this unsatisfactory result. In this study, we propose a data-driven approach to measure the effect of app transformations to malware detection, and further explain why the detection result is produced by these engines. First, we develop an interaction model for antivirus engines, illustrating how they respond with different detection results in terms of varying inputs. Six app transformation techniques are implemented in order to generate a large number of Android apps with traceable changes. Then we undertake a one-month tracking of app detection results from multiple antivirus engines, through which we obtain over 971K detection reports from VirusTotal for 179K apps in total. Last, we conduct a comprehensive analysis of antivirus engines based on these reports from the perspectives of signature-based, static analysis-based, and dynamic analysis-based detection techniques. The results, together with 7 highlighted findings, identify a number of sealed working mechanisms occurring inside antivirus engines and what are the indicators of compromise in apps during malware detection.

cs.CR↗

arXiv2025

NeuSemSlice: Towards Effective DNN Model Maintenance via Neuron-level Semantic Slicing

Deep Neural networks (DNNs), extensively applied across diverse disciplines, are characterized by their integrated and monolithic architectures, setting them apart from conventional software systems. This architectural difference introduces particular challenges to maintenance tasks, such as model restructure (e.g., model compression), re-adaptation (e.g., fitting new samples), and incremental development (e.g., continual knowledge accumulation). Prior research addresses these challenges by identifying task-critical neuron layers, and dividing neural networks into semantically-similar sequential modules. However, such layer-level approaches fail to precisely identify and manipulate neuron-level semantic components, restricting their applicability to finer-grained model maintenance tasks. In this work, we implement NeuSemSlice, a novel framework that introduces the semantic slicing technique to effectively identify critical neuron-level semantic components in DNN models for semantic-aware model maintenance tasks. Specifically, semantic slicing identifies, categorizes and merges critical neurons across different categories and layers according to their semantic similarity, enabling their flexibility and effectiveness in the subsequent tasks. For semantic-aware model maintenance tasks, we provide a series of novel strategies based on semantic slicing to enhance NeuSemSlice. They include semantic components (i.e., critical neurons) preservation for model restructure, critical neuron tuning for model re-adaptation, and non-critical neuron training for model incremental development. A thorough evaluation has demonstrated that NeuSemSlice significantly outperforms baselines in all three tasks.

cs.LG↗

arXiv2025

Max-Min Rate Optimization for Multigroup Multicast MISO Systems Via Novel Transmissive RIS Transceiver

This paper investigates a novel transmissive reconfigurable intelligent surface (RIS) transceiver architectureenabled multigroup multicast downlink communication system. Under this setup, an optimization problem is formulated to maximize the minimum rate of users across all groups, subject to the maximum available power of each RIS unit. Due to the nondifferentiable nature of the objective function, the max-min rate problem is challenging to solve. To tackle this difficult problem, we develop an iterative solution by leveraging the successive convex approximation (SCA) and the penalty function method. However, the above approach has high computational complexity and may lead to compromised performance. To overcome these drawbacks, we design an efficient second-order cone programming (SOCP)-based method using the weighted minimum mean squared error (WMMSE) framework to reduce computational complexity. Furthermore, to further reduce the computational complexity, we also propose a low-complexity and solver-free algorithm that analytically updates all variables by combining the smooth approximation theory and the majorization-minimization (MM) method. Numerical results are provided to verify the convergence and effectiveness of our proposed three algorithms. It is also demonstrated that the SOCP-based method outperforms the penalty-based algorithm in terms of both the achieved min rate and the computational complexity. In contrast, the lowcomplexity design achieves significantly lower complexity with only slightly degraded performance.

eess.SP↗

arXiv2025

GFM-Planner: Perception-Aware Trajectory Planning with Geometric Feature Metric

Like humans who rely on landmarks for orientation, autonomous robots depend on feature-rich environments for accurate localization. In this paper, we propose the GFM-Planner, a perception-aware trajectory planning framework based on the geometric feature metric, which enhances LiDAR localization accuracy by guiding the robot to avoid degraded areas. First, we derive the Geometric Feature Metric (GFM) from the fundamental LiDAR localization problem. Next, we design a 2D grid-based Metric Encoding Map (MEM) to efficiently store GFM values across the environment. A constant-time decoding algorithm is further proposed to retrieve GFM values for arbitrary poses from the MEM. Finally, we develop a perception-aware trajectory planning algorithm that improves LiDAR localization capabilities by guiding the robot in selecting trajectories through feature-rich areas. Both simulation and real-world experiments demonstrate that our approach enables the robot to actively select trajectories that significantly enhance LiDAR localization accuracy.

cs.RO↗

arXiv2025

The Event Rate and Luminosity Function of Fermi/GBM Gamma-Ray Bursts

Luminosity function and event rate of Gamma-Ray Bursts (GRBs) are easily biased by the instrument and selection effects. We select 115 Fermi/GBM GRBs with good spectra fitted by a smoothly broken power-law function. The $τ$-statistic method is used to describe how the luminosity evolves with redshift. The non-parametric Lynden-Bell's c$^{-}$ method has been applied to get the cumulative luminosity function and event rate which is compared with the star formation history. How the selection and instrument effects bias the deduced event rate has been carefully studied. We find that the event rate always exceeds the star formation rate (SFR) at lower redshift and matches with each other at higher redshift, which is independent of energy bands and consistent with previous findings of other satellites. Furthermore, it is found that sample completeness does not affect the deduced event rate too much as mentioned for the Swift lGRBs in Dong et al.. A triple power-law function has been used to fit the cumulative flux distribution and categorize the total sample into three subsamples of bright, medium and faint GRBs. We find that the event rates of bright GRBs, unlike medium and faint ones, comply with the SFR ideally, which indicates that these bright GRBs with higher luminosity are possibly produced from the core-collapse of massive stars.

astro-ph.HE↗

arXiv2025

ACFIX: Guiding LLMs with Mined Common RBAC Practices for Context-Aware Repair of Access Control Vulnerabilities in Smart Contracts

Smart contracts are susceptible to various security issues, among which access control (AC) vulnerabilities are particularly critical. While existing research has proposed multiple detection tools, the automatic and appropriate repair of AC vulnerabilities in smart contracts remains a challenge. Unlike commonly supported vulnerability types by existing repair tools, such as reentrancy, which are usually fixed by template-based approaches, the main obstacle of AC lies in identifying the appropriate roles or permissions amid a long list of non-AC-related source code to generate proper patch code, a task that demands human-level intelligence. Leveraging recent advancements in large language models (LLMs), we employ the state-of-the-art GPT-4 model and enhance it with a novel approach called ACFIX. The key insight is that we can mine common AC practices for major categories of code functionality and use them to guide LLMs in fixing code with similar functionality. To this end, ACFIX involves both offline and online phases. First, during the offline phase, ACFIX mines a taxonomy of common Role-based Access Control (RBAC) practices from 344,251 on-chain contracts, categorizing 49 role-permission pairs from the top 1,000 pairs mined. Second, during the online phase, ACFIX tracks AC-related elements across the contract and uses this context information along with a Chain-of-Thought pipeline to guide LLMs in identifying the most appropriate role-permission pair for the subject contract and subsequently generating a suitable patch. This patch will then undergo a validity and effectiveness check. To evaluate ACFIX, we built the first benchmark dataset of 118 real-world AC vulnerabilities, and our evaluation revealed that ACFIX successfully repaired 94.92% of them. This represents a significant improvement compared to the baseline GPT-4, which achieved only 52.54%.

cs.SE↗

arXiv2025

A Vision for Auto Research with LLM Agents

This paper introduces Agent-Based Auto Research, a structured multi-agent framework designed to automate, coordinate, and optimize the full lifecycle of scientific research. Leveraging the capabilities of large language models (LLMs) and modular agent collaboration, the system spans all major research phases, including literature review, ideation, methodology planning, experimentation, paper writing, peer review response, and dissemination. By addressing issues such as fragmented workflows, uneven methodological expertise, and cognitive overload, the framework offers a systematic and scalable approach to scientific inquiry. Preliminary explorations demonstrate the feasibility and potential of Auto Research as a promising paradigm for self-improving, AI-driven research processes.

cs.AI↗

arXiv2025

Maximum likelihood abundance estimation from capture-recapture data when covariates are missing at random

In capture-recapture experiments, individual covariates may be subject to missing, especially when the number of times of being captured is small. When the covariate information is missing at random, the inverse probability weighting method and multiple imputation method are widely used to obtain the point estimators of the abundance. These point estimators are then used to construct the Wald-type confidence intervals for the abundance. However, such intervals may have severely inaccurate coverage probabilities and their lower limits can be even less than the number of individuals ever captured. In this paper, we proposed a maximum empirical likelihood estimation approach for the abundance in presence of missing covariates. We show that the maximum empirical likelihood estimator is asymptotically normal, and that the empirical likelihood ratio statistic for abundance has a chisquare limiting distribution with one degree of freedom. Simulations indicate that the proposed estimator has smaller mean square error than the existing estimators, and the proposed empirical likelihood ratio confidence interval usually has more accurate coverage probabilities than the existing Wald-type confidence intervals. We illustrate the proposed method by analyzing the bird species yellow-bellied prinia collected in Hong Kong.

stat.ME↗

arXiv2025

Slot: Provenance-Driven APT Detection through Graph Reinforcement Learning

Advanced Persistent Threats (APTs) represent sophisticated cyberattacks characterized by their ability to remain undetected within the victim system for extended periods, aiming to exfiltrate sensitive data or disrupt operations. Existing detection approaches often struggle to effectively identify these complex threats, construct the attack chain for defense facilitation, or resist adversarial attacks. To overcome these challenges, we propose Slot, an advanced APT detection approach based on provenance graphs and graph reinforcement learning. Slot excels in uncovering multi-level hidden relationships, such as causal, contextual, and indirect connections, among system behaviors through provenance graph mining. By pioneering the integration of graph reinforcement learning, Slot dynamically adapts to new user activities and evolving attack strategies, enhancing its resilience against adversarial attacks. Additionally, Slot automatically constructs the attack chain according to detected attacks with clustering algorithms, providing precise identification of attack paths and facilitating the development of defense strategies. Evaluations with real-world datasets demonstrate Slot's outstanding accuracy, efficiency, adaptability, and robustness in APT detection, with most metrics surpassing state-of-the-art methods. Additionally, case studies conducted to assess Slot's effectiveness in supporting APT defense further establish it as a practical and reliable tool for cybersecurity protection.

cs.CR↗

arXiv2025

Aligning Information Capacity Between Vision and Language via Dense-to-Sparse Feature Distillation for Image-Text Matching

Enabling Visual Semantic Models to effectively handle multi-view description matching has been a longstanding challenge. Existing methods typically learn a set of embeddings to find the optimal match for each view's text and compute similarity. However, the visual and text embeddings learned through these approaches have limited information capacity and are prone to interference from locally similar negative samples. To address this issue, we argue that the information capacity of embeddings is crucial and propose Dense-to-Sparse Feature Distilled Visual Semantic Embedding (D2S-VSE), which enhances the information capacity of sparse text by leveraging dense text distillation. Specifically, D2S-VSE is a two-stage framework. In the pre-training stage, we align images with dense text to enhance the information capacity of visual semantic embeddings. In the fine-tuning stage, we optimize two tasks simultaneously, distilling dense text embeddings to sparse text embeddings while aligning images and sparse texts, enhancing the information capacity of sparse text embeddings. Our proposed D2S-VSE model is extensively evaluated on the large-scale MS-COCO and Flickr30K datasets, demonstrating its superiority over recent state-of-the-art methods.

cs.CV↗

arXiv2025

iReDev: A Knowledge-Driven Multi-Agent Framework for Intelligent Requirements Development

Requirements development is a critical phase as it is responsible for providing a clear understanding of what stakeholders need. It involves collaboration among stakeholders to extract explicit requirements and address potential conflicts, which is time-consuming and labor-intensive. Recently, multi-agent systems for software development have attracted much attention. However, existing research provides limited support for requirements development and overlooks the injection of human knowledge into agents and the human-agent collaboration. % To address these issues, this paper proposes a knowledge-driven multi-agent framework for intelligent requirement development, named iReDev. iReDev features: iReDev consists of six knowledge-driven agents to support the entire requirements development. They collaboratively perform various tasks to produce a software requirements specification. iReDev focuses on integrating human knowledge for agents, enabling them to simulate real-world stakeholders. iReDev uses an event-driven communication mechanism based on an artifact pool. Agents continuously monitor the pool and autonomously trigger the next action based on its changes, enabling iReDev to handle new requirements quickly. iReDev introduces a human-in-the-loop mechanism to support human-agent collaboration, ensuring that the generated artifacts align with the expectations of stakeholders. We evaluated the generated artifacts and results show that iReDev outperforms existing baselines in multiple aspects. We further envision three key directions and hope this work can facilitate the development of intelligent requirements development.

cs.SE↗

arXiv2025

Magneto-photoelectrochemical 2D heterojunction platform for biosensing detection

Photoelectrochemical (PEC) biosensors exhibit significant potential for biomolecule detection due to their high sensitivity and low background noise. However, their performance is severely constrained by the rapid recombination of photogenerated charge carriers. This study innovatively introduces a non-contact magnetic modulation strategy to suppress electron-hole recombination by manipulating carrier spin states, thereby significantly enhancing photoelectric conversion efficiency. Building on this mechanism, we developed a novel magnetically modulated PEC biosensing platform based on the MXenes/cobalt-doped titanium dioxide (Co-TiO2) heterostructure. This platform achieved ultrasensitive detection of protein kinase A (PKA) activity. Compared to an identical probe-modified biosensor without magnetic field application, the developed platform demonstrated a 68.75% enhancement in detection sensitivity and achieved an ultralow detection limit for PKA of 0.00016 U/mL. It also exhibited a wide linear range from 0.005 to 80 U/mL. This research not only provides a novel methodology for kinase activity analysis but also pioneers the innovative strategy of magnetic modulation for enhanced PEC sensing. It opens new avenues for developing high-performance biosensing platforms, holding significant promise for early disease diagnosis and drug screening applications.

physics.app-ph↗

arXiv2025

Alleviating User-Sensitive bias with Fair Generative Sequential Recommendation Model

Recommendation fairness has recently attracted much attention. In the real world, recommendation systems are driven by user behavior, and since users with the same sensitive feature (e.g., gender and age) tend to have the same patterns, recommendation models can easily capture the strong correlation preference of sensitive features and thus cause recommendation unfairness. Diffusion model (DM) as a new generative model paradigm has achieved great success in recommendation systems. DM's ability to model uncertainty and represent diversity, and its modeling mechanism has a high degree of adaptability with the real-world recommendation process with bias. Therefore, we use DM to effectively model the fairness of recommendation and enhance the diversity. This paper proposes a FairGENerative sequential Recommendation model based on DM, FairGENRec. In the training phase, we inject random noise into the original distribution under the guidance of the sensitive feature recognition model, and a sequential denoise model is designed for the reverse reconstruction of items. Simultaneously, recommendation fairness modeling is completed by injecting multi-interests representational information that eliminates the bias of sensitive user features into the generated results. In the inference phase, the model obtains the noise in the form of noise addition by using the history interactions which is followed by reverse iteration to reconstruct the target item representation. Finally, our extensive experiments on three datasets demonstrate the dual enhancement effect of FairGENRec on accuracy and fairness, while the statistical analysis of the cases visualizes the degree of improvement on the fairness of the recommendation.

cs.IR↗

arXiv2025

Rethinking Broken Object Level Authorization Attacks Under Zero Trust Principle

RESTful APIs facilitate data exchange between applications, but they also expose sensitive resources to potential exploitation. Broken Object Level Authorization (BOLA) is the top vulnerability in the OWASP API Security Top 10, exemplifies a critical access control flaw where attackers manipulate API parameters to gain unauthorized access. To address this, we propose BOLAZ, a defense framework grounded in zero trust principles. BOLAZ analyzes the data flow of resource IDs, pinpointing BOLA attack injection points and determining the associated authorization intervals to prevent horizontal privilege escalation. Our approach leverages static taint tracking to categorize APIs into producers and consumers based on how they handle resource IDs. By mapping the propagation paths of resource IDs, BOLAZ captures the context in which these IDs are produced and consumed, allowing for precise identification of authorization boundaries. Unlike defense methods based on common authorization models, BOLAZ is the first authorization-guided method that adapts defense rules based on the system's best-practice authorization logic. We validate BOLAZ through empirical research on 10 GitHub projects. The results demonstrate BOLAZ's effectiveness in defending against vulnerabilities collected from CVE and discovering 35 new BOLA vulnerabilities in the wild, demonstrating its practicality in real-world deployments.

cs.CR↗

arXiv2025

Large ferromagnetic-like band splitting in ultrathin ${\mathrm{SmC}}_{6}$ films

Two-dimensional (2D) magnetic materials provide a unique platform for exploring quantum phases from magnetic order in reduced dimensions. While there have been extensive studies on 2D magnetic materials based on 3$d$ electrons, experimental studies on 4$f$-electron counterparts are far fewer, particularly on their electronic structure. In this study, we report the successful synthesis of ultrathin ${\mathrm{SmC}}_{6}$ films using molecular beam epitaxy. Utilizing in situ angle-resolved photoemission spectroscopy (ARPES), we uncover a large band splitting in the valence bands, which we attribute to the ferromagnetic order driven by exchange couplings between Sm 4$f$ moments and conduction electrons. Despite the small magnetic moment of Sm, the observed splitting is comparable to those of Eu- and Gd-based systems with much larger local moments. Interestingly, the surface state also exhibits splitting with similar magnitude and can be eliminated by overannealing, while the valence bands with ferromagnetic-like splittings remain robust. Our work provides spectroscopic insight to understand the electronic origin of magnetic order in Sm-based compounds. Our study also offers a platform to study 2D magnetic materials based on 4$f$ electrons.

cond-mat.str-el↗

arXiv2025

Zero-Shot Cyclic Peptide Design via Composable Geometric Constraints

Cyclic peptides, characterized by geometric constraints absent in linear peptides, offer enhanced biochemical properties, presenting new opportunities to address unmet medical needs. However, designing target-specific cyclic peptides remains underexplored due to limited training data. To bridge the gap, we propose CP-Composer, a novel generative framework that enables zero-shot cyclic peptide generation via composable geometric constraints. Our approach decomposes complex cyclization patterns into unit constraints, which are incorporated into a diffusion model through geometric conditioning on nodes and edges. During training, the model learns from unit constraints and their random combinations in linear peptides, while at inference, novel constraint combinations required for cyclization are imposed as input. Experiments show that our model, despite trained with linear peptides, is capable of generating diverse target-binding cyclic peptides, reaching success rates from 38% to 84% on different cyclization strategies.

cs.LG↗