arXiv subjects

Ying Wang

Publications and source records attributed to Ying Wang.

At least 37 records · Page 2Linked to original sources

arXiv2026

Faber-Krahn inequality for the first Dirichlet eigenvalues of the logarithmic Hardy operator

The purpose of this paper is to study Faber--Krahn inequality of Dirichlet eigenvalues $\{ λ^{\ln,μ}_{k}(Ω)\}_{k\in \N}$ for the logarithmic Hardy operator \[ \mathcal{L}_μ=(-Δ)^{\ln}+2μ\log\frac{1}{|x|} \] on a bounded Lipschitz domain $Ω\subset\mathbb{R}^{N}$ containing the origin, with $μ>-1$. We establish a Faber--Krahn inequality for $μ\in(-1,0)$, the ball centered at the origin minimizes the first eigenvalue at fixed volume, with equality only for that ball. Finally, we show this inequality fails for $μ>0$ via an explicit two-ball-and-tube construction.

math.AP↗

arXiv2026

Beamforming and Trajectory Optimization for Aerial RIS-Aided Secure ISAC via Model Predictive Control

This paper proposes a novel aerial reconfigurable intelligent surface (RIS)-aided secure integrated sensing and communication (ISAC) architecture. An unmanned aerial vehicle (UAV)-mounted RIS establishes virtual line-of-sight links to bypass blockages, serving legitimate users while sensing potential eavesdroppers. To ensure communication security and sensing reliability, we formulate an infinite-horizon dynamic control problem maximizing the long-term average system secrecy rate and minimizing UAV flight energy. This formulation jointly optimizes the UAV trajectory, active beamforming with artificial noise (AN) at the base station, and RIS phase shifts, subject to strict radar signal-to-noise ratio and UAV kinematic constraints. Due to the highly coupled non-convex variables, solving this problem directly is intractable. Therefore, we propose an online joint optimization framework based on model predictive control (MPC). Within each receding horizon, alternating optimization is employed to decouple the problem into three subproblems, efficiently solved via successive convex approximation and difference of convex programming. Extensive simulations demonstrate that our MPC-based algorithm significantly outperforms static baselines in secrecy rate, exhibiting superior online correction capability and robustness against environmental perturbations.

eess.SP↗

arXiv2026

DyadMem: A Long-Term Memory Benchmark of How Agents Work with Users

Long-term agents must remember not only what is true about a user, but also how a particular agent should work with that user as their shared history evolves. Existing benchmarks primarily supervise user facts and preferences or experience reusable across users, leaving this relationship-specific agent memory implicit. Additionally, most prior works measure the model solely with final-answer QA over long interaction histories, making the assessment still incomplete and unreliable. To this end, we introduce DyadMem with the proposed new definition User-conditioned Relational Agent Memory (URAM). DyadMem jointly annotates user-side memory and URAM along the same multi-session trajectories, resulting in 6 memory categories. To summarize, it includes 3,065 episodes, 50,961 sessions, and 61,210 QA instances, with extensive session-level Capture and Update gold annotations, query-level Recall support, and two QA settings: Gold-Memory and Full-Pipeline. Across 16 open-weight and 4 proprietary models, Gold-Memory QA is consistently strong, yet Full-Pipeline QA drops sharply. Such a gap explicitly supports our fine-grained evaluation design. Additionally, several quantitative results further reveal low Capture recall, incomplete Recall, and unsafe-deletion issues arising from even the frontier LLMs. We further conduct a rigorous experiment to validate the effectiveness of our URAM and observe the positive effects for all 20 models. In summary, DyadMem is a dual-domain, full-pipeline memory benchmark with extensive annotation efforts for advancing the domain's development.

cs.AI↗

arXiv2026

Where Chaos Pauses: Sliding-Window Frequency Ratios Reveal Transient Resonances in Relativistic Orbits

A long-time Poincaré section flattens a chaotic orbit into one static blur, erasing the order in which the orbit visits its own local structures. We introduce the sliding-window frequency ratio (SWFR), built from nothing but radial and polar turning events, to recover that order along individual relativistic orbits. Each window spans a fixed number of radial cycles and simply counts the polar events inside it; because event times are kept, any candidate interval can be sliced out and replotted as its own Poincaré section. No spectrum, no reference center, no basis functions. Integrable Kerr benchmarks recover the known frequency ratios, and for regular motion with uniformly bounded count deviations the counting-error bound falls off as $O(W^{-1})$. The same counts then pay off in chaos. In magnetized Kerr spacetime a single charged orbit dwells near $3/5$ and later near $4/7$, and exactly those intervals open into fivefold and sevenfold section structures; a second orbit dwells near $1/2$ with two lobes. In Schwarzschild--Melvin spacetime a photon holds $4/5$ across a fivefold pattern. In every case the section covers exactly the interval SWFR selected: integer counts and phase-space geometry agree that a globally chaotic orbit is paying a temporary visit to a resonance.

