arXiv subjects

Wenhao Wang

Publications and source records attributed to Wenhao Wang.

125 records · Page 7Linked to original sources

arXiv2021

Scenario Forecast of Cross-border Electric Interconnection towards Renewables in South America

Cross-border Electric Interconnection towards renewables is a promising solution for electric sector under the UN 2030 sustainable development goals which is widely promoted in emerging economies. This paper comprehensively investigates state of art in renewable resources and cross-border electric interconnection in South America. Based on the raw data collected from typical countries, a long-term scenario forecast methodology is applied to estimate key indicators of electric sector in target years, comparing the prospects of active promoting cross-border Interconnections Towards Renewables (ITR) scenario with Business as Usual (BAU) scenario in South America region. Key indicators including peak load, installed capacity, investment, and generation cost are forecasted and comparative analyzed by year 2035 and 2050. The comparative data analysis shows that by promoting cross-border interconnection towards renewables in South America, renewable resources can be highly utilized for energy supply, energy matrix can be optimized balanced, economics can be obviously driven and generation cost can be greatly reduced.

eess.SY↗

arXiv2020

Dehn Function of Finitely Presented Metabelian Groups

In this paper, we compute an upper bound for the Dehn function of a finitely presented metabelian group. In addition, we prove that the same upper bound works for the relative Dehn function of a finitely generated metabelian group. We also show that every wreath product of a free abelian group of finite rank with a finitely generated abelian group can be embedded into a metabelian group with exponential Dehn function.

math.GR↗

arXiv2020

Astrophysical Evidence of Wakefield Acceleration in Galactic and Extragalactic Jets via Gamma Rays and UHECRs

We present six case studies from a broad mass range ($1 - 10^9$ $M_\odot$) of astrophysical objects, each of which exhibit signs of jets and emit intense high energy gamma rays ($>10$ GeV). Many of these objects also emit spatially identifiable ultra high energy cosmic rays (UHECRs). In all cases it is found that wakefield acceleration (WFA) explains both the global properties and details. For blazars, we also explain the temporal structure of these signals, which includes neutrinos, and the correlations in their "bursts" and anti-correlation in flux and index. Blazars ($\sim 10^9$ $M_\odot$), radio galaxies ($\sim 10^8\, M_{\odot}$), Seyfert galaxies ($\sim 10^6 \,M_{\odot}$), starburst galaxies ($\sim 10^{3}\, M_{\odot}$), down to microquasars ($1 \sim 10$ $M_\odot$) interestingly exhibit the same physics since the nature of the accretion and acceleration is independent of the mass, aside from maximum values. It is possible to accelerate electrons to energies much greater than $10$ GeV, and protons beyond $10^{20}$ eV with WFA. We compare observational values with theoretical ones to illustrate they are in good agreement. This mechanism is also accompanied by related emissions, such as high-energy pin-pointed neutrinos, time varying radio, optical, and X-ray emissions, opening an opportunity to characterize these astrophysical objects via multi-messenger approaches.

astro-ph.HE↗

arXiv2020

A Privacy-Preserving-Oriented DNN Pruning and Mobile Acceleration Framework

Weight pruning of deep neural networks (DNNs) has been proposed to satisfy the limited storage and computing capability of mobile edge devices. However, previous pruning methods mainly focus on reducing the model size and/or improving performance without considering the privacy of user data. To mitigate this concern, we propose a privacy-preserving-oriented pruning and mobile acceleration framework that does not require the private training dataset. At the algorithm level of the proposed framework, a systematic weight pruning technique based on the alternating direction method of multipliers (ADMM) is designed to iteratively solve the pattern-based pruning problem for each layer with randomly generated synthetic data. In addition, corresponding optimizations at the compiler level are leveraged for inference accelerations on devices. With the proposed framework, users could avoid the time-consuming pruning process for non-experts and directly benefit from compressed models. Experimental results show that the proposed framework outperforms three state-of-art end-to-end DNN frameworks, i.e., TensorFlow-Lite, TVM, and MNN, with speedup up to 4.2X, 2.5X, and 2.0X, respectively, with almost no accuracy loss, while preserving data privacy.

cs.LG↗

arXiv2020

AIM 2020 Challenge on Efficient Super-Resolution: Methods and Results

