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

Physical Sciences and Mathematics Commons

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

Articles 1 - 8 of 8

Full-Text Articles in Physical Sciences and Mathematics

Xpath-Based Template Language For Describing The Placement Of Metadata Within A Document, Vijay Kumar Musham Dec 2010

Xpath-Based Template Language For Describing The Placement Of Metadata Within A Document, Vijay Kumar Musham

Computer Science Theses & Dissertations

In the recent years, there has been a tremendous growth in Internet and online resources that had previously been restricted to paper archives. OCR (Optical Character Recognition) tools can be used for digitalizing an existing corpus and making it available online. A number of federal agencies, universities, laboratories, and companies are placing their collections online and making them searchable via metadata fields such as author, title, and publishing organization. Manually creating metadata for a large collection is an extremely time-consuming task, and is difficult to automate, particularly for collections consisting of documents with diverse layout and structure. The Extract project …


Algorithms For Vertex-Weighted Matching In Graphs, Mahantesh Halappanavar Apr 2009

Algorithms For Vertex-Weighted Matching In Graphs, Mahantesh Halappanavar

Computer Science Theses & Dissertations

A matching M in a graph is a subset of edges such that no two edges in M are incident on the same vertex. Matching is a fundamental combinatorial problem that has applications in many contexts: high-performance computing, bioinformatics, network switch design, web technologies, etc. Examples in the first context include sparse linear systems of equations, where matchings are used to place large matrix elements on or close to the diagonal, to compute the block triangular decomposition of sparse matrices, to construct sparse bases for the null space or column space of under-determined matrices, and to coarsen graphs in multi-level …


A Longitudinal Metric Study Of Postgresql Software Archeology In Open Source, Terry Franklin Byrum Dec 2003

A Longitudinal Metric Study Of Postgresql Software Archeology In Open Source, Terry Franklin Byrum

Computer Science Theses & Dissertations

Open source software development is credited as the basic fuel powering much of the Internet, especially the Web. While many organizations rely heavily on open source, few studies have focused on the dynamics of development methodology. This document contains the results of a longitudinal metric study of the open source database PostgreSQL representing an 8 year period of community development. This study is software archeology, excavating bits of an Internet community, a cultural group, for understanding. Longitudinally, McCabe's cyclomatic complexity and Halstead's software science change tempo in accordance with PostgreSQL's maturity, though meritocracy practices of open source might suggest greater …


Multicast Services For Multimedia Collaborative Applications, Emad Eldin Mohamed Mohamed Jan 2000

Multicast Services For Multimedia Collaborative Applications, Emad Eldin Mohamed Mohamed

Computer Science Theses & Dissertations

This work aims at providing multicast services for multimedia collaborative applications over large inter-networks such as the Internet. Multimedia collaborative applications are typically of small group size, slow group membership dynamics, and awareness of participants' identities and locations. Moreover, they usually consist of several components such as audio, video, shared whiteboard, and single user application sharing engines that collectively help make the collaboration session successful. Each of these components has its demands from the communication layer that may differ from one component to another. This dissertation identifies the overall characteristics of multimedia collaborative applications and their individual components. It also …


Extending Traditional Static Analysis Techniques To Support Development, Testing And Maintenance Of Component-Based Solutions, Robert David Cherinka Jan 2000

Extending Traditional Static Analysis Techniques To Support Development, Testing And Maintenance Of Component-Based Solutions, Robert David Cherinka

Computer Science Theses & Dissertations

Traditional static code analysis encompasses a mature set of techniques for helping understand and optimize programs, such as dead code elimination, program slicing, and partial evaluation (code specialization). It is well understood that compared to other program analysis techniques (e.g., dynamic analysis), static analysis techniques do a reasonable job for the cost associated with implementing them. Industry and government are moving away from more ‘traditional’ development approaches towards component-based approaches as ‘the norm.’ Component-based applications most often comprise a collection of distributed object-oriented components such as forms, code snippets, reports, modules, databases, objects, containers, and the like. These components are …


Designing A High-Quality Network: An Application-Oriented Approach, Sudheer Dharanikota Apr 1997

Designing A High-Quality Network: An Application-Oriented Approach, Sudheer Dharanikota

Computer Science Theses & Dissertations

As new computer network technologies emerge, the application designers and the application users expect an increasing level of quality of service from them. Hence, it is a common practice in the newer technologies to provide more Quality of Service (QoS) components. Until now, these QoS solutions have been both network-technology specific and network-oriented solutions. In this thesis, we present an application-oriented approach to design a high quality network which is independent of the underlying communication technology. In this thesis, we propose a QoS architecture to "provide predictable performance to the end-to-end application users in a high quality networking environment." In …


A Computational Paradigm On Network-Based Models Of Computation, Venkatavasu Bokka Oct 1996

A Computational Paradigm On Network-Based Models Of Computation, Venkatavasu Bokka

Computer Science Theses & Dissertations

The maturation of computer science has strengthened the need to consolidate isolated algorithms and techniques into general computational paradigms. The main goal of this dissertation is to provide a unifying framework which captures the essence of a number of problems in seemingly unrelated contexts in database design, pattern recognition, image processing, VLSI design, computer vision, and robot navigation. The main contribution of this work is to provide a computational paradigm which involves the unifying framework, referred to as the multiple Query problem, along with a generic solution to the Multiple Query problem.

To demonstrate the applicability of the paradigm, a …


Generic Specifications In Lil And In Ada Via Analogies, George Chester Harrison May 1986

Generic Specifications In Lil And In Ada Via Analogies, George Chester Harrison

Computer Science Theses & Dissertations

We address the problem of .making verifiable specifications in generic program units in the Ada Programming Language*. We illustrate the methodologies of LIL proposed by Joseph Goguen and Justify the use of such a specification languages using analogy programming originally proposed by Nachum Dershowitz. The work in these areas is new and noticeably incomplete. We address our concern about the reusability of Ada software in a programming environment that includes a specification language like LIL. * Ada is a registered trademark of the U.S. Government (Ada Joint Program Office)