gr-qc↗

arXiv2026

Tensor-Based Dynamic Channel Estimation for mmWave Movable Antenna MIMO Systems

This paper investigates the dynamic channel estimation algorithm in mmWave movable antenna (MA) multiple-input multiple-output (MIMO) systems. To achieve highly accurate channel estimation, we propose a tensor decomposition-based channel estimation algorithm. First, by leveraging the path response model and utilizing the intrinsic sparsity of mmWave channels, the channel corresponding to MA pairs at the base station and mobile station is transformed into a superposition of channels from sparse paths. Next, the received signal is constructed as a fourth-order tensor to fully capture the high-dimensional structural information of the MA MIMO channel. Then, two tensor decomposition schemes are adopted to extract the factor matrices, and our analysis reveals that the uniqueness of the decomposition can be guaranteed in our model. Subsequently, the propagation loss, frequency offset, angle of arrival/departure, and time delay are obtained based on these factor matrices and the channel matrix can be rebuilt. Additionally, Cramér-Rao bound (CRB) is also derived as a performance evaluation standard, proving that the proposed algorithm achieves a higher estimation accuracy and nearly approaches this minimum bound. Moreover, normalized mean square error (NMSE) is selected as the evaluation metrics for estimation accuracy. Finally, simulation results reveal a notable reduction in the estimation error of the proposed algorithm when compared to the baseline algorithms, confirming its estimation advantage.

eess.SP↗

arXiv2026

Know the Normal, Track the Attack: Context-Grounded and Stateful LLM Investigation over System Provenance

Provenance-based intrusion detection systems (PIDSs) identify suspicious activity in audit streams, but their outputs remain difficult to turn into coherent attack narratives. Direct LLM analyses of local anomalous subgraphs lack deployment-specific normal-behavior knowledge and validated attack state across evidence fragments. This can cause unsupported attack interpretations of routine activities and incorrect attribution of temporally dispersed evidence to attack stages. We present ANCHOR, an investigation-oriented provenance system that combines evidence curation with context-grounded LLM reasoning. It calibrates anomaly judgments by relation type and links anomalous windows through rare relation-role patterns. The resulting evidence queues preserve causal structure, temporal boundaries, and cross-window continuity. The investigator interprets process-centered evidence using two complementary forms of context. Deployment Context combines environment-specific interaction and object baselines with high-risk security knowledge. Case Context uses a confidence-gated Attack-Tracking Cache to maintain investigation state across windows. Correlating current evidence with high-confidence prior findings, ANCHOR incrementally reconstructs attack narratives organized by kill-chain stages. We evaluate ANCHOR on six DARPA Transparent Computing E3/E5 datasets across three operating systems. Controlled evidence-level and end-to-end comparisons show improved overall IoC recovery and attack-stage attribution over state-of-the-art provenance-based baselines. These gains persist under a fixed LLM backbone in our evaluation. ANCHOR processes a full audit day at dollar-level API cost, supporting practical, context-grounded investigation across windows.

cs.CR↗

arXiv2026

Dr.Credit: Rubric-Grounded Process Credit Assignment for Deep Research Agents

Rubric-based tasks are increasingly addressed through reinforcement learning (RL), with rubric scores used as training rewards. However, these rewards typically supervise final answers without distinguishing the contributions of intermediate decisions. Many existing credit assignment methods rely on ground-truth answers to define process rewards, limiting their applicability to open-ended tasks without canonical solutions. To address this limitation, the proposed rubric-grounded credit uses task requirements as a shared reference for final answer evaluation and process supervision. The information returned by tools is assessed for the additional support it provides toward satisfying each rubric relative to that rubric's history of accepted support. By referencing these histories, credit distinguishes new support from evidence already present in the trajectory while recognizing partial support for each rubric. Dr.Credit uses rubric-grounded credit to supervise intermediate tool turns in an RL framework for deep research agents. The resulting process advantages are combined with GRPO outcome advantages to guide research decisions while retaining supervision of final-report quality. Evaluations on four in-domain and out-of-domain benchmarks show that Dr.Credit outperforms the evaluated open deep research baselines on every primary metric and submetric. Meanwhile, with an 8B-parameter backbone, the trained agent achieves average performance competitive with the evaluated frontier proprietary models. Further analyses suggest more efficient evidence acquisition and higher-quality reports under limited research-turn budgets, motivating the extension of rubric-grounded process supervision to a broader range of rubric-based tasks.

