arXiv subjects

Peng Cheng

Publications and source records attributed to Peng Cheng.

At least 235 records · Page 13Linked to original sources

arXiv2021

Measuring height difference using two-way satellite time and frequency transfer

According to general relativity theory (GRT), the clock at a position with lower geopotential ticks slower than an identical one at a position with higher geopotential. Here, we provide a geopotential comparison using a non-transportable hydrogen clock and a transportable hydrogen clock for altitude transmission based on the two-way satellite time and frequency transfer (TWSTFT) technique. First, we set one hydrogen clock on the fifth floor and another hydrogen clock on the ground floor, with their height difference of 22.8 m measured by tape, and compared the time difference between these two clocks by TWSTFT for 13 days. Then, we set both clocks on the ground floor and compared the time difference between the two clocks for 7 days for zero-baseline calibration (synchronization). Based on the measured time difference between the two clocks at different floors, we obtained the height difference of $28 \pm 05.4$ m, which coincides well with the tape-measured result. This experiment provides a method of height propagation using precise clocks based on the TWSTFT technique.

physics.geo-ph↗

arXiv2021

Better Pay Attention Whilst Fuzzing

Fuzzing is one of the prevailing methods for vulnerability detection. However, even state-of-the-art fuzzing methods become ineffective after some period of time, i.e., the coverage hardly improves as existing methods are ineffective to focus the attention of fuzzing on covering the hard-to-trigger program paths. In other words, they cannot generate inputs that can break the bottleneck due to the fundamental difficulty in capturing the complex relations between the test inputs and program coverage. In particular, existing fuzzers suffer from the following main limitations: 1) lacking an overall analysis of the program to identify the most "rewarding" seeds, and 2) lacking an effective mutation strategy which could continuously select and mutates the more relevant "bytes" of the seeds. In this work, we propose an approach called ATTuzz to address these two issues systematically. First, we propose a lightweight dynamic analysis technique which estimates the "reward" of covering each basic block and selects the most rewarding seeds accordingly. Second, we mutate the selected seeds according to a neural network model which predicts whether a certain "rewarding" block will be covered given certain mutation on certain bytes of a seed. The model is a deep learning model equipped with attention mechanism which is learned and updated periodically whilst fuzzing. Our evaluation shows that ATTuzz significantly outperforms 5 state-of-the-art grey-box fuzzers on 13 popular real-world programs at achieving higher edge coverage and finding new bugs. In particular, ATTuzz achieved 2X edge coverage and 4X bugs detected than AFL over 24-hour runs. Moreover, ATTuzz persistently improves the edge coverage in the long run, i.e., achieving 50% more coverage than AFL in 5 days.

cs.CR↗

arXiv2021

Copy, Right? A Testing Framework for Copyright Protection of Deep Learning Models

Deep learning (DL) models, especially those large-scale and high-performance ones, can be very costly to train, demanding a great amount of data and computational resources. Unauthorized reproduction of DL models can lead to copyright infringement and cause huge economic losses to model owners. Existing copyright protection techniques are mostly based on watermarking, which embeds an owner-specified watermark into the model. While being able to provide exact ownership verification, these techniques are 1) invasive, as they need to tamper with the training process, which may affect the utility or introduce new security risks; 2) prone to adaptive attacks that attempt to remove the watermark; and 3) not robust to the emerging model extraction attacks. Latest fingerprinting work, though being non-invasive, also falls short when facing the diverse and ever-growing attack scenarios. In this paper, we propose a novel testing framework for DL copyright protection: DEEPJUDGE. DEEPJUDGE quantitatively tests the similarities between two DL models: a victim model and a suspect model. It leverages a diverse set of testing metrics and test case generation methods to produce a chain of supporting evidence to help determine whether a suspect model is a copy of the victim model. Advantages of DEEPJUDGE include: 1) non-invasive, as it works directly on the model and does not tamper with the training process; 2) efficient, as it only needs a small set of test cases and a quick scan of models; 3) flexible, as it can easily incorporate new metrics or generation methods to obtain more confident judgement; and 4) fairly robust to model extraction and adaptive attacks. We verify the effectiveness of DEEPJUDGE under typical copyright infringement scenarios, including model finetuning, pruning and extraction, via extensive experiments on both image and speech datasets with a variety of model architectures.

cs.CR↗

arXiv2021

