{"title":"On iteration optimization for non-cross-functional teams in Scrum","authors":"Fabian Sobiech, Beate Eilermann, A. Rauch","doi":"10.1145/2663761.2664198","DOIUrl":"https://doi.org/10.1145/2663761.2664198","url":null,"abstract":"One goal of Scrum is to deliver as much added value as possible for the customer at the end of an iteration but in an environment with multiple different customers and stakeholders the definition of value varies. Therefore we defined the concept of value in the context of an OEM in the automotive industry for management information systems. We identified seven relevant value dimensions in a first case study and in a second case study we investigated the relation between the seven different value dimensions. Afterwards we define an optimal iteration based on our value definition for multiple non-cross-functional teams and show that this problem is a NP-hard problem.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126038063","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":"Enabling static security vulnerability analysis in PHP applications for novice developers with SSVChecker","authors":"Michael Smith, J. Dehlinger","doi":"10.1145/2663761.2664213","DOIUrl":"https://doi.org/10.1145/2663761.2664213","url":null,"abstract":"Web-based systems pervade our society, supporting business-critical applications frequently requesting/storing customer's personal information, necessitating increasingly higher levels of information assurance. Novice web programmers, with little or no secure programming skills, unknowingly develop web applications ripe with security vulnerabilities, thus compromising the integrity of the application. As a result, a number of static analysis security tools have been developed to flag potential security vulnerabilities. Yet, these tools are difficult to use, divorced from the software integrated development environments (IDE) and remain unknown to novice developers. This paper contributes an Eclipse plugin that enables static analysis of PHP source code using existing tools directly within a common IDE to enable novice developers to build more secure web applications. We make two claims for the extension of SSVChecker. First, it seamlessly embeds into a common IDE making it easy/familiar to use for novice developers. Second, it provides functionality leveraging multiple tools to reduce reported false positives and better focus novice developers on potential security vulnerabilities. To demonstrate these claims, we use SSVChecker on a popular, open source, PHP-based web application with known security vulnerabilities.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126126669","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}
Eunji Lee, Jeongin Kim, Junho Choi, Chang Choi, Byeongkyu Ko, Pankoo Kim
{"title":"A semantic weighting method for document classification based on Markov logic networks","authors":"Eunji Lee, Jeongin Kim, Junho Choi, Chang Choi, Byeongkyu Ko, Pankoo Kim","doi":"10.1145/2663761.2664212","DOIUrl":"https://doi.org/10.1145/2663761.2664212","url":null,"abstract":"This paper proposes a semantic weighting method to classify textural documents. Human lives in the world where web documents have a great potential and the amount of valuable information has been consistently growing over the year. There is a problem that finding relevant web documents corresponding to what users want is more difficult due to the huge amount of web size. For this reason, there have been many researchers overcome this problem. The most important thing is document classification. All documents are composed of numerous words. Many classification methods have been extracted keywords from documents and then analyzed keywords pattern or frequency. In this paper, we propose Category Term Weight (CTW) using keywords from documents in order to enhance performance in document classification. CTW combines keywords frequency with semantic information. The frequency and semantic information have a great potential to find similarities between documents. That is why we calculates CTW from collection of training documents. After this step, CTW from unknown document and CTW in previous Category Term Database will be applied by designed Markov Logic Networks Model. Our designed MLNs Model and existing Naive-bayse Model will be compared by applied CTW. The experimental results shows the improvement of precision compare with the existing model.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130445648","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 classification-based prefetching scheme for hibernation of embedded computing systems","authors":"Chien-Chung Ho, Yu-Ming Chang, Yuan-Hao Chang, Sheng-Yen Hong, Che-Wei Chang, Tei-Wei Kuo","doi":"10.1145/2663761.2664215","DOIUrl":"https://doi.org/10.1145/2663761.2664215","url":null,"abstract":"With the rapid growth of embedded computing system markets, e.g., intelligent home appliances and smart TVs, vendors and researchers are developing more user-friendly interfaces and seeking to provide more sophisticated applications with better functionalities. Such a developing trend would prolong the initialization time of these embedded computing systems. Hibernation (or suspend-to-disk) that retains a computing system's state after power recycling is regarded as a solution to reduce the booting time of systems and applications to meet the requirement of user experiences. In contrast to the existing hibernation techniques that dump most of the memory pages to the secondary storage, we propose a classification-based prefetching scheme to improve the system performance on both of the hibernation and resuming with minimized I/O overheads by jointly considering the system/application behaviors and the usage patterns of memory pages. The proposed scheme was also implemented with the Linux kernel on an evaluation board to show the capability of the proposed scheme.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116948199","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":"Overflow detection in multiple P-adic parallel implementation","authors":"Xinkai Li, Chao Lu, J. A. Sjogren","doi":"10.1145/2663761.2664187","DOIUrl":"https://doi.org/10.1145/2663761.2664187","url":null,"abstract":"In this paper, we explored the reasons that caused an overflow problem with P-adic arithmetic. We developed an overflow detection method for multiple P-adic data type. The new method proposed in this paper can improve the detection accuracy with fewer verification terms. Experimental results are given to illustrate the concepts.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114847689","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 multi-paradigm object tracker for robot navigation assisted by external computer vision","authors":"Marcel-Titus Marginean, Chao Lu","doi":"10.1145/2663761.2663762","DOIUrl":"https://doi.org/10.1145/2663761.2663762","url":null,"abstract":"Tracking multiple persons/robots/pets and moving objects is an essential task for situation awareness in robot navigation and operation. It is also a relatively complicated problem of computer vision and multiple solutions have been proposed in literature. In this paper we are exploring a novel method of object tracking using computer vision by fusing multiple techniques into a single tracker implementation. The main goal of this method is to perform high confidence data associations as soon as possible in order to be able to provide tracking information to a moving robot in real time with attempts to minimize the CPU utilization for tracking whenever possible since the Base Station computer is being shared with multiple software modules.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128628583","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}
Seongsoo Park, Hyunjun Kim, Jaeju Kim, Hwansoo Han
{"title":"Detecting binary theft via static major-path birthmarks","authors":"Seongsoo Park, Hyunjun Kim, Jaeju Kim, Hwansoo Han","doi":"10.1145/2663761.2664191","DOIUrl":"https://doi.org/10.1145/2663761.2664191","url":null,"abstract":"Software birthmarks are used for detecting software plagiarism. For binaries, not many reliable birthmarks are developed. API sequences are known to be successful birthmarks, but dynamically extracted sequences are often too large and unnecessarily repetitive. In this paper, we propose a static approach to generate API sequences along major paths, which are analyzed from control flow graphs of binaries. Since our API sequences are extracted along the most plausible paths of the binary codes, they can represent actual API sequences from executing binaries, but in a more concise form. In addition, as it is a static analysis, we can apply to partial binary objects, which cannot be executed on their own. Our similarity measures use the Smith-Waterman algorithm that is one of the popular sequence alignment algorithms for DNA sequence analysis. We evaluate our static path-based API sequence with multiple versions of five applications. In our experiment, our method reports a quite reliable similarity result for binary codes.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126505335","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":"Energy-efficient assignment for tasks on non-dvs heterogeneous multiprocessor system","authors":"Chin-Fu Kuo, Yung-Feng Lu","doi":"10.1145/2663761.2663765","DOIUrl":"https://doi.org/10.1145/2663761.2663765","url":null,"abstract":"This paper aims to study the scheduling problem of a heterogeneous non-DVS multiprocessor platform with a task set. The processors have different characteristics of power consumption. We propose an off-line task-to-processor assignment algorithm, the Best-Fit Decreasing Physical Power Consumption (BDPC) algorithm to derive a feasible task assignment with the minimal energy consumption and has the time complexity of O(N(logN + M)), where N and M are the numbers of tasks and processor types, respectively. A series of experiments were conducted to evaluate the proposed algorithm. The experimental results demonstrate that the performance of the proposed BDPC algorithm is better than the compared algorithms.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133897014","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}
Wei Yu, Dou An, D. Griffith, Qingyu Yang, Guobin Xu
{"title":"On statistical modeling and forecasting of energy usage in smart grid","authors":"Wei Yu, Dou An, D. Griffith, Qingyu Yang, Guobin Xu","doi":"10.1145/2663761.2663768","DOIUrl":"https://doi.org/10.1145/2663761.2663768","url":null,"abstract":"Developing effective energy resource management strategies in the smart grid is challenging because the entities in both demand and supply sides experience numerous fluctuations. In this paper, we address the issue of quantifying uncertainties on the energy demand side. Specifically, we first develop approaches using statistical modeling analysis to derive a statistical distribution of energy usage. We then utilize machine learning based approaches such as the Support Vector Machines (SVM) and neural networks to conduct accurate forecasting on energy usage. We perform extensive experiments of our proposed approaches using a real-world meter reading data set. Our experimental data shows that the statistical distribution of meter reading data can be largely approximated with a Gaussian distribution and the two SVM-based machine learning approaches achieve a high accuracy of forecasting energy usage.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"4 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132273506","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}
Kuan-Chung Huang, Yu-Chen Wu, Che-Wei Chang, Tei-Wei Kuo, C. Shih, Qingxu Deng
{"title":"Real-time process synchronization for systems with accelerators","authors":"Kuan-Chung Huang, Yu-Chen Wu, Che-Wei Chang, Tei-Wei Kuo, C. Shih, Qingxu Deng","doi":"10.1145/2663761.2664220","DOIUrl":"https://doi.org/10.1145/2663761.2664220","url":null,"abstract":"This work is motivated by the needs to manage the priority inversion problem without sacrificing the utilization of increasingly popular hardware accelerators. A new mechanism is developed to dedicate accelerators to selected higher-priority tasks. The floor and ceiling priorities of accelerators are thus proposed as an extension of the concept of semaphore priority ceiling to guarantee at most two priority inversions for any real-time task in a uniprocessor system with multiple accelerators. The properties of the proposed concept are explored with respect to blocking behaviors over the CPU and accelerators and are verified by a series of experiments, for which the insight of the simple but effective idea is evaluated and presented.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124229712","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}