OpenRaiser/Intern-Atlas huggingface dataset:
Distribution of Behaviour into Parallel Communicating Subsystems
Venue: arXiv cs.FL 2019
Year: 2019

The process of decomposing a complex system into simpler subsystems has been of interest to computer scientists over many decades, for instance, for the field of distributed computing. In this paper, motivated by the desire to distribute the process of active automata learning onto multiple subsystems, we study the equivalence between a system and the total behaviour of its decomposition which comprises subsystems with communication between them. We show synchronously- and asynchronously-communicating decompositions that maintain branching bisimilarity, and we prove that there is no decomposition operator that maintains divergence-preserving branching bisimilarity over all LTSs.
Generalized Separable Nonnegative Matrix Factorization
Venue: arXiv cs.LG 2019
Year: 2019

Nonnegative matrix factorization (NMF) is a linear dimensionality technique for nonnegative data with applications such as image analysis, text mining, audio source separation and hyperspectral unmixing. Given a data matrix $M$ and a factorization rank $r$, NMF looks for a nonnegative matrix $W$ with $r$ columns and a nonnegative matrix $H$ with $r$ rows such that $M \approx WH$. NMF is NP-hard to solve in general. However, it can be computed efficiently under the separability assumption which requires that the basis vectors appear as data points, that is, that there exists an index set $\mathcal{K}$ such that $W = M(:,\mathcal{K})$. In this paper, we generalize the separability assumption: We only require that for each rank-one factor $W(:,k)H(k,:)$ for $k=1,2,\dots,r$, either $W(:,k) = M(:,j)$ for some $j$ or $H(k,:) = M(i,:)$ for some $i$. We refer to the corresponding problem as generalized separable NMF (GS-NMF). We discuss some properties of GS-NMF and propose a convex optimization model which we solve using a fast gradient method. We also propose a heuristic algorithm inspired by the successive projection algorithm. To verify the effectiveness of our methods, we compare them with several state-of-the-art separable NMF algorithms on synthetic, document and image data sets.
Partially APN Boolean functions and classes of functions that are not APN infinitely often
Venue: arXiv cs.IT 2019
Year: 2019

In this paper we define a notion of partial APNness and find various characterizations and constructions of classes of functions satisfying this condition. We connect this notion to the known conjecture that APN functions modified at a point cannot remain APN. In the second part of the paper, we find conditions for some transformations not to be partially APN, and in the process, we find classes of functions that are never APN for infinitely many extensions of the prime field $\F_2$, extending some earlier results of Leander and Rodier.
On the comparison of three numerical methods applied to building simulation: finite-differences, RC circuit approximation and a spectral method
Venue: arXiv cs.CE 2019
Year: 2019

Predictions of physical phenomena in buildings are carried out by using physical models formulated as a mathematical problem and solved by means of numerical methods, aiming at evaluating, for instance, the building thermal or hygrothermal performance by calculating distributions and fluxes of heat and moisture transfer. Therefore, the choice of the numerical method is crucial since it is a compromise among (i) the solution accuracy, (ii) the computational cost to obtain the solution and (iii) the complexity of the method implementation. An efficient numerical method enables to compute an accurate solution with a minimum computational run time (CPU). On that account, this article brings an investigation on the performance of three numerical methods. The first one is the standard and widely used finite-difference approach, while the second one is the so-called RC approach, which is a particular method brought to the building physics area by means of an analogy of electric circuits. The third numerical method is the spectral one, which has been recently proposed to solve nonlinear diffusive problems in building physics. The three methods are evaluated in terms of accuracy on the assessment of the dependent variable (temperature or vapor pressure) or of density of fluxes for three different cases: i) heat diffusion through a concrete slab, ii) moisture diffusion through an aerated concrete slab and iii) heat diffusion using measured temperatures as boundary conditions. Results highlight the spectral approach as the most accurate method. The RC based model with a few number of resistances does not provide accurate results for temperature and vapor pressure distributions neither to flux densities nor conduction loads.
Be a Leader or Become a Follower: The Strategy to Commit to with Multiple Leaders (Extended Version)
Venue: arXiv cs.GT 2019
Year: 2019

We study the problem of computing correlated strategies to commit to in games with multiple leaders and followers. To the best of our knowledge, this problem is widely unexplored so far, as the majority of the works in the literature focus on games with a single leader and one or more followers. The fundamental ingredient of our model is that a leader can decide whether to participate in the commitment or to defect from it by taking on the role of follower. This introduces a preliminary stage where, before the underlying game is played, the leaders make their decisions to reach an agreement on the correlated strategy to commit to. We distinguish three solution concepts on the basis of the constraints that they enforce on the agreement reached by the leaders. Then, we provide a comprehensive study of the properties of our solution concepts, in terms of existence, relation with other solution concepts, and computational complexity.
Standing on the Shoulders of Giants: AI-driven Calibration of Localisation Technologies
Venue: arXiv cs.NI 2019
Year: 2019

