OpenRaiser/Intern-Atlas huggingface dataset:
AntPaP: Patrolling and Fair Partitioning of Graphs by A(ge)nts Leaving Pheromone Traces
Venue: arXiv cs.MA 2016
Year: 2016

A team of identical and oblivious ant-like agents - a(ge)nts - leaving pheromone traces, are programmed to jointly patrol an area modeled as a graph. They perform this task using simple local interactions, while also achieving the important byproduct of partitioning the graph into roughly equal-sized disjoint sub-graphs. Each a(ge)nt begins to operate at an arbitrary initial location, and throughout its work does not acquire any information on either the shape or size of the graph, or the number or whereabouts of other a(ge)nts. Graph partitioning occurs spontaneously, as each of the a(ge)nts patrols and expands its own pheromone-marked sub-graph, or region. This graph partitioning algorithm is inspired by molecules hitting the borders of air filled elastic balloons: an a(ge)nt that hits a border edge from the interior of its region more frequently than an external a(ge)nt hits the same edge from an adjacent vertex in the neighboring region, may conquer that adjacent vertex, expanding its region at the expense of the neighbor. Since the rule of patrolling a region ensures that each vertex is visited with a frequency inversely proportional to the size of the region, in terms of vertex count, a smaller region will effectively exert higher "pressure" at its borders, and conquer adjacent vertices from a larger region, thereby increasing the smaller region and shrinking the larger. The algorithm, therefore, tends to equalize the sizes of the regions patrolled, resembling a set of perfectly elastic physical balloons, confined to a closed volume and filled with an equal amount of air. The pheromone based local interactions of agents eventually cause the system to evolve into a partition that is close to balanced rather quickly, and if the graph and the number of a(ge)nts remain unchanged, it is guaranteed that the system settles into a stable and balanced partition.
SMAP: Simultaneous Mapping and Planning on Occupancy Grids
Venue: arXiv cs.RO 2016
Year: 2016

Occupancy grids are the most common framework when it comes to creating a map of the environment using a robot. This paper studies occupancy grids from the motion planning perspective and proposes a mapping method that provides richer data (map) for the purpose of planning and collision avoidance. Typically, in occupancy grid mapping, each cell contains a single number representing the probability of cell being occupied. This leads to conflicts in the map, and more importantly inconsistency between the map error and reported confidence values. Such inconsistencies pose challenges for the planner that relies on the generated map for planning motions. In this work, we store a richer data at each voxel including an accurate estimate of the variance of occupancy. We show that in addition to achieving maps that are often more accurate than tradition methods, the proposed filtering scheme demonstrates a much higher level of consistency between its error and its reported confidence. This allows the planner to reason about acquisition of the future sensory information. Such planning can lead to active perception maneuvers that while guiding the robot toward the goal aims at increasing the confidence in parts of the map that are relevant to accomplishing the task.
Covert Bits Through Queues
Venue: arXiv cs.IT 2016
Year: 2016

We consider covert communication using a queuing timing channel in the presence of a warden. The covert message is encoded using the inter-arrival times of the packets, and the legitimate receiver and the warden observe the inter-departure times of the packets from their respective queues. The transmitter and the legitimate receiver also share a secret key to facilitate covert communication. We propose achievable schemes that obtain non-zero covert rate for both exponential and general queues when a sufficiently high rate secret key is available. This is in contrast to other channel models such as the Gaussian channel or the discrete memoryless channel where only $\mathcal{O}(\sqrt{n})$ covert bits can be sent over $n$ channel uses, yielding a zero covert rate.
Modelling Student Behavior using Granular Large Scale Action Data from a MOOC
Venue: arXiv cs.CY 2016
Year: 2016

Digital learning environments generate a precise record of the actions learners take as they interact with learning materials and complete exercises towards comprehension. With this high quantity of sequential data comes the potential to apply time series models to learn about underlying behavioral patterns and trends that characterize successful learning based on the granular record of student actions. There exist several methods for looking at longitudinal, sequential data like those recorded from learning environments. In the field of language modelling, traditional n-gram techniques and modern recurrent neural network (RNN) approaches have been applied to algorithmically find structure in language and predict the next word given the previous words in the sentence or paragraph as input. In this paper, we draw an analogy to this work by treating student sequences of resource views and interactions in a MOOC as the inputs and predicting students' next interaction as outputs. In this study, we train only on students who received a certificate of completion. In doing so, the model could potentially be used for recommendation of sequences eventually leading to success, as opposed to perpetuating unproductive behavior. Given that the MOOC used in our study had over 3,500 unique resources, predicting the exact resource that a student will interact with next might appear to be a difficult classification problem. We find that simply following the syllabus (built-in structure of the course) gives on average 23% accuracy in making this prediction, followed by the n-gram method with 70.4%, and RNN based methods with 72.2%. This research lays the ground work for recommendation in a MOOC and other digital learning environments where high volumes of sequential data exist.
Learning Latent Local Conversation Modes for Predicting Community Endorsement in Online Discussions
Venue: arXiv cs.SI 2016
Year: 2016

