Pub Date : 2014-06-27DOI: 10.1109/ICSESS.2014.6933620
Yang Bailong, Deng Chenjuan, Wu Penghui, Xi Jianxiang, Shi Lei
This paper investigates a new image encryption algorithm based on two-one-dimensional logistic chaotic inter-scrambling systems. The random disturbance is added to obtain a binary chaotic sequence. Meanwhile, m-sequence is further used to disturb the improved logistic chaotic sequence. Algorithm analysis and simulation results show that the improved algorithm has high encryption efficiency and security. It is shown that it is a good solution to the cycle degradation of one-dimension logistic sequence.
{"title":"Image encryption algorithm based on two-one-dimension logistic chaotic inter-scrambling systems and m-sequence","authors":"Yang Bailong, Deng Chenjuan, Wu Penghui, Xi Jianxiang, Shi Lei","doi":"10.1109/ICSESS.2014.6933620","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933620","url":null,"abstract":"This paper investigates a new image encryption algorithm based on two-one-dimensional logistic chaotic inter-scrambling systems. The random disturbance is added to obtain a binary chaotic sequence. Meanwhile, m-sequence is further used to disturb the improved logistic chaotic sequence. Algorithm analysis and simulation results show that the improved algorithm has high encryption efficiency and security. It is shown that it is a good solution to the cycle degradation of one-dimension logistic sequence.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"5 1","pages":"521-524"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90740868","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-06-27DOI: 10.1109/ICSESS.2014.6933530
Gwan-Hwan Hwang, Chi Wu-Lee, Yuan-Hsin Tung, Chih-Ju Chuang, Syz-Feng Wu
In this paper we propose to employ the MapReduce computing model to implement a Testing as a Service (TaaS) for stress testing. We focus on stress testing for heavy-weight network transactions. The computation power of MapReduce computing system is used to simulate concurrent network transactions issued by a lot of users. The user first describes the testing scenario which he wants to be simulate in a testing script. The TaaS platform analyzes the testing script and then automatically distributes required testing data including details of transactions and files into a MapReduce computing system. We propose three different schemes to distribute testing data and measure their performances. We compare them with the popular stress testing tool JMeter and find out that our scheme can always have the tested system deliver higher error rate during the stress testing.
{"title":"Implementing TaaS-based stress testing by MapReduce computing model","authors":"Gwan-Hwan Hwang, Chi Wu-Lee, Yuan-Hsin Tung, Chih-Ju Chuang, Syz-Feng Wu","doi":"10.1109/ICSESS.2014.6933530","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933530","url":null,"abstract":"In this paper we propose to employ the MapReduce computing model to implement a Testing as a Service (TaaS) for stress testing. We focus on stress testing for heavy-weight network transactions. The computation power of MapReduce computing system is used to simulate concurrent network transactions issued by a lot of users. The user first describes the testing scenario which he wants to be simulate in a testing script. The TaaS platform analyzes the testing script and then automatically distributes required testing data including details of transactions and files into a MapReduce computing system. We propose three different schemes to distribute testing data and measure their performances. We compare them with the popular stress testing tool JMeter and find out that our scheme can always have the tested system deliver higher error rate during the stress testing.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"66 1","pages":"137-140"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83930002","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-06-27DOI: 10.1109/ICSESS.2014.6933699
Lizhen Liu, Xuemin Dai, Chao Du, Hanshi Wang, Jingli Lu
Most existing methods used for computing semantic similarity don't take full consideration of related factors, therefore they not only fail to handle identical annotations but also show a strong bias toward well-annotated gene or gene products. Concerning these problems, we proposed a new hybrid method based on multiple factors that affect the semantic similarity of Gene Ontology (GO) terms. The new method integrated information content and the structure of GO to compute the semantic similarity of GO terms, which overcomes some serious drawbacks of pure node-based methods and edge-based methods. Experimental results demonstrate that the new method has high accuracy.
{"title":"A new hybrid semantic similarity computation method based on gene ontology","authors":"Lizhen Liu, Xuemin Dai, Chao Du, Hanshi Wang, Jingli Lu","doi":"10.1109/ICSESS.2014.6933699","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933699","url":null,"abstract":"Most existing methods used for computing semantic similarity don't take full consideration of related factors, therefore they not only fail to handle identical annotations but also show a strong bias toward well-annotated gene or gene products. Concerning these problems, we proposed a new hybrid method based on multiple factors that affect the semantic similarity of Gene Ontology (GO) terms. The new method integrated information content and the structure of GO to compute the semantic similarity of GO terms, which overcomes some serious drawbacks of pure node-based methods and edge-based methods. Experimental results demonstrate that the new method has high accuracy.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"27 1","pages":"849-853"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78514569","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-06-27DOI: 10.1109/ICSESS.2014.6933549
Liu Siqian, Li Hai, Wang Luman, Song Qi-zhu, Wang Junfeng, Chen Guocheng
TETRA communication standard developed by ETSI has become the leader in the Professional Mobile Radio market, the demand of call analysis software is increasing in the areas of testing, development and network maintenance. But the proprietary signaling of TETRA cannot be processed by most commercial call analysis software, so that we develop TETRA call analysis software to overcome this problem. In this paper, we proposed protocol process architecture based on open source software Wireshark. Some key issues of the development are discussed, including the extraction of call information, the generation of bi-directional navigable Message Sequence Chart (MSC) and network performance measurement. Finally, a test result carried by our call analysis software in an experimental TETRA network is also presented.
{"title":"Design and implementation of TETRA call analysis software","authors":"Liu Siqian, Li Hai, Wang Luman, Song Qi-zhu, Wang Junfeng, Chen Guocheng","doi":"10.1109/ICSESS.2014.6933549","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933549","url":null,"abstract":"TETRA communication standard developed by ETSI has become the leader in the Professional Mobile Radio market, the demand of call analysis software is increasing in the areas of testing, development and network maintenance. But the proprietary signaling of TETRA cannot be processed by most commercial call analysis software, so that we develop TETRA call analysis software to overcome this problem. In this paper, we proposed protocol process architecture based on open source software Wireshark. Some key issues of the development are discussed, including the extraction of call information, the generation of bi-directional navigable Message Sequence Chart (MSC) and network performance measurement. Finally, a test result carried by our call analysis software in an experimental TETRA network is also presented.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"6 1","pages":"220-223"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72935944","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-06-27DOI: 10.1109/ICSESS.2014.6933766
Lizhen Liu, Miaomiao Cheng, Hanshi Wang, Wei Song, Chao Du
Most proteins form macromolecular complexes to perform their biological functions. With the increasing availability of large amounts of high-throughput protein-protein interaction (PPI) data, a vast number of computational approaches for detecting protein complexes have been proposed to discover protein complexes from PPI networks. However, such approaches are not good enough since the high rate of noise in high-throughput PPI data, including spurious and missing interactions. In this paper, we present an algorithm for complexes identification based on neighborhood density (CIND) in weighted PPI networks. Firstly, we assigned each binary protein interaction a weight, reflecting the confidence that this interaction is a true positive interaction. Then we identify complexes based on neighborhood density using topological, and we should put attention to not only the very dense regions but also the regions with low neighborhood density. We experimentally evaluate the performance of our algorithm CIND on a few yeast PPI networks, and show that our algorithm is able to identify complexes more accurately than existing algorithms.
{"title":"Identifying protein complexes based on neighborhood density in weighted PPI networks","authors":"Lizhen Liu, Miaomiao Cheng, Hanshi Wang, Wei Song, Chao Du","doi":"10.1109/ICSESS.2014.6933766","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933766","url":null,"abstract":"Most proteins form macromolecular complexes to perform their biological functions. With the increasing availability of large amounts of high-throughput protein-protein interaction (PPI) data, a vast number of computational approaches for detecting protein complexes have been proposed to discover protein complexes from PPI networks. However, such approaches are not good enough since the high rate of noise in high-throughput PPI data, including spurious and missing interactions. In this paper, we present an algorithm for complexes identification based on neighborhood density (CIND) in weighted PPI networks. Firstly, we assigned each binary protein interaction a weight, reflecting the confidence that this interaction is a true positive interaction. Then we identify complexes based on neighborhood density using topological, and we should put attention to not only the very dense regions but also the regions with low neighborhood density. We experimentally evaluate the performance of our algorithm CIND on a few yeast PPI networks, and show that our algorithm is able to identify complexes more accurately than existing algorithms.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"12 1","pages":"1134-1137"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76668822","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-06-27DOI: 10.1109/ICSESS.2014.6933577
Zhang Chun-sheng, Li Yan
The support is generally higher when the classical apriori algorithm is used as mining data based on association rules, if the support is small low then redundant frequent item set and redundant rules are produced large, so the local effective association rules has a larger confidence and a smaller support can not be mined out, which is the fatal defects of the classical apriori algorithm. According to the defects, the effectiveness of local rules is proved at first, meanwhile, two kinds of the correction algorithms are given: the one is apriori-con algorithm based on confidence and the other is apriori algorithm based on classification which is further divided into three kinds, apriori-class-int algorithm based on interest classification, apriori-class-pre algorithm based on forecast classification and apriori-class-clr algorithm based on clustering classification. The correctness of the theory is proved in the article and the effective of the correction algorithms is showed by cases.
{"title":"Extension of local association rules mining algorithm based on apriori algorithm","authors":"Zhang Chun-sheng, Li Yan","doi":"10.1109/ICSESS.2014.6933577","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933577","url":null,"abstract":"The support is generally higher when the classical apriori algorithm is used as mining data based on association rules, if the support is small low then redundant frequent item set and redundant rules are produced large, so the local effective association rules has a larger confidence and a smaller support can not be mined out, which is the fatal defects of the classical apriori algorithm. According to the defects, the effectiveness of local rules is proved at first, meanwhile, two kinds of the correction algorithms are given: the one is apriori-con algorithm based on confidence and the other is apriori algorithm based on classification which is further divided into three kinds, apriori-class-int algorithm based on interest classification, apriori-class-pre algorithm based on forecast classification and apriori-class-clr algorithm based on clustering classification. The correctness of the theory is proved in the article and the effective of the correction algorithms is showed by cases.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"12 1","pages":"340-343"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77128034","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-06-27DOI: 10.1109/ICSESS.2014.6933708
Fuda Zheng, Fei Wang
Losses caused by various disasters are continuing to rise as the global disasters frequently occur in recent years. In order to reduce the losses, emergency platform technologies are increasingly employed by the government. If the emergency platform is damaged or destroyed due to operator errors and natural disasters, the system cannot work properly for emergency response. Disaster recovery requirement is very important for any information system, and the emergency platform needs a good protection at those critical moments. In this paper, the facility location problem for emergency platform disaster recovery center is analyzed. Based on that, the approach of adopting regional disaster recovery centers as a whole for protecting multiple emergency platform centers is investigated, and a comprehensive model to optimize the locations is put forward. A case study of the proposed method in Guangdong emergency platform system, China, is introduced.
{"title":"Modeling location problem of the regional disaster recovery centers for emergency platform system","authors":"Fuda Zheng, Fei Wang","doi":"10.1109/ICSESS.2014.6933708","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933708","url":null,"abstract":"Losses caused by various disasters are continuing to rise as the global disasters frequently occur in recent years. In order to reduce the losses, emergency platform technologies are increasingly employed by the government. If the emergency platform is damaged or destroyed due to operator errors and natural disasters, the system cannot work properly for emergency response. Disaster recovery requirement is very important for any information system, and the emergency platform needs a good protection at those critical moments. In this paper, the facility location problem for emergency platform disaster recovery center is analyzed. Based on that, the approach of adopting regional disaster recovery centers as a whole for protecting multiple emergency platform centers is investigated, and a comprehensive model to optimize the locations is put forward. A case study of the proposed method in Guangdong emergency platform system, China, is introduced.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"15 1","pages":"889-892"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88647120","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-06-27DOI: 10.1109/ICSESS.2014.6933737
Z. Du, Yeming Tang
Access control is one of the most widely used smart card applications on university campus. With the increase of smart card access control applications, it's more and more inconvenient and costly to build, use and maintain traditional client-server smart card access control system. In order to solve these problems, we propose the design of a web-based multi-level smart card access control system. The system is technically featured by a single instance shared by all users on campus; the real-time and automatic data exchange between smart card management system and smart card access control system; integrated device information, access control information and access control log. With the support of the new system, we can realize the reengineering of most key managerial processes in smart card access control management. Furthermore, the business process reengineering can achieve lots of user experience, managerial and economic benefits for cardholders, smart card administrators, access control administrators and the university.
{"title":"Web-based multi-level smart card access control system on university campus","authors":"Z. Du, Yeming Tang","doi":"10.1109/ICSESS.2014.6933737","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933737","url":null,"abstract":"Access control is one of the most widely used smart card applications on university campus. With the increase of smart card access control applications, it's more and more inconvenient and costly to build, use and maintain traditional client-server smart card access control system. In order to solve these problems, we propose the design of a web-based multi-level smart card access control system. The system is technically featured by a single instance shared by all users on campus; the real-time and automatic data exchange between smart card management system and smart card access control system; integrated device information, access control information and access control log. With the support of the new system, we can realize the reengineering of most key managerial processes in smart card access control management. Furthermore, the business process reengineering can achieve lots of user experience, managerial and economic benefits for cardholders, smart card administrators, access control administrators and the university.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"67 1","pages":"1015-1018"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84044578","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-06-27DOI: 10.1109/ICSESS.2014.6933640
Haojian Ma, Shunhua Tan, Zhenfeng He
In recent years, with the growth of P2P software, the operation mechanism has been much diversified. It is very difficult to classify P2P flow and normal flow based on single testing method. The increasing number of encrypted P2P protocols posed big challenge to testing. This thesis analyzes the identifying method for P2P flow based on port number, payload signature inspection, reverse connection ratio, convection analysis. Finally, these four analysis method is in comparison.
{"title":"The research of P2P recognition technology","authors":"Haojian Ma, Shunhua Tan, Zhenfeng He","doi":"10.1109/ICSESS.2014.6933640","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933640","url":null,"abstract":"In recent years, with the growth of P2P software, the operation mechanism has been much diversified. It is very difficult to classify P2P flow and normal flow based on single testing method. The increasing number of encrypted P2P protocols posed big challenge to testing. This thesis analyzes the identifying method for P2P flow based on port number, payload signature inspection, reverse connection ratio, convection analysis. Finally, these four analysis method is in comparison.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"162 1","pages":"601-604"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85404993","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-06-27DOI: 10.1109/ICSESS.2014.6933727
Cheng Liu, H. Zhao, Yangliu Cui
With the development of industry the bridge crane develops into intelligence, the main case of its control system is that the load reach the designated position rapidly and steady so it can improve the work efficiency, and decrease the hidden dangers during its operation. To solve this problem and due to nonlinear and uncertainty of the crane model, in the paper shows a detailed analysis of the mathematical model of cart-load system and proposes the method of positioning and anti-swing using fuzzy adaptive PID controller, further more, it designs two controllers for the cart position and swing angle respectively. The simulation results prove the feasibility of this method and it can reduce the working time effectively and improve the working safety factor. It is an ideal control method for bridge crane.
{"title":"Research on application of fuzzy adaptive PID controller in bridge crane control system","authors":"Cheng Liu, H. Zhao, Yangliu Cui","doi":"10.1109/ICSESS.2014.6933727","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933727","url":null,"abstract":"With the development of industry the bridge crane develops into intelligence, the main case of its control system is that the load reach the designated position rapidly and steady so it can improve the work efficiency, and decrease the hidden dangers during its operation. To solve this problem and due to nonlinear and uncertainty of the crane model, in the paper shows a detailed analysis of the mathematical model of cart-load system and proposes the method of positioning and anti-swing using fuzzy adaptive PID controller, further more, it designs two controllers for the cart position and swing angle respectively. The simulation results prove the feasibility of this method and it can reduce the working time effectively and improve the working safety factor. It is an ideal control method for bridge crane.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"100 6 1","pages":"971-974"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87728532","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
扫码关注我们
求助内容：
应助结果提醒方式：