OpenRaiser/Intern-Atlas huggingface dataset:
Evolutionary Computing Approach to Optimize Superframe Scheduling on Industrial Wireless Sensor Networks
Venue: arXiv cs.NI 2018
Year: 2018

There has been a paradigm shift in the industrial wireless sensor domain caused by the Internet of Things (IoT). IoT is a thriving technology leading the way in short range and fixed wireless sensing. One of the issues in Industrial Wireless Sensor Network-IWSN is finding the optimal solution for minimizing the defect time in superframe scheduling. This paper proposes a method using the evolutionary algorithms approach namely particle swarm optimization (PSO), Orthogonal Learning PSO, genetic algorithms (GA) and modified GA for optimizing the scheduling of superframe. We have also evaluated a contemporary method, deadline monotonic scheduling on the ISA 100.11a. By using this standard as a case study, the presented simulations are object-oriented based, with numerous variations in the number of timeslots and wireless sensor nodes. The simulation results show that the use of GA and modified GA can provide better performance for idle and missed deadlines. A comprehensive and detailed performance evaluation is given in the paper.
Set Cross Entropy: Likelihood-based Permutation Invariant Loss Function for Probability Distributions
Venue: arXiv cs.LG 2018
Year: 2018

We propose a permutation-invariant loss function designed for the neural networks reconstructing a set of elements without considering the order within its vector representation. Unlike popular approaches for encoding and decoding a set, our work does not rely on a carefully engineered network topology nor by any additional sequential algorithm. The proposed method, Set Cross Entropy, has a natural information-theoretic interpretation and is related to the metrics defined for sets. We evaluate the proposed approach in two object reconstruction tasks and a rule learning task.
A Two-Step Learning and Interpolation Method for Location-Based Channel Database
Venue: arXiv cs.IT 2018
Year: 2018

Timely and accurate knowledge of channel state information (CSI) is necessary to support scheduling operations at both physical and network layers. In order to support pilot-free channel estimation in cell sleeping scenarios, we propose to adopt a channel database that stores the CSI as a function of geographic locations. Such a channel database is generated from historical user records, which usually can not cover all the locations in the cell. Therefore, we develop a two-step interpolation method to infer the channels at the uncovered locations. The method firstly applies the K-nearest-neighbor method to form a coarse database and then refines it with a deep convolutional neural network. When applied to the channel data generated by ray tracing software, our method shows a great advantage in performance over the conventional interpolation methods.
Bad practices in evaluation methodology relevant to class-imbalanced problems
Venue: arXiv cs.LG 2018
Year: 2018

For research to go in the right direction, it is essential to be able to compare and quantify performance of different algorithms focused on the same problem. Choosing a suitable evaluation metric requires deep understanding of the pursued task along with all of its characteristics. We argue that in the case of applied machine learning, proper evaluation metric is the basic building block that should be in the spotlight and put under thorough examination. Here, we address tasks with class imbalance, in which the class of interest is the one with much lower number of samples. We encountered non-insignificant amount of recent papers, in which improper evaluation methods are used, borrowed mainly from the field of balanced problems. Such bad practices may heavily bias the results in favour of inappropriate algorithms and give false expectations of the state of the field.
Compressive Classification (Machine Learning without learning)
Venue: arXiv cs.LG 2018
Year: 2018

Compressive learning is a framework where (so far unsupervised) learning tasks use not the entire dataset but a compressed summary (sketch) of it. We propose a compressive learning classification method, and a novel sketch function for images.
Modeling natural language emergence with integral transform theory and reinforcement learning
Venue: arXiv cs.CL 2018
Year: 2018

Zipf's law predicts a power-law relationship between word rank and frequency in language communication systems and has been widely reported in a variety of natural language processing applications. However, the emergence of natural language is often modeled as a function of bias between speaker and listener interests, which lacks a direct way of relating information-theoretic bias to Zipfian rank. A function of bias also serves as an unintuitive interpretation of the communicative effort exchanged between a speaker and a listener. We counter these shortcomings by proposing a novel integral transform and kernel for mapping communicative bias functions to corresponding word frequency-rank representations at any arbitrary phase transition point, resulting in a direct way to link communicative effort (modeled by speaker/listener bias) to specific vocabulary used (represented by word rank). We demonstrate the practical utility of our integral transform by showing how a change from bias to rank results in greater accuracy and performance at an image classification task for assigning word labels to images randomly subsampled from CIFAR10. We model this task as a reinforcement learning game between a speaker and listener and compare the relative impact of bias and Zipfian word rank on communicative performance (and accuracy) between the two agents.
Constrained Control of Depth of Hypnosis During Induction Phase
Venue: arXiv cs.SY 2018
Year: 2018

