Other Computer Sciences Commons^™

Review: Steve: The Art Museum Social Tagging Project., Mark Mcbride

Mark F McBride

The Steve Museum is a social tagging project created by volunteers from art museums and galleries. The main goal is to create user generated descriptions for works of art, because we all view, experience, and describe art differently.

The Structure Of Games, David Michael Kaiser

FIU Electronic Theses and Dissertations

Computer Game Playing has been an active area of research since Samuel’s first Checkers player (Samuel 1959). Recently interest beyond the classic games of Chess and Checkers has led to competitions such as the General Game Playing competition, in which players have no beforehand knowledge of the games they are to play, and the Computer Poker Competition which force players to reason about imperfect information under conditions of uncertainty. The purpose of this dissertation is to explore the area of General Game Playing both specifically and generally. On the specific side, we describe the design and implementation of our General …

Back-Up Server For Computer Science Department, Victoria Gaylord

Mahurin Honors College Capstone Experience/Thesis Projects

Because Western Kentucky University does not maintain a back-up system for its departments, the Computer Science Department has implemented its own. Using Bacula software on a Unix server, files from faculty desktop computers and servers are backed up to a tape drive on a daily basis. The server is protected from outside threats with a carefully configured firewall script. This paper explains how both the firewall and the back-up software were implemented and how successful that implementation has been.

Product Complexity: A Definition And Impacts On Operations, Mark A. Jacobs

MIS/OM/DS Faculty Publications

The difficulty for organizations arises because neither complexity nor its impacts on performance are well understood (Fisher & Ittner, 1999b). The mechanisms through which it affects cost, quality, delivery, and flexibility need to be explained (Ramdas, 2003). However, this cannot happen until complexity can be explained theoretically. But, to build theory there must first be a common understanding about the construct of interest (Wacker, 2004). Only then can researchers operationalize it and search for meaningful relationships. In light of this, I develop a definition of complexity below. A sampling of the operations management literature is then presented within the context …

Mining Web-Functional Dependencies For Flexible Information Access, Saverio Perugini, Naren Ramakrishnan

Computer Science Faculty Publications

We present an approach to enhancing information access through Web structure mining in contrast to traditional approaches involving usage mining. Specifically, we mine the hardwired hierarchical hyperlink structure of Web sites to identify patterns of term-term co-occurrences we call Web functional dependencies (FDs). Intuitively, a Web FD ‘x y’ declares that all paths through a site involving a hyperlink labeled x also contain a hyperlink labeled y. The complete set of FDs satisfied by a site help characterize (flexible and expressive) interaction paradigms supported by a site, where a paradigm is the set of explorable sequences therein. …

A Model For Managing Decision-Making Information In The Gig-Enabled Battlespace, Samuel D. Bass, Rusty O. Baldwin

Computer Science Faculty Publications

The Defense Department is transforming information-technology systems into a Global Information Grid (GIG) that will connect sensors to weapons systems and provide unprecedented situational awareness. The authors suggest that if not properly implemented, the GIG may overwhelm war fighters with information presented at the wrong time, at the wrong level of detail, and without proper analysis. This article proposes a model to direct the flow of information in the GIG.

Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov

Computer Science Faculty Publications

Existing methods of measuring lifetimes in P2P systems usually rely on the so-called create-based method (CBM), which divides a given observation window into two halves and samples users "created" in the first half every Delta time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we flrst derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent …

On Node Isolation Under Churn In Unstructured P2p Networks With Heavy-Tailed Lifetimes, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov

Computer Science Faculty Publications

Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-selection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared to uniform selection of neighbors. In fact, the second strategy based on random walks on age-weighted graphs demonstrates that for lifetimes with infinite variance, the system …

University Of Rhode Island Neasc Self-Study 2007. Standard Seven: Library And Other Information Resources

Collection Development Reports and Documents

Self-Study report by the University of Rhode Island, prepared in fall 2006 for the 2006/07 accreditation visit of the New England Association of Schools and Colleges (NEASC). Included here is Standard Seven: Library and Other Information Resources.

