arXiv subjects

Peng Liu

Publications and source records attributed to Peng Liu.

At least 325 records · Page 18Linked to original sources

arXiv2021

Feature-Filter: Detecting Adversarial Examples through Filtering off Recessive Features

Deep neural networks (DNNs) are under threat from adversarial example attacks. The adversary can easily change the outputs of DNNs by adding small well-designed perturbations to inputs. Adversarial example detection is a fundamental work for robust DNNs-based service. Adversarial examples show the difference between humans and DNNs in image recognition. From a human-centric perspective, image features could be divided into dominant features that are comprehensible to humans, and recessive features that are incomprehensible to humans, yet are exploited by DNNs. In this paper, we reveal that imperceptible adversarial examples are the product of recessive features misleading neural networks, and an adversarial attack is essentially a kind of method to enrich these recessive features in the image. The imperceptibility of the adversarial examples indicates that the perturbations enrich recessive features, yet hardly affect dominant features. Therefore, adversarial examples are sensitive to filtering off recessive features, while benign examples are immune to such operation. Inspired by this idea, we propose a label-only adversarial detection approach that is referred to as feature-filter. Feature-filter utilizes discrete cosine transform to approximately separate recessive features from dominant features, and gets a mutant image that is filtered off recessive features. By only comparing DNN's prediction labels on the input and its mutant, feature-filter can real-time detect imperceptible adversarial examples at high accuracy and few false positives.

cs.LG↗

arXiv2021

A Comprehensive and Cross-Platform Test Suite for Memory Safety -- Towards an Open Framework for Testing Processor Hardware Supported Security Extensions

Memory safety remains a critical and widely violated property in reality. Numerous defense techniques have been proposed and developed but most of them are not applied or enabled by default in production-ready environment due to their substantial running cost. The situation might change in the near future because the hardware supported defenses against these attacks are finally beginning to be adopted by commercial processors, operating systems and compilers. We then face a question as there is currently no suitable test suite to measure the memory safety extensions supported on different processors. In fact, the issue is not constrained only for memory safety but all aspect of processor security. All of the existing test suites related to processor security lack some of the key properties, such as comprehensiveness, distinguishability and portability. As an initial step, we propose an expandable test framework for measuring the processor security and open source a memory safety test suite utilizing this framework. The framework is deliberately designed to be flexible so it can be gradually extended to all types of hardware supported security extensions in processors. The initial test suite for memory safety currently contains 160 test cases covering spatial and temporal safety of memory, memory access control, pointer integrity and control-flow integrity. Each type of vulnerabilities and their related defenses have been individually evaluated by one or more test cases. The test suite has been ported to three different instruction set architectures (ISAs) and experimented on six different platforms. We have also utilized the test suite to explore the security benefits of applying different sets of compiler flags available on the latest GNU GCC and LLVM compilers.

cs.CR↗

arXiv2021

Dynamical scalarization in Einstein-Maxwell-dilaton theory

We study the process of fully nonlinear dynamical scalarization starting from a charged black hole or a naked singularity in asymptotically flat spacetime in the Einstein-Maxwell-dilaton theory. Initially the dilaton field is negligible compared to the gravitational and the Maxwell field. Then the dilaton field experiences an immediate growth, later it oscillates with damping amplitude and finally settles down to a finite value. For a hairy black hole develops from an original Reissner-Nordström black hole, since the dilaton oscillation and decay are almost independent of the coupling parameter, unlike the Anti-de Sitter spacetime it is not easy to distinguish the resulting hairy black hole from the original asymptotically flat charged hole. For a hairy black hole evolves from an original naked singularity, the resulting hairy black hole has rich structures. In the scalarization process, the naked singularity is soon enveloped by one outer horizon, then another horizon is developed and in the end a stable hairy black hole forms and two horizons degenerate into one to protect the singularity. The hairy black hole mass saturates exponentially in the scalarization.

gr-qc↗

arXiv2021

Deep Learning Based MAC via Joint Channel Access and Rate Adaptation