Many social media platforms offer a mechanism for readers to react to comments, both positively and negatively, which in aggregate can be thought of as community endorsement. This paper addresses the problem of predicting community endorsement in online discussions, leveraging both the participant response structure and the text of the comment. The different types of features are integrated in a neural network that uses a novel architecture to learn latent modes of discussion structure that perform as well as deep neural networks but are more interpretable. In addition, the latent modes can be used to weight text features thereby improving prediction accuracy.
Safe Serializable Secure Scheduling: Transactions and the Trade-off Between Security and Consistency
Venue: arXiv cs.DC 2016
Year: 2016

Modern applications often operate on data in multiple administrative domains. In this federated setting, participants may not fully trust each other. These distributed applications use transactions as a core mechanism for ensuring reliability and consistency with persistent data. However, the coordination mechanisms needed for transactions can both leak confidential information and allow unauthorized influence. By implementing a simple attack, we show these side channels can be exploited. However, our focus is on preventing such attacks. We explore secure scheduling of atomic, serializable transactions in a federated setting. While we prove that no protocol can guarantee security and liveness in all settings, we establish conditions for sets of transactions that can safely complete under secure scheduling. Based on these conditions, we introduce staged commit, a secure scheduling protocol for federated transactions. This protocol avoids insecure information channels by dividing transactions into distinct stages. We implement a compiler that statically checks code to ensure it meets our conditions, and a system that schedules these transactions using the staged commit protocol. Experiments on this implementation demonstrate that realistic federated transactions can be scheduled securely, atomically, and efficiently.
Robust Reactive Power Optimization and Voltage Control Method for Active Distribution Networks via Dual Time-scale Coordination
Venue: arXiv cs.SY 2016
Year: 2016

In distribution networks, there are slow controlling devices and fast controlling devices for Volt-VAR regulation. These slow controlling devices, such as capacitors or voltage regulators, cannot be operated frequently and should be scheduled tens of minutes ahead (Hereafter named as slow control). Since of the uncertainties in predicting the load and distributed generation, the voltage violations cannot be eliminated by fast controlling devices with improper schedule of the slow controlling devices. In this paper we propose dual time-scale coordination for the Volt-VAR control scheme, corresponding to slow and fast control. In the case of slow control, a robust voltage and reactive power optimization model is developed. This guarantees that subsequent fast controls can maintain the system's voltage security if the uncertain parameters vary within predefined limits. This nonconvex optimization problem is relaxed to a mix integer second order conic problem, and the dual form of its sub-problem is also derived. Then a column-and-constraint generation algorithm was used to solve the robust convexified model. A conventional deterministic optimization model can be used to determine the fast control mechanism. Numerical tests were conducted on a real distribution feeder in China, a balanced IEEE 69-bus and unbalanced 123-bus benchmark distribution networks. The simulation results show that solving the deterministic model is not always feasible and voltage violation may occur. The robust model was shown to be effective with respect to all possible scenarios in the uncertainty set, with little compromise in terms of network losses.
Generalized SIR Analysis for Stochastic Heterogeneous Wireless Networks: Theory and Applications
Venue: arXiv cs.IT 2016
Year: 2016

This paper provides an analytically tractable framework of investigating the statistical properties of the signal-to-interference power ratio (SIR) with a general distribution in a heterogeneous wireless ad hoc network in which there are K different types of transmitters (TXs) communicating with their unique intended receiver (RX). The TXs of each type form an independent homogeneous Poisson point process. In the first part of this paper, we introduce a novel approach to deriving the Laplace transform of the reciprocal of the SIR and use it to characterize the distribution of the SIR. Our main findings show that the closed-form expression of the distribution of the SIR can be obtained whenever the receive signal power has an Erlang distribution, and an almost closed-form expression can be found if the power-law pathloss model has a pathloss exponent of four. In the second part of this paper, we aim to apply the derived distribution of the SIR in finding the two important performance metrics: the success probability and ergodic link capacity. For each type of the RXs, the success probability with (without) interference cancellation and that with (without) the proposed stochastic power control are found in a compact form. With the aid of the derived Shannon transform identity, the ergodic link capacities of K-type RXs are derived with low complexity, and they can be applied to many transmitting scenarios, such as multi-antenna communication and stochastic power control. Finally, we analyze the spatial throughput capacity of the heterogeneous network defined based on the derived K success probabilities and ergodic link capacities and show the existence of its maximum.
Open Problem: Approximate Planning of POMDPs in the class of Memoryless Policies
Venue: arXiv cs.AI 2016
Year: 2016

