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

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

筛选
英文 中文
Kalman filtering based on the maximum correntropy criterion in the presence of non-Gaussian noise 非高斯噪声存在下基于最大熵准则的卡尔曼滤波
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460553
Reza Izanloo, S. Fakoorian, H. Yazdi, D. Simon
{"title":"Kalman filtering based on the maximum correntropy criterion in the presence of non-Gaussian noise","authors":"Reza Izanloo, S. Fakoorian, H. Yazdi, D. Simon","doi":"10.1109/CISS.2016.7460553","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460553","url":null,"abstract":"State estimation in the presence of non-Gaussian noise is discussed. Since the Kalman filter uses only second-order signal information, it is not optimal in non-Gaussian noise environments. The maximum correntropy criterion (MCC) is a new approach to measure the similarity of two random variables using information from higher-order signal statistics. The correntropy filter (C-Filter) uses the MCC for state estimation. In this paper we first improve the performance of the C-Filter by modifying its derivation to obtain the modified correntropy filter (MC-Filter). Next we use the MCC and weighted least squares (WLS) to propose an MCC filter in Kalman filter form, which we call the MCC-KF. Simulation results show the superiority of the MCC-KF compared with the C-Filter, the MC-Filter, the unscented Kalman filter, the ensemble Kalman filter, and the Gaussian sum filter, in the presence of two different types of non-Gaussian disturbances (shot noise and Gaussian mixture noise).","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"13 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":"124008601","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}
引用次数: 156
A machine learning approach to predict episodic memory formation 预测情景记忆形成的机器学习方法
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460560
Hanlin Tang, Jedediah M. Singer, M. Ison, G. Pivazyan, Melissa Romaine, Elizabeth Meller, Victoria Perron, Marlise Arlellano, Gabriel Kreiman, A. Boulin, Rosa Frias, James Carroll, Sarah Dowcett
{"title":"A machine learning approach to predict episodic memory formation","authors":"Hanlin Tang, Jedediah M. Singer, M. Ison, G. Pivazyan, Melissa Romaine, Elizabeth Meller, Victoria Perron, Marlise Arlellano, Gabriel Kreiman, A. Boulin, Rosa Frias, James Carroll, Sarah Dowcett","doi":"10.1109/CISS.2016.7460560","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460560","url":null,"abstract":"Episodic memories constitute the essence of our recollections and are formed by autobiographical experiences and contextual knowledge. Memories are rich and detailed, yet at the same time they can be malleable and inaccurate. The contents that end up being remembered are the result of filtering incoming sensory inputs in the context of previous knowledge. Here we asked whether the quintessentially subjective process of memory construction could be predicted by a supervised machine learning approach based exclusively on content information. We considered audiovisual segments from a movie as a proxy for real-life memory formation and built a quantitative model to explain psychophysics data evaluating recognition memory. The inputs to the model included audiovisual information (e.g. presence of specific characters, objects, voices and sounds), scene information (e.g. location, presence or absence of action) and emotional valence information. The machine-learning model could predict memory formation in single trials both for group averages and individual subjects with an accuracy of up to 80% using solely stimulus content properties. These results provide a quantitative and predictive model that links sensory perception and emotional attributes to memory formation. Furthermore, the results demonstrate that a computational model can make sophisticated inferences about a cognitive process that involves selective filtering and subjective interpretation.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"217 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":"123385345","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 PTS method for OFDM signals without side information based on constellation reshaping 基于星座重构的无侧信息OFDM信号PTS处理新方法
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460504
Hong-fa Chu, T. Shimamura
{"title":"A new PTS method for OFDM signals without side information based on constellation reshaping","authors":"Hong-fa Chu, T. Shimamura","doi":"10.1109/CISS.2016.7460504","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460504","url":null,"abstract":"Partial transmit sequence (PTS) is one of the most well-known techniques to reduce the peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems. However, a significant drawback of the conventional PTS is to transmit several side information bits. In this paper, we propose a new PTS method to reduce the PAPR without side information, which generates a set of new constellations. Corresponding to the new constellations with different phase factors, we can recover the original signal by using the proposed method at the receiver but not need side information in OFDM systems. Theoretical analysis and simulation results have shown that, compared with the conventional PTS, the proposed method could achieve further PAPR reduction of OFDM signals and provide a better bit error rate (BER) performance.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"51 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":"121592536","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
Estimation information bounds using the I-MMSE formula and Gaussian mixture models 使用I-MMSE公式和高斯混合模型估计信息界
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460514
Bryan Paul, D. Bliss
{"title":"Estimation information bounds using the I-MMSE formula and Gaussian mixture models","authors":"Bryan Paul, D. Bliss","doi":"10.1109/CISS.2016.7460514","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460514","url":null,"abstract":"We derive a method to bound the mutual information between a noisy and noiseless measurement exploiting the I-MMSE estimation and information theory connection. Modeling the source distribution as a Gaussian mixture model, a closed form expression for upper and lower bounds of the minimum mean square error is found using recent results. Using the connection between rate of information relative to SNR and the minimum mean square error of the estimator, the mutual information can be bounded as well for arbitrary source distributions in Gaussian noise.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"307 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":"124379263","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
Decay of correlation in network flow problems 网络流问题中相关性的衰减
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460496
Patrick Rebeschini, S. Tatikonda
{"title":"Decay of correlation in network flow problems","authors":"Patrick Rebeschini, S. Tatikonda","doi":"10.1109/CISS.2016.7460496","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460496","url":null,"abstract":"We develop a general theory for the local sensitivity of optimal points of constrained network optimization problems under perturbations of the constraints. For the network flow problem, we show that local perturbations on the constraints have an impact on the components of the optimal point that decreases exponentially with the graph-theoretical distance. The exponential rate is controlled by the spectral radius of a sub-stochastic transition matrix of a killed random walk associated to the network. For graphs where this spectral radius is well-behaved (bounded, for instance) as a function of the dimension of the network, our theory yields the first-known incarnation of the decay of correlation principle in constrained optimization.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"AES-19 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":"126548113","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
Multi-operator service optimization for Fixed Access Network Sharing (FANS) 固定接入网共享(FANS)的多运营商业务优化
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460556
K. Kerpez, H. Mehmood
{"title":"Multi-operator service optimization for Fixed Access Network Sharing (FANS)","authors":"K. Kerpez, H. Mehmood","doi":"10.1109/CISS.2016.7460556","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460556","url":null,"abstract":"This paper describes the concept of Fixed Access Network Sharing (FANS), a new way of virtualizing broadband access that enables multiple operators to share a network. FANS will offer a vibrant broadband environment, economically sharing costs among multiple operators. FANS will help speed the deployment of super-fast broadband and provide a platform for virtual operators to offer innovative new services. FANS is intrinsically involved with resource sharing, and a framework for optimizing resource allocation with general utility functions is presented here. A specific example of optimal resource allocation across a next-generation DSL interference channel is analyzed in detail.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"47 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":"133472902","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
Computationally efficient Toeplitz-constrained blind equalization based on independence 基于独立性的计算高效toeplitz约束盲均衡
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460550
Zhengwei Wu, S. Kassam
{"title":"Computationally efficient Toeplitz-constrained blind equalization based on independence","authors":"Zhengwei Wu, S. Kassam","doi":"10.1109/CISS.2016.7460550","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460550","url":null,"abstract":"Bussgang algorithms for blind equalization (BE) are well-known techniques that use known constellation properties of the source symbols. BE has also been based on independent component analysis (ICA) methods, where independence of the symbols is exploited. When channel outputs are processed in blocks, as in the ICA algorithms, extra computational cost is incurred for matrix operations. In this paper we propose a computationally efficient Toeplitz-constrained BE algorithm based on independence. We show how the FFT can be applied for computation efficiency, and also how blockwise sample cross-correlation computations can be efficiently approximated. For sources with independent I/Q components this constraint can be imposed for phase recovery. Our proposed algorithms yield relatively fast convergence without high computational cost.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"876-877 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":"123469197","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
Beam selection for performance-complexity optimization in high-dimensional MIMO systems 高维MIMO系统性能复杂度优化的波束选择
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460525
John Hogan, A. Sayeed
{"title":"Beam selection for performance-complexity optimization in high-dimensional MIMO systems","authors":"John Hogan, A. Sayeed","doi":"10.1109/CISS.2016.7460525","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460525","url":null,"abstract":"Millimeter-wave (mm-wave) communications systems offer a promising solution to meeting the increasing data demands on wireless networks. Not only do mm-wave systems allow orders of magnitude larger bandwidths, they also create a high-dimensional spatial signal space due to the small wavelengths, which can be exploited for beamforming and multiplexing gains. However, the complexity of digitally processing the entire high-dimensional signal is prohibitive. By exploiting the inherent channel sparsity in beamspace due to highly directional propagation at mm-wave, it is possible to design near-optimal transceivers with dramatically lower complexity. In such beamspace MIMO systems, it is first necessary to determine the set of beams which define the low-dimensional communication subspace. In this paper, we address this beam selection problem and introduce a simple power-based classifier for determining the beamspace sparsity pattern that characterizes the communication subspace. We first introduce a physical model for a small cell which will serve as the setting for our analysis. We then develop a classifier for the physical model, and show its optimality for a class of ideal signals. Finally, we present illustrative numerical results and show the feasibility of the classifier in mobile settings.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"20 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":"125201275","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}
引用次数: 39
Portfolio theory based sensor selection in Wireless Sensor Networks with unreliable observations 基于组合理论的不可靠无线传感器网络传感器选择
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460545
Nianxia Cao, Swastik Brahma, P. Varshney
{"title":"Portfolio theory based sensor selection in Wireless Sensor Networks with unreliable observations","authors":"Nianxia Cao, Swastik Brahma, P. Varshney","doi":"10.1109/CISS.2016.7460545","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460545","url":null,"abstract":"In this paper, we propose a portfolio theory based sensor selection framework in Wireless Sensor Networks (WSNs) with unreliable sensor observations for target localization. Fisher information (FI) is used as the sensor selection metric in our work. Our objective is to find a sensor selection scheme that considers both the expected FI gain and the reliability of the sensors, where we observe that the FI variability captures the reliability of the sensors. Based on portfolio theory, we formulate our sensor selection problem as a multiobjective optimization problem (MOP), which is solved by the normal boundary intersection (NBI) method. Simulation results show the advantages of performing portfolio theory based sensor selection.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"5 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":"126588444","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
Non-parametric change point detection for spike trains 尖峰列车的非参数变点检测
2016 Annual Conference on Information Science and Systems (CISS) Pub Date : 2016-03-16 DOI: 10.1109/CISS.2016.7460561
T. Mosqueiro, M. Strube-Bloss, R. Tuma, R. Pinto, B. Smith, R. Huerta
{"title":"Non-parametric change point detection for spike trains","authors":"T. Mosqueiro, M. Strube-Bloss, R. Tuma, R. Pinto, B. Smith, R. Huerta","doi":"10.1109/CISS.2016.7460561","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460561","url":null,"abstract":"Two techniques of non-parametric change point detection are applied to two different neuroscience datasets. In the first dataset, we show how the multivariate non-parametric change point detection can precisely estimate reaction times to input stimulation in the olfactory system using joint information of spike trains from several neurons. In the second example, we propose to analyze communication and sequence coding using change point formalism as a time segmentation of homogeneous pieces of information, revealing cues to elucidate directionality of the communication in electric fish. We are also sharing our software implementation Chapolins at GitHub.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"38 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":"126913223","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
首页 上一页 下一页 尾页
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学术官方微信