Abstract-This paper introduces a technique to generate tests automatically for the legacy code by utilizing existing software assets. Many aspects of the legacy code needs to be tested, such as, classes, methods, interfaces, relations, dependencies, etc. The proposed technique automatically generates tests by examining software packages that use the system under test to be tested. It presents an automatic test method based on searching calls to the APIs being tested in available repositories, ranking the relevance of the mined calls, and using them to generate test cases. It makes three important contributions for the issue. First, it provides an automatic way to build a test skeleton. Second, it finds previously unknown bugs and obviously unused dead codes by achieving high test coverage. Finally, developers confidently make changes to the codes written by someone else.
{"title":"Reference-Based Testing Technique for Automated Test Generation","authors":"Eunha Kim, Seokmoon Ryoo","doi":"10.1109/ICCSA.2010.58","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.58","url":null,"abstract":"Abstract-This paper introduces a technique to generate tests automatically for the legacy code by utilizing existing software assets. Many aspects of the legacy code needs to be tested, such as, classes, methods, interfaces, relations, dependencies, etc. The proposed technique automatically generates tests by examining software packages that use the system under test to be tested. It presents an automatic test method based on searching calls to the APIs being tested in available repositories, ranking the relevance of the mined calls, and using them to generate test cases. It makes three important contributions for the issue. First, it provides an automatic way to build a test skeleton. Second, it finds previously unknown bugs and obviously unused dead codes by achieving high test coverage. Finally, developers confidently make changes to the codes written by someone else.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114593856","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}
When some sensors become power-exhausted in Wireless Sensor Networks (WSNs), mobile redundant sensors might be moved to cover the sensing holes created by the failed sensors. Within rugged terrains where wheeled sensors are unsuitable, other types of mobile sensors, such as hopping sensors, are needed. In this paper, we address the problem of relocating hopping sensors to the detected sensing holes. In fact, the state of these areas - harsh terrains, disaster areas, etc. - may be irregular; however, recent literature only considered movement of hopping sensors within regular areas. Hence, this paper analyzes cases that consider the level of irregularity and the number of hops required. The major contributions of this paper are a definition of the level of regularity of an area and an analysis of the performance of the proposed reliability-based schemes according to total movement and lifetime of sensors. Simulation results show that the proposed schemes outperform the shortest path-based scheme under rugged terrains.
{"title":"On Relocation of Hopping Sensors for Rugged Terrains","authors":"Moonseong Kim, M. Mutka, Hyunseung Choo","doi":"10.1109/ICCSA.2010.53","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.53","url":null,"abstract":"When some sensors become power-exhausted in Wireless Sensor Networks (WSNs), mobile redundant sensors might be moved to cover the sensing holes created by the failed sensors. Within rugged terrains where wheeled sensors are unsuitable, other types of mobile sensors, such as hopping sensors, are needed. In this paper, we address the problem of relocating hopping sensors to the detected sensing holes. In fact, the state of these areas - harsh terrains, disaster areas, etc. - may be irregular; however, recent literature only considered movement of hopping sensors within regular areas. Hence, this paper analyzes cases that consider the level of irregularity and the number of hops required. The major contributions of this paper are a definition of the level of regularity of an area and an analysis of the performance of the proposed reliability-based schemes according to total movement and lifetime of sensors. Simulation results show that the proposed schemes outperform the shortest path-based scheme under rugged terrains.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127480778","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}
We consider an RC-series DC driven electric network. We envision the capacitor C is a parallel-plate capacitor with a pair of elliptical plates. We apply a set of transformations mapping the ellipses gradually and continually into their corresponding rectangles; this makes the capacitor time-dependent, C(t). We analyze the impact of the shape-shifting capacitor on the corresponding RC(t) transient circuit. Applying Mathematica [1] animation we display the morphing capacitor adjacent to its corresponding characteristic signals. Utilizing the embedded Mathematica code also we display the transient electric signals of a morphing capacitor while it is being mutated from a circular disk into a set of exotic configurations.
{"title":"A Morphing Capacitor and an RC Transient Electric Circuit","authors":"H. Sarafian","doi":"10.1109/ICCSA.2010.28","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.28","url":null,"abstract":"We consider an RC-series DC driven electric network. We envision the capacitor C is a parallel-plate capacitor with a pair of elliptical plates. We apply a set of transformations mapping the ellipses gradually and continually into their corresponding rectangles; this makes the capacitor time-dependent, C(t). We analyze the impact of the shape-shifting capacitor on the corresponding RC(t) transient circuit. Applying Mathematica [1] animation we display the morphing capacitor adjacent to its corresponding characteristic signals. Utilizing the embedded Mathematica code also we display the transient electric signals of a morphing capacitor while it is being mutated from a circular disk into a set of exotic configurations.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121356428","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}
We report the examples of the teaching materials of physics generated by using ketpic, focusing on the Lorentz contraction. The represented examples are the observed images of the moving objects at the speed of 95 percent of the speed of light $c$, where a cubic and a sphere are taken as the objects. We also show the observed images of lines of electric and magnetic forces around the moving charged objects. The obtained images are largely distorted on account of the effect of the Lorentz contraction and the fact that the speed of light is limited and the same value in any frame.
{"title":"Teaching Materials of Physics about Lorentz Contraction Generated by KETpic","authors":"K. Fukazawa, Setsuo Takato","doi":"10.1109/ICCSA.2010.31","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.31","url":null,"abstract":"We report the examples of the teaching materials of physics generated by using ketpic, focusing on the Lorentz contraction. The represented examples are the observed images of the moving objects at the speed of 95 percent of the speed of light $c$, where a cubic and a sphere are taken as the objects. We also show the observed images of lines of electric and magnetic forces around the moving charged objects. The obtained images are largely distorted on account of the effect of the Lorentz contraction and the fact that the speed of light is limited and the same value in any frame.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115935311","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}
A large number of surveillance applications requires narrow channel transmission and limited capacity storage, since very low bit-rate techniques becomes necessary. For many surveillance applications, motive objects contain most interest information. This paper proposed an enhanced motion block detector, which includes a pre-stage for adaptively classifying macroblocks into motive and static blocks. In this pre-stage, linear divided difference filter and weighted erosion filter are proposed to release from the foreground clash and lightening noise respectively. For the unimportant static macroblock, low bit-rate skip mode has been chosen as the best mode. Simulation results shows, compared to the conventional work, it can achieve 24%-38% bit-rate saving, 8%-44% ME time saving and higher detection accuracy for uncompressed surveillance videos.
{"title":"Low Bit-Rate Motion Block Detection for Uncompressed Indoor Surveillance","authors":"Jia Su, Qin Liu, T. Ikenaga","doi":"10.1109/ICCSA.2010.77","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.77","url":null,"abstract":"A large number of surveillance applications requires narrow channel transmission and limited capacity storage, since very low bit-rate techniques becomes necessary. For many surveillance applications, motive objects contain most interest information. This paper proposed an enhanced motion block detector, which includes a pre-stage for adaptively classifying macroblocks into motive and static blocks. In this pre-stage, linear divided difference filter and weighted erosion filter are proposed to release from the foreground clash and lightening noise respectively. For the unimportant static macroblock, low bit-rate skip mode has been chosen as the best mode. Simulation results shows, compared to the conventional work, it can achieve 24%-38% bit-rate saving, 8%-44% ME time saving and higher detection accuracy for uncompressed surveillance videos.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114856462","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}
In this study, numerical solution procedures by anintegral equation method are presented for the large deflection problem of an inclined cantilever by the elastica theory. Inclined cantilever with a load is analyzed systematically. The problem expressed by a class of nonlinear two-point boundary value problem is transformed into an integral equation by means of integration procedure. Using our numerical scheme, torque-turning angle curves and cantilever configurations are determined for the various loading parameters. Wang’s solutions are compared with our solutions obtained by integral equation method. We treat a cantilever with an end load,and various cantilever’s shape showing the large deformations in which we can recognize highly nonlinear phenomenon.The obtained results with various cantilever deformations are visualized by using Mathematica which is powerful computer algebra system.
{"title":"Visualizations of Nonlinear Phenomena of an Inclined Cantilevers by Mathematica","authors":"S. Miyake, R. Sugino","doi":"10.1109/ICCSA.2010.29","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.29","url":null,"abstract":"In this study, numerical solution procedures by anintegral equation method are presented for the large deflection problem of an inclined cantilever by the elastica theory. Inclined cantilever with a load is analyzed systematically. The problem expressed by a class of nonlinear two-point boundary value problem is transformed into an integral equation by means of integration procedure. Using our numerical scheme, torque-turning angle curves and cantilever configurations are determined for the various loading parameters. Wang’s solutions are compared with our solutions obtained by integral equation method. We treat a cantilever with an end load,and various cantilever’s shape showing the large deformations in which we can recognize highly nonlinear phenomenon.The obtained results with various cantilever deformations are visualized by using Mathematica which is powerful computer algebra system.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127371256","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}
D. Gafurov, Patrick A. H. Bours, Bian Yang, C. Busch
In this paper, we describe the GUC100 multi-scanner fingerprint database that has been created for independent and in-house (semi-public) performance and interoperability testing of third party algorithms. The GUC100 was collected by using six different fingerprint scanners (TST, L-1, Cross Match, PreciseBiometrics, Lumidigm and Sagem). Over several months fingerprint images of all 10 fingers from 100 subjects on all 6 scanners were acquired. In total, GUC100 contains almost 72.000 fingerprint images.The GUC100 database enables to evaluate various performances and interoperability settings by taking into account different influencing factors such as fingerprint scanner, image quality and so on. The GUC100 data set is freely available to other researchers and practitioners provided that they conduct their testing in the premises of the Gjovik University College in Norway, or alternatively submit their algorithms (in compiled form) to run on GUC100 by researchers in Gjovik.We applied a commercial fingerprint verification algorithm on GUC100 and the reported results indicate that GUC100 is a challenging database.
{"title":"GUC100 Multi-scanner Fingerprint Database for In-House (Semi-public) Performance and Interoperability Evaluation","authors":"D. Gafurov, Patrick A. H. Bours, Bian Yang, C. Busch","doi":"10.1109/ICCSA.2010.71","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.71","url":null,"abstract":"In this paper, we describe the GUC100 multi-scanner fingerprint database that has been created for independent and in-house (semi-public) performance and interoperability testing of third party algorithms. The GUC100 was collected by using six different fingerprint scanners (TST, L-1, Cross Match, PreciseBiometrics, Lumidigm and Sagem). Over several months fingerprint images of all 10 fingers from 100 subjects on all 6 scanners were acquired. In total, GUC100 contains almost 72.000 fingerprint images.The GUC100 database enables to evaluate various performances and interoperability settings by taking into account different influencing factors such as fingerprint scanner, image quality and so on. The GUC100 data set is freely available to other researchers and practitioners provided that they conduct their testing in the premises of the Gjovik University College in Norway, or alternatively submit their algorithms (in compiled form) to run on GUC100 by researchers in Gjovik.We applied a commercial fingerprint verification algorithm on GUC100 and the reported results indicate that GUC100 is a challenging database.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125550162","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}
A triangulation of a planar set S is a maximal plane straight-line graph with the vertex set S. In the Minimum Weight Triangulation (MWT) problem, we want to draw a triangulation of a given point set that minimizes the sum of the edges length. Recently, Mulzer and Rote have proved that this problem is NP-Hard [10]. In this paper, we present a heuristic algorithm using Ant Colony Optimization to solve this problem.
{"title":"An Ant Colony Algorithm for the Minimum Weight Triangulation","authors":"Malihe Jahani, B. S. Bigham, Abbas Askari","doi":"10.1109/ICCSA.2010.38","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.38","url":null,"abstract":"A triangulation of a planar set S is a maximal plane straight-line graph with the vertex set S. In the Minimum Weight Triangulation (MWT) problem, we want to draw a triangulation of a given point set that minimizes the sum of the edges length. Recently, Mulzer and Rote have proved that this problem is NP-Hard [10]. In this paper, we present a heuristic algorithm using Ant Colony Optimization to solve this problem.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131815988","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}
Pichai Jodpimai, Peraphon Sophatsathit, C. Lursinsap
The aim of this study is to improve software effort estimation by incorporating straightforward mathematical principles and artificial neural network technique. Our process consists of three major steps. The first step concerns data preparation from each considered database. The second step is to reduce the number of given features by considering only those relevant ones. The final step is to transform the problem of estimating software effort to the problems of classification and functional approximation by using a feedforward neural network. Experimental data are taken from well-known public domains. The results are systematically compared with related prior works using only a few features so obtained, yet demonstrate that the proposed model yields satisfactory estimation accuracy based on MMRE and PRED measures.
{"title":"Estimating Software Effort with Minimum Features Using Neural Functional Approximation","authors":"Pichai Jodpimai, Peraphon Sophatsathit, C. Lursinsap","doi":"10.1109/ICCSA.2010.63","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.63","url":null,"abstract":"The aim of this study is to improve software effort estimation by incorporating straightforward mathematical principles and artificial neural network technique. Our process consists of three major steps. The first step concerns data preparation from each considered database. The second step is to reduce the number of given features by considering only those relevant ones. The final step is to transform the problem of estimating software effort to the problems of classification and functional approximation by using a feedforward neural network. Experimental data are taken from well-known public domains. The results are systematically compared with related prior works using only a few features so obtained, yet demonstrate that the proposed model yields satisfactory estimation accuracy based on MMRE and PRED measures.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133589234","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}
Layout engine combines markup language (Html, etc) with formatting information (CSS, etc), and displays the combined contents on the screen. It is commonly used for many existing web development applications and web browsers. Especially, Web Development Applications use Layout Engine to confirm impact on the layout of web editing results to achieve What You See Is What You Get (WYSIWYG). At present, different layout engines are adopted by various web development applications and web browsers. As there is not a uniform algorithm adopted by layout engine, the results displayed by web development applications are not necessarily kept the same as displayed on the web browsers. In addition, the results displayed by web development applications are depended on layout engines. Hence it is difficult to edit the common web contents since it cannot objectively reflect the result on web browsers. In this paper, we proposes a novel WYSIWYG solution, by completely separating web layout design from web data editing to generate cross-browser web data. Our proposed approach does not use layout engine, and thus can avoid the disadvantages mentioned above.
{"title":"A Novel WYSIWYG Approach for Generating Cross-Browser Web Data","authors":"Jin Zhu, Xiao Liu, Y. Urano, Qun Jin","doi":"10.1109/ICCSA.2010.47","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.47","url":null,"abstract":"Layout engine combines markup language (Html, etc) with formatting information (CSS, etc), and displays the combined contents on the screen. It is commonly used for many existing web development applications and web browsers. Especially, Web Development Applications use Layout Engine to confirm impact on the layout of web editing results to achieve What You See Is What You Get (WYSIWYG). At present, different layout engines are adopted by various web development applications and web browsers. As there is not a uniform algorithm adopted by layout engine, the results displayed by web development applications are not necessarily kept the same as displayed on the web browsers. In addition, the results displayed by web development applications are depended on layout engines. Hence it is difficult to edit the common web contents since it cannot objectively reflect the result on web browsers. In this paper, we proposes a novel WYSIWYG solution, by completely separating web layout design from web data editing to generate cross-browser web data. Our proposed approach does not use layout engine, and thus can avoid the disadvantages mentioned above.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115066054","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：