- 巻冊次
-
v. 3 ISBN 9780306394034
内容説明
Information systems science embraces a broad spectrum of topics. It is vir- tually impossible to provide comprehensive and in-depth discussion, other than simple recitals of recent results, of every important topic in each volume of this annual review series. Since we have chosen the former approach, each volume will only cover certain aspects of recent advances in this bur- geoning field. The emphasis in this volume, the third of a continuing series, is focussed upon pattern recognition, pictorial information manipulation, and new approaches to logical design of information networks. In Chapter 1, V. A. Kovalevsky presents a tutorial survey of practical and theoretical developments in pattern recognition. He categorizes the basic developments in three different directions. The first direction is charac- terized by an empirical treatment with highly specialized recognition schemes. In the second direction, the major efforts are centered upon the cre- ation of learning systems capable of improving recognition performance on the basis of past experience.
The majority of the work in the third direction is devoted to the study of the basic structure of complex patterns, the con- struction of mathematical models for pattern recognition, and the analysis of complex pictorial representations. The author elucidates the "heuristics" approach and the "science" approach to pattern recognition problems. This chapter together with Chapter 2 of this volume supplements the chapter on Engineering Principles of Pattern Recognition in Volume 1 to provide a more complete treatment of this subject.
目次
1 Pattern Recognition: Heuristics or Science?.- 1. Introduction.- 2. Principal Directions in Pattern Recognition.- 2.1. Basic Concepts.- 2.2. Heuristic Recognition Methods.- 2.3. Perceptrons.- 2.4. Learning As Approximation to a Decision Function.- 2.5. The Method of Stochastic Approximation.- 2.6. Methods Based on Assumptions About the Properties of the Observed Signals.- 2.7. Applied Results.- 3. Parametric Models of Signals.- 3.1. Distributions with Interfering Parameters.- 3.2. The Problem of Recognition of Complex Signals.- 3.3. The Statistical Problems of Supervised and Nonsupervised Learning.- 3.4. Parametric Models with Reference Patterns.- 4. The Method of Permissible Transformations.- 4.1. Formalization of the Concept of Resemblance.- 4.2. Permissible Transformations.- 4.3. Correlation Method.- 4.4. Effectiveness of the Correlation Method.- 5. Methods of Analyzing Complex Pictures.- 5.1. Formal Syntactic Rules for Constructing Complex Pictures.- 5.2. Description of Complex Pictures in the Presence of Noise (the Method of Reference Sequences).- 5.3. Examples of the Use of the Reference-Sequences Method.- 6. Conclusions.- References.- 2 Feature Compression.- 1. The Role of "Features" in Pattern Recognition.- 1.1. Four Kinds of Pattern Recognition and Features.- 1.2. Component and Composition-Structure Analysis.- 1.3. Pattern Recognition As Induction.- 1.4. Decision Procedure and Features.- 1.5. Selection of Variables.- 1.6. Distance and Feature.- 2. A Concrete Example of Feature Compression-Handwritten ZIP Code Reader.- 2.1. Nature of the Problem.- 2.2. Compression of Invariants.- 2.3. Local Features.- 2.4. Horizontal Zone Feature.- 2.5. Global Features.- 2.6. Feature Compression As Structural Analysis.- 3. Discriminatory Feature Compression-SELFIC.- 3.1. Rotations in Representation Space.- 3.2. Minimum-Entropy Principle.- 3.3. Basic Theorem of SELFIC.- 3.4. Discriminatory Feature Space and SELFIC.- 3.5. Object-Predicate Reciprocity.- 4. Characteristic Feature Compression-CLAFIC.- 4.1. Class-Feature Space.- 4.2. Subspace Model Versus Zone Model.- 4.3. Decision Procedures by Projection and by Entropy.- 5. Implications of Subspace Model-Fuzzy Class.- 5.1. Modular Nondistributive Predicate Lattice.- 5.2. Implications of the New Logic.- 5.3. Fuzzy Class.- References.- 3 Image Processing Principles and Techniques.- 1. Introduction.- 1.1. Central Problems.- 1.2. Processing for Data Compression.- 1.3. Processing for Enhancement.- 1.4. Processing for Classification.- 2. Filter Theory Applied to Images.- 2.1. Spatial Frequency Filtering.- 2.2. Matched Filtering.- 3. Statistical Decision Theory.- 3.1. Decision Theory Formalisms.- 3.2. Special Cases.- 3.3. Commentary on Applications.- 4. Adaptive Network Approaches.- 5. Image Features.- 5.1. Approximating Functions.- 5.2. Random Features.- 5.3. Feature Adaptation.- 5.4. Shape Features.- 5.5. Textural Features.- 5.6. Serially Derived Features.- 5.7. Picture Linguistics.- 5.8. Distance Features.- 6. Implementations: Staging.- 6.1. Realizable Decision Functions.- 6.2. Number of Stages.- 7. Implementations: Parallelism.- 7.1. All-Serial Methods.- 7.2. Parallel Operator, Serial Image Processing.- 7.3. Serial Operator, Parallel Image Processing.- 7.4. All-Parallel Methods.- 8. Electrooptical Devices.- 8.1. Point and Aperture Scanners.- 8.2. Image Parallel Devices.- 9. Digital Computers.- 9.1. The Fast Fourier Transform.- 9.2. Parallel Computers.- 10. Optical Techniques.- 10.1. Coherent Optics.- 10.2. Incoherent Optics.- 11. Comparison of Implementations.- 12. Conclusions.- References.- 4 Computer Graphics.- 1. Introduction.- 2. Devices for Computer Graphics.- 2.1. Noninteractive Graphic Output Devices.- 2.2. Noninteractive Graphic Input Devices.- 2.3. Input for Interaction.- 2.4. Interactive Display Operations.- 3. Modes of Interactive Graphic Systems.- 3.1. Shared Memory with Stand-Alone Dedicated Processor.- 3.2. Buffered Memory Systems.- 3.3. Large Machine with Satellite.- 3.4. Multiaccess Graphics.- 4. Data Structures.- 4.1. The Nature of Data Structure.- 4.2. List Structures.- 4.3. Ring and Associative Structures.- 4.4. Data Structure Operations.- 4.5. Choice of Data Structures.- 5. Graphics Software.- 5.1. Introduction.- 5.2. Techniques for Generation of Display File.- 5.3. Special Techniques.- 6. Graphic Languages.- 6.1. Introductory Remarks.- 6.2. Graphic Command Languages.- 6.3. Picture Processing Languages.- 7. Conclusions.- Appendix 1. Choice of Equations for Generating a Circle.- Appendix 2. Method Given by Forrest for Parametrizing a Conic.- References.- 5 Logical Design of Optimal Digital Networks by Integer Programming.- 1. Introduction.- 2. Features of Logical Design by Integer Programming.- 3. Design of an Optimal Combinational Network with a Given Type of Gate by Integer Programming.- 3.1. General Mathematical Formulation of Design Procedures with Threshold Gates.- 3.2. Design of an Optimal Network with NOR Gate or Other Types of Gates.- 4. Design of an Optimal Combinational Network with Building Blocks (or Composite Gates) by Integer Programming.- 4.1. Feed-Forward Network Formulation and Design Procedure of an Optimal Combinational Network.- 4.2. Computational Examples.- 4.3. Design of Optimal Networks with Composite Gates.- 5. Other Applications of the Integer Programming Logical Design Method.- 5.1. Design of Combinational Optimal Networks under Miscellaneous Conditions.- 5.2. Design of an Error-Correcting Optimal Network.- 5.3. Diagnosis of a Network by Integer Programming.- 5.4. Design of Optimal Sequential Networks by Integer Programming.- 6. Concluding Remarks.- References.
- 巻冊次
-
v. 4 ISBN 9780306394041
内容説明
Information systems science is advancing in various directions with rapid strides. Many diversified ideas and methodologies have been revised and extended. Numerous new techniques and approaches have been con- ceived and developed. Some recent advances are covered in this series. The fourth volume of this series provides in-depth discussions of some newly developed theories and techniques concerning computer language-level augmentation, time-sharing systems, text editing systems, grammars and automata, and error correcting codes in computer arithmetic. In Chapter 1, V. K. Smirnov presents an authoritative review of the augmentation of machine language level. He discusses the effects of ex- tension of computer functions upon machine language and the influence of development of software systems upon the augmentation of computer language level. Some specific ways of augmenting the machine language level are examined. The problem of information organization, storage, search, and retrieval in a computer is studied. The introduction of higher-level languages has stimulated widespread applications of computers.
Formal language theory has been recognized as a topic offundamental importance in the study of information systems science. In Chapter 2, M. A. Harrison examines the phrase-structure grammars, the right linear grammars, the context-free grammars, the LR(k) grammars, and the context-sensitive grammars. The author discusses the relations between mathematical models of computers and a family of formal lan- guages. The language theory may stimulate new ideas for the augmentation of machine language level.
目次
1 Augmentation of Machine Language Level.- 1. Introduction.- 2. Software and Hardware Functions.- 3. Relation between Source and Machine Languages.- 4. Hardware Interpretation of Expressions.- 4.1. Advances in Programming and New Principles of Computer Organization.- 4.2. Use of Stack and Its Implementation.- 4.3. Direct Execution of Expressions.- 5. Memory Organization.- 5.1. Memory Addressing.- 5.2. Use of Names.- 5.3. Nonlinear Memory.- 6. Program Information Structure.- 7. Subroutine Calls.- 8. Computers with Built-in Compilers.- 9. Conclusion.- References.- 2 On the Relation between Grammars and Automata.- 1. Introduction.- 2. Phrase-Structure Grammars.- 2.1. Introduction.- 2.2. Context-Sensitive Grammars.- 2.3. Context-Free Grammars.- 2.4. Linear Context-Free Grammars.- 3. Finite Automata and Right Linear Grammars.- 4. Pushdown Automata and Context-Free Grammars.- 5. Deterministic Pushdown Automata and LR(k) Grammars...- 6. Linear Bounded Automata and Context-Sensitive Grammars. ..- 7. Turing Machines and Phrase-Structure Grammars.- References.- 3 An Introduction to Information Structures and Paging Considerations for On-Line Text Editing Systems.- 1. Introduction.- 1.1. Typical Structure of a Text Editor.- 1.2. The Classes of Editors.- 2. Basic Considerations for a Text Editor's Information Structure.- 2.1. External Divisions (Segmentation).- 2.2. Internal Divisions (Paging).- 2.3. Storage Structure and Editing Operations.- 2.4. Garbage Collection.- 2.5. Arbitrary Access to Text and References.- 2.6. Summary of Basic Considerations.- 3. Fixed-Length Context Editors.- 4. Variable-Length-Line and "Superline" Editors.- 4.1. QED: A Superline Program Editor.- 4.2. ATS and VIPcom: Line Text Editors.- 5. Statement-Oriented Editors.- 5.1. The On-Line Text System (NLS).- 6. String-Oriented Editors.- 6.1. The Hypertext Editing System (HES).- 6.2. The File Retrieval and Editing System (FRESS).- 7. Conclusions.- References.- 4 An Introduction to the Structure of Time-Shared Computers.- 1. Introduction.- 1.1. Evolution of Computer Systems Usage.- 1.2. Time-Sharing System Components.- 1.3. Time-Sharing System Criteria.- 2. Computer Hardware.- 2.1. Introduction.- 2.2. Memories.- 2.3. Processors.- 2.4. Control Units.- 2.5. Switches.- 2.6. Terminals and Transducers.- 2.7. Hardware for Memory Mapping and Multiprogramming.- 2.8. Communication among Parts of Programs.- 2.9. Special Hardware.- 2.10. Summary.- 3. The Operating System Structure.- 3.1. Introduction.- 3.2. The Common User Programs.- 3.3. User Program Debugging Facilities.- 3.4. Console Control Program.- 3.5. The Operating System.- 3.6. Summary.- 4. The PDP-10 Time-Sharing System Structure.- 4.1. User Program Environment.- 4.2. The Operating System.- 5. The Economics of Time-Sharing.- 5.1. Time-Sharing versus Batch Applications.- 5.2. System Cost.- 5.3. System Component Costs and Benefits.- 6. Concluding Remarks.- References.- 5 Error-Correcting Codes in Computer Arithmetic.- 1. Introduction.- 1.1. Arithmetic Weight.- 1.2. Arithmetic Distance.- 1.3. Errors in Computer Arithmetic.- 2. The General Theory of AN-Codes.- 2.1. Minimum Arithmetic Distance.- 2.2. Error Correction in Integer Arithmetic.- 2.3. Arithmetic Modulo m.- 2.4. Errors in Addition Modulo m.- 2.5. Modular Weight and Modular Distance.- 2.6. Sphere-Packed or Perfect AN-Codes.- 2.7. Comment on Appropriate Values of the Modulus m = AB.- 3. Cyclic AN-Codes.- 3.1. Definition and General Theory.- 3.2. The Length Convention for Cyclic AN-Codes.- 3.3. Single-Error-Correcting AN-Codes.- 3.4. Calculation of Dmin for Cyclic AN-Codes.- 3.5. Mandelbaum-Barrows Equidistant Codes.- 3.6. Intermediate-Distance Cyclic AN-Codes.- 3.7. Analogy to Parity-Check Codes and the Chien-Hong Conjecture.- 4. Multiresidue Codes.- 4.1. Definition and Motivation.- 4.2. Relation to AN-Codes.- 4.3. Multiresidue Codes Derived from Cyclic AN-Codes.- 4.4. Syndromes in Multiresidue Codes.- 4.5. Failures in the Checkers.- 5. Further Comments on Arithmetic Codes.- 5.1. AN-Codes as Communications Codes.- 5.2. Burst Error Correction.- 5.3. Asymmetric Errors.- 6. Implementation of Arithmetic Codes.- 6.1. The Decoding Problem and Its Implementation.- 6.2. The JPL STAR Computer.- 7. Conclusions.- References.
- 巻冊次
-
v. 5 ISBN 9780306394058
内容説明
This volume, the fifth of a continuing series on information systems science, covers four timely topics which are in the mainstream of this field. In each chapter, an attempt is made to familiarize the reader with basic background information on the advances discussed, so that this volume may be used independently or in conjunction with the previous volumes. The emphasis in this volume is focused upon data organization and access methods, software for on-line minicomputer applications, advances in micropro- graming, and gramm ars and recognizers for formal and natural languages. In Chapter 1, P. C. Patton presents a tutorial survey of data organiza- tion and access methods which play a central role in information system design. Research in information processing has been shifted from numerical data processing to nonnumerical information handling. In the latter case, the information is carried not only by the data but also by the structure and organization of the data base. In this chapter, the author provides the reader with a comprehensive review of various data structures, including linear lists, array structures, tree structures, and multilinked structures.
He also discusses the important problem of data-base design and management. This chapter concludes with several examples of information handling systems such as a matrix interpretive system, a generalized information management system, and a criminal justice information system. The rapid reduction in cost and great increase in capability of the mini- computer have made it an attractive machine for information systems.
目次
1 Data Organization and Access Methods.- 1. Introduction.- 1.1. Data Structure in Contrast to Data Content.- 1.2. Memory Structure and Organization.- 1.3. Some Distinctions: Content, Structure, and Physical Storage.- 2. Linear Lists and Processes.- 2.1. Linear List Structures.- 2.2. Storage Representation of Linear List Structures.- 2.3. Computer Storage of Linked Lists.- 2.4. List Processing Languages.- 3. Array Structures.- 3.1. Orthogonal Lists.- 3.2. Data Tables.- 3.3. Matrices.- 3.4. Hypermatrices.- 4. Tree Structures.- 4.1. Trees and Their Representation.- 4.2. Characteristics of Tree Structures.- 4.3. Tree Storage and Access Methods.- 4.4. Multiply Indexed Files.- 5. Multilinked Structures.- 5.1. Ring Structured Data.- 5.2. Directed Graphs.- 5.3. Programming Systems for Multilinked Structures.- 5.4. Graphics Data Processing.- 6. Data Base Design and Management.- 6.1. File Organization.- 6.2. Storage Media.- 6.3. Software and System Facilities.- 6.4. Interrelated Data Bases.- 6.5. Security and Confidentiality.- 7. Some Information Handling Systems.- 7.1. Matrix Interpretative Systems.- 7.2. Generalized Information Management Systems.- 7.3. Criminal Justice Information Systems.- 8. Summary and Conclusions.- 8.1. Information Systems Technology Today.- 8.2. Future Application Requirements.- 8.3. The Challenge to Hardware and System Designers 89 References.- 2 Design of Software for On-Line Minicomputer Applications.- 1. Introduction.- 2. The Keys to Minicomputer Software Organization.- 2.1. Data Structure.- 2.2. Interprogram Communication.- 2.3. Memory Management.- 2.4. Control Structures.- 3. Minicomputer Applications and Their Software Requirements.- 3.1. Data Acquisition and Direct Digital Control.- 3.2. Minicomputer-Based Communication Systems.- 3.3. Discrete Manufacturing Monitoring and Control Systems.- 3.4. Conclusions.- References.- 3 A Survey of the Status of Microprogramming.- 1. Introduction.- 1.1. Basic concepts.- 1.2. Hardwired Control vs. Microprogrammed Control.- 1.3. Programming vs. Microprogramming.- 2. Evolution of Microprogramming.- 2.1. Early Efforts.- 2.2. Contemporary Microprogrammed Computers.- 3. Architectural Variations in Current Microprogrammed Systems.- 3.1. Level of Control.- 3.2. Microinstruction Formats.- 3.3. Memory Considerations.- 4. Emulation.- 4.1. Reprogramming vs. Purely Software Interpretation.- 4.2. Software Interpretation vs. Microprogrammed Emulation.- 4.3. Hardware Compatibilities between Host and Target Systems.- 4.4. Current State of the Art of Emulation.- 5. Microprogrammed Implementation of Key Operating System and Language Translation Primitives.- 5.1. Parallel and Leveled Structures of Processes.- 6. Microdiagnostics.- 6.1. Architectural Implications.- 6.2. Difference between Conventional Diagnostics and Microdiagnostics.- 6.3. Current Status.- 6.4. Maintenance and Microdiagnostics.- 7. Microprogrammed Implementation of New I/O and Memory Devices.- 7.1. Disadvantages of the Conventional Organization.- 7.2. Scheduling via a Special Microprogrammed Processor.- 7.3. Accommodation of I/O and Memory Devices.- 8. Strategies for Microprogram Optimization.- 8.1. Optimization Objectives.- 8.2. Microprogram Characteristics.- 8.3. Analysis and Representation of Microprograms.- 8.4. Techniques.- 8.5. Implementation of Optimization Strategies.- 9. Applications of Microprogramming.- 9.1. Process Control.- 9.2. User-Microprogrammable Computers.- 9.3. Reconfiguration and Bypassing of Malfunctioning Subsystems by Microprogramming.- 10. Problem Areas and Future Prospects.- 10.1. Speed.- 10.2. LSI.- 11. Conclusions.- References.- 4 Some Grammars and Recognizers for Formal and Natural Languages.- 1. Introduction.- 2. Grammars and Languages.- 2.1. Types of Grammars.- 2.2. Finite-State Grammars.- 2.3. Context-Free Grammars.- 3. Recognizers and Acceptor Automata.- 3.1. Finite-State Automata.- 3.2. Pushdown Automata.- 3.3. Turing Machines.- 3.4. Linear Bounded Automata.- 4. Transformational Grammar.- 4.1. Base Component.- 4.2. Transformational Component.- 4.3. Semantic Component.- 4.4. Phonological Component.- 4.5. Problems of an Acceptor for Transformational Grammars.- 5. Applications in Information Science.- 5.1. Programming Languages.- 5.2. Natural Languages.- 6. Summary and Conclusions.- References.
- 巻冊次
-
v. 6 ISBN 9780306394065
内容説明
Information systems science is rapidly advancing in many directions. Di- versified ideas, methodologies, and techniques as well as applications have been conceived and developed. This series intends to discuss some of the recent advances in this field. In this volume, we cover four timely topics which are of great current interest. In each chapter, an attempt is made to familiarize the reader with some basic background information on the ad- vances discussed. The emphasis of this volume is placed upon parallel pro- gramming, data structure models in information system design, and the principles of L systems. One of the effective means to enhance computation performance is parallel information processing on multiprocessor systems. In Chapter I, V. E. Kotov discusses the practical aspects of parallel programming. He is concerned with the languages and methods of parallel programming, per- formance an~lysis, and automatic synthesis of parallel programs. In Chapter 2, A. S. Narin'yani presents the formal theory of parallel computations.
These two chapters attempt to correlate and classify various methods in parallel programming, thus providing the reader with a unified approach to this important subject matter. Data structures play an important role in information system design.
目次
1 Theory of Parallel Programming. I. Survey of Practical Aspects.- 1. Introduction.- 2. Parallel Programming Languages and Methods.- 2.1. Extensions of Sequential Programming Languages.- 2.2. Practical Schemes and Structures for Parallel Programs.- 3. Scheduling Problems for Parallel Programs.- 4. Automatic Construction of Parallel Programs.- 4.1. Parallelization of Linear Programs.- 4.2. Parallelization of Acyclic Programs.- 4.3. Parallelization of Cyclic Programs.- 4.4. Parallelization of Expressions.- 4.5. Concluding Remarks on Parallelization.- References.- 2 Theory of Parallel Programming. II. Survey of Formal Models.- 1. Introduction.- 1.1. Notation.- 2. The Memory.- 3. The Operator and Database.- 3.1. Operator.- 3.2. Database.- 4. Computational Processes.- 4.1. Definition.- 4.2. Classes of Processes.- 5. The Metamodel.- 5.1. Metasystem.- 5.2. General Form.- 5.3. Special Classes.- 5.4. Schemata.- 6. The Control.- 6.1. Semantic Definition.- 6.2. Mixed Definition.- 6.3. Syntactic Definition.- 6.4. The Hyperoperator.- 7. Equivalence of Computational Processes.- 7.1. Functional Equivalence.- 7.2. Equivalence of All Results.- 7.3. Cell History Equivalence.- 7.4. Data Graph Equivalence.- 7.5. Colored Data Graph Equivalence.- 7.6. Data-Logical Graph Equivalence.- 7.7. Interrelationship of Equivalence Definitions.- 8. Determinacy of Metasystems.- 9. Equivalence of Metasystems.- 9.1. Functional Equivalence.- 9.2. Cell History Equivalence (h-Equivalence).- 9.3. Data Graph Equivalence (G-Equivalence).- 9.4. Survey of Equivalence Studies.- 10. Asynchronism.- 11. Programs and Systems.- 12. Conclusions.- References.- 3 Data Structure Models in Information System Design.- 1. Data Morphology.- 1.1. What Is Data Morphology?.- 1.2. Concepts and Properties of Name Space.- 1.3. Concepts and Properties of Value Space.- 1.4. The Data Space and Classification of Data Structures.- 1.5. Storage Structures and Mappings.- 1.6. Implementation of Mappings.- 2. Data Structure Models for Simple Information Retrieval.- 2.1. Thesaurus-Based System.- 2.2. Multiattribute Systems.- 2.3. Equivalence of Two Models.- 3. Data Structures for Information Systems of Flexible Use.- 3.1. Databases and Data Banks.- 3.2. Relational Models.- 3.3. Hereditary Models.- 4. Conclusions.- References.- 4 The Mathematical Theory of L Systems.- 0. Introduction.- 1. 1 Schemes and L Systems.- 2. Squeezing Languages out of L Systems.- 2.1. Exhaustive Approach.- 2.2. Selective Approaches.- 2.3. Comparing the Language Generating Power of Various Mechanisms for Defining Languages.- 3. Fitting Classes of L Languages into Known Formal Language Theoretic Framework.- 4. Other Characterizations of Classes of L Languages within the Framework of Formal Language Theory.- 4.1. Closure Properties.- 4.2. Machine Models.- 4.3. Recurrence Systems and Recursion Schemes.- 5. Structural Constraints on L Systems.- 6. Squeezing Sequences out of L Systems.- 7. Growth Functions.- 7.1. Definitions and Basic Problems.- 7.2. DOL Growth: Equivalence, Analysis, Synthesis.- 7.3. DIL Growth.- 7.4. Length Sets.- 8. Decision Problems.- 8.1. Some Decidability and Undecidability Results.- 8.2. DOL Equivalence Problem.- 9. Global Versus Local Behavior of L Systems.- 10. Deterministic Versus Nondeterministic Behavior of L Systems.- 11. L Transformations.- 12. Getting Down to Properties of Single L Languages or Sequences.- 13. Generalizing L System Ideas: Toward a Uniform Framework.- 14. Some Proof Techniques.- 15. Conclusions.- References.
- 巻冊次
-
v. 7 ISBN 9780306394072
内容説明
Information systems science is advancing in many directions with rapid strides. Many diversified ideas, methodologies, and techniques have been conceived and developed for improving the design of information systems and for inventing new methods for solving complex information problems. This volume, the seventh of a continuing series on information systems science, covers five timely topics which are in the mainstream of current interest in this growing field. In each chapter, an attempt is made to famil- iarize the reader with some basic background information on the advances discussed, so that this volume may be used independently or in conjunction with the previous volumes. The emphasis in this volume is centered upon diagnosis for digital systems, distributed information networks, micro- computer technology, and data structures for pattern recognition. In recent years, digital systems have found widespread applications in on-line real-time processing. Such applications demand high reliability, availability, and serviceability. Reliability may be improved through the use of highly reliable parts.
Improvement in integrity may be accompanied by retry operation and redundant configuration. Serviceability may be improved by making use of fault diagnosis techniques. Chapter 1 is devoted to this important subject. Fault diagnosis techniques are developed to improve serviceability and to shorten mean time for repair. Kitamura, Tashiro, and Inagaki discuss many recent methods for fault diagnosis and explain them with illustrative examples.
目次
1 Diagnosis Techniques and Methodologies for Digital Systems.- 1. Introduction.- 2. Diagnostic Data Generation Theory.- 2.1. Digital System and Its Faults.- 2.2. Test Data Generation Method.- 2.3. Test Data Optimization.- 2.4. Fault Simulation.- 2.5. Fault Dictionary.- 3. Diagnostic Execution.- 3.1. Test Data Input and Symptom Output.- 3.2. Test and Diagnosis Execution.- 4. Applied Fault Diagnosis Techniques.- 4.1. FLT (Fault Location Technology).- 4.2. Microdiagnostics.- 4.3. ESS (Electronic Switching System) Approach.- 4.4. Practical and Useful Diagnosis Method in Real-World Digital Systems.- 5. Some Problems for Further Research.- 6. Conclusions.- References.- 2 Design for a Distributed Information Network.- 1. Introduction.- 1.1. Overview.- 1.2. The Distributed Network: Design Criteria.- 1.3. The Distributed Network : Implementation Criteria.- 2. Hardware Systems.- 2.1. Basic Modular Unit.- 2.2. Switching Station.- 2.3. Communications.- 3. Software Systems.- 3.1. The System Implementation Language.- 3.2. The Network Communication Language.- 3.3. The Retrieval System.- 3.4. Network Resource Management.- 3.5. The User Oriented Language Interface (UOLI).- 3.6. Information Processing.- 3.7. Network Controller.- 4. Selected Applications.- 4.1. Medical Sciences.- 4.2. Physical Sciences.- 4.3. Nonacademic Applications.- References.- 3 Modeling and Design of Distributed Information Systems.- 1. General Introduction.- 1.1. Distributed Information Systems.- 1.2. Background.- 2. Modeling Distributed Computer Systems.- 2.1. Modeling a Distributed Computer System.- 2.2. Transaction Processing by a Distributed Computer System.- 2.3. An Example.- 3. A Design Procedure for Distributed Computer Systems.- 3.1. Transaction Allocation.- 3.2. Processor Allocation.- 3.3. Line Allocation.- 3.4. File Allocation.- 4. Modeling Distributed Databases.- 4.1. Database Skeleton.- 4.2. An Example of a Database Skeleton.- 4.3. Logical Database Synthesis.- 5. Intelligent Coupler.- 5.1. Locating Information.- 5.2. Query Formulation and Test Run for Queries.- 5.3. Query Languages.- 5.4. Security.- 5.5. Locking in Distributed Information Systems.- 5.6. System Recovery.- 5.7. Performance Measurements and Evaluation.- 6. Concluding Remarks.- References and Suggested Further Reading.- 4 Hardware, Firmware, Software Technology in Microcomputer Systems.- 1. Hardware Organization.- 1.1. Introduction.- 1.2. A Simple Microprocessor.- 1.3. An Improved Microprocessor.- 1.4. A Sophisticated Microprocessor.- 2. Firmware.- 2.1. Definitions.- 2.2. Software LSI.- 2.3. Grand-Scale Integration.- 3. Software.- 3.1. Problems.- 3.2. A System Implementation Language.- 3.3. Pushbutton Programming.- 3.4. Improved Pushbutton Programming.- 4. What Computing Has Come To.- 4.1. How Large Should a Computer Be?.- 4.2. The Cost of Complexity.- 4.3. Large-Scale Versus Micro Hardware.- 4.4. Large-Scale Versus Micro Software.- 4.5. Summary.- References.- 5 Data Structures and Pattern Recognition.- 1. Introduction.- 2. The Pattern Recognition Problem.- 3. The Data Structure Concept.- 4. Pictorial Pattern Recognition and Image Processing.- 5. Review of Applications to Pattern Recognition.- 6. Line Drawings and Chain Codes.- 7. Histograms and Integral Projections.- 8. Medial Axis Transformation.- 9. Generalized Cones.- 10. Syntactic Methods.- 11. Trees in Analysis: Text, Speech, and Line-Drawing Data.- 12. Webs and Trees in Applications.- 13. Structure Learning.- 14. Conclusion.- References.
- 巻冊次
-
v. 8 ISBN 9780306407147
内容説明
This volume, the eighth of a continuing series on information systems science, presents five timely topics which are of current interest in this growing field. In each chapter, an attempt is made to familiarize the reader with some basic background information on the advances discussed, so that this volume may be used independently or in conjunction with the previous volumes. The emphasis in this volume is centered upon file or ganization and performance evaluation, computational semantics, digital control, clustering analysis, and geometric modeling. Chapter I presents a comprehensive survey of file organization. In this chapter, Gudes and Ganesh discuss performance evaluation, imple mentation considerations, relationship to database models, and performance tradeoffs of various file organizations. The semantics of programming languages was discussed in Volume 2 of this series. This topic is revisited by Culik II and Farah from a different point of view. Chapter 2 is concerned with linked forest manipulation and models for formal description of a programming language. Linked trees reveal syntactical properties of a programming language and provide data structures for describing com putational semantics."
- 巻冊次
-
v. 9 ISBN 9780306416446
内容説明
Volume 9 of this series on information systems science presents four timely topics of current interest in this growing field. In each chapter an attempt is made to familiarize the reader with some basic background information on the advances discussed, so that this volume may be used independently or in conjunction with the previous volumes. The emphasis in this volume is on data structures for scene analysis, database management technology, inductive inference in processing pattern-based information, and logic design of MOS networks. Scene analysis has become a very important aspect in information system design. The process of scene analysis involves sensing, segmentation, recognition, and interpretation. Innovative development of algorithms for these tasks requires the utilization of structural relationship prevalent within the sensed data. In Chapter 1, Thomason and Gonzalez discuss the formula tion of data representation techniques and the properties of data structures and databases in scene analysis. In view of the growing importance of database management, Chapter 2 is devoted to an overview of database management technology. In this chapter Kobayashi covers a variety of current topics. The topics discussed include system design methodology, data structure theory, semantic con siderations, calculus-based database operations, database management functions, and the issues of integrity, security, concurrency, and recoverabil ity. This chapter also discusses the end-user languages and several existing database management systems.
目次
1 Data Structures and Databases in Digital Scene Analysis.- 1. Introduction.- 2. Data Structures.- 3. Databases.- 4. Examples of Existing Systems.- 5. Summary.- 2 An Overview of Database Management Technology.- 1. Introduction.- 2. Motivations.- 3. Database as a New Systems Methodology.- 4. Logical Database Structure.- 5. Database Operations.- 6. Other Requirements.- 7. Physical Representation of the Database.- 8. Database Management Functions.- 9. Database Management Systems.- 10. End-User Languages.- 11. Future Research Directions.- 3 Processing of Pattern-Based Information, Part I: Inductive Inference Methods Suitable for use in Pattern Recognition and Artificial Intelligence.- 1. Introduction.- 2. Representation of Patterns.- 3. Algorithm For Decision Rule Inference.- 4. Structure of the Controls for Systematic Implementation of the Inference Procedure.- 5. A Brief description of the Implementation.- 6. Examples.- 4 Processing of Pattern-Based Information, Part II: Description of Inductive Inference in Terms of Transition Networks.- 1. Introduction.- 2. Description of the Inductive Inference Transition Network.- 3. An Inference Algorithm Represented by an Inductive Inference Transition Network.- 4. Implementation and Illustrative examples.- 5 Automated Logic Design of MOS Networks.- 1. Introduction.- 2. Basic Properties.- 3. Algorithms for Designing Networks with a Minimum Number of Negative Gates.- 4. Synthesis of MOS Cells.- 5. Design of Irredundant MOS Networks.- 6. Interactive design.- 7. Conclusion.
「Nielsen BookData」 より