Searcharxiv⌕ Search

arXiv subjects

Lu Zhang

Publications and source records attributed to Lu Zhang.

At least 415 records · Page 23Linked to original sources
arXiv2019

Pangolin: A Fault-Tolerant Persistent Memory Programming Library

Non-volatile main memory (NVMM) allows programmers to build complex, persistent, pointer-based data structures that can offer substantial performance gains over conventional approaches to managing persistent state. This programming model removes the file system from the critical path which improves performance, but it also places these data structures out of reach of file system-based fault tolerance mechanisms (e.g., block-based checksums or erasure coding). Without fault-tolerance, using NVMM to hold critical data will be much less attractive. This paper presents Pangolin, a fault-tolerant persistent object library designed for NVMM. Pangolin uses a combination of checksums, parity, and micro-buffering to protect an application's objects from both media errors and corruption due to software bugs. It provides these protections for objects of any size and supports automatic, online detection of data corruption and recovery. The required storage overhead is small (1% for gigabyte-sized pools of NVMM). Pangolin provides stronger protection, requires orders of magnitude less storage overhead, and achieves comparable performance relative to the current state-of-the-art fault-tolerant persistent object library.

cs.DC↗
arXiv2019

Ergodic Mutual Information for Generalized Fadings

In this paper, novel expressions are derived to evaluate the ergodic mutual information (EMI) under BPSK modulation of single-input single-output (SISO) systems operating in generalized fading channels, including $η$-$μ$ fading and $κ$-$μ$ fading. To verify our derivation, we first investigate the specific fading types, namely Rayleigh, Nakagami-$m$ and Rician, and then turn to generalized fading scenarios. It is shown that all the expressions concluded from the generalized cases can be specialized into those derived from the specific ones. Different from the conventional results of the EMI, our developed expressions contain only the simplest numerical calculations, without any Meijer's G-functions which must be implemented in the particular computing software. Additionally, it should be noted that our work provides a complete analysis of the EMI in wireless channel under discrete inputs.

eess.SP↗
arXiv2019

Performance of Multiple Antennas Selection in SIMO Systems with BPSK/QPSK Modulations

This paper studies the performance of single-input multiple-output (SIMO) systems under receive antenna selection (RAS) and BPSK/QPSK modulations. At the receiver, a subset of branches are selected and combined using maximal-ratio combining (MRC) to maximize the instantaneous Signal to Noise Ratio (SNR). By assuming independent and identical distributed (i.i.d.) Rayleigh flat fading, a closed-form expression, with considerably high precision, is developed to approximate the average input-output mutual information, also termed as symmetric capacity, of the whole system. Later, this approximated expression is further utilized to investigate the efficient capacity and energy efficiency of the SIMO system under BPSK/QPSK modulations and RAS. Besides analytical derivations, simulations are provided to demonstrate the approximation precision, feasibility and validity of the derived results.

eess.SP↗
arXiv2019

Ergodic Secrecy Rate of Antenna-Selection-Aided MIMOME Channels with BPSK/QPSK Modulations

This paper analyzes transmit antenna selection (TAS) under Rayleigh flat fading for BPSK/QPSK modulations in multiple-input multiple-output wiretap channels, also termed as multiple-input multiple-output multiple-eavesdropper (MIMOME) channels. In our protocol, a single antenna is selected to transmit the secret message and selection combing (SC) or maximal-ratio combing (MRC) is utilized at the legitimate receiver or the eavesdropper. Novel closed-form expressions for the ergodic secrecy rates are derived to approximate the exact values, which hold high precision and compact forms. Besides theoretical derivations, simulations are provided to demonstrate the feasibility and validity of the proposed formulas.

eess.SP↗
arXiv2019

Evolution of Incommensurate Superstructure and Electronic Structure with Pb Substitution in (Bi$_{2-x}$Pb$_{x}$)Sr$_2$CaCu$_2$O$_{8+δ}$ Superconductors

