A typical source of mistakes that frequently lead to a wrong or incomplete solution for the antiderivative of a given real function of one real variable is a misuse of the technique of change of variable. The increasing implementation of software in apparently mechanic tasks such as the calculation of antiderivatives has not improved the situation, yet those software packages issue generic warnings such as 'the answer's is not guaranteed to be continuous' or 'the solution might be only valid for parts of the function'. The practical meaning of those vague machine messages is clearly envisaged in this book, which shows how to handle the technique of change of variable in order to provide correct solutions.This book is monographically focused on elementary antidifferentiation and reasonably self-contained, yet it is written in a 'hand-book' style: it has plenty of examples and graphics in an increasing level of difficulty; the most standard changes of variable are studied and the hardest theoretic parts are included in a final Appendix. Each practical chapter has a list of exercises and solutions.This book is intended for instructors and university students of Mathematics of first and second year.

This book is intended as a fairly complete presentation of what··'We call the discretization approach to functional integrals, i.e. path integrals defined as limits of discretized axpressions. In its main parts it is based 0n the original work of the authors. We hope to have provided the readers with a rather complete and up-to-date bibliography, and we apologize to authors whose work has not been cited through ignorance ori our part. Our main concern has been to present a for malism that is practical and which can be adapted to make computations in the numerous areas where path integrals are being increasingly used. For these reasons applications, illustrative examples, and detailed calculations are included. The book is partially based on lectures given by one of us (E.T.) at the Institut de Physique Theorique of the u.c.L. (Louvain-la-Neuve). We thank Dr. M.E. Brachet (University of Paris) for his help in the redaction of chapter 8. We are indebted to many of our colleagues and especially to the members of the Instituut voor Theoretische Fysica, K.U. Leuven for their interest and encouragement. We also thank Professor Claudio Anguita, Dean of the Faculty of Physics and Mathematics of .the University of Chile, for his constant support. Special thanks are due to Christine Detroije and Lutgarde Dubois for their very fine and hard work in typing the manuscript.

Includes section "Recent publications."

Offering a universally taught course: this complete exposition of a single varibale calculus elucidates transcendental functions, the notion of a sequence and its limit and the introduction of a limit of a function.

Basic Analysis I: Functions of a Real Variable is designed for students who have completed the usual calculus and ordinary differential equation sequence and a basic course in linear algebra. This is a critical course in the use of abstraction, but is just first volume in a sequence of courses which prepare students to become practicing scientists. This book is written with the aim of balancing the theory and abstraction with clear explanations and arguments, so that students who are from a variety of different areas can follow this text and use it profitably for self-study. It can also be used as a supplementary text for anyone whose work requires that they begin to assimilate more abstract mathematical concepts as part of their professional growth. Features Can be used as a traditional textbook as well as for self-study Suitable for undergraduate mathematics students, or for those in other disciplines requiring a solid grounding in abstraction Emphasises learning how to understand the consequences of assumptions using a variety of tools to provide the proofs of propositions

This book constitutes the refereed proceedings of the First International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2004, held in Nice, France in April 2004. The 23 revised full papers and 7 revised short papers presented together with an invited talk were carefully reviewed and selected from 56 submissions. Methodological and foundational issues from AI, OR, and algorithmics are presented as well as applications to the solution of combinatorial optimization problems in various fields via constraint programming.