arXiv subjects

Wen Chen

Publications and source records attributed to Wen Chen.

At least 271 records · Page 15Linked to original sources

arXiv2024

A Dual-Level Cancelable Framework for Palmprint Verification and Hack-Proof Data Storage

In recent years, palmprints have been widely used for individual verification. The rich privacy information in palmprint data necessitates its protection to ensure security and privacy without sacrificing system performance. Existing systems often use cancelable technologies to protect templates, but these technologies ignore the potential risk of data leakage. Upon breaching the system and gaining access to the stored database, a hacker could easily manipulate the stored templates, compromising the security of the verification system. To address this issue, we propose a dual-level cancelable palmprint verification framework in this paper. Specifically, the raw template is initially encrypted using a competition hashing network with a first-level token, facilitating the end-to-end generation of cancelable templates. Different from previous works, the protected template undergoes further encryption to differentiate the second-level protected template from the first-level one. The system specifically creates a negative database (NDB) with the second-level token for dual-level protection during the enrollment stage. Reversing the NDB is NP-hard and a fine-grained algorithm for NDB generation is introduced to manage the noise and specified bits. During the verification stage, we propose an NDB matching algorithm based on matrix operation to accelerate the matching process of previous NDB methods caused by dictionary-based matching rules. This approach circumvents the need to store templates identical to those utilized for verification, reducing the risk of potential data leakage. Extensive experiments conducted on public palmprint datasets have confirmed the effectiveness and generality of the proposed framework. Upon acceptance of the paper, the code will be accessible at https://github.com/Deep-Imaging-Group/NPR.

cs.CR↗

arXiv2024

Ubiquitous short-range order in multi-principal element alloys

Recent research in multi-principal element alloys (MPEAs) has increasingly focused on the exploration and exploitation of short-range order (SRO) to enhance material performance. However, the understanding of SRO formation and the precise tuning of it within MPEAs remains poorly understood, limiting the comprehension of its impact on material properties and impeding the advancement of SRO engineering. Here, leveraging advanced additive manufacturing techniques that produce samples with a wide range of cooling rates (up to 10^7 K/s) and an improved quantitative electron microscopy method, we characterize SRO in three CoCrNi-based MPEAs to unravel the role of processing route and thermal history on SRO. Surprisingly, irrespective of the processing and thermal treatment applied, all samples exhibit similar levels of SRO, suggesting that prevalent SRO may form during the solidification process. Atomistic simulations of solidification verify that local chemical ordering arises in the liquid-solid interface (solidification front) even under the extreme cooling rate of 10^11 K/s. This phenomenon stems from the swift atomic diffusion in the supercooled liquid, which matches or even surpasses the rate of solidification. Therefore, SRO is an inherent characteristic of most MPEAs, insensitive to variations in cooling rates and annealing treatments typically available in experiments. Integrating thermal treatment with other strategies, such as mechanical deformation and irradiation, might be more effective approaches for harnessing SRO to achieve controlled material properties.

cond-mat.mtrl-sci↗

arXiv2024

Simulation Studies for the First Pathfinder of the CATCH Space Mission

The Chasing All Transients Constellation Hunters (CATCH) space mission is an intelligent constellation consisting of 126 micro-satellites in three types (A, B, and C), designed for X-ray observation with the objective of studying the dynamic universe. Currently, we are actively developing the first Pathfinder (CATCH-1) for the CATCH mission, specifically for type-A satellites. CATCH-1 is equipped with Micro Pore Optics (MPO) and a 4-pixel Silicon Drift Detector (SDD) array. To assess its scientific performance, including the effective area of the optical system, on-orbit background, and telescope sensitivity, we employ the Monte Carlo software Geant4 for simulation in this study. The MPO optics exhibit an effective area of $41$ cm$^2$ at the focal spot for 1 keV X-rays, while the entire telescope system achieves an effective area of $29$ cm$^2$ at 1 keV when taking into account the SDD detector's detection efficiency. The primary contribution to the background is found to be from the Cosmic X-ray Background. Assuming a 625 km orbit with an inclination of $29^\circ$, the total background for CATCH-1 is estimated to be $8.13\times10^{-2}$ counts s$^{-1}$ in the energy range of 0.5--4 keV. Based on the background within the central detector and assuming a Crab-like source spectrum, the estimated ideal sensitivity could achieve $1.9\times10^{-12}$ erg cm$^{-2}$ s$^{-1}$ for an exposure of 10$^4$ s in the energy band of 0.5--4 keV. Furthermore, after simulating the background caused by low-energy charged particles near the geomagnetic equator, we have determined that there is no need to install a magnetic deflector.