This paper proposes a constrained control scheme for the control of the depth of hypnosis during induction phase in clinical anesthesia. In contrast with existing control schemes for propofol delivery, the proposed scheme guarantees overdosing prevention while ensuring good performance. The core idea is to reformulate overdosing prevention as a constraint, and then use the recently introduced Explicit Reference Governor to enforce the constraint satisfaction at all times. The proposed scheme is evaluated in comparison with a robust PID controller on a simulated surgical procedure for 44 patients whose Pharmacokinetic-Pharmacodynamic models have been identified using clinical data. The results demonstrate that the proposed constrained control scheme can deliver propofol to yield good induction phase response while preventing overdosing in patients; whereas other existing schemes might cause overdosing in some patients. Simulations show that mean rise time, mean settling time, and mean overshoot of less than 5 [min], 8 [min], and 10%, respectively, are achieved, which meet typical anesthesiologists' response specifications.
Distributed mining of time--faded heavy hitters
Venue: arXiv cs.DC 2018
Year: 2018

We present \textsc{P2PTFHH} (Peer--to--Peer Time--Faded Heavy Hitters) which, to the best of our knowledge, is the first distributed algorithm for mining time--faded heavy hitters on unstructured P2P networks. \textsc{P2PTFHH} is based on the \textsc{FDCMSS} (Forward Decay Count--Min Space-Saving) sequential algorithm, and efficiently exploits an averaging gossip protocol, by merging in each interaction the involved peers' underlying data structures. We formally prove the convergence and correctness properties of our distributed algorithm and show that it is fast and simple to implement. Extensive experimental results confirm that \textsc{P2PTFHH} retains the extreme accuracy and error bound provided by \textsc{FDCMSS} whilst showing excellent scalability. Our contributions are three-fold: (i) we prove that the averaging gossip protocol can be used jointly with our augmented sketch data structure for mining time--faded heavy hitters; (ii) we prove the error bounds on frequency estimation; (iii) we experimentally prove that \textsc{P2PTFHH} is extremely accurate and fast, allowing near real time processing of large datasets.
Deep Inception Generative Network for Cognitive Image Inpainting
Venue: arXiv cs.CV 2018
Year: 2018

Recent advances in deep learning have shown exciting promise in filling large holes and lead to another orientation for image inpainting. However, existing learning-based methods often create artifacts and fallacious textures because of insufficient cognition understanding. Previous generative networks are limited with single receptive type and give up pooling in consideration of detail sharpness. Human cognition is constant regardless of the target attribute. As multiple receptive fields improve the ability of abstract image characterization and pooling can keep feature invariant, specifically, deep inception learning is adopted to promote high-level feature representation and enhance model learning capacity for local patches. Moreover, approaches for generating diverse mask images are introduced and a random mask dataset is created. We benchmark our methods on ImageNet, Places2 dataset, and CelebA-HQ. Experiments for regular, irregular, and custom regions completion are all performed and free-style image inpainting is also presented. Quantitative comparisons with previous state-of-the-art methods show that ours obtain much more natural image completions.
Intensity Particle Flow SMC-PHD Filter For Audio Speaker Tracking
Venue: arXiv cs.SD 2018
Year: 2018

Non-zero diffusion particle flow Sequential Monte Carlo probability hypothesis density (NPF-SMC-PHD) filtering has been recently introduced for multi-speaker tracking. However, the NPF does not consider the missing detection which plays a key role in estimation of the number of speakers with their states. To address this limitation, we propose to use intensity particle flow (IPF) in NPFSMC-PHD filter. The proposed method, IPF-SMC-PHD, considers the clutter intensity and detection probability while no data association algorithms are used for the calculation of particle flow. Experiments on the LOCATA (acoustic source Localization and Tracking) dataset with the sequences of task 4 show that our proposed IPF-SMC-PHD filter improves the tracking performance in terms of estimation accuracy as compared to its baseline counterparts.
A Study of Data Store-based Home Automation
Venue: arXiv cs.CR 2018
Year: 2018

Home automation platforms provide a new level of convenience by enabling consumers to automate various aspects of physical objects in their homes. While the convenience is beneficial, security flaws in the platforms or integrated third-party products can have serious consequences for the integrity of a user's physical environment. In this paper we perform a systematic security evaluation of two popular smart home platforms, Google's Nest platform and Philips Hue, that implement home automation "routines" (i.e., trigger-action programs involving apps and devices) via manipulation of state variables in a centralized data store. Our semi-automated analysis examines, among other things, platform access control enforcement, the rigor of non-system enforcement procedures, and the potential for misuse of routines. This analysis results in ten key findings with serious security implications. For instance, we demonstrate the potential for the misuse of smart home routines in the Nest platform to perform a lateral privilege escalation, illustrate how Nest's product review system is ineffective at preventing multiple stages of this attack that it examines, and demonstrate how emerging platforms may fail to provide even bare-minimum security by allowing apps to arbitrarily add/remove other apps from the user's smart home. Our findings draw attention to the unique security challenges of platforms that execute routines via centralized data stores and highlight the importance of enforcing security by design in emerging home automation platforms.
Feed-Forward Neural Networks Need Inductive Bias to Learn Equality Relations
Venue: arXiv cs.LG 2018
Year: 2018

