2007 Information Theory and Applications Workshop最新文献_第2页

Nonlinear Channel Estimation Issues in Cooperative Sensor MIMO 协同传感器MIMO中的非线性信道估计问题

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357582

R. Iltis, R. Cagley

引用次数: 1

Centralized and Distributed Lossy Source Coding of Densely Sampled Gaussian Data, with and without Transforms 密集采样高斯数据的集中和分布式有损源编码，带和不带变换

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357596

D. Neuhoff, S. Pradhan

{"title":"Centralized and Distributed Lossy Source Coding of Densely Sampled Gaussian Data, with and without Transforms","authors":"D. Neuhoff, S. Pradhan","doi":"10.1109/ITA.2007.4357596","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357596","url":null,"abstract":"With mean-squared error D as a goal, it is well known that one may approach the rate-distortion function R(D) of a spatially nonbandlimited, time IID, continuous- space, discrete-time Gaussian source by spatially sampling at a sufficiently high rate, applying the Karhunen-Loeve transform to sufficiently long blocks, and independently coding transform coefficients of each type at the first-order rate-distortion function of that type, with a distortion target chosen appropriately for that type. This paper compares and contrasts this classical result with several recently explored alternative schemes for encoding source samples taken at a high rate. The first scheme, which scalar quantizes the samples and then losslessly encodes the quantized samples at their entropy-rate, is known to have rate approaching infinity when distortion is held at D. Is such catastrophic behavior due to the scalar quantizer or to the distributed nature of the quantization? Recent results show that even without a transform, but with distributed vector quantization, it is possible to attain performance that differs from the rate-distortion function by only a finite constant. This suggests it was the scalar quantizer that caused the catastrophic behavior. The final recent result suggests the situation is more nuanced, because it shows that if in the classical scheme scalar quantizers with entropy coding replace the ideal coding of the coefficients at their first-order rate-distortion functions, then again performance differs from the rate-distortion function by a finite constant.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120952360","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

Bounds on the Network Coding Capacity for Wireless Random Networks 无线随机网络的网络编码容量界限

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357585

S. A. Aly, Vishal Kapoor, Jie Meng, A. Klappenecker

引用次数: 32

On the Detection of Gene Network Interconnections using Directed Mutual Information 基于有向互信息的基因网络互连检测

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357592

P. Mathai, N. C. Martins, B. Shapiro

{"title":"On the Detection of Gene Network Interconnections using Directed Mutual Information","authors":"P. Mathai, N. C. Martins, B. Shapiro","doi":"10.1109/ITA.2007.4357592","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357592","url":null,"abstract":"In this paper, we suggest and validate a systematic method for inferring biological gene networks. So far, the identification of even a small portion of gene networks has been achieved by consensus over multiple cellular biology labs. A gene refers to the sequence of DNA that encodes a single protein. Proteins encoded by a gene can regulate other genes in the living cell, forming a complex network that determines cell growth, health, and disease. We view gene networks as dynamic systems, in discrete-time, formed by the interconnection among genes, which are abstracted as nodes whose state takes values in the range [-1, 1]. The state of each node is a function of the past values of the state of other nodes in the network. The edges of the gene network and their directions indicate functional dependence among the nodes state and their causality relationships, respectively. New engineering developments, such as quantum dot sensors, will allow measurement of gene dynamics inside living cells. From gene time-course data, we show how each edge in a gene network can be inferred using the concept of directed mutual information. We validated our method using small networks generated randomly, as well as for the known network for flagella biosynthesis in E.Coli, which we used to generate gene time-course data (with noise) in simulations. For acyclic graphs with 7 (or fewer) genes with summation operations only, we were able to infer all edges perfectly. We also present a heuristic method to deal with Boolean operations.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121425830","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}

引用次数: 14

Secrecy Capacity Region of Parallel Broadcast Channels 并行广播信道的保密容量区域

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357587

Yingbin Liang, H. Poor, S. Shamai

引用次数: 17

Conditional NML Universal Models 条件NML通用模型

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357600

J. Rissanen, Teemu Roos

{"title":"Conditional NML Universal Models","authors":"J. Rissanen, Teemu Roos","doi":"10.1109/ITA.2007.4357600","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357600","url":null,"abstract":"The NML (normalized maximum likelihood) universal model has certain minmax optimal properties but it has two shortcomings: the normalizing coefficient can be evaluated in a closed form only for special model classes, and it does not define a random process so that it cannot be used for prediction. We present a universal conditional NML model, which has minmax optimal properties similar to those of the regular NML model. However, unlike NML, the conditional NML model defines a random process which can be used for prediction. It also admits a recursive evaluation for data compression. The conditional normalizing coefficient is much easier to evaluate, for instance, for tree machines than the integral of the square root of the Fisher information in the NML model. For Bernoulli distributions, the conditional NML model gives a predictive probability, which behaves like the Krichevsky-Trofimov predictive probability, actually slightly better for extremely skewed strings. For some model classes, it agrees with the predictive probability found earlier by Takimoto and Warmuth, as the solution to a different more restrictive minmax problem. We also calculate the CNML models for the generalized Gaussian regression models, and in particular for the cases where the loss function is quadratic, and show that the CNML model achieves asymptotic optimality in terms of the mean ideal code length. Moreover, the quadratic loss, which represents fitting errors as noise rather than prediction errors, can be shown to be smaller than what can be achieved with the NML as well as with the so-called plug-in or the predictive MDL model.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"41 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113986185","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}

引用次数: 47

Information Theoretic Measures for Quantifying the Integration of Neural Activity 量化神经活动整合的信息论方法

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357556

Selin Aviyente

{"title":"Information Theoretic Measures for Quantifying the Integration of Neural Activity","authors":"Selin Aviyente","doi":"10.1109/ITA.2007.4357556","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357556","url":null,"abstract":"In recent years, there has been a growing interest in quantifying the interaction and integration between different neuronal activities in the brain. One problem of interest has been to quantify how different neuronal sites communicate with each other. For this purpose, different measures of functional integration such as spectral coherence, phase synchrony and mutual information have been proposed. In this paper, we introduce information-theoretic measures such as entropy and divergence to quantify the interaction between different neuronal sites. The information- theoretic measures introduced in this paper are adapted to the time-frequency domain to account for the dynamic nature of neuronal activity. Time-frequency distributions are two-dimensional energy density functions of time and frequency, and can be treated in a way similar to probability density functions. Since time-frequency distributions are not always positive, information measures such as Renyi entropy and Jensen-Renyi divergence are adapted to this new domain instead of the well-known Shannon entropy. In this paper, we first discuss some properties of these modified measures and then illustrate their application to neural signals. The proposed measures are applied to multiple electrode recordings of electroencephalogram (EEG) data to quantify the interaction between different neuronal sites and between different cognitive states.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124026714","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}

引用次数: 7

An iterative algorithm for optimizing the conditional lifetimes of distributed sensors 分布式传感器条件寿命优化的迭代算法

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357590

J. Dagher, M. Marcellin, M. Neifeld

引用次数: 0

On the Diversity-Multiplexing Tradeoff for Frequency-Selective MIMO Channels 选频MIMO信道分集-复用权衡研究

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357614

D. Slock

引用次数: 9

Location-based MAC Protocols for Mobile Wireless Networks 移动无线网络中基于位置的MAC协议

2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357560

Ning Wen, R. Berry

引用次数: 8