发布求助
文献互助 智能选刊 最新文献

2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献

筛选
英文 中文
Social game for building energy efficiency: Incentive design 建筑节能的社交游戏:激励设计
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-11-17 DOI: 10.1109/ALLERTON.2014.7028565
L. Ratliff, Ming Jin, Ioannis C. Konstantakopoulos, C. Spanos, S. S. Sastry
{"title":"Social game for building energy efficiency: Incentive design","authors":"L. Ratliff, Ming Jin, Ioannis C. Konstantakopoulos, C. Spanos, S. S. Sastry","doi":"10.1109/ALLERTON.2014.7028565","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028565","url":null,"abstract":"We present analysis and results of a social game encouraging energy efficient behavior in occupants by distributing points which determine the likelihood of winning in a lottery. We estimate occupants utilities and formulate the interaction between the building manager and the occupants as a reversed Stackelberg game in which there are multiple followers that play in a non-cooperative game. The estimated utilities are used for determining the occupant behavior in the non-cooperative game. Due to nonconvexities and complexity of the problem, in particular the size of the joint distribution across the states of the occupants, we solve the resulting the bilevel optimization problem using a particle swarm optimization method. Drawing from the distribution across player states, we compute the Nash equilibrium of the game using the resulting leader choice. We show that the behavior of the agents under the leader choice results in greater utility for the leader.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124215203","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
Distributed consensus with mixed time/communication bandwidth performance metrics 具有混合时间/通信带宽性能指标的分布式共识
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-10-03 DOI: 10.1109/ALLERTON.2014.7028468
Federico Rossi, M. Pavone
{"title":"Distributed consensus with mixed time/communication bandwidth performance metrics","authors":"Federico Rossi, M. Pavone","doi":"10.1109/ALLERTON.2014.7028468","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028468","url":null,"abstract":"In this paper we study the inherent trade-off between time and communication complexity for the distributed consensus problem. In our model, communication complexity is measured as the maximum data throughput (in bits per second) sent through the network at a given instant. Such a notion of communication complexity, referred to as bandwidth complexity, is related to the frequency bandwidth a designer should collectively allocate to the agents if they were to communicate via a wireless channel, which represents an important constraint for robotic networks. We prove a lower bound on the bandwidth complexity of the consensus problem and provide a matching consensus algorithm that is bandwidth-optimal for a wide class of consensus functions. We then propose a distributed algorithm that can trade communication complexity versus time complexity and robustness as a function of a tunable parameter, which can be adjusted by a system designer as a function of the properties of the wireless communication channel. We rigorously characterize the tunable algorithm's worst-case bandwidth complexity and show that it compares favorably with the bandwidth complexity of well-known consensus algorithms.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"48 19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115595243","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
Joint estimation and detection against independence 联合估计和独立检测
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-10-01 DOI: 10.1109/ALLERTON.2014.7028594
Gil Katz, P. Piantanida, Romain Couillet, M. Debbah
{"title":"Joint estimation and detection against independence","authors":"Gil Katz, P. Piantanida, Romain Couillet, M. Debbah","doi":"10.1109/ALLERTON.2014.7028594","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028594","url":null,"abstract":"A receiver in a two-node system is required to make a decision of relevance as to received information, using side information that may or may not be correlated with the received signal. In case the information is judged to be relevant, the receiver is then required to estimate the source with average distortion D. Focusing on the case of testing against independence, a single-letter expression for the rate-error-distortion region is proposed and proven. The resulting region ports a surprising resemblance to a seemingly non-associated classification problem, known as the information-bottleneck. The optimal region is then calculated for a binary symmetric example. Results demonstrate an interesting tradeoff between the achievable error-exponent for the decision and the distortion at the decoder.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116995681","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}
引用次数: 9
The capacity of non-identical adaptive group testing 非相同自适应群体测试的能力
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-30 DOI: 10.1109/ALLERTON.2014.7028442
Thomas Kealy, O. Johnson, R. Piechocki
{"title":"The capacity of non-identical adaptive group testing","authors":"Thomas Kealy, O. Johnson, R. Piechocki","doi":"10.1109/ALLERTON.2014.7028442","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028442","url":null,"abstract":"We consider the group testing problem, in the case where the items are defective independently but with non-constant probability. We introduce and analyse an algorithm to solve this problem by grouping items together appropriately. We give conditions under which the algorithm performs essentially optimally in the sense of information-theoretic capacity. We use concentration of measure results to bound the probability that this algorithm requires many more tests than the expected number. This has applications to the allocation of spectrum to cognitive radios, in the case where a database gives prior information that a particular band will be occupied.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"473 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125131048","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}
引用次数: 22
Efficient statistics: Extracting information from IID observations 高效统计:从IID观察中提取信息
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028523
Shao-Lun Huang, A. Makur, Fabian Kozynski, Lizhong Zheng
{"title":"Efficient statistics: Extracting information from IID observations","authors":"Shao-Lun Huang, A. Makur, Fabian Kozynski, Lizhong Zheng","doi":"10.1109/ALLERTON.2014.7028523","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028523","url":null,"abstract":"In this paper, we study how information can be conveyed through a noisy channel and extracted efficiently, under the scenarios and applications, where the observing order of the symbols does not carry any useful information. In such cases, the information-carrying objects are the empirical distributions of the transmitted and received symbol sequences. We develop a local geometric structure and a new coordinate system for the space of distributions. With this approach, we can decompose the computation of the posterior distribution of the data into a sequence of score functions, with decreasing information volumes. Thus, when our goal is not to recover the entire data, but only to detect certain features of the data, we only need to compute the first few scores, which greatly simplifies the problem. We demonstrate the use of our technique with some image processing examples based on graphical models.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115439317","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}
引用次数: 15
Multi-party set reconciliation using characteristic polynomials 基于特征多项式的多方集调和
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028589
Anudhyan Boral, M. Mitzenmacher
{"title":"Multi-party set reconciliation using characteristic polynomials","authors":"Anudhyan Boral, M. Mitzenmacher","doi":"10.1109/ALLERTON.2014.7028589","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028589","url":null,"abstract":"In the standard set reconciliation problem, there are two parties A<sub>1</sub> and A<sub>2</sub>, each respectively holding a set of elements S<sub>1</sub> and S<sub>2</sub>. The goal is for both parties to obtain the union S<sub>1</sub> U S<sub>2</sub>. In many distributed computing settings the sets may be large but the set difference |S<sub>1</sub> - S<sub>2</sub> | +|S<sub>2</sub> - S<sub>1</sub>| is small. In these cases one aims to achieve reconciliation efficiently in terms of communication; ideally, the communication should depend on the size of the set difference, and not on the size of the sets. Recent work has considered generalizations of the reconciliation problem to multi-party settings, using a framework based on a specific type of linear sketch called an Invertible Bloom Lookup Table. Here, we consider multi-party set reconciliation using the alternative framework of characteristic polynomials, which have previously been used for efficient pairwise set reconciliation protocols, and compare their performance with Invertible Bloom Lookup Tables for these problems.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123109510","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}
引用次数: 9
Asymptotic capacity of a random channel 随机信道的渐近容量
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.3934/amc.2017060
Tobias Sutter, David Sutter, J. Lygeros
{"title":"Asymptotic capacity of a random channel","authors":"Tobias Sutter, David Sutter, J. Lygeros","doi":"10.3934/amc.2017060","DOIUrl":"https://doi.org/10.3934/amc.2017060","url":null,"abstract":"We consider discrete memoryless channels with input and output alphabet size n whose channel transition matrix consists of entries that are independent and identically distributed according to some probability distribution v on (R≥0, B(R≥0)) before being normalized, where v is such that E[X log X)<sup>2</sup> 1 <; ∞, μ<sub>1</sub> := E[X] and μ<sub>2</sub> := E[X log X] for a random variable X with distribution v. We prove that in the limit as n → ∞, the capacity of such a channel converges to μ<sub>2</sub>/μ<sub>1</sub> - log μ<sub>1</sub> almost surely and in L<sup>2</sup>. We further show that the capacity of these random channels converges to this asymptotic value exponentially in n.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124958643","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
A novel correlation model for universal compression of parametric sources 一种新的参数源通用压缩相关模型
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028438
Ahmad Beirami, F. Fekri
{"title":"A novel correlation model for universal compression of parametric sources","authors":"Ahmad Beirami, F. Fekri","doi":"10.1109/ALLERTON.2014.7028438","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028438","url":null,"abstract":"In this paper, we consider k parametric sources with unknown source parameter vectors. In this setup, we propose a novel correlation model where the degree of correlation of each parameter vector is governed by a single variable. We derive the properties of the parameter vectors. In particular, we derive bounds on the correlation between the parameter vectors and show show that this will include independence all the way to convergence in mean square sense. Then, we set up the minimax and maximin games in universal compression and characterize the compression risk under the proposed correlation model when side information from one other source is available at both the encoder and the decoder.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"388 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122657283","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
Gaussian MIMO wiretap channel under receiver side power constraints 接收机侧功率约束下的高斯MIMO窃听信道
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028454
Karim A. Banawan, S. Ulukus
{"title":"Gaussian MIMO wiretap channel under receiver side power constraints","authors":"Karim A. Banawan, S. Ulukus","doi":"10.1109/ALLERTON.2014.7028454","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028454","url":null,"abstract":"We consider the multiple-input multiple-output (MIMO) wiretap channel under a minimum receiver-side power constraint in addition to the usual maximum transmitter-side power constraint. This problem is motivated by energy harvesting communications with wireless energy transfer, where an added goal is to deliver a minimum amount of energy to a receiver in addition to delivering secure data to another receiver. In this paper, we characterize the exact secrecy capacity of the MIMO wiretap channel under transmitter and receiver-side power constraints. We first show that solving this problem is equivalent to solving the secrecy capacity of a wiretap channel with a double-sided correlation matrix constraint on the channel input. We show the converse by extending the channel enhancement technique to our case. We present two achievable schemes that achieve the secrecy capacity: the first achievable scheme uses a Gaussian codebook with a fixed mean, and the second achievable scheme uses artificial noise (or cooperative jamming) together with a Gaussian codebook. The role of the mean or the artificial noise is to enable energy transfer without sacrificing from the secure rate. This is the first instance of a channel model where either the use of a mean signal or use of channel prefixing via artificial noise is strictly necessary in the MIMO wiretap channel.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116604271","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}
引用次数: 6
Dynamic economic dispatch among strategic generators with storage systems 策略发电机组与存储系统之间的动态经济调度
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028556
Wenyuan Tang, R. Jain
{"title":"Dynamic economic dispatch among strategic generators with storage systems","authors":"Wenyuan Tang, R. Jain","doi":"10.1109/ALLERTON.2014.7028556","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028556","url":null,"abstract":"We consider a dynamic economic dispatch problem in wholesale electricity markets. The key feature is that each generator has its own energy storage system, which makes the problem coupled across the time horizon. To implement the optimal dispatch among strategic generators, one major challenge is that the independent system operator is unaware of the operation of the storages. Nevertheless, we show that under certain conditions, the locational marginal pricing mechanism, defined on the static economic dispatch problem, can still induce an efficient Nash equilibrium in the dynamic setting. We also present an alternative pricing mechanism that can induce an efficient Nash equilibrium in a wider range of scenarios.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128787604","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
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信