OpenRaiser/Intern-Atlas huggingface dataset:
Capacity Analysis for Full Duplex Self-backhauled Small Cells
Venue: arXiv cs.NI 2018
Year: 2018

Full duplex (FD) communication enables simultaneous transmission and reception on the same frequency band. Though it has the potential of doubling the throughput on isolated links, in reality, higher interference and asymmetric traffic demands in the uplink and downlink could significantly reduce the gains of FD operations. In this paper, we consider the application of FD operation in self-backhauled small cells, where multiple FD capable small cell base stations (SBS) are wirelessly backhauled by a FD capable macro-cell BS (MBS). To increase the capacity of the backhaul link, the MBS is equipped with multiple antennas to enable space division multiple access (SDMA). A scheduling method using back-pressure algorithm and geometric programming is proposed for link selection and interference mitigation. Simulation results show that with FD SDMA backhaul links, the proposed scheduler almost doubles throughput under asymmetric traffic demand and various network conditions.
Accurate Energy-Efficient Power Control for Uplink NOMA Systems under Delay Constraint
Venue: arXiv cs.IT 2018
Year: 2018

Machine-type communications (MTC) devices in 5G will use the Non-orthogonal multiple access (NOMA) technology for massive connections. These devices switch between the transmission mode and the sleep mode for battery saving; and their applications may have diverse quality of service (QoS) requirements. In this paper, we develop a new uplink energy-efficient power control scheme for multiple MTC devices with the above mode transition capability and different QoS requirements. By using the effective bandwidth and the effective capacity models, the system's energy efficiency can be formulated as the ratio of the sum effective capacity to the sum energy consumption. Two new analytical models are used in system's energy efficiency maximization problem: 1) two-mode circuitry model and 2) accurate delay-outage approximation model. Simulation shows our proposed scheme is capable of providing exact delay QoS guarantees for NOMA systems.
Equal But Not The Same: Understanding the Implicit Relationship Between Persuasive Images and Text
Venue: arXiv cs.CV 2018
Year: 2018

Images and text in advertisements interact in complex, non-literal ways. The two channels are usually complementary, with each channel telling a different part of the story. Current approaches, such as image captioning methods, only examine literal, redundant relationships, where image and text show exactly the same content. To understand more complex relationships, we first collect a dataset of advertisement interpretations for whether the image and slogan in the same visual advertisement form a parallel (conveying the same message without literally saying the same thing) or non-parallel relationship, with the help of workers recruited on Amazon Mechanical Turk. We develop a variety of features that capture the creativity of images and the specificity or ambiguity of text, as well as methods that analyze the semantics within and across channels. We show that our method outperforms standard image-text alignment approaches on predicting the parallel/non-parallel relationship between image and text.
Adaptive Metrics for Adaptive Samples
Venue: arXiv cs.CG 2018
Year: 2018

In this paper we consider adaptive sampling's local-feature size, used in surface reconstruction and geometric inference, with respect to an arbitrary landmark set rather than the medial axis and relate it to a path-based adaptive metric on Euclidean space. We prove a near-duality between adaptive samples in the Euclidean metric space and uniform samples in this alternate metric space which results in topological interleavings between the offsets generated by this metric and those generated by an linear approximation of it. After smoothing the distance function associated to the adaptive metric, we apply a result from the theory of critical points of distance functions to the interleaved spaces which yields a computable homology inference scheme assuming one has Hausdorff-close samples of the domain and the landmark set.
Engineering Radio Map for Wireless Resource Management
Venue: arXiv cs.IT 2018
Year: 2018

Radio map in general refers to the geographical signal power spectrum density, formed by the superposition of concurrent wireless transmissions, as a function of location, frequency and time. It contains rich and useful information regarding the spectral activities and propagation channels in wireless networks. Such information can be leveraged to not only improve the performance of existing wireless services (e.g., via proactive resource provisioning) but also enable new applications, such as wireless spectrum surveillance. However, practical implementation of radio maps in wireless communication is often difficult due to the heterogeneity of modern wireless networks and the sheer amount of wireless data to be collected, stored, and processed. In this article, we provide an overview on the state-of-the-art techniques for constructing radio maps as well as applying them to achieve efficient and secure resource management in wireless networks. Some key research challenges are highlighted to motivate future investigation.
Comparison of Different Control Theories on a Two Wheeled Self Balancing Robot
Venue: arXiv cs.RO 2018
Year: 2018

