OpenRaiser/Intern-Atlas huggingface dataset:
Detecting Irregular Patterns in IoT Streaming Data for Fall Detection
Venue: arXiv cs.LG 2018
Year: 2018

Detecting patterns in real time streaming data has been an interesting and challenging data analytics problem. With the proliferation of a variety of sensor devices, real-time analytics of data from the Internet of Things (IoT) to learn regular and irregular patterns has become an important machine learning problem to enable predictive analytics for automated notification and decision support. In this work, we address the problem of learning an irregular human activity pattern, fall, from streaming IoT data from wearable sensors. We present a deep neural network model for detecting fall based on accelerometer data giving 98.75 percent accuracy using an online physical activity monitoring dataset called "MobiAct", which was published by Vavoulas et al. The initial model was developed using IBM Watson studio and then later transferred and deployed on IBM Cloud with the streaming analytics service supported by IBM Streams for monitoring real-time IoT data. We also present the systems architecture of the real-time fall detection framework that we intend to use with mbientlabs wearable health monitoring sensors for real time patient monitoring at retirement homes or rehabilitation clinics.
Fair End to End Window Based Congestion Control in Time Varying Data Communication Networks
Venue: arXiv cs.NI 2018
Year: 2018

Communication networks are time-varying and hence, fair sharing of network resources among the users in such a dynamic environment is a challenging task. In this context, a time-varying network model is designed and the shortest user's route is found. In the designed network model, an end to end window-based congestion control scheme is developed with the help of internal nodes or router and the end user can get implicit feedback (RTT and throughput). This scheme is considered as fair if the allocation of resources among users minimizes overall congestion or backlog in the networks. Window update approach is based on a multi-class fluid model and is updated dynamically by considering delays (communication, propagation and queuing) and the backlog of packets in the user's routes. Convergence and stability of the window size are obtained using a Lyapunov function. A comparative study with other window-based methods is also provided.
Entropy-regularized Optimal Transport Generative Models
Venue: arXiv cs.LG 2018
Year: 2018

We investigate the use of entropy-regularized optimal transport (EOT) cost in developing generative models to learn implicit distributions. Two generative models are proposed. One uses EOT cost directly in an one-shot optimization problem and the other uses EOT cost iteratively in an adversarial game. The proposed generative models show improved performance over contemporary models for image generation on MNSIT.
ESAS: An Efficient Semantic and Authorized Search Scheme over Encrypted Outsourced Data
Venue: arXiv cs.CR 2018
Year: 2018

Nowadays, a large amount of user privacy-sensitive data is outsourced to the cloud server in ciphertext, which is provided by the data owners and can be accessed by authorized data users. When accessing data, the user should be assigned with the access permission according to his identities or attributes. In addition, the search capabilities in encrypted outsourced data is expected to be enhanced, i.e., the search results can better pre-sent user's intentions. To address the above issues, ESAS, an Efficient Semantic and Authorized Search scheme over encrypt-ed outsourced data, is proposed. In ESAS, by integrating PRSCG (the privacy-preserving ranked search based on con-ceptual graph) and CP-ABE (ciphertext policy attribute-based encryption), semantic search with file-level fine-grained access authorization can be realized. In addition, search authorization can be done in an offline manner, which can improve search efficiency and reduce the response time. The security analysis indicate that the proposed ESAS meets security requirement.
DARCCC: Detecting Adversaries by Reconstruction from Class Conditional Capsules
Venue: arXiv cs.LG 2018
Year: 2018

We present a simple technique that allows capsule models to detect adversarial images. In addition to being trained to classify images, the capsule model is trained to reconstruct the images from the pose parameters and identity of the correct top-level capsule. Adversarial images do not look like a typical member of the predicted class and they have much larger reconstruction errors when the reconstruction is produced from the top-level capsule for that class. We show that setting a threshold on the $l2$ distance between the input image and its reconstruction from the winning capsule is very effective at detecting adversarial images for three different datasets. The same technique works quite well for CNNs that have been trained to reconstruct the image from all or part of the last hidden layer before the softmax. We then explore a stronger, white-box attack that takes the reconstruction error into account. This attack is able to fool our detection technique but in order to make the model change its prediction to another class, the attack must typically make the "adversarial" image resemble images of the other class.
Mining Entity Synonyms with Efficient Neural Set Generation
Venue: arXiv cs.CL 2018
Year: 2018