Basic binary relations such as equality and inequality are fundamental to relational data structures. Neural networks should learn such relations and generalise to new unseen data. We show in this study, however, that this generalisation fails with standard feed-forward networks on binary vectors. Even when trained with maximal training data, standard networks do not reliably detect equality.We introduce differential rectifier (DR) units that we add to the network in different configurations. The DR units create an inductive bias in the networks, so that they do learn to generalise, even from small numbers of examples and we have not found any negative effect of their inclusion in the network. Given the fundamental nature of these relations, we hypothesize that feed-forward neural network learning benefits from inductive bias in other relations as well. Consequently, the further development of suitable inductive biases will be beneficial to many tasks in relational learning with neural networks.
Learning Individualized Cardiovascular Responses from Large-scale Wearable Sensors Data
Venue: arXiv cs.LG 2018
Year: 2018

We consider the problem of modeling cardiovascular responses to physical activity and sleep changes captured by wearable sensors in free living conditions. We use an attentional convolutional neural network to learn parsimonious signatures of individual cardiovascular response from data recorded at the minute level resolution over several months on a cohort of 80k people. We demonstrate internal validity by showing that signatures generated on an individual's 2017 data generalize to predict minute-level heart rate from physical activity and sleep for the same individual in 2018, outperforming several time-series forecasting baselines. We also show external validity demonstrating that signatures outperform plain resting heart rate (RHR) in predicting variables associated with cardiovascular functions, such as age and Body Mass Index (BMI). We believe that the computed cardiovascular signatures have utility in monitoring cardiovascular health over time, including detecting abnormalities and quantifying recovery from acute events.
Assigning a Grade: Accurate Measurement of Road Quality Using Satellite Imagery
Venue: arXiv cs.CV 2018
Year: 2018

Roads are critically important infrastructure to societal and economic development, with huge investments made by governments every year. However, methods for monitoring those investments tend to be time-consuming, laborious, and expensive, placing them out of reach for many developing regions. In this work, we develop a model for monitoring the quality of road infrastructure using satellite imagery. For this task, we harness two trends: the increasing availability of high-resolution, often-updated satellite imagery, and the enormous improvement in speed and accuracy of convolutional neural network-based methods for performing computer vision tasks. We employ a unique dataset of road quality information on 7000km of roads in Kenya combined with 50cm resolution satellite imagery. We create models for a binary classification task as well as a comprehensive 5-category classification task, with accuracy scores of 88 and 73 percent respectively. We also provide evidence of the robustness of our methods with challenging held-out scenarios, though we note some improvement is still required for confident analysis of a never before seen road. We believe these results are well-positioned to have substantial impact on a broad set of transport applications.
Multiview Based 3D Scene Understanding On Partial Point Sets
Venue: arXiv cs.CV 2018
Year: 2018

Deep learning within the context of point clouds has gained much research interest in recent years mostly due to the promising results that have been achieved on a number of challenging benchmarks, such as 3D shape recognition and scene semantic segmentation. In many realistic settings however, snapshots of the environment are often taken from a single view, which only contains a partial set of the scene due to the field of view restriction of commodity cameras. 3D scene semantic understanding on partial point clouds is considered as a challenging task. In this work, we propose a processing approach for 3D point cloud data based on a multiview representation of the existing 360° point clouds. By fusing the original 360° point clouds and their corresponding 3D multiview representations as input data, a neural network is able to recognize partial point sets while improving the general performance on complete point sets, resulting in an overall increase of 31.9% and 4.3% in segmentation accuracy for partial and complete scene semantic understanding, respectively. This method can also be applied in a wider 3D recognition context such as 3D part segmentation.
FineFool: Fine Object Contour Attack via Attention
Venue: arXiv cs.CV 2018
Year: 2018

Machine learning models have been shown vulnerable to adversarial attacks launched by adversarial examples which are carefully crafted by attacker to defeat classifiers. Deep learning models cannot escape the attack either. Most of adversarial attack methods are focused on success rate or perturbations size, while we are more interested in the relationship between adversarial perturbation and the image itself. In this paper, we put forward a novel adversarial attack based on contour, named FineFool. Finefool not only has better attack performance compared with other state-of-art white-box attacks in aspect of higher attack success rate and smaller perturbation, but also capable of visualization the optimal adversarial perturbation via attention on object contour. To the best of our knowledge, Finefool is for the first time combines the critical feature of the original clean image with the optimal perturbations in a visible manner. Inspired by the correlations between adversarial perturbations and object contour, slighter perturbations is produced via focusing on object contour features, which is more imperceptible and difficult to be defended, especially network add-on defense methods with the trade-off between perturbations filtering and contour feature loss. Compared with existing state-of-art attacks, extensive experiments are conducted to show that Finefool is capable of efficient attack against defensive deep models.
Domain Mismatch Robust Acoustic Scene Classification using Channel Information Conversion
Venue: arXiv cs.SD 2018
Year: 2018

