OpenRaiser/Intern-Atlas huggingface dataset:
Consider Uncertain Parameters based on Sensitivity Matrix
Venue: arXiv cs.IT 2015
Year: 2015

Uncertain parameters of state-space models have always been a considerable problem. Consider Kalman filter (CKF) and desensitized Kalman filter (DKF) are two methods to solve this problem. Based on the sensitivity matrix respected to the uncertain parameter vector, a special DKF with an analytical gain is given and a new form of the CKF is derived. The mathematical equivalence between the special DKF and the CKF is demonstrated when the sensitivity-weighting matrix is set to the covariance of the uncertain parameter and the problem how to select and obtain the sensitivity-weighting matrix in the DKF is solved.
Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks
Venue: arXiv cs.NI 2015
Year: 2015

In multi-hop wireless networks, flow demands mean that some nodes have routing demands of transmitting their data to other nodes with a certain level of transmission rate. When a set of nodes have been deployed with flow demands, it is worth to know how to construct paths to satisfy these flow demands with nodes placed as few as possible. In this paper, we study this flow demands oriented node placement problem that has not been addressed before. In particular, we divide and conquer the problem by three steps: calculating the maximal flow for single routing demand, calculating the maximal flow for multiple routing demands, and finding the minimal number of nodes for multiple routing demands with flow requirement. During the above solving procedure, we prove that the second and third step are NP-hard and propose two algorithms that have polynomial-time complexity. The proposed algorithms are evaluated under practical scenarios. The experiments show that the proposed algorithms can achieve satisfactory results on both flow demands and total number of wireless nodes.
Full-Duplex Radio for Uplink/Downlink Transmission with Spatial Randomness
Venue: arXiv cs.IT 2015
Year: 2015

We consider a wireless system with a full-duplex (FD) access point (AP) that transmits to a scheduled user in the downlink (DL) channel, while receiving data from an user in the uplink (UL) channel at the same time on the same frequency. In this system, loopback interference (LI) at the AP and inter user interference between the uplink (UL) user and downlink (DL) user can cause performance degradation. In order to characterize the effects of LI and inter user interference, we derive closed-form expressions for the outage probability and achievable sum rate of the system. In addition an asymptotic analysis that reveals insights into the system behavior and performance degradation is presented. Our results indicate that under certain conditions, FD transmissions yield performance gains over half-duplex (HD) mode of operation.
Impact of Residual Transmit RF Impairments on Training-Based MIMO Systems
Venue: arXiv cs.IT 2015
Year: 2015

Radio-frequency (RF) impairments, which intimately exist in wireless communication systems, can severely limit the performance of multiple-input multiple-output (MIMO) systems. Although we can resort to compensation schemes to mitigate part of these impairments, a certain amount of residual impairments always persists. In this paper, we consider a training-based point-to-point MIMO system with residual transmit RF impairments (RTRI) using spatial multiplexing transmission. Specifically, we derive a new linear channel estimator for the proposed model, and show that RTRI create an estimation error floor in the high signal-to-noise ratio (SNR) regime. Moreover, we derive closed-form expressions for the signal-to-noise-and-interference ratio (SINR) distributions, along with analytical expressions for the ergodic achievable rates of zero-forcing, maximum ratio combining, and minimum mean-squared error receivers, respectively. In addition, we optimize the ergodic achievable rates with respect to the training sequence length, and demonstrate that finite dimensional systems with RTRI generally require more training at high SNRs than those with ideal hardware. At last, we extend our analysis to large-scale MIMO configurations, and derive deterministic equivalents of the ergodic achievable rates. It is shown that, by deploying large receive antenna arrays, the extra training requirements due to RTRI can be eliminated. In fact, with sufficiently large number of receive antennas, systems with RTRI may even need less training than systems with ideal hardware.
Investigating the Impact of Metric Aggregation Techniques on Defect Prediction
Venue: arXiv cs.SE 2015
Year: 2015