AHEAD: Adaptive Hierarchical Decomposition for Range Query under Local Differential Privacy

For protecting users' private data, local differential privacy (LDP) has been leveraged to provide the privacy-preserving range query, thus supporting further statistical analysis. However, existing LDP-based range query approaches are limited by their properties, i.e., collecting user data according to a pre-defined structure. These static frameworks would incur excessive noise added to the aggregated data especially in the low privacy budget setting. In this work, we propose an Adaptive Hierarchical Decomposition (AHEAD) protocol, which adaptively and dynamically controls the built tree structure, so that the injected noise is well controlled for maintaining high utility. Furthermore, we derive a guideline for properly choosing parameters for AHEAD so that the overall utility can be consistently competitive while rigorously satisfying LDP. Leveraging multiple real and synthetic datasets, we extensively show the effectiveness of AHEAD in both low and high dimensional range query scenarios, as well as its advantages over the state-of-the-art methods. In addition, we provide a series of useful observations for deploying AHEAD in practice.

cs.CR↗

arXiv2021

Semi-Supervised Domain Generalizable Person Re-Identification

Existing person re-identification (re-id) methods are stuck when deployed to a new unseen scenario despite the success in cross-camera person matching. Recent efforts have been substantially devoted to domain adaptive person re-id where extensive unlabeled data in the new scenario are utilized in a transductive learning manner. However, for each scenario, it is required to first collect enough data and then train such a domain adaptive re-id model, thus restricting their practical application. Instead, we aim to explore multiple labeled datasets to learn generalized domain-invariant representations for person re-id, which is expected universally effective for each new-coming re-id scenario. To pursue practicability in real-world systems, we collect all the person re-id datasets (20 datasets) in this field and select the three most frequently used datasets (i.e., Market1501, DukeMTMC, and MSMT17) as unseen target domains. In addition, we develop DataHunter that collects over 300K+ weak annotated images named YouTube-Human from YouTube street-view videos, which joins 17 remaining full labeled datasets to form multiple source domains. On such a large and challenging benchmark called FastHuman (~440K+ labeled images), we further propose a simple yet effective Semi-Supervised Knowledge Distillation (SSKD) framework. SSKD effectively exploits the weakly annotated data by assigning soft pseudo labels to YouTube-Human to improve models' generalization ability. Experiments on several protocols verify the effectiveness of the proposed SSKD framework on domain generalizable person re-id, which is even comparable to supervised learning on the target domains. Lastly, but most importantly, we hope the proposed benchmark FastHuman could bring the next development of domain generalizable person re-id algorithms.

cs.CV↗

arXiv2021

Privacy-Preserving Batch-based Task Assignment in Spatial Crowdsourcing with Untrusted Server

In this paper, we study the privacy-preserving task assignment in spatial crowdsourcing, where the locations of both workers and tasks, prior to their release to the server, are perturbed with Geo-Indistinguishability (a differential privacy notion for location-based systems). Different from the previously studied online setting, where each task is assigned immediately upon arrival, we target the batch-based setting, where the server maximizes the number of successfully assigned tasks after a batch of tasks arrive. To achieve this goal, we propose the k-Switch solution, which first divides the workers into small groups based on the perturbed distance between workers/tasks, and then utilizes Homomorphic Encryption (HE) based secure computation to enhance the task assignment. Furthermore, we expedite HE-based computation by limiting the size of the small groups under k. Extensive experiments demonstrate that, in terms of the number of successfully assigned tasks, the k-Switch solution improves batch-based baselines by 5.9X and the existing online solution by 1.74X, with no privacy leak.

cs.CR↗

arXiv2021

A Queueing-Theoretic Framework for Vehicle Dispatching in Dynamic Car-Hailing [technical report]

With the rapid development of smart mobile devices, the car-hailing platforms (e.g., Uber or Lyft) have attracted much attention from both the academia and the industry. In this paper, we consider an important dynamic car-hailing problem, namely \textit{maximum revenue vehicle dispatching} (MRVD), in which rider requests dynamically arrive and drivers need to serve as many riders as possible such that the entire revenue of the platform is maximized. We prove that the MRVD problem is NP-hard and intractable. In addition, the dynamic car-hailing platforms have no information of the future riders, which makes the problem even harder. To handle the MRVD problem, we propose a queueing-based vehicle dispatching framework, which first uses existing machine learning algorithms to predict the future vehicle demand of each region, then estimates the idle time periods of drivers through a queueing model for each region. With the information of the predicted vehicle demands and estimated idle time periods of drivers, we propose two batch-based vehicle dispatching algorithms to efficiently assign suitable drivers to riders such that the expected overall revenue of the platform is maximized during each batch processing. Through extensive experiments, we demonstrate the efficiency and effectiveness of our proposed approaches over both real and synthetic datasets.

