Scheduling in Parallel Computing Systems: Fuzzy and Annealing Techniques advocates the viability of using fuzzy and annealing methods in solving scheduling problems for parallel computing systems. The book proposes new techniques for both static and dynamic scheduling, using emerging paradigms that are inspired by natural phenomena such as fuzzy logic, mean-field annealing, and simulated annealing. Systems that are designed using such techniques are often referred to in the literature as intelligent' because of their capability to adapt to sudden changes in their environments. Moreover, most of these changes cannot be anticipated in advance or included in the original design of the system. Scheduling in Parallel Computing Systems: Fuzzy and Annealing Techniques provides results that prove such approaches can become viable alternatives to orthodox solutions to the scheduling problem, which are mostly based on heuristics. Although heuristics are robust and reliable when solving certain instances of the scheduling problem, they do not perform well when one needs to obtain solutions to general forms of the scheduling problem. On the other hand, techniques inspired by natural phenomena have been successfully applied for solving a wide range of combinatorial optimization problems (e.g. traveling salesman, graph partitioning). The success of these methods motivated their use in this book to solve scheduling problems that are known to be formidable combinatorial problems. Scheduling in Parallel Computing Systems: Fuzzy and Annealing Techniques is an excellent reference and may be used for advanced courses on the topic.

Logic and Complexity looks at basic logic as it is used in Computer Science, and provides students with a logical approach to Complexity theory. With plenty of exercises, this book presents classical notions of mathematical logic, such as decidability, completeness and incompleteness, as well as new ideas brought by complexity theory such as NP-completeness, randomness and approximations, providing a better understanding for efficient algorithmic solutions to problems. Divided into three parts, it covers: - Model Theory and Recursive Functions - introducing the basic model theory of propositional, 1st order, inductive definitions and 2nd order logic. Recursive functions, Turing computability and decidability are also examined. - Descriptive Complexity - looking at the relationship between definitions of problems, queries, properties of programs and their computational complexity. - Approximation - explaining how some optimization problems and counting problems can be approximated according to their logical form. Logic is important in Computer Science, particularly for verification problems and database query languages such as SQL. Students and researchers in this field will find this book of great interest.

Fuzzy hardware developments have been a major force driving the applications of fuzzy set theory and fuzzy logic in both science and engineering. This volume provides the reader with a comprehensive up-to-date look at recent works describing new innovative developments of fuzzy hardware. An important research trend is the design of improved fuzzy hardware. There is an increasing interest in both analog and digital implementations of fuzzy controllers in particular and fuzzy systems in general. Specialized analog and digital VLSI implementations of fuzzy systems, in the form of dedicated architectures, aim at the highest implementation efficiency. This particular efficiency is asserted in terms of processing speed and silicon utilization. Processing speed in particular has caught the attention of developers of fuzzy hardware and researchers in the field.The volume includes detailed material on a variety of fuzzy hardware related topics such as: * Historical review of fuzzy hardware research * Fuzzy hardware based on encoded trapezoids * Pulse stream techniques for fuzzy hardware * Hardware realization of fuzzy neural networks * Design of analog neuro-fuzzy systems in CMOS digital technologies * Fuzzy controller synthesis method * Automatic design of digital and analog neuro-fuzzy controllers * Electronic implementation of complex controllers * Silicon compilation of fuzzy hardware systems * Digital fuzzy hardware processing * Parallel processor architecture for real-time fuzzy applications * Fuzzy cellular systems Fuzzy Hardware: Architectures and Applications is a technical reference book for researchers, engineers and scientists interested in fuzzy systems in general and in building fuzzy systems in particular.