cs.CL↗

arXiv2026

DisKO: Deep Koopman Learning in Distribution Space from Unpaired Snapshots

Many complex systems are observed only through temporally unpaired distribution snapshots, making trajectory-based dynamical learning difficult without additional assumptions. We therefore formulate the problem directly in distribution space, treating the distribution itself as the dynamical state. The challenge is that distribution space is infinite-dimensional, making compact and approximately closed representations difficult to learn from finite snapshots. We introduce DisKO, which extends deep Koopman learning to distribution dynamics by jointly learning predictive distributional observables, a finite-dimensional Koopman representation, and a generative map back to the full distribution. Across seven diverse benchmarks, DisKO achieves state-of-the-art extrapolation performance, with substantially slower error accumulation on long-horizon prediction tasks. DisKO further recovers leading Koopman eigenvalues and eigenfunctions on systems with analytic spectra, revealing meaningful dynamical structure in the learned representation.

cs.LG↗

arXiv2026

How Far Are We from Removing the Visual Encoder? Scaling Laws for Encoder-Free Multimodal Pretraining

Most modern multimodal large language models (MLLMs) build on a pretrained visual encoder that provides a strong visual prior. Encoder-free MLLMs instead learn visual representations directly from raw pixels, offering a simple and unified architecture, but their scaling behavior has not been systematically characterized. To fill this gap, we compare scaling laws for encoder-free and encoder-based MLLMs and report three main findings: (1) Removing the visual encoder shifts the compute-optimal allocation for the multimodal objective toward larger models, while leaving that for text nearly unchanged. (2) The two architectures exhibit nearly overlapping loss--compute frontiers on the text objective, but diverge on the multimodal objective: encoder-free models underperform at small scales yet are predicted to catch up at around $10^{22}$ FLOPs, well within practical pretraining budgets. (3) Without a visual encoder, the language model learns to take over its role via vision-specific adaptation: bidirectional interactions among visual tokens become increasingly beneficial as training compute grows, visual processing shifts toward earlier layers, and expert routing for visual tokens becomes more concentrated. Overall, our results indicate that the advantage of the visual prior provided by a pretrained encoder diminishes with scale, positioning encoder-free architectures as a promising direction for multimodal pretraining.

cs.CV↗

arXiv2026

Turning-Point Count Discrepancy as a Diagnostic of Relativistic Orbital Chaos

We propose the turning-point count-discrepancy indicator (TPCD) for diagnosing orbital chaos from a single trajectory in relativistic Hamiltonian systems with two oscillatory degrees of freedom. TPCD measures the largest cumulative departure of one turning-event count from its mean rate per reference cycle, requiring neither a neighboring orbit nor a phase-space partition and applying to both massive particles and photons. We establish its long-time behavior under explicit event--phase assumptions. Rigid phases with an exact event--phase correspondence obey a strict discrepancy bound of unity, and linearizable regular tori with bounded degree-one phase deformations obey a finite, orbit-dependent bound; both imply that the normalized indicator decays to zero as the record grows. A diffusive fluctuation mechanism instead yields a Brownian-bridge scaling and a finite statistical scale. Integrable Kerr motion validates the construction, recovering prescribed frequency ratios from event counts to within $2.6\times10^{-5}$ for six targets, including an irrational ratio. In charged-particle scans around a Kerr black hole in an external test magnetic field, TPCD and the fast Lyapunov indicator agree for all 80 sampled trajectories. In the Schwarzschild--Melvin photon model, a trajectory with elevated finite-time TPCD but low fast-Lyapunov values is identified as regular once its indicator trends downward over an extended integration, showing that finite-time values must be read together with their long-time trend.

gr-qc↗

arXiv2026

A Tutorial on Movable Antenna-Enabled ISAC Systems: Fundamentals, Parameter Estimation, and Security Issues

