Real-valued multi-area self set optimization in immunity-based network intrusion detection system

The real-valued self set in immunity-based network intrusion detection system （INIDS） has some defects： multi-area and overlapping, which are ignored before. The detectors generated by this kind of self set may have the problem of boundary holes between self and nonself regions, and the generation efficiency is low, so that, the self set needs to be optimized before generation stage. This paper proposes a self set optimization algorithm which uses the modified clustering algorithm and Gaussian distribution theory. The clustering deals with multi-area and the Gaussian distribution deals with the overlapping. The algorithm was tested by Iris data and real network data, and the results show that the optimized self set can solve the problem of boundary holes, increase the efficiency of detector generation effectively, and improve the system＇s detection rate.

The Importance of Self-Evaluation and Goal-Setting in EAT

English Audio Typing(EAT)is a quite complex process which requires the learners input the main information of listening material into a computer at almost the same time when they hear it.There are many facton influence the outcomes of EAT process,among which,self-evaluation and goal-setting are relatively crucial.

A NEGATIVE ANSWER TO A CONJECTURE ON SELF-SIMILAR SETS WITH OPEN SET CONDITION

Zhou and Feng posed a conjecture on self-similar set in 2004. In this paper, a self-similar set is constructed which has a best covering but its natural covering is not a best one. Thus, we indeed give a negative answer to the conjecture.

AN ANSWER TO A CONJECTURE ON SELF-SIMILAR SETS

In this paper, we construct a self-similar set which has a best covering but it is not the natural covering, thus negate the conjecture on self-similar sets posed by Z. Zhou in 2004.

THE REGULARITY OF RANDOM GRAPH DIRECTED SELF-SIMILAR SETS

A set in Rd is called regular if its Hausdorff dimension coincides with its upper box counting dimension. It is proved that a random graph-directed self-similar set is regular a.e..

ON THE EXACT HAUSDORFF MEASURE OF A CLASS OF SELF-SIMILAR SETS SATISFYING OPEN SET CONDITION

In this paper, we provide a new effective method for computing the exact value of Hausdorff measures of a class of self-similar sets satisfying the open set condition （OSC）. As applications, we discuss a self-similar Cantor set satisfying OSC and give a simple method for computing its exact Hausdorff measure.

The Structure and the Sufficent and Necessary Conditions for Generalized Statistically Self-Similar Sets

We constructed a class of generalized statistically self-similar set.S and give the necessary and sufficent conditions to ensure a random recursive set being a generalized statistically self-similar set. The statistically self-similar sets defined by Hutchinson,Falconer,Graf are the special cases of ours.

THE STRUCTURE AND APPROXIMATION OF A.S. SELF-SIMILAR SET

The structure of any a.s. self-similar set K(w) generated by a class of random elements {gn,wσ} taking values in the space of contractive operators is given and the approximation of K(w) by the fixed points {Pn,wσ} of {gn,ow} is obtained. It is useful to generate the fractal in computer.

THE RANDOM SHIFT SET AND RANDOM SUB-SELF-SIMILAR SET

First of all the authors introduce the concepts of random sub-self-similar set and random shift set and then construct the random sub-self-similar set by a random shift set and a collection of statistical contraction operators.

Self-organizing Map Method Based on Real Rough Sets Space and Its Application of Pattern Recognition

This paper presents a real rough sets space and corresponding concepts of real lower and upper approximation sets which correspond to the real-valued attributes. Therefore, the real rough sets space can be investigated directly. A rhombus neighborhood for SOM is proposed, and the combination of SOM and rough sets theory is explored. According to the distance between the weight of winner node and the input vector in the real rough sets space, new weight learning rules are defined. The modified method makes the classification of the output of SOM clearer and the intervals of different classes larger. Finally, an example based on fault identification of an aircraft actuator is presented, The result of the simulation shows that this method is right and effective.

Self-calibration and Compensation of Setting Errors for Surface Profile Measurement of a Microstructured Roll Workpiece

