Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
17works
0followers
22topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

17 published item(s)

preprint2026arXiv

High-Rank Structured Modulation for Parameter-Efficient Fine-Tuning

As the number of model parameters increases, parameter-efficient fine-tuning (PEFT) has become the go-to choice for tailoring pre-trained large language models. Low-rank Adaptation (LoRA) uses a low-rank update method to simulate full parameter fine-tuning, which is widely used to reduce resource requirements. However, decreasing the rank encounters challenges with limited representational capacity when compared to full parameter fine-tuning. We present \textbf{SMoA}, a high-rank \textbf{S}tructured \textbf{MO}dulation \textbf{A}dapter that uses fewer trainable parameters while maintaining a higher rank, thereby improving the model's representational capacity and offering improved performance potential. The core idea is to freeze the original pretrained weights and selectively amplify or suppress important features of the original weights across multiple subspaces. The subspace mechanism provides an efficient way to increase the capacity and complexity of a model. We conduct both theoretical analyses and empirical studies on various tasks. Experiment results show that SMoA outperforms LoRA and its variants on 10 tasks, with extensive ablation studies validating its effectiveness.

preprint2026arXiv

SHM-Agents: A Generalist-Specialist Integrated Agent System for Structural Health Monitoring

Artificial intelligence is increasingly used to simplify complex tasks. In engineering applications of structural health monitoring (SHM), existing specialized algorithms, while effective, often face high implementation barriers, limited interoperability and complex training procedures. To overcome these challenges, this paper proposes SHM-Agents, a generalist-specialist agent system that integrates the reasoning and planning abilities of large language models with the problem-solving strengths of specialized algorithms. SHM-Agents enables end-to-end execution of single and combined SHM tasks via natural language, supports deep learning pre-training to simplify deployment and allows flexible expansion through a modular design. Experiments on a long-span cable-stayed bridge show that SHM-Agents can accurately and efficiently perform diverse SHM tasks, including data anomaly diagnosis and recovery, signal processing, statistical analysis, modal identification, damage identification, finite element model updating, vehicle load modeling, response calculation, reliability assessment, fatigue estimation and bridge knowledge Q\&A.

preprint2026arXiv

SwiftMem: Fast Agentic Memory via Query-aware Indexing

Agentic memory systems have become critical for enabling LLM agents to maintain long-term context and retrieve relevant information efficiently. However, existing memory frameworks suffer from a fundamental limitation: they perform exhaustive retrieval across the entire storage layer regardless of query characteristics. This brute-force approach creates severe latency bottlenecks as memory grows, hindering real-time agent interactions. We propose SwiftMem, a query-aware agentic memory system that achieves sub-linear retrieval through specialized indexing over temporal and semantic dimensions. Our temporal index enables logarithmic-time range queries for time-sensitive retrieval, while the semantic DAG-Tag index maps queries to relevant topics through hierarchical tag structures. To address memory fragmentation during growth, we introduce an embedding-tag co-consolidation mechanism that reorganizes storage based on semantic clusters to improve cache locality. Experiments on LoCoMo and LongMemEval benchmarks demonstrate that SwiftMem achieves 47$\times$ faster search compared to state-of-the-art baselines while maintaining competitive accuracy, enabling practical deployment of memory-augmented LLM agents.

preprint2024arXiv

StreamVC: Real-Time Low-Latency Voice Conversion

We present StreamVC, a streaming voice conversion solution that preserves the content and prosody of any source speech while matching the voice timbre from any target speech. Unlike previous approaches, StreamVC produces the resulting waveform at low latency from the input signal even on a mobile platform, making it applicable to real-time communication scenarios like calls and video conferencing, and addressing use cases such as voice anonymization in these scenarios. Our design leverages the architecture and training strategy of the SoundStream neural audio codec for lightweight high-quality speech synthesis. We demonstrate the feasibility of learning soft speech units causally, as well as the effectiveness of supplying whitened fundamental frequency information to improve pitch stability without leaking the source timbre information.

preprint2023arXiv

Anonymous Pattern Molecular Fingerprint and its Applications on Property Identification

