OpenRaiser/Intern-Atlas huggingface dataset:
Networked Control Systems over Correlated Wireless Fading Channels
Venue: arXiv cs.IT 2016
Year: 2016

In this paper, we consider a networked control system (NCS) in which an dynamic plant system is connected to a controller via a temporally correlated wireless fading channel. We focus on communication power design at the sensor to minimize a weighted average state estimation error at the remote controller subject to an average transmit power constraint of the sensor. The power control optimization problem is formulated as an infinite horizon average cost Markov decision process (MDP). We propose a novel continuous-time perturbation approach and derive an asymptotically optimal closed-form value function for the MDP. Under this approximation, we propose a low complexity dynamic power control solution which has an event- driven control structure. We also establish technical conditions for asymptotic optimality, and sufficient conditions for NCS stability under the proposed scheme.
Carrier-Grade Anomaly Detection Using Time-to-Live Header Information
Venue: arXiv cs.NI 2016
Year: 2016

Time-to-Live data in the IP header offers two interesting characteristics: First, different IP stacks pick different start TTL values. Second, each traversed router should decrement the TTL value. The combination of both offers host and route fingerprinting options. We present the first work to investigate Internet-wide TTL behavior at carrier scale and evaluate its fit to detect anomalies, predominantly spoofed source IP addresses. Using purpose-built software, we capture 2 weeks of raw TTL data at a 40 Gbit/s Internet uplink. For further insight, we actively measure observed hosts and conduct large-scale hitlist-based measurements, which yields three complementary data sets for IPv4 and IPv6. A majority (69% IPv4; 81% IPv6) of passively observed multi-packet hosts exhibit one stable TTL value. Active measurements on unstable hosts yield a stable anchor TTL value for more than 85% of responsive hosts. We develop a structure to further classify unstable hosts taking, for example, temporal stability into account. Correlation of TTL values with BGP data is clear, yet unpredictive. The results indicate that carrier-grade TTL anomaly detection can yield significant insights in the following categories: First, the method can flag anomalies based on TTL observations (yet likely at a difficult false positive/false negative trade-off). Second, the method can establish trust that a packet originates from its acclaimed source.
Caching Strategies for Information Centric Networking: Opportunities and Challenges
Venue: arXiv cs.NI 2016
Year: 2016

Internet usage has shifted from host-centric end-to-end communication to a content-centric approach mainly used for content delivery. Information Centric Networking (ICN) was proposed as a promising novel content delivery architecture. ICN includes in-network caching features at every node which has a major impact on content retrieval. For instance, the ICN efficiency depends drastically on the management of the caching resources. The management of caching resources is achieved with caching strategies. Caching strategies decide what, where and when content is stored in the network. In this paper, we revisit the recent technical contributions on caching strategies, we compare them and discuss opportunities and challenges for improving content delivery in the upcoming years.
Fully DNN-based Multi-label regression for audio tagging
Venue: arXiv cs.CV 2016
Year: 2016

Acoustic event detection for content analysis in most cases relies on lots of labeled data. However, manually annotating data is a time-consuming task, which thus makes few annotated resources available so far. Unlike audio event detection, automatic audio tagging, a multi-label acoustic event classification task, only relies on weakly labeled data. This is highly desirable to some practical applications using audio analysis. In this paper we propose to use a fully deep neural network (DNN) framework to handle the multi-label classification task in a regression way. Considering that only chunk-level rather than frame-level labels are available, the whole or almost whole frames of the chunk were fed into the DNN to perform a multi-label regression for the expected tags. The fully DNN, which is regarded as an encoding function, can well map the audio features sequence to a multi-tag vector. A deep pyramid structure was also designed to extract more robust high-level features related to the target tags. Further improved methods were adopted, such as the Dropout and background noise aware training, to enhance its generalization capability for new audio recordings in mismatched environments. Compared with the conventional Gaussian Mixture Model (GMM) and support vector machine (SVM) methods, the proposed fully DNN-based method could well utilize the long-term temporal information with the whole chunk as the input. The results show that our approach obtained a 15% relative improvement compared with the official GMM-based method of DCASE 2016 challenge.
Spintronic nano-devices for bio-inspired computing
Venue: arXiv cs.ET 2016
Year: 2016

