Searcharxiv⌕ Search

arXiv subjects

Chao Liu

Publications and source records attributed to Chao Liu.

At least 127 records · Page 7Linked to original sources

SECNEURON: Reliable and Flexible Abuse Control in Local LLMs via Hybrid Neuron Encryption

Large language models (LLMs) with diverse capabilities are increasingly being deployed in local environments, presenting significant security and controllability challenges. These locally deployed LLMs operate outside the direct control of developers, rendering them more susceptible to abuse. Existing mitigation techniques mainly designed for cloud-based LLM services are frequently circumvented or ineffective in deployer-controlled environments. We propose SECNEURON, the first framework that seamlessly embeds classic access control within the intrinsic capabilities of LLMs, achieving reliable, cost-effective, flexible, and certified abuse control for local deployed LLMs. SECNEURON employs neuron-level encryption and selective decryption to dynamically control the task-specific capabilities of LLMs, limiting unauthorized task abuse without compromising others. We first design a task-specific neuron extraction mechanism to decouple logically related neurons and construct a layered policy tree for handling coupled neurons. We then introduce a flexible and efficient hybrid encryption framework for millions of neurons in LLMs. Finally, we developed a distribution-based decrypted neuron detection mechanism on ciphertext to ensure the effectiveness of partially decrypted LLMs. We proved that SECNEURON satisfies IND-CPA Security and Collusion Resistance Security under the Task Controllability Principle. Experiments on various task settings show that SECNEURON limits unauthorized task accuracy to below 25% while keeping authorized accuracy loss with 2%. Using an unauthorized Code task example, the accuracy of abuse-related malicious code generation was reduced from 59% to 15%. SECNEURON also mitigates unauthorized data leakage, reducing PII extraction rates to below 5% and membership inference to random guesses.

cs.CR↗

ViT-based Local Volume dwarf galaxy Identificationin (VIDA) in the CSST survey

Identifying dwarf galaxies within the Local Volume is crucial for constraining the luminosity function of satellite galaxies in the nearby universe. We report the detection capabilities of dwarf galaxies within the Local Volume using the Chinese Space Station Telescope (CSST). Based on the simulated imaging data of CSST, we develop a detection and classification pipeline that combines traditional image-based search techniques with advanced machine learning classification models. The simulated Local Volume dwarf galaxies can be identified using a pre-processing method for "extended source detection", followed by classification with a pretrained ViT-Base model. This pipeline achieves a true positive rate (TPR) exceeding 85% with a false positive rate (FPR) of only 0.1%. We quantify the detection completeness of Local Volume dwarf galaxies across a three-dimensional parameter space defined by absolute magnitude ($M_V$), half-light radius ($R_h$), and heliocentric distance, based on simulated single-exposure CSST wide-field imaging survey data. For unresolved or semi-resolved dwarf galaxies, our method achieves a significantly deeper absolute magnitude detection limit compared to catalog-based approaches, reaching $M_V = -7$ within 10 \Mpc. By combining this image-based approach with traditional stellar catalog-based "matched filter" techniques, our automated framework established in this work can identify dwarf galaxies within 20 \Mpc for the CSST mission.

astro-ph.GA↗

High Precision RF Pulse Shaping with Direct RF Sampling for Future Linear Accelerators

In various of particle accelerator designs, amplitude and phase modulation methods are commonly applied to shape the RF pulses for implementing pulse compressors or compensating for the fluctuations introduced by the high-power RF components and beam loading effects. Phase modulations are typically implemented with additional phase shifters that require drive or control electronics. With our recent next-generation LLRF (NG-LLRF) platform developed based on direct RF sampling technology of RF system-on-chip (RFSoC) devices, RF pulse shaping can be realized without the analogue phase shifters, which can significantly simplify the system architecture. We performed a range of high-power experiments in the C-band to evaluate the RF pulse-shaping capabilities of the NG-LLRF system at different stages of the RF circuits. In this paper, the high-power characterization results with the Cool Copper Collider (C3) structure driven by RF pulses with different modulation schemes will be described. With the pulse modulation and demodulation completely implemented in the digital domain, the RF pulse shaping schemes can be rapidly adapted for X-band structures simply by adding analogue mixers.

physics.acc-ph↗

Next Generation LLRF Control and Monitoring System for S-Band Linear Accelerators

