Article

On the Lower Bound of the HausdorffMeasure of the Koch Curve

Acta Mathematica Sinica (Impact Factor: 0.48). 01/2003; 19(4):715-728. DOI: 10.1007/s10114-003-0310-2

ABSTRACT This paper gives a lower bound of the Hausdorff measure of
the Koch curve by means of the mass distribution
principle.

1 Bookmark
 · 
346 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: By means of the idea of [Baoguo Jia, Bounds of Hausdorff measure of the Sierpinski gasket, Journal of Mathematical Analysis and Application, in press, doi:10.1016/j.jmaa.2006.08.026] and the self-similarity of Koch curve, we obtain the lower and upper bounds of the Hausdorff measure of the Koch Curve, which can approach the Hausdorff measure of the Koch Curve infinitely.
    Applied Mathematics and Computation. 01/2007; 190:559-565.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The artificial immune system approach for self-nonself discrimination and its application to anomaly detection problems in engineering is showing great promise. A seminal contribution in this area is the V-detectors algorithm that can very effectively cover the nonself region of the feature space with a set of detectors. The detector set can be used to detect anomalous inputs. In this paper, a multistage approach to create an effective set of V-detectors is considered. The first stage of the algorithm generates an initial set of V-detectors. In subsequent stage, new detectors are grown from existing ones, by means of a mechanism called procreation. Procreating detectors can more effectively fill hard-to-reach interstices in the nonself region, resulting in better coverage. The effectiveness of the algorithm is first illustrated by applying it to a well-known fractal, the Koch curve. The algorithm is then applied to the problem of detecting anomalous behavior in power distribution systems, and can be of much use for maintenance-related decision-making in electrical utility companies.
    Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007; 01/2007
  • [Show abstract] [Hide abstract]
    ABSTRACT: By means of the idea of [2] (Jia Baoguo, J.Math.Anal.Appl.In press) and the self-similarity of Sierpinski carpet, we obtain the lower and upper bounds of the Hausdorff Measure of Sierpinski carpet, which can approach the Hausdorff Measure of Sierpinski carpet infinitely.
    Analysis in Theory and Applications 01/2006; 22(4):362-376.