Download Free A Flexible Efficient Computer System To Answer Human Questions Book in PDF and EPUB Free Download. You can read online A Flexible Efficient Computer System To Answer Human Questions and write the review.

Picture processing by computer has found its application in various fields. Character recognition has shown the most practical success. Furthermore, the techniques span much more sophisticated applications such as interpretation of biomedical images and X-ray films, measurement of images in nuclear physics, processing of a large volume of pictorial data sent from the satellites, etc. The particular problem attacked in this thesis is computer analysis and identification of human faces. Pictures of human faces are successfully analyzed by a computer program which extracts face feature points, such as nose, mouth, eyes, and so on. The program was tested with more than 800 photographs The research has been done with main emphasis on the method of how to incorporate the picture structures into the picture anlysis program. The success of the program is due to the employment of a flexible picture analysis scheme with feedbacks, which will be described in the next chapter. An experiment on face identification of 20 people was also conducted. I-1. Picture Analysis and Recognition- New Aspects When shown the pictures of the human face of Fig. 1-1, we can immediately tell the positions of the nose, mouth and eyes; and more- over, we can say that both pictures surely portray the same person. Picture analysis and recognition by computer concerns itself with this type of two-dimensional image processing. In this thesis, I selected human-face pictures as objects of processing.
Shape grammars provide a means for the recursive specification of shapes. The formalism for shape grammars is designed to be easily usable and understandable by people and at the same time to be adaptable for use in computer programs. Shape grammars are similar to phrase structura grammars, which were developed by Chomsky [ 1956, 1957]. Where a phrase structura grammar is defined over an alphabet of symbols and generates a language of sequences of symbols, a shape grammar is defined over an alphabet of shapes and generates a language of shapes. This dissertation explores the uses of shape grammars. The dissertation is divided into three sections and an appendix. In the first section: Shape grammars are defined. Some simple examples are given for instructiva purposes. Shape grammars are used to generate a new class of reversible figures. Shape grammars are given for some well-known mathematical curves (the Snowflake curve, a variation of Peano's curve, and Hilbert's curve). To show the general computational power of shape grammars, a procedura that given any Turing machine constructs a shape grammar that simulates the operation of that Turing machine is presented. Related work on various formalisms for pictura grammars is described. A symbolic characterization of shape grammars is given that is useful for implementing shape grammars in computer programs.
1.0 2 information structures, and the runtime efficiency available using lower level data structures. We believe these runtime inefficiencies can be remedied by providing a library of representations for the information structures and a user assisted automatic system to choose appropriate elements from this library for the user's programs. The main problems in such an automatic approach are: 1). Building a library of representations; 2). Characterizing the properties of these representations; 3). understanding how the user's program actually uses the abstract information structures; and -4). efficiently matching the user program needs with the properties of the known representations. The research reported here is an attempt to demonstrate the feasibility of such automatic representation selection. We allow the user to express data in terms of relations, sets, and sequences. Our system then obtains information by analysis of the program, execution statement profiles and interrogation of the user. Using that information, the system selects efficient (in terms of time and space) low level implementations for the user's information structures from a fixed library of information structure representations. Though we have considered only a few abstract information structures (those available in our programming language, SAIL) we believe the techniques used in this system are generally applicable.
This book is a presentation of my recent research work into the theory and applications of mathematical relations between finite sets. The consequent results and concepts are expressed in 'conjunction' with the idea of a union of simplicial complexes and the algorithms and overall methodology have become known as Q-Analysis. The mathematical ideas are essentially comhinatorial and are developed in Section-A of the book, whilst Section-R contains an application to a community study (that of the IJniversity of Rssex). All of the work has been published elsewhere, in the usual form of papers, and a comprehensive introduction to the whole approach will be found in my earlier book, Mathematical Structure in Human Affairs (Heinemann, London 1974). Much of the research work referred to in this present hook would not have been possible without the co-operation of my research team, of whom I would particularly like to thank J.II. Johnson, and its puhlication owes a lot to the secretarial help provided by ~Iary Low. R.H. Atkin IJniversity of Rssex U.K.
"This comprehensive reference work provides immediate, fingertip access to state-of-the-art technology in nearly 700 self-contained articles written by over 900 international authorities. Each article in the Encyclopedia features current developments and trends in computers, software, vendors, and applications...extensive bibliographies of leading figures in the field, such as Samuel Alexander, John von Neumann, and Norbert Wiener...and in-depth analysis of future directions."
The role of the computer in the practice of organic chemistry has been firmly established over the past decade. Its uses as a large scale information storage and retrieval device in chemistry have been too numerous to mention. More recently, the applicability of computers to the problem of discovering valid and reasonable synthesis routes for organic molecules has been demonstrated. This has been both as an adjunct to the 1 chemist in the on-line interactive mode ,2,3 and also as a wholly computer-directed system seeking to simulate the intelligent prob- 4 lem-solving activity of the human organic synthetic chemist. ,5 In all of these computer applications to organic chemistry, it has been necessary to devise some computer-compatible repres- tation of an organic molecule that is both canonical and c- venient for table look-ups. This is in order that entities that have been constructed at different times under different circumstances can be identified and classified, with identical molecules being recognized as such even if their connection matrices list the elements of the molecule in different orders. E. J. Corey and W. T. Wipke, Science, 166, 178 (1969). 2 E. J. Corey, W. T. Wipke, R. D. Cramer III and W. J. Howe, J. Americ. Chern. Soc. , 94, 421 (1972) and 431 (1972). 3 E. J. Corey, R. D. Cramer III and W. J. Howe, ~. Americ. Chern. Soc. , 94, 440 (1972). 4 H. L. Gelernter, N. S. Sridharan and A. J.