arXiv subjects

Yang Wang

Publications and source records attributed to Yang Wang.

At least 667 records · Page 37Linked to original sources

arXiv2020

On Pole-Zero Assignment of Vibratory Systems by Multi-Input Feedback Control

In this paper, we consider the pole-zero assignment problem for vibratory systems via multi-input feedback control. We propose a multi-step two-stage approach for solving the multi-input pole-zero assignment problem. We first reformulate the assignment problem as a multi-step single-input pole-zero assignment problem. Then, in each step, we propose a two-stage approach for solving the single-input pole-zero assignment problem. In the first stage, based on the measured receptances, we replace the selected zeros of the prescribed open-loop point receptance to the desired locations, where we need to solve a small underdetermined linear equation for finding the corresponding columns of the feedback matrices. In the second stage, by using linear matrix inequalities, the complete closed-loop poles are assigned to the prescribed subregion of the complex left-hand plane. Finally, we give some numerical examples to demonstrate the effectiveness of our method.

math.NA↗

arXiv2020

Long-Term Pipeline Failure Prediction Using Nonparametric Survival Analysis

Australian water infrastructure is more than a hundred years old, thus has begun to show its age through water main failures. Our work concerns approximately half a million pipelines across major Australian cities that deliver water to houses and businesses, serving over five million customers. Failures on these buried assets cause damage to properties and water supply disruptions. We applied Machine Learning techniques to find a cost-effective solution to the pipe failure problem in these Australian cities, where on average 1500 of water main failures occur each year. To achieve this objective, we construct a detailed picture and understanding of the behaviour of the water pipe network by developing a Machine Learning model to assess and predict the failure likelihood of water main breaking using historical failure records, descriptors of pipes and other environmental factors. Our results indicate that our system incorporating a nonparametric survival analysis technique called "Random Survival Forest" outperforms several popular algorithms and expert heuristics in long-term prediction. In addition, we construct a statistical inference technique to quantify the uncertainty associated with the long-term predictions.

cs.LG↗

arXiv2020

Monte Carlo simulation of order-disorder transition in refractory high entropy alloys: a data-driven approach

