Catalog footprint

What is connected

89works
46topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

89 published item(s)

preprint2026arXiv

ForcingDAS: Unified and Robust Data Assimilation via Diffusion Forcing

Data assimilation (DA) estimates the state of an evolving dynamical system from noisy, partial observations, and is widely used in scientific simulation as well as weather and climate science. In practice, filtering methods rely on frame-to-frame transition models. However, these models are fragile when observations are non-Markovian (when they form only a partial slice of a higher-dimensional latent state as in real-world weather data): they tend to accumulate errors over long horizons. At the same time, learned DA methods typically commit to a single regime, either filtering (nowcasting, real-time forecasting) or smoothing (retrospective reanalysis), which splits what should be a shared prior across application-specific pipelines. To address both issues, we introduce ForcingDAS, a unified and robust DA framework. Built on Diffusion Forcing with an independent noise level assigned to each frame, ForcingDAS learns a joint-trajectory prior instead of frame-to-frame transitions. This allows it to capture long-horizon temporal dependencies and reduce error accumulation. In addition, the same trained model spans the full filtering to smoothing spectrum at inference time. Specifically, nowcasting, fixed-lag smoothing, and batch reanalysis are selected through the inference schedule alone, without retraining. We evaluate ForcingDAS on 2D Navier-Stokes vorticity, precipitation nowcasting, and global atmospheric state estimation. Across all settings, a single model is competitive with or outperforms both learned and classical baselines that are specialized for individual regimes, with the largest gains observed on real-world weather benchmarks.

preprint2026arXiv

HyNeuralMap: Hyperbolic Mapping of Visual Semantics to Neural Hierarchies

Understanding the intricate mappings between visual stimuli and neural responses is a fundamental challenge in cognitive neuroscience. While current approaches predominantly align images and functional magnetic resonance imaging (fMRI) responses in Euclidean space, this geometry often struggles to preserve fine-grained semantic relationships and latent hierarchical structures across visual and neural modalities. To overcome this, we propose HyNeuralMap, a framework that employ hyperbolic Lorentz model to map visual semantics into a shared, cross-subject neural hierarchy. By leveraging the negative curvature of hyperbolic space as an inductive bias, the proposed framework better captures hierarchical semantic organization and cross-subject neural similarities. Specifically, visual and neural embeddings are jointly optimized through hyperbolic geometric alignment, where geodesic distances preserve semantic proximity and hierarchical relationships more effectively than Euclidean embeddings. Experiments demonstrate that HyNeuralMap consistently outperforms state-of-the-art Euclidean baselines in both multi-label semantic prediction and cross-modal retrieval tasks. This confirms hyperbolic geometry's superiority for cross-modal semantic alignment and hierarchical modeling, providing a new avenue for vision-neural representation learning.

preprint2023arXiv

Incommensurate many-body localization in the presence of long-range hopping and single-particle mobility edge

We study many-body localization (MBL) in the quasiperiodic $t_1$-$t_2$ model, focusing on the role of next-nearest-neighbor (NNN) hopping $t_2$, which introduces a single-particle mobility edge. The calculated phase diagram can be divided into three distinct regimes, depending on the strength of the short-range interaction $U$. For weak interactions ($U\ll t_1$), this model is always nonthermal. For intermediate interactions ($U\sim t_1$), the thermal-MBL phase transition in this model is qualitatively the same as that of the Aubry-Andre (AA) model, which is consistent with existing experimental observations. For strong interactions $(U\gg t_1)$, the NNN hopping produces qualitatively new physics because it breaks down the Hilbert space fragmentation present in the AA model. The NNN hopping is thus irrelevant when the interaction is intermediate but relevant for strong interactions.

preprint2023arXiv

Spatially Varying Nanophotonic Neural Networks

The explosive growth of computation and energy cost of artificial intelligence has spurred strong interests in new computing modalities as potential alternatives to conventional electronic processors. Photonic processors that execute operations using photons instead of electrons, have promised to enable optical neural networks with ultra-low latency and power consumption. However, existing optical neural networks, limited by the underlying network designs, have achieved image recognition accuracy far below that of state-of-the-art electronic neural networks. In this work, we close this gap by embedding massively parallelized optical computation into flat camera optics that perform neural network computation during the capture, before recording an image on the sensor. Specifically, we harness large kernels and propose a large-kernel spatially-varying convolutional neural network learned via low-dimensional reparameterization techniques. We experimentally instantiate the network with a flat meta-optical system that encompasses an array of nanophotonic structures designed to induce angle-dependent responses. Combined with an extremely lightweight electronic backend with approximately 2K parameters we demonstrate a reconfigurable nanophotonic neural network reaches 72.76\% blind test classification accuracy on CIFAR-10 dataset, and, as such, the first time, an optical neural network outperforms the first modern digital neural network -- AlexNet (72.64\%) with 57M parameters, bringing optical neural network into modern deep learning era.

preprint2022arXiv

AdaLoGN: Adaptive Logic Graph Network for Reasoning-Based Machine Reading Comprehension

Recent machine reading comprehension datasets such as ReClor and LogiQA require performing logical reasoning over text. Conventional neural models are insufficient for logical reasoning, while symbolic reasoners cannot directly apply to text. To meet the challenge, we present a neural-symbolic approach which, to predict an answer, passes messages over a graph representing logical relations between text units. It incorporates an adaptive logic graph network (AdaLoGN) which adaptively infers logical relations to extend the graph and, essentially, realizes mutual and iterative reinforcement between neural and symbolic reasoning. We also implement a novel subgraph-to-node message passing mechanism to enhance context-option interaction for answering multiple-choice questions. Our approach shows promising results on ReClor and LogiQA.

preprint2022arXiv

Blockchain Driven Privacy Preserving Contact Tracing Framework in Pandemics

Contact tracing has been proven an effective approach to control the virus spread in pandemics like COVID-19 pandemic. As an emerging powerful decentralized technique, blockchain has been explored to ensure data privacy and security in contact tracing processes. However, existing works are mostly high-level designs with no sufficient demonstration and treat blockchain as separate storage system assisting third-party central servers, ignoring the importance and capability of consensus mechanism and incentive mechanism. In this paper, we propose a light-weight and fully third-party free Blockchain-Driven Contact Tracing framework (BDCT) to bridge the gap. In the BDCT framework, RSA encryption based transaction verification method (RSA-TVM) is proposed to ensure contact tracing correctness, which can achieve more than 96\% contact cases recording accuracy even each person has 60\% probability of failing to verify the contact information. Reputation Corrected Delegated Proof of Stake (RC-DPoS) consensus mechanism is proposed together with the incentive mechanism, which can ensure timeliness of reporting contact cases and keep blockchain decentralized. A novel contact tracing simulation environment is created, which considers three different contact scenarios based on population density. The simulation results demonstrate the effectiveness, robustness and attack resistance of RSA-TVM and RC-DPoS in the proposed BDCT.

preprint2022arXiv

Chemically induced graphene to diamond transition: a DFT study

The conversion of graphene into diamond is a new way for preparing ultrathin diamond film without pressure. Herein, we investigated the transformation mechanism of surface-hydrogenated bilayer graphene (SHBG) into surface-hydrogenated single-layer diamond (SHSLD) crystal, inserting fifteen kinds of single metal atoms without any pressure, by using the systematical first-principles calculations. Compared with the configuration without metal atom, SHBG can be transformed into SHSLD spontaneously in thermodynamics under the action of single metal atom, and its formation energy can even decrease from 0.82 eV to -5.79 eV under the action of Hf atom. According to our results, the outer electron orbits and atomic radius of metal atom are two important factors that affect the conversion. For the phase transition to occur, the metal atom needs to have enough empty d orbitals, and the radius of the metal atom is in the range of 0.136-0.159 nm. Through further analysis, we find that the p orbitals of carbon atoms and d orbital of metal atom in SHBG will be strongly hybridized, thereby promoting the conversion. The results supply important significance to experimentally prepare diamond without pressure through hydrogenated graphene.

preprint2022arXiv

Chiral Phonon Activated Spin Seebeck Effect

Efficient generation of spin polarization is the central focus of spintronics. In magnetic materials, spin currents can arise from heat currents by the conventional spin Seebeck effect. Recently, chiral phonons with definite handedness and angular momenta have also produced profound impacts on multiple research fields. In this paper, starting with nonequilibrium distribution of chiral phonons under temperature gradient, we find a new spin selectivity effect - chiral phonon activated spin Seebeck (CPASS) effect, in chiral materials without magnetic order nor spin-orbit coupling. With both phonon-drag and band transport contributions, the CPASS coefficients are computed based on the Boltzmann transport theory. The spin accumulations by the CPASS effect quadratically increase with temperature gradient, and vary with the chemical potential modulation, thus enabling highly efficient and tunable spin generation. The CPASS effect provides a promising explanation on the chiral-induced spin selectivity effect and opportunities for designing advanced spintronic devices based on nonmagnetic chiral materials.

preprint2022arXiv

Convolutional Normalization: Improving Deep Convolutional Network Robustness and Training

Normalization techniques have become a basic component in modern convolutional neural networks (ConvNets). In particular, many recent works demonstrate that promoting the orthogonality of the weights helps train deep models and improve robustness. For ConvNets, most existing methods are based on penalizing or normalizing weight matrices derived from concatenating or flattening the convolutional kernels. These methods often destroy or ignore the benign convolutional structure of the kernels; therefore, they are often expensive or impractical for deep ConvNets. In contrast, we introduce a simple and efficient "Convolutional Normalization" (ConvNorm) method that can fully exploit the convolutional structure in the Fourier domain and serve as a simple plug-and-play module to be conveniently incorporated into any ConvNets. Our method is inspired by recent work on preconditioning methods for convolutional sparse coding and can effectively promote each layer's channel-wise isometry. Furthermore, we show that our ConvNorm can reduce the layerwise spectral norm of the weight matrices and hence improve the Lipschitzness of the network, leading to easier training and improved robustness for deep ConvNets. Applied to classification under noise corruptions and generative adversarial network (GAN), we show that the ConvNorm improves the robustness of common ConvNets such as ResNet and the performance of GAN. We verify our findings via numerical experiments on CIFAR and ImageNet.

preprint2022arXiv

Double stabilizations and convergence analysis of a second-order linear numerical scheme for the nonlocal Cahn-Hilliard equation

In this paper, we study a second-order accurate and linear numerical scheme for the nonlocal Cahn-Hilliard equation. The scheme is established by combining a modified Crank-Nicolson approximation and the Adams-Bashforth extrapolation for the temporal discretization, and by applying the Fourier spectral collocation to the spatial discretization. In addition, two stabilization terms in different forms are added for the sake of the numerical stability. We conduct a complete convergence analysis by using the higher-order consistency estimate for the numerical scheme, combined with the rough error estimate and the refined estimate. By regarding the numerical solution as a small perturbation of the exact solution, we are able to justify the discrete $\ell^\infty$ bound of the numerical solution, as a result of the rough error estimate. Subsequently, the refined error estimate is derived to obtain the optimal rate of convergence, following the established $\ell^\infty$ bound of the numerical solution. Moreover, the energy stability is also rigorously proved with respect to a modified energy. The proposed scheme can be viewed as the generalization of the second-order scheme presented in an earlier work, and the energy stability estimate has greatly improved the corresponding result therein.

