Search arXiv⌕ Search

arXiv subjects

Yi Liu

Publications and source records attributed to Yi Liu.

At least 649 records · Page 36Linked to original sources
arXiv2021

Coexistence of Ferroelectric-like Polarization and Dirac-like Surface State in TaNiTe5

By combining angle-resolved photoemission spectroscopy (ARPES), scanning tunneling microscopy (STM), piezoresponse force microscopy (PFM) and first-principles calculations, we have studied the low-energy band structure, atomic structure and charge polarization on the surface of a topological semimetal candidate TaNiTe5. Dirac-like surface states were observed on the (010) surface by ARPES, consistent with the first-principles calculations. On the other hand, PFM reveals a switchable ferroelectric-like polarization on the same surface. We propose that the noncentrosymmetric surface reconstruction observed by STM could be the origin of the observed ferroelectric-like state in this novel material. Our findings provide a new platform with the coexistence of ferroelectric-like surface charge distribution and novel surface states.

cond-mat.mtrl-sci↗
arXiv2021

Machine Learning Regression based Single Event Transient Modeling Method for Circuit-Level Simulation

In this paper, a novel machine learning regression based single event transient (SET) modeling method is proposed. The proposed method can obtain a reasonable and accurate model without considering the complex physical mechanism. We got plenty of SET current data of SMIC 130nm bulk CMOS by TCAD simulation under different conditions (e.g. different LET and different drain bias voltage). A multilayer feedfordward neural network is used to build the SET pulse current model by learning the data from TCAD simulation. The proposed model is validated with the simulation results from TCAD simulation. The trained SET pulse current model is implemented as a Verilog-A current source in the Cadence Spectre circuit simulator and an inverter with five fan-outs is used to show the practicability and reasonableness of the proposed SET pulse current model for circuit-level single-event effect (SEE) simulation.

cs.LG↗
arXiv2021

On Conditional $α$-Information and its Application to Side-Channel Analysis

A conditional version of Sibson's $α$-information is defined using a simple closed-form "log-expectation" expression, which satisfies important properties such as consistency, uniform expansion, and data processing inequalities. This definition is compared to previous ones, which in contrast do not satisfy all of these properties. Based on our proposal and on a generalized Fano inequality, we extend the case $α= 1$ of previous works to obtain sharp universal upper bounds for the probability of success of any type side-channel attack, particularly when $α= 2$.

cs.IT↗
arXiv2021

A strange metal in a bosonic system

Fermi liquid theory forms the basis for our understanding of the majority of metals, which is manifested in the description of transport properties that the electrical resistivity goes as temperature squared in the limit of zero temperature. However, the observations of strange metal states in various quantum materials, notably high-temperature superconductors, bring this spectacularly successful theoretical framework into crisis. When electron scattering rate 1/τ hits its limit, kBT/{\hbar} where {\hbar} is the reduced Planck's constant, T represents absolute temperature and kB denotes Boltzmann's constant, Planckian dissipation occurs and lends strange metals a surprising link to black holes, gravity, and quantum information theory. Here, we show the characteristic signature of strange metallicity arising unprecedentedly in a bosonic system. Our nanopatterned YBa2Cu3O7-δ(YBCO) film arrays reveal T-linear resistance as well as B-linear magnetoresistance over an extended temperature and magnetic field range in a quantum critical region in the phase diagram. Moreover, the slope of the T-linear resistance α_cp appears bounded by α_cp {\approx} h/2e^2 [1/T]_c^onset where T_c^onset is the temperature at which Cooper pairs form, intimating a common scale-invariant transport mechanism corresponding to Planckian dissipation.In contrast to fermionic systems where the temperature and magnetic field dependent scattering rates combine in quadrature of {\hbar}/τ {\approx} {\sqrt} (((k_B T)^2+(μ_B B)^2)), both terms linearly combine in the present bosonic system, i.e. {\hbar}/τ {\approx} (k_B T+[γμ]_B B), where γ is a constant. By extending the reach of strange metal phenomenology to a bosonic system, our results suggest that there is a fundamental principle governing their transport which transcends particle statistics.

cond-mat.supr-con↗
arXiv2021

Bulk High-Entropy Hexaborides

For the first time, a group of CaB6-typed cubic rare earth high-entropy hexaborides have been successfully fabricated into dense bulk pellets (>98.5% in relative densities). The specimens are prepared from elemental precursors via in-situ metal-boron reactive spark plasma sintering. The sintered bulk pellets are determined to be single-phase without any detectable oxides or other secondary phases. The homogenous elemental distributions have been confirmed at both microscale and nanoscale. The Vickers microhardness are measured to be 16-18 GPa at a standard indentation load of 9.8 N. The nanoindentation hardness and Young's moduli have been measured to be 19-22 GPa and 190-250 GPa, respectively, by nanoindentation test using a maximum load of 500 mN. The material work functions are determined to be 3.7-4.0 eV by ultraviolet photoelectron spectroscopy characterizations, which are significantly higher than that of LaB6.

