arXiv subjects

Weidong Li

Publications and source records attributed to Weidong Li.

At least 37 records · Page 2Linked to original sources

arXiv2025

Fatigue Behavior of High-Entropy Alloys

High-entropy alloys (HEAs) refer to alloys composed of five or more elements in equal or near-equal amounts or in an atomic concentration range of 5 to 35 atomic percent (at%). Different elemental ratios will affect the microstructures of HEAs and provide them with unique properties. Based on past research, HEAs have exhibited superior performance, relative to most conventional alloys, with respect to many properties, such as strength, toughness, corrosion resistance, magnetic behavior, etc. Among them, fatigue behavior has been a topic of focus, due to its importance in industrial applications. In this article, we summarized the research progress in the HEA-fatigue behavior in the past ten years, including experimental results and theoretical studies in subdivisions, such as high-cycle fatigue, low-cycle fatigue, fatigue-crack growth, fatigue mechanisms, etc. The influence of the processing and test methods on HEAs is described. The accuracy of several commonly used prediction models is also outlined. Finally, unresolved issues and suggestions on the direction of future research efforts are presented.

cond-mat.mtrl-sci↗

arXiv2025

A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties

The soft capacitated facility location problem (SCFLP) is a classic combinatorial optimization problem, with its variants widely applied in the fields of operations research and computer science. In the SCFLP, given a set $\mathcal{F}$ of facilities and a set $\mathcal{D}$ of clients, each facility has a capacity and an open cost, allowing to open multiple times, and each client has a demand. This problem is to find a subset of facilities in $\mathcal{F}$ and connect each client to the facilities opened, such that the total cost including open cost and connection cost is minimied. SCFLP is a NP-hard problem, which has led to a focus on approximation algorithms. Based on this, we consider a variant, that is, soft capacitated facility location problem with submodular penalties (SCFLPSP), which allows some clients not to be served by accepting the penalty cost. And we consider the integer splittable case of demand, that is, the demand of each client is served by multiple facilities with the integer service amount by each facility. Based on LP-rounding, we propose a $(λR+4)$-approximation algorithm, where $R=\frac{\max_{i \in \mathcal{F} }f_i}{\min_{i \in \mathcal{F} }f_i},λ=\frac{R+\sqrt{R^2+8R}}{2R}$. In particular, when the open cost is uniform, the approximation ratio is 6.

cs.DS↗

arXiv2025

Phase-sensitive Rydberg-atom interferometry with Floquet electromagnetically induced transparency

We design a phase-sensitive Rydberg-atom interferometry by implementing Floquet electromagnetically induced transparency (FEIT). The FEIT mixes the sidebands of a Rydberg state induced by a MHz radio frequency (RF) field and recombines them into FEIT bands. The FEIT bands act as screens to present the interference between paths with different phases, which are transitions between the sidebands and excited states. This interferometry can measure the phase of a MHz RF field without a local RF reference field. A phase reference is supplied to the atoms via a periodic electrical signal in the FEIT. We demonstrate that the MHz RF phase is measured over a full range of $2π$, and $10^{-4}$ rad accuracy is achieved. Moreover, the RF amplitude can also be measured with higher accuracy than the traditional EIT-based scheme.

quant-ph↗

arXiv2024

CEPC-on-Gaussino: an application of Gaussino simulation framework for CEPC experiment

The Circular Electron Positron Collider (CEPC) is a future Higgs factory to measure the Higgs boson properties. Like the other future experiments, the simulation software plays a crucial role in CEPC for detector designs, algorithm optimization and physics studies. Due to similar requirements, the software stack from the Key4hep project has been adopted by CEPC. As the initial application of Key4hep, a simulation framework has been developed for CEPC based on DD4hep, EDM4hep and k4FWCore since 2020. However, the current simulation framework for CEPC lacks support for the parallel computing. To benefit from the multi-threading techniques, the Gaussino project from the LHCb experiment has been chosen as the next simulation framework in Key4hep. This contribution presents the application of Gaussino for CEPC. The development of the CEPC-on-Gaussino prototype will be shown and the simulation of a tracker detector will be demonstrated.

physics.ins-det↗

arXiv2024

Muon/Pion Identification at BESIII based on Variational Quantum Classifier