Molecular fingerprints are significant cheminformatics tools to map molecules into vectorial space according to their characteristics in diverse functional groups, atom sequences, and other topological structures. In this paper, we set out to investigate a novel molecular fingerprint \emph{Anonymous-FP} that possesses abundant perception about the underlying interactions shaped in small, medium, and large molecular scale links. In detail, the possible inherent atom chains are sampled from each molecule and are extended in a certain anonymous pattern. After that, the molecular fingerprint \emph{Anonymous-FP} is encoded in virtue of the Natural Language Processing technique \emph{PV-DBOW}. \emph{Anonymous-FP} is studied on molecular property identification and has shown valuable advantages such as rich information content, high experimental performance, and full structural significance. During the experimental verification, the scale of the atom chain or its anonymous manner matters significantly to the overall representation ability of \emph{Anonymous-FP}. Generally, the typical scale $r = 8$ enhances the performance on a series of real-world molecules, and specifically, the accuracy could level up to above $93\%$ on all NCI datasets.

preprint2022arXiv

An FPGA Based energy correction method for one-to-one coupled PET detector: model and evaluation

A PET scanner based on silicon photomultipliers (SiPMs) has been widely used as an advanced nuclear medicine imaging technique that yields quantitative images of regional in vivo biology and biochemistry. The compact size of the SiPM allows direct one to one coupling between the scintillation crystal and the photosensor, yielding better timing and energy resolutions than the light sharing methods that have to be used in photomultiplier tube (PMT) PET systems. To decrease the volume of readout electronics, a front end multiplexer with position decoder is a common choice for the one to one system without a highly integrated application specific integrated circuit (ASIC). However, in this case we cannot measure each crystal's deposited energy inspired by an annihilation photon, so the inter-crystal scatter (ICS) events will lead to the crystal mispositioning and then deteriorate the detector intrinsic resolution. Besides, considering the events rejection within the energy window resulting from the gain dispersion and nonlinear outputs of the SiPMs, an energy correction mechanism is needed. Yet, lack of the information of each crystal's energy will introduce large energy correction error for the ICS events. For this issue, an online energy correction mechanism implemented on a Kintext-7 Field Programmable Gate Array (FPGA) device is presented in this paper. Experiments in the laboratory were performed using an 8 x 8 segmented LYSO crystals coupled with an 8 x 8 SiPM (J-series, from ON Semiconductor) array which is under 22Na point source excitation. Test results indicate that both the energy of the non-ICS and ICS events can be precisely corrected and the energy resolution is better than 12 %. We also applied this method to an actual clinical PET scanner under a 68Ge line source to verify its multi-channel reliability.

preprint2022arXiv

Elliptic soliton solutions: $τ$ functions, vertex operators and bilinear identities

We establish a bilinear framework for elliptic soliton solutions which are composed by the Lamé-type plane wave factors. $τ$ functions in Hirota's form are derived and vertex operators that generate such $τ$ functions are presented. Bilinear identities are constructed and an algorithm to calculate residues and bilinear equations is formulated. These are investigated in detail for the KdV equation and sketched for the KP hierarchy. Degenerations by the periods of elliptic functions are investigated, giving rise to the bilinear framework associated with trigonometric/hyperbolic and rational functions. Reductions by dispersion relation are considered by employing the so-called elliptic $N$-th roots of the unity. $τ$ functions, vertex operators and bilinear equations of the KdV hierarchy and Boussinesq equation are obtained from those of the KP. We also formulate two ways to calculate bilinear derivatives involved with the Lamé-type plane wave factors, which shows that such type of plane wave factors result in quasi-gauge property of bilinear equations.

preprint2022arXiv

Solving the Quispel-Roberts-Thompson maps using Kajiwara-Noumi-Yamada's representation of elliptic curves

It is well known that the dynamical system determined by a Quispel-Roberts-Thompson map (a QRT map) preserves a pencil of biquadratic polynomial curves on ${\mathbb{CP}}^1 \times {\mathbb{CP}}^1$. In most cases this pencil is elliptic, i.e. its generic member is a smooth algebraic curve of genus one, and the system can be solved as a translation on the elliptic fiber to which the initial point belongs. However, this procedure is rather complicated to handle, especially in the normalization process. In this paper, for a given initial point on an invariant elliptic curve, we present a method to construct the solution directly in terms of the Weierstrass sigma function, using Kajiwara-Noumi-Yamada's parametric representation of elliptic curves.

preprint2022arXiv

Superconducting LaP2H2 with graphenelike phosphorus layers