Planning plays an important role in the broad class of decision theory. Planning has drawn much attention in recent work in the robotics and sequential decision making areas. Recently, Reinforcement Learning (RL), as an agent-environment interaction problem, has brought further attention to planning methods. Generally in RL, one can assume a generative model, e.g. graphical models, for the environment, and then the task for the RL agent is to learn the model parameters and find the optimal strategy based on these learnt parameters. Based on environment behavior, the agent can assume various types of generative models, e.g. Multi Armed Bandit for a static environment, or Markov Decision Process (MDP) for a dynamic environment. The advantage of these popular models is their simplicity, which results in tractable methods of learning the parameters and finding the optimal policy. The drawback of these models is again their simplicity: these models usually underfit and underestimate the actual environment behavior. For example, in robotics, the agent usually has noisy observations of the environment inner state and MDP is not a suitable model. More complex models like Partially Observable Markov Decision Process (POMDP) can compensate for this drawback. Fitting this model to the environment, where the partial observation is given to the agent, generally gives dramatic performance improvement, sometimes unbounded improvement, compared to MDP. In general, finding the optimal policy for the POMDP model is computationally intractable and fully non convex, even for the class of memoryless policies. The open problem is to come up with a method to find an exact or an approximate optimal stochastic memoryless policy for POMDP models.
Holistic Small Cell Traffic Balancing across Licensed and Unlicensed Bands
Venue: arXiv cs.NI 2016
Year: 2016

Due to the dramatic growth in mobile data traffic on one hand and the scarcity of the licensed spectrum on the other hand, mobile operators are considering the use of unlicensed bands (especially those in 5 GHz) as complementary spectrum for providing higher system capacity and better user experience. This approach is currently being standardized by 3GPP under the name of LTE Licensed-Assisted Access (LTE-LAA). In this paper, we take a holistic approach for LTE-LAA small cell traffic balancing by jointly optimizing the use of the licensed and unlicensed bands. We pose this traffic balancing as an optimization problem that seeks proportional fair coexistence of WiFi, small cell and macro cell users by adapting the transmission probability of the LTE-LAA small cell in the licensed and unlicensed bands. The motivation for this formulation is for the LTE-LAA small cell to switch between or aggregate licensed and unlicensed bands depending on the interference/traffic level and the number of active users in each band. We derive a closed form solution for this optimization problem and additionally propose a transmission mechanism for the operation of the LTE-LAA small cell on both bands. Through numerical and simulation results, we show that our proposed traffic balancing scheme, besides enabling better LTE-WiFi coexistence and efficient utilization of the radio resources relative to the existing traffic balancing scheme, also provides a better tradeoff between maximizing the total network throughput and achieving fairness among all network flows compared to alternative approaches.
A Bayesian Network approach to County-Level Corn Yield Prediction using historical data and expert knowledge
Venue: arXiv cs.LG 2016
Year: 2016

Crop yield forecasting is the methodology of predicting crop yields prior to harvest. The availability of accurate yield prediction frameworks have enormous implications from multiple standpoints, including impact on the crop commodity futures markets, formulation of agricultural policy, as well as crop insurance rating. The focus of this work is to construct a corn yield predictor at the county scale. Corn yield (forecasting) depends on a complex, interconnected set of variables that include economic, agricultural, management and meteorological factors. Conventional forecasting is either knowledge-based computer programs (that simulate plant-weather-soil-management interactions) coupled with targeted surveys or statistical model based. The former is limited by the need for painstaking calibration, while the latter is limited to univariate analysis or similar simplifying assumptions that fail to capture the complex interdependencies affecting yield. In this paper, we propose a data-driven approach that is "gray box" i.e. that seamlessly utilizes expert knowledge in constructing a statistical network model for corn yield forecasting. Our multivariate gray box model is developed on Bayesian network analysis to build a Directed Acyclic Graph (DAG) between predictors and yield. Starting from a complete graph connecting various carefully chosen variables and yield, expert knowledge is used to prune or strengthen edges connecting variables. Subsequently the structure (connectivity and edge weights) of the DAG that maximizes the likelihood of observing the training data is identified via optimization. We curated an extensive set of historical data (1948-2012) for each of the 99 counties in Iowa as data to train the model.
Experimental demonstration of Layered/Enhanced ACO-OFDM in short haul optical fiber transmission link
Venue: arXiv cs.IT 2016
Year: 2016

