Series On Applied Mathematics - Böcker

The proceedings in this volume provide reviews and discussions on the current and future developments in scientific computation, including numerical solutions of differential equations, numerical linear algebra, parallel computation and engineering applications. It contains papers by leading scientists in computational mathematics from US, Israel, Italy, China and Hong Kong.

In the past few decades, there has been a large amount of work on algorithms for linear network flow problems, special classes of network problems such as assignment problems (linear and quadratic), Steiner tree problem, topology network design and nonconvex cost network flow problems.Network optimization problems find numerous applications in transportation, in communication network design, in production and inventory planning, in facilities location and allocation, and in VLSI design.The purpose of this book is to cover a spectrum of recent developments in network optimization problems, from linear networks to general nonconvex network flow problems.

Group testing was first proposed for blood tests, but soon found its way to many industrial applications. Combinatorial group testing studies the combinatorial aspect of the problem and is particularly related to many topics in combinatorics, computer science and operations research. Recently, the idea of combinatorial group testing has been applied to experimental designs, coding, multiaccess computer communication, clone library screening and other fields. This book is the first attempt to cover the theory and applications of combinatorial group testing in one place.

This book reports recent major advances in automated reasoning in geometry. The authors have developed a method and implemented a computer program which, for the first time, produces short and readable proofs for hundreds of geometry theorems.The book begins with chapters introducing the method at an elementary level, which are accessible to high school students; latter chapters concentrate on the main theme: the algorithms and computer implementation of the method.This book brings researchers in artificial intelligence, computer science and mathematics to a new research frontier of automated geometry reasoning. In addition, it can be used as a supplementary geometry textbook for students, teachers and geometers. By presenting a systematic way of proving geometry theorems, it makes the learning and teaching of geometry easier and may change the way of geometry education.

The splitting extrapolation method is a newly developed technique for solving multidimensional mathematical problems. It overcomes the difficulties arising from Richardson's extrapolation when applied to these problems and obtains higher accuracy solutions with lower cost and a high degree of parallelism. The method is particularly suitable for solving large scale scientific and engineering problems.This book presents applications of the method to multidimensional integration, integral equations and partial differential equations. It also gives an introduction to combination methods which are relevant to splitting extrapolation. The book is intended for those who may exploit these methods and it requires only a basic knowledge of numerical analysis.

While many books on quality espouse the Taguchi loss function, they do not examine its impact on statistical quality control (SQC). But using the Taguchi loss function sheds new light on questions relating to SQC and calls for some changes. This book covers SQC in a way that conforms with the need to minimize loss. Subjects often not covered elsewhere include: (i) measurements, (ii) determining how many points to sample to obtain reliable control charts (for which purpose a new graphic tool, diffidence charts, is introduced), (iii) the connection between process capability and tolerances, (iv) how to adapt Deming's kp rule to quadratic loss, (v) how to adjust without tampering. We also discuss the efficiency of various statistics and how control chart constants are derived.

Recently, there has appeared a new type of evaluating partial differential equations with Volterra integral operators in various practical areas. Such equations possess new physical and mathematical properties. This monograph systematically discusses application of the finite element methods to numerical solution of integrodifferential equations. It will be useful for numerical analysts, mathematicians, physicists and engineers. Advanced undergraduates and graduate students should also find it beneficial.

In recent years quaternary codes have attracted the attention of the coding community as several notorious binary nonlinear codes containing more codewords than any known linear codes were found to be binary images under the Gray map of linear codes over 94. This discovery opens the way for a broader study of quaternary codes, which constitute a rapidly growing area of coding theory. This book is based on the author's lectures in Xi'an, China and Lund, Sweden and covers the most recent developments of this theory.

This is the first book to cover comprehensively the mathematical theory of nonblocking switching networks since Beneš' book published 30 years ago. Not only is the material on the classical theory of nonblocking and rearrangeable networks updated, but the modern topics on multicast and multirate switching are also surveyed. The author had spent more than 25 years working on switching networks at Bell Laboratories before he started teaching the course at Chiao-Tung University. He has published about 40 papers and obtained a dozen patents on multistage interconnection networks.

