arXiv subjects

Xin Cheng

Publications and source records attributed to Xin Cheng.

At least 19 recordsLinked to original sources

arXiv2026

High-Resolution Modelling of Coronae and Winds in Solar-type Stars with Varying Rotation Rates I. X-ray Coronae

Stellar coronae are believed to be the main birthplace of various stellar magnetic activities. However, the structures and properties of stellar coronae remain poorly understood. Using the Space Weather Modelling Framework with the Alfvén Wave Solar Model (SWMF-AWSoM) and dynamo-generated surface magnetic maps, here we model the coronae of four solar-type stars. By incorporating the Sun, our work covers a range of stars with the rotation varying from 1.0 to 23.3 $Ω_\odot$ (periods of 25 to 1 days). Guided by observations, we scale the magnetic field strength with increasing rotation, covering a range between 6.0 G to 1200 G approximately. In our models, energy release associated with small-scale magnetic flux is a key source of coronal heating and is essential for reproducing realistic coronal structures. Our models capture dense (1$-$2 orders of magnitude higher than solar values) and ultra-hot ($\sim 10\,\mathrm{MK}$) coronae dominated by closed field structures. Using the CHIANTI atomic database, we also compute synthetic X-ray spectra and derive the corresponding X-ray luminosities $(L_X)$, which follow a scaling law to magnetic field $L_X \propto \langle|\mathbf{B}|\rangle^{1.75}$. Furthermore, the coronal X-ray emission is found to be rotationally modulated by the alternating presence of bright active regions and dark coronal holes. These results provide new insights into the extremely high-energy coronae of rapidly rotating solar-type stars, which differ markedly from the Sun.

astro-ph.SR↗

arXiv2026

Unified Constrained Geometric Configuration Optimization for Source Localization Systems: A Riemannian Manifold-Based Approach

Time of arrival (TOA), time difference of arrival (TDOA), received signal strength (RSS), received signal strength difference (RSSD) and angle of arrival (AOA) are commonly used techniques for source localization. The positioning accuracy of these systems depends heavily on the geometric configuration of sensors, which is typically constrained by practical conditions. This paper presents a unified framework for optimizing sensor geometry across all five localization systems, explicitly incorporating both distance and angle constraints on sensor positions. First, the Cramér-Rao lower bounds (CRLBs) of these systems are transformed to obtain a unified expression. Based on this expression, a unified constrained geometric configuration optimization problem is formulated. The problem is then simplified into a compact form by replacing the sensor-target angles with an orientation matrix. Subsequently, a Riemannian manifold-based constrained geometric configuration optimization algorithm (RM-CGCOA) is proposed to optimize the sensor-target distances and the orientation matrix. This algorithm casts the orientation matrix onto a product manifold of unit circles. An adaptive pullback is further proposed to strictly enforce angle-related inequality constraints, ensuring that all iterates remain feasible when updating the orientation matrix via the Riemannian gradient. Within RM-CGCOA, analytical optimal distances are derived for TOA, TDOA, RSS and AOA, whereas for RSSD, the distances are updated using projected gradient descent (PGD) together with the orientation matrix. Experimental results demonstrate that the proposed RM-CGCOA consistently achieves a significantly lower position error bound (PEB) compared with the existing strategies and yields a similar PEB to the near-optimal search algorithm, but with a much faster running time.

eess.SP↗

arXiv2026

Electron acceleration by turbulent reconnection in solar flares

Solar flares can release magnetic energy explosively in the corona and produce high-energy particles on short timescales. However, how and where these particles are accelerated remains an open question. Here, we investigate the acceleration and transport of electrons during self-developed three-dimensional turbulent reconnection of solar flares by solving Parker's transport equation in the framework of high-resolution MHD simulations. We find that thermal electrons at both the flare current sheet and loop top are rapidly accelerated up to ~90keV, with energy spectra exhibiting a power-law feature. Although the population of accelerated electrons at the flare loop top is larger than that at the current sheet, their spectral indices are similar, close to the values usually observed. More importantly, the acceleration is achieved by turbulence-driven compression structures of various scales rather than the supposed termination shock, particularly at the flare loop top. A portion of compression structures even forms shocks. These results highlight the critical role of turbulent reconnection in accelerating electrons, thereby shedding new light on the acceleration and transport of particles in other high-energy phenomena.

