{"title":"The role of formative usability evaluation in the user-centered website design process","authors":"NyEsha Robinson","doi":"10.1145/1347787.1347810","DOIUrl":"https://doi.org/10.1145/1347787.1347810","url":null,"abstract":"A Usability Evaluation study was conducted to identify problems and recommendations for improvement for the VT ISE Department website in the context of the User-Centered Design Process. The usability testing consisted of two phases: experts evaluating the website under Neilson’s ten heuristics, and ordinary VT users testing the site for the same issues. Each non-expert participant was given general instructions and a presurvey of their demographics and level of Internet experience. The participants were observed during testing and given a post-survey interview to gather additional feedback. The results of this study and a future research discussion are presented. Copyright is held by author/owner(s) Tapia'07, October 14-17, 2007, Lake Buena Vista, Florida, USA ACM 978-1-59593-866-4/07/0010","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130436096","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}
C. Soares, George Page, Jonathan MacDonald, Sanjeev Baskiyar, J. Hamilton, G. Dozier
{"title":"Bowl championship series vulnerability analysis","authors":"C. Soares, George Page, Jonathan MacDonald, Sanjeev Baskiyar, J. Hamilton, G. Dozier","doi":"10.1145/1347787.1347794","DOIUrl":"https://doi.org/10.1145/1347787.1347794","url":null,"abstract":"The Bowl Championship Series (BCS) is the system used to select the top two college football teams to play in a championship game at the end of a season. During the nine seasons played under the BCS, few have not caused considerable debate and controversy. We believe that an analysis of the BCS and its components is therefore required. This work uses a GRNN to model the eight polls that compose the ranking system of the BCS. Then, a genetic algorithm (GA) is used to evolve season schedules that would perform poorly under the current BCS. These difficult seasons are then analyzed to highlight weaknesses in the current model.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128811404","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":"Evaluation of IEEE 754 floating-point arithmetic compliance across a wide range of heterogeneous computers","authors":"Guillermo A. Lopez, M. Taufer, P. Teller","doi":"10.1145/1347787.1347793","DOIUrl":"https://doi.org/10.1145/1347787.1347793","url":null,"abstract":"Scientific applications rely heavily on floating-point arithmetic and, therefore, are affected by the precision and implementation of floating-point operations. Although the computers we use are IEEE compliant, this only assures the same representation of floating-point numbers; it does not guarantee that floating-point operations will be performed in the same way on all computers. As a result the same program run on different computers may yield different results. This paper is a first step in understanding the reason for this, in particular, different results for the execution of the application Charmm on different computers. We report on our use of a well-known test suite, IeeeCC754, to evaluate IEEE 754 compliance across a wide range of heterogeneous computers with different architectures, operating systems, precisions, and compilers.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"3 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131436494","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":"Distributed calibration and tracking with low-power image sensors","authors":"Teresa H. Ko, N. Berry","doi":"10.1145/1095242.1095260","DOIUrl":"https://doi.org/10.1145/1095242.1095260","url":null,"abstract":"The replication of a single-camera system is not in itself a solution to large scale surveillance. A scalable solution to surveillance can be achieved through employing wireless sensor network technology where distributed sensors embedded with processors communicate wirelessly. To address the constraints of unreliable communications, power-intensive processing and communications, and limited memory, DISCERN (DIStributed Camera Event Recognition Network) distributes reasoning about its organization and detected target information. This enables sensor nodes to collaborate intelligently with one another, forewarning neighboring nodes of possible targets, resolving location ambiguities of the sensor and target, and providing greater intelligence as additional target data is collected. We addressed the limited power and processing speed by incorporating low-power image processing techniques to quickly reduce the large data acquired through images. Robustness was maintained through decision-based fusion for target detection and data-based fusion for target extraction and tracking across the sensor field. Distributed control is possible through our information-based neighbor lists, facilitating the transformation of the target's information across sensor nodes as it traverses to the end user.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115806443","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":"Firefighter command training virtual environment","authors":"Tazama U. St. Julien, Chris Shaw","doi":"10.1145/948542.948549","DOIUrl":"https://doi.org/10.1145/948542.948549","url":null,"abstract":"The Firefighter Command Training Virtual Environment is being developed at Georgia Tech in collaboration with the Atlanta Fire Department. The VE allows the user to: navigate around the environment, viewing a house on fire from any angle; command firefighters and watch them execute those commands; and see realistic fire and smoke behavior reacting to changes in the environment. The VE user is a commanding officer trainee who instructs teams of virtual firefighters to perform different actions to help put out virtual fires. The correct sequence of commands will successfully extinguish the flame with the least amount of danger to the firefighters and the least amount of damage to the home. This simulation was developed using the Simple Virtual Environment (SVE) library, an extensible framework for building VE applications. This is the first example of a firefighter training environment that combines representations of animated firefighters with a reasonable simulation and animation of smoke and fire.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122383583","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":"The Comparison of two Signaling Protocols for the Wireless","authors":"A. Burrell, P. Papantoni-Kazakos","doi":"10.1145/948542.948557","DOIUrl":"https://doi.org/10.1145/948542.948557","url":null,"abstract":"In the wireless environment, the two major stages in the communication between any two users are signaling and transmission. At the signaling stage, the users are not well known to the system, a fact that necessitates the deployment of a Random Access Protocol. The signaling protocol deployed by current wireless systems is ALOHA based and is similar to the currently deployed Ethernet Protocol.In this paper, we compare the performance of the Ethernet Protocol with that of the 2- Cell Limited Sensing Algorithm, when both deployed as the signaling protocol in the Wireless environment. In contrast to the Ethernet Protocol, the 2-Cell Algorithm is Stable. The superiority of the latter algorithm is clearly shown, in terms of induced delays as well as in terms of rejection rates in the presence of admission delay constraints.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115421486","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 hard-constraint time-stepping approach for rigid multibody dynamics with joints, contact, and friction","authors":"G. D. Hart, M. Anitescu","doi":"10.1145/948542.948550","DOIUrl":"https://doi.org/10.1145/948542.948550","url":null,"abstract":"We present a method for simulating rigid multibody dynamics with joints, contact, and friction. In this work, the nonsmooth contact and frictional constraints are represented by hard constraints. The method requires the solution of only one linear complementarity problem per step and can progress at much larger time steps than explicit penalty methods, which are currently the method of choice for most of these simulations.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114756487","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":"On the development of a trust region interior-point method for large scale nonlinear programs","authors":"M. Argáez, L. Velázquez, C. Villalobos","doi":"10.1145/948542.948546","DOIUrl":"https://doi.org/10.1145/948542.948546","url":null,"abstract":"The focus of this paper is to present a new methodology for solving general nonlinear programs. We propose the use of interior-point methodology, trust-region globalization strategies, and conjugate gradient method to find a solution to large scale problems.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124973281","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":"BuzzMaps: a prototype social proxy for predictive utility","authors":"A. C. Jarrett, B. Dennis","doi":"10.1145/948542.948547","DOIUrl":"https://doi.org/10.1145/948542.948547","url":null,"abstract":"The design of BuzzMaps, social proxies within Magic Bookshelves, is presented. As defined by Erickson and Kellogg, a social proxy is a minimalist graphical representation of salient social activity. Each BuzzMap is intended to increase predictive utility, the ability of the user to predict the relevance of an item before consumption.A Magic Bookshelf is a collaborative application for collecting news items, capturing social activity, and enabling social translucence. Magic Bookshelves are also places where recommendation systems can leave their findings. The goal of Magic Bookshelves is to flow more news items of more interest to a group of users.The major points of the design are the selection of salient social activities for predictive utility, the conceptual design of a social proxy to present these activities, and implementation of the proxy as a visual design. This work is novel in specifically targeting predictive utility through a social proxy.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129569749","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":"The disputed federalist papers: SVM feature selection via concave minimization","authors":"Glenn Fung","doi":"10.1145/948542.948551","DOIUrl":"https://doi.org/10.1145/948542.948551","url":null,"abstract":"In this paper, we use a method proposed by Bradley and Mangasarian \"Feature Selection via Concave Minimization and Support Vector Machines\" to solve the well-known disputed Federalist Papers classification problem. We find a separating plane that classifies correctly all the \"training set\" papers of known authorship, based on the relative frequencies of only three words. Using the obtained separating hyperplane in three dimensions, all of the 12 disputed papers ended up on the Madison side of the separating plane. This result coincides with previous work on this problem using other classification techniques.","PeriodicalId":326471,"journal":{"name":"Richard Tapia Celebration of Diversity in Computing Conference","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129190534","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}