OpenRaiser/Intern-Atlas huggingface dataset:
On Spectral Coexistence of CP-OFDM and FB-MC Waveforms in 5G Networks
Venue: arXiv cs.IT 2017
Year: 2017

Future 5G networks will serve a variety of applications that will coexist on the same spectral band and geographical area, in an uncoordinated and asynchronous manner. It is widely accepted that using CP-OFDM, the waveform used by most current communication systems, will make it difficult to achieve this paradigm. Especially, CP-OFDM is not adapted for spectral coexistence because of its poor spectral localization. Therefore, it has been widely suggested to use filter bank based multi carrier (FB-MC) waveforms with enhanced spectral localization to replace CP-OFDM. Especially, FB-MC waveforms are expected to facilitate coexistence with legacy CP-OFDM based systems. However, this idea is based on the observation of the PSD of FB-MC waveforms only. In this paper, we demonstrate that this approach is flawed and show what metric should be used to rate interference between FB-MC and CP-OFDM systems. Finally, our results show that using FB-MC waveforms does not facilitate coexistence with CP-OFDM based systems to a high extent.
Adaptive 360 VR Video Streaming based on MPEG-DASH SRD
Venue: arXiv cs.MM 2017
Year: 2017

We demonstrate an adaptive bandwidth-efficient 360 VR video streaming system based on MPEG-DASH SRD. We extend MPEG-DASH SRD to the 3D space of 360 VR videos, and showcase a dynamic view-aware adaptation technique to tackle the high bandwidth demands of streaming 360 VR videos to wireless VR headsets. We spatially partition the underlying 3D mesh into multiple 3D sub-meshes, and construct an efficient 3D geometry mesh called hexaface sphere to optimally represent tiled 360 VR videos in the 3D space. We then spatially divide the 360 videos into multiple tiles while encoding and packaging, use MPEG-DASH SRD to describe the spatial relationship of tiles in the 3D space, and prioritize the tiles in the Field of View (FoV) for view-aware adaptation. Our initial evaluation results show that we can save up to 72% of the required bandwidth on 360 VR video streaming with minor negative quality impacts compared to the baseline scenario when no adaptations is applied.
A Practical Randomized CP Tensor Decomposition
Venue: arXiv cs.NA 2017
Year: 2017

The CANDECOMP/PARAFAC (CP) decomposition is a leading method for the analysis of multiway data. The standard alternating least squares algorithm for the CP decomposition (CP-ALS) involves a series of highly overdetermined linear least squares problems. We extend randomized least squares methods to tensors and show the workload of CP-ALS can be drastically reduced without a sacrifice in quality. We introduce techniques for efficiently preprocessing, sampling, and computing randomized least squares on a dense tensor of arbitrary order, as well as an efficient sampling-based technique for checking the stopping condition. We also show more generally that the Khatri-Rao product (used within the CP-ALS iteration) produces conditions favorable for direct sampling. In numerical results, we see improvements in speed, reductions in memory requirements, and robustness with respect to initialization.
Identifying Nonlinear 1-Step Causal Influences in Presence of Latent Variables
Venue: arXiv cs.IT 2017
Year: 2017

We propose an approach for learning the causal structure in stochastic dynamical systems with a $1$-step functional dependency in the presence of latent variables. We propose an information-theoretic approach that allows us to recover the causal relations among the observed variables as long as the latent variables evolve without exogenous noise. We further propose an efficient learning method based on linear regression for the special sub-case when the dynamics are restricted to be linear. We validate the performance of our approach via numerical simulations.
Space-Time Graph Modeling of Ride Requests Based on Real-World Data
Venue: arXiv cs.AI 2017
Year: 2017

