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

2011 11th International Symposium on Communications & Information Technologies (ISCIT)最新文献

筛选
英文 中文
A dynamic association control mechanism for bus networks 总线网络的动态关联控制机制
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089742
Luobei Kuang, Ming Xu, Yingwen Chen, Bo Xie, Xiaoqiang Xiao
{"title":"A dynamic association control mechanism for bus networks","authors":"Luobei Kuang, Ming Xu, Yingwen Chen, Bo Xie, Xiaoqiang Xiao","doi":"10.1109/ISCIT.2011.6089742","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089742","url":null,"abstract":"With multiple Access Points (APs) deployed around a bus stop, association control for bus networks is important since bus networks have their own characteristics of mobility and dynamic diversity (dynamic bus transmission rate, dynamic bus arrival and dynamic user arrival/departure). Combined with the predicted mobility, this paper investigates the association control mechanism for bus networks. We firstly construct a dynamic AP-Bus graph to describe the dynamics. Then the association problem is formulized to a linear integer programming problem based on the AP-Bus graph. As the problem is NP-Hard, two approximation integral solutions are proposed further. Through the simulation experiments, the dynamic solutions outperform traditional methods.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130401586","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
A novel frequency estimation method for harmonic signal in chaos 混沌中谐波信号的一种新的频率估计方法
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089722
Haixin Sun, Yaowu Shi, Xiaodong Sun
{"title":"A novel frequency estimation method for harmonic signal in chaos","authors":"Haixin Sun, Yaowu Shi, Xiaodong Sun","doi":"10.1109/ISCIT.2011.6089722","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089722","url":null,"abstract":"In this paper, we present a new method to estimate the frequencies of the harmonic signals embedded in strong chaotic interference. The method is based on wavelet multi-scale decomposition algorithm and correlation theory. Since the statistical characteristics of the harmonic signal and the chaotic interference are different, we use wavelet multi-scale decomposition algorithm to separate the harmonic signal from the chaotic interference and apply correlation theory to estimate the frequencies of the harmonic signals. The case in which white Gaussian noise exists in the chaotic interference is also studied in the paper. The method does not need either the dynamical equation or the reconstruction of the phase space of the chaotic interference. Theoretical analysis and simulation results validate the effectiveness of the proposed method.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124651076","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
An improved LDPC decoding algorithm based on min-sum algorithm 基于最小和算法的改进LDPC译码算法
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089747
Yue Cao
{"title":"An improved LDPC decoding algorithm based on min-sum algorithm","authors":"Yue Cao","doi":"10.1109/ISCIT.2011.6089747","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089747","url":null,"abstract":"Low density parity check code is a kind of high-performance linear block code. It has excellent performance which is near the Shannon limit. LDPC has low decoding complexity, free structure and receives extensive attention. The typical decoding algorithm of LDPC is LLR BP algorithm, which is also called “sum-product algorithm”. LLR BP algorithm is the best algorithm at present. But it needs complex computation, which causes great difficulty in its hardware design. To solve this problem, an algorithm that gets approximation of LLR BP algorithm is put forward, which is called min-sum algorithm. Min-sum algorithm greatly reduces the computation and makes the hardware design simpler, but its accuracy has a wide gap with BP algorithm. This article analyzes the reason why min-sum algorithm has errors, and puts forward an improved algorithm called min-sum linear approximation algorithm based on min-sum algorithm.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121104079","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
The ‘neural space’: A physiologically inspired noise reduction strategy based on fractional derivatives “神经空间”:一种基于分数阶导数的生理激发的降噪策略
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6092161
Jinqiu Sang, Hongmei Hu, I. Winter, Matthew C. M. Wright, S. Bleeck
{"title":"The ‘neural space’: A physiologically inspired noise reduction strategy based on fractional derivatives","authors":"Jinqiu Sang, Hongmei Hu, I. Winter, Matthew C. M. Wright, S. Bleeck","doi":"10.1109/ISCIT.2011.6092161","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092161","url":null,"abstract":"We present a novel noise reduction strategy that is inspired by the physiology of the auditory brainstem. Following the hypothesis that neurons code sound based on fractional derivatives we develop a model in which sound is transformed into a ‘neural space’. In this space sound is represented by various fractional derivatives of the envelopes in a 22 channel filter bank. We demonstrate that noise reduction schemes can work in the neural space and that the sound can be resynthesized. A supervised sparse coding strategy reduces noise while keeping the sound quality intact. This was confirmed in preliminary subjective listening tests. We conclude that new signal processing schemes, inspired by neuronal processing, offer exciting opportunities to implement novel noise reduction and speech enhancement algorithms.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133185214","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
Joint power and subchannel allocation in relay aided multi-cell OFDMA networks 中继辅助多小区OFDMA网络中的联合功率和子信道分配
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6092180
Miaomiao Dong, Qinghai Yang, Fenglin Fu, K. Kwak
{"title":"Joint power and subchannel allocation in relay aided multi-cell OFDMA networks","authors":"Miaomiao Dong, Qinghai Yang, Fenglin Fu, K. Kwak","doi":"10.1109/ISCIT.2011.6092180","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092180","url":null,"abstract":"In this paper, a joint power and subchannel allocation strategy is investigated for relay-aided multi-cell OFDMA networks. The problem is formulated for maximizing the network throughput with minimal bandwidth cost under the users' minimum rate constraints. The method of Benders' Decomposition is employed to decompose the complicated problem into two subproblems, which solves the subchannel and power allocation issues separately. The low-complexity algorithms for two sub-problems are developed to allocate the subchannel and power adaptively. Simulation results show that the algorithm converges and benefits higher throughput and spectral efficiency.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132035509","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
Impulse noise suppression of OFDM using linear programming 基于线性规划的OFDM脉冲噪声抑制
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089702
M. Okada, Ziji Ma
{"title":"Impulse noise suppression of OFDM using linear programming","authors":"M. Okada, Ziji Ma","doi":"10.1109/ISCIT.2011.6089702","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089702","url":null,"abstract":"Impulsive noise interference is a significant problem for the Integrated Services Digital Broadcasting for Terrestrial (ISDB-T) receivers due to its effect on the orthogonal frequency division multiplexing (OFDM) signal. In this paper, an adaptive scheme to suppress the effect of impulsive noise is proposed. The impact of impulsive noise can be detected by using the guard band in the frequency domain; furthermore the position information of the impulsive noise, including burst duration, instantaneous power and arrived time, can be estimated as well. Then a time-domain window function with adaptive parameters, which are decided in terms of the estimated information of the impulsive noise and the carrier-to-noise ratio (CNR), is employed to suppress the impulsive interference. In order to solve the inter-channel interference (ICI) due to suppression of OFDM signal, linear programming based equalization is further estimated. Simulation results confirm the validity of the proposed scheme, which improved the bit error rate (BER) performance for the ISDB-T receivers in both AWGN channel and Rayleigh fading channel.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133420691","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
A novel approach for collaborative filtering to alleviate the new item cold-start problem 一种新的协同过滤方法来缓解新项目冷启动问题
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089959
Dongting Sun, Zhigang Luo, Fuhai Zhang
{"title":"A novel approach for collaborative filtering to alleviate the new item cold-start problem","authors":"Dongting Sun, Zhigang Luo, Fuhai Zhang","doi":"10.1109/ISCIT.2011.6089959","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089959","url":null,"abstract":"Recommender systems have been widely used as an important response to information overload problem by providing users with more personalized information services. The most popular core technique of such systems is collaborative filtering, which utilizes users' known preference to generate predictions of the unknown preferences. A key challenge for collaborative filtering recommender systems is generating high quality recommendations on the cold-start items, on which no user has expressed preferences yet. In this paper, we propose a hybrid algorithm by using both the ratings and content information to tackle item-side cold-start problem. We first cluster items based on the rating matrix and then utilize the clustering results and item content information to build a decision tree to associate the novel items with the existing ones. Considering the ratings on novel item constantly increasing, we show predictions of our approach can be combined with the traditional collaborative-filtering methods to yield superior performance with a coefficient. Experiments on real data set show the improvement of our approach in overcoming the item-side cold-start problem.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132543216","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}
引用次数: 32
Similar vulnerability query based on text mining 基于文本挖掘的相似漏洞查询
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089949
Jin Yi, R. Wu, Juan Li, Qi Xiong, Fajiang Yu, Tao Peng, Zhenyu Yang, Bo Han
{"title":"Similar vulnerability query based on text mining","authors":"Jin Yi, R. Wu, Juan Li, Qi Xiong, Fajiang Yu, Tao Peng, Zhenyu Yang, Bo Han","doi":"10.1109/ISCIT.2011.6089949","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089949","url":null,"abstract":"With many security events taking place in recent years, scientists have realized vulnerability management is an important field and it brings critical effects to many information systems and services. One topic in this field is to identify similarity relationship between vulnerabilities. It can help us to alarm potential attacks. In this paper, we propose a text mining approach to compute a similarity score between two vulnerabilities based on their text description. It consists of two steps: preprocessing and similarity score computation. Experimental results based on an annotated vulnerability dataset have proved the effectiveness of our approach.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131328932","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
Distributed anomaly event detection in wireless networks using compressed sensing 基于压缩感知的无线网络分布式异常事件检测
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089743
Yu Xia, Zhifeng Zhao, Honggang Zhang
{"title":"Distributed anomaly event detection in wireless networks using compressed sensing","authors":"Yu Xia, Zhifeng Zhao, Honggang Zhang","doi":"10.1109/ISCIT.2011.6089743","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089743","url":null,"abstract":"Compressed sensing (CS) is an emerging theory that has earned increasing interests in the area of wireless communication and signal processing. It states that the salient information of a signal can be recovered from a relatively small number of linear projections. In wireless networks, anomaly detection is an attractive application. Current research shows that it is promising to apply CS into sparse anomaly network detection, as the number of abnormal events seems much smaller than the total number of nodes. In this article, we firstly propose an ameliorated reconstruction method for abnormal event detection in noise-involved wireless networks, where no prior information is needed. Second, we improve this method to solve a distributed anomaly detection problem considering energy consumption and detection accuracy. Finally, we analyze the performance of our scheme in different conditions. Simulation shows that our detection algorithm proves to be valid and much energy can be saved by the distributed scheme with acceptable performance.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"289 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114382288","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
Some observations on individual TCP flows behavior in network traffic traces 对网络流量轨迹中单个TCP流行为的一些观察
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089952
L. Qian, B. Carpenter
{"title":"Some observations on individual TCP flows behavior in network traffic traces","authors":"L. Qian, B. Carpenter","doi":"10.1109/ISCIT.2011.6089952","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089952","url":null,"abstract":"We propose a modified Transmission Control Protocol (TCP) flow classification method and Round Trip Time (RTT) computation method which is more precise and more dynamic than the traditional fixed timeout method, especially for long, sparse TCP flows and long RTTs. Then we present passive measurement results for TCP RTT and RTT variation in network traffic traces. Analysis shows several interesting behavior patterns in individual flows. We observe TCP flows with regular patterns of RTT distribution. Individual TCP flows may also apparently have self-similar RTT distributions. Most long-active but sparse TCP flows use port 80 with a relatively short RTT. Lastly, we show and discuss plots of TCP flows with very long RTT values.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116047322","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信