OpenRaiser/Intern-Atlas huggingface dataset:
Online Learning for Sparse PCA in High Dimensions: Exact Dynamics and Phase Transitions
Venue: arXiv cs.IT 2016
Year: 2016

We study the dynamics of an online algorithm for learning a sparse leading eigenvector from samples generated from a spiked covariance model. This algorithm combines the classical Oja's method for online PCA with an element-wise nonlinearity at each iteration to promote sparsity. In the high-dimensional limit, the joint empirical measure of the underlying sparse eigenvector and its estimate provided by the algorithm is shown to converge weakly to a deterministic, measure-valued process. This scaling limit is characterized as the unique solution of a nonlinear PDE, and it provides exact information regarding the asymptotic performance of the algorithm. For example, performance metrics such as the cosine similarity and the misclassification rate in sparse support recovery can be obtained by examining the limiting dynamics. A steady-state analysis of the nonlinear PDE also reveals an interesting phase transition phenomenon. Although our analysis is asymptotic in nature, numerical simulations show that the theoretical predictions are accurate for moderate signal dimensions.
Learning to learn with backpropagation of Hebbian plasticity
Venue: arXiv cs.NE 2016
Year: 2016

Hebbian plasticity is a powerful principle that allows biological brains to learn from their lifetime experience. By contrast, artificial neural networks trained with backpropagation generally have fixed connection weights that do not change once training is complete. While recent methods can endow neural networks with long-term memories, Hebbian plasticity is currently not amenable to gradient descent. Here we derive analytical expressions for activity gradients in neural networks with Hebbian plastic connections. Using these expressions, we can use backpropagation to train not just the baseline weights of the connections, but also their plasticity. As a result, the networks "learn how to learn" in order to solve the problem at hand: the trained networks automatically perform fast learning of unpredictable environmental features during their lifetime, expanding the range of solvable problems. We test the algorithm on various on-line learning tasks, including pattern completion, one-shot learning, and reversal learning. The algorithm successfully learns how to learn the relevant associations from one-shot instruction, and fine-tunes the temporal dynamics of plasticity to allow for continual learning in response to changing environmental parameters. We conclude that backpropagation of Hebbian plasticity offers a powerful model for lifelong learning.
Soft Recovery Through $\ell_{1,2}$ Minimization with Applications in Recovery of Simultaneously Sparse and Low-Rank Matrice
Venue: arXiv cs.NA 2016
Year: 2016

This article provides a new type of analysis of a compressed-sensing based technique for recovering column-sparse matrices, namely minimization of the $\ell_{1,2}$-norm. Rather than providing conditions on the measurement matrix which guarantees the solution of the program to be exactly equal to the ground truth signal (which already has been thoroughly investigated), it presents a condition which guarantees that the solution is approximately equal to the ground truth. Soft recovery statements of this kind are to the best knowledge of the author a novelty in Compressed Sensing. Apart from the theoretical analysis, we present two heuristic proposes how this property of the $\ell_{1,2}$-program can be utilized to design algorithms for recovery of matrices which are sparse and have low rank at the same time.
Velocity-Aware Handover Management in Two-Tier Cellular Networks
Venue: arXiv cs.NI 2016
Year: 2016

While network densification is considered an important solution to cater the ever-increasing capacity demand, its effect on the handover (HO) rate is overlooked. In dense 5G networks, HO delays may neutralize or even negate the gains offered by network densification. Hence, user mobility imposes a nontrivial challenge to harvest capacity gains via network densification. In this paper, we propose a velocity-aware HO management scheme for two-tier downlink cellular network to mitigate the HO effect on the foreseen densification throughput gains. The proposed HO scheme sacrifices the best BS connectivity, by skipping HO to some BSs along the user's trajectory, to maintain longer connection durations and reduce HO rates. Furthermore, the proposed scheme enables cooperative BS service and strongest interference cancellation to compensate for skipping the best connectivity. To this end, we consider different HO skipping scenarios and develop a velocity-aware mathematical model, via stochastic geometry, to quantify the performance of the proposed HO scheme in terms of the coverage probability and user throughput. The results highlight the HO rate problem in dense cellular environments and show the importance of the proposed HO schemes. Finally, the value of BS cooperation along with handover skipping is quantified for different user mobility profiles.
Reduced Memory Region Based Deep Convolutional Neural Network Detection
Venue: arXiv cs.CV 2016
Year: 2016