Bio-inspired hardware holds the promise of low-energy, intelligent and highly adaptable computing systems. Applications span from automatic classification for big data management, through unmanned vehicle control, to control for bio-medical prosthesis. However, one of the major challenges of fabricating bio-inspired hardware is building ultra-high density networks out of complex processing units interlinked by tunable connections. Nanometer-scale devices exploiting spin electronics (or spintronics) can be a key technology in this context. In particular, magnetic tunnel junctions are well suited for this purpose because of their multiple tunable functionalities. One such functionality, non-volatile memory, can provide massive embedded memory in unconventional circuits, thus escaping the von-Neumann bottleneck arising when memory and processors are located separately. Other features of spintronic devices that could be beneficial for bio-inspired computing include tunable fast non-linear dynamics, controlled stochasticity, and the ability of single devices to change functions in different operating conditions. Large networks of interacting spintronic nano-devices can have their interactions tuned to induce complex dynamics such as synchronization, chaos, soliton diffusion, phase transitions, criticality, and convergence to multiple metastable states. A number of groups have recently proposed bio-inspired architectures that include one or several types of spintronic nanodevices. In this article we show how spintronics can be used for bio-inspired computing. We review the different approaches that have been proposed, the recent advances in this direction, and the challenges towards fully integrated spintronics-CMOS (Complementary metal - oxide - semiconductor) bio-inspired hardware.
A Game-Theoretic Approach to Word Sense Disambiguation
Venue: arXiv cs.AI 2016
Year: 2016

This paper presents a new model for word sense disambiguation formulated in terms of evolutionary game theory, where each word to be disambiguated is represented as a node on a graph whose edges represent word relations and senses are represented as classes. The words simultaneously update their class membership preferences according to the senses that neighboring words are likely to choose. We use distributional information to weigh the influence that each word has on the decisions of the others and semantic similarity information to measure the strength of compatibility among the choices. With this information we can formulate the word sense disambiguation problem as a constraint satisfaction problem and solve it using tools derived from game theory, maintaining the textual coherence. The model is based on two ideas: similar words should be assigned to similar classes and the meaning of a word does not depend on all the words in a text but just on some of them. The paper provides an in-depth motivation of the idea of modeling the word sense disambiguation problem in terms of game theory, which is illustrated by an example. The conclusion presents an extensive analysis on the combination of similarity measures to use in the framework and a comparison with state-of-the-art systems. The results show that our model outperforms state-of-the-art algorithms and can be applied to different tasks and in different scenarios.
A Taxonomy and Library for Visualizing Learned Features in Convolutional Neural Networks
Venue: arXiv cs.CV 2016
Year: 2016

Over the last decade, Convolutional Neural Networks (CNN) saw a tremendous surge in performance. However, understanding what a network has learned still proves to be a challenging task. To remedy this unsatisfactory situation, a number of groups have recently proposed different methods to visualize the learned models. In this work we suggest a general taxonomy to classify and compare these methods, subdividing the literature into three main categories and providing researchers with a terminology to base their works on. Furthermore, we introduce the FeatureVis library for MatConvNet: an extendable, easy to use open source library for visualizing CNNs. It contains implementations from each of the three main classes of visualization methods and serves as a useful tool for an enhanced understanding of the features learned by intermediate layers, as well as for the analysis of why a network might fail for certain examples.
Incentive Schemes for Mobile Peer-to-Peer Systems and Free Riding Problem: A Survey
Venue: arXiv cs.DC 2016
Year: 2016

Mobile peer-to-peer networks are quite prevalent and popular now days due to advent of business scenarios where all the services are going mobile like whether it's to find good restaurants, healthy diet books making friends, job-hunting, real state info or cab-sharing etc. As the mobile users are increasing day by day, peer-to-peer networks getting bigger and complex. In contrast to client server system in peer-to-peer network resource sharing is done on the basis of mutual consent and agreed policies with no central authority and controlling entity. Incentive schemes for P2P networks are devised to encourage the participation and to adhere the policies agreed. P2P services based only on altruistic behaviour of users are facing serious challenges like Free riding or The tragedy of commons. Free riders are the users who consume the bandwidth of the system (perform downloading) but don't show altruistic behaviour (deny uploading) and act as a parasite for the P2P network. To counter the free riding issue many Incentive schemes are suggested by the researchers. In this paper we will survey the different incentive schemes, their architectures keeping eye on how they handle the challenges of modern P2P network.
On the importance of graph search algorithms for DRGEP-based mechanism reduction methods
Venue: arXiv cs.DS 2016
Year: 2016

The importance of graph search algorithm choice to the directed relation graph with error propagation (DRGEP) method is studied by comparing basic and modified depth-first search, basic and R-value-based breadth-first search (RBFS), and Dijkstra's algorithm. By using each algorithm with DRGEP to produce skeletal mechanisms from a detailed mechanism for n-heptane with randomly-shuffled species order, it is demonstrated that only Dijkstra's algorithm and RBFS produce results independent of species order. In addition, each algorithm is used with DRGEP to generate skeletal mechanisms for n-heptane covering a comprehensive range of autoignition conditions for pressure, temperature, and equivalence ratio. Dijkstra's algorithm combined with a coefficient scaling approach is demonstrated to produce the most compact skeletal mechanism with a similar performance compared to larger skeletal mechanisms resulting from the other algorithms. The computational efficiency of each algorithm is also compared by applying the DRGEP method with each search algorithm on the large detailed mechanism for n-alkanes covering n-octane to n-hexadecane with 2115 species and 8157 reactions. Dijkstra's algorithm implemented with a binary heap priority queue is demonstrated as the most efficient method, with a CPU cost two orders of magnitude less than the other search algorithms.
Static Output Feedback Control for Nonlinear Systems subject to Parametric and Nonlinear Uncertainties
Venue: arXiv cs.SY 2016
Year: 2016

