Boundaries and Hulls of Euclidean Graphs: From Theory to Practice presents concepts and algorithms for finding convex, concave and polygon hulls of Euclidean graphs. It also includes some implementations, determining and comparing their complexities. Since the implementation is application-dependent, either centralized or distributed, some basic concepts of the centralized and distributed versions are reviewed. Theoreticians will find a presentation of different algorithms together with an evaluation of their complexity and their utilities, as well as their field of application. Practitioners will find some practical and real-world situations in which the presented algorithms can be used.
This book presents a collection of 33 strictly refereed full papers on combinatorics and computer science; these papers have been selected from the 54 papers accepted for presentation at the joint 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics in Computer Science, CCS '96, held in Brest, France in July 1995. The papers included in the book have been contributed by authors from 10 countries; they are organized in sections entitled graph theory, combinatorial optimization, selected topics, and parallel and distributed computing.
The authors describe the important generalization of the original Weil conjectures, as given by P. Deligne in his fundamental paper "La conjecture de Weil II". The authors follow the important and beautiful methods of Laumon and Brylinski which lead to a simplification of Deligne's theory. Deligne's work is closely related to the sheaf theoretic theory of perverse sheaves. In this framework Deligne's results on global weights and his notion of purity of complexes obtain a satisfactory and final form. Therefore the authors include the complete theory of middle perverse sheaves. In this part, the l-adic Fourier transform is introduced as a technique providing natural and simple proofs. To round things off, there are three chapters with significant applications of these theories.
Theoretical physics has become a many-faceted science. For the young stu dent it is difficult enough to cope with the overwhelming amount of new scientific material that has to be learned, let alone obtain an overview of the entire field, which ranges from mechanics through electrodynamics, quantum mechanics, field theory, nuclear and heavy-ion science, statistical mechanics, thermodynamics, and solid-state theory to elementary-particle physics. And this knowledge should be acquired in just 8-10 semesters, during which, in addition, a Diploma or Master's thesis has to be worked on or examinations prepared for. All this can be achieved only if the university teachers help to introduce the student to the new disciplines as early on as possible, in order to create interest and excitement that in turn set free essential new energy. At the Johann Wolfgang Goethe University in Frankfurt we therefore con front the student with theoretical physics immediately, in the first semester. Theoretical Mechanics I and II, Electrodynamics, and Quantum Mechanics I - An Introduction are the basic courses during the first two years. These lectures are supplemented with many mathematical explanations and much support material. After the fourth semester of studies, graduate work begins, and Quantum Mechanics II - Symmetries, Statistical Mechanics and Ther modynamics, Relativistic Quantum Mechanics, Quantum Electrodynamics, the Gauge Theory of Weak Interactions, and Quantum Chromo dynamics are obligatory.
The need for a second edition of our text on Quantum Electrodynamics has given us the opportunity to implement some corrections and amendments. We have corrected a number of misprints and minor errors and have supplied additional explanatory remarks at various places. Furthermore some new material has been included on the magnetic moment of the muon (in Example 5. 6) and on the Lamb shift (in Example 5. 8). Finally, we have added the new Example 3. 17 which explains the equivalent photon method. We thank several colleagues for helpful comments and also are grateful to Dr. R. Mattiello who has supervised the preparation of the second edition of the book. Furthermore we acknowledge the agreeable collaboration with Dr. H. J. K6lsch and his team at Springer-Verlag, Heidelberg. Frankfurt am Main, Walter Greiner July 1994 Joachim Reinhardt Preface to the First Edition Theoretical physics has become a many-faceted science. For the young student it is difficult enough to cope with the overwhelming amount of new scientific material that has to be learned, let alone obtain an overview of the entire field, which ranges from mechanics through electrodynamics, quantum mechanics, field theory, nuclear and heavy-ion science, statistical mechanics, thermodynamics, and solid state theory to elementary-particle physics. And this knowledge should be acquired in just 8-10 semesters, during which, in addition, a Diploma or Master's thesis has to be worked on or examinations prepared for.
Neural Networks presents concepts of neural-network models and techniques of parallel distributed processing in a three-step approach: - A brief overview of the neural structure of the brain and the history of neural-network modeling introduces to associative memory, preceptrons, feature-sensitive networks, learning strategies, and practical applications. - The second part covers subjects like statistical physics of spin glasses, the mean-field theory of the Hopfield model, and the "space of interactions" approach to the storage capacity of neural networks. - The final part discusses nine programs with practical demonstrations of neural-network models. The software and source code in C are on a 3 1/2" MS-DOS diskette can be run with Microsoft, Borland, Turbo-C, or compatible compilers.
These notes give an introduction to the description of hadrons, i.e., mesons and baryons, within a quark model based on a chirally invariant quantum field theory. Emphasis is put on a didactic approach intended for graduate students with some background on functional integral techniques. Starting from QCD a motivation of a specific form of the effective quark interaction is given. Functional integral bosonization leads to a theory describing successfully meson properties. It possesses solitonic solutions which are identified as baryons. Via functional integral techniques a Faddeev equation for baryons describing them as bound states of a diquark and a quark is derived. Finally, a unification of these two complementary pictures of baryons is proposed.
Some years ago a conference on l-adic cohomology in Oberwolfach was held with the aim of reaching an understanding of Deligne's proof of the Weil conjec tures. For the convenience of the speakers the present authors - who were also the organisers of that meeting - prepared short notes containing the central definitions and ideas of the proofs. The unexpected interest for these notes and the various suggestions to publish them encouraged us to work somewhat more on them and fill out the gaps. Our aim was to develop the theory in as self contained and as short a manner as possible. We intended especially to provide a complete introduction to etale and l-adic cohomology theory including the monodromy theory of Lefschetz pencils. Of course, all the central ideas are due to the people who created the theory, especially Grothendieck and Deligne. The main references are the SGA-notes [64-69]. With the kind permission of Professor J. A. Dieudonne we have included in the book that finally resulted his excellent notes on the history of the Weil conjectures, as a second introduction. Our original notes were written in German. However, we finally followed the recommendation made variously to publish the book in English. We had the good fortune that Professor W. Waterhouse and his wife Betty agreed to translate our manuscript. We want to thank them very warmly for their willing involvement in such a tedious task. We are very grateful to the staff of Springer-Verlag for their careful work.
This book introduces the area of image processing and data-parallel processing. It covers a number of standard algorithms in image processing and describes their parallel implementation. The programming language chosen for all examples is a structured parallel programming language which is ideal for educational purposes. It has a number of advantages over C, and since all image processing tasks are inherently parallel, using a parallel language for presentation actually simplifies the subject matter. This results in shorter source codes and a better understanding. Sample programs and a free compiler are available on an accompanying Web site.
This book presents a collection of 33 strictly refereed full papers on combinatorics and computer science; these papers have been selected from the 54 papers accepted for presentation at the joint 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics in Computer Science, CCS '96, held in Brest, France in July 1995. The papers included in the book have been contributed by authors from 10 countries; they are organized in sections entitled graph theory, combinatorial optimization, selected topics, and parallel and distributed computing.
This will help us customize your experience to showcase the most relevant content to your age group
Please select from below
Login
Not registered?
Sign up
Already registered?
Success – Your message will goes here
We'd love to hear from you!
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.