2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献_第5页

Information-theoretic private interactive mechanism 信息论私有交互机制

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447104

Bahman Moraffah, L. Sankar

{"title":"Information-theoretic private interactive mechanism","authors":"Bahman Moraffah, L. Sankar","doi":"10.1109/ALLERTON.2015.7447104","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447104","url":null,"abstract":"An information-theoretic mechanism for privacy-guaranteed interactions is introduced between two memoryless correlated sources where each source is characterized by a pair of public and private variables. The interactions are modeled as a collection of K/2 pairs of random mappings, one pair for each of the K rounds of interactions. The K/2 random mapping pairs are chosen jointly to minimize the information leakage (privacy measure) over K rounds of the private variable of each source at the other source while ensuring that a desired measure of utility (distortion) of the revealed public variable is satisfied. Arguing that an average case information-theoretic privacy metric can be appropriate for streaming data settings, this paper shows that in general, interaction reduces privacy leakage by drawing some parallels between this problem and the classic interactive source coding problem. Specifically, for the log-loss distortion metric it is shown that the resulting interaction problem is an analog of an interactive information bottleneck problem for which a one-shot interactive mechanism is, in general, not optimal. For the resulting problem with a non-convex constraint space, an algorithm that extends the one-way agglomerative information bottleneck algorithm to the interactive setting is introduced.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115792496","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

On the representability of integer polymatroids: Applications in linear code construction 整数多拟阵的可表示性:在线性码构造中的应用

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447046

Amir Salimi, M. Médard, Shuguang Cui

引用次数: 7

Design of linear & nonlinear observers for a turning process with implicit State-Dependent Delay 具有隐式状态相关延迟的车削过程线性和非线性观测器的设计

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447052

Aftab Ahmed, Erik I. Verriest

{"title":"Design of linear & nonlinear observers for a turning process with implicit State-Dependent Delay","authors":"Aftab Ahmed, Erik I. Verriest","doi":"10.1109/ALLERTON.2015.7447052","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447052","url":null,"abstract":"Analysis and design of present machining methods used in mechanical engineering are based on Taylor series approximations and linearizations which cause erroneous and anomalous results. High precision machining cannot tolerate such errors. We consider and analyze an exact mathematical model of the turning process without performing any kind of linearization of the model. We give a strategic design of an estimator for the position of a machining tool based on first principles. The system's dynamics are characterized by a nonlinear State-Dependent Delay Differential Equation (SD-DDE). This delay is extremely convoluted with the state by an implicit relation. The central tenet is to use inversion of the delay model and to extract the state vector given the delay. We use our recently developed observation technique referred to as Delay Injection. Both linear asymptotic and nonlinear observers with different architectures are designed for the state estimation of a machine tool based on state-dependent delay measurement. Simulation results are depicted at the end which portray the effectiveness, validity and usefulness of the proposed observer schemes.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121883845","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}

引用次数: 1

Scheduling, pricing, and efficiency of non-preemptive flexible loads under direct load control 直接负荷控制下非抢占柔性负荷的调度、定价和效率

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447118

Abhishek K. Gupta, R. Jain, R. Rajagopal

引用次数: 10

An information theoretic technique for harnessing attenuation of high spatial frequencies to design ultra-high-density EEG 利用高空间频率衰减的信息理论技术设计超高密度脑电图

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447102

P. Grover, J. Weldon, S. Kelly, Praveen Venkatesh, Haewon Jeong

{"title":"An information theoretic technique for harnessing attenuation of high spatial frequencies to design ultra-high-density EEG","authors":"P. Grover, J. Weldon, S. Kelly, Praveen Venkatesh, Haewon Jeong","doi":"10.1109/ALLERTON.2015.7447102","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447102","url":null,"abstract":"It is widely believed in the clinical and biosciences community that Electroencephalography (EEG) is fundamentally limited in the spatial resolution achieved using a few hundred electrodes. This belief rests on the well known decay of high-spatial frequencies as the signal passes from the brain surface to the scalp surface. These high spatial frequencies carry high spatial resolution information about the source. However, recent experimental work as well as our theoretical and numerical analyses strongly suggest that EEG's resolution could be improved significantly through increased electrode density despite this decay. Somewhat counterintuitively, instead of viewing this decay of spatial frequencies as a detriment to signal quality (which it is), in this work we propose an information-theoretic strategy to harness this decay to reduce circuit area and energy needed for high-resolution signal acquisition. This is made possible by the observation that this spatial-low-pass filtering of the signal as it passes from the brain to the scalp induces large spatial correlations that can be exploited information-theoretically. The proposed techniques are shown in idealized head models to reduce requirements on energy required for sensing by 3×. These results are being applied towards an ongoing project on developing the “Neural Web,” a 10,000 electrode portable EEG system at CMU.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129749269","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}

引用次数: 5

Finite-state approximations to constrained Markov decision processes with Borel spaces Borel空间约束马尔可夫决策过程的有限状态逼近

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447055

Naci Saldi, S. Yüksel, T. Linder

引用次数: 1

Memoryless sampling rate distortion 无记忆采样率失真

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447105

Vinay Praneeth Boda, P. Narayan

引用次数: 2

Near-optimal multi-version codes 近乎最佳的多版本代码

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447076

M. Khabbazian

{"title":"Near-optimal multi-version codes","authors":"M. Khabbazian","doi":"10.1109/ALLERTON.2015.7447076","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447076","url":null,"abstract":"Motivated by applications to distributed storage and computing, the multi-version coding problem was formulated by Wang and Cadambe in [4]. In this problem, a client sequently over time stores v independent versions of a message in a storage system with n server nodes. It is assumed that, a message version may not reach some servers, and that each server is unaware of what has been stored in other servers. The problem requires that any c servers must be able to reconstruct their latest common version. An extended multi-version problem introduced in [5] relaxes the above requirement by requiring any c servers to be able to reconstruct their latest common version or any version later than that. The objective in both the original and extended multi-version problem is to minimize the worst case storage cost. In this work, we propose codes for both the multi-version problem and its extension. For the original multi-version coding problem, we show that the storage cost of our proposed codes are near-optimal. For the extended multi-version coding problem, we show that the storage cost of our first algorithm is optimal when v|c - 1. Our second proposed extended multi-version code shows that storage cost of strictly less than one is achievable even when v is 50% larger than c. This is interesting, as the storage cost of existing codes becomes one as soon as v becomes larger than c.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121134255","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}

引用次数: 1

Spatially-coupled codes for write-once memories 一次性写入存储器的空间耦合代码

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7446994

Santhosh Kumar, Avinash Vem, K. Narayanan, H. Pfister

引用次数: 5

Distributed information-theoretic biclustering of two memoryless sources 两个无内存源的分布式信息论双聚类

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447035

Georg Pichler, P. Piantanida, G. Matz

引用次数: 6