High entropy alloys (HEAs) are a series of novel materials that demonstrate many exceptional mechanical properties. To understand the origin of these attractive properties, it is important to investigate the thermodynamics and elucidate the evolution of various chemical phases. In this work, we introduce a data-driven approach to construct the effective Hamiltonian and study the thermodynamics of HEAs through canonical Monte Carlo simulation. The main characteristic of our method is to use pairwise interactions between atoms as features and systematically improve the representativeness of the dataset using samples from Monte Carlo simulation. We find this method produces highly robust and accurate effective Hamiltonians that give less than 0.1 mRy test error for all the three refractory HEAs: MoNbTaW, MoNbTaVW, and MoNbTaTiW. Using replica exchange to speed up the MC simulation, we calculated the specific heats and short-range order parameters in a wide range of temperatures. For all the studied materials, we find there are two major order-disorder transitions occurring respectively at $T_1$ and $T_2$, where $T_1$ is near room temperature but $T_2$ is much higher. We further demonstrate that the transition at $T_1$ is caused by W and Nb while the one at $T_2$ is caused by the other elements. By comparing with experiments, {\color{black} the results provide insight into the role of chemical ordering in the strength and ductility of HEAs.

cond-mat.mtrl-sci↗

arXiv2020

On Efficient and Scalable Time-Continuous Spatial Crowdsourcing -- Full Version

The proliferation of advanced mobile terminals opened up a new crowdsourcing avenue, spatial crowdsourcing, to utilize the crowd potential to perform real-world tasks. In this work, we study a new type of spatial crowdsourcing, called time-continuous spatial crowdsourcing (TCSC in short). It supports broad applications for long-term continuous spatial data acquisition, ranging from environmental monitoring to traffic surveillance in citizen science and crowdsourcing projects. However, due to limited budgets and limited availability of workers in practice, the data collected is often incomplete, incurring data deficiency problem. To tackle that, in this work, we first propose an entropy-based quality metric, which captures the joint effects of incompletion in data acquisition and the imprecision in data interpolation. Based on that, we investigate quality-aware task assignment methods for both single- and multi-task scenarios. We show the NP-hardness of the single-task case, and design polynomial-time algorithms with guaranteed approximation ratios. We study novel indexing and pruning techniques for further enhancing the performance in practice. Then, we extend the solution to multi-task scenarios and devise a parallel framework for speeding up the process of optimization. We conduct extensive experiments on both real and synthetic datasets to show the effectiveness of our proposals.

cs.DB↗

arXiv2020

On the Beamforming Design of Millimeter Wave UAV Networks: Power vs. Capacity Trade-Offs

The millimeter wave (mmWave) technology enables unmanned aerial vehicles (UAVs) to offer broadband high-speed wireless connectivity in fifth generation (5G) and beyond (6G) networks. However, the limited footprint of a single UAV implementing analog beamforming (ABF) requires multiple aerial stations to operate in swarms to provide ubiquitous network coverage, thereby posing serious constraints in terms of battery power consumption and swarm management. A possible remedy is to investigate the concept of hybrid beamforming (HBF) transceivers, which use a combination of analog beamformers as a solution to achieve higher flexibility in the beamforming design. This approach permits multiple ground users to be served simultaneously by the same UAV station, despite involving higher energy consumption in the radio frequency (RF) domain than its ABF counterpart. This paper presents a tractable stochastic analysis to characterize the downlink ergodic capacity and power consumption of UAV mmWave networks in an urban scenario, focusing on the trade-off between ABF and HBF architectures. A multi-beam coverage model is derived as a function of several UAV-specific parameters, including the number of UAVs, the deployment altitude, the antenna configuration, and the beamforming design. Our results, validated by simulation, show that, while ABF achieves better ergodic capacity at high altitudes, an HBF configuration with multiple beams, despite the use of more power-hungry RF blocks, consumes less power all the time with limited capacity degradation.

cs.NI↗

arXiv2020

LadaBERT: Lightweight Adaptation of BERT through Hybrid Model Compression

BERT is a cutting-edge language representation model pre-trained by a large corpus, which achieves superior performances on various natural language understanding tasks. However, a major blocking issue of applying BERT to online services is that it is memory-intensive and leads to unsatisfactory latency of user requests, raising the necessity of model compression. Existing solutions leverage the knowledge distillation framework to learn a smaller model that imitates the behaviors of BERT. However, the training procedure of knowledge distillation is expensive itself as it requires sufficient training data to imitate the teacher model. In this paper, we address this issue by proposing a hybrid solution named LadaBERT (Lightweight adaptation of BERT through hybrid model compression), which combines the advantages of different model compression methods, including weight pruning, matrix factorization and knowledge distillation. LadaBERT achieves state-of-the-art accuracy on various public datasets while the training overheads can be reduced by an order of magnitude.

cs.CL↗

arXiv2020

Evidence for bosonic mode coupling in electron dynamics of LiFeAs superconductor

Super-high resolution laser-based angle-resolved photoemission measurements are carried out on LiFeAs superconductor to investigate its electron dynamics. Three energy scales at $\sim$20 meV, $\sim$34 meV and $\sim$55 meV are revealed for the first time in the electron self-energy both in the superconducting state and normal state. The $\sim$20 meV and $\sim$34 meV scales can be attributed to the coupling of electrons with sharp bosonic modes which are most likely phonons. These observations provide definitive evidence on the existence of mode coupling in iron-based superconductors.

cond-mat.supr-con↗

arXiv2020

Deep-HOSeq: Deep Higher Order Sequence Fusion for Multimodal Sentiment Analysis

Multimodal sentiment analysis utilizes multiple heterogeneous modalities for sentiment classification. The recent multimodal fusion schemes customize LSTMs to discover intra-modal dynamics and design sophisticated attention mechanisms to discover the inter-modal dynamics from multimodal sequences. Although powerful, these schemes completely rely on attention mechanisms which is problematic due to two major drawbacks 1) deceptive attention masks, and 2) training dynamics. Nevertheless, strenuous efforts are required to optimize hyperparameters of these consolidate architectures, in particular their custom-designed LSTMs constrained by attention schemes. In this research, we first propose a common network to discover both intra-modal and inter-modal dynamics by utilizing basic LSTMs and tensor based convolution networks. We then propose unique networks to encapsulate temporal-granularity among the modalities which is essential while extracting information within asynchronous sequences. We then integrate these two kinds of information via a fusion layer and call our novel multimodal fusion scheme as Deep-HOSeq (Deep network with higher order Common and Unique Sequence information). The proposed Deep-HOSeq efficiently discovers all-important information from multimodal sequences and the effectiveness of utilizing both types of information is empirically demonstrated on CMU-MOSEI and CMU-MOSI benchmark datasets. The source code of our proposed Deep-HOSeq is and available at https://github.com/sverma88/Deep-HOSeq--ICDM-2020.

cs.AI↗

arXiv2020

Kernelized Multiview Subspace Analysis by Self-weighted Learning