astro-ph.IM↗

arXiv2024

Integrated Sensing and Communication: Joint Pilot and Transmission Design

This paper studies a communication-centric integrated sensing and communication (ISAC) system, where a multi-antenna base station (BS) simultaneously performs downlink communication and target detection. A novel target detection and information transmission protocol is proposed, where the BS executes the channel estimation and beamforming successively and meanwhile jointly exploits the pilot sequences in the channel estimation stage and user information in the transmission stage to assist target detection. We investigate the joint design of pilot matrix, training duration, and transmit beamforming to maximize the probability of target detection, subject to the minimum achievable rate required by the user. However, designing the optimal pilot matrix is rather challenging since there is no closed-form expression of the detection probability with respect to the pilot matrix. To tackle this difficulty, we resort to designing the pilot matrix based on the information-theoretic criterion to maximize the mutual information (MI) between the received observations and BS-target channel coefficients for target detection. We first derive the optimal pilot matrix for both channel estimation and target detection, and then propose an unified pilot matrix structure to balance minimizing the channel estimation error (MSE) and maximizing MI. Based on the proposed structure, a low-complexity successive refinement algorithm is proposed. Simulation results demonstrate that the proposed pilot matrix structure can well balance the MSE-MI and the Rate-MI tradeoffs, and show the significant region improvement of our proposed design as compared to other benchmark schemes. Furthermore, it is unveiled that as the communication channel is more correlated, the Rate-MI region can be further enlarged.

cs.IT↗

arXiv2024

Energy-Efficient Wireless Federated Learning via Doubly Adaptive Quantization

Federated learning (FL) has been recognized as a viable distributed learning paradigm for training a machine learning model across distributed clients without uploading raw data. However, FL in wireless networks still faces two major challenges, i.e., large communication overhead and high energy consumption, which are exacerbated by client heterogeneity in dataset sizes and wireless channels. While model quantization is effective for energy reduction, existing works ignore adapting quantization to heterogeneous clients and FL convergence. To address these challenges, this paper develops an energy optimization problem of jointly designing quantization levels, scheduling clients, allocating channels, and controlling computation frequencies (QCCF) in wireless FL. Specifically, we derive an upper bound identifying the influence of client scheduling and quantization errors on FL convergence. Under the longterm convergence constraints and wireless constraints, the problem is established and transformed into an instantaneous problem with Lyapunov optimization. Solving Karush-Kuhn-Tucker conditions, our closed-form solution indicates that the doubly adaptive quantization level rises with the training process and correlates negatively with dataset sizes. Experiment results validate our theoretical results, showing that QCCF consumes less energy with faster convergence compared with state-of-the-art baselines.

cs.DC↗

arXiv2024

Rate-Splitting Multiple Access for Transmissive Reconfigurable Intelligent Surface Transceiver Empowered ISAC System

In this paper, a novel transmissive reconfigurable intelligent surface (TRIS) transceiver empowered integrated sensing and communications (ISAC) system is proposed for future multi-demand terminals. To address interference management, we implement rate-splitting multiple access (RSMA), where the common stream is independently designed for the sensing service. We introduce the sensing quality of service (QoS) criteria based on this structure and construct an optimization problem with the sensing QoS criteria as the objective function to optimize the sensing stream precoding matrix and the communication stream precoding matrix. Due to the coupling of optimization variables, the formulated problem is a non-convex optimization problem that cannot be solved directly. To tackle the above-mentioned challenging problem, alternating optimization (AO) is utilized to decouple the optimization variables. Specifically, the problem is decoupled into three subproblems about the sensing stream precoding matrix, the communication stream precoding matrix, and the auxiliary variables, which is solved alternatively through AO until the convergence is reached. For solving the problem, successive convex approximation (SCA) is applied to deal with the sum-rate threshold constraints on communications, and difference-of-convex (DC) programming is utilized to solve rank-one non-convex constraints. Numerical simulation results verify the superiority of the proposed scheme in terms of improving the communication and sensing QoS.

