arXiv subjects

Yang Liu

Publications and source records attributed to Yang Liu.

At least 325 records · Page 18Linked to original sources

arXiv2026

Belobog: Move Language Fuzzing Framework For Real-World Smart Contracts

Move is a resource-oriented programming language designed for secure and verifiable smart contract development and has been widely used in managing billions of digital assets in blockchains, such as Sui and Aptos.Move features a strong static type system and explicit resource semantics to enforce safety properties such as the prevention of data races, invalid asset transfers, and entry vulnerabilities. However, smart contracts written in Move may still contain certain vulnerabilities that are beyond the reach of its type system. It is thus essential to validate Move smart contracts. Unfortunately, due to its strong type system, existing smart contract fuzzers are ineffective in producing syntactically or semantically valid transactions to test Move smart contracts. This paper introduces the first fuzzing framework, Belobog, for Move smart contracts. Belobog is type-aware and ensures that all generated and mutated transactions are well-typed. More specifically, for a target Move smart contract, Belobog first constructs a dependency graph based on Move's type system, and then generates or mutates a transaction based on the graph trace derived from the dependency graph. In order to overcome the complex checks in Move smart contracts, we further design and implement a concolic executor in Belobog. We evaluated Belobog on 109 real-world Move smart contract projects. The experimental results show that Belobog is able to detect 100% critical and 79% major vulnerabilities manually audited by human experts. We further selected two recent notorious incidents in the Move ecosystem, i.e., Cetus and Nemo. Belobog successfully reproduced full exploits for both of them, without any prior knowledge. Moreover, we applied Belobog on three ongoing auditing projects and found 2 critical, 2 major, and 3 medium new vulnerabilities, all acknowledged by the project developers.

cs.CR↗

arXiv2026

GCR: Geometry-Consistent Routing for Task-Agnostic Continual Anomaly Detection

Feature-based anomaly detection is widely adopted in industrial inspection due to the strong representational power of large pre-trained vision encoders. While most existing methods focus on improving within-category anomaly scoring, practical deployments increasingly require task-agnostic operation under continual category expansion, where the category identity is unknown at test time. In this setting, overall performance is often dominated by expert selection, namely routing an input to an appropriate normality model before any head-specific scoring is applied. However, routing rules that compare head-specific anomaly scores across independently constructed heads are unreliable in practice, as score distributions can differ substantially across categories in scale and tail behavior. We propose GCR, a lightweight mixture-of-experts framework for stabilizing task-agnostic continual anomaly detection through geometry-consistent routing. GCR routes each test image directly in a shared frozen patch-embedding space by minimizing an accumulated nearest-prototype distance to category-specific prototype banks, and then computes anomaly maps only within the routed expert using a standard prototype-based scoring rule. By separating cross-head decision making from within-head anomaly scoring, GCR avoids cross-head score comparability issues without requiring end-to-end representation learning. Experiments on MVTec AD and VisA show that geometry-consistent routing substantially improves routing stability and mitigates continual performance collapse, achieving near-zero forgetting while maintaining competitive detection and localization performance. These results indicate that many failures previously attributed to representation forgetting can instead be explained by decision-rule instability in cross-head routing. Code is available at https://github.com/jw-chae/GCR

cs.CV↗

arXiv2026

Intelligent Reflecting Surfaces for Integrated Sensing and Communications: From System Coexistence to Networked Mutualism

The rapid development of sixth-generation (6G) wireless networks requires seamless integration of communication and sensing to support ubiquitous intelligence and real-time, high-reliability applications. Integrated sensing and communication (ISAC) has emerged as a key solution for achieving this convergence, offering joint utilization of spectral, hardware, and computing resources. However, realizing high-performance ISAC remains challenging due to environmental line-of-sight (LoS) blockage, limited spatial resolution, and the inherent coverage asymmetry and resource coupling between sensing and communication. Intelligent reflecting surfaces (IRSs), featuring low-cost, energy-efficient, and programmable electromagnetic reconfiguration, provide a promising solution to overcome these limitations. This article presents a comprehensive overview of IRS-aided wireless sensing and ISAC technologies, including IRS architectures, target detection and estimation techniques, beamforming designs, and performance metrics. It further explores IRS-enabled new opportunities for more efficient performance balancing, coexistence, and networking in ISAC systems, focuses on current design bottlenecks, and outlines future research directions. This article aims to offer a unified design framework that guides the development of practical and scalable IRS-aided ISAC systems for the next-generation wireless network.