The low-level RF (LLRF) systems for S-band linear accelerating structures are typically implemented with heterodyne base architectures. We have developed and characterized the next generation LLRF (NG-LLRF) based on the RF system-on-chip (RFSoC) for C-band accelerating structures, and the platform delivered the pulse-to-pulse fluctuation levels considerably better than the requirement of the targeted applications. The NG-LLRF system uses the direct RF sampling technique of the RFSoC, which significantly simplified the architecture compared to the conventional LLRF. We have extended the frequency range of the NG-LLRF to S-band and experimented with different RFSoC devices and system designs to meet the more stringent requirements for S-band LLRF applications. In this paper, the characterization results of the platform with different system architectures will be summarized and the high-power test results of the NG-LLRF with the S-band accelerating structure in the Next Linear Collider Test Accelerator (NLCTA) test facility at the SLAC National Accelerator Laboratory will be presented and analyzed.

physics.acc-ph↗

Distance estimation of the high-velocity cloud Anti-Center Shell

High-velocity clouds (HVCs) are interstellar gas clouds whose velocities are incompatible with Galactic rotation. Since the first discovery of HVCs in 1963, their origins have been debated for decades but are still not settled down, because of the lack of vital parameters of HVCs, e.g., the distance. In this work, we determined the distance to the high-velocity cloud, namely the Anti-Center Shell (ACS). We trace the ACS with extinction derived from K-giant stars with known distances and with the diffuse interstellar band (DIB) feature at 5780 $\text{Å}$ fitted on spectra of O- and B-type stars with distance. As a result, we provide a lower limit distance of ACS as $\sim$8 kpc, which extends the lower limit outward by approximately 4 kpc compared to previous work. A byproduct of the DIB method is that we detected a bar-shaped structure with a unusually high positive line-of-sight velocity. Its shape extends along the (l,b)=(155,-5)$^{\circ}$ sight-line and shows a slightly increasing trend in equivalent width and velocity as the distance increases.

astro-ph.GA↗

The Initial Mass Function of the Galactic Early-type Field Stars Based on the LAMOST Survey

Research on the high-mass end of the initial mass function (IMF) has been limited due to a scarcity of samples. Recently, Large Sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST), as the most efficient spectroscopic telescope, has provided new opportunities for related research. In this study, based on approximately 70,000 main-sequence early-type stars from the LAMOST survey, we investigated the IMF of Galactic field stars at the high-mass end (1.5 < M/Msun < 7.1). First, we derived the slope of the present-day mass function (PDMF), finding after correcting for selection effect in the observed sample. We then accounted for the effects of stellar evolution and unresolved binaries to correct the PDMF back to the IMF, resulting in αini = 2.70 - 2.82. Notably, we corrected both stellar evolution and unresolved binary effects simultaneously by using binary-Star evolution code, which enhances the robustness of our results. Additionally, we investigated how different mass-ratio (q) distributions of binaries and different star formation histories of the Milky Way impact the IMF. Finally, we tested samples across different spatial scales and found that αini may exhibit a decreasing trend as the spatial scale increases, which could be attributed to variations in metallicity.

astro-ph.GA↗

A Survey on Open-Source Edge Computing Simulators and Emulators: The Computing and Networking Convergence Perspective