This work addresses the design of static output feedback control of discrete-time nonlinear systems satisfying a local Lipschitz continuity condition with time-varying uncertainties. The controller has also a guaranteed disturbance attenuation level (Hinfty performance). Thanks to the linearity of the proposed LMIs in both the admissible Lipschitz constant of the system and the disturbance attenuation level, they can be simultaneously optimized through convex multiobjective optimization. The optimization over Lipschitz constant adds an extra important and new feature to the controller, robustness against nonlinear uncertainty. The resulting controller is robust against both nonlinear additive uncertainty and time-varying parametric uncertainties. Explicit norm-wise and element-wise bounds on the tolerable nonlinear uncertainty are derived.
Non-Monotonic Spatial Reasoning with Answer Set Programming Modulo Theories
Venue: arXiv cs.AI 2016
Year: 2016

The systematic modelling of dynamic spatial systems is a key requirement in a wide range of application areas such as commonsense cognitive robotics, computer-aided architecture design, and dynamic geographic information systems. We present ASPMT(QS), a novel approach and fully-implemented prototype for non-monotonic spatial reasoning -a crucial requirement within dynamic spatial systems- based on Answer Set Programming Modulo Theories (ASPMT). ASPMT(QS) consists of a (qualitative) spatial representation module (QS) and a method for turning tight ASPMT instances into Satisfiability Modulo Theories (SMT) instances in order to compute stable models by means of SMT solvers. We formalise and implement concepts of default spatial reasoning and spatial frame axioms. Spatial reasoning is performed by encoding spatial relations as systems of polynomial constraints, and solving via SMT with the theory of real nonlinear arithmetic. We empirically evaluate ASPMT(QS) in comparison with other contemporary spatial reasoning systems both within and outside the context of logic programming. ASPMT(QS) is currently the only existing system that is capable of reasoning about indirect spatial effects (i.e., addressing the ramification problem), and integrating geometric and qualitative spatial information within a non-monotonic spatial reasoning context. This paper is under consideration for publication in TPLP.
Representing Documents and Queries as Sets of Word Embedded Vectors for Information Retrieval
Venue: arXiv cs.IR 2016
Year: 2016

A major difficulty in applying word vector embeddings in IR is in devising an effective and efficient strategy for obtaining representations of compound units of text, such as whole documents, (in comparison to the atomic words), for the purpose of indexing and scoring documents. Instead of striving for a suitable method for obtaining a single vector representation of a large document of text, we rather aim for developing a similarity metric that makes use of the similarities between the individual embedded word vectors in a document and a query. More specifically, we represent a document and a query as sets of word vectors, and use a standard notion of similarity measure between these sets, computed as a function of the similarities between each constituent word pair from these sets. We then make use of this similarity measure in combination with standard IR based similarities for document ranking. The results of our initial experimental investigations shows that our proposed method improves MAP by up to $5.77\%$, in comparison to standard text-based language model similarity, on the TREC ad-hoc dataset.
A Satisfactory Power Control for 5G Self-Organizing Networks
Venue: arXiv cs.IT 2016
Year: 2016

SmallCells are deployed in order to enhance the network performance by bringing the network closer to the user. However, as the number of low power nodes grows increasingly, the overall energy consumption of the SmallCells base stations cannot be ignored. A relevant amount of energy could be saved through several techniques, especially power control mechanisms. In this paper, we are concerned with energy aware self organizing networks that guarantee a satisfactory performance. We consider satisfaction equilibria, mainly the efficient satisfaction equilibrium (ESE), to ensure a target quality of service (QoS) and save energy. First, we identify conditions of existence and uniqueness of ESE under a stationary channel assumption. We fully characterize the ESE and prove that, whenever it exists, it is a solution of a linear system. Moreover, we define satisfactory Pareto optimality and show that, at the ESE, no player can increase its QoS without degrading the overall performance. Under a fast fading channel assumption, as the robust satisfaction equilibrium solution is very restrictive, we propose an alternative solution namely the long term satisfaction equilibrium, and describe how to reach this solution efficiently. Finally, in order to find satisfactory solution per all users, we propose fully distributed strategic learning schemes based on Banach-Picard, Mann and Bush Mosteller algorithms, and show through simulations their qualitative properties. fully distributed strategic learning schemes based on Banach Picard, Mann and Bush Mosteller algorithms, and show through simulations their qualitative properties.
Analytics-as-a-Service in a Multi-Cloud Environment through Semantically enabled Hierarchical Data Processing
Venue: arXiv cs.NI 2016
Year: 2016

