Searcharxiv⌕ Search

arXiv subjects

Xu Liu

Publications and source records attributed to Xu Liu.

At least 217 records · Page 12Linked to original sources
arXiv2022

Emergent fermionic gauge theory and foliated fracton order in the Chamon model

The Chamon model is an exactly solvable spin Hamiltonian exhibiting nontrivial fracton order. In this work, we dissect two distinct aspects of the model. First, we show that it exhibits an emergent fractonic gauge theory coupled to a fermionic subsystem symmetry-protected topological state under four stacks of $\mathbb{Z}_2$ planar symmetries. Second, we show that the Chamon model hosts 4-foliated fracton order by describing an entanglement renormalization group transformation that exfoliates four separate stacks of 2D toric codes from the bulk system.

cond-mat.str-el↗
arXiv2022

Multispectral large-area X-ray imaging enabled by stacked multilayer scintillators

Conventional energy-integration black-white X-ray imaging lacks spectral information of X-ray photons. Although X-ray spectra (energy) can be distinguished by photon-counting technique typically with CdZnTe detectors, it is very challenging to be applied to large-area flat-panel X-ray imaging (FPXI). Herein, we design multi-layer stacked scintillators of different X-ray absorption capabilities and scintillation spectrums, in this scenario, the X-ray energy can be discriminated by detecting the emission spectra of each scintillator, therefore the multispectral X-ray imaging can be easily obtained by color or multispectral visible-light camera in one single shot of X-ray. To verify this idea, stacked multilayer scintillators based on several emerging metal halides were fabricated in the cost-effective and scalable solution process, and proof-of-concept multi-energy FPXI were experimentally demonstrated. The dual-energy X-ray image of a bone-muscle model clearly showed the details that were invisible in conventional energy-integration FPXI. By stacking four layers of specifically designed multilayer scintillators with appropriate thicknesses, a prototype FPXI with four energy channels was realized, proving its extendibility to multispectral or even hyperspectral X-ray imaging. This study provides a facile and effective strategy to realize energy-resolved flat-panel X-ray imaging.

physics.ins-det↗
arXiv2022

Self-probed ptychography from semiconductor high-harmonic generation

We demonstrate a method to image an object using a self-probing approach based on semiconductor high-harmonic generation. On one hand, ptychography enables high-resolution imaging from the coherent light diffracted by an object. On the other hand, high-harmonic generation from crystals is emerging as a new source of extreme-ultraviolet ultrafast coherent light. We combine these two techniques by performing ptychography measurements with nano-patterned crystals serving as the object as well as the generation medium of the harmonics. We demonstrate that this strong field in situ approach can provide structural information about the object. With the future developments of crystal high harmonics as a compact short-wavelength light source, our demonstration can be an innovative approach for nanoscale imaging of photonic and electronic devices in research and industry.

physics.optics↗
arXiv2022

Reliability Analysis of Complex Multi-State System Based on Universal Generating Function and Bayesian Network

In the complex multi-state system (MSS), reliability analysis is a significant research content, both for equipment design, manufacturing, usage and maintenance. Universal Generating Function (UGF) is an important method in the reliability analysis, which efficiently obtains the system reliability by a fast algebraic procedure. However, when structural relationships between subsystems or components are not clear or without explicit expressions, the UGF method is difficult to use or not applicable at all. Bayesian Network (BN) has a natural advantage in terms of uncertainty inference for the relationship without explicit expressions. For the number of components is extremely large, though, it has the defects of low efficiency. To overcome the respective defects of UGF and BN, a novel reliability analysis method called UGF-BN is proposed for the complex MSS. In the UGF-BN framework, the UGF method is firstly used to analyze the bottom components with a large number. Then probability distributions obtained are taken as the input of BN. Finally, the reliability of the complex MSS is modeled by the BN method. This proposed method improves the computational efficiency, especially for the MSS with the large number of bottom components. Besides, the aircraft reliability-based design optimization based on the UGF-BN method is further studied with budget constraints on mass, power, and cost. Finally, two cases are used to demonstrate and verify the proposed method.

eess.SY↗
arXiv2022

Bayesian Physics-Informed Extreme Learning Machine for Forward and Inverse PDE Problems with Noisy Data