The main theme in classical ring theory is the structure theory of rings of a particular kind. For example, no one text book in ring theory could miss the Wedderburn-Artin theorem, which says that a ring R is semisimple Artinian iffR is isomorphic to a finite direct sum of full matrix rings over skew fields. This is an example of a finiteness condition which, at least historically, has dominated in ring theory. Ifwe would like to consider a requirement of a lattice-theoretical type, other than being Artinian or Noetherian, the most natural is uni-seriality. Here a module M is called uni-serial if its lattice of submodules is a chain, and a ring R is uni-serial if both RR and RR are uni-serial modules. The class of uni-serial rings includes commutative valuation rings and closed under homomorphic images. But it is not closed under direct sums nor with respect to Morita equivalence: a matrix ring over a uni-serial ring is not uni-serial. There is a class of rings which is very close to uni-serial but closed under the constructions just mentioned: serial rings. A ring R is called serial if RR and RR is a direct sum (necessarily finite) of uni-serial modules. Amongst others this class includes triangular matrix rings over a skew field. Also if F is a finite field of characteristic p and G is a finite group with a cyclic normal p-Sylow subgroup, then the group ring FG is serial.

In writing this book, our goal was to produce a text suitable for a first course in mathematical logic more attuned than the traditional textbooks to the re cent dramatic growth in the applications oflogic to computer science. Thus, our choice oftopics has been heavily influenced by such applications. Of course, we cover the basic traditional topics: syntax, semantics, soundnes5, completeness and compactness as well as a few more advanced results such as the theorems of Skolem-Lowenheim and Herbrand. Much ofour book, however, deals with other less traditional topics. Resolution theorem proving plays a major role in our treatment of logic especially in its application to Logic Programming and PRO LOG. We deal extensively with the mathematical foundations ofall three ofthese subjects. In addition, we include two chapters on nonclassical logics - modal and intuitionistic - that are becoming increasingly important in computer sci ence. We develop the basic material on the syntax and semantics (via Kripke frames) for each of these logics. In both cases, our approach to formal proofs, soundness and completeness uses modifications of the same tableau method in troduced for classical logic. We indicate how it can easily be adapted to various other special types of modal logics. A number of more advanced topics (includ ing nonmonotonic logic) are also briefly introduced both in the nonclassical logic chapters and in the material on Logic Programming and PROLOG.

In this monograph we study two generalizations of standard unification, E-unification and higher-order unification, using an abstract approach orig inated by Herbrand and developed in the case of standard first-order unifi cation by Martelli and Montanari. The formalism presents the unification computation as a set of non-deterministic transformation rules for con verting a set of equations to be unified into an explicit representation of a unifier (if such exists). This provides an abstract and mathematically elegant means of analysing the properties of unification in various settings by providing a clean separation of the logical issues from the specification of procedural information, and amounts to a set of 'inference rules' for unification, hence the title of this book. We derive the set of transformations for general E-unification and higher order unification from an analysis of the sense in which terms are 'the same' after application of a unifying substitution. In both cases, this results in a simple extension of the set of basic transformations given by Herbrand Martelli-Montanari for standard unification, and shows clearly the basic relationships of the fundamental operations necessary in each case, and thus the underlying structure of the most important classes of term unifi cation problems."

Intelligent Hybrid Systems: Fuzzy Logic, Neural Networks, and Genetic Algorithms is an organized edited collection of contributed chapters covering basic principles, methodologies, and applications of fuzzy systems, neural networks and genetic algorithms. All chapters are original contributions by leading researchers written exclusively for this volume. This book reviews important concepts and models, and focuses on specific methodologies common to fuzzy systems, neural networks and evolutionary computation. The emphasis is on development of cooperative models of hybrid systems. Included are applications related to intelligent data analysis, process analysis, intelligent adaptive information systems, systems identification, nonlinear systems, power and water system design, and many others. Intelligent Hybrid Systems: Fuzzy Logic, Neural Networks, and Genetic Algorithms provides researchers and engineers with up-to-date coverage of new results, methodologies and applications for building intelligent systems capable of solving large-scale problems.

A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is written as a graduate text and so aims to provide a reasonably self-contained introduction to this subject. The author has provided numerous examples and exercises to further illustrate the ideas presented.

Basic Real Analysis demonstrates the richness of real analysis, giving students an introduction both to mathematical rigor and to the deep theorems and counter examples that arise from such rigor. In this modern and systematic text, all the touchstone results and fundamentals are carefully presented in a style that requires little prior familiarity with proofs or mathematical language. With its many examples, exercises and broad view of analysis, this work is ideal for senior undergraduates and beginning graduate students, either in the classroom or for self-study.