Accurate pedestrian detection has a primary role in automotive safety: for example, by issuing warnings to the driver or acting actively on car's brakes, it helps decreasing the probability of injuries and human fatalities. In order to achieve very high accuracy, recent pedestrian detectors have been based on Convolutional Neural Networks (CNN). Unfortunately, such approaches require vast amounts of computational power and memory, preventing efficient implementations on embedded systems. This work proposes a CNN-based detector, adapting a general-purpose convolutional network to the task at hand. By thoroughly analyzing and optimizing each step of the detection pipeline, we develop an architecture that outperforms methods based on traditional image features and achieves an accuracy close to the state-of-the-art while having low computational complexity. Furthermore, the model is compressed in order to fit the tight constrains of low power devices with a limited amount of embedded memory available. This paper makes two main contributions: (1) it proves that a region based deep neural network can be finely tuned to achieve adequate accuracy for pedestrian detection (2) it achieves a very low memory usage without reducing detection accuracy on the Caltech Pedestrian dataset.
Latest Datasets and Technologies Presented in the Workshop on Grasping and Manipulation Datasets
Venue: arXiv cs.RO 2016
Year: 2016

This paper reports the activities and outcomes in the Workshop on Grasping and Manipulation Datasets that was organized under the International Conference on Robotics and Automation (ICRA) 2016. The half day workshop was packed with nine invited talks, 12 interactive presentations, and one panel discussion with ten panelists. This paper summarizes all the talks and presentations and recaps what has been discussed in the panels session. This summary servers as a review of recent developments in data collection in grasping and manipulation. Many of the presentations describe ongoing efforts or explorations that could be achieved and fully available in a year or two. The panel discussion not only commented on the current approaches, but also indicates new directions and focuses. The workshop clearly displayed the importance of quality datasets in robotics and robotic grasping and manipulation field. Hopefully the workshop could motivate larger efforts to create big datasets that are comparable with big datasets in other communities such as computer vision.
Increasing Wireless Sensor Networks Lifetime with New Method
Venue: arXiv cs.NI 2016
Year: 2016

One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering Network environment, it is divided into two virtual layers (using distance between sensor nodes and base station) and then regarding to sensors position in each of two layers, residual energy of sensor and distance from base station is used in clustering. In this article, we compare proposed algorithm with well-known LEACH and ELEACH algorithms in homogeneous environment (with equal energy for all sensors) and heterogeneous one (energy of half of sensors get doubled), also for static and dynamic situation of base station. Results show that our proposed algorithm delivers improved performance.
Automatic Selection of Stochastic Watershed Hierarchies
Venue: arXiv cs.CV 2016
Year: 2016

The segmentation, seen as the association of a partition with an image, is a difficult task. It can be decomposed in two steps: at first, a family of contours associated with a series of nested partitions (or hierarchy) is created and organized, then pertinent contours are extracted. A coarser partition is obtained by merging adjacent regions of a finer partition. The strength of a contour is then measured by the level of the hierarchy for which its two adjacent regions merge. We present an automatic segmentation strategy using a wide range of stochastic watershed hierarchies. For a given set of homogeneous images, our approach selects automatically the best hierarchy and cut level to perform image simplification given an evaluation score. Experimental results illustrate the advantages of our approach on several real-life images datasets.
No Free Charge Theorem: a Covert Channel via USB Charging Cable on Mobile Devices
Venue: arXiv cs.CR 2016
Year: 2016

