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

The compound secrecy capacity of a class of non-degraded MIMO Gaussian channels 一类非退化MIMO高斯信道的复合保密能力

2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028564

R. Schaefer, S. Loyka

引用次数: 6

Low delay random linear coding over a stream 流式上的低延迟随机线性编码

2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028499

M. Karzand, D. Leith

引用次数: 34

Information friction limits on computation 信息摩擦限制了计算

2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028441

P. Vyavahare, Majid Mahzoon, P. Grover, N. Limaye, D. Manjunath

引用次数: 2

On the relationship between queues and multipliers 关于队列和乘法器之间的关系

2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028463

Víctor Valls, D. Leith

引用次数: 5

Study of the brain functional network using synthetic data 利用合成数据研究脑功能网络

2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028476

S. Sojoudi, J. Doyle

引用次数: 16

Computing with 10,000-bit words 10000位字的计算

2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028470

P. Kanerva

{"title":"Computing with 10,000-bit words","authors":"P. Kanerva","doi":"10.1109/ALLERTON.2014.7028470","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028470","url":null,"abstract":"Today's computers compute with numbers and memory pointers that hardly ever exceed 64 bits. With nan-otechnology we will soon be able to build computers with 10,000-bit words. How would such a computer work and what would it be good for? The paper describes a 10,000bit architecture that resembles von Neumann's. It has a random-access memory (RAM) for 10,000-bit words, and an arithmetic-logic unit (ALU) for “adding” and “multiplying” 10,000-bit words, in abstract algebra sense. Sets, sequences, lists, and other data structures are encoded “holographically” from their elements using addition and multiplication, and they end up as vectors of the same 10,000-dimensional space, which makes recursive composition possible. The theory of computing with high-dimensional vectors (e.g. with 10,000-bit words) has grown out of attempts to understand the brain's powers of perception and learning in computing terms and is based on the geometry and algebra of high-dimensional spaces, dynamical systems, and the statistical law of large numbers. The architecture is suited for statistical learning from data and is used in cognitive modeling and natural-language processing where it is referred to by names such as Holographic Reduce Representation, Vector Symbolic Architecture, Random Indexing, Semantic Indexing, Semantic Pointer Architecture, and Hyperdimensional Computing.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 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":"130011708","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}

引用次数: 29

Asymmetric Compute-and-Forward: Going beyond one hop 非对称计算和转发:超越一次跳跃

2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028519

Yihua Tan, Xiaojun Yuan, S. Liew, A. Kavcic

{"title":"Asymmetric Compute-and-Forward: Going beyond one hop","authors":"Yihua Tan, Xiaojun Yuan, S. Liew, A. Kavcic","doi":"10.1109/ALLERTON.2014.7028519","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028519","url":null,"abstract":"We consider a two-hop relay model in which multiple sources communicate with a single destination via multiple distributed relays. We propose an asymmetric Compute-and-Forward (CoF) scheme that allows lattice coding with different coarse and fine lattices at the sources. The proposed scheme is motivated by the observation that, in an asymmetric CoF system, a higher transmission power at a source does not necessarily translate to a higher achievable information rate. We show that significant performance enhancement can be achieved by optimizing the transmission powers of the sources below their respective budgets. Further, the asymmetric construction of lattice coding allows the relays to conduct different modulo operations to reduce their forwarding rates, thereby supporting higher rates at the sources. However, modulo operations in general incur information loss, and so need to be carefully designed to ensure that the destination can successfully recover the source messages. As such, we propose a novel successive recovering algorithm for decoding at the destination, and establish sufficient conditions to guarantee successful recovery. Numerical results are provided to verify the superiority of our proposed scheme over other schemes.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"38 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132444410","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}

引用次数: 8

Distributed testing against independence with multiple terminals 针对多终端的独立性进行分布式测试

2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028598

Wenwen Zhao, L. Lai

引用次数: 30

Least favorable distributions to facilitate the design of detection systems with sensors at deterministic locations 最不利分布，以方便设计具有确定位置传感器的检测系统

2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028446

Benedito J. B. Fonseca

{"title":"Least favorable distributions to facilitate the design of detection systems with sensors at deterministic locations","authors":"Benedito J. B. Fonseca","doi":"10.1109/ALLERTON.2014.7028446","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028446","url":null,"abstract":"The design of a sensor detection system to detect an emitter at a random location is difficult because of two issues: the conditional dependence among sensors' measurements and the composite hypothesis caused by the lack of knowledge regarding the emitter location distribution. When sensor locations are also random, it was recently shown that it is possible to circumvent these issues by using a least favorable distribution for the emitter location; however, such results do not apply when sensors are at deterministic known locations. In this paper, it is shown that a least favorable distribution for the emitter location can also facilitate the design of sensor detection systems when sensors are at deterministic known locations. It is further shown that, in several cases of interest, the problem of finding a least favorable distribution for the emitter location is equivalent to the obnoxious facility location problem from the field of operations research; and it is shown how the techniques of this field can be used to find the least favorable distribution and facilitate the system design.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"77 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":"125408684","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

Direct load control for electricity market risk management via risk-limiting dynamic contracts 通过限制风险的动态合同直接控制电力市场风险

2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028572

Insoon Yang, Duncan S. Callaway, C. Tomlin

{"title":"Direct load control for electricity market risk management via risk-limiting dynamic contracts","authors":"Insoon Yang, Duncan S. Callaway, C. Tomlin","doi":"10.1109/ALLERTON.2014.7028572","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028572","url":null,"abstract":"This paper proposes a new direct load control framework that provides financial risk management solutions for real-time electricity markets. In this program, a load-serving entity makes risk-limiting dynamic contracts with its customers to optimally manage its revenue and risk. This risk is generated by both price volatility and demand uncertainty regarding distributed renewable generation as negative load. The key feature of our contract method is its risk-limiting capability: the amount of risk transferred to each customer is less than or equal to a pre-specified threshold. This is achieved by formulating the contract design problem as mean-variance constrained risk-sensitive control. We develop a dynamic programming-based solution approach. We demonstrate the performance of the proposed contracts by using locational marginal price (LMP) data from the Electricity Reliability Council of Texas and data on the electric energy consumption of customers in Austin, Texas. The numerical experiments suggest that the proposed direct load control program efficiently manages the load-serving entity's and its customers' risks even when the load-serving entity passes the wholesale electricity price to the customers.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"14 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":"125688395","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