Adaptive backtracking search optimization algorithm with pattern search for numerical optimization

The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts： the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA＇s important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014（IEEE CEC2014） over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm.

Web Page Recommendation Using Distributional Recurrent Neural Network

In the data retrieval process of the Data recommendation system,the matching prediction and similarity identification take place a major role in the ontology.In that,there are several methods to improve the retrieving process with improved accuracy and to reduce the searching time.Since,in the data recommendation system,this type of data searching becomes complex to search for the best matching for given query data and fails in the accuracy of the query recommendation process.To improve the performance of data validation,this paper proposed a novel model of data similarity estimation and clustering method to retrieve the relevant data with the best matching in the big data processing.In this paper advanced model of the Logarithmic Directionality Texture Pattern(LDTP)method with a Metaheuristic Pattern Searching(MPS)system was used to estimate the similarity between the query data in the entire database.The overall work was implemented for the application of the data recommendation process.These are all indexed and grouped as a cluster to form a paged format of database structure which can reduce the computation time while at the searching period.Also,with the help of a neural network,the relevancies of feature attributes in the database are predicted,and the matching index was sorted to provide the recommended data for given query data.This was achieved by using the Distributional Recurrent Neural Network(DRNN).This is an enhanced model of Neural Network technology to find the relevancy based on the correlation factor of the feature set.The training process of the DRNN classifier was carried out by estimating the correlation factor of the attributes of the dataset.These are formed as clusters and paged with proper indexing based on the MPS parameter of similarity metric.The overall performance of the proposed work can be evaluated by varying the size of the training database by 60%,70%,and 80%.The parameters that are considered for performance analysis are Precision,Recall,F1-score and the accuracy of data retrieval,the query recommendation output,and comparison with other state-of-art methods.

Assessment of Different Optimization Algorithms for a Thermal Conduction Problem

In this study,three computational approaches for the optimization of a thermal conduction problem are critically compared.These include a Direct Method(DM),a Genetic Algorithm(GA),and a Pattern Search(PS)technique.The optimization aims to minimize the maximum temperature of a hot medium(a medium with uniform heat generation)using a constant amount of high conductivity materials(playing the role of fixed factor constraining the considered problem).The principal goal of this paper is to determine the most efficient and fastest option among the considered ones.It is shown that the examined three methods approximately lead to the same result in terms of maximum tem-perature.However,when the number of optimization variables is low,the DM is the fastest one.An increment in the complexity of the design and the number of degrees of freedom(DOF)can make the DM impractical.Results also show that the PS algorithm becomes faster than the GA as the number of variables for the optimization rises.

Determination of AVR System PID Controller Parameters Using Improved Variants of Reptile Search Algorithm and a Novel Objective Function

Two novel improved variants of reptile search algorithm(RSA),RSA with opposition-based learning(ORSA)and hybrid ORSA with pattern search(ORSAPS),are proposed to determine the proportional,integral,and derivative(PID)controller parameters of an automatic voltage regulator(AVR)system using a novel objective function with augmented flexibility.In the proposed algorithms,the opposition-based learning technique improves the global search abilities of the original RSA algorithm,while the hybridization with the pattern search(PS)algorithm improves the local search abilities.Both algorithms are compared with the original RSA algorithm and have shown to be highly effective algorithms for tuning the PID controller parameters of an AVR system by getting superior results.Several analyses such as transient,stability,robustness,disturbance rejection,and trajectory tracking are conducted to test the performance of the proposed algorithms,which have validated the good promise of the proposed methods for controller designs.The performances of the proposed design approaches are also compared with the previously reported PID controller parameter tuning approaches to assess their success.It is shown that both proposed approaches obtain excellent and robust results among all compared ones.That is,with the adjustment of the weight factorα,which is introduced by the proposed objective function,for a system with high bandwitdh(α=1),the proposed ORSAPS-PID system has 2.08%more bandwidth than the proposed ORSA-PID system and 5.1%faster than the fastest algorithm from the literature.On the other hand,for a system where high phase and gain margins are desired(α=10),the proposed ORSA-PID system has 0.53%more phase margin and 2.18%more gain margin than the proposed ORSAPS-PID system and has 0.71%more phase margin and 2.25%more gain margin than the best performing algorithm from the literature.

Optimizing Control for Rotor Vibration with Magnetorheological Fluid Damper

The aim of this work is to analyze and design a control system for vibration reduction in a rotor system using a shear mode magnetorheological fluid(MRF)damper.A dynamic model of the MRF damper-rotor system was built and simulated in Matlab/Simulink to analyze the rotor vibration characteristics and the vibration reduction effect of the MRF damper.Based on the numerical simulation analysis,an optimizing control strategy using pattern search method was proposed and designed.The control system was constructed on a test rotor bench and experiment validations on the effectiveness of the proposed control strategy were conducted.Experimental results show that rotor vibration caused by unbalance can be well controlled whether in resonance region(70%)or in non-resonance region(30%).An irregular vibration amplitude jump can be suppressed with the optimization strategy.Furthermore,it is found that the rapidity of transient response and efficiency of optimizing technique depend on the pattern search step.The presented strategies and control system can be extended to multi-span(more than two or three spans)rotor system.It provides a powerful technical support for the extension and application in target and control for shafting vibration.