Edge computing, with its low latency, dynamic scalability, and location awareness, along with the convergence of computing and communication paradigms, has been successfully applied in critical domains such as industrial IoT, smart healthcare, smart homes, and public safety. This paper provides a comprehensive survey of open-source edge computing simulators and emulators, presented in our GitHub repository (https://github.com/qijianpeng/awesome-edge-computing), emphasizing the convergence of computing and networking paradigms. By examining more than 40 tools, including CloudSim, NS-3, and others, we identify the strengths and limitations in simulating and emulating edge environments. This survey classifies these tools into three categories: packet-level, application-level, and emulators. Furthermore, we evaluate them across five dimensions, ranging from resource representation to resource utilization. The survey highlights the integration of different computing paradigms, packet processing capabilities, support for edge environments, user-defined metric interfaces, and scenario visualization. The findings aim to guide researchers in selecting appropriate tools for developing and validating advanced computing and networking technologies.

cs.NI↗

The Shape and Mass of the Galactic Dark Matter Halo from the Axisymmetric Jeans Model

We explore the density profile, shape, and virial mass of the Milky Way's dark matter halo using K giants (KG) from LAMOST and SDSS/SEGUE, as well as blue horizontal branch (BHB) stars from SDSS. Incorporating Gaia DR3 proper motions, we first investigate the velocity ellipsoid distribution within the $(R, |z|)$ space. The ellipsoids projected onto the $(v_R, v_z)$ plane exhibit near-spherical alignment. We then probe the underlying dark matter distribution using the axisymmetric Jeans equations with multi-Gaussian expansion (MGE) and the spherically aligned Jeans anisotropic modelling (JAM${\rm sph}$), allowing for different flattened dark matter density models. For each model, we apply two fitting approaches: fitting the KGs and BHBs separately or fit them simultaneously as two dynamical tracers in one gravitational potential. We find consistent results on the dark matter density profiles, $r_{200}$, and $M_{200}$ within a 1-$σ$ confidence region for models constrained by KGs, BHBs, and both. We find the strongest consistency between KGs and BHBs in constraining dark matter profiles for models incorporating radially varying halo flattening ($q(r_{\rm gc})$), which suggests the Milky Way's dark matter halo shape evolves with Galactocentric distance ($r_{\rm gc}$). Specifically, the halo flattening parameter $q_h$ decreases within $r_{\rm gc} < 20$ kpc and increases for $r_{\rm gc} > 20$ kpc. In this model, $M_{\rm tot} (< 60~{\rm kpc}) = 0.533^{+0.061}_{-0.054} \times 10^{12}$ $M_{\odot}$, $r_{200}$ is $188\pm15$ kpc, with $M_{200}$ estimated at $0.820^{+0.210}_{-0.186} \times 10^{12} M_{\odot}$.

astro-ph.GA↗

Efficient Information Updates in Compute-First Networking via Reinforcement Learning with Joint AoI and VoI

Timely and efficient dissemination of service information is critical in compute-first networking systems, where user requests arrive dynamically and computing resources are constrained. In such systems, the access point (AP) plays a key role in forwarding user requests to a server based on its latest received service information. This paper considers a single-source, single-destination system and introduces an Age-and-Value-Aware (AVA) metric that jointly captures both the timeliness and the task relevance of service information. Unlike traditional freshness-based metrics, AVA explicitly incorporates variations in server-side service capacity and AP forwarding decisions, allowing more context-aware update evaluation. Building upon AVA, we propose a reinforcement learning-based update policy that learns to selectively transmit service information updates to the AP. It aims to maximize overall task success while minimizing unnecessary communications. Extensive simulations under diverse user request patterns and varying service capacities demonstrate that AVA reduces the update frequency by over 90% on average compared to baselines, with reductions reaching 98% in certain configurations. Crucially, this reduction is achieved without compromising the accuracy of task execution or the quality of decision making.

cs.NI↗

PANCAKE: Python bAsed Numerical Color-magnitude-diagram Analysis pacKagE

Stellar populations serve as a fossil record of galaxy formation and evolution, providing crucial information about the history of star formation and galaxy evolution. The color-magnitude diagram (CMD) stands out as the most accurate tool currently available for inferring the star formation histories (SFHs) of nearby galaxies with stellar-resolved multiband data. The launch of new space telescopes, including JWST, EUCLID, and the upcoming CSST and Roman, will significantly increase the number of stellar-resolved galaxies over the next decade. A user-friendly and customizable CMD fitting package would be valuable for galaxy evolution studies with these data. We develop an open-source Python-based package named \textsc{pancake}, which is fast and accurate in determining SFHs and stellar population parameters in nearby galaxies. We have validated our method via a series of comprehensive tests. First, \textsc{pancake} performs well on mock data, meanwhile the random and systematic uncertainties are quantified. Second, \textsc{pancake} performs well on observational data containing a star cluster and 38 dwarf galaxies (50 fields). Third, the star formation rate (SFR) from \textsc{pancake} is consistent with the SFR from FUV photometry. To ensure compatibility and accuracy, we have included isochrone libraries generated using PARSEC for most of the optical and near-infrared filters used in space telescopes such as HST, JWST, and the upcoming CSST.

astro-ph.GA↗

BrowseComp-ZH: Benchmarking Web Browsing Ability of Large Language Models in Chinese

As large language models (LLMs) evolve into tool-using agents, the ability to browse the web in real-time has become a critical yardstick for measuring their reasoning and retrieval competence. Existing benchmarks such as BrowseComp concentrate on English and overlook the linguistic, infrastructural, and censorship-related complexities of other major information ecosystems -- most notably Chinese. To address this gap, we introduce BrowseComp-ZH, a high-difficulty benchmark purpose-built to comprehensively evaluate LLM agents on the Chinese web. BrowseComp-ZH consists of 289 multi-hop questions spanning 11 diverse domains. Each question is reverse-engineered from a short, objective, and easily verifiable answer (e.g., a date, number, or proper noun). A two-stage quality control protocol is applied to strive for high question difficulty and answer uniqueness. We benchmark over 20 state-of-the-art language models and agentic search systems on our proposed BrowseComp-ZH. Despite their strong conversational and retrieval capabilities, most models struggle severely: a large number achieve accuracy rates below 10%, and only a handful exceed 20%. Even the best-performing system, OpenAI's DeepResearch, reaches just 42.9%. These results demonstrate the considerable difficulty of BrowseComp-ZH, where success demands not only effective retrieval strategies, but also sophisticated reasoning and information reconciliation -- capabilities that current models still struggle to master. Our dataset, construction guidelines, and benchmark results have been publicly released at https://github.com/PALIN2018/BrowseComp-ZH.

cs.CL↗

Multi-Component Ionized Gas Outflows in a Hot Dust-Obscured Galaxy W2026+0716 with Keck/OSIRIS

We present narrowband-filtered integral field unit (IFU) observations of the Hot Dust-Obscured Galaxy (Hot DOG) WISE J202615.27$+$071624.0 (hereafter W2026$+$0716) at redshift $z=2.570$ using Keck/OSIRIS. Our analysis reveals a multi-component ionized gas outflow structure in this heavily obscured AGN host galaxy. Multi-component Gaussian decomposition of the [O III] and H$α$ emission lines uncovers extremely broad and asymmetric profiles, characteristic of AGN-driven outflows. Kinematic mapping shows spatially distinct structures: the [O III] and H$α$ dominated components (with radii of $1.20 \pm 0.56$ kpc) are separated by a projected offset of $\sim 1.1$ kpc and exhibit divergent velocity regimes. The [O III] outflow reaches a velocity of 3210 $\pm$ 50 km s$^{-1}$, while the H$α$ outflow component attains 2310 $\pm$ 840 km s$^{-1}$. Dynamical modeling supports a biconical outflow structure, with [O III] and H$α$ emissions dominating separate cones and significant dust obscuration of the redshifted outflow. Their comparable momentum outflow rates and energy outflow rates suggest a potential physical connection in their driving mechanisms. Spectral energy distribution (SED) analysis reveals anomalous optical/UV excess, attributed to AGN photon scattering by dust or outflowing material, classifying W2026+0716 as a "Blue Hot DOG". The derived outflow timescale ($\sim10^{5}$ yr) aligns with the evolutionary phase of Blue Hot DOGs, suggesting AGN feedback operates persistently during this transitional stage.

astro-ph.GA↗

Unveiling a young thick disk in the Milky Way

The thickness of a galaxy's disk provides a valuable probe of its formation and evolution history. Observations of the Milky Way and local galaxies have revealed an ubiquitous disk structure with two distinctive components: an old thick disk and a relatively young thin disk. The formation of this dual-disk structure and the mechanisms that develop the thickness of the disk are still unclear. Whether the disk thickness inherit from the birth environment or is established through secular dynamical heating after formation is under debate. In this work we identify a relatively young ($\sim$6.6 billion years old) geometric thick disk in the Milky Way, with a scale height of $0.64$ kpc at the Solar Circle. This young thick component exhibits comparable thickness and flaring strength to the canonical old thick disk but is more radially extended and systematically younger. We also identify thin disk components that formed before and after this young thick disk. Detailed analysis of the solar vicinity structure suggests that the young thick disk marks the onset of a new phase of upside-down disk formation. These findings strongly discount the role of secular dynamical heating and support a turbulent, bursty birth environment as the primary mechanism behind thick disk formation. The existence of two thick disk components suggests that the Milky Way has undergone at least two episodes of turbulent and bursty star formation, likely triggered by galaxy mergers.

astro-ph.GA↗

Bidirectional Linear Recurrent Models for Sequence-Level Multisource Fusion

Sequence modeling is a critical yet challenging task with wide-ranging applications, especially in time series forecasting for domains like weather prediction, temperature monitoring, and energy load forecasting. Transformers, with their attention mechanism, have emerged as state-of-the-art due to their efficient parallel training, but they suffer from quadratic time complexity, limiting their scalability for long sequences. In contrast, recurrent neural networks (RNNs) offer linear time complexity, spurring renewed interest in linear RNNs for more computationally efficient sequence modeling. In this work, we introduce BLUR (Bidirectional Linear Unit for Recurrent network), which uses forward and backward linear recurrent units (LRUs) to capture both past and future dependencies with high computational efficiency. BLUR maintains the linear time complexity of traditional RNNs, while enabling fast parallel training through LRUs. Furthermore, it offers provably stable training and strong approximation capabilities, making it highly effective for modeling long-term dependencies. Extensive experiments on sequential image and time series datasets reveal that BLUR not only surpasses transformers and traditional RNNs in accuracy but also significantly reduces computational costs, making it particularly suitable for real-world forecasting tasks. Our code is available here.

cs.LG↗

A millisecond integrated quantum memory for photonic qubits

Quantum memories for light are essential building blocks for quantum repeaters and quantum networks. Integrated operations of quantum memories could enable scalable application with low-power consumption. However, the photonic quantum storage lifetime in integrated optical waveguide has so far been limited to tens of microseconds, falling short of the requirements for practical applications. Here, we demonstrate quantum storage of photonic qubits for 1.021 ms based on a laser-written optical waveguide fabricated in a 151Eu3+:Y2SiO5 crystal. Spin dephasing of 151Eu3+ is mitigated through dynamical decoupling applied via on-chip electric waveguides and we obtain a storage efficiency of 12.0(0.5)% at 1.021 ms, which is a demonstration of integrated quantum memories that outperforms the efficiency of a simple fiber delay line. Such long-lived waveguide-based quantum memory could support applications in quantum repeaters, and further combination with critical magnetic fields could enable potential application as transportable quantum memories.

quant-ph↗

Zero-Shot Cross-Domain Code Search without Fine-Tuning

Code search aims to retrieve semantically relevant code snippets for natural language queries. While pre-trained language models (PLMs) have shown remarkable performance in this task, they struggle in cross-domain scenarios, often requiring costly fine-tuning or facing performance drops in zero-shot settings. RAPID, which generates synthetic data for model fine-tuning, is currently the only effective method for zero-shot cross-domain code search. Despite its effectiveness, RAPID demands substantial computational resources for fine-tuning and needs to maintain specialized models for each domain, underscoring the need for a zero-shot, fine-tuning-free approach for cross-domain code search. The key to tackling zero-shot cross-domain code search lies in bridging the gaps among domains. In this work, we propose to break the query-code matching process of code search into two simpler tasks: query-comment matching and code-code matching. Our empirical study reveals the strong complementarity among the three matching schemas in zero-shot cross-domain settings, i.e., query-code, query-comment, and code-code matching. Based on the findings, we propose CodeBridge, a zero-shot, fine-tuning-free approach for cross-domain code search. Specifically, CodeBridge uses Large Language Models (LLMs) to generate comments and pseudo-code, then combines query-code, query-comment, and code-code matching via PLM-based similarity scoring and sampling-based fusion. Experimental results show that our approach outperforms the state-of-the-art PLM-based code search approaches, i.e., CoCoSoDa and UniXcoder, by an average of 21.4% and 24.9% in MRR, respectively, across three datasets. Our approach also yields results that are better than or comparable to those of the zero-shot cross-domain code search approach RAPID, which requires costly fine-tuning.

cs.SE↗

ESPPU INPUT: C$^3$ within the "Linear Collider Vision"

The Linear Collider Vision calls for a Linear Collider Facility with a physics reach from a Higgs Factory to the TeV-scale with $e^+e^{-}$ collisions. One of the technologies under consideration for the accelerator is a cold-copper distributed-coupling linac capable of achieving high gradient. This technology is being pursued by the C$^3$ collaboration to understand its applicability to future colliders and broader scientific applications. In this input we share the baseline parameters for a C$^3$ Higgs-factory and the energy reach of up to 3 TeV in the 33 km tunnel foreseen under the Linear Collider Vision. Recent results, near-term plans and future R\&D needs are highlighted.

physics.acc-ph↗

AdaCoder: An Adaptive Planning and Multi-Agent Framework for Function-Level Code Generation

Recently, researchers have proposed many multi-agent frameworks for function-level code generation, which aim to improve software development productivity by automatically generating function-level source code based on task descriptions. A typical multi-agent framework consists of Large Language Model (LLM)-based agents that are responsible for task planning, code generation, testing, debugging, etc. Studies have shown that existing multi-agent code generation frameworks perform well on ChatGPT. However, their generalizability across other foundation LLMs remains unexplored systematically. In this paper, we report an empirical study on the generalizability of four state-of-the-art multi-agent code generation frameworks across six open-source LLMs with varying parameter sizes, architectures, and performance levels. Our study reveals the unstable generalizability of existing frameworks on diverse foundation LLMs. Based on the findings obtained from the empirical study, we propose AdaCoder, a novel adaptive planning, multi-agent framework for function-level code generation. AdaCoder has two phases. Phase-1 is an initial code generation step without planning, which uses an LLM-based coding agent and a script-based testing agent to unleash LLM's native power, identify cases beyond LLM's power, and determine the errors hindering execution. Phase-2 adds a rule-based debugging agent and an LLM-based planning agent for iterative code generation with planning. Our evaluation shows that AdaCoder achieves higher generalizability on diverse LLMs. Compared to the best baseline MapCoder, AdaCoder is on average 27.69% higher in Pass@1, 16 times faster in inference, and 12 times lower in token consumption.

cs.SE↗