More and more people are regularly using mobile and battery-powered handsets, such as smartphones and tablets. At the same time, thanks to the technological innovation and to the high user demands, those devices are integrating extensive functionalities and developers are writing battery-draining apps, which results in a surge of energy consumption of these devices. This scenario leads many people to often look for opportunities to charge their devices at public charging stations: the presence of such stations is already prominent around public areas such as hotels, shopping malls, airports, gyms and museums, and is expected to significantly grow in the future. While most of the time the power comes for free, there is no guarantee that the charging station is not maliciously controlled by an adversary, with the intention to exfiltrate data from the devices that are connected to it. In this paper, we illustrate for the first time how an adversary could leverage a maliciously controlled charging station to exfiltrate data from the smartphone via a USB charging cable (i.e., without using the data transfer functionality), controlling a simple app running on the device, and without requiring any permission to be granted by the user to send data out of the device. We show the feasibility of the proposed attack through a prototype implementation in Android, which is able to send out potentially sensitive information, such as IMEI, contacts' phone number, and pictures.
Online Charging Scheduling Algorithms of Electric Vehicles in Smart Grid: An Overview
Venue: arXiv cs.OH 2016
Year: 2016

As an environment-friendly substitute for conventional fuel-powered vehicles, electric vehicles (EVs) and their components have been widely developed and deployed worldwide. The large-scale integration of EVs into power grid brings both challenges and opportunities to the system performance. On one hand, the load demand from EV charging imposes large impact on the stability and efficiency of power grid. On the other hand, EVs could potentially act as mobile energy storage systems to improve the power network performance, such as load flattening, fast frequency control, and facilitating renewable energy integration. Evidently, uncontrolled EV charging could lead to inefficient power network operation or even security issues. This spurs enormous research interests in designing charging coordination mechanisms. A key design challenge here lies in the lack of complete knowledge of events that occur in the future. Indeed, the amount of knowledge of future events significantly impacts the design of efficient charging control algorithms. This article focuses on introducing online EV charging scheduling techniques that deal with different degrees of uncertainty and randomness of future knowledge. Besides, we highlight the promising future research directions for EV charging control.
Joint Optimization of Energy Efficiency and Data Compression in TDMA-Based Medium Access Control for the IoT - Extended Version
Venue: arXiv cs.IT 2016
Year: 2016

Energy efficiency is a key requirement for the Internet of Things, as many sensors are expected to be completely stand-alone and able to run for years without battery replacement. Data compression aims at saving some energy by reducing the volume of data sent over the network, but also affects the quality of the received information. In this work, we formulate an optimization problem to jointly design the source coding and transmission strategies for time-varying channels and sources, with the twofold goal of extending the network lifetime and granting low distortion levels. We propose a scalable offline optimal policy that allocates both energy and transmission parameters (i.e., times and powers) in a network with a dynamic Time Division Multiple Access (TDMA)-based access scheme.
An architecture for ethical robots
Venue: arXiv cs.RO 2016
Year: 2016

Robots are becoming ever more autonomous. This expanding ability to take unsupervised decisions renders it imperative that mechanisms are in place to guarantee the safety of behaviours executed by the robot. Moreover, smart autonomous robots should be more than safe; they should also be explicitly ethical -- able to both choose and justify actions that prevent harm. Indeed, as the cognitive, perceptual and motor capabilities of robots expand, they will be expected to have an improved capacity for making moral judgements. We present a control architecture that supplements existing robot controllers. This so-called Ethical Layer ensures robots behave according to a predetermined set of ethical rules by predicting the outcomes of possible actions and evaluating the predicted outcomes against those rules. To validate the proposed architecture, we implement it on a humanoid robot so that it behaves according to Asimov's laws of robotics. In a series of four experiments, using a second humanoid robot as a proxy for the human, we demonstrate that the proposed Ethical Layer enables the robot to prevent the human from coming to harm.
Freeway Lane Management Approach in Mixed Traffic Environment with Connected Autonomous Vehicles
Venue: arXiv cs.SY 2016
Year: 2016

