arXiv subjects

Qing Wang

Publications and source records attributed to Qing Wang.

At least 325 records · Page 18Linked to original sources

arXiv2021

A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks

Answering exact shortest path distance queries is a fundamental task in graph theory. Despite a tremendous amount of research on the subject, there is still no satisfactory solution that can scale to billion-scale complex networks. Labelling-based methods are well-known for rendering fast response time to distance queries; however, existing works can only construct labelling on moderately large networks (million-scale) and cannot scale to large networks (billion-scale) due to their prohibitively large space requirements and very long preprocessing time. In this work, we present novel techniques to efficiently construct distance labelling and process exact shortest path distance queries for complex networks with billions of vertices and billions of edges. Our method is based on two ingredients: (i) a scalable labelling algorithm for constructing minimal distance labelling, and (ii) a querying framework that supports fast distance-bounded search on a sparsified graph. Thus, we first develop a novel labelling algorithm that can scale to graphs at the billion-scale. Then, we formalize a querying framework for exact distance queries, which combines our proposed highway cover distance labelling with distance-bounded searches to enable fast distance computation. To speed up the labelling construction process, we further propose a parallel labelling method that can construct labelling simultaneously for multiple landmarks. We evaluated the performance of the proposed methods on 12 real-world networks. The experiments show that the proposed methods can not only handle networks with billions of vertices, but also be up to 70 times faster in constructing labelling and save up to 90\% of labelling space. In particular, our method can answer distance queries on a billion-scale network of around 8B edges in less than 1ms, on average.

cs.DS↗

arXiv2021

Efficient Maintenance of Distance Labelling for Incremental Updates in Large Dynamic Graphs

Finding the shortest path distance between an arbitrary pair of vertices is a fundamental problem in graph theory. A tremendous amount of research has been successfully attempted on this problem, most of which is limited to static graphs. Due to the dynamic nature of real-world networks, there is a pressing need to address this problem for dynamic networks undergoing changes. In this paper, we propose an \emph{online incremental} method to efficiently answer distance queries over very large dynamic graphs. Our proposed method incorporates incremental update operations, i.e. edge and vertex additions, into a highly scalable framework of answering distance queries. We theoretically prove the correctness of our method and the preservation of labelling minimality. We have also conducted extensive experiments on 12 large real-world networks to empirically verify the efficiency, scalability, and robustness of our method.

cs.DS↗

arXiv2021

FIXME: Enhance Software Reliability with Hybrid Approaches in Cloud

With the promise of reliability in cloud, more enterprises are migrating to cloud. The process of continuous integration/deployment (CICD) in cloud connects developers who need to deliver value faster and more transparently with site reliability engineers (SREs) who need to manage applications reliably. SREs feed back development issues to developers, and developers commit fixes and trigger CICD to redeploy. The release cycle is more continuous than ever, thus the code to production is faster and more automated. To provide this higher level agility, the cloud platforms become more complex in the face of flexibility with deeper layers of virtualization. However, reliability does not come for free with all these complexities. Software engineers and SREs need to deal with wider information spectrum from virtualized layers. Therefore, providing correlated information with true positive evidences is critical to identify the root cause of issues quickly in order to reduce mean time to recover (MTTR), performance metrics for SREs. Similarity, knowledge, or statistics driven approaches have been effective, but with increasing data volume and types, an individual approach is limited to correlate semantic relations of different data sources. In this paper, we introduce FIXME to enhance software reliability with hybrid diagnosis approaches for enterprises. Our evaluation results show using hybrid diagnosis approach is about 17% better in precision. The results are helpful for both practitioners and researchers to develop hybrid diagnosis in the highly dynamic cloud environment.

cs.SE↗

arXiv2021

Deep Learning Models for Predicting Wildfires from Historical Remote-Sensing Data

Identifying regions that have high likelihood for wildfires is a key component of land and forestry management and disaster preparedness. We create a data set by aggregating nearly a decade of remote-sensing data and historical fire records to predict wildfires. This prediction problem is framed as three machine learning tasks. Results are compared and analyzed for four different deep learning models to estimate wildfire likelihood. The results demonstrate that deep learning models can successfully identify areas of high fire likelihood using aggregated data about vegetation, weather, and topography with an AUC of 83%.

cs.CV↗

arXiv2021

Formation of Ultra-High-Resistance Au/Ti/p-GaN Junctions and the Applications in AlGaN/GaN HEMTs