This paper focuses on modeling ride requests and their variations over location and time, based on analyzing extensive real-world data from a ride-sharing service. We introduce a graph model that captures the spatial and temporal variability of ride requests and the potentials for ride pooling. We discover these ride request graphs exhibit a well known property called densification power law often found in real graphs modelling human behaviors. We show the pattern of ride requests and the potential of ride pooling for a city can be characterized by the densification factor of the ride request graphs. Previous works have shown that it is possible to automatically generate synthetic versions of these graphs that exhibit a given densification factor. We present an algorithm for automatic generation of synthetic ride request graphs that match quite well the densification factor of ride request graphs from actual ride request data.
Generalized Gray codes with prescribed ends of small dimensions
Venue: arXiv cs.DM 2017
Year: 2017

Given pairwise distinct vertices $\{α_i , β_i\}^k_{i=1}$ of the $n$-dimensional hypercube $Q_n$ such that the distance of $α_i$ and $β_i$ is odd, are there paths $P_i$ between $α_i$ and $β_i$ such that $\{V (P_i)\}^k_{i=1}$ partitions $V(Q_n)$? A positive solution for every $n\ge1$ and $k=1$ is known as a Gray code of dimension $n$. In this paper we settle this problem for small values of $n$.
A graph cut approach to 3D tree delineation, using integrated airborne LiDAR and hyperspectral imagery
Venue: arXiv cs.CV 2017
Year: 2017

Recognising individual trees within remotely sensed imagery has important applications in forest ecology and management. Several algorithms for tree delineation have been suggested, mostly based on locating local maxima or inverted basins in raster canopy height models (CHMs) derived from Light Detection And Ranging (LiDAR) data or photographs. However, these algorithms often lead to inaccurate estimates of forest stand characteristics due to the limited information content of raster CHMs. Here we develop a 3D tree delineation method which uses graph cut to delineate trees from the full 3D LiDAR point cloud, and also makes use of any optical imagery available (hyperspectral imagery in our case). First, conventional methods are used to locate local maxima in the CHM and generate an initial map of trees. Second, a graph is built from the LiDAR point cloud, fused with the hyperspectral data. For computational efficiency, the feature space of hyperspectral imagery is reduced using robust PCA. Third, a multi-class normalised cut is applied to the graph, using the initial map of trees to constrain the number of clusters and their locations. Finally, recursive normalised cut is used to subdivide, if necessary, each of the clusters identified by the initial analysis. We call this approach Multiclass Cut followed by Recursive Cut (MCRC). The effectiveness of MCRC was tested using three datasets: i) NewFor, ii) a coniferous forest in the Italian Alps, and iii) a deciduous woodland in the UK. The performance of MCRC was usually superior to that of other delineation methods, and was further improved by including high-resolution optical imagery. Since MCRC delineates the entire LiDAR point cloud in 3D, it allows individual crown characteristics to be measured. By making full use of the data available, graph cut has the potential to considerably improve the accuracy of tree delineation.
Cache-Aided Heterogeneous Networks: Coverage and Delay Analysis
Venue: arXiv cs.IT 2017
Year: 2017

This paper characterizes the performance of a generic $K$-tier cache-aided heterogeneous network (CHN), in which the base stations (BSs) across tiers differ in terms of their spatial densities, transmission powers, pathloss exponents, activity probabilities conditioned on the serving link and placement caching strategies. We consider that each user connects to the BS which maximizes its average received power and at the same time caches its file of interest. Modeling the locations of the BSs across different tiers as independent homogeneous Poisson Point processes (HPPPs), we derive closed-form expressions for the coverage probability and local delay experienced by a typical user in receiving each requested file. We show that our results for coverage probability and delay are consistent with those previously obtained in the literature for a single tier system.
Reasoning about Probabilistic Defense Mechanisms against Remote Attacks
Venue: arXiv cs.CR 2017
Year: 2017