High accuracy localisation technologies exist but are prohibitively expensive to deploy for large indoor spaces such as warehouses, factories, and supermarkets to track assets and people. However, these technologies can be used to lend their highly accurate localisation capabilities to low-cost, commodity, and less-accurate technologies. In this paper, we bridge this link by proposing a technology-agnostic calibration framework based on artificial intelligence to assist such low-cost technologies through highly accurate localisation systems. A single-layer neural network is used to calibrate less accurate technology using more accurate one such as BLE using UWB and UWB using a professional motion tracking system. On a real indoor testbed, we demonstrate an increase in accuracy of approximately 70% for BLE and 50% for UWB. Not only the proposed approach requires a very short measurement campaign, the low complexity of the single-layer neural network also makes it ideal for deployment on constrained devices typically for localisation purposes.
Gaze-in-wild: A dataset for studying eye and head coordination in everyday activities
Venue: arXiv cs.CV 2019
Year: 2019

The interaction between the vestibular and ocular system has primarily been studied in controlled environments. Consequently, off-the shelf tools for categorization of gaze events (e.g. fixations, pursuits, saccade) fail when head movements are allowed. Our approach was to collect a novel, naturalistic, and multimodal dataset of eye+head movements when subjects performed everyday tasks while wearing a mobile eye tracker equipped with an inertial measurement unit and a 3D stereo camera. This Gaze-in-the-Wild dataset (GW) includes eye+head rotational velocities (deg/s), infrared eye images and scene imagery (RGB+D). A portion was labelled by coders into gaze motion events with a mutual agreement of 0.72 sample based Cohen's $κ$. This labelled data was used to train and evaluate two machine learning algorithms, Random Forest and a Recurrent Neural Network model, for gaze event classification. Assessment involved the application of established and novel event based performance metrics. Classifiers achieve $\sim$90$\%$ human performance in detecting fixations and saccades but fall short (60$\%$) on detecting pursuit movements. Moreover, pursuit classification is far worse in the absence of head movement information. A subsequent analysis of feature significance in our best-performing model revealed a reliance upon absolute eye and head velocity, indicating that classification does not require spatial alignment of the head and eye tracking coordinate systems. The GW dataset, trained classifiers and evaluation metrics will be made publicly available with the intention of facilitating growth in the emerging area of head-free gaze event classification.
Anomaly Detection in Images
Venue: arXiv cs.CV 2019
Year: 2019

Visual defect assessment is a form of anomaly detection. This is very relevant in finding faults such as cracks and markings in various surface inspection tasks like pavement and automotive parts. The task involves detection of deviation/divergence of anomalous samples from the normal ones. Two of the major challenges in supervised anomaly detection are the lack of labelled training data and the low availability of anomaly instances. Semi-supervised methods which learn the underlying distribution of the normal samples and then measure the deviation/divergence from the estimated model as the anomaly score have limitations in their overall ability to detect anomalies. This paper proposes the application of network-based deep transfer learning using convolutional neural networks (CNNs) for the task of anomaly detection. Single class SVMs have been used in the past with some success, however we hypothesize that deeper networks for single class classification should perform better. Results obtained on established anomaly detection benchmarks as well as on a real-world dataset, show that the proposed method clearly outperforms the existing state-of-the-art methods, by achieving a staggering average area under the receiver operating characteristic curve value of 0.99 for the tested data-sets which is an average improvement of 41% on the CIFAR10, 20% on MNIST and 16% on Cement Crack data-sets.
The Art of Food: Meal Image Synthesis from Ingredients
Venue: arXiv cs.CV 2019
Year: 2019

In this work we propose a new computational framework, based on generative deep models, for synthesis of photo-realistic food meal images from textual descriptions of its ingredients. Previous works on synthesis of images from text typically rely on pre-trained text models to extract text features, followed by a generative neural networks (GANs) aimed to generate realistic images conditioned on the text features. These works mainly focus on generating spatially compact and well-defined categories of objects, such as birds or flowers. In contrast, meal images are significantly more complex, consisting of multiple ingredients whose appearance and spatial qualities are further modified by cooking methods. We propose a method that first builds an attention-based ingredients-image association model, which is then used to condition a generative neural network tasked with synthesizing meal images. Furthermore, a cycle-consistent constraint is added to further improve image quality and control appearance. Extensive experiments show our model is able to generate meal image corresponding to the ingredients, which could be used to augment existing dataset for solving other computational food analysis problems.
Dominance margins for feedback systems
Venue: arXiv cs.SY 2019
Year: 2019

