2014 48th Annual Conference on Information Sciences and Systems (CISS)最新文献

{"title":"Wireless network optimization by Perron-Frobenius theory","authors":"C. Tan","doi":"10.1561/1300000048","DOIUrl":"https://doi.org/10.1561/1300000048","url":null,"abstract":"A basic question in wireless networking is how to optimize the wireless network resource allocation for utility maximization and interference management. In this paper, we present an overview of a Perron-Frobenius theoretic framework to overcome the notorious non-convexity barriers in wireless utility maximization problems. Through this approach, the optimal value and solution of the optimization problems can be analytically characterized by the spectral property of matrices induced by nonlinear positive mappings. It also provides a systematic way to derive distributed and fast-convergent algorithms and to evaluate the fairness of resource allocation. This approach can even solve several previously open problems in the wireless networking literature, e.g., Kandukuri and Boyd (TWC 2002), Wiesel, Eldar and Shamai (TSP 2006), Krishnan and Luss (WCNC 2011). More generally, this approach links fundamental results in nonnegative matrix theory and (linear and nonlinear) Perron-Frobenius theory with the solvability of non-convex problems. In particular, for seemingly nonconvex problems, e.g., max-min wireless fairness problems, it can solve them optimally; for truly nonconvex problems, e.g., sum rate maximization, it can even be used to identify polynomial-time solvable special cases or to enable convex relaxation for global optimization. To highlight the key aspects, we also present a short survey of our recent efforts in developing the nonlinear Perron-Frobenius theoretic framework to solve wireless network optimization problems with applications in MIMO wireless cellular, heterogeneous small-cell and cognitive radio networks. Key implications arising from these work along with several open issues are discussed.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124280411","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}

{"title":"A model for electron transfer and cell energetics in bacterial cables","authors":"Nicolò Michelusi, Sahand Pirbadian, M. El‐Naggar, U. Mitra","doi":"10.1109/CISS.2014.6814163","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814163","url":null,"abstract":"Biological systems are known to communicate by diffusing chemical signals in the surrounding medium. However, most of the recent literature has neglected the electron transfer mechanism occurring amongst living cells, and its role in cell-to-cell communication. While the importance of biological electron transfer is well-known for individual cells, the past decade has also brought about remarkable discoveries of multi-cellular microbial communities that transfer electrons between cells and across centimeter length scales, e.g., biofilms and multi-cellular bacterial cables. This paper develops a stochastic model that links electron transfer to the energetic state of the cell. The model is also extensible to larger communities, by allowing for electron exchange between neighboring cells. The proposed model is a first step towards the design of electron-based communication networks in microbial communities, which may co-exist with the more well-known communication strategies based on molecular diffusion, while benefiting from a much shorter signaling delay.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116917070","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}

{"title":"Microscopic generative models for complex networks","authors":"L. Zhang, P. Marbach","doi":"10.1109/CISS.2014.6814136","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814136","url":null,"abstract":"Over the last decade there has been growing interest in the understanding of complex networks such as the Internet, the World Wide Web and social networks. A large part of the research in this area has focused on macroscopic properties and models for complex networks such as the power law distribution of edge degrees and the small world phenomenon. Less attention has been paid to microscopic properties and models that try to model and explain the interaction and dynamics between individual vertices in a network. In this paper we discuss why such microscopic models play an important part in understanding complex networks. In particular we present examples of how microscopic generative models can be used to design efficient algorithms for complex networks.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116995117","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}

{"title":"Analog mappings for flexible rate transmission of Gaussian sources with side information","authors":"B. Lu, J. Garcia-Frías","doi":"10.1109/CISS.2014.6814102","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814102","url":null,"abstract":"This paper considers the problem of designing bandwidth expansion zero-delay analog joint source-channel coding (JSCC) schemes for the transmission of memoryless Gaussian samples over additive white Gaussian noise (AWGN) channels when side information is present at the receiver (Wyner-Ziv scenario). We first propose a 1 : 1 scheme and a 1 : M scheme based on the use of Shannon-Kotel'nikov mappings in a periodic fashion. Then, we combine the two proposed mappings to construct a flexible rate bandwidth expansion mapping whose rate can be anywhere from 1 : 1 to 1 : M. Different from digital systems, the proposed scheme offers low delay, low complexity and high robustness. Simulation results show that the performance of the proposed 1 : 2 scheme is better than that of existing zero-delay systems for a wide range of signal to noise ratios, but especially for high signal to noise ratios and highly correlated side information. The proposed flexible rate bandwidth expansion system also offers satisfactory performance, specially when considering its great flexibleness in terms of rate.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127142075","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}

{"title":"Capturing subject variability in data driven fMRI analysis: A graph theoretical comparison","authors":"Jonathan Laney, Kelly P Westlake, Sai Ma, Elizabeth J Woytowicz, T. Adalı","doi":"10.1109/CISS.2014.6814109","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814109","url":null,"abstract":"Recent simulation studies, using functional magnetic resonance imaging (fMRI) like data, have shown that independent vector analysis (IVA) is a superior solution for capturing subject variability when compared to the popular group independent component analysis. This is of fundamental importance for identifying group differences which is a common goal of medical research. Nevertheless, there have not been similar studies on the effectiveness of IVA using real fMRI data. The main difficulties when working with real data are the lack of a ground truth and the high variability among subjects when performing the analysis. In this paper, we present a graph-theoretic approach to effectively compare an algorithm's ability to capture subject variability for real fMRI data and also address the important issue of order selection for capturing subject variability.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115459227","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}

{"title":"Encompassing anonymity in signaling games","authors":"A. Mishra, P. Venkitasubramaniam","doi":"10.1109/CISS.2014.6814073","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814073","url":null,"abstract":"Signaling games are an important class of games in the literature of game theory, finding wide spread application in modelling financial behavior in markets, economic reasoning in job searches, and evolutionary behavior in the emergence of languages. Fundamentally, signaling games consist of multiple senders and a common receiver. Each sender belongs to one of multiple types. Senders transmit their messages to the receiver. The receiver takes an action for each received message, which results in a pair of rewards for the receiver and the corresponding sender respectively. Each sender therefore chooses a message that maximizes his/her reward knowing the optimal response of the receiver. In classical signaling games, the senders reward is a deterministic function of the transmitted message and receiver's action, while the receivers reward is a function of the action and belief about the senders' type. Therefore, in a signaling game, the message received provides information about a sender's type which, in practical commercial contexts, is a violation of the sender's anonymity. In this work, the payoff of a signaling game is adjusted to incorporate the information revealed to the receivers such that this information leakage is minimized from the sender's perspective. The existence of Bayesian-Nash equilibrium is proven in this work for the signaling games even after the incorporation of “type anonymity”. In particular, when the reward is modeled as a weighted sum of the anonymity and direct signaling reward, there exists a threshold on the anonymity weighting coefficient; when the coefficient exceeds the threshold, a pooling equilibrium exists-senders of all types transmit the same message, and when the coefficient is below the threshold, a separating equilibrium exists-senders of each type transmit a distinct message. Furthermore when the cardinality of the message set is 2, the separating equilibrium is shown to be the unique Bayesian Nash equilibrium. The proposed signaling game is suitable to model the problem of routing in the datagram networking where Quality of service (delay or throughput) and the source-destination anonymity are competing requirements.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129211512","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}

{"title":"Smooth representation of rankings","authors":"A. Mazumdar, O. Milenkovic","doi":"10.1109/CISS.2014.6814149","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814149","url":null,"abstract":"An encoding of data for digital storage is called smooth, if, for any small change in the raw data, only a proportionately small change has to be made in the encoded data. In this paper, we consider the problem of smooth encoding for ordinal data, i.e., ranking of objects. It is shown that, simple efficient smooth encoding for storage (as well as compression) of rankings is possible with respect to the well-known Kendall τ metric on permutations.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114843022","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}

{"title":"A left-to-right HDP-HMM with HDPM emissions","authors":"A. Torbati, J. Picone, M. Sobel","doi":"10.1109/CISS.2014.6814172","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814172","url":null,"abstract":"Nonparametric Bayesian models use a Bayesian framework to learn the model complexity automatically from the data and eliminate the need for a complex model selection process. The Hierarchical Dirichlet Process hidden Markov model (HDP-HMM) is the nonparametric Bayesian equivalent of an HMM. However, HDP-HMM is restricted to an ergodic topology and uses a Dirichlet Process Model (DPM) to achieve a mixture distribution-like model. For applications such as speech recognition, where we deal with ordered sequences, it is desirable to impose a left-to-right structure on the model to improve its ability to model the sequential nature of the speech signal. In this paper, we introduce three enhancements to HDP-HMM: (1) a left-to-right structure: needed for sequential decoding of speech, (2) non-emitting initial and final states: required for modeling finite length sequences, (3) HDP mixture emissions: allows sharing of data across states. The latter is particularly important for speech recognition because Gaussian mixture models have been very effective at modeling speaker variability. Further, due to the nature of language, some models occur infrequently and have a small number of data points associated with them, even for large corpora. Sharing allows these models to be estimated more accurately. We demonstrate that this new HDP-HMM model produces a 15% increase in likelihoods and a 15% relative reduction in error rate on a phoneme classification task based on the TIMIT Corpus.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134080443","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}

{"title":"A hybrid digital-analog scheme for the Multiple Access Channel","authors":"Mohamed Hassanin, J. Garcia-Frías","doi":"10.1109/CISS.2014.6814117","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814117","url":null,"abstract":"We present a new access scheme for the AWGN Multiple Access Channel (MAC). The proposed system is a hybrid scheme consisting of the combination of analog joint source-channel coding with a digital part. We will particularize the system for the two user case, proving that it can achieve any point in the convex hull of the capacity region.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134192872","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}

{"title":"Capacity analysis of a discrete-time bufferless timing channel","authors":"M. Tavan, R. Yates, W. Bajwa","doi":"10.1109/CISS.2014.6814127","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814127","url":null,"abstract":"This paper investigates the capacity of a discrete-time channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly studied under the assumption of a work-conserving queue. In contrast, this paper studies the case of a discrete-time bufferless queue that drops arriving packets while a packet is in service. Under this bufferless model, the paper provides upper bounds on the capacity of timing channels and establishes capacity for the case of bufferless M/M/1 queue.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130689756","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}