OpenRaiser/Intern-Atlas huggingface dataset:
Deformable Convolutional Networks
Venue: arXiv cs.CV 2017
Year: 2017

Convolutional neural networks (CNNs) are inherently limited to model geometric transformations due to the fixed geometric structures in its building modules. In this work, we introduce two new modules to enhance the transformation modeling capacity of CNNs, namely, deformable convolution and deformable RoI pooling. Both are based on the idea of augmenting the spatial sampling locations in the modules with additional offsets and learning the offsets from target tasks, without additional supervision. The new modules can readily replace their plain counterparts in existing CNNs and can be easily trained end-to-end by standard back-propagation, giving rise to deformable convolutional networks. Extensive experiments validate the effectiveness of our approach on sophisticated vision tasks of object detection and semantic segmentation. The code would be released.
Network Comparison: Embeddings and Interiors
Venue: arXiv cs.SI 2017
Year: 2017

This paper presents methods to compare networks where relationships between pairs of nodes in a given network are defined. We define such network distance by searching for the optimal method to embed one network into another network, prove that such distance is a valid metric in the space of networks modulo permutation isomorphisms, and examine its relationship with other network metrics. The network distance defined can be approximated via multi-dimensional scaling, however, the lack of structure in networks results in poor approximations. To alleviate such problem, we consider methods to define the interiors of networks. We show that comparing interiors induced from a pair of networks yields the same result as the actual network distance between the original networks. Practical implications are explored by showing the ability to discriminate networks generated by different models.
Gender Matters! Analyzing Global Cultural Gender Preferences for Venues Using Social Sensing
Venue: arXiv cs.SI 2017
Year: 2017

Gender differences is a phenomenon around the world actively researched by social scientists. Traditionally, the data used to support such studies is manually obtained, often through surveys with volunteers. However, due to their inherent high costs because of manual steps, such traditional methods do not quickly scale to large-size studies. We here investigate a particular aspect of gender differences: preferences for venues. To that end we explore the use of check-in data collected from Foursquare to estimate cultural gender preferences for venues in the physical world. For that, we first demonstrate that by analyzing the check-in data in various regions of the world we can find significant differences in preferences for specific venues between gender groups. Some of these significant differences reflect well-known cultural patterns. Moreover, we also gathered evidence that our methodology offers useful information about gender preference for venues in a given region in the real world. This suggests that gender and venue preferences observed may not be independent. Our results suggests that our proposed methodology could be a promising tool to support studies on gender preferences for venues at different spatial granularities around the world, being faster and cheaper than traditional methods, besides quickly capturing changes in the real world.
Software Metrics in Boa Large-Scale Software Mining Infrastructure: Challenges and Solutions
Venue: arXiv cs.SE 2017
Year: 2017

In this paper, we describe our experience implementing some of classic software engineering metrics using Boa - a large-scale software repository mining platform - and its dedicated language. We also aim to take an advantage of the Boa infrastructure to propose new software metrics and to characterize open source projects by software metrics to provide reference values of software metrics based on large number of open source projects. Presented software metrics, well known and proposed in this paper, can be used to build large-scale software defect prediction models. Additionally, we present the obstacles we met while developing metrics, and our analysis can be used to improve Boa in its future releases. The implemented metrics can also be used as a foundation for more complex explorations of open source projects and serve as a guide how to implement software metrics using Boa as the source code of the metrics is freely available to support reproducible research.
Application of Information Centric Networking to NoSQL Databases: the Spatio-Temporal use case
Venue: arXiv cs.DB 2017
Year: 2017

This paper explores methodologies, advantages and challenges related to the use of the Information Centric Network technology for developing NoSQL distributed databases, which are expected to play a central role in the forthcoming IoT and BigData era. ICN services make possible to simplify the development of the database software, improve performance, and provide data-level access control. We use our findings for devising a NoSQL spatio-temporal database, named OpenGeoBase, and evaluate its performance with a real data set related to Intelligent Transport System applications.
Recent Advances in Features Extraction and Description Algorithms: A Comprehensive Survey
Venue: arXiv cs.CV 2017
Year: 2017

Computer vision is one of the most active research fields in information technology today. Giving machines and robots the ability to see and comprehend the surrounding world at the speed of sight creates endless potential applications and opportunities. Feature detection and description algorithms can be indeed considered as the retina of the eyes of such machines and robots. However, these algorithms are typically computationally intensive, which prevents them from achieving the speed of sight real-time performance. In addition, they differ in their capabilities and some may favor and work better given a specific type of input compared to others. As such, it is essential to compactly report their pros and cons as well as their performances and recent advances. This paper is dedicated to provide a comprehensive overview on the state-of-the-art and recent advances in feature detection and description algorithms. Specifically, it starts by overviewing fundamental concepts. It then compares, reports and discusses their performance and capabilities. The Maximally Stable Extremal Regions algorithm and the Scale Invariant Feature Transform algorithms, being two of the best of their type, are selected to report their recent algorithmic derivatives.
An opportunistic linear-convex algorithm for localization in mobile robot networks
Venue: arXiv cs.RO 2017
Year: 2017

