arXiv subjects

Jun Li

Publications and source records attributed to Jun Li.

At least 631 records · Page 35Linked to original sources

arXiv2021

Deterministic Time-Bin Entanglement between a Single Photon and an Atomic Ensemble

Hybrid matter-photon entanglement is the building block for quantum networks. It is very favorable if the entanglement can be prepared with a high probability. In this paper, we report the deterministic creation of entanglement between an atomic ensemble and a single photon by harnessing Rydberg blockade. We design a scheme that creates entanglement between a single photon's temporal modes and the Rydberg levels that host a collective excitation, using a process of cyclical retrieving and patching. The hybrid entanglement is tested via retrieving the atomic excitation as a second photon and performing correlation measurements, which suggest an entanglement fidelity of 87.8%. Our source of matter-photon entanglement will enable the entangling of remote quantum memories with much higher efficiency.

quant-ph↗

arXiv2021

Federated Learning with Unreliable Clients: Performance Analysis and Mechanism Design

Owing to the low communication costs and privacy-promoting capabilities, Federated Learning (FL) has become a promising tool for training effective machine learning models among distributed clients. However, with the distributed architecture, low quality models could be uploaded to the aggregator server by unreliable clients, leading to a degradation or even a collapse of training. In this paper, we model these unreliable behaviors of clients and propose a defensive mechanism to mitigate such a security risk. Specifically, we first investigate the impact on the models caused by unreliable clients by deriving a convergence upper bound on the loss function based on the gradient descent updates. Our theoretical bounds reveal that with a fixed amount of total computational resources, there exists an optimal number of local training iterations in terms of convergence performance. We further design a novel defensive mechanism, named deep neural network based secure aggregation (DeepSA). Our experimental results validate our theoretical analysis. In addition, the effectiveness of DeepSA is verified by comparing with other state-of-the-art defensive mechanisms.

cs.LG↗

arXiv2021

Max-Type and Sum-Type Procedures for Online Change-Point Detection in the Mean of High-Dimensional Data

We propose two procedures to detect a change in the mean of high-dimensional online data. One is based on a max-type U-statistic and another is based on a sum-type U-statistic. Theoretical properties of the two procedures are explored in the high dimensional setting. More precisely, we derive their average run lengths (ARLs) when there is no change point, and expected detection delays (EDDs) when there is a change point. Accuracy of the theoretical results is confirmed by simulation studies. The practical use of the proposed procedures is demonstrated by detecting an abrupt change in PM2.5 concentrations. The current study attempts to extend the results of the CUSUM and Shiryayev-Roberts procedures previously established in the univariate setting.

stat.ME↗

arXiv2021

Artin presentations, triangle groups, and 4-manifolds

Gonz{á}lez-Acu{ñ}a showed that Artin presentations characterize closed, orientable $3$-manifold groups. Winkelnkemper later discovered that each Artin presentation determines a smooth, compact, simply-connected $4$-manifold. We utilize triangle groups to find all Artin presentations on two generators that present the trivial group. We then determine all smooth, closed, simply-connected $4$-manifolds with second betti number at most two that appear in Artin presentation theory.

math.GT↗

arXiv2021

Einstein-de Haas Effect of Topological Magnons

We predict the existence of Einstein-de Haas effect in topological magnon insulators. Temperature variation of angular momentum in the topological state shows a sign change behavior, akin to the low temperature thermal Hall conductance response. This manifests itself as a macroscopic mechanical rotation of the material hosting topological magnons. We show that an experimentally observable Einstein-de Haas effect can be measured in the square-octagon, the kagome, and the honeycomb lattices. Albeit, the effect is the strongest in the square-octagon lattice. We treat both the low and the high temperature phases using spin wave and Schwinger boson theory, respectively. We propose an experimental set up to detect our theoretical predictions. We suggest candidate square-octagon materials where our theory can be tested.

cond-mat.str-el↗

arXiv2021

Single-shot measurement of a Rydberg superatom via collective photon burst

