Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Machine learning (3)
- Database (2)
- A priori learning (1)
- API (1)
- Active learning (1)
-
- Ad-hoc network (1)
- Adbcj (1)
- Aerial imagery (1)
- Algorithmic decision processes (1)
- Annotation (1)
- Anomaly detection (1)
- Asynchronous (1)
- Attribute verification (1)
- Authentication (1)
- Authentication in wireless networks (1)
- Automated water management (1)
- Bayes (1)
- Bayes Law (1)
- Bayesian (1)
- Bayesian learning (1)
- Bias (1)
- Binarization (1)
- Binarization algorithm (1)
- Binarization for OCR (1)
- BitTorrent (1)
- Cartographic projection (1)
- Color modeling (1)
- Computational complexity (1)
- Computer (1)
- Concurrency (1)
Articles 1 - 24 of 24
Full-Text Articles in Entire DC Network
Capture And Access Of Multiple Screen Presentations, Kelv H. Cutler
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. …
A Reusable Persistence Framework For Replicating Empirical Studies On Data From Open Source Repositories, Scott Bong-Soo Chun
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 …
Trusted Mobile Overlays, Robert Scott Robertson
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.
Gene Network Inference And Expression Prediction Using Recurrent Neural Networks And Evolutionary Algorithms, Heather Y. Chan
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.
Asynchronous Database Drivers, Michael Adam Heath
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 …
Drop-In Concurrent Api Replacement For Exploration, Test, And Debug, Everett Allen Morse
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
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
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 …
Unusual-Object Detection In Color Video For Wilderness Search And Rescue, Daniel Richard Thornton
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
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
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
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
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
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 …
Practical Improvements In Applied Spectral Learning, Adam C. Drake
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
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 …
Transformation Learning: Modeling Transferable Transformations In High-Dimensional Data, Christopher R. Wilson
Transformation Learning: Modeling Transferable Transformations In High-Dimensional Data, Christopher R. Wilson
Theses and Dissertations
The goal of learning transfer is to apply knowledge gained from one problem to a separate related problem. Transformation learning is a proposed approach to computational learning transfer that focuses on modeling high-level transformations that are well suited for transfer. By using a high-level representation of transferable data, transformation learning facilitates both shallow transfer (intra-domain) and deep transfer (inter-domain) scenarios. Transformations can be discovered in data using manifold learning to order data instances according to the transformations they represent. For high-dimensional data representable with coordinate systems, such as images and sounds, data instances can be decomposed into small sub-instances based …
Automatic Transition To Peer-To-Peer Download, Roger D. Pack
Automatic Transition To Peer-To-Peer Download, Roger D. Pack
Theses and Dissertations
For traditional web servers, available bandwidth decreases as the number of clients increases. This can cause servers to serve files slowly or to become completely overwhelmed when load grows too high. BitTorrent is a peer-to-peer solution to this problem, but it requires manual configuration for each file to be delivered this way. We develop a new system that integrates peer-to-peer file delivery with traditional client-server downloads. Clients initially attempt to download a file from a web server; if this is too slow, they transition to peer-to-peer delivery. Experiments with a prototype system show that it serves up to 30x faster …
The Role Of Algorithmic Decision Processes In Decision Automation: Three Case Studies, Blake Edward Durtschi
The Role Of Algorithmic Decision Processes In Decision Automation: Three Case Studies, Blake Edward Durtschi
Theses and Dissertations
This thesis develops a new abstraction for solving problems in decision automation. Decision automation is the process of creating algorithms which use data to make decisions without the need for human intervention. In this abstraction, four key ideas/problems are highlighted which must be considered when solving any decision problem. These four problems are the decision problem, the learning problem, the model reduction problem, and the verification problem. One of the benefits of this abstraction is that a wide range of decision problems from many different areas can be broken down into these four “key” sub-problems. By focusing on these key …
Convenient Decentralized Authentication Using Passwords, Timothy W. Van Der Horst
Convenient Decentralized Authentication Using Passwords, Timothy W. Van Der Horst
Theses and Dissertations
Passwords are a very convenient way to authenticate. In terms of simplicity and portability they are very difficult to match. Nevertheless, current password-based login mechanisms are vulnerable to phishing attacks and typically require users to create and manage a new password for each of their accounts. This research investigates the potential for indirect/decentralized approaches to improve password-based authentication. Adoption of a decentralized authentication mechanism requires the agreement between users and service providers on a trusted third party that vouches for users' identities. Email providers are the de facto trusted third parties on the Internet. Proof of email address ownership is …
A Bayesian Decision Theoretical Approach To Supervised Learning, Selective Sampling, And Empirical Function Optimization, James Lamond Carroll
A Bayesian Decision Theoretical Approach To Supervised Learning, Selective Sampling, And Empirical Function Optimization, James Lamond Carroll
Theses and Dissertations
Many have used the principles of statistics and Bayesian decision theory to model specific learning problems. It is less common to see models of the processes of learning in general. One exception is the model of the supervised learning process known as the "Extended Bayesian Formalism" or EBF. This model is descriptive, in that it can describe and compare learning algorithms. Thus the EBF is capable of modeling both effective and ineffective learning algorithms. We extend the EBF to model un-supervised learning, semi-supervised learning, supervised learning, and empirical function optimization. We also generalize the utility model of the EBF to …
Interactive Television News, Derek L. Bunn
Interactive Television News, Derek L. Bunn
Theses and Dissertations
We design and evaluate a way to modify television news to make it interactive for viewers. We allow them to get more of what they want and less of what they don't want. This allows news to break constraints imposed by television broadcast schedules. Our solution is to augment the existing news broadcast structure in the following ways: add a video headlines menu, provide on-demand access to additional story content, provide interactive navigation controls between stories, and a control overlay. For news producers we create a video annotation program and process to help create the interactive news. We use the …
Studying The Performance Of Wireless Mesh Networks Using The Hxh Transport Control Protocol, Timothy Scott Larsen
Studying The Performance Of Wireless Mesh Networks Using The Hxh Transport Control Protocol, Timothy Scott Larsen
Theses and Dissertations
As the need to remain connected increases, more and more people are turning to wireless mesh networks because they reduce the need for network infrastructure. Unfortunately, TCP does not perform well in such networks. HxH, an alternate protocol, has shown great promise in simulations, but since it relies on exploiting passive feedback, real measurements are needed to determine how effective the protocol really is. This thesis uses a measurement study on a wireless mesh network to characterize the performance of the HxH protocol in real-world networks. Several aspects of the HxH protocol do in fact perform well on real networks, …
Graph-Based Global Illumination, Brian C. Ricks
Graph-Based Global Illumination, Brian C. Ricks
Theses and Dissertations
The slow render times of global illumination algorithms make them impractical in most commercial and academic settings. We propose a novel framework for calculating the computational complexity of global illumination algorithms and show that no other recent improvements have reduced this complexity. We further show that many algorithms use a tree as their rendering paradigm. We propose a new rendering algorithm, pipe casting, which calculates light paths using a graph instead of a tree. Pipe casting significantly reduces both computational complexity and actual render time of rendering. Using an L2 pixel-wise error comparison, on average our algorithm can render a …