Searcharxiv⌕ Search

arXiv subjects

Liang Chen

Publications and source records attributed to Liang Chen.

At least 433 records · Page 24Linked to original sources

A Simple Estimator for Quantile Panel Data Models Using Smoothed Quantile Regressions

Canay (2011)'s two-step estimator of quantile panel data models, due to its simple intuition and low computational cost, has been widely used in empirical studies in recent years. In this paper, we revisit the estimator of Canay (2011) and point out that in his asymptotic analysis the bias of his estimator due to the estimation of the fixed effects is mistakenly omitted, and that such omission will lead to invalid inference on the coefficients. To solve this problem, we propose a similar easy-to-implement estimator based on smoothed quantile regressions. The asymptotic distribution of the new estimator is established and the analytical expression of its asymptotic bias is derived. Based on these results, we show how to make asymptotically valid inference based on both analytical and split-panel jackknife bias corrections. Finally, finite sample simulations are used to support our theoretical analysis and to illustrate the importance of bias correction in quantile regressions for panel data.

econ.EM↗

The Intrinsic Properties of Brain Based on the Network Structure

Objective: Brain is a fantastic organ that helps creature adapting to the environment. Network is the most essential structure of brain, but the capability of a simple network is still not very clear. In this study, we try to expound some brain functions only by the network property. Methods: Every network can be equivalent to a simplified network, which is expressed by an equation set. The dynamic of the equation set can be described by some basic equations, which is based on the mathematical derivation. Results (1) In a closed network, the stability is based on the excitatory/inhibitory synapse proportion. Spike probabilities in the assembly can meet the solution of a nonlinear equation set. (2) Network activity can spontaneously evolve into a certain distribution under different stimulation, which is closely related to decision making. (3) Short memory can be formed by coupling of network assemblies. Conclusion: The essential property of a network may contribute to some important brain functions.

q-bio.NC↗

Selecting Reliable Blockchain Peers via Hybrid Blockchain Reliability Prediction

Blockchain and blockchain-based decentralized applications are attracting increasing attentions recently. In public blockchain systems, users usually connect to third-party peers or run a peer to join the P2P blockchain network. However, connecting to unreliable blockchain peers will make users waste resources and even lose millions of dollars of cryptocurrencies. In order to select the reliable blockchain peers, it is urgently needed to evaluate and predict the reliability of them. Faced with this problem, we propose H-BRP, Hybrid Blockchain Reliability Prediction model to extract the blockchain reliability factors then make personalized prediction for each user. Large-scale real-world experiments are conducted on 100 blockchain requesters and 200 blockchain peers. The implement and dataset of 2,000,000 test cases are released. The experimental results show that the proposed model obtains better accuracy than other approaches.

cs.SE↗

Property Studies of "Loner" Flares of Gamma-Ray Blazars

We search through $γ$-ray data obtained with the Large Area Telescope (LAT) onboard the Fermi Gamma-Ray Space Telescope and find 24 blazars (or candidates) that have a single clear flare event in their 9.5 year long-term light curves. We define these events as loner flares since each flare stands out significantly above the relatively stable, low-flux light curve. We analyze the LAT data in detail for these 24 sources. The flares in ten of them are primarily due to a single sharp peak, for which we study by fitting with two different analytic functions. The time durations thus determined for the sharp peaks are in a range of 4-25 days. The $γ$-ray spectra of the 24 blazar sources can be described with a power-law or a log-parabola function. We obtain their spectral properties in the flaring and quiescent states, and find that in the flares 16 of the sources have harder emission and three have softer emission while the other five keep the same emission. We discuss a possible correlation between the differences in photon index in the quiescent and flaring states and photon indices in quiescence. In addition, the sharp peak flares seem to have a tendency of having long time durations and hard emission, possibly related to their physical origin in a blazar jet. Studies of more similar flares will help establish these possible features.

astro-ph.HE↗

On the Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion

In this paper, we conduct a convergence rate analysis of the augmented Lagrangian method with a practical relative error criterion designed in Eckstein and Silva [Math. Program., 141, 319--348 (2013)] for convex nonlinear programming problems. We show that under a mild local error bound condition, this method admits locally a Q-linear rate of convergence. More importantly, we show that the modulus of the convergence rate is inversely proportional to the penalty parameter. That is, an asymptotically superlinear convergence is obtained if the penalty parameter used in the algorithm is increasing to infinity, or an arbitrarily Q-linear rate of convergence can be guaranteed if the penalty parameter is fixed but it is sufficiently large. Besides, as a byproduct, the convergence, as well as the convergence rate, of the distance from the primal sequence to the solution set of the problem is obtained.