Mining entity synonym sets (i.e., sets of terms referring to the same entity) is an important task for many entity-leveraging applications. Previous work either rank terms based on their similarity to a given query term, or treats the problem as a two-phase task (i.e., detecting synonymy pairs, followed by organizing these pairs into synonym sets). However, these approaches fail to model the holistic semantics of a set and suffer from the error propagation issue. Here we propose a new framework, named SynSetMine, that efficiently generates entity synonym sets from a given vocabulary, using example sets from external knowledge bases as distant supervision. SynSetMine consists of two novel modules: (1) a set-instance classifier that jointly learns how to represent a permutation invariant synonym set and whether to include a new instance (i.e., a term) into the set, and (2) a set generation algorithm that enumerates the vocabulary only once and applies the learned set-instance classifier to detect all entity synonym sets in it. Experiments on three real datasets from different domains demonstrate both effectiveness and efficiency of SynSetMine for mining entity synonym sets.
Biometric-Based Wearable User Authentication During Sedentary and Non-sedentary Periods
Venue: arXiv cs.CR 2018
Year: 2018

The Internet of Things (IoT) is increasingly empowering people with an interconnected world of physical objects ranging from smart buildings to portable smart devices such as wearables. With the recent advances in mobile sensing, wearables have become a rich collection of portable sensors and are able to provide various types of services including health and fitness tracking, financial transactions, and unlocking smart locks and vehicles. Existing explicit authentication approaches (i.e., PINs or pattern locks) suffer from several limitations including limited display size, shoulder surfing, and recall burden. Oftentimes, users completely disable security features out of convenience. Therefore, there is a need for a burden-free (implicit) authentication mechanism for wearable device users based on easily obtainable biometric data. In this paper, we present an implicit wearable device user authentication mechanism using combinations of three types of coarse-grained minute-level biometrics: behavioral (step counts), physiological (heart rate), and hybrid (calorie burn and metabolic equivalent of task). From our analysis of 421 Fitbit users from a two-year long health study, we are able to authenticate subjects with average accuracy values of around 92% and 88% during sedentary and non-sedentary periods, respectively. Our findings also show that (a) behavioral biometrics do not work well during sedentary periods and (b) hybrid biometrics typically perform better than other biometrics.
Using Sentiment Induction to Understand Variation in Gendered Online Communities
Venue: arXiv cs.CL 2018
Year: 2018

We analyze gendered communities defined in three different ways: text, users, and sentiment. Differences across these representations reveal facets of communities' distinctive identities, such as social group, topic, and attitudes. Two communities may have high text similarity but not user similarity or vice versa, and word usage also does not vary according to a clearcut, binary perspective of gender. Community-specific sentiment lexicons demonstrate that sentiment can be a useful indicator of words' social meaning and community values, especially in the context of discussion content and user demographics. Our results show that social platforms such as Reddit are active settings for different constructions of gender.
The Impatient May Use Limited Optimism to Minimize Regret
Venue: arXiv cs.GT 2018
Year: 2018

Discounted-sum games provide a formal model for the study of reinforcement learning, where the agent is enticed to get rewards early since later rewards are discounted. When the agent interacts with the environment, she may regret her actions, realizing that a previous choice was suboptimal given the behavior of the environment. The main contribution of this paper is a PSPACE algorithm for computing the minimum possible regret of a given game. To this end, several results of independent interest are shown. (1) We identify a class of regret-minimizing and admissible strategies that first assume that the environment is collaborating, then assume it is adversarial---the precise timing of the switch is key here. (2) Disregarding the computational cost of numerical analysis, we provide an NP algorithm that checks that the regret entailed by a given time-switching strategy exceeds a given value. (3) We show that determining whether a strategy minimizes regret is decidable in PSPACE.
On Human Robot Interaction using Multiple Modes
Venue: arXiv cs.HC 2018
Year: 2018