A Novel Forgery Detection in Image Frames of the Videos Using Enhanced Convolutional Neural Network in Face Images

Different devices in the recent era generated a vast amount of digital video.Generally,it has been seen in recent years that people are forging the video to use it as proof of evidence in the court of justice.Many kinds of researches on forensic detection have been presented,and it provides less accuracy.This paper proposed a novel forgery detection technique in image frames of the videos using enhanced Convolutional Neural Network(CNN).In the initial stage,the input video is taken as of the dataset and then converts the videos into image frames.Next,perform pre-sampling using the Adaptive Rood Pattern Search(ARPS)algorithm intended for reducing the useless frames.In the next stage,perform preprocessing for enhancing the image frames.Then,face detection is done as of the image utilizing the Viola-Jones algorithm.Finally,the improved Crow Search Algorithm(ICSA)has been used to select the extorted features and inputted to the Enhanced Convolutional Neural Network(ECNN)classifier for detecting the forged image frames.The experimental outcome of the proposed system has achieved 97.21%accuracy compared to other existing methods.

Hooke and Jeeves algorithm for linear support vector machine

Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while fixing other components. All components of w update after one iteration. Then go to next iteration. Though the method converges and converges fast in the beginning, it converges slow for final convergence. To improve the speed of final convergence of coordinate descent method, Hooke and Jeeves algorithm which adds pattern search after every iteration in coordinate descent method was applied to SVM and a global Newton algorithm was used to solve one-variable subproblems. We proved the convergence of the algorithm. Experimental results show Hooke and Jeeves＇ method does accelerate convergence specially for final convergence and achieves higher testing accuracy more quickly in classification.

Least Squares Support Vector Machine Based Real-Time Fault Diagnosis Model for Gas Path Parameters of Aero Engines

Least squares support vector machine （LS-SVM） is applied in gas path fault diagnosis for aero engines. Firstly, the deviation data of engine cruise are analyzed. Then, model selection is conducted using pattern search method. Finally, by decoding aircraft communication addressing and reporting system （ACARS） report, a real-time cruise data set is acquired, and the diagnosis model is adopted to process data. In contrast to the radial basis function （RBF） neutral network, LS-SVM is more suitable for real-time diagnosis of gas turbine engine.

Intelligent Control on Three-Stage Inverted Pendulums

In this paper, a new intelligent control method is introduced, which combines stipulations, optimal control method with knowledge based control. Using nonlinear programming method and expert experience for the complicated nonlinear object, the good control result can be achieved. The effect of this method is shown by a simulation of three stage inverted pendulums.

A NOVEL HYBRID GENETIC ALGORITHMS AND PATTERN SEARCH TECHNIQUES FOR INDUSTRIAL PRODUCTION PLANNING

Soft computing has attracted many research scientists,decision makers and practicing researchers in recent years as powerful computational intelligent techniques,for solving unlimited number of complex real-world problems particularly related to research area of optimization.Under the uncertain and turbulence environment,classical and traditional approaches are unable to obtain a complete solution with satisfaction for the real-world problems on optimization.Therefore,new global optimization methods are required to handle these issues seriously.One such method is hybrid Genetic algorithms and Pattern search,a generic,flexible,robust,and versatile framework for solving complex problems of global optimization and search in real-world applications.

An Overview of Data Mining and Knowledge Discovery

With massive amounts of data stored in databases, mining information and knowledge in databases has become an important issue in recent research. Researchers in many different fields have shown great interest in data mining and knowledge discovery in databases. Several emerging applications in information providing services, such as data warehousing and on-line services over the Internet, also call for various data mining and knowledge discovery techniques to understand user behavior better, to improve the service provided, and to increase the business opportunities. In response to such a demand, this article is to provide a comprehensive survey on the data mining and knowledge discovery techniques developed recently, and introduce some real application systems as well. In conclusion, this article also lists some problems and challenges for further research.

TrFAST: A Tool to Predict Signaling Pathway-specific Transcription Factor Binding Sites

