Selected Topics in Approximation and Computation addresses the relationship between modern approximation theory and computational methods. The text is a combination of expositions of basic classical methods of approximation leading to popular splines and new explicit tools of computation, including Sinc methods, elliptic function methods, and positive operator approximation methods. It also provides an excellent summary of worst case analysis in information based complexity. It relates optimal computational methods with the theory of s-numbers and n-widths. It can serve as a text for senior-graduate courses in computer science and applied mathematics, and also as a reference for professionals.

Since its inception, fuzzy logic has attracted an incredible amount of interest, and this interest continues to grow at an exponential rate. As such, scientists, researchers, educators and practitioners of fuzzy logic continue to expand on the applicability of what and how fuzzy can be utilised in the real-world. In this book, the authors present key application areas where fuzzy has had significant success. The chapters cover a plethora of application domains, proving credence to the versatility and robustness of a fuzzy approach. A better understanding of fuzzy will ultimately allow for a better appreciation of fuzzy. This book provides the reader with a varied range of examples to illustrate what fuzzy logic can be capable of and how it can be applied. The text will be ideal for individuals new to the notion of fuzzy, as well as for early career academics who wish to further expand on their knowledge of fuzzy applications. The book is also suitable as a supporting text for advanced undergraduate and graduate-level modules on fuzzy logic, soft computing, and applications of AI.

This volume contains all the papers that were presented at the Fourth Workshop on Algorithmic Learning Theory, held in Tokyo in November 1993. In addition to 3 invited papers, 29 papers were selected from 47 submitted extended abstracts. The workshop was the fourth in a series of ALT workshops, whose focus is on theories of machine learning and the application of such theories to real-world learning problems. The ALT workshops have been held annually since 1990, sponsored by the Japanese Society for Artificial Intelligence. The volume is organized into parts on inductive logic and inference, inductive inference, approximate learning, query learning, explanation-based learning, and new learning paradigms.

This volume contains the papers that were presented at the Third Workshop onAlgorithmic Learning Theory, held in Tokyo in October 1992. In addition to 3invited papers, the volume contains 19 papers accepted for presentation, selected from 29 submitted extended abstracts. The ALT workshops have been held annually since 1990 and are organized and sponsored by the Japanese Society for Artificial Intelligence. The main objective of these workshops is to provide an open forum for discussions and exchanges of ideasbetween researchers from various backgrounds in this emerging, interdisciplinary field of learning theory. The volume is organized into parts on learning via query, neural networks, inductive inference, analogical reasoning, and approximate learning.

This book comprises five expository articles and two research papers on topics of current interest in set theory and the foundations of mathematics. Articles by Baumgartner and Devlin introduce the reader to proper forcing. This is a development by Saharon Shelah of Cohen's method which has led to solutions of problems that resisted attack by forcing methods as originally developed in the 1960s. The article by Guaspari is an introduction to descriptive set theory, a subject that has developed dramatically in the last few years. Articles by Kanamori and Stanley discuss one of the most difficult concepts in contemporary set theory, that of the morass, first created by Ronald Jensen in 1971 to solve the gap-two conjecture in model theory, assuming Goedel's axiom of constructibility. The papers by Prikry and Shelah complete the volume by giving the reader the flavour of contemporary research in set theory. This book will be of interest to graduate students and research workers in set theory and mathematical logic.

The study of hypersurface quadrilateral singularities can be reduced to the study of elliptic K3 surfaces with a singular fiber of type I * 0 (superscript *, subscript 0), and therefore these notes consider, besides the topics of the title, such K3 surfaces too. The combinations of rational double points that can occur on fibers in the semi-universal deformations of quadrilateral singularities are examined, to show that the possible combinations can be described by a certain law from the viewpoint of Dynkin graphs. This is equivalent to saying that the possible combinations of singular fibers in elliptic K3 surfaces with a singular fiber of type I * 0 (superscript *, subscript 0) can be described by a certain law using classical Dynkin graphs appearing in the theory of semi-simple Lie groups. Further, a similar description for thecombination of singularities on plane sextic curves is given. Standard knowledge of algebraic geometry at the level of graduate students is expected. A new method based on graphs will attract attention of researches.

