arXiv subjects

He Zhang

Publications and source records attributed to He Zhang.

At least 217 records · Page 12Linked to original sources

arXiv2022

Anti-Delay Kalman Filter Fusion Algorithm for Vehicle-borne Sensor Network with Finite-Time Convergence

Intelligent vehicles in autonomous driving and obstacle avoidance, the precise relative state of vehicles put forward a higher demand. For a vehicle-borne sensor network with time-varying transmission delays, the problem of coordinate fusion of vehicle state is the focus of this paper. By the ingeniously designed low-complexity integration with a consensus strategy and buffer technology, an anti-delay distributed Kalman filter (DKF) with finite-time convergence is proposed.By introducing the matrix weight to assess local estimates, the optimal fusion state result is available in the sense of linear minimum variance. In addition, to accommodate practical engineering in intelligent vehicles, the communication weight coefficient and directed topology with unidirectional transmission are also considered. From a theoretical perspective, the proof of error covariances upper bounds with different communication topologies with delays are presented. Furthermore, the maximum allowable delays of vehicle-borne sensor network is derived backwards. Simulations verify that while considering various non-ideal factors above, the proposed DFK algorithm produces more accurate and robust fusion estimation state results than existing algorithms, making it more valuable in practical applications. Simultaneously, a mobile car trajectory tracking experiment is carried out, which further verifies the feasibility of the proposed algorithm.

eess.SY↗

arXiv2022

Threshold solutions for nonlocal reaction diffusion equations

We study the Cauchy problem for nonlocal reaction diffusion equations with bistable nonlinearity in 1D spatial domain and investigate the asymptotic behaviors of solutions with a one-parameter family of monotonically increasing and compactly supported initial data. We show that for small values of the parameter the corresponding solutions decay to 0, while for large values the related solutions converge to 1 uniformly on compacts. Moreover, we prove that the transition from extinction (converging to 0) to propagation (converging to 1) is sharp. Numerical results are provided to verify the theoretical results.

math.AP↗

arXiv2022

A predictor-corrector deep learning algorithm for high dimensional stochastic partial differential equations

In this paper, we present a deep learning-based numerical method for approximating high dimensional stochastic partial differential equations (SPDEs). At each time step, our method relies on a predictor-corrector procedure. More precisely, we decompose the original SPDE into a degenerate SPDE and a deterministic PDE. Then in the prediction step, we solve the degenerate SPDE with the Euler scheme, while in the correction step we solve the second-order deterministic PDE by deep neural networks via its equivalent backward stochastic differential equation (BSDE). Under standard assumptions, error estimates and the rate of convergence of the proposed algorithm are presented. The efficiency and accuracy of the proposed algorithm are illustrated by numerical examples.

math.NA↗

arXiv2022

Using Consensual Biterms from Text Structures of Requirements and Code to Improve IR-Based Traceability Recovery

Traceability approves trace links among software artifacts based on whether two artifacts are related by system functionalities. The traces are valuable for software development, but are difficult to obtain manually. To cope with the costly and fallible manual recovery, automated approaches are proposed to recover traces through textual similarities among software artifacts, such as those based on Information Retrieval (IR). However, the low quality & quantity of artifact texts negatively impact the calculated IR values, thus greatly hindering the performance of IR-based approaches. In this study, we propose to extract co-occurred word pairs from the text structures of both requirements and code (i.e., consensual biterms) to improve IR-based traceability recovery. We first collect a set of biterms based on the part-of-speech of requirement texts, and then filter them through the code texts. We then use these consensual biterms to both enrich the input corpus for IR techniques and enhance the calculations of IR values. A nine-system-based evaluation shows that in general, when solely used to enhance IR techniques, our approach can outperform pure IR-based approaches and another baseline by 21.9% & 21.8% in AP, and 9.3% & 7.2% in MAP, respectively. Moreover, when used to collaborate with another enhancing strategy from different perspectives, it can outperform this baseline by 5.9% in AP and 4.8% in MAP.

cs.SE↗

arXiv2022

HVTR: Hybrid Volumetric-Textural Rendering for Human Avatars