This paper reviews the AIM 2020 challenge on efficient single image super-resolution with focus on the proposed solutions and results. The challenge task was to super-resolve an input image with a magnification factor x4 based on a set of prior examples of low and corresponding high resolution images. The goal is to devise a network that reduces one or several aspects such as runtime, parameter count, FLOPs, activations, and memory consumption while at least maintaining PSNR of MSRResNet. The track had 150 registered participants, and 25 teams submitted the final results. They gauge the state-of-the-art in efficient single image super-resolution.

eess.IV↗

arXiv2020

Randomized Last-Level Caches Are Still Vulnerable to Cache Side-Channel Attacks! But We Can Fix It

Cache randomization has recently been revived as a promising defense against conflict-based cache side-channel attacks. As two of the latest implementations, CEASER-S and ScatterCache both claim to thwart conflict-based cache side-channel attacks using randomized skewed caches. Unfortunately, our experiments show that an attacker can easily find a usable eviction set within the chosen remap period of CEASER-S and increasing the number of partitions without dynamic remapping, such as ScatterCache, cannot eliminate the threat. By quantitatively analyzing the access patterns left by various attacks in the LLC, we have newly discovered several problems with the hypotheses and implementations of randomized caches, which are also overlooked by the research on conflict-based cache side-channel attack. However, cache randomization is not a false hope and it is an effective defense that should be widely adopted in future processors. The newly discovered problems are corresponding to flaws associated with the existing implementation of cache randomization and are fixable. Several new defense techniques are proposed in this paper. our experiments show that all the newly discovered vulnerabilities of existing randomized caches are fixed within the current performance budget. We also argue that randomized set-associative caches can be sufficiently strengthened and possess a better chance to be actually adopted in commercial processors than their skewed counterparts as they introduce less overhaul to the existing cache structure.

cs.CR↗

arXiv2020

Confidential Attestation: Efficient in-Enclave Verification of Privacy Policy Compliance

A trusted execution environment (TEE) such as Intel Software Guard Extension (SGX) runs a remote attestation to prove to a data owner the integrity of the initial state of an enclave, including the program to operate on her data. For this purpose, the data-processing program is supposed to be open to the owner, so its functionality can be evaluated before trust can be established. However, increasingly there are application scenarios in which the program itself needs to be protected. So its compliance with privacy policies as expected by the data owner should be verified without exposing its code. To this end, this paper presents CAT, a new model for TEE-based confidential attestation. Our model is inspired by Proof-Carrying Code, where a code generator produces proof together with the code and a code consumer verifies the proof against the code on its compliance with security policies. Given that the conventional solutions do not work well under the resource-limited and TCB-frugal TEE, we propose a new design that allows an untrusted out-enclave generator to analyze the source code of a program when compiling it into binary and a trusted in-enclave consumer efficiently verifies the correctness of the instrumentation and the presence of other protection before running the binary. Our design strategically moves most of the workload to the code generator, which is responsible for producing well-formatted and easy-to-check code, while keeping the consumer simple. Also, the whole consumer can be made public and verified through a conventional attestation. We implemented this model on Intel SGX and demonstrate that it introduces a very small part of TCB. We also thoroughly evaluated its performance on micro- and macro- benchmarks and real-world applications, showing that the new design only incurs a small overhead when enforcing several categories of security policies.

cs.CR↗

arXiv2019

AIM 2019 Challenge on Constrained Super-Resolution: Methods and Results

This paper reviews the AIM 2019 challenge on constrained example-based single image super-resolution with focus on proposed solutions and results. The challenge had 3 tracks. Taking the three main aspects (i.e., number of parameters, inference/running time, fidelity (PSNR)) of MSRResNet as the baseline, Track 1 aims to reduce the amount of parameters while being constrained to maintain or improve the running time and the PSNR result, Tracks 2 and 3 aim to optimize running time and PSNR result with constrain of the other two aspects, respectively. Each track had an average of 64 registered participants, and 12 teams submitted the final results. They gauge the state-of-the-art in single image super-resolution.

eess.IV↗

arXiv2019

Broadband mid-infrared perfect absorber using fractal Gosper curve

Designing broadband metamaterial perfect absorbers is challenging due to the intrinsically narrow bandwidth of surface plasmon resonances. Here, the paper reports an ultra-broadband metamaterial absorber by using space filling Gosper curve. The optimized result shows an average absorptivity of 95.78% from 2.64 to 9.79 μm across the entire mid-infrared region. Meanwhile, the absorber shows insensitivity to the polarization angle and the incident angle of the incident light. The underlying physical principles, used in our broadband absorber, involve a fractal geometry with multiple scales and a dissipative plasmonic crystal. The broadband perfect absorption can be attributed to multiple electric resonances at different wavelengths supported by a few segments in the defined Gosper curve.

