birkhäuser boston birkhäuser boston jan 1990 (21 résultats)

Taschenbuch. Etat : Neu. Neuware -The need for improved mathematics education at the high school andcollege levels has never been more apparent than in the 1990s. Asearly as the 1960s, I. M. Gel'fand and his colleagues in the USSRthought hard about this same question and developed a style forpresenting basic mathematics in a clear and simple form that engagedthe curiosity and intellectual interest of thousands of high schooland college students. These same ideas, this same content, unchangedby over thirty years of experience and mathematical development, areavailable in the present books to any student who is willing to readto be stimulated and to learn.'The Method of Coordinates' is a way of transferring geometric imagesinto formulas, a method for describing pictures by numbers and lettersdenoting constants and variables. It is fundamental to the study ofcalculus and other mathematical topics. Teachers of mathematics willfind here a fresh understanding of the subject and a valuable path tothe training of students in mathematical concepts and skills.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 84 pp. Englisch.

Buch. Etat : Neu. Neuware -Ever since its introduction around 1960 by Kirillov, the orbit method has played a major role in representation theory of Lie groups and Lie algebras. This book contains the proceedings of a conference held from August 29 to September 2, 1988, at the University of Copenhagen, about 'the orbit method in representation theory.' It contains ten articles, most of which are original research papers, by well-known mathematicians in the field, and it reflects the fact that the orbit method plays an important role in the representation theory of semisimple Lie groups, solvable Lie groups, and even more general Lie groups, and also in the theory of enveloping algebras.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 244 pp. Englisch.

Taschenbuch. Etat : Neu. Neuware -In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who was over ninety years old at the time, was every bit as rewarding as I had hoped it would be. His creativity, intelligence, warmth and generosity of spirit, and wonderful gift for teaching continue to be an inspiration to me. Combinatorics is one of the branches of mathematics that play a crucial role in computer sCience, since digital computers manipulate discrete, finite objects. Combinatorics impinges on computing in two ways. First, the properties of graphs and other combinatorial objects lead directly to algorithms for solving graph-theoretic problems, which have widespread application in non-numerical as well as in numerical computing. Second, combinatorial methods provide many analytical tools that can be used for determining the worst-case and expected performance of computer algorithms. A knowledge of combinatorics will serve the computer scientist well. Combinatorics can be classified into three types: enumerative, eXistential, and constructive. Enumerative combinatorics deals with the counting of combinatorial objects. Existential combinatorics studies the existence or nonexistence of combinatorial configurations.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 204 pp. Englisch.

Taschenbuch. Etat : Neu. Neuware -The theory of hyperbolic groups has its starting point in a fundamental paper by M. Gromov, published in 1987. These are finitely generated groups that share important properties with negatively curved Riemannian manifolds.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 300 pp. Englisch.

Buch. Etat : Neu. Neuware -Since the seminal work of P. Anderson in 1958, localization in disordered systems has been the object of intense investigations. Mathematically speaking, the phenomenon can be described as follows: the self-adjoint operators which are used as Hamiltonians for these systems have a ten dency to have pure point spectrum, especially in low dimension or for large disorder. A lot of effort has been devoted to the mathematical study of the random self-adjoint operators relevant to the theory of localization for disordered systems. It is fair to say that progress has been made and that the un derstanding of the phenomenon has improved. This does not mean that the subject is closed. Indeed, the number of important problems actually solved is not larger than the number of those remaining. Let us mention some of the latter: ¿ A proof of localization at all energies is still missing for two dimen sional systems, though it should be within reachable range. In the case of the two dimensional lattice, this problem has been approached by the investigation of a finite discrete band, but the limiting pro cedure necessary to reach the full two-dimensional lattice has never been controlled. ¿ The smoothness properties of the density of states seem to escape all attempts in dimension larger than one. This problem is particularly serious in the continuous case where one does not even know if it is continuous.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 620 pp. Englisch.