The existing medium access control (MAC) protocol of Wi-Fi networks (i.e., carrier-sense multiple access with collision avoidance (CSMA/CA)) suffers from poor performance in dense deployments due to the increasing number of collisions and long average backoff time in such scenarios. To tackle this issue, we propose an intelligent wireless MAC protocol based on deep learning (DL), referred to as DL-MAC, which significantly improves the spectrum efficiency of Wi-Fi networks. The goal of DL-MAC is to enable not only intelligent channel access but also intelligent rate adaptation. To achieve this goal, we design a deep neural network (DNN) that takes the historical received signal strength indications (RSSIs) as inputs and outputs joint channel access and rate adaptation decision. Notably, the proposed DL-MAC takes the constraints of practical applications into account and the DL-MAC is evaluated using the real wireless data sampled from the actual environments on the 2.4GHz frequency band. The experimental results show that our DL-MAC can achieve around 86\% performance of the global optimal MAC, and around the double performance of the traditional Wi-Fi MAC in the environments of our lab and the Shenzhen Baoan International Airport departure hall.

cs.IT↗

arXiv2021

Extremes of Gaussian random fields with non-additive dependence structure

We derive exact asymptotics of $$\mathbb{P}\left(\sup_{\mathbf{t}\in {\mathcal{A}}}X(\mathbf{t})>u\right),~ \text{as}~ u\to\infty,$$ for a centered Gaussian field $X(\mathbf{t}),~ \mathbf{t}\in \mathcal{A}\subset\mathbb{R}^n$, $n>1$ with continuous sample paths a.s., for which $\arg \max_{\mathbf{t}\in {\mathcal{A}}} Var(X(\mathbf{t}))$ is a Jordan set with finite and positive Lebesque measure of dimension $k\leq n$ and its dependence structure is not necessarily locally stationary. Our findings are applied to deriving the asymptotics of tail probabilities related to performance tables and chi processes where the covariance structure is not locally stationary.

math.PR↗

arXiv2021

Unsupervised Image-generation Enhanced Adaptation for Object Detection in Thermal images

Object detection in thermal images is an important computer vision task and has many applications such as unmanned vehicles, robotics, surveillance and night vision. Deep learning based detectors have achieved major progress, which usually need large amount of labelled training data. However, labelled data for object detection in thermal images is scarce and expensive to collect. How to take advantage of the large number labelled visible images and adapt them into thermal image domain, is expected to solve. This paper proposes an unsupervised image-generation enhanced adaptation method for object detection in thermal images. To reduce the gap between visible domain and thermal domain, the proposed method manages to generate simulated fake thermal images that are similar to the target images, and preserves the annotation information of the visible source domain. The image generation includes a CycleGAN based image-to-image translation and an intensity inversion transformation. Generated fake thermal images are used as renewed source domain. And then the off-the-shelf Domain Adaptive Faster RCNN is utilized to reduce the gap between generated intermediate domain and the thermal target domain. Experiments demonstrate the effectiveness and superiority of the proposed method.

cs.CV↗

arXiv2021

Dynamic Bottleneck for Robust Self-Supervised Exploration

Exploration methods based on pseudo-count of transitions or curiosity of dynamics have achieved promising results in solving reinforcement learning with sparse rewards. However, such methods are usually sensitive to environmental dynamics-irrelevant information, e.g., white-noise. To handle such dynamics-irrelevant information, we propose a Dynamic Bottleneck (DB) model, which attains a dynamics-relevant representation based on the information-bottleneck principle. Based on the DB model, we further propose DB-bonus, which encourages the agent to explore state-action pairs with high information gain. We establish theoretical connections between the proposed DB-bonus, the upper confidence bound (UCB) for linear case, and the visiting count for tabular case. We evaluate the proposed method on Atari suits with dynamics-irrelevant noises. Our experiments show that exploration with DB bonus outperforms several state-of-the-art exploration methods in noisy environments.

cs.LG↗

arXiv2021

