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

Identifying trust in social networks with stubborn agents, with application to market decisions 通过顽固的代理识别社会网络中的信任，并将其应用于市场决策

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

Hoi-To Wai, A. Scaglione, Amir Leshem

引用次数: 2

A low-latency algorithm for stochastic decoding of LDPC codes LDPC码随机译码的低延迟算法

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

Kuo-Lun Huang, V. Gaudet, M. Salehi

引用次数: 2

Optimal trade-off between sampling rate and quantization precision in A/D conversion A/D转换中采样率与量化精度的最佳权衡

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

A. Kipnis, Yonina C. Eldar, A. Goldsmith

引用次数: 7

Using deterministic decisions for low-entropy bits in the encoding and decoding of polar codes 在极码的编码和解码中对低熵位使用确定性决策

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

Rémi A. Chou, M. Bloch

引用次数: 33

When can two unlabeled networks be aligned under partial overlap? 什么时候两个未标记的网络可以在部分重叠下对齐?

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

Ehsan Kazemi, Lyudmila Yartseva, M. Grossglauser

{"title":"When can two unlabeled networks be aligned under partial overlap?","authors":"Ehsan Kazemi, Lyudmila Yartseva, M. Grossglauser","doi":"10.1109/ALLERTON.2015.7446983","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7446983","url":null,"abstract":"Network alignment refers to the problem of matching the vertex sets of two unlabeled graphs, which can be viewed as a generalization of the classic graph isomorphism problem. Network alignment has applications in several fields, including social network analysis, privacy, pattern recognition, computer vision, and computational biology. A number of heuristic algorithms have been proposed in these fields. Recent progress in the analysis of network alignment over stochastic models sheds light on the interplay between network parameters and matchability. In this paper, we consider the alignment problem when the two networks overlap only partially, i.e., there exist vertices in one network that have no counterpart in the other. We define a random bigraph model that generates two correlated graphs G1,2; it is parameterized by the expected node overlap t2 and by the expected edge overlap s2. We define a cost function for structural mismatch under a particular alignment, and we identify a threshold for perfect matchability: if the average node degrees of G1,2 grow as ω(s-2t-1 log(n)), then minimization of the proposed cost function results in an alignment which (i) is over exactly the set of shared nodes between G1 and G2, and (ii) agrees with the true matching between these shared nodes. Our result shows that network alignment is fundamentally robust to partial edge and node overlaps.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"56 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":"123210245","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}

引用次数: 42

Compressive and collaborative mobile sensing for scalar field mapping in robotic networks 机器人网络中标量场映射的压缩和协同移动传感

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

M. Nguyen, Hung M. La, K. Teague

引用次数: 17

Quantile search: A distance-penalized active learning algorithm for spatial sampling 分位数搜索:空间采样的距离惩罚主动学习算法

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

J. Lipor, L. Balzano, B. Kerkez, D. Scavia

引用次数: 3

Group-invariant Subspace Clustering 群不变子空间聚类

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

S. Aeron, Eric Kernfeld

引用次数: 7

On observability in networked control systems with packet losses 丢包网络控制系统的可观察性研究

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

R. Jungers, A. Kundu, W. Heemels

{"title":"On observability in networked control systems with packet losses","authors":"R. Jungers, A. Kundu, W. Heemels","doi":"10.1109/ALLERTON.2015.7447010","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447010","url":null,"abstract":"This paper deals with observability properties of networked control systems subject to packet losses. We employ a switching systems perspective in which available information on the packet loss signal, e.g., there can be at most a pre-specified number of consecutive losses, is modelled through an automaton. Based on this perspective we address several natural extensions envisioned in [7]. Our specific contributions are as follows. Firstly, we show that the method introduced in [7] in the context of controllability of linear systems subject to packet losses extends to the question of observability. The proposed characterization is necessary and sufficient as well as algorithmically verifiable. For the observability problem, our proof is valid also for non-invertible matrices, thereby improving upon the previous results in [7]. Secondly, we show that the model employed for our analysis encompasses the model of wireless control networks with switching delays introduced in [6] (though at a cost of exponential encoding). We raise several open questions related to the algebraic nature of the problem under consideration.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"65 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120966012","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

Linear code duality between channel coding and Slepian-Wolf coding 信道编码与睡眠狼编码之间的线性编码对偶性

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

Lele Wang, Young-Han Kim

引用次数: 8