Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

University of Nebraska - Lincoln

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Series

2003

Articles 1 - 3 of 3

Full-Text Articles in Engineering

Experimental Evaluation Of Constraint Automata Solutions To The Genome Map Assembly Problem, Viswanathan Ramanathan Dec 2003

Experimental Evaluation Of Constraint Automata Solutions To The Genome Map Assembly Problem, Viswanathan Ramanathan

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

DNA sequences are really huge having a length of around 3-4 million base pairs. Hence, each DNA sequence has to be cut down into small fragments using restriction enzymes. Once analyzed, these fragments have to be arranged or assembled into a single set of sequences called a genome map, to obtain the original DNA sequence. This problem is called the Genome Map Assembly Problem. A Constraint-Automata Solution was proposed for this purpose [11]. This thesis improves and implements the Constraint-Automata Solution to find all the possible solutions. The Modified Constraint-Automata Solution was implemented in Perl and executed on parts of …


Constraint Datalog In Trust Management, Scot Anderson Dec 2003

Constraint Datalog In Trust Management, Scot Anderson

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Constraint Datalog holds an increasing role in Trust Management. We discuss several Trust Management systems and give a description of the environment and requirements for Trust Management. Constraint Datalog using addition constraints and approximation theory provides an expressive semantic with which to describe security policies for credentials, delegations and authorizations. Approximation theory allows halting in Constraint Datalog over addition constraints. We use the decision problem of Diophantine equations to show that Constraint Datalog over addition constraints is complete. Combining these two concepts provides an approximately complete, safe language. The problem of constant additions to closed languages provides reasons for using …


User Interface Improvement For Mlpq System, Shasha Wu Apr 2003

User Interface Improvement For Mlpq System, Shasha Wu

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

This thesis describes the experience of migrating the MLPQ constraint database system, a complex standalone Multiple Document Interface (MDI) application, to a server-based remote accessible application. Centralized, standalone MDI application is a common style for personal software products in Windows. For a database management system, server-based, thin-client computing is a more popular infrastructure. Migrating an existing standalone constraint database application to be a web accessible constraint database server is the main goal of this thesis. This migration process provides a method for the constraint database system to collaborate with other specific applications. We rebuild the desktop MLPQ constraint database system …