OpenRaiser/Intern-Atlas huggingface dataset:
Queue-Aware Joint Dynamic Interference Coordination and Heterogeneous QoS Provisioning in OFDMA Networks
Venue: arXiv cs.NI 2018
Year: 2018

We propose algorithms for cloud radio access networks that not only provide heterogeneous quality of-service (QoS) for rate- and, importantly, delay-sensitive applications, but also jointly optimize the frequency reuse pattern. Importantly, unlike related works, we account for random arrivals, through queue awareness and, unlike majority of works focusing on a single frame only, we consider QoS measures averaged over multiple frames involving a set of closed loop controls. We model this problem as multi-cell optimization to maximize a sum utility subject to the QoS constraints, expressed as minimum mean-rate or maximum mean-delay. Since we consider dynamic interference coordination jointly with dynamic user association, the problem is not convex, even after integer relaxation. We translate the problem into an optimization of frame rates, amenable to a decomposition into intertwined primal and dual problems. The solution to this optimization problem provides joint decisions on scheduling, dynamic interference coordination, and, importantly, unlike most works in this area, on dynamic user association. Additionally, we propose a novel method to manage infeasible loads. Extensive simulations confirm that the design responds to instantaneous loads, heterogeneous user and AP locations, channel conditions, and QoS constraints while, if required, keeping outage low when dealing with infeasible loads. Comparisons to the baseline proportional fair scheme illustrate the gains achieved.
Fast binary embeddings, and quantized compressed sensing with structured matrices
Venue: arXiv cs.IT 2018
Year: 2018

This paper deals with two related problems, namely distance-preserving binary embeddings and quantization for compressed sensing . First, we propose fast methods to replace points from a subset $\mathcal{X} \subset \mathbb{R}^n$, associated with the Euclidean metric, with points in the cube $\{\pm 1\}^m$ and we associate the cube with a pseudo-metric that approximates Euclidean distance among points in $\mathcal{X}$. Our methods rely on quantizing fast Johnson-Lindenstrauss embeddings based on bounded orthonormal systems and partial circulant ensembles, both of which admit fast transforms. Our quantization methods utilize noise-shaping, and include Sigma-Delta schemes and distributed noise-shaping schemes. The resulting approximation errors decay polynomially and exponentially fast in $m$, depending on the embedding method. This dramatically outperforms the current decay rates associated with binary embeddings and Hamming distances. Additionally, it is the first such binary embedding result that applies to fast Johnson-Lindenstrauss maps while preserving $\ell_2$ norms. Second, we again consider noise-shaping schemes, albeit this time to quantize compressed sensing measurements arising from bounded orthonormal ensembles and partial circulant matrices. We show that these methods yield a reconstruction error that again decays with the number of measurements (and bits), when using convex optimization for reconstruction. Specifically, for Sigma-Delta schemes, the error decays polynomially in the number of measurements, and it decays exponentially for distributed noise-shaping schemes based on beta encoding. These results are near optimal and the first of their kind dealing with bounded orthonormal systems.
Weakly Supervised Object Detection with Pointwise Mutual Information
Venue: arXiv cs.CV 2018
Year: 2018

In this work a novel approach for weakly supervised object detection that incorporates pointwise mutual information is presented. A fully convolutional neural network architecture is applied in which the network learns one filter per object class. The resulting feature map indicates the location of objects in an image, yielding an intuitive representation of a class activation map. While traditionally such networks are learned by a softmax or binary logistic regression (sigmoid cross-entropy loss), a learning approach based on a cosine loss is introduced. A pointwise mutual information layer is incorporated in the network in order to project predictions and ground truth presence labels in a non-categorical embedding space. Thus, the cosine loss can be employed in this non-categorical representation. Besides integrating image level annotations, it is shown how to integrate point-wise annotations using a Spatial Pyramid Pooling layer. The approach is evaluated on the VOC2012 dataset for classification, point localization and weakly supervised bounding box localization. It is shown that the combination of pointwise mutual information and a cosine loss eases the learning process and thus improves the accuracy. The integration of coarse point-wise localizations further improves the results at minimal annotation costs.
Exploiting Multiple Access in Clustered Millimeter Wave Networks: NOMA or OMA?
Venue: arXiv cs.IT 2018
Year: 2018