math.OC↗

Steady-state Simulation of Semiconductor Devices using Discontinuous Galerkin Methods

Design of modern nanostructured semiconductor devices often calls for simulation tools capable of modeling arbitrarily-shaped multiscale geometries. In this work, to this end, a discontinuous Galerkin (DG) method-based framework is developed to simulate steady-state response of semiconductor devices. The proposed framework solves a system of Poisson equation (in electric potential) and drift-diffusion equations (in charge densities), which are nonlinearly coupled via the drift current and the charge distribution. This system is decoupled and linearized using the Gummel method and the resulting equations are discretized using a local DG scheme. The proposed framework is used to simulate geometrically intricate semiconductor devices with realistic models of mobility and recombination rate. Its accuracy is demonstrated by comparing the results to those obtained by the finite volume and finite element methods implemented in a commercial software package.

physics.comp-ph↗

Intelligent image synthesis to attack a segmentation CNN using adversarial learning

Deep learning approaches based on convolutional neural networks (CNNs) have been successful in solving a number of problems in medical imaging, including image segmentation. In recent years, it has been shown that CNNs are vulnerable to attacks in which the input image is perturbed by relatively small amounts of noise so that the CNN is no longer able to perform a segmentation of the perturbed image with sufficient accuracy. Therefore, exploring methods on how to attack CNN-based models as well as how to defend models against attacks have become a popular topic as this also provides insights into the performance and generalization abilities of CNNs. However, most of the existing work assumes unrealistic attack models, i.e. the resulting attacks were specified in advance. In this paper, we propose a novel approach for generating adversarial examples to attack CNN-based segmentation models for medical images. Our approach has three key features: 1) The generated adversarial examples exhibit anatomical variations (in form of deformations) as well as appearance perturbations; 2) The adversarial examples attack segmentation models so that the Dice scores decrease by a pre-specified amount; 3) The attack is not required to be specified beforehand. We have evaluated our approach on CNN-based approaches for the multi-organ segmentation problem in 2D CT images. We show that the proposed approach can be used to attack different CNN-based segmentation models.

eess.IV↗

Dynamic State Estimation of Generators Under Cyber Attacks

Accurate and reliable estimation of generator's dynamic state vectors in real time are critical to the monitoring and control of power systems. A robust Cubature Kalman Filter (RCKF) based approach is proposed for dynamic state estimation (DSE) of generators under cyber attacks in this paper. First, two types of cyber attacks, namely false data injection and denial of service attacks, are modelled and thereby introduced into DSE of a generator by mixing the attack vectors with the measurement data; Second, under cyber attacks with different degrees of sophistication, the RCKF algorithm and the Cubature Kalman Filter (CKF) algorithm are adopted to the DSE, and then the two algorithms are compared and discussed. The novelty of this study lies primarily in our attempt to introduce cyber attacks into DSE of generators. The simulation results on the IEEE 9-bus system and the New England 16-machine 68-bus system verify the effectiveness and superiority of the RCKF.

eess.SY↗

Dynamic State Estimation of Synchronous Machines Using Robust Cubature Kalman Filter Against Complex Measurement Noise Statistics

Cubature Kalman Filter (CKF) has good performance when handling nonlinear dynamic state estimations. However, it cannot work well in non-Gaussian noise and bad data environment due to the lack of auto-adaptive ability to measure noise statistics on line. In order to address the problem of behavioral decline and divergence when measure noise statistics deviate prior noise statistics, a new robust CKF (RCKF) algorithm is developed by combining the Huber's M-estimation theory with the classical CKF, and thereby it is proposed to coping with the dynamic state estimation of synchronous generators in this study. The simulation results on the IEEE-9 bus system and New England 16-machine-68-bus system demonstrate that the estimation accuracy and convergence of the proposed RCKF are superior to those of the classical CKF under complex measurement noise environments including different measurement noises and bad data, and that the RCKF is capable of effectively eliminating the impact of bad data on the estimation effects.

eess.SY↗

Unveiling delay-time-resolved phase noise dynamics of narrow-linewidth laser via coherent optical time domain reflectometry

