An Improved Artificial Immune Algorithm with a Dynamic Threshold

An improved artificial immune algorithm with a dynamic threshold is presented. The calculation for the affinity function in the real-valued coding artificial immune algorithm is modified through considering the antibody＇s fitness and setting the dynamic threshold value. Numerical experiments show that compared with the genetic algorithm and the originally real-valued coding artificial immune algorithm, the improved algorithm possesses high speed of convergence and good performance for preventing premature convergence.     

Accurate and Fast Convergent Initial-Value Belief Propagation for Stereo Matching

The belief propagation (BP) algorithm has some limitations, including ambiguous edges and textureless regions, and slow convergence speed. To address these problems, we present a novel algorithm that intrinsically improves both the accuracy and the convergence speed of BP. First, traditional BP generally consumes time due to numerous iterations. To reduce the number of iterations, inspired by the crucial importance of the initial value in nonlinear problems, a novel initial-value belief propagation (IVBP) algorithm is presented, which can greatly improve both convergence speed and accuracy. Second, .the majority of the existing research on BP concentrates on the smoothness term or other energy terms, neglecting the significance of the data term. In this study, a self-adapting dissimilarity data term (SDDT) is presented to improve the accuracy of the data term, which incorporates an additional gradient-based measure into the traditional data term, with the weight determined by the robust measure-based control function. Finally, this study explores the effective combination of local methods and global methods. The experimental results have demonstrated that our method performs well compared with the state-of-the-art BP and simultaneously holds better edge-preserving smoothing effects with fast convergence speed in the Middlebury and new 2014 Middlebury datasets.     

Some theoretical and practical considerations for multivariate statistical cell classification useful in autologous stem cell transplantation and tumor cell purging.

BACKGROUND: As flow cytometric data becomes more complex, it becomes increasingly difficult to classify cells using conventional flow cytometry data techniques based on visual classification of the data by user-drawn regions. This paper shows some simple applications of multivariate statistical classification to classify flow cytometric data. METHODS: Discriminant Function Analysis (DFA) and Logistic Regression (LR) analysis techniques were evaluated with respect to their potential utility in the problem of detecting human breast cancer cells within normal bone marrow cells. Data sets having defined properties were employed to evaluate the potential utility of these statistical classification techniques whose performance was measured by ROC analysis. RESULTS: Two extreme but reasonable situations are presented: (1) data where the separation of cells was obvious by visual inspection and (2) data where major overlaps in the values of the individual FCM parameters made intuitive classification improbable. Both DFA and LR analysis were able to classify the cells of each type with acceptable accuracy and yield.CONCLUSIONS: The excellent empirical performance of both DFA and LR techniques, suggests that they offer promising approaches for classifying multiparameter FCM data using objective rules that may represent an improvement over commonly employed ad hoc approaches.     

Research on the parameter inversion problem of prestack seismic data based on improved differential evolution algorithm

The parameter inversion technology composed by intelligent algorithm and AVO inversion for prestack seismic data provides a comparatively effective identification method for oil-gas exploration. However, traditionally intelligent iterative algorithm, such as, genetic algorithm, shows many disadvantages in solving this problem, including highly depending on initial model, fast convergence in algorithm and being easy to fall into local optimal. Therefore, an unsatisfied inversion performance is produced. In order to solve the above problems, this paper proposes a parameter inversion method based on improved differential evolution algorithm which is better in solving parameter inversion problems of prestack seismic data. In the proposed algorithm, aims at the Aki and Rechard approximation formula used specific initialization strategy, then the initialization parameter curve more smooth. Otherwise, the new algorithm has many advantages, such as, fast computing speed, simple operation, a low independence to initial model and good global convergence, this algorithm is the right choice in solving the parameter inversion problem based on pre-stack seismic data of real number encoding.     

Classification accuracy of a single tri-axial accelerometer for training background and experience level in runners

Accelerometers are increasingly used tools for gait analysis, but there remains a lack of research on their application to running and their ability to classify running patterns. The purpose of this study was to conduct an exploratory examination into the capability of a tri-axial accelerometer to classify runners of different training backgrounds and experience levels, according to their 3-dimensional (3D) accelerometer data patterns. Training background was examined with 14 competitive soccer players and 12 experienced marathon runners, and experience level was examined with 16 first-time and the same 12 experienced marathon runners. Discrete variables were extracted from 3D accelerations during a short run using root mean square, wavelet transformation, and autocorrelation procedures. A principal component analysis (PCA) was conducted on all variables, including gait speed to account for covariance. Eight PCs were retained, explaining 88% of the variance in the data. A stepwise discriminant analysis of PCs was used to determine the binary classification accuracy for training background and experience level, with and without the PC of Speed. With Speed, the accelerometer correctly classified 96% of runners for both training background and experience level. Without Speed, the accelerometer correctly classified 85% of runners based on training background, but only 68% based on experience level. These findings suggest that the accelerometer is effective in classifying athletes of different training backgrounds, but is less effective for classifying runners of different experience levels where gait speed is the primary discriminator.     

