arXiv subjects

Li Wang

Publications and source records attributed to Li Wang.

At least 325 records · Page 18Linked to original sources

arXiv2022

MIMO Systems with Reconfigurable Antennas: Joint Channel Estimation and Mode Selection

Reconfigurable antennas (RAs) are a promising technology to enhance the capacity and coverage of wireless communication systems. However, RA systems have two major challenges: (i) High computational complexity of mode selection, and (ii) High overhead of channel estimation for all modes. In this paper, we develop a low-complexity iterative mode selection algorithm for data transmission in an RA-MIMO system. Furthermore, we study channel estimation of an RA multi-user MIMO system. However, given the coherence time, it is challenging to estimate channels of all modes. We propose a mode selection scheme to select a subset of modes, train channels for the selected subset, and predict channels for the remaining modes. In addition, we propose a prediction scheme based on pattern correlation between modes. Representative simulation results demonstrate the system's channel estimation error and achievable sum-rate for various selected modes and different signal-to-noise ratios (SNRs).

cs.IT↗

arXiv2022

Machine Learning-based Methods for Reconfigurable Antenna Mode Selection in MIMO Systems

MIMO technology has enabled spatial multiple access and has provided a higher system spectral efficiency (SE). However, this technology has some drawbacks, such as the high number of RF chains that increases complexity in the system. One of the solutions to this problem can be to employ reconfigurable antennas (RAs) that can support different radiation patterns during transmission to provide similar performance with fewer RF chains. In this regard, the system aims to maximize the SE with respect to optimum beamforming design and RA mode selection. Due to the non-convexity of this problem, we propose machine learning-based methods for RA antenna mode selection in both dynamic and static scenarios. In the static scenario, we present how to solve the RA mode selection problem, an integer optimization problem in nature, via deep convolutional neural networks (DCNN). A Multi-Armed-bandit (MAB) consisting of offline and online training is employed for the dynamic RA state selection. For the proposed MAB, the computational complexity of the optimization problem is reduced. Finally, the proposed methods in both dynamic and static scenarios are compared with exhaustive search and random selection methods.

eess.SP↗

arXiv2022

Depositing boron on Cu(111): Borophene or boride?

Large-area single-crystal surface structures were successfully prepared on Cu(111) substrate with boron deposition, which is critical for prospective applications. However, the proposed borophene structures do not match the scanning tunneling microscopy (STM) results very well, while the proposed copper boride is at odds with the traditional knowledge that ordered copper-rich borides normally do not exist due to small difference in electronegativity and large difference in atomic size. To clarify the controversy and elucidate the formation mechanism of the unexpected copper boride, we conducted systematic STM, X-ray photoelectron spectroscopy and angle-resolved photoemission spectroscopy investigations, confirming the synthesis of two-dimensional copper boride rather than borophene on Cu(111) after boron deposition under ultrahigh vacuum. First-principles calculations with defective surface models further indicate that boron atoms tend to react with Cu atoms near terrace edges or defects, which in turn shapes the intermediate structures of copper boride and leads to the formation of stable Cu-B monolayer via large-scale surface reconstruction eventually.

cond-mat.mtrl-sci↗

arXiv2022

Deep Factorization Model for Robust Recommendation

Recently, malevolent user hacking has become a huge problem for real-world companies. In order to learn predictive models for recommender systems, factorization techniques have been developed to deal with user-item ratings. In this paper, we suggest a broad architecture of a factorization model with adversarial training to get over these issues. The effectiveness of our systems is demonstrated by experimental findings on real-world datasets.

cs.IR↗

arXiv2022

$n$-body Correlation of Tonks-Girardeau Gas

For the well-known exponential complexity it is a giant challenge to calculate the correlation function for general many-body wave function. We investigate the ground state $n$th-order correlation functions of the Tonks-Girardeau (TG) gases. Basing on the wavefunction of free fermions and Bose-Fermi mapping method we obtain the exact ground state wavefunction of TG gases. Utilizing the properties of Vandermonde determinant and Toeplitz matrix, the $n$th-order correlation function is formulated as $(N-n)$-order Toeplitz determinant, whose element is the integral dependent on 2$(N-n)$ sign functions and can be computed analytically. By reducing the integral on domain $[0,2π]$ into the summation of the integral on several independent domains, we obtain the explicit form of the Toeplitz matrix element ultimately. As the applications we deduce the concise formula of the reduced two-body density matrix and discuss its properties. The corresponding natural orbitals and their occupation distribution are plotted. Furthermore, we give a concise formula of the reduced three-body density matrix and discuss its properties. It is shown that in the successive second measurements, atoms appear in the regions where atoms populate with the maximum probability in the first measurement.