Laser with high spectral purity plays a crucial role in high-precision optical metrology and coherent communication. Thanks to the rapid development of laser frequency stabilization, the laser phase noise can be remarkably compensated, allowing its ultra-narrow linewidth subject to mostly quantum limit. Nevertheless, the accurate characterization of phase noise dynamics and its intrinsic linewidth of a highly coherent laser remains ambiguous and challenging. Here, we present an approach capable of revealing delay-time-resolved phase noise dynamics of a coherent laser based on coherent optical time domain reflectometry (COTDR), in which distributed Rayleigh scattering along a delay fibre essentially allows a time-of-flight mapping of a heterodyne beating signal associated with delay-time-dependent phase information from a single laser source. Ultimately, this novel technique facilitates a precise measurement of ultra-narrow laser linewidth by exploiting its delay-time-resolved phase jitter statistics, confirmed with the analytical modelling and numerical simulations.

physics.ins-det↗

Visualizing Pairing Symmetry in Nematic Superconductors using spin-polarized spectroscopy of magnetic impurities

We study the spin-polarized spectral properties of Yu-Shiba-Rusinov resonance states induced by magnetic impurities in 2- and 3-dimensional nematic superconductors: few layer Bi$_2$Te$_3$ grown on FeTe$_{0.55}$Se$_{0.45}$ (2-dimensional) and Cu$_x$Bi$_2$Se$_3$ (3-dimensional). We focus on the relationship between pairing symmetry and the topograph of spin-polarized spectroscopy. We calculate the spin-polarized local density of states (SP LDOS) and the corresponding Fourier transformation using the $T$-matrix method for both the 2- and 3-dimensional materials. Various situations with different impurity orientations and different SP LDOSs have been investigated. We find that, like the quasiparticle interference spectrum, the SP LDOS can be applied to distinguish other pairings which preserve the threefold rotation symmetry of $D_3$ point group and nematic pairings in these materials.

cond-mat.str-el↗

Novel two-dimensional Ca-Cl crystals with metallicity, piezoelectric effect and room-temperature ferromagnetism

Recently we have reported the direct observation of two-dimensional (2D) Ca-Cl crystals on reduced graphene oxide (rGO) membranes, in which the calcium ions are only about monovalent (i.e. ~+1) and metallic rather than insulating properties are displayed by those CaCl crystals. Here, we report the experimental observation and demonstration of the formation of graphene-Ca-Cl heterojunction owing to the metallicity of 2D Ca-Cl crystals, unexpected piezoelectric effect, room-temperature ferromagnetism, as well as the distinct hydrogen storage and release capability of the Ca-Cl crystals in rGO membranes. Theoretical studies show that the formation of those abnormal crystals is attributed to the strong cation-pi interactions of the Ca2+ with the aromatic rings in the graphitic surfaces. Since strong cation-pi interactions also exist between other metal ions (such as Mg2+, Fe2+, Co2+, Cu2+, Cd2+, Cr2+ and Pb2+) and graphitic surfaces, similar 2D crystals with abnormal valence state of the metal cations and corresponding abnormal properties as well as novel applications are highly expected. Those findings further show the realistically potential applications of such abnormal CaCl material with unusual electronic properties in designing novel transistors and magnetic devices, hydrogen storage, catalyzer, high-performance conducting electrodes and sensors, with a size down to atomic scale.

physics.chem-ph↗

Computational distributed fiber-optic sensing

Ghost imaging allows image reconstruction by correlation measurements between a light beam that interacts with the object without spatial resolution and a spatially resolved light beam that never interacts with the object. The two light beams are copies of each other. Its computational version removes the requirement of a spatially resolved detector when the light intensity pattern is pre-known. Here, we exploit the temporal analogue of computational ghost imaging, and demonstrate a computational distributed fiber-optic sensing technique. Temporal images containing spatially distributed scattering information used for sensing purposes are retrieved through correlating the "integrated" backscattered light and the pre-known binary patterns. The sampling rate required for our technique is inversely proportional to the total time duration of a binary sequence, so that it can be significantly reduced compared to that of the traditional methods. Our experiments demonstrate a 3 orders of magnitude reduction in the sampling rate, offering great simplification and cost reduction in the distributed fiber-optic sensors.

eess.SP↗

A Unified Algorithmic Framework of Symmetric Gauss-Seidel Decomposition based Proximal ADMMs for Convex Composite Programming