Physics-informed extreme learning machine (PIELM) has recently received significant attention as a rapid version of physics-informed neural network (PINN) for solving partial differential equations (PDEs). The key characteristic is to fix the input layer weights with random values and use Moore-Penrose generalized inverse for the output layer weights. The framework is effective, but it easily suffers from overfitting noisy data and lacks uncertainty quantification for the solution under noise scenarios.To this end, we develop the Bayesian physics-informed extreme learning machine (BPIELM) to solve both forward and inverse linear PDE problems with noisy data in a unified framework. In our framework, a prior probability distribution is introduced in the output layer for extreme learning machine with physic laws and the Bayesian method is used to estimate the posterior of parameters. Besides, for inverse PDE problems, problem parameters considered as new output layer weights are unified in a framework with forward PDE problems. Finally, we demonstrate BPIELM considering both forward problems, including Poisson, advection, and diffusion equations, as well as inverse problems, where unknown problem parameters are estimated. The results show that, compared with PIELM, BPIELM quantifies uncertainty arising from noisy data and provides more accurate predictions. In addition, BPIELM is considerably cheaper than PINN in terms of the computational cost.

cs.LG↗
arXiv2022

Transformers Meet Visual Learning Understanding: A Comprehensive Review

Dynamic attention mechanism and global modeling ability make Transformer show strong feature learning ability. In recent years, Transformer has become comparable to CNNs methods in computer vision. This review mainly investigates the current research progress of Transformer in image and video applications, which makes a comprehensive overview of Transformer in visual learning understanding. First, the attention mechanism is reviewed, which plays an essential part in Transformer. And then, the visual Transformer model and the principle of each module are introduced. Thirdly, the existing Transformer-based models are investigated, and their performance is compared in visual learning understanding applications. Three image tasks and two video tasks of computer vision are investigated. The former mainly includes image classification, object detection, and image segmentation. The latter contains object tracking and video classification. It is significant for comparing different models' performance in various tasks on several public benchmark data sets. Finally, ten general problems are summarized, and the developing prospects of the visual Transformer are given in this review.

cs.CV↗
arXiv2022

OJXPerf: Featherlight Object Replica Detection for Java Programs

Memory bloat is an important source of inefficiency in complex production software, especially in software written in managed languages such as Java. Prior approaches to this problem have focused on identifying objects that outlive their life span. Few studies have, however, looked into whether and to what extent myriad objects of the same type are identical. A quantitative assessment of identical objects with code-level attribution can assist developers in refactoring code to eliminate object bloat, and favor reuse of existing object(s). The result is reduced memory pressure, reduced allocation and garbage collection, enhanced data locality, and reduced re-computation, all of which result in superior performance. We develop OJXPerf, a lightweight sampling-based profiler, which probabilistically identifies identical objects. OJXPerf employs hardware performance monitoring units (PMU) in conjunction with hardware debug registers to sample and compare field values of different objects of the same type allocated at the same calling context but potentially accessed at different program points. The result is a lightweight measurement, a combination of object allocation contexts and usage contexts ordered by duplication frequency. This class of duplicated objects is relatively easier to optimize. OJXPerf incurs 9% runtime and 6% memory overheads on average. We empirically show the benefit of OJXPerf by using its profiles to instruct us to optimize a number of Java programs, including well-known benchmarks and real-world applications. The results show a noticeable reduction in memory usage (up to 11%) and a significant speedup (up to 25%).

cs.PL↗
arXiv2022

Rapid Elastic Architecture Search under Specialized Classes and Resource Constraints

In many real-world applications, we often need to handle various deployment scenarios, where the resource constraint and the superclass of interest corresponding to a group of classes are dynamically specified. How to efficiently deploy deep models for diverse deployment scenarios is a new challenge. Previous NAS approaches seek to design architectures for all classes simultaneously, which may not be optimal for some individual superclasses. A straightforward solution is to search an architecture from scratch for each deployment scenario, which however is computation-intensive and impractical. To address this, we present a novel and general framework, called Elastic Architecture Search (EAS), permitting instant specializations at runtime for diverse superclasses with various resource constraints. To this end, we first propose to effectively train an over-parameterized network via a superclass dropout strategy during training. In this way, the resulting model is robust to the subsequent superclasses dropping at inference time. Based on the well-trained over-parameterized network, we then propose an efficient architecture generator to obtain promising architectures within a single forward pass. Experiments on three image classification datasets show that EAS is able to find more compact networks with better performance while remarkably being orders of magnitude faster than state-of-the-art NAS methods, e.g., outperforming OFA (once-for-all) by 1.3% on Top-1 accuracy at a budget around 361M #MAdds on ImageNet-10. More critically, EAS is able to find compact architectures within 0.1 second for 50 deployment scenarios.

cs.CV↗
arXiv2022

Experiments in Adaptive Replanning for Fast Autonomous Flight in Forests

