2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献_第6页

Distributed Stopping Criterion for Ratio Consensus 比率一致性的分布停止准则

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635839

M. Prakash, Saurav Talukdar, Sandeep Attree, Sourav Patel, M. Salapaka

引用次数: 11

Probabilistic Clustering using Maximal Matrix Norm Couplings 利用最大矩阵范数耦合的概率聚类

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635939

David Qiu, A. Makur, Lizhong Zheng

引用次数: 4

Derandomized Distributed Multi-resource Allocation with Little Communication Overhead 小通信开销的非随机分布多资源分配

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635929

Syed Eqbal Alam, R. Shorten, F. Wirth, Jia Yuan Yu

引用次数: 6

Multi-class Bayes error estimation with a global minimal spanning tree 基于全局最小生成树的多类贝叶斯误差估计

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635642

S. Y. Sekeh, Brandon Oselio, A. Hero

引用次数: 7

The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type II: Multiple Library Files 带有线和缓存监听的缓存广播信道类型II:多个库文件

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635931

Mohamed S. Nafea, A. Yener

引用次数: 3

Improving Computational Efficiency of Communication for Omniscience and Successive Omniscience 提高全知和连续全知通信的计算效率

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636087

Ni Ding, P. Sadeghi, T. Rakotoarivelo

{"title":"Improving Computational Efficiency of Communication for Omniscience and Successive Omniscience","authors":"Ni Ding, P. Sadeghi, T. Rakotoarivelo","doi":"10.1109/ALLERTON.2018.8636087","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8636087","url":null,"abstract":"For a group of users in V where everyone observes a component of a discrete multiple random source, the process that users exchange data so as to reach omniscience, the state where everyone recovers the entire source, is called communication for omniscience (CO). We first consider how to improve the existing complexity $O(|V|^{2} mathrm{S}mathrm{F} mathrm{M}(|V|)$ of minimizing the sum of communication rates in CO, where $mathrm{S}mathrm{F} mathrm{M}(|V|)$ denotes the complexity of minimizing a submodular function. We reveal some structured property in an existing coordinate saturation algorithm: the resulting rate vector and the corresponding partition of V are segmented in $alpha$, the estimation of the minimum sum-rate. A parametric (PAR) algorithm is then proposed where, instead of a particular $alpha$, we search the critical points that fully determine the segmented variables for all $alpha$ so that they converge to the solution to the minimum sum-rate problem and the overall complexity reduces to $O(|V|cdot mathrm{S}mathrm{F} mathrm{M}(|V|))$.For the successive omniscience (SO), we consider how to attain local omniscience in some complimentary user subset so that the overall sum-rate for the global omniscience still remains minimum. While the existing algorithm only determines a complimentary user subset in $O (|V| mathrm{S}mathrm{F} mathrm{M}(|V|))$ time, we show that, if a lower bound on the minimum sum-rate is applied to the segmented variables in the PAR algorithm, not only a complimentary subset, but also an optimal rate vector for attaining the local omniscience in it are returned in $O(|V|cdot mathrm{S}mathrm{F} mathrm{M}(|V|))$ time.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123681635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Price and Capacity Competition for EV parking with Government Mandates 政府授权下的电动汽车停车价格与容量竞争

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635835

Brendan Badia, R. Berry, Ermin Wei

引用次数: 3

Rate-cost tradeoffs in scalar LQG control and tracking with side information 带侧信息的标量LQG控制和跟踪中的速率成本权衡

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635889

V. Kostina, B. Hassibi

{"title":"Rate-cost tradeoffs in scalar LQG control and tracking with side information","authors":"V. Kostina, B. Hassibi","doi":"10.1109/ALLERTON.2018.8635889","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635889","url":null,"abstract":"Consider a control problem in which a remote controller chooses its control action based on two kinds of information about the system state: the information it receives from the system via a rate-constrained feedback link, and side information - a noisy measurement of the system state it observes directly. The goal of the controller is to minimize a quadratic cost function in the state variables and control signal, known as the linear quadratic regulator (LQR). We study the fundamental tradeoff between the communication rate, the expected cost b and the quality of side information. Due to a separation principle between estimation and control, we focus on the tracking problem, where the goal is to track the system state rather than to control it. We introduce the causal rate-distortion function with side information at the decoder. It is expressed in terms of directed mutual information, and it extends the classical (noncausal) Wyner-Ziv rate-distortion function to real-time tracking problems with causality constraints and memory of the past at both encoder and decoder. We compute that function in the scalar linear Gaussian setting; we draw a link with the Kalman filter; we show that making side information available also at the encoder does not help to improve the optimal tradeoffs.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127802121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Monte Carlo Methods for Randomized Likelihood Decoding 随机似然解码的蒙特卡罗方法

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636049

Alankrita Bhatt, Jiun-Ting Huang, Young-Han Kim, J. Ryu, P. Sen

引用次数: 5

The price of choice: models, paradoxes, and inference for ‘mobility as a service’ 选择的代价:“移动即服务”的模型、悖论和推论

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635957

D. Wischik

引用次数: 3