Connected autonomous vehicles (CAV) technologies are about to be in the market in the near future. This requires transportation facilities ready to operate in a mixed traffic environment where a portion of vehicles are CAVs and the remaining are manual vehicles. Since CAVs are able to run with less spacing and headway compared with manual vehicles or mixed traffic, allocating a number of freeway lanes exclusive to CAVs may improve the overall performance of freeways. In this paper, we propose an analytical managed lane model to evaluate the freeway flow in mixed traffic and to determine the optimal number of lanes to be allocated to CAVs. The proposed model is investigated in two different operation environments: single-lane and managed lane environments. We further define three different CAV technology scenarios: neutral, conservative, and aggressive. In the single-lane problem, the influence of CAV penetration rates on mixed traffic capacity is examined in each scenario. In the managed lanes problem, we propose a method to determine the optimal number of dedicated lanes for CAVs under different settings. A number of numerical examples with different geometries and demand levels are investigated for all three scenarios. A sensitivity analysis on the penetration rates is conducted. The results show that more aggressive CAV technologies need less specific allocated lanes because they can follow the vehicles with less time and space headways.
Dropout Prediction in Crowdsourcing Markets
Venue: arXiv cs.HC 2016
Year: 2016

Crowdsourcing environments have shown promise in solving diverse tasks in limited cost and time. This type of business model involves both the expert and non-expert workers. Interestingly, the success of such models depends on the volume of the total number of workers. But, the survival of the fittest controls the stability of these workers. Here, we show that the crowd workers who fail to win jobs successively loose interest and might dropout over time. Therefore, dropout prediction in such environments is a promising task. In this paper, we establish that it is possible to predict the dropouts in a crowdsourcing market from the success rate based on the arrival pattern of workers.
Directed graphs and its Boundary Vertices
Venue: arXiv cs.DM 2016
Year: 2016

Suppose that $D=(V,E)$ is a strongly connected digraph. Let $u,v\in V(D)$. The maximum distance $md (u,v)$ is defined as $md(u,v)$=max\{$\overrightarrow{d}(u,v), \overrightarrow{d}(v,u)$\} where $\overrightarrow{d}(u,v)$ denote the length of a shortest directed $u-v$ path in $D$. This is a metric. The boundary, contour, eccentric and peripheral sets of a strong digraph $D$ are defined with respect to this metric. The main aim of this paper is to identify the above said metrically defined sets of a large strong digraph $D$ in terms of its prime factor decomposition with respect to cartesian product.
Relational Models
Venue: arXiv cs.AI 2016
Year: 2016

We provide a survey on relational models. Relational models describe complete networked {domains by taking into account global dependencies in the data}. Relational models can lead to more accurate predictions if compared to non-relational machine learning approaches. Relational models typically are based on probabilistic graphical models, e.g., Bayesian networks, Markov networks, or latent variable models. Relational models have applications in social networks analysis, the modeling of knowledge graphs, bioinformatics, recommendation systems, natural language processing, medical decision support, and linked data.
Divide and...conquer? On the limits of algorithmic approaches to syntactic semantic structure
Venue: arXiv cs.CL 2016
Year: 2016

In computer science, divide and conquer (D&C) is an algorithm design paradigm based on multi-branched recursion. A D&C algorithm works by recursively and monotonically breaking down a problem into sub problems of the same (or a related) type, until these become simple enough to be solved directly. The solutions to the sub problems are then combined to give a solution to the original problem. The present work identifies D&C algorithms assumed within contemporary syntactic theory, and discusses the limits of their applicability in the realms of the syntax semantics and syntax morphophonology interfaces. We will propose that D&C algorithms, while valid for some processes, fall short on flexibility given a mixed approach to the structure of linguistic phrase markers. Arguments in favour of a computationally mixed approach to linguistic structure will be presented as an alternative that offers advantages to uniform D&C approaches.
E3 : Keyphrase based News Event Exploration Engine
Venue: arXiv cs.IR 2016
Year: 2016