Fast, autonomous flight in unstructured, cluttered environments such as forests is challenging because it requires the robot to compute new plans in realtime on a computationally-constrained platform. In this paper, we enable this capability with a search-based planning framework that adapts sampling density in realtime to find dynamically-feasible plans while remaining computationally tractable. A paramount challenge in search-based planning is that dense obstacles both necessitate large graphs (to guarantee completeness) and reduce the efficiency of graph search (as heuristics become less accurate). To address this, we develop a planning framework with two parts: one that maximizes planner completeness for a given graph size, and a second that dynamically maximizes graph size subject to computational constraints. This framework is enabled by motion planning graphs that are defined by a single parameter, dispersion, which quantifies the maximum trajectory cost to reach an arbitrary state from the graph. We show through real and simulated experiments how the dispersion can be adapted to different environments in realtime, allowing operation in environments with varying density. The simulated experiment demonstrates improved performance over a baseline search-based planning algorithm. We also demonstrate flight speeds of up to 2.5m/s in real-world cluttered pine forests.

cs.RO↗
arXiv2022

The OARF Benchmark Suite: Characterization and Implications for Federated Learning Systems

This paper presents and characterizes an Open Application Repository for Federated Learning (OARF), a benchmark suite for federated machine learning systems. Previously available benchmarks for federated learning have focused mainly on synthetic datasets and use a limited number of applications. OARF mimics more realistic application scenarios with publicly available data sets as different data silos in image, text and structured data. Our characterization shows that the benchmark suite is diverse in data size, distribution, feature distribution and learning task complexity. The extensive evaluations with reference implementations show the future research opportunities for important aspects of federated learning systems. We have developed reference implementations, and evaluated the important aspects of federated learning, including model accuracy, communication cost, throughput and convergence time. Through these evaluations, we discovered some interesting findings such as federated learning can effectively increase end-to-end throughput.

cs.LG↗
arXiv2022

Turbulence suppression by streamwise-varying wall rotation in pipe flow

Direct numerical simulations (DNSs) of turbulent pipe flow subjected to streamwise-varying wall rotation are performed. This control method is able to achieve drag reduction and even relaminarize the flow under certain control parameters at low Reynolds number. Two control parameters, which are velocity amplitude and wavelength, are considered. An annular boundary layer, called Spatial Stokes Layer (SSL), is formed by the wall rotation. Based on the thickness of SSL, two types of drag reduction scenarios are identified. When the thickness is low, the SSL acts as a spacer layer, obstructing the impact of fluids against the wall and hence reducing the shear stress. The flow structures in the outer layer are less affected and are stretched in streamwise direction due to the increased velocity gradient. Within the SSL, the turbulence intensity diminishes dramatically. When the thickness is large, a streamwise wavy pattern of near-wall low-speed streaks is formed. The orientation of streaks is found to lag behind the direction of local mean velocity in phase and conform to the direction of local resultant shear stress. The streamwise scale of near-wall flow structures is significantly reduced, resulting in the disruption of downstream development of flow structures and hence leading to the drag reduction. Besides, it is found that it requires both large enough thickness of SSL and velocity amplitude to relaminarize the turbulence. The relaminarization mechanism is that the annular SSL can continuously absorb energy from wall-normal stress due to the rotation effect, thereby the turbulence self-sustaining process could not be maintained. For the relaminarization cases, the laminar state is stable to even extremely large perturbations, which possibly makes laminar state the only fixed point for the whole system.

physics.flu-dyn↗
arXiv2022

ApolloRL: a Reinforcement Learning Platform for Autonomous Driving

We introduce ApolloRL, an open platform for research in reinforcement learning for autonomous driving. The platform provides a complete closed-loop pipeline with training, simulation, and evaluation components. It comes with 300 hours of real-world data in driving scenarios and popular baselines such as Proximal Policy Optimization (PPO) and Soft Actor-Critic (SAC) agents. We elaborate in this paper on the architecture and the environment defined in the platform. In addition, we discuss the performance of the baseline agents in the ApolloRL environment.

cs.RO↗
arXiv2022

BinGo: Pinpointing Concurrency Bugs in Go via Binary Analysis

Golang (also known as Go for short) has become popular in building concurrency programs in distributed systems. As the unique features, Go employs lightweight Goroutines to support highly parallelism in user space. Moreover, Go leverages channels to enable explicit communication among threads. However, recent studies show that concurrency bugs are not uncommon in Go applications. Pinpointing these concurrency bugs in real Go applications is both important and challenging. Existing approaches are mostly based on compiler-aided static or dynamic analysis, which have two limitations. First, existing approaches require the availability and recompilation of the source code, which work well on testing rather than production environments with no source code available for both applications and external libraries. Second, existing approaches work on pure Go code bases only, not programs mixed with Go and other languages. To address these limitations, we develop BinGo, the first tool to identify concurrency bugs in Go applications via dynamic binary analysis. BinGo correlates binary execution with Go semantics and employs novel bug detection algorithms. BinGo is an end-to-end tool that is ready for deployment in the production environment with no modification on source code, compilers, and runtimes in the Go eco-system. Our experiments show that BinGo has a high coverage of concurrency bugs with no false positives. We are able to use BinGo to identify concurrency bugs in real applications with moderate overhead.