We report a dramatic current reduction, or a resistance increase, by a few orders of magnitude of two common-anode Au/Ti/pGaN Schottky junctions annealed within a certain annealing condition window (600 - 700 oC, 1 - 4 min). Results from similar common-anode Schottky junctions made of Au/p-GaN, Al/Ti/p-GaN and Au/Ti/graphene/p-GaN junctions demonstrated that all the three layers (Au, Ti and p-GaN) are essential for the increased resistance. Raman characterization of the p-GaN showed a decrease of the Mg-N bonding, i.e., the deactivation of Mg, which is consistent with the Hall measurement results. Moreover, this high-resistance junction structure was employed in p-GaN gate AlGaN/GaN HEMTs. It was shown to be an effective gate technology that was capable to boost the gate breakdown voltage from 9.9 V to 13.8 V with a negligible effect on the threshold voltage or the sub-threshold slope.

cond-mat.mtrl-sci↗

arXiv2021

A Basis Approach to Surface Clustering

This paper presents a novel method for clustering surfaces. The proposal involves first using basis functions in a tensor product to smooth the data and thus reduce the dimension to a finite number of coefficients, and then using these estimated coefficients to cluster the surfaces via the k-means algorithm. An extension of the algorithm to clustering tensors is also discussed. We show that the proposed algorithm exhibits the property of strong consistency, with or without measurement errors, in correctly clustering the data as the sample size increases. Simulation studies suggest that the proposed method outperforms the benchmark k-means algorithm which uses the original vectorized data. In addition, an EGG real data example is considered to illustrate the practical application of the proposal.

stat.ME↗

arXiv2021

Machine learning accelerated computational fluid dynamics

Numerical simulation of fluids plays an essential role in modeling many physical phenomena, such as weather, climate, aerodynamics and plasma physics. Fluids are well described by the Navier-Stokes equations, but solving these equations at scale remains daunting, limited by the computational cost of resolving the smallest spatiotemporal features. This leads to unfavorable trade-offs between accuracy and tractability. Here we use end-to-end deep learning to improve approximations inside computational fluid dynamics for modeling two-dimensional turbulent flows. For both direct numerical simulation of turbulence and large eddy simulation, our results are as accurate as baseline solvers with 8-10x finer resolution in each spatial dimension, resulting in 40-80x fold computational speedups. Our method remains stable during long simulations, and generalizes to forcing functions and Reynolds numbers outside of the flows where it is trained, in contrast to black box machine learning approaches. Our approach exemplifies how scientific computing can leverage machine learning and hardware accelerators to improve simulations without sacrificing accuracy or generalization.

physics.flu-dyn↗

arXiv2021

Chiral effective Lagrangian for excited heavy-light mesons from QCD

We derive the chiral effective Lagrangian for excited heavy-light mesons from QCD under proper approximations. We focus on the chiral partners with $j_l^P=\frac{3}{2}^+$ and $j_l^P=\frac{3}{2}^-$ which amounts to ($1^+,2^+$) and ($1^-,2^-$) states respectively. The low energy constants including the masses of the chiral partners are calculated. The calculated spectrum for the excited mesons are found roughly consistent with experimental data. In addition, our results indicate that quantum numbers of $B_J(5970)$ can be identified with $1^-$ or $2^-$.

hep-ph↗

arXiv2021

Resolution of the paradox of the diamagnetic effect on the Kibble coil

Employing very simple electro-mechanical principles known from classical physics, the Kibble balance establishes a very precise and absolute link between quantum electrical standards and macroscopic mass or force measurements. The success of the Kibble balance, in both determining fundamental constants ($h$, $N_A$, $e$) and realizing a quasi-quantum mass in the 2019 newly revised International System of Units, relies on the perfection of Maxwell's equations and the symmetry they describe between Lorentz's force and Faraday's induction, a principle and a symmetry stunningly demonstrated in the weighing and velocity modes of Kibble balances to within $1\times10^{-8}$, with nothing but imperfect wires and magnets. However, recent advances in the understanding of the current effect in Kibble balances reveal a troubling paradox. A diamagnetic effect, a force that does not cancel between mass-on and mass-off measurement, is challenging balance maker's assumptions of symmetry at levels that are almost two orders of magnitude larger than the reported uncertainties. The diamagnetic effect, if it exists, shows up in weighing mode without a readily apparent reciprocal effect in the velocity mode, begging questions about systematic errors at the very foundation of the new measurement system. The hypothetical force is caused by the coil current changing the magnetic field, producing an unaccounted force that is systematically modulated with the weighing current. Here we show that this diamagnetic force exists, but the additional force does not change the equivalence between weighing and velocity measurements. We reveal the unexpected way that symmetry is preserved and show that for typical materials and geometries the total relative effect on the measurement is $\approx 1\times10^{-9}$.