astro-ph.SR↗

arXiv2026

On the Turán number of the expansion of the book

The book with $t$ pages is the graph on $t+2$ vertices consisting of $t$ triangles which intersect at exactly one common edge. For a given graph $F$, the $r$-expansion $F^r$ of $F$ is the $r$-uniform hypergraph obtained from $F$ by adding $r-2$ distinct new vertices to each edge of $F$. We determine the Turán number of the 3-expansion of the book graph for sufficiently large $n$.

math.CO↗

arXiv2026

AgentOCR: Reimagining Agent History via Optical Self-Compression

Recent advances in large language models (LLMs) enable agentic systems trained with reinforcement learning (RL) over multi-turn interaction, but practical deployment is bottlenecked by rapidly growing textual histories that inflate token and memory costs. We introduce AgentOCR, a framework that exploits visual tokens' superior information density by representing the accumulated observation-action history as a compact rendered image. To make multi-turn rollouts scalable, AgentOCR proposes segment optical caching. By decomposing history into hashable segments and maintaining a visual cache, this mechanism eliminates redundant re-rendering. Beyond fixed rendering, AgentOCR introduces agentic self-compression, where the agent actively emits a compression rate and is trained with compression-aware reward to adaptively balance task success and token efficiency. We conduct extensive experiments on challenging agentic benchmarks, ALFWorld and search-based QA. Remarkably, AgentOCR preserves over 95\% of text-based agent performance while substantially reducing token consumption (>50\%), yielding consistent token and memory efficiency. Further analysis validates a 20$\times$ rendering speedup from optical caching and effective self-compression balancing. Our code is available at https://github.com/langfengQ/AgentOCR.

cs.LG↗

arXiv2026

Federated Learning-Based Localization with Heterogeneous Fingerprint Database

Fingerprint-based localization plays an important role in indoor location-based services, where the position information is usually collected in distributed clients and gathered in a centralized server. However, the overloaded transmission as well as the potential risk of divulging private information burdens the application.Owning the ability to address these challenges, federated learning (FL)-based fingerprinting localization comes into people's sights, which aims to train a global model while keeping raw data locally. However, in distributed machine learning (ML) scenarios, the unavoidable database heterogeneity usually degrades the performance of existing FL-based localization algorithm (FedLoc). In this paper, we first characterize the database heterogeneity with a computable metric, i.e., the area of convex hull, and verify it by experimental results. Then, a novel heterogeneous FL-based localization algorithm with the area of convex hull-based aggregation (FedLoc-AC) is proposed. Extensive experimental results, including real-word cases are conducted. We can conclude that the proposed FedLoc-AC can achieve an obvious prediction gain compared to FedLoc in heterogeneous scenarios and has almost the same prediction error with it in homogeneous scenarios. Moreover, the extension of FedLoc-AC in multi-floor cases is proposed and verified.

eess.SP↗

arXiv2026

Providing Location Information at Edge Networks: A Federated Learning-Based Approach

Recently, the development of mobile edge computing has enabled exhilarating edge artificial intelligence (AI) with fast response and low communication cost. The location information of edge devices is essential to support the edge AI in many scenarios, like smart home, intelligent transportation systems and integrated health care. Taking advantages of deep learning intelligence, the centralized machine learning (ML)-based positioning technique has received heated attention from both academia and industry. However, some potential issues, such as location information leakage and huge data traffic, limit its application. Fortunately, a newly emerging privacy-preserving distributed ML mechanism, named federated learning (FL), is expected to alleviate these concerns. In this article, we illustrate a framework of FL-based localization system as well as the involved entities at edge networks. Moreover, the advantages of such system are elaborated. On practical implementation of it, we investigate the field-specific issues associated with system-level solutions, which are further demonstrated over a real-word database. Moreover, future challenging open problems in this field are outlined.

eess.SP↗

arXiv2026

Optimal Measurement of Drone Swarm in RSS-based Passive Localization with Region Constraints

