The European Computing Conference offers a unique forum for establishing new collaborations within present or upcoming research projects, exchanging useful ideas, presenting recent research results, participating in discussions and establishing new academic collaborations, linking university with the industry. Engineers and Scientists working on various areas of Systems Theory, Applied Mathematics, Simulation, Numerical and Computational Methods and Parallel Computing present the latest findings, advances, and current trends on a wide range of topics. This proceedings volume will be of interest to students, researchers, and practicing engineers.

A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.

This book is a revision and extension of my 1995 Sourcebook of Control Systems Engineering. Because of the extensions and other modifications, it has been retitled Handbook of Control Systems Engineering, which it is intended to be for its prime audience: advanced undergraduate students, beginning graduate students, and practising engineers needing an understandable review of the field or recent developments which may prove useful. There are several differences between this edition and the first. • Two new chapters on aspects of nonlinear systems have been incorporated. In the first of these, selected material for nonlinear systems is concentrated on four aspects: showing the value of certain linear controllers, arguing the suitability of algebraic linearization, reviewing the semi-classical methods of harmonic balance, and introducing the nonlinear change of variable technique known as feedback linearization. In the second chapter, the topic of variable structure control, often with sliding mode, is introduced. • Another new chapter introduces discrete event systems, including several approaches to their analysis. • The chapters on robust control and intelligent control have been extensively revised. • Modest revisions and extensions have also been made to other chapters, often to incorporate extensions to nonlinear systems.

Distributed processing has a strong theoretical foundation, but many day-to-day practitioners make limited use of the advantages this theory can give them. The result includes unreliable systems with obscure and intermittent failures, that can cost time, money and in extreme cases, lives. Reliable construction of distributed and concurrent systems must incorporate theory in practice.

Complex systems are systems that comprise many interacting parts with the ability to generate a new quality of collective behavior through self-organization, e.g. the spontaneous formation of temporal, spatial or functional structures. These systems are often characterized by extreme sensitivity to initial conditions as well as emergent behavior that are not readily predictable or even completely deterministic. The recognition that the collective behavior of the whole system cannot be simply inferred from an understanding of the behavior of the individual components has led to the development of numerous sophisticated new computational and modeling tools with applications to a wide range of scientific, engineering, and societal phenomena.

Developed from the authors’ introductory combinatorics course, this book focuses on a branch of mathematics which plays a crucial role in computer science. Combinatorial methods provide many analytical tools used for determining the expected performance of computer algorithms. Elementary subjects such as combinations and permutations, and mathematical tools such as generating functions and Pólya’s Theory of Counting, are covered, as are analyses of specific problems such as Ramsey Theory, matchings, and Hamiltonian and Eulerian paths.

Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory.

Using memristors one can achieve circuit functionalities that are not possible to establish with resistors, capacitors and inductors, therefore the memristor is of great pragmatic usefulness. Potential unique applications of memristors are in spintronic devices, ultra-dense information storage, neuromorphic circuits and programmable electronics. Memristor Networks focuses on the design, fabrication, modelling of and implementation of computation in spatially extended discrete media with many memristors. Top experts in computer science, mathematics, electronics, physics and computer engineering present foundations of the memristor theory and applications, demonstrate how to design neuromorphic network architectures based on memristor assembles, analyse varieties of the dynamic behaviour of memristive networks and show how to realise computing devices from memristors. All aspects of memristor networks are presented in detail, in a fully accessible style. An indispensable source of information and an inspiring reference text, Memristor Networks is an invaluable resource for future generations of computer scientists, mathematicians, physicists and engineers.

The aim of this textbook is to present an account of the theory of computation. After introducing the concept of a model of computation and presenting various examples, the author explores the limitations of effective computation via basic recursion theory. Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms. From there the book considers the complexity of computations and the notion of a complexity measure is introduced. Finally, the book culminates in considering time and space measures and in classifying computable functions as being either feasible or not. The author assumes only a basic familiarity with discrete mathematics and computing, making this textbook ideal for a graduate-level introductory course. It is based on many such courses presented by the author and so numerous exercises are included. In addition, the solutions to most of these exercises are provided.

Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math­ ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air­ line crew scheduling, corporate planning, computer-aided design and man­ ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca­ tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover­ ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo­ rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi­ tion, linear programming relaxations are often the basis for many approxi­ mation algorithms for solving NP-hard problems (e.g. dualheuristics).

This book provides a comprehensive introduction to advanced topics in the computational and algorithmic aspects of number theory, focusing on applications in cryptography. Readers will learn to develop fast algorithms, including quantum algorithms, to solve various classic and modern number theoretic problems. Key problems include prime number generation, primality testing, integer factorization, discrete logarithms, elliptic curve arithmetic, conjecture and numerical verification.

The Encyclopedia of Algorithms will provide a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. The first edition of the reference will focus on high-impact solutions from the most recent decade; later editions will widen the scope of the work.

This volume contains the edited texts of the lectures presented at the Workshop on Nonlinear Optimization held in Erice, Sicily, at the "G. Stampacchia" School of Mathematics of the "E. Majorana" Centre for Scientific Culture, June 23 -July 2, 1998. In the tradition of these meetings, the main purpose was to review and discuss recent advances and promising research trends concerning theory, algorithms and innovative applications in the field of Nonlinear Optimization, and of related topics such as Convex Optimization, Nonsmooth Optimization, Variational Inequalities and Complementarity Problems. The meeting was attended by 83 people from 21 countries. Besides the lectures, several formal and informal discussions took place. The result was a wide and deep knowledge of the present research tendencies in the field. We wish to express our appreciation for the active contribution of all the par­ ticipants in the meeting. Our gratitude is due to the Ettore Majorana Centre in Erice, which offered its facilities and rewarding environment: its staff was certainly instrumental for the success of the meeting. Our gratitude is also due to Francisco Facchinei and Massimo Roma for the effort and time devoted as members of the Organising Committee. We are indebted to the Italian National Research Council, and in particular to the Group on Functional Analysis and its Applications and to the Committees on Engineering Sciences and on Information Sciences and Technolo­ gies for their financial support. Finally, we address our thanks to Kluwer Academic Publishers for having offered to publish this volume.

Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math­ ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air­ line crew scheduling, corporate planning, computer-aided design and man­ ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory.

Mind Out of Matter aims to transform the way we think about consciousness and the physical world. Unlike many contemporary volumes, it develops a robust and philosophically satisfying account of the mind/body relationship without doing violence to fundamental physics. It expunges popular but ludicrous assumptions about the `in principle' capabilities of cognizers and, with the help of tools from mathematics and scientific fields, supplants flawed notions of representation, function, and mental state with objective and physically grounded alternatives. It debunks quantum theories of consciousness, constructs a simple zombie recipe, and evaluates recent research on chaotic analogue networks. This book is indispensable for readers in philosophy of mind, cognitive science, and artificial intelligence, and for mathematicians applying complexity theory or information theory to biological cognition.