cond-mat.quant-gas↗

arXiv2022

Spontaneous symmetry breaking and ghost states supported by the fractional nonlinear Schrödinger equation with focusing saturable nonlinearity and PT-symmetric potential

We report a novel spontaneous symmetry breaking phenomenon and ghost states existed in the framework of the fractional nonlinear Schrödinger (FNLS) equation with focusing saturable nonlinearity and PT-symmetric potential. The continuous asymmetric soliton branch bifurcates from the fundamental symmetric one as the power exceeds some critical value. Intriguingly, the symmetry of fundamental solitons is broken into two branches of asymmetry solitons (alias ghost states) with complex conjugate propagation constants, which is solely in fractional media. Besides, the dipole (antisymmetry) and tripole solitons are also studied numerically. Moreover, we analyze the influences of fractional Lévy index and saturable nonlinear parameters on the symmetry breaking of solitons in detail. And the stability of fundamental soliton, asymmetric, dipole and tripole solitons are explored via the linear stability analysis and direct propagations. Moreover, we explore the elastic/semi-elastic collision phenomena between symmetric and asymmetric solitons. Meanwhile, we find the stable excitations from the fractional diffraction with saturation nonlinearity to integer-order diffraction with Kerr nonlinearity via the adiabatic excitations of parameters. These results will provide some theoretical basis for the study of spontaneous symmetry breaking phenomena and related physical experiments in the fractional media with PT-symmetric potentials.

nlin.PS↗

arXiv2022

Monte Carlo Gradient in Optimization Constrained by Radiative Transport Equation

Can Monte Carlo (MC) solvers be directly used in gradient-based methods for PDE-constrained optimization problems? In these problems, a gradient of the loss function is typically presented as a product of two PDE solutions, one for the forward equation and the other for the adjoint. When MC solvers are used, the numerical solutions are Dirac measures. As such, one immediately faces the difficulty in explaining the multiplication of two measures. This suggests that MC solvers are naturally incompatible with gradient-based optimization under PDE constraints. In this paper, we study two different strategies to overcome the difficulty. One is to adopt the Discrete-Then-Optimize technique and conduct the full optimization on the algebraic system, avoiding the Dirac measures. The second strategy stays within the Optimize-Then-Discretize framework. We propose a correlated simulation where, instead of using MC solvers separately for both forward and adjoint problems, we recycle the samples in the forward simulation in the adjoint solver. This frames the adjoint solution as a test function, and hence allows a rigorous convergence analysis. The investigation is presented through the lens of the radiative transfer equation, either in the inverse setting from optical imaging or in the optimal control framework. We detail the algorithm development, convergence analysis, and complexity cost. Numerical evidence is also presented to demonstrate the claims.

math.NA↗

arXiv2022

CAMO-MOT: Combined Appearance-Motion Optimization for 3D Multi-Object Tracking with Camera-LiDAR Fusion

3D Multi-object tracking (MOT) ensures consistency during continuous dynamic detection, conducive to subsequent motion planning and navigation tasks in autonomous driving. However, camera-based methods suffer in the case of occlusions and it can be challenging to accurately track the irregular motion of objects for LiDAR-based methods. Some fusion methods work well but do not consider the untrustworthy issue of appearance features under occlusion. At the same time, the false detection problem also significantly affects tracking. As such, we propose a novel camera-LiDAR fusion 3D MOT framework based on the Combined Appearance-Motion Optimization (CAMO-MOT), which uses both camera and LiDAR data and significantly reduces tracking failures caused by occlusion and false detection. For occlusion problems, we are the first to propose an occlusion head to select the best object appearance features multiple times effectively, reducing the influence of occlusions. To decrease the impact of false detection in tracking, we design a motion cost matrix based on confidence scores which improve the positioning and object prediction accuracy in 3D space. As existing multi-object tracking methods only consider a single category, we also propose to build a multi-category loss to implement multi-object tracking in multi-category scenes. A series of validation experiments are conducted on the KITTI and nuScenes tracking benchmarks. Our proposed method achieves state-of-the-art performance and the lowest identity switches (IDS) value (23 for Car and 137 for Pedestrian) among all multi-modal MOT methods on the KITTI test dataset. And our proposed method achieves state-of-the-art performance among all algorithms on the nuScenes test dataset with 75.3% AMOTA.

cs.CV↗

arXiv2022

Propagation Path Loss Models in Forest Scenario at 605 MHz

