{"title":"DSOS and SDSOS optimization: LP and SOCP-based alternatives to sum of squares optimization","authors":"Amir Ali Ahmadi, Anirudha Majumdar","doi":"10.1109/CISS.2014.6814141","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814141","url":null,"abstract":"Sum of squares (SOS) optimization has been a powerful and influential addition to the theory of optimization in the past decade. Its reliance on relatively large-scale semidefinite programming, however, has seriously challenged its ability to scale in many practical applications. In this paper, we introduce DSOS and SDSOS optimization as more tractable alternatives to sum of squares optimization that rely instead on linear programming and second order cone programming. These are optimization problems over certain subsets of sum of squares polynomials and positive semidefinite matrices and can be of potential interest in general applications of semidefinite programming where scalability is a limitation.","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":"125658153","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":"Primal sketch based adaptive perceptual JND model for digital watermarking","authors":"Yana Zhang, Cheng Yang, Qi Zhang, P. Cosman","doi":"10.1109/CISS.2014.6814192","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814192","url":null,"abstract":"Watermarking algorithms based on the Just Noticeable Distortion (JND) model show great superiority over other methods, in terms of the watermark imperceptibility and robustness. However, the existing wavelet-based JND models are based on global coefficients, without consideration of image content characteristics. Following the pixel-wise masking idea, a primal sketch based adaptive perceptual JND model (PSAPM) is proposed in this paper, in which an improved watermarking algorithm is designed. It better describes the behavior of the watermark embedder. Experiments show that our algorithm is robust against attacks, including cropping, noise addition and JPEG compression.","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":"133574003","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 secret key generation from finite source observations","authors":"Wenwen Tu, L. Lai","doi":"10.1109/CISS.2014.6814183","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814183","url":null,"abstract":"All existing secret key generation schemes assume that the users have access to infinite number of source observations. Motivated by applications in wireless networks, we consider the problem of generating secret keys from a finite number of correlated observations under the source model. We investigate the relationship among the achievable secret key rate, the decoding error probability, and the number of observations. Based on the connection between secret key generation and distributed source coding problems, we present two key generation schemes. In the first scheme, length of the generated key varies depending on the the realization of the source sequence, and the generated key is conditionally perfectly secure. We characterize the penalty, due to the finiteness of the number of observations, in the key rate compared to that of the scheme with infinite number of observations. In the second scheme, length of the generated key is fixed, and the key is unconditionally perfectly secure. We characterize the additional penalty associated with these additional features in the achievable key rate.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"22 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":"134223577","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 cross-layer metric for application-constrained MAC-aware capacity optimization","authors":"Bahador Amiri, H. Sadjadpour","doi":"10.1109/CISS.2014.6814176","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814176","url":null,"abstract":"This paper introduces a new cross-layer design metric called Application-Constrained MAC-Aware Capacity (ACMAC). ACMAC considers outage capacity, MAC layer and application layer Quality-of-Service (QoS) requirements to derive the lower and upper bounds of the transmission rate. Theoretical derivation of this metric demonstrates the importance of considering different layers of the network. Further, we show how to use ACMAC as a cross layer optimization criterion to generate frameworks for selecting different parameters such as transmit rate, channel or route selection in wireless networks. Our simulation results show that ACMAC is very accurate in predicting network performance such as throughput while satisfying QoS parameters like Packet Error rate (PER).","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"36 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":"133350343","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":"Polynomial complexity of polar codes for non-binary alphabets, key agreement and Slepian-Wolf coding","authors":"Jingbo Liu, E. Abbe","doi":"10.1109/CISS.2014.6814146","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814146","url":null,"abstract":"We consider polar codes for memoryless sources with side information and show that the blocklength, construction, encoding and decoding complexities are bounded by a polynomial of the reciprocal of the gap between the compression rate and the conditional entropy. This extends the recent results of Guruswami and Xia to a slightly more general setting, which in turn can be applied to (1) sources with non-binary alphabets, (2) key generation for discrete and Gaussian sources, and (3) Slepian-Wolf coding and multiple accessing. In each of these cases, the complexity scaling with respect to the number of users is also controlled. In particular, we construct coding schemes for these multi-user information theory problems which achieve optimal rates with an overall polynomial complexity.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"102 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":"129348166","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":"Interactive communication for resource allocation","authors":"J. Ren, J. Walsh","doi":"10.1109/CISS.2014.6814112","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814112","url":null,"abstract":"For the resource allocation problem in a multiuser OFDMA system, we propose an interactive communication scheme between the base station and the users with the assumption that this system utilizes a rateless code for data transmission. We describe the problem of minimizing the overhead measured in the number of bits that must be exchanged required by the interactive scheme, and solve it with dynamic programming. We present simulation results showing the reduction of overhead information enabled by the interactive scheme relative to a straightforward one-way scheme in which each user reports its own channel quality.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"205 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":"116392011","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}
Jungseul Ok, Youngmi Jin, Jaeyoung Choi, Jinwoo Shin, Yung Yi
{"title":"Influence maximization over strategic diffusion in social networks","authors":"Jungseul Ok, Youngmi Jin, Jaeyoung Choi, Jinwoo Shin, Yung Yi","doi":"10.1109/CISS.2014.6814155","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814155","url":null,"abstract":"We study the problem of diffusion speed maximization over strategic diffusion, where individuals decide to adopt a new behavior or not based on a networked coordination game with their neighbors. For a variety of topological structures of social networks, we design polynomial-time algorithms that provide provable approximation guarantees. By analyzing three graph classes, i.e., Erdös-Rényi, planted partition and geometrically structured graphs, we obtain new topological insights, which does not exists in the literature for popular epidemic-based models. Our results first imply that for globally well-connected graphs, a careful seeding is not necessary. On the other hand, for locally well-connected graphs, their clustering characteristics should be intelligently exploited for good seeding, where seeding inside and intersection of clusters are important for such graphs having big and small clusters, respectively. We believe that these new insights will provide useful tools to understand and control the sociological evolution of innovations spread over large-scale social networks.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"144 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":"123259417","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":"Indoor multiple sound source localization using a novel data selection scheme","authors":"Longji Sun, Qi Cheng","doi":"10.1109/CISS.2014.6814189","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814189","url":null,"abstract":"The multiple sound source localization problem in reverberant environments is studied by using a circular microphone array. The problem is approached by performing single source localization at each of the selected time-frequency (TF) data points from the received signals followed by a histogram technique to achieve robust localization. A novel TF data point selection scheme is proposed based on the ratio of the power of a TF point to that of its adjacent preceding TF point at the same frequency. The method introduces little extra computation and is suitable for real-time implementation. The proposed algorithm is compared with the algorithm in [1] to show its effectiveness and efficiency using extensive simulations.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"32 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":"123811861","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":"Fire sale in financial networks","authors":"Haoshu Tian, E. Weinan","doi":"10.1109/CISS.2014.6814162","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814162","url":null,"abstract":"The default of one bank can cause other banks to default through two channels: financial contagion in the inter-bank liability network and fire sale in the asset selling market. When the defaulted bank cannot fully pay its debt, the loss is transmitted to other banks. When banks rush to sell the same asset simultaneously, they may fall into a Nash equilibrium in which banks compete for liquidity and sell their assets at an artificially low price. In this paper, a model that incorporates these two channels is developed and analyzed theoretically. An algorithm for finding the state in which both the inter-bank liability network and the market are in equilibrium is proposed and tested.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"11 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":"128572317","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":"Deterministic Z-interference channels with unidirectional partial cribbing","authors":"R. Kolte, Ayfer Özgür, H. Permuter","doi":"10.1109/CISS.2014.6814150","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814150","url":null,"abstract":"We consider the problem of communicating over Z-interference channels when the interfering transmitter can overhear the signal of the other transmitter strictly causally. We focus on the deterministic case and characterize the capacity region in this case. The optimal coding scheme that we present is far simpler than currently known schemes for this setting. Motivated by this result, we present another way of viewing the Han-Kobayashi scheme for the interference channel, which can be easier to tweak in more general settings.","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":"128462805","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}