In this paper, we introduce a clustered millimeter wave network with non-orthogonal multiple access (NOMA), where the base station (BS) is located at the center of each cluster and all users follow a Poisson Cluster Process. To provide a realistic directional beamforming, an actual antenna pattern is deployed at all BSs. We provide a nearest-random scheme, in which near user is the closest node to the corresponding BS and far user is selected at random, to appraise the coverage performance and universal throughput of our system. Novel closed-form expressions are derived under a loose network assumption. Moreover, we present several Monte Carlo simulations and numerical results, which show that: 1) NOMA outperforms orthogonal multiple access regarding the system rate; 2) the coverage probability is proportional to the number of possible NOMA users and a negative relationship with the variance of intra-cluster receivers; and 3) an optimal number of the antenna elements is existed for maximizing the system throughput.
Modeling and Analysis of MmWave Communications in Cache-enabled HetNets
Venue: arXiv cs.IT 2018
Year: 2018

In this paper, we consider a novel cache-enabled heterogeneous network (HetNet), where macro base stations (BSs) with traditional sub-6 GHz are overlaid by dense millimeter wave (mmWave) pico BSs. These two-tier BSs, which are modeled as two independent homogeneous Poisson Point Processes, cache multimedia contents following the popularity rank. High-capacity backhauls are utilized between macro BSs and the core server. A maximum received power strategy is introduced for deducing novel algorithms of the success probability and area spectral efficiency (ASE). Moreover, Monte Carlo simulations are presented to verify the analytical conclusions and numerical results demonstrate that: 1) the proposed HetNet is an interference-limited system and it outperforms the traditional HetNets; 2) there exists an optimal pre-decided rate threshold that contributes to the maximum ASE; and 3) 73 GHz is the best mmWave carrier frequency regarding ASE due to the large antenna scale.
Symbol Emergence in Cognitive Developmental Systems: a Survey
Venue: arXiv cs.AI 2018
Year: 2018

Humans use signs, e.g., sentences in a spoken language, for communication and thought. Hence, symbol systems like language are crucial for our communication with other agents and adaptation to our real-world environment. The symbol systems we use in our human society adaptively and dynamically change over time. In the context of artificial intelligence (AI) and cognitive systems, the symbol grounding problem has been regarded as one of the central problems related to {\it symbols}. However, the symbol grounding problem was originally posed to connect symbolic AI and sensorimotor information and did not consider many interdisciplinary phenomena in human communication and dynamic symbol systems in our society, which semiotics considered. In this paper, we focus on the symbol emergence problem, addressing not only cognitive dynamics but also the dynamics of symbol systems in society, rather than the symbol grounding problem. We first introduce the notion of a symbol in semiotics from the humanities, to leave the very narrow idea of symbols in symbolic AI. Furthermore, over the years, it became more and more clear that symbol emergence has to be regarded as a multifaceted problem. Therefore, secondly, we review the history of the symbol emergence problem in different fields, including both biological and artificial systems, showing their mutual relations. We summarize the discussion and provide an integrative viewpoint and comprehensive overview of symbol emergence in cognitive systems. Additionally, we describe the challenges facing the creation of cognitive systems that can be part of symbol emergence systems.
FlashRL: A Reinforcement Learning Platform for Flash Games
Venue: arXiv cs.AI 2018
Year: 2018

Reinforcement Learning (RL) is a research area that has blossomed tremendously in recent years and has shown remarkable potential in among others successfully playing computer games. However, there only exists a few game platforms that provide diversity in tasks and state-space needed to advance RL algorithms. The existing platforms offer RL access to Atari- and a few web-based games, but no platform fully expose access to Flash games. This is unfortunate because applying RL to Flash games have potential to push the research of RL algorithms. This paper introduces the Flash Reinforcement Learning platform (FlashRL) which attempts to fill this gap by providing an environment for thousands of Flash games on a novel platform for Flash automation. It opens up easy experimentation with RL algorithms for Flash games, which has previously been challenging. The platform shows excellent performance with as little as 5% CPU utilization on consumer hardware. It shows promising results for novel reinforcement learning algorithms.
On the algorithmic complexity of decomposing graphs into regular/irregular structures
Venue: arXiv cs.DM 2018
Year: 2018

A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree and a locally regular graph is a graph where for every two adjacent vertices u, v, their degrees are equal. In this work, we study the set of all problems which are related to decomposition of graphs into regular, locally regular and/or locally irregular subgraphs and we present some polynomial time algorithms, NP-completeness results, lower bounds and upper bounds for them. Among our results, one of our lower bounds makes use of mutually orthogonal Latin squares which is relatively novel.
Secure Distributed State Estimation of an LTI System over Time-Varying Networks and Analog Erasure Channels
Venue: arXiv cs.SY 2018
Year: 2018

