arXiv subjects

Lei Yang

Publications and source records attributed to Lei Yang.

At least 433 records · Page 24Linked to original sources

arXiv2020

SemanticAdv: Generating Adversarial Examples via Attribute-conditional Image Editing

Deep neural networks (DNNs) have achieved great success in various applications due to their strong expressive power. However, recent studies have shown that DNNs are vulnerable to adversarial examples which are manipulated instances targeting to mislead DNNs to make incorrect predictions. Currently, most such adversarial examples try to guarantee "subtle perturbation" by limiting the $L_p$ norm of the perturbation. In this paper, we aim to explore the impact of semantic manipulation on DNNs predictions by manipulating the semantic attributes of images and generate "unrestricted adversarial examples". In particular, we propose an algorithm \emph{SemanticAdv} which leverages disentangled semantic factors to generate adversarial perturbation by altering controlled semantic attributes to fool the learner towards various "adversarial" targets. We conduct extensive experiments to show that the semantic based adversarial examples can not only fool different learning tasks such as face verification and landmark detection, but also achieve high targeted attack success rate against \emph{real-world black-box} services such as Azure face verification service based on transferability. To further demonstrate the applicability of \emph{SemanticAdv} beyond face recognition domain, we also generate semantic perturbations on street-view images. Such adversarial examples with controlled semantic manipulation can shed light on further understanding about vulnerabilities of DNNs as well as potential defensive approaches.

cs.LG↗

arXiv2020

Blockchain for Future Smart Grid: A Comprehensive Survey

The concept of smart grid has been introduced as a new vision of the conventional power grid to figure out an efficient way of integrating green and renewable energy technologies. In this way, Internet-connected smart grid, also called energy Internet, is also emerging as an innovative approach to ensure the energy from anywhere at any time. The ultimate goal of these developments is to build a sustainable society. However, integrating and coordinating a large number of growing connections can be a challenging issue for the traditional centralized grid system. Consequently, the smart grid is undergoing a transformation to the decentralized topology from its centralized form. On the other hand, blockchain has some excellent features which make it a promising application for smart grid paradigm. In this paper, we aim to provide a comprehensive survey on application of blockchain in smart grid. As such, we identify the significant security challenges of smart grid scenarios that can be addressed by blockchain. Then, we present a number of blockchain-based recent research works presented in different literatures addressing security issues in the area of smart grid. We also summarize several related practical projects, trials, and products that have been emerged recently. Finally, we discuss essential research challenges and future directions of applying blockchain to smart grid security issues.

cs.CR↗

arXiv2020

A Framework for Behavior Privacy Preserving in Radio Frequency Signal

Recent years have witnessed the bloom development of the human-centered wireless sensing applications, in which some human information, such as the user's identity and motions, can be retrieved through analyzing the signal distortion caused by the target person. However, the openness of wireless transmission raises increasing concerns on user privacy, since either the human identity or human motion is sensitive in certain scenarios, including personal residence, laboratory, and office. Researchers have reported that commodity WiFi signals can be abused to identify users. To dispel this threat, in this paper we propose a privacy-preserving framework to effectively hide the information of user behaviors in wireless signals while retaining the ability of user authentication. The core of our framework is a novel Siamese network-based deep model, namely RFBP-Net. In this way, wireless sensing reveals user information moderately. We conduct extensive experiments on both the real WiFi and RFID system and open datasets. The experiment results show that RFBP-Net is able to significantly reduce the activity recognition accuracy, i.e., 70% reduction in the RFID system and 80% reduction in the WiFi system, with a slight penalty in the user authentication accuracy, i.e., only 5% and 1% decrease in the RFID and WiFi system, respectively.

cs.CR↗

arXiv2020

Learning to Cluster Faces via Confidence and Connectivity Estimation

