In this paper, a compact genetic algorithm (CGA) is enhanced by integrating its selection strategy with a steepest descent algorithm (SDA) as a local search method to give I-CGA-SDA. This system is an attempt to avoid the large CPU time and computational complexity of the standard genetic algorithm. Here, CGA dramatically reduces the number of bits required to store the population and has a faster convergence. Consequently, this integrated system is used to optimize the maximum likelihood function lnL(φ1, θ1) of the mixed model. Simulation results based on MSE were compared with those obtained from the SDA and showed that the hybrid genetic algorithm (HGA) and I-CGA-SDA can give a good estimator of (φ1, θ1) for the ARMA(1,1) model. Another comparison has been conducted to show that the I-CGA-SDA has fewer function evaluations, minimum search space percentage, faster convergence speed and has a higher optimal precision than that of the HGA.
In this research, the Williamson-Hall method and of size-strain plot method was employed to analyze X- ray lines for evaluating the crystallite size and lattice strain and of cadmium oxide nanoparticles. the crystallite size value is (15.2 nm) and (93.1 nm) and lattice strain (4.2 x10−4 ) and (21x10−4) respectively. Also, other methods have been employed to evaluate the crystallite size. The current methods are (Sherrer and modified Sherrer methods ) and their results are (14.8 nm) and (13.9nm) respectively. Each method of analysis has a different result because the alteration in the crystallite size and lattice strain calculated according to the Williamson-Hall and size-strain plot methods shows that the non-uniform strain in nan
... Show MoreRadiofrequency catheter ablation is now widely recognized as a primary treatment for a range of arrhythmias and serves as the first-line therapy fo...
A novel method for Network Intrusion Detection System (NIDS) has been proposed, based on the concept of how DNA sequence detects disease as both domains have similar conceptual method of detection. Three important steps have been proposed to apply DNA sequence for NIDS: convert the network traffic data into a form of DNA sequence using Cryptography encoding method; discover patterns of Short Tandem Repeats (STR) sequence for each network traffic attack using Teiresias algorithm; and conduct classification process depends upon STR sequence based on Horspool algorithm. 10% KDD Cup 1999 data set is used for training phase. Correct KDD Cup 1999 data set is used for testing phase to evaluate the proposed method. The current experiment results sh
... Show MoreCompetitive advantage is a substantial strategic objective for organizations. It requires high levels in the quality of products and services provided to customers, continuous improvement of costing , care for creativity and innovative employees, and speed unique to the marketing and financial engineering, and business re-engineering processes. The situation in this area, requires actors to attract and develop human resources, including help in proper implementation of the strategic tasks that targeted by those institutions. According to the opinions and viewpoints of management scholars, the competitive advantage resource is the most important issue for organizations in the third millennium, which can be a
... Show MoreA three-stage learning algorithm for deep multilayer perceptron (DMLP) with effective weight initialisation based on sparse auto-encoder is proposed in this paper, which aims to overcome difficulties in training deep neural networks with limited training data in high-dimensional feature space. At the first stage, unsupervised learning is adopted using sparse auto-encoder to obtain the initial weights of the feature extraction layers of the DMLP. At the second stage, error back-propagation is used to train the DMLP by fixing the weights obtained at the first stage for its feature extraction layers. At the third stage, all the weights of the DMLP obtained at the second stage are refined by error back-propagation. Network structures an
... Show MoreCredit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res
... Show More