Passive geolocation by multiple unmanned aerial vehicles (UAVs) covers a wide range of military and civilian applications including rescue, wild life tracking and electronic warfare. The sensor-target geometry is known to significantly affect the localization precision. The existing sensor placement strategies mainly work on the cases without any constraints on the sensors locations. However, UAVs cannot fly/hover simply in arbitrary region due to realistic constraints, such as the geographical limitations, the security issues, and the max flying speed. In this paper, optimal geometrical configurations of UAVs in received signal strength (RSS)-based localization under region constraints are investigated. Employing the D-optimal criteria, i.e., minimizing the determinate of Fisher information matrix (FIM), such optimal problem is formulated. Based on the rigorous algebra and geometrical derivations, optimal and also closed form configurations of UAVs under different flying states are proposed. Finally, the effectiveness and practicality of the proposed configurations are demonstrated by simulation examples.

eess.SP↗

arXiv2026

Joint Optimization for RIS-Assisted Wireless Communications: From Physical and Electromagnetic Perspectives

Reconfigurable intelligent surfaces (RISs) are envisioned to be a disruptive wireless communication technique that is capable of reconfiguring the wireless propagation environment. In this paper, we study a free-space RIS-assisted multiple-input single-output (MISO) communication system in far-field operation. To maximize the received power from the physical and electromagnetic nature point of view, a comprehensive optimization, including beamforming of the transmitter, phase shifts of the RIS, orientation and position of the RIS is formulated and addressed. After exploiting the property of line-of-sight (LoS) links, we derive closed-form solutions of beamforming and phase shifts. For the non-trivial RIS position optimization problem in arbitrary three-dimensional space, a dimensional-reducing theory is proved. The simulation results show that the proposed closed-form beamforming and phase shifts approach the upper bound of the received power. The robustness of our proposed solutions in terms of the perturbation is also verified. Moreover, the RIS significantly enhances the performance of the mmWave/THz communication system.

cs.IT↗

arXiv2026

Communication-efficient Coordinated RSS-based Distributed Passive Localization via Drone Cluster

Recently, passive unmanned aerial vehicle (UAV) localization has become popular due to mobility and convenience. In this paper, we consider a scenario of using distributed drone cluster to estimate the position of a passive emitter via received signal strength (RSS). First, a distributed majorizeminimization (DMM) RSS-based localization method is proposed. To accelerate its convergence, a tight upper bound of the objective function from the primary one is derived. Furthermore, to reduce communication overhead, a distributed estimation scheme using the Fisher information matrix (DEF) is presented, with only requiring one-round communication between edge UAVs and center UAV. Additionally, a local search solution is used as the initial value of DEF. Simulation results show that the proposed DMM performs better than the existing distributed Gauss-Newton method (DGN) in terms of root of mean square error (RMSE) under a limited low communication overhead constraint. Moreover, the proposed DEF performs much better than MM in terms of RMSE, but has a higher computational complexity than the latter.

eess.SP↗

arXiv2026

An ADMM-Based Geometric Configuration Optimization in RSSD-Based Source Localization By UAVs with Spread Angle Constraint

Deploying multiple unmanned aerial vehicles (UAVs) to locate a signal-emitting source covers a wide range of military and civilian applications like rescue and target tracking. It is well known that the UAVs-source (sensors-target) geometry, namely geometric configuration, significantly affects the final localization accuracy. This paper focuses on the geometric configuration optimization for received signal strength difference (RSSD)-based passive source localization by drone swarm. Different from prior works, this paper considers a general measuring condition where the spread angle of drone swarm centered on the source is constrained. Subject to this constraint, a geometric configuration optimization problem with the aim of maximizing the determinant of Fisher information matrix (FIM) is formulated. After transforming this problem using matrix theory, an alternating direction method of multipliers (ADMM)-based optimization framework is proposed. To solve the subproblems in this framework, two global optimal solutions based on the Von Neumann matrix trace inequality theorem and majorize-minimize (MM) algorithm are proposed respectively. Finally, the effectiveness as well as the practicality of the proposed ADMM-based optimization algorithm are demonstrated by extensive simulations.

eess.SP↗

arXiv2026

Millimeter-Wave Position Sensing Using Reconfigurable Intelligent Surfaces: Positioning Error Bound and Phase Shift Configuration