In collider physics experiments, particle identification (PID), i. e. the identification of the charged particle species in the detector is usually one of the most crucial tools in data analysis. In the past decade, machine learning techniques have gradually become one of the mainstream methods in PID, usually providing superior discrimination power compared to classical algorithms. In recent years, quantum machine learning (QML) has bridged the traditional machine learning and the quantum computing techniques, providing further improvement potential for traditional machine learning models. In this work, targeting at the $μ^{\pm} /π^{\pm}$ discrimination problem at the BESIII experiment, we developed a variational quantum classifier (VQC) with nine qubits. Using the IBM quantum simulator, we studied various encoding circuits and variational ansatzes to explore their performance. Classical optimizers are able to minimize the loss function in quantum-classical hybrid models effectively. A comparison of VQC with the traditional multiple layer perception neural network reveals they perform similarly on the same datasets. This illustrates the feasibility to apply quantum machine learning to data analysis in collider physics experiments in the future.

hep-ex↗

arXiv2024

A manifold learning-based CSI feedback framework for FDD massive MIMO

Massive multi-input multi-output (MIMO) in Frequency Division Duplex (FDD) mode suffers from heavy feedback overhead for Channel State Information (CSI). In this paper, a novel manifold learning-based CSI feedback framework (MLCF) is proposed to reduce the feedback and improve the spectral efficiency for FDD massive MIMO. Manifold learning (ML) is an effective method for dimensionality reduction. However, most ML algorithms focus only on data compression, and lack the corresponding recovery methods. Moreover, the computational complexity is high when dealing with incremental data. Considering to utilize the intrinsic manifold structure where the CSI samples reside, we propose a landmark selection algorithm to describe the topological skeleton of this manifold. Based on the learned skeleton, the local patch of the incremental CSI on the manifold can be easily determined by its nearest landmarks. This motivates us to propose an incremental CSI compression and reconstruction scheme by keeping the local geometric relationships with landmarks invariant. We theoretically prove the convergence of the proposed landmark selection algorithm. Meanwhile, the upper bound on the error of approximating CSI with landmarks is derived. Simulation results under an industrial channel model of 3GPP demonstrate that the proposed MLCF outperforms existing deep learning based algorithms.

cs.IT↗

arXiv2024

Transforming Time-Varying to Static Channels: The Power of Fluid Antenna Mobility

This paper addresses the mobility problem with the assistance of fluid antenna (FA) on the user equipment (UE) side. We propose a matrix pencil-based moving port (MPMP) prediction method, which may transform the time-varying channel to a static channel by timely sliding the liquid. Different from the existing channel prediction method, we design a moving port selection method, which is the first attempt to transform the channel prediction to the port prediction by exploiting the movability of FA. Theoretical analysis shows that for the line-ofsight (LoS) channel, the prediction error of our proposed MPMP method may converge to zero, as the number of BS antennas and the port density of the FA are large enough. For a multi-path channel, we also derive the upper and lower bounds of the prediction error when the number of paths is large enough. When the UEs move at a speed of 60 or 120 km/h, simulation results show that, with the assistance of FA, our proposed MPMP method performs better than the existing channel prediction method.

cs.IT↗

arXiv2024

Wavefront Transformation-based Near-field Channel Prediction for Extremely Large Antenna Array with Mobility

This paper addresses the mobility problem in extremely large antenna array (ELAA) communication systems. In order to account for the performance loss caused by the spherical wavefront of ELAA in the mobility scenario, we propose a wavefront transformation-based matrix pencil (WTMP) channel prediction method. In particular, we design a matrix to transform the spherical wavefront into a new wavefront, which is closer to the plane wave. We also design a time-frequency projection matrix to capture the time-varying path delay. Furthermore, we adopt the matrix pencil (MP) method to estimate channel parameters. Our proposed WTMP method can mitigate the effect of near-field radiation when predicting future channels. Theoretical analysis shows that the designed matrix is asymptotically determined by the angles and distance between the base station (BS) antenna array and the scatterers or the user when the number of BS antennas is large enough. For an ELAA communication system in the mobility scenario, we prove that the prediction error converges to zero with the increasing number of BS antennas. Simulation results demonstrate that our designed transform matrix efficiently mitigates the near-field effect, and that our proposed WTMP method can overcome the ELAA mobility challenge and approach the performance in stationary setting.

cs.IT↗

arXiv2024

Low-complexity eigenvector prediction-based precoding matrix prediction in massive MIMO with mobility