Asymmetrically clipped optical orthogonal frequency division multiplexing (ACO-OFDM) is theoretically more power efficient but less spectrally efficient than DC-bias OFDM (DCO-OFDM), with less power allocating to the informationless bias component by only using odd index sub-carriers. Layered/Enhanced asymmetrically clipped optical orthogonal frequency division multiplexing (L/E-ACO-OFDM) has been proposed to increase the spectral efficiency of ACO-OFDM. In this letter, we experimentally demonstrate a 30-km single mode fiber transmission using L/E-ACO-OFDM at 4.375 Gbits/s. Using a Volterra filter based equalizer, 2-dB and 1.5-dB Q-factor improvements for L/E-ACO-OFDM comparing with DCO-OFDM can be obtained in back-to-back and 30-km fiber transmission respectively.
Conditional Sparse Linear Regression
Venue: arXiv cs.LG 2016
Year: 2016

Machine learning and statistics typically focus on building models that capture the vast majority of the data, possibly ignoring a small subset of data as "noise" or "outliers." By contrast, here we consider the problem of jointly identifying a significant (but perhaps small) segment of a population in which there is a highly sparse linear regression fit, together with the coefficients for the linear fit. We contend that such tasks are of interest both because the models themselves may be able to achieve better predictions in such special cases, but also because they may aid our understanding of the data. We give algorithms for such problems under the sup norm, when this unknown segment of the population is described by a k-DNF condition and the regression fit is s-sparse for constant k and s. For the variants of this problem when the regression fit is not so sparse or using expected error, we also give a preliminary algorithm and highlight the question as a challenge for future work.
AID: A Benchmark Dataset for Performance Evaluation of Aerial Scene Classification
Venue: arXiv cs.CV 2016
Year: 2016

Aerial scene classification, which aims to automatically label an aerial image with a specific semantic category, is a fundamental problem for understanding high-resolution remote sensing imagery. In recent years, it has become an active task in remote sensing area and numerous algorithms have been proposed for this task, including many machine learning and data-driven approaches. However, the existing datasets for aerial scene classification like UC-Merced dataset and WHU-RS19 are with relatively small sizes, and the results on them are already saturated. This largely limits the development of scene classification algorithms. This paper describes the Aerial Image Dataset (AID): a large-scale dataset for aerial scene classification. The goal of AID is to advance the state-of-the-arts in scene classification of remote sensing images. For creating AID, we collect and annotate more than ten thousands aerial scene images. In addition, a comprehensive review of the existing aerial scene classification techniques as well as recent widely-used deep learning methods is given. Finally, we provide a performance analysis of typical aerial scene classification and deep learning approaches on AID, which can be served as the baseline results on this benchmark.
Deeply-Supervised Recurrent Convolutional Neural Network for Saliency Detection
Venue: arXiv cs.CV 2016
Year: 2016

This paper proposes a novel saliency detection method by developing a deeply-supervised recurrent convolutional neural network (DSRCNN), which performs a full image-to-image saliency prediction. For saliency detection, the local, global, and contextual information of salient objects is important to obtain a high quality salient map. To achieve this goal, the DSRCNN is designed based on VGGNet-16. Firstly, the recurrent connections are incorporated into each convolutional layer, which can make the model more powerful for learning the contextual information. Secondly, side-output layers are added to conduct the deeply-supervised operation, which can make the model learn more discriminative and robust features by effecting the intermediate layers. Finally, all of the side-outputs are fused to integrate the local and global information to get the final saliency detection results. Therefore, the DSRCNN combines the advantages of recurrent convolutional neural networks and deeply-supervised nets. The DSRCNN model is tested on five benchmark datasets, and experimental results demonstrate that the proposed method significantly outperforms the state-of-the-art saliency detection approaches on all test datasets.
Blockchain in internet of things: Challenges and Solutions
Venue: arXiv cs.CR 2016
Year: 2016

The Internet of Things IoT is experiencing exponential growth in research and industry, but it still suffers from privacy and security vulnerabilities. Conventional security and privacy approaches tend to be inapplicable for IoT, mainly due to its decentralized topology and the resource-constraints of the majority of its devices. BlockChain BC that underpin the crypto-currency Bitcoin have been recently used to provide security and privacy in peer-to-peer networks with similar topologies to IoT. However, BCs are computationally expensive and involve high bandwidth overhead and delays, which are not suitable for IoT devices. This position paper proposes a new secure, private, and lightweight architecture for IoT, based on BC technology that eliminates the overhead of BC while maintaining most of its security and privacy benefits. The described method is investigated on a smart home application as a representative case study for broader IoT applications. The proposed architecture is hierarchical, and consists of smart homes, an overlay network and cloud storages coordinating data transactions with BC to provide privacy and security. Our design uses different types of BCs depending on where in the network hierarchy a transaction occurs, and uses distributed trust methods to ensure a decentralized topology. Qualitative evaluation of the architecture under common threat models highlights its effectiveness in providing security and privacy for IoT applications.