Movable antenna (MA) technology has recently emerged as a promising paradigm for enhancing the flexibility and performance of wireless systems by allowing antennas to dynamically adjust their spatial positions within a confined region. Meanwhile, integrated sensing and communication (ISAC) has attracted significant attention as a key technology for next-generation wireless networks, aiming to integrate communication and sensing within a shared hardware and spectral framework. By leveraging the additional spatial degrees of freedom offered by MA, MA-enabled ISAC systems provide new opportunities to enhance both communication performance and sensing accuracy. However, the integration of MA into ISAC also poses new challenges in parameter estimation and security. In this tutorial, we provide a comprehensive overview of MA-enabled ISAC systems, with a particular focus on their fundamentals, parameter estimation, and security issues. First, we introduce the basic principles of MA and ISAC, and review representative MA-enabled ISAC systems and their potential applications. Then, we establish unified mathematical models for communication and sensing, and systematically review representative channel and sensing parameter estimation methods tailored to MA-enabled ISAC systems. Numerical comparisons are provided to illustrate the characteristics and performance of different estimation methods. Furthermore, we investigate the security issues of MA-enabled ISAC systems, introduce the fundamentals of physical-layer security (PLS), and summarize how the spatial reconfigurability of MAs can be exploited to enhance the security of ISAC systems. Representative case studies are presented to demonstrate the performance gains of MA-enabled secure ISAC systems. Finally, we identify several open issues and future research directions toward practical MA-enabled ISAC systems.

eess.SP↗

arXiv2026

Dirichlet Eigenvalues for the Logarithmic-Hardy operator

In this paper, we study the Dirichlet eigenvalue problem for the logarithmic Hardy operator, defined as the logarithmic Laplacian with a critical logarithmic potential, in a bounded Lipschitz domain containing the origin. We first establish a logarithmic Hardy inequality and use it to identify the associated energy space, showing that the embedding into $L^2$ is compact when the perturbation parameter exceeds the endpoint value $-1$, but fails to be compact at that endpoint. For parameters above $-1$, we develop a complete variational spectral theory, prove that the problem admits a discrete sequence of eigenvalues tending to infinity, characterized by successive minimizations over orthogonal complements, whose eigenfunctions form a complete orthonormal basis of $L^2$. We further establish a uniform lower bound for the first eigenvalue, a scaling property under domain dilation that determines a critical radius for the sign of the first eigenvalue and leaves the eigenvalue gaps invariant.

math.AP↗

arXiv2026

A System Architecture for Low Latency Multiprogramming Quantum Computing

As quantum systems scale, multiprogramming quantum computing (MPQC) provides a practical way to improve device utilization and throughput. However, because quantum executables are device-dependent, non-portable across qubit regions, and highly susceptible to noise and crosstalk, current MPQC pipelines rely on expensive online compilation to co-optimize concurrently running programs. This online step dominates runtime and impedes low-latency deployments for practical, real-world workloads in the future, such as repeatedly invoked quantum neural network (QNN) services. We present FLAMENCO, a fidelity-aware multi-version compilation system that enables independent offline compilation and low-latency multiprogramming at runtime. \textbf{At the architecture level}, the system abstracts devices into compute units to reduce the search space of region allocation. \textbf{At compile time}, it generates diverse executable versions for each program---each bound to a distinct qubit region---allowing dynamic region selection at runtime and overcoming non-portability. \textbf{At runtime}, it employs a lightweight orchestrator that uses post-compilation fidelity metrics to avoid conflicts and mitigate crosstalk, supporting conflict-free co-execution without online co-optimization. Evaluations show that FLAMENCO achieves over 5$\times$ runtime speedup in post-scheduling execution while maintaining comparable execution fidelity on common-success workloads. When integrated into existing scheduler-coupled systems, it raises workload-level conflict-free orchestration ratio from 0.183 to 1.000 for HyperQ and from 0.050 to 0.400 for QOS.

cs.AR↗

arXiv2026

ASTRA: Toward Agentic AI for Intelligent Device-Network-Cloud Synergy in Next-Generation Mobile Communication

The evolution toward next-generation mobile communication systems demands intelligence-native networks capable of autonomously adapting to user intent, yet the prevailing 3GPP protocol-driven device-network-cloud (DNC) architecture imposes three structural bottlenecks: protocol-constrained decision spaces confining optimization to predefined parameter subsets, cascaded information asymmetry from lossy interface compression that strips semantic context and causes intent miscalibration, and inherently reactive coordination mechanisms that trigger actions only after performance degradation. This paper proposes an autonomous agentic AI paradigm named Agentic Synergy for Telecommunication Resource Autonomy (ASTRA), which introduces a three-tier agent layer, including device agent, network agent, and cloud agent, decoupling network intelligence from the underlying hardware infrastructure. These agents collaborate through bidirectional semantic channels, including semantic intent messages, capability abstraction messages, global directives, and peer coordination, executing a six-phase cycle of perceive, reason and predict, communicate, decide, act, and learn that transforms reactive protocol-driven operations into proactive, intent-calibrated optimization over the full decision space. Validated through system-level simulations in two representative scenarios, ASTRA achieves a 13.1\% average throughput gain in dense-crowd cell selection by redistributing UEs from congested cells via semantic load exchange, and an 18.2\% passive handover reduction in high-speed mobility through predictive trajectory-aware coordination, providing initial evidence that the proposed agentic framework accesses solution regions structurally inaccessible under protocol-constrained architectures.

