Digitized by Kansas Correctional Industries

No description available.

There is no abstract available for this thesis.

Thesis (M.S.)--University of Wisconsin--Madison. / Typescript. eContent provider-neutral record in process. Description based on print version record.

This thesis is concerned with aspects of a theory of machine perception. It is shown that a comprehensive theory is emerging from research in computer vision, natural language understanding, cognitive psychology, and Artificial Intelligence programming language technology. A number of aspects of machine perception are characterized. Perception is a recognition process which composes new descriptions of sensory experience in terms of stored stereotypical knowledge of the world. Perception requires both a schema-based formalism for the representation of knowledge and a model of the processes necessary for performing search and deduction on that representation. As an approach towards the development of a theory of machine perception, a computational model of recognition is presented. The similarity of the model to formal mechanisms in parsing theory is discussed. The recognition model integrates top-down, hypothesis-driven search with bottom-up, data-driven search in hierarchical schemata representations. Heuristic procedural methods are associated with particular schemata as models to guide their recognition. Multiple methods may be applied concurrently in both top-down and bottom-up search modes. The implementation of the recognition model as an Artificial Intelligence programming language called MAYA is described. MAYA is a multiprocessing dialect of LISP that provides data structures for representing schemata networks and control structures for integrating top-down and bottom-up processing. A characteristic example from scene analysis, written in MAYA, is presented to illustrate the operation of the model and the utility of the programming language. A programming reference manual for MAYA is included. Finally, applications for both the recognition model and MAYA are discussed and some premising directions for future research proposed. / Science, Faculty of / Computer Science, Department of / Graduate

Thesis (M.Sc.)--York University, 2008. Graduate Programme in Computer Science and Engineering. / Typescript. Includes bibliographical references (leaves 103-108). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR38845

No description available.

Yeung Kai-hau, Alan. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1995. / Includes bibliographical references. / ACKNOWLEDGMENTS --- p.iv / ABSTRACT --- p.v / Chapter CHAPTER 1 --- Introduction --- p.1 / Chapter 1.1 --- The Information Age --- p.2 / Chapter 1.2 --- The Importance of Input/Output --- p.3 / Chapter 1.3 --- Redundant Arrays of Inexpensive Disks --- p.5 / Chapter 1.4 --- Outline of the Thesis --- p.7 / References --- p.8 / Chapter CHAPTER 2 --- Selective Broadcast Data Distribution Systems --- p.10 / Chapter 2.1 --- Introduction --- p.11 / Chapter 2.2 --- The Distributed Architecture --- p.12 / Chapter 2.3 --- Mean Block Acquisition Delay for Uniform Request Distribution --- p.16 / Chapter 2.4 --- Mean Block Acquisition Delay for General Request Distributions --- p.21 / Chapter 2.5 --- Optimal Choice of Block Sizes --- p.24 / Chapter 2.6 --- Chapter Summary --- p.25 / References --- p.26 / Chapter CHAPTER 3 --- Dynamic Multiple Parity Disk Arrays --- p.28 / Chapter 3.1 --- Introduction --- p.29 / Chapter 3.2 --- DMP Disk Array --- p.31 / Chapter 3.3 --- Average Delay --- p.37 / Chapter 3.4 --- Maximum Throughput --- p.47 / Chapter 3.5 --- Simulation with Precise Disk Model --- p.53 / Chapter 3.6 --- Chapter Summary --- p.58 / References --- p.59 / Appendix --- p.61 / Chapter CHAPTER 4 --- Dynamic Parity Logging Disk Arrays --- p.69 / Chapter 4.1 --- Introduction --- p.70 / Chapter 4.2 --- DPL Disk Array Architecture --- p.73 / Chapter 4.3 --- DPL Disk Array Operation --- p.79 / Chapter 4.4 --- Performance of DPL Disk Array --- p.83 / Chapter 4.5 --- Chapter Summary --- p.91 / References --- p.92 / Appendix --- p.94 / Chapter CHAPTER 5 --- Performance Analysis of Mirrored Disk Array --- p.101 / Chapter 5.1 --- Introduction --- p.102 / Chapter 5.2 --- Queueing Model --- p.103 / Chapter 5.3 --- Delay Analysis --- p.104 / Chapter 5.4 --- Numerical Examples and Simulation Results --- p.108 / References --- p.109 / Chapter CHAPTER 6 --- State Reduction in the Exact Analysis of Fork/Join Queues --- p.110 / Chapter 6.1 --- Introduction --- p.111 / Chapter 6.2 --- State Reduction For Closed Fork/Join Queueing Systems --- p.113 / Chapter 6.3 --- Extension To Open Fork/Join Queueing Systems --- p.118 / Chapter 6.4 --- Chapter Summary --- p.122 / References --- p.123 / Chapter CHAPTER 7 --- Conclusion and Future Research --- p.124 / Chapter 7.1 --- Summary --- p.125 / Chapter 7.2 --- Future Researches --- p.126

Typescript (photocopy). / Digitized by Kansas Correctional Industries

by Lam Hiu-fung. / "Augustr 2004." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (p. 178-182). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.