Verwandte Artikel zu Advances in Information Systems Science: Volume 8
Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Inhaltsangabe
1 A Survey of File Organizations and Performance.- 1. Introduction.- 1.1. Basic Concepts.- 1.2. General Performance Measures.- 1.3. Current Literature.- 2. Primary Key File Organizations.- 2.1. Introduction.- 2.2. Sequential Organization.- 2.3. Direct Organization.- 2.4. Indexed Sequential Organization.- 2.5. Index Tree Structures.- 2.5.1. B-trees.- 2.5.2. VSAM.- 2.6. Comparative Evaluation and Simulation.- 2.7. Summary.- 3. Secondary Key File Organizations.- 3.1. Introduction.- 3.2. Organizations.- 3.2.1. Inverted File.- 3.2.2. Multilist.- 3.2.3. Generalized File Structure.- 3.2.4. Cellular Serial Organization.- 3.2.5. Canonical File Structure.- 3.2.6. Combined Indices.- 3.2.7. Multiple Key Hashing Model.- 3.2.8. Superimposed Coding.- 3.2.9. Combinatorial Filing System.- 3.2.10. Consecutive Retrieval Organization.- 3.3. Evaluation.- 3.4. Index Selection.- 3.5. Summary.- 4. Complex File and Data Base Structures.- 4.1. Combinations of File Structures.- 4.2. Database Models and Their Corresponding File Structures.- 4.3. The Effect of New Hardware Technologies.- 5. Summary.- References and Bibliography.- 2 Linked Forest Manipulation Systems-A Tool for Computational Semantics.- 1. Introduction.- 2. Tree and Linked Forest Manipulation Systems.- 2.1. Subtree Replacement Systems.- 2.2. Linked Forest Manipulation Systems.- 3. Describing a Programming Language Formally.- 3.1. The Syntax Part.- 3.2. The Semantics Part.- 4. Formalism for Linked Forest Manipulation Systems.- 4.1. Trees and Forests.- 4.2. Trees and Forests with a Pivotal Node.- 4.3. Operations on Trees and Forests.- 4.3.1. Concatenation and Superposition of Trees.- 4.3.2. Skeletal Operator on Trees.- 4.3.3. Subtree Replacement.- 4.3.4. Substructure Replacement.- 4.3.5. Replacement of Substructures in Forests.- 4.4. Linked Forests; Label, Pointer and Tree Parameters.- 4.4.1. Linked Forests.- 4.4.2. Label, Pointer and Tree Parameters.- 4.4.3. Substitution of Parameters.- 4.4.4. Functional Denotations.- 4.5. Linked Forest Manipulation Systems.- 4.5.1. Informal Description of the System.- 4.5.2. Production Schemas.- 4.5.3. Transformation on Linked Forests.- 5. Model for Formal Description of Programming Languages.- 6. Examples.- 6.1. An ALG Program.- 6.2. Syntax and Semantics of ?-expression.- References.- 3 Software Development for Digital Control.- 1. Introduction.- 1.1. Background.- 1.2. Approach.- 2. Hardware.- 2.1. Computers.- 2.1.1. Single-Component Microcomputers.- 2.1.2. Single-Board Computers.- 2.1.3. High-Performance Microcomputers.- 2.1.4. Development Systems.- 2.2. Interface Equipment.- 2.2.1. Communication.- 2.2.2. Analog I/O.- 2.2.3. Discrete Signals and Power Switching.- 2.2.4. Direct Digital Transducers and Actuators.- 2.2.5. Future Trends.- 3. Development of Digital Algorithms.- 3.1. Background.- 3.2. A First-Order System Example.- 3.3. Digital PID.- 3.3.1. The Ideal PID.- 3.3.2. Interactive PID.- 3.3.3. Some PID Variants.- 4. Implementation Considerations.- 4.1. Computational Requirements.- 4.2. Sampling Requirements.- 4.3. Numerical Methods.- 4.3.1. Integration.- 4.3.2. Differentiation.- 4.4. Additional Comments.- 4.4.1. Special Features.- 4.4.2. Other Digital Algorithms.- 5. Software.- 5.1. Overview.- 5.2. Errors and Debugging.- 5.3. Programming Languages.- 5.4. Software Practices.- 5.4.1. Program Development.- 5.4.2. Documentation.- 6. Conclusions.- References.- 4 Clustering Analysis and Its Applications.- 1. Introduction.- 2. Distance Functions.- 2.1. Data Described by Vectors.- 2.2. Distance Functions for Data in Vector Form.- 2.3. Data Described by Picture Description Language.- 2.4. Distance Functions for Data Described by Picture Description Language.- 2.5. The Distance Matrix and the Similarity Matrix.- 3. Clustering Analysis-Graph Theoretical Approach.- 3.1. T-clusters.- 3.2. Minimal Spanning Trees.- 3.3. The Construction of Minimal Spanning Trees.- 3.4. Producing T-clusters from a Minimal Spanning Tree.- 3.5. Minimal Spanning Trees and Hierarchical
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
(Keine Angebote verfügbar)
Buch Finden: Kaufgesuch aufgebenSie finden Ihr gewünschtes Buch nicht? Wir suchen weiter für Sie. Sobald einer unserer Buchverkäufer das Buch bei AbeBooks anbietet, werden wir Sie informieren!
Kaufgesuch aufgeben