cs.IT↗

arXiv2024

Linear-scale simulations of quench dynamics

The accurate description and robust computational modeling of the nonequilibrium properties of quantum systems remain a challenge in condensed matter physics. In this work, we develop a linear-scale computational simulation technique for the non-equilibrium dynamics of quantum quench systems. In particular, we report a polynomial-expansion of the Loschmidt echo to describe the dynamical quantum phase transitions of noninteracting quantum quench systems. An expansion-based method allows us to efficiently compute the Loschmidt echo for infinitely large systems without diagonalizing the system Hamiltonian. To demonstrate its utility, we highlight quantum quenching dynamics under tight-binding quasicrystals and disordered lattices in one spatial dimension. In addition, the role of the wave vector on the quench dynamics under lattice models is addressed. We observe wave vector-independent dynamical phase transitions in self-dual localization models.

cond-mat.dis-nn↗

arXiv2024

Semi-Passive Intelligent Reflecting Surface Enabled Sensing Systems

Intelligent reflecting surface (IRS) has garnered growing interest and attention due to its potential for facilitating and supporting wireless communications and sensing. This paper studies a semi-passive IRS-enabled sensing system, where an IRS consists of both passive reflecting elements and active sensors. Our goal is to minimize the Cramér-Rao bound (CRB) for parameter estimation under both point and extended target cases. Towards this goal, we begin by deriving the CRB for the direction-of-arrival (DoA) estimation in closed-form and then theoretically analyze the IRS reflecting elements and sensors allocation design based on the CRB under the point target case with a single-antenna base station (BS). To efficiently solve the corresponding optimization problem for the case with a multi-antenna BS, we propose an efficient algorithm by jointly optimizing the IRS phase shifts and the BS beamformers. Under the extended target case, the CRB for the target response matrix (TRM) estimation is minimized via the optimization of the BS transmit beamformers. Moreover, we explore the influence of various system parameters on the CRB and compare these effects to those observed under the point target case. Simulation results show the effectiveness of the semi-passive IRS and our proposed beamforming design for improving the performance of the sensing system.

eess.SP↗

arXiv2024

Double-Real-Virtual and Double-Virtual-Real Corrections to the Three-Loop Thrust Soft Function

