The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Protocols are currently being designed where a connection can simultaneously send traffic across multiple routes (or paths) of a communication network; for example, the IETF's MP-TCP protocol. Traditional single-path congestioncontrol protocols, which increase and decrease transmission rates depending on the level of congestion, can be argued to implicitly solve a network-wide utility optimization...
Recent research has illustrated privacy breaches that can be effected on an anonymized dataset by an attacker who has access to auxiliary information about the users. Most of these attack strategies rely on the uniqueness of specific aspects of the users' data - e.g., observing a mobile user at just a few points on the time-location space are sufficient to uniquely identify him/her from an anonymized...
Approximate graph matching (AGM) refers to the problem of mapping the vertices of two structurally similar graphs, which has applications in social networks, computer vision, chemistry, and biology. Given its computational cost, AGM has mostly been limited to either small graphs (e.g., tens or hundreds of nodes), or to large graphs in combination with side information beyond the graph structure (e...
We study the tradeoff between privacy guarantees and the utility of statistical estimators under local differential privacy, where data remains private even from the statistician. We prove bounds on information-theoretic quantities that influence estimation rates as a function of the amount of privacy preserved. Our bounds can be viewed as quantitative data-processing inequalities that, combined with...
We discuss a new robust convergence analysis of the well-known subspace iteration algorithm for computing the dominant singular vectors of a matrix, also known as simultaneous iteration or power method. The result characterizes the convergence behavior of the algorithm when a large amount noise is introduced after each matrix-vector multiplication. While interesting in its own right, the main motivation...
This paper explores the structure of the time optimal trajectories for a rigid body in the unobstructed plane. The available controls for the system are the velocity and angular velocity of the body, in its own frame of reference. Controls are bounded by a closed convex polyhedron. The paper shows that the structure of the optimal trajectories may be completely described analytically.
In this talk, we survey the recently defined notion of joint differential privacy, together with several of its applications. Joint differential privacy is an appropriate solution concept for problems whose solution can be partitioned amongst the n agents who provide the private data to the algorithm: the two examples we focus on are allocation problems and equilibrium computation. Our focus in this...
In Ghosh-Ligett 2013, we propose a simple model where individuals in a privacy-sensitive population with privacy requirements decide whether or not to participate in a pre-announced noisy computation by an analyst, so that the database itself is endogenously determined by individuals participation choices. The privacy an agent receives depends both on the announced noise level, as well as how many...
We focus on the privacy-accuracy tradeoff encountered by a user who wishes to release some data to an analyst, that is correlated with his private data, in the hope of receiving some utility. We rely on a general statistical inference framework, under which data is distorted before its release, according to a probabilistic privacy mechanism designed under utility constraints. Using recent results...
We present the first sample-optimal sublinear time algorithms for the sparse Discrete Fourier Transform over a two-dimensional √n × √n grid. Our algorithms are analyzed for the average case signals. For signals whose spectrum is exactly sparse, we present algorithms that use O(k) samples and run in O(k log k) time, where k is the expected sparsity of the signal. For signals whose spectrum is approximately...
We consider two-way relaying in a Gaussian diamond channel, where two terminal nodes wish to exchange information using two relays. A simple baseline protocol is obtained by time-sharing between two one-way protocols. To improve upon the baseline performance, we propose two compute-and-forward (CF) protocols - Compute-and-forward-Compound multiple access channel (CF-CMAC) and Compute-and-forward-Broadcast...
A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT, where N is a power of two and K = O(Nα), scales sublinearly in N for some 0 < α < 1. Assuming a random support model for the nonzero transform domain components, the algorithm reconstructs the WHT of the signal with a sample complexity O(K...
Auctions have been proposed as a way to provide economic incentives to dynamically allocate unused spectrum to users in need of it. Previously proposed auction schemes do not take into account the fact that users' power and bandwidth constraints might prevent them from transmitting their bid prices to the auctioneer with high precision, and that these transmitted bid prices must travel through a noisy...
In this paper we develop a framework for distributed power control in a wireless network where femto and macro cells co-exist and interfere with each other. In order to ensure a minimum QoS, femto and macro access points have the challenging and realistic objective of minimizing their users' SINR (Signal to Interference and Noise Ratio) outage. Furthermore, due to mobility and interference, an accurate...
In this paper, we consider using total variation minimization to recover signals whose gradients have a sparse support, from a small number of measurements. We establish the proof for the performance guarantee of total variation (TV) minimization in recovering one-dimensional signal with sparse gradient support. This partially answers the open problem of proving the fidelity of total variation minimization...
We introduce a recursive scheme for performing Compressed Sensing (CS) on streaming data and analyze, both analytically and experimentally, the computational complexity and estimation error. The approach consists of sampling the input stream recursively via overlapping windowing and making use of the previous measurement in obtaining the next one. The signal estimate from the previous window is utilized...
In this paper we consider the evolution of the temperature of a power line under stochastic exogenous factors such as ambient temperature. We present a solution to the resulting stochastic heat equation and we propose a number of control algorithms designed to maximize delivered power under chance constraints used to limit the probability that a line exceeds its critical temperature.
The following routing problem in a queueing system with non-classical information structure is investigated in discrete time. A service system consists of two service stations and two controllers; one controller is affiliated with each station. Each station has an infinite size buffer. The service stations provide the same service with identical Bernoulli(μ) service time distributions and identical...
The problem of dynamically pricing of electricity by a retailer for customers in a demand response program is considered. It is assumed that the retailer obtains electricity in a two-settlement wholesale market consisting of a day ahead market and a real-time market. Under a day ahead dynamic pricing mechanism, the retailer aims to learn the aggregated demand function of its customers while maximizing...
Transmission topology control (line switching) is currently a manual operator intervention by power system operators implemented on an ad-hoc basis and relying on either the operators' previous experience or on a set of fixed procedures linking congestion with topology changes. While the co-optimization of network topology and generation resources has been shown to provide significant congestion cost...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.