arXiv subjects

Yi Lu

Publications and source records attributed to Yi Lu.

At least 199 records · Page 11Linked to original sources

arXiv2020

Topotactic hydrogen in nickelate superconductors and akin infinite-layer oxides ABO2

Superconducting nickelates appear to be difficult to synthesize. Since the chemical reduction of ABO3 (A: rare earth; B transition metal) with CaH2 may result in both, ABO2 and ABO2H, we calculate the topotactic H binding energy by density functional theory (DFT). We find intercalating H is energetically favorable for LaNiO2 but not for Sr-doped NdNiO2. This has dramatic consequences for the electronic structure as determined by DFT+dynamical mean field theory: that of 3d9 LaNiO2 is similar to (doped) cuprates, 3d8 LaNiO2H is a two-orbital Mott insulator. Topotactical H might hence explain why some nickelates are superconducting and others are not.

cond-mat.str-el↗

arXiv2020

Prob2Vec: Mathematical Semantic Embedding for Problem Retrieval in Adaptive Tutoring

We propose a new application of embedding techniques for problem retrieval in adaptive tutoring. The objective is to retrieve problems whose mathematical concepts are similar. There are two challenges: First, like sentences, problems helpful to tutoring are never exactly the same in terms of the underlying concepts. Instead, good problems mix concepts in innovative ways, while still displaying continuity in their relationships. Second, it is difficult for humans to determine a similarity score that is consistent across a large enough training set. We propose a hierarchical problem embedding algorithm, called Prob2Vec, that consists of abstraction and embedding steps. Prob2Vec achieves 96.88\% accuracy on a problem similarity test, in contrast to 75\% from directly applying state-of-the-art sentence embedding methods. It is interesting that Prob2Vec is able to distinguish very fine-grained differences among problems, an ability humans need time and effort to acquire. In addition, the sub-problem of concept labeling with imbalanced training data set is interesting in its own right. It is a multi-label problem suffering from dimensionality explosion, which we propose ways to ameliorate. We propose the novel negative pre-training algorithm that dramatically reduces false negative and positive ratios for classification, using an imbalanced training data set.

cs.CY↗

arXiv2020

Graph Computing based Distributed State Estimation with PMUs

Power system state estimation plays a fundamental and critical role in the energy management system (EMS). To achieve a high performance and accurate system states estimation, a graph computing based distributed state estimation approach is proposed in this paper. Firstly, a power system network is divided into multiple areas. Reference buses are selected with PMUs being installed at these buses for each area. Then, the system network is converted into multiple independent areas. In this way, the power system state estimation could be conducted in parallel for each area and the estimated system states are obtained without compromise of accuracy. IEEE 118-bus system and MP 10790-bus system are employed to verify the results accuracy and present the promising computation performance.

cs.DC↗

arXiv2020

Polar Rectification Effect in Electro-Fatigued SrTiO3 Based Junctions

Rectifying semiconductor junctions are crucial to electronic devices. They convert alternating current into direct one by allowing unidirectional charge flows. In analogy to the current-flow rectification for itinerary electrons, here, a polar rectification that based on the localized oxygen vacancies (OVs) in a Ti/fatigued-SrTiO3 (fSTO) Schottky junction is first demonstrated. The fSTO with OVs is produced by an electro-degradation process. The different movability of localized OVs and itinerary electrons in the fSTO yield a unidirectional electric polarization at the interface of the junction under the coaction of external and built-in electric fields. Moreover, the fSTO displays a pre-ferroelectric state located between paraelectric and ferroelectric phases. The pre-ferroelectric state has three sub-states and can be easily driven into a ferroelectric state by external electric field. These observations open up opportunities for potential polar devices and may underpin many useful polar-triggered electronic phenomena.

physics.app-ph↗

arXiv2020

Graph-FCN for image semantic segmentation

Semantic segmentation with deep learning has achieved great progress in classifying the pixels in the image. However, the local location information is usually ignored in the high-level feature extraction by the deep learning, which is important for image semantic segmentation. To avoid this problem, we propose a graph model initialized by a fully convolutional network (FCN) named Graph-FCN for image semantic segmentation. Firstly, the image grid data is extended to graph structure data by a convolutional network, which transforms the semantic segmentation problem into a graph node classification problem. Then we apply graph convolutional network to solve this graph node classification problem. As far as we know, it is the first time that we apply the graph convolutional network in image semantic segmentation. Our method achieves competitive performance in mean intersection over union (mIOU) on the VOC dataset(about 1.34% improvement), compared to the original FCN model.

cs.CV↗

arXiv2019

An Exploration of Data Augmentation and Sampling Techniques for Domain-Agnostic Question Answering

