Earthquakes began to occur in Koyna region (India) soon after the filling of Koyna Dam in 1962. In the present study, three datasets 1964-1993, 1993-1995, and 1996-1997 are analyzed to study the b-value and fractal ...Earthquakes began to occur in Koyna region (India) soon after the filling of Koyna Dam in 1962. In the present study, three datasets 1964-1993, 1993-1995, and 1996-1997 are analyzed to study the b-value and fractal dimension. The b-value is calculated using the Gutenberg- Richter relationship and fractal dimension Dcorr. using correlation integral method. The estimated b-value and Dcorr. of this region before 1993 are found to be in good agreement with previously reported studies. In the sub- sequent years after 1995, the b-value shows an increase. The estimated b-values of this region are found within the limits of global average. Also, the pattern of spatial clustering of earthquakes show increase in clustering and migration along the three zones called North-East Zone, South-East Zone (SEZ), and Warna Seismic Zone. The earthquake events having depth ≤5 km are largely confined to SEZ. After 1993, the Dcorr. shows decrease, implying that earth- quake activity gets clustered. This seismic clustering could be helpful for earthquake forecasting.展开更多
The microstructures of a composite determine its macroscopic properties. In this study, microstructures with particles of arbitrary shapes and sizes are constructed by using several developed fractal geometry algorith...The microstructures of a composite determine its macroscopic properties. In this study, microstructures with particles of arbitrary shapes and sizes are constructed by using several developed fractal geometry algorithms implemented in MATLAB. A two-dimensional (2D) quadrilateral fractal geometry algorithm is developed based on the modified Sierpinski carpet algorithm. Square-, rectangle-, circle-, and ellipse-based microstructure constructions are special cases of the 2D quadrilateral fractal geometry algorithm. Moreover, a three-dimensional (3D) random hexahedron geometry algorithm is developed according to the Menger sponge algorithm. Cube-and sphere-based mi-crostructure constructions are special cases of the 3D hexahedron fractal geometry algo-rithm. The polydispersities of fractal shapes and random fractal sub-units demonstrate significant enhancements compared to those obtained by the original algorithms. In ad-dition, the 2D and 3D algorithms mentioned in this article can be combined according to the actual microstructures. The verification results also demonstrate the practicability of these algorithms. The developed algorithms open up new avenues for the constructions of microstructures, which can be embedded into commercial finite element method soft-wares.展开更多
This paper utilizes a spatial texture correlation and the intelligent classification algorithm (ICA) search strategy to speed up the encoding process and improve the bit rate for fractal image compression. Texture f...This paper utilizes a spatial texture correlation and the intelligent classification algorithm (ICA) search strategy to speed up the encoding process and improve the bit rate for fractal image compression. Texture features is one of the most important properties for the representation of an image. Entropy and maximum entry from co-occurrence matrices are used for representing texture features in an image. For a range block, concerned domain blocks of neighbouring range blocks with similar texture features can be searched. In addition, domain blocks with similar texture features are searched in the ICA search process. Experiments show that in comparison with some typical methods, the proposed algorithm significantly speeds up the encoding process and achieves a higher compression ratio, with a slight diminution in the quality of the reconstructed image; in comparison with a spatial correlation scheme, the proposed scheme spends much less encoding time while the compression ratio and the quality of the reconstructed image are almost the same.展开更多
Towards the problems of existing detection methods,a novel real-time detection method(DMFIF) based on fractal and information fusion is proposed.It focuses on the intrinsic macroscopic characteristics of network,which...Towards the problems of existing detection methods,a novel real-time detection method(DMFIF) based on fractal and information fusion is proposed.It focuses on the intrinsic macroscopic characteristics of network,which reflect not the "unique" abnormalities of P2P botnets but the "common" abnormalities of them.It regards network traffic as the signal,and synthetically considers the macroscopic characteristics of network under different time scales with the fractal theory,including the self-similarity and the local singularity,which don't vary with the topology structures,the protocols and the attack types of P2P botnet.At first detect traffic abnormalities of the above characteristics with the nonparametric CUSUM algorithm,and achieve the final result by fusing the above detection results with the Dempster-Shafer evidence theory.Moreover,the side effect on detecting P2P botnet which web applications generated is considered.The experiments show that DMFIF can detect P2P botnet with a higher degree of precision.展开更多
We study the statistical properties of an ensemble of disordered 1D spatial spin-chains (SSCs) of certain length in the external field. On nodes of spin-chain lattice the recurrent equations and corresponding inequal-...We study the statistical properties of an ensemble of disordered 1D spatial spin-chains (SSCs) of certain length in the external field. On nodes of spin-chain lattice the recurrent equations and corresponding inequal-ity conditions are obtained for calculation of local minimum of a classical Hamiltonian. Using these equa-tions for simulation of a model of 1D spin-glass an original high-performance parallel algorithm is developed. Distributions of different parameters of unperturbed spin-glass are calculated. It is analytically proved and shown by numerical calculations that the distribution of the spin-spin interaction constant in the Heisenberg nearest-neighboring Hamiltonian model as opposed to the widely used Gauss-Edwards-Anderson distribu-tion satisfies the Lévy alpha-stable distribution law which does not have variance. We have studied critical properties of spin-glass depending on the external field amplitude and have shown that even at weak external fields in the system strong frustrations arise. It is shown that frustrations have a fractal character, they are self-similar and do not disappear at decreasing of calculations area scale. After averaging over the fractal structures the mean values of polarizations of the spin-glass on the scales of external field's space-time peri-ods are obtained. Similarly, Edwards-Anderson’s ordering parameter depending on the external field ampli-tude is calculated. It is shown that the mean values of polarizations and the ordering parameter depending on the external field demonstrate phase transitions of first-order.展开更多
This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block co...This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.展开更多
In order to restore noisy fractal Brownian motion(FBM),discrete fractional gaussiannoise(DFGN) combined with noise increments is decomposed by Haar wavelets based on Mallatalgorithm.Considering the correlation of deta...In order to restore noisy fractal Brownian motion(FBM),discrete fractional gaussiannoise(DFGN) combined with noise increments is decomposed by Haar wavelets based on Mallatalgorithm.Considering the correlation of detail coefficients,a bank of Wiener filters are used to estimatethe detail coefficients to reconstruct DFGN considering the estimated approximation coefficients in thecoarsest scale in the minimum mean square sense.Then,the reconstructed DFGN is used to restore FBM.In the digital simulation,in light of the restoration mean square error,we show that the suppose that thecorrelation of detail coefficients and the approximation coefficients in the coarsest scale for any Hurstcould be avoided is unrealistic.Moreover,we calculate the estimation root mean square error of the hurstparameter of the restored FBM to show the validity of our algorithm.展开更多
文摘Earthquakes began to occur in Koyna region (India) soon after the filling of Koyna Dam in 1962. In the present study, three datasets 1964-1993, 1993-1995, and 1996-1997 are analyzed to study the b-value and fractal dimension. The b-value is calculated using the Gutenberg- Richter relationship and fractal dimension Dcorr. using correlation integral method. The estimated b-value and Dcorr. of this region before 1993 are found to be in good agreement with previously reported studies. In the sub- sequent years after 1995, the b-value shows an increase. The estimated b-values of this region are found within the limits of global average. Also, the pattern of spatial clustering of earthquakes show increase in clustering and migration along the three zones called North-East Zone, South-East Zone (SEZ), and Warna Seismic Zone. The earthquake events having depth ≤5 km are largely confined to SEZ. After 1993, the Dcorr. shows decrease, implying that earth- quake activity gets clustered. This seismic clustering could be helpful for earthquake forecasting.
基金Project supported by the National Natural Science Foundation of China(Nos.11972218 and11472165)
文摘The microstructures of a composite determine its macroscopic properties. In this study, microstructures with particles of arbitrary shapes and sizes are constructed by using several developed fractal geometry algorithms implemented in MATLAB. A two-dimensional (2D) quadrilateral fractal geometry algorithm is developed based on the modified Sierpinski carpet algorithm. Square-, rectangle-, circle-, and ellipse-based microstructure constructions are special cases of the 2D quadrilateral fractal geometry algorithm. Moreover, a three-dimensional (3D) random hexahedron geometry algorithm is developed according to the Menger sponge algorithm. Cube-and sphere-based mi-crostructure constructions are special cases of the 3D hexahedron fractal geometry algo-rithm. The polydispersities of fractal shapes and random fractal sub-units demonstrate significant enhancements compared to those obtained by the original algorithms. In ad-dition, the 2D and 3D algorithms mentioned in this article can be combined according to the actual microstructures. The verification results also demonstrate the practicability of these algorithms. The developed algorithms open up new avenues for the constructions of microstructures, which can be embedded into commercial finite element method soft-wares.
基金supported by the National Natural Science Foundation of China (Grant Nos. 60573172 and 60973152)the Superior University Doctor Subject Special Scientific Research Foundation of China (Grant No. 20070141014)the Natural Science Foundation of Liaoning Province of China (Grant No. 20082165)
文摘This paper utilizes a spatial texture correlation and the intelligent classification algorithm (ICA) search strategy to speed up the encoding process and improve the bit rate for fractal image compression. Texture features is one of the most important properties for the representation of an image. Entropy and maximum entry from co-occurrence matrices are used for representing texture features in an image. For a range block, concerned domain blocks of neighbouring range blocks with similar texture features can be searched. In addition, domain blocks with similar texture features are searched in the ICA search process. Experiments show that in comparison with some typical methods, the proposed algorithm significantly speeds up the encoding process and achieves a higher compression ratio, with a slight diminution in the quality of the reconstructed image; in comparison with a spatial correlation scheme, the proposed scheme spends much less encoding time while the compression ratio and the quality of the reconstructed image are almost the same.
基金supported by National High Technical Research and Development Program of China(863 Program)under Grant No.2011AA7031024GNational Natural Science Foundation of China under Grant No.90204014
文摘Towards the problems of existing detection methods,a novel real-time detection method(DMFIF) based on fractal and information fusion is proposed.It focuses on the intrinsic macroscopic characteristics of network,which reflect not the "unique" abnormalities of P2P botnets but the "common" abnormalities of them.It regards network traffic as the signal,and synthetically considers the macroscopic characteristics of network under different time scales with the fractal theory,including the self-similarity and the local singularity,which don't vary with the topology structures,the protocols and the attack types of P2P botnet.At first detect traffic abnormalities of the above characteristics with the nonparametric CUSUM algorithm,and achieve the final result by fusing the above detection results with the Dempster-Shafer evidence theory.Moreover,the side effect on detecting P2P botnet which web applications generated is considered.The experiments show that DMFIF can detect P2P botnet with a higher degree of precision.
文摘We study the statistical properties of an ensemble of disordered 1D spatial spin-chains (SSCs) of certain length in the external field. On nodes of spin-chain lattice the recurrent equations and corresponding inequal-ity conditions are obtained for calculation of local minimum of a classical Hamiltonian. Using these equa-tions for simulation of a model of 1D spin-glass an original high-performance parallel algorithm is developed. Distributions of different parameters of unperturbed spin-glass are calculated. It is analytically proved and shown by numerical calculations that the distribution of the spin-spin interaction constant in the Heisenberg nearest-neighboring Hamiltonian model as opposed to the widely used Gauss-Edwards-Anderson distribu-tion satisfies the Lévy alpha-stable distribution law which does not have variance. We have studied critical properties of spin-glass depending on the external field amplitude and have shown that even at weak external fields in the system strong frustrations arise. It is shown that frustrations have a fractal character, they are self-similar and do not disappear at decreasing of calculations area scale. After averaging over the fractal structures the mean values of polarizations of the spin-glass on the scales of external field's space-time peri-ods are obtained. Similarly, Edwards-Anderson’s ordering parameter depending on the external field ampli-tude is calculated. It is shown that the mean values of polarizations and the ordering parameter depending on the external field demonstrate phase transitions of first-order.
基金supported by the National Natural Science Foundation of China(61171170) the Natural Science Foundation of Anhui Province(1408085QF115)
文摘This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.
文摘In order to restore noisy fractal Brownian motion(FBM),discrete fractional gaussiannoise(DFGN) combined with noise increments is decomposed by Haar wavelets based on Mallatalgorithm.Considering the correlation of detail coefficients,a bank of Wiener filters are used to estimatethe detail coefficients to reconstruct DFGN considering the estimated approximation coefficients in thecoarsest scale in the minimum mean square sense.Then,the reconstructed DFGN is used to restore FBM.In the digital simulation,in light of the restoration mean square error,we show that the suppose that thecorrelation of detail coefficients and the approximation coefficients in the coarsest scale for any Hurstcould be avoided is unrealistic.Moreover,we calculate the estimation root mean square error of the hurstparameter of the restored FBM to show the validity of our algorithm.