Novel structural building blocks in compounds could induce interesting physical and chemical properties. Although phosphorus tends to form very different motifs, the existence of lone pair electrons has always prevented the formation of graphenelike structures. Here, the application of first-principles swarm structural calculations has allowed us to predict the stability of pressure-induced hexagonal LaP2H2 containing graphenelike phosphorus, which derives from the trigonal bipyramid configuration of P atoms regulated by symmetric hydrogen bonds. LaP2 in LaP2H2 has the same configuration as MgB2, and P and H atoms form a three-dimensional framework as H3S. Interestingly, LaP2H2 shows a superconductivity dominated by the graphenelike phosphorus layer and its coupling with La atoms. On the other hand, LaP2H2 is not only superconducting at a lower pressure than the H-rich LaPH6, but it also shows a superconducting transition temperature three times higher. Our work provides an example which extends the landscape of conventional superconductors at lower pressures.

preprint2021arXiv

BEDS: Bagging ensemble deep segmentation for nucleus segmentation with testing stage stain augmentation

Reducing outcome variance is an essential task in deep learning based medical image analysis. Bootstrap aggregating, also known as bagging, is a canonical ensemble algorithm for aggregating weak learners to become a strong learner. Random forest is one of the most powerful machine learning algorithms before deep learning era, whose superior performance is driven by fitting bagged decision trees (weak learners). Inspired by the random forest technique, we propose a simple bagging ensemble deep segmentation (BEDs) method to train multiple U-Nets with partial training data to segment dense nuclei on pathological images. The contributions of this study are three-fold: (1) developing a self-ensemble learning framework for nucleus segmentation; (2) aggregating testing stage augmentation with self-ensemble learning; and (3) elucidating the idea that self-ensemble and testing stage stain augmentation are complementary strategies for a superior segmentation performance. Implementation Detail: https://github.com/xingli1102/BEDs.

preprint2021arXiv

Human Action Recognition Based on Multi-scale Feature Maps from Depth Video Sequences

Human action recognition is an active research area in computer vision. Although great process has been made, previous methods mostly recognize actions based on depth data at only one scale, and thus they often neglect multi-scale features that provide additional information action recognition in practical application scenarios. In this paper, we present a novel framework focusing on multi-scale motion information to recognize human actions from depth video sequences. We propose a multi-scale feature map called Laplacian pyramid depth motion images(LP-DMI). We employ depth motion images (DMI) as the templates to generate the multi-scale static representation of actions. Then, we caculate LP-DMI to enhance multi-scale dynamic information of motions and reduces redundant static information in human bodies. We further extract the multi-granularity descriptor called LP-DMI-HOG to provide more discriminative features. Finally, we utilize extreme learning machine (ELM) for action classification. The proposed method yeilds the recognition accuracy of 93.41%, 85.12%, 91.94% on public MSRAction3D dataset, UTD-MHAD and DHA dataset. Through extensive experiments, we prove that our method outperforms state-of-the-art benchmarks.

preprint2021arXiv

Representation Learning of Reconstructed Graphs Using Random Walk Graph Convolutional Network

Graphs are often used to organize data because of their simple topological structure, and therefore play a key role in machine learning. And it turns out that the low-dimensional embedded representation obtained by graph representation learning are extremely useful in various typical tasks, such as node classification, content recommendation and link prediction. However, the existing methods mostly start from the microstructure (i.e., the edges) in the graph, ignoring the mesoscopic structure (high-order local structure). Here, we propose wGCN -- a novel framework that utilizes random walk to obtain the node-specific mesoscopic structures of the graph, and utilizes these mesoscopic structures to reconstruct the graph And organize the characteristic information of the nodes. Our method can effectively generate node embeddings for previously unseen data, which has been proven in a series of experiments conducted on citation networks and social networks (our method has advantages over baseline methods). We believe that combining high-order local structural information can more efficiently explore the potential of the network, which will greatly improve the learning efficiency of graph neural network and promote the establishment of new learning models.

preprint2020arXiv

Driving Style Encoder: Situational Reward Adaptation for General-Purpose Planning in Automated Driving

General-purpose planning algorithms for automated driving combine mission, behavior, and local motion planning. Such planning algorithms map features of the environment and driving kinematics into complex reward functions. To achieve this, planning experts often rely on linear reward functions. The specification and tuning of these reward functions is a tedious process and requires significant experience. Moreover, a manually designed linear reward function does not generalize across different driving situations. In this work, we propose a deep learning approach based on inverse reinforcement learning that generates situation-dependent reward functions. Our neural network provides a mapping between features and actions of sampled driving policies of a model-predictive control-based planner and predicts reward functions for upcoming planning cycles. In our evaluation, we compare the driving style of reward functions predicted by our deep network against clustered and linear reward functions. Our proposed deep learning approach outperforms clustered linear reward functions and is at par with linear reward functions with a-priori knowledge about the situation.

preprint2020arXiv