Millimeter-wave (mmWave) positioning has emerged as a promising technology for next-generation intelligent systems. The advent of reconfigurable intelligent surfaces (RISs) has revolutionized high-precision mmWave localization by enabling dynamic manipulation of wireless propagation environments. This paper investigates a three-dimensional (3D) multi-input single-output (MISO) mmWave positioning system assisted by multiple RISs. We introduce a measurement framework incorporating sequential RIS activation and directional beamforming to fully exploit virtual line-of-sight (VLoS) paths. The theoretical performance limits are rigorously analyzed through derivation of the Fisher information and subsequent positioning error bound (PEB). To minimize the PEB, two distinct optimization approaches are proposed for continuous and discrete phase shift configurations of RISs. For continuous phase shifts, a Riemannian manifold-based optimization algorithm is proposed. For discrete phase shifts, a heuristic algorithm incorporating the grey wolf optimizer is proposed. Extensive numerical simulations demonstrate the effectiveness of the proposed algorithms in reducing the PEB and validate the improvement in positioning accuracy achieved by multiple RISs.

eess.SP↗

arXiv2026

A Fingerprint Database Generation Method for RIS-Assisted Indoor Positioning

Reconfigurable intelligent surface (RIS) has emerged as a promising technology to enhance indoor wireless communication and sensing performance. However, the construction of reliable received signal strength (RSS)-based fingerprint databases for RIS-assisted indoor positioning remains an open challenge due to the lack of realistic and spatially consistent channel modeling methods. In this paper, we propose a novel method with open-source code for generating RIS-assisted RSS fingerprint databases. Our method captures the complex RIS-assisted multipath behaviors by extended cluster-based channel modeling and the physical and electromagnetic properties of RIS and transmitter (Tx). And the spatial consistency is incorporated when simulating the fingerprint data collection across neighboring positions. Moreover, an effective sorting algorithm is proposed to solve the online synchronization issue, a closed-form RIS phase configuration strategy is proposed to improve the localization accuracy, and the modeling method of mutual coupling (MC) effect is provided. Extensive simulations are conducted to evaluate the fingerprint database generated by the proposed method. And the positioning performance on the database using different algorithms is analyzed, providing valuable insights for the system design.

eess.SP↗

arXiv2026

FATE: Frame-Level Audio-Visual Temporal Embedding