Humanoid robots have apparently similar body structure like human beings. Due to their technical design, they are sharing the same workspace with humans. They are placed to clean things, to assist old age people, to entertain us and most importantly to serve us. To be acceptable in the household, they must have higher level of intelligence than industrial robots and they must be social and capable of interacting people around it, who are not supposed to be robot specialist. All these come under the field of human robot interaction (HRI). There are various modes like speech, gesture, behavior etc. through which human can interact with robots. To solve all these challenges, a multimodel technique has been introduced where gesture as well as speech is used as a mode of interaction.
Learning Features and Abstract Actions for Computing Generalized Plans
Venue: arXiv cs.AI 2018
Year: 2018

Generalized planning is concerned with the computation of plans that solve not one but multiple instances of a planning domain. Recently, it has been shown that generalized plans can be expressed as mappings of feature values into actions, and that they can often be computed with fully observable non-deterministic (FOND) planners. The actions in such plans, however, are not the actions in the instances themselves, which are not necessarily common to other instances, but abstract actions that are defined on a set of common features. The formulation assumes that the features and the abstract actions are given. In this work, we address this limitation by showing how to learn them automatically. The resulting account of generalized planning combines learning and planning in a novel way: a learner, based on a Max SAT formulation, yields the features and abstract actions from sampled state transitions, and a FOND planner uses this information, suitably transformed, to produce the general plans. Correctness guarantees are given and experimental results on several domains are reported.
Quantifying Uncertainties in Natural Language Processing Tasks
Venue: arXiv cs.CL 2018
Year: 2018

Reliable uncertainty quantification is a first step towards building explainable, transparent, and accountable artificial intelligent systems. Recent progress in Bayesian deep learning has made such quantification realizable. In this paper, we propose novel methods to study the benefits of characterizing model and data uncertainties for natural language processing (NLP) tasks. With empirical experiments on sentiment analysis, named entity recognition, and language modeling using convolutional and recurrent neural network models, we show that explicitly modeling uncertainties is not only necessary to measure output confidence levels, but also useful at enhancing model performances in various NLP tasks.
GLStyleNet: Higher Quality Style Transfer Combining Global and Local Pyramid Features
Venue: arXiv cs.CV 2018
Year: 2018

Recent studies using deep neural networks have shown remarkable success in style transfer especially for artistic and photo-realistic images. However, the approaches using global feature correlations fail to capture small, intricate textures and maintain correct texture scales of the artworks, and the approaches based on local patches are defective on global effect. In this paper, we present a novel feature pyramid fusion neural network, dubbed GLStyleNet, which sufficiently takes into consideration multi-scale and multi-level pyramid features by best aggregating layers across a VGG network, and performs style transfer hierarchically with multiple losses of different scales. Our proposed method retains high-frequency pixel information and low frequency construct information of images from two aspects: loss function constraint and feature fusion. Our approach is not only flexible to adjust the trade-off between content and style, but also controllable between global and local. Compared to state-of-the-art methods, our method can transfer not just large-scale, obvious style cues but also subtle, exquisite ones, and dramatically improves the quality of style transfer. We demonstrate the effectiveness of our approach on portrait style transfer, artistic style transfer, photo-realistic style transfer and Chinese ancient painting style transfer tasks. Experimental results indicate that our unified approach improves image style transfer quality over previous state-of-the-art methods, while also accelerating the whole process in a certain extent. Our code is available at https://github.com/EndyWon/GLStyleNet.
Understanding Learned Models by Identifying Important Features at the Right Resolution
Venue: arXiv cs.LG 2018
Year: 2018

