Jeffrey A. Robinson, B. Dixon, Jeffrey M. Galloway
{"title":"Montgomery multiplication using CUDA","authors":"Jeffrey A. Robinson, B. Dixon, Jeffrey M. Galloway","doi":"10.1145/2638404.2638485","DOIUrl":"https://doi.org/10.1145/2638404.2638485","url":null,"abstract":"Modular multiplication is useful in many areas of number theory; the most well-known being cryptography. In order to encrypt or decrypt a document using either RSA or ECC encryption algorithms which perform long chains of multiplication modulo N. To factor large numbers many factoring algorithms have long multiplication chains modulo N, where N is a prime number. In our paper, we implement a highly optimized systolic Montgomery multiplication algorithm in order to provide high performance modular multiplications. We develop our algorithm using NVIDIAs general-purpose parallel programming model called CUDA (Compute Unified Device Architecture) for NVIDIA GPUs (Graphics Processing Units). Our implementation can perform up to 338.15 million multiplications per second using a GTX 660 and 475.66 using a GTX 670 with 256 bit numbers. While using 1024-bit numbers the GTX 660 can perform 20.15 million multiplications per second and the GTX 670 can perform 27.89 million multiplications per second. When using 2048-bit numbers, the GTX 660 can perform 4.96 million multiplications per second and the GTX 670 can perform 6.78 million multiplications per second. We also show that our version is faster than previous implemented multiprecision Montgomery multiplication algorithms, while also providing an intuitive data representation.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"280 3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86570555","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}
{"title":"A short survey of linked data ranking","authors":"Semih Yumusak, Erdogan Dogdu, H. Kodaz","doi":"10.1145/2638404.2638523","DOIUrl":"https://doi.org/10.1145/2638404.2638523","url":null,"abstract":"Linked data systems are still far from maturity. Hence, the basic principles are still open for discussion. In our study on building a novel linked data search engine, we have surveyed fundamental methods of internet search technologies in the context of linked data crawling, indexing, ranking, and monitoring. The scope of this ranking survey covers linked data related statistical ranking, database ranking, document level ranking, and Web ranking techniques. In order to classify the linked data ranking methods, we identified a number of categories. These categories are ontology ranking, RDF ranking, graph ranking, entity ranking, document/domain ranking. At the end of the survey, we have listed the ranking techniques based on the well-known PageRank algorithm.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"51 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75147188","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}
{"title":"Usablity and security trade-off: a design guideline","authors":"Yasser M. Hausawi, W. Allen","doi":"10.1145/2638404.2638483","DOIUrl":"https://doi.org/10.1145/2638404.2638483","url":null,"abstract":"Requirements engineering and design are the first two phases of the Software Development Life-Cycle. Considerable research has addressed the requirements phase and a number of well-regarded tools exist to assist with that process. The design phase can also make use of a wide range of tools, including design principles, activities, best practices, techniques, and patterns, to improve the incorporation of requirements into the software design documents. However, the process of selecting the appropriate design tools to support each requirement is a complex task that requires considerable training and experience. It is also possible that design tools selected for different requirements can conflict with each other, reducing their effectiveness, increasing complexity, impacting usability or potentially causing security vulnerabilities. In this paper, we propose guidelines for selecting appropriate design tools to support the integration of usability and security requirements in the software design phase and to resolve conflicts between those tools. We demonstrate this approach with a case study that illustrates the design tool selection and analysis process.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"27 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82214425","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}
Yolanda S. Baker, R. Agrawal, J. Foster, Daniel Beck, G. Dozier
{"title":"Detecting bacterial vaginosis using machine learning","authors":"Yolanda S. Baker, R. Agrawal, J. Foster, Daniel Beck, G. Dozier","doi":"10.1145/2638404.2638521","DOIUrl":"https://doi.org/10.1145/2638404.2638521","url":null,"abstract":"Bacterial Vaginosis (BV) is the most common of vaginal infections diagnosed among women during the years where they can bear children. Yet, there is very little insight as to how it occurs. There are a vast number of criteria that can be taken into consideration to determine the presence of BV. The purpose of this paper is two-fold; first to discover the most significant features necessary to diagnose the infection, second is to apply various classification algorithms on the selected features. It is observed that certain feature selection algorithms provide only a few features; however, the classification results are as good as using a large number of features.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"36 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88521165","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}
{"title":"A multidisciplinary project for undergraduate summer research in computer systems","authors":"D. Lo, K. Qian, K. Ma","doi":"10.1145/2638404.2638498","DOIUrl":"https://doi.org/10.1145/2638404.2638498","url":null,"abstract":"The need and benefit for a multidisciplinary undergraduate research project are obvious. In computer systems, students are required to gain knowledge in computer software and hardware which spans across several disciplines including Electrical Engineering (EE), Computer Science (CS), and Information Technology (IT). It has been a challenge for undergraduate students to conduct a complete research project over a short period of time in summer. This paper reports an exemplar multidisciplinary undergraduate summer research project that has been successfully implemented and may be adopted elsewhere.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"10 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76711140","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}
{"title":"Developing a forensics tool for social media","authors":"Theodore Casser, M. Ketel","doi":"10.1145/2638404.2638491","DOIUrl":"https://doi.org/10.1145/2638404.2638491","url":null,"abstract":"Millions of users around the world utilize social media sites on any given day, spreading information about their activities, whereabouts and thoughts to friends and interested readers. These same messages can be used to construct a digital and physical path that can be extracted for forensic analysis through application programming interfaces provided by each of the social media outlets. While there has been recent work discussing the spread of social media as a means of tracking news and trends in the world at large, little has been done to study a means to analyze the data available through social media using forensic methods. To fill this gap, an application has been created that can retrieve data created by users via social media applications and allow analysis of the same.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88342262","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}
Rajan Kumar Kharel, Niju Shrestha, Chengcui Zhang, G. Savage, Ariel D. Smith
{"title":"Consolidating client names in the lobbying disclosure database using efficient clustering techniques","authors":"Rajan Kumar Kharel, Niju Shrestha, Chengcui Zhang, G. Savage, Ariel D. Smith","doi":"10.1145/2638404.2638506","DOIUrl":"https://doi.org/10.1145/2638404.2638506","url":null,"abstract":"A fuzzy-matching clustering algorithm is applied to clustering similar client names in the lobbying Disclosure Database. Due to errors and inconsistencies in manual typing, the name of a client often has multiple representations including erroneously spelled names and sometimes shorthand forms, presenting difficulties in associating lobbying activities and interests with one single client. Therefore, there is a need to consolidate various forms of names of the same client into one group/cluster. For efficient clustering, we applied a series of preprocessing techniques before calculating the string distance between two client names. An optimized threshold selection has been adopted, which helps improve clustering accuracy. A single linkage hierarchical clustering technique has been introduced to cluster the client names. The algorithm proves to be effective in clustering similar client names. It also helps to find the representative name for a particular client cluster.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74613028","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}
{"title":"Cloud services for e-learning","authors":"M. Ketel","doi":"10.1145/2638404.2638504","DOIUrl":"https://doi.org/10.1145/2638404.2638504","url":null,"abstract":"Cloud computing is growing rapidly in almost every sector including education. Many educational institutions do not have the ability to maintain the resources and/or infrastructures required to run e-learning systems and are looking for cloud based solutions. This paper introduces the benefits and limitations of cloud based e-learning.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"12 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90464995","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}
{"title":"A programming language for implementing computational models","authors":"José M. Garrido","doi":"10.1145/2638404.2638488","DOIUrl":"https://doi.org/10.1145/2638404.2638488","url":null,"abstract":"The Scientific Computation Language (SCL) was designed mainly for developing computational models in education and research. This paper presents the justification for such a language, its relevant features, and a case study of a computational model implemented with the SCL. Development of the SCL language is part of the OOPsim project, which has had partial NSF support (CPATH). One of the goals of this project is to develop tools and approaches for designing and implementing computational models, emphasizing multi-disciplinary teams in the development process. A computational model is a computer implementation of the solution to a (scientific) problem for which a mathematical representation has been formulated. Developing a computational model consists of applying Computer Science concepts, principles and methods. The language syntax is defined at a higher level of abstraction than C, and includes language statements for improving program readability, debugging, maintenance, and correctness. The language design was influenced by Ada, Pascal, Eiffel, Java, C, and C++. The keywords have been added to maintain full compatibility with C. The SCL language translator is an executable program that is implemented as a one-pass language processor that generates C source code. The generated code can be integrated conveniently with any C and/or C++ library, on Linux and Windows (and MacOS). The semantics of SCL is informally defined to be the same C semantics.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"29 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87172517","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}
{"title":"A framework for teaching centralized and decentralized peer-to-peer programming paradigms in introductory computer science courses","authors":"A. Shaw","doi":"10.1145/2638404.2638515","DOIUrl":"https://doi.org/10.1145/2638404.2638515","url":null,"abstract":"Among today's population of students, many are very familiar with peer-to-peer (P2P) programming applications. The concept of programs that communicate over a network with other programs written by other programmers using a shared protocol is easily understood and appreciated by students in introductory computer science (CS) courses, but developing this type of software is usually beyond the scope of the skill sets students are taught in those courses. However, we have developed a P2P library framework that is presented in this paper that allows students to develop the type of centralized and decentralized peer-to-peer applications in CS1 and CS2 courses that are important parts of the growing cyberculture of which most of today's students are members.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"173 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85564763","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}