Face clustering is an essential tool for exploiting the unlabeled face data, and has a wide range of applications including face annotation and retrieval. Recent works show that supervised clustering can result in noticeable performance gain. However, they usually involve heuristic steps and require numerous overlapped subgraphs, severely restricting their accuracy and efficiency. In this paper, we propose a fully learnable clustering framework without requiring a large number of overlapped subgraphs. Instead, we transform the clustering problem into two sub-problems. Specifically, two graph convolutional networks, named GCN-V and GCN-E, are designed to estimate the confidence of vertices and the connectivity of edges, respectively. With the vertex confidence and edge connectivity, we can naturally organize more relevant vertices on the affinity graph and group them into clusters. Experiments on two large-scale benchmarks show that our method significantly improves clustering accuracy and thus performance of the recognition models trained on top, yet it is an order of magnitude more efficient than existing supervised methods.

cs.CV↗

arXiv2020

High Throughput Cryptocurrency Routing in Payment Channel Networks

Despite growing adoption of cryptocurrencies, making fast payments at scale remains a challenge. Payment channel networks (PCNs) such as the Lightning Network have emerged as a viable scaling solution. However, completing payments on PCNs is challenging: payments must be routed on paths with sufficient funds. As payments flow over a single channel (link) in the same direction, the channel eventually becomes depleted and cannot support further payments in that direction; hence, naive routing schemes like shortest-path routing can deplete key payment channels and paralyze the system. Today's PCNs also route payments atomically, worsening the problem. In this paper, we present Spider, a routing solution that "packetizes" transactions and uses a multi-path transport protocol to achieve high-throughput routing in PCNs. Packetization allows Spider to complete even large transactions on low-capacity payment channels over time, while the multi-path congestion control protocol ensures balanced utilization of channels and fairness across flows. Extensive simulations comparing Spider with state-of-the-art approaches shows that Spider requires less than 25% of the funds to successfully route over 95% of transactions on balanced traffic demands, and offloads 4x more transactions onto the PCN on imbalanced demands.

cs.NI↗

arXiv2020

Device-Circuit-Architecture Co-Exploration for Computing-in-Memory Neural Accelerators

Co-exploration of neural architectures and hardware design is promising to simultaneously optimize network accuracy and hardware efficiency. However, state-of-the-art neural architecture search algorithms for the co-exploration are dedicated for the conventional von-neumann computing architecture, whose performance is heavily limited by the well-known memory wall. In this paper, we are the first to bring the computing-in-memory architecture, which can easily transcend the memory wall, to interplay with the neural architecture search, aiming to find the most efficient neural architectures with high network accuracy and maximized hardware efficiency. Such a novel combination makes opportunities to boost performance, but also brings a bunch of challenges. The design space spans across multiple layers from device type, circuit topology to neural architecture. In addition, the performance may degrade in the presence of device variation. To address these challenges, we propose a cross-layer exploration framework, namely NACIM, which jointly explores device, circuit and architecture design space and takes device variation into consideration to find the most robust neural architectures. Experimental results demonstrate that NACIM can find the robust neural network with 0.45% accuracy loss in the presence of device variation, compared with a 76.44% loss from the state-of-the-art NAS without consideration of variation; in addition, NACIM achieves an energy efficiency up to 16.3 TOPs/W, 3.17X higher than the state-of-the-art NAS.

cs.NE↗

arXiv2020

Resource Allocation for Secure Multi-UAV Communication Systems with Multi-Eavesdropper

In this paper, we study the resource allocation and trajectory design for secure unmanned aerial vehicle (UAV)-enabled communication systems, where multiple multi-purpose UAV base stations are dispatched to provide secure communications to multiple legitimate ground users (GUs) in the existence of multiple eavesdroppers (Eves). Specifically, by leveraging orthogonal frequency division multiple access (OFDMA), active UAV base stations can communicate to their desired ground users via the assigned subcarriers while idle UAV base stations can serve as jammer simultaneously for communication security provisioning. To achieve fairness in secure communication, we maximize the average minimum secrecy rate per user by jointly optimizing the communication/jamming subcarrier allocation policy and the trajectory of UAVs, while taking into account the constraints on the minimum safety distance among multiple UAVs, the maximum cruising speed, the initial/final locations, and the existence of cylindrical no-fly zones (NFZs). The design is formulated as a mixed integer non-convex optimization problem which is generally intractable. Subsequently, a computationally-efficient iterative algorithm is proposed to obtain a suboptimal solution. Simulation results illustrate that the performance of the proposed iterative algorithm can significantly improve the average minimum secrecy rate compared to various baseline schemes.