We study the problem of collaboratively estimating the state of an LTI system monitored by a network of sensors, subject to the following important practical considerations: (i) certain sensors might be arbitrarily compromised by an adversary and (ii) the underlying communication graph governing the flow of information across sensors might be time-varying. We first analyze a scenario involving intermittent communication losses that preserve certain information flow patterns over bounded intervals of time. By equipping the sensors with adequate memory, we show that one can obtain a fully distributed, provably correct state estimation algorithm that accounts for arbitrary adversarial behavior, provided certain conditions are met by the network topology. We then argue that our approach can handle bounded communication delays as well. Next, we explore a case where each communication link stochastically drops packets based on an analog erasure channel model. For this setup, we propose state estimate update and information exchange rules, along with conditions on the network topology and packet drop probabilities, that guarantee mean-square stability despite arbitrary adversarial attacks.
Some Issues on the Theory of the Mimic-Computing-Oriented Automata
Venue: arXiv cs.FL 2018
Year: 2018

A mimic computing oriented automaton can directly portray the behaviors of a mimic computing system. In this paper, we investigate the following theoretical problems on this type of automata: operational semantics and computational ability. First, we model a systematic structure of mimic computing via a mimic automaton. Second, we propose the operational semantics of the automaton in this scene. Third, the computational ability of this type of automata is studied.
A Multi-Biometrics for Twins Identification Based Speech and Ear
Venue: arXiv cs.CV 2018
Year: 2018

The development of technology biometrics becomes crucial more. To define human characteristic biometric systems are used but because of inability of traditional biometric systems to recognize twins, multimodal biometric systems are developed. In this study a multimodal biometric recognition system is proposed to recognize twins from each other and from the other people by using image and speech data. The speech or image data can be enough to recognize people from each other but twins cannot be distinguished with one of these data. Therefore a robust recognition system with the combine of speech and ear images is needed. As database, the photos and speech data of 39 twins are used. For speech recognition MFCC and DTW algorithms are used. Also, Gabor filter and DCVA algorithms are used for ear identification. Multi-biometrics success rate is increased by making matching score level fusion. Especially, rank-5 is reached 100%. We think that speech and ear can be complementary. Therefore, it is result that multi-biometrics based speech and ear is effective for human identifications.
IRSA Transmission Optimization via Online Learning
Venue: arXiv cs.IT 2018
Year: 2018

In this work, we propose a new learning framework for optimising transmission strategies when irregular repetition slotted ALOHA (IRSA) MAC protocol is considered. We cast the online optimisation of the MAC protocol design as a multi-arm bandit problem that exploits the IRSA structure in the learning framework. Our learning algorithm quickly learns the optimal transmission strategy, leading to higher rate of successfully received packets with respect to baseline transmission optimizations.
Interactive Generative Adversarial Networks for Facial Expression Generation in Dyadic Interactions
Venue: arXiv cs.CV 2018
Year: 2018

A social interaction is a social exchange between two or more individuals,where individuals modify and adjust their behaviors in response to their interaction partners. Our social interactions are one of most fundamental aspects of our lives and can profoundly affect our mood, both positively and negatively. With growing interest in virtual reality and avatar-mediated interactions,it is desirable to make these interactions natural and human like to promote positive effect in the interactions and applications such as intelligent tutoring systems, automated interview systems and e-learning. In this paper, we propose a method to generate facial behaviors for an agent. These behaviors include facial expressions and head pose and they are generated considering the users affective state. Our models learn semantically meaningful representations of the face and generate appropriate and temporally smooth facial behaviors in dyadic interactions.
The Age of Social Sensing
Venue: arXiv cs.SI 2018
Year: 2018

Online social media, such as Twitter and Instagram, democratized information broadcast, allowing anyone to share information about themselves and their surroundings at an unprecedented scale. The large volume of information thus posted on these media offer a new lens into the physical world through the eyes of the social network. The exploitation of this lens to inspect aspects of world state has recently been termed social sensing. The power of manipulating reality via the use (or intentional misuse) of social media opened concerns with issues ranging from radicalization by terror propaganda to potential manipulation of elections in mature democracies. Many important challenges and open research questions arise in this emerging field that aims to better understand how information can be extracted from the medium and what properties characterize the extracted information and the world it represents. Addressing the above challenges requires multi-disciplinary research at the intersection of computer science and social sciences that combines cyber-physical computing, sociology, sensor networks, social networks, cognition, data mining, estimation theory, data fusion, information theory, linguistics, machine learning, behavioral economics, and possibly others. This paper surveys important directions in social sensing, identifies current research challenges, and outlines avenues for future research.
Predictive Effects of Novelty Measured by Temporal Embeddings on the Growth of Scientific Literature
Venue: arXiv cs.DL 2018
Year: 2018

