Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Brigham Young University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 331 - 360 of 823

Full-Text Articles in Computer Sciences

Proofs Of Correctness For Three Decentralized Authentication Protocols Using Strand Spaces, Pavan Kumar Vankamamidi May 2011

Proofs Of Correctness For Three Decentralized Authentication Protocols Using Strand Spaces, Pavan Kumar Vankamamidi

Theses and Dissertations

Security is a major concern is today's online world. As online activities become increasingly sensitive, service providers rely on security protocols to ensure confidentiality, integrity and authentication of their users and data. Greater assurance is provided when these protocols are verified to be correct. Strand Spaces is a method to formally analyze security protocols. The arguments are based on the messages being transmitted and received while assuming that the underlying cryptographic primitives are secure. This thesis demonstrates that the protocols Luau, pwdArmor and Kiwi are secure using Strand Spaces methodology.


Social Capital In Online Communities, Matthew Scott Smith May 2011

Social Capital In Online Communities, Matthew Scott Smith

Theses and Dissertations

Social capital is the value of the relationships we create and maintain within our social networks to gain access to and mobilize needed resources (e.g., jobs, moral support). Quantifying, and subsequently leveraging, social capital are challenging problems in the social sciences. Most work so far has focused on analyses from static surveys of limited numbers of participants. The explosion of online social media means that it is now possible to collect rich data about people's connections and interactions, in a completely ubiquitous, non-intrusive manner. Such dynamic social data opens the door to the more accurate measuring and tracking of social …


Accelerated Large-Scale Multiple Sequence Alignment With Reconfigurable Computing, G Scott Lloyd May 2011

Accelerated Large-Scale Multiple Sequence Alignment With Reconfigurable Computing, G Scott Lloyd

Theses and Dissertations

Multiple Sequence Alignment (MSA) is a fundamental analysis method used in bioinformatics and many comparative genomic applications. The time to compute an optimal MSA grows exponentially with respect to the number of sequences. Consequently, producing timely results on large problems requires more efficient algorithms and the use of parallel computing resources. Reconfigurable computing hardware provides one approach to the acceleration of biological sequence alignment. Other acceleration methods typically encounter scaling problems that arise from the overhead of inter-process communication and from the lack of parallelism. Reconfigurable computing allows a greater scale of parallelism with many custom processing elements that have …


Coherent Turbulence: Synthesizing Tree Motion In The Wind Using Cfd And Noise, Anthony Frank Selino May 2011

Coherent Turbulence: Synthesizing Tree Motion In The Wind Using Cfd And Noise, Anthony Frank Selino

Theses and Dissertations

Animating trees in wind has long been a problem in computer graphics. Progress on this problem is important for both visual effects and biomechanics and may inform future work on two-way coupling between turbulent flows and deformable objects. Synthetic turbulence added to a coarse fluid simulation has been used to produce convincing animations of turbulent flows, but only considers one-way coupling between fluid and solid. We produce accurate animations of tree motion by creating a two-way coupling between synthetic turbulence and semipermeable proxy geometry. The resulting animations exhibit global wind sheltering effects and branch tips have motion paths which match …


A Speculative Approach To Parallelization In Particle Swarm Optimization, Matthew J. Gardner Apr 2011

A Speculative Approach To Parallelization In Particle Swarm Optimization, Matthew J. Gardner

Theses and Dissertations

Particle swarm optimization (PSO) has previously been parallelized primarily by distributing the computation corresponding to particles across multiple processors. In this thesis we present a speculative approach to the parallelization of PSO that we refer to as SEPSO. In our approach, we refactor PSO such that the computation needed for iteration t+1 can be done concurrently with the computation needed for iteration t. Thus we can perform two iterations of PSO at once. Even with some amount of wasted computation, we show that this approach to parallelization in PSO often outperforms the standard parallelization of simply adding particles to the …


Outdoor Scenes For Data Visualization, Benjamin A. Hillery Apr 2011

Outdoor Scenes For Data Visualization, Benjamin A. Hillery

Theses and Dissertations

Recent cognitive research indicates that the human brain possesses special abilities for processing information relating to outdoor scenes. Simulated outdoor scenes are presented as an effective method of displaying higher dimensional data in an efficient and comprehensible manner. We demonstrate novel methods of using outdoor objects and scenes to display multidimensional content in a way that that is intuitive for humans to understand, and to exploit various cues commonly found in scenes from the natural world to communicate the values of multiple variables.


