Skip to main content

Books in Computer science

The Computing collection presents a range of foundational and applied content across computer and data science, including fields such as Artificial Intelligence; Computational Modelling; Computer Networks, Computer Organization & Architecture, Computer Vision & Pattern Recognition, Data Management; Embedded Systems & Computer Engineering; HCI/User Interface Design; Information Security; Machine Learning; Network Security; Software Engineering.

  • Organizing Information

    Principles of Data Base and Retrieval Systems
    • 1st Edition
    • Dagobert Soergel
    • English
    This book gives a theoretical base and a perspective for the analysis, design, and operation of information systems, particularly their information storage and retrieval (ISAR) component, whether mechanized or manual. Information systems deal with many types of entities: events, persons, documents, business transactions, museum objects, research projects, and technical parts, to name a few. Among the purposes the serve are to inform the public, to support managers, researchers, and engineers, and to provide a knowledge base for an artificial intelligence program. The principles discussed in this book apply to all these contexts. The book achieves this generality by drawing on ideas from two conceptually overlapping areas—data base management and the organization and use of knowledge in libraries—and by integrating these ideas into a coherent framework. The principles discussed apply to the design of new systems and, more importantly, to the analysis of existing systems in order to exploit their capabilities better, to circumvent their shortcomings, and to introduce modifications where feasible.
  • Advances in Computers

    • 1st Edition
    • Volume 24
    • English
  • Nonlinear System Theory

    • 1st Edition
    • Volume 175
    • Casti
    • English
  • Differing Perspectives in Motor Learning, Memory, and Control

    • 1st Edition
    • Volume 27
    • D. Goodman + 2 more
    • English
  • Topics in the Theory of Computation

    • 1st Edition
    • Volume 24
    • M. Karpinski + 1 more
    • English
    This volume contains nine selected papers presented at the Borgholm conference. They were chosen on the basis of their immediate relevance to the most fundamental aspects of the theory of computation and the newest developments in this area.These papers, which have been extended and refereed, fall into eight categories: 1. Constructive Mathematics in Models of Computation and Programming; 2. Abstract Calculi and Denotational Semantics; 3. Theory of Machines, Computations and Languages; 4. Nondeterminism, Concurrency and Distributed Computing; 5. Abstract Algebras, Logics and Combinatorics in Computation Theory; 6. General Computability and Decidability; 7. Computational and Arithmetic Complexity; 8. Analysis of Algorithms and Feasible Computing.
  • Decision and Control in Uncertain Resource Systems

    • 1st Edition
    • Volume 172
    • Mangel
    • English
  • Bilinear Transformation Method

    • 1st Edition
    • Volume 174
    • Matsuno
    • English
  • Computational Methods for Optimizing Distributed Systems

    • 1st Edition
    • Volume 173
    • Charles Teo
    • English
    Optimal control theory of distributed parameter systems has been a very active field in recent years; however, very few books have been devoted to the studiy of computational algorithms for solving optimal control problems. For this rason the authors decided to write this book. Because the area is so broad, they confined themselves to optimal control problems involving first and second boundary-value problems of a linear second-order parabolic partial differential equation. However the techniques used are by no means restricted to these problems. They can be and in some cases already have been applied to problems involving other types of distributed parameter system. The authors aim is to devise computational algorithms for solving optimal control problems with particular emphasis on the mathematical theory underlying the algorithms. These algorithms are obtained by using a first-order strong variational method or gradient-type methods.