cs.IT↗

arXiv2020

A Sterile Neutrino Search at compact materials irradiation facility

The compact material irradiation facility (CMIF) is a current project in China that will provide a compact deuteron-beryllium neutron source. The target of this facility will be an intense and compact Isotope Decay-At-Rest (IsoDAR) neutrino source. In this paper, we propose to test the sterile neutrino hypothesis using CMIF as the neutrino source. At CMIF platform, the electron antineutrino production rate can be up to $2.0\times 10^{19}$ per day. When paired with an 80 t liquid scintillator detector to study short baseline electron antineutrino disappearance, the inverse beta decay (IBD) event rate is large enough to investigate the parameter ranges of interest for neutrino anomalies. Our sensitivity analysis shows that a short baseline experiment at this platform will provide a very competitive sterile neutrino search, especially in the high-$Δm^2$ region ($Δm^2 >10\,\text{eV}^2$).

physics.ins-det↗

arXiv2020

Decentralized Dynamic State Estimation with Bimodal Gaussian Mixture Measurement Noise

This paper proposes a decentralized dynamic state estimation (DSE) algorithm with bimodal Gaussian mixture measurement noise. The decentralized DSE is formulated using the Ensemble Kalman Filter (EnKF) and then compared with the unscented Kalman filter (UKF). The performance of the proposed framework is verified using the WSCC 9-bus system simulated in the Real Time Digital Simulator (RTDS). The phasor measurement unit (PMU) measurements are streamed in real-time from the RTDS runtime environment to MATLAB for real-time visualization and estimation. To consider the data corruption scenario in the streaming process, a bi-modal distribution containing two normal distributions with different weights and variances are added to the measurements as the noise component. The performances of both UKF and EnKF are then compared for by calculating the mean-squared-errors (MSEs) between the actual and estimated states.

eess.SP↗

arXiv2020

Co-Exploration of Neural Architectures and Heterogeneous ASIC Accelerator Designs Targeting Multiple Tasks

Neural Architecture Search (NAS) has demonstrated its power on various AI accelerating platforms such as Field Programmable Gate Arrays (FPGAs) and Graphic Processing Units (GPUs). However, it remains an open problem, how to integrate NAS with Application-Specific Integrated Circuits (ASICs), despite them being the most powerful AI accelerating platforms. The major bottleneck comes from the large design freedom associated with ASIC designs. Moreover, with the consideration that multiple DNNs will run in parallel for different workloads with diverse layer operations and sizes, integrating heterogeneous ASIC sub-accelerators for distinct DNNs in one design can significantly boost performance, and at the same time further complicate the design space. To address these challenges, in this paper we build ASIC template set based on existing successful designs, described by their unique dataflows, so that the design space is significantly reduced. Based on the templates, we further propose a framework, namely NASAIC, which can simultaneously identify multiple DNN architectures and the associated heterogeneous ASIC accelerator design, such that the design specifications (specs) can be satisfied, while the accuracy can be maximized. Experimental results show that compared with successive NAS and ASIC design optimizations which lead to design spec violations, NASAIC can guarantee the results to meet the design specs with 17.77%, 2.49x, and 2.32x reductions on latency, energy, and area and with 0.76% accuracy loss. To the best of the authors' knowledge, this is the first work on neural architecture and ASIC accelerator design co-exploration.

cs.LG↗

arXiv2020

Achieving Super-Linear Speedup across Multi-FPGA for Real-Time DNN Inference