cond-mat.mtrl-sci↗
arXiv2021

Real-Time Trajectory Planning for AGV in the Presence of Moving Obstacles: A First-Search-Then-Optimization Approach

This paper focuses on automatic guided vehicle (AGV) trajectory planning in the presence of moving obstacles with known but complicated trajectories. In order to achieve good solution precision, optimality and unification, the concerned task should be formulated as an optimal control problem, and then discretized into a nonlinear programming (NLP) problem, which is numerically optimized thereafter. Without a near-feasible or near-optimal initial guess, the NLP-solving process is usually slow. With the purpose of accelerating the NLP solution, a search-based rough planning stage is added to generate appropriate initial guesses. Concretely, a continuous state space is formulated, which consists of Cartesian product of 2D configuration space and a time dimension. The rough trajectory is generated by a graph-search based planner, namely the A* algorithm. Herein, the nodes in the graph are constructed by discretizing the aforementioned continuous spatio-temporal space. Through this first-search-then-optimization framework, optimal solutions to unified trajectory planning problems can be obtained fast. Simulations have been conducted to verify the real-time performance of our proposal.

cs.RO↗
arXiv2021

Anisotropic transport and de Haas$-$van Alphen oscillations in quasi-one-dimensional TaPtTe$_5$

Because of the unique physical properties and potential applications, the exploration of quantum materials with diverse symmetry-protected topological states has attracted considerable interest in the condensed-matter community in recent years. Most of the topologically nontirvial materials identified thus far have two-dimensional or three-dimensional structural characteristics, while the quasi-one-dimensional (quasi-1D) analogs are rare. Here we report on anisotropic magnetoresistance, Hall effect, and quantum de Haas$-$van Alphen (dHvA) oscillations in TaPtTe$_5$ single crystals, which possess a layered crystal structure with quasi-1D PtTe$_2$ chains. TaPtTe$_5$ manifests an anisotropic magnetoresistance and a nonlinear Hall effect at low temperatures. The analysis of the dHvA oscillations reveals two major oscillation frequencies (63.5 T and 95.2 T). The corresponding light effective masses and the nonzero Berry phases suggest the nontrivial band topology in TaPtTe$_5$, which is further corroborated by the first-principles calculations. Our results suggest that TaPtTe$_5$, in analogy with its sister compounds TaPdTe$_5$ and TaNiTe$_5$, is another quasi-1D material hosting topological Dirac fermions.

cond-mat.str-el↗
arXiv2021

Accelerating Sparse Approximate Matrix Multiplication on GPUs

Although the matrix multiplication plays a vital role in computational linear algebra, there are few efficient solutions for matrix multiplication of the near-sparse matrices. The Sparse Approximate Matrix Multiply (SpAMM) is one of the algorithms to fill the performance gap neglected by traditional optimizations for dense/sparse matrix multiplication. However, existing SpAMM algorithms fail to exploit the performance potential of GPUs for acceleration. In this paper, we present cuSpAMM, the first parallel SpAMM algorithm optimized for multiple GPUs. Several performance optimizations have been proposed, including algorithm re-design to adapt to the thread parallelism, blocking strategies for memory access optimization, and the acceleration with the tensor core. In addition, we scale cuSpAMM to run on multiple GPUs with an effective load balance scheme. We evaluate cuSpAMM on both synthesized and real-world datasets on multiple GPUs. The experiment results show that cuSpAMM achieves significant performance speedup compared to vendor optimized cuBLAS and cuSPARSE libraries.

cs.PF↗
arXiv2021

Sent2Matrix: Folding Character Sequences in Serpentine Manifolds for Two-Dimensional Sentence

We study text representation methods using deep models. Current methods, such as word-level embedding and character-level embedding schemes, treat texts as either a sequence of atomic words or a sequence of characters. These methods either ignore word morphologies or word boundaries. To overcome these limitations, we propose to convert texts into 2-D representations and develop the Sent2Matrix method. Our method allows for the explicit incorporation of both word morphologies and boundaries. When coupled with a novel serpentine padding method, our Sent2Matrix method leads to an interesting visualization in which 1-D character sequences are folded into 2-D serpentine manifolds. Notably, our method is the first attempt to represent texts in 2-D formats. Experimental results on text classification tasks shown that our method consistently outperforms prior embedding methods.

