arXiv subjects

Huilin Li

Publications and source records attributed to Huilin Li.

8 recordsLinked to original sources

arXiv2026

GPU-Accelerated Matrix-Based Hough Transform for Online Track Reconstruction in the STCF MDC

The Super Tau-Charm Facility (STCF) is a proposed next-generation high-luminosity electron-positron collider operating at center-of-mass energies of 2-7 GeV for precision studies of tau-charm physics. Its high event rate, detector occupancy, and background level impose stringent requirements on real-time track reconstruction in MDC, particularly for low-transverse-momentum particles with strongly curved or multi-turn trajectories. To address this challenge, we develop a GPU-accelerated matrix-based Hough transform method for online track reconstruction in the STCF MDC. Following an algorithm-architecture co-design paradigm, the data representation and computational workflow of the conformal Hough transform are reformulated for GPU execution. The original irregular parameter-space computations are organized into regular matrix-based operations, and the core computations are adapted to CUDA thread organization and the GPU memory hierarchy to exploit the inherent parallelism of the Hough transform and reduce computational and data-transfer overhead. Tests on five representative simulated physics channels with nominal background overlay show an average signal retention ratio of 93.04%, while reducing the retained hit volume to 34.92% of the original level. The GPU implementation processes 1,000 events in approximately 0.14s, achieving a speedup of 151.57 x compared with the CPU baseline. These results demonstrate that the proposed method substantially improves track reconstruction throughput while preserving track-associated hits, providing a new methodological perspective for real-time track reconstruction in future high-luminosity particle-collider experiments.

hep-ex↗

arXiv2026

Neural-Network-Assisted Binary Template Construction for Matrix-Based Pattern Matching in the STCF MDC

The Super Tau-Charm Facility, operating at high luminosity, will produce high event rates and high data throughput, imposing stringent requirements on fast track finding and data reduction and compression algorithms in the High-Level Trigger. Local track segment finding in the Main Drift Chamber underpins subsequent segment combination and full track reconstruction, yet high background rates and limited detection efficiency can significantly increase the risk of false triggers and signal loss in pattern matching algorithms. This paper presents a neural-network-assisted framework for constructing binary template libraries used in matrix-based pattern matching for MDC local track segment finding. The framework formulates template construction as a differentiable multi-objective optimization problem, employing a neural network to jointly learn template parameters under multiple constraints. After training, only binary template pairs are exported and deployed into the existing bitwise pattern matching routine, requiring no neural network inference at runtime and thus preserving the deterministic, fast, and parallelizable nature of the online algorithm. Experimental results based on simulation samples demonstrate that, under limited detection efficiency, the resulting template library maintains relatively high signal retention across different transverse momentum ranges and background levels, and can be flexibly tailored to adjust the coverage range according to practical requirements. The proposed approach decouples the physics performance from the computational speed by combining the improved physics performance brought by offline neural-network-based optimization with the determinism and high speed of a conventional online algorithm, suggesting a new research direction for artificial-intelligence-enhanced online data processing in high-luminosity particle collider experiments.

hep-ex↗

arXiv2026

Spatial mixed models for assessing environmental exposure effects on the microbiome

The influence of environmental exposures, such as air pollution, on human health has become increasingly recognized. A growing body of evidence suggests that the microbiome may mediate these effects, explaining the relationship between the environment and host biology. However, the impact of environmental exposures on the microbiome is not yet fully understood, and statistical modeling in this context is challenged by complex dependency structures. In particular, microbiome data exhibit spatial dependencies across sampling regions as well as ecological correlations among microbial taxa, which, if ignored, can substantially reduce detection power, leading to missed true signals. We introduce a novel spatial mixed modeling framework for microbiome data that accounts for both region-level spatial dependency and taxon-level ecological dependency using conditional autoregressive priors. Through simulations, we demonstrate that this framework outperforms existing methods that ignore such dependencies, by achieving high detection power in feature selection while maintaining low false positive rates and reduced mean squared error in estimation. Applied to two real studies-data from Food and Microbiome Longitudinal Investigation study and lung microbiome dataset-with fine particulate matter (PM_2.5) exposures, our model identified genera, which are known to be involved in pollution-related health outcomes, as well as novel taxa that may mediate host responses to air pollution. This novel approach offers a powerful and flexible tool for uncovering biologically meaningful associations in complex environmental data.

stat.ME↗

arXiv2022

HieNet: Bidirectional Hierarchy Framework for Automated ICD Coding