An artificial immune system algorithm for the resource availability cost problem

In this paper, an artificial immune system (AIS) algorithm for the resource availability cost problem (RACP) is presented, in which the total cost of the (unlimited) renewable resources required to complete the project by a pre-specified project deadline should be minimized. The AIS algorithm makes use of mechanisms inspired by the vertebrate immune system and includes different algorithmic components, such as a new fitness function, a probability function for the composition of the capacity lists, and a K-means density function in order to avoid premature convergence. All components are explained in detail and computational results for the RACP are presented.     

Assessment of human locomotion by using an insole measurement system and artificial neural networks

A new method for measuring and characterizing free-living human locomotion is presented. A portable device was developed to objectively record and measure foot-ground contact information in every step for up to 24h. An artificial neural network (ANN) was developed to identify the type and intensity of locomotion. Forty subjects participated in the study. The subjects performed level walking, running, ascending and descending stairs at slow, normal and fast speeds determined by each subject, respectively. The device correctly identified walking, running, ascending and descending stairs (accuracy 98.78%, 98.33%, 97.33%, and 97.29% respectively) among different types of activities. It was also able to determine the speed of walking and running. The correlation between actual speed and estimated speed is 0.98, p< 0.0001. The average error of walking and running speed estimation is -0.050+/-0.747 km/h (mean +/- standard deviation). The study has shown the measurement of duration, frequency, type, and intensity of locomotion highly accurate using the new device and an ANN. It provides an alternative tool to the use of a gait lab to quantitatively study locomotion with high accuracy via a small, light and portable device, and to do so under free-living conditions for the clinical applications.     

Artificial neural networks in the modeling and optimization of aspirin extended release tablets with eudragit L 100 as matrix substance

The purpose of the present study was to model the effects of the concentration of Eudragit L 100 and compression pressure as the most important process and formulation variables on the in vitro release profile of aspirin from matrix tables formulated with Eudragit L 100 as matrix substance and to optimize the formulation by artificial neural network. As model formulations, 10 kinds of aspirin matrix tablets were prepared. The amount of Eudragit L 100 and the compression pressure were selected as causal factors. In vitro dissolution time profiles at 4 different sampling times were chosen as responses. A set of release parameters and causal factors were used as tutorial data for the generalized regression neural, network (GRNN) and analyzed using a computer. Observed results of drug release studies indicate that drug release rates vary widely between investigated formulations, with a range of 5 hours to more than 10 hours to complete dissolution. The GRNN model was optimized. The root mean square value for the trained network was 1.12%, which indicated that the optimal GRNN model was reached. Applying the generalized distance function method, the optimal tablet formulation predicted by GRNN was with 5% of Eudragit L 100 and tablet hardness 60N. Calculated difference (f ₁ 2.465) and similarity (f ₂ 85.61) factors indicate that there is no difference between predicted and experimentally observed drug release profiles for the optimal formulation. This work illustrates the potential for an artificial neural network, GRNN, to assist in development of extended release dosage forms.     

Learning Effective Connectivity Network Structure from fMRI Data Based on Artificial Immune Algorithm

Many approaches have been designed to extract brain effective connectivity from functional magnetic resonance imaging (fMRI) data. However, few of them can effectively identify the connectivity network structure due to different defects. In this paper, a new algorithm is developed to infer the effective connectivity between different brain regions by combining artificial immune algorithm (AIA) with the Bayes net method, named as AIAEC. In the proposed algorithm, a brain effective connectivity network is mapped onto an antibody, and four immune operators are employed to perform the optimization process of antibodies, including clonal selection operator, crossover operator, mutation operator and suppression operator, and finally gets an antibody with the highest K2 score as the solution. AIAEC is then tested on Smith’s simulated datasets, and the effect of the different factors on AIAEC is evaluated, including the node number, session length, as well as the other potential confounding factors of the blood oxygen level dependent (BOLD) signal. It was revealed that, as contrast to other existing methods, AIAEC got the best performance on the majority of the datasets. It was also found that AIAEC could attain a relative better solution under the influence of many factors, although AIAEC was differently affected by the aforementioned factors. AIAEC is thus demonstrated to be an effective method for detecting the brain effective connectivity.     

Artificial neural network based soft estimator for estimation of transducer static nonlinearity