Despite numerous countermeasures proposed by practitioners and researchers, remote control-flow alteration of programs with memory-safety vulnerabilities continues to be a realistic threat. Guaranteeing that complex software is completely free of memory-safety vulnerabilities is extremely expensive. Probabilistic countermeasures that depend on random secret keys are interesting, because they are an inexpensive way to raise the bar for attackers who aim to exploit memory-safety vulnerabilities. Moreover, some countermeasures even support legacy systems. However, it is unclear how to quantify and compare the effectiveness of different probabilistic countermeasures or combinations of such countermeasures. In this paper we propose a methodology to rigorously derive security bounds for probabilistic countermeasures. We argue that by representing security notions in this setting as events in probabilistic games, similarly as done with cryptographic security definitions, concrete and asymptotic guarantees can be obtained against realistic attackers. These guarantees shed light on the effectiveness of single countermeasures and their composition and allow practitioners to more precisely gauge the risk of an attack.
Collective Vertex Classification Using Recursive Neural Network
Venue: arXiv cs.LG 2017
Year: 2017

Collective classification of vertices is a task of assigning categories to each vertex in a graph based on both vertex attributes and link structure. Nevertheless, some existing approaches do not use the features of neighbouring vertices properly, due to the noise introduced by these features. In this paper, we propose a graph-based recursive neural network framework for collective vertex classification. In this framework, we generate hidden representations from both attributes of vertices and representations of neighbouring vertices via recursive neural networks. Under this framework, we explore two types of recursive neural units, naive recursive neural unit and long short-term memory unit. We have conducted experiments on four real-world network datasets. The experimental results show that our frame- work with long short-term memory model achieves better results and outperforms several competitive baseline methods.
Analysis of Breakdown Probability of Wireless Sensor Networks with Unreliable Relay Nodes
Venue: arXiv cs.IT 2017
Year: 2017

In the present paper, we derive an upper bound of the average network breakdown probability of packet networks with unreliable relay nodes. We here assume that relay nodes get independently broken with a given node breakdown probability. A survivor graph is the induced subgraph obtained by removing the broken relay nodes and their connecting edges from the original graph. If the survivor network is disconnected, we consider a network breakdown happens. The primal contribution of the paper is to derive an upper bound of the average network breakdown probability, where the expectation is taken over a regular graph ensemble. The proof of the bound is based on a natural one-to-one correspondence between a regular graph and a regular bipartite graph, and also on enumeration of bipartite graphs satisfying certain conditions. This proof argument is inspired by the analysis of weight distribution for low-density parity-check codes. Compared with estimates of the average network breakdown probability obtained by computer experiments, it is observed that the upper bound provides the values which are not only upper bounds but also precise estimates of the network breakdown probability when the node breakdown probability is small.
Graph Analytics for anomaly detection in homogeneous wireless networks - A Simulation Approach
Venue: arXiv cs.CR 2017
Year: 2017

In the Internet of Things (IoT) devices are exposed to various kinds of attacks when connected to the Internet. An attack detection mechanism that understands the limitations of these severely resource-constrained devices is necessary. This is important since current approaches are either customized for wireless networks or for the conventional Internet with heavy data transmission. Also, the detection mechanism need not always be as sophisticated. Simply signaling that an attack is taking place may be enough in some situations, for example in NIDS using anomaly detection. In graph networks, central nodes are the nodes that bear the most influence in the network. The purpose of this research is to explore experimentally the relationship between the behavior of central nodes and anomaly detection when an attack spreads through a network. As a result, we propose a novel anomaly detection approach using this unique methodology which has been unexplored so far in communication networks. Also, in the experiment, we identify presence of an attack originating and propagating throughout a network of IoT using our methodology.
Sparse models for Computer Vision
Venue: arXiv cs.CV 2017
Year: 2017

