首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 453 毫秒
1.
1 IntroductionTherehasbeenconsiderableinterestinfractals,bothintheiroccurrenceinthesciences,andintheirmathematicaltheory .Awideclassoffractalsetsaregeneratedbyiteratedfunc tionsystem .Aself similarsetinRdisacompactsetKfulfillingtheinvarianceK =∪Ni=1 SiK ,whereS1,S2 ,… ,SNarecontractivesimilarities.IfS1,S2 ,… ,SNarecontractiveconfor malmappings,weobtainself conformalset.Itiswell known(seeHutchinson [1 2 ] )that,givenafamilyofsuchmappings,thereisauniquecompactsetwiththisproperty .Ifth…  相似文献   

2.
We provide a sufficient Dini-type condition for a subset of a complete, quasiconvex metric space to be covered by a Hölder curve. This implies in particular that if the upper box-counting dimension is less than $$d \ge 1$$, then it can be covered by an $$\frac{1}{d}$$-Hölder curve. On the other hand, for each $$1\le d <2$$ we give an example of a compact set in the plane with lower box-counting dimension equal to zero and upper box-counting dimension equal to d, just failing the above Dini-type condition, that can not be covered by a countable collection of $$\frac{1}{d}$$-Hölder curves.  相似文献   

3.
傅小兰 《数学杂志》2001,21(3):304-306
本文讨论了以严格递减的正数列{rn}为半径的同心圆靶E和将E的间隔按从大到小的顺序重排后得到新的同心圆靶F的计盒维数的关系,证明了E的计盒维数不小于F的计盒维数,且举例说明了不等式可严格成立。  相似文献   

4.
A set is called regular if its Hausdorff dimension and upper box-counting dimension coincide. In this paper, we prove that the random self-con formal set is regular almost surely. Also we determine the dimen-sions for a class of random self-con formal sets.  相似文献   

5.
The graphs of coordinate functions of space-filling curves such as those described by Peano, Hilbert, Pólya and others, are typical examples of self-affine sets, and their Hausdorff dimensions have been the subject of several articles in the mathematical literature. In the first half of this paper, we describe how the study of dimensions of self-affine sets was motivated, at least in part, by these coordinate functions and their natural generalizations, and review the relevant literature. In the second part, we present new results on the coordinate functions of Pólya's one-parameter family of space-filling curves. We give a lower bound for the Hausdorff dimension of their graphs which is fairly close to the box-counting dimension. Our techniques are largely probabilistic. The fact that the exact dimension remains elusive seems to indicate the need for further work in the area of self-affine sets.  相似文献   

6.
In [10], the notion of homogeneous perfect sets as a generalization of Cantor type sets is introduced and their Hausdorff and lower box-counting dimensions are studied. In this paper, we determine their exact packing and upper box-counting dimensions based on the length of their fundamental intervals and the gaps between them. Some known results concerning the dimensions of Cantor type sets are generalized. This work was supported by NSFC (10571138).  相似文献   

7.
黄精华 《应用数学》2004,17(4):583-587
给定Rd 中的Moran集类 ,本文证明了对介于该集类中元素的上盒维数的最大值和最小值之间的任何一个数值s,总存在该集类中的一个元素 ,其上盒维数等于s,对下盒维数、修正的下盒维数也有类似的性质成立 ,从而给文 [1 ]中的猜想 1一个肯定的回答 .此外 ,还讨论了齐次Cantor集和偏次Cantor集盒维数存在性之间的关系 .  相似文献   

8.
A method to construct fractal surfaces by recurrent fractal curves is provided. First we construct fractal interpolation curves using a recurrent iterated functions system (RIFS) with function scaling factors and estimate their box-counting dimension. Then we present a method of construction of wider class of fractal surfaces by fractal curves and Lipschitz functions and calculate the box-counting dimension of the constructed surfaces. Finally, we combine both methods to have more flexible constructions of fractal surfaces.  相似文献   

