Search NASA⌕ Search

Engineering topics

Yang, Guowei

Publications and source records attributed to Yang, Guowei.

Valence transition and termination-dependent surface states in the topological Kondo semimetal YbPtBi

Here, the Yb-terminated and Bi-terminated (111) surface electronic structure of topological Kondo semimetal YbPtBi is investigated using both density-functional-theory (DFT) -based calculations and angle-resolved photoemission spectroscopy (ARPES). The cleavage plane is found to be between Yb-layers and Bi-layers in both experiment and theory, and the broken inversion symmetry ensures the Yb-terminated surface does not mix with the Bi-terminated surface. The ARPES results at the Bi-terminated surface are similar to those reported for YPtBi or LuPtBi, and they can be well explained using DFT calculations assuming trivalent Yb atoms. In contrast, at the Yb-terminated surface, a trivalent to divalent transition and reduced hybridization with conduction electrons for the topmost Yb atoms are observed, as a result of reduced bonding with Bi-atoms. In addition, the Fermi arc features induced by the triply degenerate-points, which are missing at the Bi-terminated surface, can be identified at the Yb-terminated surface. Our study demonstrates unambiguously the reconstruction of surface electronic structure due to the valence transition of the lanthanide element in a Kondo lattice system.

36 MATERIALS SCIENCE↗

Quasiparticle characteristics of the weakly ferromagnetic Hund metal MnSi

Hund metals are multiorbital systems with 3d or 4d electrons exhibiting both an itinerant character and local moments, and they feature Kondo-like screenings of local orbital and spin moments, with suppressed coherence temperatures driven by Hund's coupling J H . They often exhibit magnetic order at low temperature, but how the interaction between the Kondo-like screening and long-range magnetic order is manifested in the quasiparticle spectrum remains an open question. Here, we present the spectroscopic signature of such an interaction in a Hund metal candidate MnSi exhibiting weak ferromagnetism. Our photoemission measurements reveal renormalized quasiparticle bands near the Fermi level with strong momentum dependence: The ferromagnetism manifests through possibly exchange-split bands (Q1) below T C , while the spin/orbital screenings lead to the gradual development of quasiparticles (Q2) upon cooling. Our results demonstrate how the characteristic spin/orbital coherence in a Hund metal could coexist and compete with the magnetic order to form a weak itinerant ferromagnet, via quasiparticle bands that are well separated in momentum space and exhibit distinct temperature dependence. Here, our results imply that the competition between the spin/orbital screening and the magnetic order in a Hund metal bears interesting similarities to the Kondo lattice systems

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Research on stability and uniformity of multi-wavelength Brillouin-erbium fiber laser based on FWM

In this paper, we experimentally and theoretically investigate the stability and uniformity of multi-wavelength Brillouin-erbium fiber laser based on four-wave mixing (FWM). Multi-wavelength generation is limited by cross-gain saturation between different wavelengths from homogeneous broadening of erbium-doped fiber. Modeling coupled-mode equation for FWM and analyzing the influence of FWM on multi-wavelength generation. 16 orders Brillouin Stokes (BS) waves with a wavelength spacing of 0.084 nm are obtained experimentally within a 3 dB bandwidth by the FWM effect in a 100 m highly nonlinear fiber (HNLF), power distribution of each laser is uniform and peak power fluctuation is less than 1.184 dB within a 10 dB bandwidth, the outputs exhibit good time stability and uniformity. Compared with the same configuration, the laser without HNLF has only 9 orders stable BS waves within 3 dB bandwidth, and high-order Stokes wave shows significant waveform jitter and power fluctuation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Feedback-Driven Dynamic Invariant Discovery

Program invariants can help software developers identify program properties that must be preserved as the software evolves, however, formulating correct invariants can be challenging. In this work, we introduce iDiscovery, a technique which leverages symbolic execution to improve the quality of dynamically discovered invariants computed by Daikon. Candidate invariants generated by Daikon are synthesized into assertions and instrumented onto the program. The instrumented code is executed symbolically to generate new test cases that are fed back to Daikon to help further re ne the set of candidate invariants. This feedback loop is executed until a x-point is reached. To mitigate the cost of symbolic execution, we present optimizations to prune the symbolic state space and to reduce the complexity of the generated path conditions. We also leverage recent advances in constraint solution reuse techniques to avoid computing results for the same constraints across iterations. Experimental results show that iDiscovery converges to a set of higher quality invariants compared to the initial set of candidate invariants in a small number of iterations.

Daikon↗

Property Differencing for Incremental Checking

This paper introduces iProperty, a novel approach that facilitates incremental checking of programs based on a property di erencing technique. Speci cally, iProperty aims to reduce the cost of checking properties as they are initially developed and as they co-evolve with the program. The key novelty of iProperty is to compute the di erences between the new and old versions of expected properties to reduce the number and size of the properties that need to be checked during the initial development of the properties. Furthermore, property di erencing is used in synergy with program behavior di erencing techniques to optimize common regression scenarios, such as detecting regression errors or checking feature additions for conformance to new expected properties. Experimental results in the context of symbolic execution of Java programs annotated with properties written as assertions show the e ectiveness of iProperty in utilizing change information to enable more ecient checking.

Yang, Guowei↗

Memoized Symbolic Execution

This paper introduces memoized symbolic execution (Memoise), a novel approach for more efficient application of forward symbolic execution, which is a well-studied technique for systematic exploration of program behaviors based on bounded execution paths. Our key insight is that application of symbolic execution often requires several successive runs of the technique on largely similar underlying problems, e.g., running it once to check a program to find a bug, fixing the bug, and running it again to check the modified program. Memoise introduces a trie-based data structure that stores the key elements of a run of symbolic execution. Maintenance of the trie during successive runs allows re-use of previously computed results of symbolic execution without the need for re-computing them as is traditionally done. Experiments using our prototype embodiment of Memoise show the benefits it holds in various standard scenarios of using symbolic execution, e.g., with iterative deepening of exploration depth, to perform regression analysis, or to enhance coverage.

Yang, Guowei↗

Directed Incremental Symbolic Execution

The last few years have seen a resurgence of interest in the use of symbolic execution -- a program analysis technique developed more than three decades ago to analyze program execution paths. Scaling symbolic execution and other path-sensitive analysis techniques to large systems remains challenging despite recent algorithmic and technological advances. An alternative to solving the problem of scalability is to reduce the scope of the analysis. One approach that is widely studied in the context of regression analysis is to analyze the differences between two related program versions. While such an approach is intuitive in theory, finding efficient and precise ways to identify program differences, and characterize their effects on how the program executes has proved challenging in practice. In this paper, we present Directed Incremental Symbolic Execution (DiSE), a novel technique for detecting and characterizing the effects of program changes. The novelty of DiSE is to combine the efficiencies of static analysis techniques to compute program difference information with the precision of symbolic execution to explore program execution paths and generate path conditions affected by the differences. DiSE is a complementary technique to other reduction or bounding techniques developed to improve symbolic execution. Furthermore, DiSE does not require analysis results to be carried forward as the software evolves -- only the source code for two related program versions is required. A case-study of our implementation of DiSE illustrates its effectiveness at detecting and characterizing the effects of program changes.

Person, Suzette↗