OpenRaiser/Intern-Atlas huggingface dataset:
Preamble-based Channel Estimation in FBMC/OQAM Systems: A Time-Domain Approach
Venue: arXiv cs.IT 2014
Year: 2014

Filter bank-based multicarrier (FBMC) systems based on offset QAM (FBMC/OQAM) have recently attracted increased interest in several applications due to their enhanced flexibility, higher spectral efficiency, and better spectral containment compared to conventional OFDM. They suffer, however, from an inter-carrier/inter-symbol interference that complicates signal processing tasks such as channel estimation. Most of the methods reported thus far rely on the assumption of (almost) flat subchannels to more easily tackle this problem, addressing it in a way similar to OFDM. However, this assumption may be often quite inaccurate, due to the high freq. selectivity of the channel and/or the small number of subcarriers employed to cope with frequency dispersion in fast fading. In such cases, severe error floors are exhibited at medium to high SNR values, which cancel the advantage of FBMC over OFDM. Moreover, the existing methods provide estimates of the subchannel responses, most commonly in the frequency domain. The goal of this paper is to revisit this problem through an alternative formulation that focuses on the estimation of the channel impulse response itself and makes no assumption on the degree of frequency selectivity of the subchannels. The possible gains in estimation performance offered by such an approach are investigated through the design of optimal (in the MSE sense) preambles, of both the full and sparse types, and of the smallest possible duration of only one pilot FBMC symbol. Existing designs for flat subchannels are then shown to result as special cases. Longer preambles, consisting of two consecutive pilot FBMC symbols, are also analyzed. The simulation results demonstrate significant improvements from the proposed approach for both mildly and highly frequency selective channels. Most notably, no error floors appear anymore over a quite wide range of SNR values.
Hierarchical Interference Mitigation for Massive MIMO Cellular Networks
Venue: arXiv cs.IT 2014
Year: 2014

We propose a hierarchical interference mitigation scheme for massive MIMO cellular networks. The MIMO precoder at each base station (BS) is partitioned into an inner precoder and an outer precoder. The inner precoder controls the intra-cell interference and is adaptive to local channel state information (CSI) at each BS (CSIT). The outer precoder controls the inter-cell interference and is adaptive to channel statistics. Such hierarchical precoding structure reduces the number of pilot symbols required for CSI estimation in massive MIMO downlink and is robust to the backhaul latency. We study joint optimization of the outer precoders, the user selection, and the power allocation to maximize a general concave utility which has no closed-form expression. We first apply random matrix theory to obtain an approximated problem with closed-form objective. We show that the solution of the approximated problem is asymptotically optimal with respect to the original problem as the number of antennas per BS grows large. Then using the hidden convexity of the problem, we propose an iterative algorithm to find the optimal solution for the approximated problem. We also obtain a low complexity algorithm with provable convergence. Simulations show that the proposed design has significant gain over various state-of-the-art baselines.
Proximity-Aware Calculation of Cable Series Impedance for Systems of Solid and Hollow Conductors
Venue: arXiv cs.CE 2014
Year: 2014

Wide-band cable models for the prediction of electromagnetic transients in power systems require the accurate calculation of the cable series impedance as function of frequency. A surface current approach was recently proposed for systems of round solid conductors, with inclusion of skin and proximity effects. In this paper we extend the approach to include tubular conductors, allowing to model realistic cables with tubular sheaths, armors and pipes. We also include the effect of a lossy ground. A noteworthy feature of the proposed technique is the accurate prediction of proximity effects, which can be of major importance in three-phase, pipe type, and closely-packed single-core cables. The new approach is highly efficient compared to finite elements. In the case of a cross-bonded cable system featuring three phase conductors and three screens, the proposed technique computes the required 120 frequency samples in only six seconds of CPU time.
Quantifying Long-Term Scientific Impact
Venue: arXiv cs.DL 2014
Year: 2014

The lack of predictability of citation-based measures frequently used to gauge impact, from impact factors to short-term citations, raises a fundamental question: Is there long-term predictability in citation patterns? Here, we derive a mechanistic model for the citation dynamics of individual papers, allowing us to collapse the citation histories of papers from different journals and disciplines into a single curve, indicating that all papers tend to follow the same universal temporal pattern. The observed patterns not only help us uncover basic mechanisms that govern scientific impact but also offer reliable measures of influence that may have potential policy implications.
Distributed Inference with M-ary Quantized Data in the Presence of Byzantine Attacks
Venue: arXiv cs.IT 2014
Year: 2014