preprint2022arXiv

Fermionic many-body localization for random and quasiperiodic systems in the presence of short- and long-range interactions

We study many-body localization (MBL) for interacting one-dimensional lattice fermions in random (Anderson) and quasiperiodic (Aubry-Andre) models, focusing on the role of interaction range. We obtain the MBL quantum phase diagrams by calculating the experimentally relevant inverse participation ratio (IPR) at half-filling using exact diagonalization methods and extrapolating to the infinite system size. For short-range interactions, our results produce in the phase diagram a qualitative symmetry between weak and strong interaction limits. For long-range interactions, no such symmetry exists as the strongly interacting system is always many-body localized, independent of the effective disorder strength, and the system is analogous to a pinned Wigner crystal. We obtain various scaling exponents for the IPR, suggesting conditions for different MBL regimes arising from interaction effects.

preprint2022arXiv

Generalized SAV-exponential integrator schemes for Allen-Cahn type gradient flows

The energy dissipation law and the maximum bound principle (MBP) are two important physical features of the well-known Allen-Cahn equation. While some commonly-used first-order time stepping schemes have turned out to preserve unconditionally both energy dissipation law and MBP for the equation, restrictions on the time step size are still needed for existing second-order or even higher-order schemes in order to have such simultaneous preservation. In this paper, we develop and analyze novel first- and second-order linear numerical schemes for a class of Allen-Cahn type gradient flows. Our schemes combine the generalized scalar auxiliary variable (SAV) approach and the exponential time integrator with a stabilization term, while the standard central difference stencil is used for discretization of the spatial differential operator. We not only prove their unconditional preservation of the energy dissipation law and the MBP in the discrete setting, but also derive their optimal temporal error estimates under fixed spatial mesh. Numerical experiments are also carried out to demonstrate the properties and performance of the proposed schemes.

preprint2022arXiv

Hybrid Instance-aware Temporal Fusion for Online Video Instance Segmentation

Recently, transformer-based image segmentation methods have achieved notable success against previous solutions. While for video domains, how to effectively model temporal context with the attention of object instances across frames remains an open problem. In this paper, we propose an online video instance segmentation framework with a novel instance-aware temporal fusion method. We first leverages the representation, i.e., a latent code in the global context (instance code) and CNN feature maps to represent instance- and pixel-level features. Based on this representation, we introduce a cropping-free temporal fusion approach to model the temporal consistency between video frames. Specifically, we encode global instance-specific information in the instance code and build up inter-frame contextual fusion with hybrid attentions between the instance codes and CNN feature maps. Inter-frame consistency between the instance codes are further enforced with order constraints. By leveraging the learned hybrid temporal consistency, we are able to directly retrieve and maintain instance identities across frames, eliminating the complicated frame-wise instance matching in prior methods. Extensive experiments have been conducted on popular VIS datasets, i.e. Youtube-VIS-19/21. Our model achieves the best performance among all online VIS methods. Notably, our model also eclipses all offline methods when using the ResNet-50 backbone.

preprint2022arXiv

Neural Capture of Animatable 3D Human from Monocular Video

We present a novel paradigm of building an animatable 3D human representation from a monocular video input, such that it can be rendered in any unseen poses and views. Our method is based on a dynamic Neural Radiance Field (NeRF) rigged by a mesh-based parametric 3D human model serving as a geometry proxy. Previous methods usually rely on multi-view videos or accurate 3D geometry information as additional inputs; besides, most methods suffer from degraded quality when generalized to unseen poses. We identify that the key to generalization is a good input embedding for querying dynamic NeRF: A good input embedding should define an injective mapping in the full volumetric space, guided by surface mesh deformation under pose variation. Based on this observation, we propose to embed the input query with its relationship to local surface regions spanned by a set of geodesic nearest neighbors on mesh vertices. By including both position and relative distance information, our embedding defines a distance-preserved deformation mapping and generalizes well to unseen poses. To reduce the dependency on additional inputs, we first initialize per-frame 3D meshes using off-the-shelf tools and then propose a pipeline to jointly optimize NeRF and refine the initial mesh. Extensive experiments show our method can synthesize plausible human rendering results under unseen poses and views.

preprint2022arXiv

On the Optimization Landscape of Neural Collapse under MSE Loss: Global Optimality with Unconstrained Features

When training deep neural networks for classification tasks, an intriguing empirical phenomenon has been widely observed in the last-layer classifiers and features, where (i) the class means and the last-layer classifiers all collapse to the vertices of a Simplex Equiangular Tight Frame (ETF) up to scaling, and (ii) cross-example within-class variability of last-layer activations collapses to zero. This phenomenon is called Neural Collapse (NC), which seems to take place regardless of the choice of loss functions. In this work, we justify NC under the mean squared error (MSE) loss, where recent empirical evidence shows that it performs comparably or even better than the de-facto cross-entropy loss. Under a simplified unconstrained feature model, we provide the first global landscape analysis for vanilla nonconvex MSE loss and show that the (only!) global minimizers are neural collapse solutions, while all other critical points are strict saddles whose Hessian exhibit negative curvature directions. Furthermore, we justify the usage of rescaled MSE loss by probing the optimization landscape around the NC solutions, showing that the landscape can be improved by tuning the rescaling hyperparameters. Finally, our theoretical findings are experimentally verified on practical network architectures.

preprint2022arXiv

Provable Boolean Interaction Recovery from Tree Ensemble obtained via Random Forests

Random Forests (RF) are at the cutting edge of supervised machine learning in terms of prediction performance, especially in genomics. Iterative Random Forests (iRF) use a tree ensemble from iteratively modified RF to obtain predictive and stable non-linear or Boolean interactions of features. They have shown great promise for Boolean biological interaction discovery that is central to advancing functional genomics and precision medicine. However, theoretical studies into how tree-based methods discover Boolean feature interactions are missing. Inspired by the thresholding behavior in many biological processes, we first introduce a novel discontinuous nonlinear regression model, called the Locally Spiky Sparse (LSS) model. Specifically, the LSS model assumes that the regression function is a linear combination of piecewise constant Boolean interaction terms. Given an RF tree ensemble, we define a quantity called Depth-Weighted Prevalence (DWP) for a set of signed features S. Intuitively speaking, DWP(S) measures how frequently features in S appear together in an RF tree ensemble. We prove that, with high probability, DWP(S) attains a universal upper bound that does not involve any model coefficients, if and only if S corresponds to a union of Boolean interactions under the LSS model. Consequentially, we show that a theoretically tractable version of the iRF procedure, called LSSFind, yields consistent interaction discovery under the LSS model as the sample size goes to infinity. Finally, simulation results show that LSSFind recovers the interactions under the LSS model even when some assumptions are violated.

preprint2022arXiv

Recent Advances of Blockchain and its Applications

Blockchain is an emerging decentralized data collection, sharing and storage technology, which have provided abundant transparent, secure, tamper-proof, secure and robust ledger services for various real-world use cases. Recent years have witnessed notable developments of blockchain technology itself as well as blockchain-adopting applications. Most existing surveys limit the scopes on several particular issues of blockchain or applications, which are hard to depict the general picture of current giant blockchain ecosystem. In this paper, we investigate recent advances of both blockchain technology and its most active research topics in real-world applications. We first review the recent developments of consensus mechanisms and storage mechanisms in general blockchain systems. Then extensive literature is conducted on blockchain enabled IoT, edge computing, federated learning and several emerging applications including healthcare, COVID-19 pandemic, social network and supply chain, where detailed specific research topics are discussed in each. Finally, we discuss the future directions, challenges and opportunities in both academia and industry.

preprint2022arXiv

SeanNet: Semantic Understanding Network for Localization Under Object Dynamics

We aim for domestic robots to perform long-term indoor service. Under the object-level scene dynamics induced by daily human activities, a robot needs to robustly localize itself in the environment subject to scene uncertainties. Previous works have addressed visual-based localization in static environments, yet the object-level scene dynamics challenge existing methods for the long-term deployment of the robot. This paper proposes a SEmantic understANding Network (SeanNet) architecture that enables an effective learning process with coupled visual and semantic inputs. With a dataset that contains object dynamics, we propose a cascaded contrastive learning scheme to train the SeanNet for learning a vector scene embedding. Subsequently, we can measure the similarity between the current observed scene and the target scene, whereby enables robust localization under object-level dynamics. In our experiments, we benchmark SeanNet against state-of-the-art image-encoding networks (baselines) on scene similarity measures. The SeanNet architecture with the proposed training method can achieve an 85.02\% accuracy which is higher than baselines. We further integrate the SeanNet and the other networks as the localizers into a visual navigation application. We demonstrate that SeanNet achieves higher success rates compared to the baselines.

preprint2022arXiv

Stabilized exponential-SAV schemes preserving energy dissipation law and maximum bound principle for the Allen-Cahn type equations

It is well-known that the Allen-Cahn equation not only satisfies the energy dissipation law but also possesses the maximum bound principle (MBP) in the sense that the absolute value of its solution is pointwise bounded for all time by some specific constant under appropriate initial/boundary conditions. In recent years, the scalar auxiliary variable (SAV) method and many of its variants have attracted much attention in numerical solution for gradient flow problems due to their inherent advantage of preserving certain discrete analogues of the energy dissipation law. However, existing SAV schemes usually fail to preserve the MBP when applied to the Allen-Cahn equation. In this paper, we develop and analyze new first- and second-order stabilized exponential-SAV schemes for a class of Allen-Cahn type equations, which are shown to simultaneously preserve the energy dissipation law and MBP in discrete settings. In addition, optimal error estimates for the numerical solutions are rigorously obtained for both schemes. Extensive numerical tests and comparisons are also conducted to demonstrate the performance of the proposed schemes.

preprint2021arXiv

Back-n White Neutron Source at CSNS and its Applications

Back-streaming neutrons from the spallation target of the China Spallation Neutron Source (CSNS) that emit through the incoming proton channel were exploited to build a white neutron beam facility (the so-called Back-n white neutron source), which was completed in March 2018. The Back-n neutron beam is very intense, at approximately 2*10^7 n/cm^2/s at 55 m from the target, and has a nominal proton beam with a power of 100 kW in the CSNS-I phase and a kinetic energy of 1.6 GeV and a thick tungsten target in multiple slices with modest moderation from the cooling water through the slices. In addition, the excellent energy spectrum spanning from 0.5 eV to 200 MeV, and a good time resolution related to the time-of-flight measurements make it a typical white neutron source for nuclear data measurements; its overall performance is among that of the best white neutron sources in the world. Equipped with advanced spectrometers, detectors, and application utilities, the Back-n facility can serve wide applications, with a focus on neutron-induced cross-section measurements. This article presents an overview of the neutron beam characteristics, the experimental setups, and the ongoing applications at Back-n.