This paper aims to present a fairly accessible generalization of several symmetric Gauss-Seidel decomposition based multi-block proximal alternating direction methods of multipliers (ADMMs) for convex composite optimization problems. The proposed method unifies and refines many constructive techniques that were separately developed for the computational efficiency of multi-block ADMM-type algorithms. Specifically, the majorized augmented Lagrangian functions, the indefinite proximal terms, the inexact symmetric Gauss-Seidel decomposition theorem, the tolerance criteria of approximately solving the subproblems, and the large dual step-lengths, are all incorporated in one algorithmic framework, which we named as sGS-imiPADMM. From the popularity of convergent variants of multi-block ADMMs in recent years, especially for high-dimensional multi-block convex composite conic programming problems, the unification presented in this paper, as well as the corresponding convergence results, may have the great potential of facilitating the implementation of many multi-block ADMMs in various problem settings.

math.OC↗

A New CGAN Technique for Constrained Topology Design Optimization

This paper presents a new conditional GAN (named convex relaxing CGAN or crCGAN) to replicate the conventional constrained topology optimization algorithms in an extremely effective and efficient process. The proposed crCGAN consists of a generator and a discriminator, both of which are deep convolutional neural networks (CNN) and the topology design constraint can be conditionally set to both the generator and discriminator. In order to improve the training efficiency and accuracy due to the dependency between the training images and the condition, a variety of crCGAN formulation are introduced to relax the non-convex design space. These new formulations were evaluated and validated via a series of comprehensive experiments. Moreover, a minibatch discrimination technique was introduced in the crCGAN training process to stabilize the convergence and avoid the mode collapse problems. Additional verifications were conducted using the state-of-the-art MNIST digits and CIFAR-10 images conditioned by class labels. The experimental evaluations clearly reveal that the new objective formulation with the minibatch discrimination training provides not only the accuracy but also the consistency of the designs.

cs.LG↗

Comments on "Quantum theory cannot consistently describe the use of itself"

Recently, a delicately designed Gedankenexperiment was proposed to check the self-consistence of quantum theory in the description of the agents who are using this theory. It was demonstrated that the quantum theory is inconsistent. Here a critical improvement is presented, which can lead to a consistent explanation of the Gedankenexperiment by using quantum theory.

quant-ph↗

Robust Cubature Kalman Filter for Dynamic State Estimation of Synchronous Machines under Unknown Measurement Noise Statistics

Kalman-type filtering techniques including cubature Kalman filter (CKF) does not work well in non-Gaussian environments, especially in the presence of outliers. To solve this problem, Huber's M-estimation based robust CKF (RCKF) is proposed for synchronous machines by combining the Huber's M-estimation theory with the classical CKF, which is capable of coping with the deterioration in performance and discretization of tracking curves when measurement noise statistics deviatefrom the prior noise statistics. The proposed RCKF algorithm has good adaptability to unknown measurement noise statistics characteristics including non-Gaussian measurement noise and outliers. The simulation results on the WSCC 3-machine 9-bus system and New England 16-machine 68-bus system verify the effectiveness of the proposed method and its advantage over the classical CKF.

eess.SY↗

On the Equivalence of Inexact Proximal ALM and ADMM for a Class of Convex Composite Programming

In this paper, we show that for a class of linearly constrained convex composite optimization problems, an (inexact) symmetric Gauss-Seidel based majorized multi-block proximal alternating direction method of multipliers (ADMM) is equivalent to an {\em inexact} proximal augmented Lagrangian method (ALM). This equivalence not only provides new perspectives for understanding some ADMM-type algorithms but also supplies meaningful guidelines on implementing them to achieve better computational efficiency. Even for the two-block case, a by-product of this equivalence is the convergence of the whole sequence generated by the classic ADMM with a step-length that exceeds the conventional upper bound of $(1+\sqrt{5})/2$, if one part of the objective is linear. This is exactly the problem setting in which the very first convergence analysis of ADMM was conducted by Gabay and Mercier in 1976, but, even under notably stronger assumptions, only the convergence of the primal sequence was known. A collection of illustrative examples are provided to demonstrate the breadth of applications for which our results can be used. Numerical experiments on solving a large number of linear and convex quadratic semidefinite programming problems are conducted to illustrate how the theoretical results established here can lead to improvements on the corresponding practical implementations.

math.OC↗