Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Machine learning (34)
- Computer (20)
- Security (19)
- Model checking (10)
- Authentication (9)
-
- Computer science (9)
- Privacy (9)
- Clustering (8)
- Ontology (8)
- Simulation (8)
- Trust negotiation (8)
- Annotation (7)
- Database (7)
- Optimization (7)
- Data extraction (6)
- Framework (6)
- Graphics (6)
- Reinforcement learning (6)
- Secure email (6)
- Thesis (6)
- Usable security (6)
- Animation (5)
- BYU (5)
- Collaboration (5)
- Computer graphics (5)
- Computer vision (5)
- Data (5)
- End-to-end encryption (5)
- HCI (5)
- Information extraction (5)
- Publication Year
Articles 391 - 408 of 408
Full-Text Articles in Entire DC Network
Improved Signal Integrity In Ieee 1149.1 Boundary Scan Designs, Efren De Jesus Rangel Taboada
Improved Signal Integrity In Ieee 1149.1 Boundary Scan Designs, Efren De Jesus Rangel Taboada
Theses and Dissertations
This work is an analysis of solutions to problems derived from inherent timing and signal integrity issues in the use and application of the IEEE 1149.1 Standard at the board level in conjunction with its test system. Setup or hold times violations may occur in a boundary scan chain using IEEE 1149.1 compliant devices. A practical study of the TDI-TDO scan data path has been conducted to show where problems may arise in relationship to a particular board topology and test system. This work points to differences between passing and failing scan path tests for problem characterization. Serial data flow …
Disk Based Model Checking, Tonglaga Bao
Disk Based Model Checking, Tonglaga Bao
Theses and Dissertations
Disk based model checking does not receive much attention in the model checking field becasue of its costly time overhead. In this thesis, we present a new disk based algorithm that can get close to or faster verification speed than a RAM based algorithm that has enough memory to complete its verification. This algorithm also outperforms Stern and Dill's original disk based algorithm. The algorithm partitions the state space to several files, and swaps files into and out of memory during verification. Compared with the RAM only algorithm, the new algoritm reduces hash table insertion time by reducing the cost …
Vision-Based Human Directed Robot Guidance, Richard B. Arthur
Vision-Based Human Directed Robot Guidance, Richard B. Arthur
Theses and Dissertations
This paper describes methods to track a user-defined point in the vision of a robot as it drives forward. This tracking allows a robot to keep itself directed at that point while driving so that it can get to that user-defined point. I develop and present two new multi-scale algorithms for tracking arbitrary points between two frames of video, as well as through a video sequence. The multi-scale algorithms do not use the traditional pyramid image, but instead use a data structure called an integral image (also known as a summed area table). The first algorithm uses edge-detection to track …
Network-Layer Selective Security, Casey T. Deccio
Network-Layer Selective Security, Casey T. Deccio
Theses and Dissertations
The Internet and other large computer networks have become an integral part of numerous daily processes. Security at the network layer is necessary to maintain infrastructure survivability in the case of cyber attacks aimed at routing protocols. In order to minimize undesired overhead associated with added security at this level, the notion of selective security is proposed. This thesis identifies elements in network topologies that are most important to the survivability of the network. The results show that the strategic placement of network security at critical elements will improve overall network survivability without the necessity of universal deployment.
An Ecological Display For Robot Teleoperation, Robert W. Ricks
An Ecological Display For Robot Teleoperation, Robert W. Ricks
Theses and Dissertations
This thesis presents an interface for effectively teleoperating robots that combines an ecological display of range and video information with quickening based on dead-reckoning prediction. This display is built by viewing range and video information from a virtual camera trailing the robot. This is rendered in 3-D by using standard hardware acceleration and 3-D graphics software. Our studies demonstrate that this interface improves performance for most people, including those that do not have much previous experience with robotics. These studies involved 32 test subjects in a simulated environment and 8 in the real world. Subjects were required to drive the …
A Qualitative Method For Dynamic Transport Selection In Heterogeneous Wireless Environments, Heidi R. Duffin
A Qualitative Method For Dynamic Transport Selection In Heterogeneous Wireless Environments, Heidi R. Duffin
Theses and Dissertations
Computing devices are commonly equipped with multiple transport technologies such as IrDA, Bluetooth and WiFi. Transport switching technologies, such as Quality of Transport (QoT), take advantage of this heterogeneity to keep network sessions active as users move in and out of range of various transports or as the networking environment changes. During an active session, the goal is to keep the device connected over the best transport currently available. To accomplish that, this thesis introduces a two-phase decision making protocol. In phase one, intra-device prioritization, users indicate the relative importance of criteria such as speed, power, service charge, or signal …
Preserving Trust Across Multiple Sessions In Open Systems, Fuk-Wing Thomas Chan
Preserving Trust Across Multiple Sessions In Open Systems, Fuk-Wing Thomas Chan
Theses and Dissertations
Trust negotiation, a new authentication paradigm, enables strangers on the Internet to establish trust through the gradual disclosure of digital credentials and access control policies. Previous research in trust negotiation does not address issues in preserving trust across multiple sessions. This thesis discusses issues in preserving trust between parties who were previously considered strangers. It also describes the design and implementation of trust preservation in TrustBuilder, a prototype trust negotiation system. Preserving trust information can reduce the frequency and cost of renegotiation. A scenario is presented that demonstrates that a server supporting trust preservation can recoup the cost of the …
Grouping Search-Engine Returned Citations For Person-Name Queries, Reema Al-Kamha
Grouping Search-Engine Returned Citations For Person-Name Queries, Reema Al-Kamha
Theses and Dissertations
In this thesis we present a technique to group search-engine returned citations for person-name queries, such that the search-engine returned citations in each group belong to the same person. To group the returned citations we use a multi-faceted approach that considers evidence from three facets: (1) attributes, (2) links, and (3) page similarity. For each facet we generate a confidence matrix. Then we construct a final confidence matrix for all facets. Using a threshold, we apply a grouping algorithm on the final confidence matrix. The output is a group of search-engine returned citations, such that the citations in each group …
Load Balancing Parallel Explicit State Model Checking, Rahul Kumar
Load Balancing Parallel Explicit State Model Checking, Rahul Kumar
Theses and Dissertations
This research first identifies some of the key concerns about the techniques and algorithms developed for distributed and parallel model checking; specifically, the inherent problem with load balancing and large queue sizes resultant in a static partition algorithm. This research then presents a load balancing algorithm to improve the run time performance in distributed model checking, reduce maximum queue size, and reduce the number of states expanded before error discovery. The load balancing algorithm is based on Generalized Dimension Exchange (GDE). This research presents an empirical analysis of the GDE based load balancing algorithm on three different supercomputing architectures---distributed memory …
Solving Large Mdps Quickly With Partitioned Value Iteration, David Wingate
Solving Large Mdps Quickly With Partitioned Value Iteration, David Wingate
Theses and Dissertations
Value iteration is not typically considered a viable algorithm for solving large-scale MDPs because it converges too slowly. However, its performance can be dramatically improved by eliminating redundant or useless backups, and by backing up states in the right order. We present several methods designed to help structure value dependency, and present a systematic study of companion prioritization techniques which focus computation in useful regions of the state space. In order to scale to solve ever larger problems, we evaluate all enhancements and methods in the context of parallelizability. Using the enhancements, we discover that in many instances the limiting …
Responding To Policies At Runtime In Trustbuilder, Bryan J. Smith
Responding To Policies At Runtime In Trustbuilder, Bryan J. Smith
Theses and Dissertations
Automated trust negotiation is the process of establishing trust between entities with no prior relationship through the iterative disclosure of digital credentials. One approach to negotiating trust is for the participants to exchange access control policies to inform each other of the requirements for establishing trust. When a policy is received at runtime, a compliance checker determines which credentials satisfy the policy so they can be disclosed. In situations where several sets of credentials satisfy a policy and some of the credentials are sensitive, a compliance checker that generates all the sets is necessary to insure that the negotiation succeeds …
Query Rewriting For Extracting Data Behind Html Forms, Xueqi Chen
Query Rewriting For Extracting Data Behind Html Forms, Xueqi Chen
Theses and Dissertations
Much of the information on the Web is stored in specialized searchable databases and can only be accessed by interacting with a form or a series of forms. As a result, enabling automated agents and Web crawlers to interact with form-based interfaces designed primarily for humans is of great value. This thesis describes a system that can fill out Web forms automatically according to a given user query against a global schema for an application domain and, to the extent possible, extract just the relevant data behind these Web forms. Experimental results on two application domains show that the approach …
Fast Registration Of Tabular Document Images Using The Fourier-Mellin Transform, Luke Alexander Daysh Hutchison
Fast Registration Of Tabular Document Images Using The Fourier-Mellin Transform, Luke Alexander Daysh Hutchison
Theses and Dissertations
Image registration, the process of finding the transformation that best maps one image to another, is an important tool in document image processing. Having properly-aligned microfilm images can help in manual and automated content extraction, zoning, and batch compression of images. An image registration algorithm is presented that quickly identifies the global affine transformation (rotation, scale, translation and/or shear) that maps one tabular document image to another, using the Fourier-Mellin Transform. Each component of the affine transform is recovered independantly from the others, dramatically reducing the parameter space of the problem, and improving upon standard Fourier-Mellin Image Registration (FMIR), which …
Schema Matching And Data Extraction Over Html Tables, Cui Tao
Schema Matching And Data Extraction Over Html Tables, Cui Tao
Theses and Dissertations
Data on the Web in HTML tables is mostly structured, but we usually do not know the structure in advance. Thus, we cannot directly query for data of interest. We propose a solution to this problem for the case of mostly structured data in the form of HTML tables, based on document-independent extraction ontologies. The solution entails elements of table location and table understanding, data integration, and wrapper creation. Table location and understanding allows us to locate the table of interest, recognize attributes and values, pair attributes with values, and form records. Data-integration techniques allow us to match source records …
Protecting Sensitive Credential Content During Trust Negotiation, Ryan D. Jarvis
Protecting Sensitive Credential Content During Trust Negotiation, Ryan D. Jarvis
Theses and Dissertations
Keeping sensitive information private in a public world is a common concern to users of digital credentials. A digital credential may contain sensitive attributes certifying characteristics about its owner. X.509v3, the most widely used certificate standard, includes support for certificate extensions that make it possible to bind multiple attributes to a public key contained in the certificate. This feature, although convenient, potentially exploits the certificate holder's private information contained in the certificate. There are currently no privacy considerations in place to protect the disclosure of attributes in a certificate. This thesis focuses on protecting sensitive credential content during trust negotiation …
Ontology-Based Extraction Of Rdf Data From The World Wide Web, Timothy Adam Chartrand
Ontology-Based Extraction Of Rdf Data From The World Wide Web, Timothy Adam Chartrand
Theses and Dissertations
The simplicity and proliferation of the World Wide Web (WWW) has taken the availability of information to an unprecedented level. The next generation of the Web, the Semantic Web, seeks to make information more usable by machines by introducing a more rigorous structure based on ontologies. One hinderance to the Semantic Web is the lack of existing semantically marked-up data. Until there is a critical mass of Semantic Web data, few people will develop and use Semantic Web applications. This project helps promote the Semantic Web by providing content. We apply existing information-extraction techniques, in particular, the BYU ontologybased data-extraction …
A Formal Method To Analyze Framework-Based Software, Trent N. Larson
A Formal Method To Analyze Framework-Based Software, Trent N. Larson
Theses and Dissertations
Software systems are frequently designed using abstractions that make software verification tractable. Specifically, by choosing meaningful, formal abstractions for interfaces and then designing according to those interfaces, one can verify entire systems according to behavioral predicates. While impractical for systems in general, framework-based software architectures are a type of system for which formal analysis can be beneficial and practical over the life of the system. We present a method to formally analyze behavioral properties of framework-based software with higher-order logic and then demonstrate its utility for a significant, modern system.
Introductory Dataperfect® Instruction, Frances Jenson Larsen
Introductory Dataperfect® Instruction, Frances Jenson Larsen
Theses and Dissertations
The project should be used in a beginning computer class. These units contain projects from simple to complex. The first instructional unit uses a database that comes with the DataPerfect® program. The students build and manipulate a small database. Reports are prepared, and finally the students design an original database. These instructional units are intended to be used in a high school classroom with the DataPerfect® computer program. DataPerfect® is a copyrighted program marketed by WordPerfect Corporation of Orem, Utah.