cs.ET↗

arXiv2026

Voltage-Current-Emission Framework of Time-Resolved Electroluminescence

Time-resolved electroluminescence has been a central methodology in the development of LED devices. However, it still lacks quantitative theoretical descriptions of time-resolved electroluminescence. By combining the equivalent circuit models of semiconductor devices and the carrier dynamics of electroluminescence processes, we here developed a Voltage-Current-Emission framework to illustrate time-resolved electroluminescence from the pulse voltage as input, to injection current and finally generate electroluminescence as output. The features of different LED devices can be quantitatively interpreted, confirming the universal applicability across LEDs with different materials and device structures. Importantly, the curves of time-resolved electroluminescence can be simulated to quantitatively describe the dynamics of current and carriers of LED operation. In all, the Voltage-Current-Emission framework offers theoretical guidance for achieving advanced LED devices for AI technology.

physics.optics↗

arXiv2026

GML-Based Optimization for Movable Antenna Wireless Networks: Challenges and Opportunities

Movable antenna (MA) is proposed as an emerging technology for future wireless networks. By leveraging the additional spatial degrees of freedom, MA can proactively reshape the wireless propagation environment, thereby enhancing network performance.However, fully unlocking the potential of MA networks necessitates the joint optimization of MA antenna positioning and beamforming. For this non-convex and highly coupled problem, existing solutions exhibit significant limitations. Therefore, this paper proposes a gradient-based meta learning (GML) optimization framework. Specifically, we first elaborate on the hardware architecture and channel characteristics of MA, based on which we analyze the primary challenges in optimizing MA wireless networks. Subsequently, we introduce the fundamental logic of the GML framework and compare it with existing methods. Furthermore, we discuss the constraint handling strategies for applying the proposed optimization framework to MA networks. A specific case is studied to show the performance of proposed framework based on numerical simulation. Finally, this paper outlines future research directions for both the GML framework and MA wireless networks.

eess.SP↗

arXiv2026

Discrete Antenna Positioning and Beamforming Design for RIS-Assisted MA Secure ISAC Systems

This paper investigates a reconfigurable intelligent surface (RIS)-assisted movable antenna (MA) secure integrated sensing and communication (ISAC) system. In this architecture, the RIS establishes indirect transmission links to provide communication services for multiple legitimate users, while the high spatial diversity gain of MA is leveraged to enhance system security. Then, we formulate an optimization problem to maximize the system total secrecy rate by jointly optimizing the MA position selection, active beamforming design for base station and passive beamforming design for RIS. The problem also accounts for practical constraints including transmit power budget, sensing beampattern mean square error (MSE), RIS unit-modulus constraint. However, it is challenging to solve this problem due to its non-convexity and strong coupling of the optimization variables. Consequently, we propose an alternating optimization (AO) framework, employing techniques including discrete binary particle swarm optimization (BPSO), successive convex approximation (SCA) and difference-of-convex (DC) programming to transform the optimization problem into convex subproblems. Based on the solution above, the convex sub-problems are solved iteratively until convergence is achieved. Numerical results demonstrate that the proposed algorithm outperforms other baseline algorithms in terms of secure communication performance.

eess.SP↗

arXiv2026

Blow-up or grow-up for the focusing 3D cubic NLS with a repulsive inverse-power potential at the mass--energy threshold

We consider the focusing cubic nonlinear Schrodinger equation with a repulsive inverse-power potential $V(x)=a|x|^{-μ}$, where $a>0$ and $1<μ\leq 2$. At the mass-energy threshold, Miao, Murphy, and Zheng, as well as Ardila, Hamano, and Ikeda, established sharp scattering results in the positive virial region. In this paper, we continue to study the dynamics in the negative virial region and show that, in each time direction, solutions either blow up in finite time or grow up.

math.AP↗