Latest content added for UNT Digital Library Partner: UNT Librarieshttp://digital.library.unt.edu/explore/partners/UNT/browse/?fq=untl_collection:UNTETD&fq=str_degree_department:Department+of+Computer+Science2014-03-26T09:30:20-05:00UNT LibrariesThis is a custom feed for browsing UNT Digital Library Partner: UNT LibrariesA Unifying Version Model for Objects and Schema in Object-Oriented Database System2014-03-26T09:30:20-05:00http://digital.library.unt.edu/ark:/67531/metadc279222/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc279222/"><img alt="A Unifying Version Model for Objects and Schema in Object-Oriented Database System" title="A Unifying Version Model for Objects and Schema in Object-Oriented Database System" src="http://digital.library.unt.edu/ark:/67531/metadc279222/thumbnail/"/></a></p><p>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.</p>Computational Complexity of Hopfield Networks2014-03-24T20:07:29-05:00http://digital.library.unt.edu/ark:/67531/metadc278272/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc278272/"><img alt="Computational Complexity of Hopfield Networks" title="Computational Complexity of Hopfield Networks" src="http://digital.library.unt.edu/ark:/67531/metadc278272/thumbnail/"/></a></p><p>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.</p>Intrinsic and Extrinsic Adaptation in a Simulated Combat Environment2014-03-24T20:07:29-05:00http://digital.library.unt.edu/ark:/67531/metadc278231/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc278231/"><img alt="Intrinsic and Extrinsic Adaptation in a Simulated Combat Environment" title="Intrinsic and Extrinsic Adaptation in a Simulated Combat Environment" src="http://digital.library.unt.edu/ark:/67531/metadc278231/thumbnail/"/></a></p><p>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.</p>Exon/Intron Discrimination Using the Finite Induction Pattern Matching Technique2014-03-24T20:07:29-05:00http://digital.library.unt.edu/ark:/67531/metadc277629/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc277629/"><img alt="Exon/Intron Discrimination Using the Finite Induction Pattern Matching Technique" title="Exon/Intron Discrimination Using the Finite Induction Pattern Matching Technique" src="http://digital.library.unt.edu/ark:/67531/metadc277629/thumbnail/"/></a></p><p>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.</p>Symplectic Integration of Nonseparable Hamiltonian Systems2014-03-24T20:07:29-05:00http://digital.library.unt.edu/ark:/67531/metadc278485/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc278485/"><img alt="Symplectic Integration of Nonseparable Hamiltonian Systems" title="Symplectic Integration of Nonseparable Hamiltonian Systems" src="http://digital.library.unt.edu/ark:/67531/metadc278485/thumbnail/"/></a></p><p>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.</p>Using Normal Deduction Graphs in Common Sense Reasoning2014-03-24T20:07:29-05:00http://digital.library.unt.edu/ark:/67531/metadc277922/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc277922/"><img alt="Using Normal Deduction Graphs in Common Sense Reasoning" title="Using Normal Deduction Graphs in Common Sense Reasoning" src="http://digital.library.unt.edu/ark:/67531/metadc277922/thumbnail/"/></a></p><p>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.</p>A Theoretical Network Model and the Incremental Hypercube-Based Networks2014-03-24T20:07:29-05:00http://digital.library.unt.edu/ark:/67531/metadc277860/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc277860/"><img alt="A Theoretical Network Model and the Incremental Hypercube-Based Networks" title="A Theoretical Network Model and the Incremental Hypercube-Based Networks" src="http://digital.library.unt.edu/ark:/67531/metadc277860/thumbnail/"/></a></p><p>The study of multicomputer interconnection networks is an important area of research in parallel processing. We introduce vertex-symmetric Hamming-group graphs as a model to design a wide variety of network topologies including the hypercube network.</p>A Programming Language For Concurrent Processing2013-06-04T22:29:06-05:00http://digital.library.unt.edu/ark:/67531/metadc164005/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc164005/"><img alt="A Programming Language For Concurrent Processing" title="A Programming Language For Concurrent Processing" src="http://digital.library.unt.edu/ark:/67531/metadc164005/thumbnail/"/></a></p><p>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.</p>Arithmetic Computations and Memory Management Using a Binary Tree Encoding af Natural Numbers2012-10-02T16:18:49-05:00http://digital.library.unt.edu/ark:/67531/metadc103323/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc103323/"><img alt="Arithmetic Computations and Memory Management Using a Binary Tree Encoding af Natural Numbers" title="Arithmetic Computations and Memory Management Using a Binary Tree Encoding af Natural Numbers" src="http://digital.library.unt.edu/ark:/67531/metadc103323/thumbnail/"/></a></p><p>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.</p>Evaluation of MPLS Enabled Networks2008-06-24T18:51:08-05:00http://digital.library.unt.edu/ark:/67531/metadc5797/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc5797/"><img alt="Evaluation of MPLS Enabled Networks" title="Evaluation of MPLS Enabled Networks" src="http://digital.library.unt.edu/ark:/67531/metadc5797/thumbnail/"/></a></p><p>Recent developments in the Internet have inspired a wide range of business and consumer applications. The deployment of multimedia-based services has driven the demand for increased and guaranteed bandwidth requirements over the network. The diverse requirements of the wide range of users demand differentiated classes of service and quality assurance. The new technology of Multi-protocol label switching (MPLS) has emerged as a high performance and reliable option to address these challenges apart from the additional features that were not addressed before. This problem in lieu of thesis describes how the new paradigm of MPLS is advantageous over the conventional architecture. The motivation for this paradigm is discussed in the first part, followed by a detailed description of this new architecture. The information flow, the underlying protocols and the MPLS extensions to some of the traditional protocols are then discussed followed by the description of the simulation. The simulation results are used to show the advantages of the proposed technology.</p>