preprint2021arXiv

Experimental demonstration of the short bunch extraction by bunch rotation in a high-intensity rapid cycling proton synchrotron

Short bunch proton beams are of great significance for the applications of white neutron beams and muon beams. The accelerator complex of China Spallation Neutron Source (CSNS) was designed to support the applications mainly based on neutron scattering techniques where the proton pulse length is not very sensitive. Some theoretical and experimental studies have been performed to see if one can extract a short-bunch proton beam by bunch rotation from the rapid cycling synchrotron (RCS) at CSNS. The experimental results at RCS have evidently displayed the bunch lengthening and rotation process, which demonstrates the effectiveness of this method even with a very short available time for the RF gymnastic processes and a high-intensity beam. With a beam power of 50 kW and normal longitudinal emittance at the injection, the proton beam with a bunch length of about 53% with respect to the one in the normal operation mode was obtained and transported to the spallation target. With a reduced longitudinal emittance at injection and the beam power of 30 kW, the shortest extraction bunch length obtained is about 26% of the one in the normal operation mode. Different machine settings have also been tested to show the impact of the desynchronization between the RF and magnetic fields, the influence of the non-adiabatic risetime and the adiabatic decay time of the RF voltage on the extraction bunch length. The experimental results are well consistent with the theoretical and simulated ones. It is interesting to observe that space charge has a beneficial effect on the bunch lengthening which will result in a shorter bunch at the extraction with the later bunch rotation. The controlled desynchronization method between the RF and magnetic fields in an RCS was also proven successful.

preprint2021arXiv

High fidelity entanglement of neutral atoms via a Rydberg-mediated single-modulated-pulse controlled-PHASE gate

Neutral atom platform has become an attractive choice to study the science of quantum information and quantum simulation, where intense efforts have been devoted to the entangling processes between individual atoms. For the development of this area, two-qubit controlled-PHASE gate via Rydberg blockade is one of the most essential elements. Recent theoretical studies have suggested the advantages of introducing non-trivial waveform modulation into the gate protocol, which is anticipated to improve its performance towards the next stage. We report our recent experimental results in realizing a two-qubit controlled-PHASE($C_Z$) gate via off-resonant modulated driving(ORMD) embedded in two-photon transition for Rb atoms. It relies upon a single modulated driving pulse with a carefully calculated smooth waveform to gain the appropriate phase accumulations required by the two-qubit gate. Combining this $C_Z$ gate with global microwave pulses, two-atom entanglement is generated with the raw fidelity of 0.945(6). Accounting for state preparation and measurement (SPAM) errors, we extract the entanglement operation fidelity to be 0.980(7). Our work features completing the $C_Z$ gate operation within a single pulse to avoid shelved Rydberg population, thus demonstrate another promising route for realizing high-fidelity two-qubit gate for neutral atom platform.

preprint2021arXiv

Hybrid Beamforming for mmWave MU-MISO Systems Exploiting Multi-agent Deep Reinforcement Learning

In this letter, we investigate the hybrid beamforming based on deep reinforcement learning (DRL) for millimeter Wave (mmWave) multi-user (MU) multiple-input-single-output (MISO) system. A multi-agent DRL method is proposed to solve the exploration efficiency problem in DRL. In the proposed method, prioritized replay buffer and more informative reward are applied to accelerate the convergence. Simulation results show that the proposed architecture achieves higher spectral efficiency and less time consumption than the benchmarks, thus is more suitable for practical applications.

preprint2021arXiv

Modeling and Measurements for Multi-path Mitigation with Reconfigurable Intelligent Surfaces

A reconfigurable intelligent surface (RIS) is capable of manipulating electromagnetic waves with its flexibly configurable unit cells, thus is an appealing technology to resist fast fading caused by multi-path in wireless communications. In this paper, a two-path propagation model for RIS-assisted wireless communications is proposed by considering both the direct path from the transmitter to the receiver and the assisted path provided by the RIS. The proposed propagation model unveils that the phase shifts of RISs can be optimized by appropriate configuration for multi-path fading mitigation. In particular, four types of RISs with different configuration capabilities are introduced and their performances on improving received signal power in virtue of the assisted path to resist fast fading are compared through extensive simulation results. In addition, an RIS operating at 35 GHz is used for experimental measurement. The experimental results verify that an RIS has the ability to combat fast fading and thus improves the receiving performance, which may lay a foundation for further researches.

preprint2021arXiv

Rethinking Natural Adversarial Examples for Classification Models

Recently, it was found that many real-world examples without intentional modifications can fool machine learning models, and such examples are called "natural adversarial examples". ImageNet-A is a famous dataset of natural adversarial examples. By analyzing this dataset, we hypothesized that large, cluttered and/or unusual background is an important reason why the images in this dataset are difficult to be classified. We validated the hypothesis by reducing the background influence in ImageNet-A examples with object detection techniques. Experiments showed that the object detection models with various classification models as backbones obtained much higher accuracy than their corresponding classification models. A detection model based on the classification model EfficientNet-B7 achieved a top-1 accuracy of 53.95%, surpassing previous state-of-the-art classification models trained on ImageNet, suggesting that accurate localization information can significantly boost the performance of classification models on ImageNet-A. We then manually cropped the objects in images from ImageNet-A and created a new dataset, named ImageNet-A-Plus. A human test on the new dataset showed that the deep learning-based classifiers still performed quite poorly compared with humans. Therefore, the new dataset can be used to study the robustness of classification models to the internal variance of objects without considering the background disturbance.

preprint2021arXiv

Sensing population distribution from satellite imagery via deep learning: model selection, neighboring effect, and systematic biases

The rapid development of remote sensing techniques provides rich, large-coverage, and high-temporal information of the ground, which can be coupled with the emerging deep learning approaches that enable latent features and hidden geographical patterns to be extracted. This study marks the first attempt to cross-compare performances of popular state-of-the-art deep learning models in estimating population distribution from remote sensing images, investigate the contribution of neighboring effect, and explore the potential systematic population estimation biases. We conduct an end-to-end training of four popular deep learning architectures, i.e., VGG, ResNet, Xception, and DenseNet, by establishing a mapping between Sentinel-2 image patches and their corresponding population count from the LandScan population grid. The results reveal that DenseNet outperforms the other three models, while VGG has the worst performances in all evaluating metrics under all selected neighboring scenarios. As for the neighboring effect, contradicting existing studies, our results suggest that the increase of neighboring sizes leads to reduced population estimation performance, which is found universal for all four selected models in all evaluating metrics. In addition, there exists a notable, universal bias that all selected deep learning models tend to overestimate sparsely populated image patches and underestimate densely populated image patches, regardless of neighboring sizes. The methodological, experimental, and contextual knowledge this study provides is expected to benefit a wide range of future studies that estimate population distribution via remote sensing imagery.

preprint2021arXiv

The Logical Options Framework

Learning composable policies for environments with complex rules and tasks is a challenging problem. We introduce a hierarchical reinforcement learning framework called the Logical Options Framework (LOF) that learns policies that are satisfying, optimal, and composable. LOF efficiently learns policies that satisfy tasks by representing the task as an automaton and integrating it into learning and planning. We provide and prove conditions under which LOF will learn satisfying, optimal policies. And lastly, we show how LOF's learned policies can be composed to satisfy unseen tasks with only 10-50 retraining steps. We evaluate LOF on four tasks in discrete and continuous domains, including a 3D pick-and-place environment.

preprint2021arXiv

TSQA: Tabular Scenario Based Question Answering

Scenario-based question answering (SQA) has attracted an increasing research interest. Compared with the well-studied machine reading comprehension (MRC), SQA is a more challenging task: a scenario may contain not only a textual passage to read but also structured data like tables, i.e., tabular scenario based question answering (TSQA). AI applications of TSQA such as answering multiple-choice questions in high-school exams require synthesizing data in multiple cells and combining tables with texts and domain knowledge to infer answers. To support the study of this task, we construct GeoTSQA. This dataset contains 1k real questions contextualized by tabular scenarios in the geography domain. To solve the task, we extend state-of-the-art MRC methods with TTGen, a novel table-to-text generator. It generates sentences from variously synthesized tabular data and feeds the downstream MRC method with the most useful sentences. Its sentence ranking model fuses the information in the scenario, question, and domain knowledge. Our approach outperforms a variety of strong baseline methods on GeoTSQA.

preprint2020arXiv

A Blockchain Transaction Graph based Machine Learning Method for Bitcoin Price Prediction

Bitcoin, as one of the most popular cryptocurrency, is recently attracting much attention of investors. Bitcoin price prediction task is consequently a rising academic topic for providing valuable insights and suggestions. Existing bitcoin prediction works mostly base on trivial feature engineering, that manually designs features or factors from multiple areas, including Bticoin Blockchain information, finance and social media sentiments. The feature engineering not only requires much human effort, but the effectiveness of the intuitively designed features can not be guaranteed. In this paper, we aim to mining the abundant patterns encoded in bitcoin transactions, and propose k-order transaction graph to reveal patterns under different scope. We propose the transaction graph based feature to automatically encode the patterns. A novel prediction method is proposed to accept the features and make price prediction, which can take advantage from particular patterns from different history period. The results of comparison experiments demonstrate that the proposed method outperforms the most recent state-of-art methods.

preprint2020arXiv

A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution

We study the multi-channel sparse blind deconvolution (MCS-BD) problem, whose task is to simultaneously recover a kernel $\mathbf a$ and multiple sparse inputs $\{\mathbf x_i\}_{i=1}^p$ from their circulant convolution $\mathbf y_i = \mathbf a \circledast \mathbf x_i $ ($i=1,\cdots,p$). We formulate the task as a nonconvex optimization problem over the sphere. Under mild statistical assumptions of the data, we prove that the vanilla Riemannian gradient descent (RGD) method, with random initializations, provably recovers both the kernel $\mathbf a$ and the signals $\{\mathbf x_i\}_{i=1}^p$ up to a signed shift ambiguity. In comparison with state-of-the-art results, our work shows significant improvements in terms of sample complexity and computational efficiency. Our theoretical results are corroborated by numerical experiments, which demonstrate superior performance of the proposed approach over the previous methods on both synthetic and real datasets.

preprint2020arXiv

An Early Study on Intelligent Analysis of Speech under COVID-19: Severity, Sleep Quality, Fatigue, and Anxiety