eess.SP↗

arXiv2026

Rethinking Soft Interference Cancellation (IC) for MIMO: A Hard-Decision IC Inspired Recursive Scheme

Multiple-input multiple-output (MIMO) technology has been regarded as one of the most important technologies to enable emerging applications in current and next generation wireless communication systems, for which signal detection methods have been endowed with higher requirements, such as finer bit-error ratio (BER) performance, lower complexity, and smaller memory. Existing detectors mainly include hard-decision-based ordered successive interference cancellation (HD-OSIC) schemes with relatively simple implementation, and linear-minimum-mean-squareerror-based iterative soft interference cancellation (LMMSE-ISIC) schemes exhibiting near-optimal BER performance, whose advantages are combined by the detector developed in this paper. Specifically, we first elaborate that the LMMSE-ISIC scheme is the extension of the HD-OSIC counterpart, via comparing our proposed reordered description based on the equivalent channel matrix for the LMMSE-ISIC detection process with the other. Then, we propose a recursive scheme with speed advantage and memory saving for LMMSE-ISIC by extending that for HDOSIC, where the LMMSE-ISIC estimate and the filtering bias are updated highly efficiently. Compared to the existing best low-complexity LMMSE-ISIC scheme, theoretically, the required computations and memory units in each iteration of our proposed scheme decrease by at least 87.50% and 80.00%, respectively, and simulation results demonstrate that our proposed scheme always yields identical BER performance.

eess.SP↗

arXiv2026

Suppressing Beam Squint Effect For Near-Field Wideband Communication Through Movable Antennas

In this correspondence, we study deploying movable antenna (MA) array in a wideband multiple-input-single-output (MISO) communication system, where near-field (NF) channel model is considered. To alleviate beam squint effect, we propose to maximize the minimum analog beamforming gain across the entire wideband spectrum by appropriately adjusting MAs' positions, which is a highly challenging task. By introducing a slack variable and adopting the cutting-the-edge smoothed-gradient-descent-ascent (SGDA) method, we develop algorithms to resolve the aforementioned challenge. Numerical results verify the effectiveness of our proposed algorithms and demonstrate the benefit of utilizing MA array to mitigate beam squint effect in NF wideband system.

cs.IT↗

arXiv2026

A Flexible Design for Beam Squint Effect Suppression in IRS-Aided THz Communications

In this paper, we study employing movable components on both base station (BS) and intelligent reflecting surface (IRS) in a wideband terahertz (THz) multiple-input-single-output (MISO) system, where the BS is equipped with a movable antenna (MA) array and the IRS consists of movable subarrays. To alleviate double beam squint effect caused by the coupling of beam squint at the BS and IRS, we propose to maximize the minimal received power across a wide THz spectrum by delicately configuring the positions of MAs and IRS subarrays, which is highly challenging. By adopting majorization-minimization (MM) methodology, we develop an algorithm to tackle the aforementioned optimization. Numerical results demonstrate the effectiveness of our proposed algorithm and the benefit of utilizing movable components on the BS and IRS to mitigate double beam squint effect in wideband THz communications.

cs.IT↗

arXiv2026

Joint Beamforming and Position Optimization for IRS-Aided SWIPT with Movable Antennas

Simultaneous wireless information and power transfer (SWIPT) has been envisioned as a promising technology to support ubiquitous connectivity and reliable sustainability in Internet-of-Things (IoT) networks, which, however, generally suffers from severe attenuation caused by long distance propagation, leading to inefficient wireless power transfer (WPT) for energy harvesting receivers (EHRs). This paper proposes to introduce emerging intelligent reflecting surface (IRS) and movable antenna (MA) technologies into SWIPT systems aiming at enhancing information transmission for information decoding receivers (IDRs) and improving receive power of EHRs. We consider to maximize the weighted sum-rate of IDRs via jointly optimizing the active and passive beamforming at the base station (BS) and IRS, respectively, as well as the positions of MAs, while guaranteeing the requirements of all EHRs. To tackle this challenging task due to the non-convexity of associated optimization, we develop an efficient algorithm combining weighted minimal mean square error (WMMSE), block coordinate descent (BCD), majorization-minimization (MM), and penalty duality decomposition (PDD) frameworks. Besides, we present a feasibility characterization method to examine the achievability of EHRs' requirements. Simulation results demonstrate the significant benefits of our proposed solutions. Particularly, the optimized IRS configuration may exhibit higher performance gain than MA counterpart under our considered scenario.

