{"title":"Web app restructuring based on shadow DOMs to improve maintainability","authors":"Jaewon Oh, W. Ahn, Taegong Kim","doi":"10.1109/ICSESS.2017.8342877","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342877","url":null,"abstract":"As web apps quickly evolve, for their maintenance it is essential to separately encapsulate independent widgets composing the web pages. Thus, this paper proposes a new approach to restructuring a web app to achieve such encapsulation, which allows independent development and maintenance of widgets. The approach applies the shadow document object model (DOM) and template standards from the World Wide Web Consortium (W3C) Web Components standards. Empirical evaluation shows that our approach can be applicable to restructuring open source web apps and improving their maintainability. We also show that the approach can improve performance of web apps in terms of response time and the amount of transferred data over a network.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116871971","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}
Dan Wang, Congcong Xiong, Xiankun Zhang, Jianhua Cao, H. Xu
{"title":"A ranking-based space search algorithm with control parameters","authors":"Dan Wang, Congcong Xiong, Xiankun Zhang, Jianhua Cao, H. Xu","doi":"10.1109/ICSESS.2017.8343008","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8343008","url":null,"abstract":"In this paper, we propose a ranking-based space search algorithm (RSSA) with the aid of control parameters, which have a significant influence on the performance of the space search algorithm. Ranking strategy is realized in the design of space search operators. Also, instead of fixed parameter, three given values are considered as suitable control parameter settings. To evaluate the performance of the RSSA, 10 well-known benchmark functions are tested. Furthermore, the proposed RSSA is applied as optimal vehicle for a nonlinear data set. Experimental results show the RSSA is very competitive.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124689116","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}
{"title":"Review of network security risk assessment methods","authors":"S. Yang, Xiong Wei","doi":"10.1109/ICSESS.2017.8342948","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342948","url":null,"abstract":"The vulnerability of network or information system is the inherent reason for the existence of security risks and security risks. External threats exploit the vulnerability of the network or information system to launch attacks. Therefore, in the field of network security risk assessment technology, security vulnerability analysis takes an important position and is the basis for a network security risk assessment. This paper mainly reviews the research status of network security vulnerability analysis methods, network security quantitative evaluation method and real-time evaluation method of network security.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126672975","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}
{"title":"A malicious application detection model to remove the influence of interference API sequence","authors":"Pengming Tian, Xiaojun Huang","doi":"10.1109/ICSESS.2017.8342964","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342964","url":null,"abstract":"This paper proposes a new model for detecting Android malicious applications. The model obtains the API call sequences of APP runtime, and extracts features from them. These features have the highest correlation with malicious attributes detection, and have the characteristics of small redundancy between each other. And noticed that API subsequences generated by normal behavior that may exist in a malicious application can interfere with the training of the detector. We use VSM and K-means combined with GBDT algorithm to eliminate this interference and improve the detection accuracy. Experiments show that this method can effectively eliminate the influence of interference API sequence and obtain higher detection accuracy.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130681172","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}
{"title":"A distributed database query optimization method based on genetic algorithm and immune theory","authors":"M. Yao","doi":"10.1109/ICSESS.2017.8343024","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8343024","url":null,"abstract":"Distributed database query optimization is very important in business field. This paper proposes an optimization based on genetic algorithm and immune theory. Distributed database query is optimized by genetic coding and immune vaccine construction. Then, through the experimental data test, it proves that the algorithm has 13% higher efficiency than the standard genetic algorithm, which shows that the algorithm has better performance.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124020053","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}
{"title":"Automatic generation method of test path based on Android mobile terminal software","authors":"Kang Tang, Xiaomei Zhang, Zhengying Li","doi":"10.1109/ICSESS.2017.8342960","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342960","url":null,"abstract":"It is especially important for generating automatically test scenarios of software testing in Android mobile terminals, so test scenarios should cover all the test cases and ensure that as little as possible on the number of testing path. Based on these points, this paper has put forward an automatic generation algorithm for test scenarios in Android mobile terminal software when there is a loop path. Furthermore, according to some rules and the improved depth-first algorithm, detailed research of loop in the test path have been carried out.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123236283","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}
{"title":"Detecting injection vulnerabilities in executable codes with concolic execution","authors":"Maryam Mouzarani, B. Sadeghiyan, M. Zolfaghari","doi":"10.1109/ICSESS.2017.8342862","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342862","url":null,"abstract":"Various methods have been suggested for detecting injection vulnerabilities in web-based applications by now. However, some injection vulnerabilities are not only web-based but also occur in stand-alone applications, i. e., SQL injection and OS command injection. Detecting the injection vulnerabilities in these applications is a challenge when their source code is not available. In this paper, we present a smart fuzzing method for detecting SQL injection and OS command injection vulnerabilities in the executable codes of stand-alone applications. Our fuzzer employs the concolic (concrete + symbolic) execution method to calculate symbolic path constraints for each executed path in the executable code of the target program. Also, it calculates vulnerability constraints for each executed path to determine what input data makes the intended vulnerabilities active in that path. The calculated constraints are used to generate new test data that traverse as many execution paths as possible and detect the vulnerabilities in each executed path. We have implemented the proposed smart fuzzer as a plug-in for Valgrind framework. The implemented fuzzer is tested on different groups of test programs. The experiments demonstrate that our fuzzer detects the vulnerabilities in these programs accurately.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123621222","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}
{"title":"A key technology survey and summary of dynamic network visualization","authors":"Yu Shaobo, Wu Lingda","doi":"10.1109/ICSESS.2017.8342958","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342958","url":null,"abstract":"Network visualization is a time-honored research direction, which can be traced back to the graph visualization. The data of dynamic network is constantly updated, which brings some challenges to dynamic network visualization. Dynamic network visualization mainly includes network layout, network property visualization and user interaction, therefore, this paper focuses on the research and review of some key technologies, including layout technology, visualization technology and interactive technology. The aim of this paper is to provide some technical support for the research of the key technology of dynamic network visualization.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114212851","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}
{"title":"Performance analysis of CDN-P2P networks based on processer-sharing queues","authors":"Xiaofeng Zhang, B. Yin","doi":"10.1109/ICSESS.2017.8342856","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342856","url":null,"abstract":"With the development of computer, Internet and multimedia technology, network services based streaming media are widely used. The network services include video-on-demand (VOD), video broadcast, IPTV and a variety of value-added services. Content delivery network (CDN) is used to provide such services by many service provides. In this paper we consider a CDN-P2P networks system in which heterogeneous servers operating under the processor sharing (PS) discipline. In the system, when a stream of users' requests arrive at a media server, it will provide service if it can, or it will inquire directory server to find a suitable media server which can provide this service. This is a redirect process. To find a better redirection strategy, we analyze the performance of a single server using the finite capacity M/M/1/N-PS model first. For this model, two exact expressions are derived for both user's average service time and average waiting time. Then we analyze the performance of the CDN-P2P networks system by adopting different redirection strategies. Finally, some numerical examples are made to check our results.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127603301","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}
{"title":"A study on code clone evolution analysis","authors":"Ke Wang, Liping Zhang, Sheng Yan","doi":"10.1109/ICSESS.2017.8342928","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342928","url":null,"abstract":"It is believed that identical or similar code fragments in source code, also known as code clones, result from copy-paste activity of programming, increase the complexity of software maintenance. Information provided by single code clone cannot effectively represent the features of clone maintenance, so it needs to be extracted from different perspective of clone evolution. Analysis of clone evolution provides strong support to improve the maintainability. In this paper, we present various methods that researchers have used to study clone evolution and summarize the advantages and disadvantages of relevant research on clone evolution. Finally we also summarize and prospect the development trend of clone evolution analysis.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126300382","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}