The COVID-19 outbreak was announced as a global pandemic by the World Health Organisation in March 2020 and has affected a growing number of people in the past few weeks. In this context, advanced artificial intelligence techniques are brought to the fore in responding to fight against and reduce the impact of this global health crisis. In this study, we focus on developing some potential use-cases of intelligent speech analysis for COVID-19 diagnosed patients. In particular, by analysing speech recordings from these patients, we construct audio-only-based models to automatically categorise the health state of patients from four aspects, including the severity of illness, sleep quality, fatigue, and anxiety. For this purpose, two established acoustic feature sets and support vector machines are utilised. Our experiments show that an average accuracy of .69 obtained estimating the severity of illness, which is derived from the number of days in hospitalisation. We hope that this study can foster an extremely fast, low-cost, and convenient way to automatically detect the COVID-19 disease.

preprint2020arXiv

Convergence analysis for a stabilized linear semi-implicit numerical scheme for the nonlocal Cahn-Hilliard equation

In this paper, we provide a detailed convergence analysis for a first order stabilized linear semi-implicit numerical scheme for the nonlocal Cahn-Hilliard equation, which follows from consistency and stability estimates for the numerical error function. Due to the complicated form of the nonlinear term, we adopt the discrete $H^{-1}$ norm for the error function to establish the convergence result. In addition, the energy stability obtained in [Du et al., J. Comput. Phys., 363:39--54, 2018] requires an assumption on the uniform $\ell^\infty$ bound of the numerical solution and such a bound is figured out in this paper by conducting the higher order consistency analysis. Taking the view that the numerical solution is indeed the exact solution with a perturbation, the error function is $\ell^\infty$ bounded uniformly under a loose constraint of the time step size, which then leads to the uniform maximum-norm bound of the numerical solution.

preprint2020arXiv

COVID-19 and Computer Audition: An Overview on What Speech & Sound Analysis Could Contribute in the SARS-CoV-2 Corona Crisis

At the time of writing, the world population is suffering from more than 10,000 registered COVID-19 disease epidemic induced deaths since the outbreak of the Corona virus more than three months ago now officially known as SARS-CoV-2. Since, tremendous efforts have been made worldwide to counter-steer and control the epidemic by now labelled as pandemic. In this contribution, we provide an overview on the potential for computer audition (CA), i.e., the usage of speech and sound analysis by artificial intelligence to help in this scenario. We first survey which types of related or contextually significant phenomena can be automatically assessed from speech or sound. These include the automatic recognition and monitoring of breathing, dry and wet coughing or sneezing sounds, speech under cold, eating behaviour, sleepiness, or pain to name but a few. Then, we consider potential use-cases for exploitation. These include risk assessment and diagnosis based on symptom histograms and their development over time, as well as monitoring of spread, social distancing and its effects, treatment and recovery, and patient wellbeing. We quickly guide further through challenges that need to be faced for real-life usage. We come to the conclusion that CA appears ready for implementation of (pre-)diagnosis and monitoring tools, and more generally provides rich and significant, yet so far untapped potential in the fight against COVID-19 spread.

preprint2020arXiv

Deep Reinforcement Learning for Adaptive Learning Systems

In this paper, we formulate the adaptive learning problem---the problem of how to find an individualized learning plan (called policy) that chooses the most appropriate learning materials based on learner's latent traits---faced in adaptive learning systems as a Markov decision process (MDP). We assume latent traits to be continuous with an unknown transition model. We apply a model-free deep reinforcement learning algorithm---the deep Q-learning algorithm---that can effectively find the optimal learning policy from data on learners' learning process without knowing the actual transition model of the learners' continuous latent traits. To efficiently utilize available data, we also develop a transition model estimator that emulates the learner's learning process using neural networks. The transition model estimator can be used in the deep Q-learning algorithm so that it can more efficiently discover the optimal learning policy for a learner. Numerical simulation studies verify that the proposed algorithm is very efficient in finding a good learning policy, especially with the aid of a transition model estimator, it can find the optimal learning policy after training using a small number of learners.

preprint2020arXiv

Distribution Aligned Multimodal and Multi-Domain Image Stylization

Multimodal and multi-domain stylization are two important problems in the field of image style transfer. Currently, there are few methods that can perform both multimodal and multi-domain stylization simultaneously. In this paper, we propose a unified framework for multimodal and multi-domain style transfer with the support of both exemplar-based reference and randomly sampled guidance. The key component of our method is a novel style distribution alignment module that eliminates the explicit distribution gaps between various style domains and reduces the risk of mode collapse. The multimodal diversity is ensured by either guidance from multiple images or random style code, while the multi-domain controllability is directly achieved by using a domain label. We validate our proposed framework on painting style transfer with a variety of different artistic styles and genres. Qualitative and quantitative comparisons with state-of-the-art methods demonstrate that our method can generate high-quality results of multi-domain styles and multimodal instances with reference style guidance or random sampled style.

preprint2020arXiv

Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications

The problem of finding the sparsest vector (direction) in a low dimensional subspace can be considered as a homogeneous variant of the sparse recovery problem, which finds applications in robust subspace recovery, dictionary learning, sparse blind deconvolution, and many other problems in signal processing and machine learning. However, in contrast to the classical sparse recovery problem, the most natural formulation for finding the sparsest vector in a subspace is usually nonconvex. In this paper, we overview recent advances on global nonconvex optimization theory for solving this problem, ranging from geometric analysis of its optimization landscapes, to efficient optimization algorithms for solving the associated nonconvex optimization problem, to applications in machine intelligence, representation learning, and imaging sciences. Finally, we conclude this review by pointing out several interesting open problems for future research.

preprint2020arXiv

Latent Space Factorisation and Manipulation via Matrix Subspace Projection

We tackle the problem disentangling the latent space of an autoencoder in order to separate labelled attribute information from other characteristic information. This then allows us to change selected attributes while preserving other information. Our method, matrix subspace projection, is much simpler than previous approaches to latent space factorisation, for example not requiring multiple discriminators or a careful weighting among their loss functions. Furthermore our new model can be applied to autoencoders as a plugin, and works across diverse domains such as images or text. We demonstrate the utility of our method for attribute manipulation in autoencoders trained across varied domains, using both human evaluation and automated methods. The quality of generation of our new model (e.g. reconstruction, conditional generation) is highly competitive to a number of strong baselines.

preprint2020arXiv

Maximum bound principles for a class of semilinear parabolic equations and exponential time differencing schemes

The ubiquity of semilinear parabolic equations has been illustrated in their numerous applications ranging from physics, biology, to materials and social sciences. In this paper, we consider a practically desirable property for a class of semilinear parabolic equations of the abstract form $u_t=\mathcal{L}u+f[u]$ with $\mathcal{L}$ being a linear dissipative operator and $f$ being a nonlinear operator in space, namely a time-invariant maximum bound principle, in the sense that the time-dependent solution $u$ preserves for all time a uniform pointwise bound in absolute value imposed by its initial and boundary conditions. We first study an analytical framework for some sufficient conditions on $\mathcal{L}$ and $f$ that lead to such a maximum bound principle for the time-continuous dynamic system of infinite or finite dimensions. Then, we utilize a suitable exponential time differencing approach with a properly chosen generator of contraction semigroup to develop first- and second-order accurate temporal discretization schemes, that satisfy the maximum bound principle unconditionally in the time-discrete setting. Error estimates of the proposed schemes are derived along with their energy stability. Extensions to vector- and matrix-valued systems are also discussed. We demonstrate that the abstract framework and analysis techniques developed here offer an effective and unified approach to study the maximum bound principle of the abstract evolution equation that cover a wide variety of well-known models and their numerical discretization schemes. Some numerical experiments are also carried out to verify the theoretical results.

preprint2020arXiv

Measurement of the neutron beam profile of the Back-n white neutron facility at CSNS with a Micromegas detector

The Back-n white neutron beam line, which uses back-streaming white neutrons from the spallation target of the China Spallation Neutron Source, is used for nuclear data measurements. A Micromegas-based neutron detector with two variants was specially developed to measure the beam spot distribution for this beam line. In this article, the design, fabrication, and characterization of the detector are described. The results of the detector performance tests are presented, which include the relative electron transparency, the gain and the gain uniformity, and the neutron beam profile reconstruction capability. The result of the first measurement of the Back-n neutron beam spot distribution is also presented.

preprint2020arXiv

MIMO Transmission through Reconfigurable Intelligent Surface: System Design, Analysis, and Implementation

Reconfigurable intelligent surface (RIS) is a new paradigm that has great potential to achieve cost-effective, energy-efficient information modulation for wireless transmission, by the ability to change the reflection coefficients of the unit cells of a programmable metasurface. Nevertheless, the electromagnetic responses of the RISs are usually only phase-adjustable, which considerably limits the achievable rate of RIS-based transmitters. In this paper, we propose an RIS architecture to achieve amplitude-and-phase-varying modulation, which facilitates the design of multiple-input multiple-output (MIMO) quadrature amplitude modulation (QAM) transmission. The hardware constraints of the RIS and their impacts on the system design are discussed and analyzed. Furthermore, the proposed approach is evaluated using our prototype which implements the RIS-based MIMO-QAM transmission over the air in real time.

preprint2020arXiv

Morphological Word Segmentation on Agglutinative Languages for Neural Machine Translation

Neural machine translation (NMT) has achieved impressive performance on machine translation task in recent years. However, in consideration of efficiency, a limited-size vocabulary that only contains the top-N highest frequency words are employed for model training, which leads to many rare and unknown words. It is rather difficult when translating from the low-resource and morphologically-rich agglutinative languages, which have complex morphology and large vocabulary. In this paper, we propose a morphological word segmentation method on the source-side for NMT that incorporates morphology knowledge to preserve the linguistic and semantic information in the word structure while reducing the vocabulary size at training time. It can be utilized as a preprocessing tool to segment the words in agglutinative languages for other natural language processing (NLP) tasks. Experimental results show that our morphologically motivated word segmentation method is better suitable for the NMT model, which achieves significant improvements on Turkish-English and Uyghur-Chinese machine translation tasks on account of reducing data sparseness and language complexity.

preprint2020arXiv

Multilinear Algebra for Distributed Storage

An $(n, k, d, α, β, M)$-ERRC (exact-repair regenerating code) is a collection of $n$ nodes used to store a file. For a file of total size $M$, each node stores $α$ symbols, any $k$ nodes recover the file, and any $d$ nodes repair any other node via sending out $β$ symbols. We establish a multilinear algebra foundation to assemble $(n, k, d, α, β, M)$-ERRCs for all meaningful $(n, k, d)$ tuples. Our ERRCs tie the $α/M$-versus-$β/M$ trade-off with cascade codes, the best known construction for this trade-off. We give directions on how these ERRCs repair multiple failures.

preprint2020arXiv

Optimality of the max test for detecting sparse signals with Gaussian or heavier tail