High-quality Bi$_{2-x}$Pb$_{x}$Sr$_2$CaCu$_2$O$_{8+δ}$ (Bi2212) single crystals have been successfully grown by the traveling solvent floating zone technique with a wide range of Pb substitution ($x=0-0.8$). The samples are characterized by transmission electron microscope (TEM) and measured by high resolution laser-based angle-resolved photoemission spectroscopy (ARPES) with different photon energies. A systematic evolution of the electronic structure and superstructure with Pb substitution has been revealed for the first time. The superstructure shows a significant change with Pb substitution and the incommensurate modulation vector ($\textbf{Q}$) decreases with increasing Pb substitution. In the meantime, the superstructure intensity from ARPES measurements also decreases dramatically with increasing Pb concentration. The superstructure in Bi2212 can be effectively suppressed by Pb substitution and it nearly disappears with a Pb substitution of $x=0.8$. We also find that the superstructure bands in ARPES measurements depend sensitively on the photon energy of lasers used; they can become even stronger than the main band when using a laser photon energy of 10.897 eV. These results provide important information on the origin of the incommensurate superstructure and its control and suppression in bismuth-based high temperature superconductors.

cond-mat.supr-con↗
arXiv2019

Safe Trajectory Generation for Complex Urban Environments Using Spatio-temporal Semantic Corridor

Planning safe trajectories for autonomous vehicles in complex urban environments is challenging since there are numerous semantic elements (such as dynamic agents, traffic lights and speed limits) to consider. These semantic elements may have different mathematical descriptions such as obstacle, constraint and cost. It is non-trivial to tune the effects from different combinations of semantic elements for a stable and generalizable behavior. In this paper, we propose a novel unified spatio-temporal semantic corridor (SSC) structure, which provides a level of abstraction for different types of semantic elements. The SSC consists of a series of mutually connected collision-free cubes with dynamical constraints posed by the semantic elements in the spatio-temporal domain. The trajectory generation problem then boils down to a general quadratic programming (QP) formulation. Thanks to the unified SSC representation, our framework can generalize to any combination of semantic elements. Moreover, our formulation provides a theoretical guarantee that the entire trajectory is safe and constraint-satisfied, by using the convex hull and hodograph properties of piecewise Bezier curve parameterization. We also release the code of our method to accommodate benchmarking.

cs.RO↗
arXiv2019

Ergodic H-S/MRC Mutual Information

This paper studies the ergodic mutual information of hybrid selection/maximal-ratio combining (H-S/MRC) diversity system under BPSK/QPSK modulations. We consider a simple single-input multiple-output (SIMO) channel, where a subset of branches are selected and combined using maximal-ratio combining (MRC) to maximize the instantaneous Signal to Noise Ratio (SNR) at the receiver. For independent and identically distributed (i.i.d.) Rayleigh flat fading, a general recursive expression is developed to estimate the ergodic input-output mutual information of the whole system. Besides analytical derivations, simulations are provided to demonstrate the feasibility and validity of the derived results.

eess.SP↗
arXiv2019

Practical Bayesian Modeling and Inference for Massive Spatial Datasets On Modest Computing Environments

With continued advances in Geographic Information Systems and related computational technologies, statisticians are often required to analyze very large spatial datasets. This has generated substantial interest over the last decade, already too vast to be summarized here, in scalable methodologies for analyzing large spatial datasets. Scalable spatial process models have been found especially attractive due to their richness and flexibility and, particularly so in the Bayesian paradigm, due to their presence in hierarchical model settings. However, the vast majority of research articles present in this domain have been geared toward innovative theory or more complex model development. Very limited attention has been accorded to approaches for easily implementable scalable hierarchical models for the practicing scientist or spatial analyst. This article is submitted to the Practice section of the journal with the aim of developing massively scalable Bayesian approaches that can rapidly deliver Bayesian inference on spatial process that are practically indistinguishable from inference obtained using more expensive alternatives. A key emphasis is on implementation within very standard (modest) computing environments (e.g., a standard desktop or laptop) using easily available statistical software packages without requiring message-parsing interfaces or parallel programming paradigms. Key insights are offered regarding assumptions and approximations concerning practical efficiency.