Novel scientific knowledge is constantly produced by the scientific community. Understanding the level of novelty characterized by scientific literature is key for modeling scientific dynamics and analyzing the growth mechanisms of scientific knowledge. Metrics derived from bibliometrics and citation analysis were effectively used to characterize the novelty in scientific development. However, time is required before we can observe links between documents such as citation links or patterns derived from the links, which makes these techniques more effective for retrospective analysis than predictive analysis. In this study, we present a new approach to measuring the novelty of a research topic in a scientific community over a specific period by tracking semantic changes of the terms and characterizing the research topic in their usage context. The semantic changes are derived from the text data of scientific literature by temporal embedding learning techniques. We validated the effects of the proposed novelty metric on predicting the future growth of scientific publications and investigated the relations between novelty and growth by panel data analysis applied in a large-scale publication dataset (MEDLINE/PubMed). Key findings based on the statistical investigation indicate that the novelty metric has significant predictive effects on the growth of scientific literature and the predictive effects may last for more than ten years. We demonstrated the effectiveness and practical implications of the novelty metric in three case studies.
Scalable Mutual Information Estimation using Dependence Graphs
Venue: arXiv cs.IT 2018
Year: 2018

The Mutual Information (MI) is an often used measure of dependency between two random variables utilized in information theory, statistics and machine learning. Recently several MI estimators have been proposed that can achieve parametric MSE convergence rate. However, most of the previously proposed estimators have the high computational complexity of at least $O(N^2)$. We propose a unified method for empirical non-parametric estimation of general MI function between random vectors in $\mathbb{R}^d$ based on $N$ i.i.d. samples. The reduced complexity MI estimator, called the ensemble dependency graph estimator (EDGE), combines randomized locality sensitive hashing (LSH), dependency graphs, and ensemble bias-reduction methods. We prove that EDGE achieves optimal computational complexity $O(N)$, and can achieve the optimal parametric MSE rate of $O(1/N)$ if the density is $d$ times differentiable. To the best of our knowledge EDGE is the first non-parametric MI estimator that can achieve parametric MSE rates with linear time complexity. We illustrate the utility of EDGE for the analysis of the information plane (IP) in deep learning. Using EDGE we shed light on a controversy on whether or not the compression property of information bottleneck (IB) in fact holds for ReLu and other rectification functions in deep neural networks (DNN).
Probability Mass Exclusions and the Directed Components of Pointwise Mutual Information
Venue: arXiv cs.IT 2018
Year: 2018

This paper examines how an event from one random variable provides pointwise mutual information about an event from another variable via probability mass exclusions. We start by introducing probability mass diagrams, which provide a visual representation of how a prior distribution is transformed to a posterior distribution through exclusions. With the aid of these diagrams, we identify two distinct types of probability mass exclusions---namely informative and misinformative exclusions. Then, motivated by Fano's derivation of the pointwise mutual information, we propose four postulates which aim to decompose the pointwise mutual information into two separate informational components: a non-negative term associated with the informative exclusion and a non-positive term associated with the misinformative exclusions. This yields a novel derivation of a familiar decomposition of the pointwise mutual information into entropic components. We conclude by discussing the relevance of considering information in terms of probability mass exclusions to the ongoing effort to decompose multivariate information.
End to End Performance Analysis of Relay Cooperative Communication Based on Parked Cars
Venue: arXiv cs.IT 2018
Year: 2018

Parking lots (PLs) are usually full with cars. If these cars are formed into a self-organizing vehicular network, they can be new kind of road side units (RSUs) in urban area to provide communication data forwarding between mobile terminals nearby and a base station. However cars in PLs can leave at any time, which is neglected in the existing studies. In this paper, we investigate relay cooperative communication based on parked cars in PLs. Taking the impact of the car's leaving behavior into consideration, we derive the expressions of outage probability in a two-hop cooperative communication and its link capacity. Finally, the numerical results show that the impact of a car's arriving time is greater than the impact of the duration the car has parked on outage probability.
Cell-less Communications in 5G Vehicular Networks Based on Vehicle-Installed Access Points
Venue: arXiv cs.NI 2018
Year: 2018

The development of intelligent transportation systems raises many requirements to the current vehicular networks. For instance, to ensure secure communications between vehicles, low latency, high connectivity and high data rate are required for vehicular networks. To meet such requirements, the 5G communication systems for vehicular networks should be improved accordingly. This article proposes a communication scheme for 5G vehicular networks, in which moving access points are deployed on vehicles to facilitate the access of vehicle users. Moreover, the adjacent vehicle-installed moving access points may cooperatively communicate with the vehicle users by joint transmissions and receptions. In this way, the vehicle users communicate with one or more unspecified cooperative access points in a cell-less manner instead of being associated to a single access point. To manage such cell-less networks, local moving software-defined cloudlets are adopted to perform transmission and scheduling management. Simulation results show that the proposed scheme significantly reduces the latency, while improving the connectivity of the vehicular networks, and can be considered as a research direction for the solution to 5G vehicular networks.