Group testing has been used in medical, chemical and electrical testing, coding, drug screening, pollution control, multiaccess channel management, and recently in data verification, clone library screening and AIDS testing. The mathematical model can be either combinatorial or probabilistic. This book summarizes all important results under the combinatorial model, and demonstrates their applications in real problems. Some other search problems, including the famous counterfeit-coins problem, are also studied in depth.There are two reasons for publishing a second edition of this book. The first is the usual need to update the text (after six years) and correct errors. The second — and more important — reason is to accommodate the recent sudden growth of interest in applying the idea of group testing to clone library screening. This development is much more than just a new application, since the new application brings with it new objectives which require a new twist of theory. It also embraces the growing importance of two topics: nonadaptive algorithms and error tolerance. Two new chapters, one on clone library screening and the other on error tolerance, have been added. Also included is a new chapter on counterfeit coins, the most famous search problem historically, which recently drew on an unexpected connection to some deep mathematical theory to yield new results. Finally, the chapters have been reorganized into parts to provide focuses and perspectives.

This book is a very timely exposition of part of an important subject which goes under the general name of “inverse problems”. The analogous problem for continuous media has been very much studied, with a great deal of difficult mathematics involved, especially partial differential equations. Some of the researchers working on the inverse conductivity problem for continuous media (the problem of recovering the conductivity inside from measurements on the outside) have taken an interest in the authors' analysis of this similar problem for resistor networks.The authors' treatment of inverse problems for electrical networks is at a fairly elementary level. It is accessible to advanced undergraduates, and mathematics students at the graduate level. The topics are of interest to mathematicians working on inverse problems, and possibly to electrical engineers. A few techniques from other areas of mathematics have been brought together in the treatment. It is this amalgamation of such topics as graph theory, medial graphs and matrix algebra, as well as the analogy to inverse problems for partial differential equations, that makes the book both original and interesting.

Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and graph theory, many approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated Goemans-Williamson relaxation of the maximum cut problem, and the Du-Hwang solution of the Gilbert-Pollak conjecture. Since integer constraints are equivalent to nonconvex constraints, the fundamental difference between classes of optimization problems is not between discrete and continuous problems but between convex and nonconvex optimization problems. This volume is a selection of refereed papers based on talks presented at a conference on “Combinatorial and Global Optimization” held at Crete, Greece.

Written in a straightforward and easily accessible style, this volume is suitable as a textbook for advanced undergraduate or first-year graduate students in mathematics, physical sciences, and engineering. The aim is to provide students with a strong background in the theories of Ordinary Differential Equations, Dynamical Systems and Boundary Value Problems, including regular and singular perturbations. It is also a valuable resource for researchers.This volume presents an abundance of examples in physical and biological sciences, and engineering to illustrate the applications of the theorems in the text. Readers are introduced to some important theorems in Nonlinear Analysis, for example, Brouwer fixed point theorem and fundamental theorem of algebras. A chapter on Monotone Dynamical Systems takes care of the new developments in Ordinary Differential Equations and Dynamical Systems.In this third edition, an introduction to Hamiltonian Systems is included to enhance and complete its coverage on Ordinary Differential Equations with applications in Mathematical Biology and Classical Mechanics.

The first edition of this book covered in depth the mathematical theory of nonblocking multistage interconnecting networks, which is applicable to both communication and computer networks. This comprehensively updated version puts more emphasis to the multicast and multirate networks which are under fast development recently due to their wide applications. This comprehensively updated new edition not only introduces the classical theory of the fundamental point-to-point network but also has a renewed emphasis on the latest multicast and multirate networks. The book can serve as either a one- or two-semester textbook for graduate students of information science, (electronic) communications, and applied mathematics. In addition, as all the relevant literature is organized and evaluated under one structured framework, the volume is an essential reference for researchers in those areas.

