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

筛选
英文 中文
Distributed particle filter using Gaussian approximated likelihood function 分布式粒子滤波采用高斯近似似然函数
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814166
T. Ghirmai
{"title":"Distributed particle filter using Gaussian approximated likelihood function","authors":"T. Ghirmai","doi":"10.1109/CISS.2014.6814166","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814166","url":null,"abstract":"In this paper, we propose a distributed particle filtering algorithm for sensor networks in which multiple sensors collaborate to monitor and track an object in a nonlinear/non-Gaussian dynamic system. According to the algorithm, the sensors collaboratively compute the global likelihood function in order to make local estimates that takes into account measurements from all the sensors. To compute the global likelihood, each sensor first approximates its local likelihood function using Gaussian function, and exchange its approximated local likelihood with the other sensors. Such approximation saves communication overhead because it requires the sensors to exchange only the mean and the covariance of the approximated Gaussian local likelihood functions. The exchange of the parameters of the likelihood functions between sensors is accomplished using an average consensus filter or by implementing forward-backward propagation strategy.","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":"128849525","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}
引用次数: 3
A new design for Information Centric Networks 信息中心网络的新设计
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814177
H. Sadjadpour
{"title":"A new design for Information Centric Networks","authors":"H. Sadjadpour","doi":"10.1109/CISS.2014.6814177","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814177","url":null,"abstract":"Information Centric Network (ICN) is a content-based information dissemination approach that improves the content delivery and latency. We introduce a modified architecture for ICN which can reduce the traffic by combining multiple messages and facilitate the data distribution in the network. By observing the similarities between index coding and ICN architectures, we propose to combine these two techniques to arrive at a new architecture that enhances data delivery in networks beyond original ICN scheme. By taking advantage of some concepts such as linear network coding, caching and index coding, we demonstrate that we can reduce the traffic and increase the capacity of ICN architecture by combining (network encoding) multiple messages requested by different nodes and sending them in one transmission. We demonstrate that each node will be able to extract its desired message from the combined encoded messages. To achieve this goal, we first define a modified version of index coding in order to apply index coding for both wired and wireless networks. Further, we introduce a hybrid caching scheme that includes both central and distributed caching to support two different goals. Our hybrid caching approach is a combination of conventional caching in ICN that caches the content in various network locations in order to make the content readily available to nodes and a new distributed caching scheme across nodes in the network to improve the performance of the entire system. The purpose of the second caching scheme is to allow central cache system to combine multiple contents in order to serve several client nodes simultaneously with a single transmission of encoded messages. The focus of this paper is to describe the new ICN architecture and demonstrate the advantages of the new architecture.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"37 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":"121992799","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}
引用次数: 17
Secure broadcasting of a common message with independent secret keys 使用独立密钥安全地广播公共消息
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814137
R. Schaefer, A. Khisti
{"title":"Secure broadcasting of a common message with independent secret keys","authors":"R. Schaefer, A. Khisti","doi":"10.1109/CISS.2014.6814137","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814137","url":null,"abstract":"The problem of secure broadcasting with independent secret keys is studied. The particular scenario is analyzed where a common message has to be broadcasted to two legitimate receivers, while keeping an external eavesdropper ignorant of it. The transmitter shares independent secret keys of arbitrary rates with both legitimate receivers, which can be used in different ways: They can be used as one-time pads to encrypt the common message or they can be used as randomization resources for wiretap coding. Both approaches are studied in this paper. If both legitimate channels are degraded versions of the eavesdropper channel, it is shown that the one-time pad approach is optimal for several cases yielding corresponding capacity expressions. Reversely, the wiretap coding approach is shown to be optimal if the eavesdropper channel is degraded with respect to both legitimate channels establishing capacity in this case as well.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"76 4 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":"128246484","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}
引用次数: 9
Fast smooth rank approximation for tensor completion 张量补全的快速光滑秩近似
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814174
Mohammed Al-Qizwini, H. Radha
{"title":"Fast smooth rank approximation for tensor completion","authors":"Mohammed Al-Qizwini, H. Radha","doi":"10.1109/CISS.2014.6814174","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814174","url":null,"abstract":"In this paper we consider the problem of recovering an N-dimensional data from a subset of its observed entries. We provide a generalization for the smooth Shcatten-p rank approximation function in [1] to the N-dimensional space. In addition, we derive an optimization algorithm using the Augmented Lagrangian Multiplier in the N-dimensional space to solve the tensor completion problem. We compare the performance of our algorithm to state-of-the-art tensor completion algorithms using different color images and video sequences. Our experimental results showed that the proposed algorithm converges faster (approximately half the execution time), and at the same time it achieves comparable performance to state-of-the-art tensor completion algorithms.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"63 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":"129242195","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
Exact repair problems with multiple sources 精确修复多个来源的问题
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814114
Jayant Apte, Congduan Li, J. Walsh, S. Weber
{"title":"Exact repair problems with multiple sources","authors":"Jayant Apte, Congduan Li, J. Walsh, S. Weber","doi":"10.1109/CISS.2014.6814114","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814114","url":null,"abstract":"We consider a new variant of the exact repair distributed storage problem, the multi-source exact repair problem, wherein the reconstruction decoders are each only required to provide a subset of the source variables. To best illustrate the idea, we generalize the (n, k, d) = (3, 2, 2) exact repair distributed storage problem to the multisource case. When every decoder demands all source variables, the rate region of the (3, 2, 2) exact repair problem is known to be same as that of the (3, 2, 2) functional repair problem, while the rate region for (3, 2, 2) case with multiple sources is unknown. We find achievable rate regions for vector binary and scalar binary codes via an automated approach.","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":"131641572","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}
引用次数: 4
A convex framework to control spreading processes in directed networks 控制有向网络扩展过程的凸框架
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814167
V. Preciado, Michael Zargham, David Sun
{"title":"A convex framework to control spreading processes in directed networks","authors":"V. Preciado, Michael Zargham, David Sun","doi":"10.1109/CISS.2014.6814167","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814167","url":null,"abstract":"We propose a convex optimization framework to compute the optimal distribution of protection resources in order to control a spreading process propagating throughout a network of contacts. The spreading process under consideration is an extension of the popular SIS model of viral infection in a network with non-identical nodes and directed edges. We assume we have a limited budget available to invest on three types of network protection resources: (i) Edge control resources, (ii), preventative resources and (iii) corrective resources. Edge control resources are employed to impose restrictions on the contact rates across directed edges in the contact network. Preventative resources are allocated to nodes in order to reduce the probability of infection at that node (e.g. vaccines), and corrective resources are allocated to nodes to increase the recovery rate at that node (e.g. antidotes). We assume these resources have monetary costs associated with them, from which we formalize an optimal budget allocation problem which maximizes containment of the infection. We present a polynomial time solution to the optimal budget allocation problem using Geometric Programming (GP) for an arbitrary weighted and directed contact network and a large class of resource cost functions. We illustrate our approach with numerical simulations in a real-world air transportation network.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"8 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":"131507506","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}
引用次数: 11
Joint optimal placement and energy allocation of underwater sensors in a tree topology 树形拓扑水下传感器联合优化布置与能量分配
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814186
Hadis Dashtestani, P. Cotae, I. S. Moskowitz
{"title":"Joint optimal placement and energy allocation of underwater sensors in a tree topology","authors":"Hadis Dashtestani, P. Cotae, I. S. Moskowitz","doi":"10.1109/CISS.2014.6814186","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814186","url":null,"abstract":"By using the Karush-Kuhn-Tucker (KKT) conditions in a multi-hop hierarchical tree structure we obtained the optimal placement of the underwater acoustic sensor nodes with respect to the capacity of the wireless links between the nodes. We assumed that the energy consumption of each sensor node is constant. We were able to calculate the vertical and horizontal distances between each sensor nodes and also between any levels of interest. On the same tree topology we focused on the energy efficient transmission in underwater sensor networks by providing the optimal transmitting energies for the nodes with fixed locations.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"58 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":"124720348","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}
引用次数: 2
Joint user association and resource allocation in small cell networks with backhaul constraints 带回程约束的小蜂窝网络联合用户关联与资源分配
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814100
Zhe Cui, R. Adve
{"title":"Joint user association and resource allocation in small cell networks with backhaul constraints","authors":"Zhe Cui, R. Adve","doi":"10.1109/CISS.2014.6814100","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814100","url":null,"abstract":"Heterogeneous networks potentially provide significant capacity gains by overlaying the traditional cellular network with a layer of small cells (SCs) served by access points (APs). However, the limited backhaul capacity of the SC APs, combined with increased interference from neighboring cells, necessitates careful resource allocation to realize the gains. In our work, we consider maximization of the weighted sum rate in small cell networks with carrier aggregation while enforcing a backhaul constraint on each SC AP. We propose an efficient, waterfilling-like, algorithm which converges to a locally optimal solution of the non-convex optimization problem. This algorithm differs from existing works by using a computationally efficient bisection-like search that ensures the sum-power and sum-rate constraints at each AP are satisfied via an one-dimensional search. An added advantage is that this approach also allows for a decentralized implementation.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"34 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":"128129398","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}
引用次数: 28
Game-theoretic analysis of advance reservation services 预订服务的博弈论分析
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814104
Eran Simhon, D. Starobinski
{"title":"Game-theoretic analysis of advance reservation services","authors":"Eran Simhon, D. Starobinski","doi":"10.1109/CISS.2014.6814104","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814104","url":null,"abstract":"In many services, such as cloud computing, customers have the option to make reservations in advance. However, little is known about the strategic behavior of customers in such systems. In this paper, we use game theory to analyze several models of time-slotted systems in which customers can choose whether or not making an advance reservation of server resources in future time slots. Since neither the provider nor the customers know in advance how many customers will request service in a given slot, the models are analyzed using Poisson games, with decisions made based on statistical information. The games differ in their payment mechanisms, and the main objective is to find which mechanism yields the highest average profit for the provider. Our analysis shows that the highest profit is achieved when advance reservation fees are charged only from customers that are granted service. Furthermore, informing customers about the availability of free servers prior to their decisions do not affect the provider's profit in that case.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"153 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":"116724746","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}
引用次数: 13
After-attack performance of parameter estimation systems 参数估计系统的攻击后性能
2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI: 10.1109/CISS.2014.6814182
Basel Alnajjab, Rick S. Blum
{"title":"After-attack performance of parameter estimation systems","authors":"Basel Alnajjab, Rick S. Blum","doi":"10.1109/CISS.2014.6814182","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814182","url":null,"abstract":"In this paper, attacks on systems estimating the value of an unknown deterministic parameter based on quantized noisy observations are studied. The attacks are categorized according to the information available to the attacking entity. The considered categories are attacks of full information, which are generally more devastating, and the information free attacks, which are generally less effective. Given an estimation algorithm and a quantization scheme, the presented work provides the actual error in estimation rather than a bound on it. More importantly, the error is provided for cases of misspecified observation models and sub-optimal estimation algorithms. A special property of the information free attack is presented. The error in estimation is studied under some possible attack mitigation schemes carried out at the fusion center.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"41 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":"129488162","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信