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

Proceedings of the 7th Asia-Pacific Symposium on Internetware最新文献

筛选
英文 中文
Towards Web Application Mobilization via Efficient Web Control Extraction 通过高效的Web控制提取实现Web应用程序动员
Proceedings of the 7th Asia-Pacific Symposium on Internetware Pub Date : 2015-11-06 DOI: 10.1145/2875913.2875935
Shuai Wang, Wensheng Dou, Guoquan Wu, Jie Wang, Chushu Gao, Jun Wei, Tao Huang
{"title":"Towards Web Application Mobilization via Efficient Web Control Extraction","authors":"Shuai Wang, Wensheng Dou, Guoquan Wu, Jie Wang, Chushu Gao, Jun Wei, Tao Huang","doi":"10.1145/2875913.2875935","DOIUrl":"https://doi.org/10.1145/2875913.2875935","url":null,"abstract":"Traditional web applications are not suitable for mobile devices, because mobile devices are usually equipped with small screens and use slow and expensive mobile network. In order to adapt web applications to mobile devices, existing approaches reconstruct particular web applications, or adapt only partial views of web pages. They require a lot of additional reconstructing work or network bandwidth. In this paper we propose an approach that can extract a part of a web page as an executable web control efficiently. Our approach monitors the execution of user code, builds a dependency graph of executed user code, and performs slicing based on the dependency graph. The evaluation on two real-world web applications shows that our approach is able to extract executable web controls efficiently, and for the two web applications, visiting extracted web controls instead of the original web pages can save 98% and 23% of bandwidth respectively.","PeriodicalId":361135,"journal":{"name":"Proceedings of the 7th Asia-Pacific Symposium on Internetware","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116536447","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
A Multi-objective Ant Colony Algorithm for Deployment Optimization of Internetware Application 互联网应用部署优化的多目标蚁群算法
Proceedings of the 7th Asia-Pacific Symposium on Internetware Pub Date : 2015-11-06 DOI: 10.1145/2875913.2875927
Lin Li, Shi Ying, B. Dong, Tong Xue
{"title":"A Multi-objective Ant Colony Algorithm for Deployment Optimization of Internetware Application","authors":"Lin Li, Shi Ying, B. Dong, Tong Xue","doi":"10.1145/2875913.2875927","DOIUrl":"https://doi.org/10.1145/2875913.2875927","url":null,"abstract":"Changes in operating environment may result in the performance degradation and cost overruns to an Internetware application. An efficient way to solve such problems is to optimize its deployment architecture according to the changes. However, there may be many different deployment architectures and the optimal ones should exhibit right trade-offs among conflicting objectives. Finding optimal deployment architectures for an Internetware application is hard and time consuming. This paper propose to employ a multi-objective ant colony algorithm MACO-DO to explore the search space automatically, aiming at finding a set of pareto optimal deployment architectures for an Internetware application. This algorithm is an improved version of traditional algorithms. It introduces a discarding elitist strategy to prevent algorithm from premature convergence. A series of experiments are implemented on three simulated instances of different sizes to compare the proposed MACO-DO with recently proposed P-ACO and NSGA-II. The results show that MACO-DO has better performance than others on the considered problem.","PeriodicalId":361135,"journal":{"name":"Proceedings of the 7th Asia-Pacific Symposium on Internetware","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129565784","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
Cross-Project Software Defect Prediction Using Feature-Based Transfer Learning 基于特征迁移学习的跨项目软件缺陷预测
Proceedings of the 7th Asia-Pacific Symposium on Internetware Pub Date : 2015-11-06 DOI: 10.1145/2875913.2875944
He Qing, Biwen Li, Beijun Shen, Yong Xia
{"title":"Cross-Project Software Defect Prediction Using Feature-Based Transfer Learning","authors":"He Qing, Biwen Li, Beijun Shen, Yong Xia","doi":"10.1145/2875913.2875944","DOIUrl":"https://doi.org/10.1145/2875913.2875944","url":null,"abstract":"Cross-project defect prediction is taken as an effective means of predicting software defects when the data shortage exists in the early phase of software development. Unfortunately, the precision of cross-project defect prediction is usually poor, largely because of the differences between the reference and the target projects. Having realized the project differences, this paper proposes CPDP, a feature-based transfer learning approach to cross-project defect prediction. The core insight of CPDP is to (1) filter and transfer highly-correlated data based on data samples in the target projects, and (2) evaluate and choose learning schemas for transferring data sets. Models are then built for predicting defects in the target projects. We have also conducted an evaluation of the proposed approach on PROMISE datasets. The evaluation results show that, the proposed approach adapts to cross-project defect prediction in that f-measure of 81.8% of projects can get improved, and AUC of 54.5% projects improved. It also achieves similar f-measure and AUC as some inner-project defect prediction approaches.","PeriodicalId":361135,"journal":{"name":"Proceedings of the 7th Asia-Pacific Symposium on Internetware","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132710943","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}
引用次数: 18
GEMiner: Mining Social and Programming Behaviors to Identify Experts in Github GEMiner:挖掘社交和编程行为以识别Github中的专家
Proceedings of the 7th Asia-Pacific Symposium on Internetware Pub Date : 2015-11-06 DOI: 10.1145/2875913.2875924
Wenkai Mo, Beijun Shen, Yuming He, Hao Zhong
{"title":"GEMiner: Mining Social and Programming Behaviors to Identify Experts in Github","authors":"Wenkai Mo, Beijun Shen, Yuming He, Hao Zhong","doi":"10.1145/2875913.2875924","DOIUrl":"https://doi.org/10.1145/2875913.2875924","url":null,"abstract":"Hosting over 10 million repositories, GitHub becomes the largest open source community in the world. Besides sharing code, Github is also a social network, in which developers can follow others or keep track of their interested projects. Considering the multi-roles of Github, integrating heterogenous data of each developer to identify experts is a challenging task. In this paper, we propose GEMiner, a novel approach to identify experts for some specific programming languages in Github. Different from previous approaches, GEMiner analyzes the social behaviors and programming behaviors of a developer to determine the expertise of the developer. When modeling social behaviors of developers, to integrate heterogenous social networks in Github, GEMiner implements a Multi-Sources PageRank algorithm. Also, GEMiner analyzes the behaviors of developers when they are programming (e.g., their commit activities and their preferred programming languages) to model programming behaviors of them. Based on our expertise models and our extracted programming languages data, GEMiner can then identify experts for some specific programming languages in Github. We conducted experiments on a real data set, and our results show that GEMiner identifies experts with 60% accuracy higher than the state-of-the-art algorithms.","PeriodicalId":361135,"journal":{"name":"Proceedings of the 7th Asia-Pacific Symposium on Internetware","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114509772","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}
引用次数: 5
An Entropy-based Approach to the Crowd Entity Resolution 基于熵的群体实体解析方法
Proceedings of the 7th Asia-Pacific Symposium on Internetware Pub Date : 2015-11-06 DOI: 10.1145/2875913.2875936
Yi Jiang, Wei Zhang, Haiyan Zhao
{"title":"An Entropy-based Approach to the Crowd Entity Resolution","authors":"Yi Jiang, Wei Zhang, Haiyan Zhao","doi":"10.1145/2875913.2875936","DOIUrl":"https://doi.org/10.1145/2875913.2875936","url":null,"abstract":"Crowdsourcing is used to obtain needed ideas and content by soliciting data from a large group of people, especially from an online community. However, the data generated by a group of people is duplicated. As to learn the crowd intention based on the crowd data, we need to do some entity resolution works. Previous works focus on data matching and merging, but remain far from perfect in crowdsourcing area. In our study, we propose a generic way in measuring and representing the crowd intention based on the crowd data. The main contribution of our study is twofold: 1. We propose a graph structure that represents the crowd intention. 2. We propose an entropy-based measurement that evaluates the diversity of the crowd intention.","PeriodicalId":361135,"journal":{"name":"Proceedings of the 7th Asia-Pacific Symposium on Internetware","volume":"287 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132878876","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
nCov: A Tool for Measuring Length-n Subpath Coverage nCov:测量长度-n子路径覆盖的工具
Proceedings of the 7th Asia-Pacific Symposium on Internetware Pub Date : 2015-11-06 DOI: 10.1145/2875913.2875932
Yan Zhou, You Li, Linzhang Wang, Xuandong Li
{"title":"nCov: A Tool for Measuring Length-n Subpath Coverage","authors":"Yan Zhou, You Li, Linzhang Wang, Xuandong Li","doi":"10.1145/2875913.2875932","DOIUrl":"https://doi.org/10.1145/2875913.2875932","url":null,"abstract":"Software test adequacy criteria are used to determine whether the test on a software system is sufficient. Code coverage shows how thoroughly a program is tested according to corresponding testing adequacy criteria. There are many coverage criteria used in practice to measure the test adequacy at different granularity of the target program. Length-n subpath criterion is a systematic flexible coverage criterion at a fine granularity. In this paper, we present a prototype test coverage tool named nCov for measuring length-n subpath coverage based on control flow graph. For a C program and corresponding test suite, our tool can measure the length-n subpath coverage for various n, say 1 to 8. It can also be used to select test cases for satisfying length-n subpath coverage with specific n. In addition, to improve the scalability of the tool, we propose a loop compression algorithm to record the program trace. We have conducted a controlled experiment to demonstrate the feasibility and efficiency of our tool.","PeriodicalId":361135,"journal":{"name":"Proceedings of the 7th Asia-Pacific Symposium on Internetware","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128747008","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
Efficient Testing of Web Services with Mobile Crowdsourcing 使用移动众包对Web服务进行有效测试
Proceedings of the 7th Asia-Pacific Symposium on Internetware Pub Date : 2015-11-06 DOI: 10.1145/2875913.2875926
Minzhi Yan, Hailong Sun, Xudong Liu
{"title":"Efficient Testing of Web Services with Mobile Crowdsourcing","authors":"Minzhi Yan, Hailong Sun, Xudong Liu","doi":"10.1145/2875913.2875926","DOIUrl":"https://doi.org/10.1145/2875913.2875926","url":null,"abstract":"Nowadays, online Internet services are pervasive and can be invoked from diverse locations in anytime with multitudinous devices. Conventional testing approaches for online services like Web services are conducted by professional tester or developers and cannot simulate the real world running environment of a service. Fortunately, crowdtesting technology brings us promising hope and has acquired increasing interests and adoption because it can recruit plenty of end users to test services under real world environment with low cost. Meanwhile, improved mobile network techniques make crowdsourcing happen anywhere and anytime. In this paper, we present iTest which combines mobile crowdsourcing and web service testing together to support the performance testing of web services. iTest is a framework for service developers to submit their web services and conveniently get the test results from the crowd testers. Firstly, we analyze the key problems need to be solved in a mobile crowdtesting platform; secondly, the architecture of iTest framework and the workflow in it are presented; Thirdly, we perform experiments to illustrate that both the way to access network and tester's location influence the performance of web service, and formulate the tester selection problem as a Set Cover Problem and propose a greedy algorithm for solving this problem; Next, experimental evaluation of the tester selection algorithm is performed to illustrate its efficiency. Finally, we conclude our work and provide the directions for future work.","PeriodicalId":361135,"journal":{"name":"Proceedings of the 7th Asia-Pacific Symposium on Internetware","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131732224","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
Detecting Data Races in Interrupt-Driven Programs based on Static Analysis and Dynamic Simulation 基于静态分析和动态仿真的中断驱动程序数据竞争检测
Proceedings of the 7th Asia-Pacific Symposium on Internetware Pub Date : 2015-11-06 DOI: 10.1145/2875913.2875943
Yu Wang, Junjing Shi, Linzhang Wang, Jianhua Zhao, Xuandong Li
{"title":"Detecting Data Races in Interrupt-Driven Programs based on Static Analysis and Dynamic Simulation","authors":"Yu Wang, Junjing Shi, Linzhang Wang, Jianhua Zhao, Xuandong Li","doi":"10.1145/2875913.2875943","DOIUrl":"https://doi.org/10.1145/2875913.2875943","url":null,"abstract":"Interrupt-driven programs are often embedded in safety-critical systems to perform hardware/resource dependent data operation tasks, such as data acquisition, processing, and transformation. The interrupt programs and tasks may happen in parallel which in a result causes indeterminist concurrent problems at runtime. Data race is one of the most popular problems challenging researchers and practitioners. Various static analysis, software testing approaches have been proposed to detect data races in source code, testing, and even production run. However, static analysis may report too many false positives due to the lack of execution information. Dynamic testing may miss some important races since it could not generate adequate test cases to test all possible execution scenarios. In this paper, we propose a hybrid approach to detect data races in interrupt-driven programs based on static analysis and dynamic simulation. We implemented a prototype tool and conducted a controlled experiment to demonstrate the applicability of our approach.","PeriodicalId":361135,"journal":{"name":"Proceedings of the 7th Asia-Pacific Symposium on Internetware","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126456811","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}
引用次数: 8
Exploring the Use of @-mention to Assist Software Development in GitHub 探索在GitHub中使用@-mention来辅助软件开发
Proceedings of the 7th Asia-Pacific Symposium on Internetware Pub Date : 2015-11-06 DOI: 10.1145/2875913.2875914
Yang Zhang, Huaimin Wang, Gang Yin, Tao Wang, Yue Yu
{"title":"Exploring the Use of @-mention to Assist Software Development in GitHub","authors":"Yang Zhang, Huaimin Wang, Gang Yin, Tao Wang, Yue Yu","doi":"10.1145/2875913.2875914","DOIUrl":"https://doi.org/10.1145/2875913.2875914","url":null,"abstract":"Recently, many researches propose that social media tools can promote the collaboration among developers, which are beneficial to the software development. Nevertheless, there is little empirical evidence to confirm that using @-mention has indeed a beneficial impact on the issues in GitHub. In this paper, we analyze the data from GitHub and give some insights on how @-mention is used in the issues (general-issues and pull-requests). Our statistical results indicate that, @-mention attracts more participants and tends to be used in the difficult issues. @-mention favors the solving process of issues by enlarging the visibility of issues and facilitating the developers' collaboration. In addition to this global study, our study also build a @-network based on the @-mention database we extract. Through the @-network, we can mine the relationships and characteristics of developers in GitHub's issues.","PeriodicalId":361135,"journal":{"name":"Proceedings of the 7th Asia-Pacific Symposium on Internetware","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121730939","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}
引用次数: 13
Towards Realisation of Evolvable Runtime Variability in Internet-Based Service Systems via Dynamical Software Update 通过动态软件更新实现基于互联网的服务系统的可演化运行时可变性
Proceedings of the 7th Asia-Pacific Symposium on Internetware Pub Date : 2015-11-06 DOI: 10.1145/2875913.2875938
Jiwei Liu, Xinjun Mao
{"title":"Towards Realisation of Evolvable Runtime Variability in Internet-Based Service Systems via Dynamical Software Update","authors":"Jiwei Liu, Xinjun Mao","doi":"10.1145/2875913.2875938","DOIUrl":"https://doi.org/10.1145/2875913.2875938","url":null,"abstract":"Today's Internet-based service systems tend to run in open environments and try to satisfy varying requirements. In the context, the changes of requirements and environments can emerge at any point of their life cycle, and their runtime variability is supposed to be evolvable to deal with the changes. In other words, the number, type or attribute of variability elements (variation points and their associated variants) in the systems is regarded to be changeable, especially at runtime. How to realise evolvable runtime variability in software systems is a challenge in the community of software engineering. Software architecture is supposed to support updating software without interrupting service if runtime variability is to be changed. Besides, the relevant mechanisms have to be provided to achieve dynamic update. Thus, we propose a dynamically reconfigurable reference architecture to construct the systems with evolvable software variability. The resultant system established using our approach consists of variability units and their containers. Variability units embody the variability elements that can be changed through local relay, i.e., starting a new version of variability unit to take place of older ones. Containers are mainly used to carry out the dynamic updating for variability units and realise the functionality invocation among different variability units. They can also be added, removed or replaced without shutting down the entire system. We analyse the requirements and scenarios of evolvable runtime variability in the case of Personal Data Resource Network, and further show the effectiveness and applicability of our approach by constructing the system using our class library and solving the issues proposed in the case.","PeriodicalId":361135,"journal":{"name":"Proceedings of the 7th Asia-Pacific Symposium on Internetware","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131029929","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信