When a dog opens its mouth and barks, humans naturally recognize what the sound is and when it occurs. Building audio-visual models with this same ability requires representations that capture both semantic and temporal alignment. Current approaches fall short on one side or the other: embedding models match semantic but lose temporal information; synchronization models capture temporal offsets but lack semantic understanding. To bridge this gap, we propose FATE, Frame-level Audio-visual Temporal Embedding. Unlike prior embedding models that pool each modality into a single embedding and discard temporal information, FATE retains frame-level sequences, aligns them on the physical timeline, and computes similarity over strictly aligned frame pairs. Unlike synchronization models that output only an offset prediction, FATE encodes synchronization in a reusable embedding space, trained with a joint objective combining cross-video semantic and within-video temporal contrastive learning to capture both what sounds and when it occurs. Across three tasks, FATE surpasses the strongest baseline on temporal and semantic retrieval by a large margin, matches fully supervised methods on event localization in a zero-shot setting, and achieves the best correlation with human judgments as a generation evaluation metric. The source code can be found at \texttt{https://github.com/guankaisi/FATE}.

cs.MM↗

arXiv2026

Back Reaction of the Untwisting Solar Corona Scars Sunspots

The evolution of magnetic fields in the tenuous solar corona is predominantly governed by the motions of the underlying dense photosphere. Despite, coronal magnetic restructuring driven by magnetic reconnection between interacting coronal fields can sometimes react backwards to change photospheric magnetic fields. However, the mechanism of reactions remains undetermined. Here, we report the discovery of a back-reaction phenomenon: the untwisting of coronal loops that become twisted during reconnection in an eruption results in enhanced currents at the boundary of their footpoint away from the eruption, manifesting as the growth of a sunspot scar. It is revealed to arise from the Alfvenic reverse transfer of magnetic twist from the corona to the lower atmosphere, thanks to joint space observations and a magnetohydrodynamics simulation. These findings provide a viable and quantitative interpretation for the majority of puzzling photospheric changes associated with coronal mass ejections and/or flares and warn for unexpected magnetic field evolutions in sunspots and starspots.

astro-ph.SR↗

arXiv2026

SeFi-Image: A Text-to-Image Foundation Model with Semantic-First Diffusion

Training image generation foundation models consumes substantial resources. Previous methods have attempted to leverage semantic guidance to accelerate the training process, yet their experiments were only conducted on simple datasets such as ImageNet, at low resolutions, and with small-scale models. In this paper, we propose SeFi-Image, a text-to-image foundation model built upon semantic-first diffusion, a novel latent diffusion modeling paradigm. We instantiate SeFi-Image at three model scales, 1B, 2B, and 5B parameters, enabling systematic study of scaling behavior and flexible deployment under varying compute budgets. Notably, our largest 5B model was trained with merely 125K A800 GPU hours, corresponding to roughly 10-20% of the training compute used by Z-Image. However, it achieves results comparable to or even superior to Qwen-Image and Z-Image. Despite this modest training compute, SeFi-Image achieves strong performance on a wide range of benchmarks, including GenEval, DPG, LongTextBench, OneIG, and CVTG-2K. Moreover, we provide DMD2-distilled few-step turbo variants for each model scale to accommodate diverse hardware constraints and latency requirements. We publicly release our code, weights and hope this work offers the community useful insights into semantic-guided diffusion modeling for T2I generation, while also providing practical and readily deployable model options.

cs.CV↗

arXiv2026

Joint Channel Estimation and Data Detection for Multi-LEO-Satellite Cell-Free OTFS Uplinks

Cell-free networks formed by multiple low Earth orbit (LEO) satellites offer a promising architecture for ubiquitous connectivity, but their cooperative reception is challenged by link-dependent residual delays and Doppler shifts. This paper investigates joint channel estimation and data detection (JCEDD) for multi-LEO-satellite cell-free orthogonal time frequency space (OTFS) uplinks. The JCEDD problem is formulated as a structured bilinear inference problem involving link-specific sparse beam--delay--Doppler channels and a multiuser data vector. We develop a low-complexity hierarchical JCEDD receiver in which all satellites first perform local JCEDD, and their observations and local estimates are then aggregated at a central satellite for cooperative refinement. Computational complexity is reduced by restricting channel estimation to coarse-information-aided local beam--delay--Doppler regions and evaluating the required forward and adjoint operations in a matrix-free manner. Simulation results validate the channel-estimation accuracy and data-detection reliability of the proposed JCEDD receiver.

eess.SP↗

arXiv2026

Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models

While Mixture-of-Experts (MoE) scales capacity via conditional computation, Transformers lack a native primitive for knowledge lookup, forcing them to inefficiently simulate retrieval through computation. To address this, we introduce conditional memory as a complementary sparsity axis, instantiated via Engram, a module that modernizes classic $N$-gram embedding for O(1) lookup. By formulating the Sparsity Allocation problem, we uncover a U-shaped scaling law that optimizes the trade-off between neural computation (MoE) and static memory (Engram). Guided by this law, we scale Engram to 27B parameters, achieving superior performance over a strictly iso-parameter and iso-FLOPs MoE baseline. Most notably, while the memory module is expected to aid knowledge retrieval (e.g., MMLU +3.4; CMMLU +4.0), we observe even larger gains in general reasoning (e.g., BBH +5.0; ARC-Challenge +3.7) and code/math domains~(HumanEval +3.0; MATH +2.4). Mechanistic analyses reveal that Engram relieves the backbone's early layers from static reconstruction, effectively deepening the network for complex reasoning. Furthermore, by delegating local dependencies to lookups, it frees up attention capacity for global context, substantially boosting long-context retrieval (e.g., Multi-Query NIAH: 84.2 to 97.0). Finally, Engram establishes infrastructure-aware efficiency: its deterministic addressing enables runtime prefetching from host memory, incurring negligible overhead. We envision conditional memory as an indispensable modeling primitive for next-generation sparse models.

cs.CL↗