SearcharxivSearch

arXiv subjects

Dongsheng Liu

Publications and source records attributed to Dongsheng Liu.

At least 19 recordsLinked to original sources

UltraX: Refining Pre-Training Data at Scale with Adaptive Programmatic Editing

As available training data approaches its physical limit, gains from Scaling Laws have begun to diminish. Consequently, improving Large Language Models (LLMs) now depends less on data expansion and more on higher-quality data utilization. However, in the context of large-scale corpora, existing refinement methodologies face significant limitations in quality, efficiency, and reliability: Rule-based approaches are constrained by fixed heuristics and struggle with instance-level variations; LLM-based approaches improve quality but fail to meet the efficiency and reliability requirements of large-scale data processing. To address these challenges, we propose UltraX, a function-calling refinement framework for large-scale pre-training data that completes the editing function space by introducing insertion in addition to deletion and modification, enabling fine-grained instance-level editing. Specifically, UltraX builds a reliable program-supervision generation pipeline. In this pipeline, dataset-adaptive prompt optimization first guides an expert LLM to produce high-quality end-to-end refined texts, and Line Alignment Mapping and Dynamic Context Replacement then convert original-refined text pairs into structured program supervision. Meanwhile, UltraX improves supervision quality and stabilizes the training distribution with low-confidence example filtering and ratio-controlled sampling by operation combination. During inference and execution, it normalizes and validates model outputs through sliding-window prediction, global operation aggregation, and systematic post-processing, improving the stability and reliability of large-scale execution. Experiments show that UltraX achieves the highest average performance across all corpora and also matches or surpasses baselines with fewer training tokens, demonstrating stronger data efficiency and refinement reliability.

cs.CL

When Is the Same Model Not the Same Service? A Measurement Study of Hosted Open-Weight LLM APIs

Open-weight large language models (LLMs) are usually named as model artifacts, but production users often consume them as hosted API services. This paper argues that the operational unit is a service object: a provider-specific, time-varying endpoint defined by model variant, protocol behavior, context capacity, listed price, latency and throughput distribution, reliability, and task feasibility. Using sampled request logs, provider metadata, compatibility probes, pricing snapshots, and continuous latency measurements collected by AI Ping during Q4 2025, we study how this service layer changes the meaning of "the same model." Three empirical patterns emerge. First, observed demand is concentrated but persistent across versions: in the displayed family aggregate, the largest family carries 32.0% of relative demand and the top five carry 87.4%, with a Gini coefficient of 0.693, while older variants remain active after newer releases. Second, supply and use separate: provider listing breadth does not imply realized adoption, and listed prices are more anchored than latency, throughput, context length, protocol support, and error semantics. Third, task mix matters: applications induce different token-length regimes, so provider choice is a constrained decision over provider-model-task-time tuples rather than a lookup by model name. In two representative counterfactuals under observed feasibility constraints, routing lowers Qwen3-32B cost by 37.8% and raises DeepSeek-V3.2 average throughput by about 90% relative to direct official access. The results support a measurement view of hosted open-weight LLMs as heterogeneous services, not static catalog entries. We open-source the measurement methodology and reproduction artifacts at https://github.com/haoruilee/llm_api_measurement_study to support result reproduction.

cs.PF

Uncovering Entity Identity Confusion in Multimodal Knowledge Editing

Multimodal knowledge editing (MKE) aims to correct the internal knowledge of large vision-language models after deployment, yet the behavioral patterns of post-edit models remain underexplored. In this paper, we identify a systemic failure mode in edited models, termed Entity Identity Confusion (EIC): edited models exhibit an absurd behavior where text-only queries about the original entity's identity unexpectedly return information about the new entity. To rigorously investigate EIC, we construct EC-Bench, a diagnostic benchmark that directly probes how image-entity bindings shift before and after editing. Our analysis reveals that EIC stems from existing methods failing to distinguish between Image-Entity (I-E) binding and Entity-Entity (E-E) relational knowledge in the model, causing models to overfit E-E associations as a shortcut: the image is still perceived as the original entity, with the new entity's name serving only as a spurious identity label. We further explore potential mitigation strategies, showing that constraining edits to the model's I-E processing stage encourages edits to act more faithfully on I-E binding, thereby substantially reducing EIC. Based on these findings, we discuss principled desiderata for faithful MKE and provide methodological guidance for future research.

cs.CL

A High Performance and Efficient Post-Quantum Crypto-Processor for FrodoKEM