The representation of images in the brain is known to be sparse. That is, as neural activity is recorded in a visual area ---for instance the primary visual cortex of primates--- only a few neurons are active at a given time with respect to the whole population. It is believed that such a property reflects the efficient match of the representation with the statistics of natural scenes. Applying such a paradigm to computer vision therefore seems a promising approach towards more biomimetic algorithms. Herein, we will describe a biologically-inspired approach to this problem. First, we will describe an unsupervised learning paradigm which is particularly adapted to the efficient coding of image patches. Then, we will outline a complete multi-scale framework ---SparseLets--- implementing a biologically inspired sparse representation of natural images. Finally, we will propose novel methods for integrating prior information into these algorithms and provide some preliminary experimental results. We will conclude by giving some perspective on applying such algorithms to computer vision. More specifically, we will propose that bio-inspired approaches may be applied to computer vision using predictive coding schemes, sparse models being one simple and efficient instance of such schemes.
Reconstruction of Correlated Sources with Energy Harvesting Constraints in Delay-constrained and Delay-tolerant Communication Scenarios
Venue: arXiv cs.IT 2017
Year: 2017

In this paper, we investigate the reconstruction of time-correlated sources in a point-to-point communications scenario comprising an energy-harvesting sensor and a Fusion Center (FC). Our goal is to minimize the average distortion in the reconstructed observations by using data from previously encoded sources as side information. First, we analyze a delay-constrained scenario, where the sources must be reconstructed before the next time slot. We formulate the problem in a convex optimization framework and derive the optimal transmission (i.e., power and rate allocation) policy. To solve this problem, we propose an iterative algorithm based on the subgradient method. Interestingly, the solution to the problem consists of a coupling between a two-dimensional directional water-filling algorithm (for power allocation) and a reverse water-filling algorithm (for rate allocation). Then we find a more general solution to this problem in a delay-tolerant scenario where the time horizon for source reconstruction is extended to multiple time slots. Finally, we provide some numerical results that illustrate the impact of delay and correlation in the power and rate allocation policies, and in the resulting reconstruction distortion. We also discuss the performance gap exhibited by a heuristic online policy derived from the optimal (offline) one.
Multi-Layer Generalized Linear Estimation
Venue: arXiv cs.IT 2017
Year: 2017

We consider the problem of reconstructing a signal from multi-layered (possibly) non-linear measurements. Using non-rigorous but standard methods from statistical physics we present the Multi-Layer Approximate Message Passing (ML-AMP) algorithm for computing marginal probabilities of the corresponding estimation problem and derive the associated state evolution equations to analyze its performance. We also give the expression of the asymptotic free energy and the minimal information-theoretically achievable reconstruction error. Finally, we present some applications of this measurement model for compressed sensing and perceptron learning with structured matrices/patterns, and for a simple model of estimation of latent variables in an auto-encoder.
Validation of Internal Meters of Mobile Android Devices
Venue: arXiv cs.OH 2017
Year: 2017

In this paper we outline our results for validating the precision of the internal power meters of smart-phones under different workloads. We compare its results with an external power meter. This is the first step towards creating customized energy models on the fly and towards optimizing battery efficiency using genetic program improvements. Our experimental results indicate that the internal meters are sufficiently precise when large enough time windows are considered. This is part of our work on the "dreaming smart-phone". For a technical demonstration please watch our videos https://www.youtube.com/watch?v=xeeFz2GLFdU and https://www.youtube.com/watch?v=C7WHoLW1KYw.
A novel alternative to Cloud RAN for throughput densification: Coded pilots and fast user-packet scheduling at remote radio heads
Venue: arXiv cs.IT 2017
Year: 2017

We consider wireless networks of remote radio heads (RRH) with large antenna-arrays, operated in TDD, with uplink (UL) training and channel-reciprocity based downlink (DL) transmission. To achieve large area spectral efficiencies, we advocate the use of methods that rely on rudimentary scheduling, decentralized operation at each RRH and user-centric DL transmission. A slotted system is assumed, whereby users are randomly scheduled (e.g., via shuffled round robin) in slots and across the limited pilot dimensions per slot. As a result, multiple users in the vicinity of an RRH can simultaneously transmit pilots on the same pilot dimension (and thus interfering with one another). Each RRH performs rudimentary processing of the pilot observations in "sectors". In a sector, the RRH is able to resolve a scheduled user's channel when that user is determined to be the only one among the scheduled users (on the same pilot dimension) with significant received power in the sector. Subsequently, only the subset of scheduled users whose channels are resolved in at least one sector can be served by the system. We consider a spatially consistent evaluation of the area multiplexing gains by means of a Poisson Point Process (PPP) problem formulation where RRHs, blockers, scatterers and scheduled user terminals are all PPPs with individual intensities. Also, we study directional training at the user terminals. Our simulations suggest that, by controlling the intensity of the scheduled user PPP and the user-pilot beam-width, many fold improvements can be expected in area multiplexing gains with respect to conventional spatial pilot reuse systems.
Repairing Reed-Solomon Codes With Two Erasures
Venue: arXiv cs.IT 2017
Year: 2017