A fundamental problem in high-dimensional testing is that of global null testing: testing whether the null holds simultaneously in all of $n$ hypotheses. The max test, which uses the smallest of the $n$ marginal p-values as its test statistic, enjoys widespread popularity for its simplicity and robustness. However, its theoretical performance relative to other tests has been called into question. In the Gaussian sequence version of the global testing problem, Donoho and Jin (2004) discovered a so-called "weak, sparse" asymptotic regime in which the higher criticism and Berk-Jones tests achieve a better detection boundary than the max test when all of the nonzero signal strengths are identical. We study a more general model in which the non-null means are drawn from a generic distribution, and show that the detection boundary for the max test is optimal in the "weak, sparse" regime, provided that the distribution's tail is no lighter than Gaussian. Further, we show theoretically and in simulation that the modified higher criticism of Donoho and Jin (2004) can have very low power when the distribution of non-null means has a polynomial tail.

preprint2020arXiv

Phonon scattering induced carrier resistivity in twisted double bilayer graphene

In this work we carry out a theoretical study of the phonon-induced resistivity in twisted double bilayer graphene (TDBG), in which two Bernal-stacked bilayer graphene devices are rotated relative to each other by a small angle $θ$. We show that at small twist angles ($θ\sim 1^\circ$) the effective mass of the TDBG system is greatly enhanced, leading to a drastically increased phonon-induced resistivity in the high-temperature limit where phonon scattering leads to a linearly increasing resistivity with increasing temperature. We also discuss possible implications of our theory on superconductivity in such a system, and provide an order of magnitude estimation of the superconducting transition temperature.

preprint2020arXiv

PrecoderNet: Hybrid Beamforming for Millimeter Wave Systems with Deep Reinforcement Learning

In this letter, we investigate the hybrid beamforming for millimeter wave massive multiple-input multiple-output (MIMO) system based on deep reinforcement learning (DRL). Imperfect channel state information (CSI) is assumed to be available at the base station (BS). To achieve high spectral efficiency with low time consumption, we propose a novel DRL-based method called PrecoderNet to design the digital precoder and analog combiner. The DRL agent takes the digital beamformer and analog combiner of the previous learning iteration as state, and these matrices of current learning iteration as action. Simulation results demonstrate that the PrecoderNet performs well in spectral efficiency, bit error rate (BER), as well as time consumption, and is robust to the CSI imperfection.

preprint2019arXiv

Measurements of differential and angle-integrated cross sections for the $^{10}$B($n, α$)$^{7}$Li reaction in the neutron energy range from 1.0 eV to 2.5 MeV

Differential and angle-integrated cross sections for the $^{10}$B($n, α$)$^{7}$Li, $^{10}$B($n, α$$_{0}$)$^{7}$Li and $^{10}$B($n, α$$_{1}$)$^{7}$Li$^{*}$ reactions have been measured at CSNS Back-n white neutron source. Two enriched (90%) $^{10}$B samples 5.0 cm in diameter and ~85.0 $μ$g/cm$^{2}$ in thickness each with an aluminum backing were prepared, and back-to-back mounted at the sample holder. The charged particles were detected using the silicon-detector array of the Light-charged Particle Detector Array (LPDA) system. The neutron energy E$_{n}$ was determined by TOF (time-of-flight) method, and the valid $α$ events were extracted from the E$_{n}$-Amplitude two-dimensional spectrum. With 15 silicon detectors, the differential cross sections of $α$-particles were measured from 19.2° to 160.8°. Fitted with the Legendre polynomial series, the ($n, α$) cross sections were obtained through integration. The absolute cross sections were normalized using the standard cross sections of the $^{10}$B($n, α$)$^{7}$Li reaction in the 0.3 - 0.5 MeV neutron energy region. The measurement neutron energy range for the $^{10}$B($n, α$)$^{7}$Li reaction is 1.0 eV $\le$ En < 2.5 MeV (67 energy points), and for the $^{10}$B($n, α$$_{0}$)$^{7}$Li and $^{10}$B($n, α$$_{1}$)$^{7}$Li$^{*}$ reactions is 1.0 eV $\le$ En < 1.0 MeV (59 energy points). The present results have been analyzed by the resonance reaction mechanism and the level structure of the $^{11}$B compound system, and compared with existing measurements and evaluations.

preprint2019arXiv

Topological phase transition based on the attractive Hubbard model

We theoretically investigate the effect of an attractive on-site interaction on the two-band magnetic Dirac fermion model based on a square lattice system. When the attractive fermion interaction is taken into account by the mean-field approximation, a phase diagram is obtained. It is found that a quantum phase transition from a band insulator state to quantum anomalous Hall state occurs with increased attractive interaction. For an existing quantum anomalous Hall state, the attractive interaction enlarges its nontrivial band gap and makes the topological edge states more localized, which protects the transport of linear-dispersive edge states against finite-size and further disorder effects.

preprint2018arXiv

Mobility edge and intermediate phase in one-dimensional incommensurate lattice potentials

We study theoretically the localization properties of two distinct one-dimensional quasiperiodic lattice models with a single-particle mobility edge (SPME) separating extended and localized states in the energy spectrum. The first one is the familiar Soukoulis-Economou trichromatic potential model with two incommensurate potentials, and the second is a system consisting of two coupled 1D Aubry-Andre chains each containing one incommensurate potential. We show that as a function of the Hamiltonian model parameters, both models have a wide single-particle intermediate phase (SPIP), defined as the regime where localized and extended single-particle states coexist in the spectrum, leading to a behavior intermediate between purely extended or purely localized when the system is dynamically quenched from a generic initial state. Our results thus suggest that both systems could serve as interesting experimental platforms for studying the interplay between localized and extended states, and may provide insight into the role of the coupling of small baths to localized systems. We also calculate the Lyapunov (or localization) exponent for several incommensurate 1D models exhibiting SPME, finding that such localization critical exponents for quasiperiodic potential induced localization are nonuniversal and depend on the microscopic details of the Hamiltonian.

preprint2016arXiv

A Hierarchical Reinforcement Learning Method for Persistent Time-Sensitive Tasks

Reinforcement learning has been applied to many interesting problems such as the famous TD-gammon and the inverted helicopter flight. However, little effort has been put into developing methods to learn policies for complex persistent tasks and tasks that are time-sensitive. In this paper, we take a step towards solving this problem by using signal temporal logic (STL) as task specification, and taking advantage of the temporal abstraction feature that the options framework provide. We show via simulation that a relatively easy to implement algorithm that combines STL and options can learn a satisfactory policy with a small number of training cases

preprint2016arXiv

Central limit theorems for network driven sampling

Respondent-Driven Sampling is a popular technique for sampling hidden populations. This paper models Respondent-Driven Sampling as a Markov process indexed by a tree. Our main results show that the Volz-Heckathorn estimator is asymptotically normal below a critical threshold. The key technical difficulties stem from (i) the dependence between samples and (ii) the tree structure which characterizes the dependence. The theorems allow the growth rate of the tree to exceed one and suggest that this growth rate should not be too large. To illustrate the usefulness of these results beyond their obvious use, an example shows that in certain cases the sample average is preferable to inverse probability weighting. We provide a test statistic to distinguish between these two cases.

preprint2016arXiv

Extremely large and significantly anisotropic magnetoresistance in ZrSiS single crystals

Recently, the extremely large magnetoresistance observed in transition metal telluride, like WTe$_2$, attracted much attention because of the potential applications in magnetic sensor. Here we report the observation of extremely large magnetoresistance as 3.0$\times$10$^4$ % measured at 2 K and 9 T magnetic field aligned along [001]-ZrSiS. The significant magnetoresistance change (~1.4$\times$10$^4$ %) can be obtained when the magnetic field is titled from [001] to [011]-ZrSiS. These abnormal magnetoresistance behaviors in ZrSiS can be understood by electron-hole compensation and the open orbital of Fermi surface. Because of these superior MR properties, ZrSiS may be used in the novel magnetic sensors.

preprint2016arXiv

High teleportation rates using cold-atom ensemble based quantum repeaters with Rydberg blockade

We present a simplified version of a repeater protocol in a cold neutral-atom ensemble with Rydberg excitations optimized for two-node entanglement generation and describe a protocol for quantum teleportation. Our proposal draws from previous proposals [Zhao, {\sl et al.}, Phys. Rev. A {\bf 81}, 052329 (2010)] and [Han, {\sl et al.} Phys. Rev. A {\bf 81}, 052311 (2010)] who described efficient and robust protocols for long-distance entanglement with many nodes. Using realistic experimental values we predict an entanglement generation rate of $\sim$25 Hz and teleportation rate of $\sim$ 5 Hz. Our predicted rates match the current state of the art experiments for entanglement generation and teleportation between quantum memories. With improved efficiencies we predict entanglement generation and teleportation rates of $\sim$7.8 kHz and $\sim$3.6 kHz respectively, representing a two order of magnitude improvement over the currently realized values. Cold-atom ensembles with Rydberg excitations are promising candidates for repeater nodes because collective effects in the ensemble can be used to deterministically generate a long-lived ground state memory which may be efficiently mapped onto a directionally emitted single photon.

preprint2016arXiv

Uncovering edge states and electrical inhomogeneity in MoS2 field-effect transistors

The understanding of various types of disorders in atomically thin transition metal dichalcogenides (TMDs), including dangling bonds at the edges, chalcogen deficiencies in the bulk, and charges in the substrate, is of fundamental importance for their applications in electronics and photonics. Because of the imperfections, electrons moving on these two-dimensional (2D) crystals experience a spatially non-uniform Coulomb environment, whose effect on the charge transport has not been microscopically studied. Here, we report the mesoscopic conductance mapping in monolayer and few-layer MoS2 field-effect transistors (FETs) by microwave impedance microscopy (MIM). The spatial evolution of the insulator-to-metal transition is clearly resolved. Interestingly, as the transistors are gradually turned on, electrical conduction emerges initially at the edges before appearing in the bulk of MoS2 flakes, which can be explained by our first-principles calculations. The results unambiguously confirm that the contribution of edge states to the channel conductance is significant under the threshold voltage but negligible once the bulk of the TMD device becomes conductive. Strong conductance inhomogeneity, which is associated with the fluctuations of disorder potential in the 2D sheets, is also observed in the MIM images, providing a guideline for future improvement of the device performance.

preprint2016arXiv

Valley splitting in the transition-metal dichalcogenides monolayer via atoms adsorption

In this letter we study the valley degeneracy splitting of the transition-metal dichalcogenides monolayer by first-principles calculations. The local magnetic moments are introduced into the system when the transition-metal atoms are adsorbed to the monolayer surface. Zeeman effect arising from the local magnetic moment at transition-metal atom sites lifts the valley degeneracy. Anomalous charge, spin and valley Hall Effects can be accessed due to valley splitting when we can only excite carriers of one valley. The valley splitting depends on the direction of magnetization and thus can be tuned continuously by an external magnetic field. This tunable valley splitting offers a practical avenue for exploring device paradigms based on the spin and valley degrees of freedom.