This paper presents a novel system E3 for extracting keyphrases from news content for the purpose of offering the news audience a broad overview of news events, with especially high content volume. Given an input query, E3 extracts keyphrases and enrich them by tagging, ranking and finding role for frequently associated keyphrases. Also, E3 finds the novelty and activeness of keyphrases using news publication date, to identify the most interesting and informative keyphrases.
When categorization-based stranger avoidance explains the uncanny valley: A comment on MacDorman & Chattopadhyay (2016)
Venue: arXiv cs.HC 2016
Year: 2016

Artificial objects often subjectively look eerie when their appearance to some extent resembles a human, which is known as the uncanny valley phenomenon. From a cognitive psychology perspective, several explanations of the phenomenon have been put forth, two of which are object categorization and realism inconsistency. Recently, MacDorman and Chattopadhyay (2016) reported experimental data as evidence in support of the latter. In our estimation, however, their results are still consistent with categorization-based stranger avoidance. In this Discussions paper, we try to describe why categorization-based stranger avoidance remains a viable explanation, despite the evidence of MacDorman and Chattopadhyay, and how it offers a more inclusive explanation of the impression of eeriness in the uncanny valley phenomenon.
Bio-Inspired Filter Banks for SSVEP-based Brain-Computer Interfaces
Venue: arXiv cs.HC 2016
Year: 2016

Brain-computer interfaces (BCI) have the potential to play a vital role in future healthcare technologies by providing an alternative way of communication and control. More specifically, steady-state visual evoked potential (SSVEP) based BCIs have the advantage of higher accuracy and higher information transfer rate (ITR). In order to fully exploit the capabilities of such devices, it is necessary to understand the features of SSVEP and design the system considering its biological characteristics. This paper introduces bio-inspired filter banks (BIFB) for a novel SSVEP frequency detection method. It is known that SSVEP response to a flickering visual stimulus is frequency selective and gets weaker as the frequency of the stimuli increases. In the proposed approach, the gain and bandwidth of the filters are designed and tuned based on these characteristics while also incorporating harmonic SSVEP responses. This method not only improves the accuracy but also increases the available number of commands by allowing the use of stimuli frequencies elicit weak SSVEP responses. The BIFB method achieved reliable performance when tested on datasets available online and compared with two well-known SSVEP frequency detection methods, power spectral density analysis (PSDA) and canonical correlation analysis (CCA). The results show the potential of bio-inspired design which will be extended to include further SSVEP characteristic (e.g. time-domain waveform) for future SSVEP based BCIs.
M2M Traffic via Random Access Satellite links: Interactions between Transport and MAC Layers
Venue: arXiv cs.NI 2016
Year: 2016

Machine-to-machine services are witnessing an unprecedented diffusion, which is expected to result in an ever-increasing data traffic load. In this context, satellite technology is playing a pivotal role, since it enables a widespread provisioning of machine-to-machine services. In particular, oil industry, maritime communications, as well as remote monitoring are sectors where the use of satellite communications is expected to dramatically explode within the next few years. In the light of this sudden increase of machine-to-machine data transported over satellite, a more thorough understanding of machine-to-machine service implementation over satellite is required, especially focusing on the interaction between transport and MAC layers of the protocol stack. Starting from these observations, this paper thoroughly analyses the interaction between TCP and the Contention Resolution Diversity Slotted Aloha access scheme defined in the DVB-RCS2 standard, assuming the use of an MQTT-like protocol to distribute machine-to-machine services. A novel TCP model is developed and validated through extensive simulation campaigns, which also shed important lights on the design choices enabling the efficient transport of machine-to-machine data via satellite.