With Rydberg dipole interactions, a mesoscopic atomic ensemble may behave like a two-level single atom, resulting in the so-called picture of superatom. It is in potential a strong candidate as a qubit in quantum information science, especially for efficient coupling with single photons via collective enhancement that is essential for building quantum internet to connect remote quantum computers. Previously, preliminary studies have been carried out in demonstrating basic concept of Rydberg superatom, a single-photon source, and entanglement with a single photon, etc. While a crucial element of single-shot qubit measurement is still missing. Here we realize the deterministic measurement of a superatom qubit via photon burst in a single shot. We make use of a low-finesse ring cavity to enhance the atom-photon interaction and obtain an in-fiber retrieval efficiency of 44%. Harnessing dipole interaction between two Rydberg levels, we may either create a sequence of multiple single photons or nothing, conditioned on the initial qubit state. We achieve a single-shot measurement fidelity of 93.2% in 4.8 us. Our work complements the experimental toolbox of harnessing Rydberg superatom for quantum information applications.

quant-ph↗

arXiv2021

KIT Bus: A Shuttle Model for CARLA Simulator

With the continuous development of science and technology, self-driving vehicles will surely change the nature of transportation and realize the automotive industry's transformation in the future. Compared with self-driving cars, self-driving buses are more efficient in carrying passengers and more environmentally friendly in terms of energy consumption. Therefore, it is speculated that in the future, self-driving buses will become more and more important. As a simulator for autonomous driving research, the CARLA simulator can help people accumulate experience in autonomous driving technology faster and safer. However, a shortcoming is that there is no modern bus model in the CARLA simulator. Consequently, people cannot simulate autonomous driving on buses or the scenarios interacting with buses. Therefore, we built a bus model in 3ds Max software and imported it into the CARLA to fill this gap. Our model, namely KIT bus, is proven to work in the CARLA by testing it with the autopilot simulation. The video demo is shown on our Youtube.

cs.RO↗

arXiv2021

Federated Learning Over Wireless Channels: Dynamic Resource Allocation and Task Scheduling

With the development of federated learning (FL), mobile devices (MDs) are able to train their local models with private data and sends them to a central server for aggregation, thereby preventing sensitive raw data leakage. In this paper, we aim to improve the training performance of FL systems in the context of wireless channels and stochastic energy arrivals of MDs. To this purpose, we dynamically optimize MDs' transmission power and training task scheduling. We first model this dynamic programming problem as a constrained Markov decision process (CMDP). Due to high dimensions rooted from our CMDP problem, we propose online stochastic learning methods to simplify the CMDP and design online algorithms to obtain an efficient policy for all MDs. Since there are long-term constraints in our CMDP, we utilize Lagrange multipliers approach to tackle this issue. Furthermore, we prove the convergence of the proposed online stochastic learning algorithm. Numerical results indicate that the proposed algorithms can achieve better performance than the benchmark algorithms.

cs.DC↗

arXiv2021

Lite-FPN for Keypoint-based Monocular 3D Object Detection

