OpenRaiser/Intern-Atlas huggingface dataset:
Thinking Like a Vertex: a Survey of Vertex-Centric Frameworks for Distributed Graph Processing
Venue: arXiv cs.DC 2015
Year: 2015

The vertex-centric programming model is an established computational paradigm recently incorporated into distributed processing frameworks to address challenges in large-scale graph processing. Billion-node graphs that exceed the memory capacity of standard machines are not well-supported by popular Big Data tools like MapReduce, which are notoriously poor-performing for iterative graph algorithms such as PageRank. In response, a new type of framework challenges one to Think Like A Vertex (TLAV) and implements user-defined programs from the perspective of a vertex rather than a graph. Such an approach improves locality, demonstrates linear scalability, and provides a natural way to express and compute many iterative graph algorithms. These frameworks are simple to program and widely applicable, but, like an operating system, are composed of several intricate, interdependent components, of which a thorough understanding is necessary in order to elicit top performance at scale. To this end, the first comprehensive survey of TLAV frameworks is presented. In this survey, the vertex-centric approach to graph processing is overviewed, TLAV frameworks are deconstructed into four main components and respectively analyzed, and TLAV implementations are reviewed and categorized.
Outage Balancing in Downlink Non-Orthogonal Multiple Access With Statistical Channel State Information
Venue: arXiv cs.IT 2015
Year: 2015

This paper considers a downlink non-orthogonal multiple access (NOMA) system where the source intends to transmit independent information to the users at targeted data rates under statistical channel state information at the transmitter. The problem of outage balancing among the users is studied with the issues of power allocation, decoding order selection, and user grouping being taken into account. Specifically, with regard to the max-min fairness criterion, we derive the optimal power allocation in closed-form and prove the corresponding optimal decoding order for the elementary downlink NOMA system. By assigning a weighting factor for each user, the analytical results can be used to evaluate the outage performance of the downlink NOMA system under various fairness constraints. Further, we investigate the case with user grouping, in which each user group can be treated as an elementary downlink NOMA system. The associated problems of power and resource allocation among different user groups are solved. The implementation complexity issue of NOMA is also considered with focus on that caused by successive interference cancellation and user grouping. The complexity and performance tradeoff is analyzed by simulations, which provides fruitful insights for the practical application of NOMA. The simulation results substantiate our analysis and show considerable performance gain of NOMA when compared with orthogonal multiple access.
Millimeter-wave Wireless LAN and its Extension toward 5G Heterogeneous Networks
Venue: arXiv cs.NI 2015
Year: 2015

Millimeter-wave (mmw) frequency bands, especially 60 GHz unlicensed band, are considered as a promising solution for gigabit short range wireless communication systems. IEEE standard 802.11ad, also known as WiGig, is standardized for the usage of the 60 GHz unlicensed band for wireless local area networks (WLANs). By using this mmw WLAN, multi-Gbps rate can be achieved to support bandwidth-intensive multimedia applications. Exhaustive search along with beamforming (BF) is usually used to overcome 60 GHz channel propagation loss and accomplish data transmissions in such mmw WLANs. Because of its short range transmission with a high susceptibility to path blocking, multiple number of mmw access points (APs) should be used to fully cover a typical target environment for future high capacity multi-Gbps WLANs. Therefore, coordination among mmw APs is highly needed to overcome packet collisions resulting from un-coordinated exhaustive search BF and to increase the total capacity of mmw WLANs. In this paper, we firstly give the current status of mmw WLANs with our developed WiGig AP prototype. Then, we highlight the great need for coordinated transmissions among mmw APs as a key enabler for future high capacity mmw WLANs. Two different types of coordinated mmw WLAN architecture are introduced. One is the distributed antenna type architecture to realize centralized coordination, while the other is an autonomous coordination with the assistance of legacy Wi-Fi signaling. Moreover, two heterogeneous network (HetNet) architectures are also introduced to efficiently extend the coordinated mmw WLANs to be used for future 5th Generation (5G) cellular networks.
GPU-based visualization of domain-coloured algebraic Riemann surfaces
Venue: arXiv cs.GR 2015
Year: 2015

We examine an algorithm for the visualization of domain-coloured Riemann surfaces of plane algebraic curves. The approach faithfully reproduces the topology and the holomorphic structure of the Riemann surface. We discuss how the algorithm can be implemented efficiently in OpenGL with geometry shaders, and (less efficiently) even in WebGL with multiple render targets and floating point textures. While the generation of the surface takes noticeable time in both implementations, the visualization of a cached Riemann surface mesh is possible with interactive performance. This allows us to visually explore otherwise almost unimaginable mathematical objects. As examples, we look at the complex square root and the folium of Descartes. For the folium of Descartes, the visualization reveals features of the algebraic curve which are not obvious from its equation.
Design and implementation of an Android application to anonymously analyse locations of the citizens in Barcelona
Venue: arXiv cs.CY 2015
Year: 2015

