Searcharxiv⌕ Search

arXiv subjects

Chao Wang

Publications and source records attributed to Chao Wang.

At least 631 records · Page 35Linked to original sources
arXiv2019

Shield Synthesis for Real: Enforcing Safety in Cyber-Physical Systems

Cyber-physical systems are often safety-critical in that violations of safety properties may lead to catastrophes. We propose a method to enforce the safety of systems with real-valued signals by synthesizing a runtime enforcer called the shield. Whenever the system violates a property, the shield, composed with the system, makes correction instantaneously to ensure that no erroneous output is generated by the combined system. While techniques for synthesizing Boolean shields are well understood, they do not handle real-valued signals ubiquitous in cyber-physical systems, meaning corrections may be either unrealizable or inefficient to compute in the real domain. We solve the realizability and efficiency problems by statically analyzing the compatibility of predicates defined over real-valued signals, and using the analysis result to constrain a two-player safety game used to synthesize the shield. We have implemented the method and demonstrated its effectiveness and efficiency on a variety of applications, including an automotive powertrain control system.

cs.LO↗
arXiv2019

Efficient methods to determine the reversibility of general 1D linear cellular automata in polynomial complexity

In this paper, we study reversibility of one-dimensional(1D) linear cellular automata(LCA) under null boundary condition, whose core problems have been divided into two main parts: calculating the period of reversibility and verifying the reversibility in a period. With existing methods, the time and space complexity of these two parts are still too expensive to be employed. So the process soon becomes totally incalculable with a slightly big size, which greatly limits its application. In this paper, we set out to solve these two problems using two efficient algorithms, which make it possible to solve reversible LCA of very large size. Furthermore, we provide an interesting perspective to conversely generate 1D LCA from a given period of reversibility. Due to our methods' efficiency, we can calculate the reversible LCA with large size, which has much potential to enhance security in cryptography system.

cs.CC↗
arXiv2019

Evaluating bird collision risk of a high-speed railway crossing the habitat of the crested ibis (Nipponia nippon) in Qinling Mountains, China

Bird collisions with high-speed transport modes is a vital topic on vehicle safety and wildlife protection, especially when high-speed trains, with an average speed of 250km/h, have to run across the habitat of an endangered bird species. This paper evaluates the bird-train collision risk associated with a recent high-speed railway project in Qinling Mountains, China, for the crested ibis (Nipponia nippon) and other local bird species. Using line transect surveys and walking monitoring techniques, we surveyed the population abundance, spatial-temporal distributions, and bridge-crossing behaviors of the birds in the study area. The results show that: (1) The crested ibis and the egret were the two most abundant waterfowl species in the study area. The RAI of these two species were about 43.69% and 42.91%, respectively; (2) Crested ibises overall habitat closer to the railway bridge. 91.63% of them were firstly detected within the range of 0m to 25m of the vicinity of the bridge; (3) the ratio between crossing over and under the railway bridge was about 7:3. Crested ibises were found to prefer to fly over the railway bridge (89.29% of the total crossing activities observed for this species). Egrets were more likely to cross the railway below the bridge, and they accounted for 60.27% of the total observations of crossing under the bridge. We recommend that, while the collision risk of crested ibises could be low, barrier-like structures, such as fences, should still be considered to promote the conservation of multiple bird species in the area. This paper provides a practical case for railway ecology studies in China. To our best knowledge, this is the first high-speed railway project that takes protecting crested ibises as one of the top priorities, and exemplifies the recent nationwide initiative towards the construction of "eco-civilization" in the country.

q-bio.PE↗
arXiv2019

Sub-band Convolutional Neural Networks for Small-footprint Spoken Term Classification

This paper proposes a Sub-band Convolutional Neural Network for spoken term classification. Convolutional neural networks (CNNs) have proven to be very effective in acoustic applications such as spoken term classification, keyword spotting, speaker identification, acoustic event detection, etc. Unlike applications in computer vision, the spatial invariance property of 2D convolutional kernels does not fit acoustic applications well since the meaning of a specific 2D kernel varies a lot along the feature axis in an input feature map. We propose a sub-band CNN architecture to apply different convolutional kernels on each feature sub-band, which makes the overall computation more efficient. Experimental results show that the computational efficiency brought by sub-band CNN is more beneficial for small-footprint models. Compared to a baseline full band CNN for spoken term classification on a publicly available Speech Commands dataset, the proposed sub-band CNN architecture reduces the computation by 39.7% on commands classification, and 49.3% on digits classification with accuracy maintained.

