Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 12 of 12
Full-Text Articles in Physical Sciences and Mathematics
Digitizing Dinosaur National Monument's Carnegie Quarry, Rebecca Esplin
Digitizing Dinosaur National Monument's Carnegie Quarry, Rebecca Esplin
Theses and Dissertations
The Carnegie Quarry in northeastern Utah is world-renowned for the dinosaur skeletons it has produced and for its in situ display of dinosaur bones. The specimens excavated at Carnegie Quarry are displayed and curated in 20 repositories, most in North America. Data on these specimens in the forms of notes, photographs, publications, field maps, and so on, are scattered in an array of formats and institutions. The primary goal of this thesis is to develop a database linking these data with a digital map (GIS system) to make them readily accessible. To this end, a relational database was created using …
Classifying And Cataloging Cyber-Security Incidents Within Cyber-Physical Systems, William B. Miller
Classifying And Cataloging Cyber-Security Incidents Within Cyber-Physical Systems, William B. Miller
Theses and Dissertations
In the past, there were perceived delineations between the cyber world and the physical world. We are becoming increasingly aware of the overlap between these two worlds, and the overlap itself is increasing. The overlap between these two worlds is known as cyber-physical systems. There have been several incidents involving cyber-physical systems and the number of these incidents is increasing dramatically. In the past there has been no effort to identify methods for describing these incidents in the unique context of cyber-physical systems. This research provides a taxonomy for classifying these incidents that focuses on cross domain, impact oriented analysis. …
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 …
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 …
Trust Negotiation For Open Database Access Control, Paul A. Porter
Trust Negotiation For Open Database Access Control, Paul A. Porter
Theses and Dissertations
Hippocratic databases are designed to protect the privacy of the individuals whose personal information they contain. This thesis presents a model for providing and enforcing access control in an open Hippocratic database system. Previously unknown individuals can gain access to information in the database by authenticating to roles through trust negotiation. Allowing qualified strangers to access the database increases the usefulness of the system without compromising privacy. This thesis presents the design and implementation of two methods for filtering information from database queries. First, we extend a query modification method for use in an open database system. Second, we introduce …
Clustering Of Database Query Results, Kristine Jean Daniels
Clustering Of Database Query Results, Kristine Jean Daniels
Theses and Dissertations
Increasingly more users are accessing database systems for interactive and exploratory data retrieval. While performing searches on these systems, users are required to use broad queries to get their desired results. Broad queries often result in too many items forcing the user to spend unnecessary time sifting through these items to find the relevant results. This problem, of finding a desired data item within many items, is referred to as "information overload". Most users experience information overload when viewing these database query results. This thesis shows that users information overload can be reduced by clustering database query results. …
A User-Centric Tabular Multi-Column Sorting Interface For Intact Transposition Of Columnar Data, David B. L. Miles
A User-Centric Tabular Multi-Column Sorting Interface For Intact Transposition Of Columnar Data, David B. L. Miles
Theses and Dissertations
Many usability features designed in software applications are not procedurally intuitive for software users. A good example of software usability involves tabular sorting in a spreadsheet. Single-column sorting, activated with a mouse click to a column header or toolbar button, often produces rearranged listings that reduce cognitive organization beyond the sorted column. Multi-column sorting, generated through menu-driven processes, provides derived organization, however, locating feature options through menu-based systems can be confusing. A means to overcome this confusion is prioritized selection of database arrays issued to columnar displays for the purpose of intact transposition of data. This is a unique process …
A Comparison Of Methods To Construct An Optimal Membership Function In A Fuzzy Database System, Joanne Marie Cunningham
A Comparison Of Methods To Construct An Optimal Membership Function In A Fuzzy Database System, Joanne Marie Cunningham
Theses and Dissertations
A fuzzy set is one in which membership in a category is not Boolean, rather items have a degree of membership. Fuzzy databases expand on this idea by storing fuzzy data and allowing data to be retrieved based on its degree of membership. Determining the degree of membership that satisfies the largest number of users is difficult. Five different methods of determining the membership function: the Direct Rating Method, the Random Method with step sizes of .02 and .03, the Steplock Method, and the Weighted Average Method, were compared on the basis of convergence and user satisfaction. The results support …
Assessing, Modifying, And Combining Data Fields From The Virginia Office Of The Chief Medical Examiner (Ocme) Dataset And The Virginia Department Of Forensic Science (Dfs) Datasets In Order To Compare Concentrations Of Selected Drugs, Amy Elizabeth Herrin
Theses and Dissertations
The Medical Examiner of Virginia (ME) dataset and the Virginia Department of Forensic Science Driving Under the Influence of Drugs (DUI) datasets were used to determine whether people have the potential to develop tolerances to diphenhydramine, cocaine, oxycodone, hydrocodone, methadone, and morphine. These datasets included the years 2000-2004 and were used to compare the concentrations of these six drugs between people who died from a drug-related cause of death (of the drug of interest) and people who were pulled over for driving under the influence. Three drug pattern groups were created to divide each of the six drug-specific datasets in …
A Statistical Performance Model Of Homogeneous Raidb Clusters, Brandon Lamar Rogers
A Statistical Performance Model Of Homogeneous Raidb Clusters, Brandon Lamar Rogers
Theses and Dissertations
The continual growth of the Internet and e-commerce is driving demand for speed, reliability and processing power. With the rapid development and maturation of e-commerce, the need for a quick access to large amounts of information is steadily rising. Traditionally, database systems have been used for information storage and retrieval. However, with online auctions, rapid Internet searches, and data archival, the need for more powerful database systems is also growing. One type of distributed database is called Redundant Arrays of Inexpensive Databases (RAIDb). RAIDb clusters are middleware-driven to promote interoperability and portability. RAIDb clusters allow for multiple levels of data …
Fuzzy Membership Function Initial Values: Comparing Initialization Methods That Expedite Convergence, Stephanie Scheibe Lee
Fuzzy Membership Function Initial Values: Comparing Initialization Methods That Expedite Convergence, Stephanie Scheibe Lee
Theses and Dissertations
Fuzzy attributes are used to quantify imprecise data that model real world objects. To effectively use fuzzy attributes, a fuzzy membership function must be defined to provide the boundaries for the fuzzy data. The initialization of these membership function values should allow the data to converge to a stable membership value in the shortest time possible. The paper compares three initialization methods, Random, Midpoint and Random Proportional, to determine which method optimizes convergence. The comparison experiments suggest the use of the Random Proportional method.
Attribute-Level Versioning: A Relational Mechanism For Version Storage And Retrieval, Charles Andrew Bell
Attribute-Level Versioning: A Relational Mechanism For Version Storage And Retrieval, Charles Andrew Bell
Theses and Dissertations
Data analysts today have at their disposal a seemingly endless supply of data and repositories hence, datasets from which to draw. New datasets become available daily thus making the choice of which dataset to use difficult. Furthermore, traditional data analysis has been conducted using structured data repositories such as relational database management systems (RDBMS). These systems, by their nature and design, prohibit duplication for indexed collections forcing analysts to choose one value for each of the available attributes for an item in the collection. Often analysts discover two or more datasets with information about the same entity. When combining this …