ACM-SE '12Pub Date : 2012-03-29DOI: 10.1145/2184512.2184550
Susan Hammond, D. Umphress
{"title":"Test driven development: the state of the practice","authors":"Susan Hammond, D. Umphress","doi":"10.1145/2184512.2184550","DOIUrl":"https://doi.org/10.1145/2184512.2184550","url":null,"abstract":"Test-Driven Development has been a practice used primarily in agile software development circles for a little more than a decade now. In software development circles, this is a relatively young and immature practice. How much acceptance has it gained it its short life span? What do we know about its effectiveness? This paper will explore these topics.","PeriodicalId":306869,"journal":{"name":"ACM-SE '12","volume":"73 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116633454","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}
ACM-SE '12Pub Date : 2012-03-29DOI: 10.1145/2184512.2184605
A. Saad, Ryan M. Kroutil
{"title":"Hands-on learning of programming concepts using robotics for middle and high school students","authors":"A. Saad, Ryan M. Kroutil","doi":"10.1145/2184512.2184605","DOIUrl":"https://doi.org/10.1145/2184512.2184605","url":null,"abstract":"In this paper we present our experiences over the past year on developing educational materials for computing using robotics and their effectiveness for middle and high school students. Though there are likely many factors contributing to recently observed declines in undergraduate enrollment in computer related fields, student attitudes towards the field may play a significant role. A multifaceted approach using educational robots to introduce programming concepts to middle and high school students was developed as one technique to address this issue. The initiative included a teacher workshop to prepare local area educators to deliver computing concepts to their students and the development of associated educational materials to aid in student learning. The project culminated with a Robotics Programming Competition and Showcase in which the participating students demonstrated what they had learned. Results from surveys administered during the showcase indicated that the initiative was successful in improving student attitudes towards computer science, especially regarding confidence and intent to persist in the field, and provided useful information towards future program refinement.","PeriodicalId":306869,"journal":{"name":"ACM-SE '12","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127261556","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}
ACM-SE '12Pub Date : 2012-03-29DOI: 10.1145/2184512.2184531
M. House
{"title":"Fuzzy logic-based democracy index","authors":"M. House","doi":"10.1145/2184512.2184531","DOIUrl":"https://doi.org/10.1145/2184512.2184531","url":null,"abstract":"In this project, the researcher aims to use the knowledge of experts on the components of a consolidated democratic government in order to produce a system that specified the degree to which countries function as true democracies. Fuzzy logic can assist in this endeavor because political science is largely subjective and often demands the use of uncertain terms in describing events in international relations. Such an index would be a beneficial reference tool for individuals in the political arena. For politicians trying to gain a deeper understanding of global issues, knowledge of the impact and function of the relevant governments is essential. In an internal conflict, the rankings within this study may provide insight into the motivations and reasons for the contention. They could even possibly be used to predict controversies, such as when the freedoms that a government advertises or that the people want do not match the reality within a state. States striving for democracy would also be able to see areas where improvement is needed or to make sure that efforts to progress are having effect. Overall, this paper proposes a useful application of fuzzy logic for grading democratization within countries based on expert knowledge and the political histories of a variety of states.","PeriodicalId":306869,"journal":{"name":"ACM-SE '12","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124980505","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}
ACM-SE '12Pub Date : 2012-03-29DOI: 10.1145/2184512.2184575
D. Serfass, P. Tang
{"title":"Comparing parallel performance of Go and C++ TBB on a direct acyclic task graph using a dynamic programming problem","authors":"D. Serfass, P. Tang","doi":"10.1145/2184512.2184575","DOIUrl":"https://doi.org/10.1145/2184512.2184575","url":null,"abstract":"Concurrent programming languages Go and C++ Threading Building Blocks (TBB) offer high level parallel programming mechanisms built on top of threads. Go goroutines and TBB task classes are used as the computation units that are mapped to physical threads on multi-core processors. The synchronization mechanisms in Go and TBB are the channel and the task scheduler, respectively. We utilized these mechanisms to implement a parallel version of the optimal binary search tree dynamic programming algorithm in Go and TBB. Both implementations tile the iteration space and construct and evaluate a direct acyclic task graph for optimal parallelism without over constraints. We compared Go and TBB speedup and performance to create a benchmark of how efficient these two languages are at evaluating a direct acyclic task graph. Our experimental results show that the overhead of task scheduling and synchronization in TBB is much smaller than Go and that the overall performance of TBB is 1.6 to 3.6 times faster than Go. TBB provided super linear speedup under certain conditions, which we attribute to the majority of the test data being cached and the negative cost of task scheduling and synchronization. We conclude that TBB task scheduling and synchronization is faster than Go and that the top speedup of TBB is greater than that of Go.","PeriodicalId":306869,"journal":{"name":"ACM-SE '12","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125047183","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}
ACM-SE '12Pub Date : 2012-03-29DOI: 10.1145/2184512.2184612
C. Clements, Adam Hodges, Zach Welch
{"title":"PBJ: a Gnutella inspired file sharing system","authors":"C. Clements, Adam Hodges, Zach Welch","doi":"10.1145/2184512.2184612","DOIUrl":"https://doi.org/10.1145/2184512.2184612","url":null,"abstract":"We present PBJ a Gnutella inspired file sharing system developed as an undergraduate project during the Clemson course on distributed computing. The goal of the project was to investigate challenges in distributed system design such as bootstrapping, scalability and complexity of the search process. PBJ is novel in that it marries the positive aspects of centralized and decentralized P2P design paradigms.","PeriodicalId":306869,"journal":{"name":"ACM-SE '12","volume":"18 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123598222","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}
ACM-SE '12Pub Date : 2012-03-29DOI: 10.1145/2184512.2184563
Erich A. Peterson, P. Tang
{"title":"Fast approximation of probabilistic frequent closed itemsets","authors":"Erich A. Peterson, P. Tang","doi":"10.1145/2184512.2184563","DOIUrl":"https://doi.org/10.1145/2184512.2184563","url":null,"abstract":"In recent years, the concept of and algorithm for mining probabilistic frequent itemsets (PFIs) in uncertain databases, based on possible worlds semantics and a dynamic programming approach for frequency calculations, has been proposed. The frequentness of a given itemset in this scheme can be characterized by the Poisson binomial distribution. Further and more recently, others have extended those concepts to mine for probabilistic frequent closed itemsets (PFCIs), in an attempt to reduce the number and redundancy of output. In addition, work has been done to accelerate the computation of PFIs through approximation, to mine approximate probabilistic frequent itemsets (A-PFIs), based on the fact that the Poisson distribution can closely approximate the Poisson binomial distribution---especially when the size of the database is large. In this paper, we introduce the concept of and an algorithm for mining approximate probabilistic frequent closed itemsets (A-PFCIs). A new mining algorithm for mining such concepts is introduced and called A-PFCIM. It is shown through an experimental evaluation that mining for A-PFCIs can be orders of magnitude faster than mining for traditional PFCIs.","PeriodicalId":306869,"journal":{"name":"ACM-SE '12","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126943234","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}
ACM-SE '12Pub Date : 2012-03-29DOI: 10.1145/2184512.2184524
Deborah S. Hughes
{"title":"Introducing programming logic in a one-credit course","authors":"Deborah S. Hughes","doi":"10.1145/2184512.2184524","DOIUrl":"https://doi.org/10.1145/2184512.2184524","url":null,"abstract":"Deciding on the best approach to introduce non-CS students to programming logic in a one-credit course can be a formidable task. Due to time constraints, it is essential that the curriculum content, as well as the programming tools of choice, be planned and chosen with great care. This paper will present three diverse approaches to creating an introduction to programming logic course and will suggest recommendations for best practices.","PeriodicalId":306869,"journal":{"name":"ACM-SE '12","volume":"136 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128726524","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}
ACM-SE '12Pub Date : 2012-03-29DOI: 10.1145/2184512.2184522
Monica Mcgill, Amber Settle
{"title":"Institutional support for computing faculty research productivity: does gender matter?","authors":"Monica Mcgill, Amber Settle","doi":"10.1145/2184512.2184522","DOIUrl":"https://doi.org/10.1145/2184512.2184522","url":null,"abstract":"We address the question of how male and female computing faculty in the U. S. and Canada perceive research requirements and institutional support for promotion and tenure. Via a survey sent to approximately 7500 computing faculty at the 256 institutions that participate in the annual Taulbee Survey, our results identify differences in reported tenure and promotion requirements, including the number of publications required during the probationary period, the importance of the scope of publication venues, the importance of publishing in non-refereed journals, and the importance of collaborative presentations. Differences were also discovered in institutional support and the satisfaction levels with that support. The study finds that some misperceptions may exist about promotion and tenure requirements among female faculty while at the same time female faculty feel more supported by their institutions.","PeriodicalId":306869,"journal":{"name":"ACM-SE '12","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123629912","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}
ACM-SE '12Pub Date : 2012-03-29DOI: 10.1145/2184512.2184574
William M. Jones, J. Daly, Nathan Debardeleben
{"title":"Application monitoring and checkpointing in HPC: looking towards exascale systems","authors":"William M. Jones, J. Daly, Nathan Debardeleben","doi":"10.1145/2184512.2184574","DOIUrl":"https://doi.org/10.1145/2184512.2184574","url":null,"abstract":"As computational cluster computers rapidly grow in both size and complexity, system reliability and, in particular, application resilience have become increasingly important factors to consider in maintaining efficiency and providing improved compute performance over predecessor systems. One commonly used mechanism for providing application fault tolerance in parallel systems is the use of checkpointing.\u0000 We demonstrate the impact of sub-optimal checkpoint intervals on application efficiency via simulation with real workload data. We find that application efficiency is relatively insensitive to error in estimation of an application's mean time to interrupt (AMTTI), a parameter central to calculating the optimal checkpoint interval. This result corroborates the trends predicted by previous analytical models. We also find that erring on the side of overestimation may be preferable to underestimation.\u0000 We further discuss how application monitoring and resilience frameworks can benefit from this insensitivity to error in AMTTI estimates. Finally, we discuss the importance of application monitoring at exascale and conclude with a discussion of challenges faced in the use of checkpointing at such extreme scales.","PeriodicalId":306869,"journal":{"name":"ACM-SE '12","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131428503","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}
ACM-SE '12Pub Date : 2012-03-29DOI: 10.1145/2184512.2184528
Victor Chen, Teng-Sheng Moh, D. Moh
{"title":"Improving molecular fingerprint similarity via enhanced folding","authors":"Victor Chen, Teng-Sheng Moh, D. Moh","doi":"10.1145/2184512.2184528","DOIUrl":"https://doi.org/10.1145/2184512.2184528","url":null,"abstract":"Drug discovery depends on scientists finding compounds with molecular fingerprints similar to the target drug, or pharmacophore. A new way of improving the accuracy of molecular fingerprint folding is presented. The goal is to alleviate the growing challenge of excessively long fingerprints. This improved method generates a new shorter fingerprint that is more accurate than the basic folded fingerprint. Information gathered during preprocessing is used to determine an optimal attribute order. The most commonly used blocks of bits can then be organized and used to generate a new improved fingerprint for more optimal folding. The authors then applied the widely used Tanimoto similarity search algorithm to benchmark the results. The authors showed an improvement in the final results using this method to generate an improved fingerprint compared to other traditional folding methods.","PeriodicalId":306869,"journal":{"name":"ACM-SE '12","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133425918","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}