In practical massive multiple-input multiple-output (MIMO) systems, the precoding matrix is often obtained from the eigenvectors of channel matrices and is challenging to update in time due to finite computation resources at the base station, especially in mobile scenarios. In order to reduce the precoding complexity while enhancing the spectral efficiency (SE), a novel precoding matrix prediction method based on the eigenvector prediction (EGVP) is proposed. The basic idea is to decompose the periodic uplink channel eigenvector samples into a linear combination of the channel state information (CSI) and channel weights. We further prove that the channel weights can be interpolated by an exponential model corresponding to the Doppler characteristics of the CSI. A fast matrix pencil prediction (FMPP) method is also devised to predict the CSI. We also prove that our scheme achieves asymptotically error-free precoder prediction with a distinct complexity advantage. Simulation results show that under the perfect non-delayed CSI, the proposed EGVP method reduces floating point operations by 80\% without losing SE performance compared to the traditional full-time precoding scheme. In more realistic cases with CSI delays, the proposed EGVP-FMPP scheme has clear SE performance gains compared to the precoding scheme widely used in current communication systems.

cs.IT↗

arXiv2024

Floquet dynamics of Rabi model beyond the counterrotating hybridized rotating wave method

Monochromatically driven two-level systems (i.e., Rabi models) are ubiquitous in various fields of physics. Though they have been exactly solved, the physical pictures in these exact solutions are not clear. Recently, approximate analytical solutions with neat physics have been obtained by using the counterrotating hybridized rotating wave (CHRW) method, which has been proven to be effective over a wider range of parameters than the previous analytical solutions. However, the CHRW depends on a parameter ξ, which has no solution in some regimes. Here we combine the double-unitary-transformation approach with the generalized Van Vleck nearly degenerate perturbation theory, and present approximate analytical results with clear physics for almost all parameter regimes, which agree well with the numerical solutions and the previous experimental results. Moreover, the dynamic frequencies of the Rabi model are regular, and the frequency with the highest Fourier amplitude changes from the Rabi frequency to 2nω with driving frequency ω and integer n, as the driving intensity increases from weak to deep-strong. In addition, we further explore the Floquet dynamics of the dissipative open Rabi model. Remarkably, the dissipations are tunable in the rotating frame, and the approximate analytical results obtained by our method are in good agreement with the numerical results in the strong driving regime. These results pave the way to quantum control using strong and deep-strong driving with applications in quantum technologies.

quant-ph↗

arXiv2024

A Data-driven dE/dx Simulation with Normalizing Flow

In high-energy physics, precise measurements rely on highly reliable detector simulations. Traditionally, these simulations involve incorporating experiment data to model detector responses and fine-tuning them. However, due to the complexity of the experiment data, tuning the simulation can be challenging. One crucial aspect for charged particle identification is the measurement of energy deposition per unit length (referred to as dE/dx). This paper proposes a data-driven dE/dx simulation method using the Normalizing Flow technique, which can learn the dE/dx distribution directly from experiment data. By employing this method, not only can the need for manual tuning of the dE/dx simulation be eliminated, but also high-precision simulation can be achieved.

hep-ex↗

arXiv2023

The Key4hep software stack: Beyond Future Higgs factories

The Key4hep project aims to provide a turnkey software solution for the full experiment lifecycle, based on established community tools. Several future collider communities (CEPC, CLIC, EIC, FCC, and ILC) have joined to develop and adapt their workflows to use the common data model EDM4hep and common framework. Besides sharing of existing experiment workflows, one focus of the Key4hep project is the development and integration of new experiment independent software libraries. Ongoing collaborations with projects such as ACTS, CLUE, PandoraPFA and the OpenDataDector show the potential of Key4hep as an experiment-independent testbed and development platform. In this talk, we present the challenges of an experiment-independent framework along with the lessons learned from discussions of interested communities (such as LUXE) and recent adopters of Key4hep in order to discuss how Key4hep could be of interest to the wider HEP community while staying true to its goal of supporting future collider designs studies.

hep-ex↗

arXiv2023

Key4hep: Progress Report on Integrations

Detector studies for future experiments rely on advanced software tools to estimate performance and optimize their design and technology choices. The Key4hep project provides a flexible turnkey solution for the full experiment life-cycle based on established community tools such as ROOT, Geant4, DD4hep, Gaudi, podio and spack. Members of the CEPC, CLIC, EIC, FCC, and ILC communities have joined to develop this framework and have merged, or are in the progress of merging, their respective software environments into the Key4hep stack. These proceedings will give an overview over the recent progress in the Key4hep project: covering the developments towards adaptation of state-of-the-art tools for simulation (DD4hep, Gaussino), track and calorimeter reconstruction (ACTS, CLUE), particle flow (PandoraPFA), analysis via RDataFrame, and visualization with Phoenix, as well as tools for testing and validation.

