arXiv subjects

Han Peng

Publications and source records attributed to Han Peng.

22 records · Page 2Linked to original sources

arXiv2018

A Unified Framework for Joint Mobility Prediction and Object Profiling of Drones in UAV Networks

In recent years, using a network of autonomous and cooperative unmanned aerial vehicles (UAVs) without command and communication from the ground station has become more imperative, in particular in search-and-rescue operations, disaster management, and other applications where human intervention is limited. In such scenarios, UAVs can make more efficient decisions if they acquire more information about the mobility, sensing and actuation capabilities of their neighbor nodes. In this paper, we develop an unsupervised online learning algorithm for joint mobility prediction and object profiling of UAVs to facilitate control and communication protocols. The proposed method not only predicts the future locations of the surrounding flying objects, but also classifies them into different groups with similar levels of maneuverability (e.g. rotatory, and fixed-wing UAVs) without prior knowledge about these classes. This method is flexible in admitting new object types with unknown mobility profiles, thereby applicable to emerging flying Ad-hoc networks with heterogeneous nodes.

cs.NI↗

arXiv2015

Discovery of a Weyl Semimetal in non-Centrosymmetric Compound TaAs

Three-dimensional (3D) topological Weyl semimetals (TWSs) represent a novel state of quantum matter with unusual electronic structures that resemble both a "3D graphene" and a topological insulator by possessing pairs of Weyl points (through which the electronic bands disperse linearly along all three momentum directions) connected by topological surface states, forming the unique "Fermi-arc" type Fermi-surface (FS). Each Weyl point is chiral and contains half of the degrees of freedom of a Dirac point, and can be viewed as a magnetic monopole in the momentum space. Here, by performing angle-resolved photoemission spectroscopy on non-centrosymmetric compound TaAs, we observed its complete band structures including the unique "Fermi-arc" FS and linear bulk band dispersion across the Weyl points, in excellent agreement with the theoretical calculations. This discovery not only confirms TaAs as the first 3D TWS, but also provides an ideal platform for realizing exotic physical phenomena (e.g. negative magnetoresistance, chiral magnetic effects and quantum anomalous Hall effect) which may also lead to novel future applications.

cond-mat.mtrl-sci↗

arXiv2006

Improved Exponential Time Lower Bound of Knapsack Problem under BT model

M.Alekhnovich et al. recently have proposed a model of algorithms, called BT model, which covers Greedy, Backtrack and Simple Dynamic Programming methods and can be further divided into fixed, adaptive and fully adaptive three kinds, and have proved exponential time lower bounds of exact and approximation algorithms under adaptive BT model for Knapsack problem which are $Ω(2^{n/2}/\sqrt n)=Ω(2^{0.5n}/\sqrt n)$ and $Ω((1/ε)^{1/3.17})\approxΩ((1/ε)^{0.315})$(for approximation ratio $1-ε$) respectively (M. Alekhovich, A. Borodin, J. Buresh-Oppenheim, R. Impagliazzo, A. Magen, and T. Pitassi, Toward a Model for Backtracking and Dynamic Programming, \emph{Proceedings of Twentieth Annual IEEE Conference on Computational Complexity}, pp308-322, 2005). In this note, we slightly improved their lower bounds to $Ω(2^{(2-ε)n/3}/\sqrt{n})\approx Ω(2^{0.66n}/\sqrt{n})$ and $Ω((1/ε)^{1/2.38})\approxΩ((1/ε)^{0.420})$, and proposed as an open question what is the best achievable lower bounds for knapsack under adaptive BT models.

cs.CC↗

arXiv2006

On Lower Bound of Worst Case Error Probability for Quantum Fingerprinting with Shared Entanglement

This paper discusses properties of quantum fingerprinting with shared entanglement. Under certain restriction of final measurement, a relation is given between unitary operations of two parties. Then, by reducing to spherical coding problem, this paper gives a lower bound of worst case error probability for quantum fingerprinting with shared entanglement, showing a relation between worst case error probability and the amount of entanglement(measured by Schmidt number).

quant-ph↗