2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)

Filter Results

Displaying Results 1 - 25 of 234
• 51 years of Allerton conferences

Publication Year: 2013, Page(s):1 - 3
| |PDF (99 KB)
• Foreword

Publication Year: 2013, Page(s): 1
| |PDF (109 KB) | HTML

Publication Year: 2013, Page(s):1 - 31
| |PDF (285 KB)
• Author index

Publication Year: 2013, Page(s):1 - 14
| |PDF (147 KB)
• 51st Annual Allerton Conference on Communication, Control, and Computing [Copyright notice]

Publication Year: 2013, Page(s): 1
| |PDF (726 KB)
• Secret key capacity for multipleaccess channel with public feedback

Publication Year: 2013, Page(s):1 - 7
Cited by:  Papers (2)
| |PDF (687 KB) | HTML

We consider the generation of a secret key (SK) by the inputs and the output of a secure multipleaccess channel (MAC) that additionally have access to a noiseless public communication channel. Under specific restrictions on the protocols, we derive various upper bounds on the rate of such SKs. Specifically, if the public communication consists of only the feedback from the output terminal, then th... View full abstract»

Publication Year: 2013, Page(s):8 - 12
Cited by:  Papers (2)
| |PDF (519 KB) | HTML

Whether the information complexity of any interactive problem is close to its communication complexity is an important open problem. In this note we give an example of a sampling problem whose information and communication complexity we conjecture to be as much as exponentially far apart. View full abstract»

• On hypercontractivity and the mutual information between Boolean functions

Publication Year: 2013, Page(s):13 - 19
Cited by:  Papers (15)
| |PDF (812 KB) | HTML

Hypercontractivity has had many successful applications in mathematics, physics, and theoretical computer science. In this work we use recently established properties of the hypercontractivity ribbon of a pair of random variables to study a recent conjecture regarding the mutual information between binary functions of the individual marginal sequences of a sequence of pairs of random variables dra... View full abstract»

• The mutual information of a class of graphical channels

Publication Year: 2013, Page(s):20 - 25
Cited by:  Papers (2)
| |PDF (622 KB) | HTML

This paper studies a class of channels obtained by combining a graph and a memoryless channel. A particular example is a memoryless channel pre-coded with a graph-based codes. Other examples are planted constrained satisfaction problems, and probabilistic network models with communities. In an earlier work by the authors, concentration results are obtained for such channels when the graphs is a sp... View full abstract»

• On dispersion of compound DMCs

Publication Year: 2013, Page(s):26 - 32
Cited by:  Papers (3)
| |PDF (528 KB) | HTML

Code for a compound discrete memoryless channel (DMC) is required to have small probability of error regardless of which channel in the collection perturbs the codewords. Capacity of the compound DMC has been derived classically: it equals the maximum (over input distributions) of the minimal (over channels in the collection) mutual information. In this paper the expression for the channel dispers... View full abstract»

• Online optimization in parametric dynamic environments

Publication Year: 2013, Page(s):33 - 38
| |PDF (656 KB) | HTML

This paper describes a novel approach to online convex programming in dynamic settings. Many existing online learning methods are characterized via regret bounds that quantify the gap between the performance of the online algorithm relative to a comparator. In previous work, this comparator was either considered static over time, or admitted sublinear tracking regret bounds only when the comparato... View full abstract»

• Optimal decentralized control problem as a rank-constrained optimization

Publication Year: 2013, Page(s):39 - 45
Cited by:  Papers (16)
| |PDF (1006 KB) | HTML

This paper is concerned with the long-standing optimal decentralized control (ODC) problem. The objective is to design a fixed-order decentralized controller for a discrete-time system to minimize a given finite-time cost function subject to norm constraints on the input and output of the system. We cast this NP-hard problem as a quadratically-constrained quadratic program, and then reformulate it... View full abstract»

• Peak-minimizing online EV charging

Publication Year: 2013, Page(s):46 - 53
Cited by:  Papers (3)
| |PDF (1074 KB) | HTML

In this paper, we consider an aggregator that manages a large number of Electrical Vehicle (EV) charging jobs, each of which requests a certain amount of energy that needs to be charged before a deadline. The goal of the aggregator is to minimize the peak consumption at any time by planning the charging schedules in order. A key challenge that the aggregator faces in the planning is that there exi... View full abstract»

• Risky power forward contracts for wind aggregation

Publication Year: 2013, Page(s):54 - 61
Cited by:  Papers (5)
| |PDF (628 KB) | HTML

Risky power contracts are introduced for enabling wind power aggregation. First, the problem of optimal risky and firm power contract offering in the forward market is formulated in the single wind farm setting. Analytical solutions are obtained, and the concepts of fair price of wind power and price of unitized risk are introduced. The more general setting of two wind farms both trading risky and... View full abstract»

• Optimal investment of conventional and renewable generation assets

Publication Year: 2013, Page(s):62 - 69
Cited by:  Papers (3)
| |PDF (455 KB) | HTML