Recent advances in the development of high-throughput tools have significantly revolutionized our understanding of molecular mech- anisms underlying normal and dysfunctional biological processes. Here we present a novel computational tool, transcription factor search and analysis tool （TrFAST）, which was developed for the in silico analysis of transcription factor binding sites （TFBSs） of sig- naling pathway-specific TFs. TrFAST facilitates searching as well as comparative analysis of regulatory motifs through an exact pattern matching algorithm followed by the graphical representation of matched binding sites in multiple sequences up to 50 kb in length. TrFAST is proficient in reducing the number of comparisons by the exact pattern matching strategy. In contrast to the pre-existing tools that find TFBS in a single sequence, TrFAST seeks out the desired pattern in multiple sequences simultaneously. It counts the GC con- tent within the given multiple sequence data set and assembles the combinational details of consensus sequence（s） located at these regions, thereby generating a visual display based on the abundance of unique pattern. Comparative regulatory region analysis of multi- ple orthologous sequences simultaneously enhances the features of TrFAST and provides a significant insight into study of conservation of non-coding cis-regulatory elements. TrFAST is freely available at http：//www.fi-pk.com/trfast.html.

Optimal proportion of wind and PV capacity in provincial power systems based on bilevel optimization algorithm under low-carbon economy

In order to boost contributions of power systems to a low-carbon economy,the installed capacity of renewable power generation,such as wind and photovoltaic(PV)power generation should be well planned.A bilevel formulation is presented to optimize the proportion of wind and PV capacity in provincial power systems,in which,carbon emissions of generator units and features of renewable resources are taken into account.In the lowerlevel formulation,a time-sequence production simulation(TSPS)model that is suitable for actual power system has been adopted.In order to maximize benefits of energy conservation and emissions reduction resulting from renewable power generation,the commercial software called General Algebraic Modeling System(GAMS)is employed to optimize the annual operation of the power system.In the upper-level formulation,the optimal pattern search(OPS)algorithm is utilized to optimize the proportion of wind and PV capacity.The objective of the upper-level formulation is to maximize benefits of energy conservation and carbon emissions reductions optimized in the lowerlevel problem.Simulation results in practical provincial power systems validate the proposed model and corresponding solving algorithms.The optimization results can provide support to policy makers to make the polices related to renewable energy.

Design optimization of the APF DTL in the SSC-linac

A linear accelerator as a new injector for the SSC （Separated Sector Cyclotron） of the HIRFL （Heavy Ion Research Facility Lanzhou） is being designed. The DTL （Drift-Tube-Linac） has been designed to accelerate ^238U^34＋ from 0.140 MeV/u to 0.97 MeV/u. To the first accelerating tank which accelerates ^238U^34＋ to 0.54 MeV/u, the approach of Alternating-Phase-Focusing （APF） is applied. The phase array is obtained by coupling optimization software Dakota and beam optics code LINREV. With the hybrid of Multi- objective Genetic Algorithm （MOGA） and a pattern search method, an optimum array of asynchronous phases is determined. The final growth, both transversely and longitudinally, can meet the design requirements. In this paper, the deign optimization of the APF DTL is presented.

Tunnel geometry of the subterranean termite Reticulitermes grassei （Isoptera： Rhinotermitidae）in response to sand bulk density and the presence of food

The cryptic habits of subterranean termites restricts detailed analysis of their foraging patterns in situ, but the process is evidently dominated by tunnel constructions connecting the nest with woody resources discovered within the territory of each colony. In this study, tunnel formation and orientation were studied experimentally in the termite Reticulitermes grassei （Clement）, using 2-dimensional laboratory foraging arenas con- taining fine sand as the substratum. The building of exploratory tunnels over a 10-day period and the geometry of the resulting network are described. Fractal analysis showed that tunnel geometry had a fractal dimension, regardless of the total length tunnelled whether foragers encountered the food source or not. The bulk density of the sand in the arenas affected the distances tunnelled, with higher density reducing construction, but did not affect tunnel geometry. Tunnels were not discernibly orientated with respect to the positioning of the food source, even in a situation where termites had failed to find the food source at a distance of less than 50 mm, suggesting that volatiles from wood are not attractants.

On the efficient search of punctured convolutional codes with simulated annealing algorithm

Punctured convolution codes （PCCs） have a lot of applications in modem communication system. The efficient way to search for best PCCs with longer constraint lengths is desired since the complexity of exhaustive search becomes unacceptable. An efficient search method to find PCCs is proposed and simulated. At first, PCCs＇ searching problem is turned into an optimization problem through analysis of PCCs＇ judging criteria, and the inefficiency to use pattern search （PS） for many local optimums is pointed out. The simulated annealing （SA） is adapted to the non-convex optimization problem to find best PCCs with low complexity. Simulation indicates that SA performs very well both in complexity and success ratio, and PCCs with memories varying from 9 to 12 and rates varying from 2/3 to 4/5 searched by SA are presented.

An adaptive fast search algorithm for block motion estimation in H.264

Motion estimation is an important issue in H.264 video coding systems because it occupies a large amount of encoding time.In this paper,a novel search algorithm which utilizes an adaptive hexagon and small diamond search (AHSDS) is proposed to enhance search speed.The search pattern is chosen according to the motion strength of the current block.When the block is in active motion,the hexagon search provides an efficient search means;when the block is inactive,the small diamond search is adopted.Simulation results showed that our approach can speed up the search process with little effect on distortion performance compared with other adaptive approaches.