OpenRaiser/Intern-Atlas huggingface dataset:
Stabilizing Transmission Intervals for Nonlinear Delayed Networked Control Systems [Extended Version]
Venue: arXiv cs.SY 2016
Year: 2016

In this article, we consider a nonlinear process with delayed dynamics to be controlled over a communication network in the presence of disturbances and study robustness of the resulting closed-loop system with respect to network-induced phenomena such as sampled, distorted, delayed and lossy data as well as scheduling protocols. For given plant-controller dynamics and communication network properties (e.g., propagation delays and scheduling protocols), we quantify the control performance level (in terms of Lp-gains) as the transmission interval varies. Maximally Allowable Transfer Interval (MATI) labels the greatest transmission interval for which a prescribed Lp-gain is attained. The proposed methodology combines impulsive delayed system modeling with Lyapunov-Razumikhin techniques to allow for MATIs that are smaller than the communication delays. Other salient features of our methodology are the consideration of variable delays, corrupted data and employment of model-based estimators to prolong MATIs. The present stability results are provided for the class of Uniformly Globally Exponentially Stable (UGES) scheduling protocols. The well-known Round Robin (RR) and Try-Once-Discard (TOD) protocols are examples of UGES protocols. Finally, two numerical examples are provided to demonstrate the benefits of the proposed approach.
Expected Reachability-Time Games
Venue: arXiv cs.LO 2016
Year: 2016

Probabilistic timed automata are a suitable formalism to model systems with real-time, nondeterministic and probabilistic behaviour. We study two-player zero-sum games on such automata where the objective of the game is specified as the expected time to reach a target. The two players---called player Min and player Max---compete by proposing timed moves simultaneously and the move with a shorter delay is performed. The first player attempts to minimise the given objective while the second tries to maximise the objective. We observe that these games are not determined, and study decision problems related to computing the upper and lower values, showing that the problems are decidable and lie in the complexity class NEXPTIME $\cap$ co-NEXPTIME.
PRI: Privacy Preserving Inspection of Encrypted Network Traffic
Venue: arXiv cs.CR 2016
Year: 2016

Traffic inspection is a fundamental building block of many security solutions today. For example, to prevent the leakage or exfiltration of confidential insider information, as well as to block malicious traffic from entering the network, most enterprises today operate intrusion detection and prevention systems that inspect traffic. However, the state-of-the-art inspection systems do not reflect well the interests of the different involved autonomous roles. For example, employees in an enterprise, or a company outsourcing its network management to a specialized third party, may require that their traffic remains confidential, even from the system administrator. Moreover, the rules used by the intrusion detection system, or more generally the configuration of an online or offline anomaly detection engine, may be provided by a third party, e.g., a security research firm, and can hence constitute a critical business asset which should be kept confidential. Today, it is often believed that accounting for these additional requirements is impossible, as they contradict efficiency and effectiveness. We in this paper explore a novel approach, called Privacy Preserving Inspection (PRI), which provides a solution to this problem, by preserving privacy of traffic inspection and confidentiality of inspection rules and configurations, and e.g., also supports the flexible installation of additional Data Leak Prevention (DLP) rules specific to the company.
On Dynamic Job Ordering and Slot Configurations for Minimizing the Makespan Of Multiple MapReduce Jobs
Venue: arXiv cs.DS 2016
Year: 2016

MapReduce is a popular parallel computing paradigm for Big Data processing in clusters and data centers. It is observed that different job execution orders and MapReduce slot configurations for a MapReduce workload have significantly different performance with regarding to the makespan, total completion time, system utilization and other performance metrics. There are quite a few algorithms on minimizing makespan of multiple MapReduce jobs. However, these algorithms are heuristic or suboptimal. The best known algorithm for minimizing the makespan is 3-approximation by applying Johnson rule. In this paper, we propose an approach called UAAS algorithm to meet the conditions of classical Johnson model. Then we can still use Johnson model for an optimal solution. We explain how to adapt to Johnson model and provide a few key features of our proposed method.
Manifold Learning with Contracting Observers for Data-driven Time-series Analysis
Venue: arXiv cs.SY 2016
Year: 2016

Analyzing signals arising from dynamical systems typically requires many modeling assumptions and parameter estimation. In high dimensions, this modeling is particularly difficult due to the "curse of dimensionality". In this paper, we propose a method for building an intrinsic representation of such signals in a purely data-driven manner. First, we apply a manifold learning technique, diffusion maps, to learn the intrinsic model of the latent variables of the dynamical system, solely from the measurements. Second, we use concepts and tools from control theory and build a linear contracting observer to estimate the latent variables in a sequential manner from new incoming measurements. The effectiveness of the presented framework is demonstrated by applying it to a toy problem and to a music analysis application. In these examples we show that our method reveals the intrinsic variables of the analyzed dynamical systems.
Accessing accurate documents by mining auxiliary document information
Venue: arXiv cs.IR 2016
Year: 2016