We propose a novel neural rendering pipeline, Hybrid Volumetric-Textural Rendering (HVTR), which synthesizes virtual human avatars from arbitrary poses efficiently and at high quality. First, we learn to encode articulated human motions on a dense UV manifold of the human body surface. To handle complicated motions (e.g., self-occlusions), we then leverage the encoded information on the UV manifold to construct a 3D volumetric representation based on a dynamic pose-conditioned neural radiance field. While this allows us to represent 3D geometry with changing topology, volumetric rendering is computationally heavy. Hence we employ only a rough volumetric representation using a pose-conditioned downsampled neural radiance field (PD-NeRF), which we can render efficiently at low resolutions. In addition, we learn 2D textural features that are fused with rendered volumetric features in image space. The key advantage of our approach is that we can then convert the fused features into a high-resolution, high-quality avatar by a fast GAN-based textural renderer. We demonstrate that hybrid rendering enables HVTR to handle complicated motions, render high-quality avatars under user-controlled poses/shapes and even loose clothing, and most importantly, be efficient at inference time. Our experimental results also demonstrate state-of-the-art quantitative results.

cs.CV↗

arXiv2022

Leveraging Cross Feedback of User and Item Embeddings with Attention for Variational Autoencoder based Collaborative Filtering

Matrix factorization (MF) has been widely applied to collaborative filtering in recommendation systems. Its Bayesian variants can derive posterior distributions of user and item embeddings, and are more robust to sparse ratings. However, the Bayesian methods are restricted by their update rules for the posterior parameters due to the conjugacy of the priors and the likelihood. Variational autoencoders (VAE) can address this issue by capturing complex mappings between the posterior parameters and the data. However, current research on VAEs for collaborative filtering only considers the mappings based on the explicit data information while the implicit embedding information is overlooked. In this paper, we first derive evidence lower bounds (ELBO) for Bayesian MF models from two viewpoints: user-oriented and item-oriented. Based on the ELBOs, we propose a VAE-based Bayesian MF framework. It leverages not only the data but also the embedding information to approximate the user-item joint distribution. As suggested by the ELBOs, the approximation is iterative with cross feedback of user and item embeddings into each other's encoders. More specifically, user embeddings sampled at the previous iteration are fed to the item-side encoders to estimate the posterior parameters for the item embeddings at the current iteration, and vice versa. The estimation also attends to the cross-fed embeddings to further exploit useful information. The decoder then reconstructs the data via the matrix factorization over the currently re-sampled user and item embeddings.

cs.LG↗

arXiv2022

Probing Operator Spreading via Floquet Engineering in a Superconducting Circuit

Operator spreading, often characterized by out-of-time-order correlators (OTOCs), is one of the central concepts in quantum many-body physics. However, measuring OTOCs is experimentally challenging due to the requirement of reversing the time evolution of systems. Here we apply Floquet engineering to investigate operator spreading in a superconducting 10-qubit chain. Floquet engineering provides an effective way to tune the coupling strength between nearby qubits, which is used to demonstrate quantum walks with tunable couplings, reversed time evolution, and the measurement of OTOCs. A clear light-cone-like operator propagation is observed in the system with multiple excitations, and has a nearly equal velocity as the single-particle quantum walk. For the butterfly operator that is nonlocal (local) under the Jordan-Wigner transformation, the OTOCs show distinct behaviors with (without) a signature of information scrambling in the near integrable system.

quant-ph↗

arXiv2022

Controllable Shadow Generation Using Pixel Height Maps

Shadows are essential for realistic image compositing. Physics-based shadow rendering methods require 3D geometries, which are not always available. Deep learning-based shadow synthesis methods learn a mapping from the light information to an object's shadow without explicitly modeling the shadow geometry. Still, they lack control and are prone to visual artifacts. We introduce pixel heigh, a novel geometry representation that encodes the correlations between objects, ground, and camera pose. The pixel height can be calculated from 3D geometries, manually annotated on 2D images, and can also be predicted from a single-view RGB image by a supervised approach. It can be used to calculate hard shadows in a 2D image based on the projective geometry, providing precise control of the shadows' direction and shape. Furthermore, we propose a data-driven soft shadow generator to apply softness to a hard shadow based on a softness input parameter. Qualitative and quantitative evaluations demonstrate that the proposed pixel height significantly improves the quality of the shadow generation while allowing for controllability.

cs.CV↗

arXiv2022

Representations of Quantum Coordinate Algebras at Generic $q$ and Wiring Diagrams