In a recent acoustic scene classification (ASC) research field, training and test device channel mismatch have become an issue for the real world implementation. To address the issue, this paper proposes a channel domain conversion using factorized hierarchical variational autoencoder. Proposed method adapts both the source and target domain to a pre-defined specific domain. Unlike the conventional approach, the relationship between the target and source domain and information of each domain are not required in the adaptation process. Based on the experimental results using the IEEE detection and classification of acoustic scenes and event 2018 task 1-B dataset and the baseline system, it is shown that the proposed approach can mitigate the channel mismatching issue of different recording devices.
Performance Analysis of Uplink Cellular IoT Using Different Deployments of Data Aggregators
Venue: arXiv cs.IT 2018
Year: 2018

Data aggregation is an effective solution to enable cellular support of Internet-of-things (IoT) communications. Indeed, it helps alleviate channel congestion, reduce the communication range, and extend battery-lifetime. In this paper, we use stochastic geometry to analyze the performance of uplink cellular IoT using different deployment strategies of aggregators, including terrestrial and aerial ones, e.g., drones or unmanned aerial vehicles. We focus on IoT-specific performance metrics, that are typically used by 3GPP. Specifically, we derive closed-form expressions of the average transmit power consumption, which is key to determine the lifetime of IoT devices, as well as the maximum coupling loss, which is essential to determine the maximum coverage the cellular system can support. Simulation results are presented to validate the derived theoretical expressions. It is shown that aerial aggregators can significantly extend the device lifetime and provide superior coverage compared to other deployment strategies. In addition, random deployment performs well when aggregators are densely deployed, whereas optimizing the location of a single terrestrial aggregator is beneficial when devices are more clustered.
SolarGest: Ubiquitous and Battery-free Gesture Recognition using Solar Cells
Venue: arXiv cs.HC 2018
Year: 2018

We design a system, SolarGest, which can recognize hand gestures near a solar-powered device by analyzing the patterns of the photocurrent. SolarGest is based on the observation that each gesture interferes with incident light rays on the solar panel in a unique way, leaving its distinguishable signature in harvested photocurrent. Using solar energy harvesting laws, we develop a model to optimize design and usage of SolarGest. To further improve the robustness of SolarGest under non-deterministic operating conditions, we combine dynamic time warping with Z-score transformation in a signal processing pipeline to pre-process each gesture waveform before it is analyzed for classification. We evaluate SolarGest with both conventional opaque solar cells as well as emerging see-through transparent cells. Our experiments with 6,960 gesture samples for 6 different gestures reveal that even with transparent cells, SolarGest can detect 96% of the gestures while consuming 44% less power compared to light sensor based systems.
Regularized Ensembles and Transferability in Adversarial Learning
Venue: arXiv cs.LG 2018
Year: 2018

Despite the considerable success of convolutional neural networks in a broad array of domains, recent research has shown these to be vulnerable to small adversarial perturbations, commonly known as adversarial examples. Moreover, such examples have shown to be remarkably portable, or transferable, from one model to another, enabling highly successful black-box attacks. We explore this issue of transferability and robustness from two dimensions: first, considering the impact of conventional $l_p$ regularization as well as replacing the top layer with a linear support vector machine (SVM), and second, the value of combining regularized models into an ensemble. We show that models trained with different regularizers present barriers to transferability, as does partial information about the models comprising the ensemble.
Nonlinear Fourier Transform of Truncated Multi-Soliton Pulses
Venue: arXiv cs.IT 2018
Year: 2018

Multi-soliton pulses, as special solutions of the Nonlinear Schroedinger Equation (NLSE), are potential candidates for optical fiber transmission where the information is modulated and recovered in the so-called nonlinear Fourier domain. For data communication, the exponentially decaying tails of a multi-soliton must be truncated. Such a windowing changes the nonlinear Fourier spectrum of the pulse. The results of this paper are twofold: (i) we derive the simple closed-form expressions for the nonlinear spectrum, discrete and continuous spectrum, of a symmetrically truncated multi-soliton pulse from tight approximation of the truncated tails. We numerically show the accuracy of the closed-form expressions. (ii) We show how to find, in general, the eigenvalues of the discrete spectrum from the continuous spectrum. We present this method for the application in hand.