preprint2016arXiv

Weyl fermions with arbitrary monopole in magnetic fields: Landau levels, longitudinal magnetotransport, and density-wave ordering

We theoretically address the effects of strong magnetic fields in three-dimensional Weyl semimetals (WSMs) built out of Weyl nodes with a monopole charge $n$. For $n=1$, $2$, and $3$ we realize single, double, and triple WSM, respectively, and the monopole charge $n$ determines the integer topological invariant of the WSM. Within the linearized continuum description, the quasiparticle spectrum is then composed of Landau levels (LLs), containing exactly $n$ number of chiral zeroth Landau levels (ZLLs), irrespective of the orientation of the magnetic field. In the presence of strong backscattering, for example, (due to quenched disorder associated with random impurities), these systems generically give rise to longitudinal magnetotransport. Restricting ourselves to the quantum limit (and assuming only the subspace of the ZLLs to be partially filled) and mainly accounting for Gaussian impurities, we show that the longitudinal magnetoconductivity (LMC) in all members of the Weyl family displays a positive linear-$B$ scaling, when the field is applied along the axis that separates the Weyl nodes. But, in double and triple WSM, LMC displays a smooth crossover to a nonlinear $B$-dependence as the field is tilted away from such a high-symmetry direction. In addition, due to the enhanced density of states, the LL quantization can trigger instabilities toward the formation of translational symmetry breaking density-wave orderings for sufficiently weak interaction (BCS instability), which gaps out the ZLLs. Concomitantly as the temperature (magnetic field) is gradually decreased (increased) the LMC becomes negative. Thus WSMs with arbitrary monopole charge ($n$) can host an intriguing interplay of LL quantization, longitudinal magnetotransport (a possible manifestation of one-dimensional chiral or axial anomaly), and density-wave ordering, when placed in a strong magnetic field.

preprint2015arXiv

An unconditionally energy stable finite difference scheme for a stochastic Cahn-Hilliard equation

In this work, the MMC-TDGL equation, a stochastic Cahn-Hilliard equation is solved numerically by using the finite difference method in combination with a convex splitting technique of the energy functional. For the non-stochastic case, we develop an unconditionally energy stable difference scheme which is proved to be uniquely solvable. For the stochastic case, by adopting the same splitting of the energy functional, we construct a similar and uniquely solvable difference scheme with the discretized stochastic term. The resulted schemes are nonlinear and solved by Newton iteration. For the long time simulation, an adaptive time stepping strategy is developed based on both first- and second-order derivatives of the energy. Numerical experiments are carried out to verify the energy stability, the efficiency of the adaptive time stepping and the effect of the stochastic term.

preprint2015arXiv

Convergence of a Fast Explicit Operator Splitting Method for the Molecular Beam Epitaxy Model

A fast explicit operator splitting (FEOS) method for the molecular beam epitaxy model has been presented in [Cheng, et al., Fast and stable explicit operator splitting methods for phase-field models, J. Comput. Phys., submitted]. The original problem is split into linear and nonlinear subproblems. For the linear part, the pseudo-spectral method is adopted; for the nonlinear part, a 33-point difference scheme is constructed. Here, we give a compact center-difference scheme involving fewer points for the nonlinear subproblem. Besides, we analyze the convergence rate of the algorithm. The global error order $\mathcal{O}(τ^2+h^4)$ in discrete $L^2$-norm is proved theoretically and verified numerically. Some numerical experiments show the robustness of the algorithm for small coefficients of the fourth-order term for the one-dimensional case. Besides, coarsening dynamics are simulated in large domains and the $1/3$ power laws are observed for the two-dimensional case.

preprint2015arXiv

Exciton-polaritons in transition-metal dichalcogenides and their direct excitation via energy transfer

Excitons, composite electron-hole quasiparticles, are known to play an important role in optoelectronic phenomena in many semiconducting materials. Recent experiments and theory indicate that the band-gap optics of the newly discovered monolayer transition-metal dichalcogenides (TMDs) is dominated by tightly bound valley excitons. The strong interaction of excitons with long-range electromagnetic fields in these 2D systems can significantly affect their intrinsic properties. Here, we develop a semi-classical framework for intrinsic exciton-polaritons in monolayer TMDs that treats their dispersion and radiative decay on the same footing and can incorporate effects of the dielectric environment. It is demonstrated how both inter- and intra-valley long-range interactions influence the dispersion and decay of the polaritonic eigenstates. We also show that exciton-polaritons can be efficiently excited via resonance energy transfer from quantum emitters such as quantum dots, which may be useful for various applications.

preprint2015arXiv

Giant and tunable valley degeneracy splitting in MoTe2

Monolayer transition-metal dichalcogenides possess a pair of degenerate helical valleys in the band structure that exhibit fascinating optical valley polarization. Optical valley polarization, however, is limited by carrier lifetimes of these materials. Lifting the valley degeneracy is therefore an attractive route for achieving valley polarization. It is very challenging to achieve appreciable valley degeneracy splitting with applied magnetic field. We propose a strategy to create giant splitting of the valley degeneracy by proximity-induced Zeeman effect. As a demonstration, our first principles calculations of monolayer MoTe$_2$ on a EuO substrate show that valley splitting over 300 meV can be generated. The proximity coupling also makes interband transition energies valley dependent, enabling valley selection by optical frequency tuning in addition to circular polarization. The valley splitting in the heterostructure is also continuously tunable by rotating substrate magnetization. The giant and tunable valley splitting adds a readily accessible dimension to the valley-spin physics with rich and interesting experimental consequences, and offers a practical avenue for exploring device paradigms based on the intrinsic degrees of freedom of electrons.

preprint2015arXiv

Impact of Metro Cell Antenna Pattern and Downtilt in Heterogeneous Networks

This article discusses the positive impact metro cell antennas with narrow vertical beamwidth and electrical downtilt can have on heterogeneous cellular networks. Using a model of random cell placement based on Poisson distribution, along with an innovative 3D building model that quantifies blockage due to shadowing, it is demonstrated that network spectral efficiency and average user throughput both increase as vertical beamwidth is decreased and downtilt is applied to metro cell transmission. Moreover, the network becomes more energy efficient. Importantly, these additional gains in network performance can be achieved without any cooperation or exchange of information between macro cell base stations and metro cells.

preprint2015arXiv

Mixed and missing data: a unified treatment with latent graphical models

We propose to learn latent graphical models when data have mixed variables and missing values. This model could be used for further data analysis, including regression, classification, ranking etc. It also could be used for imputing missing values. We specify a latent Gaussian model for the data, where the categorical variables are generated by discretizing an unobserved variable and the latent variables are multivariate Gaussian. The observed data consists of two parts: observed Gaussian variables and observed categorical variables, where the latter part is considered as partially missing Gaussian variables. We use the Expectation-Maximization algorithm to fit the model. To prevent overfitting we use sparse inverse covariance estimation to obtain sparse estimate of the latent covariance matrix, equivalently, the graphical model. The fitted model then could be used for problems including re- gression, classification and ranking. Such an approach is applied to a medical data set where our method outperforms the state-of-the-art methods. Simulation studies and real data results suggest that our proposed model performs better than random forest in terms of prediction error when the model is correctly specified, and is a better imputation method than hot deck imputation even if the model is not correctly specified.

preprint2015arXiv

On the Lagrangian angle and the Kähler angle of immersed surfaces in the complex plane $\bbc^2$

In this paper, we discuss the Lagrangian angle and the Kähler angle of immersed surfaces in $\mathbb C^2$. Firstly, we provide an extension of Lagrangian angle, Maslov form and Maslov class to more general surfaces in $\mathbb C^2$ than Lagrangian surfaces, and then naturally extend a theorem by J.-M. Morvan to surfaces of constant Kähler angle, together with an application showing that the Maslov class of a compact self-shrinker surface with constant Kähler angle is generally non-vanishing. Secondly, we obtain two pinching results for the Kähler angle which imply rigidity theorems of self-shrinkers with Kähler angle under the condition that $\int_M |h|^2e^{-\frac{|x|^2}{2}}dV_M<\infty$, where $h$ and $x$ denote, respectively, the second fundamental form and the position vector of the surface.

preprint2015arXiv

Spontaneous symmetry breaking and quantum Hall valley ordering on the surface of topological hexaborides

A number of strongly correlated heavy fermion compounds, such as samarium (Sm), ytterbium (Yb), plutonium (Pu) hexaboride, are predicted to become topological insulators at low temperatures. These systems support massless Dirac fermions near certain (three) points of the surface Brillouin zone, hereafter referred to as the valleys. In strong perpendicular magnetic fields, the conical Dirac dispersions of these surface states quench onto three sets of Landau levels and we predict various possible hierarchies of incompressible quantum Hall states on the surface of hexaborides. In addition, we address the effects of strong electron-electron interaction within the surface zeroth Landau levels. Specifically, we show that depending on the relative strength of the long-range (Coulomb-type) and the finite-range (Hubbard-type) interactions the ground state can display either a valley-polarized or a valley-coherent distribution of electronic density. We also show that the transition between two valley-polarized states is always discontinuous, while that between a valley-polarized and a valley-coherent phase is continuous. The Zeeman splitting and/or an applied uniaxial strain on the surface can drive the system through various quantum phase transitions and place it in different broken-symmetry phases. Application of uniaxial strain is also shown to considerably modify the precise sequence of quantum Hall states. We also highlight the role of topology in determining the broken symmetry phases, disorder on the surface of topological hexaborides in strong magnetic fields.

preprint2015arXiv

SPRIGHT: A Fast and Robust Framework for Sparse Walsh-Hadamard Transform

We consider the problem of computing the Walsh-Hadamard Transform (WHT) of some $N$-length input vector in the presence of noise, where the $N$-point Walsh spectrum is $K$-sparse with $K = {O}(N^δ)$ scaling sub-linearly in the input dimension $N$ for some $0<δ<1$. Over the past decade, there has been a resurgence in research related to the computation of Discrete Fourier Transform (DFT) for some length-$N$ input signal that has a $K$-sparse Fourier spectrum. In particular, through a sparse-graph code design, our earlier work on the Fast Fourier Aliasing-based Sparse Transform (FFAST) algorithm computes the $K$-sparse DFT in time ${O}(K\log K)$ by taking ${O}(K)$ noiseless samples. Inspired by the coding-theoretic design framework, Scheibler et al. proposed the Sparse Fast Hadamard Transform (SparseFHT) algorithm that elegantly computes the $K$-sparse WHT in the absence of noise using ${O}(K\log N)$ samples in time ${O}(K\log^2 N)$. However, the SparseFHT algorithm explicitly exploits the noiseless nature of the problem, and is not equipped to deal with scenarios where the observations are corrupted by noise. Therefore, a question of critical interest is whether this coding-theoretic framework can be made robust to noise. Further, if the answer is yes, what is the extra price that needs to be paid for being robust to noise? In this paper, we show, quite interestingly, that there is {\it no extra price} that needs to be paid for being robust to noise other than a constant factor. In other words, we can maintain the same sample complexity ${O}(K\log N)$ and the computational complexity ${O}(K\log^2 N)$ as those of the noiseless case, using our SParse Robust Iterative Graph-based Hadamard Transform (SPRIGHT) algorithm.