In this work, the development of an Artificial Neural Network (ANN) based soft estimator is reported for the estimation of static-nonlinearity associated with the transducers. Under the realm of ANN based transducer modeling, only two neural models have been suggested to estimate the static-nonlinearity associated with the transducers with quite successful results. The first existing model is based on the concept of a functional link artificial neural network (FLANN) trained with mu-LMS (Least Mean Squares) learning algorithm. The second one is based on the architecture of a single layer linear ANN trained with alpha-LMS learning algorithm. However, both these models suffer from the problem of slow convergence (learning). In order to circumvent this problem, it is proposed to synthesize the direct model of transducers using the concept of a Polynomial-ANN (polynomial artificial neural network) trained with Levenberg-Marquardt (LM) learning algorithm. The proposed Polynomial-ANN oriented transducer model is implemented based on the topology of a single-layer feed-forward back-propagation-ANN. The proposed neural modeling technique provided an extremely fast convergence speed with increased accuracy for the estimation of transducer static nonlinearity. The results of convergence are very stimulating with the LM learning algorithm.     

Comparison of Algorithms for an Electronic Nose in Identifying Liquors

When the electronic nose is used to identify different varieties of distilled liquors, the pattern recognition algorithm is chosen on the basis of the experience, which lacks the guiding principle. In this research, the different brands of distilled spirits were identified using the pattern recognition algorithms （principal component analysis and the artificial neural network）. The recognition rates of different algorithms were compared. The recognition rate of the Back Propagation Neural Network （BPNN） is the highest. Owing to the slow convergence speed of the BPNN, it tends easily to get into a local minimum. A chaotic BPNN was tried in order to overcome the disadvantage of the BPNN. The convergence speed of the chaotic BPNN is 75.5 times faster than that of the BPNN.     

Reconstruction of Gene Regulatory Networks Based on Two-Stage Bayesian Network Structure Learning Algorithm

In the post-genomic biology era,the reconstruction of gene regulatory networks from microarray gene expression data isvery important to understand the underlying biological system,and it has been a challenging task in bioinformatics.TheBayesian network model has been used in reconstructing the gene regulatory network for its advantages,but how to determinethe network structure and parameters is still important to be explored.This paper proposes a two-stage structure learning algorithmwhich integrates immune evolution algorithm to build a Bayesian network.The new algorithm is evaluated with the use ofboth simulated and yeast cell cycle data.The experimental results indicate that the proposed algorithm can find many of theknown real regulatory relationships from literature and predict the others unknown with high validity and accuracy.     

近红外光谱技术快速检测原料乳中掺杂物

采用近红外光谱技术结合化学计量学方法,对原料乳中常见的2种掺杂物——大豆分离蛋白与植脂末进行定量分析研究。先通过不同光谱预处理方法结合偏最小二乘法（PLS）建模评价不同预处理方法的效果,结果表明通过平滑处理结合多元散射校正（MSC）进行光谱预处理效果最佳,大豆分离蛋白PLS定量模型相关系数（R2）与交叉验证均方差（RMSECV）分别为0.980 9、0.127 5,植脂末PLS模型分别为0.972 2、0.130 8。随后比较了不同建模方法的效果,结果发现：采用径向基神经网络（RBF）对大豆分离蛋白的建模效果最佳,R2为0.999 4,测试集均方根误差为0.003 1;采用广义回归神经网络（GRNN）方法对植脂末建模效果最佳,R2为0.998 9,测试集均方根误差为0.004 5。因此,合理结合近红外光谱技术与化学计量学方法可快速、准确检测原料乳中大豆分离蛋白和植脂末这2种掺杂物含量。     

基于面向对象的QuickBird遥感影像林隙分割与分类

传统的实地调查和人工解译方法已经不能满足区域尺度的林隙获取,高空间分辨率遥感影像的出现为区域尺度的林隙获取提供了可能.本研究采用QuickBird高空间分辨率光学遥感影像,结合面向对象分类技术对福建省三明市将乐县将乐国有林场进行林隙分割与分类.在面向对象分类过程中,采用10种尺度(10~100,步长为10)对QuickBird遥感影像进行分割,应用参考对象相交面积(RA_or)和分割对象相交面积(RA_os)进行分割结果评价.对每个尺度分割结果应用16个光谱特征,采用向量机分类器(SVM)进行林隙、非林隙和其他类型分类.结果表明:通过RA_or和RA_os等值法获得最优分割尺度参数为40.不同尺度参数之间的分类总精度最高相差22%.在最优尺度下,应用SVM分类器对林隙、非林隙和其他类型分类的总精度高达88%(Kappa=0.82).采用高空间分辨率遥感数据并结合面向对象的方法,可以代替传统的实地调查和人工解译对区域尺度的林隙进行识别分类.     

A neural network model for the prediction of membrane-spanning amino acid sequences

