The number of software products available in market is increasing rapidly. Many a time, multiple companies develop software products of similar functionalities. Thus the competition among those owning companies is becoming tougher every day. Moreover, there are many crucial programs whose results should be always accurate without fail. As a consequence of such challenges, tackling software bugs issues efficiently is an important and essential task for the owning software companies. Therefore, predicting bugs and finding ways to address these at the earliest has become an important factor for sustainability in the software market. This paper proposes software bug predication models using Autoregressive Moving Average Model (ARIMA) based on Box-Jenkins Methodology, which depends on Autoregressive models (AR) with Moving Average (MA). The inputs to our models are the information extracted from the past bug repositories. We have verified our models using datasets of Eclipse [16] and Mozilla [17].
{"title":"Predicting software bugs using ARIMA model","authors":"Lisham L. Singh, A. Abbas, F. Ahmad, S. Ramaswamy","doi":"10.1145/1900008.1900046","DOIUrl":"https://doi.org/10.1145/1900008.1900046","url":null,"abstract":"The number of software products available in market is increasing rapidly. Many a time, multiple companies develop software products of similar functionalities. Thus the competition among those owning companies is becoming tougher every day. Moreover, there are many crucial programs whose results should be always accurate without fail. As a consequence of such challenges, tackling software bugs issues efficiently is an important and essential task for the owning software companies. Therefore, predicting bugs and finding ways to address these at the earliest has become an important factor for sustainability in the software market.\u0000 This paper proposes software bug predication models using Autoregressive Moving Average Model (ARIMA) based on Box-Jenkins Methodology, which depends on Autoregressive models (AR) with Moving Average (MA). The inputs to our models are the information extracted from the past bug repositories. We have verified our models using datasets of Eclipse [16] and Mozilla [17].","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124883386","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}
Model-Driven Engineering (MDE) has emerged as a promising paradigm in software engineering by emphasizing the use of models not just for documentation and communication purposes, but as first-class artifacts to be transformed into other work products (e.g., other models, source code, and test scripts). MDE supports full-scale round-trip engineering, from idea inception to operationalization. Historically, models have been developed using general-purpose modeling languages, such as the Unified Modeling Language (UML). A more recent trend is to use domain-specific modeling languages (DSMLs), which assist domain experts in working within their own problem space without being concerned about technical details of the solution space (e.g., programming languages and middleware). DSMLs also provide an accessible way to communicate with stakeholders who are not familiar with the fast changing technologies. This introductory tutorial will present a summary of the areas represented by MDE and offer some insight into the benefits of using DSMLs in both research and teaching.
{"title":"Model-driven engineering: raising the abstraction level through domain-specific modeling","authors":"J. Gray, Jules White, A. Gokhale","doi":"10.1145/1900008.1900010","DOIUrl":"https://doi.org/10.1145/1900008.1900010","url":null,"abstract":"Model-Driven Engineering (MDE) has emerged as a promising paradigm in software engineering by emphasizing the use of models not just for documentation and communication purposes, but as first-class artifacts to be transformed into other work products (e.g., other models, source code, and test scripts). MDE supports full-scale round-trip engineering, from idea inception to operationalization. Historically, models have been developed using general-purpose modeling languages, such as the Unified Modeling Language (UML). A more recent trend is to use domain-specific modeling languages (DSMLs), which assist domain experts in working within their own problem space without being concerned about technical details of the solution space (e.g., programming languages and middleware). DSMLs also provide an accessible way to communicate with stakeholders who are not familiar with the fast changing technologies. This introductory tutorial will present a summary of the areas represented by MDE and offer some insight into the benefits of using DSMLs in both research and teaching.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125099079","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}
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culling of more high quality and less redundant clusters, than that of traditional clustering algorithms. In addition, our method contains a relaxation parameter, which allows for the classification of qualifying clusters into mutually exclusive bins of varying quality---extending the problem to mining relaxed closed subspace clusters. These concepts culminate in a new algorithm called Relaxed Closed Subspace Clustering (RCSC).
{"title":"Mining relaxed closed subspace clusters","authors":"Erich A. Peterson, P. Tang","doi":"10.1145/1900008.1900032","DOIUrl":"https://doi.org/10.1145/1900008.1900032","url":null,"abstract":"This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culling of more high quality and less redundant clusters, than that of traditional clustering algorithms. In addition, our method contains a relaxation parameter, which allows for the classification of qualifying clusters into mutually exclusive bins of varying quality---extending the problem to mining relaxed closed subspace clusters. These concepts culminate in a new algorithm called Relaxed Closed Subspace Clustering (RCSC).","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127186990","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}
This tutorial, designed for instructors of CS1/AP, introduces Alice3 with built-in transition from Alice to Java. The workshop offers hands-on experience programming with Alice3 and integrating a transition to Java IDE, e.g. NetBeans. Alice3 builds on Alice2's powerful program visualization technique, enabling students to "see" objects and work with object- oriented programming.
{"title":"Teaching with Alice 3: tutorial","authors":"W. Dann, Pamela B. Lawhead, Aik Min Choong","doi":"10.1145/1900008.1900016","DOIUrl":"https://doi.org/10.1145/1900008.1900016","url":null,"abstract":"This tutorial, designed for instructors of CS1/AP, introduces Alice3 with built-in transition from Alice to Java. The workshop offers hands-on experience programming with Alice3 and integrating a transition to Java IDE, e.g. NetBeans. Alice3 builds on Alice2's powerful program visualization technique, enabling students to \"see\" objects and work with object- oriented programming.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115398246","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 part of the mission of state troopers is to prevent traffic accidents and to quickly respond to the accidents that do happen. However, driving about aimlessly during their shift is not efficient. Certain areas can be identified as "hotspots", places where crashes are known to frequently occur. It is advantageous to have officers target these critical locations during their patrol routes. Multiple officers taking similar routes is also inefficient. The number of officers patrolling is limited, and by keeping them spread out, response time to crashes can be decreased. The purpose of the Turn programming language is to create efficient routes daily, but with a degree of randomness to prevent the routes from becoming predictable. At its core is a graph representing the roads of Alabama, with vertices at each milepost and intersection. Turn programs utilize set reduction functions to choose what vertices officers should patrol. Depending on what functions the programmer uses and the order they are used, the route may be different to reflect the changing priorities. A Turn program's worth is measured by a number of metrics, such as how many hotspots were covered each day, how long those hotspots were patrolled, and time taken to respond to crashes in the simulation. Additionally, a program is worthless if the routes it creates are not realistic. In this paper, we present an analysis of various Turn programs, explain how they affect the metrics, and show a program that strikes a balance between them.
{"title":"Optimizing metrics in police routing algorithms","authors":"N. Hamner","doi":"10.1145/1900008.1900139","DOIUrl":"https://doi.org/10.1145/1900008.1900139","url":null,"abstract":"A large part of the mission of state troopers is to prevent traffic accidents and to quickly respond to the accidents that do happen. However, driving about aimlessly during their shift is not efficient. Certain areas can be identified as \"hotspots\", places where crashes are known to frequently occur. It is advantageous to have officers target these critical locations during their patrol routes. Multiple officers taking similar routes is also inefficient. The number of officers patrolling is limited, and by keeping them spread out, response time to crashes can be decreased.\u0000 The purpose of the Turn programming language is to create efficient routes daily, but with a degree of randomness to prevent the routes from becoming predictable. At its core is a graph representing the roads of Alabama, with vertices at each milepost and intersection. Turn programs utilize set reduction functions to choose what vertices officers should patrol. Depending on what functions the programmer uses and the order they are used, the route may be different to reflect the changing priorities.\u0000 A Turn program's worth is measured by a number of metrics, such as how many hotspots were covered each day, how long those hotspots were patrolled, and time taken to respond to crashes in the simulation. Additionally, a program is worthless if the routes it creates are not realistic. In this paper, we present an analysis of various Turn programs, explain how they affect the metrics, and show a program that strikes a balance between them.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"321 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115839645","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}
Inadequate use of project management techniques in software development can be traced to the lack of efficient education strategies for managers [1]. Software development processes are complex and therefore it is hard to predict how changes made to some part of the process can affect the overall outcome of the process. Introducing change in the process is often time consuming and there is no assurance that the change implemented will result in an improvement. Simulation of software development process provides an easy way for managers to test the different configurations of the process and understand the effects of various policies. Using agent directed simulation to mimic the software development process at the individual level also would enable us to introduce a new phase of software development without having to change the simulation code. This simulation would start with a given number of agents initialized by the user. At any point of time, the user may change the number of developers or assign developers on different phases of the software development depending on their performance and capabilities.
{"title":"A flexible model for simulation of software development process","authors":"R. Agarwal, D. Umphress","doi":"10.1145/1900008.1900064","DOIUrl":"https://doi.org/10.1145/1900008.1900064","url":null,"abstract":"Inadequate use of project management techniques in software development can be traced to the lack of efficient education strategies for managers [1]. Software development processes are complex and therefore it is hard to predict how changes made to some part of the process can affect the overall outcome of the process. Introducing change in the process is often time consuming and there is no assurance that the change implemented will result in an improvement. Simulation of software development process provides an easy way for managers to test the different configurations of the process and understand the effects of various policies.\u0000 Using agent directed simulation to mimic the software development process at the individual level also would enable us to introduce a new phase of software development without having to change the simulation code. This simulation would start with a given number of agents initialized by the user. At any point of time, the user may change the number of developers or assign developers on different phases of the software development depending on their performance and capabilities.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116278274","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 modern healthcare systems, information sharing among different individuals or organizations is a crucial aspect of everyday operations. The ability to send and receive data over a large inter-organizational network while protecting the privacy of vital electronic medical records is a challenge that has to be met and resolved. To address this problem, several Electronic Healthcare Record (EHR) standards are being developed to enable organizations to exchange clinical data. This paper provides a framework of using Security Assertion Markup Language (SAML) in an inter-organizational E-Healthcare system. Previous studies have shown that a Role-Based Access Control Model is a suitable security model for a single E-Healthcare system. The main goal of this paper focuses on communication and data sharing EHR component among the inter-organizations without comprising any privacy.
{"title":"A framework for access control model in enterprise healthcare via SAML","authors":"Saidi Mchumo, H. Chi","doi":"10.1145/1900008.1900154","DOIUrl":"https://doi.org/10.1145/1900008.1900154","url":null,"abstract":"In modern healthcare systems, information sharing among different individuals or organizations is a crucial aspect of everyday operations. The ability to send and receive data over a large inter-organizational network while protecting the privacy of vital electronic medical records is a challenge that has to be met and resolved. To address this problem, several Electronic Healthcare Record (EHR) standards are being developed to enable organizations to exchange clinical data. This paper provides a framework of using Security Assertion Markup Language (SAML) in an inter-organizational E-Healthcare system. Previous studies have shown that a Role-Based Access Control Model is a suitable security model for a single E-Healthcare system. The main goal of this paper focuses on communication and data sharing EHR component among the inter-organizations without comprising any privacy.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116782935","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}
Collaborative knowledge production in open source science communities such as Open Biomedical Ontologies (OBO) is poorly understood. In this paper, we present the components of a software system that is used to conduct computational ethnography and examine the growth and evolution of the OBO community. OBO is comprised of a global network of communities that are engaged in developing formal ontologies to standardize data acquisition and use in the health sciences community. The process involved in collecting and parsing open source data is presented along with a discussion of multiple socio-technical networks generated from the raw data. We evaluate the characteristics and topological change of the structure of a selected subdomain within the OBO community in terms of social network metrics.
{"title":"SciBrowser: a computational ethnography tool to explore open source science communities","authors":"Michael Arnold, Damodar Shenviwagle, L. Yilmaz","doi":"10.1145/1900008.1900045","DOIUrl":"https://doi.org/10.1145/1900008.1900045","url":null,"abstract":"Collaborative knowledge production in open source science communities such as Open Biomedical Ontologies (OBO) is poorly understood. In this paper, we present the components of a software system that is used to conduct computational ethnography and examine the growth and evolution of the OBO community. OBO is comprised of a global network of communities that are engaged in developing formal ontologies to standardize data acquisition and use in the health sciences community. The process involved in collecting and parsing open source data is presented along with a discussion of multiple socio-technical networks generated from the raw data. We evaluate the characteristics and topological change of the structure of a selected subdomain within the OBO community in terms of social network metrics.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130293134","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 paper, we demonstrate how to reduce the chance of a spoofed iris code being falsely accepted by an iris recognition system. We simulate the system attack by taking one of the registered iris codes from a subject set and mutating it by several different rates and presenting the resultant iris codes to our system. Our approach uses the k-nearest neighbors from a training set to the known spoof to establish a critical distance. Presented iris codes from our mutant set that have a Hamming Ratio when compared to the spoof that is less than the critical distance are rejected. Those that are falsely accepted are totaled to produce a Spoof False Accept Rate (SP-FAR). The second phase of our approach uses traditional iris code recognition to reduce the SP-FAR by rejecting those spoofs that were mutated to a degree such that they will not match any of the other iris codes in the training set.
{"title":"A two-phased approach to reducing the false accept rate of spoofed iris codes","authors":"Kelvin S. Bryant, G. Dozier","doi":"10.1145/1900008.1900048","DOIUrl":"https://doi.org/10.1145/1900008.1900048","url":null,"abstract":"In this paper, we demonstrate how to reduce the chance of a spoofed iris code being falsely accepted by an iris recognition system. We simulate the system attack by taking one of the registered iris codes from a subject set and mutating it by several different rates and presenting the resultant iris codes to our system. Our approach uses the k-nearest neighbors from a training set to the known spoof to establish a critical distance. Presented iris codes from our mutant set that have a Hamming Ratio when compared to the spoof that is less than the critical distance are rejected. Those that are falsely accepted are totaled to produce a Spoof False Accept Rate (SP-FAR). The second phase of our approach uses traditional iris code recognition to reduce the SP-FAR by rejecting those spoofs that were mutated to a degree such that they will not match any of the other iris codes in the training set.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128932862","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 paper the ant colony optimization (ACO) is used in the K-means algorithm for improving the image segmentation. The learning mechanism of this algorithm is formulated by using the ACO meta-heuristic. As the pheromone dominates the exploration of ants for problem solutions, preliminary experiments on pheromone's update are reported. Two methods for defining and updating pheromone values are proposed and tested: one with the spatial coordinate distances and the other without using such a distance. The ACO improves the K-means algorithm by making it less dependent on the initial parameters.
{"title":"Ant colony optimization for the K-means algorithm in image segmentation","authors":"C. Hung, Mojia Sun","doi":"10.1145/1900008.1900075","DOIUrl":"https://doi.org/10.1145/1900008.1900075","url":null,"abstract":"In this paper the ant colony optimization (ACO) is used in the K-means algorithm for improving the image segmentation. The learning mechanism of this algorithm is formulated by using the ACO meta-heuristic. As the pheromone dominates the exploration of ants for problem solutions, preliminary experiments on pheromone's update are reported. Two methods for defining and updating pheromone values are proposed and tested: one with the spatial coordinate distances and the other without using such a distance. The ACO improves the K-means algorithm by making it less dependent on the initial parameters.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116846587","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
扫码关注我们
求助内容：
应助结果提醒方式：