Driven by the national policy to expand renewable generation, as well as the advances in renewable technologies that reduce the cost of small-scale renewable generation units, distributed generation at end users will comprise a significant fraction of electricity generation in the future. We study the problem faced by a social planner who seeks to minimize the long-term discounted costs (associate... View full abstract»

• A receding horizon control law for harbor defense

Publication Year: 2013, Page(s):70 - 77
| |PDF (1012 KB) | HTML

The paper studies a harbor defense situation where an intruder attempts to out-maneuver defenders and destroy a target. The purpose of this paper is to construct a feedback, receding horizon control law for the defenders based on a max-min optimal control problem which we believe captures the essence of the intruder goals. View full abstract»

• Approximation of stationary control policies by quantized control in Markov decision processes

Publication Year: 2013, Page(s):78 - 84
Cited by:  Papers (1)
| |PDF (513 KB) | HTML

We consider the problem of approximating optimal stationary control policies by quantized control. Stationary quantizer policies are introduced and it is shown that such policies are “-optimal among stationary policies under mild technical conditions. Quantitative bounds on the approximation error in terms of the rate of the approximating quantizers are also derived. Thus, one can search fo... View full abstract»

• Spectrum sharing policies for heterogeneous delay-sensitive users: A novel design framework

Publication Year: 2013, Page(s):85 - 92
| |PDF (1304 KB) | HTML

We develop a novel design framework for spectrum sharing among distributed users with heterogeneous delay-sensitivity (e.g. users with video streaming that requires low delay, and users with video conferencing that requires very low delay). Most existing spectrum sharing policies are stationary, i.e. users transmit at constant power levels simultaneously. Under stationary policies, the users have ... View full abstract»

• Convex control design via covariance minimization

Publication Year: 2013, Page(s):93 - 99
Cited by:  Papers (1)
| |PDF (701 KB) | HTML

We consider the problem of synthesizing optimal linear feedback policies subject to arbitrary convex constraints on the feedback matrix. This is known to be a hard problem in the usual formulations (ℋ2;ℋ∞;LQR) and previous works have focussed on characterizing classes of structural constraints that allow efficient solution through convex optimization or d... View full abstract»

• A distributed continuous-time gradient dynamics approach for the active power loss minimizations

Publication Year: 2013, Page(s):100 - 106
Cited by:  Papers (1)
| |PDF (441 KB) | HTML

In this paper, we consider the non-convex active power loss minimization problem. Under the existence of saddle points and certain mild conditions, we show that a solution to the active power loss minimization can be achieved by applying the gradient dynamics approach. An important feature of this approach is that it is naturally distributed, i.e., each bus in the network only requires the local i... View full abstract»

• Learning the causal graph of Markov time series

Publication Year: 2013, Page(s):107 - 114
Cited by:  Papers (1)
| |PDF (1167 KB) | HTML

This paper considers a natural and widely prevalent setting where a collection of one dimensional time series evolve in a causal manner, and one is interested in inferring the graph governing the causality between these processes in a high dimensional setting. We consider this problem in the special case where variables are discrete and updates are Markov. We develop a new algorithm to learn causa... View full abstract»

• On the privacy-cost tradeoff of an in-home power storage mechanism

Publication Year: 2013, Page(s):115 - 122
| |PDF (908 KB) | HTML

Demand response systems in the electricity grid, which rely on two way communication between the consumers and utility, requires the transmission of instantaneous energy consumption to utilities. Perfect knowledge of a users' power consumption profile by a utility is a violation of privacy and can be detrimental to the successful implementation of demand response systems. An in-home storage system... View full abstract»

• Proportional fairness in heterogeneous peer-to-peer networks through reciprocity and Gibbs sampling

Publication Year: 2013, Page(s):123 - 130
Cited by:  Papers (2)
| |PDF (535 KB) | HTML

This paper studies peer-to-peer networks with the objective of imposing a proportionally fair allocation of peer upload capacity. We begin with a tutorial review on the feasibility of achieving these allocations with idealized assumptions on connectivity and rate control, as well as a distributed algorithm based on peer reciprocity that can achieve it. To impose some of the constraints of real net... View full abstract»

• Double hashing thresholds via local weak convergence

Publication Year: 2013, Page(s):131 - 137
| |PDF (517 KB) | HTML

A lot of interest has recently arisen in the analysis of multiple-choice “cuckoo hashing” schemes. In this context, a main performance criterion is the load threshold under which the hashing scheme is able to build a valid hashtable with high probability in the limit of large systems; various techniques have successfully been used to answer this question (differential equations, comb... View full abstract»

• Fairness via priority scheduling

Publication Year: 2013, Page(s):138 - 145
Cited by:  Papers (2)
| |PDF (1117 KB) | HTML

In the context of multi-agent resource allocation problems, fairness is a paradigm shift in the recent past. An efficient scheduler always allocates resources to the best' agent. Some of the agents, who are most often in bad' conditions, are starved and fair schedulers are defined in this context. In this paper, we are interested in the actual gains obtained by the otherwise starved agents, due ... View full abstract»