To produce a domain-agnostic question answering model for the Machine Reading Question Answering (MRQA) 2019 Shared Task, we investigate the relative benefits of large pre-trained language models, various data sampling strategies, as well as query and context paraphrases generated by back-translation. We find a simple negative sampling technique to be particularly effective, even though it is typically used for datasets that include unanswerable questions, such as SQuAD 2.0. When applied in conjunction with per-domain sampling, our XLNet (Yang et al., 2019)-based submission achieved the second best Exact Match and F1 in the MRQA leaderboard competition.

cs.CL↗

arXiv2019

Causal Inference for Comprehensive Cohort Studies

In a comprehensive cohort study of two competing treatments (say, A and B), clinically eligible individuals are first asked to enroll in a randomized trial and, if they refuse, are then asked to enroll in a parallel observational study in which they can choose treatment according to their own preference. We consider estimation of two estimands: (1) comprehensive cohort causal effect -- the difference in mean potential outcomes had all patients in the comprehensive cohort received treatment A vs. treatment B and (2) randomized trial causal effect -- the difference in mean potential outcomes had all patients enrolled in the randomized trial received treatment A vs. treatment B. For each estimand, we consider inference under various sets of unconfoundedness assumptions and construct semiparametric efficient and robust estimators. These estimators depend on nuisance functions, which we estimate, for illustrative purposes, using generalized additive models. Using the theory of sample splitting, we establish the asymptotic properties of our proposed estimators. We also illustrate our methodology using data from the Bypass Angioplasty Revascularization Investigation (BARI) randomized trial and observational registry to evaluate the effect of percutaneous transluminal coronary balloon angioplasty versus coronary artery bypass grafting on 5-year mortality. To evaluate the finite sample performance of our estimators, we use the BARI dataset as the basis of a realistic simulation study.

stat.ME↗

arXiv2019

STAR: Scaling Transactions through Asymmetric Replication

In this paper, we present STAR, a new distributed in-memory database with asymmetric replication. By employing a single-node non-partitioned architecture for some replicas and a partitioned architecture for other replicas, STAR is able to efficiently run both highly partitionable workloads and workloads that involve cross-partition transactions. The key idea is a new phase-switching algorithm where the execution of single-partition and cross-partition transactions is separated. In the partitioned phase, single-partition transactions are run on multiple machines in parallel to exploit more concurrency. In the single-master phase, mastership for the entire database is switched to a single designated master node, which can execute these transactions without the use of expensive coordination protocols like two-phase commit. Because the master node has a full copy of the database, this phase-switching can be done at negligible cost. Our experiments on two popular benchmarks (YCSB and TPC-C) show that high availability via replication can coexist with fast serializable transaction execution in distributed in-memory databases, with STAR outperforming systems that employ conventional concurrency control and replication algorithms by up to one order of magnitude.

cs.DB↗

arXiv2019

Control of dopant crystallinity in electrochemically treated cuprate thin films

We present a methodology based on \textit{ex-situ} (post-growth) electrochemistry to control the oxygen concentration in thin films of the superconducting oxide La$_2$CuO$_{4+y}$ grown epitaxially on substrates of isostructural LaSrAlO$_4$. The superconducting transition temperature, which depends on the oxygen concentration, can be tuned by adjusting the pH level of the base solution used for the electrochemical reaction. As our main finding, we demonstrate that the dopant oxygens can either occupy the interstitial layer in an orientationally disordered state or organize into a crystalline phase via a mechanism in which dopant oxygens are inserted into the substrate, changing the lattice symmetry of both the substrate and the epitaxial film. We discuss this mechanism, and describe the resulting methodology as a platform to be explored in thin films of other transition metal oxides.

cond-mat.mtrl-sci↗

arXiv2019

DeepCenterline: a Multi-task Fully Convolutional Network for Centerline Extraction

A novel centerline extraction framework is reported which combines an end-to-end trainable multi-task fully convolutional network (FCN) with a minimal path extractor. The FCN simultaneously computes centerline distance maps and detects branch endpoints. The method generates single-pixel-wide centerlines with no spurious branches. It handles arbitrary tree-structured object with no prior assumption regarding depth of the tree or its bifurcation pattern. It is also robust to substantial scale changes across different parts of the target object and minor imperfections of the object's segmentation mask. To the best of our knowledge, this is the first deep-learning based centerline extraction method that guarantees single-pixel-wide centerline for a complex tree-structured object. The proposed method is validated in coronary artery centerline extraction on a dataset of 620 patients (400 of which used as test set). This application is challenging due to the large number of coronary branches, branch tortuosity, and large variations in length, thickness, shape, etc. The proposed method generates well-positioned centerlines, exhibiting lower number of missing branches and is more robust in the presence of minor imperfections of the object segmentation mask. Compared to a state-of-the-art traditional minimal path approach, our method improves patient-level success rate of centerline extraction from 54.3% to 88.8% according to independent human expert review.