Buch. Etat : Neu. Neuware -In the spring of 1987, I was in Havana, Cuba, where I was participating in planning a large-scale longitudinal study of the neurophysiological, neurochemical, and behavioral characteristics of cohorts of patients with cerebrovascular disease, depression, senile dementia, schizophrenia, or learning disabilities; and also part of this study were their first-degree blood relatives. This study was the outgrowth of a long-term project on the practical application of computer methods for the evaluation of brain electrical activity related to anatomical integrity, maturational development, and sensory, perceptual; -and cognitive processes, especially in chil dren. For many years, that project had been supported by the United Nations Development Program (UNDP), the National Scientific Research Center of Cuba (CNIC), and the Ministries of Public Health and of Education of Cuba. Since its inception, I had served as a technical advisor to the UNDP project. When the project began, I became acquainted with Dr. Jose M. Miyar Barrueco, who was at that time the Rector of the Medical School of the University of Havana. Because of his keen interest in the new computer technology and its potential utility in developing countries, we met from time to time during my visits. These occasional meetings continued after he became Secretary of the Cuban Council of State, so that he could remain apprised of progress and problems with which he might help.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 608 pp. Englisch.

Buch. Etat : Neu. Neuware - This volume is the second of the three volume publication containing the proceedings of the 1989 International Symposium on the Mathemat ical Theory of Networks and Systems (MTNS-89), which was held in Amsterdam, The Netherlands, June 19-23, 1989 The International Symposia MTNS focus attention on problems from system and control theory, circuit theory and signal processing, which, in general, require application of sophisticated mathematical tools, such as from function and operator theory, linear algebra and matrix theory, differential and algebraic geometry. The interaction between advanced mathematical methods and practical engineering problems of circuits, systems and control, which is typical for MTNS, turns out to be most effective and is, as these proceedings show, a continuing source of exciting advances. The second volume contains invited papers and a large selection of other symposium presentations in the vast area of robust and nonlinear control. Modern developments in robust control and H-infinity theory, for finite as well as for infinite dimensional systems, are presented. A large part of the volume is devoted to nonlinear control. Special atten tion is paid to problems in robotics. Also the general theory of nonlinear and infinite dimensional systems is discussed. A couple of papers deal with problems of stochastic control and filterina. vi Preface The titles of the two other volumes are: Realization and Modelling in System Theory (volume 1) and Signal Processing, Scattering and Operator Theory, and Numerical Methods (volume 3).

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The need for improved mathematics education at the high school andcollege levels has never been more apparent than in the 1990s. Asearly as the 1960s, I. M. Gel'fand and his colleagues in the USSRthought hard about this same question and developed a style forpresenting basic mathematics in a clear and simple form that engagedthe curiosity and intellectual interest of thousands of high schooland college students. These same ideas, this same content, unchangedby over thirty years of experience and mathematical development, areavailable in the present books to any student who is willing to read,to be stimulated and to learn.'The Method of Coordinates' is a way of transferring geometric imagesinto formulas, a method for describing pictures by numbers and lettersdenoting constants and variables. It is fundamental to the study ofcalculus and other mathematical topics. Teachers of mathematics willfind here a fresh understanding of the subject and a valuable path tothe training of students in mathematical concepts and skills. 84 pp. Englisch.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A so-called 'effective' algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A 'feasible' algorithm is one which only requires a limited amount of space and/or time for execution; the general idea is that a feasible algorithm is one which may be practical on today's or at least tomorrow's computers. There is no definitive analogue of Church's thesis giving a mathematical definition of feasibility; however, the most widely studied mathematical model of feasible computability is polynomial-time computability. Feasible Mathematics includes both the study of feasible computation from a mathematical and logical point of view and the reworking of traditional mathematics from the point of view of feasible computation. The diversity of Feasible Mathematics is illustrated by the. contents of this volume which includes papers on weak fragments of arithmetic, on higher type functionals, on bounded linear logic, on sub recursive definitions of complexity classes, on finite model theory, on models of feasible computation for real numbers, on vector spaces and on recursion theory. The vVorkshop on Feasible Mathematics was sponsored by the Mathematical Sciences Institute and was held at Cornell University, June 26-28, 1989. 364 pp. Englisch.

Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Ever since its introduction around 1960 by Kirillov, the orbit method has played a major role in representation theory of Lie groups and Lie algebras. This book contains the proceedings of a conference held from August 29 to September 2, 1988, at the University of Copenhagen, about 'the orbit method in representation theory.' It contains ten articles, most of which are original research papers, by well-known mathematicians in the field, and it reflects the fact that the orbit method plays an important role in the representation theory of semisimple Lie groups, solvable Lie groups, and even more general Lie groups, and also in the theory of enveloping algebras. 244 pp. Englisch.

Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Man sollte weniger danach streben, die Grenzen der mathe matischen Wissenschaften zu erweitern, als vielmehr danach, den bereits vorhandenen Stoff aus umfassenderen Gesichts punkten zu betrachten - E. Study Today most mathematicians who know about Kronecker's theory of divisors know about it from having read Hermann Weyl's lectures on algebraic number theory [We], and regard it, as Weyl did, as an alternative to Dedekind's theory of ideals. Weyl's axiomatization of what he calls 'Kronecker's' theory is built-as Dedekind's theory was built-around unique factor ization. However, in presenting the theory in this way, Weyl overlooks one of Kronecker's most valuable ideas, namely, the idea that the objective of the theory is to define greatest com mon divisors, not to achieve factorization into primes. The reason Kronecker gave greatest common divisors the primary role is simple: they are independent of the ambient field while factorization into primes is not. The very notion of primality depends on the field under consideration-a prime in one field may factor in a larger field-so if the theory is founded on factorization into primes, extension of the field entails a completely new theory. Greatest common divisors, on the other hand, can be defined in a manner that does not change at all when the field is extended (see 1.16). Only after he has laid the foundation of the theory of divisors does Kronecker consider factorization of divisors into divisors prime in some specified field. 184 pp. Englisch.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who was over ninety years old at the time, was every bit as rewarding as I had hoped it would be. His creativity, intelligence, warmth and generosity of spirit, and wonderful gift for teaching continue to be an inspiration to me. Combinatorics is one of the branches of mathematics that play a crucial role in computer sCience, since digital computers manipulate discrete, finite objects. Combinatorics impinges on computing in two ways. First, the properties of graphs and other combinatorial objects lead directly to algorithms for solving graph-theoretic problems, which have widespread application in non-numerical as well as in numerical computing. Second, combinatorial methods provide many analytical tools that can be used for determining the worst-case and expected performance of computer algorithms. A knowledge of combinatorics will serve the computer scientist well. Combinatorics can be classified into three types: enumerative, eXistential, and constructive. Enumerative combinatorics deals with the counting of combinatorial objects. Existential combinatorics studies the existence or nonexistence of combinatorial configurations. 204 pp. Englisch.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -1. 1 The problem and the approach The model developed here, which is actually more a collection of com ponents than a single monolithic structure, traces a path from relatively low-level neural/connectionistic structures and processes to relatively high-level animal/artificial intelligence behaviors. Incremental extension of this initial path permits increasingly sophisticated representation and processing strategies, and consequently increasingly sophisticated behavior. The initial chapters develop the basic components of the sys tem at the node and network level, with the general goal of efficient category learning and representation. The later chapters are more con cerned with the problems of assembling sequences of actions in order to achieve a given goal state. The model is referred to as connectionistic rather than neural, be cause, while the basic components are neuron-like, there is only limited commitment to physiological realism. Consequently the neuron-like ele ments are referred to as 'nodes' rather than 'neurons'. The model is directed more at the behavioral level, and at that level, numerous con cepts from animal learning theory are directly applicable to connectionis tic modeling. An attempt to actually implement these behavioral theories in a computer simulation can be quite informative, as most are only partially specified, and the gaps may be apparent only when actual ly building a functioning system. In addition, a computer implementa tion provides an improved capability to explore the strengths and limita tions of the different approaches as well as their various interactions. 288 pp. Englisch.

