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}
The goal of this project is to increase the success of students in learning mathematics and improve retention in STEM discipline via implementation of online WebWork in STEM education. This project will have broader impact on the teaching and learning mathematics by providing more effective and efficient homework practice. Students will benefit from the instant feedback since every homework problem is graded online. Instructors will also benefit greatly being relieved from the burden of manually checking homework and simultaneously being able to determine how well the students are learning the subject. The WebWork system has been adopted by over 100 colleges and universities in U.S. for Mathematics and Science homework delivery.
{"title":"Using the online webwork for student's homework practice in education","authors":"Shangrong Deng, C. Hung, K. Qian","doi":"10.1145/1900008.1900121","DOIUrl":"https://doi.org/10.1145/1900008.1900121","url":null,"abstract":"The goal of this project is to increase the success of students in learning mathematics and improve retention in STEM discipline via implementation of online WebWork in STEM education. This project will have broader impact on the teaching and learning mathematics by providing more effective and efficient homework practice. Students will benefit from the instant feedback since every homework problem is graded online. Instructors will also benefit greatly being relieved from the burden of manually checking homework and simultaneously being able to determine how well the students are learning the subject. The WebWork system has been adopted by over 100 colleges and universities in U.S. for Mathematics and Science homework delivery.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"80 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":"129008164","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}
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}
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}
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}
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}
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}
High performance computing environments are not freely available to every scientist or programmer. However, massively parallel computational devices are available in nearly every workstation class computer and laptop sold today. The programmable GPU gives immense computational power to a user in a standard office environment; however, programming a GPU to function efficiently is not a trivial task. An issue of primary concern is memory latency, if not managed properly it can cost the GPU in performance resulting in increased runtimes waiting for data. In this paper we describe an optimization of memory access methods on GPUs using Morton order indexing, sometimes referred to as Z-order index.
{"title":"Optimizing memory access on GPUs using morton order indexing","authors":"Anthony E. Nocentino, P. J. Rhodes","doi":"10.1145/1900008.1900035","DOIUrl":"https://doi.org/10.1145/1900008.1900035","url":null,"abstract":"High performance computing environments are not freely available to every scientist or programmer. However, massively parallel computational devices are available in nearly every workstation class computer and laptop sold today. The programmable GPU gives immense computational power to a user in a standard office environment; however, programming a GPU to function efficiently is not a trivial task. An issue of primary concern is memory latency, if not managed properly it can cost the GPU in performance resulting in increased runtimes waiting for data. In this paper we describe an optimization of memory access methods on GPUs using Morton order indexing, sometimes referred to as Z-order index.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"96 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":"133179706","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}
Richard C. Detmer, Cen Li, Zhijiang Dong, J. Hankins
Research has shown students are more motivated and more likely to perform active learning when working on real-world projects that have societal impact. The Computer Science Department at Middle Tennessee State University has embarked on the task of incorporating real-world projects into multiple courses across the curriculum. This paper describes the real world project collection process and a management framework being developed to collect and track the usage of real-world projects for Computer Science courses. It discusses pilot courses that used real-world projects in teaching various computing subjects, as well as lessons learned from these pilot studies.
研究表明，在从事具有社会影响的现实世界项目时，学生更有动力，更有可能进行主动学习。中田纳西州立大学(Middle Tennessee State University)计算机科学系已经开始着手将现实世界的项目整合到课程中的多个课程中。本文描述了真实世界的项目收集过程和一个正在开发的管理框架，用于收集和跟踪计算机科学课程中真实世界项目的使用情况。它讨论了使用实际项目来教授各种计算科目的试点课程，以及从这些试点研究中获得的经验教训。
{"title":"Incorporating real-world projects in teaching computer science courses","authors":"Richard C. Detmer, Cen Li, Zhijiang Dong, J. Hankins","doi":"10.1145/1900008.1900042","DOIUrl":"https://doi.org/10.1145/1900008.1900042","url":null,"abstract":"Research has shown students are more motivated and more likely to perform active learning when working on real-world projects that have societal impact. The Computer Science Department at Middle Tennessee State University has embarked on the task of incorporating real-world projects into multiple courses across the curriculum. This paper describes the real world project collection process and a management framework being developed to collect and track the usage of real-world projects for Computer Science courses. It discusses pilot courses that used real-world projects in teaching various computing subjects, as well as lessons learned from these pilot studies.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"57 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132738487","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
扫码关注我们
求助内容：
应助结果提醒方式：