The problem of distributed inference with M-ary quantized data at the sensors is investigated in the presence of Byzantine attacks. We assume that the attacker does not have knowledge about either the true state of the phenomenon of interest, or the quantization thresholds used at the sensors. Therefore, the Byzantine nodes attack the inference network by modifying modifying the symbol corresponding to the quantized data to one of the other M symbols in the quantization alphabet-set and transmitting the false symbol to the fusion center (FC). In this paper, we find the optimal Byzantine attack that blinds any distributed inference network. As the quantization alphabet size increases, a tremendous improvement in the security performance of the distributed inference network is observed. We also investigate the problem of distributed inference in the presence of resource-constrained Byzantine attacks. In particular, we focus our attention on two problems: distributed detection and distributed estimation, when the Byzantine attacker employs a highly-symmetric attack. For both the problems, we find the optimal attack strategies employed by the attacker to maximally degrade the performance of the inference network. A reputation-based scheme for identifying malicious nodes is also presented as the network's strategy to mitigate the impact of Byzantine threats on the inference performance of the distributed sensor network.
On Localization of A Non-Cooperative Target with Non-Coherent Binary Detectors
Venue: arXiv cs.IT 2014
Year: 2014

Localization of a non-cooperative target with binary detectors is considered. A general expression for the Fisher information for estimation of target location and power is developed. This general expression is then used to derive closed-form approximations for the Cramer-Rao bound for the case of non-coherent detectors. Simulations show that the approximations are quite consistent with the exact bounds.
Global registration of multiple point clouds using semidefinite programming
Venue: arXiv cs.CV 2014
Year: 2014

Consider $N$ points in $\mathbb{R}^d$ and $M$ local coordinate systems that are related through unknown rigid transforms. For each point we are given (possibly noisy) measurements of its local coordinates in some of the coordinate systems. Alternatively, for each coordinate system, we observe the coordinates of a subset of the points. The problem of estimating the global coordinates of the $N$ points (up to a rigid transform) from such measurements comes up in distributed approaches to molecular conformation and sensor network localization, and also in computer vision and graphics. The least-squares formulation of this problem, though non-convex, has a well known closed-form solution when $M=2$ (based on the singular value decomposition). However, no closed form solution is known for $M\geq 3$. In this paper, we demonstrate how the least-squares formulation can be relaxed into a convex program, namely a semidefinite program (SDP). By setting up connections between the uniqueness of this SDP and results from rigidity theory, we prove conditions for exact and stable recovery for the SDP relaxation. In particular, we prove that the SDP relaxation can guarantee recovery under more adversarial conditions compared to earlier proposed spectral relaxations, and derive error bounds for the registration error incurred by the SDP relaxation. We also present results of numerical experiments on simulated data to confirm the theoretical findings. We empirically demonstrate that (a) unlike the spectral relaxation, the relaxation gap is mostly zero for the semidefinite program (i.e., we are able to solve the original non-convex least-squares problem) up to a certain noise threshold, and (b) the semidefinite program performs significantly better than spectral and manifold-optimization methods, particularly at large noise levels.
Affect Control Processes: Intelligent Affective Interaction using a Partially Observable Markov Decision Process
Venue: arXiv cs.HC 2014
Year: 2014

This paper describes a novel method for building affectively intelligent human-interactive agents. The method is based on a key sociological insight that has been developed and extensively verified over the last twenty years, but has yet to make an impact in artificial intelligence. The insight is that resource bounded humans will, by default, act to maintain affective consistency. Humans have culturally shared fundamental affective sentiments about identities, behaviours, and objects, and they act so that the transient affective sentiments created during interactions confirm the fundamental sentiments. Humans seek and create situations that confirm or are consistent with, and avoid and supress situations that disconfirm or are inconsistent with, their culturally shared affective sentiments. This "affect control principle" has been shown to be a powerful predictor of human behaviour. In this paper, we present a probabilistic and decision-theoretic generalisation of this principle, and we demonstrate how it can be leveraged to build affectively intelligent artificial agents. The new model, called BayesAct, can maintain multiple hypotheses about sentiments simultaneously as a probability distribution, and can make use of an explicit utility function to make value-directed action choices. This allows the model to generate affectively intelligent interactions with people by learning about their identity, predicting their behaviours using the affect control principle, and taking actions that are simultaneously goal-directed and affect-sensitive. We demonstrate this generalisation with a set of simulations. We then show how our model can be used as an emotional "plug-in" for artificially intelligent systems that interact with humans in two different settings: an exam practice assistant (tutor) and an assistive device for persons with a cognitive disability.
Proteus: A Hierarchical Portfolio of Solvers and Transformations
Venue: arXiv cs.AI 2014
Year: 2014

In recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common. There are also a number of different encodings for representing CSPs as SAT instances. In this paper, we leverage advances in both SAT and CSP solving to present a novel hierarchical portfolio-based approach to CSP solving, which we call Proteus, that does not rely purely on CSP solvers. Instead, it may decide that it is best to encode a CSP problem instance into SAT, selecting an appropriate encoding and a corresponding SAT solver. Our experimental evaluation used an instance of Proteus that involved four CSP solvers, three SAT encodings, and six SAT solvers, evaluated on the most challenging problem instances from the CSP solver competitions, involving global and intensional constraints. We show that significant performance improvements can be achieved by Proteus obtained by exploiting alternative view-points and solvers for combinatorial problem-solving.
Comparison of the Achievable Rates in OFDM and Single Carrier Modulation with I.I.D. Inputs
Venue: arXiv cs.IT 2014
Year: 2014

We compare the maximum achievable rates in single-carrier and OFDM modulation schemes, under the practical assumptions of i.i.d. finite alphabet inputs and linear ISI with additive Gaussian noise. We show that the Shamai-Laroia approximation serves as a bridge between the two rates: while it is well known that this approximation is often a lower bound on the single-carrier achievable rate, it is revealed to also essentially upper bound the OFDM achievable rate. We apply Information-Estimation relations in order to rigorously establish this result for both general input distributions and to sharpen it for commonly used PAM and QAM constellations. To this end, novel bounds on MMSE estimation of PAM inputs to a scalar Gaussian channel are derived, which may be of general interest. Our results show that, under reasonable assumptions, optimal single-carrier schemes may offer spectral efficiency significantly superior to that of OFDM, motivating further research of such systems.
Fourier PCA and Robust Tensor Decomposition
Venue: arXiv cs.LG 2014
Year: 2014

Fourier PCA is Principal Component Analysis of a matrix obtained from higher order derivatives of the logarithm of the Fourier transform of a distribution.We make this method algorithmic by developing a tensor decomposition method for a pair of tensors sharing the same vectors in rank-$1$ decompositions. Our main application is the first provably polynomial-time algorithm for underdetermined ICA, i.e., learning an $n \times m$ matrix $A$ from observations $y=Ax$ where $x$ is drawn from an unknown product distribution with arbitrary non-Gaussian components. The number of component distributions $m$ can be arbitrarily higher than the dimension $n$ and the columns of $A$ only need to satisfy a natural and efficiently verifiable nondegeneracy condition. As a second application, we give an alternative algorithm for learning mixtures of spherical Gaussians with linearly independent means. These results also hold in the presence of Gaussian noise.
Dynamic Computing Random Access Memory
Venue: arXiv cs.ET 2014
Year: 2014

The present von Neumann computing paradigm involves a significant amount of information transfer between a central processing unit (CPU) and memory, with concomitant limitations in the actual execution speed. However, it has been recently argued that a different form of computation, dubbed memcomputing [Nature Physics, 9, 200-202 (2013)] and inspired by the operation of our brain, can resolve the intrinsic limitations of present day architectures by allowing for computing and storing of information on the same physical platform. Here we show a simple and practical realization of memcomputing that utilizes easy-to-build memcapacitive systems. We name this architecture Dynamic Computing Random Access Memory (DCRAM). We show that DCRAM provides massively-parallel and polymorphic digital logic, namely it allows for different logic operations with the same architecture, by varying only the control signals. In addition, by taking into account realistic parameters, its energy expenditures can be as low as a few fJ per operation. DCRAM is fully compatible with CMOS technology, can be realized with current fabrication facilities, and therefore can really serve as an alternative to the present computing technology.
Inference of Field-Sensitive Reachability and Cyclicity
Venue: arXiv cs.PL 2014
Year: 2014

In heap-based languages, knowing that a variable x points to an acyclic data structure is useful for analyzing termination: this information guarantees that the depth of the data structure to which x points is greater than the depth of the structure pointed to by x.fld, and allows bounding the number of iterations of a loop which traverses the data structure on fld. In general, proving termination needs acyclicity, unless program-specific or non-automated reasoning is performed. However, recent work could prove that certain loops terminate even without inferring acyclicity, because they traverse data structures "acyclically". Consider a double-linked list: if it is possible to demonstrate that every cycle involves both the "next" and the "prev" field, then a traversal on "next" terminates since no cycle will be traversed completely. This paper develops a static analysis inferring field-sensitive reachability and cyclicity information, which is more general than existing approaches. Propositional formulae are computed, which describe which fields may or may not be traversed by paths in the heap. Consider a tree with edges "left" and "right" to the left and right sub-trees, and "parent" to the parent node: termination of a loop traversing leaf-up cannot be guaranteed by state-of-the-art analyses. Instead, propositional formulae computed by this analysis indicate that cycles must traverse "parent" and at least one between "left" and "right": termination is guaranteed as no cycle is traversed completely. This paper defines the necessary abstract domains and builds an abstract semantics on them. A prototypical implementation provides the expected result on relevant examples.
Earthquake Disaster based Efficient Resource Utilization Technique in IaaS Cloud
Venue: arXiv cs.DC 2014
Year: 2014