. This paper is aimed to discuss and compare three of the most famous Control Theories on a Two wheeled Self Balancing Robot Simulation using Robot Operating System (ROS) and Gazebo. Two Wheeled Self Balancing Robots are one of the most fascinating applications of Inverted Pendulum System. In this paper, PID, LQR and Fuzzy logic controllers are discussed . Also,0 the modeling and algorithms of the robot simulation is discussed. The primary objectives of this paper is to discuss about the building of a robot model in ROS and Gazebo , experimenting different control theories on them, documenting the whole process with the analysis of the robot and comparison of different control theories on the system.
Deep learning at the shallow end: Malware classification for non-domain experts
Venue: arXiv cs.CR 2018
Year: 2018

Current malware detection and classification approaches generally rely on time consuming and knowledge intensive processes to extract patterns (signatures) and behaviors from malware, which are then used for identification. Moreover, these signatures are often limited to local, contiguous sequences within the data whilst ignoring their context in relation to each other and throughout the malware file as a whole. We present a Deep Learning based malware classification approach that requires no expert domain knowledge and is based on a purely data driven approach for complex pattern and feature identification.
Implementation of Q Learning and Deep Q Network For Controlling a Self Balancing Robot Model
Venue: arXiv cs.RO 2018
Year: 2018

In this paper, the implementation of two Reinforcement learnings namely, Q Learning and Deep Q Network(DQN) on a Self Balancing Robot Gazebo model has been discussed. The goal of the experiments is to make the robot model learn the best actions for staying balanced in an environment. The more time it can stay within a specified limit , the more reward it accumulates and hence more balanced it is. Different experiments with different learning parameters on Q Learning and DQN are conducted and the plots of the experiments are shown.
Independent Sets in Vertex-Arrival Streams
Venue: arXiv cs.DS 2018
Year: 2018

We consider the classic maximal and maximum independent set problems in three models of graph streams: In the edge-arrival model we see a stream of edges which collectively define a graph, this model has been well-studied for a variety of problems. We first show that the space complexity for a one-pass streaming algorithm to find a maximal independent set is quadratic (i.e. we must store all edges). We further show that the problem does not become much easier if we only require approximate maximality. In the "explicit" vertex stream model, the input stream is a sequence of vertices making up the graph, where every vertex arrives along with its incident edges that connect to previously arrived vertices. Various graph problems require substantially less space to solve in this setting than for edge-arrival streams. We show that every one-pass $c$-approximation algorithm for maximum independent set (MIS) on explicit vertex streams requires space $Ω(\frac{n^2}{c^7})$, where $n$ is the number of vertices of the input graph, and it is already known that space $\tildeΘ(\frac{n^2}{c^2})$ is necessary and sufficient in the edge arrival model (Halldórsson et al. 2012). The MIS problem is thus not significantly easier to solve under the explicit vertex arrival order assumption. Our result is proved via a reduction to a new multi-party communication problem closely related to pointer jumping. In the "implicit" vertex stream model, the input stream consists of a sequence of objects, one per vertex. The algorithm is equipped with a function that can map a pair of objects to the presence or absence of an edge, thus defining the graph. This model captures, for example, geometric intersection graphs such as unit disc graphs. Our final set of results consists of several improved upper and lower bounds for ball intersection graphs, in both explicit and implicit streams.
Skin Lesion Analysis Towards Melanoma Detection via End-to-end Deep Learning of Convolutional Neural Networks
Venue: arXiv cs.CV 2018
Year: 2018

This article presents the design, experiments and results of our solution submitted to the 2018 ISIC challenge: Skin Lesion Analysis Towards Melanoma Detection. We design a pipeline using state-of-the-art Convolutional Neural Network (CNN) models for a Lesion Boundary Segmentation task and a Lesion Diagnosis task.
Pedestrian Trajectory Prediction with Structured Memory Hierarchies
Venue: arXiv cs.CV 2018
Year: 2018

This paper presents a novel framework for human trajectory prediction based on multimodal data (video and radar). Motivated by recent neuroscience discoveries, we propose incorporating a structured memory component in the human trajectory prediction pipeline to capture historical information to improve performance. We introduce structured LSTM cells for modelling the memory content hierarchically, preserving the spatiotemporal structure of the information and enabling us to capture both short-term and long-term context. We demonstrate how this architecture can be extended to integrate salient information from multiple modalities to automatically store and retrieve important information for decision making without any supervision. We evaluate the effectiveness of the proposed models on a novel multimodal dataset that we introduce, consisting of 40,000 pedestrian trajectories, acquired jointly from a radar system and a CCTV camera system installed in a public place. The performance is also evaluated on the publicly available New York Grand Central pedestrian database. In both settings, the proposed models demonstrate their capability to better anticipate future pedestrian motion compared to existing state of the art.
Visual Mesh: Real-time Object Detection Using Constant Sample Density
Venue: arXiv cs.CV 2018
Year: 2018