This standard was prepared by Standard Seven Committee Chair Karen M. Ramsay, Associate Professor and Chair of the Department of Technical Services in the University Libraries. Also on the Standard Seven Committee were: Lisa DiPippo, Associate Professor, Department of Computer Science & Statistics; Karol Leuzarder, Senior Tech Programmer, TOPS; Mary MacDonald, Associate Professor, University Libraries; David Eifler, Graduate Student; Jim Loy, Professor, Anthropology; …

A Study Of Out-Of-Turn Interaction In Menu-Based, Ivr, Voicemail Systems, Saverio Perugini, Taylor J. Anderson, William F. Moroney

Computer Science Faculty Publications

We present the first user study of out-of-turn interaction in menu-based, interactive voice-response systems. Out-ofturn interaction is a technique which empowers the user (unable to respond to the current prompt) to take the conversational initiative by supplying information that is currently unsolicited, but expected later in the dialog. The technique permits the user to circumvent any flows of navigation hardwired into the design and navigate the menus in a manner which reflects their model of the task. We conducted a laboratory experiment to measure the effect of the use of outof- turn interaction on user performance and preference in a …

Some Peer-To-Peer, Democratically And Voluntarily Produced Thoughts About 'The Wealth Of Networks: How Social Production Transforms Markets And Freedom,' By Yochai Benkler, Ann Bartow

Law Faculty Scholarship

In this review essay, Bartow concludes that The Wealth of Networks: How Social Production Transforms Markets and Freedom by Yochai Benkler is a book well worth reading, but that Benkler still has a bit more work to do before his Grand Unifying Theory of Life, The Internet, and Everything is satisfactorily complete. It isn't enough to concede that the Internet won't benefit everyone. He needs to more thoroughly consider the ways in which the lives of poor people actually worsen when previously accessible information, goods and services are rendered less convenient or completely unattainable by their migration online. Additionally, the …

Proe: Pseudo Random Optimized Encryption, Louis J. Ricci

Honors Projects

Examines the development and testing of the PROE encryption algorithm, including design decisions ensuring security and speed. Demonstrates implementation in the x86-64 assembler.

It Sharps: Issues Relating To Securely Disposing Of Hard Disks From Medical Information Systems, Craig Valli

Research outputs pre 2011

Organisations worldwide are failing to adequately erase data from hard disks before disposing of them. Recent studies have uncovered significant and highly confidential data from computer hard disks for sale in the second hand market using minimal foresic recovery techniques. Increasingly medical businesses are being required to use IT based systems to deliver or receive services. Also medical records are becoming electronic in nature and have significant secondary storage requirements. Given the increased use of IT in medical practice this paper examines the issues uncovered in the studies into recovery of remnant data from hard disks. The paper also explores …

Triangulation Based Static Wide Angle Laser Scanning For Obstacle Detection, Kaveh Sahba, Kamal Alameh, Clifton Smith

Research outputs pre 2011

This paper demonstrates discrete laser spot projection over a wide angle using a novel cylindrical quasi-cavity waveguide, with no moving parts. Furthermore, the distance to each spot is calculated using active laser triangulation. The triangulation arrangement and the trajectory of principal rays are modelled using a system of linear equations based on optical geometry. Linear algebra is used to derive the unique baseline and outgoing angle of every projected beam. The system is calibrated by finding optimal values for uncertain instrumental parameters using constrained non-linear optimization. Distances calculated indoors result in accuracies of over 93%

Pi-Calculus In Logical Form, Marcello M. Bonsangue, Alexander Kurz

Engineering Faculty Articles and Research

Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is done by defining a logical counterpart of categorical constructions including dynamic name allocation and name exponentiation, and showing that they are dual to standard constructs in functor categories. We show that initial algebras of functors defined in terms of these constructs give rise to a logic that is sound, complete, and characterises bisimilarity. The approach is modular, and we apply it to derive a logical formulation of pi-calculus. The resulting logic is a …

Unwired: Student Use Of Technology In The Ubiquitous Computing World, Mike Degagne

Undergraduate Review

No abstract provided.

Factors Affecting One-Way Hashing Of Cd-R Media, Christopher Marberry, Philip Craiger

J. Philip Craiger, Ph.D.