Real-time Deep Neural Network (DNN) inference with low-latency requirement has become increasingly important for numerous applications in both cloud computing (e.g., Apple's Siri) and edge computing (e.g., Google/Waymo's driverless car). FPGA-based DNN accelerators have demonstrated both superior flexibility and performance; in addition, for real-time inference with low batch size, FPGA is expected to achieve further performance improvement. However, the performance gain from the single-FPGA design is obstructed by the limited on-chip resource. In this paper, we employ multiple FPGAs to cooperatively run DNNs with the objective of achieving super-linear speed-up against single-FPGA design. In implementing such systems, we found two barriers that hinder us from achieving the design goal: (1) the lack of a clear partition scheme for each DNN layer to fully exploit parallelism, and (2) the insufficient bandwidth between the off-chip memory and the accelerator due to the growing size of DNNs. To tackle these issues, we propose a general framework, "Super-LIP", which can support different kinds of DNNs. In this paper, we take Convolutional Neural Network (CNN) as a vehicle to illustrate Super-LIP. We first formulate an accurate system-level model to support the exploration of best partition schemes. Then, we develop a novel design methodology to effectively alleviate the heavy loads on memory bandwidth by moving traffic from memory bus to inter-FPGA links. We implement Super-LIP based on ZCU102 FPGA boards. Results demonstrate that Super-LIP with 2 FPGAs can achieve 3.48x speedup, compared to the state-of-the-art single-FPGA design. What is more, as the number of FPGAs scales up, the system latency can be further reduced while maintaining high energy efficiency.

cs.DC↗

arXiv2020

Topology Virtualization and Dynamics Shielding Method for LEO Satellite Networks

Virtual Node (VN) method is widely adopted to handle satellite network topological dynamics. However, conventional VN method is insufficient when earth rotation and inter-plane phase difference are considered. An improved VN method based on Celestial Sphere Division is proposed to overcome the defects of the conventional method. An optimized inter-satellite link connecting mode is derived to achieve maximal available links. The optimal VN division solution and addressing scheme are designed to generate a nearly static virtual network and solve the asynchronous switches caused by inter-plane phase difference. Comparison results demonstrate the advantages of proposed method.

cs.NI↗

arXiv2020

Hardware/Software Co-Exploration of Neural Architectures

We propose a novel hardware and software co-exploration framework for efficient neural architecture search (NAS). Different from existing hardware-aware NAS which assumes a fixed hardware design and explores the neural architecture search space only, our framework simultaneously explores both the architecture search space and the hardware design space to identify the best neural architecture and hardware pairs that maximize both test accuracy and hardware efficiency. Such a practice greatly opens up the design freedom and pushes forward the Pareto frontier between hardware efficiency and test accuracy for better design tradeoffs. The framework iteratively performs a two-level (fast and slow) exploration. Without lengthy training, the fast exploration can effectively fine-tune hyperparameters and prune inferior architectures in terms of hardware specifications, which significantly accelerates the NAS process. Then, the slow exploration trains candidates on a validation set and updates a controller using the reinforcement learning to maximize the expected accuracy together with the hardware efficiency. Experiments on ImageNet show that our co-exploration NAS can find the neural architectures and associated hardware design with the same accuracy, 35.24% higher throughput, 54.05% higher energy efficiency and 136x reduced search time, compared with the state-of-the-art hardware-aware NAS.

cs.LG↗

arXiv2019

Toward accurate measurement of property-dependent galaxy clustering I. Comparison of the Vmax method and the "shuffled" method

Galaxy clustering provides insightful clues to our understanding of galaxy formation and evolution, as well as the universe. The redshift assignment for the random sample is one of the key steps to measure the galaxy clustering accurately. In this paper, by virtue of the mock galaxy catalogs, we investigate the effect of two redshift assignment methods on the measurement of galaxy two-point correlation functions (hereafter 2PCFs), the Vmax method and the "shuffled" method. We found that the shuffled method significantly underestimates both of the projected 2PCFs and the two-dimensional 2PCFs in redshift space. While the Vmax method does not show any notable bias on the 2PCFs for volume-limited samples. For flux-limited samples, the bias produced by the Vmax method is less than half of the shuffled method on large scales. Therefore, we strongly recommend the Vmax method to assign redshifts to random samples in the future galaxy clustering analysis.

astro-ph.CO↗

arXiv2019

Calculation of the $B\to K_{0,2}^*(1430)f_0(980)/σ$ decays in the Perturbative QCD Approach