International Classification of Diseases (ICD) is a set of classification codes for medical records. Automated ICD coding, which assigns unique International Classification of Diseases codes with each medical record, is widely used recently for its efficiency and error-prone avoidance. However, there are challenges that remain such as heterogeneity, label unbalance, and complex relationships between ICD codes. In this work, we proposed a novel Bidirectional Hierarchy Framework(HieNet) to address the challenges. Specifically, a personalized PageRank routine is developed to capture the co-relation of codes, a bidirectional hierarchy passage encoder to capture the codes' hierarchical representations, and a progressive predicting method is then proposed to narrow down the semantic searching space of prediction. We validate our method on two widely used datasets. Experimental results on two authoritative public datasets demonstrate that our proposed method boosts state-of-the-art performance by a large margin.

cs.AI↗

arXiv2021

A New Algorithm for Convex Biclustering and Its Extension to the Compositional Data

Biclustering is a powerful data mining technique that allows simultaneously clustering rows (observations) and columns (features) in a matrix-format data set, which can provide results in a checkerboard-like pattern for visualization and exploratory analysis in a wide array of domains. Multiple biclustering algorithms have been developed in the past two decades, among which the convex biclustering can guarantee a global optimum by formulating in as a convex optimization problem. On the other hand, the application of biclustering has not progressed in parallel with the algorithm techniques. For example, biclustering for increasingly popular microbiome research data is under-applied possibly due to its compositional constraints for each sample. In this manuscript, we propose a new convex biclustering algorithm, called the bi-ADMM, under general setups based on the ADMM algorithm, which is free of extra smoothing steps to visualize informative biclusters required by existing convex biclustering algorithms. Furthermore, we tailor it to the algorithm named biC-ADMM specifically to tackle compositional constraints confronted in microbiome data. The key step of our methods utilizes the Sylvester Equation to derive the ADMM algorithm, which is new to the clustering research. The effectiveness of the proposed methods is examined through a variety of numerical experiments and a microbiome data application.

stat.ME↗

arXiv2019

An Efficient Linkable Group Signature for Payer Tracing in Anonymous Cryptocurrencies

Cryptocurrencies, led by bitcoin launched in 2009, have obtained wide attention due to the emerging Blockchain in recent years. Anonymous cryptocurrencies are highly essential since users want to preserve their privacy when conducting transactions. However, some users might misbehave with the cover of anonymity such as rampant trafficking and extortion. Thus, it is important to balance anonymity and accountability of anonymous cryptocurrencies. In this paper, we solve this issue by proposing a linkable group signature (LGS) for signing cryptocurrency transactions, which can be used to trace a payer's identity in consortium blockchain based anonymous cryptocurrencies, in case the payer tries illegal activities. A payer keeps anonymous if he/she behaves honestly. We prove that the proposed scheme achieves full-anonymity, full-traceability and linkability in the random oracle. Implementation of the proposed LGS scheme demonstrates its high efficiency thus, can be adopted in anonymous cryptocurrencies in reality.

cs.CR↗

arXiv2015

Optimizing coverage of 3D Wireless Multimedia Sensor Networks by means of deploying redundant sensors

Coverage is one of the fundamental issues in wireless multimedia sensor networks (WMSNs). It reflects the ability of WMSNs to detect the fields. Motivated by the existing-enhancing algorithm of traditional 2D WMSNs, a new 3D WMSNs sensing model is established and a new coverage-enhancing algorithm based on this model is proposed. This algorithm defines the sensing model as trapezoidal pyramid, calculates the key parameters (tilt angle) then improves coverage ratio by optimizing it. However, there still exists redundant sensors in this optimized networks. Aiming at efficiently utilizing these redundant sensors and enhancing coverage ratio, the authors selects the redundant sensors by introducing the set cover model algorithm, further deploys them to the uncovered area following the greedy policy, so that the whole path coverage performance of WMSNs is enhanced.

cs.NI↗

arXiv2008

Parametric bootstrap approximation to the distribution of EBLUP and related prediction intervals in linear mixed models

Empirical best linear unbiased prediction (EBLUP) method uses a linear mixed model in combining information from different sources of information. This method is particularly useful in small area problems. The variability of an EBLUP is traditionally measured by the mean squared prediction error (MSPE), and interval estimates are generally constructed using estimates of the MSPE. Such methods have shortcomings like under-coverage or over-coverage, excessive length and lack of interpretability. We propose a parametric bootstrap approach to estimate the entire distribution of a suitably centered and scaled EBLUP. The bootstrap histogram is highly accurate, and differs from the true EBLUP distribution by only $O(d^3n^{-3/2})$, where $d$ is the number of parameters and $n$ the number of observations. This result is used to obtain highly accurate prediction intervals. Simulation results demonstrate the superiority of this method over existing techniques of constructing prediction intervals in linear mixed models.

math.ST↗