This paper is devoted to the representation theory of quantum coordinate algebra $\mathbb{C}_q[G]$, for a semisimple Lie group $G$ and a generic parameter $q$. By inspecting the actions of normal elements on tensor modules, we generalize a result of Levendorski and Soibelman in [22] for highest weight modules. For a double Bruhat cell $G^{w_1,w_2}$, we describe the primitive spectra $\mathrm{prim}\,\mathbb{C}_q[G]_{w_1,w_2}$ in a new fashion, and construct a bundle of $(w_1,w_2)$ type simple modules onto $\mathrm{prim}\,\mathbb{C}_q[G]_{w_1,w_2}$, provided $\mathrm{Supp}(w_1)\cap\mathrm{Supp}(w_2)=\varnothing$ or enough pivot elements. The fibers of the bundle are shown to be products of the spectrums of simple modules of 2-dimensional quantum torus $L_q(2)$. As an application of our theory, we deduce an equivalent condition for the tensor module to be simple, and construct some simple modules for each primitive ideal when $G=SL_3(\mathbb{C})$. This completes the Dixmier's program for $\mathbb{C}_q[SL_3]$. The wiring diagrams, introduced by Fomin and Zelevinsky in their study of total positivity (cf. [3,9]), is the main tool to compute the action of generalized quantum minors on tensor modules in the type A case. We obtain a quantum version of Lindström's lemma, which plays an important role in transforming representation problems into combinatorial ones of wiring diagrams.

math.QA↗

arXiv2022

SE(3) Equivariant Graph Neural Networks with Complete Local Frames

Group equivariance (e.g. SE(3) equivariance) is a critical physical symmetry in science, from classical and quantum physics to computational biology. It enables robust and accurate prediction under arbitrary reference transformations. In light of this, great efforts have been put on encoding this symmetry into deep neural networks, which has been shown to improve the generalization performance and data efficiency for downstream tasks. Constructing an equivariant neural network generally brings high computational costs to ensure expressiveness. Therefore, how to better trade-off the expressiveness and computational efficiency plays a core role in the design of the equivariant deep learning models. In this paper, we propose a framework to construct SE(3) equivariant graph neural networks that can approximate the geometric quantities efficiently. Inspired by differential geometry and physics, we introduce equivariant local complete frames to graph neural networks, such that tensor information at given orders can be projected onto the frames. The local frame is constructed to form an orthonormal basis that avoids direction degeneration and ensure completeness. Since the frames are built only by cross product operations, our method is computationally efficient. We evaluate our method on two tasks: Newton mechanics modeling and equilibrium molecule conformation generation. Extensive experimental results demonstrate that our model achieves the best or competitive performance in two types of datasets.

cs.CE↗

arXiv2022

Observation of critical phase transition in a generalized Aubry-André-Harper model on a superconducting quantum processor with tunable couplers

Quantum simulation enables study of many-body systems in non-equilibrium by mapping to a controllable quantum system, providing a new tool for computational intractable problems. Here, using a programmable quantum processor with a chain of 10 superconducting qubits interacted through tunable couplers, we simulate the one-dimensional generalized Aubry-André-Harper model for three different phases, i.e., extended, localized and critical phases. The properties of phase transitions and many-body dynamics are studied in the presence of quasi-periodic modulations for both off-diagonal hopping coefficients and on-site potentials of the model controlled respectively by adjusting strength of couplings and qubit frequencies. We observe the spin transport for initial single- and multi-excitation states in different phases, and characterize phase transitions by experimentally measuring dynamics of participation entropies. Our experimental results demonstrate that the newly developed tunable coupling architecture of superconducting processor extends greatly the simulation realms for a wide variety of Hamiltonians, and may trigger further investigations on various quantum and topological phenomena.

quant-ph↗

arXiv2022

A Flexible Diffusion Model

Diffusion (score-based) generative models have been widely used for modeling various types of complex data, including images, audios, and point clouds. Recently, the deep connection between forward-backward stochastic differential equations (SDEs) and diffusion-based models has been revealed, and several new variants of SDEs are proposed (e.g., sub-VP, critically-damped Langevin) along this line. Despite the empirical success of the hand-crafted fixed forward SDEs, a great quantity of proper forward SDEs remain unexplored. In this work, we propose a general framework for parameterizing the diffusion model, especially the spatial part of the forward SDE. An abstract formalism is introduced with theoretical guarantees, and its connection with previous diffusion models is leveraged. We demonstrate the theoretical advantage of our method from an optimization perspective. Numerical experiments on synthetic datasets, MINIST and CIFAR10 are also presented to validate the effectiveness of our framework.