hep-ex↗

arXiv2023

Controlling electron motion with attosecond precision by shaped femtosecond intense laser pulse

We propose the scheme of temporal double-slit interferometer to precisely measure the electric field of shaped intense femtosecond laser pulse directly, and apply it to control the electron tunneling wave packets in attosecond precision. By manipulating the spectra phase of the input femtosecond pulse in frequency domain, one single pulse is split into two sub-pulses whose waveform can be precisely controlled by adjusting the spectra phase. When the shaped pulse interacts with atoms, the two sub-pulses are analogous to the Young's double-slit in time domain. The interference pattern in the photoelectron momentum distribution can be used to precisely retrieve the peak electric field and the time delay between two sub-pulses. Based on the precise characterization of the shaped pulse, we demonstrate that the sub-cycle dynamics of electron can be controlled with attosecond precision. The above scheme is proved to be feasible by both quantum-trajectory Monte Carlo simulations and numerical solutions of three-dimensional time-dependent Schrödinger equation.

physics.atom-ph↗

arXiv2023

Integrated Private Data Trading Systems for Data Marketplaces

In the digital age, data is a valuable commodity, and data marketplaces offer lucrative opportunities for data owners to monetize their private data. However, data privacy is a significant concern, and differential privacy has become a popular solution to address this issue. Private data trading systems (PDQS) facilitate the trade of private data by determining which data owners to purchase data from, the amount of privacy purchased, and providing specific aggregation statistics while protecting the privacy of data owners. However, existing PDQS with separated procurement and query processes are prone to over-perturbation of private data and lack trustworthiness. To address this issue, this paper proposes a framework for PDQS with an integrated procurement and query process to avoid excessive perturbation of private data. We also present two instances of this framework, one based on a greedy approach and another based on a neural network. Our experimental results show that both of our mechanisms outperformed the separately conducted procurement and query mechanism under the same budget regarding accuracy.

cs.MA↗

arXiv2023

Simulation Software of the JUNO Experiment

The Jiangmen Underground Neutrino Observatory (JUNO) is a multi-purpose experiment, under construction in southeast China, that is designed to determine the neutrino mass ordering and precisely measure neutrino oscillation parameters. Monte Carlo simulation plays an important role for JUNO detector design, detector commissioning, offline data processing, and physics processing. The JUNO experiment has the world's largest liquid scintillator detector instrumented with many thousands of PMTs. The broad energy range of interest, long lifetime, and the large scale present data processing challenges across all areas. This paper describes the JUNO simulation software, highlighting the challenges of JUNO simulation and solutions to meet these challenges, including such issues as support for time-correlated analysis, event mixing, event correlation and handling the simulation of many millions of optical photons.

hep-ex↗

arXiv2022

A Primal-Dual-Based Power Control Approach for Capacitated Edge Servers

The intensity of radio waves decays rapidly with increasing propagation distance, and an edge server's antenna needs more power to form a larger signal coverage area. Therefore, the power of the edge server should be controlled to reduce energy consumption. In addition, edge servers with capacitated resources provide services for only a limited number of users to ensure the quality of service (QoS). We set the signal transmission power for the antenna of each edge server and formed a signal disk, ensuring that all users were covered by the edge server signal and minimizing the total power of the system. This scenario is a typical geometric set covering problem, and even simple cases without capacity limits are NP-hard problems. In this paper, we propose a primal-dual-based algorithm and obtain an $m$-approximation result. We compare our algorithm with two other algorithms through simulation experiments. The results show that our algorithm obtains a result close to the optimal value in polynomial time.

cs.NI↗

arXiv2022

Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work

In this study, we investigated several online and semi-online scheduling problems on two hierarchical machines with a common due date to maximize the total early work. For the pure online case, we designed an optimal online algorithm with a competitive ratio of $\sqrt 2$. For the case when the total processing time is known, we proposed an optimal semi-online algorithm with a competitive ratio of $\frac{4}{3}$. Additionally, for the cases when the largest processing time is known, we gave optimal algorithms with a competitive ratio of $\frac{6}{5}$ if the largest job is a lower hierarchy one, and of $\sqrt 5-1$ if the largest job is a higher hierarchy one, respectively.

cs.DS↗