Code metrics collected at the method level are often aggregated using summation to capture system properties at higher levels (e.g., file- or package-level). Since defect data is often available at these higher levels, this aggregation allows researchers to build defect prediction models. Recent findings by Landman et al. indicate that aggregation is likely to inflate the correlation between size and complexity metrics. In this paper, we explore the effect of nine aggregation techniques on the correlation between three types of code metrics, namely Lines of Code, McCabe, and Halstead metrics. In addition to summation, we study aggregation techniques that are measures of: (1) central tendency (average and median), (2) dispersion (standard deviation and inter-quartile range), (3) shape (skewness and kurtosis), and (4) income inequality (Theil index and Gini coefficient). Our results show that defect prediction models built using summation outperform those built using other aggregation techniques. We also find that more complex aggregations are no different than much simpler ones and that incorporating all aggregation types in the same model does not provide a significant improvement over using summation alone.
A Finite Element Based P3M Method for N-body Problems
Venue: arXiv cs.NA 2015
Year: 2015

We introduce a fast mesh-based method for computing N-body interactions that is both scalable and accurate. The method is founded on a particle-particle--particle-mesh P3M approach, which decomposes a potential into rapidly decaying short-range interactions and smooth, mesh-resolvable long-range interactions. However, in contrast to the traditional approach of using Gaussian screen functions to accomplish this decomposition, our method employs specially designed polynomial bases to construct the screened potentials. Because of this form of the screen, the long-range component of the potential is then solved exactly with a finite element method, leading ultimately to a sparse matrix problem that is solved efficiently with standard multigrid methods. Moreover, since this system represents an exact discretization, the optimal resolution properties of the FFT are unnecessary, though the short-range calculation is now more involved than P3M/PME methods. We introduce the method, analyze its key properties, and demonstrate the accuracy of the algorithm.
Exact bounds of the M{ö}bius inverse of monotone set functions
Venue: arXiv cs.DM 2015
Year: 2015

We give the exact upper and lower bounds of the M{ö}bius inverse of monotone and normalized set functions (a.k.a. normalized capacities) on a finite set of n elements. We find that the absolute value of the bounds tend to 4 n/2 $\sqrt$ $π$n/2 when n is large. We establish also the exact bounds of the interaction transform and Banzhaf interaction transform, as well as the exact bounds of the M{ö}bius inverse for the subfamilies of k-additive normalized capacities and p-symmetric normalized capacities.
Sparse Spikes Deconvolution on Thin Grids
Venue: arXiv cs.IT 2015
Year: 2015

This article analyzes the recovery performance of two popular finite dimensional approximations of the sparse spikes deconvolution problem over Radon measures. We examine in a unified framework both the L1 regularization (often referred to as Lasso or Basis-Pursuit) and the Continuous Basis-Pursuit (C-BP) methods. The Lasso is the de-facto standard for the sparse regularization of inverse problems in imaging. It performs a nearest neighbor interpolation of the spikes locations on the sampling grid. The C-BP method, introduced by Ekanadham, Tranchina and Simoncelli, uses a linear interpolation of the locations to perform a better approximation of the infinite-dimensional optimization problem, for positive measures. We show that, in the small noise regime, both methods estimate twice the number of spikes as the number of original spikes. Indeed, we show that they both detect two neighboring spikes around the locations of an original spikes. These results for deconvolution problems are based on an abstract analysis of the so-called extended support of the solutions of L1-type problems (including as special cases the Lasso and C-BP for deconvolution), which are of an independent interest. They precisely characterize the support of the solutions when the noise is small and the regularization parameter is selected accordingly. We illustrate these findings to analyze for the first time the support instability of compressed sensing recovery when the number of measurements is below the critical limit (well documented in the literature) where the support is provably stable.
Design & Implementation Approach for Error Free Clinical Data Repository for the Medical Practitioners
Venue: arXiv cs.DB 2015
Year: 2015