An Introduction to Fuzzy Logic Applications in Intelligent Systems consists of a collection of chapters written by leading experts in the field of fuzzy sets. Each chapter addresses an area where fuzzy sets have been applied to situations broadly related to intelligent systems. The volume provides an introduction to and an overview of recent applications of fuzzy sets to various areas of intelligent systems. Its purpose is to provide information and easy access for people new to the field. The book also serves as an excellent reference for researchers in the field and those working in the specifics of systems development. People in computer science, especially those in artificial intelligence, knowledge-based systems, and intelligent systems will find this to be a valuable sourcebook. Engineers, particularly control engineers, will also have a strong interest in this book. Finally, the book will be of interest to researchers working in decision support systems, operations research, decision theory, management science and applied mathematics. An Introduction to Fuzzy Logic Applications in Intelligent Systems may also be used as an introductory text and, as such, it is tutorial in nature.

ThesubjectofthisbookisSemi-In?niteAlgebra,ormorespeci?cally,Semi-In?nite Homological Algebra. The term "semi-in?nite" is loosely associated with objects that can be viewed as extending in both a "positive" and a "negative" direction, withsomenaturalpositioninbetween,perhapsde?nedupto a"?nite"movement. Geometrically, this would mean an in?nite-dimensional variety with a natural class of "semi-in?nite" cycles or subvarieties, having always a ?nite codimension in each other, but in?nite dimension and codimension in the whole variety [37]. (For further instances of semi-in?nite mathematics see, e. g. , [38] and [57], and references below. ) Examples of algebraic objects of the semi-in?nite type range from certain in?nite-dimensional Lie algebras to locally compact totally disconnected topolo- cal groups to ind-schemes of ind-in?nite type to discrete valuation ?elds. From an abstract point of view, these are ind-pro-objects in various categories, often - dowed with additional structures. One contribution we make in this monograph is the demonstration of another class of algebraic objects that should be thought of as "semi-in?nite", even though they do not at ?rst glance look quite similar to the ones in the above list. These are semialgebras over coalgebras, or more generally over corings - the associative algebraic structures of semi-in?nite nature. The subject lies on the border of Homological Algebra with Representation Theory, and the introduction of semialgebras into it provides an additional link with the theory of corings [23], as the semialgebrasare the natural objects dual to corings.

A new foundation of Topology, summarized under the name Convenient Topology, is considered such that several deficiencies of topological and uniform spaces are remedied. This does not mean that these spaces are superfluous. It means exactly that a better framework for handling problems of a topological nature is used. In this setting semiuniform convergence spaces play an essential role. They include not only convergence structures such as topological structures and limit space structures, but also uniform convergence structures such as uniform structures and uniform limit space structures, and they are suitable for studying continuity, Cauchy continuity and uniform continuity as well as convergence structures in function spaces, e.g. simple convergence, continuous convergence and uniform convergence. Various interesting results are presented which cannot be obtained by using topological or uniform spaces in the usual context. The text is self-contained with the exception of the last chapter, where the intuitive concept of nearness is incorporated in Convenient Topology (there exist already excellent expositions on nearness spaces).

Science involves descriptions of the world we live in. It also depends on nature exhibiting what we can best describe as a high aLgorithmic content. The theme running through this collection of papers is that of the interaction between descriptions, in the form of formal theories, and the algorithmic content of what is described, namely of the modeLs of those theories. This appears most explicitly here in a number of valuable, and substantial, contributions to what has until recently been known as 'recursive model theory' - an area in which researchers from the former Soviet Union (in particular Novosibirsk) have been pre-eminent. There are also articles concerned with the computability of aspects of familiar mathematical structures, and - a return to the sort of basic underlying questions considered by Alan Turing in the early days of the subject - an article giving a new perspective on computability in the real world. And, of course, there are also articles concerned with the classical theory of computability, including the first widely available survey of work on quasi-reducibility. The contributors, all internationally recognised experts in their fields, have been associated with the three-year INTAS-RFBR Research Project "Com putability and Models" (Project No. 972-139), and most have participated in one or more of the various international workshops (in Novosibirsk, Heidelberg and Almaty) and otherresearch activities of the network.

