| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910450057603321 |
|
|
Autore |
Mandelkern Leo |
|
|
Titolo |
Crystallization of polymers . Volume 1 Equilibrium concepts / / Leo Mandelkern [[electronic resource]] |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cambridge : , : Cambridge University Press, , 2002 |
|
|
|
|
|
|
|
ISBN |
|
1-107-13462-5 |
0-521-02013-1 |
1-280-42012-X |
9786610420124 |
1-139-14842-7 |
0-511-17829-8 |
0-511-05473-4 |
0-511-30552-4 |
0-511-54131-7 |
0-511-06952-9 |
|
|
|
|
|
|
|
|
Edizione |
[Second edition.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (xiii, 433 pages) : digital, PDF file(s) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Polymers |
Crystallization |
Crystalline polymers |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and indexes. |
|
|
|
|
|
|
Nota di contenuto |
|
Cover; Half-title; Title; Copyright; Dedication; Contents; Preface to second edition; Preface to first edition; 1 Introduction; 2 Fusion of homopolymers; 3 Polymer-diluent mixtures; 4 Polymer-polymer mixtures; 5 Fusion of copolymers; 6 Thermodynamic quantities; 7 Fusion of cross-linked polymers; 8 Oriented crystallization and contractility; Author index; Subject index |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
First published in 2002, from an original 1964 edition, in the Crystallization of Polymers, 2nd edition Leo Mandelkern provides a self-contained treatment of polymer crystallization. All classes of macromolecules are included and the approach is through the basic disciplines of chemistry and physics. The book discusses the |
|
|
|
|
|
|
|
|
|
|
|
|
|
thermodynamics and physical properties that accompany the morphological and structural changes that occur when a collection of molecules of very high molecular weight are transformed from one state to another. Volume 1 is a presentation of the equilibrium concepts that serve as a basis for the subsequent volumes. In this volume the author shows that knowledge of the equilibrium requirements is vital to understanding all aspects of the polymer crystallization process, and the final state that eventually evolves. This book will be an invaluable reference work for all chemists, physicists and materials scientists who work in the area of polymer crystallization. |
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910143626903321 |
|
|
Titolo |
Computing and Combinatorics : 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 Proceedings / / edited by Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2000.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 478 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 1858 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer programming |
Computers |
Application software |
Algorithms |
Computer science—Mathematics |
Computer graphics |
Programming Techniques |
Theory of Computation |
Computer Applications |
Algorithm Analysis and Problem Complexity |
Discrete Mathematics in Computer Science |
Computer Graphics |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
|
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references at the end of each chapters and index. |
|
|
|
|
|
|
|
|
Nota di contenuto |
|
Invited Talks -- Theoretical Problems Related to the Internet -- Recent Progress and Prospects for Integer Factorisation Algorithms -- Hao Wang Award Paper -- Approximating Uniform Triangular Meshes in Polygons -- The Best Young Researcher Paper -- Maximum Induced Matchings of Random Cubic Graphs -- Computational Geometry 1 -- A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems -- On Local Transformation of Polygons with Visibility Properties -- Graph Drawing -- Embedding Problems for Paths with Direction Constrained Edges -- Characterization of Level Non-planar Graphs by Minimal Patterns -- Rectangular Drawings of Plane Graphs Without Designated Corners -- Computing Optimal Embeddings for Planar Graphs -- Graph Theory and Algorithms 1 -- Approximation Algorithms for Independent Sets in Map Graphs -- Hierarchical Topological Inference on Planar Disc Maps -- Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs -- Complexity, Discrete Mathematics, and Number Theory -- Parameterized Complexity of Finding Subgraphs with Hereditary Properties -- Some Results on Tries with Adaptive Branching -- Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound -- Closure Properties of Real Number Classes under Limits and Computable Operators -- Graph Theory and Algorithms 2 -- A Characterization of Graphs with Vertex Cover Six -- On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree -- Online Algorithms -- Online Independent Sets -- Two-Dimensional On-Line Bin Packing Problem with Rotatable Items -- Better Bounds on the Accommodating Ratio for the Seat Reservation Problem -- Ordinal On-Line Scheduling on Two Uniform Machines -- Parallel and Distributed Computing -- Agents, Distributed Algorithms, and Stabilization -- A Fast Sorting Algorithm and Its Generalization on Broadcast Communications -- Efficient List Ranking Algorithms on Reconfigurable Mesh -- Computational Geometry 2 -- Tripods Do Not Pack Densely -- An Efficient k Nearest Neighbor Searching Algorithm for a Query Line -- Tetrahedralization of Two Nested Convex Polyhedra -- Efficient Algorithms for Two-Center Problems for a Convex Polygon -- Combinatorial Optimization -- On Computation of Arbitrage for Markets with Friction -- On Some Optimization Problems in Obnoxious Facility Location -- Generating Necklaces and Strings with Forbidden Substrings -- Optimal Labelling of Point Features in the Slider Model -- Data Structures and Computational Biology -- Mappings for Conflict-Free Access of Paths in Elementary Data Structures -- Theory of Trinomial Heaps -- Polyhedral Aspects of the Consecutive Ones Problem -- The Complexity of Physical Mapping with Strict Chimerism -- Learning and Cryptography -- Logical Analysis of Data with Decomposable Structures -- Learning from Approximate Data -- A Combinatorial Approach to Asymmetric Traitor Tracing -- Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs -- Automata and Quantum Computing -- One-Way Probabilistic Reversible and Quantum One-Counter Automata -- Similarity Enrichment in Image Compression through Weighted Finite Automata -- On the Power of Input-Synchronized Alternating Finite Automata -- Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 6th Annual |
|
|
|
|
|
|
|
|
|
|
International Conference on Computing and Combinatorics, COCOON 2000, held in Sydney, Australia in July 2000.The 44 revised full papers presented together with two invited contributions were carefully reviewed and selected from a total of 81 submissions. The book offers topical sections on computational geometry; graph drawing; graph theory and algorithms; complexity, discrete mathematics, and number theory; online algorithms; parallel and distributed computing; combinatorial optimization; data structures and computational biology; learning and cryptography; and automata and quantum computing. |
|
|
|
|
|
| |