preprint2015arXiv

SU(3) Quantum Hall Ferromagnetism in SnTe

The (111) surface of SnTe hosts one isotropic $\barΓ$-centered and three degenerate anisotropic $\bar{M}$- centered Dirac surface states. We predict that a nematic phase with spontaneously broken $C_3$ symmetry will occur in the presence of an external magnetic field when the $N=0$ $\bar{M}$ Landau levels are $1/3$ or $2/3$ filled. The nematic state phase boundary is controlled by a competition between intravalley Coulomb interactions that favor a valley-polarized state, and weaker intervalley scattering processes that increase in relative strength with magnetic field. An in-plane Zeeman field alters the phase diagram by lifting the three-fold $\bar{M}$ Landau level degeneracy, yielding a ground state energy with $2π/3$ periodicity as a function of Zeeman-field orientation angle.

preprint2015arXiv

Two-Dimensional Transition Metal Dichalcogenides with a Hexagonal Lattice: Room Temperature Quantum Spin Hall Insulators

So far, several transition metal dichalcogenides (TMDCs) based two-dimensional (2D) topological insulators (TIs) have been discovered, all of them based on a tetragonal lattice. However, in 2D crystals, the hexagonal rather than the tetragonal symmetry is the most common motif. Here, based on first-principles calculations, we propose a new class of stable 2D TMDCs of composition MX2 (M=Mo, W, X=S, Se, Te) with a hexagonal lattice. They are all in the same stability range as other 2D TMDC allotropes that have been demonstrated experimentally, and they are identified to be practical 2D TIs with large band gaps ranging from 41 to 198 meV, making them suitable for applications at room-temperature. Besides, in contrast to tetragonal 2D TMDs, their hexagonal lattice will greatly facilitate the integration of theses novel TI states van-der-Waals crystals with other hexagonal or honeycomb materials, and thus provide a route for 2D-material-based devices for wider nanoelectronic and spintronic applications. The nontrivial band gaps of both WSe2 and WTe2 2D crystals are 198 meV, which are larger than that in any previously reported TMDC-based TIs. These large band gaps entirely stem from the strong spin-orbit coupling strength within the d orbitals of Mo/W atoms near the Fermi level. Our findings will significantly broaden the scientific and technological impact of both 2D TIs and TMDCs.

preprint2014arXiv

Spontaneous Layer-Pseudospin Domain Walls in Bilayer Graphene

Bilayer graphene is susceptible to a family of unusual broken symmetry states with spin and valley dependent layer polarization. We report on a microscopic study of the domain walls in these systems, demonstrating that they have interesting microscopic structures related to order-induced topological characters. We use our results to estimate Ginzburg-Landau model parameters and transition temperatures for the ordered states of bilayer graphene.

preprint2014arXiv

The edge engineering of topological Bi(111) bilayer

A topological insulator is a novel quantum state, characterized by symmetry-protected non-trivial edge/surface states. Our first-principle simulations show the significant effects of the chemical decoration on edge states of topological Bi(111) bilayer nanoribbon, which remove the trivial edge state and recover the Dirac linear dispersion of topological edge state. By comparing the edge states with and without chemical decoration, the Bi(111) bilayer nanoribbon offers a simple system for assessing conductance fluctuation of edge states. The chemical decoration can also modify the penetration depth and the spin texture of edge states. A low-energy effective model is proposed to explain the distinctive spin texture of Bi(111) bilayer nanoribbon, which breaks the spin-momentum orthogonality along the armchair edge.

preprint2014arXiv

Valley Contrasting Magnetoluminescence in Monolayer MoS$_{2}$ Quantum Hall Systems

The valley dependent optical selection rules in recently discovered monolayer group-VI transition metal dichalcogenides (TMDs) make possible optical control of valley polarization, a crucial step towards valleytronic applications. However, in presence of Landaul level(LL) quantization such selection rules are taken over by selection rules between the LLs, which are not necessarily valley contrasting. Using MoS$_{2}$ as an example we show that the spatial inversion-symmetry breaking results in unusual valley dependent inter-LL selection rules, which directly locks polarization to valley. We find a systematic valley splitting for all Landau levels (LLs) in the quantum Hall regime, whose magnitude is linearly proportional to the magnetic field and in comparable with the LL spacing. Consequently, unique plateau structures are found in the optical Hall conductivity, which can be measured by the magneto-optical Faraday rotations.

preprint2013arXiv

A Framework for Phasor Measurement Placement in Hybrid State Estimation via Gauss-Newton

In this paper, we study the placement of Phasor Measurement Units (PMU) for enhancing hybrid state estimation via the traditional Gauss-Newton method, which uses measurements from both PMU devices and Supervisory Control and Data Acquisition (SCADA) systems. To compare the impact of PMU placements, we introduce a useful metric which accounts for three important requirements in power system state estimation: {\it convergence}, {\it observability} and {\it performance} (COP). Our COP metric can be used to evaluate the estimation performance and numerical stability of the state estimator, which is later used to optimize the PMU locations. In particular, we cast the optimal placement problem in a unified formulation as a semi-definite program (SDP) with integer variables and constraints that guarantee observability in case of measurements loss. Last but not least, we propose a relaxation scheme of the original integer-constrained SDP with randomization techniques, which closely approximates the optimum deployment. Simulations of the IEEE-30 and 118 systems corroborate our analysis, showing that the proposed scheme improves the convergence of the state estimator, while maintaining optimal asymptotic performance.

preprint2013arXiv

Compressive Link Acquisition in Multiuser Communications

An important receiver operation is to detect the presence specific preamble signals with unknown delays in the presence of scattering, Doppler effects and carrier offsets. This task, referred to as "link acquisition", is typically a sequential search over the transmitted signal space. Recently, many authors have suggested applying sparse recovery algorithms in the context of similar estimation or detection problems. These works typically focus on the benefits of sparse recovery, but not generally on the cost brought by compressive sensing. Thus, our goal is to examine the trade-off in complexity and performance that is possible when using sparse recovery. To do so, we propose a sequential sparsity-aware compressive sampling (C-SA) acquisition scheme, where a compressive multi-channel sampling (CMS) front-end is followed by a sparsity regularized likelihood ratio test (SR-LRT) module. The proposed C-SA acquisition scheme borrows insights from the models studied in the context of sub-Nyquist sampling, where a minimal amount of samples is captured to reconstruct signals with Finite Rate of Innovation (FRI). In particular, we propose an A/D conversion front-end that maximizes a well-known probability divergence measure, the average Kullback-Leibler distance, of all the hypotheses of the SR-LRT performed on the samples. We compare the proposed acquisition scheme vis-à-vis conventional alternatives with relatively low computational cost, such as the Matched Filter (MF), in terms of performance and complexity.

preprint2013arXiv

Convergence and Applications of a Gossip-based Gauss-Newton Algorithm

The Gauss-Newton algorithm is a popular and efficient centralized method for solving non-linear least squares problems. In this paper, we propose a multi-agent distributed version of this algorithm, named Gossip-based Gauss-Newton (GGN) algorithm, which can be applied in general problems with non-convex objectives. Furthermore, we analyze and present sufficient conditions for its convergence and show numerically that the GGN algorithm achieves performance comparable to the centralized algorithm, with graceful degradation in case of network failures. More importantly, the GGN algorithm provides significant performance gains compared to other distributed first order methods.

preprint2013arXiv

Designer Topological Insulators in Superlattices

Gapless Dirac surface states are protected at the interface of topological and normal band insulators. In a binary superlattice bearing such interfaces, we establish that valley-dependent dimerization of symmetry-unrelated Dirac surface states can be exploited to induce topological quantum phase transitions. This mechanism leads to a rich phase diagram that allows us to design strong, weak, and crystalline topological insulators. Our ab initio simulations further demonstrate this mechanism in [111] and [110] superlattices of calcium and tin tellurides.

preprint2013arXiv

Emergent topological and half semimetallic Dirac Fermions at oxide interfaces

It is highly desirable to combine recent advances in the topological quantum phases with technologically relevant materials. Chromium dioxide (CrO2) is a half-metallic material, widely used in high-end data storage applications. Using first principles calculations, we show via interfacial orbital design that a novel class of half semi-metallic Dirac electronic phase emerges at the interface CrO2 with TiO2 in both thin film and superlattice configurations, with four spin-polarized Dirac points in momentum-space (k-space) band structure. When the spin and orbital degrees of freedom are allowed to couple, the CrO2/TiO2 superlattice becomes a Chern insulator without external fields or additional doping. With topological gaps equivalent to 43 Kelvin and a Chern number 2, the ensuing quantization of Hall conductance to 2e^2/h will enable potential development of these highly industrialized oxides for applications in topologically high fidelity data storage and energy-efficient electronic and spintronic devices.

preprint2013arXiv

Magnetic control of the valley degree of freedom of massive Dirac fermions with application to transition metal dichalcogenides

We study the valley-dependent magnetic and transport properties of massive Dirac fermions in multivalley systems such as the transition metal dichalcogenides. The asymmetry of the zeroth Landau level between valleys and the enhanced magnetic susceptibility can be attributed to the different orbital magnetic moment tied with each valley. This allows the valley polarization to be controlled by tuning the external magnetic field and the doping level. As a result of this magnetic field induced valley polarization, there exists an extra contribution to the ordinary Hall effect. All these effects can be captured by a low energy effective theory with a valley-orbit coupling term.

preprint2013arXiv

Robust Decentralized State Estimation and Tracking for Power Systems via Network Gossiping

This paper proposes a fully decentralized adaptive re-weighted state estimation (DARSE) scheme for power systems via network gossiping. The enabling technique is the proposed Gossip-based Gauss-Newton (GGN) algorithm, which allows to harness the computation capability of each area (i.e. a database server that accrues data from local sensors) to collaboratively solve for an accurate global state. The DARSE scheme mitigates the influence of bad data by updating their error variances online and re-weighting their contributions adaptively for state estimation. Thus, the global state can be estimated and tracked robustly using near-neighbor communications in each area. Compared to other distributed state estimation techniques, our communication model is flexible with respect to reconfigurations and resilient to random failures as long as the communication network is connected. Furthermore, we prove that the Jacobian of the power flow equations satisfies the Lipschitz condition that is essential for the GGN algorithm to converge to the desired solution. Simulations of the IEEE-118 system show that the DARSE scheme can estimate and track online the global power system state accurately, and degrades gracefully when there are random failures and bad data.