physics.optics↗

arXiv2019

Chimera dynamics in nonlocally coupled moving phase oscillators

Chimera states, a symmetry-breaking spatiotemporal pattern in nonlocally coupled dynamical units, prevail in a variety of systems. However, the interaction structures among oscillators are static in most of studies on chimera state. In this work, we consider a population of agents. Each agent carries a phase oscillator. We assume that agents perform Brownian motions on a ring and interact with each other with a kernel function dependent on the distance between them. When agents are motionless, the model allows for several dynamical states including two different chimera states (the type-I and the type-II chimeras). The movement of agents changes the relative positions among them and produces perpetual noise to impact on the model dynamics. We find that the response of the coupled phase oscillators to the movement of agents depends on both the phase lag $α$, determining the stabilities of chimera states, and the agent mobility $D$. For low mobility, the synchronous state transits to the type-I chimera state for $α$ close to $π/2$ and attracts other initial states otherwise. For intermediate mobility, the coupled oscillators randomly jump among different dynamical states and the jump dynamics depends on $α$. We investigate the statistical properties in these different dynamical regimes and present the scaling laws between the transient time and the mobility for low mobility and relations between the mean lifetimes of different dynamical states and the mobility for intermediate mobility.

nlin.AO↗

arXiv2019

Toward Scalable Fully Homomorphic Encryption Through Light Trusted Computing Assistance

It has been a long standing problem to securely outsource computation tasks to an untrusted party with integrity and confidentiality guarantees. While fully homomorphic encryption (FHE) is a promising technique that allows computations performed on the encrypted data, it suffers from a significant slow down to the computation. In this paper we propose a hybrid solution that uses the latest hardware Trusted Execution Environments (TEEs) to assist FHE by moving the bootstrapping step, which is one of the major obstacles in designing practical FHE schemes, to a secured SGX enclave. TEEFHE, the hybrid system we designed, makes it possible for homomorphic computations to be performed on smaller ciphertext and secret key, providing better performance and lower memory consumption. We make an effort to mitigate side channel leakages within SGX by making the memory access patterns totally independent from the secret information. The evaluation shows that TEEFHE effectively improves the software only FHE schemes in terms of both time and space.

cs.CR↗

arXiv2019

Enabling Privacy-Preserving, Compute- and Data-Intensive Computing using Heterogeneous Trusted Execution Environment

There is an urgent demand for privacy-preserving techniques capable of supporting compute and data intensive (CDI) computing in the era of big data. However, none of existing TEEs can truly support CDI computing tasks, as CDI requires high throughput accelerators like GPU and TPU but TEEs do not offer security protection of such accelerators. This paper present HETEE (Heterogeneous TEE), the first design of TEE capable of strongly protecting heterogeneous computing with unsecure accelerators. HETEE is uniquely constructed to work with today's servers, and does not require any changes for existing commercial CPUs or accelerators. The key idea of our design runs security controller as a stand-alone computing system to dynamically adjust the boundary of between secure and insecure worlds through the PCIe switches, rendering the control of an accelerator to the host OS when it is not needed for secure computing, and shifting it back when it is. The controller is the only trust unit in the system and it runs the custom OS and accelerator runtimes, together with the encryption, authentication and remote attestation components. The host server and other computing systems communicate with controller through an in memory task queue that accommodates the computing tasks offloaded to HETEE, in the form of encrypted and signed code and data. Also, HETEE offers a generic and efficient programming model to the host CPU. We have implemented the HETEE design on a hardware prototype system, and evaluated it with large-scale Neural Networks inference and training tasks. Our evaluations show that HETEE can easily support such secure computing tasks and only incurs a 12.34% throughput overhead for inference and 9.87% overhead for training on average.

cs.CR↗

arXiv2017

Leaky Cauldron on the Dark Land: Understanding Memory Side-Channel Hazards in SGX

