2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献_第2页

Finite block length coding for low-latency high-reliability wireless communication 用于低延迟高可靠性无线通信的有限块长度编码

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852331

Leah Dickstein, Vasuki Narasimha Swamy, G. Ranade, A. Sahai

引用次数: 7

Motif-driven graph analysis 动机驱动的图形分析

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852328

Charalampos E. Tsourakakis

引用次数: 1

Towards fast algorithms for estimating Personalized PageRank using commonly generated random walks 基于随机漫步的个性化PageRank快速估计算法研究

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852322

Daniel Vial, V. Subramanian

引用次数: 0

Necessary and sufficient conditions for sketched subspace clustering 草图子空间聚类的充分必要条件

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852389

Daniel L. Pimentel-Alarcón, L. Balzano, R. Nowak

{"title":"Necessary and sufficient conditions for sketched subspace clustering","authors":"Daniel L. Pimentel-Alarcón, L. Balzano, R. Nowak","doi":"10.1109/ALLERTON.2016.7852389","DOIUrl":"https://doi.org/10.1109/ALLERTON.2016.7852389","url":null,"abstract":"This paper is about an interesting phenomenon: two r-dimensional subspaces, even if they are orthogonal to one an other, can appear identical if they are only observed on a subset of coordinates. Understanding this phenomenon is of particular importance for many modern applications of subspace clustering where one would like to subsample in order to improve computational efficiency. Examples include real-time video surveillance and datasets so large that cannot even be stored in memory. In this paper we introduce a new metric between subspaces, which we call partial coordinate discrepancy. This metric captures a notion of similarity between subsampled subspaces that is not captured by other distance measures between subspaces. With this, we are able to show that subspace clustering is theoretically possible in lieu of coherence assumptions using only r + 1 rows of the dataset at hand. This gives precise information-theoretic necessary and sufficient conditions for sketched subspace clustering. This can greatly improve computational efficiency without compromising performance. We complement our theoretical analysis with synthetic and real data experiments.","PeriodicalId":102145,"journal":{"name":"2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115596265","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}

引用次数: 17

Replicated convolutional codes: A design framework for repair-efficient distributed storage codes 复制卷积码:修复高效分布式存储码的设计框架

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852346

Bing Zhu, Xin Li, Hui Li, K. Shum

引用次数: 3

Rigid formation control with nonlinear passive actuation 非线性被动驱动的刚性编队控制

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852267

B. W. Lan, S. Dasgupta

{"title":"Rigid formation control with nonlinear passive actuation","authors":"B. W. Lan, S. Dasgupta","doi":"10.1109/ALLERTON.2016.7852267","DOIUrl":"https://doi.org/10.1109/ALLERTON.2016.7852267","url":null,"abstract":"This paper presents a distributed control law that locally forces a group of agents to self-organize into a rigid formation specified by a subset of interagent distances. The control law presented here is distributed as its execution requires each agent to only sense its relative positions with its neighbors, i.e. agents with whom they share a specified desired distance, and its own velocity. The paper extends [13], [17], and [18]. In [13] each agent is modeled as a single integrator. On the other hand, [17] assumes double integrator dynamics but requires that agents can also sense the velocities of their neighbors, doubling the communication/sensing overhead. In [18] the agent velocities are generated by the actuation signals through a Linear Time Invariant Positive Real dynamics. Double integrator dynamics are a special case of this. Unlike [17] no agent needs its neighbor's velocities. This paper on its parts relaxes the assumption of linear time invariance and instead assumes that the actuation to velocity dynamics of each agent is nonlinear but passive. We prove that the control law of [18] still guarantees local stability despite the presence of nonlinear actuation dynamics. We argue that, like [13], [17] and [18], no law for this problem can be globally stable.","PeriodicalId":102145,"journal":{"name":"2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124550905","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}

引用次数: 2

On distributed computation of optimal control of traffic flow over networks 网络交通流最优控制的分布式计算

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852358

Qin Ba, K. Savla

{"title":"On distributed computation of optimal control of traffic flow over networks","authors":"Qin Ba, K. Savla","doi":"10.1109/ALLERTON.2016.7852358","DOIUrl":"https://doi.org/10.1109/ALLERTON.2016.7852358","url":null,"abstract":"In this paper, we adapt the Alternating Direction Method of Multipliers (ADMM) to develop a distributed algorithm for computing finite horizon optimal control for traffic flow over networks, where the cost is in terms of the density and flow vectors. The dynamics is described by the Cell Transmission Model. While the problem is non-convex in general, recent work has shown the existence of an equivalent convex relaxation, which we adopt in this paper. An equivalent finite dimensional representation for constraints is developed when the external inflows and control are piecewise constant. The auxiliary variables for ADMM implementation consist of a time shifted copy of the density vector, and two copies of the flow vector. A particular division of these variables into two blocks is provided which facilitates distributed implementation, as well as convergence of the ADMM iterates to an optimal solution, if the initial density on every link is strictly positive and strictly below the jam capacity, and the cost function is proper, closed, convex, and separable over density and flow variables, and over links. We also examine the necessary condition, as given by the maximum principle, to provide sufficient conditions under which the optimal control is unique for non-strict convex cost functions, and of bang-bang type, for a linear network.","PeriodicalId":102145,"journal":{"name":"2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"87 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114404434","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}

引用次数: 10

Secure system identification 安全系统标识

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852363

M. Showkatbakhsh, P. Tabuada, S. Diggavi

引用次数: 3

Equilibrium analysis for a leader-follower game with noisy observations: A pace forward in Witsenhausen's counterexample conjecture 具有嘈杂观察的领导-追随者博弈的均衡分析:在Witsenhausen反例猜想中的进步

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852232

A. Ajorlou, A. Jadbabaie

引用次数: 0

Quickest search for local structures in line networks 在直线网络中快速搜索局部结构

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2016-09-01 DOI: 10.1109/ALLERTON.2016.7852219

Javad Heydari, A. Tajer

{"title":"Quickest search for local structures in line networks","authors":"Javad Heydari, A. Tajer","doi":"10.1109/ALLERTON.2016.7852219","DOIUrl":"https://doi.org/10.1109/ALLERTON.2016.7852219","url":null,"abstract":"A large network of agents in which each agent generates one random variable is considered. The random variables generated by an unknown subset of nodes form a correlation structure, while the remaining nodes generate independent and identically distributed random variables. This paper formalizes and analyzes the quickest search strategy, the goal of which is to identify the unknown subset of correlated nodes with the fewest number of measurements. Despite its widespread applications, the problem of identifying subnetworks with such desired correlation structures is often investigated under the fixed sample-size setting, in which the data acquisition process and the inferential mechanisms are decoupled. Motivated by the significant advantages of sequential detection for agile inference, this paper analyzes this problem under a fully sequential setting. Specifically, it formalizes a framework that incorporates the intertwined processes of data-adaptive information gathering and decision making. Additionally, through a constructive proof, it also offers an optimal sequential data-gathering process as well as the attendant decision rules for identifying a structured subnetwork of interest in a given line network.","PeriodicalId":102145,"journal":{"name":"2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128410732","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}

引用次数: 0