cs.PL↗
arXiv2022

Mars Entry Trajectory Planning with Range Discretization and Successive Convexification

This paper develops a sequential convex programming approach for Mars entry trajectory planning by range discretization. To improve the accuracy of numerical integration, the range of entry trajectory is selected as the independent variable rather than time or energy. A dilation factor is employed to normalize the entry dynamics and integration interval of the performance index so that the difficult free-final-time programming problem can be converted to a fixed-final-range optimization problem. The bank angle rate with respect to the range is introduced as the new control input in order to decouple the control from the state and facilitate convexification of constraints on the bank angle and its rate. The nonlinear bank angle rate constraint is further relaxed into a linear one via inequality relaxation. Moreover, the nonconvex minimum-time performance index is convexified by regarding flight time as a state variable. Then, the Mars entry trajectory planning problem can be formulated into the framework of convex programming after linearization. By range discretization and successive convexification, the reformulated Mars entry trajectory planning problem is transcribed into a series of convex optimization sub-problems that can be sequentially solved using the convex programming algorithm. The virtual control and adaptive trust-region techniques are employed to improve the accuracy, robustness, and computation efficiency of the algorithm. Numerical simulations with comparative studies are presented to demonstrate the convergence performance and efficiency of the proposed algorithm.

eess.SY↗
arXiv2022

Temperature Field Inversion of Heat-Source Systems via Physics-Informed Neural Networks

Temperature field inversion of heat-source systems (TFI-HSS) with limited observations is essential to monitor the system health. Although some methods such as interpolation have been proposed to solve TFI-HSS, those existing methods ignore correlations between data constraints and physics constraints, causing the low precision. In this work, we develop a physics-informed neural network-based temperature field inversion (PINN-TFI) method to solve the TFI-HSS task and a coefficient matrix condition number based position selection of observations (CMCN-PSO) method to select optima positions of noise observations. For the TFI-HSS task, the PINN-TFI method encodes constrain terms into the loss function, thus the task is transformed into an optimization problem of minimizing the loss function. In addition, we have found that noise observations significantly affect reconstruction performances of the PINN-TFI method. To alleviate the effect of noise observations, the CMCN-PSO method is proposed to find optimal positions, where the condition number of observations is used to evaluate positions. The results demonstrate that the PINN-TFI method can significantly improve prediction precisions and the CMCN-PSO method can find good positions to acquire a more robust temperature field.

cs.LG↗
arXiv2021

Scalable universal tunable virtual-wavevector spatial frequency shift (TVSFS) super-resolution imaging

Developing a chip-based super-resolution imaging technique with large field-of-view (FOV), deep subwavelength resolution, and compatibility for both fluorescent and non-fluorescent samples is desired for material science, biomedicine, and life researches, etc. Previous on-chip super-resolution methods focus on either fluorescent or non-fluorescent imaging, putting an urgent requirement on the general imaging technique compatible with both of them. Here, we introduce a universal super-resolution imaging method based on tunable virtual-wavevector spatial frequency shift (TVSFS), realizing both labeled and label-free super-resolution imaging on a single delicately fabricated scalable photonic chip. Theoretically, with TVSFS, the diffraction limit of a linear optical system can be overcome, and the resolution can be improved more than three times, which is the limitation for most super-resolution imaging based on spatial frequency engineering. Diffractive units were fabricated on the chip's surface to provide a wavevector-variable evanescent wave illumination and induce tunable deep SFS in the samples' Fourier space. A resolution of λ/4.7 for the label-free sample and λ/7.1 for the labeled sample with a large FOV could be achieved with a CMOS-compatible process on a GaP chip. The large FOV, high-compatibility, and high-integration TVSFS chip may advance the fields like cell engineering, precision inspection in the industry, chemical research, etc.

physics.optics↗
arXiv2021

3D Scene Understanding at Urban Intersection using Stereo Vision and Digital Map

The driving behavior at urban intersections is very complex. It is thus crucial for autonomous vehicles to comprehensively understand challenging urban traffic scenes in order to navigate intersections and prevent accidents. In this paper, we introduce a stereo vision and 3D digital map based approach to spatially and temporally analyze the traffic situation at urban intersections. Stereo vision is used to detect, classify and track obstacles, while a 3D digital map is used to improve ego-localization and provide context in terms of road-layout information. A probabilistic approach that temporally integrates these geometric, semantic, dynamic and contextual cues is presented. We qualitatively and quantitatively evaluate our proposed technique on real traffic data collected at an urban canyon in Tokyo to demonstrate the efficacy of the system in providing comprehensive awareness of the traffic surroundings.

cs.CV↗