Earlier techniques of text mining included algorithms like k-means, Naive Bayes, SVM which classify and cluster the text document for mining relevant information about the documents. The need for improving the mining techniques has us searching for techniques using the available algorithms. This paper proposes one technique which uses the auxiliary information that is present inside the text documents to improve the mining. This auxiliary information can be a description to the content. This information can be either useful or completely useless for mining. The user should assess the worth of the auxiliary information before considering this technique for text mining. In this paper, a combination of classical clustering algorithms is used to mine the datasets. The algorithm runs in two stages which carry out mining at different levels of abstraction. The clustered documents would then be classified based on the necessary groups. The proposed technique is aimed at improved results of document clustering.
Competition Between Regulation-Providing and Fixed-Power Charging Stations for Electric Vehicles
Venue: arXiv cs.GT 2016
Year: 2016

This paper models a non-cooperative game between two EV charging stations. One is a fixed-power charging station purchasing electricity from the grid at wholesale price and reselling the energy to EV owners at a higher retail price; the other is regulation-providing and varies the recharging power level of its clients to provide regulation services to the grid, so its profit comes from both EV owners (who buy energy) and the grid (which pays for regulation services). Users are reluctant to charging power variations and prefer shorter overall charging times, hence regulation-providing charging has to be cheaper than fixed-power charging. We analyze the competition among those charging providers, and examine the performance at the equilibrium in terms of user welfare, station revenue and electricity prices. As expected, competing stations provide users with lower charging prices than when both charging solutions are offered by a monopolistic provider. Moreover, while competition benefits users, it also benefits the grid in that the amount of regulation services increases significantly with respect to the monopolistic case.
A Proposal for Energy-Efficient Cellular Neural Network based on Spintronic Devices
Venue: arXiv cs.ET 2016
Year: 2016

Due to the massive parallel computing capability and outstanding image and signal processing performance, cellular neural network (CNN) is one promising type of non-Boolean computing system that can outperform the traditional digital logic computation and mitigate the physical scaling limit of the conventional CMOS technology. The CNN was originally implemented by VLSI analog technologies with operational amplifiers and operational transconductance amplifiers as neurons and synapses, respectively, which are power and area consuming. In this paper, we propose a hybrid structure to implement the CNN with magnetic components and CMOS peripherals with a complete driving and sensing circuitry. In addition, we propose a digitally programmable magnetic synapse that can achieve both positive and negative values of the templates. After rigorous performance analyses and comparisons, optimal energy is achieved based on various design parameters, including the driving voltage and the CMOS driving size. At a comparable footprint area and operation speed, a spintronic CNN is projected to achieve more than one order of magnitude energy reduction per operation compared to its CMOS counterpart.
DISTEA: Efficient Dynamic Impact Analysis for Distributed Systems
Venue: arXiv cs.SE 2016
Year: 2016

Dynamic impact analysis is a fundamental technique for understanding the impact of specific program entities, or changes to them, on the rest of the program for concrete executions. However, existing techniques are either inapplicable or of very limited utility for distributed programs running in multiple concurrent processes. This paper presents DISTEA, a technique and tool for dynamic impact analysis of distributed systems. By partially ordering distributed method-execution events and inferring causality from the ordered events, DISTEA can predict impacts propagated both within and across process boundaries. We implemented DISTEA for Java and applied it to four distributed programs of various types and sizes, including two enterprise systems. We also evaluated the precision and practical usefulness of DISTEA, and demonstrated its application in program comprehension, through two case studies. The results show that DISTEA is highly scalable, more effective than existing alternatives, and instrumental to understanding distributed systems and their executions.
Dynamic Endpoint Object Conveyance Using a Large-Scale Actuator Network
Venue: arXiv cs.RO 2016
Year: 2016

Large-Scale Actuator Networks (LSAN) are a rapidly growing class of electromechanical systems. A prime application of LSANs in the industrial sector is distributed manipulation. LSAN's are typically implemented using: vibrating plates, air jets, and mobile multi-robot teams. This paper investigates a surface capable of morphing its shape using an array of linear actuators to impose two dimensional translational movement on a set of objects. The collective nature of the actuator network overcomes the limitations of the single Degree of Freedom (DOF) manipulators, and forms a complex topography to convey multiple objects to a reference location. A derivation of the kinematic constraints and limitations of an arbitrary multi-cell surface is provided. These limitations determine the allowable actuator alignments when configuring the surface. A fusion of simulation and practical results demonstrate the advantages of using this technology over static feeders.
Capacitated Dominating Set on Planar Graphs
Venue: arXiv cs.DS 2016
Year: 2016

Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and an available capacity for covering demand in its closed neighborhood. The objective is to find a minimum-sized set of vertices that can cover all of the graph's demand without exceeding any of the capacities. In this paper we look specifically at domination with hard-capacities, where the capacity and cost of a vertex can contribute to the solution at most once. Previous complexity results suggest that this problem cannot be solved (or even closely approximated) efficiently in general. In this paper we present a polynomial-time approximation scheme for Capacitated Domination in unweighted planar graphs when the maximum capacity and maximum demand are bounded. We also show how this result can be extended to the closely-related Capacitated Vertex Cover problem.
Secure Mobile Identities
Venue: arXiv cs.CR 2016
Year: 2016