When signals propagate through forest areas, they will be affected by environmental factors such as vegetation. Different types of environments have different influences on signal attenuation. This paper analyzes the existing classical propagation path loss models and the model with excess loss caused by forest areas and then proposes a new short-range wireless channel propagation model, which can be applied to different types of forest environments. We conducted continuous-wave measurements at a center frequency of 605 MHz on predetermined routes in distinct types of forest areas and recorded the reference signal received power. Then, we use various path loss models to fit the measured data based on different vegetation types and distributions. Simulation results show that the proposed model has substantially smaller fitting errors with reasonable computational complexity, as compared with representative traditional counterparts.

cs.IT↗

arXiv2022

Tunable Interband Transitions in Twisted h-BN/Graphene Heterostructures

In twisted h-BN/graphene heterostructures, the complex electronic properties of the fast-traveling electron gas in graphene are usually considered to be fully revealed. However, the randomly twisted heterostructures may also have unexpected transition behaviors, which may influence the device performance. Here, we study the twist angle-dependent coupling effects of h-BN/graphene heterostructures using monochromatic electron energy loss spectroscopy. We find that the moiré potentials alter the band structure of graphene, resulting in a redshift of the intralayer transition at the M-point, which becomes more pronounced up to 0.25 eV with increasing twist angle. Furthermore, the twisting of the Brillouin zone of h-BN relative to the graphene M-point leads to tunable vertical transition energies in the range of 5.1-5.6 eV. Our findings indicate that twist-coupling effects of van der Waals heterostructures should be carefully considered in device fabrications, and the continuously tunable interband transitions through the twist angle can serve as a new degree of freedom to design optoelectrical devices.

cond-mat.mes-hall↗

arXiv2022

Quantifying the temporal stability of international fertilizer trade networks

The importance of fertilizers to agricultural production is undeniable, and most economies rely on international trade for fertilizer use. The stability of fertilizer trade networks is fundamental to food security. We use three valid methods to measure the temporal stability of the overall network and different functional sub-networks of the three fertilizer nutrients N, P and K from 1990 to 2018. The international N, P and K trade systems all have a trend of increasing stability with the process of globalization. The large-weight sub-network has relatively high stability, but is more likely to be impacted by extreme events. The small-weight sub-network is less stable, but has a strong self-healing ability and is less affected by shocks. Overall, all the three fertilizer trade networks exhibit a stable core with restorable periphery. The overall network stability of the three fertilizers is close, but the K trade has a significantly higher stability in the core part, and the N trade is the most stable in the non-core part.

physics.soc-ph↗

arXiv2022

Private, Efficient, and Accurate: Protecting Models Trained by Multi-party Learning with Differential Privacy

Secure multi-party computation-based machine learning, referred to as MPL, has become an important technology to utilize data from multiple parties with privacy preservation. While MPL provides rigorous security guarantees for the computation process, the models trained by MPL are still vulnerable to attacks that solely depend on access to the models. Differential privacy could help to defend against such attacks. However, the accuracy loss brought by differential privacy and the huge communication overhead of secure multi-party computation protocols make it highly challenging to balance the 3-way trade-off between privacy, efficiency, and accuracy. In this paper, we are motivated to resolve the above issue by proposing a solution, referred to as PEA (Private, Efficient, Accurate), which consists of a secure DPSGD protocol and two optimization methods. First, we propose a secure DPSGD protocol to enforce DPSGD in secret sharing-based MPL frameworks. Second, to reduce the accuracy loss led by differential privacy noise and the huge communication overhead of MPL, we propose two optimization methods for the training process of MPL: (1) the data-independent feature extraction method, which aims to simplify the trained model structure; (2) the local data-based global model initialization method, which aims to speed up the convergence of the model training. We implement PEA in two open-source MPL frameworks: TF-Encrypted and Queqiao. The experimental results on various datasets demonstrate the efficiency and effectiveness of PEA. E.g. when $ε$ = 2, we can train a differentially private classification model with an accuracy of 88% for CIFAR-10 within 7 minutes under the LAN setting. This result significantly outperforms the one from CryptGPU, one SOTA MPL framework: it costs more than 16 hours to train a non-private deep neural network model on CIFAR-10 with the same accuracy.

cs.CR↗

arXiv2022

Low Rank Tensor Decompositions and Approximations

There exist linear relations among tensor entries of low rank tensors. These linear relations can be expressed by multi-linear polynomials, which are called generating polynomials. We use generating polynomials to compute tensor rank decompositions and low rank tensor approximations. We prove that this gives a quasi-optimal low rank tensor approximation if the given tensor is sufficiently close to a low rank one.

math.NA↗

arXiv2022

Semibricks, torsion-free classes and the Jordan-Hölder property