stat.ME↗
arXiv2019

Experimental Gaussian Boson Sampling

Gaussian Boson sampling (GBS) provides a highly efficient approach to make use of squeezed states from parametric down-conversion to solve a classically hard-to-solve sampling problem. The GBS protocol not only significantly enhances the photon generation probability, compared to standard boson sampling with single photon Fock states, but also links to potential applications such as dense subgraph problems and molecular vibronic spectra. Here, we report the first experimental demonstration of GBS using squeezed-state sources with simultaneously high photon indistinguishability and collection efficiency. We implement and validate 3-, 4- and 5-photon GBS with high sampling rates of 832 kHz, 163 kHz and 23 kHz, respectively, which is more than 4.4, 12.0, and 29.5 times faster than the previous experiments. Further, we observe a quantum speed-up on a NP-hard optimization problem when comparing with simulated thermal sampler and uniform sampler.

quant-ph↗
arXiv2019

Secrecy Performance of Antenna-Selection-Aided MIMOME Channels with BPSK/QPSK Modulations

This paper studies the secrecy performance of multiple-input multiple-output (MIMO) wiretap channels, also termed as multiple-input multiple-output multiple-eavesdropper (MIMOME) channels, under transmit antenna selection (TAS) and BPSK/QPSK modulations. In the main channel between the transmitter and the legitimate receiver, a single transmit antenna is selected to maximizes the instantaneous Signal to Noise Ratio (SNR) at the receiver. At the receiver and the eavesdropper, selection combination (SC) is utilized. By assuming Rayleigh flat fading, we first derive the closed-form approximated expression for the ergodic secrecy rate when the channel state information of the eavesdropper (CSIE) is available at the transmitter. Next, analytical formulas for the approximated and asymptotic secrecy outage probability (SOP) are also developed when CSIE is unavailable. Besides theoretical derivations, simulation results are provided to demonstrate the approximation precision of the derived results. Furthermore, the asymptotic results reveal that the secrecy diversity order degrades into 0 due to the finitealphabet inputs, which is totally different from that driven by the Gaussian inputs.

eess.SP↗
arXiv2019

Phase transitions and bump solutions of the Keller-Segel model with volume exclusion

We show that the Keller-Segel model in one dimension with Neumann boundary conditions and quadratic cellular diffusion has an intricate phase transition diagram depending on the chemosensitivity strength. Explicit computations allow us to find a myriad of symmetric and asymmetric stationary states whose stability properties are mostly studied via free energy decreasing numerical schemes. The metastability behavior and staircased free energy decay are also illustrated via these numerical simulations.

math.AP↗
arXiv2019

A new approach to a network of congruences on an inverse semigroup

This paper enriches the list of known properties of congruence sequences starting from the universal relation and successively performing the operators lower $k$ and lower $t$. Two series of inverse semigroups, namely $\ker{α_n}$-is-Clifford semigroups and $β_n$-is-over-$E$-unitary semigroups, are investigated. Two congruences, namely $α_{n+2}$ and $β_{n+2}$, are found to be the least $\ker{α_n}$-is-Clifford and least $β_n$-is-over-$E$-unitary congruences on $S$, respectively. A new system of implications is established for the quasivarieties of inverse semigroups induced by the min network.

math.GR↗
arXiv2019

An energy-based discontinuous Galerkin method for the wave equation with advection

An energy-based discontinuous Galerkin method for the advective wave equation is proposed and analyzed. Energy-conserving or energy-dissipating methods follow from simple, mesh-independent choices of the inter-element fluxes, and both subsonic and supersonic advection is allowed. Error estimates in the energy norm are established, and numerical experiments on structured grids display optimal convergence in the $L^2$ norm for upwind fluxes. The method generalizes earlier work on energy-based discontinuous Galerkin methods for second order wave equations which was restricted to energy forms written as a simple sum of kinetic and potential energy.