cs.CL↗
arXiv2021

Automatic Web Testing using Curiosity-Driven Reinforcement Learning

Web testing has long been recognized as a notoriously difficult task. Even nowadays, web testing still heavily relies on manual efforts while automated web testing is far from achieving human-level performance. Key challenges in web testing include dynamic content update and deep bugs hiding under complicated user interactions and specific input values, which can only be triggered by certain action sequences in the huge search space. In this paper, we propose WebExplor, an automatic end-to-end web testing framework, to achieve an adaptive exploration of web applications. WebExplor adopts curiosity-driven reinforcement learning to generate high-quality action sequences (test cases) satisfying temporal logical relations. Besides, WebExplor incrementally builds an automaton during the online testing process, which provides high-level guidance to further improve the testing efficiency. We have conducted comprehensive evaluations of WebExplor on six real-world projects, a commercial SaaS web application, and performed an in-the-wild study of the top 50 web applications in the world. The results demonstrate that in most cases WebExplor can achieve a significantly higher failure detection rate, code coverage, and efficiency than existing state-of-the-art web testing techniques. WebExplor also detected 12 previously unknown failures in the commercial web application, which have been confirmed and fixed by the developers. Furthermore, our in-the-wild study further uncovered 3,466 exceptions and errors.

cs.SE↗
arXiv2021

Variable Selection with ABC Bayesian Forests

Few problems in statistics are as perplexing as variable selection in the presence of very many redundant covariates. The variable selection problem is most familiar in parametric environments such as the linear model or additive variants thereof. In this work, we abandon the linear model framework, which can be quite detrimental when the covariates impact the outcome in a non-linear way, and turn to tree-based methods for variable selection. Such variable screening is traditionally done by pruning down large trees or by ranking variables based on some importance measure. Despite heavily used in practice, these ad-hoc selection rules are not yet well understood from a theoretical point of view. In this work, we devise a Bayesian tree-based probabilistic method and show that it is consistent for variable selection when the regression surface is a smooth mix of $p>n$ covariates. These results are the first model selection consistency results for Bayesian forest priors. Probabilistic assessment of variable importance is made feasible by a spike-and-slab wrapper around sum-of-trees priors. Sampling from posterior distributions over trees is inherently very difficult. As an alternative to MCMC, we propose ABC Bayesian Forests, a new ABC sampling method based on data-splitting that achieves higher ABC acceptance rate. We show that the method is robust and successful at finding variables with high marginal inclusion probabilities. Our ABC algorithm provides a new avenue towards approximating the median probability model in non-parametric setups where the marginal likelihood is intractable.

stat.ME↗
arXiv2021

Variable Selection via Thompson Sampling

Thompson sampling is a heuristic algorithm for the multi-armed bandit problem which has a long tradition in machine learning. The algorithm has a Bayesian spirit in the sense that it selects arms based on posterior samples of reward probabilities of each arm. By forging a connection between combinatorial binary bandits and spike-and-slab variable selection, we propose a stochastic optimization approach to subset selection called Thompson Variable Selection (TVS). TVS is a framework for interpretable machine learning which does not rely on the underlying model to be linear. TVS brings together Bayesian reinforcement and machine learning in order to extend the reach of Bayesian subset selection to non-parametric models and large datasets with very many predictors and/or very many observations. Depending on the choice of a reward, TVS can be deployed in offline as well as online setups with streaming data batches. Tailoring multiplay bandits to variable selection, we provide regret bounds without necessarily assuming that the arm mean rewards be unrelated. We show a very strong empirical performance on both simulated and real data. Unlike deterministic optimization methods for spike-and-slab variable selection, the stochastic nature makes TVS less prone to local convergence and thereby more robust.

cs.LG↗
arXiv2021

Principal Stratum Strategy: Potential Role in Drug Development

A randomized trial allows estimation of the causal effect of an intervention compared to a control in the overall population and in subpopulations defined by baseline characteristics. Often, however, clinical questions also arise regarding the treatment effect in subpopulations of patients, which would experience clinical or disease related events post-randomization. Events that occur after treatment initiation and potentially affect the interpretation or the existence of the measurements are called {\it intercurrent events} in the ICH E9(R1) guideline. If the intercurrent event is a consequence of treatment, randomization alone is no longer sufficient to meaningfully estimate the treatment effect. Analyses comparing the subgroups of patients without the intercurrent events for intervention and control will not estimate a causal effect. This is well known, but post-hoc analyses of this kind are commonly performed in drug development. An alternative approach is the principal stratum strategy, which classifies subjects according to their potential occurrence of an intercurrent event on both study arms. We illustrate with examples that questions formulated through principal strata occur naturally in drug development and argue that approaching these questions with the ICH E9(R1) estimand framework has the potential to lead to more transparent assumptions as well as more adequate analyses and conclusions. In addition, we provide an overview of assumptions required for estimation of effects in principal strata. Most of these assumptions are unverifiable and should hence be based on solid scientific understanding. Sensitivity analyses are needed to assess robustness of conclusions.