The paper introduces notions of robustness margins geared towards the analysis and design of systems that switch and oscillate. While such phenomena are ubiquitous in nature and in engineering, a theory of robustness for behaviors away from equilibria is lacking. The proposed framework addresses this need in the framework of p-dominance theory, which aims at generalizing stability theory for the analysis of systems with low-dimensional attractors. Dominance margins are introduced as natural generalisations of stability margins in the context of p-dominance analysis. In analogy with stability margins, dominance margins are shown to admit simple interpretations in terms of familiar frequency domain tools and to provide quantitative measures of robustness for multistable and oscillatory behaviors in Lure systems. The theory is illustrated by means of an elementary mechanical example.
Toward Runtime-Throttleable Neural Networks
Venue: arXiv cs.LG 2019
Year: 2019

As deep neural network (NN) methods have matured, there has been increasing interest in deploying NN solutions to "edge computing" platforms such as mobile phones or embedded controllers. These platforms are often resource-constrained, especially in energy storage and power, but state-of-the-art NN architectures are designed with little regard for resource use. Existing techniques for reducing the resource footprint of NN models produce static models that occupy a single point in the trade-space between performance and resource use. This paper presents an approach to creating runtime-throttleable NNs that can adaptively balance performance and resource use in response to a control signal. Throttleable networks allow intelligent resource management, for example by allocating fewer resources in "easy" conditions or when battery power is low. We describe a generic formulation of throttling via block-level gating, apply it to create throttleable versions of several standard CNN architectures, and demonstrate that our approach allows smooth performance throttling over a wide range of operating points in image classification and object detection tasks, with only a small loss in peak accuracy.
Thermal Responses of Connected HEVs Engine and Aftertreatment Systems to Eco-Driving
Venue: arXiv cs.SY 2019
Year: 2019

Connected and automated vehicles (CAVs) have been recognized as providing unprecedented opportunities for substantial fuel economy improvement through CAV-based vehicle speed trajectory optimization (eco-driving). At the same time, the implications of the CAV operation on thermal responses, including those of engine and exhaust aftertreatment system, have not been fully investigated. To this end, firstly, a sequential optimization framework for vehicle speed trajectory planning and powertrain control in hybrid electric CAVs is proposed in this paper. Next, the impact of eco-driving and power split optimization on the engine and catalytic converter thermal responses, as well as on the tailpipe emissions is characterized. Despite an average 16% improvement in fuel economy through sequential optimization, this study shows that eco-driving slows down the thermal responses, which could unfavorably affect the tailpipe emissions.
Deep Learning for Direct Hybrid Precoding in Millimeter Wave Massive MIMO Systems
Venue: arXiv cs.IT 2019
Year: 2019

This paper proposes a novel neural network architecture, that we call an auto-precoder, and a deep-learning based approach that jointly senses the millimeter wave (mmWave) channel and designs the hybrid precoding matrices with only a few training pilots. More specifically, the proposed machine learning model leverages the prior observations of the channel to achieve two objectives. First, it optimizes the compressive channel sensing vectors based on the surrounding environment in an unsupervised manner to focus the sensing power on the most promising spatial directions. This is enabled by a novel neural network architecture that accounts for the constraints on the RF chains and models the transmitter/receiver measurement matrices as two complex-valued convolutional layers. Second, the proposed model learns how to construct the RF beamforming vectors of the hybrid architectures directly from the projected channel vector (the received sensing vector). The auto-precoder neural network that incorporates both the channel sensing and beam prediction is trained end-to-end as a multi-task classification problem. Thanks to this design methodology that leverages the prior channel observations and the implicit awareness about the surrounding environment/user distributions, the proposed approach significantly reduces the training overhead compared to classical (non-machine learning) solutions. For example, for a system of 64 transmit and 64 receive antennas, with 3 RF chains at both sides, the proposed solution needs only 8 or 16 channel training pilots to directly predict the RF beamforming/combining vectors of the hybrid architectures and achieve near-optimal achievable rates. This highlights a promising solution for the channel estimation and hybrid precoding design problem in mmWave and massive MIMO systems.
Parallel Algorithm for Non-Monotone DR-Submodular Maximization
Venue: arXiv cs.DS 2019
Year: 2019

