Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920350
Zhang Jiaan, X. Tao, Liang Wei, Xu Sheng, Guo Lingxu, H. Zhigang, Fan Guangmin
To meet the requirements for power grid data sharing and model maintenance, this paper proposes a cooperative modeling scheme between transformer substations and the control center. The implementation is based on chartmodel integration in which power grid data and graphics are described interactively. The models cover the standards of the 61850 and 61970. The SCL described substation configurations such as ICD, SCD, SSD and CID files may be derived from the integrated model for intelligent substation assembling. The CIM model and the SVG graphics may be also derived from it. The integrated model is applicable for substation modeling and grid model merging. The scheme facilitates the power grid data sharing and the equipment model maintenance both in the substation and the control center.
{"title":"A cooperative modeling scheme between power transformer substation and control center","authors":"Zhang Jiaan, X. Tao, Liang Wei, Xu Sheng, Guo Lingxu, H. Zhigang, Fan Guangmin","doi":"10.1109/ICIST.2014.6920350","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920350","url":null,"abstract":"To meet the requirements for power grid data sharing and model maintenance, this paper proposes a cooperative modeling scheme between transformer substations and the control center. The implementation is based on chartmodel integration in which power grid data and graphics are described interactively. The models cover the standards of the 61850 and 61970. The SCL described substation configurations such as ICD, SCD, SSD and CID files may be derived from the integrated model for intelligent substation assembling. The CIM model and the SVG graphics may be also derived from it. The integrated model is applicable for substation modeling and grid model merging. The scheme facilitates the power grid data sharing and the equipment model maintenance both in the substation and the control center.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114106776","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}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920322
M. Popovic, I. Basicevic
Transactional Memory (TM) is an attractive concurrency control mechanism that should deliver much better performance than locks in case when transaction conflicts are rare. But, if the probability of conflicts is high, TM program performance may be very poor. Therefore, when engineering mission critical systems, we need to be able to calculate conflict probabilities. In this paper we study a class of stochastic TM programs for processing groups of transactions on a set of shared t-variables, e.g. bank accounts. Individual transactions are selecting variables they are operating on uniformly at random. We identify and define various types of conflicts among transactions that may arise in such circumstances. We also show how to calculate probabilities of various types of conflicts on some simple examples of groups of transactions sharing one or two t-variables. Our work is still in progress, but the results shown here are affirmative for the approach we use, and they stimulate further research towards more general analysis of this class of TM programs.
{"title":"Conflict types and probabilities in stochastic TM-programs","authors":"M. Popovic, I. Basicevic","doi":"10.1109/ICIST.2014.6920322","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920322","url":null,"abstract":"Transactional Memory (TM) is an attractive concurrency control mechanism that should deliver much better performance than locks in case when transaction conflicts are rare. But, if the probability of conflicts is high, TM program performance may be very poor. Therefore, when engineering mission critical systems, we need to be able to calculate conflict probabilities. In this paper we study a class of stochastic TM programs for processing groups of transactions on a set of shared t-variables, e.g. bank accounts. Individual transactions are selecting variables they are operating on uniformly at random. We identify and define various types of conflicts among transactions that may arise in such circumstances. We also show how to calculate probabilities of various types of conflicts on some simple examples of groups of transactions sharing one or two t-variables. Our work is still in progress, but the results shown here are affirmative for the approach we use, and they stimulate further research towards more general analysis of this class of TM programs.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126642396","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}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920601
Sun Yao-sheng, Huang Zhang-can, Chen Yu, Yu-Te Chao
Inspired by the migration behaviours of eels, we propose a new discrete eel swarm intelligence algorithm in this paper. First, this paper analyzes the behaviours of eels, then establishes a mathematical model of the important behaviour being extracted. Based on rational organization of three important behaviours of eel, namely concentration adaptation, neighbourhood learning and gender mutation, the discrete eel swarm intelligence algorithm is proposed for combinatorial optimization problems. Finally, numerical experiments on the TSP problem and the permutation flow-shop scheduling problem show that the algorithm has strong optimization capability and accuracy.
{"title":"A new discrete eel swarm intelligence algorithm","authors":"Sun Yao-sheng, Huang Zhang-can, Chen Yu, Yu-Te Chao","doi":"10.1109/ICIST.2014.6920601","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920601","url":null,"abstract":"Inspired by the migration behaviours of eels, we propose a new discrete eel swarm intelligence algorithm in this paper. First, this paper analyzes the behaviours of eels, then establishes a mathematical model of the important behaviour being extracted. Based on rational organization of three important behaviours of eel, namely concentration adaptation, neighbourhood learning and gender mutation, the discrete eel swarm intelligence algorithm is proposed for combinatorial optimization problems. Finally, numerical experiments on the TSP problem and the permutation flow-shop scheduling problem show that the algorithm has strong optimization capability and accuracy.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127777627","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}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920404
Liangliang Cui, Y. Ou, Junbo Xin, Dawei Dai, Xiang Gao
Recently, learning based control is a popular topic on robotic applications. This paper presents a novel learning based intelligent control method which realizes the balance control of a statically unstable and dynamically stable robot - a two-wheeled self-balancing robot. The control strategy could be segmented into two levels: a learning based controller using Support Vector Regression approach as a high level and a traditional PD controller as a low level. Support Vector Regression is utilized to learn the mapping between robot's state data and corresponding actions from experiments by using the inclined angle and its angular speed as inputs and the wheels velocity of the robot needed to keep balance as outputs. And the low level PD controller makes sure the motors achieve the velocity value gained before. Experiments are taken to show that the control method is useful and efficient. Additionally, this paper presents a practice of learning based control.
{"title":"Control of a two-wheeled self-balancing robot with support vector regression method","authors":"Liangliang Cui, Y. Ou, Junbo Xin, Dawei Dai, Xiang Gao","doi":"10.1109/ICIST.2014.6920404","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920404","url":null,"abstract":"Recently, learning based control is a popular topic on robotic applications. This paper presents a novel learning based intelligent control method which realizes the balance control of a statically unstable and dynamically stable robot - a two-wheeled self-balancing robot. The control strategy could be segmented into two levels: a learning based controller using Support Vector Regression approach as a high level and a traditional PD controller as a low level. Support Vector Regression is utilized to learn the mapping between robot's state data and corresponding actions from experiments by using the inclined angle and its angular speed as inputs and the wheels velocity of the robot needed to keep balance as outputs. And the low level PD controller makes sure the motors achieve the velocity value gained before. Experiments are taken to show that the control method is useful and efficient. Additionally, this paper presents a practice of learning based control.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126664858","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}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920360
Jianping Han, Hao Liu, Yuanyuan Zhou, Rumei Zhang, Changji Li
The clamp-on transit-time ultrasonic flow meters are widely applied for the advantage of noninvasive measurement and convenient deployment. Its key point lies on measuring of the time difference between the upstream and downstream. While high quality of the transducer transmitting/receiving ultrasonic signals is the premise of measuring time difference accurately. This paper studies on the main factors contributing to the uncertainty of the transducer's output signal and focuses on the transducer's frequency, incident angle and the separate distance. The selection principle of transducer's frequency is presented by the analysis of the ultrasonic attention characteristics in the liquid. The incident angle range and precise installation distance of the transducers are calculated and analyzed by Snell's law. Experiments are also carried out with the 1MHz transducers clamped on the aluminium pipe of 20mm outer diameter. The results show that the accurate calculation separate distance 18.16mm is effective to guarantee the output of high quality ultrasonic wave. If the axial installation error reaches more than 3mm, the one beam of ultrasonic signal cannot be guaranteed.
{"title":"Studies on the transducers of clamp-on transit-time ultrasonic flow meter","authors":"Jianping Han, Hao Liu, Yuanyuan Zhou, Rumei Zhang, Changji Li","doi":"10.1109/ICIST.2014.6920360","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920360","url":null,"abstract":"The clamp-on transit-time ultrasonic flow meters are widely applied for the advantage of noninvasive measurement and convenient deployment. Its key point lies on measuring of the time difference between the upstream and downstream. While high quality of the transducer transmitting/receiving ultrasonic signals is the premise of measuring time difference accurately. This paper studies on the main factors contributing to the uncertainty of the transducer's output signal and focuses on the transducer's frequency, incident angle and the separate distance. The selection principle of transducer's frequency is presented by the analysis of the ultrasonic attention characteristics in the liquid. The incident angle range and precise installation distance of the transducers are calculated and analyzed by Snell's law. Experiments are also carried out with the 1MHz transducers clamped on the aluminium pipe of 20mm outer diameter. The results show that the accurate calculation separate distance 18.16mm is effective to guarantee the output of high quality ultrasonic wave. If the axial installation error reaches more than 3mm, the one beam of ultrasonic signal cannot be guaranteed.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121873029","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}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920527
Nan Sha, Yuanyuan Gao, Xiaoxin Yi, Wenlong Li, Y. Long
This paper presents a joint physical-layer network coding (PNC) and serially concatenated continuous phase modulation (SCCPM) scheme in a two-way relay (TWR) channel. This proposed scheme can be viewed as a serial concatenated codes (SCCs) scheme in which the joint CPM and PNC is the inner code and the convolutional code (CC) is the outer code. It aims to improve the spectral efficiency, error performance and power efficiency of the PNC system by utilizing the technical advantage of CPM and SCCs. An iterative decoding algorithm for the relay receiver over AWGN channels is investigated. Emphasis is put on the extrinsic logarithmic likelihood ratios (LLRs) of the XORed codewords generated by the soft input soft output (SISO) inner decoder. Simulation results are also provided to show the error performance of the joint scheme.
{"title":"Joint serially concatenated continuous phase modulation and physical-layer network coding","authors":"Nan Sha, Yuanyuan Gao, Xiaoxin Yi, Wenlong Li, Y. Long","doi":"10.1109/ICIST.2014.6920527","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920527","url":null,"abstract":"This paper presents a joint physical-layer network coding (PNC) and serially concatenated continuous phase modulation (SCCPM) scheme in a two-way relay (TWR) channel. This proposed scheme can be viewed as a serial concatenated codes (SCCs) scheme in which the joint CPM and PNC is the inner code and the convolutional code (CC) is the outer code. It aims to improve the spectral efficiency, error performance and power efficiency of the PNC system by utilizing the technical advantage of CPM and SCCs. An iterative decoding algorithm for the relay receiver over AWGN channels is investigated. Emphasis is put on the extrinsic logarithmic likelihood ratios (LLRs) of the XORed codewords generated by the soft input soft output (SISO) inner decoder. Simulation results are also provided to show the error performance of the joint scheme.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123544101","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}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920565
Xiaoke Li, Junmin Wu, Zhibin Yu, Chengzhong Xu, Kai Chen
Benefiting from integrating massive parallel processors, Graphics Processing Units(GPUs) have become prevalent computing devices for general-purpose parallel applications - so called GPGPU computing. While providing powerful computation capability, GPGPUs are power hungry. Almost half of the total amount of a GPGPU-based system power is consumed by GPGPU, which has seriously hindered the application of GPGPUs. As such, it's essential to build an accurate and robust model to analyze the performance and power consumption of GPGPUs. In this paper, we propose an adaptive performance and power consumption model by using random forest algorithm. The model is based on the overall GPU architecture performance counters, including multi-processor, memory access pattern and bandwidth metrics, and adapts to different NVIDIA GPU architectures. The results demonstrate that our model can achieve an average accuracy with prediction error 2.1% and 3.2% for the performance and power consumption, respectively. Furthermore, by identifying the most important impact factors and quantifying their contributions, our proposed approach can help GPGPU programmers and architects get quick insights on the performance and power consumption of GPGPU systems.
{"title":"An adaptive GPU performance and power model","authors":"Xiaoke Li, Junmin Wu, Zhibin Yu, Chengzhong Xu, Kai Chen","doi":"10.1109/ICIST.2014.6920565","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920565","url":null,"abstract":"Benefiting from integrating massive parallel processors, Graphics Processing Units(GPUs) have become prevalent computing devices for general-purpose parallel applications - so called GPGPU computing. While providing powerful computation capability, GPGPUs are power hungry. Almost half of the total amount of a GPGPU-based system power is consumed by GPGPU, which has seriously hindered the application of GPGPUs. As such, it's essential to build an accurate and robust model to analyze the performance and power consumption of GPGPUs. In this paper, we propose an adaptive performance and power consumption model by using random forest algorithm. The model is based on the overall GPU architecture performance counters, including multi-processor, memory access pattern and bandwidth metrics, and adapts to different NVIDIA GPU architectures. The results demonstrate that our model can achieve an average accuracy with prediction error 2.1% and 3.2% for the performance and power consumption, respectively. Furthermore, by identifying the most important impact factors and quantifying their contributions, our proposed approach can help GPGPU programmers and architects get quick insights on the performance and power consumption of GPGPU systems.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130605595","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}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920333
Jianmin Bao, Huan Wang, Xuan Shen, Gang Cui
Keyword search technique over relational databases is a research hot-spot in database field. At present, there have been many ranking correlation algorithms for object-level keyword search over relational databases. Object-level keyword search can better integrate information scattered in various tuples. OCS(Object-level Correction Sort) algorithm cannot rank results in keyword search accurately as was expected. This paper foucuses on the problems of ranking results in keyword search system for object-level over relational databases and proposes a new ranking algorithm SOCA(Sort of Correction Algorithm) which takes into consideration the content information of key attributes, and the correlation of non-key attributes. We use Weight to evaluate the content information of key attributes, and Correlation to assess the correlation of non-key attributes Finally, we give a score function about contents Correlation and Weight. Experiments demonstrate that this algorithm can effectively rank results and verify its reasonableness and effectiveness.
关系型数据库关键字搜索技术是数据库领域的研究热点。目前，针对关系数据库中对象级关键字搜索，已经出现了许多排序关联算法。对象级关键字搜索可以更好地整合分散在各种元组中的信息。OCS(Object-level Correction Sort，对象级校正排序)算法在关键字搜索中不能按预期对结果进行准确排序。针对对象级关系型数据库关键字搜索系统中的排序问题，提出了一种考虑关键属性内容信息和非关键属性相关性的排序算法SOCA(Sort of Correction algorithm)。我们用权重来评价关键属性的内容信息，用相关性来评价非关键属性的相关性，最后给出了内容相关性和权重的评分函数。实验表明，该算法能有效地对结果进行排序，验证了算法的合理性和有效性。
{"title":"A ranking algorithm based on contents and non-key attributes for object-level keyword search over relational databases","authors":"Jianmin Bao, Huan Wang, Xuan Shen, Gang Cui","doi":"10.1109/ICIST.2014.6920333","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920333","url":null,"abstract":"Keyword search technique over relational databases is a research hot-spot in database field. At present, there have been many ranking correlation algorithms for object-level keyword search over relational databases. Object-level keyword search can better integrate information scattered in various tuples. OCS(Object-level Correction Sort) algorithm cannot rank results in keyword search accurately as was expected. This paper foucuses on the problems of ranking results in keyword search system for object-level over relational databases and proposes a new ranking algorithm SOCA(Sort of Correction Algorithm) which takes into consideration the content information of key attributes, and the correlation of non-key attributes. We use Weight to evaluate the content information of key attributes, and Correlation to assess the correlation of non-key attributes Finally, we give a score function about contents Correlation and Weight. Experiments demonstrate that this algorithm can effectively rank results and verify its reasonableness and effectiveness.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134249444","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}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920559
Kedi Xu, Yi Qu, Kang Lin, Xiaoxiang Zheng, Yueming Wang
Research on flashing light stimulus dependence of activity in the visual system is a meaningful supplement to the understanding of visual system of central nervous system (CNS). Meanwhile, the novel method brain machine interfaces (BMIs) makes it possible to read out visual perception and have been applied to separate different visual perception of CNS. The combination of BMIs based visual perception system and rat robot navigation system may be applied to detect the condition of flashing light of unknown environment in the future. In this paper, we introduced a BMI-based system to evaluate the effectiveness of flashing light recognition with neural signal recorded from primary visual cortex of free-moving rats. We first analyzed features of neural signal and found significant difference between Stimulus state and Control state as well as discernible difference between high and low flashing frequencies. The results of average areas under receiver operating characteristic (ROC) curve (AUC) of cross-validation with prediction algorithm reached 0.9238 between high flashing rate stimulation and Control state, 0.8942 between low flashing rate and Control state in dark circumstance.
{"title":"A BMI-based flashing light recognition system on free-moving rats","authors":"Kedi Xu, Yi Qu, Kang Lin, Xiaoxiang Zheng, Yueming Wang","doi":"10.1109/ICIST.2014.6920559","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920559","url":null,"abstract":"Research on flashing light stimulus dependence of activity in the visual system is a meaningful supplement to the understanding of visual system of central nervous system (CNS). Meanwhile, the novel method brain machine interfaces (BMIs) makes it possible to read out visual perception and have been applied to separate different visual perception of CNS. The combination of BMIs based visual perception system and rat robot navigation system may be applied to detect the condition of flashing light of unknown environment in the future. In this paper, we introduced a BMI-based system to evaluate the effectiveness of flashing light recognition with neural signal recorded from primary visual cortex of free-moving rats. We first analyzed features of neural signal and found significant difference between Stimulus state and Control state as well as discernible difference between high and low flashing frequencies. The results of average areas under receiver operating characteristic (ROC) curve (AUC) of cross-validation with prediction algorithm reached 0.9238 between high flashing rate stimulation and Control state, 0.8942 between low flashing rate and Control state in dark circumstance.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132997220","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}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920405
Wan Wei, Ling Jun
Botnet as a new technology of attacks is a serious threat to Internet security. With the rapid development of the botnet, botnet based several protocols came into being. In accordance with the activity similarity of botnet, a method has application in botnet detection. Firstly, according to the situation and problems of the botnet recently, the life cycle and behavior characteristics of the botnet have been analyzed. After that a method based on activity similarity has been research to detect if a node is in a botnet. Finally, we analyzed and summarized the experimental results, and verified the reliability and rationality of the detection method.
{"title":"Botnet detecting method based on activity similarity","authors":"Wan Wei, Ling Jun","doi":"10.1109/ICIST.2014.6920405","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920405","url":null,"abstract":"Botnet as a new technology of attacks is a serious threat to Internet security. With the rapid development of the botnet, botnet based several protocols came into being. In accordance with the activity similarity of botnet, a method has application in botnet detection. Firstly, according to the situation and problems of the botnet recently, the life cycle and behavior characteristics of the botnet have been analyzed. After that a method based on activity similarity has been research to detect if a node is in a botnet. Finally, we analyzed and summarized the experimental results, and verified the reliability and rationality of the detection method.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130993419","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：