The modern treatment of any disease is heavily dependent on the medical diagnosis. Clinical data obtained through the diagnostics tests need to be collected and entered into the computer database in order to make a clinical data repository. In most of the cases, manual entry is an absolute necessity. However, manual entry can cause errors also, leading to wrong diagnosis. This paper explains how data could be entered free of error to reduce the chances of wrong diagnosis by designing and implementation of a simple database driven application.
Label-Embedding for Image Classification
Venue: arXiv cs.CV 2015
Year: 2015

Attributes act as intermediate representations that enable parameter sharing between classes, a must when training data is scarce. We propose to view attribute-based image classification as a label-embedding problem: each class is embedded in the space of attribute vectors. We introduce a function that measures the compatibility between an image and a label embedding. The parameters of this function are learned on a training set of labeled samples to ensure that, given an image, the correct classes rank higher than the incorrect ones. Results on the Animals With Attributes and Caltech-UCSD-Birds datasets show that the proposed framework outperforms the standard Direct Attribute Prediction baseline in a zero-shot learning scenario. Label embedding enjoys a built-in ability to leverage alternative sources of information instead of or in addition to attributes, such as e.g. class hierarchies or textual descriptions. Moreover, label embedding encompasses the whole range of learning settings from zero-shot learning to regular learning with a large number of labeled examples.
On the Sizes of DPDAs, PDAs, LBAs
Venue: arXiv cs.FL 2015
Year: 2015

There are languages A such that there is a Pushdown Automata (PDA) that recognizes A which is much smaller than any Deterministic Pushdown Automata (DPDA) that recognizes A. There are languages A such that there is a Linear Bounded Automata (Linear Space Turing Machine, henceforth LBA) that recognizes A which is much smaller than ny PDA that recognizes A. There are languages A such that both A and compliment(A) are recognizable by a PDA, but the PDA for A is much smaller than the PDA for compliment(A). There are languages A1, A2 such that A1,A2,A1 INTERSECT A_2 are recognizable by a PDA, but the PDA for A1 and A2 are much smaller than the PDA for A1 INTERSECT A2. We investigate these phenomenon and show that, in all these cases, the size difference is captured by a function whose Turing degree is on the second level of the arithmetic hierarchy. Our theorems lead to infinitely-often results. For example: for infinitely many $n$ there exists a language An recognized by a DPDA such that there is a small PDA for An, but any DPDA for An is large. We look at cases where we can get almost-all results, though with much smaller size differences.
Reconciling saliency and object center-bias hypotheses in explaining free-viewing fixations
Venue: arXiv cs.CV 2015
Year: 2015

Predicting where people look in natural scenes has attracted a lot of interest in computer vision and computational neuroscience over the past two decades. Two seemingly contrasting categories of cues have been proposed to influence where people look: \textit{low-level image saliency} and \textit{high-level semantic information}. Our first contribution is to take a detailed look at these cues to confirm the hypothesis proposed by Henderson~\cite{henderson1993eye} and Nuthmann \& Henderson~\cite{nuthmann2010object} that observers tend to look at the center of objects. We analyzed fixation data for scene free-viewing over 17 observers on 60 fully annotated images with various types of objects. Images contained different types of scenes, such as natural scenes, line drawings, and 3D rendered scenes. Our second contribution is to propose a simple combined model of low-level saliency and object center-bias that outperforms each individual component significantly over our data, as well as on the OSIE dataset by Xu et al.~\cite{xu2014predicting}. The results reconcile saliency with object center-bias hypotheses and highlight that both types of cues are important in guiding fixations. Our work opens new directions to understand strategies that humans use in observing scenes and objects, and demonstrates the construction of combined models of low-level saliency and high-level object-based information.
Optimal Morphs of Convex Drawings
Venue: arXiv cs.CG 2015
Year: 2015

