Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
|---|---|---|---|---|---|
Searching... | 30000010127831 | QA76.9.H85 K637 2007 | Open Access Book | Book | Searching... |
Searching... | 30000010127832 | QA76.9.H85 K637 2007 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
A comprehensive look at General automata and how it can be used to establish the fundamentals for communication in human-computer systems
Drawing on author Eldo C. Koenig's extensive expertise and culling from his thirty-four previously published works, this seminal resource presents knowledge structures for communication in Human-Computer Systems (HCS) based on General automata. The resulting model provides knowledge representations for software engineering.
Of the many features required for a method to achieve the desired communication in HCS, Knowledge Structures for Communications in Human-Computer Systems identifies six of them in great length-extracting and storing the knowledge of sentences; knowledge association; deductive processes; inferences; feedback; and sequencing of knowledge-along with illustrations for achieving them by the General Automata Method. After presenting the analysis for each feature, the book includes practical applications that illustrate the results. Koenig also describes algorithms and programs that achieve some of the features, and provides readers with additional algorithms and further research.
Richly illustrated throughout to elucidate concepts, Knowledge Structures for Communications in Human-Computer Systems is an excellent teaching text suitable for both academic and industrial settings.
Author Notes
Eldo C. Koenig began his professional career with the U.S.A. War Department, Manhattan District, in work associated with the atomic bomb. A retired professor of the University of Wisconsin-Madison's computer sciences department, Koenig is an active member of ACM, IEEE Computer Society, and the AAAS. He has published over fifty works pertaining to computers and computing and was the recipient of several prestigious awards, including the Allis-Chalmers Fellowship Award and the Alfred Noble Prize in 1951.
Reviews 1
Choice Review
Building on a lifetime of research and a distinguished career in computer sciences, including a Nobel Prize, Koenig (retired, Univ. of Wisconsin-Madison) in a comprehensive monograph has cumulated his work on general automata and its use in establishing fundamentals for communication in human-computer systems. He provides a model for knowledge presentation to design communication structures for highly interactive human-computer systems (HCS) based on a general automata method (GAM), i.e., anything that can move and act by itself. He describes and provides clear understanding of six required features needed to achieve the GAM for HCS: extracting and storing sentence knowledge; knowledge association; deductive processes; inferences; feedback; and sequencing of knowledge. He illustrates the results, provides additional algorithms and sample programs, and suggests further possibilities for research. This model for using the order of automata to describe knowledge--treating it mathematically via processor, environment, and time graphs--is unique in modeling knowledge structures. The material is reliable and tested. Although it is clearly illustrated throughout to elucidate concepts, readers will require good grounding in algebraic language and systems, algebra of sets and functions, combinatorial mathematics of graph theory, etc. Essential teaching resource; exhaustive bibliography, including Koenig's 34 previously published works on GAM in HCS. ^BSumming Up: Recommended. Upper-division undergraduates through professionals. J. A. van Reenen University of New Mexico
Table of Contents
| Preface | p. xi |
| 1 Introduction | p. 1 |
| 1.1 Considerations for Establishing Knowledge Structures for Computers | p. 1 |
| 1.2 Knowledge About Automata as a Subset of World Knowledge | p. 2 |
| 1.2.1 General Automata | p. 4 |
| 1.2.2 Extracting and Storing the Meanings of Sentences | p. 6 |
| 1.2.3 Associating Knowledge | p. 9 |
| 1.2.4 Establishing Conclusions and Inferences | p. 14 |
| Exercises | p. 17 |
| 2 A General Automaton | p. 19 |
| 2.1 Formal Analysis for a General Automaton | p. 19 |
| 2.1.1 General Analysis | p. 19 |
| 2.1.2 Graph Model | p. 28 |
| 2.1.3 Select Properties of the Graph Model | p. 41 |
| 2.2 An Application of the Disciplines to the Modeling of Natural Automata | p. 48 |
| 2.2.1 A Case Study | p. 49 |
| 2.2.2 Required State Changes | p. 52 |
| 2.2.3 Algorithm for Determining Required State Changes | p. 58 |
| Exercises | p. 60 |
| 3 A General Automaton: Detailed Analysis | p. 63 |
| 3.1 Distinguishable Receptors and Effectors | p. 63 |
| 3.2 Nonhomogeneous Environments | p. 67 |
| 3.3 Transformation Response Components | p. 70 |
| 3.4 Nonshared Environments Interpreted as Distinguishable | p. 71 |
| 3.4.1 Model for Performance in Both Shared and Nonshared Environments | p. 72 |
| 3.4.2 Model for Performance in Shared Environments | p. 77 |
| Exercises | p. 79 |
| 4 Processing of Knowledge About Automata | p. 81 |
| 4.1 Formulation of a Language Information Theory | p. 82 |
| 4.1.1 Class 1 Sentence | p. 86 |
| 4.1.2 Class 2 Sentence | p. 89 |
| 4.1.3 Class 3 Sentence | p. 93 |
| 4.1.4 Class 4 Sentence | p. 94 |
| 4.1.5 Class 5 Sentence | p. 98 |
| 4.1.6 Class 6 Sentence | p. 101 |
| 4.1.7 Class 7 Sentence | p. 102 |
| 4.2 Extracting and Storing the Meaning of Sentences by Computer | p. 103 |
| 4.2.1 Description of an Algorithm | p. 104 |
| 4.3 Knowledge Association | p. 105 |
| 4.3.1 Association by Combining Graphs Through Common Points | p. 108 |
| 4.3.2 Associations by Combining Graph (n + 1)-Tuples | p. 110 |
| 4.3.3 Computer Methods for Association of Knowledge | p. 112 |
| 4.4 Deductive Processes | p. 113 |
| 4.4.1 Deductive Processes Related to Association Through Common Points | p. 113 |
| 4.4.2 Deductive Processes Related to Association by Combining Graph Tuples | p. 117 |
| 4.4.3 Deductive Processes with Aristotelian Form A as a Premise | p. 120 |
| 4.5 Inferences | p. 124 |
| 4.5.1 Inferences Related to a Single Graph Tuple of Associated Knowledge | p. 124 |
| 4.5.2 Inferences Related to More than One Graph Tuple of Associated Knowledge | p. 134 |
| Exercises | p. 136 |
| 5 A General System of Interactive Automata | p. 139 |
| 5.1 Formal Analysis for a General System of Interactive Automata | p. 139 |
| 5.1.1 General Analysis | p. 139 |
| 5.1.2 Microsystem Model | p. 149 |
| 5.1.3 Macrosystem Model | p. 156 |
| 5.2 Example Applications | p. 162 |
| 5.2.1 A Two-Component System | p. 162 |
| 5.2.2 A System of Many Components | p. 171 |
| Exercises | p. 173 |
| 6 Processing of Knowledge About Systems of Automata | p. 175 |
| 6.1 A General System of Interactive Automata: Detailed Analysis | p. 175 |
| 6.1.1 The Microsystem Model | p. 176 |
| 6.1.2 The Macrosystem Model | p. 176 |
| 6.2 Knowledge Structures for Sentences Describing Systems of Interactive Automata | p. 177 |
| Exercises | p. 184 |
| 7 Changing Expressions of Knowledge for Communication from One Form and Style to Another | p. 185 |
| 7.1 Introduction | p. 185 |
| 7.2 Sets and Relations | p. 187 |
| 7.3 Establishing Open Expressions and Open Sentences | p. 189 |
| 7.4 Selecting Subsets of Open Expressions | p. 193 |
| 7.5 Applying the Results of the Above Analysis | p. 195 |
| 7.6 Summary and Conclusions | p. 199 |
| Exercises | p. 202 |
| 8 Electronic Security Through Pseudo Languages | p. 203 |
| 8.1 Introduction | p. 203 |
| 8.2 Definitions, Sets, and Relations | p. 204 |
| 8.3 Analysis for E-Security Through Pseudo Languages | p. 205 |
| 8.3.1 A Basic E-Security System | p. 205 |
| 8.3.2 A Two-Step Encryption System | p. 208 |
| 8.3.3 E-Signing | p. 212 |
| 8.4 Summary and Conclusions | p. 213 |
| Exercises | p. 213 |
| Appendix A Analysis for an Effective Operation of a General Automaton | p. 215 |
| A.1 Introduction | p. 215 |
| A.2 Recursive Methods | p. 216 |
| A.3 Effective Operation Analysis | p. 236 |
| Exercises | p. 241 |
| Appendix B Analysis for an Effective Operation of a General System of Interactive Automata | p. 243 |
| B.1 Introduction | p. 243 |
| B.2 Microsystem Graphs | p. 248 |
| B.3 Macrosystem Graphs | p. 260 |
| B.4 Example | p. 271 |
| Exercises | p. 272 |
| References | p. 273 |
| Index | p. 279 |