With the popularity of multimedia technology, information is always represented or transmitted from multiple views. Most of the existing algorithms are graph-based ones to learn the complex structures within multiview data but overlooked the information within data representations. Furthermore, many existing works treat multiple views discriminatively by introducing some hyperparameters, which is undesirable in practice. To this end, abundant multiview based methods have been proposed for dimension reduction. However, there are still no research to leverage the existing work into a unified framework. To address this issue, in this paper, we propose a general framework for multiview data dimension reduction, named Kernelized Multiview Subspace Analysis (KMSA). It directly handles the multi-view feature representation in the kernel space, which provides a feasible channel for direct manipulations on multiview data with different dimensions. Meanwhile, compared with those graph-based methods, KMSA can fully exploit information from multiview data with nothing to lose. Furthermore, since different views have different influences on KMSA, we propose a self-weighted strategy to treat different views discriminatively according to their contributions. A co-regularized term is proposed to promote the mutual learning from multi-views. KMSA combines self-weighted learning with the co-regularized term to learn appropriate weights for all views. We also discuss the influence of the parameters in KMSA regarding the weights of multi-views. We evaluate our proposed framework on 6 multiview datasets for classification and image retrieval. The experimental results validate the advantages of our proposed method.

cs.LG↗

arXiv2020

Perturbed Amplitude Flow for Phase Retrieval

In this paper, we propose a new non-convex algorithm for solving the phase retrieval problem, i.e., the reconstruction of a signal $ \vx\in\H^n $ ($\H=\R$ or $\C$) from phaseless samples $ b_j=\abs{\langle \va_j, \vx\rangle } $, $ j=1,\ldots,m $. The proposed algorithm solves a new proposed model, perturbed amplitude-based model, for phase retrieval and is correspondingly named as {\em Perturbed Amplitude Flow} (PAF). We prove that PAF can recover $c\vx$ ($\abs{c} = 1$) under $\mathcal{O}(n)$ Gaussian random measurements (optimal order of measurements). Starting with a designed initial point, our PAF algorithm iteratively converges to the true solution at a linear rate for both real and complex signals. Besides, PAF algorithm needn't any truncation or re-weighted procedure, so it enjoys simplicity for implementation. The effectiveness and benefit of the proposed method are validated by both the simulation studies and the experiment of recovering natural images.

math.NA↗

arXiv2020

A Homotopy Method Based on Theory of Functional Connections

A method for solving zero-finding problems is developed by tracking homotopy paths, which define connecting channels between an auxiliary problem and the objective problem. Current algorithms' success highly relies on empirical knowledge, due to manually, inherently selected homotopy paths. This work introduces a homotopy method based on the Theory of Functional Connections (TFC). The TFC-based method implicitly defines infinite homotopy paths, from which the most promising ones are selected. A two-layer continuation algorithm is devised, where the first layer tracks the homotopy path by monotonously varying the continuation parameter, while the second layer recovers possible failures resorting to a TFC representation of the homotopy function. Compared to pseudo-arclength methods, the proposed TFC-based method retains the simplicity of direct continuation while allowing a flexible path switching. Numerical simulations illustrate the effectiveness of the presented method.

math.OC↗

arXiv2020

High Quality Remote Sensing Image Super-Resolution Using Deep Memory Connected Network

Single image super-resolution is an effective way to enhance the spatial resolution of remote sensing image, which is crucial for many applications such as target detection and image classification. However, existing methods based on the neural network usually have small receptive fields and ignore the image detail. We propose a novel method named deep memory connected network (DMCN) based on a convolutional neural network to reconstruct high-quality super-resolution images. We build local and global memory connections to combine image detail with environmental information. To further reduce parameters and ease time-consuming, we propose downsampling units, shrinking the spatial size of feature maps. We test DMCN on three remote sensing datasets with different spatial resolution. Experimental results indicate that our method yields promising improvements in both accuracy and visual performance over the current state-of-the-art.

eess.IV↗

arXiv2020

Where is the Model Looking At?--Concentrate and Explain the Network Attention

Image classification models have achieved satisfactory performance on many datasets, sometimes even better than human. However, The model attention is unclear since the lack of interpretability. This paper investigates the fidelity and interpretability of model attention. We propose an Explainable Attribute-based Multi-task (EAT) framework to concentrate the model attention on the discriminative image area and make the attention interpretable. We introduce attributes prediction to the multi-task learning network, helping the network to concentrate attention on the foreground objects. We generate attribute-based textual explanations for the network and ground the attributes on the image to show visual explanations. The multi-model explanation can not only improve user trust but also help to find the weakness of network and dataset. Our framework can be generalized to any basic model. We perform experiments on three datasets and five basic models. Results indicate that the EAT framework can give multi-modal explanations that interpret the network decision. The performance of several recognition approaches is improved by guiding network attention.

cs.CV↗

