A negative selection algorithm with neighborhood representation

This paper proposes a negative selection with neighborhood representation named as neighborhood negative selection algorithm.This algorithm employs a new representation method which uses the fully adjacent but mutually disjoint neighborhoods to present the self samples and detectors.After normalizing the normal samples into neighborhood shape space,the algorithm uses a special matching rule similar as Hamming distance to train mature detectors at the training stage and detect anomaly at the detection stage.The neighborhood negative selection algorithm is tested using KDD CUP 1999 dataset.Experimental results show that the algorithm can prevent the negative effect of the dimension of shape space,and provide a more accuracy and stable detection performance.

A fuzzy neural network evolved by particle swarm optimization

A cooperative system of a fuzzy logic model and a fuzzy neural network(CSFLMFNN)is proposed,in which a fuzzy logic model is acquired from domain experts and a fuzzy neural network is generated and prewired according to the model.Then PSO-CSFLMFNN is constructed by introducing particle swarm optimization(PSO)into the cooperative system instead of the commonly used evolutionary algorithms to evolve the prewired fuzzy neural network.The evolutionary fuzzy neural network implements accuracy fuzzy inference without rule matching.PSO-CSFLMFNN is applied to the intelligent fault diagnosis for a petrochemical engineering equipment,in which the cooperative system is proved to be effective.It is shown by the applied results that the performance of the evolutionary fuzzy neural network outperforms remarkably that of the one evolved by genetic algorithm in the convergence rate and the generalization precision.

Unification and Application of 3-point Approximating Subdivision Schemes of Varying Arity

In this paper, we propose and analyze a subdivision scheme which unifies 3-point approximating subdivision schemes of any arity in its compact form and has less support, computational cost and error bounds.? The usefulness of the scheme is illustrated by considering different examples along with its comparison with the established subdivision schemes. Moreover, B-splines of degree 4and well known 3-point schemes [1, 2, 3, 4, 6, 11, 12, 14, 15] are special cases of our proposed scheme.

Analysis on topology control boundary conditions in delay tolerant wireless sensor networks

In wireless sensor networks(WSNs),nodes are often scheduled to alternate between working mode and sleeping mode from energy efficiency point of view.When delay is tolerable,it is not necessary to preserve network connectivity during activity(working or sleeping) scheduling,enabling more sensors to be switched to sleeping mode and thus more energy savings.In this paper,the nodal behavior in such delay-tolerant WSNs(DT-WSNs) is modeled and analyzed.The maximum hop count with a routing path is derived in order not to violate a given sensor-to-sink delay constraint,along with extensive simulation results.

An Overview of TH-Qos Project

This paper reports the TH-QoS project of Department of Computer Science & Technology, Tsinghua University, which includes QoS framework, QoS-controlled discipline, and a QoS negotiation manager with a user-friendly negotiation interface and can be used to control multimedia applications’ QoS of the Internet.

The 4-Point α-Ary Approximating Subdivision Scheme

A general formula for 4-point α-Ary approximating subdivision scheme for curve designing is introduced for any arity α≥2. The new scheme is extension of B-spline of degree 6. Laurent polynomial method is used to investigate the continuity of the scheme. The variety of effects can be achieved in correspondence for different values of parameter. The applications of the proposed scheme are illustrated in comparison with the established subdivision schemes.

Research and Implementation of the Practical Texture Synthesis Algorithms

How to generate pictures real and esthetic objects is an important subject of computer graphics. The techniques of mapping textures onto the surfaces of an object in the 3D space are efficient ap- proaches for the purpose.We developed and implemented algorithms for generating objects with appear ances stone,wood grain,ice lattice,brick,doors and windows on Apollo workstations. All the algorithms have been incorporated into the 3D geometry modelling system(GEMS)developed by the CAD Center of Tsinghua University.This paper emphasizes the wood grain and the ice lattice algorithms.