cs.IT↗

arXiv2026

An Optimal-Transport-Based Reinforcement Learning Approach for Computation Offloading

With the mass deployment of computing-intensive applications and delay-sensitive applications on end devices, only adequate computing resources can meet differentiated services' delay requirements. By offloading tasks to cloud servers or edge servers, computation offloading can alleviate computing and storage limitations and reduce delay and energy consumption. However, few of the existing offloading schemes take into consideration the cloud-edge collaboration and the constraint of energy consumption and task dependency. This paper builds a collaborative computation offloading model in cloud and edge computing and formulates a multi-objective optimization problem. Constructed by fusing optimal transport and Policy-Based RL, we propose an Optimal-Transport-Based RL approach to resolve the offloading problem and make the optimal offloading decision for minimizing the overall cost of delay and energy consumption. Simulation results show that the proposed approach can effectively reduce the cost and significantly outperforms existing optimization solutions.

cs.NI↗

arXiv2026

Transmissive RIS Transceiver-Empowered ISAC Systems: Energy Efficiency Optimization for Perfect and Imperfect CSI

In this paper, a novel transmissive reconfigurable intelligent surface (TRIS) transceiver is employed to enable an integrated sensing and communication (ISAC) system supporting both communication and sensing. Under both perfect and imperfect channel state information (CSI), we study the transmit beamforming design for the TRIS transceiver to maximize the system energy efficiency (EE), subject to per-user minimum-rate guarantees, a minimum beampattern gain toward the sensing target, and per-antenna power constraints. The corresponding EE maximization problems are challenging to solve due to the fractional objective and non-convex constraints. In particular, under imperfect CSI, the resulting semi-infinite constraints further complicate the problem. For the perfect CSI case, we first apply the fractional programming (FP) methodology to obtain more tractable reformulations of the rate functions, and then propose an iterative algorithm based on the majorization-minimization (MM) framework. For the imperfect CSI case, we utilize the S-Procedure to transform the semi-infinite inequality constraints into linear matrix inequalities (LMIs), and further develop an efficient MM-based algorithm with the aid of slack variables. Numerical results demonstrate the convergence and effectiveness of the proposed algorithms and validate the EE gains of the TRIS transceiver-enabled ISAC system.

eess.SP↗

arXiv2026

Transmit Beamforming Design for Integrated Sensing and Communication Using Transmissive RIS Transceiver

Integrated sensing and communication (ISAC) is a key technology for future wireless networks, calling for hardware-efficient architectures to jointly support communication and sensing. In this paper, a transmissive reconfigurable intelligent surface (TRIS) transceiver is leveraged to enable an ISAC system. Under the considered system model, we investigate transmit beamforming design for the TRIS transceiver to maximize the sum-rate/beampattern gain, subject to the predefined sensing beampattern gain/communication rate thresholds and the per-unit power constraints of the TRIS transceiver. Since the objective functions and constraints are non-convex, the above two optimization problems are highly challenging. To resolve the difficult optimization problems, we combine the fractional programming (FP) method and the majorization-minimization (MM) framework to develop second-order cone programming (SOCP)-based solutions. Since the per-element power constraints introduce a large number of constraints, this increases the complexity of solving the optimization problems. By splitting the coupling constraints and applying the alternating direction method of multipliers (ADMM) framework, we propose two analytic-based algorithms for efficiently updating the beamformer configurations in the sum-rate and beampattern gain maximization problems, respectively. Simulation results demonstrate the convergence and effectiveness of the proposed algorithms, and show that the low-complexity algorithms achieve performance close to the SOCP-based benchmarks with substantially reduced computational complexity.