Since their inception, fuzzy sets and fuzzy logic became popular. The reason is that the very idea of fuzzy sets and fuzzy logic attacks an old tradition in science, namely bivalent (black-or-white, all-or-none) judg ment and reasoning and the thus resulting approach to formation of scientific theories and models of reality. The idea of fuzzy logic, briefly speaking, is just the opposite of this tradition: instead of full truth and falsity, our judgment and reasoning also involve intermediate truth values. Application of this idea to various fields has become known under the term fuzzy approach (or graded truth approach). Both prac tice (many successful engineering applications) and theory (interesting nontrivial contributions and broad interest of mathematicians, logicians, and engineers) have proven the usefulness of fuzzy approach. One of the most successful areas of fuzzy methods is the application of fuzzy relational modeling. Fuzzy relations represent formal means for modeling of rather nontrivial phenomena (reasoning, decision, control, knowledge extraction, systems analysis and design, etc. ) in the pres ence of a particular kind of indeterminacy called vagueness. Models and methods based on fuzzy relations are often described by logical formulas (or by natural language statements that can be translated into logical formulas). Therefore, in order to approach these models and methods in an appropriate formal way, it is desirable to have a general theory of fuzzy relational systems with basic connections to (formal) language which enables us to describe relationships in these systems.

ClDo _ IIIIIIIoaIIIics bu _ die 'EI JDDi, *** sij'_ ...-..._. je _ ...lIbupalaJllllllllll __ D'y_poa~: wbae it beIoap...die . . "...,. . _ DOD to dlecluly __ * __ . ~ 1110 _ is dioapaI; -. . e _ may be EricT. BeD IbIetodo--'_iL O. 1feaoriIide Mathematics is a tool for dloogIrt. A bighly necessary tool in a world where both feedback and noolineari- ties abound. Similarly, all kinds of parts of IIIIIIhcmatiI:s serve as tools for odIcr parts and for ocher sci- eoccs. Applying a simple rewriting rule to the quote on the right above one finds suc:h stalements as: 'One ser- vice topology has rcncIerM mathematical physics ...'; 'One service logic has rendered computer science . * . '; 'One service category theory has rmdcn:d mathematics ...'. All arguably true. And all statements obrainable this way form part of the raison d'etm of this series. This series, Mathmlatics tDIII Its Applications, saaned in 1977. Now that over one hundred volumcs have appeared it seems opportune to reexamine its scope. AI. the time I wrote "Growing spccialization and divenification have brought a host of monographs and textbooks on incJeasingly specialized topics. However, the 'tree' of knowledge of JJJatbcmatics and reIatcd ficIds docs not grow only by putting forth new bnDdIcs. It also happens, quite often in fact, that brancbes which were thought to be comp1etcly disparate am suddenly seen to be rdatcd.

One criterion for classifying books is whether they are written for a single pur pose or for multiple purposes. This book belongs to the category of multipurpose books, but one of its roles is predominant-it is primarily a textbook. As such, it can be used for a variety ofcourses at the first-year graduate or upper-division undergraduate level. A common characteristic of these courses is that they cover fundamental systems concepts, major categories of systems problems, and some selected methods for dealing with these problems at a rather general level. A unique feature of the book is that the concepts, problems, and methods are introduced in the context of an architectural formulation of an expert system referred to as the general systems problem solver or aSPS-whose aim is to provide users ofall kinds with computer-based systems knowledge and methodo logy. Theasps architecture, which is developed throughout the book, facilitates a framework that is conducive to acoherent, comprehensive, and pragmaticcoverage ofsystems fundamentals-concepts, problems, and methods. A course that covers systems fundamentals is now offered not only in sys tems science, information science, or systems engineering programs, but in many programs in other disciplines as well. Although the level ofcoverage for systems science or engineering students is surely different from that used for students in other disciplines, this book is designed to serve both of these needs."

