Jan Korst - Böcker

The success of multimedia information systems to adequately meet the needs of accessing and presenting audio/video information from a large multimedia server depends heavily on the proper use of storage and retrieval algorithms suitable for this task. Multimedia Storage and Retrieval describes various algorithms from simple to sophisticated: from single user to multiple users, from constant-bit-rate to variable-bit-rate streams, and from single disk to multiple disks. This book emphasizes storage and retrieval of video data using magnetic disk systems and its elementary, mathematical approach concentrates on the fundamental algorithms. Provides those new to the subject with the basic principles of the design and analysis of video-on-demand systems and guides the reader towards a thorough understanding of the field.Comprehensively covers disk scheduling algorithms, including round robin, double and triple buffering, grouped sweeping, and dual sweep.Extensively treats storage strategies, including contiguous and segmented storage, track pairing, striping, and random redundant storage.Concludes with further optimizations in the area of video transmission, covering bit-rate smoothing and near video-on-demand strategies.Senior undergraduate and graduate students on computer science and electrical engineering courses will all find this book appealing. Researchers and those in industry will also find it an invaluable reference.

Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors Ronald L. Graham Jan Karel Lenstra Robert E. Tarjan Discrete Mathematics and Optimization involves the study of finite structures. It is one of the fastest growing areas in mathematics today. The level and depth of recent advances in the area and the wide applicability of its evolving techniques point to the rapidity with which the field is moving from its beginnings to maturity and presage the ever-increasing interaction between it and computer science. The Series provides a broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, mathematical programming and the analysis of algorithms, and including such topics as Ramsey theory, transversal theory, block designs, finite geometries, Polya theory, graph and matroid algorithms, network flows, polyhedral combinatorics and computational complexity. The Wiley - Interscience Series in Discrete Mathematics and Optimization will be a substantial part of the record of this extraordinary development. Recent titles in the Series: Search Problems Rudolf Ahlswede, University of Bielefeld, Federal Republic of Germany Ingo Wegener, Johann Wolfgang Goethe University, Frankfurt, Federal Republic of Germany The problems of search, exploration, discovery and identification are of key importance in a wide variety of applications. This book will be of great interest to all those concerned with searching, sorting, information processing, design of experiments and optimal allocation of resources. 1987 Introduction to Optimization E. M. L. Beale FRS, Scicon Ltd, Milton Keynes, and Imperial College, London This book is intended as an introduction to the many topics covered by the term 'optimization', with special emphasis on applications in industry. It is divided into three parts. The first part covers unconstrained optimization, the second describes the methods used to solve linear programming problems, and the third covers nonlinear programming, integer programming and dynamic programming. The book is intended for senior undergraduate and graduate students studying optimization as part of a course in mathematics, computer science or engineering. 1988

The advent of the digital era, the Internet, and the development of fast computing devices that can access mass storage servers at high communication bandwidths, have brought within our reach the world of ambient intelligent systems. To provide users with information, communication, and entertainment at any desired place and time in an intuitive, efficient, and effective way requires system intelligence that is generated by smart algorithms. The need for such algorithms, which run on digital platforms that are integrated into consumer electronics devices, has strengthened the interest in computational intelligence. This volume is the outcome of a series of discussions at the Philips Symposium on Intelligent Algorithms, which was held in Eindhoven on December 2002. It contains practical examples from this newly developing research field, which can be positioned at the intersection of computer science, discrete mathematics, and artificial intelligence.The examples include: machine learning; content management; vision; speech; content augmentation; profiling; music retrieval; feature extraction; audio and video fingerprinting; resource management; multimedia servers; network scheduling; and IC design.

The rapid growth in electronic systems in the past decade has boosted - search in the area of computational intelligence. As it has become increasingly easy to generate, collect, transport, process, and store huge amounts of data, the role of intelligent algorithms has become prominent in order to visualize, manipulate, retrieve, and interpret the data. For instance, intelligent search techniques have been developed to search for relevant items in huge coll- tions of web pages, and data mining and interpretation techniques play a very important role in making sense out of huge amounts of biomolecular measu- ments. As a result, the added value of many modern systems is no longer determined by hardware only, but increasingly by the intelligent software that supports and facilitates the user in realizing his or her objectives. Overthepastyears, considerableprogresshasbeenmadeintheareaofc- putational intelligence, which can be positioned at the intersection of computer science, discrete mathematics, and cognitive science. This has led to a gr- ing community of practitioners within Philips Research that develop, analyze, and apply intelligent algorithms. The Symposium on Intelligent Algorithms (SOIA) intends to provide this community of practitioners with a platform to exchange information. The ?rst edition of SOIA, held in 2002, addressed the topic of intelligent algorithms in ambient intelligence.

Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical characteristics of combinatorial optimization problems to which local search can be applied, its relation to complexity theory, and the combination with randomized search features have led to a wealth of interesting theoretical results. However, these results are scattered throughout the literature. This is the first book that presents a large collection of theoretical results in a consistent manner, thus providing the reader with a coherent overview of the achievements obtained so far, but also serving as a source of inspiration for the development of novel results in the challenging field of local search.

Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical characteristics of combinatorial optimization problems to which local search can be applied, its relation to complexity theory, and the combination with randomized search features have led to a wealth of interesting theoretical results. However, these results are scattered throughout the literature. This is the first book that presents a large collection of theoretical results in a consistent manner, thus providing the reader with a coherent overview of the achievements obtained so far, but also serving as a source of inspiration for the development of novel results in the challenging field of local search.

This book is the outcome of a series of discussions at the Philips Symposium on Intelligent Algorithms, which was held in Eindhoven on December 2002. It contains many exciting and practical examples from this newly developing research field, which can be positioned at the intersection of computer science, discrete mathematics, and artificial intelligence. The examples include machine learning, content management, vision, speech, content augmentation, profiling, music retrieval, feature extraction, audio and video fingerprinting, resource management, multimedia servers, network scheduling, and IC design.