E-Books Free Download

Tuesday, May 11, 2010

Mathematical Problems and Puzzles from the Polish Mathematical Olympiads

Stefan Straszewicz, "Mathematical Problems and Puzzles from the Polish Mathematical Olympiads"
Pergamon Press 1965 ASIN: B0000CMPWZ 367 pages PDF 29,3 MB

This book is a translation of the second Polish edition, published in 1960, in which various improvements were made.

The contest for secondary school pupils known as the Mathematical Olympiad has been held in Poland every year since 1949/50.

The problems set at the contests require only a knowledge of school mathematics (i.e., elementary algebra, geometry and trigonometry) but are on the whole more difficult than the usual school exercises.

COMMENT:

Although long out of print and hard to find, this is MUST read for aspiring contestants in the AMC/AIME/USAME mathematics contests. If you only have time for a couple of books to review and study, this should be one of them.

Download

uploading.com

turbobit.net

megaupload.com

Monday, April 12, 2010

Finite Element Techniques for Fluid Flow: Jerome J. Connor

Finite Element Techniques for Fluid Flow: Jerome J. Connor
Transatlantic Arts ISBN: 0408001763 1977-02 PDF (OCR) 340 pages 7.3 Mb

Preface:
Until recently, finite element techniques were almost exclusively used in structural engineering problems but now there is a growing awareness of their potential in other engineering fields, especially in fluid mechanics.

This book presents these recent advances in a simple way. The authors have been mainly concerned with producing a text for teaching which can be easily followed by the self-taught student. The last part will undoubtedly also be of use to research workers. The reader will be led from the basic principles of Chapter 1, and the simple finite element concepts and models given in Chapters 2 and 3, step by step to more complex applications. A chapter (4) on the governing equations of fluid flow has been included o provide a more complete progression, though this is not intended for those already well versed in fluid dynamics. Chapter 5 is concerned with the solution of potential type problems and Chapter 6 sets out viscous flow problems in porous media: both are topics well suited to finite element solutions and of general interest to the engineer, applied mathematician and physicist.

In the remaining chapters the solutions of more specialised problems are presented. Chapter 7 describes how circulation problems can be tackled using finite elements, Chapter 8 deals with the solution of the mass transfer equation and Chapter 9 discusses ways of solving general transient incompressible flows. Since this book contains more material than could be used in a standard course, the authors have also indicated in t he contents some sections which could be omitted without affecting the general structure. Those students not interested in coastal engineering and transport type problems could in addition leave out Chapters 7 and 9. Finally, the authors wish to thank all those who made this book possible, especially their research associates Dr. R. Adey, Mr. J. Rodenhuis, Dr. S. Smith and Dr. J. Wang.

pdf@Uploading.com
pdf@Rapidshare.com
My other publications can be found here.
No password

Algorithmic Learning in a Random World: Vladimir Vovk, Alex Gammerman, Glenn Shafer

Algorithmic Learning in a Random World: Vladimir Vovk, Alex Gammerman, Glenn Shafer
Springer ISBN: 0387001522 2005-03-22 PDF (OCR) 324 pages 57.2 Mb

Algorithmic Learning in a Random World describes recent theoretical and experimental developments in building computable approximations to Kolmogorov's algorithmic notion of randomness. Based on these approximations, a new set of machine learning algorithms have been developed that can be used to make predictions and to estimate their confidence and credibility in high-dimensional spaces under the usual assumption that the data are independent and identically distributed (assumption of randomness). Another aim of this unique monograph is to outline some limits of predictions: The approach based on algorithmic theory of randomness allows for the proof of impossibility of prediction in certain situations. The book describes how several important machine learning problems, such as density estimation in high-dimensional spaces, cannot be solved if the only assumption is randomness.

pdf@Uploading.com
pdf@Rapidshare.com
My other publications can be found here.
No password

Adaptive Learning of Polynomial Networks: Genetic Programming, Backpropagation and Bayesian Methods P

This book delivers theoretical and practical knowledge for developing algorithms that infer linear and non-linear multivariate models, providing a methodology for inductive learning of polynomial neural network models (PNN) from data. The text emphasizes an organized model identification process by which to discover models that generalize and predict well. The empirical investigations detailed here demonstrate that PNN models evolved by genetic programming and improved by backpropagation are successful when solving real-world tasks.
Adaptive Learning of Polynomial Networks is a vital reference for researchers and practitioners in the fields of evolutionary computation, artificial neural networks and Bayesian inference, and for advanced-level students of genetic programming. Readers will strengthen their skills in creating efficient model representations and learning operators that efficiently sample the search space, and in navigating the search process through the design of objective fitness functions.