A large number of cloud middleware platforms and tools are deployed to support a variety of Internet of Things (IoT) data analytics tasks. It is a common practice that such cloud platforms are only used by its owners to achieve their primary and predefined objectives, where raw and processed data are only consumed by them. However, allowing third parties to access processed data to achieve their own objectives significantly increases integration, cooperation, and can also lead to innovative use of the data. Multicloud, privacy-aware environments facilitate such data access, allowing different parties to share processed data to reduce computation resource consumption collectively. However, there are interoperability issues in such environments that involve heterogeneous data and analytics-as-a-service providers. There is a lack of both - architectural blueprints that can support such diverse, multi-cloud environments, and corresponding empirical studies that show feasibility of such architectures. In this paper, we have outlined an innovative hierarchical data processing architecture that utilises semantics at all the levels of IoT stack in multicloud environments. We demonstrate the feasibility of such architecture by building a system based on this architecture using OpenIoT as a middleware, and Google Cloud and Microsoft Azure as cloud environments. The evaluation shows that the system is scalable and has no significant limitations or overheads.
X575: writing rengas with web services
Venue: arXiv cs.AI 2016
Year: 2016

Our software system simulates the classical collaborative Japanese poetry form, renga, made of linked haikus. We used NLP methods wrapped up as web services. Our experiments were only a partial success, since results fail to satisfy classical constraints. To gather ideas for future work, we examine related research in semiotics, linguistics, and computing.
A Tucker decomposition process for probabilistic modeling of diffusion magnetic resonance imaging
Venue: arXiv cs.CV 2016
Year: 2016

Diffusion magnetic resonance imaging (dMRI) is an emerging medical technique used for describing water diffusion in an organic tissue. Typically, rank-2 tensors quantify this diffusion. From this quantification, it is possible to calculate relevant scalar measures (i.e. fractional anisotropy and mean diffusivity) employed in clinical diagnosis of neurological diseases. Nonetheless, 2nd-order tensors fail to represent complex tissue structures like crossing fibers. To overcome this limitation, several researchers proposed a diffusion representation with higher order tensors (HOT), specifically 4th and 6th orders. However, the current acquisition protocols of dMRI data allow images with a spatial resolution between 1 $mm^3$ and 2 $mm^3$. This voxel size is much smaller than tissue structures. Therefore, several clinical procedures derived from dMRI may be inaccurate. Interpolation has been used to enhance resolution of dMRI in a tensorial space. Most interpolation methods are valid only for rank-2 tensors and a generalization for HOT data is missing. In this work, we propose a novel stochastic process called Tucker decomposition process (TDP) for performing HOT data interpolation. Our model is based on the Tucker decomposition and Gaussian processes as parameters of the TDP. We test the TDP in 2nd, 4th and 6th rank HOT fields. For rank-2 tensors, we compare against direct interpolation, log-Euclidean approach and Generalized Wishart processes. For rank-4 and rank-6 tensors we compare against direct interpolation. Results obtained show that TDP interpolates accurately the HOT fields and generalizes to any rank.
Scaling of foreign attractiveness for countries and states
Venue: arXiv cs.SI 2016
Year: 2016

People's behavior on online social networks, which store geo-tagged information showing where people were or are at the moment, can provide information about their offline life as well. In this paper we present one possible research direction that can be taken using Flickr dataset of publicly available geo-tagged media objects (e.g., photographs, videos). Namely, our focus is on investigating attractiveness of countries or smaller large-scale composite regions (e.g., US states) for foreign visitors where attractiveness is defined as the absolute number of media objects taken in a certain state or country by its foreign visitors compared to its population size. We also consider it together with attractiveness of the destination for the international migration, measured through publicly available dataset provided by United Nations. By having those two datasets, we are able to look at attractiveness from two different perspectives: short-term and long-term one. As our previous study showed that city attractiveness for Spanish cities follows a superlinear trend, here we want to see if the same law is also applicable to country/state (i.e., composite regions) attractiveness. Finally, we provide one possible explanation for the obtained results.
Magnetic Eigenmaps for the Visualization of Directed Networks
Venue: arXiv cs.SI 2016
Year: 2016

We propose a framework for the visualization of directed networks relying on the eigenfunctions of the magnetic Laplacian, called here Magnetic Eigenmaps. The magnetic Laplacian is a complex deformation of the well-known combinatorial Laplacian. Features such as density of links and directionality patterns are revealed by plotting the phases of the first magnetic eigenvectors. An interpretation of the magnetic eigenvectors is given in connection with the angular synchronization problem. Illustrations of our method are given for both artificial and real networks.