9.
In this work, we propose a particular discretization of the size of the grids in order to compute numerically, by the box-counting algorithm, the fractal dimension of a subset in two-dimensional space. The efficiency of the associated method is successfully tested on various examples of fractal sets which are derived from discret dynamical systems. To cite this article: N. Akroune, C. R. Acad. Sci. Paris, Ser. I 338 (2004).  相似文献   

10.
This work proposes a novel technique for the numerical calculus of the fractal dimension of fractal objects which can be represented as a closed contour. The proposed method maps the fractal contour onto a complex signal and calculates its fractal dimension using the Fourier transform. The Fourier power spectrum is obtained and an exponential relation is verified between the power and the frequency. From the parameter (exponent) of the relation, is obtained the fractal dimension. The method is compared to other classical fractal dimension estimation methods in the literature, e.g., Bouligand–Minkowski, box-counting and classical Fourier. The comparison is achieved by the calculus of the fractal dimension of fractal contours whose dimensions are well-known analytically. The results showed the high precision and robustness of the proposed technique.  相似文献   

11.
Recently, Maddock (2006) [12] has conjectured that the Hausdorff dimension of each level set of Takagi’s function is at most 1/2. We prove this conjecture using the self-affinity of the function of Takagi and the existing relationship between the Hausdorff and box-counting dimensions.  相似文献   

12.
Fractals are objects which have similar appearances when viewed at different scales. Such objects have details at arbitrarily small scales, making them too complex to be represented by Euclidian space; hence, they are assigned a non-integer dimension. Some natural phenomena have been modeled as fractals with success; examples include geologic deposits, topographic surfaces and seismic activities. In particular, time series have been represented as a curve with fractal dimensions between one and two. There are different ways to define fractal dimension, most being equivalent in the continuous domain. However, when applied in practice to discrete data sets, different ways lead to different results. In this study, three methods for estimating fractal dimension are described and two standard algorithms, Hurst’s rescaled range analysis and box-counting method (BC), are compared with the recently introduced variation method (VM). It was confirmed that the last method offers a superior efficiency and accuracy, and hence may be recommended for fractal dimension calculations for time series data. All methods were applied to the measured temporal variation of velocity components in turbulent flows in an open channel in Shiraz University laboratory. The analyses were applied to 2500 measurements at different Reynold’s numbers and it was concluded that a certain degree of randomness may be associated with the velocity in all directions which is a unique character of the flow independent of the Reynold’s number. Results also suggest that the rigid lateral confinement of flow to the fixed channel width allows for designation of a more-or-less constant fractal dimension for the spanwise velocity component. On the contrary, in vertical and streamwise directions more freedom of movements for fluid particles sets more room for variation in fractal dimension at different Reynold’s numbers.  相似文献   

13.
Three-dimensional fractures of different fractal dimensions have been constructed with successive random addition algorithm, the applicability of various dimension determination methods at nanometer scale has been studied. As to the metallic fractures, owing to the limited number of slit islands in a slit plane or limited datum number at nanometer scale, it is difficult to use the area-perimeter method or power spectrum method to determine the fractal dimension. Simulation indicates that box-counting method can be used to determine the fractal dimension at nanometer scale. The dimensions of fractures of valve steel 5Cr21Mn9Ni4N have been determined with STM. Results confirmed that fractal dimension varies with direction at nanometer scale. Our study revealed that, as to theoretical profiles, the dependence of frsctal dimension with direction is simply owing to the limited data set number, i.e. the effect of boundaries. However, the dependence of fractal dimension with direction at nanometer scale in real metallic fractures is correlated to the intrinsic characteristics of the materials in addition to the effect of boundaries. The relationship of fractal dimensions with the mechanical properties of materials at macrometer scale also exists at nanometer scale. Project supported by the National Natural Science Foundation of China (Grant Nos. 59771050 and 59872004) and the Foundation Fund of Ministry of Metallurgical Industry.  相似文献   

14.
Projections of random Cantor sets   总被引:1,自引:0,他引:1  
Recently Dekking and Grimmett have used the theories of branching processes in a random environment and of superbranching processes to find the almostsure box-counting dimension of certain orthogonal projections of random Cantor sets. This note gives a rather shorter and more direct calculation, and also shows that the Hausdorff dimension is almost surely equal to the box-counting dimension. We restrict attention to one-dimensional projections of a plane set—there is no difficulty in extending the proof to higher-dimensional cases.  相似文献   