cs.CV↗

arXiv2019

SCAR: Strong Consistency using Asynchronous Replication with Minimal Coordination

Data replication is crucial in modern distributed systems as a means to provide high availability. Many techniques have been proposed to utilize replicas to improve a system's performance, often requiring expensive coordination or sacrificing consistency. In this paper, we present SCAR, a new distributed and replicated in-memory database that allows serializable transactions to read from backup replicas with minimal coordination. SCAR works by assigning logical timestamps to database records so that a transaction can safely read from a backup replica without coordinating with the primary replica, because the records cannot be changed up to a certain logical time. In addition, we propose two optimization techniques, timestamp synchronization and parallel locking and validation, to further reduce coordination. We show that SCAR outperforms systems with conventional concurrency control algorithms and replication strategies by up to a factor of 2 on three popular benchmarks. We also demonstrate that SCAR achieves higher throughput by running under reduced isolation levels and detects concurrency anomalies in real time.

cs.DB↗

arXiv2019

Graph Computing based Distributed Fast Decoupled Power Flow Analysis

Power flow analysis plays a fundamental and critical role in the energy management system (EMS). It is required to well accommodate large and complex power system. To achieve a high performance and accurate power flow analysis, a graph computing based distributed power flow analysis approach is proposed in this paper. Firstly, a power system network is divided into multiple areas. Slack buses are selected for each area and, at each SCADA sampling period, the inter-area transmission line power flows are equivalently allocated as extra load injections to corresponding buses. Then, the system network is converted into multiple independent areas. In this way, the power flow analysis could be conducted in parallel for each area and the solved system states could be guaranteed without compromise of accuracy. Besides, for each area, graph computing based fast decoupled power flow (FDPF) is employed to quickly analyze system states. IEEE 118-bus system and MP 10790-bus system are employed to verify the results accuracy and present the promising computation performance of the proposed approach.

cs.DC↗

arXiv2019

Attention-driven Tree-structured Convolutional LSTM for High Dimensional Data Understanding

Modeling the sequential information of image sequences has been a vital step of various vision tasks and convolutional long short-term memory (ConvLSTM) has demonstrated its superb performance in such spatiotemporal problems. Nevertheless, the hierarchical data structures in a significant amount of tasks (e.g., human body parts and vessel/airway tree in biomedical images) cannot be properly modeled by sequential models. Thus, ConvLSTM is not suitable for tree-structured image data analysis. In order to address these limitations, we present tree-structured ConvLSTM models for tree-structured image analysis tasks which can be trained end-to-end. To demonstrate the effectiveness of the proposed tree-structured ConvLSTM model, we present a tree-structured segmentation framework which consists of a tree-structured ConvLSTM and an attention fully convolutional network (FCN) model. The proposed framework is extensively validated on four large-scale coronary artery datasets. The results demonstrate the effectiveness and efficiency of the proposed method.

cs.CV↗

arXiv2019

AlN/beta-Ga2O3 based HEMT: a potential pathway to ultimate high power device

Gallium Oxide (Ga2O3) has a huge potential on the power device for its high breakdown filed and good transport properties. beta-Ga2O3 as the thermodynamics stable phase, has been demonstrated to form high electron mobility transistor (HEMT) through delta-doping in the barrier due to its none-polar property. Following the development in III-V HEMT which turns from delta-doping-induced to polarization-induced 2DEG, an alternative method based on III-N materials/beta-Ga2O3 heterostructure is proposed that utilizing the polarization difference on the interface. Further requirements of electric field and conduction band difference show that only nitrogen (N)-polar AlN on beta-Ga2O3 can form the channel and hold large 2DEG concentration on the interface. Compared with conventional metal-polar AlN/GaN HEMT, the proposed N-polar AlN/beta-Ga2O3 HEMT show a much larger 2DEG concentration, the spontaneous-polarization-dominated electric field, better DC output performance, as well as higher breakdown voltage. This study provides a new research approach that shifting from delta-doping-induced to polarization-induced on beta-Ga2O3-based HEMT, which can also be a guideline for community excavating the application potential of Ga2O3.

physics.app-ph↗

arXiv2018

Residual Attention based Network for Hand Bone Age Assessment

Computerized automatic methods have been employed to boost the productivity as well as objectiveness of hand bone age assessment. These approaches make predictions according to the whole X-ray images, which include other objects that may introduce distractions. Instead, our framework is inspired by the clinical workflow (Tanner-Whitehouse) of hand bone age assessment, which focuses on the key components of the hand. The proposed framework is composed of two components: a Mask R-CNN subnet of pixelwise hand segmentation and a residual attention network for hand bone age assessment. The Mask R-CNN subnet segments the hands from X-ray images to avoid the distractions of other objects (e.g., X-ray tags). The hierarchical attention components of the residual attention subnet force our network to focus on the key components of the X-ray images and generate the final predictions as well as the associated visual supports, which is similar to the assessment procedure of clinicians. We evaluate the performance of the proposed pipeline on the RSNA pediatric bone age dataset and the results demonstrate its superiority over the previous methods.

