Current Issue : April - June Volume : 2013 Issue Number : 2 Articles : 4 Articles
It is said that the presence of duplicate code is one of the factors that make software maintenance more difficult. Many research\r\nefforts have been performed on detecting, removing, or managing duplicate code on this basis. However, some researchers doubt\r\nthis basis in recent years and have conducted empirical studies to investigate the influence of the presence of duplicate code. In this\r\nstudy, we conduct an empirical study to investigate this matter from a different standpoint from previous studies. In this study, we\r\ndefine a new indicator ââ?¬Å?modification frequencyââ?¬Â to measure the impact of duplicate code and compare the values between duplicate\r\ncode and nonduplicate code. The features of this study are as follows the indicator used in this study is based on modification places\r\ninstead of the ratio of modified lines; we use multiple duplicate code detection tools to reduce biases of detection tools; and we\r\ncompare the result of the proposed method with other two investigation methods. The result shows that duplicate code tends\r\nto be less frequently modified than nonduplicate code, and we found some instances that the proposed method can evaluate the\r\ninfluence of duplicate code more accurately than the existing investigation methods....
This paper presents a study called collaborative-adversarial pair (CAP) programming which is an alternative to pair programming\r\n(PP). Its objective is to exploit the advantages of pair programming while at the same time downplaying its disadvantages. Unlike\r\ntraditional pairs, where two people work together in all the phases of software development, CAPs start by designing together;\r\nsplitting into independent test construction and code implementation roles; then joining again for testing. An empirical study was\r\nconducted in fall 2008 and in spring 2009 with twenty-six computer science and software engineering senior and graduate students\r\nat Auburn University. The subjects were randomly divided into two groups (CAP/experimental group and PP/control group). The\r\nsubjects used Eclipse and JUnit to perform three programming tasks with different degrees of complexity. The results of this\r\nexperiment point in favor of CAP development methodology and do not support the claim that pair programming in general\r\nreduces the software development duration, overall software development cost or increases the program quality or correctness....
Information technology (IT) systems are present in almost all fields of human activity, with emphasis on processing, storage, and\r\nhandling of datasets. Automated methods to provide access to data stored in databases have been proposed mainly for tasks related\r\nto knowledge discovery and data mining (KDD). However, for this purpose, the database is used only to query data in order to find\r\nrelevant patterns associated with the records. Processes modelled on IT systems should manipulate the records to modify the state\r\nof the system. Linear genetic programming for databases (LGPDB) is a tool proposed here for automatic generation of programs\r\nthat can query, delete, insert, and update records on databases. The obtained results indicate that the LGPDB approach is able to\r\ngenerate programs for effectively modelling processes of IT systems, opening the possibility of automating relevant stages of data\r\nmanipulation, and thus allowing human programmers to focus on more complex tasks....
We present our approach to real-time service-oriented scheduling problems with the objective of maximizing the total system\r\nutility. Different from the traditional utility accrual scheduling problems that each task is associated with only a single time utility\r\nfunction (TUF), we associate two different TUFsââ?¬â?a profit TUF and a penalty TUFââ?¬â?with each task, to model the real-time services\r\nthat not only need to reward the early completions but also need to penalize the abortions or deadline misses. The scheduling\r\nheuristics we proposed in this paper judiciously accept, schedule, and abort real-time services when necessary to maximize the\r\naccrued utility. Our extensive experimental results show that our proposed algorithms can significantly outperform the traditional\r\nscheduling algorithms such as the Earliest Deadline First (EDF), the traditional utility accrual (UA) scheduling algorithms, and an\r\nearlier scheduling approach based on a similar model....
Loading....