We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear complexity. The linear bound is asymptotically optimal in the worst case.
Learning Definite Horn Formulas from Closure Queries
Venue: arXiv cs.LG 2015
Year: 2015

A definite Horn theory is a set of n-dimensional Boolean vectors whose characteristic function is expressible as a definite Horn formula, that is, as conjunction of definite Horn clauses. The class of definite Horn theories is known to be learnable under different query learning settings, such as learning from membership and equivalence queries or learning from entailment. We propose yet a different type of query: the closure query. Closure queries are a natural extension of membership queries and also a variant, appropriate in the context of definite Horn formulas, of the so-called correction queries. We present an algorithm that learns conjunctions of definite Horn clauses in polynomial time, using closure and equivalence queries, and show how it relates to the canonical Guigues-Duquenne basis for implicational systems. We also show how the different query models mentioned relate to each other by either showing full-fledged reductions by means of query simulation (where possible), or by showing their connections in the context of particular algorithms that use them for learning definite Horn formulas.
Dual Decomposition-Based Privacy-Preserving Multi-Horizon Utility-Community Decision Making Paradigms
Venue: arXiv cs.SY 2015
Year: 2015

Two types of privacy-preserving decision making paradigms for utility-community interactions for multi-horizon operation are examined in this paper. In both designs, communities with renewable energy sources, distributed generators, and energy storage systems minimize their costs with limited information exchange with the utility. The utility makes decision based on the information provided from the communities. Through an iterative process, all parties achieve agreement. The authors' previous research results on subgradient and lower-upper-bound switching (LUBS)-based distributed optimization oriented multi-agent control strategies are examined and the convergence analysis of both strategies are provided. The corresponding decision making architectures, including information flow among agents and learning (or iteration) procedure, are developed for multi-horizon decision making scenarios. Numerical results illustrate the decision making procedures and demonstrate their feasibility of practical implementation. The two decision making architectures are compared for their implementation requirements as well as performance.
Predicting the long-term citation impact of recent publications
Venue: arXiv cs.DL 2015
Year: 2015

A fundamental problem in citation analysis is the prediction of the long-term citation impact of recent publications. We propose a model to predict a probability distribution for the future number of citations of a publication. Two predictors are used: The impact factor of the journal in which a publication has appeared and the number of citations a publication has received one year after its appearance. The proposed model is based on quantile regression. We employ the model to predict the future number of citations of a large set of publications in the field of physics. Our analysis shows that both predictors (i.e., impact factor and early citations) contribute to the accurate prediction of long-term citation impact. We also analytically study the behavior of the quantile regression coefficients for high quantiles of the distribution of citations. This is done by linking the quantile regression approach to a quantile estimation technique from extreme value theory. Our work provides insight into the influence of the impact factor and early citations on the long-term citation impact of a publication, and it takes a step toward a methodology that can be used to assess research institutions based on their most recently published work.
Maximizing Energy Efficiency in Multiple Access Channels by Exploiting Packet Dropping and Transmitter Buffering
Venue: arXiv cs.IT 2015
Year: 2015

Quality of service (QoS) for a network is characterized in terms of various parameters specifying packet delay and loss tolerance requirements for the application. The unpredictable nature of the wireless channel demands for application of certain mechanisms to meet the QoS requirements. Traditionally, medium access control (MAC) and network layers perform these tasks. However, these mechanisms do not take (fading) channel conditions into account. In this paper, we investigate the problem using cross layer techniques where information flow and joint optimization of higher and physical layer is permitted. We propose a scheduling scheme to optimize the energy consumption of a multiuser multi-access system such that QoS constraints in terms of packet loss are fulfilled while the system is able to maximize the advantages emerging from multiuser diversity. Specifically, this work focuses on modeling and analyzing the effects of packet buffering capabilities of the transmitter on the system energy for a packet loss tolerant application. We discuss low complexity schemes which show comparable performance to the proposed scheme. The numerical evaluation reveals useful insights about the coupling effects of different QoS parameters on the system energy consumption and validates our analytical results.
Optimality of Treating Interference as Noise: A Combinatorial Perspective
Venue: arXiv cs.IT 2015
Year: 2015

