A generalization of Ramsey theory for graphs, with stars and complete graphs as forbidden subgraphs /

Includes bibliographical references.

Phase plane theory of transistor bistable circuits /

Vita.

A generalization of Ramsey theory for graphs /

Bibliography: p. 16.

Interval generalization of switching theory,

Includes bibliographical references.

Network computer analysis,

Bibliography: p. 25-28.

A summary of current research in computer nets,

"Presented at the 7th Hawaii International Conference on Systems Sciences."

A theory of asynchronous circuits I /

"This work has been supported in part by the Office of Naval Research under Contract NR 044 001"

A generalization of Ramsey theory for graphs /

Includes bibliographical references.

The theory and implementation of SRT division /

Issued also as thesis (M.S.) University of Illinois.

Knowledge base refinement as improving an incorrect, inconsistent and incomplete domain theory

UIUCDCS-R-89-1585

Degrees of unsolvability in the theory of programming languages,

Bibliography: p. 120-123.

The statistical theory of relative errors in floating-point computation /

Thesis (M. S.)--University of Illinois at Urbana-Champaign.

Theory of asynchronous circuits /

"December 6, 1955"

Ex ante evaluations of alternate data structures for end user queries: Theory and experimental test

The data structure of an information system can significantly impact the ability of end users to efficiently and effectively retrieve the information they need. This research develops a methodology for evaluating, ex ante, the relative desirability of alternative data structures for end user queries. This research theorizes that the data structure that yields the lowest weighted average complexity for a representative sample of information requests is the most desirable data structure for end user queries. The theory was tested in an experiment that compared queries from two different relational database schemas. As theorized, end users querying the data structure associated with the less complex queries performed better Complexity was measured using three different Halstead metrics. Each of the three metrics provided excellent predictions of end user performance. This research supplies strong evidence that organizations can use complexity metrics to evaluate, ex ante, the desirability of alternate data structures. Organizations can use these evaluations to enhance the efficient and effective retrieval of information by creating data structures that minimize end user query complexity.

Selecting optimal instantiations of data models - Theory and validation of an ex ante approach

The schema of an information system can significantly impact the ability of end users to efficiently and effectively retrieve the information they need. Obtaining quickly the appropriate data increases the likelihood that an organization will make good decisions and respond adeptly to challenges. This research presents and validates a methodology for evaluating, ex ante, the relative desirability of alternative instantiations of a model of data. In contrast to prior research, each instantiation is based on a different formal theory. This research theorizes that the instantiation that yields the lowest weighted average query complexity for a representative sample of information requests is the most desirable instantiation for end-user queries. The theory was validated by an experiment that compared end-user performance using an instantiation of a data structure based on the relational model of data with performance using the corresponding instantiation of the data structure based on the object-relational model of data. Complexity was measured using three different Halstead metrics: program length, difficulty, and effort. For a representative sample of queries, the average complexity using each instantiation was calculated. As theorized, end users querying the instantiation with the lower average complexity made fewer semantic errors, i.e., were more effective at composing queries. (c) 2005 Elsevier B.V. All rights reserved.