From rather modest beginnings, the British Combinatorial Conference grew into an established biennial international gathering. A successful format for the series of conferences was established, whereby several distinguished mathematicians were invited to give a survey lecture and to write a paper for the conference volume. The 1983 conference was held in Southampton, and this volume contains the invited papers, comprising three each from the United Kingdom, continental Europe and the United States. These papers cover a broad range of combinatorial topics, including enumeration, finite geometries, graph theory and permanents. The book will be of value not only to mathematicians, but also to scientists, engineers and others interested in combinatorial ideas.

The numerous publications on spline theory during recent decades show the importance of its development on modern applied mathematics. The purpose of this text is to give an approach to the theory of spline functions, from the introduction of the phrase "spline" by I.J. Schoenbergin 1946 to the newest theories of spline-wavelets or spline-fractals, emphasizing the significance of the relationship between the general theory and its applications. In addition, this volume provides material on spline function theory, as well as an examination of basic methods in spline functions. The authors have complemented the work with a reference section to stimulate further study.

In the mid- 1970s the curriculum development boom in mathematics was to end almost as rapidly as it had begun. In this book the authors, who come from countries with differing educational traditions and patterns, consider these developments in their historical, social and educational context. They give not only a descriptive account of developmental work in a variety of countries, its aims and the patterns of management utilised, but also attempt to identify trends and characteristics and thus provide a theoretical base for criticism and analysis. The reader will find numerous case studies, including extracts from such renowned authors as Bruner, Dieudonne and Piaget.

Combinatorial group theory is a loosely defined subject, with close connections to topology and logic. With surprising frequency, problems in a wide variety of disciplines, including differential equations, automorphic functions and geometry, have been distilled into explicit questions about groups, typically of the following kind: Are the groups in a given class finite (e.g., the Burnside problem)? Finitely generated? Finitely presented? What are the conjugates of a given element in a given group? What are the subgroups of that group? Is there an algorithm for deciding for every pair of groups in a given class whether they are isomorphic or not? The objective of combinatorial group theory is the systematic development of algebraic techniques to settle such questions. In view of the scope of the subject and the extraordinary variety of groups involved, it is not surprising that no really general theory exists. These notes, bridging the very beginning of the theory to new results and developments, are devoted to a number of topics in combinatorial group theory and serve as an introduction to the subject on the graduate level.

? DoesP=NP. In just ?ve symbols Dick Karp -in 1972-captured one of the deepest and most important questions of all time. When he ?rst wrote his famous paper, I think it's fair to say he did not know the depth and importance of his question. Now over three decades later, we know P=NP is central to our understanding of compu- tion, it is a very hard problem, and its resolution will have potentially tremendous consequences. This book is a collection of some of the most popular posts from my blog- Godel ] Lost Letter andP=NP-which I started in early 2009. The main thrust of the blog, especially when I started, was to explore various aspects of computational complexity around the famousP=NP question. As I published posts I branched out and covered additional material, sometimes a timely event, sometimes a fun idea, sometimes a new result, and sometimes an old result. I have always tried to make the posts readable by a wide audience, and I believe I have succeeded in doing this."

Axiomatic set theory is the concern of this book. More particularly, the authors prove results about the coding of models M, of Zermelo-Fraenkel set theory together with the Generalized Continuum Hypothesis by using a class 'forcing' construction. By this method they extend M to another model L[a] with the same properties. L[a] is Goedels universe of 'constructible' sets L, together with a set of integers a which code all the cardinality and cofinality structure of M. Some applications are also considered. Graduate students and research workers in set theory and logic will be especially interested by this account.

In February 1992, I defended my doctoral thesis: Engineering Optimiza tion - selected contributions (IMSOR, The Technical University of Den mark, 1992, p. 92). This dissertation presents retrospectively my central contributions to the theoretical and applied aspects of optimization. When I had finished my thesis I became interested in editing a volume related to a new expanding area of applied optimization. I considered several approaches: simulated annealing, tabu search, genetic algorithms, neural networks, heuristics, expert systems, generalized multipliers, etc. Finally, I decided to edit a volume related to simulated annealing. My main three reasons for this choice were the following: (i) During the last four years my colleagues at IMSOR and I have car ried out several applied projects where simulated annealing was an essential. element in the problem-solving process. Most of the avail able reports and papers have been written in Danish. After a short review I was convinced that most of these works deserved to be pub lished for a wider audience. (ii) After the first reported applications of simulated annealing (1983- 1985), a tremendous amount of theoretical and applied work have been published within many different disciplines. Thus, I believe that simulated annealing is an approach that deserves to be in the curricula of, e.g. Engineering, Physics, Operations Research, Math ematical Programming, Economics, System Sciences, etc. (iii) A contact to an international network of well-known researchers showed that several individuals were willing to contribute to such a volume."