Dynamic aspiration based on Win-Stay-Lose-Learn rule in Spatial Prisoner's Dilemma Gam

Prisoner's dilemma game is the most commonly used model of spatial evolutionary game which is considered as a paradigm to portray competition among selfish individuals. In recent years, Win-Stay-Lose-Learn, a strategy updating rule base on aspiration, has been proved to be an effective model to promote cooperation in spatial prisoner's dilemma game, which leads aspiration to receive lots of attention. But in many research the assumption that individual's aspiration is fixed is inconsistent with recent results from psychology. In this paper, according to Expected Value Theory and Achievement Motivation Theory, we propose a dynamic aspiration model based on Win-Stay-Lose-Learn rule in which individual's aspiration is inspired by its payoff. It is found that dynamic aspiration has a significant impact on the evolution process, and different initial aspirations lead to different results, which are called Stable Coexistence under Low Aspiration, Dependent Coexistence under Moderate aspiration and Defection Explosion under High Aspiration respectively. Furthermore, a deep analysis is performed on the local structures which cause cooperator's existence or defector's expansion, and the evolution process for different parameters including strategy and aspiration. As a result, the intrinsic structures leading to defectors' expansion and cooperators' survival are achieved for different evolution process, which provides a penetrating understanding of the evolution. Compared to fixed aspiration model, dynamic aspiration introduces a more satisfactory explanation on population evolution laws and can promote deeper comprehension for the principle of prisoner's dilemma.

preprint2020arXiv

Representation Learning of Graphs Using Graph Convolutional Multilayer Networks Based on Motifs

The graph structure is a commonly used data storage mode, and it turns out that the low-dimensional embedded representation of nodes in the graph is extremely useful in various typical tasks, such as node classification, link prediction , etc. However, most of the existing approaches start from the binary relationship (i.e., edges) in the graph and have not leveraged the higher order local structure (i.e., motifs) of the graph. Here, we propose mGCMN -- a novel framework which utilizes node feature information and the higher order local structure of the graph to effectively generate node embeddings for previously unseen data. Through research we have found that different types of networks have different key motifs. And the advantages of our method over the baseline methods have been demonstrated in a large number of experiments on citation network and social network datasets. At the same time, a positive correlation between increase of the classification accuracy and the clustering coefficient is revealed. It is believed that using high order structural information can truly manifest the potential of the network, which will greatly improve the learning efficiency of the graph neural network and promote a brand-new learning mode establishment.

preprint2020arXiv

Time-Varying and Nonlinearly Scaled Consensus of Multiagent Systems: A Generic Attracting Law Approach

This paper presents the design and analysis of the finite/fixed-time scaled consensus for multiagent systems. A study on a generic attracting law, the certain classes of nonlinear systems that admit attractors with finite/fixed-time convergence, is at first given for the consensus purpose. The estimates for the lower and upper bounds on the settling time functions are provided through the two-phase analysis. The given estimates are initial state dependent, but the durations are finite, without regarding the values that the initial states take. According to the generic attracting law, distributed protocols are proposed for multiagent systems with undirected and detail-balanced directed graphs, respectively, where the scaled strategies, including time-varying and nonlinear scales, are adopted. It is shown that the finite/fixed-time consensus for the multiagent system undertaken can still be achieved, even though both time-varying and nonlinear scales are taken among agents. Numerical simulation of two illustrative examples are given to verify effectiveness of the proposed finite-duration consensus protocols.

preprint2020arXiv

Water-induced formation of an alkali-ion dimer in cryptomelane nanorods

Tunneled metal oxides such as $α-$Mn$_8$O$_{16}$ (hollandite) have proven to be compelling candidates for charge-storage materials in high-density batteries. In particular, the tunnels can support one-dimensional chains of K$^+$ ions (which act as structure-stabilizing dopants) and H$_2$O molecules, as these chains are favored by strong H-bonds and electrostatic interactions. In this work, we examine the role of water molecules in enhancing the stability of K$^+$-doped $α-$Mn$_8$O$_{16}$ (cryptomelane). The combined experimental and theoretical analyses show that for high enough concentrations of water and tunnel-ions, H$_2$O displaces K$^+$ ions from their natural binding sites. This displacement becomes energetically favorable due to the formation of K$_2^+$ dimers, thereby modifying the stoichiometric charge of the system. These findings have potentially significant technological implications for the consideration of cryptomelane as a Li$^+$/Na$^+$ battery electrode. Our work establishes the functional role of water in altering the energetics and structural properties of cryptomelane, an observation that has frequently been overlooked in previous studies.