2017 International Conference on Computer, Information and Telecommunication Systems (CITS)最新文献

筛选
英文 中文
Risk early warning and evaluation method for electric power SDH networks based on BP neural network algorithm 基于BP神经网络算法的电力SDH网络风险预警与评估方法
Huicong Fan, Tom Zhijiang Fu, Hua Shao, Xiaomei Wang, Xiaotong Wang
{"title":"Risk early warning and evaluation method for electric power SDH networks based on BP neural network algorithm","authors":"Huicong Fan, Tom Zhijiang Fu, Hua Shao, Xiaomei Wang, Xiaotong Wang","doi":"10.1109/CITS.2017.8035306","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035306","url":null,"abstract":"Electric power SDH network is a comprehensive communication network, which takes advantages of SDH technology, and is a widely used technology. How to protect the network more effectively is the concern of the operators. So the main purpose of this paper is to find a way to analysis risk in advance and enhance reliability of electric power SDH network. Firstly, we set up an evaluation index system and then we design a method of risk evaluation algorithm based on the BP neural network. After that we can propose the corresponding early warning model. At last, we obtain a multi-level and multi-angle risk early warning and evaluation method for electric power SDH network. We use MATLAB to obtain simulation results in three aspects, different electric power SDH network loads, different channel pressure and in the case of load balancing. Simulation results show that this method can comprehensively analyze the risks existing in the network and give the corresponding warning, and it can also achieve better evaluation effect under different load pressures.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115554296","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
Performance evaluation of OFDM transmission over impulsive noisy channels 脉冲噪声信道下OFDM传输性能评价
Chol Ho Ri, S. Eisenbarth, Y. Chon, Yong Chan Ri
{"title":"Performance evaluation of OFDM transmission over impulsive noisy channels","authors":"Chol Ho Ri, S. Eisenbarth, Y. Chon, Yong Chan Ri","doi":"10.1109/CITS.2017.8035300","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035300","url":null,"abstract":"When impulsive noise occurs in a general power line communication (PLC) channel, it is known that the Orthogonal Frequency Division Multiplexing (OFDM) systems are relatively robust to such noise. In this paper, we provide a closed-form analysis of a communication channel where Impulsive Noise (IN) and Additive White Gaussian Noise (AWGN) coexist. Our analysis is used to describe a “noise power spread phenomenon” which spreads impulsive noise over all OFDM carriers thereby contributing to the robustness of OFDM systems, particularly those with a large number of carriers. The closed form analysis was simulated and a number of data plots are provided which demonstrate the significant features and impact of impulsive noise on OFDM systems.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124897305","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}
引用次数: 10
A load balancing algorithm based on key-link and resources contribution degree for virtual optical networks mapping 一种基于键链和资源贡献度的虚拟光网络映射负载均衡算法
Guoqiang Zhao, Zhanqi Xu, Z. Ye, Kai Wang, Jie Wu
{"title":"A load balancing algorithm based on key-link and resources contribution degree for virtual optical networks mapping","authors":"Guoqiang Zhao, Zhanqi Xu, Z. Ye, Kai Wang, Jie Wu","doi":"10.1109/CITS.2017.8035285","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035285","url":null,"abstract":"Aiming at efficiently mapping multiple virtual optical networks (VONs) on a shared substrate network. This paper proposes a load balancing algorithm that is based on key-link and resources contribution degree (RCD) for VONs mapping (KLRVM) in elastic optical networks (EONs). In this algorithm, virtual nodes mapping gets the network status according to the proposed RCD, and comprehensively considers nodes computing resource, shortest path length and available bandwidth. While the link length, the occupied link bandwidth and key-link parameters are holistically considered to complete the virtual links mapping, thus bottle-neck links of a network could be avoided. Simulation results show that the proposed algorithm can effectively improve the balance performance of network load and reduce the spectrum resource usage.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130736848","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
KMS-Cube — A general alternative to hypercubes for reducing the node degree KMS-Cube -用于减少节点度的超立方体的一般替代方案
Yamin Li, Wanming Chu
{"title":"KMS-Cube — A general alternative to hypercubes for reducing the node degree","authors":"Yamin Li, Wanming Chu","doi":"10.1109/CITS.2017.8035291","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035291","url":null,"abstract":"As the scale of parallel computer systems becomes larger year by year, interconnection networks with low node degree and short diameter are required for achieving high communication performance at low cost. This paper presents a general alternative to hypercubes, named KMS-Cube, that keeps interesting topological properties of the hypercube but has a low node degree. A KMS-Cube, denoted by KMSC(k, m, s), is configured with three parameters k, m, and s. The node address has m2k−s + k bits and the node degree is k + m, much less than that of hypercubes. Comparing to other alternatives to hypercubes, KMS-Cube has advantages such as the ease of routing and the flexibility of changing network size. We describe the KMS-Cube's structure and its topological properties, compare it with other networks on the measures of node degree, diameter, and cost ratio, and present an efficient routing algorithm for the KMS-Cube.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121295870","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
Text genre classification research 文本体裁分类研究
Zhijuan Xu, Lizhen Liu, Wei Song, Chao Du
{"title":"Text genre classification research","authors":"Zhijuan Xu, Lizhen Liu, Wei Song, Chao Du","doi":"10.1109/CITS.2017.8035329","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035329","url":null,"abstract":"Essays in different text genres have different ideas and writing method. Prediction the text genres firstly will help get a better accuracy when predicting the success of literary or finding the beautiful words and sentences in the essay. And it will help set a different standard for different text genres when scoring the writing by computer. Words and structure can be effective in discriminating text genres. Narration and description has a difference in the words they use and the structure, we can separate them by analyze the difference. In this paper we find a method to separate the essay in different text genres by computer. We analyze the most effective features for distinguish genres. And discussed how to get a better result for genres classification. Finally, the f value reached 80% in our experiment.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122686970","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 survey of the current state of lightweight cryptography for the Internet of things 物联网轻量级加密技术的现状调查
Wanican Julian Okello, Qingling Liu, F. Siddiqui, Chaozhu Zhang
{"title":"A survey of the current state of lightweight cryptography for the Internet of things","authors":"Wanican Julian Okello, Qingling Liu, F. Siddiqui, Chaozhu Zhang","doi":"10.1109/CITS.2017.8035317","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035317","url":null,"abstract":"The Internet of things offers a promising future for all stakeholders in technology; from researchers to consumers. It comprises a network of entities i.e. everyday objects; capable of sensing, processing, storing data and communicating with other entities. These entities or “things” can be connected to the internet and monitored or controlled through a service on another module like a mobile device or computer application. This model of ubiquitous computing presents a great challenge in the form of maintaining security i.e. confidentiality, integrity, authentication and non-repudiation of data as majority of the devices run on limited resources. Our paper examines the cryptographic solutions that have so far been developed, presents their strengths and weaknesses against each other and lays out some research gaps. We also present some notable institutions and groups that are researching and developing international standards in this field. The authors goal is that this paper is usable by all levels of people in the field, however, the main target audience are the new researchers on the topic and interested readers to get a complete layout of the field.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117096427","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
A dynamic topological potential and social relationship based routing protocol for mobile social delay tolerant networks 一种基于动态拓扑势和社会关系的移动社交容忍延迟网络路由协议
Xuening Qin, G. Xie, Jinchun Gao
{"title":"A dynamic topological potential and social relationship based routing protocol for mobile social delay tolerant networks","authors":"Xuening Qin, G. Xie, Jinchun Gao","doi":"10.1109/CITS.2017.8035282","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035282","url":null,"abstract":"The design of routing protocol in mobile social delay tolerant networks is a tricky issue due to lack of stable end-to-end path, frequent link disconnection and changeable network topology. This paper proposes a novel routing algorithm based on dynamic topological potential and social relationship (DTPSR) between nodes for mobile social delay tolerant networks. In DTPSR, we define three metrics to describe the status of a node, the direct and indirect relationship between nodes respectively. Then these metrics are used to construct different utility functions and determine the optimal relay node for different situations. The extensive simulations prove that DTPSR significantly improves the delivery ratio while reducing the transmission delay and relay hops without excessive increase in computation and storage overhead. This indicates that DTPSR algorithm can find the optimal relay node more accurately.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127928528","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
A security algorithms approach to apply to the civil registry database of the Ecuador 一种适用于厄瓜多尔民事登记数据库的安全算法方法
Toapanta T. Moises, Orizaga T. Antonio, M. G. Enrique
{"title":"A security algorithms approach to apply to the civil registry database of the Ecuador","authors":"Toapanta T. Moises, Orizaga T. Antonio, M. G. Enrique","doi":"10.1109/CITS.2017.8035339","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035339","url":null,"abstract":"It was analyzed the most frequent security algorithms used for information security to mitigate the integrity, confidentiality and availability of the information. The objective is to have an approach on security algorithms and define a quantitative algorithm using flowchart techniques for a process of Ecuador civil registry database. The deductive method was used to analyze the information of the references and to identify the trends of the security algorithms; which allow mitigation of the security of a database under a distributed environment. Turned out the prototype of a process applying the technique of flowchart algorithms. It was concluded that to mitigate information vulnerabilities and risks with integrity, confidentiality and availability; it is necessary to have an identity management model, to identify a model of threats and risks, to select operational, tactical and strategic security policies, to define mechanisms for compliance with policies, to develop encryption algorithms using the flow diagram technique.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115927699","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
Sequence relay selection strategy based on the optimal stopping theory for relay assisted network 基于最优停止理论的中继辅助网络序列中继选择策略
Rui Zhu, Yangchao Huang, Hongwei Liu, Lei Jiang, Xu Hua
{"title":"Sequence relay selection strategy based on the optimal stopping theory for relay assisted network","authors":"Rui Zhu, Yangchao Huang, Hongwei Liu, Lei Jiang, Xu Hua","doi":"10.1109/CITS.2017.8035278","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035278","url":null,"abstract":"Relay selection is a crucial method that can improve the spectrum efficiency and converge performance of relay assisted (RA) network. However, most of the existing research about relay selection did not consider the effect of imperfect channel state information (CSI) and the CSI obtaining cost. Few of the study about the relay selection with imperfect CSI focused mainly on the decode-and-forward (DF) protocol. In order to overcome these shortage, a sequence relay selection strategy (SRSS) for the amplify-and-forward (AF) RA network is proposed and analyzed in this paper. Furthermore, in order to make SRSS more practical, the optimal stopping (OS) theory is investigated to work with SRSS. Numerical results indicate that the performance of SRSS with OS theory can achieve the upper bound performance of SRSS effectively.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114733548","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
IMWBF decoding algorithm with dynamic magnitude update for LDPC codes LDPC码的动态幅度更新IMWBF译码算法
H Zhao, Jianping Zheng
{"title":"IMWBF decoding algorithm with dynamic magnitude update for LDPC codes","authors":"H Zhao, Jianping Zheng","doi":"10.1109/CITS.2017.8035302","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035302","url":null,"abstract":"This paper proposes a modified IMWBF decoding algorithm for low-density parity-check (LDPC) codes. In the proposed modification, the magnitude of the received signal is updated when the number of the unsatisfied parity-check equations participated by this received signal is larger than a predetermined threshold. Through this modification, the outlier, defined as the undesired large-magnitude received signal, can achieve a larger probability to be flipped, compared with the conventional IMWBF. Simulation results show that the proposed method has better performance than the conventional IMWBF, especially for the LDPC code with low column-degree distribution.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117086880","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
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学术官方微信