In many application domains, it is important to characterize how complex learned models make their decisions across the distribution of instances. One way to do this is to identify the features and interactions among them that contribute to a model's predictive accuracy. We present a model-agnostic approach to this task that makes the following specific contributions. Our approach (i) tests feature groups, in addition to base features, and tries to determine the level of resolution at which important features can be determined, (ii) uses hypothesis testing to rigorously assess the effect of each feature on the model's loss, (iii) employs a hierarchical approach to control the false discovery rate when testing feature groups and individual base features for importance, and (iv) uses hypothesis testing to identify important interactions among features and feature groups. We evaluate our approach by analyzing random forest and LSTM neural network models learned in two challenging biomedical applications.
Stark: Fast and Scalable Strassen's Matrix Multiplication using Apache Spark
Venue: arXiv cs.DC 2018
Year: 2018

This paper presents a new fast, highly scalable distributed matrix multiplication algorithm on Apache Spark, called Stark, based on Strassen's matrix multiplication algorithm. Stark preserves Strassen's 7 multiplications scheme in a distributed environment and thus achieves faster execution. It is based on two new ideas; it creates a recursion tree of computation where each level of such tree corresponds to division and combination of distributed matrix blocks in the form of Resilient Distributed Datasets(RDDs); It processes each divide and combine step in parallel and memorize the sub-matrices by intelligently tagging matrix blocks in it. To the best of our knowledge, Stark is the first Strassen's implementation in Spark platform. We show experimentally that Stark has a strong scalability with increasing matrix size enabling us to multiply two (16384 x 16384) matrices with 28% and 36% less wall clock time than Marlin and MLLib respectively, state-of-the-art matrix multiplication approaches based on Spark.
RGB-based 3D Hand Pose Estimation via Privileged Learning with Depth Images
Venue: arXiv cs.CV 2018
Year: 2018

This paper proposes a method for hand pose estimation from RGB images that uses both external large-scale depth image datasets and paired depth and RGB images as privileged information at training time. We show that providing depth information during training significantly improves performance of pose estimation from RGB images during testing. We explore different ways of using this privileged information: (1) using depth data to initially train a depth-based network, (2) using the features from the depth-based network of the paired depth images to constrain mid-level RGB network weights, and (3) using the foreground mask, obtained from the depth data, to suppress the responses from the background area. By using paired RGB and depth images, we are able to supervise the RGB-based network to learn middle layer features that mimic that of the corresponding depth-based network, which is trained on large-scale, accurately annotated depth data. During testing, when only an RGB image is available, our method produces accurate 3D hand pose predictions. Our method is also tested on 2D hand pose estimation. Experiments on three public datasets show that the method outperforms the state-of-the-art methods for hand pose estimation using RGB image input.
Sorting permutations with a transposition tree
Venue: arXiv cs.DS 2018
Year: 2018

The set of all permutations with $n$ symbols is a symmetric group denoted by $S_n$. A transposition tree, $T$, is a spanning tree over its $n$ vertices $V_T=${$1, 2, 3, \ldots n$} where the vertices are the positions of a permutation $π$ and $π$ is in $S_n$. $T$ is the operation and the edge set $E_T$ denotes the corresponding generator set. The goal is to sort a given permutation $π$ with $T$. The number of generators of $E_T$ that suffices to sort any $π\in S_n$ constitutes an upper bound. It is an upper bound, on the diameter of the corresponding Cayley graph $Γ$ i.e. $diam(Γ)$. A precise upper bound equals $diam(Γ)$. Such bounds are known only for a few trees. Jerrum showed that computing $diam(Γ)$ is intractable in general if the number of generators is two or more whereas $T$ has $n-1$ generators. For several operations computing a tight upper bound is of theoretical interest. Such bounds have applications in evolutionary biology to compute the evolutionary relatedness of species and parallel/distributed computing for latency estimation. The earliest algorithm computed an upper bound $f(Γ)$ in a $Ω(n!)$ time by examining all $π$ in $S_n$. Subsequently, polynomial time algorithms were designed to compute upper bounds or their estimates. We design an upper bound $δ^*$ whose cumulative value for all trees of a given size $n$ is shown to be the tightest for $n \leq 15$. We show that $δ^*$ is tightest known upper bound for full binary trees. Keywords: Transposition trees, Cayley graphs, permutations, sorting, upper bound, diameter, greedy algorithms.
Testing local properties of arrays
Venue: arXiv cs.DS 2018
Year: 2018