The unique identities of every mobile user (phone number,IMSI) and device (IMEI) are far from secure and are increasingly vulnerable to a variety of network-level threats. The exceedingly high reliance on the weak SIM authentication layer does not present any notion of end-to-end security for mobile users. We propose the design and implementation of Secure Mobile Identities (SMI), a repetitive key-exchange protocol that uses this weak SIM authentication as a foundation to enable mobile users to establish stronger identity authenticity. The security guarantees of SMI are directly reliant on the mobility of users and are further enhanced by external trusted entities providing trusted location signatures (e.g. trusted GPS, NFC synchronization points). In this paper, we demonstrate the efficacy of our protocol using an implementation and analysis across standard mobility models.
Evolutionary Projection Selection for Radon Barcodes
Venue: arXiv cs.CV 2016
Year: 2016

Recently, Radon transformation has been used to generate barcodes for tagging medical images. The under-sampled image is projected in certain directions, and each projection is binarized using a local threshold. The concatenation of the thresholded projections creates a barcode that can be used for tagging or annotating medical images. A small number of equidistant projections, e.g., 4 or 8, is generally used to generate short barcodes. However, due to the diverse nature of digital images, and since we are only working with a small number of projections (to keep the barcode short), taking equidistant projections may not be the best course of action. In this paper, we proposed to find $n$ optimal projections, whereas $n\!<\!180$, in order to increase the expressiveness of Radon barcodes. We show examples for the exhaustive search for the simple case when we attempt to find 4 best projections out of 16 equidistant projections and compare it with the evolutionary approach in order to establish the benefit of the latter when operating on a small population size as in the case of micro-DE. We randomly selected 10 different classes from IRMA dataset (14,400 x-ray images in 58 classes) and further randomly selected 5 images per class for our tests.
Anatomy-Aware Measurement of Segmentation Accuracy
Venue: arXiv cs.CV 2016
Year: 2016

Quantifying the accuracy of segmentation and manual delineation of organs, tissue types and tumors in medical images is a necessary measurement that suffers from multiple problems. One major shortcoming of all accuracy measures is that they neglect the anatomical significance or relevance of different zones within a given segment. Hence, existing accuracy metrics measure the overlap of a given segment with a ground-truth without any anatomical discrimination inside the segment. For instance, if we understand the rectal wall or urethral sphincter as anatomical zones, then current accuracy measures ignore their significance when they are applied to assess the quality of the prostate gland segments. In this paper, we propose an anatomy-aware measurement scheme for segmentation accuracy of medical images. The idea is to create a ``master gold'' based on a consensus shape containing not just the outline of the segment but also the outlines of the internal zones if existent or relevant. To apply this new approach to accuracy measurement, we introduce the anatomy-aware extensions of both Dice coefficient and Jaccard index and investigate their effect using 500 synthetic prostate ultrasound images with 20 different segments for each image. We show that through anatomy-sensitive calculation of segmentation accuracy, namely by considering relevant anatomical zones, not only the measurement of individual users can change but also the ranking of users' segmentation skills may require reordering.
Channel Impulse Responses in Diffusive Molecular Communication with Spherical Transmitters
Venue: arXiv cs.ET 2016
Year: 2016

Molecular communication is an emerging paradigm for systems that rely on the release of molecules as information carriers. Communication via molecular diffusion is a popular strategy that is ubiquitous in nature and very fast over distances on the order of a micron or less. Existing closed-form analysis of the diffusion channel impulse response generally assumes that the transmitter is a point source. In this paper, channel impulse responses are derived for spherical transmitters with either a passive or absorbing receiver. The derived channel impulse responses are in closed-form for a one-dimensional environment and can be found via numerical integration for a three-dimensional environment. The point transmitter assumption (PTA) is formally defined so that its accuracy can be measured in comparison to the derived spherical transmitter impulse responses. The spherical transmitter model is much more accurate than the PTA when the distance between a transmitter and its receiver is small relative to the size of the transmitter. The derived results are verified via microscopic particle-based simulations using the molecular communication simulation platform AcCoRD (Actor-based Communication via Reaction-Diffusion). A spherical transmitter variation where molecules are released from the surface of a solid sphere is also considered via simulation.
Distributed interference management using Q-Learning in Cognitive Femtocell networks: New USRP-based Implementation
Venue: arXiv cs.NI 2016
Year: 2016