The MobilitApp application is able to obtain mobility data and type of activity performed by a person. It runs in the background and stores the information in synchronous periodic locations. The main work of this project was to develop tools that facilitate the exploitation of the information obtained, add elements that make it attractive to use the application and spread it to a wider audience. With these new procedures, we manage to increase the number of connected users, improve security with which sensitive user information is managed and establish channels that will be used to add additional functionality to the application in future works.
Matrix Inversion-Less Signal Detection Using SOR Method for Uplink Large-Scale MIMO Systems
Venue: arXiv cs.IT 2015
Year: 2015

For uplink large-scale MIMO systems, linear minimum mean square error (MMSE) signal detection algorithm is near-optimal but involves matrix inversion with high complexity. In this paper, we propose a low-complexity signal detection algorithm based on the successive overrelaxation (SOR) method to avoid the complicated matrix inversion. We first prove a special property that the MMSE filtering matrix is symmetric positive definite for uplink large-scale MIMO systems, which is the premise for the SOR method. Then a low-complexity iterative signal detection algorithm based on the SOR method as well as the convergence proof is proposed. The analysis shows that the proposed scheme can reduce the computational complexity from O(K3) to O(K2), where K is the number of users. Finally, we verify through simulation results that the proposed algorithm outperforms the recently proposed Neumann series approximation algorithm, and achieves the near-optimal performance of the classical MMSE algorithm with a small number of iterations.
Turbo-Like Beamforming Based on Tabu Search Algorithm for Millimeter-Wave Massive MIMO Systems
Venue: arXiv cs.IT 2015
Year: 2015

For millimeter-wave (mmWave) massive MIMO systems, the codebook-based analog beamforming (including transmit precoding and receive combining) is usually used to compensate the severe attenuation of mmWave signals. However, conventional beamforming schemes involve complicated search among pre-defined codebooks to find out the optimal pair of analog precoder and analog combiner. To solve this problem, by exploring the idea of turbo equalizer together with tabu search (TS) algorithm, we propose a Turbo-like beamforming scheme based on TS, which is called Turbo-TS beamforming in this paper, to achieve the near-optimal performance with low complexity. Specifically, the proposed Turbo-TS beamforming scheme is composed of the following two key components: 1) Based on the iterative information exchange between the base station and the user, we design a Turbo-like joint search scheme to find out the near-optimal pair of analog precoder and analog combiner; 2) Inspired by the idea of TS algorithm developed in artificial intelligence, we propose a TS-based precoding/combining scheme to intelligently search the best precoder/combiner in each iteration of Turbo-like joint search with low complexity. Analysis shows that the proposed Turbo-TS beamforming can considerably reduce the searching complexity, and simulation results verify that it can achieve the near-optimal performance.
Compressive sensing based differential channel feedback for massive MIMO
Venue: arXiv cs.IT 2015
Year: 2015

Massive multiple-input multiple-output (MIMO) is becoming a key technology for future 5G wireless communications. Channel feedback for massive MIMO is challenging due to the substantially increased dimension of MIMO channel matrix. In this letter, we propose a compressive sensing (CS) based differential channel feedback scheme to reduce the feedback overhead. Specifically, the temporal correlation of time-varying channels is exploited to generate the differential channel impulse response (CIR) between two CIRs in neighboring time slots, which enjoys a much stronger sparsity than the original sparse CIRs. Thus, the base station can recover the differential CIR from the highly compressed differential CIR under the framework of CS theory. Simulations show that the proposed scheme reduces the feedback overhead by about 20\% compared with the direct CS-based scheme.
Deep Learning and Music Adversaries
Venue: arXiv cs.LG 2015
Year: 2015

An adversary is essentially an algorithm intent on making a classification system perform in some particular way given an input, e.g., increase the probability of a false negative. Recent work builds adversaries for deep learning systems applied to image object recognition, which exploits the parameters of the system to find the minimal perturbation of the input image such that the network misclassifies it with high confidence. We adapt this approach to construct and deploy an adversary of deep learning systems applied to music content analysis. In our case, however, the input to the systems is magnitude spectral frames, which requires special care in order to produce valid input audio signals from network-derived perturbations. For two different train-test partitionings of two benchmark datasets, and two different deep architectures, we find that this adversary is very effective in defeating the resulting systems. We find the convolutional networks are more robust, however, compared with systems based on a majority vote over individually classified audio frames. Furthermore, we integrate the adversary into the training of new deep systems, but do not find that this improves their resilience against the same adversary.
MiniCPS: A toolkit for security research on CPS Networks
Venue: arXiv cs.NI 2015
Year: 2015