Microstructured roll workpieces have been widely used as functional components in the precision industries. Current researches on quality control have focused on surface profile measurement of microstructured roll workpieces, and types of measurement systems and measurement methods have been developed. However, low measurement efficiency and low measurement accuracy caused by setting errors are the common disadvantages for surface profile measurement of microstructured roll workpieces. In order to shorten the measurement time and enhance the measurement accuracy, a method for self-calibration and compensation of setting errors is proposed for surface profile measurement of microstructured roll workpieces. A measurement system is constructed for the measurement, in which a precision spindle is employed to rotate the roll workpiece and an air-bearing displacement sensor with a micro-stylus probe is employed to scan the microstructured surface of the roll workpiece. The resolution of the displacement sensor is 0.14 nm and that of the rotary encoder of the spindle was 0.15r~. Geometrical and mathematical models are established for analyzing the influences of the setting errors of the roll workpiece and the displacement sensor with respect to the axis of the spindle, including the eccentric error of the roll workpiece, the offset error of the sensor axis and the zero point error of the sensor output. Measurement experiments are carded out on a roll workpiece on which periodic microstructures are a period of 133 i^m along the circumferential direction. Experimental results demonstrate the feasibility of the self-compensation method. The proposed method can be used to detect and compensate the setting errors without using any additional accurate artifact.

THE DIMENSION FOR RANDOM SUB-SELF-SIMILAR SET

In this article, the Hausdorff dimension and exact Hausdorff measure function of any random sub-self-similar set are obtained under some reasonable conditions. Several examples are given at the end.

ELEMENTARY DENSITY BOUNDS FOR SELF-SIMILAR SETS AND APPLICATION

Falconer[1] used the relationship between upper convex density and upper spherical density to obtain elementary density bounds for s-sets at H S-almost all points of the sets. In this paper, following Falconer[1], we first provide a basic method to estimate the lower bounds of these two classes of set densities for the self-similar s-sets satisfying the open set condition （OSC）, and then obtain elementary density bounds for such fractals at all of their points. In addition, we apply the main results to the famous classical fractals and get some new density bounds.

FRACTAL PROPERTIES OF STATISTICALLY SELF-SIMILAR SETS

In this paper, authors compute the Packing dimension of statistically selfsimilar sets and obtaine the dimension and dimension distribution of statistically self-similar measure.

Hlder Estimate of Harmonic Functions on a Class of p.c.f. Self-Similar Sets

In this paper we establish sharp H/51der estimates of harmonic functions on a class of connected post critically finite （p.c.f.） self-similar sets, and show that functions in the domain of Laplacian enjoy the same property. Some weU-known examples, such as the Sierpinski gasket, the unit interval, the level 3 Sierpinski gasket, the hexagasket, the 3-dimensional Sierpinski gasket, and the Vicsek set are also considered.

A Local Property of Hausdorff Centered Measure of Self-Similar Sets

We analyze the local behavior of the Hausdorff centered measure for self- similar sets. If E is a self-similar set satisfying the open set condition, thenC^s（E∩B（x,r））≤（2r）^sfor all x ∈ E and r〉 0, where Cs denotes the s-dimensional Hausdorff centered measure. The above inequality is used to obtain the upper bound of the Hausdorff centered measure. As the applications of above inequality, We obtained the upper bound of the Hausdorff centered measure for some self-similar sets with Hausdorff dimension equal to 1, and prove that the upper bound reach the exact Hausdorff centered measure.

The Oscillation Inequality of Harmonic Functions on Post Critically Finite Self-Similar Sets

In this paper we establish the oscillation inequality of harmonic functions and HOlder estimate of the functions in the domain of the Laplacian on connected post critically finite （p.c.f.） self-similar sets.

THE EXACT MEASURES OF A CLASS OF SELF-SIMILAR SETS ON THE PLANE

Let S belong to R^2 be the attractor of the iterated function system {f1, f2, f3 } iterating on the unit equilateral triangle So. where fi（x） =λix ＋ bi, i = 1,2, 3, x =（x1, x2）, b1=（0, 0）, b3=（1-λ3 /2,√3/2 （1-λ3）） This paper determines the exact Hausdorff measure, centred covering measure and packing measure of S under some conditions relating to the contraction parameter.

DIMENSIONS FOR RANDOM SELF-CONFORMAL SETS

A set is called regular if its Hausdorff dimension and upper box-counting dimension coincide. In this paper,we prove that the random self-conformal set is regular almost surely. Also we determine the dimensions for a class of random self-conformal sets.

NOTE ON THE PAPER “ AN NEGATIVE ANSWER TO A CONJECTURE ON THE SELF-SIMILAR SETS SATISFYING THE OPEN SET CONDITION”

In this paper, we present a more simple and much shorter proof for the main result in the paper ＂ An negative answer to a conjecture on the self-similar sets satisfy- ing the open set condition＂, which was published in the journal Analysis in Theory and Applications in 2009.