During the past three decades, the development of nonlinear analysis, dynamical systems and their applications to science and engineering has stimulated renewed enthusiasm for the theory of Ordinary Differential Equations (ODE).This useful book, which is based around the lecture notes of a well-received graduate course, emphasizes both theory and applications, taking numerous examples from physics and biology to illustrate the application of ODE theory and techniques.Written in a straightforward and easily accessible style, this volume presents dynamical systems in the spirit of nonlinear analysis to readers at a graduate level and serves both as a textbook or as a valuable resource for researchers.

Combinatorial mathematicians and statisticians have made a wide range of contributions to the development of block designs, and this book brings together much of that work. The designs developed for a specific problem are used in a variety of different settings. Applications include controlled sampling, randomized response, validation and valuation studies, intercropping experiments, brand cross-effect designs, lotto and tournaments.The intra- and inter- block, nonparametric and covariance analysis are discussed for general block designs, and the concepts of connectedness, orthogonality, and all types of balances in designs are carefully summarized. Readers are also introduced to the designs currently playing a prominent role in the field: alpha designs, trend-free designs, balanced treatment-control designs, nearest neighbor designs, and nested designs.This book provides the important background results required by researchers in block designs and related areas and prepares them for more complex research on the subject.

Pooling designs have been widely used in various aspects of DNA sequencing. In biological applications, the well-studied mathematical problem called “group testing” shifts its focus to nonadaptive algorithms while the focus of traditional group testing is on sequential algorithms. Biological applications also bring forth new models not previously considered, such as the error-tolerant model, the complex model, and the inhibitor model. This book is the first attempt to collect all the significant research on pooling designs in one convenient place.The coverage includes many real biological applications such as clone library screening, contig sequencing, exon boundary finding and protein-protein interaction detecting and introduces the mathematics behind it.

The need of optimal partition arises from many real-world problems involving the distribution of limited resources to many users. The “clustering” problem, which has recently received a lot of attention, is a special case of optimal partitioning. This book is the first attempt to collect all theoretical developments of optimal partitions, many of them derived by the authors, in an accessible place for easy reference. Much more than simply collecting the results, the book provides a general framework to unify these results and present them in an organized fashion.Many well-known practical problems of optimal partitions are dealt with. The authors show how they can be solved using the theory — or why they cannot be. These problems include: allocation of components to maximize system reliability; experiment design to identify defectives; design of circuit card library and of blood analyzer lines; abstraction of finite state machines and assignment of cache items to pages; the division of property and partition bargaining as well as touching on those well-known research areas such as scheduling, inventory, nearest neighbor assignment, the traveling salesman problem, vehicle routing, and graph partitions. The authors elucidate why the last three problems cannot be solved in the context of the theory.

The need for optimal partition arises from many real-world problems involving the distribution of limited resources to many users. The “clustering” problem, which has recently received a lot of attention, is a special case of optimal partitioning. This book is the first attempt to collect all theoretical developments of optimal partitions, many of them derived by the authors, in an accessible place for easy reference. Much more than simply collecting the results, the book provides a general framework to unify these results and present them in an organized fashion.Many well-known practical problems of optimal partitions are dealt with. The authors show how they can be solved using the theory — or why they cannot be. These problems include: allocation of components to maximize system reliability; experiment design to identify defectives; design of circuit card library and of blood analyzer lines; abstraction of finite state machines and assignment of cache items to pages; the division of property and partition bargaining as well as touching on those well-known research areas such as scheduling, inventory, nearest neighbor assignment, the traveling salesman problem, vehicle routing, and graph partitions. The authors elucidate why the last three problems cannot be solved in the context of the theory.

During the past three decades, the development of nonlinear analysis, dynamical systems and their applications to science and engineering has stimulated renewed enthusiasm for the theory of Ordinary Differential Equations (ODE).This useful book, which is based on the lecture notes of a well-received graduate course, emphasizes both theory and applications, taking numerous examples from physics and biology to illustrate the application of ODE theory and techniques.Written in a straightforward and easily accessible style, this volume presents dynamical systems in the spirit of nonlinear analysis to readers at a graduate level and serves both as a textbook and as a valuable resource for researchers.This new edition contains corrections and suggestions from the various readers and users. A new chapter on Monotone Dynamical Systems is added to take into account the new developments in ordinary differential equations and dynamical systems.