Let $\mathscr{C}$ be an extriangulated category and $\mathcal{X}$ be a semibrick in $\mathscr{C}$. Let $\mathcal{T}$ be the filtration subcategory generated by $\mathcal{X}$. We introduce the weak Jordan-Hölder property (WJHP) and Jordan-Hölder property (JHP) in $\mathscr{C}$ and show that $\mathcal{T}$ satisfies (WJHP). Furthermore, $\mathcal{T}$ satisfies (JHP) if and only if $\mathcal{X}$ is proper. Using reflection functors and $c$-sortable elements, we give a combinatorial criterion for the torsion-free class satisfying (JHP) in the representation category of a quiver of type $A$.

math.RT↗

arXiv2022

Scalable and Sparsity-Aware Privacy-Preserving K-means Clustering with Application to Fraud Detection

K-means is one of the most widely used clustering models in practice. Due to the problem of data isolation and the requirement for high model performance, how to jointly build practical and secure K-means for multiple parties has become an important topic for many applications in the industry. Existing work on this is mainly of two types. The first type has efficiency advantages, but information leakage raises potential privacy risks. The second type is provable secure but is inefficient and even helpless for the large-scale data sparsity scenario. In this paper, we propose a new framework for efficient sparsity-aware K-means with three characteristics. First, our framework is divided into a data-independent offline phase and a much faster online phase, and the offline phase allows to pre-compute almost all cryptographic operations. Second, we take advantage of the vectorization techniques in both online and offline phases. Third, we adopt a sparse matrix multiplication for the data sparsity scenario to improve efficiency further. We conduct comprehensive experiments on three synthetic datasets and deploy our model in a real-world fraud detection task. Our experimental results show that, compared with the state-of-the-art solution, our model achieves competitive performance in terms of both running time and communication size, especially on sparse datasets.

cs.LG↗

arXiv2022

Longitudinal Prediction of Postnatal Brain Magnetic Resonance Images via a Metamorphic Generative Adversarial Network

Missing scans are inevitable in longitudinal studies due to either subject dropouts or failed scans. In this paper, we propose a deep learning framework to predict missing scans from acquired scans, catering to longitudinal infant studies. Prediction of infant brain MRI is challenging owing to the rapid contrast and structural changes particularly during the first year of life. We introduce a trustworthy metamorphic generative adversarial network (MGAN) for translating infant brain MRI from one time-point to another. MGAN has three key features: (i) Image translation leveraging spatial and frequency information for detail-preserving mapping; (ii) Quality-guided learning strategy that focuses attention on challenging regions. (iii) Multi-scale hybrid loss function that improves translation of tissue contrast and structural details. Experimental results indicate that MGAN outperforms existing GANs by accurately predicting both contrast and anatomical details.

eess.IV↗

arXiv2022

Deep Uncalibrated Photometric Stereo via Inter-Intra Image Feature Fusion

Uncalibrated photometric stereo is proposed to estimate the detailed surface normal from images under varying and unknown lightings. Recently, deep learning brings powerful data priors to this underdetermined problem. This paper presents a new method for deep uncalibrated photometric stereo, which efficiently utilizes the inter-image representation to guide the normal estimation. Previous methods use optimization-based neural inverse rendering or a single size-independent pooling layer to deal with multiple inputs, which are inefficient for utilizing information among input images. Given multi-images under different lighting, we consider the intra-image and inter-image variations highly correlated. Motivated by the correlated variations, we designed an inter-intra image feature fusion module to introduce the inter-image representation into the per-image feature extraction. The extra representation is used to guide the per-image feature extraction and eliminate the ambiguity in normal estimation. We demonstrate the effect of our design on a wide range of samples, especially on dark materials. Our method produces significantly better results than the state-of-the-art methods on both synthetic and real data.

cs.CV↗

arXiv2022

Deep Historical Borrowing Framework to Prospectively and Simultaneously Synthesize Control Information in Confirmatory Clinical Trials with Multiple Endpoints

In current clinical trial development, historical information is receiving more attention as it provides utility beyond sample size calculation. Meta-analytic-predictive (MAP) priors and robust MAP priors have been proposed for prospectively borrowing historical data on a single endpoint. To simultaneously synthesize control information from multiple endpoints in confirmatory clinical trials, we propose to approximate posterior probabilities from a Bayesian hierarchical model and estimate critical values by deep learning to construct pre-specified strategies for hypothesis testing. This feature is important to ensure study integrity by establishing prospective decision functions before the trial conduct. Simulations are performed to show that our method properly controls family-wise error rate (FWER) and preserves power as compared with a typical practice of choosing constant critical values given a subset of null space. Satisfactory performance under prior-data conflict is also demonstrated. We further illustrate our method using a case study in Immunology.

stat.ME↗