Easy To Find: Creating Query-Based Multi-Document Summaries To Enhance Web Search, Rani Majed Qumsiyeh Mar 2011

Easy To Find: Creating Query-Based Multi-Document Summaries To Enhance Web Search, Rani Majed Qumsiyeh

Theses and Dissertations

Current web search engines, such as Google, Yahoo!, and Bing, rank the set of documents S retrieved in response to a user query Q and display each document with a title and a snippet, which serves as an abstract of the corresponding document in S. Snippets, however, are not as useful as they are designed for, i.e., to assist search engine users to quickly identify results of interest, if they exist, without browsing through the documents in S, since they (i) often include very similar information and (ii) do not capture the main content of the corresponding documents. …


Programming Language Fragmentation And Developer Productivity: An Empirical Study, Jonathan L. Krein Feb 2011

Programming Language Fragmentation And Developer Productivity: An Empirical Study, Jonathan L. Krein

Theses and Dissertations

In an effort to increase both the quality of software applications and the efficiency with which applications can be written, developers often incorporate multiple programming languages into software projects. Although language specialization arguably introduces benefits, the total impact of the resulting language fragmentation (working concurrently in multiple programming languages) on developer performance is unclear. For instance, developers may solve problems more efficiently when they have multiple language paradigms at their disposal. However, the overhead of maintaining efficiency in more than one language may outweigh those benefits. This thesis represents a first step toward understanding the relationship between language fragmentation and …


Relationships Among Learning Algorithms And Tasks, Jun Won Lee Jan 2011

Relationships Among Learning Algorithms And Tasks, Jun Won Lee

Theses and Dissertations

Metalearning aims to obtain knowledge of the relationship between the mechanism of learning and the concrete contexts in which that mechanisms is applicable. As new mechanisms of learning are continually added to the pool of learning algorithms, the chances of encountering behavior similarity among algorithms are increased. Understanding the relationships among algorithms and the interactions between algorithms and tasks help to narrow down the space of algorithms to search for a given learning task. In addition, this process helps to disclose factors contributing to the similar behavior of different algorithms. We first study general characteristics of learning tasks and their …


Parallel Particle Swarm Optimization And Large Swarms, Andrew W. Mcnabb Jan 2011

Parallel Particle Swarm Optimization And Large Swarms, Andrew W. Mcnabb

Theses and Dissertations

Optimization is the search for the maximum or minimum of a given objective function. Particle Swarm Optimization (PSO) is a simple and effective evolutionary algorithm, but it may take hours or days to optimize difficult objective functions which are deceptive or expensive. Deceptive functions may be highly multimodal and multidimensional, and PSO requires extensive exploration to avoid being trapped in local optima. Expensive functions, whose computational complexity may arise from dependence on detailed simulations or large datasets, take a long time to evaluate. For deceptive or expensive objective functions, PSO must be parallelized to use multiprocessor systems and clusters efficiently. …


A Reusable Persistence Framework For Replicating Empirical Studies On Data From Open Source Repositories, Scott Bong-Soo Chun Dec 2010

A Reusable Persistence Framework For Replicating Empirical Studies On Data From Open Source Repositories, Scott Bong-Soo Chun

Theses and Dissertations

Empirical research is inexact and error-prone leading researchers to agree that replication of experiments is a necessary step to validating empirical results. Unfortunately, replicating experiments requires substantial investments in manpower and time. These resource requirements can be reduced by incorporating component reuse when building tools for empirical experimentation. Bokeo is an initiative within the Sequoia Lab of the BYU Computer Science Department to develop a platform to assist in the empirical study of software engineering. The i3Persistence Framework is a component of Bokeo which enables researchers to easily build and rapidly deploy tools for empirical experiments by providing an easy-to-use …


Capture And Access Of Multiple Screen Presentations, Kelv H. Cutler Dec 2010

Capture And Access Of Multiple Screen Presentations, Kelv H. Cutler

Theses and Dissertations

Knowledge transferred during meetings is often ephemeral in nature and thus must be captured if it is to be retained. Ideally, a capture solution should be able to 1) accommodate any number of screens without sacrificing image quality and 2) allow dynamic access to a complete media capture while the capture is taking place. Both students and employees can benefit from the information captured during the lectures and meetings for enhanced discussion and afterward for knowledge retention. Current systems do not support multiple screen capture well, and no system supports dynamic access to the active meeting capture during the meeting. …


