10512188
An immune neural network used for classification
Based on an analysis of immune phenomena in nature and utilizing performances of ANN, a novel network mode, i.e., an immune neural network (INN), is proposed which integrates the immune mechanism and the function of neural information processing. The learning algorithm of an INN selects an excitation function and adaptive algorithm of the network. This model makes it easy for a user to utilize directly the characteristic information of a problem and to simplify the original structure by adjusting the excitation function with prior knowledge, improving the working efficiency and searching accuracy. A theoretical analysis and a simulation test for the twin-spiral problem show that, compared with an artificial neural network, INN is not only effective but also feasible. INN can simplify the structure of the existent model and show good working performance.
31834649
A Novel Artificial Immune Network Model and Analysis on Its Dynamic Behavior and Stabilities
A novel model of artificial immune network is presented at first, and then a simulative research work is made on its dynamic behaviors. Simulation results show that the limit cycle and chaos may exist simultaneously when four units are in connection, and the network's characteristic has a close relationship with the intensity of suppressor T-cell's function, B-cell's characteristics and transconductance. Besides this, with Liapunov's method, the sufficient conditions for network's stability is studied, especially for the case of system's characteristics under the condition that the helper T-cells appear as a nonlinear function.
15857389
A novel genetic algorithm based on immunity
A novel algorithm, the immune genetic algorithm (IGA), is proposed based on the theory of immunity in biology which mainly constructs an immune operator accomplished by two steps: 1) a vaccination and 2) an immune selection. IGA proves theoretically convergent with probability 1. Strategies and methods of selecting vaccines and constructing an immune operator are also given. IGA is illustrated to be able to restrain the degenerate phenomenon effectively during the evolutionary process with examples of TSP, and can improve the searching ability and adaptability, greatly increase the convergence rate.
16539998
Lossy to lossless image compression based on reversible integer DCT
A progressive image compression scheme is investigated using reversible integer discrete cosine transform (RDCT) which is derived from the matrix factorization theory. Previous techniques based on DCT suffer from bad performance in lossy image compression compared with wavelet image codec. And lossless compression methods such as IntDCT, I2I-DCT and so on could not compare with JPEG-LS or integer discrete wavelet transform (DWT) based codec. In this paper, lossy to lossless image compression can be implemented by our proposed scheme which consists of RDCT, coefficients reorganization, bit plane encoding, and reversible integer pre- and post-filters. Simulation results show that our method is competitive against JPEG-LS and JPEG2000 in lossless compression. Moreover, our method outperforms JPEG2000 (reversible 5/3 filter) for lossy compression, and the performance is even comparable with JPEG2000 which adopted irreversible 9/7 floating-point filter (9/7F filter).
3194016
A Novel Model of Artificial Immune Network and Simulations on Its Dynamics
A novel model of artificial immune network is presented at first, and then a simulative research work is made on its dynamic behaviors. In this model, a B cell makes a key role that takes antigens in, so as to generate antibodies as its outputs. Under five different kinds of adjustment by suppressor T cells, number of antibodies will keep to a certain degree through influencing the B cell’s activation. On the other hand, with help T cells, different B cells could cooperate from each other, which makes the system’s dynamic behavior appear more complex, such as phenomena of limit cycle, chaos, etc. Simulative results show that limit cycle and chaos may exist simultaneously when four units are in connection, and the network’s characteristic has a close relationship with the intensity of suppressor T cell’s function.
15186113
Association based immune network for multimodal function optimization
For the problem of serious resources waste, indeterminate direction of local search and degeneration in the original opt-aiNet, a novel association based immune network is proposed for multimodal function optimization. The hexabasic model mimics natural phenomenon in immune system such as clonal selection, affinity maturation, immune network, immune memory and immune association. The antibody population scale is semi-fixed reducing the time and space required to execute it. The information of the antibody population and the memory cells population is effective utilized to point out the direction of local search, to regulate the ratio between local search and global search, and to enhance the affinity of new antibodies. The elitist selection mechanism is adopted to ensure the convergence and stability of our algorithm respectively. The experiments on 10 benchmark functions show that when compared with opt-aiNet method, the new algorithm is capable of improving the search performance significantly in global convergence, convergence speed, computational cost, search ability, solution quality and algorithm stability.
14307736
Positive Semidefinite Metric Learning with Boosting
The learning of appropriate distance metrics is a critical problem in image classification and retrieval. In this work, we propose a boosting-based technique, termed BOOSTMETRIC, for learning a Mahalanobis distance metric. One of the primary difficulties in learning such a metric is to ensure that the Mahalanobis matrix remains positive semidefinite. Semidefinite programming is sometimes used to enforce this constraint, but does not scale well. BOOSTMETRIC is instead based on a key observation that any positive semidefinite matrix can be decomposed into a linear positive combination of trace-one rank-one matrices. BOOSTMETRIC thus uses rank-one positive semidefinite matrices as weak learners within an efficient and scalable boosting-based learning process. The resulting method is easy to implement, does not require tuning, and can accommodate various types of constraints. Experiments on various datasets show that the proposed algorithm compares favorably to those state-of-the-art methods in terms of classification accuracy and running time.
5317364
A criterion for optimizing kernel parameters in KBDA for image retrieval
A criterion is proposed to optimize the kernel parameters in Kernel-based Biased Discriminant Analysis (KBDA) for image retrieval. Kernel parameter optimization is performed by optimizing the kernel space such that the positive images are well clustered while the negative ones are pushed far away from the positives. The proposed criterion measures the goodness of a kernel space, and the optimal kernel parameter set is obtained by maximizing this criterion. Retrieval experiments on two benchmark image databases demonstrate the effectiveness of proposed criterion for KBDA to achieve the best possible performance at the cost of a small fractional computational overhead.
12607701
An AIS-Based Service Match Model
Aiming at the problem that self-learning ability of the current system usually appears weak during service discovery, a novel artificial immune system (AIS) based service match model is proposed, which is based on the reference to the principles of cellpsilas mutation, evaluation and the quadratic response abilities, as well as simulation on the antibody-antigen identification mechanism. Theoretical analysis and simulations both show that the model can not only increasing the recall ratio and matching speed, but also realizing the function that deriving similar service request from known service request and then searching the best matching service. Furthermore, this service matching model is able to improve systempsilas adaptive learning, memorizing and dynamic evaluating abilities in service matching process.
17996623
Fault tolerant scheduling for fixed-priority tasks with preemption threshold
Fixed-priority with preemption threshold (FPPT) is an important form of real-time scheduling algorithm, which fills the gap between fixed-priority preemptive (FPP) and fixed-priority non-preemptive (FPNP). However, this scheduling scheme together with the requirements of fault tolerance makes the prediction of a real-time system's behaviors more difficult than traditional scheduling scheme. The major contribution of this work is twofold. First, we present an appropriate schedulability analysis, based on response time analysis, for supporting fault-tolerant FPPT scheduling in hard real-time systems. The error-recovery techniques are considered to be used to carry out fault tolerance. Second, we propose the optimal priority assignment algorithm which can be used, together with the schedulability analysis, to improve system fault resilience.