The book incorporates research papers and surveys written by participants ofan International Scientific Programme on Approximation Theory jointly supervised by Institute for Constructive Mathematics of University of South Florida at Tampa, USA and the Euler International Mathematical Instituteat St. Petersburg, Russia. The aim of the Programme was to present new developments in Constructive Approximation Theory. The topics of the papers are: asymptotic behaviour of orthogonal polynomials, rational approximation of classical functions, quadrature formulas, theory of n-widths, nonlinear approximation in Hardy algebras, numerical results on best polynomial approximations, wavelet analysis. FROM THE CONTENTS: E.A. Rakhmanov: Strong asymptotics for orthogonal polynomials associated with exponential weights on R.- A.L. Levin, E.B. Saff: Exact Convergence Rates for Best Lp Rational Approximation to the Signum Function and for Optimal Quadrature in Hp.- H. Stahl: Uniform Rational Approximation of x .- M. Rahman, S.K. Suslov: Classical Biorthogonal Rational Functions.- V.P. Havin, A. Presa Sague: Approximation properties of harmonic vector fields and differential forms.- O.G. Parfenov: Extremal problems for Blaschke products and N-widths.- A.J. Carpenter, R.S. Varga: Some Numerical Results on Best Uniform Polynomial Approximation of x on 0,1 .- J.S. Geronimo: Polynomials Orthogonal on the Unit Circle with Random Recurrence Coefficients.- S. Khrushchev: Parameters of orthogonal polynomials.- V.N. Temlyakov: The universality of the Fibonacci cubature formulas.

