|
|
|
|
| LEADER |
00000cam a2200000 a 4500 |
| 001 |
ocn733047773 |
| 003 |
OCoLC |
| 005 |
20240623213015.0 |
| 006 |
m o d |
| 007 |
cr mnu---unuuu |
| 008 |
110627s2011 njua ob 001 0 eng d |
| 040 |
|
|
|a N$T
|b eng
|e pn
|c N$T
|d EBLCP
|d E7B
|d MHW
|d YDXCP
|d OSU
|d OCLCQ
|d MERUC
|d OCLCQ
|d DEBSZ
|d OCLCQ
|d OCLCF
|d OCLCQ
|d AGLDB
|d ZCU
|d OCLCQ
|d NJR
|d U3W
|d OCLCQ
|d VTS
|d ICG
|d INT
|d OCLCQ
|d STF
|d DKC
|d OCLCQ
|d M8D
|d OCLCQ
|d AJS
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|d OCLCQ
|d OCLCL
|d SXB
|
| 020 |
|
|
|a 9789814307840
|q (electronic bk.)
|
| 020 |
|
|
|a 981430784X
|q (electronic bk.)
|
| 020 |
|
|
|z 9789814307833
|q (hardcover ;
|q alk. paper)
|
| 020 |
|
|
|z 9814307831
|q (hardcover ;
|q alk. paper)
|
| 035 |
|
|
|a (OCoLC)733047773
|
| 050 |
|
4 |
|a QA166.7
|b .D88 2011eb
|
| 072 |
|
7 |
|a MAT
|x 036000
|2 bisacsh
|
| 049 |
|
|
|a HCDD
|
| 100 |
1 |
|
|a Dutour Sikirić, Mathieu.
|
| 245 |
1 |
0 |
|a Random sequential packing of cubes /
|c Mathieu Dutour Sikirić, Yoshiaki Itoh.
|
| 260 |
|
|
|a New Jersey :
|b World Scientific,
|c ©2011.
|
| 300 |
|
|
|a 1 online resource (xiii, 240 pages) :
|b illustrations
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 520 |
|
|
|a In this volume very simplified models are introduced to understand the random sequential packing models mathematically. The 1-dimensional model is sometimes called the Parking Problem, which is known by the pioneering works by Flory (1939), Renyi (1958), Dvoretzky and Robbins (1962). To obtain a 1-dimensional packing density, distribution of the minimum of gaps, etc., the classical analysis has to be studied. The packing density of the general multi-dimensional random sequential packing of cubes (hypercubes) makes a well-known unsolved problem. The experimental analysis is usually applied to ...
|
| 504 |
|
|
|a Includes bibliographical references and index.
|
| 588 |
0 |
|
|a Print version record.
|
| 505 |
0 |
|
|a Preface; Contents; 1. Introduction; 2. The Flory model; 3. Random interval packing; 4. On the minimum of gaps generated by 1-dimensional random packing; 5. Integral equation method for the 1-dimensional random packing; 6. Random sequential bisection and its associated binary tree; 7. The unified Kakutani Renyi model; 8. Parking cars with spin but no length; 9. Random sequential packing simulations; 10. Discrete cube packings in the cube; 11. Discrete cube packings in the torus; 12. Continuous random cube packings in cube and torus; Appendix A Combinatorial Enumeration; Bibliography; Index.
|
| 650 |
|
0 |
|a Combinatorial packing and covering.
|
| 650 |
|
0 |
|a Sphere packings.
|
| 650 |
|
7 |
|a MATHEMATICS
|x Combinatorics.
|2 bisacsh
|
| 650 |
|
7 |
|a Combinatorial packing and covering
|2 fast
|
| 650 |
|
7 |
|a Sphere packings
|2 fast
|
| 700 |
1 |
|
|a Itoh, Yoshiaki,
|d 1943-
|1 https://id.oclc.org/worldcat/entity/E39PCjDrJwxkmmGCkb8Pm6Mc6C
|
| 758 |
|
|
|i has work:
|a Random sequential packing of cubes (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCGPhkvxTCG9KpYYyXfDCkP
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Print version:
|a Dutour Sikirić, Mathieu.
|t Random sequential packing of cubes.
|d Singapore ; Hackensack, NJ : World Scientific, ©2011
|z 9789814307833
|w (DLC) 2010027617
|w (OCoLC)587219915
|
| 856 |
4 |
0 |
|u https://ebookcentral.proquest.com/lib/holycrosscollege-ebooks/detail.action?docID=737608
|y Click for online access
|
| 903 |
|
|
|a EBC-AC
|
| 994 |
|
|
|a 92
|b HCD
|