Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1991. / Vita. Abstract. Includes bibliographical references (leaves 110-114). Also available via the Internet.

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Generators and goal-directed evaluation provide a rich programming paradigm when combined with traditional control structures in an imperative language. Icon is a language whose goal-directed evaluation is integrated with traditional control structures. This integration provides powerful mechanisms for formulating many complex programming operations in concise and natural ways. However, generators, goal-directed evaluation, and related control structures introduce implementation problems that do not exist for languages with only conventional expression evaluation. This dissertation presents an implementation model using recursion that serves as a basis for both an interpreter and a compiler. Furthermore, in the case of the compiler, optimizations can be performed to improve the efficiency of Icon programs, mainly by reducing the general evaluation strategy whenever possible. The dissertation describes a compile-time semantic analysis used to gather information about the properties of expressions and how they are used at their lexical sites. The optimizations that can be performed using this information are illustrated in the context of the compiler model described in the dissertation.

Thesis (M.S. in electrical engineering)--Washington State University, August 2007. / Includes bibliographical references (p. 36-38).

This dissertation addresses two major issues associated with a built-in self-test environment: (1) how to measure whether a given test vector generator is suitable for testing faults with sequential behavior, and (2) how to measure the safety of self-checking circuits. Measuring the two-vector transition capability for a given test vector generator is a key to the selection of the generators for stimulating sequential faults. The dissertation studies general properties for the transitions and presents a novel, comprehensive analysis for the linear feedback shift registers and the linear hybrid cellular automata. As a result, the analysis solves the open problem as to “how to properly separate the inputs when the LHCA-based generator is used for detecting delay faults”. In general, a self-checking circuit has additional hardware redundancy than the original circuit and as a result, the self-checking circuit may have a higher failure rate than the original one. The dissertation proposes a fail-safe evaluation to predict the probability of the circuit not being in the fail-state. Compared with existing evaluation methods, the fail-safe evaluation is more practical because it estimates the safety of the circuit, which is decreasing as time goes on, instead of giving a constant probability measure. Various other results about improving fault coverage for transition delay faults and testing in macro-based combinational circuits are derived as well. / Graduate

Call number: LD2668 .T4 1986 P42 / Master of Science / Computing and Information Sciences

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Thesis (M.S.)--Rochester Institute of Technology, 1988. / Typescript. Includes bibliographical references (leaves 88-89).

Thesis (M.Sc.)--University of Alberta, 2009. / Title from PDF file main screen (viewed on Apr. 1, 2010). A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements for the degree of Master of Science, Department of Computing Science, University of Alberta. Includes bibliographical references.

The process of automated cartographic generalization is critically reviewed, and methods developed for implementation and analysis are discussed. The manner in which automated generalization relates to manual cartographic methods and feature representation is analyzed. It is suggested that the nature of representation of linear features on maps be considered in the analysis of effectiveness of automated generalization. The development of a computer platform for evaluating linear generalization algorithms is described and three studies which make use of the platform are discussed. An analysis of the performance of five simplification algorithms is compared to performance of a random simplification algorithm. It was found that in most cases tested, the five simplification algorithms performed better than random. An analysis of the stability of fractal dimension estimated on simplified lines was conducted and it is suggested that the fractal dimension is a poor guide for linear simplification due the instability in measurement. An examination of the effect of generalization on linear features as represented by contoured topography and paired stream bank lines was performed. Through the use of measurements of slope on contour lines and width on stream lines, it was determined that automated generalization has an effect on linear feature representations. Guidelines for application of linear generalization algorithms are suggested and needs and direction for future research are discussed. / Master of Science