15.
A theoretical method for the estimation of the fractal dimensions of the pore surfaces of zeolites is proposed. The method is an analogy to the commonly employed box-counting method and uses imaginary meshes of various sizes (s) to trace the pore surfaces determined by the frameworks of crystalline zeolites. The surfaces formed by the geometrical shapes of the secondary building units of zeolites are taken into account for the calculations performed. The characteristics of the framework structures of the zeolites 13X, 5A and silicalite are determined by the help of the solid models of these zeolites and the total numbers of grid boxes intersecting the surfaces are estimated by using equations proposed in this study. As a result, the fractal dimension values of the zeolites 13X, 5A and silicalite are generally observed to vary in significant amounts with the range of mesh size used, especially for the relatively larger mesh sizes that are close to the sizes of real adsorbates. For these relatively larger mesh sizes, the fractal dimension of silicalite falls below 1.60 while the fractal dimension values of zeolite 13X and 5A tend to rise above 2. The fractal dimension values obtained by the proposed method seem to be consistent with those determined by using experimental adsorption data in their relative magnitudes while the absolute magnitudes may differ due to the different size ranges employed. The results of this study show that fractal dimension values much different from 2 (both higher and lower than 2) may be obtained for crystalline adsorbents, such as zeolites, in ranges of size that are close to those of real adsorbates.  相似文献   

16.
低复杂度序列的维数   总被引:1,自引:1,他引:0  
彭丽 《数学杂志》2006,26(2):133-136
本文研究符号空间中由零拓扑熵序列组成的集合.通过构造适当的自相似集,证明了该集合的盒维数为1,而Hausdorff维数为0.  相似文献   

17.
We generalize theorems of Peres and Solomyak about the abso- lute continuity resp. singularity of Bernoulli convolutions ([19], [16], [17]) to a broader class of self-similar measures on the real line. Using the dimension the- ory of ergodic measures (see [11] and [2]) we find a formula for the dimension of certain self-affine measures in terms of the dimension of the above mentioned self- similar measures. Combining these results we show the identity of Hausdorff and box-counting dimension of a special class of self-affine sets.  相似文献   

18.
A very important property of a deterministic self-similar set is that its Hausdorff dimension and upper box-counting dimension coincide. This paper considers the random case. We show that for a random self-similar set, its Hausdorff dimension and upper box-counting dimension are equal

  相似文献   


19.
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost all the problems of density <0.9408... in the asymptotical sense. On the other hand, the subset sum problem itself is known as an NP-hard problem, and a lot of efforts have been paid to establish public-key cryptosystems based on the problem. In these cryptosystems, densities of the subset sum problems should be higher than 0.9408... in order to avoid the low-density attack. For example, the Chor-Rivest cryptosystem adopted subset sum problems with relatively high densities. In this paper, we further improve the low-density attack by incorporating an idea that integral lattice points can be covered with polynomially many spheres of shorter radius and of lower dimension. As a result, the success probability of our attack can be higher than that of Coster et al.’s attack for fixed dimensions. The density bound is also improved for fixed dimensions. Moreover, we numerically show that our improved low-density attack makes the success probability higher in case of low Hamming weight solution, such as the Chor-Rivest cryptosystem, if we assume SVP oracle calls.   相似文献   

20.
Construction and Dimension Analysis for a Class of Fractal Functions   总被引:3,自引:0,他引:3  
In this paper, we construct a class of nowhere differentiable continuous functions by means of the Cantor series expression of real numbers. The constructed functions include some known nondifferentiable functions, such as Bush type functions. These functions are fractal functions since their graphs are in general fractal sets. Under certain conditions, we investigate the fractal dimensions of the graphs of these functions, compute the precise values of Box and Packing dimensions, and evaluate the Hausdorff dimension. Meanwhile, the Holder continuity of such functions is also discussed.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号