Optimization of optical lens-controlled scanning electron microscopic resolution using generalized regression neural network and genetic algorithm

A scanning electron microscope (SEM) is a sophisticated equipment employed for fine imaging of a variety of surfaces. In this study, prediction models of SEM were constructed by using a generalized regression neural network (GRNN) and genetic algorithm (GA). The SEM components examined include condenser lens 1 and 2 and objective lens (coarse and fine) referred to as CL1, CL2, OL-Coarse, and OL-Fine. For a systematic modeling of SEM resolution (R), a face-centered Box–Wilson experiment was conducted. Two sets of data were collected with or without the adjustment of magnification. Root-mean-squared prediction error of optimized GRNN models are GA 0.481 and 1.96×10^-12 for non-adjusted and adjusted data, respectively. The optimized models demonstrated a much improved prediction over statistical regression models. The optimized models were used to optimize parameters particularly under best tuned SEM environment. For the variations in CL2 and OL-Coarse, the highest R could be achieved at all conditions except a larger CL2 either at smaller or larger OL-Coarse. For the variations in CL1 and CL2, the highest R was obtained at all conditions but larger CL2 and smaller CL1.     

高速网络Fast TCP拥塞控制算法的改进

随着网络技术的飞速发展和接入性能的不断提高,如今全世界的互联主干网络呈现出一种高速网络的特性。在这种网络特性下,传统网络中的TCP拥塞控制协议已经开始显现出不适应性,发现了FAST TCP协议中＂持续拥塞＂的形成机制,建立了数学模型来准确的描述＂持续拥塞＂所导致数据流之间带宽分配不公平的问题,进一步利用优先服务队列的方法解决了FAST TCP在网络中的持续拥塞现象。     

混沌权值变异的Huffman树图像加密算法

提出一种采用混沌权值变异的Huff man树的图像加密算法.此算法在熵编码过程中,以基本的Huffman树为标准,利用双耦合混沌序列1对DC系数进行树的结构未变异、路径值变异的加密;再利用双耦合混沌序列2对AC系数进行码字序号的加密.论文对算法进行了仿真,并对安全性、计算复杂度、压缩比性能进行了分析.实验结果表明,该算法基本上不影响压缩效率,且计算复杂度低、安全性高和实时性好,可用于网络上的图像服务.     

Some new error inequalities for a generalized quadrature rule of open type

Some new error inequalities for a generalized quadrature rule of open type are established. Especially, two sharp inequalities are derived when n is an odd and an even integer, respectively.     

An inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities

In this paper, we investigate an inexact hybrid projection-proximal method for solving a class of generalized mixed variational inequalities in Hilbert spaces. We construct a general inexact hybrid projection-proximal point algorithm, in which an inexact relaxed proximal point step is followed by a suitable orthogonal projection onto a hyperplane. Under some suitable conditions concerned with the pseudomonotone set-valued mapping T, the nonsmooth convex function f and the step size λ_k, we prove the convergence of the inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities in Hilbert spaces.     

Growing fuzzy topology adaptive resonance theory models with a push-pull learning algorithm

A new incrementally growing neural network model, called the growing fuzzy topology ART (GFTART) model, is proposed based on integrating the conventional fuzzy ART model with the incremental topology-preserving mechanism of the growing cell structure (GCS) model. This is in addition, to a new training algorithm, called the push-pull learning algorithm. The proposed GFTART model has two purposes: First, to reduce the proliferation of incrementally generated nodes in the F2 layer by the conventional fuzzy ART model based on replacing each F2 node with a GCS. Second, to enhance the class-dependent clustering representation ability of the GCS model by including the categorization property of the conventional fuzzy ART model. In addition, the proposed push-pull training algorithm enhances the cluster discriminating property and partially improves the forgetting problem of the training algorithm in the GCS model.     

A genetic algorithm with gene rearrangement for K-means clustering

In this paper, a new clustering algorithm based on genetic algorithm (GA) with gene rearrangement (GAGR) is proposed, which in application may effectively remove the degeneracy for the purpose of a more efficient search. A new crossover operator that exploits a measure of similarity between chromosomes in a population is also presented. Adaptive probabilities of crossover and mutation are employed to prevent the convergence of the GAGR to a local optimum. Using the real-world data sets, we compare the performance of our GAGR clustering algorithm with K-means algorithm and other GA methods. An application of the GAGR clustering algorithm in unsupervised classification of multispectral remote sensing images is also provided. Experiment results demonstrate that the GAGR clustering algorithm has high performance, effectiveness and flexibility.     

Learning a color distance metric for region-based image segmentation

In this paper we describe an experiment where we studied empirically the application of a learned distance metric to be used as discrimination function for an established color image segmentation algorithm. For this purpose we chose the Mumford–Shah energy functional and the Mahalanobis distance metric. The objective was to test our approach in an objective and quantifiable way on this specific algorithm employing this particular distance model, without making generalization claims. The empirical validation of the results was performed in two experiments: one applying the resulting segmentation method on a subset of the Berkeley Image Database, an exemplar image set possessing ground-truths and validating the results against the ground-truths using two well-known inter-cluster validation methods, namely, the Rand and BGM indexes, and another experiment using images of the same context divided into training and testing set, where the distance metric is learned from the training set and then applied to segment all the images. The obtained results suggest that the use of the specified learned distance metric provides better and more robust segmentations, even if no other modification of the segmentation algorithm is performed.     

Predictive models for emission of hydrogen powered car using various artificial intelligent tools

This paper investigates the use of artificial intelligent models as virtual sensors to predict relevant emissions such as carbon dioxide, carbon monoxide, unburnt hydrocarbons and oxides of nitrogen for a hydrogen powered car. The virtual sensors are developed by means of application of various Artificial Intelligent (AI) models namely; AI software built at the University of Tasmania, back-propagation neural networks with Levenberg–Marquardt algorithm, and adaptive neuro-fuzzy inference systems. These predictions are based on the study of qualitative and quantitative effects of engine process parameters such as mass airflow, engine speed, air-to-fuel ratio, exhaust gas temperature and engine power on the harmful exhaust gas emissions. All AI models show good predictive capability in estimating the emissions. However, excellent accuracy is achieved when using back-propagation neural networks with Levenberg–Marquardt algorithm in estimating emissions for various hydrogen engine operating conditions with the predicted values less than 6% of percentage average root mean square error.     

A novel associative memory approach to speech enhancement in a vehicular environment

Numerous attempts have been undertaken to apply the spectral subtraction method to cancel noise perturbations but these efforts have yet to produce an algorithm that is able to adapt well to the environmental changes in the perturbations. In addition, the variants of the spectral subtraction method so far proposed in the literature would require a non-voice activity detector (NVAD), for a single microphone system, to store the perturbation. This is used as an estimate for the reference signal. Inaccuracy in the perturbation estimates causes the cleaned speech to be corrupted by musical artifacts, which is unacceptable. Post processing of signals corrupted by the musical artifacts is very costly. This paper provides an alternative approach that employs associative memory for speech enhancement. Extensive comparison is made using the soft computing approaches for noise cancellation based on associative memories. A set of stereo microphones captures the corrupted speech in a vehicle and is used to point to the closest associative memory location. The Wiener filter approach is used to cancel the noise. The paper discusses novel examples of the associative memories using the cerebellum model for noise modeling. Experimental results show the potential of these novel soft computing architectures in generating and adapting the required Weiner filters to cancel perturbation even at signal to noise ratio (SNR) of less than −13 dB.