Pub Date : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447081
Hoi-To Wai, A. Scaglione, Amir Leshem
No man is an island: the opinions that shape human economic decisions reflect the fabric of trust that exists between one agent and its social network. In this work we discuss how stubborn agents in a network expose the relative trust that exists among the agents, by analyzing the system equations that are used in popular opinion diffusion models. We propose methods to measure the agents beliefs from their actions on social media. Preliminary results with simulations and real data highlight the interesting insights that can be gained by interpreting the social network interactions under this lens. We also discuss how the perception of personal utility in an economic transaction can be inferred by identifying the relative trust and controlling the stubborn agents influence, advertising through them products so that the social network perceives them more favorably.
{"title":"Identifying trust in social networks with stubborn agents, with application to market decisions","authors":"Hoi-To Wai, A. Scaglione, Amir Leshem","doi":"10.1109/ALLERTON.2015.7447081","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447081","url":null,"abstract":"No man is an island: the opinions that shape human economic decisions reflect the fabric of trust that exists between one agent and its social network. In this work we discuss how stubborn agents in a network expose the relative trust that exists among the agents, by analyzing the system equations that are used in popular opinion diffusion models. We propose methods to measure the agents beliefs from their actions on social media. Preliminary results with simulations and real data highlight the interesting insights that can be gained by interpreting the social network interactions under this lens. We also discuss how the perception of personal utility in an economic transaction can be inferred by identifying the relative trust and controlling the stubborn agents influence, advertising through them products so that the social network perceives them more favorably.","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":"115450352","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}
Pub Date : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447188
Kuo-Lun Huang, V. Gaudet, M. Salehi
We introduce a low-latency stochastic decoding algorithm, called conditional stochastic decoding, to implement iterative Low-Density Parity-Check (LDPC) decoders. The conditional stochastic decoder, which utilizes reliable messages in the decoding process and the channel receiving probability to generate stochastic streams, improves error rate performance and decreases decoding latency. Compared to conventional stochastic decoders, the proposed algorithm achieves more than 20-percent reduction in the decoding latency for the (1056,528) LDPC code from the WiMAX standard. We also show that the proposed algorithm, due to its lower frame error rate, is a suitable choice to be used in the Hybrid Automatic Repeat reQuest (HARQ) systems.
{"title":"A low-latency algorithm for stochastic decoding of LDPC codes","authors":"Kuo-Lun Huang, V. Gaudet, M. Salehi","doi":"10.1109/ALLERTON.2015.7447188","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447188","url":null,"abstract":"We introduce a low-latency stochastic decoding algorithm, called conditional stochastic decoding, to implement iterative Low-Density Parity-Check (LDPC) decoders. The conditional stochastic decoder, which utilizes reliable messages in the decoding process and the channel receiving probability to generate stochastic streams, improves error rate performance and decreases decoding latency. Compared to conventional stochastic decoders, the proposed algorithm achieves more than 20-percent reduction in the decoding latency for the (1056,528) LDPC code from the WiMAX standard. We also show that the proposed algorithm, due to its lower frame error rate, is a suitable choice to be used in the Hybrid Automatic Repeat reQuest (HARQ) systems.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"49 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":"128438666","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}
Pub Date : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447129
A. Kipnis, Yonina C. Eldar, A. Goldsmith
The jointly optimized sampling rate and quantization precision in A/D conversion is studied. In particular, we consider a basic pulse code modulation A/D scheme in which a stationary process is sampled and quantized by a scalar quantizer. We derive an expression for the minimal mean squared error under linear estimation of the analog input from the digital output, which is also valid under sub-Nyquist sampling. This expression allows for the computation of the sampling rate that minimizes the error under a fixed bitrate at the output, which is the result of an interplay between the number of bits allocated to each sample and the distortion resulting from sampling. We illustrate the results for several examples, which demonstrate the optimality of sub-Nyquist sampling in certain cases.
{"title":"Optimal trade-off between sampling rate and quantization precision in A/D conversion","authors":"A. Kipnis, Yonina C. Eldar, A. Goldsmith","doi":"10.1109/ALLERTON.2015.7447129","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447129","url":null,"abstract":"The jointly optimized sampling rate and quantization precision in A/D conversion is studied. In particular, we consider a basic pulse code modulation A/D scheme in which a stationary process is sampled and quantized by a scalar quantizer. We derive an expression for the minimal mean squared error under linear estimation of the analog input from the digital output, which is also valid under sub-Nyquist sampling. This expression allows for the computation of the sampling rate that minimizes the error under a fixed bitrate at the output, which is the result of an interplay between the number of bits allocated to each sample and the distortion resulting from sampling. We illustrate the results for several examples, which demonstrate the optimality of sub-Nyquist sampling in certain cases.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"4 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":"131187324","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}
Pub Date : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447169
Rémi A. Chou, M. Bloch
We show how to replace some of the randomized decisions in the encoding and decoding of polar codes by deterministic decisions. Specifically, we prove that random decisions on low-entropy bits may be replaced by an argmax decision without any loss of performance. We illustrate the usefulness of this result in the case of polar coding for the Wyner-Ziv problem and for channel coding.
{"title":"Using deterministic decisions for low-entropy bits in the encoding and decoding of polar codes","authors":"Rémi A. Chou, M. Bloch","doi":"10.1109/ALLERTON.2015.7447169","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447169","url":null,"abstract":"We show how to replace some of the randomized decisions in the encoding and decoding of polar codes by deterministic decisions. Specifically, we prove that random decisions on low-entropy bits may be replaced by an argmax decision without any loss of performance. We illustrate the usefulness of this result in the case of polar coding for the Wyner-Ziv problem and for channel coding.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"90 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":"114491785","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}
Pub Date : 2015-09-01DOI: 10.1109/ALLERTON.2015.7446983
Ehsan Kazemi, Lyudmila Yartseva, M. Grossglauser
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.
{"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}
Pub Date : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447098
M. Nguyen, Hung M. La, K. Teague
In this paper, we propose a compressive and collaborative sensing (CCS) algorithm for distributed robotic networks to build scalar field map. A collaborative control law is utilized to steer the robots to move on the field while avoiding collision with each other and with obstacles. At each time instant, the robots collect, add measurements within their sensing range and exchange data with their neighbors to form compressive sensing (CS) measurements at each robot. After a certain times of moving and sampling, each robot can achieve that number of CS measurements to be able to reconstruct all sensory readings from the positions that the group of robots visited to build a scalar map. We further analyze and formulate the total communication power consumption associated with the number of robots, sensor communication range and provide suggestions for more energy saving.
{"title":"Compressive and collaborative mobile sensing for scalar field mapping in robotic networks","authors":"M. Nguyen, Hung M. La, K. Teague","doi":"10.1109/ALLERTON.2015.7447098","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447098","url":null,"abstract":"In this paper, we propose a compressive and collaborative sensing (CCS) algorithm for distributed robotic networks to build scalar field map. A collaborative control law is utilized to steer the robots to move on the field while avoiding collision with each other and with obstacles. At each time instant, the robots collect, add measurements within their sensing range and exchange data with their neighbors to form compressive sensing (CS) measurements at each robot. After a certain times of moving and sampling, each robot can achieve that number of CS measurements to be able to reconstruct all sensory readings from the positions that the group of robots visited to build a scalar map. We further analyze and formulate the total communication power consumption associated with the number of robots, sensor communication range and provide suggestions for more energy saving.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"13 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":"123570505","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}
Pub Date : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447150
J. Lipor, L. Balzano, B. Kerkez, D. Scavia
Adaptive sampling theory has shown that, with proper assumptions on the signal class, algorithms exist to reconstruct a signal in ℝd with an optimal number of samples. We generalize this problem to when the cost of sampling is not only the number of samples but also the distance traveled between samples. This is motivated by our work studying regions of low oxygen concentration in the Great Lakes. We show that for one-dimensional threshold classifiers, a tradeoff between number of samples and distance traveled can be achieved using a generalization of binary search, which we refer to as quantile search. We derive the expected total sampling time for noiseless measurements and the expected number of samples for an extension to the noisy case. We illustrate our results in simulations relevant to our sampling application.
{"title":"Quantile search: A distance-penalized active learning algorithm for spatial sampling","authors":"J. Lipor, L. Balzano, B. Kerkez, D. Scavia","doi":"10.1109/ALLERTON.2015.7447150","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447150","url":null,"abstract":"Adaptive sampling theory has shown that, with proper assumptions on the signal class, algorithms exist to reconstruct a signal in ℝd with an optimal number of samples. We generalize this problem to when the cost of sampling is not only the number of samples but also the distance traveled between samples. This is motivated by our work studying regions of low oxygen concentration in the Great Lakes. We show that for one-dimensional threshold classifiers, a tradeoff between number of samples and distance traveled can be achieved using a generalization of binary search, which we refer to as quantile search. We derive the expected total sampling time for noiseless measurements and the expected number of samples for an extension to the noisy case. We illustrate our results in simulations relevant to our sampling application.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"32 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":"129446910","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}
Pub Date : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447068
S. Aeron, Eric Kernfeld
In this paper we consider the problem of group-invariant subspace clustering where the data is assumed to come from a union of group-invariant subspaces of a vector space, i.e. subspaces which are invariant with respect to action of a given group. Algebraically, such group-invariant subspaces are also referred to as submodules. Similar to the well known Sparse Subspace Clustering approach where the data is assumed to come from a union of subspaces, we analyze an algorithm which, following a recent work [1], we refer to as Sparse Sub-module Clustering (SSmC). The method is based on finding group-sparse self-representation of data points. In this paper we primarily derive general conditions under which such a group-invariant subspace identification is possible. In particular we extend the geometric analysis in [2] and in the process we identify a related problem in geometric functional analysis.
{"title":"Group-invariant Subspace Clustering","authors":"S. Aeron, Eric Kernfeld","doi":"10.1109/ALLERTON.2015.7447068","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447068","url":null,"abstract":"In this paper we consider the problem of group-invariant subspace clustering where the data is assumed to come from a union of group-invariant subspaces of a vector space, i.e. subspaces which are invariant with respect to action of a given group. Algebraically, such group-invariant subspaces are also referred to as submodules. Similar to the well known Sparse Subspace Clustering approach where the data is assumed to come from a union of subspaces, we analyze an algorithm which, following a recent work [1], we refer to as Sparse Sub-module Clustering (SSmC). The method is based on finding group-sparse self-representation of data points. In this paper we primarily derive general conditions under which such a group-invariant subspace identification is possible. In particular we extend the geometric analysis in [2] and in the process we identify a related problem in geometric functional analysis.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"56 5 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":"128977560","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}
Pub Date : 2015-09-01DOI: 10.1109/ALLERTON.2015.7447010
R. Jungers, A. Kundu, W. Heemels
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.
{"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}
Pub Date : 2015-09-01DOI: 10.1109/ALLERTON.2015.7446997
Lele Wang, Young-Han Kim
We study the duality between channel coding and Slepian-Wolf coding in the linear coding framework. We show how a code (both its encoder and decoder) for a symmetric channel coding problem can be used to design a code for a general Slepian-Wolf problem. Conversely, we show how a code for a symmetric Slepian-Wolf problem can be used to design a code for a general channel coding problem. The exact relations between the rates and the probability of errors of the two codes are established.
{"title":"Linear code duality between channel coding and Slepian-Wolf coding","authors":"Lele Wang, Young-Han Kim","doi":"10.1109/ALLERTON.2015.7446997","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7446997","url":null,"abstract":"We study the duality between channel coding and Slepian-Wolf coding in the linear coding framework. We show how a code (both its encoder and decoder) for a symmetric channel coding problem can be used to design a code for a general Slepian-Wolf problem. Conversely, we show how a code for a symmetric Slepian-Wolf problem can be used to design a code for a general channel coding problem. The exact relations between the rates and the probability of errors of the two codes are established.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"29 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":"121689525","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：