Computer Sciences Commons^™

Stereo Matching Using A Modified Efficient Belief Propagation In A Level Set Framework, Stephen Goyer Rogers

Dissertations

Stereo matching determines correspondence between pixels in two or more images of the same scene taken from different angles; this can be handled either locally or globally. The two most common global approaches are belief propagation (BP) and graph cuts.

Efficient belief propagation (EBP), which is the most widely used BP approach, uses a multi-scale message passing strategy, an O(k) smoothness cost algorithm, and a bipartite message passing strategy to speed up the convergence of the standard BP approach. As in standard belief propagation, every pixel sends messages to and receives messages from its four neighboring pixels in EBP. Each …

Two Essays On The Accounting Treatment For Information Technology Expenditures, Kimberly Swanson Church

Graduate Theses and Dissertations

The current accounting measurement and reporting system is ill-equipped to provide intangible investment information that is decision useful for stakeholders in the information economy. Potentially relevant intangible items are not reported on the balance sheet, since current standards mandate the immediate expensing of these intangible items. Presumably FASB's uncertainty with the fundamental issues of extent and timing of future benefits to the firm has led to concerns with relevance, reliability, and objectivity of capitalizing some intangibles, which results in potential long term value generating expenditures being immediately expensed on the income statement. Prior research has demonstrated extent and timing of …

Distributed Storage And Queryng Techniques For A Semantic Web Of Scientific Workflow Provenance, Jaime Alberto Navarro

Theses and Dissertations - UTB/UTPA

In scientific workflow environments, scientists depend on provenance, which records the history of an experiment. Resource Description Framework is frequently used to represent provenance based on vocabularies such as the Open Provenance Model. For complex scientific workflows that generate large amounts of RDF triples, single-machine provenance management becomes inadequate over time. In this thesis, we research how HBase capabilities can be leveraged for distributed storage and querying of provenance data represented in RDF. We architect the ProvBase system that incorporates an HBase/Hadoop backend, propose a storage schema to hold provenance triples, and design querying algorithms to evaluate SPARQL queries in …

New Algorithms For Protein Structure Comparison And Protein Structure Prediction, Zaixin Lu

Theses and Dissertations - UTB/UTPA

Proteins show a great variety of 3D conformations, which can be used to infer their evolutionary relationship and to classify them into more general groups; therefore algorithms of protein structure alignment, protein similarity search and protein structure prediction are very helpful for protein biologists. We developed new algorithms for the problems in this field. The algorithms are tested with structures from the Protein Data Bank (PDB) and SCOP, a Structure Classification of Protein Database. The experimental results show that our tools are more efficient than some well known systems for finding similar protein structures and predicting protein structures.

Algorithmic Temperature 1 Self-Assembly, Yunhui Fu

Theses and Dissertations - UTB/UTPA

We investigate the power of the Wang tile self-assembly model at temperature 1, a threshold value that permits attachment between any two tiles that share even a single bond. When restricted to deterministic assembly in the plane, no temperature 1 assembly system has been shown to build a shape with a tile complexity smaller than the diameter of the shape. Our work shows a sharp contrast in achievable tile complexity at temperature 1 if either growth into the third dimension or a small probability of error are permitted. Motivated by applications in nanotechnology and molecular computing, and the plausibility of …

Parameterized Algorithm For 3-Sat, Yi Gao

Theses and Dissertations - UTB/UTPA

The SAT problem is the classical NP-complete problem. In the past, many methods have been proposed for solving this problem. We investigated a new method for 3-SAT problem, which is a fixed parameterized algorithm proposed in this paper first. This method uses a fixed parameter k, where k is the number of true values in an assignment for checking whether the formula is satisfied or not. The complexity of our algorithm is O(3k ), which is exponentially independent of the number of variables. Theoretical analysis shows that when k is small, this method has smaller search space and higher speed.