OpenRaiser/Intern-Atlas huggingface dataset:
An advanced Study on Cryptography Mechanisms for Wireless Sensor Networks
Venue: arXiv cs.CR 2016
Year: 2016

Wireless Sensor Network (WSN) is consisting of independent and distributed sensors to monitor physical or environmental conditions, such as temperature, sound, pressure, etc. The most crucial and fundamental challenge facing WSN is security. Due to minimum capacity in-term of memory cost, processing and physical accessibility to sensors devices the security attacks are problematic. They are mostly deployed in open area, which expose them to different kinds of attacks. In this paper, we present an illustration of different attacks and vulnerabilities in WSN. Then we describe and analyze security requirement, countermeasures based on cryptography mechanisms in literature. Finally, we present possible directions in future research.
Hermite interpolation by piecewise polynomial surfaces with polynomial area element
Venue: arXiv cs.GR 2016
Year: 2016

This paper is devoted to the construction of polynomial 2-surfaces which possess a polynomial area element. In particular we study these surfaces in the Euclidean space $\mathbb R^3$ (where they are equivalent to the PN surfaces) and in the Minkowski space $\mathbb R^{3,1}$ (where they provide the MOS surfaces). We show generally in real vector spaces of any dimension and any metric that the Gram determinant of a parametric set of subspaces is a perfect square if and only if the Gram determinant of its orthogonal complement is a perfect square. Consequently the polynomial surfaces of a given degree with polynomial area element can be constructed from the prescribed normal fields solving a system of linear equations. The degree of the constructed surface depending on the degree and the quality of the prescribed normal field is investigated and discussed. We use the presented approach to interpolate a network of points and associated normals with piecewise polynomial surfaces with polynomial area element and demonstrate our method on a number of examples (constructions of quadrilateral as well as triangular patches
What makes people bond?: A study on social interactions and common life points on Facebook
Venue: arXiv cs.SI 2016
Year: 2016

In this paper we aim at understanding if and how, by analysing people's profile and historical data (such as data available on Facebook profiles and interactions, or collected explicitly) we can motivate two persons to interact and eventually create long-term bonds. We do this by exploring the relationship between connectedness, social interactions and common life points on Facebook. The results are of particular importance for the development of technology that aims at reducing social isolation for people with less chances to interact, such as older adults.
miniAdapton: A Minimal Implementation of Incremental Computation in Scheme
Venue: arXiv cs.PL 2016
Year: 2016

We describe a complete Scheme implementation of miniAdapton, which implements the core functionality of the Adapton system for incremental computation (also known as self-adjusting computation). Like Adapton, miniAdapton allows programmers to safely combine mutation and memoization. miniAdapton is built on top of an even simpler system, microAdapton. Both miniAdapton and microAdapton are designed to be easy to understand, extend, and port to host languages other than Scheme. We also present adapton variables, a new interface in Adapton for variables intended to represent expressions.
Generalized residual vector quantization for large scale data
Venue: arXiv cs.MM 2016
Year: 2016

Vector quantization is an essential tool for tasks involving large scale data, for example, large scale similarity search, which is crucial for content-based information retrieval and analysis. In this paper, we propose a novel vector quantization framework that iteratively minimizes quantization error. First, we provide a detailed review on a relevant vector quantization method named \textit{residual vector quantization} (RVQ). Next, we propose \textit{generalized residual vector quantization} (GRVQ) to further improve over RVQ. Many vector quantization methods can be viewed as the special cases of our proposed framework. We evaluate GRVQ on several large scale benchmark datasets for large scale search, classification and object retrieval. We compared GRVQ with existing methods in detail. Extensive experiments demonstrate our GRVQ framework substantially outperforms existing methods in term of quantization accuracy and computation efficiency.
Set-Point Regulation of Linear Continuous-Time Systems using Neuromorphic Vision Sensors
Venue: arXiv cs.SY 2016
Year: 2016

Recently developed neuromorphic vision sensors have become promising candidates for agile and autonomous robotic applications primarily due to, in particular, their high temporal resolution and low latency. Each pixel of this sensor independently fires an asynchronous stream of "retinal events" once a change in the light field is detected. Existing computer vision algorithms can only process periodic frames and so a new class of algorithms needs to be developed that can efficiently process these events for control tasks. In this paper, we investigate the problem of regulating a continuous-time linear time invariant (LTI) system to a desired point using measurements from a neuromorphic sensor. We present an $H_\infty$ controller that regulates the LTI system to a desired set-point and provide the set of neuromorphic sensor based cameras for the given system that fulfill the regulation task. The effectiveness of our approach is illustrated on an unstable system.
Omnidirectional Bats, Point-to-Plane Distances, and the Price of Uniqueness
Venue: arXiv cs.RO 2016
Year: 2016

We study simultaneous localization and mapping with a device that uses reflections to measure its distance from walls. Such a device can be realized acoustically with a synchronized collocated source and receiver; it behaves like a bat with no capacity for directional hearing or vocalizing. In this paper we generalize our previous work in 2D, and show that the 3D case is not just a simple extension, but rather a fundamentally different inverse problem. While generically the 2D problem has a unique solution, in 3D uniqueness is always absent in rooms with fewer than nine walls. In addition to the complete characterization of ambiguities which arise due to this non-uniqueness, we propose a robust solution for inexact measurements similar to analogous results for Euclidean Distance Matrices. Our theoretical results have important consequences for the design of collocated range-only SLAM systems, and we support them with an array of computer experiments.
Tensor Completion by Alternating Minimization under the Tensor Train (TT) Model
Venue: arXiv cs.NA 2016
Year: 2016

Using the matrix product state (MPS) representation of tensor train decompositions, in this paper we propose a tensor completion algorithm which alternates over the matrices (tensors) in the MPS representation. This development is motivated in part by the success of matrix completion algorithms which alternate over the (low-rank) factors. We comment on the computational complexity of the proposed algorithm and numerically compare it with existing methods employing low rank tensor train approximation for data completion as well as several other recently proposed methods. We show that our method is superior to existing ones for a variety of real settings.
Fast Single Shot Detection and Pose Estimation
Venue: arXiv cs.CV 2016
Year: 2016

For applications in navigation and robotics, estimating the 3D pose of objects is as important as detection. Many approaches to pose estimation rely on detecting or tracking parts or keypoints [11, 21]. In this paper we build on a recent state-of-the-art convolutional network for slidingwindow detection [10] to provide detection and rough pose estimation in a single shot, without intermediate stages of detecting parts or initial bounding boxes. While not the first system to treat pose estimation as a categorization problem, this is the first attempt to combine detection and pose estimation at the same level using a deep learning approach. The key to the architecture is a deep convolutional network where scores for the presence of an object category, the offset for its location, and the approximate pose are all estimated on a regular grid of locations in the image. The resulting system is as accurate as recent work on pose estimation (42.4% 8 View mAVP on Pascal 3D+ [21] ) and significantly faster (46 frames per second (FPS) on a TITAN X GPU). This approach to detection and rough pose estimation is fast and accurate enough to be widely applied as a pre-processing step for tasks including high-accuracy pose estimation, object tracking and localization, and vSLAM.
Coarse-to-fine Surgical Instrument Detection for Cataract Surgery Monitoring
Venue: arXiv cs.CV 2016
Year: 2016

The amount of surgical data, recorded during video-monitored surgeries, has extremely increased. This paper aims at improving existing solutions for the automated analysis of cataract surgeries in real time. Through the analysis of a video recording the operating table, it is possible to know which instruments exit or enter the operating table, and therefore which ones are likely being used by the surgeon. Combining these observations with observations from the microscope video should enhance the overall performance of the systems. To this end, the proposed solution is divided into two main parts: one to detect the instruments at the beginning of the surgery and one to update the list of instruments every time a change is detected in the scene. In the first part, the goal is to separate the instruments from the background and from irrelevant objects. For the second, we are interested in detecting the instruments that appear and disappear whenever the surgeon interacts with the table. Experiments on a dataset of 36 cataract surgeries validate the good performance of the proposed solution.
Multi-view Dimensionality Reduction for Dialect Identification of Arabic Broadcast Speech
Venue: arXiv cs.CL 2016
Year: 2016

In this work, we present a new Vector Space Model (VSM) of speech utterances for the task of spoken dialect identification. Generally, DID systems are built using two sets of features that are extracted from speech utterances; acoustic and phonetic. The acoustic and phonetic features are used to form vector representations of speech utterances in an attempt to encode information about the spoken dialects. The Phonotactic and Acoustic VSMs, thus formed, are used for the task of DID. The aim of this paper is to construct a single VSM that encodes information about spoken dialects from both the Phonotactic and Acoustic VSMs. Given the two views of the data, we make use of a well known multi-view dimensionality reduction technique known as Canonical Correlation Analysis (CCA), to form a single vector representation for each speech utterance that encodes dialect specific discriminative information from both the phonetic and acoustic representations. We refer to this approach as feature space combination approach and show that our CCA based feature vector representation performs better on the Arabic DID task than the phonetic and acoustic feature representations used alone. We also present the feature space combination approach as a viable alternative to the model based combination approach, where two DID systems are built using the two VSMs (Phonotactic and Acoustic) and the final prediction score is the output score combination from the two systems.
Inherent Trade-Offs in the Fair Determination of Risk Scores
Venue: arXiv cs.LG 2016
Year: 2016

Recent discussion in the public sphere about algorithmic classification has involved tension between competing notions of what it means for a probabilistic classification to be fair to different groups. We formalize three fairness conditions that lie at the heart of these debates, and we prove that except in highly constrained special cases, there is no method that can satisfy these three conditions simultaneously. Moreover, even satisfying all three conditions approximately requires that the data lie in an approximate version of one of the constrained special cases identified by our theorem. These results suggest some of the ways in which key notions of fairness are incompatible with each other, and hence provide a framework for thinking about the trade-offs between them.
Toward a Science of Autonomy for Physical Systems: Paths
Venue: arXiv cs.CY 2016
Year: 2016

An Autonomous Physical System (APS) will be expected to reliably and independently evaluate, execute, and achieve goals while respecting surrounding rules, laws, or conventions. In doing so, an APS must rely on a broad spectrum of dynamic, complex, and often imprecise information about its surroundings, the task it is to perform, and its own sensors and actuators. For example, cleaning in a home or commercial setting requires the ability to perceive, grasp, and manipulate many physical objects, the ability to reliably perform a variety of subtasks such as washing, folding, and stacking, and knowledge about local conventions such as how objects are classified and where they should be stored. The information required for reliable autonomous operation may come from external sources and from the robot's own sensor observations or in the form of direct instruction by a trainer. Similar considerations apply across many domains - construction, manufacturing, in-home assistance, and healthcare. For example, surgeons spend many years learning about physiology and anatomy before they touch a patient. They then perform roughly 1000 surgeries under the tutelage of an expert surgeon, and they practice basic maneuvers such as suture tying thousands of times outside the operating room. All of these elements come together to achieve expertise at this task. Endowing a system with robust autonomy by traditional programming methods has thus far had limited success. Several promising new paths to acquiring and processing such data are emerging. This white paper outlines three promising research directions for enabling an APS to learn the physical and information skills necessary to perform tasks with independence and flexibility: Deep Reinforcement Learning, Human-Robot Interaction, and Cloud Robotics.
Toward a Science of Autonomy for Physical Systems: Transportation
Venue: arXiv cs.CY 2016
Year: 2016

Transportation systems are currently being transformed by advances in information and communication technologies. The development of autonomous transportation holds the promise of providing revolutionary improvements in speed, efficiency, safety and reliability along with concomitant benefits for society and economy. It is anticipated these changes will soon affect household activity patterns, public safety, supply chains and logistics, manufacturing, and quality of life in general.
Scope for Machine Learning in Digital Manufacturing
Venue: arXiv cs.AI 2016
Year: 2016

This provocation paper provides an overview of the underlying optimisation problem in the emerging field of Digital Manufacturing. Initially, this paper discusses how the notion of Digital Manufacturing is transforming from a term describing a suite of software tools for the integration of production and design functions towards a more general concept incorporating computerised manufacturing and supply chain processes, as well as information collection and utilisation across the product life cycle. On this basis, we use the example of one such manufacturing process, Additive Manufacturing, to identify an integrated multi-objective optimisation problem underlying Digital Manufacturing. Forming an opportunity for a concurrent application of data science and optimisation, a set of challenges arising from this problem is outlined.
Two limitations of our knowledge of quality
Venue: arXiv cs.SE 2016
Year: 2016

This article develops a quality notion that is complementary to the system notion. As a major consequence, it becomes clear why quality can be measured only to a certain extend based on the issues of validity and incompleteness. First, there is an inherent conflict between the applicability and validity of quality measures and second, quality considerations almost always refer to high-dimensional spaces with only sparse knowledge also known as "curse of dimensionality". The resulting gap of knowledge has to be filled by experienced based heuristics. To deal with the curse of dimensionality, the heuristics of categorizing qualities into strategic and necessary is proposed. Strategic qualities provide contrast, while necessary qualities rather diminish contrast. In an economic context the presence of strategic qualities motivate a buy-decision and the absence of necessary qualities motivate a don't-buy-decision.
Software-Defined Networking Based Network Virtualization for Mobile Operators
Venue: arXiv cs.NI 2016
Year: 2016

Software-Defined Networking (SDN) paradigm provides many features including hardware abstraction, programmable networking and centralized policy control. One of the main benefits used along with these features is core/backhaul network virtualization which ensures sharing of mobile core and backhaul networks among Mobile Operators (MOs). In this paper, we propose a virtualized SDN-based Evolved Packet System (EPS) cellular network architecture including design of network virtualization controller. After virtualization of core/backhaul network elements, eNodeBs associated with MOs become a part of resource allocation problem for Backhaul Transport Providers (BTPs). We investigate the performance of our proposed architecture where eNodeBs are assigned to the MOs using quality-of-service (QoS)-aware and QoS-unaware scheduling algorithms under the consideration of time-varying numbers and locations of user equipments (UEs) through Monte-Carlo simulations. The performances are compared with traditional EPS in Long Term Evolution (LTE) architecture and the results reveal that our proposed architecture outperforms the traditional cellular network architecture.
Modelling Stock-market Investors as Reinforcement Learning Agents [Correction]
Venue: arXiv cs.CE 2016
Year: 2016

Decision making in uncertain and risky environments is a prominent area of research. Standard economic theories fail to fully explain human behaviour, while a potentially promising alternative may lie in the direction of Reinforcement Learning (RL) theory. We analyse data for 46 players extracted from a financial market online game and test whether Reinforcement Learning (Q-Learning) could capture these players behaviour using a risk measure based on financial modeling. Moreover we test an earlier hypothesis that players are "naïve" (short-sighted). Our results indicate that a simple Reinforcement Learning model which considers only the selling component of the task captures the decision-making process for a subset of players but this is not sufficient to draw any conclusion on the population. We also find that there is not a significant improvement of fitting of the players when using a full RL model against a myopic version, where only immediate reward is valued by the players. This indicates that players, if using a Reinforcement Learning approach, do so naïvely
A framework for mining process models from emails logs
Venue: arXiv cs.CL 2016
Year: 2016

Due to its wide use in personal, but most importantly, professional contexts, email represents a valuable source of information that can be harvested for understanding, reengineering and repurposing undocumented business processes of companies and institutions. Towards this aim, a few researchers investigated the problem of extracting process oriented information from email logs in order to take benefit of the many available process mining techniques and tools. In this paper we go further in this direction, by proposing a new method for mining process models from email logs that leverage unsupervised machine learning techniques with little human involvement. Moreover, our method allows to semi-automatically label emails with activity names, that can be used for activity recognition in new incoming emails. A use case demonstrates the usefulness of the proposed solution using a modest in size, yet real-world, dataset containing emails that belong to two different process models.
Transfer Learning for Material Classification using Convolutional Networks
Venue: arXiv cs.CV 2016
Year: 2016

Material classification in natural settings is a challenge due to complex interplay of geometry, reflectance properties, and illumination. Previous work on material classification relies strongly on hand-engineered features of visual samples. In this work we use a Convolutional Neural Network (convnet) that learns descriptive features for the specific task of material recognition. Specifically, transfer learning from the task of object recognition is exploited to more effectively train good features for material classification. The approach of transfer learning using convnets yields significantly higher recognition rates when compared to previous state-of-the-art approaches. We then analyze the relative contribution of reflectance and shading information by a decomposition of the image into its intrinsic components. The use of convnets for material classification was hindered by the strong demand for sufficient and diverse training data, even with transfer learning approaches. Therefore, we present a new data set containing approximately 10k images divided into 10 material categories.
Separability of Lyapunov Functions for Contractive Monotone Systems
Venue: arXiv cs.SY 2016
Year: 2016

We consider constructing Lyapunov functions for systems that are both monotone and contractive with respect to a weighted one norm or infinity norm. This class of systems admits separable Lyapunov functions that are either the sum or the maximum of a collection of functions of a single argument. In either case, two classes of separable Lyapunov functions exist: the first class is separable along the system's state, and the second class is separable along components of the system's vector field. The latter case is advantageous for many practically motivated systems for which it is difficult to measure the system's state but easier to measure the system's velocity or rate of change. We provide several examples to demonstrate our results.
GAdaBoost: Accelerating Adaboost Feature Selection with Genetic Algorithms
Venue: arXiv cs.CV 2016
Year: 2016

Boosted cascade of simple features, by Viola and Jones, is one of the most famous object detection frameworks. However, it suffers from a lengthy training process. This is due to the vast features space and the exhaustive search nature of Adaboost. In this paper we propose GAdaboost: a Genetic Algorithm to accelerate the training procedure through natural feature selection. Specifically, we propose to limit Adaboost search within a subset of the huge feature space, while evolving this subset following a Genetic Algorithm. Experiments demonstrate that our proposed GAdaboost is up to 3.7 times faster than Adaboost. We also demonstrate that the price of this speedup is a mere decrease (3%, 4%) in detection accuracy when tested on FDDB benchmark face detection set, and Caltech Web Faces respectively.