cs.LG↗

arXiv2021

Dynamic Multi-Scale Loss Optimization for Object Detection

With the continuous improvement of the performance of object detectors via advanced model architectures, imbalance problems in the training process have received more attention. It is a common paradigm in object detection frameworks to perform multi-scale detection. However, each scale is treated equally during training. In this paper, we carefully study the objective imbalance of multi-scale detector training. We argue that the loss in each scale level is neither equally important nor independent. Different from the existing solutions of setting multi-task weights, we dynamically optimize the loss weight of each scale level in the training process. Specifically, we propose an Adaptive Variance Weighting (AVW) to balance multi-scale loss according to the statistical variance. Then we develop a novel Reinforcement Learning Optimization (RLO) to decide the weighting scheme probabilistically during training. The proposed dynamic methods make better utilization of multi-scale training loss without extra computational complexity and learnable parameters for backpropagation. Experiments show that our approaches can consistently boost the performance over various baseline detectors on Pascal VOC and MS COCO benchmark.

cs.CV↗

arXiv2021

Realize Emergent Gravity to Generic Situations

We clarify the problem in which occasions can gravitational force be regarded emergent from thermodynamics, by proposing an entropic mechanism that can extract the entropic gradient existing in spacetime, due to the variation of the Casini-Bekenstein bound in specific quasi-static processes with the heat flux $δQ$ into the whole casual wedge. We explicitly formulate the derivation of inertial force as the emergent gravitational attraction from the Entanglement First Law. We find the saturation of the bound along with the vanishing relative entropy corresponds to the variation of minimal surface. To covariant meaning, it is the Bousso bound. Besides, this understanding is connected to recent Pennington's work on Black Hole Information Paradox, suggesting a Page-Curve function origins from removing attraction by the external heat bath. Our theory from entanglement now overcomes several criticism towards Verlinde's original entropic force proposal, and is able to co-exist with Susskind's Complexity Tendency. This entropic mechanism reproduces the Newton's Second Law in Rindler space and the gravitational force (together with derivation of the Einstein equation) beyond the near-horizon region, and can be adapted into AdS/CFT and other generic situations.

hep-th↗

arXiv2021

False Data Injection Attacks and the Distributed Countermeasure in DC Microgrids

In this paper, we consider a hierarchical control based DC microgrid (DCmG) equipped with unknown input observer (UIO) based detectors, where the potential false data injection (FDI) attacks and the distributed countermeasure are investigated. First, we find that the vulnerability of the UIO-based detector originates from the lacked knowledge of true unknown inputs. Zero trace stealthy (ZTS) attacks can be launched by secretly faking the unknown inputs, under which the detection residual will not be altered, and the impact on the DCmG in terms of voltage balancing and current sharing is theoretically analyzed. Then, to mitigate the ZTS attack, we propose an automatic and timely countermeasure based on the average point of common coupling (PCC) voltage obtained from the dynamic average consensus (DAC) estimator. The integrity of the communicated data utilized in DAC estimators is guaranteed via UIO-based detectors, where the DAC parameters are perturbed in a fixed period to be concealed from attackers. Finally, the detection and mitigation performance of the proposed countermeasure is rigorously investigated, and extensive simulations are conducted in Simulink/PLECS to validate the theoretical results.

eess.SY↗

arXiv2021

Anomalies as Obstructions: from Dimensional Lifts to Swampland

