Kategoria BISAC: Computers >> Machine Theory

Optimization from Human Genes to Cutting Edge Technologies The challenges faced by industry today are so complex that they can only be solved through the help and participation of optimization ex perts. For example, many industries in e-commerce, finance, medicine, and engineering, face several computational challenges due to the mas sive data sets that arise in their applications. Some of the challenges include, extended memory algorithms and data structures, new program ming environments, software systems, cryptographic protocols, storage devices, data compression, mathematical and...

Some mathematical disciplines can be presented and developed in the context of other disciplines, for instance Boolean algebras, that Stone has converted in a branch of ring theory, projective geome tries, characterized by Birkhoff as lattices of a special type, projec tive, descriptive and spherical geometries, represented by Prenowitz, as multigroups, linear geometries and convex sets presented by Jan tosciak and Prenowitz as join spaces. As Prenowitz and Jantosciak did for geometries, in this book we present and study several ma thematical disciplines that use the Hyperstructure Theory....

Call-by-push-value is a programming language paradigm that, surprisingly, breaks down the call-by-value and call-by-name paradigms into simple primitives. This monograph, written for graduate students and researchers, exposes the call-by-push-value structure underlying a remarkable range of semantics, including operational semantics, domains, possible worlds, continuations and games.

This book is a compilation of a selected subset of research articles presented at the Eighth INFORMS Computing Society Conference, held in Chandler, Arizona, from January 8 to 10, 2003. The articles in this book represent the diversity and depth of the interface between ORiMS (operations research and the management sciences) and CS/AI (computer science and artificial intelligence ). This volume starts with two papers that represent the reflective and integrative thinking that is critical to any scientific discipline. These two articles present philosophical perspectives on computation,...

JR is a language for concurrent programming. It is an imperative language that provides explicit mechanisms for concurrency, communication, and s- chronization. JR is an extension of the Java programming language with - ditional concurrency mechanisms based on those in the SR (Synchronizing Resources) programming language. It is suitable for writing programs for both shared- and distributed-memory applications and machines; it is, of course, also suitable for writing sequential programs. JR can be used in applications such as parallel computation, distributed systems, simulation, and many...

Palmprint Authentication is the first book to provide a comprehensive introduction to palmprint technologies. It reveals automatic biometric techniques for personal identification using palmprint, from the approach based on offline palmprint images, to the current state-of-the-art algorithm using online palmprint images.

Palmprint Authentication provides the reader with a basic concept of Palmprint Authentication. It also includes an in-depth discussion of Palmprint Authentication technologies, a detailed description of Palmprint Authentication...

Collects the Latest Research Involving the Application of Process Algebra to Computing

Exploring state-of-the-art applications, Process Algebra for Parallel and Distributed Processing shows how one formal method of reasoning process algebra has become a powerful tool for solving design and implementation challenges of concurrent systems.

Parallel Programming
Divided into three parts, the book begins by parallelizing an algorithm for the Cell Broadband Engine processor of IBM, Sony, and Toshiba. It also develops a runtime environment that...

Collecting information previously scattered throughout the vast literature, including the author s own research, Stochastic Relations: Foundations for Markov Transition Systems develops the theory of stochastic relations as a basis for Markov transition systems.

After an introduction to the basic mathematical tools from topology, measure theory, and categories, the book examines the central topics of congruences and morphisms, applies these to the monoidal structure, and defines bisimilarity and behavioral equivalence within this framework. The author views developments from the...

This volume contains the proceedings of the Fourth International Conference on Formal Engineering Methods: ICFEM 2002. The conference was held in Sha- hai, China, from 21 to 25 October 2002. Formal methods for software development have been extensively researched and their use in industry is increasing. Recent applications to the development of safety-critical, security-critical, and mission-critical systems have signi?cantly increased trustworthiness, without increasing overall development costs. ICFEM encourages the exchange of ideas on recent advances in formal methods and software...

The IFIP TC6 WG 6.1 Joint International Conference on Formal Techniques for Networked and Distributed Systems, FORTE 2002, was held this year at Rice University, Houston, Texas, on November 11 14. This annual conference provides a forum for researchers and practitioners from universities and industry to meet and advance technologies in areas of speci?cation, testing, and veri?cation of distributed systems and communication protocols. The main topics are: FDT-based system and protocol engineering. Semantical foundations. Extensions of FDTs. Formal approaches to concurrent/distributed...

A central aim and ever-lasting dream of computer science is to put the development of hardware and software systems on a mathematical basis which is both firm and practical. Such a scientific foundation is needed especially for the construction of reactive programs, like communication protocols or control systems.

For the construction and analysis of reactive systems an elegant and powerful theory has been developed based on automata theory, logical systems for the specification of nonterminating behavior, and infinite two-person games.

The 19 chapters presented in this...

Since their introduction nearly 40 years ago, research on Petri nets has diverged in many different directions. Various classes of Petri net, motivated either by theory or applications, with its own specific features and methods of analysis, have been proposed and studies in depth.
These successful developments have led to a very heterogeneous landscape of diverse models, and this, in turn, has stimulated research on concepts and approaches that contribute to unifying and structuring the diverse landscape. This state-of-the-art survey presents the most relevant approaches to unifying Petri...

This volume is a self-contained introduction to interactive proof in high- order logic (HOL), using the proof assistant Isabelle 2002. Compared with existing Isabelle documentation, it provides a direct route into higher-order logic, which most people prefer these days. It bypasses ?rst-order logic and minimizes discussion of meta-theory. It is written for potential users rather than for our colleagues in the research world. Another departure from previous documentation is that we describe Markus Wenzel's proof script notation instead of ML tactic scripts. The l- ter make it easier to...

Compiled from the proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2002, held in Rome in September 2002, this volume contains 20 revised full papers. Among the topics addressed are design and analysis of approximation algorithms, inapproximability results, online problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and applications to game...

This book contains the extended abstracts presented at the 12th International Conference on Power Series and Algebraic Combinatorics (FPSAC '00) that took place at Moscow State University, June 26-30, 2000. These proceedings cover the most recent trends in algebraic and bijective combinatorics, including classical combinatorics, combinatorial computer algebra, combinatorial identities, combinatorics of classical groups, Lie algebra and quantum groups, enumeration, symmetric functions, young tableaux etc...

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2007, held in New York, NY, USA in June 2007. The volume presents 36 revised refereed papers that address all current aspects of logic in computer science.

This volume contains selected papers presented at the Fourth Asian Symposium on Computer Mathematics. There are 39 peer-reviewed contributions together with full papers and extended abstracts by the four invited speakers, G.H. Gonnet, D. Lazard, W. McCune and W.-T. Wu, and these cover some of the most significant advances in computer mathematics, including algebraic, symbolic, numeric and geometric computation, automated mathematical reasoning, mathematical software, and computer-aided geometric design.

Zhongwan (mathematical logic, Academia Sinica, Beijing) presents an overview of both the peculiarities of logical systems and the requirements of computer logic, but does not specifically treat the application of the former to the latter. Topics include sets, inductive definitions and proofs, propos

Springer Book Archives

Springer Book Archives