physics.ins-det↗

arXiv2020

ErGAN: Generative Adversarial Networks for Entity Resolution

Entity resolution targets at identifying records that represent the same real-world entity from one or more datasets. A major challenge in learning-based entity resolution is how to reduce the label cost for training. Due to the quadratic nature of record pair comparison, labeling is a costly task that often requires a significant effort from human experts. Inspired by recent advances of generative adversarial network (GAN), we propose a novel deep learning method, called ErGAN, to address the challenge. ErGAN consists of two key components: a label generator and a discriminator which are optimized alternatively through adversarial learning. To alleviate the issues of overfitting and highly imbalanced distribution, we design two novel modules for diversity and propagation, which can greatly improve the model generalization power. We have conducted extensive experiments to empirically verify the labeling and learning efficiency of ErGAN. The experimental results show that ErGAN beats the state-of-the-art baselines, including unsupervised, semi-supervised, and unsupervised learning methods.

cs.LG↗

arXiv2020

Chiral effective Lagrangian for heavy-light mesons from QCD: $1/m_{Q}$ correction

As a successive work to [Phys.Rev.D 102 (2020), 034034], we derive the $1/m_Q$ corrections to chiral effective Lagrangian for heavy-light mesons from QCD under proper approximations. The low energy constants in the effective Lagrangian are expressed in terms of the light quark self-energy and heavy quark mass $m_Q$. Numerical results of the low energy constants with $1/m_Q$ corrections are given. We find that the results of pion decay constant and the masses of heavy-light mesons are improved coherently compared to that obtained in the heavy quark limit.

hep-ph↗

arXiv2020

Adversarial Training for Multi-domain Speaker Recognition

In real-life applications, the performance of speaker recognition systems always degrades when there is a mismatch between training and evaluation data. Many domain adaptation methods have been successfully used for eliminating the domain mismatches in speaker recognition. However, usually both training and evaluation data themselves can be composed of several subsets. These inner variances of each dataset can also be considered as different domains. Different distributed subsets in source or target domain dataset can also cause multi-domain mismatches, which are influential to speaker recognition performance. In this study, we propose to use adversarial training for multi-domain speaker recognition to solve the domain mismatch and the dataset variance problems. By adopting the proposed method, we are able to obtain both multi-domain-invariant and speaker-discriminative speech representations for speaker recognition. Experimental results on DAC13 dataset indicate that the proposed method is not only effective to solve the multi-domain mismatch problem, but also outperforms the compared unsupervised domain adaptation methods.

cs.SD↗

arXiv2020

Acoustic radiation force on small spheres due to transient acoustic fields

Acoustic radiation force is a net force experienced by an object under the action of an acoustic wave. Most theoretical models require the acoustic wave to be periodic, if not purely monofrequency, and are therefore irrelevant for the study of acoustic radiation force due to acoustic pulses. Here, we introduce the concept of finite-duration pulses, which is the most general condition to derive the acoustic radiation force. In the case of small spheres, we extend the Gor'kov to formula to unsteady acoustic fields such as traveling pulses and interfering wave packets. In the latter case, our study suggests that the concept of acoustic contrast is also relevant to express the acoustic radiation force. For negative acoustic contrast particles, the acoustic trapping region narrows with shorter pulses, whereas positive contrast particles (such as biological cells) can fall in secondary traps when the pulse width deviates from an optimal value. This theoretical insight may help to improve the selectivity of pulsed acoustic tweezers.

physics.flu-dyn↗

arXiv2020

Lightweight Single-Image Super-Resolution Network with Attentive Auxiliary Feature Learning

Despite convolutional network-based methods have boosted the performance of single image super-resolution (SISR), the huge computation costs restrict their practical applicability. In this paper, we develop a computation efficient yet accurate network based on the proposed attentive auxiliary features (A$^2$F) for SISR. Firstly, to explore the features from the bottom layers, the auxiliary feature from all the previous layers are projected into a common space. Then, to better utilize these projected auxiliary features and filter the redundant information, the channel attention is employed to select the most important common feature based on current layer feature. We incorporate these two modules into a block and implement it with a lightweight network. Experimental results on large-scale dataset demonstrate the effectiveness of the proposed model against the state-of-the-art (SOTA) SR methods. Notably, when parameters are less than 320k, A$^2$F outperforms SOTA methods for all scales, which proves its ability to better utilize the auxiliary features. Codes are available at https://github.com/wxxxxxxh/A2F-SR.