This paper proposes an enhancement of convolutional neural networks for object detection in resource-constrained robotics through a geometric input transformation called Visual Mesh. It uses object geometry to create a graph in vision space, reducing computational complexity by normalizing the pixel and feature density of objects. The experiments compare the Visual Mesh with several other fast convolutional neural networks. The results demonstrate execution times sixteen times quicker than the fastest competitor tested, while achieving outstanding accuracy.
How many weights can a cyclic code have ?
Venue: arXiv cs.IT 2018
Year: 2018

Upper and lower bounds on the largest number of weights in a cyclic code of given length, dimension and alphabet are given. An application to irreducible cyclic codes is considered. Sharper upper bounds are given for the special cyclic codes (called here strongly cyclic), {whose nonzero codewords have period equal to the length of the code}. Asymptotics are derived on the function $Γ(k,q),$ {that is defined as} the largest number of nonzero weights a cyclic code of dimension $k$ over $\F_q$ can have, and an algorithm to compute it is sketched. The nonzero weights in some infinite families of Reed-Muller codes, either binary or $q$-ary, as well as in the $q$-ary Hamming code are determined, two difficult results of independent interest.
Data Race Detection on Compressed Traces
Venue: arXiv cs.PL 2018
Year: 2018

We consider the problem of detecting data races in program traces that have been compressed using straight line programs (SLP), which are special context-free grammars that generate exactly one string, namely the trace that they represent. We consider two classical approaches to race detection --- using the happens-before relation and the lockset discipline. We present algorithms for both these methods that run in time that is linear in the size of the compressed, SLP representation. Typical program executions almost always exhibit patterns that lead to significant compression. Thus, our algorithms are expected to result in large speedups when compared with analyzing the uncompressed trace. Our experimental evaluation of these new algorithms on standard benchmarks confirms this observation.
On Minimum Connecting Transition Sets in Graphs
Venue: arXiv cs.DS 2018
Year: 2018

A forbidden transition graph is a graph defined together with a set of permitted transitions i.e. unordered pair of adjacent edges that one may use consecutively in a walk in the graph. In this paper, we look for the smallest set of transitions needed to be able to go from any vertex of the given graph to any other. We prove that this problem is NP-hard and study approximation algorithms. We develop theoretical tools that help to study this problem.
Deep attention-guided fusion network for lesion segmentation
Venue: arXiv cs.CV 2018
Year: 2018

We participated the Task 1: Lesion Segmentation. The paper describes our algorithm and the final result of validation set for the ISIC Challenge 2018 - Skin Lesion Analysis Towards Melanoma Detection.
DASN:Data-Aware Skilled Network for Accurate MR Brain Tissue Segmentation
Venue: arXiv cs.CV 2018
Year: 2018

Accurate segmentation of MR brain tissue is a crucial step for diagnosis, surgical planning, and treatment of brain abnormalities. Automatic and reliable segmenta-tion methods are required to assist doctor. Over the last few years, deep learning especially deep convolutional neural networks (CNNs) have emerged as one of the most prominent approaches for image recognition problems in various do-mains. But the improvement of deep networks always needs inspiration, which is rare for the ordinary. Until now,there have been reasonable MR brain tissue segmentation methods,all of which can achieve promising performance. These different methods have their own characteristic and are distinctive for data sets. In other words, different models performance vary widely on the same data sets and each model has what it is skilled in. It is on the basis of this, we propose a judgement to distinguish data sets that different models are good at. With our method, the segmentation accuracy can be improved easily based on the existing models, neither without increasing training data nor improving the network. We validate our method on the widely used IBSR 18 dataset and obtain average dice ratio of 88.06%,while it is 85.82% and 86.92% when only using separate one model respectively.
Git Loss for Deep Face Recognition
Venue: arXiv cs.CV 2018
Year: 2018

Convolutional Neural Networks (CNNs) have been widely used in computer vision tasks, such as face recognition and verification, and have achieved state-of-the-art results due to their ability to capture discriminative deep features. Conventionally, CNNs have been trained with softmax as supervision signal to penalize the classification loss. In order to further enhance the discriminative capability of deep features, we introduce a joint supervision signal, Git loss, which leverages on softmax and center loss functions. The aim of our loss function is to minimize the intra-class variations as well as maximize the inter-class distances. Such minimization and maximization of deep features are considered ideal for face recognition task. We perform experiments on two popular face recognition benchmarks datasets and show that our proposed loss function achieves maximum separability between deep face features of different identities and achieves state-of-the-art accuracy on two major face recognition benchmark datasets: Labeled Faces in the Wild (LFW) and YouTube Faces (YTF). However, it should be noted that the major objective of Git loss is to achieve maximum separability between deep features of divergent identities.
Towards a Programmable Framework for Agent Game Playing
Venue: arXiv cs.MA 2018
Year: 2018