math.NA↗
arXiv2019

An Empirical Study of Fault Localization Families and Their Combinations

The performance of fault localization techniques is critical to their adoption in practice. This paper reports on an empirical study of a wide range of fault localization techniques on real-world faults. Different from previous studies, this paper (1) considers a wide range of techniques from different families, (2) combines different techniques, and (3) considers the execution time of different techniques. Our results reveal that a combined technique significantly outperforms any individual technique (200% increase in faults localized in Top 1), suggesting that combination may be a desirable way to apply fault localization techniques and that future techniques should also be evaluated in the combined setting. Our implementation is publicly available for evaluating and combining fault localization techniques.

cs.SE↗
arXiv2018

A new asymptotical flat and spherically symmetric solution in the generalized Einstein-Cartan-Kibble-Sciama gravity and gravitational lensing

We firstly present a new asymptotical flat and spherically symmetric solution in the generalized Einstein-Cartan-Kibble-Sciama (ECKS) theory of gravity and then investigate the propagation of photon in this background. This solution possesses three independent parameters which affect sharply photon sphere, deflection angle of light ray and gravitational lensing. Since the condition of existence of horizons is not inconsistent with that of photon sphere, there exists a special case where there is horizon but no photon sphere in this spacetime. Especially, we find that in this special case, the deflection angle of a light ray near the event horizon tends to a finite value rather than diverges, which is not explored in other spacetimes. We also study the strong gravitational lensing in this spacetime with the photon sphere and then probe how the spacetime parameters affect the coefficients in the strong field limit.

gr-qc↗
arXiv2018

A Grammar-Based Structural CNN Decoder for Code Generation

Code generation maps a program description to executable source code in a programming language. Existing approaches mainly rely on a recurrent neural network (RNN) as the decoder. However, we find that a program contains significantly more tokens than a natural language sentence, and thus it may be inappropriate for RNN to capture such a long sequence. In this paper, we propose a grammar-based structural convolutional neural network (CNN) for code generation. Our model generates a program by predicting the grammar rules of the programming language; we design several CNN modules, including the tree-based convolution and pre-order convolution, whose information is further aggregated by dedicated attentive pooling layers. Experimental results on the HearthStone benchmark dataset show that our CNN code generator significantly outperforms the previous state-of-the-art method by 5 percentage points; additional experiments on several semantic parsing tasks demonstrate the robustness of our model. We also conduct in-depth ablation test to better understand each component of our model.

cs.LG↗
arXiv2018

High-speed PAM4-based Optical SDM Interconnects with Directly Modulated Long-wavelength VCSEL

This paper reports the demonstration of high-speed PAM-4 transmission using a 1.5-μm single-mode vertical cavity surface emitting laser (SM-VCSEL) over multicore fiber with 7 cores over different distances. We have successfully generated up to 70 Gbaud 4-level pulse amplitude modulation (PAM-4) signals with a VCSEL in optical back-to-back, and transmitted 50 Gbaud PAM-4 signals over both 1-km dispersion-uncompensated and 10-km dispersion-compensated in each core, enabling a total data throughput of 700 Gbps over the 7-core fiber. Moreover, 56 Gbaud PAM-4 over 1-km has also been shown, whereby unfortunately not all cores provide the required 3.8 $\times$ 10 $^{-3}$ bit error rate (BER) for the 7% overhead-hard decision forward error correction (7% OH HDFEC). The limited bandwidth of the VCSEL and the adverse chromatic dispersion of the fiber are suppressed with pre-equalization based on accurate end-to-end channel characterizations. With a digital post-equalization, BER performance below the 7% OH-HDFEC limit is achieved over all cores. The demonstrated results show a great potential to realize high-capacity and compact short-reach optical interconnects for data centers.

eess.SP↗