cs.CV↗

arXiv2020

Frequency Gating: Improved Convolutional Neural Networks for Speech Enhancement in the Time-Frequency Domain

One of the strengths of traditional convolutional neural networks (CNNs) is their inherent translational invariance. However, for the task of speech enhancement in the time-frequency domain, this property cannot be fully exploited due to a lack of invariance in the frequency direction. In this paper we propose to remedy this inefficiency by introducing a method, which we call Frequency Gating, to compute multiplicative weights for the kernels of the CNN in order to make them frequency dependent. Several mechanisms are explored: temporal gating, in which weights are dependent on prior time frames, local gating, whose weights are generated based on a single time frame and the ones adjacent to it, and frequency-wise gating, where each kernel is assigned a weight independent of the input data. Experiments with an autoencoder neural network with skip connections show that both local and frequency-wise gating outperform the baseline and are therefore viable ways to improve CNN-based speech enhancement neural networks. In addition, a loss function based on the extended short-time objective intelligibility score (ESTOI) is introduced, which we show to outperform the standard mean squared error (MSE) loss function.

cs.SD↗

arXiv2020

Determination of the Gate Breakdown Mechanisms in p-GaN Gate HEMTs by Multiple-gate-sweep Measurements

In this work, we studied the gate breakdown mechanisms of p-GaN gate AlGaN/GaN HEMTs by a novel multiple-gate-sweep-based method. For the first time, three different breakdown mechanisms were observed and identified separately in the same devices: the metal/p-GaN junction breakdown, the p-GaN/AlGaN/GaN junction breakdown, and the passivation related breakdown. This method is an effective method to determine the breakdown mechanisms. The different BD mechanisms were further confirmed by scanning electron microscopy (SEM). Finally, the temperature dependences of the three BD mechanisms were measured and compared. This analysis method was also employed in the devices with a different passivation material and showed its applicability.

physics.app-ph↗

arXiv2020

AIM 2020: Scene Relighting and Illumination Estimation Challenge

We review the AIM 2020 challenge on virtual image relighting and illumination estimation. This paper presents the novel VIDIT dataset used in the challenge and the different proposed solutions and final evaluation results over the 3 challenge tracks. The first track considered one-to-one relighting; the objective was to relight an input photo of a scene with a different color temperature and illuminant orientation (i.e., light source position). The goal of the second track was to estimate illumination settings, namely the color temperature and orientation, from a given image. Lastly, the third track dealt with any-to-any relighting, thus a generalization of the first track. The target color temperature and orientation, rather than being pre-determined, are instead given by a guide image. Participants were allowed to make use of their track 1 and 2 solutions for track 3. The tracks had 94, 52, and 56 registered participants, respectively, leading to 20 confirmed submissions in the final competition stage.

cs.CV↗

arXiv2020

Owl Eyes: Spotting UI Display Issues via Visual Understanding

Graphical User Interface (GUI) provides a visual bridge between a software application and end users, through which they can interact with each other. With the development of technology and aesthetics, the visual effects of the GUI are more and more attracting. However, such GUI complexity posts a great challenge to the GUI implementation. According to our pilot study of crowdtesting bug reports, display issues such as text overlap, blurred screen, missing image always occur during GUI rendering on different devices due to the software or hardware compatibility. They negatively influence the app usability, resulting in poor user experience. To detect these issues, we propose a novel approach, OwlEye, based on deep learning for modelling visual information of the GUI screenshot. Therefore, OwlEye can detect GUIs with display issues and also locate the detailed region of the issue in the given GUI for guiding developers to fix the bug. We manually construct a large-scale labelled dataset with 4,470 GUI screenshots with UI display issues and develop a heuristics-based data augmentation method for boosting the performance of our OwlEye. The evaluation demonstrates that our OwlEye can achieve 85% precision and 84% recall in detecting UI display issues, and 90% accuracy in localizing these issues. We also evaluate OwlEye with popular Android apps on Google Play and F-droid, and successfully uncover 57 previously-undetected UI display issues with 26 of them being confirmed or fixed so far.

cs.SE↗