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

On Dual Relationships of Secrecy Codes 论密码学的对偶关系

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

Willie K. Harrison, M. Bloch

引用次数: 12

Resource Allocation under Sequential Resource Access: Theory and Application 顺序资源访问下的资源分配:理论与应用

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

A. Tajer, Maha Zohdy

{"title":"Resource Allocation under Sequential Resource Access: Theory and Application","authors":"A. Tajer, Maha Zohdy","doi":"10.1109/ALLERTON.2018.8636038","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8636038","url":null,"abstract":"This paper treats the problem of optimal resource allocation over time in a finite-horizon setting, in which the resource become available only sequentially and in incremental values and the utility function is concave and can freely vary over time. Such resource allocation problems have direct applications in data communication networks (e.g., energy harvesting systems). This problem is studied extensively for special choices of the concave utility function (time-invariant and logarithmic) in which case the optimal resource allocation policies are well-understood. This paper treats this problem in its general form and analytically characterizes the structure of the optimal resource allocation policy, and devises an algorithm for computing the exact solutions analytically. An observation instrumental to devising the provided algorithm is that there exist time instances at which the available resources are exhausted, with no carry-over to future. This algorithm identifies all such instances, which in turn facilitates breaking the original problem into multiple problems with significantly reduced dimensions. Furthermore, some widely-used special cases in which the algorithm takes simpler structures are characterized, and the application to the energy harvesting systems is discussed. Numerical evaluations are provided to assess the key properties of the optimal resource allocation structure and to compare the performance with the generic convex optimization algorithms.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"94 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":"116601020","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

Feedback control of server instances for right sizing in the cloud 对服务器实例进行反馈控制，以便在云中正确调整规模

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

Diego Goldsztajn, Andrés Ferragut, F. Paganini

引用次数: 5

Stability of Non-Linear Filters, Observability and Relative Entropy 非线性滤波器的稳定性、可观测性和相对熵

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

Curtis McDonald, S. Yüksel

引用次数: 7

On Model-free Reinforcement Learning for Switched Linear Systems: A Subspace Clustering Approach 切换线性系统的无模型强化学习:一种子空间聚类方法

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

Hao Li, Hua Chen, Wei Zhang

引用次数: 5

Allerton 2018 Committees 阿勒顿2018委员会

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

引用次数: 0

On topological entropy of switched linear systems with pairwise commuting matrices 具有对交换矩阵的切换线性系统的拓扑熵

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

Guosong Yang, J. Hespanha

{"title":"On topological entropy of switched linear systems with pairwise commuting matrices","authors":"Guosong Yang, J. Hespanha","doi":"10.1109/ALLERTON.2018.8635894","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635894","url":null,"abstract":"We study a notion of topological entropy for switched systems, formulated in terms of the minimal number of initial states needed to approximate all initial states within a finite precision. This paper focuses on the topological entropy of switched linear systems with pairwise commuting matrices. First, we prove there exists a simultaneous change of basis under which each of the matrices can be decomposed into a diagonal part and a nilpotent part, and all the diagonal and nilpotent parts are pairwise commuting. Then a formula for the topological entropy is established in terms of the component- wise averages of the eigenvalues, weighted by the active time of each mode, which indicates that the topological entropy is independent of the nilpotent parts above. We also present how the formula generalizes known results for the non-switched case and the case with simultaneously diagonalizable matrices, and construct more general but more conservative upper bounds for the entropy. A numerical example is provided to demonstrate properties of the formula and the upper and lower bounds for the topological entropy.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"29 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":"121614753","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 the Joint Recovery of Community Structure and Community Features 论群落结构与群落特征的联合恢复

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

Jisang Yoon, Kangwook Lee, Changho Suh

引用次数: 10

A Geometric Characterization of Fisher Information from Quantized Samples with Applications to Distributed Statistical Estimation 量化样本中Fisher信息的几何表征及其在分布统计估计中的应用

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

L. P. Barnes, Yanjun Han, Ayfer Özgür

{"title":"A Geometric Characterization of Fisher Information from Quantized Samples with Applications to Distributed Statistical Estimation","authors":"L. P. Barnes, Yanjun Han, Ayfer Özgür","doi":"10.1109/ALLERTON.2018.8635899","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635899","url":null,"abstract":"Consider the Fisher information for estimating a vector $theta in mathbb {R}^{d}$ from the quantized version of a statistical sample $X sim f(x|theta)$. Let M be a k-bit quantization of $X.$ We provide a geometric characterization of the trace of the Fisher information matrix $I_{M}(theta)$ in terms of the score function $S_{theta }(X)$. When $k=1$, we exactly solve the extremal problem of maximizing this geometric quantity for the Gaussian location model, which allows us to conclude that in this model, a half-space quantization is the one-bit quantization that maximizes $Tr(I_{M}(theta))$. Under assumptions on the tail of the distribution of $S_{theta }(X)$ projected onto any unit vector in $mathbb {R}^{d}$, we give upper bounds demonstrating how $Tr(I_{M}(theta))$ can scale with k. We apply these results to find lower bounds on the minimax risk of estimating $theta $ from multiple quantized samples of X, for example in a distributed setting where the samples are distributed across multiple nodes and each node has a total budget of k-bits to communicate its sample to a centralized estimator. Our bounds apply in a unified way to many common statistical models including the Gaussian location model and discrete distribution estimation, and they recover and generalize existing results in the literature with simpler and more transparent proofs.","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":"122131890","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}

引用次数: 11

The repair problem under connectivity constraints: Explicit MSR codes for the rack-aware model of distributed storage 连接约束下的修复问题:分布式存储机架感知模型的显式MSR代码

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

Zitan Chen, A. Barg

引用次数: 4