Side-channel risks of Intel's SGX have recently attracted great attention. Under the spotlight is the newly discovered page-fault attack, in which an OS-level adversary induces page faults to observe the page-level access patterns of a protected process running in an SGX enclave. With almost all proposed defense focusing on this attack, little is known about whether such efforts indeed raise the bar for the adversary, whether a simple variation of the attack renders all protection ineffective, not to mention an in-depth understanding of other attack surfaces in the SGX system. In the paper, we report the first step toward systematic analyses of side-channel threats that SGX faces, focusing on the risks associated with its memory management. Our research identifies 8 potential attack vectors, ranging from TLB to DRAM modules. More importantly, we highlight the common misunderstandings about SGX memory side channels, demonstrating that high frequent AEXs can be avoided when recovering EdDSA secret key through a new page channel and fine-grained monitoring of enclave programs (at the level of 64B) can be done through combining both cache and cross-enclave DRAM channels. Our findings reveal the gap between the ongoing security research on SGX and its side-channel weaknesses, redefine the side-channel threat model for secure enclaves, and can provoke a discussion on when to use such a system and how to use it securely.

cs.CR↗

arXiv2016

Observation of Toroidal Alfven Eigenmodes during Minor Disruptions in Ohmic Plasmas

Toroidal Alfven eigenmodes (TAEs) excited in purely ohmically heated plasmas without any auxiliary heating have been identified for the first time in the SUNIST spherical tokamak. The TAE modes are observed during minor disruptions and have a frequency range of 150-500 kHz. The mode structure analysis indicates the existence of both m/n=-3/-1 and -4/-1 harmonics, propagating in the electron diamagnetic direction in the laboratory frame of reference. These TAEs appear simultaneously with the generation of runaway electrons in the current quench phase, accompanying with the density sweeping during the minor disruption. Possible driving mechanisms and potential applications of these TAEs are discussed.

physics.plasm-ph↗

arXiv2016

Wireless Physical-Layer Identification: Modeling and Validation

The wireless physical-layer identification (WPLI) techniques utilize the unique features of the physical waveforms of wireless signals to identify and classify authorized devices. As the inherent physical layer features are difficult to forge, WPLI is deemed as a promising technique for wireless security solutions. However, as of today it still remains unclear whether existing WPLI techniques can be applied under real-world requirements and constraints. In this paper, through both theoretical modeling and experiment validation, the reliability and differentiability of WPLI techniques are rigorously evaluated, especially under the constraints of state-of-art wireless devices, real operation environments, as well as wireless protocols and regulations. Specifically, a theoretical model is first established to systematically describe the complete procedure of WPLI. More importantly, the proposed model is then implemented to thoroughly characterize various WPLI techniques that utilize the spectrum features coming from the non-linear RF-front-end, under the influences from different transmitters, receivers, and wireless channels. Subsequently, the limitations of existing WPLI techniques are revealed and evaluated in details using both the developed theoretical model and in-lab experiments. The real-world requirements and constraints are characterized along each step in WPLI, including i) the signal processing at the transmitter (device to be identified), ii) the various physical layer features that originate from circuits, antenna, and environments, iii) the signal propagation in various wireless channels, iv) the signal reception and processing at the receiver (the identifier), and v) the fingerprint extraction and classification at the receiver.

cs.CR↗

arXiv2016

User Capacity of Wireless Physical-layer Identification: An Information-theoretic Perspective

Wireless Physical Layer Identification (WPLI) system aims at identifying or classifying authorized devices based on the unique Radio Frequency Fingerprints (RFFs) extracted from their radio frequency signals at the physical layer. Current works of WPLI focus on demonstrating system feasibility based on experimental error performance of WPLI with a fixed number of users. While an important question remains to be answered: what's the user number that WPLI can accommodate using different RFFs and receiving equipment. The user capacity of the WPLI can be a major concern for practical system designers and can also be a key metric to evaluate the classification performance of WPLI. In this work, we establish a theoretical understanding on user capacity of WPLI in an information-theoretic perspective. We apply information-theoretic modeling on RFF features of WPLI. An information-theoretic approach is consequently proposed based on mutual information between RFF and user identity to characterize the user capacity of WPLI. Based on this theoretical tool, the achievable user capacity of WPLI is characterized under practical constrains of off-the-shelf receiving devices. Field experiments on classification error performance are conducted for the validation of the information-theoretic user capacity characterization.

cs.CR↗

arXiv2015

Notes on Rainbow Distinguished Point Method

This paper clarifies the method described in our previous paper (DOI: 978-3-319-02726-5\_21), namely rainbow distinguished point method, and give revised theoretical and experimental results which shows rainbow distinguished point method behaves inferiorly to other time memory tradeoff methods.

cs.CR↗