Trusted Mobile Overlays, Robert Scott Robertson Dec 2010

Trusted Mobile Overlays, Robert Scott Robertson

Theses and Dissertations

Sensitive information is increasingly moving online and as data moves further from the control of its owner, there are increased opportunities for it to fall into malicious hands. The Web is comprised of three untrusted components where there is a risk of information compromise: networks, service providers, and clients. This thesis presents Trusted Mobile Overlays: a system that leverages trusted mobile devices to protect users from these untrusted components of the Web, while minimizing deployment difficulties. It presents a high-level design of the system as well as a prototype that implements the design.


Asynchronous Database Drivers, Michael Adam Heath Dec 2010

Asynchronous Database Drivers, Michael Adam Heath

Theses and Dissertations

Existing database drivers use blocking socket I/O to exchange data with relational database management systems (RDBMS). To concurrently send multiple requests to a RDBMS with blocking database drivers, a separate thread must be used for each request. This approach has been used successfully for many years. However, we propose that using non-blocking socket I/O is faster and scales better under load. In this paper we introduce the Asynchronous Database Connectivity in Java (ADBCJ) framework. ADBCJ provides a common API for asynchronous RDBMS interaction. Various implementations of the ADBCJ API are used to show how utilizing non-blocking socket I/O is faster …


Gene Network Inference And Expression Prediction Using Recurrent Neural Networks And Evolutionary Algorithms, Heather Y. Chan Dec 2010

Gene Network Inference And Expression Prediction Using Recurrent Neural Networks And Evolutionary Algorithms, Heather Y. Chan

Theses and Dissertations

We demonstrate the success of recurrent neural networks in gene network inference and expression prediction using a hybrid of particle swarm optimization and differential evolution to overcome the classic obstacle of local minima in training recurrent neural networks. We also provide an improved validation framework for the evaluation of genetic network modeling systems that will result in better generalization and long-term prediction capability. Success in the modeling of gene regulation and prediction of gene expression will lead to more rapid discovery and development of therapeutic medicine, earlier diagnosis and treatment of adverse conditions, and vast advancements in life science research.


Drop-In Concurrent Api Replacement For Exploration, Test, And Debug, Everett Allen Morse Dec 2010

Drop-In Concurrent Api Replacement For Exploration, Test, And Debug, Everett Allen Morse

Theses and Dissertations

Complex concurrent APIs are difficult to reason about annually due to the exponential growth in the number of feasible schedules. Testing against reference solutions of these APIs is equally difficult as reference solutions implement an unknown set of allowed behaviors, and programmers have no way to directly control schedules or API internals to expose or reproduce errors. The work in this paper mechanically generates a drop-in replacement for a concurrent API from a formal specification. The specification is a guarded command system with first-order logic that is compiled into a core calculus. The term rewriting system is connected to actual …


Packing Virtual Machines Onto Servers, David Luke Wilcox Oct 2010

Packing Virtual Machines Onto Servers, David Luke Wilcox

Theses and Dissertations

Data centers consume a significant amount of energy. This problem is aggravated by the fact that most servers and desktops are underutilized when powered on, and still consume a majority of the energy of a fully utilized computer even when idle This problem would be much worse were it not for the growing use of virtual machines. Virtual machines allow system administrators to more fully utilize hardware capabilities by putting more than one virtual system on the same physical server. Many times, virtual machines are placed onto physical servers inefficiently. To address this inefficiency, I developed a new family of …


Pixel Based Note Taking Through Perceptual Structure Inference, Mitchell Kent Harris Oct 2010

Pixel Based Note Taking Through Perceptual Structure Inference, Mitchell Kent Harris

Theses and Dissertations

Knowledge workers need effective annotation tools to assimilate information. Unfortunately many digital annotators are limited in the range of document that they accept. Those that do accept many different documents do so by converting documents to images, thus losing any awareness about the original content of the document. We introduce a digital note taker that is both universal and content aware. By constructing a hierarchical context tree of document images, the structure of a document is inferred from the image. This hierarchical context tree is shown to be useful by demonstrating how it facilitates selection of document elements, reflowing documents …


