You limited your search to:

  Access Rights: Public
  Partner: UNT Libraries
 Department: Department of Computer Science
 Collection: UNT Theses and Dissertations
A Unifying Version Model for Objects and Schema in Object-Oriented Database System

A Unifying Version Model for Objects and Schema in Object-Oriented Database System

Date: August 1997
Creator: Shin, Dongil
Description: There have been a number of different versioning models proposed. The research in this area can be divided into two categories: object versioning and schema versioning. In this dissertation, both problem domains are considered as a single unit. This dissertation describes a unifying version model (UVM) for maintaining changes to both objects and schema. UVM handles schema versioning operations by using object versioning techniques. The result is that the UVM allows the OODBMS to be much smaller than previous systems. Also, programmers need know only one set of versioning operations; thus, reducing the learning time by half. This dissertation shows that UVM is a simple but semantically sound and powerful version model for both objects and schema.
Contributing Partner: UNT Libraries
Computational Complexity of Hopfield Networks

Computational Complexity of Hopfield Networks

Date: August 1998
Creator: Tseng, Hung-Li
Description: There are three main results in this dissertation. They are PLS-completeness of discrete Hopfield network convergence with eight different restrictions, (degree 3, bipartite and degree 3, 8-neighbor mesh, dual of the knight's graph, hypercube, butterfly, cube-connected cycles and shuffle-exchange), exponential convergence behavior of discrete Hopfield network, and simulation of Turing machines by discrete Hopfield Network.
Contributing Partner: UNT Libraries
Intrinsic and Extrinsic Adaptation in a Simulated Combat Environment

Intrinsic and Extrinsic Adaptation in a Simulated Combat Environment

Date: May 1995
Creator: Dombrowsky, Steven P. (Steven Paul)
Description: Genetic algorithm and artificial life techniques are applied to the development of challenging and interesting opponents in a combat-based computer game. Computer simulations are carried out against an idealized human player to gather data on the effectiveness of the computer generated opponents.
Contributing Partner: UNT Libraries
Exon/Intron Discrimination Using the Finite Induction Pattern Matching Technique

Exon/Intron Discrimination Using the Finite Induction Pattern Matching Technique

Date: December 1997
Creator: Taylor, Pamela A., 1941-
Description: DNA sequence analysis involves precise discrimination of two of the sequence's most important components: exons and introns. Exons encode the proteins that are responsible for almost all the functions in a living organism. Introns interrupt the sequence coding for a protein and must be removed from primary RNA transcripts before translation to protein can occur. A pattern recognition technique called Finite Induction (FI) is utilized to study the language of exons and introns. FI is especially suited for analyzing and classifying large amounts of data representing sequences of interest. It requires no biological information and employs no statistical functions. Finite Induction is applied to the exon and intron components of DNA by building a collection of rules based upon what it finds in the sequences it examines. It then attempts to match the known rule patterns with new rules formed as a result of analyzing a new sequence. A high number of matches predict a probable close relationship between the two sequences; a low number of matches signifies a large amount of difference between the two. This research demonstrates FI to be a viable tool for measurement when known patterns are available for the formation of rule sets.
Contributing Partner: UNT Libraries
Symplectic Integration of Nonseparable Hamiltonian Systems

Symplectic Integration of Nonseparable Hamiltonian Systems

Date: May 1996
Creator: Curry, David M. (David Mason)
Description: Numerical methods are usually necessary in solving Hamiltonian systems since there is often no closed-form solution. By utilizing a general property of Hamiltonians, namely the symplectic property, all of the qualities of the system may be preserved for indefinitely long integration times because all of the integral (Poincare) invariants are conserved. This allows for more reliable results and frequently leads to significantly shorter execution times as compared to conventional methods. The resonant triad Hamiltonian with one degree of freedom will be focused upon for most of the numerical tests because of its difficult nature and, moreover, analytical results exist whereby useful comparisons can be made.
Contributing Partner: UNT Libraries
Using Normal Deduction Graphs in Common Sense Reasoning

Using Normal Deduction Graphs in Common Sense Reasoning

Date: May 1992
Creator: Munoz, Ricardo A. (Ricardo Alberto)
Description: This investigation proposes a powerful formalization of common sense knowledge based on function-free normal deduction graphs (NDGs) which form a powerful tool for deriving Horn and non-Horn clauses without functions. Such formalization allows common sense reasoning since it has the ability to handle not only negative but also incomplete information.
Contributing Partner: UNT Libraries
A Programming Language For Concurrent Processing

A Programming Language For Concurrent Processing

Date: August 1972
Creator: Jackson, Portia M.
Description: This thesis is a proposed solution to the problem of including an effective interrupt mechanism in the set of concurrent- processing primitives of a block-structured programming language or system. The proposed solution is presented in the form of a programming language definition and model. The language is called TRIPLE.
Contributing Partner: UNT Libraries
Arithmetic Computations and Memory Management Using a Binary Tree Encoding af Natural Numbers

Arithmetic Computations and Memory Management Using a Binary Tree Encoding af Natural Numbers

Date: December 2011
Creator: Haraburda, David
Description: Two applications of a binary tree data type based on a simple pairing function (a bijection between natural numbers and pairs of natural numbers) are explored. First, the tree is used to encode natural numbers, and algorithms that perform basic arithmetic computations are presented along with formal proofs of their correctness. Second, using this "canonical" representation as a base type, algorithms for encoding and decoding additional isomorphic data types of other mathematical constructs (sets, sequences, etc.) are also developed. An experimental application to a memory management system is constructed and explored using these isomorphic types. A practical analysis of this system's runtime complexity and space savings are provided, along with a proof of concept framework for both applications of the binary tree type, in the Java programming language.
Contributing Partner: UNT Libraries
Analysis of Web Services on J2EE Application Servers

Analysis of Web Services on J2EE Application Servers

Date: May 2004
Creator: Gosu, Adarsh Kumar
Description: The Internet became a standard way of exchanging business data between B2B and B2C applications and with this came the need for providing various services on the web instead of just static text and images. Web services are a new type of services offered via the web that aid in the creation of globally distributed applications. Web services are enhanced e-business applications that are easier to advertise and easier to discover on the Internet because of their flexibility and uniformity. In a real life scenario it is highly difficult to decide which J2EE application server to go for when deploying a enterprise web service. This thesis analyzes the various ways by which web services can be developed & deployed. Underlying protocols and crucial issues like EAI (enterprise application integration), asynchronous messaging, Registry tModel architecture etc have been considered in this research. This paper presents a report by analyzing what various J2EE application servers provide by doing a case study and by developing applications to test functionality.
Contributing Partner: UNT Libraries
Modeling the Impact and Intervention of a Sexually Transmitted Disease: Human Papilloma Virus

Modeling the Impact and Intervention of a Sexually Transmitted Disease: Human Papilloma Virus

Date: May 2006
Creator: Corley, Courtney D.
Description: Many human papilloma virus (HPV) types are sexually transmitted and HPV DNA types 16, 18, 31, and 45 account for more than 75% if all cervical dysplasia. Candidate vaccines are successfully completing US Federal Drug Agency (FDA) phase III testing and several drug companies are in licensing arbitration. Once this vaccine become available it is unlikely that 100% vaccination coverage will be probable; hence, the need for vaccination strategies that will have the greatest reduction on the endemic prevalence of HPV. This thesis introduces two discrete-time models for evaluating the effect of demographic-biased vaccination strategies: one model incorporates temporal demographics (i.e., age) in population compartments; the other non-temporal demographics (i.e., race, ethnicity). Also presented is an intuitive Web-based interface that was developed to allow the user to evaluate the effects on prevalence of a demographic-biased intervention by tailoring the model parameters to specific demographics and geographical region.
Contributing Partner: UNT Libraries
FIRST PREV 1 2 3 4 5 NEXT LAST