Computational intelligence paradigms have attracted the growing interest of researchers, scientists, engineers and application engineers in a number of everyday applications. These applications are not limited to any particular field and include engineering, business, banking and consumer electronics. Computational intelligence paradigms include artificial intelligence, artificial neural networks, fuzzy systems and evolutionary computing. Artificial neural networks can mimic the biological information processing mechanism in a very limited sense. Evolutionary computing algorithms are used for optimisation applications, and fuzzy logic provides a basis for representing uncertain and imprecise knowledge. Practical Applications of Computational Intelligence Techniques contains twelve chapters providing actual application of these techniques in the real world. Such examples include, but are not limited to, intelligent household appliances, aerial spray models, industrial applications and medical diagnostics and practice. This book will be useful to researchers, practicing engineers/scientists and students, who are interested in developing practical applications in a computational intelligence environment.

For more than 30 years, the author has studied the model-theoretic aspects of the theory of valued fields and multi-valued fields. Many of the key results included in this book were obtained by the author whilst preparing the manuscript. Thus the unique overview of the theory, as developed in the book, has been previously unavailable. The book deals with the theory of valued fields and mutli-valued fields. The theory of Prufer rings is discussed from the `geometric' point of view. The author shows that by introducing the Zariski topology on families of valuation rings, it is possible to distinguish two important subfamilies of Prufer rings that correspond to Boolean and near Boolean families of valuation rings. Also, algebraic and model-theoretic properties of multi-valued fields with near Boolean families of valuation rings satisfying the local-global principle are studied. It is important that this principle is elementary, i.e., it can be expressed in the language of predicate calculus. The most important results obtained in the book include a criterion for the elementarity of an embedding of a multi-valued field and a criterion for the elementary equivalence for multi-valued fields from the class defined by the additional natural elementary conditions (absolute unramification, maximality and almost continuity of local elementary properties). The book concludes with a brief chapter discussing the bibliographic references available on the material presented, and a short history of the major developments within the field.

Alonzo Church was undeniably one ofthe intellectual giants of theTwenti- eth Century . These articles are dedicated to his memory and illustrate the tremendous importance his ideas have had in logic , mathematics, comput er science and philosophy . Discussions of some of thesevarious contributions have appeared in The Bulletin of Symbolic Logic, and th e interested reader is invited to seek details there . Here we justtry to give somegener al sense of the scope, depth,and value of his work. Church is perhaps best known for the theorem , appropriately called " C h u r c h ' s Theorem ", that there is no decision procedure forthelogical valid- ity of formulas first-order of logic . A d ecision proce dure forthat part of logic would have come near to fulfilling Leibniz's dream of a calculus that could be mechanically used tosettle logical disputes . It was not to . be It could not be . What Church proved precisely is that there is no lambda-definable function that can i n every case providethe right answer , ' y e s ' or ' n o', tothe question of whether or not any arbitrarily given formula is valid .

Modern algebra, which not long ago seemed to be a science divorced from real life, now has numerous applications. Many fine algebraic structures are endowed with meaningful contents. Now and then practice suggests new and unexpected structures enriching algebra. This does not mean that algebra has become merely a tool for applications. Quite the contrary, it significantly benefits from the new connections. The present book is devoted to some algebraic aspects of the theory of databases. It consists of three parts. The first part contains information about universal algebra, algebraic logic is the subject of the second part, and the third one deals with databases. The algebraic material of the flI'St two parts serves the common purpose of applying algebra to databases. The book is intended for use by mathematicians, and mainly by algebraists, who realize the necessity to unite theory and practice. It is also addressed to programmers, engineers and all potential users of mathematics who want to construct their models with the help of algebra and logic. Nowadays, the majority of professional mathematicians work in close cooperation with representatives of applied sciences and even industrial technology. It is neces sary to develop an ability to see mathematics in different particular situations. One of the tasks of this book is to promote the acquisition of such skills."

In The Foundations of Quantum Mechanics - Historical Analysis and Open Questions, leading Italian researchers involved in different aspects of the foundations and history of quantum mechanics are brought together in an interdisciplinary debate. The book therefore presents an invaluable overview of the state of Italian work in the field at this moment, and of the open problems that still exist in the foundations of the theory. Audience: Physicists, logicians, mathematicians and epistemologists whose research concerns the historical analysis of quantum mechanics.

As we stand at the precipice of the twenty first century the ability to capture and transmit copious amounts of information is clearly a defining feature of the human race. In order to increase the value of this vast supply of information we must develop means for effectively processing it. Newly emerging disciplines such as Information Engineering and Soft Computing are being developed in order to provide the tools required. Conferences such as the International Conference on Information Processing and ManagementofUncertainty in Knowledge-based Systems (IPMU) are being held to provide forums in which researchers can discuss the latest developments. The recent IPMU conference held at La Sorbonne in Paris brought together some of the world's leading experts in uncertainty and information fusion. In this volume we have included a selection ofpapers from this conference. What should be clear from looking at this volume is the number of different ways that are available for representing uncertain information. This variety in representational frameworks is a manifestation of the different types of uncertainty that appear in the information available to the users. Perhaps, the representation with the longest history is probability theory. This representation is best at addressing the uncertainty associated with the occurrence of different values for similar variables. This uncertainty is often described as randomness. Rough sets can be seen as a type of uncertainty that can deal effectively with lack of specificity, it is a powerful tool for manipulating granular information.

We dedicate this volume to Professor Parimala on the occasion of her 60th birthday. It contains a variety of papers related to the themes of her research. Parimala's rst striking result was a counterexample to a quadratic analogue of Serre's conjecture (Bulletin of the American Mathematical Society, 1976). Her in uence has cont- ued through her tenure at the Tata Institute of Fundamental Research in Mumbai (1976-2006),and now her time at Emory University in Atlanta (2005-present). A conference was held from 30 December 2008 to 4 January 2009, at the U- versity of Hyderabad, India, to celebrate Parimala's 60th birthday (see the conf- ence's Web site at http://mathstat.uohyd.ernet.in/conf/quadforms2008). The or- nizing committee consisted of J.-L. Colliot-Thel ' en ' e, Skip Garibaldi, R. Sujatha, and V. Suresh. The present volume is an outcome of this event. We would like to thank all the participants of the conference, the authors who have contributed to this volume, and the referees who carefully examined the s- mitted papers. We would also like to thank Springer-Verlag for readily accepting to publish the volume. In addition, the other three editors of the volume would like to place on record their deep appreciation of Skip Garibaldi's untiring efforts toward the nal publication.

Adaptive Resonance Theory Microchips describes circuit strategies resulting in efficient and functional adaptive resonance theory (ART) hardware systems. While ART algorithms have been developed in software by their creators, this is the first book that addresses efficient VLSI design of ART systems. All systems described in the book have been designed and fabricated (or are nearing completion) as VLSI microchips in anticipation of the impending proliferation of ART applications to autonomous intelligent systems. To accommodate these systems, the book not only provides circuit design techniques, but also validates them through experimental measurements. The book also includes a chapter tutorially describing four ART architectures (ART1, ARTMAP, Fuzzy-ART and Fuzzy-ARTMAP) while providing easily understandable MATLAB code examples to implement these four algorithms in software. In addition, an entire chapter is devoted to other potential applications for real-time data clustering and category learning.

Text Retrieval and Filtering: Analytical Models of Performance is the first book that addresses the problem of analytically computing the performance of retrieval and filtering systems. The book describes means by which retrieval may be studied analytically, allowing one to describe current performance, predict future performance, and to understand why systems perform as they do. The focus is on retrieving and filtering natural language text, with material addressing retrieval performance for the simple case of queries with a single term, the more complex case with multiple terms, both with term independence and term dependence, and for the use of grammatical information to improve performance. Unambiguous statements of the conditions under which one method or system will be more effective than another are developed. Text Retrieval and Filtering: Analytical Models of Performance focuses on the performance of systems that retrieve natural language text, considering full sentences as well as phrases and individual words. The last chapter explicitly addresses how grammatical constructs and methods may be studied in the context of retrieval or filtering system performance. The book builds toward solving this problem, although the material in earlier chapters is as useful to those addressing non-linguistic, statistical concerns as it is to linguists. Those interested in grammatical information should be cautioned to carefully examine earlier chapters, especially Chapters 7 and 8, which discuss purely statistical relationships between terms, before moving on to Chapter 10, which explicitly addresses linguistic issues. Text Retrieval and Filtering: Analytical Models of Performance is suitable as a secondary text for a graduate level course on Information Retrieval or Linguistics, and as a reference for researchers and practitioners in industry.