3D object detection with a single image is an essential and challenging task for autonomous driving. Recently, keypoint-based monocular 3D object detection has made tremendous progress and achieved great speed-accuracy trade-off. However, there still exists a huge gap with LIDAR-based methods in terms of accuracy. To improve their performance without sacrificing efficiency, we propose a sort of lightweight feature pyramid network called Lite-FPN to achieve multi-scale feature fusion in an effective and efficient way, which can boost the multi-scale detection capability of keypoint-based detectors. Besides, the misalignment between classification score and localization precision is further relieved by introducing a novel regression loss named attention loss. With the proposed loss, predictions with high confidence but poor localization are treated with more attention during the training phase. Comparative experiments based on several state-of-the-art keypoint-based detectors on the KITTI dataset show that our proposed methods manage to achieve significant improvements in both accuracy and frame rate. The code and pretrained models will be released at \url{https://github.com/yanglei18/Lite-FPN}.

cs.CV↗

arXiv2021

IPS300+: a Challenging Multimodal Dataset for Intersection Perception System

Due to the high complexity and occlusion, insufficient perception in the crowded urban intersection can be a serious safety risk for both human drivers and autonomous algorithms, whereas CVIS (Cooperative Vehicle Infrastructure System) is a proposed solution for full-participants perception in this scenario. However, the research on roadside multimodal perception is still in its infancy, and there is no open-source dataset for such scenario. Accordingly, this paper fills the gap. Through an IPS (Intersection Perception System) installed at the diagonal of the intersection, this paper proposes a high-quality multimodal dataset for the intersection perception task. The center of the experimental intersection covers an area of 3000m2, and the extended distance reaches 300m, which is typical for CVIS. The first batch of open-source data includes 14198 frames, and each frame has an average of 319.84 labels, which is 9.6 times larger than the most crowded dataset (H3D dataset in 2019) by now. In order to facilitate further study, this dataset tries to keep the label documents consistent with the KITTI dataset, and a standardized benchmark is created for algorithm evaluation. Our dataset is available at: http://www.openmpd.com/column/other_datasets.

cs.CV↗

arXiv2021

When Federated Learning Meets Blockchain: A New Distributed Learning Paradigm

Motivated by the explosive computing capabilities at end user equipments, as well as the growing privacy concerns over sharing sensitive raw data, a new machine learning paradigm, named federated learning (FL) has emerged. By training models locally at each client and aggregating learning models at a central server, FL has the capability to avoid sharing data directly, thereby reducing privacy leakage. However, the traditional FL framework heavily relies on a single central server and may fall apart if such a server behaves maliciously. To address this single point of failure issue, this work investigates a blockchain assisted decentralized FL (BLADE-FL) framework, which can well prevent the malicious clients from poisoning the learning process, and further provides a self-motivated and reliable learning environment for clients. In detail, the model aggregation process is fully decentralized and the tasks of training for FL and mining for blockchain are integrated into each participant. In addition, we investigate the unique issues in this framework and provide analytical and experimental results to shed light on possible solutions.

cs.NI↗

arXiv2021

Federated Learning for Industrial Internet of Things in Future Industries

The Industrial Internet of Things (IIoT) offers promising opportunities to transform the operation of industrial systems and becomes a key enabler for future industries. Recently, artificial intelligence (AI) has been widely utilized for realizing intelligent IIoT applications where AI techniques require centralized data collection and processing. However, this is not always feasible in realistic scenarios due to the high scalability of modern IIoT networks and growing industrial data confidentiality. Federated Learning (FL), as an emerging collaborative AI approach, is particularly attractive for intelligent IIoT networks by coordinating multiple IIoT devices and machines to perform AI training at the network edge while helping protect user privacy. In this article, we provide a detailed overview and discussions of the emerging applications of FL in key IIoT services and applications. A case study is also provided to demonstrate the feasibility of FL in IIoT. Finally, we highlight a range of interesting open research topics that need to be addressed for the full realization of FL-IIoT in industries.

cs.LG↗

arXiv2021

Blockchain Assisted Decentralized Federated Learning (BLADE-FL): Performance Analysis and Resource Allocation

Federated learning (FL), as a distributed machine learning paradigm, promotes personal privacy by local data processing at each client. However, relying on a centralized server for model aggregation, standard FL is vulnerable to server malfunctions, untrustworthy server, and external attacks. To address this issue, we propose a decentralized FL framework by integrating blockchain into FL, namely, blockchain assisted decentralized federated learning (BLADE-FL). In a round of the proposed BLADE-FL, each client broadcasts the trained model to other clients, aggregates its own model with received ones, and then competes to generate a block before its local training of the next round. We evaluate the learning performance of BLADE-FL, and develop an upper bound on the global loss function. Then we verify that this bound is convex with respect to the number of overall aggregation rounds K, and optimize the computing resource allocation for minimizing the upper bound. We also note that there is a critical problem of training deficiency, caused by lazy clients who plagiarize others' trained models and add artificial noises to disguise their cheating behaviors. Focusing on this problem, we explore the impact of lazy clients on the learning performance of BLADE-FL, and characterize the relationship among the optimal K, the learning parameters, and the proportion of lazy clients. Based on MNIST and Fashion-MNIST datasets, we show that the experimental results are consistent with the analytical ones. To be specific, the gap between the developed upper bound and experimental results is lower than 5%, and the optimized K based on the upper bound can effectively minimize the loss function.

cs.LG↗

arXiv2021

Joint Beamforming Design and Power Splitting Optimization in IRS-Assisted SWIPT NOMA Networks

This paper proposes a novel network framework of intelligent reflecting surface (IRS)-assisted simultaneous wireless information and power transfer (SWIPT) non-orthogonal multiple access (NOMA) networks, where IRS is used to enhance the NOMA performance and the wireless power transfer (WPT) efficiency of SWIPT. We formulate a problem of minimizing base station (BS) transmit power by jointly optimizing successive interference cancellation (SIC) decoding order, BS transmit beamforming vector, power splitting (PS) ratio and IRS phase shift while taking into account the quality-of-service (QoS) requirement and energy harvested threshold of each user. The formulated problem is non-convex optimization problem, which is difficult to solve it directly. Hence, a two-stage algorithm is proposed to solve the above-mentioned problem by applying semidefinite relaxation (SDR), Gaussian randomization and successive convex approximation (SCA). Specifically, after determining SIC decoding order by designing IRS phase shift in the first stage, we alternately optimize BS transmit beamforming vector, PS ratio, and IRS phase shift to minimize the BS transmit power. Numerical results validate the effectiveness of our proposed optimization algorithm in reducing BS transmit power compared to other baseline algorithms. Meanwhile, compared with non-IRS-assisted network, the IRS-assisted SWIPT NOMA network can decrease BS transmit power by 51.13\%.

cs.IT↗

arXiv2021

Fast Ambiguous DOA Elimination Method of DOA Measurement for Hybrid Massive MIMO Receiver

DOA estimation for massive multiple-input multiple-output (MIMO) system can provide ultra-high-resolution angle estimation. However, due to the high computational complexity and cost of all digital MIMO systems, a hybrid analog digital (HAD) structure MIMO was proposed. In this paper, a fast ambiguous phase elimination method is proposed to solve the problem of direction-finding ambiguity caused by the HAD MIMO. Only two-data-blocks are used to realize DOA estimation. Simulation results show that the proposed method can greatly reduce the estimation delay with a slight performance loss.

cs.IT↗

arXiv2021

An Extension of BIM Using AI: a Multi Working-Machines Pathfinding Solution

Multi working-machines pathfinding solution enables more mobile machines simultaneously to work inside of a working site so that the productivity can be expected to increase evolutionary. To date, the potential cooperation conflicts among construction machinery limit the amount of construction machinery investment in a concrete working site. To solve the cooperation problem, civil engineers optimize the working site from a logistic perspective while computer scientists improve pathfinding algorithms' performance on the given benchmark maps. In the practical implementation of a construction site, it is sensible to solve the problem with a hybrid solution; therefore, in our study, we proposed an algorithm based on a cutting-edge multi-pathfinding algorithm to enable the massive number of machines cooperation and offer the advice to modify the unreasonable part of the working site in the meantime. Using the logistic information from BIM, such as unloading and loading point, we added a pathfinding solution for multi machines to improve the whole construction fleet's productivity. In the previous study, the experiments were limited to no more than ten participants, and the computational time to gather the solution was not given; thus, we publish our pseudo-code, our tested map, and benchmark our results. Our algorithm's most extensive feature is that it can quickly replan the path to overcome the emergency on a construction site.

cs.AI↗

arXiv2021

Dynamic network analysis improves protein 3D structural classification

Protein structural classification (PSC) is a supervised problem of assigning proteins into pre-defined structural (e.g., CATH or SCOPe) classes based on the proteins' sequence or 3D structural features. We recently proposed PSC approaches that model protein 3D structures as protein structure networks (PSNs) and analyze PSN-based protein features, which performed better than or comparable to state-of-the-art sequence or other 3D structure-based approaches in the task of PSC. However, existing PSN-based PSC approaches model the whole 3D structure of a protein as a static PSN. Because folding of a protein is a dynamic process, where some parts of a protein fold before others, modeling the 3D structure of a protein as a dynamic PSN might further help improve the existing PSC performance. Here, we propose for the first time a way to model 3D structures of proteins as dynamic PSNs, with the hypothesis that this will improve upon the current state-of-the-art PSC approaches that are based on static PSNs (and thus upon the existing state-of-the-art sequence and other 3D structural approaches). Indeed, we confirm this on 71 datasets spanning ~44,000 protein domains from CATH and SCOPe

q-bio.MN↗

arXiv2021

Measurement-Device-Independent Verification of a Quantum Memory

In this paper we report an experiment that verifies an atomic-ensemble quantum memory via a measurement-device-independent scheme. A single photon generated via Rydberg blockade in one atomic ensemble is stored in another atomic ensemble via electromagnetically induced transparency. After storage for a long duration, this photon is retrieved and interfered with a second photon to perform joint Bell-state measurement (BSM). Quantum state for each photon is chosen based on a quantum random number generator respectively in each run. By evaluating correlations between the random states and BSM results, we certify that our memory is genuinely entanglement-preserving.

quant-ph↗