FrodoKEM is a lattice-based post-quantum key encapsulation mechanism (KEM). It has been considered for standardization by the International Organization for Standardization (ISO) due to its robust security profile. However, its hardware implementation exhibits a weakness of high latency and heavy resource burden, hindering its practical application. Moreover, diverse usage scenarios call for comprehensive functionality. To address these challenges, this paper presents a high-performance and efficient crypto-processor for FrodoKEM. A multiple-instruction overlapped execution scheme is introduced to enable efficient multi-module scheduling and minimize operational latency. Furthermore, a high-speed, reconfigurable parallel multiplier array is integrated to handle intensive matrix computations under diverse computation patterns, significantly enhancing hardware efficiency. In addition, a compact memory scheduling strategy shortens the lifespan of intermediate matrices, thereby reducing overall storage requirements. The proposed design provides full support for all FrodoKEM security levels and protocol phases. It consumes 13467 LUTs, 6042 FFs, and 14 BRAMs on an Artix-7 FPGA and achieves the fastest reported execution time. Compared with state-of-the-art hardware implementations, our design improves the area-time product (ATP) by 1.75-2.00 times.

cs.CR

Autonomous Navigation of an Ultrasound Probe Towards Standard Scan Planes with Deep Reinforcement Learning

Autonomous ultrasound (US) acquisition is an important yet challenging task, as it involves interpretation of the highly complex and variable images and their spatial relationships. In this work, we propose a deep reinforcement learning framework to autonomously control the 6-D pose of a virtual US probe based on real-time image feedback to navigate towards the standard scan planes under the restrictions in real-world US scans. Furthermore, we propose a confidence-based approach to encode the optimization of image quality in the learning process. We validate our method in a simulation environment built with real-world data collected in the US imaging of the spine. Experimental results demonstrate that our method can perform reproducible US probe navigation towards the standard scan plane with an accuracy of $4.91mm/4.65^\circ$ in the intra-patient setting, and accomplish the task in the intra- and inter-patient settings with a success rate of $92\%$ and $46\%$, respectively. The results also show that the introduction of image quality optimization in our method can effectively improve the navigation performance.

cs.RO

On the Role of Flexibility in Linker-Mediated DNA Hydrogels

Three-dimensional DNA networks, composed of tri- or higher valent nanostars with sticky, single-stranded DNA overhangs, have been previously studied in the context of designing thermally responsive, viscoelastic hydrogels. In this work, we use linker-mediated gels, where the sticky ends of two trivalent nanostars are connected through the complementary sticky ends of a linear DNA duplex. We can design this connection to be either rigid or flexible by introducing flexible, non-binding bases. The additional flexiblity provided by these non-binding bases influences the effective elasticity of the percolating gel formed at low temperatures. Here we show that by choosing the right length of the linear duplex and non-binding flexible joints, we obtain a completely different phase behaviour to that observed for rigid linkers. In particular, we use dynamic light scattering as microrheological tool to monitor the self-assembly of DNA nanostars with linear linkers as a function of temperature. While we observe classical gelation when using rigid linkers, the presence of flexible joints leads to a cluster fluid with reduced viscosity. Using both the oxDNA model and a coarse-grained simulation to investigate the nanostar-linker topology, we hypothesise on the possible structure formed by the DNA clusters.

physics.bio-ph

Symmetries of the pseudo-diffusion equation, and its unconventional 2-sided kernel

We determine by two related methods the invariance algebra $\g$ of the \emph{`pseudo-diffusion equation'} (PSDE) $$ L~Q \equiv \left[\frac {\partial}{\partial t} -\frac 1 4 \left(\frac {\partial^2}{\partial x^2} -\frac 1 {t^2} \frac {\partial^2}{\partial p^2}\right)\right]~Q(x,p,t)=0, $$ which describes the behavior of the $Q$ functions in the $(x,p)$-phase space as a function of a squeeze parameter $y$, where $t=e^{2y}$. The algebra turns out to be isomorphic to that of its constant coefficient version. Relying on this isomorphism we construct a local point transformation which maps the factor $t^{-2}$ to 1. We show that any generalized version $u_t-u_{xx}+ b(t) u_{yy}=0$ of PSDE has a smaller symmetry algebra than $\g$, except for $b(t)$ equals to a constant or it is proportional to $t^{-2}$. We apply the group elements $G_i(\ga) := \exp[\ga A_i]$ and obtain new solutions of the PSDE from simple ones, and interpret the physics of some of the results. We make use of the `factorization property' of the PSDE to construct its \textit{`2-sided kernel'}, because it has to depend on two times, $t_0 < t < t_1$. We include a detailed discussion of the identification of the Lie algebraic structure of the symmetry algebra $\g$, and its contraction from $\su(1,1)\oplus\so(3,1)$.

math-ph

Unfolding mechanism and the free energy landscape of a single stranded DNA i-motif

We present Molecular Dynamics simulations of a single stranded unprotonated DNA i-motif in explicit solvent. Our results indicate that the native structure in non-acidic solution at 300 K is unstable and completely vanishes on a time scale up to 10 ns. Two unfolding mechanisms with decreasing connectivity between the initially interacting nucleobases can be identified where one pathway is characterized as entropically more favorable. The entropic preference can be mainly explained by strong water ordering effects due to hydrogen bonds for several occurring structures along the pathways. Finally we are able to indicate via free energy calculations the most stable configurations belonging to distinct hairpin structures in good agreement to experimental results.

physics.bio-ph

High temperature unfolding simulations of a single stranded DNA i-motif

