发布求助
文献互助 智能选刊 最新文献

2016 Annual Conference on Information Science and Systems (CISS)最新文献

筛选
英文 中文
Measurement and modelling of TCP downstream throughput dependence on SNR in an IEEE802.11b WLAN system IEEE802.11b无线局域网系统中TCP下游吞吐量依赖信噪比的测量和建模
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460519
Oghogho Ikponmwosa, F. Edeko, Joy Emagbeter
{"title":"Measurement and modelling of TCP downstream throughput dependence on SNR in an IEEE802.11b WLAN system","authors":"Oghogho Ikponmwosa, F. Edeko, Joy Emagbeter","doi":"10.1109/CISS.2016.7460519","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460519","url":null,"abstract":"The dependence of TCP downstream throughput (TCPdownT) on signal to noise ratio (SNR) has been studied in this paper. Measurements were taken for multiple users in small offices, open corridors and free space environments using an infrastructure based IEEE 802.11b WLAN while transmitting different quality of service (QoS) traffic. Models able to predict TCPdownT with respect to SNR observed were developed and validated for different signal categories. We observed RMS errors of 0.938012 Mbps, 1.047012 Mbps, 0.65833 Mbps and 0.452927 Mbps for the general (all SNR) model, strong signals model, grey signals model and Weak signals model respectively which were much lower than that of similar models with which they were compared. Comparing our results with previous work on TCP upstream throughput showed that it is more accurate to investigate upstream and downstream throughput separately. Using our models, IEEE 802.11b WLAN installers will be able to predict the TCPdownT by simply measuring and monitoring only the received SNR which is already part of the network installation process.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127914263","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}
引用次数: 6
Compressive line spectrum estimation with clustering and interpolation 基于聚类和插值的压缩线谱估计
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460566
Dian Mo, Marco F. Duarte
{"title":"Compressive line spectrum estimation with clustering and interpolation","authors":"Dian Mo, Marco F. Duarte","doi":"10.1109/CISS.2016.7460566","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460566","url":null,"abstract":"We consider the standard line spectral estimation problem when the number of observed samples is significantly lower than that prescribed by the Nyquist rate. Two families of sparsity-based methods have recently been proposed for this problem. The first one uses an atomic norm minimization algorithm where the atoms correspond to complex exponentials of varying frequencies. The second one defines the sparse coefficient vectors for the signals of interest by designing parametric dictionaries that can be leveraged by sparse approximation algorithms involving clustering and interpolation. This paper compares the performance of these two algorithm families. Experiments show their advantages and disadvantages in terms of precision and complexity.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125594228","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
Dynamic node-disjoint multipath routing for millimeter wave networks using directional antennas 基于定向天线的毫米波网络动态节点不相交多径路由
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460541
Zhuo Chen, R. Yates, D. Raychaudhuri
{"title":"Dynamic node-disjoint multipath routing for millimeter wave networks using directional antennas","authors":"Zhuo Chen, R. Yates, D. Raychaudhuri","doi":"10.1109/CISS.2016.7460541","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460541","url":null,"abstract":"In millimeter wave (mmW) networks, for example 60 GHz networks, nodes in the network have to use directional antennas to communicate with each other to overcome high propagation losses and achieve high data rates. The narrow main beam widths of directional antennas also provide several benefits such as high gain and high spatial reuse. In this paper, we propose a dynamic node-disjoint multipath routing protocol for 60 GHz networks to improve the capacity of the network by utilizing the benefit of directional antennas. We propose three Route Request broadcasting schemes and three Route Request forwarding schemes in the route discovery stage along with a greedy node-disjoint path selection algorithm. The performance of each proposed scheme is evaluated using the ns-2 simulator. Simulation results demonstrate that by using appropriate Route Request broadcasting and forwarding schemes, node-disjoint paths can be found for each pair of source and destination. By using these node-disjoint paths, the aggregated throughput of the network is higher on average when there are one or more TCP flows in the network.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123732810","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
One sample per person facial recognition with local binary patterns and image sub-grids 每个人一个样本的人脸识别与局部二值模式和图像子网格
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460468
Gordon Stein, Yuan Li, Yin Wang
{"title":"One sample per person facial recognition with local binary patterns and image sub-grids","authors":"Gordon Stein, Yuan Li, Yin Wang","doi":"10.1109/CISS.2016.7460468","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460468","url":null,"abstract":"Local binary patterns (LBPs) are very commonly used to determine if a face in an image is a known person. However, accuracy is generally proportional to the number of training samples collected. The “single sample per person” (SSPP) problem focuses on identifying a person using only one training sample. Facial recognition from a single sample reduces the labor required to gather training data and enables some applications where only a single sample will be available. In this paper, we propose a method of improving the accuracy or efficiency of LBP-based face recognition by using a tree-based data structure to create “sub-grids” allowing for novel division patterns to be used in facial recognition, as opposed to the uniform grids used for most LBP face recognition. This method is then applied to the one sample per person problem where some patterns were found to require fewer regions within the image for comparable results to uniform grids.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126734558","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
Generalized range space property for group sparsity of linear underdetermined systems 线性欠定系统群稀疏性的广义值域空间性质
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460565
Ahmed Al Hilli, L. Najafizadeh, A. Petropulu
{"title":"Generalized range space property for group sparsity of linear underdetermined systems","authors":"Ahmed Al Hilli, L. Najafizadeh, A. Petropulu","doi":"10.1109/CISS.2016.7460565","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460565","url":null,"abstract":"Group sparse vectors are the generalization of unstructured sparse vectors, with zero and non-zero elements occurring in groups. In group sparse signal recovery problems, we are interested in finding the signal with the smallest number of active groups that satisfy our observations. Because this problem has exponential complexity, a convex relaxation is typically used, which minimizes the sum of the groups' second norm that satisfies the observations. In this paper, we provide a set of deterministic necessary and sufficient conditions that the sensing matrix should satisfy for equivalence between the ℓ0 solution of a structured group sparse problem and its convex relaxation. These conditions are generalization of the Range Space Property that has been previously proposed for equivalence between the ℓ0- and the ℓ1- norms in non-structured sparse recovery problems. We also provide a sufficient condition for a unique solution of the relaxed convex problem.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116844678","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
Inter-network dynamic spectrum allocation via a Colonel Blotto game 网络间动态频谱分配通过上校布洛托游戏
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460510
M. Hajimirsadeghi, G. Sridharan, W. Saad, N. Mandayam
{"title":"Inter-network dynamic spectrum allocation via a Colonel Blotto game","authors":"M. Hajimirsadeghi, G. Sridharan, W. Saad, N. Mandayam","doi":"10.1109/CISS.2016.7460510","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460510","url":null,"abstract":"This paper investigates a scenario where multiple network service providers (NSPs) compete to provide wireless connectivity to a set of users. The users could either be a single mobile device, a set of localized Internet-of-Things (IoT) devices, or even a campus-wide network requiring wireless backhaul. The NSPs compete with one another to provide wireless service to the users by strategically allocating the available bandwidth so as to maximize their total payoff. The NSPs present each user with an offer to provide wireless connectivity using a certain amount of bandwidth. Users then decide to connect to that NSP whose offered bandwidth maximizes their utility function. Under such an architecture, this paper focuses on the optimal bandwidth allocation strategies for the NSPs. Such a problem is best modeled using a classical problem in game theory called the Colonel Blotto game-a multidimensional strategic resource allocation game. We show that the problem of spectrum allocation can be reframed as a Colonel Blotto game and analyze the mixed strategies that achieve Nash equilibrium. Depending on whether spectrum is treated a discrete or a continuous resource, we take recourse to either existing theoretical results or rely on numerical techniques to establish the equilibrium-achieving mixed strategies. We finally discuss interesting aspects about these mixed strategies, including an intrinsic user-association mechanism that emerges when spectral efficiency is taken into consideration.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"306 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115141546","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
Performance of pattern diversity in reconfigurable antenna arrays 可重构天线阵列的方向分集性能
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460477
George D. Sworo, K. Dandekar, M. Kam
{"title":"Performance of pattern diversity in reconfigurable antenna arrays","authors":"George D. Sworo, K. Dandekar, M. Kam","doi":"10.1109/CISS.2016.7460477","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460477","url":null,"abstract":"In this paper, we investigate the benefits offered by radiation pattern diversity in reconfigurable antenna arrays and place these benefits in context with spatial diversity provided by conventional antenna arrays. These antennas provide pattern diversity that can improve capacity and offers a unique opportunity for antenna system miniaturization for portable wireless devices. We use a common modeling framework to study the impact of spatial and pattern correlation on the performance of the multi-antenna array systems. We consider a geometry-based MIMO channel cluster model to investigate the effects of the channel spatial characteristics and antenna array geometry/radiation patterns on the spatial correlation and system performance. Our findings demonstrate relative diversity performance improvement of at least 3 dB from using pattern diversity over space diversity.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115279368","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}
引用次数: 0
Privacy-aware stochastic control with a “snoopy” adversary: A game-theoretic approach 具有“史努比”对手的隐私感知随机控制:一种博弈论方法
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460499
Abhishek K. Gupta
{"title":"Privacy-aware stochastic control with a “snoopy” adversary: A game-theoretic approach","authors":"Abhishek K. Gupta","doi":"10.1109/CISS.2016.7460499","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460499","url":null,"abstract":"We consider a scenario in which a controller and an adversary dynamically act on a system over a finite or infinite horizon. The controller and the adversary do not want to reveal their actions to each other, and at the same time, the controller acts to minimize an expected cost, and the adversary acts to maximize it. We model this scenario as a dynamic zero-sum game, prove the existence of a unique saddle-point equilibrium, and devise an algorithm to compute the equilibrium for finite and infinite horizon settings.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115593152","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}
引用次数: 0
Efficiency comparison between proportional fairness and dominant resource fairness with two different type resources 两种不同类型资源的比例公平与优势资源公平效率比较
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460578
Youngmi Jin, M. Hayashi
{"title":"Efficiency comparison between proportional fairness and dominant resource fairness with two different type resources","authors":"Youngmi Jin, M. Hayashi","doi":"10.1109/CISS.2016.7460578","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460578","url":null,"abstract":"We study efficiency of proportional fairness (PF) and dominant resource fairness (DRF) in the aspect of resource usage and total throughput when there are two different type resources are available. With a unified convex optimization describing both fair resource allocation schemes, we characterize bottleneck resources (resources in full utilization) of PF and DRF and prove that PF always more efficiently utilizes the available resources with less waste than DRF does. We provide conditions when PF has higher throughput than DRF and give examples showing that PF may have smaller throughput than DRF even though PF has higher resource usage than DRF.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124759373","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}
引用次数: 7
Using Approximate Entropy as a speech quality measure for a speaker recognition system 使用近似熵作为说话人识别系统的语音质量度量
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460517
R. A. Metzger, J. Doherty, D. Jenkins
{"title":"Using Approximate Entropy as a speech quality measure for a speaker recognition system","authors":"R. A. Metzger, J. Doherty, D. Jenkins","doi":"10.1109/CISS.2016.7460517","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460517","url":null,"abstract":"In this paper, we will show that Approximate Entropy (ApEn) can be used to detect high-quality speech frames in an otherwise distorted speech signal. By exploiting the property of quasi-periodicity in speech, ApEn is able to detect small aberrations in speech frames that would otherwise cause a decrease in the performance in an automatic speaker recognition (ASR) system. In addition, we obtain the statistics of ApEn values representative of clean speech and propose threshold bounds to obtain maximum recognition rates. When compared to other popular voice activity detector (VAD) algorithms, our simulation results showed that utilization of ApEn will outperform the other VADs in discerning clean speech from noisy speech. This ability to properly detect clean speech allows for a speaker recognition system to obtain a recognition rate close to 87%, which is close to the same performance of the system when noise is not present.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124820312","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术官方微信