eess.AS↗
arXiv2019

Compression of Acoustic Event Detection Models With Quantized Distillation

Acoustic Event Detection (AED), aiming at detecting categories of events based on audio signals, has found application in many intelligent systems. Recently deep neural network significantly advances this field and reduces detection errors to a large scale. However how to efficiently execute deep models in AED has received much less attention. Meanwhile state-of-the-art AED models are based on large deep models, which are computational demanding and challenging to deploy on devices with constrained computational resources. In this paper, we present a simple yet effective compression approach which jointly leverages knowledge distillation and quantization to compress larger network (teacher model) into compact network (student model). Experimental results show proposed technique not only lowers error rate of original compact network by 15% through distillation but also further reduces its model size to a large extent (2% of teacher, 12% of full-precision student) through quantization.

eess.AS↗
arXiv2019

Molecular Property Prediction: A Multilevel Quantum Interactions Modeling Perspective

Predicting molecular properties (e.g., atomization energy) is an essential issue in quantum chemistry, which could speed up much research progress, such as drug designing and substance discovery. Traditional studies based on density functional theory (DFT) in physics are proved to be time-consuming for predicting large number of molecules. Recently, the machine learning methods, which consider much rule-based information, have also shown potentials for this issue. However, the complex inherent quantum interactions of molecules are still largely underexplored by existing solutions. In this paper, we propose a generalizable and transferable Multilevel Graph Convolutional neural Network (MGCN) for molecular property prediction. Specifically, we represent each molecule as a graph to preserve its internal structure. Moreover, the well-designed hierarchical graph neural network directly extracts features from the conformation and spatial information followed by the multilevel interactions. As a consequence, the multilevel overall representations can be utilized to make the prediction. Extensive experiments on both datasets of equilibrium and off-equilibrium molecules demonstrate the effectiveness of our model. Furthermore, the detailed results also prove that MGCN is generalizable and transferable for the prediction.

physics.comp-ph↗
arXiv2019

Symmetric graphs of valency seven and their basic normal quotient graphs

A graph $Γ$ is basic if Aut$Γ$ has no normal subgroup $N\ne1$ such that $Γ$ is a normal cover of the normal quotient graph $Γ_N$. In this paper, we completely determine the basic normal quotient graphs of all connected 7-valent symmetric graphs of order $2pq^n$ with $p < q$ odd primes, which consist of an infinite family of dihedrants of order $2p$ with $p\equiv1$(mod 7), and 6 specific graphs with order at most 310. As a consequence, it shows that, for any given positive integer n, there are only finitely many connected 2-arc-transitive 7-valent graphs of order $2pq^n$ with $7\ne p<q$ primes, partially generalizing Theorem 1 of Conder, Li and Potocnik [On the orders of arc-transitive graphs, J. Algebra 421 (2015), 167-186].

math.CO↗
arXiv2019

Multimodal and Multi-view Models for Emotion Recognition

Studies on emotion recognition (ER) show that combining lexical and acoustic information results in more robust and accurate models. The majority of the studies focus on settings where both modalities are available in training and evaluation. However, in practice, this is not always the case; getting ASR output may represent a bottleneck in a deployment pipeline due to computational complexity or privacy-related constraints. To address this challenge, we study the problem of efficiently combining acoustic and lexical modalities during training while still providing a deployable acoustic model that does not require lexical inputs. We first experiment with multimodal models and two attention mechanisms to assess the extent of the benefits that lexical information can provide. Then, we frame the task as a multi-view learning problem to induce semantic information from a multimodal model into our acoustic-only network using a contrastive loss function. Our multimodal model outperforms the previous state of the art on the USC-IEMOCAP dataset reported on lexical and acoustic information. Additionally, our multi-view-trained acoustic network significantly surpasses models that have been exclusively trained with acoustic features.

cs.CL↗
arXiv2019

Semi-parametric Realized Nonlinear Conditional Autoregressive Expectile and Expected Shortfall