We present the results of high temperature 500 K Molecular Dynamics simulations of the DNA i-motif. The essential dynamics and the main unfolding pathways are compared to a biased metadynamics simulation at 300 K. Our results indicate a remarkable agreement of the concerted motion at both temperatures. The transition can be described by a few number of eigenvectors indicating a simple unfolding process. Two main mechanisms for the unfolding pathway at 500 K can be detected which are in good agreement to the results of the biased simulation at 300 K.

physics.bio-ph

Prime ideals in decomposable lattices

A distributive lattice $L$ with minimum element $0$ is called decomposable lattice if $a$ and $b$ are not comparable elements in $L$ there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b), b=\overline{b}\vee(a\wedge b)$ and $\overline{a}\wedge \overline{b}=0$. The main purpose of this paper is to investigate prime ideals, minimal prime ideals and special ideals of a decomposable lattice. These are keys to understand the algebraic structure of decomposable lattices.

math.CO

The structure of decomposable lattices determined by their prime ideals

A distributive lattice $L$ with minimum element $0$ is called decomposable if $a$ and $b$ are not comparable elements in $L$ then there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b), b=\overline{b}\vee(a\wedge b)$ and $\overline{a}\wedge \overline{b}=0$. The main purpose of this paper is to study the structure of decomposable lattices determined by their prime ideals. The properties for five special decomposable lattices are derived.

math.GR

Three Dimensional Nonlinear Dynamics of Slender Structures: Cosserat Rod Element Approach

In this paper, the modelling strategy of a Cosserat rod element (CRE) is addressed systematically for 3-dimensional dynamical analysis of slender structures. We employ the exact nonlinear kinematic relationships in the sense of Cosserat theory, and adopt the Bernoulli hypothesis. For the sake of simplicity, the Kirchoff constitutive relations are adopted to provide an adequate description of elastic properties in terms of a few elastic moduli. A deformed configuration of the rod is described by the displacement vector of the deformed centroid curves and an orthonormal moving frame, rigidly attached to the cross-section of the rod. The position of the moving frame relative to the inertial frame is specified by the rotation matrix, parametrized by a rotational vector. The approximate solutions of the nonlinear partial differential equations of motion in quasi-static sense are chosen as the shape functions with up to third order nonlinear terms of generic nodal displacements. Based on the Lagrangian constructed by the Cosserat kinetic energy and strain energy expressions, the principle of virtual work is employed to derive the ordinary differential equations of motion with third order nonlinear generic nodal displacements. A simple example is presented to illustrate the use of the formulation developed here to obtain the lower order nonlinear ordinary differential equations of motion of a given structure. The corresponding nonlinear dynamical responses of the structures have been presented through numerical simulations by Matlab software.

math.FA

A note on discrete monotonic dynamical systems

We give a upper bound of Lebesgue measure $V(S(f,h,Ω))$ of the set $S(f,h,Ω)$ of points $q\in Q_h^d$ for which the triple $(h,q,Ω)$ is dynamically robust when $f$ is monotonic and satisfies certain condition on some compact subset $Ω\in \mathbb{R}^d$.

math-ph

Asymptotic expansion for cycles in homology classes for graphs

In this paper we give an asymptotic expansion including error terms for the number of cycles in homology classes for connected graphs. Mainly, we obtain formulae about the coefficients of error terms which depend on the homology classes and give two examples of how to calculate the coefficient of first error term.

math-ph

On nonleptonic decays of supermultiplets

By describing strong interactions between hadrons via a relativistic supermultiplet scheme and regarding weak interactions as a perturbation thereof, we derive expressions for nonleptonic weak decay amplitudes in terms of constituent quark masses and CKM angles, with no other parameters. Application of this method leads to $ΔI=1/2$ dominance in some pseudoscalar meson decays if one scales down the couplings of heavy particles by $\sqrt{M}$ mass factors, in keeping with heavy quark theory expectations. However, certain B and D decay processes to kaons are badly predicted and point to substantial soft gluon renormalization effects in W-quark interactions.

hep-ph

Electromagnetic and gravitational decay of the Higgs boson

The decays of a scalar particle, of either parity, into two photons or into two gravitons are evaluated. The effective interactions are of the form $ϕFF, ϕF\tilde{F}$ or $ϕRR,ϕR\tilde{R}$; in particular, Higgs boson decay into gravitons cannot be adduced to an interaction $ϕR$, as has been recently claimed.

hep-ph

Meson PVV Interactions are determined by Quark Loops

We show that all abnormal parity three-body meson interactions can be adequately described by quark loops, evaluated at zero external momentum, with couplings determined by $U(N_f)$ symmetry. We focus primarily on radiative meson decays which involve one pseudoscalar. The agreement with experiment for non-rare decays is surprisingly good and requires very few parameters, namely the coupling constants $g_{πqq}$ and $g_{ρqq}$ and some mixing angles. This agreement extends to some three-body decays that are dominated by pion pairs in a P-wave state.

hep-ph