We revisit the relation between the anomalies in four and six dimensions and the Chern-Simons couplings one dimension below. While the dimensional reduction of chiral theories is well-understood, the question which three and five-dimensional theories can come from a general circle reduction, and are hence liftable, is more subtle. We argue that existence of an anomaly cancellation mechanism is a necessary condition for liftability. In addition, the anomaly cancellation and the CS couplings in six and five dimensions respectively determine the central charges of string-like BPS objects that cannot be consistently decoupled from gravity, a.k.a. supergravity strings. Following the completeness conjecture and requiring that their worldsheet theory is unitary imposes bounds on the admissible theories. We argue that for the anomaly-free six-dimensional theories it is more advantageous to study the unitarity constraints obtained after reduction to five dimensions. In general these are slightly more stringent and can be cast in a more geometric form, highly reminiscent of the Kodaira positivity condition (KPC). Indeed, for the F-theoretic models which have an underlying Calabi-Yau threefold these can be directly compared. The unitarity constraints (UC) are in general weaker than KPC, and maybe useful in understanding the consistent models without F-theoretic realisation. We catalogue the cases when UC is more restrictive than KPC, hinting at more refined hidden structure in elliptic Calabi-Yau threefolds with certain singularity structure.

hep-th↗

arXiv2021

Soft black hole information paradox: Page curve from Maxwell soft hair of a black hole

Treating Maxwell soft hair as a transition function that relates U(1) gauge fields living in the asymptotic region and near-horizon region, the U(1) gauge parameter $ϕ$ naturally becomes a good label of those Maxwell soft hair degrees of freedom. This interpretation also builds the connection between Maxwell soft hair and U(1) edge modes living in the intermediate region, which admits a well-defined effective action description. We study the statistical properties by Euclidean path integral, which concludes that the soft hair density of state increases with black hole temperature. Hawking radiations increase black hole entropy by creating entanglements, while the measurements of soft modes project the black hole onto lower entropy states. The competition between phase spaces of Hawking radiations and soft hair measurements gives rise to one version of the Page curve consistent with the unitary evolution of the black hole.

hep-th↗

arXiv2021

Enabling AI in Future Wireless Networks: A Data Life Cycle Perspective

Recent years have seen rapid deployment of mobile computing and Internet of Things (IoT) networks, which can be mostly attributed to the increasing communication and sensing capabilities of wireless systems. Big data analysis, pervasive computing, and eventually artificial intelligence (AI) are envisaged to be deployed on top of the IoT and create a new world featured by data-driven AI. In this context, a novel paradigm of merging AI and wireless communications, called Wireless AI that pushes AI frontiers to the network edge, is widely regarded as a key enabler for future intelligent network evolution. To this end, we present a comprehensive survey of the latest studies in wireless AI from the data-driven perspective. Specifically, we first propose a novel Wireless AI architecture that covers five key data-driven AI themes in wireless networks, including Sensing AI, Network Device AI, Access AI, User Device AI and Data-provenance AI. Then, for each data-driven AI theme, we present an overview on the use of AI approaches to solve the emerging data-related problems and show how AI can empower wireless network functionalities. Particularly, compared to the other related survey papers, we provide an in-depth discussion on the Wireless AI applications in various data-driven domains wherein AI proves extremely useful for wireless network design and optimization. Finally, research challenges and future visions are also discussed to spur further research in this promising area.

cs.NI↗

arXiv2021

CrossoverScheduler: Overlapping Multiple Distributed Training Applications in a Crossover Manner

Distributed deep learning workloads include throughput-intensive training tasks on the GPU clusters, where the Distributed Stochastic Gradient Descent (SGD) incurs significant communication delays after backward propagation, forces workers to wait for the gradient synchronization via a centralized parameter server or directly in decentralized workers. We present CrossoverScheduler, an algorithm that enables communication cycles of a distributed training application to be filled by other applications through pipelining communication and computation. With CrossoverScheduler, the running performance of distributed training can be significantly improved without sacrificing convergence rate and network accuracy. We achieve so by introducing Crossover Synchronization which allows multiple distributed deep learning applications to time-share the same GPU alternately. The prototype of CrossoverScheduler is built and integrated with Horovod. Experiments on a variety of distributed tasks show that CrossoverScheduler achieves 20% \times speedup for image classification tasks on ImageNet dataset.

cs.DC↗

arXiv2021

RobOT: Robustness-Oriented Testing for Deep Learning Systems

