| 000 | 08013nam a2200877 i 4500 | ||
|---|---|---|---|
| 001 | 5988895 | ||
| 003 | IEEE | ||
| 005 | 20200421114120.0 | ||
| 006 | m o d | ||
| 007 | cr |n||||||||| | ||
| 008 | 070509t20152007njua ob 001 0 eng d | ||
| 020 |
_z0470052104 _qelectronic |
||
| 020 |
_z9780471998136 _qpaper |
||
| 020 |
_a9780470052105 _qelectronic |
||
| 024 | 7 |
_a10.1002/0470052104 _2doi |
|
| 035 | _a(CaBNVSL)mat05988895 | ||
| 035 | _a(IDAMS)0b00006481624698 | ||
| 040 |
_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL |
||
| 050 | 4 |
_aQA76.9.H85 _bK64 2007eb |
|
| 082 | 0 | 4 |
_a004.01/9 _222 |
| 100 | 1 |
_aKoenig, Eldo C. _q(Eldo Clyde), _d1919- _eauthor. |
|
| 245 | 1 | 0 |
_aKnowledge structures for communications in human-computer systems _h[electronic resource] : _bgeneral automata-based / _cEldo C. Koenig. |
| 264 | 1 |
_aHoboken, New Jersey : _bWiley-Interscience, _cc2007. |
|
| 300 |
_a1 PDF (1 online resource (xii, 281 pages)) : _billustrations. |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aelectronic _2isbdmedia |
||
| 338 |
_aonline resource _2rdacarrier |
||
| 490 | 1 |
_aPractitioners ; _v56 |
|
| 500 | _a"IEEE Computer Society, 60th anniversary"--T.p. | ||
| 504 | _aIncludes bibliographical references (p. 273-277) and index. | ||
| 505 | 8 | _a4.5.2 Inferences Related to More than One Graph Tuple of Associated Knowledge. -- Exercises. -- 5. A General System of Interactive Automata. -- 5.1 Formal Analysis for a General System of Interactive Automata. -- 5.1.1 General Analysis. -- 5.1.2 Microsystem Model. -- 5.1.3 Macrosystem Model. -- 5.2 Example Applications. -- 5.2.1 A Two-Component System. -- 5.2.2 A System of Many Components. -- Exercises. -- 6. Processing of Knowledge About Systems of Automata. -- 6.1 A General System of Interactive Automata: Detailed Analysis. -- 6.1.1 The Microsystem Model. -- 6.1.2 The Macrosystem Model. -- 6.2 Knowledge Structures for Sentences Describing Systems of Interactive Automata. -- Exercises. -- 7. Changing Expressions of Knowledge for Communication from One Form and Style to Another. -- 7.1 Introduction. -- 7.2 Sets and Relations. -- 7.3 Establishing Open Expressions and Open Sentences. -- 7.4 Selecting Subsets of Open Expressions. -- 7.5 Applying the Results of the Above Analysis. -- 7.6 Summary and Conclusions. -- Exercises. -- 8. Electronic Security Through Pseudo Languages. -- 8.1 Introduction. -- 8.2 Defi nitions, Sets, and Relations. -- 8.3 Analysis for E-Security Through Pseudo Languages. -- 8.3.1 A Basic E-Security System. -- 8.3.2 A Two-Step Encryption System. -- 8.3.3 E-Signing. -- 8.4 Summary and Conclusions. -- Exercises. -- Appendix A: Analysis for an Effective Operation of a General Automaton. -- A.1 Introduction. -- A.2 Recursive Methods. -- A.3 Effective Operation Analysis. -- Exercises. -- Appendix B: Analysis for an Effective Operation of a General System of Interactive Automata. -- B.1 Introduction. -- B.2 Microsystem Graphs. -- B.3 Macrosystem Graphs. -- B.4 Example. -- Exercises. -- References. -- Index. | |
| 505 | 0 | _aPreface. -- 1. Introduction. -- 1.1 Considerations for Establishing Knowledge Structures for Computers. -- 1.2 Knowledge About Automata as a Subset of World Knowledge. -- 1.2.1 General Automata. -- 1.2.2 Extracting and Storing the Meanings of Sentences. -- 1.2.3 Associating Knowledge. -- 1.2.4 Establishing Conclusions and Inferences. -- Exercises. -- 2. A General Automaton. -- 2.1 Formal Analysis for a General Automaton. -- 2.1.1 General Analysis. -- 2.1.2 Graph Model. -- 2.1.3 Select Properties of the Graph Model. -- 2.2 An Application of the Disciplines to the Modeling of Natural Automata. -- 2.2.1 A Case Study. -- 2.2.2 Required State Changes. -- 2.2.3 Algorithm for Determining Required State Changes. -- Exercises. -- 3. A General Automaton: Detailed Analysis. -- 3.1 Distinguishable Receptors and Effectors. -- 3.2 Nonhomogeneous Environments. -- 3.3 Transformation Response Components. -- 3.4 Nonshared Environments Interpreted as Distinguishable. -- 3.4.1 Model for Performance in Both Shared and Nonshared Environments. -- 3.4.2 Model for Performance in Shared Environments. -- Exercises. -- 4. Processing of Knowledge About Automata. -- 4.1 Formulation of a Language Information Theory. -- 4.1.1 Class 1 Sentence. -- 4.1.2 Class 2 Sentence. -- 4.1.3 Class 3 Sentence. -- 4.1.4 Class 4 Sentence. -- 4.1.5 Class 5 Sentence. -- 4.1.6 Class 6 Sentence. -- 4.1.7 Class 7 Sentence. -- 4.2 Extracting and Storing the Meaning of Sentences by Computer. -- 4.2.1 Description of an Algorithm. -- 4.3 Knowledge Association. -- 4.3.1 Association by Combining Graphs Through Common Points. -- 4.3.2 Associations by Combining Graph (n + 1)-Tuples. -- 4.3.3 Computer Methods for Association of Knowledge. -- 4.4 Deductive Processes. -- 4.4.1 Deductive Processes Related to Association Through Common Points. -- 4.4.2 Deductive Processes Related to Association by Combining Graph Tuples. -- 4.4.3 Deductive Processes with Aristotelian Form A as a Premise. -- 4.5 Inferences. -- 4.5.1 Inferences Related to a Single Graph Tuple of Associated Knowledge. | |
| 506 | 1 | _aRestricted to subscribers or individual electronic text purchasers. | |
| 520 | _aA comprehensive look at General automata and how it can be used to establish the fundamentals for communication in human-computer systemsDrawing 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. | ||
| 538 | _aMode of access: World Wide Web. | ||
| 588 | _aDescription based on PDF viewed 12/18/2015. | ||
| 650 | 0 | _aHuman-computer interaction. | |
| 650 | 0 |
_aMachine theory _xMathematical models. |
|
| 650 | 0 | _aKnowledge acquisition (Expert systems) | |
| 655 | 0 | _aElectronic books. | |
| 695 | _aVocabulary | ||
| 695 | _aTiming | ||
| 695 | _aTime factors | ||
| 695 | _aServers | ||
| 695 | _aProgram processors | ||
| 695 | _aReceivers | ||
| 695 | _aMedia | ||
| 695 | _aNatural languages | ||
| 695 | _aMathematical model | ||
| 695 | _aMaterials | ||
| 695 | _aManganese | ||
| 695 | _aKnowledge based systems | ||
| 695 | _aJoining processes | ||
| 695 | _aInteractive systems | ||
| 695 | _aAlgorithm design and analysis | ||
| 695 | _aAnalytical models | ||
| 695 | _aAuditory system | ||
| 695 | _aAutomata | ||
| 695 | _aBibliographies | ||
| 695 | _aComputational modeling | ||
| 695 | _aComputers | ||
| 695 | _aEncryption | ||
| 695 | _aEquations | ||
| 695 | _aFrequency modulation | ||
| 695 | _aGames | ||
| 695 | _aHistory | ||
| 695 | _aIndexes | ||
| 695 | _aInformation theory | ||
| 710 | 2 |
_aJohn Wiley & Sons, _epublisher. |
|
| 710 | 2 | _aIEEE Computer Society. | |
| 710 | 2 |
_aIEEE Xplore (Online Service), _edistributor. |
|
| 776 | 0 | 8 |
_iPrint version: _z9780471998136 |
| 830 | 0 |
_aPractitioners ; _v56 |
|
| 856 | 4 | 2 |
_3Abstract with links to resource _uhttp://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=5988895 |
| 942 | _cEBK | ||
| 999 |
_c59706 _d59706 |
||