cs.LG↗

arXiv2022

Modeling Review History for Reviewer Recommendation:A Hypergraph Approach

Modern code review is a critical and indispensable practice in a pull-request development paradigm that prevails in Open Source Software (OSS) development. Finding a suitable reviewer in projects with massive participants thus becomes an increasingly challenging task. Many reviewer recommendation approaches (recommenders) have been developed to support this task which apply a similar strategy, i.e. modeling the review history first then followed by predicting/recommending a reviewer based on the model. Apparently, the better the model reflects the reality in review history, the higher recommender's performance we may expect. However, one typical scenario in a pull-request development paradigm, i.e. one Pull-Request (PR) (such as a revision or addition submitted by a contributor) may have multiple reviewers and they may impact each other through publicly posted comments, has not been modeled well in existing recommenders. We adopted the hypergraph technique to model this high-order relationship (i.e. one PR with multiple reviewers herein) and developed a new recommender, namely HGRec, which is evaluated by 12 OSS projects with more than 87K PRs, 680K comments in terms of accuracy and recommendation distribution. The results indicate that HGRec outperforms the state-of-the-art recommenders on recommendation accuracy. Besides, among the top three accurate recommenders, HGRec is more likely to recommend a diversity of reviewers, which can help to relieve the core reviewers' workload congestion issue. Moreover, since HGRec is based on hypergraph, which is a natural and interpretable representation to model review history, it is easy to accommodate more types of entities and realistic relationships in modern code review scenarios. As the first attempt, this study reveals the potentials of hypergraph on advancing the pragmatic solutions for code reviewer recommendation.

cs.SE↗

arXiv2022

A Cross-Company Ethnographic Study on Software Teams for DevOps and Microservices: Organization, Benefits, and Issues

Context: DevOps and microservices are acknowledged to be important new paradigms to tackle contemporary software demands and provide capabilities for rapid and reliable software development. Industrial reports show that they are quickly adopted together in massive software companies. However, because of the technical and organizational requirements, many difficulties against efficient implementation of the both emerge in real software teams. Objectives: This study aims to discover the organization, benefits and issues of software teams using DevOps & microservices from an immersive perspective. Method: An ethnographic study was carried out in three companies with different business, size, products, customers, and degree of globalization. All the three companies claimed their adoption of DevOps and microservices. Seven months (cumulative) of participant observations and nine interviews with practitioners were conducted to collect the data of software teams related to DevOps and microservices. A cross-company empirical investigation using grounded theory was done by analyzing the archive data. Results: The adoption of DevOps and microservices brings benefits to rapid delivery, ability improvements and burden reduction, whilst the high cost and lack of practical guidance were emerged. Moreover, our observations and interviews reflect that in software teams, the relationship between DevOps and microservices is not significant, which differs from the relationship described in the previous studies. Four lessons for practitioners and four implications for researchers were discussed based on our findings. Conclusion: Our findings contribute to the understanding of the organization, benefits and issues of adopting DevOps and microservices from an immersive perspective of software teams.

cs.SE↗

arXiv2022

An Industrial Experience Report on Retro-inspection

To reinforce the quality of code delivery, especially to improve future coding quality, one global Information and Communication Technology (ICT) enterprise has institutionalized a retrospective style inspection (namely retro-inspection), which is similar to Fagan inspection but differs in terms of stage, participants, etc. This paper reports an industrial case study that aims to investigate the experiences and lessons from this software practice. To this end, we collected and analyzed various empirical evidence for data triangulation. The results reflect that retro-inspection distinguishes itself from peer code review by identifying more complicated and underlying defects, providing more indicative and suggestive comments. Many experienced inspectors indicate defects together with their rationale behind and offer suggestions for correction and prevention. As a result, retro-inspection can benefit not only quality assurance (like Fagan inspection), but also internal audit, inter-division communication, and competence promotion. On the other side, we identify several lessons of retro-inspection at this stage, e.g., developers' acceptance and organizers' predicament, for next-step improvement of this practice. To be specific, some recommendations are discussed for retro-inspection, e.g., more adequate preparation and more careful publicity. This study concludes that most of the expected benefits of retro-inspection can be empirically confirmed in this enterprise and its value on the progress to continuous maturity can be recognized organization-wide. The experiences on executing this altered practice in a large enterprise provide reference value on code quality assurance to other software organizations.