Coherence analysis of beamline and simulation of coherent X-ray diffraction imaging based on a coherent modes model

The evolution from 3rd to 4th generation synchrotron radiation (SR) sources significantly enhanced their coherence, making coherent scattering techniques such as coherent X-ray diffraction imaging (CXDI) and X-ray photon correlation spectroscopy (XPCS) more accessible. We take advantage of a coherent modes decomposition and propagation model to carry out coherence analysis and simulations of CXDI experiments for the coherent Hard X-ray Coherent Scattering (HXCS) beamline at High Energy Photon Source.

physics.acc-ph↗

arXiv2021

CADA: Multi-scale Collaborative Adversarial Domain Adaptation for Unsupervised Optic Disc and Cup Segmentation

The diversity of retinal imaging devices poses a significant challenge: domain shift, which leads to performance degradation when applying the deep learning models trained on one domain to new testing domains. In this paper, we propose a multi-scale input along with multiple domain adaptors applied hierarchically in both feature and output spaces. The proposed training strategy and novel unsupervised domain adaptation framework, called Collaborative Adversarial Domain Adaptation (CADA), can effectively overcome the challenge. Multi-scale inputs can reduce the information loss due to the pooling layers used in the network for feature extraction, while our proposed CADA is an interactive paradigm that presents an exquisite collaborative adaptation through both adversarial learning and ensembling weights at different network layers. In particular, to produce a better prediction for the unlabeled target domain data, we simultaneously achieve domain invariance and model generalizability via adversarial learning at multi-scale outputs from different levels of network layers and maintaining an exponential moving average (EMA) of the historical weights during training. Without annotating any sample from the target domain, multiple adversarial losses in encoder and decoder layers guide the extraction of domain-invariant features to confuse the domain classifier. Meanwhile, the ensembling of weights via EMA reduces the uncertainty of adapting multiple discriminator learning. Comprehensive experimental results demonstrate that our CADA model incorporating multi-scale input training can overcome performance degradation and outperform state-of-the-art domain adaptation methods in segmenting retinal optic disc and cup from fundus images stemming from the REFUGE, Drishti-GS, and Rim-One-r3 datasets.

eess.IV↗

arXiv2021

Linear instability of charged massless scalar perturbation in regularized 4D charged Einstein-Gauss-Bonnet anti de-Sitter black holes

We study the linear instability of the charged massless scalar perturbation in regularized 4D charged Einstein-Gauss-Bonnet-AdS black holes by exploring the quasinormal modes. We find that the linear instability is triggered by superradiance. The charged massless scalar perturbation becomes more unstable when increasing the Gauss-Bonnet coupling constant or the black hole charge. Meanwhile, decreasing} the AdS radius will make the charged massless scalar perturbation} more stable. The stable region in parameter space $(α,Q,Λ)$ is given. Moreover, we find that the charged massless scalar perturbation is more unstable for larger scalar charge. The modes of multipoles are more stable than that of the monopole.

gr-qc↗

arXiv2021

Instability of regularized 4D charged Einstein-Gauss-Bonnet de-Sitter black holes

We studied the instability of the regularized 4D charged Einstein-Gauss-Bonnet de-Sitter black holes under charged scalar perturbations. The unstable modes satisfy the superradiant condition, but not all modes satisfying the superradiant condition are unstable. The instability occurs when the cosmological constant is small and the black hole charge is not too large. The Gauss-Bonnet coupling constant makes the unstable black hole more unstable when both the black hole charge and cosmological constant are small, and makes the stable black hole more stable when the black hole charge is large.

gr-qc↗

arXiv2021

Cyber-Physical Taint Analysis in Multi-stage Manufacturing Systems (MMS): A Case Study