Cloud Computing is an emerging area. The main aim of the initial search-and-rescue period after strong earthquakes is to reduce the whole number of mortalities. One main trouble rising in this period is to and the greatest assignment of available resources to functioning zones. For this issue a dynamic optimization model is presented. The model uses thorough descriptions of the operational zones and of the available resources to determine the resource performance and efficiency for different workloads related to the response. A suitable solution method for the model is offered as well. In this paper, Earthquake Disaster Based Resource Scheduling (EDBRS) Framework has been proposed. The allocation of resources to cloud workloads based on urgency (emergency during Earthquake Disaster). Based on this criterion, the resource scheduling algorithm has been proposed. The performance of the proposed algorithm has been assessed with the existing common scheduling algorithms through the CloudSim. The experimental results show that the proposed algorithm outperforms the existing algorithms by reducing execution cost and time of cloud consumer workloads submitted to the cloud.
Controllability Analysis and Degraded Control for a Class of Hexacopters Subject to Rotor Failures
Venue: arXiv cs.SY 2014
Year: 2014

This paper considers the controllability analysis and fault tolerant control problem for a class of hexacopters. It is shown that the considered hexacopter is uncontrollable when one rotor fails, even though the hexacopter is over-actuated and its controllability matrix is row full rank. According to this, a fault tolerant control strategy is proposed to control a degraded system, where the yaw states of the considered hexacopter are ignored. Theoretical analysis indicates that the degraded system is controllable if and only if the maximum lift of each rotor is greater than a certain value. The simulation and experiment results on a prototype hexacopter show the feasibility of our controllability analysis and degraded control strategy.
The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2
Venue: arXiv cs.CC 2014
Year: 2014

A homomorphism from a graph G to a graph H is a function from V(G) to V(H) that preserves edges. Many combinatorial structures that arise in mathematics and computer science can be represented naturally as graph homomorphisms and as weighted sums of graph homomorphisms. In this paper, we study the complexity of counting homomorphisms modulo 2. The complexity of modular counting was introduced by Papadimitriou and Zachos and it has been pioneered by Valiant who famously introduced a problem for which counting modulo 7 is easy but counting modulo 2 is intractable. Modular counting provides a rich setting in which to study the structure of homomorphism problems. In this case, the structure of the graph H has a big influence on the complexity of the problem. Thus, our approach is graph-theoretic. We give a complete solution for the class of cactus graphs, which are connected graphs in which every edge belongs to at most one cycle. Cactus graphs arise in many applications such as the modelling of wireless sensor networks and the comparison of genomes. We show that, for some cactus graphs H, counting homomorphisms to H modulo 2 can be done in polynomial time. For every other fixed cactus graph H, the problem is complete for the complexity class parity-P which is a wide complexity class to which every problem in the polynomial hierarchy can be reduced (using randomised reductions). Determining which H lead to tractable problems can be done in polynomial time. Our result builds upon the work of Faben and Jerrum, who gave a dichotomy for the case in which H is a tree.
A Unified Framework of Elementary Geometric Transformation Representation
Venue: arXiv cs.CV 2014
Year: 2014

As an extension of projective homology, stereohomology is proposed via an extension of Desargues theorem and the extended Desargues configuration. Geometric transformations such as reflection, translation, central symmetry, central projection, parallel projection, shearing, central dilation, scaling, and so on are all included in stereohomology and represented as Householder-Chen elementary matrices. Hence all these geometric transformations are called elementary. This makes it possible to represent these elementary geometric transformations in homogeneous square matrices independent of a particular choice of coordinate system.
Efficient Probabilistic Group Testing Based on Traitor Tracing
Venue: arXiv cs.IT 2014
Year: 2014

Inspired by recent results from collusion-resistant traitor tracing, we provide a framework for constructing efficient probabilistic group testing schemes. In the traditional group testing model, our scheme asymptotically requires T ~ 2 K ln N tests to find (with high probability) the correct set of K defectives out of N items. The framework is also applied to several noisy group testing and threshold group testing models, often leading to improvements over previously known results, but we emphasize that this framework can be applied to other variants of the classical model as well, both in adaptive and in non-adaptive settings.