eess.SP↗

arXiv2026

Analysis of the hidden-charm pentaquark candidates in the $J/ψΣ^*$ mass spectrum via the QCD sum rules

In this work, we study the diquark-diquark-antiquark type $uusc\bar{c}$ pentaquark states in the light-flavor $\mathbf{10}$ representation via the QCD sum rules in details. We exhaust the lowest five-quark configurations and obtain the spectroscopy of the $uusc\bar{c}$ pentaquark states with the quantum numbers $IJ^{P}=1{\frac{1}{2}}^-$, $1{\frac{3}{2}}^-$, $1{\frac{5}{2}}^-$, and suggest to investigate them in the decay chain $Σ_b^+\to P_{cs}^+\,ϕ\to J/ψΣ^{*+}\, ϕ$ experimentally.

hep-ph↗

arXiv2026

HCPG-Flow:Hierarchical Contact-Progress Guidance for Flow-Policy Robot Manipulation

Flow policies can represent multimodal action distributions for robot manipulation, yet a robot must execute one action at each control step. When several proposals are sampled, critic-based ranking makes data collection depend on value estimates over candidate actions that may be weakly represented in replay. We introduce HCPG-Flow, an analytic rollout-time selector that augments SAC-Flow with hierarchical, object-centric contact-progress guidance while preserving its actor and critic objectives. HCPG switches from end-effector approach to task progress after contact, scores each proposal by the first-order reduction of a task-relevant distance, standardizes scores within the candidate set, and executes a temperature-controlled action embedding. Across ten simulated tasks, HCPG improves mean success over SAC-Flow on both benchmarks, including a 9.5 percentage-point gain on Maniskill. Four physical tasks further show high success with a 17.4% reduction in successful completion steps.Project page: https://hitxraz.github.io/HCPG-Flow/

cs.RO↗

arXiv2026

O-VAD: Industrial Video Anomaly Detection through Object-Centric Tracking and Reasoning

Industrial Video Anomaly Detection (IVAD) aims to identify anomalous objects and events in an industrial process, which is crucial for modern manufacturing and quality control systems. Existing VLM-based anomaly reasoning methods are capable of detecting open-ended anomalies in general domains. However, their performance declines in industrial settings characterized by intricate object transformations, strict physics, and procedural constraints. To tackle the complexity of such interaction-intensive detection, we introduce a training-free agentic framework for anomaly detection free of domain-specific knowledge, emphasizing object state evolution like humans inspectors. It is designed to track spatial-temporal dynamics and underlying transformations of detected objects over time, and then reason over the object-wise temporal state trajectories to identify abnormal objects in grounded frames. Our method overcomes limitations of prior approaches that rely on retraining on normal clips or injecting domain knowledge as context for test-time inference. Extensive experiments on three IVAD datasets demonstrate that our method outperforms frontier VLMs, agentic frameworks, and traditional VAD methods fine-tuned on the respective datasets, while providing interpretable reports over anomaly processes and types.

cs.CV↗

arXiv2026

A Computation Offloading Model over Collaborative Cloud-Edge Networks with Optimal Transport Theory

As novel applications spring up in future network scenarios, the requirements on network service capabilities for differentiated services or burst services are diverse. Aiming at the research of collaborative computing and resource allocation in edge scenarios, migrating computing tasks to the edge and cloud for computing requires a comprehensive consideration of energy consumption, bandwidth, and delay. Our paper proposes a collaboration mechanism based on computation offloading, which is flexible and customizable to meet the diversified requirements of differentiated networks. This mechanism handles the terminal's differentiated computing tasks by establishing a collaborative computation offloading model between the cloud server and edge server. Experiments show that our method has more significant improvements over regular optimization algorithms, including reducing the execution time of computing tasks, improving the utilization of server resources, and decreasing the terminal's energy consumption.

cs.NI↗

arXiv2026

Fourier Geometric Wind Power Forecasting with Numerical Weather Prediction