Buch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Man sollte weniger danach streben, die Grenzen der mathe matischen Wissenschaften zu erweitern, als vielmehr danach, den bereits vorhandenen Stoff aus umfassenderen Gesichts punkten zu betrachten - E. Study Today most mathematicians who know about Kronecker's theory of divisors know about it from having read Hermann Weyl's lectures on algebraic number theory [We], and regard it, as Weyl did, as an alternative to Dedekind's theory of ideals. Weyl's axiomatization of what he calls 'Kronecker's' theory is built-as Dedekind's theory was built-around unique factor ization. However, in presenting the theory in this way, Weyl overlooks one of Kronecker's most valuable ideas, namely, the idea that the objective of the theory is to define greatest com mon divisors, not to achieve factorization into primes. The reason Kronecker gave greatest common divisors the primary role is simple: they are independent of the ambient field while factorization into primes is not. The very notion of primality depends on the field under consideration-a prime in one field may factor in a larger field-so if the theory is founded on factorization into primes, extension of the field entails a completely new theory. Greatest common divisors, on the other hand, can be defined in a manner that does not change at all when the field is extended (see 1.16). Only after he has laid the foundation of the theory of divisors does Kronecker consider factorization of divisors into divisors prime in some specified field.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 184 pp. Englisch.

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -1. 1 The problem and the approach The model developed here, which is actually more a collection of com ponents than a single monolithic structure, traces a path from relatively low-level neural/connectionistic structures and processes to relatively high-level animal/artificial intelligence behaviors. Incremental extension of this initial path permits increasingly sophisticated representation and processing strategies, and consequently increasingly sophisticated behavior. The initial chapters develop the basic components of the sys tem at the node and network level, with the general goal of efficient category learning and representation. The later chapters are more con cerned with the problems of assembling sequences of actions in order to achieve a given goal state. The model is referred to as connectionistic rather than neural, be cause, while the basic components are neuron-like, there is only limited commitment to physiological realism. Consequently the neuron-like ele ments are referred to as 'nodes' rather than 'neurons'. The model is directed more at the behavioral level, and at that level, numerous con cepts from animal learning theory are directly applicable to connectionis tic modeling. An attempt to actually implement these behavioral theories in a computer simulation can be quite informative, as most are only partially specified, and the gaps may be apparent only when actual ly building a functioning system. In addition, a computer implementa tion provides an improved capability to explore the strengths and limita tions of the different approaches as well as their various interactions.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 288 pp. Englisch.

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -A so-called 'effective' algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A 'feasible' algorithm is one which only requires a limited amount of space and/or time for execution; the general idea is that a feasible algorithm is one which may be practical on today's or at least tomorrow's computers. There is no definitive analogue of Church's thesis giving a mathematical definition of feasibility; however, the most widely studied mathematical model of feasible computability is polynomial-time computability. Feasible Mathematics includes both the study of feasible computation from a mathematical and logical point of view and the reworking of traditional mathematics from the point of view of feasible computation. The diversity of Feasible Mathematics is illustrated by the. contents of this volume which includes papers on weak fragments of arithmetic, on higher type functionals, on bounded linear logic, on sub recursive definitions of complexity classes, on finite model theory, on models of feasible computation for real numbers, on vector spaces and on recursion theory. The vVorkshop on Feasible Mathematics was sponsored by the Mathematical Sciences Institute and was held at Cornell University, June 26-28, 1989.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 364 pp. Englisch.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The theory of hyperbolic groups has its starting point in a fundamental paper by M. Gromov, published in 1987. These are finitely generated groups that share important properties with negatively curved Riemannian manifolds.This monograph is intended to be an introduction to part of Gromov's theory, giving basic definitions, some of the most important examples, various properties of hyperbolic groups, and an application to the construction of infinite torsion groups. The main theme is the relevance of geometric ideas to the understanding of finitely generated groups. In addition to chapters written by the editors, contributions by W. Ballmann, A. Haefliger, E. Salem, R. Strebel, and M. Troyanov are also included.The book will be particularly useful to researchers in combinatorial group theory, Riemannian geometry, and theoretical physics, as well as post-graduate students interested in these fields. 300 pp. Englisch.

Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In the spring of 1987, I was in Havana, Cuba, where I was participating in planning a large-scale longitudinal study of the neurophysiological, neurochemical, and behavioral characteristics of cohorts of patients with cerebrovascular disease, depression, senile dementia, schizophrenia, or learning disabilities; and also part of this study were their first-degree blood relatives. This study was the outgrowth of a long-term project on the practical application of computer methods for the evaluation of brain electrical activity related to anatomical integrity, maturational development, and sensory, perceptual; -and cognitive processes, especially in chil dren. For many years, that project had been supported by the United Nations Development Program (UNDP), the National Scientific Research Center of Cuba (CNIC), and the Ministries of Public Health and of Education of Cuba. Since its inception, I had served as a technical advisor to the UNDP project. When the project began, I became acquainted with Dr. Jose M. Miyar Barrueco, who was at that time the Rector of the Medical School of the University of Havana. Because of his keen interest in the new computer technology and its potential utility in developing countries, we met from time to time during my visits. These occasional meetings continued after he became Secretary of the Cuban Council of State, so that he could remain apprised of progress and problems with which he might help. 608 pp. Englisch.

Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Since the seminal work of P. Anderson in 1958, localization in disordered systems has been the object of intense investigations. Mathematically speaking, the phenomenon can be described as follows: the self-adjoint operators which are used as Hamiltonians for these systems have a ten dency to have pure point spectrum, especially in low dimension or for large disorder. A lot of effort has been devoted to the mathematical study of the random self-adjoint operators relevant to the theory of localization for disordered systems. It is fair to say that progress has been made and that the un derstanding of the phenomenon has improved. This does not mean that the subject is closed. Indeed, the number of important problems actually solved is not larger than the number of those remaining. Let us mention some of the latter: - A proof of localization at all energies is still missing for two dimen sional systems, though it should be within reachable range. In the case of the two dimensional lattice, this problem has been approached by the investigation of a finite discrete band, but the limiting pro cedure necessary to reach the full two-dimensional lattice has never been controlled. - The smoothness properties of the density of states seem to escape all attempts in dimension larger than one. This problem is particularly serious in the continuous case where one does not even know if it is continuous. 620 pp. Englisch.