arXiv2020

Symmetry-Adapted Tight-Binding Electronic Structure Analysis of Carbon Nanotubes with Defects, Kinks, Twist, and Stretch

This paper applies a symmetry-adapted method to examine the influence of deformation and defects on the electronic structure and band structure in carbon nanotubes. First, the symmetry-adapted approach is used to develop the analog of Bloch waves. Building on this, the technique of perfectly-matched layers is applied to develop a method to truncate the computational domain of electronic structure calculations without spurious size effects. This provides an efficient and accurate numerical approach to compute the electronic structure and electromechanics of defects in nanotubes. The computational method is applied to study the effect of twist, stretch, and bending, with and without various types of defects, on the band structure of nanotubes. Specifically, the effect of stretch and twist on band structure in defect-free conducting and semiconducting nanotubes is examined, and the interaction with vacancy defects is elucidated. Next, the effect of localized bending or kinking on the electronic structure is studied. Finally, the paper examines the effect of 5-8-5 Stone-Wales defects. In all of these settings, the perfectly-matched layer method enables the calculation of localized non-propagating defect modes with energies in the bandgap of the defect-free nanotube.

cond-mat.mes-hall↗

arXiv2020

A Mathematical Introduction to Generative Adversarial Nets (GAN)

Generative Adversarial Nets (GAN) have received considerable attention since the 2014 groundbreaking work by Goodfellow et al. Such attention has led to an explosion in new ideas, techniques and applications of GANs. To better understand GANs we need to understand the mathematical foundation behind them. This paper attempts to provide an overview of GANs from a mathematical point of view. Many students in mathematics may find the papers on GANs more difficulty to fully understand because most of them are written from computer science and engineer point of view. The aim of this paper is to give more mathematically oriented students an introduction to GANs in a language that is more familiar to them.

cs.LG↗

arXiv2020

Sentence Guided Temporal Modulation for Dynamic Video Thumbnail Generation

We consider the problem of sentence specified dynamic video thumbnail generation. Given an input video and a user query sentence, the goal is to generate a video thumbnail that not only provides the preview of the video content, but also semantically corresponds to the sentence. In this paper, we propose a sentence guided temporal modulation (SGTM) mechanism that utilizes the sentence embedding to modulate the normalized temporal activations of the video thumbnail generation network. Unlike the existing state-of-the-art method that uses recurrent architectures, we propose a non-recurrent framework that is simple and allows much more parallelization. Extensive experiments and analysis on a large-scale dataset demonstrate the effectiveness of our framework.

cs.CV↗

arXiv2020

Direct visualization of ambipolar Mott transition in cuprate CuO2 planes

Identifying the essence of doped Mott insulators is one of the major outstanding problems in condensed matter physics and the key to understanding the high-temperature superconductivity in cuprates. We report real space visualization of Mott transition in Sr1-xLaxCuO2+y cuprate films that cover the entire electron- and hole-doped regimes. Tunneling conductance measurements directly on the cooper-oxide (CuO2) planes reveal a systematic shift in the Fermi level, while the fundamental Mott-Hubbard band structure remains unchanged. This is further demonstrated by exploring atomic-scale electronic response of CuO2 to substitutional dopants and intrinsic defects in a sister compound Sr0.92Nd0.08CuO2. The results could be better explained in the framework of self-modulation doping, similar to that in semiconductor heterostructures, and form a basis for developing any microscopic theories for cuprate superconductivity.

cond-mat.supr-con↗

arXiv2020

Ontology-based annotation and analysis of COVID-19 phenotypes

The epidemic of COVID-19 has caused an unpredictable and devastated disaster to the public health in different territories around the world. Common phenotypes include fever, cough, shortness of breath, and chills. With more cases investigated, other clinical phenotypes are gradually recognized, for example, loss of smell, and loss of tastes. Compared with discharged or cured patients, severe or died patients often have one or more comorbidities, such as hypertension, diabetes, and cardiovascular disease. In this study, we systematically collected and analyzed COVID-19-related clinical phenotypes from 70 articles. The commonly occurring 17 phenotypes were classified into different groups based on the Human Phenotype Ontology (HPO). Based on the HP classification, we systematically analyze three nervous phenotypes (loss of smell, loss of taste, and headache) and four abdominal phenotypes (nausea, vomiting, abdominal pain, and diarrhea) identified in patients, and found that patients from Europe and USA turned to have higher nervous phenotypes and abdominal phenotypes than patients from Asia. A total of 23 comorbidities were found to commonly exist among COVID-19 patients. Patients with these comorbidities such as diabetes and kidney failure had worse outcomes compared with those without these comorbidities.

q-bio.OT↗