تعاملات مولکولی برخی از پورفیرین‌های آزاد با مولکول‌های پذیرنده σ و π

InTech, 2012. - 380 p. - In a classical approach materials science is mainly dealing with interatomic interactions within molecules, without paying much interest on weak intermolecular interactions. However, the variety of structures actually is the result of weak ordering because of noncovalent interactions. Indeed, for self-assembly to be possible in soft materials, it is evident that forces between molecules must be much weaker than covalent bonds between the atoms of a molecule. The weak intermolecular interactions responsible for molecular ordering in soft materials include hydrogen bonds, coordination bonds in ligands and complexes, ionic and dipolar interactions, van der Waals forces, and hydrophobic interactions. Recent evolutions in nanosciences and nanotechnologies provide strong arguments to support the opportunity and importance of the topics approached in this book, the fundamental and applicative aspects related to molecular interactions being of large interest in both research and innovative environments. We expect this book to have a strong impact at various education and research training levels, for young and experienced researchers from both academia and industry.

The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.

—Byte, September 1995

I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up.

—Charles Long

If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing.

—Bill Gates

It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers.

—Jonathan Laventhol

The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing.

The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. –Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up. –Charles Long If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. –Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. –Jonathan Laventhol The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP),http://msp.org Computational geometry emerged from the ?eld of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the ?eld as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains--computer graphics, geographic information systems (GIS), robotics, and others--in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or dif?cult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simpli?ed many of the previous approaches. In this textbook we have tried to make these modern algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can also be used for self-study "Particle models play an important role in many applications in physics, chemistry and biology. They can be studied on the computer with the help of molecular dynamics simulations. This book presents in detail both the necessary numerical methods and techniques (linked-cell method, SPME-method, tree codes, multipole technique) and the theoretical background and foundations. It illustrates the aspects modelling, discretization, algorithms and their parallel implementation with MPI on computer systems with distributed memory. Furthermore, detailed explanations are given to the different steps of numerical simulation, and code examples are provided. With the description of the algorithms and the presentation of the results of various simulations from the areas material science, nanotechnology, biochemistry and astrophysics, the reader of this book will be able to write his own programs for molecular dynamics step by step and to run successful experiments."--Jacket Modeling and simulation play an ever increasing role in the development and optimization of materials. Computational Materials Science presents the most important approaches in this new interdisciplinary field of materials science and engineering. The reader will learn to assess which numerical method is appropriate for performing simulations at the various microstructural levels and how they can be coupled. This book addresses graduate students and professionals in materials science and engineering as well as materials & ndash;oriented physicists and mechanical engineers The first revision of this third volume is the most comprehensive survey of computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and a new discussion of the theory of permutations and of universal hashing.

This introduction to computational geometry focuses on algorithms. Motivation is provided from the application areas as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement.

This first volume begins with basic programming concepts and techniques, then focuses on information structures--the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design Computational Geometry: Introduction Line Segment Intersection Polygon Triangulation Linear Programming Orthogonal Range Searching Point Location Voronoi Diagrams Arrangements and Duality Delaunay Triangulations More Geometric Data Structures Convex Hulls Binary Space Partitions Robot Motion Planning Quadtrees Visibility Graphs Simplex Range Searching Modelling and simulation play an ever increasing role in the development and optimization of materials. This text should enable the reader to assess which numerical method is appropriate for performing simulations at the various microstructural levels and how they can be coupled. Donald Knuth is Professor Emeritus of the Art of Computer Programming at Stanford University, and is well-known worldwide as the creator of the Tex typesetting language. Here he presents the third volume of his guide to computer programming v. 1. Fundamental algorithms v. 2. Seminumerical algorithms v. 3. Sorting and searching v. 4, fascicule 3. Generating all combinations and partitions. The principles of diffusion controlled phase transformations have been known for a long time.