In recent years, tremendous effort has been spent to modernizing communication infrastructure in Cyber-Physical Systems (CPS) such as Industrial Control Systems (ICS) and related Supervisory Control and Data Acquisition (SCADA) systems. While a great amount of research has been conducted on network security of office and home networks, recently the security of CPS and related systems has gained a lot of attention. Unfortunately, real-world CPS are often not open to security researchers, and as a result very few reference systems and topologies are available. In this work, we present MiniCPS, a CPS simulation toolbox intended to alleviate this problem. The goal of MiniCPS is to create an extensible, reproducible research environment targeted to communications and physical-layer interactions in CPS. MiniCPS builds on Mininet to provide lightweight real-time network emulation, and extends Mininet with tools to simulate typical CPS components such as programmable logic controllers, which use industrial protocols (Ethernet/IP, Modbus/TCP). In addition, MiniCPS defines a simple API to enable physical-layer interaction simulation. In this work, we demonstrate applications of MiniCPS in two example scenarios, and show how MiniCPS can be used to develop attacks and defenses that are directly applicable to real systems.
Extremum Seeking-based Indirect Adaptive Control for Nonlinear Systems with State and Time-Dependent Uncertainties
Venue: arXiv cs.SY 2015
Year: 2015

We study in this paper the problem of adaptive trajectory tracking for nonlinear systems affine in the control with bounded state-dependent and time-dependent uncertainties. We propose to use a modular approach, in the sense that we first design a robust nonlinear state feedback which renders the closed loop input to state stable(ISS) between an estimation error of the uncertain parameters and an output tracking error. Next, we complement this robust ISS controller with a model-free multiparametric extremum seeking (MES) algorithm to estimate the model uncertainties. The combination of the ISS feedback and the MES algorithm gives an indirect adaptive controller. We show the efficiency of this approach on a two-link robot manipulator example.
Performance and Energy Optimization of Matrix Multiplication on Asymmetric big.LITTLE Processors
Venue: arXiv cs.DC 2015
Year: 2015

Asymmetric processors have emerged as an appealing technology for severely energy-constrained environments, especially in the mobile market where heterogeneity in applications is mainstream. In addition, given the growing interest on ultra low-power architectures for high performance computing, this type of platforms are also being investigated in the road towards the implementation of energy- efficient high-performance scientific applications. In this paper, we propose a first step towards a complete implementation of the BLAS interface adapted to asymmetric ARM big.LITTLE processors, analyzing the trade-offs between performance and energy efficiency when compared to existing homogeneous (symmetric) multi-threaded BLAS implementations. Our experimental results reveal important gains in performance while maintaining the energy efficiency of homogeneous solutions by efficiently exploiting all the resources of the asymmetric processor.
Hand Gesture Recognition Library
Venue: arXiv cs.CV 2015
Year: 2015

In this paper we have presented a hand gesture recognition library. Various functions include detecting cluster count, cluster orientation, finger pointing direction, etc. To use these functions first the input image needs to be processed into a logical array for which a function has been developed. The library has been developed keeping flexibility in mind and thus provides application developers a wide range of options to develop custom gestures.
A Unifying Framework for Adaptive Radar Detection in Homogeneous plus Structured Interference-Part I: On the Maximal Invariant Statistic
Venue: arXiv cs.IT 2015
Year: 2015

This paper deals with the problem of adaptive multidimensional/multichannel signal detection in homogeneous Gaussian disturbance with unknown covariance matrix and structured deterministic interference. The aforementioned problem corresponds to a generalization of the well-known Generalized Multivariate Analysis of Variance (GMANOVA). In this first part of the work, we formulate the considered problem in canonical form and, after identifying a desirable group of transformations for the considered hypothesis testing, we derive a Maximal Invariant Statistic (MIS) for the problem at hand. Furthermore, we provide the MIS distribution in the form of a stochastic representation. Finally, strong connections to the MIS obtained in the open literature in simpler scenarios are underlined.
Super-Resolution Sparse MIMO-OFDM Channel Estimation Based on Spatial and Temporal Correlations
Venue: arXiv cs.IT 2015
Year: 2015