Beyond Robot Fan-Out: Towards Multi-Operator Supervisory Control, Michael A. Goodrich, Yisong Guo, Jonathan M. Whetten Oct 2010

Beyond Robot Fan-Out: Towards Multi-Operator Supervisory Control, Michael A. Goodrich, Yisong Guo, Jonathan M. Whetten

Faculty Publications

This paper explores multi-operator supervisory control (MOSC) of multiple independent robots using two complementary approaches: a human factors experiment and an agent-based simulation. The experiment identifies two task and environment limitations on MOSC: task saturation and task diffusion. It also identifies the correlation between task specialization and performance, and the possible existence of untapped spare capacity that emerges when multiple operators coordinate. The presence of untapped spare capacity is explored using agent-based simulation, resulting in evidence which suggests that operators may be more effective when they operate at less than maximum capacity.


Detailed Requirements For Robots In Autism Therapy, Alan Atherton, Bonnie Brinton, Mark Colton, Nicole Giullian, Michael A. Goodrich, Daniel Ricks Oct 2010

Detailed Requirements For Robots In Autism Therapy, Alan Atherton, Bonnie Brinton, Mark Colton, Nicole Giullian, Michael A. Goodrich, Daniel Ricks

Faculty Publications

Robot-based autism therapy is a rapidly developing area of research, with a wide variety of robots being developed for use in clinical settings. Specific, detailed requirements for robots and user interfaces are needed to provide guidelines for the creation of robots that more effectively assist therapists in autism therapy. This paper enumerates a set of requirements for a clinical humanoid robot and the associated human interface. The design of two humanoid robots and an intuitive and flexible user interface for use by therapists in the treatment of children with autism are described.


Unusual-Object Detection In Color Video For Wilderness Search And Rescue, Daniel Richard Thornton Aug 2010

Unusual-Object Detection In Color Video For Wilderness Search And Rescue, Daniel Richard Thornton

Theses and Dissertations

Aircraft-mounted cameras have potential to greatly increase the effectiveness of wilderness search and rescue efforts by collecting photographs or video of the search area. The more data that is collected, the more difficult it becomes to process it by visual inspection alone. This work presents a method for automatically detecting unusual objects in aerial video to assist people in locating signs of missing persons in wilderness areas. The detector presented here makes use of anomaly detection methods originally designed for hyperspectral imagery. Multiple anomaly detection methods are considered, implemented, and evaluated. These anomalies are then aggregated into spatiotemporal objects by …


Backflip: A Principled Approach To Online Attribute Verification, Devlin R. Daley Aug 2010

Backflip: A Principled Approach To Online Attribute Verification, Devlin R. Daley

Theses and Dissertations

As traditional interactions in the real-word move online, services that require verified personal information from web users will increase. We propose an architecture for the verification of web user attributes without the use of cryptographic-based credentials. In this architecture, service providers are delegated a user's ability to directly contact a certifying party and retrieve attribute data. We demonstrate that this approach is simple for both developers and users, can be applied to existing Internet facilities and sufficiently secure for typical web use cases.


Interactive Object Selection And Matting For Video And Images, Brian L. Price Aug 2010

Interactive Object Selection And Matting For Video And Images, Brian L. Price

Theses and Dissertations

Video segmentation, the process of selecting an object out of a video sequence, is a fundamentally important process for video editing and special effects. However, it remains an unsolved problem due to many difficulties such as large or rapid motions, motion blur, lighting and shadow changes, complex textures, similar colors in the foreground and background, and many others. While the human vision system relies on multiple visual cues and higher-order understanding of the objects involved in order to perceive the segmentation, current algorithms usually depend on a small amount of information to assist a user in selecting a desired object. …


Text Segmentation Of Historical Degraded Handwritten Documents, Oliver Nina Aug 2010

Text Segmentation Of Historical Degraded Handwritten Documents, Oliver Nina

Theses and Dissertations

The use of digital images of handwritten historical documents has increased in recent years. This has been possible through the Internet, which allows users to access a vast collection of historical documents and makes historical and data research more attainable. However, the insurmountable number of images available in these digital libraries is cumbersome for a single user to read and process. Computers could help read these images through methods known as Optical Character Recognition (OCR), which have had significant success for printed materials but only limited success for handwritten ones. Most of these OCR methods work well only when the …


Partition Based Phylogenetic Search, Kenneth A. Sundberg Aug 2010

Partition Based Phylogenetic Search, Kenneth A. Sundberg