The architecture and weights of an artificial neural network model that predicts putative transmembrane sequences have been developed and optimized by the algorithm of structure evolution. The resulting filter is able to classify membrane/nonmembrane transition regions in sequences of integral human membrane proteins with high accuracy. Similar results have been obtained for both training and test set data, indicating that the network has focused on general features of transmembrane sequences rather than specializing on the training data. Seven physicochemical amino acid properties have been used for sequence encoding. The predictions are compared to hydrophobicity plots.     

Unsupervised feature selection algorithm for multiclass cancer classification of gene expression RNA-Seq data

This paper presents a Grouping Genetic Algorithm (GGA) to solve a maximally diverse grouping problem. It has been applied for the classification of an unbalanced database of 801 samples of gene expression RNA-Seq data in 5 types of cancer. The samples are composed by 20,531 genes. GGA extracts several groups of genes that achieve high accuracy in multiple classification. Accuracy has been evaluated by an Extreme Learning Machine algorithm and was found to be slightly higher in balanced databases than in unbalanced ones. The final classification decision has been made through a weighted majority vote system between the groups of features. The proposed algorithm finally selects 49 genes to classify samples with an average accuracy of 98.81% and a standard deviation of 0.0174.     

Fuzzy regression modeling for tool performance prediction and degradation detection

In this paper, the viability of using Fuzzy-Rule-Based Regression Modeling (FRM) algorithm for tool performance and degradation detection is investigated. The FRM is developed based on a multi-layered fuzzy-rule-based hybrid system with Multiple Regression Models (MRM) embedded into a fuzzy logic inference engine that employs Self Organizing Maps (SOM) for clustering. The FRM converts a complex nonlinear problem to a simplified linear format in order to further increase the accuracy in prediction and rate of convergence. The efficacy of the proposed FRM is tested through a case study - namely to predict the remaining useful life of a ball nose milling cutter during a dry machining process of hardened tool steel with a hardness of 52-54 HRc. A comparative study is further made between four predictive models using the same set of experimental data. It is shown that the FRM is superior as compared with conventional MRM, Back Propagation Neural Networks (BPNN) and Radial Basis Function Networks (RBFN) in terms of prediction accuracy and learning speed.     

Enumeration of small ciliates in culture by flow cytometry and nucleic acid staining

We developed a fast and simple protocol for accurate quantification of small freshwater ciliates by flow cytometry (FCM). The ciliates were stained with several nucleic acid stains such as TO-PRO-1, YO-YO-1 and PicoGreen, and analysed by a commercially available flow cytometer. The method was tested with cultures of the prostomatid species Urotricha farcta and Balanion planctonicum, including the small cryptophyte Cryptomonas sp. as food. Of the dyes tested, TO-PRO-1 gave the best results. Flow cytometric results agreed well with microscopic counts. Due to its greater speed and accuracy, FCM was superior to light microscopy. FCM was also superior to electronical particle counting and sizing (EPCS). Of particular importance, FCM in combination with TO-PRO-1 staining allowed unequivocal discrimination in cases of overlapping size distributions between the target population (i.e., the ciliate predators) and other particles (the cryptophyte prey, detritus).     

A Novel Artificial Bee Colony Based Clustering Algorithm for Categorical Data

Data with categorical attributes are ubiquitous in the real world. However, existing partitional clustering algorithms for categorical data are prone to fall into local optima. To address this issue, in this paper we propose a novel clustering algorithm, ABC-K-Modes (Artificial Bee Colony clustering based on K-Modes), based on the traditional k-modes clustering algorithm and the artificial bee colony approach. In our approach, we first introduce a one-step k-modes procedure, and then integrate this procedure with the artificial bee colony approach to deal with categorical data. In the search process performed by scout bees, we adopt the multi-source search inspired by the idea of batch processing to accelerate the convergence of ABC-K-Modes. The performance of ABC-K-Modes is evaluated by a series of experiments in comparison with that of the other popular algorithms for categorical data.     

A Novel Algorithm for Independent Component Analysis with Reference and Methods for Its Applications

This paper presents a stable and fast algorithm for independent component analysis with reference (ICA-R). This is a technique for incorporating available reference signals into the ICA contrast function so as to form an augmented Lagrangian function under the framework of constrained ICA (cICA). The previous ICA-R algorithm was constructed by solving the optimization problem via a Newton-like learning style. Unfortunately, the slow convergence and potential misconvergence limit the capability of ICA-R. This paper first investigates and probes the flaws of the previous algorithm and then introduces a new stable algorithm with a faster convergence speed. There are two other highlights in this paper: first, new approaches, including the reference deflation technique and a direct way of obtaining references, are introduced to facilitate the application of ICA-R; second, a new method is proposed that the new ICA-R is used to recover the complete underlying sources with new advantages compared with other classical ICA methods. Finally, the experiments on both synthetic and real-world data verify the better performance of the new algorithm over both previous ICA-R and other well-known methods.