A joint conditional autoregressive expectile and Expected Shortfall framework is proposed. The framework is extended through incorporating a measurement equation which models the contemporaneous dependence between the realized measures and the latent conditional expectile. Nonlinear threshold specification is further incorporated into the proposed framework. A Bayesian Markov Chain Monte Carlo method is adapted for estimation, whose properties are assessed and compared with maximum likelihood via a simulation study. One-day-ahead VaR and ES forecasting studies, with seven market indices, provide empirical support to the proposed models.

q-fin.RM↗
arXiv2019

Joint 3D Localization and Classification of Space Debris using a Multispectral Rotating Point Spread Function

We consider the problem of joint three-dimensional (3D) localization and material classification of unresolved space debris using a multispectral rotating point spread function (RPSF). The use of RPSF allows one to estimate the 3D locations of point sources from their rotated images acquired by a single 2D sensor array, since the amount of rotation of each source image about its x, y location depends on its axial distance z. Using multi-spectral images, with one RPSF per spectral band, we are able not only to localize the 3D positions of the space debris but also classify their material composition. We propose a three-stage method for achieving joint localization and classification. In Stage 1, we adopt an optimization scheme for localization in which the spectral signature of each material is assumed to be uniform, which significantly improves efficiency and yields better localization results than possible with a single spectral band. In Stage 2, we estimate the spectral signature and refine the localization result via an alternating approach. We process classification in the final stage. Both Poisson noise and Gaussian noise models are considered, and the implementation of each is discussed. Numerical tests using multispectral data from NASA show the efficiency of our three-stage approach and illustrate the improvement of point source localization and spectral classification from using multiple bands over a single band.

eess.IV↗
arXiv2019

Gradient optimization of fermionic projected entangled pair states on directed lattices

The recently developed stochastic gradient method combined with Monte Carlo sampling techniques [PRB {\bf 95}, 195154 (2017)] offers a low scaling and accurate method to optimize the projected entangled pair states (PEPS). We extended this method to the fermionic PEPS (fPEPS). To simplify the implementation, we introduce a fermi arrow notation to specify the order of the fermion operators in the virtual entangled EPR pairs. By defining some local operation rules associated with the fermi arrows, one can implement fPEPS algorithms very similar to that of standard PEPS. We benchmark the method for the interacting spinless fermion models, and the t-J models. The numerical calculations show that the gradient optimization greatly improves the results of simple update method. Furthermore, much larger virtual bond dimensions ($D$) and truncation dimensions ($D_c$) than those of boson and spin systems are necessary to converge the results. The method therefore offer a powerful tool to simulate fermion systems because it has much lower scaling than the direct contraction methods.

cond-mat.str-el↗
arXiv2019

Plane-Based Optimization of Geometry and Texture for RGB-D Reconstruction of Indoor Scenes

We present a novel approach to reconstruct RGB-D indoor scene with plane primitives. Our approach takes as input a RGB-D sequence and a dense coarse mesh reconstructed by some 3D reconstruction method on the sequence, and generate a lightweight, low-polygonal mesh with clear face textures and sharp features without losing geometry details from the original scene. To achieve this, we firstly partition the input mesh with plane primitives, simplify it into a lightweight mesh next, then optimize plane parameters, camera poses and texture colors to maximize the photometric consistency across frames, and finally optimize mesh geometry to maximize consistency between geometry and planes. Compared to existing planar reconstruction methods which only cover large planar regions in the scene, our method builds the entire scene by adaptive planes without losing geometry details and preserves sharp features in the final mesh. We demonstrate the effectiveness of our approach by applying it onto several RGB-D scans and comparing it to other state-of-the-art reconstruction methods.

cs.CV↗
arXiv2019

Efficient Plane-Based Optimization of Geometry and Texture for Indoor RGB-D Reconstruction

We propose a novel approach to reconstruct RGB-D indoor scene based on plane primitives. Our approach takes as input a RGB-D sequence and a dense coarse mesh reconstructed from it, and generates a lightweight, low-polygonal mesh with clear face textures and sharp features without losing geometry details from the original scene. Compared to existing methods which only cover large planar regions in the scene, our method builds the entire scene by adaptive planes without losing geometry details and also preserves sharp features in the mesh. Experiments show that our method is more efficient to generate textured mesh from RGB-D data than state-of-the-arts.

cs.CV↗
arXiv2019

The Lower The Simpler: Simplifying Hierarchical Recurrent Models

