Multiplicity of Generation, Selection, and Classification Procedures for Jammed

نویسنده

  • F. H. Stillinger
چکیده

Hard-particle packings have served as useful starting points to study the structure of diverse systems such as liquids, living cells, granular media, glasses, and amorphous solids. Howard Reiss has played a major role in helping to illuminate our understanding of hard-particle systems, which still offer scientists many interesting conundrums. Jammed configurations of hard particles are of great fundamental and practical interest. What one precisely means by a “jammed” configuration is quite subtle and considerable ambiguity remains in the literature on this question. We will show that there is a multiplicity of generation, selection, and classification procedures for jammed configurations of identical d-dimensional spheres. We categorize common ordered lattices according to our definitions and discuss implications for random disk and sphere packings. We also show how the concept of rigidity percolation (which has been used to understand the mechanical properties of network glasses) can be generalized to further characterize hard-sphere packings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2 00 1 Multiplicity of Generation , Selection , and Classification Procedures for Jammed Hard - Particle Packings

Hard-particle packings have served as useful starting points to study the structure of diverse systems such as liquids, living cells, granular media, glasses, and amorphous solids. Howard Reiss has played a major role in helping to illuminate our understanding of hardparticle systems, which still offer scientists many interesting conundrums. Jammed configurations of hard particles are of great ...

متن کامل

Optimal Feature Selection for Data Classification and Clustering: Techniques and Guidelines

In this paper, principles and existing feature selection methods for classifying and clustering data be introduced. To that end, categorizing frameworks for finding selected subsets, namely, search-based and non-search based procedures as well as evaluation criteria and data mining tasks are discussed. In the following, a platform is developed as an intermediate step toward developing an intell...

متن کامل

Optimal Feature Selection for Data Classification and Clustering: Techniques and Guidelines

In this paper, principles and existing feature selection methods for classifying and clustering data be introduced. To that end, categorizing frameworks for finding selected subsets, namely, search-based and non-search based procedures as well as evaluation criteria and data mining tasks are discussed. In the following, a platform is developed as an intermediate step toward developing an intell...

متن کامل

Classification and Biomarker Genes Selection for Cancer Gene Expression Data Using Random Forest

Background & objective: Microarray and next generation sequencing (NGS) data are the important sources to find helpful molecular patterns. Also, the great number of gene expression data increases the challenge of how to identify the biomarkers associated with cancer. The random forest (RF) is used to effectively analyze the problems of large-p and smal...

متن کامل

SFLA Based Gene Selection Approach for Improving Cancer Classification Accuracy

 In this paper, we propose a new gene selection algorithm based on Shuffled Frog Leaping Algorithm that is called SFLA-FS. The proposed algorithm is used for improving cancer classification accuracy. Most of the biological datasets such as cancer datasets have a large number of genes and few samples. However, most of these genes are not usable in some tasks for example in cancer classification....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001