Information flows are intrinsic properties of an multi-stage manufacturing systems (MMS). In computer security, a basic information flow tracking technique is dynamic taint analysis (DTA). DTA tracks taint propagation from one data variable (e.g., a buffer holding a HTTP request) to another. Taint propagation paths are typically determined by data flows and implicit flows in a computer program. And the union of all the taint propagation paths forms a taint graph. It is clear that taints graphs could significantly enhance intrusion diagnosis. However, the existing DTA techniques cannot be directly used in an MMS, and a main reason is as follows: Without manufacturing-specific taint propagation rules, DTA cannot be implemented. In this work, we conduct a case study which (a) extends the existing DTA method with manufacturing-specific taint propagation rules, and (b) applies the extended method to perform preliminary intrusion diagnosis with a small-scale test-bed.

cs.CR↗

arXiv2021

Finding Taint-Style Vulnerabilities in Linux-based Embedded Firmware with SSE-based Alias Analysis

Although the importance of using static analysis to detect taint-style vulnerabilities in Linux-based embedded firmware is widely recognized, existing approaches are plagued by three major limitations. (a) Approaches based on symbolic execution may miss alias information and therefore suffer from a high false-negative rate. (b) Approaches based on VSA (value set analysis) often provide an over-approximate pointer range. As a result, many false positives could be produced. (c) Existing work for detecting taint-style vulnerability does not consider indirect call resolution, whereas indirect calls are frequently used in Internet-facing embedded devices. As a result, many false negatives could be produced. In this work, we propose a precise demand-driven flow-, context- and field-sensitive alias analysis approach. Based on this new approach, we also design a novel indirect call resolution scheme. Combined with sanitization rule checking, our solution discovers taint-style vulnerabilities by static taint analysis. We implemented our idea with a prototype called EmTaint and evaluated it against 35 real-world embedded firmware samples from six popular vendors. EmTaint discovered at least 192 bugs, including 41 n-day bugs and 151 0-day bugs. At least 115 CVE/PSV numbers have been allocated from a subset of the reported vulnerabilities at the time of writing. Compared to state-of-the-art tools such as KARONTE and SaTC, EmTaint found significantly more bugs on the same dataset in less time.

cs.CR↗

arXiv2021

The current recorded signals of ultrahigh-energy $γ$-rays may come from EeVatrons in the galaxy

A hard $γ$-ray spectrum of supernova remnant G106.3+2.7 can be explained by using the hadronic model with the gluon condensation effect. This implies that not only PeVatrons but also EeVatrons generally exist in the universe including our galaxy, and they can accelerate protons to beyond "ankle" ($10^{19}~eV$). Although these proton beams are very weak in the galaxy and cannot be observed individually on the earth, the gluon condensation effect may greatly enhance the proton-proton cross section, which can compensate for the weak proton flux and produce the observed $γ$-rays. We also show that the gluon condensation effect in proton provides an efficient conversion mechanism for kinetic energy into $γ$-rays in the universe.

astro-ph.HE↗

arXiv2021

Trade-off between validity and efficiency of merging p-values under arbitrary dependence

Various methods of combining individual p-values into one p-value are widely used in many areas of statistical applications. We say that a combining method is valid for arbitrary dependence (VAD) if it does not require any assumption on the dependence structure of the p-values, whereas it is valid for some dependence (VSD) if it requires some specific, perhaps realistic but unjustifiable, dependence structures. The trade-off between validity and efficiency of these methods is studied via analyzing the choices of critical values under different dependence assumptions. We introduce the notions of independence-comonotonicity balance (IC-balance) and the price for validity. In particular, IC-balanced methods always produce an identical critical value for independent and perfectly positively dependent p-values, a specific type of insensitivity to a family of dependence assumptions. We show that, among two very general classes of merging methods commonly used in practice, the Cauchy combination method and the Simes method are the only IC-balanced ones. Simulation studies and a real data analysis are conducted to analyze the sizes and powers of various combining methods in the presence of weak and strong dependence.

math.ST↗

arXiv2021

Circuit design and integration feasibility of a high-resolution broadband on-chip spectral monitor