We study testing of local properties in one-dimensional and multi-dimensional arrays. A property of $d$-dimensional arrays $f:[n]^d \to Σ$ is $k$-local if it can be defined by a family of $k \times \ldots \times k$ forbidden consecutive patterns. This definition captures numerous interesting properties. For example, monotonicity, Lipschitz continuity and submodularity are $2$-local; convexity is (usually) $3$-local; and many typical problems in computational biology and computer vision involve $o(n)$-local properties. In this work, we present a generic approach to test all local properties of arrays over any finite (and not necessarily bounded size) alphabet. We show that any $k$-local property of $d$-dimensional arrays is testable by a simple canonical one-sided error non-adaptive $\varepsilon$-test, whose query complexity is $O(ε^{-1}k \log{\frac{εn}{k}})$ for $d = 1$ and $O(c_d ε^{-1/d} k \cdot n^{d-1})$ for $d > 1$. The queries made by the canonical test constitute sphere-like structures of varying sizes, and are completely independent of the property and the alphabet $Σ$. The query complexity is optimal for a wide range of parameters: For $d=1$, this matches the query complexity of many previously investigated local properties, while for $d > 1$ we design and analyze new constructions of $k$-local properties whose one-sided non-adaptive query complexity matches our upper bounds. For some previously studied properties, our method provides the first known sublinear upper bound on the query complexity.
FotonNet: A HW-Efficient Object Detection System Using 3D-Depth Segmentation and 2D-DNN Classifier
Venue: arXiv cs.CV 2018
Year: 2018

Object detection and classification is one of the most important computer vision problems. Ever since the introduction of deep learning \cite{krizhevsky2012imagenet}, we have witnessed a dramatic increase in the accuracy of this object detection problem. However, most of these improvements have occurred using conventional 2D image processing. Recently, low-cost 3D-image sensors, such as the Microsoft Kinect (Time-of-Flight) or the Apple FaceID (Structured-Light), can provide 3D-depth or point cloud data that can be added to a convolutional neural network, acting as an extra set of dimensions. In our proposed approach, we introduce a new 2D + 3D system that takes the 3D-data to determine the object region followed by any conventional 2D-DNN, such as AlexNet. In this method, our approach can easily dissociate the information collection from the Point Cloud and 2D-Image data and combine both operations later. Hence, our system can use any existing trained 2D network on a large image dataset, and does not require a large 3D-depth dataset for new training. Experimental object detection results across 30 images show an accuracy of 0.67, versus 0.54 and 0.51 for RCNN and YOLO, respectively.
Note on the exact delay stability margin computation of hybrid dynamical systems
Venue: arXiv cs.SY 2018
Year: 2018

Traditionally, the delay margin of a looped system is computed by considering both the controller and system representations that evolve in the same space (e.g. either continuous or discrete-time). However, as in practice the system is continuous and the controller is mostly embedded in a computer, the looped - controller / system pair - model is hybrid. As a consequence, the computed delay margin might vary with respect to the continuous (or discrete one). This paper proposes a novel approach to compute the exact delay margin of hybrid systems, and more specifically, when a discrete-time controller is looped with a continuous-time system. The main interest is then to provide the practitioners with a way to select the appropriate discretization technique for maximizing the delay margin and to be able to exactly evaluate the delay margin before implementation on target. The main idea is to approximate the discrete-time controller with an equivalent continuous-time one (often with higher order) and to exploit the classical continuous-time frequency-based analysis strategies.