Accurate short-term wind power forecasting is essential for grid stability and operational planning, yet remains challenging due to the complex interactions between atmospheric conditions and turbine dynamics. However, existing methods fail to effectively incorporate weather forecasting with wind turbine data (i.e., SCADA), leading to suboptimal solutions. To address this, we introduce a multimodal framework that integrates historical point-based SCADA data with grid-based Numerical Weather Prediction (NWP) forecasts, which is challenging due to heterogeneous input and the complex physical wind-turbine interactions. Our approach first explicitly decomposes inputs into scalar and vector features to better capture both site-specific and geometric dependencies and then incorporates a geometric encoder to extract rotation-invariant features from wind vectors. We further leverages a Fourier Neural Operator (FNO) architecture, which performs global convolutions in the frequency domain to efficiently model long-range spatiotemporal relationships. Extensive experiments on three real-world wind farms, with weather forecasting data, demonstrate that our model consistently outperforms state-of-the-art baselines, highlighting the effectiveness of its physically-informed design. The core implementation of our method is publicly available at: https://github.com/shawn-sypiao/GWPF.

cs.AI↗

arXiv2026

Reshaping Biomolecular Structure Prediction through Strategic Conformational Exploration with HelixFold-S1

Generating large ensembles of candidate conformations is standard for improving biomolecular structure prediction. Yet aimless sampling is inefficient and costly, producing many redundant conformations with limited diversity, particularly for complex multimeric assemblies. Here, we present HelixFold-S1, a guided planning approach specifically designed to enhance the structural prediction of biomolecular complexes by strategically targeting the most informative regions of conformational space to produce accurate conformations. For each complex, predicted inter-chain contact probabilities serve as a blueprint of the conformational space, guiding computational effort toward higher-probability, low-redundancy contacts that constrain structure generation. Across diverse biomolecular complex benchmarks, HelixFold-S1 achieves markedly higher structural accuracy than traditional unguided methods while reducing sampling requirements by an order of magnitude. Predicted contact probabilities also provide a rough indicator of prediction difficulty and sampling utility. These results demonstrate that guided planning reshapes conformational exploration and enables more efficient and accurate structural inference.

q-bio.BM↗

arXiv2026

PhyAgentOS: A Self-Evolving Operating System for Embodied Agents with Decoupled Cognitive Planning and Physical Execution

Vision-language-action models, world models, and agentic planners each advance physical intelligence, yet their composition lacks a common execution abstraction, shared state, semantic verification, and persistent experience across heterogeneous embodiments. We present PhyAgentOS, a runtime foundation delivering scheduling, verification, memory, benchmarking, and safety as system-level services. Its Session-Centered Runtime treats a session, not an action, as the minimum unit of scheduling, compatibility preflight, supervised execution, evidence collection, and acceptance. To decouple cognition from physical execution, the cognition-physics boundary is a file system: the State-as-a-File protocol materializes cross-layer state as Markdown with YAML, yielding inspectable, versionable records without code dependencies between Agent and Runtime layers. These views form a unified cognitive state space aligning intent, capabilities, environment, execution, and experience. The SessionVerifier distinguishes execution termination from semantic task completion via evidence-grounded verdicts of success, failure, or replan. Verified outcomes are consolidated through epistemic memory into reusable knowledge and corrective lessons, closing a trial-and-error loop without retraining. Benchmarking reuses the deployment session and verification path, so results trace to real execution. Layered safety constrains both policy-driven and agent-driven execution: preflight, action bridges, SafetyGuard, heartbeat monitoring, and target-local constraints. Validation is progressive: games test cognitive planning, simulation adds dynamics and control, real robots add hardware noise, with the cognitive layer held constant. PhyAgentOS is benchmarked on Optimus-67, StarDojo, and DST-Dojo, validated on 19+ simulated and physical embodiments, and gains on LIBERO, Calvin, and RoboCasa365 across multiple VLA models.

cs.RO↗

arXiv2026

A short review on Quintom dark energy theory

In this paper, we provide a short review on the Quintom dark energy theory. Firstly, we discuss the No-Go theorem associated with dynamical dark energy, then present some examples of models in which the equation of state (EoS) evolves with time and can cross $w=-1$ . Secondly, we discuss the bouncing universe and emergent universe with Quintom matter. Finally, we discuss the possibility of studying the nature of dark energy by measuring the Cosmic Microwave Background (CMB) polarization rotation angle.

astro-ph.CO↗