cs.CV↗

arXiv2018

Exploration of Bi-Level PageRank Algorithm for Power Flow Analysis Using Graph Database

Compared with traditional relational database, graph database, GDB, is a natural expression of most real-world systems. Each node in the GDB is not only a storage unit, but also a logic operation unit to implement local computation in parallel. This paper firstly explores the feasibility of power system modeling using GDB. Then a brief introduction of the PageRank algorithm and the feasibility analysis of its application in GDB are presented. Then the proposed GDB based bilevel PageRank algorithm is developed from PageRank algorithm and Gauss Seidel methodology realize high performance parallel computation. MP 10790 case, and its extensions, MP 107900 and MP 1079000, are tested to verify the proposed method and investigate its parallelism in GDB. Besides, a provincial system, FJ case which include 1425 buses and 1922 branches, is also included in the case study to further prove the proposed algorithm effectiveness in real world.

cs.DC↗

arXiv2018

Mapping the Real Space Distributions of Galaxies in SDSS DR7: II. Measuring the growth rate, clustering amplitude of matter and biases of galaxies at redshift $0.1$

We extend the real-space mapping method developed in Shi et at. (2016) so that it can be applied to flux-limited galaxy samples. We use an ensemble of mock catalogs to demonstrate the reliability of this extension, showing that it allows for an accurate recovery of the real-space correlation functions and galaxy biases. We also demonstrate that, using an iterative method applied to intermediate-scale clustering data, we can obtain an unbiased estimate of the growth rate of structure $fσ_8$, which is related to the clustering amplitude of matter, to an accuracy of $\sim 10\%$. Applying this method to the Sloan Digital Sky Survey (SDSS) Data Release 7 (DR7), we construct a real-space galaxy catalog spanning the redshift range $0.01 \leq z \leq 0.2$, which contains 584,473 galaxies in the north Galactic cap (NGC). Using this data, we infer $\fss$ at a median redshift $z=0.1$, which is consistent with the WMAP9 cosmology at the $1σ$ level. By combining this measurement with the real-space clustering of galaxies and with galaxy-galaxy weak lensing measurements for the same sets of galaxies, we are able to break the degeneracy between $f$, $σ_8$, and $b$. From the SDSS DR7 data alone, we obtain the following cosmological constraints at redshift $z=0.1$: $f=$$0.464^{+0.040}_{-0.040}$, $σ_8=0.769^{+0.121}_{-0.089}$, and $b=1.910^{+0.234}_{-0.268}$, $1.449^{+0.194}_{-0.196}$, $1.301^{+0.170}_{-0.177}$, and $1.196^{+0.159}_{-0.161}~$ for galaxies within different absolute magnitude bins $^{0.1}{\rm M}_r-5\log h=[-23,0, -22.0], [-22,0, -21.0], [-21.0, -20.0]$ and $[-20.0, -19.0]$, respectively.

astro-ph.CO↗

arXiv2018

Full-sky ray-tracing simulation of weak lensing using ELUCID simulations: exploring galaxy intrinsic alignment and cosmic shear correlations

The intrinsic alignment of galaxies is an important systematic effect in weak-lensing surveys, which can affect the derived cosmological parameters. One direct way to distinguish different alignment models and quantify their effects on the measurement is to produce mocked weak-lensing surveys. In this work, we use full-sky ray-tracing technique to produce mock images of galaxies from the ELUCID $N$-body simulation run with the WMAP9 cosmology. In our model we assume that the shape of central elliptical galaxy follows that of the dark matter halo, and spiral galaxy follows the halo spin. Using the mocked galaxy images, a combination of galaxy intrinsic shape and the gravitational shear, we compare the predicted tomographic shear correlations to the results of KiDS and DLS. It is found that our predictions stay between the KiDS and DLS results. We rule out a model in which the satellite galaxies are radially aligned with the center galaxy, otherwise the shear-correlations on small scales are too high. Most important, we find that although the intrinsic alignment of spiral galaxies is very weak, they induce a positive correlation between the gravitational shear signal and the intrinsic galaxy orientation (GI). This is because the spiral galaxy is tangentially aligned with the nearby large-scale overdensity, contrary to the radial alignment of elliptical galaxy. Our results explain the origin of detected positive GI term from the weak-lensing surveys. We conclude that in future analysis, the GI model must include the dependence on galaxy types in more detail.

astro-ph.CO↗