The field of Game Theory provides a useful mechanism for modeling many decision-making scenarios. In participating in these scenarios individuals and groups adopt particular strategies, which generally perform with varying levels of success. However, most results have focussed on players that play the same game in an iterated fashion. This paper describes a framework which can be used to observe agents when they do not know in advance which game they are going to play. That is, the same group of agents could first play a few rounds of the Iterated Prisoner's Dilemma, and then a few rounds of the Linear Public Goods Game, and then a few rounds of Minority Game, or perhaps all games in a strictly alternating fashion or a randomized instantiation of games. This framework will allow for investigation of agents in more complex settings, when there is uncertainty about the future, and limited resources to store strategies.
Clafer: Lightweight Modeling of Structure, Behaviour, and Variability
Venue: arXiv cs.PL 2018
Year: 2018

Embedded software is growing fast in size and complexity, leading to intimate mixture of complex architectures and complex control. Consequently, software specification requires modeling both structures and behaviour of systems. Unfortunately, existing languages do not integrate these aspects well, usually prioritizing one of them. It is common to develop a separate language for each of these facets. In this paper, we contribute Clafer: a small language that attempts to tackle this challenge. It combines rich structural modeling with state of the art behavioural formalisms. We are not aware of any other modeling language that seamlessly combines these facets common to system and software modeling. We show how Clafer, in a single unified syntax and semantics, allows capturing feature models (variability), component models, discrete control models (automata) and variability encompassing all these aspects. The language is built on top of first order logic with quantifiers over basic entities (for modeling structures) combined with linear temporal logic (for modeling behaviour). On top of this semantic foundation we build a simple but expressive syntax, enriched with carefully selected syntactic expansions that cover hierarchical modeling, associations, automata, scenarios, and Dwyer's property patterns. We evaluate Clafer using a power window case study, and comparing it against other notations that substantially overlap with its scope (SysML, AADL, Temporal OCL and Live Sequence Charts), discussing benefits and perils of using a single notation for the purpose.
From Volcano to Toyshop: Adaptive Discriminative Region Discovery for Scene Recognition
Venue: arXiv cs.CV 2018
Year: 2018

As deep learning approaches to scene recognition emerge, they have continued to leverage discriminative regions at multiple scales, building on practices established by conventional image classification research. However, approaches remain largely generic, and do not carefully consider the special properties of scenes. In this paper, inspired by the intuitive differences between scenes and objects, we propose Adi-Red, an adaptive approach to discriminative region discovery for scene recognition. Adi-Red uses a CNN classifier, which was pre-trained using only image-level scene labels, to discover discriminative image regions directly. These regions are then used as a source of features to perform scene recognition. The use of the CNN classifier makes it possible to adapt the number of discriminative regions per image using a simple, yet elegant, threshold, at relatively low computational cost. Experimental results on the scene recognition benchmark dataset SUN397 demonstrate the ability of Adi-Red to outperform the state of the art. Additional experimental analysis on the Places dataset reveals the advantages of Adi-Red, and highlight how they are specific to scenes. We attribute the effectiveness of Adi-Red to the ability of adaptive region discovery to avoid introducing noise, while also not missing out on important information.
Individual perception dynamics in drunk games
Venue: arXiv cs.GT 2018
Year: 2018

We study the effects of individual perceptions of payoffs in two-player games. In particular we consider the setting in which individuals' perceptions of the game are influenced by their previous experiences and outcomes. Accordingly, we introduce a framework based on evolutionary games where individuals have the capacity to perceive their interactions in different ways. Starting from the narrative of social behaviors in a pub as an illustration, we first study the combination of the prisoner's dilemma and harmony game as two alternative perceptions of the same situation. Considering a selection of game pairs, our results show that the interplay between perception dynamics and game payoffs gives rise to non-linear phenomena unexpected in each of the games separately, such as catastrophic phase transitions in the cooperation basin of attraction, Hopf bifurcations and cycles of cooperation and defection. Combining analytical techniques with multi-agent simulations we also show how introducing individual perceptions can cause non-trivial dynamical behaviors to emerge, which cannot be obtained by analyzing the system as a whole. Specifically, initial heterogeneities at the microscopic level can yield a polarization effect that is unpredictable at the macroscopic level. This framework opens the door to the exploration of new ways of understanding the link between the emergence of cooperation and individual preferences and perceptions, with potential applications beyond social interactions.