Theses and Dissertations

Evolutionary relationships are key to modern understanding of biological systems. Phylogenetic search is the means by which these relationships are inferred. Phylogenetic search is NP-Hard. As such it is necessary to employ heuristic methods. This work proposes new methods based on viewing the relationships between species as sets of partitions. These methods produce more parsimonious phylogenies than current methods.


A Probabilistic Morphological Analyzer For Syriac, Peter J. Mcclanahan Jul 2010

A Probabilistic Morphological Analyzer For Syriac, Peter J. Mcclanahan

Theses and Dissertations

We show that a carefully crafted probabilistic morphological analyzer significantly outperforms a reasonable, naive baseline for Syriac. Syriac is an under-resourced Semitic language for which there are no available language tools such as morphological analyzers. Such tools are widely used to contribute to the process of annotating morphologically complex languages. We introduce and connect novel data-driven models for segmentation, dictionary linkage, and morphological tagging in a joint pipeline to create a probabilistic morphological analyzer requiring only labeled data. We explore the performance of this model with varying amounts of training data and find that with about 34,500 tokens, it can …


Supporting Wilderness Search And Rescue With Integrated Intelligence: Autonomy And Information At The Right Time And The Right Place, Michael A. Goodrich, Lanny Lin, Bryan S. Morse, Michael Roscheck Jul 2010

Supporting Wilderness Search And Rescue With Integrated Intelligence: Autonomy And Information At The Right Time And The Right Place, Michael A. Goodrich, Lanny Lin, Bryan S. Morse, Michael Roscheck

Faculty Publications

Current practice in Wilderness Search and Rescue (WiSAR) is analogous to an intelligent system designed to gather and analyze information to find missing persons in remote areas. The system consists of multiple parts — various tools for information management (maps, GPS, etc) distributed across personnel with different skills and responsibilities. Introducing a camera-equipped mini-UAV into this task requires autonomy and information technology that itself is an integrated intelligent system to be used by a sub-team that must be integrated into the overall intelligent system. In this paper, we identify key elements of the integration challenges along two dimensions: (a) attributes …


Practical Improvements In Applied Spectral Learning, Adam C. Drake Jun 2010

Practical Improvements In Applied Spectral Learning, Adam C. Drake

Theses and Dissertations

Spectral learning algorithms, which learn an unknown function by learning a spectral representation of the function, have been widely used in computational learning theory to prove many interesting learnability results. These algorithms have also been successfully used in real-world applications. However, previous work has left open many questions about how to best use these methods in real-world learning scenarios. This dissertation presents several significant advances in real-world spectral learning. It presents new algorithms for finding large spectral coefficients (a key sub-problem in spectral learning) that allow spectral learning methods to be applied to much larger problems and to a wider …


Automatic Extraction From And Reasoning About Genealogical Records: A Prototype, Charla Jean Woodbury Jun 2010

Automatic Extraction From And Reasoning About Genealogical Records: A Prototype, Charla Jean Woodbury

Theses and Dissertations

Family history research on the web is increasing in popularity, and many competing genealogical websites host large amounts of data-rich, unstructured, primary genealogical records. It is labor-intensive, however, even after making these records machine-readable, for humans to make these records easily searchable. What we need are computer tools that can automatically produce indices and databases from these genealogical records and can automatically identify individuals and events, determine relationships, and put families together. We propose here a possible solution—specialized ontologies, built specifically for extracting information from primary genealogical records, with expert logic and rules to infer genealogical facts and assemble relationship …


On The Use Of Cartographic Projections In Visualizing Phylogenetic Treespace, Mark J. Clement, Quinn O. Snell, Kenneth Sundberg Jun 2010

On The Use Of Cartographic Projections In Visualizing Phylogenetic Treespace, Mark J. Clement, Quinn O. Snell, Kenneth Sundberg

Faculty Publications

Phylogenetic analysis is becoming an increasingly important tool for biological research. Applications include epidemiological studies, drug development, and evolutionary analysis. Phylogenetic search is a known NP-Hard problem. The size of the data sets which can be analyzed is limited by the exponential growth in the number of trees that must be considered as the problem size increases. A better understanding of the problem space could lead to better methods, which in turn could lead to the feasible analysis of more data sets. We present a definition of phylogenetic tree space and a visualization of this space that shows significant exploitable …