Motivated by the observations of the decays $B^0 \to K_0^{*}(1430)^0 f_0(980)$ and $ B^0 \to K_2^{*}(1430)^0 f_0(980)$ from BaBar collaboration, we study the $B^{0(+)} \to K_{0,2}^{*}(1430)^{0(+)} f_0(980)/σ$ decays in the perturbative QCD approach for the first time. In the absence of reliable nonperturbative wave functions we only assume the scalar meson $f_0(980)$ and $σ$ are two-quark ground states. In our calculations, these decays are all dominated by the hard-scattering emission and annihilation diagrams, while the factorizable emission diagrams are forbidden or suppressed heavily by the vector decay constants. Furthermore, the branching fractions are sensitive to the mixing between $f_0(980)$ and $σ$. Comparing our results with the experimental data, a large mixing angle $θ$ is favored. Taking $θ=145^\circ$, the orders of branching fractions of $B \to K_0^{*}(1430)^0 σ$, $B \to K_{2}^{*}(1430)^0 σ$ and $B \to K_{0,2}^{*}(1430)^0 f_0(980)$ are predicted to be $10^{-4}$, $10^{-5}$ and $10^{-6}$, respectively, which can be measured in the current experiments such as LHCb and Belle-2. In addition, although these decays are penguin dominant, the mixing also leads to large direct $CP$ asymmetries in these decays. With the precise data in future, our results could shed light on the inner structure of the scalar mesons and can be used to determine the mixing angle of the $σ-f_0(980)$ system.

hep-ph↗

arXiv2019

Numerical study of vanishing and spreading dynamics of chemotaxis systems with logistic source and a free boundary

The current paper is to investigate the numerical approximation of logistic type chemotaxis models in one space dimension with a free boundary. Such a model with a free boundary describes the spreading of a new or invasive species subject to the influence of some chemical substances in an environment with a free boundary representing the spreading front (see Bao and Shen [1], [2]). The main challenges in the numerical studies lie in tracking the moving free boundary and the nonlinear terms from chemical. To overcome them, a front fixing framework coupled with finite difference method is introduced. The accuracy of the proposed method, the positivity of the solution, and the stability of the scheme are discussed.The numerical simulations agree well with theoretical results such as the vanishing spreading dichotomy, local persistence, and stability. These simulations also validate some conjectures in our future theoretical studies such as the dependence of the vanishing-spreading dichotomy on the initial solution u0, initial habitat h0, the moving speed ν and the chemotactic sensitivity coefficients \c{hi}1,\c{hi}2.

math.NA↗

arXiv2019

A Pvalue-guided Anomaly Detection Approach Combining Multiple Heterogeneous Log Parser Algorithms on IIoT Systems

Industrial Internet of Things (IIoT) is becoming an attack target of advanced persistent threat (APT). Currently, IIoT logs have not been effectively used for anomaly detection. In this paper, we use blockchain to prevent logs from being tampered with and propose a pvalue-guided anomaly detection approach. This approach uses statistical pvalues to combine multiple heterogeneous log parser algorithms. The weighted edit distance is selected as a score function to calculate the nonconformity score between a log and a predefined event. The pvalue is calculated based on the non-conformity scores which indicate how well a log matches an event. This approach is tested on a large number of real-world HDFS logs and IIoT logs. The experiment results show that abnormal events could be effectively recognized by our pvalue-guided approach.

cs.CR↗

arXiv2019

Learning to Cluster Faces on an Affinity Graph

Face recognition sees remarkable progress in recent years, and its performance has reached a very high level. Taking it to a next level requires substantially larger data, which would involve prohibitive annotation cost. Hence, exploiting unlabeled data becomes an appealing alternative. Recent works have shown that clustering unlabeled faces is a promising approach, often leading to notable performance gains. Yet, how to effectively cluster, especially on a large-scale (i.e. million-level or above) dataset, remains an open question. A key challenge lies in the complex variations of cluster patterns, which make it difficult for conventional clustering methods to meet the needed accuracy. This work explores a novel approach, namely, learning to cluster instead of relying on hand-crafted criteria. Specifically, we propose a framework based on graph convolutional network, which combines a detection and a segmentation module to pinpoint face clusters. Experiments show that our method yields significantly more accurate face clusters, which, as a result, also lead to further performance gain in face recognition.

cs.CV↗