In this work, we give a new parallel algorithm for the problem of maximizing a non-monotone diminishing returns submodular function subject to a cardinality constraint. For any desired accuracy $ε$, our algorithm achieves a $1/e - ε$ approximation using $O(\log{n} \log(1/ε) / ε^3)$ parallel rounds of function evaluations. The approximation guarantee nearly matches the best approximation guarantee known for the problem in the sequential setting and the number of parallel rounds is nearly-optimal for any constant $ε$. Previous algorithms achieve worse approximation guarantees using $Ω(\log^2{n})$ parallel rounds. Our experimental evaluation suggests that our algorithm obtains solutions whose objective value nearly matches the value obtained by the state of the art sequential algorithms, and it outperforms previous parallel algorithms in number of parallel rounds, iterations, and solution quality.
Technical Report of the Video Event Reconstruction and Analysis (VERA) System -- Shooter Localization, Models, Interface, and Beyond
Venue: arXiv cs.CV 2019
Year: 2019

Every minute, hundreds of hours of video are uploaded to social media sites and the Internet from around the world. This material creates a visual record of the experiences of a significant percentage of humanity and can help illuminate how we live in the present moment. When properly analyzed, this video can also help analysts to reconstruct events of interest, including war crimes, human rights violations, and terrorist acts. Machine learning and computer vision can play a crucial role in this process. In this technical report, we describe the Video Event Reconstruction and Analysis (VERA) system. This new tool brings together a variety of capabilities we have developed over the past few years (including video synchronization and geolocation to order unstructured videos lacking metadata over time and space, and sound recognition algorithms) to enable the reconstruction and analysis of events captured on video. Among other uses, VERA enables the localization of a shooter from just a few videos that include the sound of gunshots. To demonstrate the efficacy of this suite of tools, we present the results of estimating the shooter's location of the Las Vegas Shooting in 2017 and show that VERA accurately predicts the shooter's location using only the first few gunshots. We then point out future directions that can help improve the system and further reduce unnecessary human labor in the process. All of the components of VERA run through a web interface that enables human-in-the-loop verification to ensure accurate estimations. All relevant source code, including the web interface and machine learning models, is freely available on Github. We hope that researchers and software developers will be inspired to improve and expand this system moving forward to better meet the needs of human rights and public safety.
Can We Derive Explicit and Implicit Bias from Corpus?
Venue: arXiv cs.SI 2019
Year: 2019

Language is a popular resource to mine speakers' attitude bias, supposing that speakers' statements represent their bias on concepts. However, psychology studies show that people's explicit bias in statements can be different from their implicit bias in mind. Although both explicit and implicit bias are useful for different applications, current automatic techniques do not distinguish them. Inspired by psychological measurements of explicit and implicit bias, we develop an automatic language-based technique to reproduce psychological measurements on large population. By connecting each psychological measurement with the statements containing the certain combination of special words, we derive explicit and implicit bias by understanding the sentiment of corresponding category of statements. Extensive experiments on English and Chinese serious media (Wikipedia) and non-serious media (social media) show that our method successfully reproduce the small-scale psychological observations on large population and achieve new findings.
Supervised Online Hashing via Similarity Distribution Learning
Venue: arXiv cs.CV 2019
Year: 2019

Online hashing has attracted extensive research attention when facing streaming data. Most online hashing methods, learning binary codes based on pairwise similarities of training instances, fail to capture the semantic relationship, and suffer from a poor generalization in large-scale applications due to large variations. In this paper, we propose to model the similarity distributions between the input data and the hashing codes, upon which a novel supervised online hashing method, dubbed as Similarity Distribution based Online Hashing (SDOH), is proposed, to keep the intrinsic semantic relationship in the produced Hamming space. Specifically, we first transform the discrete similarity matrix into a probability matrix via a Gaussian-based normalization to address the extremely imbalanced distribution issue. And then, we introduce a scaling Student t-distribution to solve the challenging initialization problem, and efficiently bridge the gap between the known and unknown distributions. Lastly, we align the two distributions via minimizing the Kullback-Leibler divergence (KL-diverence) with stochastic gradient descent (SGD), by which an intuitive similarity constraint is imposed to update hashing model on the new streaming data with a powerful generalizing ability to the past data. Extensive experiments on three widely-used benchmarks validate the superiority of the proposed SDOH over the state-of-the-art methods in the online retrieval task.
Discriminative structural graph classification
Venue: arXiv cs.LG 2019
Year: 2019

This paper focuses on the discrimination capacity of aggregation functions: these are the permutation invariant functions used by graph neural networks to combine the features of nodes. Realizing that the most powerful aggregation functions suffer from a dimensionality curse, we consider a restricted setting. In particular, we show that the standard sum and a novel histogram-based function have the capacity to discriminate between any fixed number of inputs chosen by an adversary. Based on our insights, we design a graph neural network aiming, not to maximize discrimination capacity, but to learn discriminative graph representations that generalize well. Our empirical evaluation provides evidence that our choices can yield benefits to the problem of structural graph classification.