Buch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -This volume is the second of the three volume publication containing the proceedings of the 1989 International Symposium on the Mathemat ical Theory of Networks and Systems (MTNS-89), which was held in Amsterdam, The Netherlands, June 19-23, 1989 The International Symposia MTNS focus attention on problems from system and control theory, circuit theory and signal processing, which, in general, require application of sophisticated mathematical tools, such as from function and operator theory, linear algebra and matrix theory, differential and algebraic geometry. The interaction between advanced mathematical methods and practical engineering problems of circuits, systems and control, which is typical for MTNS, turns out to be most effective and is, as these proceedings show, a continuing source of exciting advances. The second volume contains invited papers and a large selection of other symposium presentations in the vast area of robust and nonlinear control. Modern developments in robust control and H-infinity theory, for finite as well as for infinite dimensional systems, are presented. A large part of the volume is devoted to nonlinear control. Special atten tion is paid to problems in robotics. Also the general theory of nonlinear and infinite dimensional systems is discussed. A couple of papers deal with problems of stochastic control and filterina. vi Preface The titles of the two other volumes are: Realization and Modelling in System Theory (volume 1) and Signal Processing, Scattering and Operator Theory, and Numerical Methods (volume 3). 684 pp. Englisch.

Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This volume is the second of the three volume publication containing the proceedings of the 1989 International Symposium on the Mathemat ical Theory of Networks and Systems (MTNS-89), which was held in Amsterdam, The Netherlands, June 19-23, 1989 The International Symposia MTNS focus attention on problems from system and control theory, circuit theory and signal processing, which, in general, require application of sophisticated mathematical tools, such as from function and operator theory, linear algebra and matrix theory, differential and algebraic geometry. The interaction between advanced mathematical methods and practical engineering problems of circuits, systems and control, which is typical for MTNS, turns out to be most effective and is, as these proceedings show, a continuing source of exciting advances. The second volume contains invited papers and a large selection of other symposium presentations in the vast area of robust and nonlinear control. Modern developments in robust control and H-infinity theory, for finite as well as for infinite dimensional systems, are presented. A large part of the volume is devoted to nonlinear control. Special atten tion is paid to problems in robotics. Also the general theory of nonlinear and infinite dimensional systems is discussed. A couple of papers deal with problems of stochastic control and filterina. vi Preface The titles of the two other volumes are: Realization and Modelling in System Theory (volume 1) and Signal Processing, Scattering and Operator Theory, and Numerical Methods (volume 3). 684 pp. Englisch.