{"title":"Analysis on the complexity of the problem to construct the most parsimonious phylogenetic trees","authors":"Fulu Li","doi":"10.1109/CISS.2010.5464727","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464727","url":null,"abstract":"With the availability of ever-increasing gene sequence data across a large number of species, reconstruction of phylogenetic trees to reveal the evolution relationship among those species becomes more and more important. In this paper, we present a novel proof of the NP-completeness of the large parsimony problem by reduction from a newly-proved NP-complete problem [3,17,18] to gain additional insight of this fundamental problem in computational biology. We then conduct experiments based upon our recent work [15] of a random tree optimization algorithm based on cross-entropy method [23] for the construction of the most parsimonious phylogenetic trees across 12 Drosophila genomes [21].","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123822431","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":"Mutual dependence for secret key agreement","authors":"Chung Chan, Lizhong Zheng","doi":"10.1109/CISS.2010.5464805","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464805","url":null,"abstract":"A mutual dependence expression is established for the secret key agreement problem when all users are active. In certain source networks, the expression can be interpreted as certain notions of connectivity and network information flow. In particular, the secrecy problem can be mapped to a new class of network coding problems with selectable links and undirected broadcast links. For such networks, the secrecy capacities serve as upper bounds on the maximum network throughputs, while the network coding solutions can be used for secret key agreement.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124173934","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":"Unconstrained minimization of quadratic functions via min-sum","authors":"Nicholas Ruozzi, S. Tatikonda","doi":"10.1109/CISS.2010.5464748","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464748","url":null,"abstract":"Gaussian belief propagation is an iterative algorithm for computing the mean of a multivariate Gaussian distribution. Equivalently, the min-sum algorithm can be used to compute the minimum of a multivariate positive definite quadratic function. Although simple sufficient conditions that guarantee the convergence and correctness of these algorithms are known, the algorithms may fail to converge to the correct solution even when restricted to only positive definite quadratic functions. In this work, we propose a novel change to the typical factorization used in GaBP that allows us to construct a variant of GaBP that can solve the minimization problem for arbitrary positive semidefinite matrices while still preserving the distributed message passing nature of GaBP. We prove that the new factorization avoids the major pitfalls of the standard factorization, and we demonstrate empirically that the algorithm can be used to solve problems for which the standard GaBP algorithm would have failed. As quadratic minimization is equivalent to solving a system of linear equations, this work can be applied to solve large positive semidefinite linear systems in many application areas.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122282435","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":"Hierarchical MIMO: A clustering approach for Ad hoc wireless sensor networks","authors":"Mehwish Nasim, Saad B. Qaisar","doi":"10.1109/CISS.2010.5464708","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464708","url":null,"abstract":"MIMO based communication protocols have been proposed for energy conservation in wireless sensor networks. In this paper we present an energy efficient clustering framework. We implement a hierarchical clusterhead selection algorithm which chooses the clusterheads and the cooperating nodes to achieve high energy gains in cooperative MIMO communication. The algorithm selects the clusterhead on the basis of residual energy of the nodes. The reclustering approach ensures minimum disturbance in the network. The local communication within a cluster takes place via SISO. Each cluster is led by a clusterhead. The clusterhead and cooperative node forward data to the routing clusterheads via 2x2 MIMO. The data is further relayed via MIMO until it reaches the base station.We evaluate our proposed scheme on the basis of analytical and simulation results. The results show significant energy conservation if packets are routed via hierarchical MIMO.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127198806","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":"Performance of QO-STBC-OFDM in partial-band noise jamming","authors":"Leonard E. Lightfoot, Lei Zhang, Tongtong Li","doi":"10.1109/CISS.2010.5464734","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464734","url":null,"abstract":"Quasi-orthogonal space-time block codes with orthogonal frequency division multiplexing (QO-STBC-OFDM) can exploit multipath diversity and achieve spectrally efficient communications. However, future wireless communication systems must be robust against both unintentional and intentional interference. As a result, there is a need for proper analytical tools to assess the performance of QO-STBC-OFDM in the presence of partial-band noise jamming. First, analytical expressions for the exact pairwise error probability (PEP) of the QO-STBC-OFDM system is derived using the moment generating function (MGF). Second, the PEP is calculated under various situations, and the closed-form expressions and union bound for the bit error probability (BEP) are derived. Finally, simulations are performed and compared with the theoretical results.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115580531","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":"How (information theoretically) optimal are distributed decisions?","authors":"V. Aggarwal, A. Avestimehr, A. Sabharwal","doi":"10.1109/CISS.2010.5464823","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464823","url":null,"abstract":"“If we know more, we can achieve more.” This adage also applies to networks, where more information about the network state translates into higher sum-rates. In this paper, we formalize this increase of sum-rate with increased knowledge of network. The knowledge of network is measured in terms of the number of hops of information about the network while the sum-rate is normalized by the maximum sum-rate that can be achieved with complete information. As the knowledge about the network increase, the achievable normalized sum-rate also increases. The best normalized sum-rate is called normalized sum-capacity. In this paper, we characterize the increase of normalized sum-capacity with the hops of information about the network for many classes of deterministic interference networks for the cases of one and two-hops of instantaneous channel information.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125053221","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":"Opportunistic capacity and error exponent regions for variable length communication over compound channel with feedback","authors":"Aditya Mahajan, S. Tatikonda","doi":"10.1109/CISS.2010.5464950","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464950","url":null,"abstract":"Variable length communication over a compound channel with feedback is considered. Traditionally, capacity of a compound channel is defined as the maximum rate at which reliable communication can be guaranteed before the start of communication. This is a pessimistic point of view. In this paper, we give an opportunistic definition of capacity. We define capacity as the maximum rate at which reliable communication can be guaranteed for the current choice of the channel by nature. Under this definition, a compound channel is conceptually similar to multi-terminal communication. Transmission rate is a vector rather than a scalar; channel capacity is a region rather than a scalar; error exponent is a region rather than a scalar. We formulate variable length communication over a compound channel with feedback, characterize its opportunistic capacity region, and provide lower bounds for the error exponent region.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128221856","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":"Average case analysis of sparse recovery from combined fusion frame measurements","authors":"P. Boufounos, Gitta Kutyniok, H. Rauhut","doi":"10.1109/CISS.2010.5464980","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464980","url":null,"abstract":"Sparse representations have emerged as a powerful tool in signal and information processing, culminated by the success of new acquisition and processing techniques such as Compressed Sensing (CS). Fusion frames are very rich new signal representation methods that use collections of subspaces instead of vectors to represent signals. These exciting fields have been recently combined to introduce a new sparsity model for fusion frames. Signals that are sparse under the new model can be compressively sampled and uniquely reconstructed in ways similar to sparse signals using standard CS. The combination provides a promising new set of mathematical tools and signal models useful in a variety of applications. With the new model, a sparse signal has energy in very few of the subspaces of the fusion frame, although it does not need to be sparse within each of the subspaces it occupies. In this paper we demonstrate that although a worst-case analysis of recovery under the new model can often be quite pessimistic, an average case analysis is not and provides significantly more insight. Using a probability model on the sparse signal we show that under very mild conditions the probability of recovery failure decays exponentially with increasing dimension of the subspaces.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128673236","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":"On Gaussian MIMO compound wiretap channels","authors":"E. Ekrem, S. Ulukus","doi":"10.1109/CISS.2010.5464838","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464838","url":null,"abstract":"We study the two-user one-eavesdropper discrete memoryless compound wiretap channel, where the transmitter sends a common confidential message to both users, which needs to be kept perfectly secret from the eavesdropper. We provide a new achievable secrecy rate which is shown to be potentially better than the best known lower bound for the secrecy capacity of this compound wiretap channel. We next consider the two-user one-eavesdropper Gaussian multiple-input multiple-output (MIMO) compound wiretap channel. We obtain an achievable secrecy rate for the Gaussian MIMO compound wiretap channel by using dirty-paper coding (DPC) in the achievable scheme we provided for the discrete memoryless case. We show that the corresponding achievable secrecy rate achieves at least half of the secrecy capacity of the two-user one-eavesdropper Gaussian MIMO wiretap channel. We also obtain the secrecy capacity of the two-user one-eavesdropper Gaussian MIMO compound wiretap channel when the eavesdropper is degraded with respect to one of the two users.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130648443","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":"Admission control and preemption policy design of multi-class computer networks","authors":"Zhen Zhao, S. Weber, J. D. Oliveira","doi":"10.1109/CISS.2010.5464837","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464837","url":null,"abstract":"The subject of optimal admission control for maximizing revenue in multiclass loss networks has been well studied. Preemption policies, employed in the Differentiated Services network architecture, serve as an additional type of loss network control, where active low priority calls may be selectively preempted upon the arrival of a high priority call. This paper studies the joint use of admission control and preemption for a two class loss link where per-class revenues are earned per unit time for each active call, and an instantaneous preemption cost is incurred whenever the preemption mechanism is employed. Our main result is if the preemption cost is not too high then the system revenue under the optimal preemption policy with no admission control (complete sharing) exceeds that of the optimal admission control policy with no preemption. That is, preemption control is superior to admission control provided the preemption cost is not too high. Results are established via dynamic programming.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126722564","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}