2014 IEEE 38th Annual Computer Software and Applications Conference最新文献

{"title":"Dynamic Slicing of Python Programs","authors":"Zhifei Chen, Lin Chen, Yuming Zhou, Zhaogui Xu, W. Chu, Baowen Xu","doi":"10.1109/COMPSAC.2014.30","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.30","url":null,"abstract":"Python is widely used for web programming and GUI development. Due to the dynamic features of Python, Python programs may contain various unlimited errors. Dynamic slicing extracts those statements from a program which affect the variables in a slicing criterion with a particular input. Dynamic slicing of Python programs is essential for program debugging and fault location. In this paper, we propose an approach of dynamic slicing for Python programs which combines static analysis and dynamic tracing of the Python byte code. It precisely handles the dynamic features of Python, such as dynamic typing of variables, heavy usage of first-class objects, and dynamic modifications of classes and instances. Finally, we evaluate our approach on several Python programs. Experimental results show that the whole dynamic slicing for each subject program spends at most about 13 seconds on the average and costs at most 7.58 mb memory space overhead. Furthermore, the average slice ratio of Python source code ranges from 9.26% to 59.42%. According to it, our dynamic slicing approach can be effectively and efficiently performed. To the best of our knowledge, it is the first one of dynamic slicing for Python programs.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121784972","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":"Automated Configuration Bug Report Prediction Using Text Mining","authors":"Xin Xia, D. Lo, Weiwei Qiu, Xingen Wang, Bo Zhou","doi":"10.1109/COMPSAC.2014.17","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.17","url":null,"abstract":"Configuration bugs are one of the dominant causes of software failures. Previous studies show that a configuration bug could cause huge financial losses in a software system. The importance of configuration bugs has attracted various research studies, e.g., To detect, diagnose, and fix configuration bugs. Given a bug report, an approach that can identify whether the bug is a configuration bug could help developers reduce debugging effort. We refer to this problem as configuration bug reports prediction. To address this problem, we develop a new automated framework that applies text mining technologies on the natural-language description of bug reports to train a statistical model on historical bug reports with known labels (i.e., Configuration or non-configuration), and the statistical model is then used to predict a label for a new bug report. Developers could apply our model to automatically predict labels of bug reports to improve their productivity. Our tool first applies feature selection techniques (e.g., Information gain and Chi-square) to pre-process the textual information in bug reports, and then applies various text mining techniques (e.g., Naive Bayes, SVM, naive Bayes multinomial) to build statistical models. We evaluate our solution on 5 bug report datasets including accumulo, activemq, camel, flume, and wicket. We show that naive Bayes multinomial with information gain achieves the best performance. On average across the 5 projects, its accuracy, configuration F-measure and non-configuration F-measure are 0.811, 0.450, and 0.880, respectively. We also compare our solution with the method proposed by Arshad et al. The results show that our proposed approach that uses naive Bayes multinomial with information gain on average improves accuracy, configuration F-measure and non-configuration F-measure scores of Arshad et al.'s method by 8.34%, 103.7%, and 4.24%, respectively.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121414313","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":"FSaaS: File System as a Service","authors":"Dapeng Dong, J. Herbert","doi":"10.1109/COMPSAC.2014.22","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.22","url":null,"abstract":"Cloud-based object storage is provided as a cost-efficient, scalable, and durable service for accessing and storing objects through web technologies. With years of development and successful deployment, it has been widely adopted by individuals and organizations. Besides its advantages, there are several major concerns, such as, manageability, operation performance from a user perspective, convenience of access, and vendor lock-in. In this project, we have developed a File System as a Service (FSaaS) to address the aforementioned concerns. The FSaaS design is centred around separating file operations into groups and treating each operation group differently. We deal with the file system structures and attributes of objects in FSaaS, and leave the back-end storage as flat, and we provide a set of connector services that support various types of cloud storage for asynchronous operation mode. This separation of meta-data and use of connector services allow fast searching, transparent access, authentication simplification, concurrent operation, and load-balancing. The evaluation demonstrates that FSaaS can significantly improve user experience, boost operation performance, and reduce object operational delay. The scalability and flexibility of the FSaaS are also demonstrated via asynchronous operation mode.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"126 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129784385","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":"SPTP: A Trust Management Protocol for Online and Ubiquitous Systems","authors":"Ivor D. Addo, Jijiang Yang, Sheikh Iqbal Ahamed","doi":"10.1109/COMPSAC.2014.82","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.82","url":null,"abstract":"With the recent proliferation of ubiquitous, mobile and cloud-based systems, security, privacy and trust concerns surrounding the use of emerging technologies in the ensuing wake of the Internet of Things (IoT) continues to mount. In most instances, trust and privacy concerns continuously surface as a key deterrent to the adoption of these emergent technologies. The ensuing literature presents a Secure, Private and Trustworthy protocol (named SPTP) that was prototyped for addressing critical security, privacy and trust concerns surrounding mobile, pervasive and cloud services in Collective Intelligence (CI) scenarios. The efficacy of the protocol and its associated characteristics are evaluated in CI-related scenarios including multimodal monitoring of Elderly people in smart home environments, Online Advertisement targeting in Computational Advertising settings, and affective state monitoring through game play as an intervention for Autism among Children. We present our evaluation criteria for the proposed protocol, our initial results and future work.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116523554","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":"Which Android App Store Can Be Trusted in China?","authors":"Yiying Ng, Hucheng Zhou, Zhiyuan Ji, Huan Luo, Yuan Dong","doi":"10.1109/COMPSAC.2014.95","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.95","url":null,"abstract":"China has the world's largest Android population with 270 million active users. However, Google Play is only accessible by about 30% of them, and third-party app stores are thus used by 70% of them for daily Android apps (applications) discovery. The trustworthiness of Android app stores in China is still an open question. In this paper, we present a comprehensive study on the trustworthy level of top popular Android app stores in China, by discovering the identicalness and content differences between the APK files hosted in the app stores and the corresponding official APK files. First, we have selected 25 top apps that have the highest installations in China and have the corresponding official ones downloaded from their official websites as oracle, and have collected total 506 APK files across 21 top popular app stores (20 top third party stores as well as Google Play). Afterwards, APK identical checking and APK difference analysis are conducted against the corresponding official versions. Next, assessment is applied to rank the severity of APK files. All the apps are classified into 3 severity levels, ranging from safe (identical and higher level), warning (lower version or modifications on resource related files) to critical (modifications on permission file and/or application codes). Finally, the severity levels contribute to the final trustworthy ranking score of the 21 stores. The study indicates that about only 26.09% of level APK files are safe, 37.74% of them are at warning level, and 36.17% of them are surprisingly at critical level. We have also found out that 10 (about 2%) APK files are modified and resigned by unknown third-parties. In addition, the average trustworthy ranking score (47.37 over 100) has also highlighted that the trustworthy level of the Android app stores in China is relatively low. In conclusion, we suggest Android users to download APK files from its corresponding official websites or use the highest ranked third-party app stores, and we appeal app stores to ensure all hosting APK files are trustworthy enough to provide a \"safe-to-download\" environment.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124076210","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 Feature-Driven Crossover Operator for Product Line Architecture Design Optimization","authors":"T. Colanzi, S. Vergilio","doi":"10.1109/COMPSAC.2014.11","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.11","url":null,"abstract":"The Product Line Architecture (PLA) design is a multi-objective optimization problem that can be properly solved in the Search Based Software Engineering (SBSE) field. However, the PLA design has specific characteristics. For example, the PLA is designed in terms of features and a highly modular PLA is necessary to enable the growth of a software product line. However, existing search based design approaches do not consider such needs. To overcome this limitation, this paper introduces a feature-driven crossover operator that aims at improving feature modularization. The proposed operator was applied in an empirical study using the multi-objective evolutionary algorithm named NSGAII. In comparison with another version of NSGAII that uses only mutation operators, the feature-driven crossover version found a greater diversity of solutions (potential PLA designs), with higher feature-based cohesion, and less feature scattering and tangling.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116834005","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 Flow Control with Backward Propagation: Algorithm and Preliminary Performance Evaluation","authors":"Kohei Tsutsumi, H. Ohsaki, Hideaki Suzuki","doi":"10.1109/COMPSAC.2014.102","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.102","url":null,"abstract":"Control of a large-scale network using a centralized approach is essentially difficult due to its large end-to-end delay, high heterogeneity of a large number of network components, low availability and/or reliability caused by network component failures. In this paper, we aim at realizing a control mechanism for both per-flow path selection and available bandwidth allocation using an autonomous and distributed approach. Per-flow path selection is to select multiple paths from the source node to the sink node such that the traffic demand by the source node can be transferred to the sink node as well as the total network cost can be minimized. Available bandwidth allocation is to decide the amount of bandwidth assigned to every link in the paths from the source node to the sink node, which are chosen by the perflow path selection. In this paper, we propose a distributed and scalable flow control mechanism called DFC-BP (Distributed Flow Control with Backward Propagation), which simultaneously solves per-flow path selection and available bandwidth allocation. We also investigate the effectiveness of DFC-BP in terms of efficiency and transient performance through simulation experiments.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"563 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128597076","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":"Thermodynamics-Based Entropy Adjustment for Robust Self-Organized Network Controls","authors":"Takuya Iwai, D. Kominami, M. Murata, T. Yomo","doi":"10.1109/COMPSAC.2014.48","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.48","url":null,"abstract":"As key technologies for future information networks, many researchers have focused on self-organized network controls. In the process of their ordering, their robustness against environmental changes decreases while their performance increases. Therefore, their behavior in dynamic environment should retain appropriate amount of disorder. In this paper, we conduct simulation experiments and show that higher entropy leads to higher robustness against node failures.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131888106","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":"Towards an Open Architecture Model for Web and Mobile Software: Characteristics and Validity Properties","authors":"Bahtijar Vogel, Arianit Kurti, T. Mikkonen, M. Milrad","doi":"10.1109/COMPSAC.2014.70","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.70","url":null,"abstract":"Proprietary software solutions are extensively deployed through multiple platforms including desktop, web and mobile devices. Such systems are in many cases closed, thus making it difficult for software developers to expand and create additional features to these systems. Recent research in the field of web and mobile technologies indicates that open systems are more successful than those based on proprietary technologies. In this paper, we investigate and analyze existing research related to the notion of open architectures. We conducted a literature survey of the state of the art projects and definitions related to this concept. Our efforts have resulted in a refined definition of the term followed by a conceptual model of an open architecture contextualized within the field of web and mobile software. The model primarily relies on four key characteristics, namely flexibility, evolvability, customizability and extensibility. Furthermore, we present a validation plan based on the GQM approach that further instantiates these characteristics into a set of properties that can serve as metrics.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132042319","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":"Towards Uniform Management of Cloud Services by Applying Model-Driven Development","authors":"Toni Mastelić, I. Brandić, Andrés García-García","doi":"10.1109/COMPSAC.2014.20","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.20","url":null,"abstract":"Popularity of Cloud Computing produced the birth of Everything-as-a-Service (XaaS) concept, where each service can comprise large variety of software and hardware elements. Although having the same concept, each of these services represent complex system that have to be deployed and managed by a provider using individual tools for almost every element. This usually leads to a combination of different deployment tools that are unable to interact with each other in order to provide an unified and automatic service deployment procedure. Therefore, the tools are usually used manually or specifically integrated for a single cloud service, which on the other hand requires changing the entire deployment procedure in case the service gets modified. In this paper we utilize Model-driven development (MDD) approach for building and managing arbitrary cloud services. We define a metamodel of a cloud service called CoPS, which describes a cloud service as a composition of software and hardware elements by using three sequential models, namely Component, Product and Service. We also present an architecture of a Cloud Management System (CMS) that is able to manage such services by automatically transforming the service models from the abstract representation to the actual deployment. Finally, we validate our approach by realizing three real world use cases using a prototype implementation of the proposed CMS architecture.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"668 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116101572","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}