Femtocell networks have become a promising solution in supporting high data rates for 5G systems, where cell densification is performed using the small femtocells. However, femtocell networks have many challenges. One of the major challenges of femtocell networks is the interference management problem, where deployment of femtocells in the range of macro-cells may degrade the performance of the macrocell. In this paper, we develop a new platform for studying interference management in distributed femtocell networks using reinforcement learning approach. We design a complete MAC protocol to perform distributed power allocation using Q-Learning algorithm, where both independent and cooperative learning approaches are applied across network nodes. The objective of the Q-Learning algorithms is to maximize aggregate femtocells capacity, while maintaining the QoS for the Macrocell users. Furthermore, we present the realization of the algorithms using GNURadio and USRP platforms. Performance evaluation are conducted in terms of macrocell capacity convergence to a target capacity and improvement of aggregate femtocells capacity.
Approximation Algorithms for Max-Morse Matching
Venue: arXiv cs.CG 2016
Year: 2016

In this paper, we prove that the Max-Morse Matching Problem is approximable, thus resolving an open problem posed by Joswig and Pfetsch. We describe two different approximation algorithms for the Max-Morse Matching Problem. For $D$-dimensional simplicial complexes, we obtain a $\frac{(D+1)}{(D^2+D+1)}$-factor approximation ratio using a simple edge reorientation algorithm that removes cycles. Our second result is an algorithm that provides a $\frac{2}{D}$-factor approximation for simplicial manifolds by processing the simplices in increasing order of dimension. One application of these algorithms is towards efficient homology computation of simplicial complexes. Experiments using a prototype implementation on several datasets indicate that the algorithm computes near optimal results.
SIMPL: A DSL for Automatic Specialization of Inference Algorithms
Venue: arXiv cs.PL 2016
Year: 2016

Inference algorithms in probabilistic programming languages (PPLs) can be thought of as interpreters, since an inference algorithm traverses a model given evidence to answer a query. As with interpreters, we can improve the efficiency of inference algorithms by compiling them once the model, evidence and query are known. We present SIMPL, a domain specific language for inference algorithms, which uses this idea in order to automatically specialize annotated inference algorithms. Due to the approach of specialization, unlike a traditional compiler, with SIMPL new inference algorithms can be added easily, and still be optimized using domain-specific information. We evaluate SIMPL and show that partial evaluation gives a 2-6x speedup, caching provides an additional 1-1.5x speedup, and generating C code yields an additional 13-20x speedup, for an overall speedup of 30-150x for several inference algorithms and models.
ACD: Action Concept Discovery from Image-Sentence Corpora
Venue: arXiv cs.CV 2016
Year: 2016

Action classification in still images is an important task in computer vision. It is challenging as the appearances of ac- tions may vary depending on their context (e.g. associated objects). Manually labeling of context information would be time consuming and difficult to scale up. To address this challenge, we propose a method to automatically discover and cluster action concepts, and learn their classifiers from weakly supervised image-sentence corpora. It obtains candidate action concepts by extracting verb-object pairs from sentences and verifies their visualness with the associated images. Candidate action concepts are then clustered by using a multi-modal representation with image embeddings from deep convolutional networks and text embeddings from word2vec. More than one hundred human action concept classifiers are learned from the Flickr 30k dataset with no additional human effort and promising classification results are obtained. We further apply the AdaBoost algorithm to automatically select and combine relevant action concepts given an action query. Promising results have been shown on the PASCAL VOC 2012 action classification benchmark, which has zero overlap with Flickr30k.
Using Text Similarity to Detect Social Interactions not Captured by Formal Reply Mechanisms
Venue: arXiv cs.SI 2016
Year: 2016

In modeling social interaction online, it is important to understand when people are reacting to each other. Many systems have explicit indicators of replies, such as threading in discussion forums or replies and retweets in Twitter. However, it is likely these explicit indicators capture only part of people's reactions to each other, thus, computational social science approaches that use them to infer relationships or influence are likely to miss the mark. This paper explores the problem of detecting non-explicit responses, presenting a new approach that uses tf-idf similarity between a user's own tweets and recent tweets by people they follow. Based on a month's worth of posting data from 449 ego networks in Twitter, this method demonstrates that it is likely that at least 11% of reactions are not captured by the explicit reply and retweet mechanisms. Further, these uncaptured reactions are not evenly distributed between users: some users, who create replies and retweets without using the official interface mechanisms, are much more responsive to followees than they appear. This suggests that detecting non-explicit responses is an important consideration in mitigating biases and building more accurate models when using these markers to study social interaction and information diffusion.