For single-antenna Gaussian interference channels, we re-formulate the problem of determining the Generalized Degrees of Freedom (GDoF) region achievable by treating interference as Gaussian noise (TIN) derived in [3] from a combinatorial perspective. We show that the TIN power control problem can be cast into an assignment problem, such that the globally optimal power allocation variables can be obtained by well-known polynomial time algorithms. Furthermore, the expression of the TIN-Achievable GDoF region (TINA region) can be substantially simplified with the aid of maximum weighted matchings. We also provide conditions under which the TINA region is a convex polytope that relax those in [3]. For these new conditions, together with a channel connectivity (i.e., interference topology) condition, we show TIN optimality for a new class of interference networks that is not included, nor includes, the class found in [3]. Building on the above insights, we consider the problem of joint link scheduling and power control in wireless networks, which has been widely studied as a basic physical layer mechanism for device-to-device (D2D) communications. Inspired by the relaxed TIN channel strength condition as well as the assignment-based power allocation, we propose a low-complexity GDoF-based distributed link scheduling and power control mechanism (ITLinQ+) that improves upon the ITLinQ scheme proposed in [4] and further improves over the heuristic approach known as FlashLinQ. It is demonstrated by simulation that ITLinQ+ provides significant average network throughput gains over both ITLinQ and FlashLinQ, and yet still maintains the same level of implementation complexity. More notably, the energy efficiency of the newly proposed ITLinQ+ is substantially larger than that of ITLinQ and FlashLinQ, which is desirable for D2D networks formed by battery-powered devices.
Conformal Surface Morphing with Applications on Facial Expressions
Venue: arXiv cs.GR 2015
Year: 2015

Morphing is the process of changing one figure into another. Some numerical methods of 3D surface morphing by deformable modeling and conformal mapping are shown in this study. It is well known that there exists a unique Riemann conformal mapping from a simply connected surface into a unit disk by the Riemann mapping theorem. The dilation and relative orientations of the 3D surfaces can be linked through the Möbius transformation due to the conformal characteristic of the Riemann mapping. On the other hand, a 3D surface deformable model can be built via various approaches such as mutual parameterization from direct interpolation or surface matching using landmarks. In this paper, we take the advantage of the unique representation of 3D surfaces by the mean curvatures and the conformal factors associated with the Riemann mapping. By registering the landmarks on the conformal parametric domains, the correspondence of the mean curvatures and the conformal factors for each surfaces can be obtained. As a result, we can construct the 3D deformation field from the surface reconstruction algorithm proposed by Gu and Yau. Furthermore, by composition of the Möbius transformation and the 3D deformation field, the morphing sequence can be generated from the mean curvatures and the conformal factors on a unified mesh structure by using the cubic spline homotopy. Several numerical experiments of the face morphing are presented to demonstrate the robustness of our approach.
Conditioning in Probabilistic Programming
Venue: arXiv cs.PL 2015
Year: 2015

We investigate the semantic intricacies of conditioning, a main feature in probabilistic programming. We provide a weakest (liberal) pre-condition (w(l)p) semantics for the elementary probabilistic programming language pGCL extended with conditioning. We prove that quantitative weakest (liberal) pre-conditions coincide with conditional (liberal) expected rewards in Markov chains and show that semantically conditioning is a truly conservative extension. We present two program transformations which entirely eliminate conditioning from any program and prove their correctness using the w(l)p-semantics. Finally, we show how the w(l)p-semantics can be used to determine conditional probabilities in a parametric anonymity protocol and show that an inductive w(l)p-semantics for conditioning in non-deterministic probabilistic programs cannot exist.