In this paper, we develop a \textcolor{black}{\emph{distributed}} algorithm to localize a network of robots moving arbitrarily in a bounded region. In the case of such mobile networks, the main challenge is that the robots may not be able to find nearby robots to implement a distributed algorithm. We address this issue by providing an opportunistic algorithm that only implements a location update when there are nearby robots and does not update otherwise. We assume that each robot measures a noisy version of its motion and the distances to the nearby robots. To localize a network of mobile robots in~$\mathbb{R}^m$, we provide a simple \emph{linear} update, which is based on barycentric coordinates and is linear-convex. We abstract the corresponding localization algorithm as a Linear Time-Varying (LTV) system and show that it asymptotically converges to the true locations~of~the robots. We first focus on the noiseless case, where the distance and motion vectors are known (measured) perfectly, and provide sufficient conditions on the convergence of the algorithm. We then evaluate the performance of the algorithm in the presence of noise and provide modifications to counter the undesirable effects of noise. \textcolor{black}{We further show that our algorithm precisely tracks a mobile network as long as there is at least one known beacon (a node whose location is perfectly known).
TAC-GAN - Text Conditioned Auxiliary Classifier Generative Adversarial Network
Venue: arXiv cs.CV 2017
Year: 2017

In this work, we present the Text Conditioned Auxiliary Classifier Generative Adversarial Network, (TAC-GAN) a text to image Generative Adversarial Network (GAN) for synthesizing images from their text descriptions. Former approaches have tried to condition the generative process on the textual data; but allying it to the usage of class information, known to diversify the generated samples and improve their structural coherence, has not been explored. We trained the presented TAC-GAN model on the Oxford-102 dataset of flowers, and evaluated the discriminability of the generated images with Inception-Score, as well as their diversity using the Multi-Scale Structural Similarity Index (MS-SSIM). Our approach outperforms the state-of-the-art models, i.e., its inception score is 3.45, corresponding to a relative increase of 7.8% compared to the recently introduced StackGan. A comparison of the mean MS-SSIM scores of the training and generated samples per class shows that our approach is able to generate highly diverse images with an average MS-SSIM of 0.14 over all generated classes.
The Hardness of Embedding Grids and Walls
Venue: arXiv cs.CC 2017
Year: 2017

The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of "pattern graphs" can be embedded into a given graph $H$ (that is, is isomorphic to a subgraph of $H$) is fixed-parameter tractable if $K$ is a class of graphs of bounded tree width and $W[1]$-complete otherwise. Towards this conjecture, we prove that the embedding problem is $W[1]$-complete if $K$ is the class of all grids or the class of all walls.
Anisotropic triangulations via discrete Riemannian Voronoi diagrams
Venue: arXiv cs.CG 2017
Year: 2017

The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult problem in a practical way, we introduce the discrete Riemannian Voronoi diagram, a discrete structure that approximates the Riemannian Voronoi diagram. This structure has been implemented and was shown to lead to good triangulations in $\mathbb{R}^2$ and on surfaces embedded in $\mathbb{R}^3$ as detailed in our experimental companion paper. In this paper, we study theoretical aspects of our structure. Given a finite set of points $\cal P$ in a domain $Ω$ equipped with a Riemannian metric, we compare the discrete Riemannian Voronoi diagram of $\cal P$ to its Riemannian Voronoi diagram. Both diagrams have dual structures called the discrete Riemannian Delaunay and the Riemannian Delaunay complex. We provide conditions that guarantee that these dual structures are identical. It then follows from previous results that the discrete Riemannian Delaunay complex can be embedded in $Ω$ under sufficient conditions, leading to an anisotropic triangulation with curved simplices. Furthermore, we show that, under similar conditions, the simplices of this triangulation can be straightened.
VQABQ: Visual Question Answering by Basic Questions
Venue: arXiv cs.CV 2017
Year: 2017

Taking an image and question as the input of our method, it can output the text-based answer of the query question about the given image, so called Visual Question Answering (VQA). There are two main modules in our algorithm. Given a natural language question about an image, the first module takes the question as input and then outputs the basic questions of the main given question. The second module takes the main question, image and these basic questions as input and then outputs the text-based answer of the main question. We formulate the basic questions generation problem as a LASSO optimization problem, and also propose a criterion about how to exploit these basic questions to help answer main question. Our method is evaluated on the challenging VQA dataset and yields state-of-the-art accuracy, 60.34% in open-ended task.
Image denoising by median filter in wavelet domain
Venue: arXiv cs.MM 2017
Year: 2017

The details of an image with noise may be restored by removing noise through a suitable image de-noising method. In this research, a new method of image de-noising based on using median filter (MF) in the wavelet domain is proposed and tested. Various types of wavelet transform filters are used in conjunction with median filter in experimenting with the proposed approach in order to obtain better results for image de-noising process, and, consequently to select the best suited filter. Wavelet transform working on the frequencies of sub-bands split from an image is a powerful method for analysis of images. According to this experimental work, the proposed method presents better results than using only wavelet transform or median filter alone. The MSE and PSNR values are used for measuring the improvement in de-noised images.
Modelling, Verification, and Comparative Performance Analysis of the B.A.T.M.A.N. Protocol
Venue: arXiv cs.LO 2017
Year: 2017

This paper considers on a network routing protocol known as Better Approach to Mobile Ad hoc Networks (B.A.T.M.A.N.). The protocol serves two aims: first, to discover all bidirectional links, and second, to identify the best-next-hop for every other node in the network. A key element is that each node will flood the network at regular intervals with so-called originator messages. This paper describes in detail a formalisation of the B.A.T.M.A.N. protocol. This exercise revealed several ambiguities and inconsistencies in the RFC. We developed two models. The first implements, if possible, a literal reading of the RFC, while the second model tries to be closer to the underlying concepts. The alternative model is in some places less restrictive, and rebroadcasts more often when it helps route discovery, and will on the other hand drop more messages that might interfere with the process. We verify for a basic untimed model that both interpretations ensure loop-freedom, bidirectional link discovery, and route-discovery. We use simulation of a timed model to compare the performance and found that both models are comparable when it comes to the time and number of messages needed for discovering routes. However, the alternative model identifies a significantly lower number of suboptimal routes, and thus improves on the literal interpretation of the RFC.
A Large Term Rewrite System Modelling a Pioneering Cryptographic Algorithm
Venue: arXiv cs.CR 2017
Year: 2017

We present a term rewrite system that formally models the Message Authenticator Algorithm (MAA), which was one of the first cryptographic functions for computing a Message Authentication Code and was adopted, between 1987 and 2001, in international standards (ISO 8730 and ISO 8731-2) to ensure the authenticity and integrity of banking transactions. Our term rewrite system is large (13 sorts, 18 constructors, 644 non-constructors, and 684 rewrite rules), confluent, and terminating. Implementations in thirteen different languages have been automatically derived from this model and used to validate 200 official test vectors for the MAA.
A Model-Derivation Framework for Software Analysis
Venue: arXiv cs.SE 2017
Year: 2017

Model-based verification allows to express behavioral correctness conditions like the validity of execution states, boundaries of variables or timing at a high level of abstraction and affirm that they are satisfied by a software system. However, this requires expressive models which are difficult and cumbersome to create and maintain by hand. This paper presents a framework that automatically derives behavioral models from real-sized Java programs. Our framework builds on the EMF/ECore technology and provides a tool that creates an initial model from Java bytecode, as well as a series of transformations that simplify the model and eventually output a timed-automata model that can be processed by a model checker such as UPPAAL. The framework has the following properties: (1) consistency of models with software, (2) extensibility of the model derivation process, (3) scalability and (4) expressiveness of models. We report several case studies to validate how our framework satisfies these properties.
Full-Duplex Cooperative Cognitive Radio Networks with Wireless Energy Harvesting
Venue: arXiv cs.IT 2017
Year: 2017

This paper proposes and analyzes a new full-duplex (FD) cooperative cognitive radio network with wireless energy harvesting (EH). We consider that the secondary receiver is equipped with a FD radio and acts as a FD hybrid access point (HAP), which aims to collect information from its associated EH secondary transmitter (ST) and relay the signals. The ST is assumed to be equipped with an EH unit and a rechargeable battery such that it can harvest and accumulate energy from radio frequency (RF) signals transmitted by the primary transmitter (PT) and the HAP. We develop a novel cooperative spectrum sharing (CSS) protocol for the considered system. In the proposed protocol, thanks to its FD capability, the HAP can receive the PT's signals and transmit energy-bearing signals to charge the ST simultaneously, or forward the PT's signals and receive the ST's signals at the same time. We derive analytical expressions for the achievable throughput of both primary and secondary links by characterizing the dynamic charging/discharging behaviors of the ST battery as a finite-state Markov chain. We present numerical results to validate our theoretical analysis and demonstrate the merits of the proposed protocol over its non-cooperative counterpart.
Empirical Analysis of the Necessary and Sufficient Conditions of the Echo State Property
Venue: arXiv cs.NE 2017
Year: 2017

The Echo State Network (ESN) is a specific recurrent network, which has gained popularity during the last years. The model has a recurrent network named reservoir, that is fixed during the learning process. The reservoir is used for transforming the input space in a larger space. A fundamental property that provokes an impact on the model accuracy is the Echo State Property (ESP). There are two main theoretical results related to the ESP. First, a sufficient condition for the ESP existence that involves the singular values of the reservoir matrix. Second, a necessary condition for the ESP. The ESP can be violated according to the spectral radius value of the reservoir matrix. There is a theoretical gap between these necessary and sufficient conditions. This article presents an empirical analysis of the accuracy and the projections of reservoirs that satisfy this theoretical gap. It gives some insights about the generation of the reservoir matrix. From previous works, it is already known that the optimal accuracy is obtained near to the border of stability control of the dynamics. Then, according to our empirical results, we can see that this border seems to be closer to the sufficient conditions than to the necessary conditions of the ESP.
Generalized Compute-Compress-and-Forward
Venue: arXiv cs.IT 2017
Year: 2017

Compute-and-forward (CF) harnesses interference in wireless communications by exploiting structured coding. The key idea of CF is to compute integer combinations of codewords from multiple source nodes, rather than to decode individual codewords by treating others as noise. Compute-compress-and-forward (CCF) can further enhance the network performance by introducing compression operations at receivers. In this paper, we develop a more general compression framework, termed generalized compute-compress-and-forward (GCCF), where the compression function involves multiple quantization-and-modulo lattice operations. We show that GCCF achieves a broader compression rate region than CCF. We also compare our compression rate region with the fundamental Slepian-Wolf (SW) region. We show that GCCF is optimal in the sense of achieving the minimum total compression rate. We also establish the criteria under which GCCF achieves the SW region. In addition, we consider a two-hop relay network employing the GCCF scheme. We formulate a sum-rate maximization problem and develop an approximate algorithm to solve the problem. Numerical results are presented to demonstrate the performance superiority of GCCF over CCF and other schemes.
Hopf Bifurcations in Replicator Dynamics with Distributed Delays
Venue: arXiv cs.SY 2017
Year: 2017

In this paper, we study the existence and the property of the Hopf bifurcation in the two-strategy replicator dynamics with distributed delays. In evolutionary games, we assume that a strategy would take an uncertain time delay to have a consequence on the fitness (or utility) of the players. As the mean delay increases, a change in the stability of the equilibrium (Hopf bifurcation) may occur at which a periodic oscillation appears. We consider Dirac, uniform, Gamma, and discrete delay distributions, and we use the Poincaré- Lindstedt's perturbation method to analyze the Hopf bifurcation. Our theoretical results are corroborated with numerical simulations.
Performance Evaluation of Mobile Base Station under different Network Sizes on Cluster-Based Wireless Sensor Networks
Venue: arXiv cs.NI 2017
Year: 2017

The position of the base station (BS) in wireless sensor networks (WSNs) has a significant impact on network lifetime. This paper suggests a mobile BS positioning algorithm for cluster-based WSNs, which considers both the location and the remaining energy level of the cluster heads in the network and evaluate the performance of the algorithm under different values of network sizes, including 100m x 100m, 200m x 200m and 300m x 300m. Simulations are conducted by using OMNeT++ and proposed method is compared with two different static BS positions, including central and external, on HEED protocol. The results show that mobile BS performs better than both central and external BS positions under all network sizes. Besides, the performance difference between the proposed method and the others increases as the size of the network increases, which demonstrates that the proposed mobile BS positioning also provides scalability.
Workload Engineering: Optimising WAN and DC Resources Through RL-Based Workload Placement
Venue: arXiv cs.NI 2017
Year: 2017

With the rise in data centre virtualization, there are increasing choices as to where to place workloads, be it in web applications, Enterprise IT or in Network Function Virtualisation. Workload placement approaches available today primarily focus on optimising the use of data centre resources. Given the significant forecasts for network traffic growth to/from data centres, effective management of both data centre resources and of the wide area networks resources that provide access to those data centres will become increasingly important. In this paper, we present an architecture for workload placement, which uniquely employs a logically centralised controller that is both network and data centre aware, which aims to place workloads to optimise the use of both data centre and wide area network resources. We call this approach workload engineering. We present the results of a simulation study, where we use a reinforcement-learning based placement algorithm on the controller. Results of the study show this algorithm was able to place workloads to make more efficient use of network and data centre resources and placed ~5-8% more workloads than other heuristic placement algorithms considered, for the same installed capacity.