Bøger udgivet af Friedrich Vieweg & Sohn Verlagsgesellschaft mbH

In this paper, a comparison is made of several proof calculi in terms of the lengths of shortest proofs for some given formula of first order predicate logic with function symbols. In particular, we address the question whether, given two calculi, any derivation in one of them can be simulated in the other in polynomial time. The analogous question for propositional logic has been intensively studied by various authors because of its implications for complexity theory. And it seems there has not been as much endeavour in this field in first order logic as there has been in propositional logic. On the other hand, fOr most of the practical applications of logic, a powerful tool such as the language of first order logic is needed. The main interest of this investigation lies in the calculi most frequently used in automated theorem proving, the resolution calculus, and analytic calculi such as the tableau calculus and the connection method. In automated theorem proving there are two important aspects of complexity. In order to have a good theorem proving system, we must first have some calculus in which we can express our derivations in concise form. And second, there must be an efficient search strategy. This book deals mainly with the first aspect which is a necessary condition for the second since the length of a shortest proof always also gives a lower bound to the complexity of any strategy.

This work illustrates two basic principles in the calculus of variations - the questions of existence of solutions and, closely related, the problem of regularity of minimizers. It concentrates on techniques, and presents methods useful for applications in regularity theorems.

Within the DFG -Schwerpunktprogramm "Stromungssimulation mit Hochleistungsrechnern" and within the activities of the French-German cooperation of CNRS and DFG a DFG symposium on "Computational Fluid Dynamics (CFD) on Parallel Systems" was organized at the Institut fur Aerodynamik and Gasdynamik of the Stuttgart University, 9-10 December 1993.

Governments 'Grand Challenge' for 'Aerospace Vehicle Design' for the 1990's: 'Massively parallel computing systems and advanced parallel software technology and algorithms will enable the development and validation of multidisciplinary, coupled methods.

Contains a collection of papers presented at a conference on nonlinear hyperbolic problems held in Taormina, Italy from 3-8 April, 1992. The papers deal with different mathematical techniques of relevant interest to current research in nonlinear wave propagation.

Today's fluid dynamic re search cannot be discussed without supercomputers and since CFD is one of the im portant users of supercomputers, future development of supercomputers has to take the requirements of CFD into account.

This volume contains contribution ranges for a comprehensive concept, which in a multidisciplinary approach, spectrum from fundamental research to concrete measures of protection and earthquake disaster preparedness.

Safety evaluation by definition involves many complex factors and thus covers a wide range of topics. Figure 1 indicates the range of topics covered in the workshop. This table relates the authors to the subject matter, providing a guide through the diverse range of topics presented at the workshop.

Within the last decade or so, the accelerated growth of Nigeria in the fields of urbanisation, population, business as well as industry has led to some attention in assessment of available water resources in various parts of the country.

On the occasion of the International Conference on Nonlinear Hyperbolic Problems held in St. Etienne, France, 1986 it was decided to start a two years cycle of conferences on this very rapidly expanding branch of mathematics and it*s applications in Continuum Mechanics and Aerodynamics.

With the advent of super computers during the last ten years, the numerical simulation of viscous fluid flows modeled by the Navier-Stokes equations is becoming a most useful tool in Aircraft and Engine Design.

The scope of the present book is to offer the most efficient tools for the vectorization of serial computer programs. Here, by vectorization we understand the adaptation of computer programs to the special architecture of modern available vector computers to exploit fully their potential, which will often result in remarkable performance improvements. The book is written primarily for users working in the various fields of computational physics, for scientists as well as for programmers running their jobs on a vector computer. The text may, however, also be of value to those who are interested in numerical algorithms. Although the examples discussed in chapter 9 have been taken from Computational Fluid Dynamics, the numerical methods are well-known, and are applied in many fields of Computational Physics. The book is divided into four parts. After a short introduction which outlines the limits of conventional serial computers in contrast to the possibilities offered by the new vector machines, the second part is addressed to the discussion of some main features of existing computer architectures. We restrict ourselves to the vector computers CRAY-1S and CDC-CYBER 205, although, in the meantime, many vector and parallel computers and array processors are available such as DENELCOR's Heterogeneous Element Processor (HEP), ICL's Distributed Array Processor (DAP), SPERRY UNIVAC's Array Processing System (APS), STAR TECHNOLOGIES ST-l00, FLOATING POINT SYSTEMS' Array Processor (FPS), FUJITSU's FACOM VP-l00 and VP-200, HITACHI's Integrated Array Processor (lAP), HITACHI's S 810/10 and S 810/20 and others.