cs.SE↗

arXiv2022

Unified Abstract Syntax Tree Representation Learning for Cross-Language Program Classification

Program classification can be regarded as a high-level abstraction of code, laying a foundation for various tasks related to source code comprehension, and has a very wide range of applications in the field of software engineering, such as code clone detection, code smell classification, defects classification, etc. The cross-language program classification can realize code transfer in different programming languages, and can also promote cross-language code reuse, thereby helping developers to write code quickly and reduce the development time of code transfer. Most of the existing studies focus on the semantic learning of the code, whilst few studies are devoted to cross-language tasks. The main challenge of cross-language program classification is how to extract semantic features of different programming languages. In order to cope with this difficulty, we propose a Unified Abstract Syntax Tree (namely UAST in this paper) neural network. In detail, the core idea of UAST consists of two unified mechanisms. First, UAST learns an AST representation by unifying the AST traversal sequence and graph-like AST structure for capturing semantic code features. Second, we construct a mechanism called unified vocabulary, which can reduce the feature gap between different programming languages, so it can achieve the role of cross-language program classification. Besides, we collect a dataset containing 20,000 files of five programming languages, which can be used as a benchmark dataset for the cross-language program classification task. We have done experiments on two datasets, and the results show that our proposed approach outperforms the state-of-the-art baselines in terms of four evaluation metrics (Precision, Recall, F1-score, and Accuracy).

cs.SE↗

arXiv2022

DoubleField: Bridging the Neural Surface and Radiance Fields for High-fidelity Human Reconstruction and Rendering

We introduce DoubleField, a novel framework combining the merits of both surface field and radiance field for high-fidelity human reconstruction and rendering. Within DoubleField, the surface field and radiance field are associated together by a shared feature embedding and a surface-guided sampling strategy. Moreover, a view-to-view transformer is introduced to fuse multi-view features and learn view-dependent features directly from high-resolution inputs. With the modeling power of DoubleField and the view-to-view transformer, our method significantly improves the reconstruction quality of both geometry and appearance, while supporting direct inference, scene-specific high-resolution finetuning, and fast rendering. The efficacy of DoubleField is validated by the quantitative evaluations on several datasets and the qualitative results in a real-world sparse multi-view system, showing its superior capability for high-quality human model reconstruction and photo-realistic free-viewpoint human rendering. Data and source code will be made public for the research purpose. Please refer to our project page: http://www.liuyebin.com/dbfield/dbfield.html.

cs.CV↗

arXiv2022

Algorithm for Optimized mRNA Design Improves Stability and Immunogenicity

Messenger RNA (mRNA) vaccines are being used for COVID-19, but still suffer from the critical issue of mRNA instability and degradation, which is a major obstacle in the storage, distribution, and efficacy of the vaccine. Previous work showed that optimizing secondary structure stability lengthens mRNA half-life, which, together with optimal codons, increases protein expression. Therefore, a principled mRNA design algorithm must optimize both structural stability and codon usage to improve mRNA efficiency. However, due to synonymous codons, the mRNA design space is prohibitively large, e.g., there are $\sim\!10^{632}$ mRNAs for the SARS-CoV-2 Spike protein, which poses insurmountable challenges to previous methods. Here we provide a surprisingly simple solution to this hard problem by reducing it to a classical problem in computational linguistics, where finding the optimal mRNA is akin to finding the most likely sentence among similar sounding alternatives. Our algorithm, named LinearDesign, takes only 11 minutes for the Spike protein, and can jointly optimize stability and codon usage. Experimentally, without chemical modification, our designs substantially improve mRNA half-life and protein expression in vitro, and dramatically increase antibody response by up to 23$\times$ in vivo, compared to the codon-optimized benchmark. Our work enables the exploration of highly stable and efficient designs that are previously unreachable and is a timely tool not only for vaccines but also for mRNA medicine encoding all therapeutic proteins (e.g., monoclonal antibodies and anti-cancer drugs).

q-bio.BM↗