To improve the training efficiency of hierarchical recurrent models without compromising their performance, we propose a strategy named as `the lower the simpler', which is to simplify the baseline models by making the lower layers simpler than the upper layers. We carry out this strategy to simplify two typical hierarchical recurrent models, namely Hierarchical Recurrent Encoder-Decoder (HRED) and R-NET, whose basic building block is GRU. Specifically, we propose Scalar Gated Unit (SGU), which is a simplified variant of GRU, and use it to replace the GRUs at the middle layers of HRED and R-NET. Besides, we also use Fixed-size Ordinally-Forgetting Encoding (FOFE), which is an efficient encoding method without any trainable parameter, to replace the GRUs at the bottom layers of HRED and R-NET. The experimental results show that the simplified HRED and the simplified R-NET contain significantly less trainable parameters, consume significantly less training time, and achieve slightly better performance than their baseline models.

cs.CL↗
arXiv2019

Explicit Utilization of General Knowledge in Machine Reading Comprehension

To bridge the gap between Machine Reading Comprehension (MRC) models and human beings, which is mainly reflected in the hunger for data and the robustness to noise, in this paper, we explore how to integrate the neural networks of MRC models with the general knowledge of human beings. On the one hand, we propose a data enrichment method, which uses WordNet to extract inter-word semantic connections as general knowledge from each given passage-question pair. On the other hand, we propose an end-to-end MRC model named as Knowledge Aided Reader (KAR), which explicitly uses the above extracted general knowledge to assist its attention mechanisms. Based on the data enrichment method, KAR is comparable in performance with the state-of-the-art MRC models, and significantly more robust to noise than them. When only a subset (20%-80%) of the training examples are available, KAR outperforms the state-of-the-art MRC models by a large margin, and is still reasonably robust to noise.

cs.AI↗
arXiv2019

Three-state Majority-Vote Model on Barabási-Albert and Cubic Networks and the Unitary Relation for Critical Exponents

We investigate the three-state majority-vote model with noise on scale-free and regular networks. In this model, an individual selects an opinion equal to the opinion of the majority of its neighbors with probability $1 - q$ and opposite to it with probability $q$. The parameter $q$ is called the noise parameter of the model. We build a network of interactions where $z$ neighbors are selected by each added site in the system, yielding a preferential attachment network with degree distribution $k^{-λ}$, where $λ\sim 3$. In this work, $z$ is called growth parameter. Using finite-size scaling analysis, we show that the critical exponents associated with the magnetization and magnetic susceptibility add up to unity when a volumetric scaling is used, regardless of the dimension of the network of interactions. Using Monte Carlo simulations, we calculate the critical noise parameter $q_c$ as a function of $z$ for the scale-free networks and obtain the phase diagram of the model. We find that the critical noise is an increasing function of the growth parameter $z$, and we define and verify numerically the unitary relation $\upsilon$ for the critical exponents by calculating $β/\barν$, $γ/\barν$ and $1/\barν$ for several values of the network parameter $z$. We also obtain the critical noise and the critical exponents for the two and three-state majority-vote model on cubic lattices networks where we illustrate the application of the unitary relation with a volumetric scaling.

cond-mat.stat-mech↗
arXiv2019

A Three-state Opinion Formation Model for Financial Markets

We propose a three-state microscopic opinion formation model for the purpose of simulating the dynamics of financial markets. In order to mimic the heterogeneous composition of the mass of investors in a market, the agent-based model considers two different types of traders: noise traders and contrarians. Agents are represented as nodes in a network of interactions and they can assume any of three distinct possible states (e.g. buy, sell or remain inactive). The time evolution of the state of an agent is dictated by probabilistic dynamics that include both local and global influences. A noise trader is subject to local interactions, tending to assume the majority state of its nearest neighbors, whilst a contrarian is subject to a global interaction with the behavior of the market as a whole, tending to assume the state of the global minority of the market. The model exhibits the typical qualitative and quantitative features of real financial time series, including distributions of returns with heavy tails, volatility clustering and long-time memory for the absolute values of the returns. The distributions of returns are fitted by means of coupled Gaussian distributions, quantitatively revealing transitions between leptokurtic, mesokurtic and platykurtic regimes in terms of a non-linear statistical coupling which describes the complexity of the system.

physics.soc-ph↗