stat.AP↗
arXiv2021

PaddleSeg: A High-Efficient Development Toolkit for Image Segmentation

Image Segmentation plays an essential role in computer vision and image processing with various applications from medical diagnosis to autonomous car driving. A lot of segmentation algorithms have been proposed for addressing specific problems. In recent years, the success of deep learning techniques has tremendously influenced a wide range of computer vision areas, and the modern approaches of image segmentation based on deep learning are becoming prevalent. In this article, we introduce a high-efficient development toolkit for image segmentation, named PaddleSeg. The toolkit aims to help both developers and researchers in the whole process of designing segmentation models, training models, optimizing performance and inference speed, and deploying models. Currently, PaddleSeg supports around 20 popular segmentation models and more than 50 pre-trained models from real-time and high-accuracy levels. With modular components and backbone networks, users can easily build over one hundred models for different requirements. Furthermore, we provide comprehensive benchmarks and evaluations to show that these segmentation algorithms trained on our toolkit have more competitive accuracy. Also, we provide various real industrial applications and practical cases based on PaddleSeg. All codes and examples of PaddleSeg are available at https://github.com/PaddlePaddle/PaddleSeg.

cs.CV↗
arXiv2021

A Multi-Stage Attentive Transfer Learning Framework for Improving COVID-19 Diagnosis

Computed tomography (CT) imaging is a promising approach to diagnosing the COVID-19. Machine learning methods can be employed to train models from labeled CT images and predict whether a case is positive or negative. However, there exists no publicly-available and large-scale CT data to train accurate models. In this work, we propose a multi-stage attentive transfer learning framework for improving COVID-19 diagnosis. Our proposed framework consists of three stages to train accurate diagnosis models through learning knowledge from multiple source tasks and data of different domains. Importantly, we propose a novel self-supervised learning method to learn multi-scale representations for lung CT images. Our method captures semantic information from the whole lung and highlights the functionality of each lung region for better representation learning. The method is then integrated to the last stage of the proposed transfer learning framework to reuse the complex patterns learned from the same CT images. We use a base model integrating self-attention (ATTNs) and convolutional operations. Experimental results show that networks with ATTNs induce greater performance improvement through transfer learning than networks without ATTNs. This indicates attention exhibits higher transferability than convolution. Our results also show that the proposed self-supervised learning method outperforms several baseline methods.

eess.IV↗
arXiv2021

Social Media, Content Moderation, and Technology

This paper develops a theoretical model to study the economic incentives for a social media platform to moderate user-generated content. We show that a self-interested platform can use content moderation as an effective marketing tool to expand its installed user base, to increase the utility of its users, and to achieve its positioning as a moderate or extreme content platform. The optimal content moderation strategy differs for platforms with different revenue models, advertising or subscription. We also show that a platform's content moderation strategy depends on its technical sophistication. Because of imperfect technology, a platform may optimally throw away the moderate content more than the extreme content. Therefore, one cannot judge how extreme a platform is by just looking at its content moderation strategy. Furthermore, we show that a platform under advertising does not necessarily benefit from a better technology for content moderation, but one under subscription does. This means that platforms under different revenue models can have different incentives to improve their content moderation technology. Finally, we draw managerial and policy implications from our insights.

econ.GN↗
arXiv2021

An Empirical Study on Serverless Workflow Service

Along with the wide-adoption of Serverless Computing, more and more applications are developed and deployed on cloud platforms. Major cloud providers present their serverless workflow services to orchestrate serverless functions, making it possible to perform complex applications effectively. A comprehensive instruction is necessary to help developers understand the pros and cons, and make better choices among these serverless workflow services. However, the characteristics of these serverless workflow services have not been systematically analyzed. To fill the knowledge gap, we survey four mainstream serverless workflow services, investigating their characteristics and performance. Specifically, we review their official documents and compare them in terms of seven dimensions including programming model, state management, etc. Then, we compare the performance (i.e., execution time of functions, execution time of workflows, orchestration overhead of workflows) under various experimental settings considering activity complexity and data-flow complexity of workflows, as well as function complexity of serverless functions. Finally, we discuss and verify the service effectiveness for two actual workloads. Our findings could help application developers and serverless providers to improve the development efficiency and user experience.

cs.SE↗