Three partial radial distribution functions [RDF's] are calculated by means of relaxed dense-random packing models for a Fe80B20 glass. The model structures reproduce fairly well recently reported experimental partial RDF's derived from x-ray diffraction and neutron diffraction using isotopic substitutional methods. Most significantly, both the model calculated by means of relaxed dense-random ...

–Random coding, expurgated and sphere packing bounds are derived by method of types and method of graph decomposition for E-capacity of discrete memoryless channel (DMC). Three decoding rules are considered, the random coding bound is attainable by each of the three rules, but the expurgated bound is achievable only by maximum-likelihood decoding. Sphere packing bound is obtained by very simple...

We introduce and simulate a two-dimensional Edwards-style model of granular matter at vanishing pressure. The model incorporates some of the effects of gravity and friction, and exhibits a random loose packing density whose standard deviation vanishes with increasing system size, a phenomenon that should be verifiable for real granular matter.

The diffusion and flow of amorphous materials, such as glasses and granular materials, has resisted a simple microscopic description, analogous to defect theories for crystals. Early models were based on either gas-like inelastic collisions or crystal-like vacancy diffusion, but here we propose a cooperative mechanism for dense random-packing dynamics, based on diffusing ‘‘spots’’ of interstiti...

The effect of foaming on the performance of 16 mm Pall rings was determined in a 0.15 m distillation column with a ‘bed depth of 1.23 m. The tests were conducted with the methanol/water system at 1.0 bar pressure. A controllable foaming inside the packed bed was generated successfully with the addition of the surfactant, Triton X-100, to the reflux stream. The performance of the packing with an...

The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of data. We prove new results for both the RPTREE-MAX and the RPTREE-MEAN data structures. Our result for RPTREE-MAX gives a nearoptimal bound on the number of levels required by this data structure to reduce the size of it...

The most dense random packings of binary assemblies of hard disks in the plane are considered for the case of disks with a small diRerence in their radii. An expression for the dependence of the packing density on the relative diRerence in disk sizes, disk concentration, and mean value of the gaps is derived. The computer simulation of the random dense packing is carried out using various algor...

We introduce a 2-dimensional lattice model of granular matter. We use a combination of proof and simulation to demonstrate an order/disorder phase transition in the model, to which we associate the granular phenomenon of random close packing.

We link the thermodynamics of colloidal suspensions to the statistics of regular and random packings. Random close packing has defied a rigorous definition yet, in three dimensions, there is near universal agreement on the volume fraction at which it occurs. We conjecture that the common value of phi{rcp} approximately 0.64 arises from a divergence in the rate at which accessible states disappe...

We introduce a new procedure for generating the binomial random graph/hypergraph models, referred to as online sprinkling. As an illustrative application of this method, we show that for any fixed integer k ≥ 3, the binomial k-uniform random hypergraph H n,p contains N := (1 − o(1)) ( n−1 k−1 ) p edge-disjoint perfect matchings, provided p ≥ log C n nk−1 , where C := C(k) is an integer dependin...