# Browse Dissertations and Theses - Computer Science by Title

• (2012-02-06)
The severity and number of intrusions on computer networks are rapidly increasing. Preserving the availability and integrity of networked computing systems in the face of those fast-spreading intrusions requires advances ...

application/pdf

PDF (3Mb)
• (1988)
Explanation-based learning (EBL) is a learning method which uses existing knowledge of the domain to construct an explanation for why a specific example is a member of a concept or why a specific combination of actions ...

application/pdf

PDF (11Mb)
• (1975)

application/pdf

PDF (3Mb)
• (1992)
The research contribution of this dissertation is a formal, computational model of the semantics of negation in natural language; its major components are two knowledge representation formalisms with Boolean semantics: a ...

application/pdf

PDF (10Mb)
• (2013-08-22)
Due to the abundance and rapid growth of opinionated data on the Web, research on opinion mining and summarization techniques has received a lot of attention from industry and academia. Most previous studies on opinion ...

application/pdf

PDF (1Mb)
• (1989)
We study the numerical solution of Hessenberg form differential algebraic equations by variable stepsize generalized backward difference formulae (GBDF). GBDF methods of sufficiently high order are shown to converge for ...

application/pdf

PDF (3Mb)
• (2012-09-18)
As general-purpose robots begin to find their way into the household and workplace, there will be a demand for software to run on these robots. We foresee the proliferation of robot apps that use a common set of abstractions ...

application/pdf

PDF (584Kb)
• (2010-08-31)
Smoothed aggregation-based (SA) algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. While SA has been effective over a ...

application/pdf

PDF (4Mb)
• (1988)
Explanation-based learning is a recently developed approach to concept acquisition by computer. In this type of machine learning, a specific problem's solution is generalized into a form that can later be used to solve ...

application/pdf

PDF (11Mb)
• (2010-01-06)
This thesis presents a study of a novel summarization problem called contrastive opinion summarization (COS). Given two sets of positively and negatively opinionated sentences which are often the output of an existing ...

application/pdf

PDF (5Mb)
• (1975)

application/pdf

PDF (9Mb)
• (2009-08-18)
High performance, massively-parallel multi-physics simulations are built on efficient mesh data structures. Most data structures are designed from the bottom up, focusing on the implementation of linear algebra routines. ...

application/pdf

PDF (11Mb)
• (1988)
We consider problems in geometric probing, the algorithmic study of determining a geometric structure or some aspect of that structure from the results of a mathematical or physical measuring device. A variety of problems ...

application/pdf

PDF (6Mb)
• (1996)
Macromolecules such as proteins and DNA have complex spatial structures which are often important for their biological functions. The idea of molecular shape and shape complementarity play crucial roles in protein folding, ...

application/pdf

PDF (4Mb)
• (1994)
This research explores the representational and computational complexities of qualitative reasoning about time-varying behavior. Traditional techniques employ qualitative simulation (QS) to compute envisionments (i.e. ...

application/pdf

PDF (7Mb)
• (2012-02-01)
In recent years, the emergence of cloud computing, and software paradigms such as service-oriented architectures (SOAs), has led to the proliferation of Web services. One of the most important factors of the Web services ...

application/pdf

PDF (6Mb)
• (1990)
We propose the use of graph grammars as a theory to organize programming of highly-concurrent systems. To understand the interactions among components of a concurrent system it is useful to visualize the system as dynamically ...

application/pdf

PDF (12Mb)
• (1992)
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to H can be obtained from G by a series of vertex deletions, edge deletions, and edge contractions. Graph minors have been ...

application/pdf

PDF (5Mb)
• (2012-02-06)
A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that strongly-typed heterogeneous information networks are prevalent in the real world. ...

application/pdf

PDF (230Kb)
• (1972)

application/pdf

PDF (4Mb)