Recently, there has been a significant growth of interest in applying software engineering techniques for the quality assurance of deep learning (DL) systems. One popular direction is deep learning testing, where adversarial examples (a.k.a.~bugs) of DL systems are found either by fuzzing or guided search with the help of certain testing metrics. However, recent studies have revealed that the commonly used neuron coverage metrics by existing DL testing approaches are not correlated to model robustness. It is also not an effective measurement on the confidence of the model robustness after testing. In this work, we address this gap by proposing a novel testing framework called Robustness-Oriented Testing (RobOT). A key part of RobOT is a quantitative measurement on 1) the value of each test case in improving model robustness (often via retraining), and 2) the convergence quality of the model robustness improvement. RobOT utilizes the proposed metric to automatically generate test cases valuable for improving model robustness. The proposed metric is also a strong indicator on how well robustness improvement has converged through testing. Experiments on multiple benchmark datasets confirm the effectiveness and efficiency of RobOT in improving DL model robustness, with 67.02% increase on the adversarial robustness that is 50.65% higher than the state-of-the-art work DeepGini.

cs.SE↗

arXiv2021

Extreme Suppression of Antiferromagnetic Order and Critical Scaling in a Two-Dimensional Random Quantum Magnet

Sr$_2$CuTeO$_6$ is a square-lattice Néel antiferromagnet with superexchange between first-neighbor $S=1/2$ Cu spins mediated by plaquette centered Te ions. Substituting Te by W, the affected impurity plaquettes have predominantly second-neighbor interactions, thus causing local magnetic frustration. Here we report a study of Sr$_2$CuTe$_{1-x}$W$_x$O$_6$ using neutron diffraction and $μ$SR techniques, showing that the Néel order vanishes already at $x = 0.025 \pm 0.005$. We explain this extreme order suppression using a two-dimensional Heisenberg spin model, demonstrating that a W-type impurity induces a deformation of the order parameter that decays with distance as $1/r^2$ at temperature $T=0$. The associated logarithmic singularity leads to loss of order for any $x>0$. Order for small $x>0$ and $T>0$ is induced by weak interplane couplings. In the nonmagnetic phase of Sr$_2$CuTe$_{1-x}$W$_x$O$_6$, the $μ$SR relaxation rate exhibits quantum critical scaling with a large dynamic exponent, $z \approx 3$, consistent with a random-singlet state.

cond-mat.str-el↗

arXiv2020

Research on Failure Characteristics of Circular Expansion Foundation of Large Wind Turbine

Wind power as clean energy has been widely promoted. However, during the operation of a wind turbine in a mountainous area, a large number of instability phenomena appear in the wind turbine foundation. To study the damage characteristics of a mountain wind turbine foundation, the influence of topography on a mountain wind turbine is considered. According to the complex mechanical structure characteristics of the wind turbine, a circular expansion foundation model have a ratio of 1:10 to the wind turbine which 2MW installed capacity is established. The foundation model is simulated by the ABAQUS, and the impact of soil pressure on the wind turbine foundation under random wind load is analyzed. Understand the fragile parts of the wind turbine foundation. The results show that :(1) under the action of random wind load, the strain of the anchor rod, and the ground ring, of the bottom plate is small and will not be destroyed ;(2) under the influence of wind load, he soil within a 1.5 times radius range of wind turbine foundation is easily disturbed, but the core soil below the foundation is unaffected. It is suggested that the soil within a 1.5 times radius range of the wind turbine foundation should be strengthened to ensure the safety and stability of the foundation.

math.NA↗

arXiv2020

Task Offloading for Large-Scale Asynchronous Mobile Edge Computing: An Index Policy Approach

Mobile-edge computing (MEC) offloads computational tasks from wireless devices to network edge, and enables real-time information transmission and computing. Most existing work concerns a small-scale synchronous MEC system. In this paper, we focus on a large-scale asynchronous MEC system with random task arrivals, distinct workloads, and diverse deadlines. We formulate the offloading policy design as a restless multi-armed bandit (RMAB) to maximize the total discounted reward over the time horizon. However, the formulated RMAB is related to a PSPACE-hard sequential decision-making problem, which is intractable. To address this issue, by exploiting the Whittle index (WI) theory, we rigorously establish the WI indexability and derive a scalable closed-form solution. Consequently, in our WI policy, each user only needs to calculate its WI and report it to the BS, and the users with the highest indices are selected for task offloading. Furthermore, when the task completion ratio becomes the focus, the shorter slack time less remaining workload (STLW) priority rule is introduced into the WI policy for performance improvement. When the knowledge of user offloading energy consumption is not available prior to the offloading, we develop Bayesian learning-enabled WI policies, including maximum likelihood estimation, Bayesian learning with conjugate prior, and prior-swapping techniques. Simulation results show that the proposed policies significantly outperform the other existing policies.

cs.IT↗