Twenty-eight groups contributed to the mandatory cases coming from France (12), other European countries (7) and other countries: USA, Japan and Australia (9).

"Proceedings of the GAMM Workshop on the Numerical Simulation of Compressible Euler Flows, that was held at INRIA, Rocquencourt (France), on June 10-13, 1986"--Foreword.

With this method, the data arrays in the original program are each distributed to the processors, establishing an ownership relation, and computations defining a data item are performed by the processors owning the data.

This book presents the most interesting talks given at ISSE 2004 - the forum for the interdisciplinary discussion of how to adequately secure electronic business processes. The topics include: Corporate Governance and why security implies to control the enterprise - Risk Management and how to quantify security threats - Secure Computing and how it will change the way we trust computers - Digital Rights Management and the protection of corporate information.Adequate information security is one of the basic requirements of all electronic business processes. It is crucial for effective solutions that the possibilities offered by security technology can be integrated with the commercial requirements of the applications. The reader may expect state-of-the-art: best papers of the Conference ISSE 2004.

This text points out how to ensure professional and efficient database software development in DB2 mainframe and client/server environments. This book covers both technical aspects (performance, tuning) and organizational measures (economical performance).

This book provides a comprehensive introduction to the theory of elliptic genera due to Ochanine, Landweber, Stong, and others. The theory describes a new cobordism invariant for manifolds in terms of modular forms. The book evolved from notes of a course given at the University of Bonn. After providing some background material elliptic genera are constructed, including the classical genera signature and the index of the Dirac operator as special cases. Various properties of elliptic genera are discussed, especially their behaviour in fibre bundles and rigidity for group actions. For stably almost complex manifolds the theory is extended to elliptic genera of higher level. The text is in most parts self-contained. The results are illustrated by explicit examples and by comparison with well-known theorems. The relevant aspects of the theory of modular forms are derived in a seperate appendix, providing also a useful reference for mathematicians working in this field.

It offers a comprehensive study of * image processing and image analysis, * basics of speech processing, * object~oriented programming, * software design, * and programming in C++. In the first part we introduce image processing, image analysis, programming tools, and the basics of C++.

The body of mathematics developed in the last forty years or so which can be put under the heading Singularity Theory is quite large. And the excellent introductions to this vast sub­ ject which are already available (for instance [AGVJ, [BGJ, [GiJ, [GGJ, [LmJ, [Mr], [WsJ or the more advanced [Ln]) cover necessarily only apart of even the most basic topics. The aim of the present book is to introduce the reader to a few important topics from ZoaaZ Singularity Theory. Some of these topics have already been treated in other introductory books (e.g. right and contact finite determinacy of function germs) while others have been considered only in papers (e.g. Mather's Lemma, classification of simple O-dimensional complete intersection singularities, singularities of hyperplane sections and of dual mappings of projective hypersurfaces). Even in the first case, we feel that our treatment is different from the introductions mentioned above - the general reason being that we give special attention to the aompZex anaZytia situation and to the connections with AZgebraia Geometry. We offer now a detailed description of the contents, pOint­ ing out special aspects and new material (i.e. previously un­ published, though for the most part surely known to the~ts!). Chapter 1 is a short introduction for the beginner. We recall here two basic results (the Submersion Theorem and Morse Lemma) and make a few comments on what is meant by the local behaviour of a function or of a plane algebraic curve.

"Notes ... prepared in November 1983 for a couple of seminars at the University of Uppsala. These notes were made into a more complete form during a series of lectures at the University of Umea in the fall of 1985 and at Universite Paul Sabatier, Toulouse in December 1986"--P. ix.

"A publication of the Max-Planck-Institut f'ur Mathematik, Bonn."