Despite their exceptional error-correcting properties, Reed-Solomon (RS) codes have been overlooked in distributed storage applications due to the common belief that they have poor repair bandwidth: A naive repair approach would require the whole file to be reconstructed in order to recover a single erased codeword symbol. In a recent work, Guruswami and Wootters (STOC'16) proposed a single-erasure repair method for RS codes that achieves the optimal repair bandwidth amongst all linear encoding schemes. We extend their trace collection technique to cope with two erasures.
A Probabilistic Baby-Step Giant-Step Algorithm
Venue: arXiv cs.CR 2017
Year: 2017

In this paper, a new algorithm to solve the discrete logarithm problem is presented which is similar to the usual baby-step giant-step algorithm. Our algorithm exploits the order of the discrete logarithm in the multiplicative group of a finite field. Using randomization with parallelized collision search, our algorithm indicates some weakness in NIST curves over prime fields which are considered to be the most conservative and safest curves among all NIST curves.
Multi-Block Interleaved Codes for Local and Global Read Access
Venue: arXiv cs.IT 2017
Year: 2017

We define multi-block interleaved codes as codes that allow reading information from either a small sub-block or from a larger full block. The former offers faster access, while the latter provides better reliability. We specify the correction capability of the sub-block code through its gap $t$ from optimal minimum distance, and look to have full-block minimum distance that grows with the parameter $t$. We construct two families of such codes when the number of sub-blocks is $3$. The codes match the distance properties of known integrated-interleaving codes, but with the added feature of mapping the same number of information symbols to each sub-block. As such, they are the first codes that provide read access in multiple size granularities and correction capabilities.
E2M2: Energy Efficient Mobility Management in Dense Small Cells with Mobile Edge Computing
Venue: arXiv cs.NI 2017
Year: 2017

Merging mobile edge computing with the dense deployment of small cell base stations promises enormous benefits such as a real proximity, ultra-low latency access to cloud functionalities. However, the envisioned integration creates many new challenges and one of the most significant is mobility management, which is becoming a key bottleneck to the overall system performance. Simply applying existing solutions leads to poor performance due to the highly overlapped coverage areas of multiple base stations in the proximity of the user and the co-provisioning of radio access and computing services. In this paper, we develop a novel user-centric mobility management scheme, leveraging Lyapunov optimization and multi-armed bandits theories, in order to maximize the edge computation performance for the user while keeping the user's communication energy consumption below a constraint. The proposed scheme effectively handles the uncertainties present at multiple levels in the system and provides both short-term and long-term performance guarantee. Simulation results show that our proposed scheme can significantly improve the computation performance (compared to state of the art) while satisfying the communication energy constraint.
Hadith Web Browser Verification Extension
Venue: arXiv cs.CY 2017
Year: 2017

Internet users are more likely to ignore Internet content verification and more likely to share the content. When it comes to Islamic content, it is crucial to share and spread fake or inaccurate content. Even if the verification process of Islamic content is becoming easier every day, the Internet users generally ignore the verification step and jump into sharing the content. How many clicks away from users results? , this is the common question that is considered as a rule in modern website design. Internet users prefer the results to come to their page rather than to navigate it on their own. This paper presents a simple method of bringing hadith verification to the user web browser using web browser plugin.