Kamonwan Taohai, Suphakant Phimoltares, N. Cooharojananone
The objective of this research was to compare the seven main functions of ATM banking services from five banks in Thailand. The selection of the five ATM banks was based on the fact that they contained different hierarchical menu structures. In the research, four groups each with 200 participants were separated into two parts. The first group of participants was required to complete a questionnaire in order to identify the seven main tasks of ATM banking, whilst the second group was required to perform the experiment on the ATM simulator. The second group was subdivided into four groups; students, employees, government and state enterprises officers and agriculturists. To compare seven major functions, a simulator of each of the five banks’ ATM machines was developed and then tested in the laboratory environment. Usability was evaluated in terms of effectiveness, efficiency, satisfaction and the percentage difference. The results suggest that different menu structures will affect the usability of ATM banking. Moreover, the different types of user provide a different score based on usability measurement. Only one bank received the highest score on most of the usability criteria for all the different user groups.
{"title":"Usability Comparisons of Seven Main Functions for Automated Teller Machine (ATM) Banking Service of Five Banks in Thailand","authors":"Kamonwan Taohai, Suphakant Phimoltares, N. Cooharojananone","doi":"10.1109/ICCSA.2010.50","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.50","url":null,"abstract":"The objective of this research was to compare the seven main functions of ATM banking services from five banks in Thailand. The selection of the five ATM banks was based on the fact that they contained different hierarchical menu structures. In the research, four groups each with 200 participants were separated into two parts. The first group of participants was required to complete a questionnaire in order to identify the seven main tasks of ATM banking, whilst the second group was required to perform the experiment on the ATM simulator. The second group was subdivided into four groups; students, employees, government and state enterprises officers and agriculturists. To compare seven major functions, a simulator of each of the five banks’ ATM machines was developed and then tested in the laboratory environment. Usability was evaluated in terms of effectiveness, efficiency, satisfaction and the percentage difference. The results suggest that different menu structures will affect the usability of ATM banking. Moreover, the different types of user provide a different score based on usability measurement. Only one bank received the highest score on most of the usability criteria for all the different user groups.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"8 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":"117061159","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}
Closeness in meaning of the terms in the information systems and software engineering may result in discussion of using proper affiliated terms while covering the scope of research. An example is touched in this exploratory study, which discusses flexibility and its affiliated terms: changeability, adaptability, compatibility, flexibility, expandability, extendibility, extensibility and portability. A risk of misinterpretation due to the variety of the usage of the term is noted whereas the adoption of the term has shown that the literature does not have such examples to a serious level; but this review informs about missing discussions in the research reports in the literature due to omitting or ignoring affiliated terms of the keywords. Another product of this paper is to provide basis for future studies in the flexibility as a quality factor in the software measurement.
{"title":"A Discussion on IS and Software Measurement Terminology: Flexibility as an Example","authors":"Ö. T. Pusatli, S. Misra","doi":"10.1109/ICCSA.2010.60","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.60","url":null,"abstract":"Closeness in meaning of the terms in the information systems and software engineering may result in discussion of using proper affiliated terms while covering the scope of research. An example is touched in this exploratory study, which discusses flexibility and its affiliated terms: changeability, adaptability, compatibility, flexibility, expandability, extendibility, extensibility and portability. A risk of misinterpretation due to the variety of the usage of the term is noted whereas the adoption of the term has shown that the literature does not have such examples to a serious level; but this review informs about missing discussions in the research reports in the literature due to omitting or ignoring affiliated terms of the keywords. Another product of this paper is to provide basis for future studies in the flexibility as a quality factor in the software measurement.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"27 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":"125763172","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}
Data streams from sensors are widely used in many applications of ubiquitous computing environments. In particular, spatial data streams from sensors are useful in context-awareness for many types of applications. However, an important gap is found between spatial data stream management and spatial context-awareness. While spatial data streams from sensors should be handled in real-time, spatial context-awareness often requires complicated analysis and expensive processing cost. For this reason, it is difficult to integrate spatial data stream processing and context-awareness. In this paper, we present a system called SCONSTREAM (Spatial CONtext STREAm Management) that we have developed to resolve the gap between spatial data stream and context-awareness. The key approach of our system is to convert spatial data streams from sensors to spatial context streams, which are smaller and more suitable to be processed by the context-awareness module than raw data from sensors. By SCONSTREAM, we resolved the gap and achieved the integration of spatial data processing and spatial context-awareness module.
{"title":"SCONSTREAM: A Spatial Context Stream Processing System","authors":"Oje Kwon, Yong-Soo Song, Jae-Hun Kim, Ki-Joune Li","doi":"10.1109/ICCSA.2010.48","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.48","url":null,"abstract":"Data streams from sensors are widely used in many applications of ubiquitous computing environments. In particular, spatial data streams from sensors are useful in context-awareness for many types of applications. However, an important gap is found between spatial data stream management and spatial context-awareness. While spatial data streams from sensors should be handled in real-time, spatial context-awareness often requires complicated analysis and expensive processing cost. For this reason, it is difficult to integrate spatial data stream processing and context-awareness. In this paper, we present a system called SCONSTREAM (Spatial CONtext STREAm Management) that we have developed to resolve the gap between spatial data stream and context-awareness. The key approach of our system is to convert spatial data streams from sensors to spatial context streams, which are smaller and more suitable to be processed by the context-awareness module than raw data from sensors. By SCONSTREAM, we resolved the gap and achieved the integration of spatial data processing and spatial context-awareness module.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"7 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":"133503051","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}
Zhihao Zhang, Jun Huang, Bo Zhang, Jinlong Lin, Xiaolan Chen
Regression test generation is an important process to make sure that changes of program have no unintended side-effects. To achieve full confidence, many projects have to re-run all the test cases for entire program, which makes it a time consuming and expensive activity. In this paper, a code based regression testing approach is proposed to generate selected test suites for unit testing. The framework contains five phases: program change detection phase, logical verification phase, branch pruning phase, test case prioritization phase and test suite generation phase. These five phases can achieve detection of program’s modification, coding standard, test case pruning, test case prioritizing and inputs generation for regression test cases respectively. A prototype based on this framework is implemented using logical tree-structured analysis, and the preliminary experiment shows that proposed approach can provide efficient regression test suites.
{"title":"Regression Test Generation Approach Based on Tree-Structured Analysis","authors":"Zhihao Zhang, Jun Huang, Bo Zhang, Jinlong Lin, Xiaolan Chen","doi":"10.1109/ICCSA.2010.59","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.59","url":null,"abstract":"Regression test generation is an important process to make sure that changes of program have no unintended side-effects. To achieve full confidence, many projects have to re-run all the test cases for entire program, which makes it a time consuming and expensive activity. In this paper, a code based regression testing approach is proposed to generate selected test suites for unit testing. The framework contains five phases: program change detection phase, logical verification phase, branch pruning phase, test case prioritization phase and test suite generation phase. These five phases can achieve detection of program’s modification, coding standard, test case pruning, test case prioritizing and inputs generation for regression test cases respectively. A prototype based on this framework is implemented using logical tree-structured analysis, and the preliminary experiment shows that proposed approach can provide efficient regression test suites.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"75 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":"127394441","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}
The ruler folding problem asks: Given a set of n line segment links attached at their end points with rotating joints. Find a minimum length folding of this chain of links along a line. In this paper, we provide an improved approximation for the problem if the longest link is significantly larger than the rest. We then consider generalizations to trees of links and instances containing cycles of links. We provide the first fully polynomial time approximation scheme (FPTAS) for the tree variant and prove the inapproximability of cycle variants. Lastly, we consider the area optimizaton problem, of folding the links to achieve minimum area within minimum width. We prove the problem and any multiplicative approximation to be NP-hard and also prove the impossibility of any additive polynomial time approximation schemes (PTAS).
{"title":"Folding Links is Hard","authors":"Ishan Behoora","doi":"10.1109/ICCSA.2010.36","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.36","url":null,"abstract":"The ruler folding problem asks: Given a set of n line segment links attached at their end points with rotating joints. Find a minimum length folding of this chain of links along a line. In this paper, we provide an improved approximation for the problem if the longest link is significantly larger than the rest. We then consider generalizations to trees of links and instances containing cycles of links. We provide the first fully polynomial time approximation scheme (FPTAS) for the tree variant and prove the inapproximability of cycle variants. Lastly, we consider the area optimizaton problem, of folding the links to achieve minimum area within minimum width. We prove the problem and any multiplicative approximation to be NP-hard and also prove the impossibility of any additive polynomial time approximation schemes (PTAS).","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"47 2 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":"124638694","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}
Simplified kinase cascade pathways in cellular signaling are analyzed from the viewpoint of the stochastic fluctuations of each activated constituent kinases. The analytical representations of the kinetics of the kinases are obtained by approximation for the two extreme cases of far-from-saturation with the substrate and of the saturation in enzymes. These stochastic models predict the attenuations of the stochastic fluctuations along downward in the cascade tiers for the case of far-from-saturation and the accumulations of the fluctuations for the case of the saturation. These predictions are further confirmed by the Gillespie simulations. Hence, kinase cascade pathways could work as both of the stochastic fluctuation attenuator and the accumulator, depending on the kinase saturation levels with the substrates.
{"title":"Stochastic Aspects of Kinase Cascade Pathways in Cellular Signaling","authors":"T. Naka","doi":"10.1109/ICCSA.2010.70","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.70","url":null,"abstract":"Simplified kinase cascade pathways in cellular signaling are analyzed from the viewpoint of the stochastic fluctuations of each activated constituent kinases. The analytical representations of the kinetics of the kinases are obtained by approximation for the two extreme cases of far-from-saturation with the substrate and of the saturation in enzymes. These stochastic models predict the attenuations of the stochastic fluctuations along downward in the cascade tiers for the case of far-from-saturation and the accumulations of the fluctuations for the case of the saturation. These predictions are further confirmed by the Gillespie simulations. Hence, kinase cascade pathways could work as both of the stochastic fluctuation attenuator and the accumulator, depending on the kinase saturation levels with the substrates.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"89 3-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132330714","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}
The Continuously Adaptive Mean Shift algorithm (CAMShift) is an adaptation of mean shift algorithm for object tracking especially for head and face tracking. Traditional CAMShift can not deal with multi-colored object tracking and situations when similar colors exist nearby. In this paper, a new approach towards these problems using CAMShift with weighted back projection is proposed. In our approach, multi-dimensional histogram with thresholding strategy is utilized. And a new back projection weighting strategy is proposed for situations when similar colors exist near the tracked object. Through experiments, the results show that the proposed method exceeds the traditional CAMShift in situations with multi-colored object or similar-colored background while keeping the processing speed real-time.
{"title":"Real-Time Non-rigid Object Tracking Using CAMShift with Weighted Back Projection","authors":"Lei Sun, Bingrong Wang, T. Ikenaga","doi":"10.1109/ICCSA.2010.39","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.39","url":null,"abstract":"The Continuously Adaptive Mean Shift algorithm (CAMShift) is an adaptation of mean shift algorithm for object tracking especially for head and face tracking. Traditional CAMShift can not deal with multi-colored object tracking and situations when similar colors exist nearby. In this paper, a new approach towards these problems using CAMShift with weighted back projection is proposed. In our approach, multi-dimensional histogram with thresholding strategy is utilized. And a new back projection weighting strategy is proposed for situations when similar colors exist near the tracked object. Through experiments, the results show that the proposed method exceeds the traditional CAMShift in situations with multi-colored object or similar-colored background while keeping the processing speed real-time.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"310 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":"116757675","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}
File system integrity is very important to a system security, because it affects all users that share system files. Therefore, file system integrity tool (FIT) is widely used for host based file system monitoring. Recently, virtualization technology is applied to several computing areas such as server virtualization and cloud computing, and increasingly demands for a FIT. However, previous virtual machine FITs are not suitable for virtual machines, because its structure is insufficient to real-time file system monitoring. In this paper, we design and implement a NOPFIT: a FIT using a multi-byte NOP injection on lguest virtual machine. The multi-byte NOP is new debugging technique using undefined opcode exception. Our experimental results demonstrate that the NOPFIT has very low performance overhead. The results indicate that the NOPFIT is appropriate for real-time file system monitoring.
{"title":"NOPFIT: File System Integrity Tool for Virtual Machine Using Multi-byte NOP Injection","authors":"Jung Han Kim, Inhyuk Kim, Y. Eom","doi":"10.1109/ICCSA.2010.79","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.79","url":null,"abstract":"File system integrity is very important to a system security, because it affects all users that share system files. Therefore, file system integrity tool (FIT) is widely used for host based file system monitoring. Recently, virtualization technology is applied to several computing areas such as server virtualization and cloud computing, and increasingly demands for a FIT. However, previous virtual machine FITs are not suitable for virtual machines, because its structure is insufficient to real-time file system monitoring. In this paper, we design and implement a NOPFIT: a FIT using a multi-byte NOP injection on lguest virtual machine. The multi-byte NOP is new debugging technique using undefined opcode exception. Our experimental results demonstrate that the NOPFIT has very low performance overhead. The results indicate that the NOPFIT is appropriate for real-time file system monitoring.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"25 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113984689","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}
Fluid simulation has been an active research field in computer graphics for the last 30 years. Stam's stable fluids method, among others, is used for solving the equations that govern fluids (i.e. Navier-Stokes equations). An implementation of stable fluids in 3D using NVIDIA Compute Unified Architecture, shortly CUDA, is provided in this paper. This CUDA-based implementation also features the accurate physical treatment of internal (i.e. static boundaries inside the simulation domain) and moving boundaries. The performance gains of the presented implementation vs a sequential CPU-based implementation, and points of further improvement are also addressed.
{"title":"A CUDA-Based Implementation of Stable Fluids in 3D with Internal and Moving Boundaries","authors":"G. Amador, A. Gomes","doi":"10.1109/ICCSA.2010.43","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.43","url":null,"abstract":"Fluid simulation has been an active research field in computer graphics for the last 30 years. Stam's stable fluids method, among others, is used for solving the equations that govern fluids (i.e. Navier-Stokes equations). An implementation of stable fluids in 3D using NVIDIA Compute Unified Architecture, shortly CUDA, is provided in this paper. This CUDA-based implementation also features the accurate physical treatment of internal (i.e. static boundaries inside the simulation domain) and moving boundaries. The performance gains of the presented implementation vs a sequential CPU-based implementation, and points of further improvement are also addressed.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"86 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":"131590467","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}
The paper explores a framework combining remote sensing and GIS-cellular automata concepts aimed at improving the modeling of un-authorized development. We highlighted that this integration will lead to new levels of understanding of how urban areas grow and change. Further, we describe an unauthorized development for the city of Kuantan in Malaysia, in which urban cellular automata (CA.) concepts is used. The model for Kuantan city was calibrated and tested with the aid of measured time-series data on land uses, through a set of statistical analysis. The fifteen-year simulation until 2015 was run. The simulations applied nearly achieve a high level of detail, confirming the effectiveness of the proposed model with some questions of future research are finally put forward to help strengthen the potential of the proposed framework, especially regarding the further exploration of urban dynamics at high level geographic scales.
{"title":"Urban Sprawl Processes Joining Cellular Automata, GIS and Remote Sensing Data: Simulation of Details Un-authorized Development","authors":"N. M. Noor, M. Hashim","doi":"10.1109/ICCSA.2010.65","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.65","url":null,"abstract":"The paper explores a framework combining remote sensing and GIS-cellular automata concepts aimed at improving the modeling of un-authorized development. We highlighted that this integration will lead to new levels of understanding of how urban areas grow and change. Further, we describe an unauthorized development for the city of Kuantan in Malaysia, in which urban cellular automata (CA.) concepts is used. The model for Kuantan city was calibrated and tested with the aid of measured time-series data on land uses, through a set of statistical analysis. The fifteen-year simulation until 2015 was run. The simulations applied nearly achieve a high level of detail, confirming the effectiveness of the proposed model with some questions of future research are finally put forward to help strengthen the potential of the proposed framework, especially regarding the further exploration of urban dynamics at high level geographic scales.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"11 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":"126968223","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
扫码关注我们
求助内容：
应助结果提醒方式：