preprint2013arXiv

Valley Carrier Dynamics in Monolayer Molybdenum Disulphide from Helicity Resolved Ultrafast Pump-probe Spectroscopy

We investigate the valley related carrier dynamics in monolayer MoS2 using helicity resolved non-degenerate ultrafast pump-probe spectroscopy at the vicinity of the high-symmetry K point under the temperature down to 78 K. Monolayer MoS2 shows remarkable transient reflection signals, in stark contrast to bilayer and bulk MoS2 due to the enhancement of many-body effect at reduced dimensionality. The helicity resolved ultrafast time-resolved result shows that the valley polarization is preserved for only several ps before scattering process makes it undistinguishable. We suggest that the dynamical degradation of valley polarization is attributable primarily to the exciton trapping by defect states in the exfoliated MoS2 samples. Our experiment and a tight-binding model analysis also show that the perfect valley CD selectivity is fairly robust against disorder at the K point, but quickly decays from the high-symmetry point in the momentum space in the presence of disorder.

preprint2013arXiv

Zeeman Field-Tuned Transitions for Surface Chern Insulators

Mirror symmetric surfaces of a topological crystalline insulator host even number of Dirac surface states. A surface Zeeman field generically gaps these states leading to a quantized anomalous Hall effect. Varying the direction of Zeeman field induces transitions between different surface insulating states with any two Chern numbers between -4 and 4. In the crystal frame the phase boundaries occur for field orientations which are great circles with (111)-like normals on a sphere.

preprint2012arXiv

3D Projection Sideband Cooling

We demonstrate 3D microwave projection sideband cooling of trapped, neutral atoms. The technique employs state-dependent potentials that enable microwave photons to drive vibration-number reducing transitions. The particular cooling sequence we employ uses minimal spontaneous emission, and works even for relatively weakly bound atoms. We cool 76% of atoms to their 3D vibrational ground states in a site-resolvable 3D optical lattice.

preprint2012arXiv

Coupling the valley degree of freedom to antiferromagnetic order

Conventional electronics are based invariably on the intrinsic degrees of freedom of an electron, namely, its charge and spin. The exploration of novel electronic degrees of freedom has important implications in both basic quantum physics and advanced information technology. Valley as a new electronic degree of freedom has received considerable attention in recent years. In this paper, we develop the theory of spin and valley physics of an antiferromagnetic honeycomb lattice. We show that by coupling the valley degree of freedom to antiferromagnetic order, there is an emergent electronic degree of freedom characterized by the product of spin and valley indices, which leads to spin-valley dependent optical selection rule and Berry curvature-induced topological quantum transport. These properties will enable optical polarization in the spin-valley space, and electrical detection/manipulation through the induced spin, valley and charge fluxes. The domain walls of an antiferromagnetic honeycomb lattice harbors valley-protected edge states that support spin-dependent transport. Finally, we employ first principles calculations to show that the proposed optoelectronic properties can be realized in antiferromagnetic manganese chalcogenophosphates (MnPX_3, X = S, Se) in monolayer form.

preprint2012arXiv

Microscopic theory of quantum anomalous Hall effect in graphene

We present a microscopic theory to give a physical picture of the formation of quantum anomalous Hall (QAH) effect in graphene due to a joint effect of Rashba spin-orbit coupling $λ_R$ and exchange field $M$. Based on a continuum model at valley $K$ or $K'$, we show that there exist two distinct physical origins of QAH effect at two different limits. For $M/λ_R\gg1$, the quantization of Hall conductance in the absence of Landau-level quantization can be regarded as a summation of the topological charges carried by Skyrmions from real spin textures and Merons from \emph{AB} sublattice pseudo-spin textures; while for $λ_R/M\gg1$, the four-band low-energy model Hamiltonian is reduced to a two-band extended Haldane's model, giving rise to a nonzero Chern number $\mathcal{C}=1$ at either $K$ or $K'$. In the presence of staggered \emph{AB} sublattice potential $U$, a topological phase transition occurs at $U=M$ from a QAH phase to a quantum valley-Hall phase. We further find that the band gap responses at $K$ and $K'$ are different when $λ_R$, $M$, and $U$ are simultaneously considered. We also show that the QAH phase is robust against weak intrinsic spin-orbit coupling $λ_{SO}$, and it transitions a trivial phase when $λ_{SO}>(\sqrt{M^2+λ^2_R}+M)/2$. Moreover, we use a tight-binding model to reproduce the ab-initio method obtained band structures through doping magnetic atoms on $3\times3$ and $4\times4$ supercells of graphene, and explain the physical mechanisms of opening a nontrivial bulk gap to realize the QAH effect in different supercells of graphene.

preprint2012arXiv

Topological phases in gated bilayer graphene: Effects of Rashba spin-orbit coupling and exchange field

We present a systematic study on the influence of Rashba spin-orbit coupling, interlayer potential difference and exchange field on the topological properties of bilayer graphene. In the presence of only Rashba spin-orbit coupling and interlayer potential difference, the band gap opening due to broken out-of-plane inversion symmetry offers new possibilities of realizing tunable topological phase transitions by varying an external gate voltage. We find a two-dimensional $Z_2$ topological insulator phase and a quantum valley Hall phase in $AB$-stacked bilayer graphene and obtain their effective low-energy Hamiltonians near the Dirac points. For $AA$ stacking, we do not find any topological insulator phase in the presence of large Rashba spin-orbit coupling. When the exchange field is also turned on, the bilayer system exhibits a rich variety of topological phases including a quantum anomalous Hall phase, and we obtain the phase diagram as a function of the Rashba spin-orbit coupling, interlayer potential difference, and exchange field.

preprint2012arXiv

Unbalanced edge modes and topological phase transition in gated trilayer graphene

Gapless edge modes hosted by chirally-stacked trilayer graphene display unique features when a bulk gap is opened by applying an interlayer potential difference. We show that trilayer graphene with half-integer valley Hall conductivity leads to unbalanced edge modes at opposite zigzag boundaries, resulting in a natural valley current polarizer. This unusual characteristic is preserved in the presence of Rashba spin-orbit coupling that turns a gated trilayer graphene into a ${Z}_2$ topological insulator with an odd number of helical edge mode pairs.

preprint2012arXiv

Unconventional Quantum Hall Effect and Tunable Spin Hall Effect in MoS2 Trilayers

We analyze the Landau level (LL) structure and spin Hall effect in a MoS2 trilayer. Due to orbital asymmetry, the low-energy Dirac fermions become heavily massive and the LL energies grow linearly with $B$, rather than with $\sqrt{B}$. Spin-orbital couplings break spin and valley degenerate LL's into two time reversal invariant groups, with LL crossing effects present in the valence bands. We find a field-dependent unconventional Hall plateau sequence $ν=...$ $-2M-6$, $-2M-4$, $-2M-2$, $-2M-1$, ..., -5, -3, -1, 0, 2, 4 .... In a p-n junction, spin-resolved fractionally quantized conductance appears in two-terminal measurements with a controllable spin-polarized current that can be probed at the interface. We also show the tunability of zero-field spin Hall conductivity.

preprint2011arXiv

Brownian motion in superfluid $^4$He

We propose to study the Brownian motion of a classical microsphere submerged in superfluid $^4$He using the recent laser technology as a direct investigation of the thermal fluctuations of quasiparticles in the quantum fluid. By calculating the temperature dependence of both the friction coefficient and the strength of the random force, we show that the resonant mode of the fluctuational motion can be fully resolved by the present technology. Contrary to the previous work, it is found that the roton contribution is not negligible, and it even becomes dominant when the temperature is above 0.76\,K.

preprint2011arXiv

GPS Signal Acquisition via Compressive Multichannel Sampling

In this paper, we propose an efficient acquisition scheme for GPS receivers. It is shown that GPS signals can be effectively sampled and detected using a bank of randomized correlators with much fewer chip-matched filters than those used in existing GPS signal acquisition algorithms. The latter use correlations with all possible shifted replicas of the satellite-specific C/A code and an exhaustive search for peaking signals over the delay-Doppler space. Our scheme is based on the recently proposed analog compressed sensing framework, and consists of a multichannel sampling structure with far fewer correlators. The compressive multichannel sampler outputs are linear combinations of a vector whose support tends to be sparse; by detecting its support one can identify the strongest satellite signals in the field of view and pinpoint the correct code-phase and Doppler shifts for finer resolution during tracking. The analysis in this paper demonstrates that GPS signals can be detected and acquired via the proposed structure at a lower cost in terms of number of correlations that need to be computed in the coarse acquisition phase, which in current GPS technology scales like the product of the number of all possible delays and Doppler shifts. In contrast, the required number of correlators in our compressive multichannel scheme scales as the number of satellites in the field of view of the device times the logarithm of number of delay-Doppler bins explored, as is typical for compressed sensing methods.

preprint2010arXiv

Chemical Doping and Enhanced Solar Energy Conversion of Graphene/Silicon Junctions

The effect of chemical doping of graphene films on the photovoltaic properties of the graphene/silicon Schottky junction solar cells was investigated. Thionyl chloride modification greatly enhanced the conductivity of graphene film, resulting in a significant improvement in cell performance with a 3-fold increase in conversion efficiency (up to 3.9%) and good short-term stability.

preprint2010arXiv

Photon generation by laser-Compton scattering at the KEK-ATF

We performed a photon generation experiment by laser-Compton scattering at the KEK-ATF, aiming to develop a Compton based polarized positron source for linear colliders. In the experiment, laser pulses with a 357 MHz repetition rate were accumulated and their power was enhanced by up to 250 times in the Fabry-Perot optical resonant cavity. We succeeded in synchronizing the laser pulses and colliding them with the 1.3 GeV electron beam in the ATF ring while maintaining the laser pulse accumulation in the cavity. As a result, we observed 26.0 +/- 0.1 photons per electron-laser pulse crossing, which corresponds to a yield of 10^8 photons in a second.

preprint2009arXiv

Statistical Eigenmode Transmission over Jointly-Correlated MIMO Channels

We investigate MIMO eigenmode transmission using statistical channel state information at the transmitter. We consider a general jointly-correlated MIMO channel model, which does not require separable spatial correlations at the transmitter and receiver. For this model, we first derive a closed-form tight upper bound for the ergodic capacity, which reveals a simple and interesting relationship in terms of the matrix permanent of the eigenmode channel coupling matrix and embraces many existing results in the literature as special cases. Based on this closed-form and tractable upper bound expression, we then employ convex optimization techniques to develop low-complexity power allocation solutions involving only the channel statistics. Necessary and sufficient optimality conditions are derived, from which we develop an iterative water-filling algorithm with guaranteed convergence. Simulations demonstrate the tightness of the capacity upper bound and the near-optimal performance of the proposed low-complexity transmitter optimization approach.