This volume contains the proceedings of the fifth International Workshop on Distributed Algorithms (WDAG '91) held in Delphi, Greece, in October 1991. The workshop provided a forum for researchers and others interested in distributed algorithms, communication networks, and decentralized systems. The aim was to present recent research results, explore directions for future research, and identify common fundamental techniques that serve as building blocks in many distributed algorithms. The volume contains 23 papers selected by the Program Committee from about fifty extended abstracts on the basis of perceived originality and quality and on thematic appropriateness and topical balance. The workshop was organizedby the Computer Technology Institute of Patras University, Greece.

The articles collected here are the texts of the invited lectures given at the Eighth British Combinatorial Conference held at University College, Swansea. The contributions reflect the scope and breadth of application of combinatorics, and are up-to-date reviews by mathematicians engaged in current research. This volume will be of use to all those interested in combinatorial ideas, whether they be mathematicians, scientists or engineers concerned with the growing number of applications.

Originally published in 1981, this collection of 33 research papers follows from a conference on the interwoven themes of finite Desarguesian spaces, Steiner systems, coding theory, group theory, block designs, generalized quadrangles, and projective planes. There is a comprehensive introduction, which aims to interest the non-specialist in the subject and which indicates how the contributions fit together. This is a field of research pursued both for its intrinsic interest and its applications. These papers include a number of open problems whose statement requires very little mathematical sophistication.

The papers in this volume were presented at the fourth biennial Summer Conference on Category Theory and Computer Science, held in Paris, September3-6, 1991. Category theory continues to be an important tool in foundationalstudies in computer science. It has been widely applied by logicians to get concise interpretations of many logical concepts. Links between logic and computer science have been developed now for over twenty years, notably via the Curry-Howard isomorphism which identifies programs with proofs and types with propositions. The triangle category theory - logic - programming presents a rich world of interconnections. Topics covered in this volume include the following. Type theory: stratification of types and propositions can be discussed in a categorical setting. Domain theory: synthetic domain theory develops domain theory internally in the constructive universe of the effective topos. Linear logic: the reconstruction of logic based on propositions as resources leads to alternatives to traditional syntaxes. The proceedings of the previous three category theory conferences appear as Lecture Notes in Computer Science Volumes 240, 283 and 389.

This book is concerned with the relations between graphs, error-correcting codes and designs, in particular how techniques of graph theory and coding theory can give information about designs. A major revision and expansion of a previous volume in this series, this account includes many examples and new results as well as improved treatments of older material. So that non-specialists will find the treatment accessible the authors have included short introductions to the three main topics. This book will be welcomed by graduate students and research mathematicians and be valuable for advanced courses in finite combinatorics.

What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest.

M. Andreatta, E.Ballico, J.Wisniewski: Projective manifolds containing large linear subspaces; - F.Bardelli: Algebraic cohomology classes on some specialthreefolds; - Ch.Birkenhake, H.Lange: Norm-endomorphisms of abelian subvarieties; - C.Ciliberto, G.van der Geer: On the jacobian of ahyperplane section of a surface; - C.Ciliberto, H.Harris, M.Teixidor i Bigas: On the endomorphisms of Jac (W1d(C)) when p=1 and C has general moduli; - B. van Geemen: Projective models of Picard modular varieties; - J.Kollar, Y.Miyaoka, S.Mori: Rational curves on Fano varieties; - R. Salvati Manni: Modular forms of the fourth degree; A. Vistoli: Equivariant Grothendieck groups and equivariant Chow groups; - Trento examples; Open problems

Combinatorics is an active field of mathematical study and the British Combinatorial Conference, held biennially, aims to survey the most important developments by inviting distinguished mathematicians to lecture at the meeting. The contributions of the principal lecturers at the Seventh Conference, held in Cambridge, are published here and the topics reflect the breadth of the subject. Each author has written a broadly conceived survey, not limited to his own work, but intended for wide readership. Important aspects of the subject are emphasized so that non-specialists will find them understandable. Topics covered include graph theory, matroids, combinatorial set theory, projective geometry and combinatorial group theory. All those researching into any aspect of Combinatorics and its applications will find much in these articles of use and interest.

With one exception, these papers are original and fully refereed research articles on various applications of Category Theory to Algebraic Topology, Logic and Computer Science. The exception is an outstanding and lengthy survey paper by Joyal/Street (80 pp) on a growing subject: it gives an account of classical Tannaka duality in such a way as to be accessible to the general mathematical reader, and to provide a key for entry to more recent developments and quantum groups. No expertise in either representation theory or category theory is assumed. Topics such as the Fourier cotransform, Tannaka duality for homogeneous spaces, braided tensor categories, Yang-Baxter operators, Knot invariants and quantum groups are introduced and studies. From the Contents: P.J. Freyd: Algebraically complete categories.- J.M.E. Hyland: First steps in synthetic domain theory.- G. Janelidze, W. Tholen: How algebraic is the change-of-base functor?.- A. Joyal, R. Street: An introduction to Tannaka duality and quantum groups.- A. Joyal, M. Tierney: Strong stacks andclassifying spaces.- A. Kock: Algebras for the partial map classifier monad.- F.W. Lawvere: Intrinsic co-Heyting boundaries and the Leibniz rule in certain toposes.- S.H. Schanuel: Negative sets have Euler characteristic and dimension.-

Using data from one season of NBA games, Basketball Data Science: With Applications in R is the perfect book for anyone interested in learning and applying data analytics in basketball. Whether assessing the spatial performance of an NBA player's shots or doing an analysis of the impact of high pressure game situations on the probability of scoring, this book discusses a variety of case studies and hands-on examples using a custom R package. The codes are supplied so readers can reproduce the analyses themselves or create their own. Assuming a basic statistical knowledge, Basketball Data Science with R is suitable for students, technicians, coaches, data analysts and applied researchers. Features: * One of the first books to provide statistical and data mining methods for the growing field of analytics in basketball. * Presents tools for modelling graphs and figures to visualize the data. * Includes real world case studies and examples, such as estimations of scoring probability using the Golden State Warriors as a test case. * Provides the source code and data so readers can do their own analyses on NBA teams and players.

The present volume contains papers selected for presentation at the 14th Symposium on Mathematical Foundations of Computer Science - MFCS '89 held in Porabka-Kozubnik, Poland, from August 28 to September 1, 1989. Previous MFCs proceedings have also been published in the Lecture Notes in Computer Science. This volume presents investigations and results in theoretical computer science, in particular in the following areas: logics of programs, parallel and distributed computing, deductive databases, automata and formal languages, algorithms and data structures, software specification and validity, complexity and computability theory.