This letter proposes a parametric sparse multiple input multiple output (MIMO)-OFDM channel estimation scheme based on the finite rate of innovation (FRI) theory, whereby super-resolution estimates of path delays with arbitrary values can be achieved. Meanwhile, both the spatial and temporal correlations of wireless MIMO channels are exploited to improve the accuracy of the channel estimation. For outdoor communication scenarios, where wireless channels are sparse in nature, path delays of different transmit-receive antenna pairs share a common sparse pattern due to the spatial correlation of MIMO channels. Meanwhile, the channel sparse pattern is nearly unchanged during several adjacent OFDM symbols due to the temporal correlation of MIMO channels. By simultaneously exploiting those MIMO channel characteristics, the proposed scheme performs better than existing state-of-the-art schemes. Furthermore, by joint processing of signals associated with different antennas, the pilot overhead can be reduced under the framework of the FRI theory.
Parallel Toolkit for Measuring the Quality of Network Community Structure
Venue: arXiv cs.SI 2015
Year: 2015

Many networks display community structure which identifies groups of nodes within which connections are denser than between them. Detecting and characterizing such community structure, which is known as community detection, is one of the fundamental issues in the study of network systems. It has received a considerable attention in the last years. Numerous techniques have been developed for both efficient and effective community detection. Among them, the most efficient algorithm is the label propagation algorithm whose computational complexity is O(|E|). Although it is linear in the number of edges, the running time is still too long for very large networks, creating the need for parallel community detection. Also, computing community quality metrics for community structure is computationally expensive both with and without ground truth. However, to date we are not aware of any effort to introduce parallelism for this problem. In this paper, we provide a parallel toolkit to calculate the values of such metrics. We evaluate the parallel algorithms on both distributed memory machine and shared memory machine. The experimental results show that they yield a significant performance gain over sequential execution in terms of total running time, speedup, and efficiency.
A survey of P2P multidimensional indexing structures
Venue: arXiv cs.DC 2015
Year: 2015

Traditional databases have long since reaped the benefits of multidimensional indexes. Numerous proposals in the literature describe multidimensional index designs for P2P systems. However, none of these designs have had real world implementations. Several proposals for P2P multidimensional indexes are reviewed and analyzed. Znet and VBI-tree are the most promising from a technical standpoint. All of the proposed designs assume honest nodes and are thus open to abuse. This is a critical flaw that must be solved before any of the proposed systems can be used.
Clustering Tree-structured Data on Manifold
Venue: arXiv cs.CV 2015
Year: 2015

Tree-structured data usually contain both topological and geometrical information, and are necessarily considered on manifold instead of Euclidean space for appropriate data parameterization and analysis. In this study, we propose a novel tree-structured data parameterization, called Topology-Attribute matrix (T-A matrix), so the data clustering task can be conducted on matrix manifold. We incorporate the structure constraints embedded in data into the negative matrix factorization method to determine meta-trees from the T-A matrix, and the signature vector of each single tree can then be extracted by meta-tree decomposition. The meta-tree space turns out to be a cone space, in which we explore the distance metric and implement the clustering algorithm based on the concepts like Fréchet mean. Finally, the T-A matrix based clustering (TAMBAC) framework is evaluated and compared using both simulated data and real retinal images to illustrate its efficiency and accuracy.
Maximizing electrical power supply using FACTS devices
Venue: arXiv cs.SY 2015
Year: 2015

Modern society critically depends on the services electric power provides. Power systems rely on a network of power lines and transformers to deliver power from sources of power (generators) to the consumers (loads). However, when power lines fail (for example, through lightning or natural disasters) or when the system is heavily used, the network is often unable to fulfill all of the demand for power. While systems are vulnerable to these failures, increasingly, sophisticated control devices are being deployed to improve the efficiency of power systems. Such devices can also be used to improve the resiliency of power systems to failures. In this paper, we focus on using FACTS devices in this context. A FACTS device allows power grid operators to adjust the impedance parameters of power lines, thereby redistributing flow in the network and potentially increasing the amount of power that is supplied. Here we develop new approaches for determining the optimal parameter settings for FACTS devices in order to supply the maximal amount of power when networks are stressed, e.g. power line failures and heavy utilization.
Joint Optimal Number of RF chains and Power Allocation for Downlink Massive MIMO Systems
Venue: arXiv cs.IT 2015
Year: 2015

This paper investigates the downlink of massive multiple-input multiple-output (MIMO) systems that include a single cell Base Station (BS) equipped with large number of antennas serving multiple users. As the number of RF chains is getting large, the system model considered in this paper assumes a non negligible circuit power consumption. Hence, the aim of this work is to find the optimal balance between the power consumed by the RF chains and the transmitted power. First, assuming an equal power allocation among users, the optimal number of RF chains to be activated is analytically found. Then, for a given number of RF chains we derive analytically the optimal power allocation among users. Based on these analysis, we propose an iterative algorithm that computes jointly the optimal number of RF chains and the optimal power allocation vector. Simulations validate the analytical results and show the high performance provided by the proposed algorithm.