We compute the ${\cal O}(α_s^3)$ double-real-virtual (RRV) and double-virtual-real (VVR) soft contributions to the thrust/zero-jettiness event shape. The result clears up one of the most stubborn obstacles toward the complete ${\cal O}(α_s^3)$ thrust soft function. The results presented here serve as the key input to realize the next-to-next-to-next-to-leading logarithmic prime (N${}^3$LL') % and even the next-to-next-to-next-to-next-to-leading logarithmic (N${}^4$LL) resummation of the thrust event shape. The obtained results also constitute the important ingredients of the $N$-jettiness-subtraction scheme at next-to-next-to-next-to-leading order (N${}^3$LO).

hep-ph↗

arXiv2024

Soft Theorem to Three Loops in QCD and ${\cal N} = 4$ Super Yang-Mills Theory

The soft theorem states that scattering amplitude in gauge theory with a soft gauge-boson emission can be factorized into a hard scattering amplitude and a soft factor. In this paper, we present calculations of the soft factor for processes involving two hard colored partons, up to three loops in QCD. To accomplish this, we developed a systematic method for recursively calculating relevant Feynman integrals using the Feynman-Parameter representation. Our results constitute an important ingredient for the subtraction of infrared singularities at N$^4$LO in perturbative QCD. Using the principle of leading transcendentality between QCD and ${\cal N}=4$ super Yang-Mills theory, we determine the soft factor in the latter case to three loops with full-color dependence. As a by-product, we also obtain the finite constant $f_2^{(3)}$ in the Bern-Dixon-Smirnov ansatz analytically, which was previously known numerically only.

hep-ph↗

arXiv2024

Design of Two-Level Incentive Mechanisms for Hierarchical Federated Learning

Hierarchical Federated Learning (HFL) is a distributed machine learning paradigm tailored for multi-tiered computation architectures, which supports massive access of devices' models simultaneously. To enable efficient HFL, it is crucial to design suitable incentive mechanisms to ensure that devices actively participate in local training. However, there are few studies on incentive mechanism design for HFL. In this paper, we design two-level incentive mechanisms for the HFL with a two-tiered computing structure to encourage the participation of entities in each tier in the HFL training. In the lower-level game, we propose a coalition formation game to joint optimize the edge association and bandwidth allocation problem, and obtain efficient coalition partitions by the proposed preference rule, which can be proven to be stable by exact potential game. In the upper-level game, we design the Stackelberg game algorithm, which not only determines the optimal number of edge aggregations for edge servers to maximize their utility, but also optimize the unit reward provided for the edge aggregation performance to ensure the interests of cloud servers. Furthermore, numerical results indicate that the proposed algorithms can achieve better performance than the benchmark schemes.

cs.GT↗

arXiv2024

Knowledge-Driven Deep Learning Paradigms for Wireless Network Optimization in 6G

In the sixth-generation (6G) networks, newly emerging diversified services of massive users in dynamic network environments are required to be satisfied by multi-dimensional heterogeneous resources. The resulting large-scale complicated network optimization problems are beyond the capability of model-based theoretical methods due to the overwhelming computational complexity and the long processing time. Although with fast online inference and universal approximation ability, data-driven deep learning (DL) heavily relies on abundant training data and lacks interpretability. To address these issues, a new paradigm called knowledge-driven DL has emerged, aiming to integrate proven domain knowledge into the construction of neural networks, thereby exploiting the strengths of both methods. This article provides a systematic review of knowledge-driven DL in wireless networks. Specifically, a holistic framework of knowledge-driven DL in wireless networks is proposed, where knowledge sources, knowledge representation, knowledge integration and knowledge application are forming as a closed loop. Then, a detailed taxonomy of knowledge integration approaches, including knowledge-assisted, knowledge-fused, and knowledge-embedded DL, is presented. Several open issues for future research are also discussed. The insights offered in this article provide a basic principle for the design of network optimization that incorporates communication-specific domain knowledge and DL, facilitating the realization of intelligent 6G networks.

cs.NI↗

arXiv2024

Antenna Positioning and Beamforming Design for Fluid-Antenna Enabled Multi-user Downlink Communications

This paper investigates a multiple input single output (MISO) downlink communication system in which users are equipped with fluid antennas (FAs). First, we adopt a field-response based channel model to characterize the downlink channel with respect to FAs' positions. Then, we aim to minimize the total transmit power by jointly optimizing the FAs' positions and beamforming matrix. To solve the resulting non-convex problem, we employ an alternating optimization (AO) algorithm based on penalty method and successive convex approximation (SCA) to obtain a sub-optimal solution. Numerical results demonstrate that the FA-assisted communication system performs better than conventional fixed position antennas system.

cs.IT↗

arXiv2024

Cooperative Cellular Localization with Intelligent Reflecting Surface: Design, Analysis and Optimization

Autonomous driving and intelligent transportation applications have dramatically increased the demand for high-accuracy and low-latency localization services. While cellular networks are potentially capable of target detection and localization, achieving accurate and reliable positioning faces critical challenges. Particularly, the relatively small radar cross sections (RCS) of moving targets and the high complexity for measurement association give rise to weak echo signals and discrepancies in the measurements. To tackle this issue, we propose a novel approach for multi-target localization by leveraging the controllable signal reflection capabilities of intelligent reflecting surfaces (IRSs). Specifically, IRSs are strategically mounted on the targets (e.g., vehicles and robots), enabling effective association of multiple measurements and facilitating the localization process. We aim to minimize the maximum Cramér-Rao lower bound (CRLB) of targets by jointly optimizing the target association, the IRS phase shifts, and the dwell time. However, solving this CRLB optimization problem is non-trivial due to the non-convex objective function and closely coupled variables. For single-target localization, a simplified closed-form expression is presented for the case where base stations (BSs) can be deployed flexibly, and the optimal BS location is derived to provide a lower performance bound of the original problem ...

cs.IT↗

arXiv2023

Gradient Sparsification for Efficient Wireless Federated Learning with Differential Privacy

Federated learning (FL) enables distributed clients to collaboratively train a machine learning model without sharing raw data with each other. However, it suffers the leakage of private information from uploading models. In addition, as the model size grows, the training latency increases due to limited transmission bandwidth and the model performance degrades while using differential privacy (DP) protection. In this paper, we propose a gradient sparsification empowered FL framework over wireless channels, in order to improve training efficiency without sacrificing convergence performance. Specifically, we first design a random sparsification algorithm to retain a fraction of the gradient elements in each client's local training, thereby mitigating the performance degradation induced by DP and and reducing the number of transmission parameters over wireless channels. Then, we analyze the convergence bound of the proposed algorithm, by modeling a non-convex FL problem. Next, we formulate a time-sequential stochastic optimization problem for minimizing the developed convergence bound, under the constraints of transmit power, the average transmitting delay, as well as the client's DP requirement. Utilizing the Lyapunov drift-plus-penalty framework, we develop an analytical solution to the optimization problem. Extensive experiments have been implemented on three real life datasets to demonstrate the effectiveness of our proposed algorithm. We show that our proposed algorithms can fully exploit the interworking between communication and computation to outperform the baselines, i.e., random scheduling, round robin and delay-minimization algorithms.

cs.DC↗

arXiv2023

Device Scheduling for Relay-assisted Over-the-Air Aggregation in Federated Learning

Federated learning (FL) leverages data distributed at the edge of the network to enable intelligent applications. The efficiency of FL can be improved by using over-the-air computation (AirComp) technology in the process of gradient aggregation. In this paper, we propose a relay-assisted large-scale FL framework, and investigate the device scheduling problem in relay-assisted FL systems under the constraints of power consumption and mean squared error (MSE). we formulate a joint device scheduling, and power allocation problem to maximize the number of scheduled devices. We solve the resultant non-convex optimization problem by transforming the optimization problem into multiple sparse optimization problems. By the proposed device scheduling algorithm, these sparse sub-problems are solved and the maximum number of federated learning edge devices is obtained. The simulation results demonstrate the effectiveness of the proposed scheme as compared with other benchmark schemes.

cs.LG↗

arXiv2023

Asynchronous Wireless Federated Learning with Probabilistic Client Selection

Federated learning (FL) is a promising distributed learning framework where distributed clients collaboratively train a machine learning model coordinated by a server. To tackle the stragglers issue in asynchronous FL, we consider that each client keeps local updates and probabilistically transmits the local model to the server at arbitrary times. We first derive the (approximate) expression for the convergence rate based on the probabilistic client selection. Then, an optimization problem is formulated to trade off the convergence rate of asynchronous FL and mobile energy consumption by joint probabilistic client selection and bandwidth allocation. We develop an iterative algorithm to solve the non-convex problem globally optimally. Experiments demonstrate the superiority of the proposed approach compared with the traditional schemes.

cs.LG↗

arXiv2023

Multifractality and pre-thermalization in the quasi-periodically kicked Aubry-André-Harper model

In a class of periodically driven systems, multifractal states in non-equilibrium conditions and robustness of dynamical localization when the driving is made aperiodic have received considerable attention. In this paper, we explore a family of one-dimensional Aubry-André-Harper models that are quasi-periodically kicked with protocols following different binary quasi-periodic sequences, which can be realized in ultracold atom systems. The relationship between the systems' localization properties and the sequences' mathematical features is established utilizing the Floquet theorem and the Baker-Campbell-Hausdorff formula. We investigate the multifractality and pre-thermalization of the eigenstates of the unitary evolution operator combined with an analysis of the transport properties of initially localized wave packets. We further contend that the quasi-periodically kicked Aubry-André-Harper model provides a rich phase diagram as the periodic case but also brings the range of parameters to observe multifractal states and pre-thermalization to a regime more amenable to experiments.

cond-mat.dis-nn↗