AIMS To determine the utility of vacuum-packed polythene bags as a convenient, flexible and cost-effective alternative to fixed volume glass vessels for lab-scale silage studies. METHODS AND RESULTS Using perennial ryegrass or red clover forage, similar fermentations (as assessed by pH measurement) occurred in glass tube and vacuum-packed silos over a 35-day period. As vacuum-packing devices ...

Historical Overview of the Kepler Conjecture This paper is the first in a series of six papers devoted to the proof of the Kepler conjecture, which asserts that no packing of congruent balls in three dimensions has density greater than the face-centered cubic packing. After some preliminary comments about the face-centered cubic and hexagonal close packings, the history of the Kepler problem is...

Particle shape plays a crucial role in determining packing characteristics. Real particles in nature usually have rounded corners. In this work, we systematically investigate the rounded corner effect on the dense packings of spherotetrahedral particles. The evolution of dense packing structure as the particle shape continuously deforms from a regular tetrahedron to a sphere is investigated, st...

Evaluating the quality of experimentally determined protein structural models is an essential step toward identifying potential errors and guiding further structural refinement. Herein, we report the use of proton local density as a sensitive measure to assess the quality of nuclear magnetic resonance (NMR) structures. Using 256 high-resolution crystal structures with protons added and optimize...

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.

ACKING-DENSITY variations in a powder compact often P result in nonuniform shrinkages andor cracking during subsequent drying and sintering. In case of dry-pressed compacts, the effect of consolidation conditions on density variations has been sufficiently detailed by theoretical models.' However, although recent trends have favored the use of colloidal consolidation methods in order to attain ...

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.