Up-to-date network telemetry is the key enabler for resource optimization by a variety of means including capacity scaling, fault recovery, network reconfiguration. Reliable optical performance monitoring in general and specifically the monitoring of the spectral profile of WDM signals in fixed- and flex-grid architecture across the entire C-band remains challenging. This article describes a spectrometer circuit architecture along with an original data processing algorithm that combined can measure the spectrum quantitatively across the entire C-band aiming at 1 GHz resolution bandwidth. The circuit is composed of a scanning ring resonator followed by a parallel arrangement of AWGs with interlaced channel spectra. The comb of ring resonances provides the high resolution and the algorithm creates a virtual tuneable AWG that isolates individual resonances of the comb within the flat pass-band of its synthesized channels. The parallel arrangement of AWGs may be replaced by a time multiplexed multi-input port AWG. The feasibility of a ring resonator functioning over whole C-band is experimentally validated. Full tuning of the comb of resonances over a free spectral range is achieved with a high-resolution bandwidth of 1.30 GHz. Due to its maturity and low loss, CMOS compatible silicon nitride is chosen for integration. Additionally, the whole system demonstration is presented using industry standard simulation tool. The architecture is robust to fabrication process variations owing to its data processing approach.

eess.SP↗

arXiv2021

A Deep Learning-Based FPGA Function Block Detection Method with Bitstream to Image Transformation

In the context of various application scenarios and/or for the sake of strengthening field-programmable gate array (FPGA) security, the system functions of an FPGA design need to be analyzed, which can be achieved by systematically partitioning the FPGA's bitstream into manageable functional blocks and detecting their functionalities thereafter. In this paper, we propose a novel deep learning-based FPGA function block detection method with three major steps. In specific, we first analyze the format of the bitstream to obtain the mapping relationship between the configuration bits and configurable logic blocks because of the discontinuity of the configuration bits in the bitstream for one element. In order to reap the maturity of object detection techniques based on deep learning, our next step is to convert an FPGA bitstream to an image, following the proposed transformation method that takes account of both the adjacency nature of the programmable logic and the high degree of redundancy of configuration information. Once the image is obtained, a deep learning-based object detection algorithm is applied to this transformed image, and the objects detected can be reflected back to determine the function blocks of the original FPGA design. The deep neural network used for function block detection is trained and validated with a specially crafted bitstream/image dataset. Experiments have confirmed high detection accuracy of the proposed function detection method, showing a 98.11% of mean Average Precision (IoU=0.5) for 10 function blocks within a YOLOv3 detector implemented on Xilinx Zynq-7000 SoCs and Zynq UltraScale+ MPSoCs.

cs.OH↗

arXiv2021

Bayesian spectral density approach for identification and uncertainty quantification of bridge section's flutter derivatives operated in turbulent flow

This study presents a Bayesian spectral density approach for identification and uncertainty quantification of flutter derivatives of bridge sections utilizing buffeting displacement responses, where the wind tunnel test is conducted in turbulent flow. Different from traditional time-domain approaches (e.g., least square method and stochastic subspace identification), the newly-proposed approach is operated in frequency domain. Based on the affine invariant ensemble sampler algorithm, Markov chain Monte-Carlo sampling is employed to accomplish the Bayesian inference. The probability density function of flutter derivatives is modeled based on complex Wishart distribution, where probability serves as the measure. By the Bayesian spectral density approach, the most probable values and corresponding posterior distributions (namely identification uncertainty here) of each flutter derivative can be obtained at the same time. Firstly, numerical simulations are conducted and the identified results are accurate. Secondly, thin plate model, flutter derivatives of which have theoretical solutions, is chosen to be tested in turbulent flow for the sake of verification. The identified results of thin plate model are consistent with the theoretical solutions. Thirdly, the center-slotted girder model, which is widely-utilized long-span bridge sections in current engineering practice, is employed to investigate the applicability of the proposed approach on a general bridge section. For the center-slotted girder model, the flutter derivatives are also extracted by least square method in uniform flow to cross validate the newly-proposed approach. The identified results by two different approaches are compatible.

stat.AP↗