pdf@Uploading.com
pdf@Rapidshare.com
My other publications can be found here.
No password

Pattern Recognition and Image Analysis: 4th Iberian Conference, IbPRIA 2009 Proceedings

Hélder J. Araújo, Ana Maria Mendonça, Armando J. Pinho, María Inés Torres Barańano, "Pattern Recognition and Image Analysis: 4th Iberian Conference, IbPRIA 2009 Póvoa de Varzim, Portugal, June 10-12, 2009 Proceedings (Lecture Notes in Computer Science)"
Springer; 1 edition (June 30, 2009) | English | 3642021719 | 514 pages | PDF | 14.81 MB

This volume constitutes the refereed proceedings of the 4th Iberian Conference on Pattern Recognition and Image Analysis, IbPRIA 2009, held in Póvoa de Varzim, Portugal in June 2009.
The 33 revised full papers and 29 revised poster papers presented together with 3 invited talks were carefully reviewed and selected from 106 submissions. The papers are organized in topical sections on computer vision, image analysis and processing, as well as pattern recognition.

Links

http://depositfiles.com/files/zrazfmooc/i364s202b171n9.rar

or

http://filefactory.com/file/a17f59h/n/3642021719.rar

_ No Mirrors _

Average-Case Complexity

Andrej Bogdanov, Luca Trevisan, «Average-Case Complexity»
Now Publishers | ISBN: 1933019492 | 2006 | PDF | 124 pages | 11.92 MB

Average-Case Complexity is a thorough survey of the average-case complexity of problems in NP. The study of the average-case complexity of intractable problems began in the 1970s, motivated by two distinct applications: the developments of the foundations of cryptography and the search for methods to "cope" with the intractability of NP-hard problems. This survey looks at both, and generally examines the current state of knowledge on average-case complexity. Average-Case Complexity is intended for scholars and graduate students in the field of theoretical computer science. The reader will also discover a number of results, insights, and proof techniques whose usefulness goes beyond the study of average-case complexity.

>>> Download <<<

>>> Mirror <<<

Beginning Cryptography with Java (repost)

While cryptography can still be a controversial topic in the programming community, Java has weathered that storm and provides a rich set of APIs that allow you, the developer, to effectively include cryptography in applications-if you know how.

This book teaches you how. Chapters one through five cover the architecture of the JCE and JCA, symmetric and asymmetric key encryption in Java, message authentication codes, and how to create Java implementations with the API provided by the Bouncy Castle ASN.1 packages, all with plenty of examples. Building on that foundation, the second half of the book takes you into higher-level topics, enabling you to create and implement secure Java applications and make use of standard protocols such as CMS, SSL, and S/MIME.

What you will learn from this book

* How to understand and use JCE, JCA, and the JSSE for encryption and authentication
* The ways in which padding mechanisms work in ciphers and how to spot and fix typical errors
* An understanding of how authentication mechanisms are implemented in Java and why they are used
* Methods for describing cryptographic objects with ASN.1
* How to create certificate revocation lists and use the Online Certificate Status Protocol (OCSP)
* Real-world Web solutions using Bouncy Castle APIs

Who this book is for

This book is for Java developers who want to use cryptography in their applications or to understand how cryptography is being used in Java applications. Knowledge of the Java language is necessary, but you need not be familiar with any of the APIs discussed.

Wrox Beginning guides are crafted to make learning programming languages and technologies easier than you think, providing a structured, tutorial format that will guide you through all the techniques involved.

Download

Megaupload

Uploading

Pattern Matching Algorithms

Alberto Apostolico, Zvi Galil, «Pattern Matching Algorithms»
Oxford University Press | ISBN: 0195113675 | 1997 | PDF | 400 pages | 19.65 MB

This book provides an overview of the current state of pattern matching as seen by specialists who have devoted years of study to the field. It covers most of the basic principles and presents material advanced enough to faithfully portray the current frontier of research.

>>> Download <<<

>>> Mirror <<<