Throughout this paper, we use the following notations: we denote by Z (resp. N) the set of integers (resp. positive integers) and we write l 1 =log N, l 2 =log log N, l 3 =log log log N and e(:)=e 2i?: . If f(n)=O(g(n)), then we write f (n)< <g(n). We denote by |(n) the number of distinct prime fact
Characterizing sets of data structures by the connectivity relation
β Scribed by A. L. Furtado
- Publisher
- Springer
- Year
- 1976
- Tongue
- English
- Weight
- 903 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1573-7640
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract The application of the element densityβbased topology optimization method to nonlinear continuum structures is limited to relatively simple problems such as bilinear elastoplastic material problems. Furthermore, it is very difficult to use analytic sensitivity when a commercial nonlinea
Geometry-dependent connectivity indices are proposed based on the Euclidian connectivity distances between the nuclei for characterizing the molecular structures. It is shown that these indices are directly related to the compactness of molecules in the three-dimensional space and thus these indices