Genetic Programming (GP) is an important approach to deal with complex problem analysis and modeling, and has been applied in a wide range of areas. The development of GP involves various aspects, including design of ...Genetic Programming (GP) is an important approach to deal with complex problem analysis and modeling, and has been applied in a wide range of areas. The development of GP involves various aspects, including design of genetic operators, evolutionary controls and implementations of heuristic strategy, evaluations and other mechanisms. When designing genetic operators, it is necessary to consider the possible limitations of encoding methods of individuals. And when selecting evolutionary control strategies, it is also necessary to balance search efficiency and diversity based on representation characteristics as well as the problem itself. More importantly, all of these matters, among others, have to be implemented through tedious coding work. Therefore, GP development is both complex and time-consuming. To overcome some of these difficulties that hinder the enhancement of GP development efficiency, we explore the feasibility of mutual assistance among GP variants, and then propose a rapid GP prototyping development method based on πGrammatical Evolution (πGE). It is demonstrated through regression analysis experiments that not only is this method beneficial for the GP developers to get rid of some tedious implementations, but also enables them to concentrate on the essence of the referred problem, such as individual representation, decoding means and evaluation. Additionally, it provides new insights into the roles of individual delineations in phenotypes and semantic research of individuals.展开更多
Estimation of the rock mass modulus of deformation(Em)is one of the most important design parameters in designing many structures in and on rock.This parameter can be obtained by in situ tests,empirical relations betw...Estimation of the rock mass modulus of deformation(Em)is one of the most important design parameters in designing many structures in and on rock.This parameter can be obtained by in situ tests,empirical relations between deformation modulus and rock mass classifcation,and estimating from laboratory tests results.In this paper,a back analysis calculation is performed to present an equation for estimation of the rock mass modulus of deformation using genetic programming(GP)and numerical modeling.A database of 40,960 datasets,including vertical stress(rz),horizontal to vertical stresses ratio(k),Poisson’s ratio(m),radius of circular tunnel(r)and wall displacement of circular tunnel on the horizontal diameter(d)for input parameters and modulus of deformation for output,was established.The selected parameters are easy to determine and rock mass modulus of deformation can be obtained from instrumentation data of any size circular galleries.The resulting RMSE of 0.86 and correlation coeffcient of97%of the proposed equation demonstrated the capability of the computer program(CP)generated by GP.展开更多
More accurate and reliable estimation of residual strength friction angle(/r)of clay is crucial in many geotechnical engineering applications,including riverbank stability analysis,design,and assessment of earthen dam...More accurate and reliable estimation of residual strength friction angle(/r)of clay is crucial in many geotechnical engineering applications,including riverbank stability analysis,design,and assessment of earthen dam slope stabilities.However,a general predictive equation for/r,with applicability in a wide range of effective parameters,remains an important research gap.The goal of this study is to develop a more accurate equation for/r using the Pareto Optimal Multi-gene Genetic Programming(POMGGP)approach by evaluating a comprehensive dataset of 290 experiments compiled from published literature databases worldwide.A new framework for integrated equation derivation proposed that hybridizes the Subset Selection of Maximum Dissimilarity Method(SSMD)with Multi-gene Genetic Programming(MGP)and Pareto-optimality(PO)to find an accurate equation for/r with wide range applicability.The final predictive equation resulted from POMGGP modeling was assessed in comparison with some previously published machine learning-based equations using statistical error analysis criteria,Taylor diagram,revised discrepancy ratio(RDR),and scatter plots.Base on the results,the POMGGP has the lowest uncertainty with U95=2.25,when compared with Artificial Neural Network(ANN)(U95=2.3),Bayesian Regularization Neural Network(BRNN)(U95=2.94),Levenberg-Marquardt Neural Network(LMNN)(U95=3.3),and Differential Evolution Neural Network(DENN)(U95=2.37).The more reliable results in estimation of/r derived by POMGGP with reliability 59.3%,and resiliency 60%in comparison with ANN(reliability=30.23%,resiliency=28.33%),BRNN(reliability=10.47%,resiliency=10.39%),LMNN(reliability=19.77%,resiliency=20.29%)and DENN(reliability=27.91%,resiliency=24.19%).Besides the simplicity and ease of application of the new POMGGP equation to a broad range of conditions,using the uncertainty,reliability,and resilience analysis confirmed that the derived equation for/r significantly outperformed other existing machine learning methods,including the ANN,BRNN,LMNN,and DENN equations。展开更多
Detection and classification of the blurred and the non-blurred regions in images is a challenging task due to the limited available information about blur type,scenarios and level of blurriness.In this paper,we propo...Detection and classification of the blurred and the non-blurred regions in images is a challenging task due to the limited available information about blur type,scenarios and level of blurriness.In this paper,we propose an effective method for blur detection and segmentation based on transfer learning concept.The proposed method consists of two separate steps.In the first step,genetic programming(GP)model is developed that quantify the amount of blur for each pixel in the image.The GP model method uses the multiresolution features of the image and it provides an improved blur map.In the second phase,the blur map is segmented into blurred and non-blurred regions by using an adaptive threshold.A model based on support vector machine(SVM)is developed to compute adaptive threshold for the input blur map.The performance of the proposed method is evaluated using two different datasets and compared with various state-of-the-art methods.The comparative analysis reveals that the proposed method performs better against the state-of-the-art techniques.展开更多
In many areas, reliability of the digital circuits has become the key factor to restrict circuit development. Fault-tolerant design is the commonly used method to improve the reliability of digital circuits. The curre...In many areas, reliability of the digital circuits has become the key factor to restrict circuit development. Fault-tolerant design is the commonly used method to improve the reliability of digital circuits. The current fault-tolerant design methods are based on triple modular redundancy( TMR) or multiple modular redundancy( MMR). These redundancy designs rely on the experience of the designers,and the designed circuits have poor adaptabilities to a complex environment. However, evolutionary design of digital circuits does not rely on prior knowledge. During the evolution, some novel and optimal circuit topologies can be found, and the evolved circuits can feature strong adaptive capacities. Based on Cartesian genetic programming( CGP), a novel method for designing fault-tolerant digital circuits by evolution is proposed,key steps of the evolution are introduced,influences of function sets on evolution are investigated,and as a preliminary result,an evolved full adder with high fault-tolerance is shown.展开更多
The American Association of State Highway and Transportation Officials Mechanistic-Empirical Pavement DesignGuide (AASHTO M-E) offers an opportunity to design more economical and sustainable high-volume rigid pavement...The American Association of State Highway and Transportation Officials Mechanistic-Empirical Pavement DesignGuide (AASHTO M-E) offers an opportunity to design more economical and sustainable high-volume rigid pavementscompared to conventional design guidelines. It is achieved through optimizing pavement structural andthickness design under specified climate and traffic conditions using advanced M-E principles, thereby minimizingeconomic costs and environmental impact. However, the implementation of AASHTO M-E design for low-volumeconcrete pavements using AASHTOWare Pavement ME Design (Pavement ME) software is often overly conservative.This is because Pavement ME specifies the minimum design thickness of concrete slab as 152.4 mm (6 in.). Thispaper introduces a novel extension of the AASHTO M-E framework for the design of low-volume joint plain concretepavements (JPCPs) without modification of Pavement ME. It utilizes multi-gene genetic programming (MGGP)-based computational models to obtain rapid solutions for JPCP damage accumulation and long-term performanceanalyses. The developed MGGP models simulate the fatigue damage and differential energy accumulations. Thispermits the prediction of transverse cracking and joint faulting for a wide range of design input parameters and axlespectrum. The developed MGGP-based models match Pavement ME-predicted cracking and faulting for rigidpavements with conventional concrete slab thicknesses and enable rational extrapolation of performance predictionfor thinner JPCPs. This paper demonstrates how the developed computational model enables sustainable lowvolumepavement design using optimized ME solutions for Pittsburgh, PA, conditions.展开更多
Web image retrieval is a challenging task. One central problem of web image retrieval is to rank a set of images according to how well they meet the user information need. The problem of learning to rank has inspired ...Web image retrieval is a challenging task. One central problem of web image retrieval is to rank a set of images according to how well they meet the user information need. The problem of learning to rank has inspired numerous approaches to resolve it in the text information retrieval, related work for web image retrieval, however, are still limited. We focus on the problem of learning to rank images for web image retrieval, and propose a novel ranking model, which employs a genetic programming architecture to automatically generate an effective ranking function, by combining various types of evidences in web image retrieval, including text information, image visual content features, link structure analysis and temporal information. The experimental results show that the proposed algorithms are capable of learning effective ranking functions for web image retrieval. Significant improvement in relevancy obtained, in comparison to some other well-known ranking techniques, in terms of MAP, NDCG@n and D@n.展开更多
Rolling dynamic compaction (RDC),which employs non-circular module towed behind a tractor,is an innovative soil compaction method that has proven to be successful in many ground improvement applications.RDC involves r...Rolling dynamic compaction (RDC),which employs non-circular module towed behind a tractor,is an innovative soil compaction method that has proven to be successful in many ground improvement applications.RDC involves repeatedly delivering high-energy impact blows onto the ground surface,which improves soil density and thus soil strength and stiffness.However,there exists a lack of methods to predict the effectiveness of RDC in different ground conditions,which has become a major obstacle to its adoption.For this,in this context,a prediction model is developed based on linear genetic programming (LGP),which is one of the common approaches in application of artificial intelligence for nonlinear forecasting.The model is based on in situ density-related data in terms of dynamic cone penetrometer (DCP) results obtained from several projects that have employed the 4-sided,8-t impact roller (BH-1300).It is shown that the model is accurate and reliable over a range of soil types.Furthermore,a series of parametric studies confirms its robustness in generalizing data.In addition,the results of the comparative study indicate that the optimal LGP model has a better predictive performance than the existing artificial neural network (ANN) model developed earlier by the authors.展开更多
In the present study a Genetic Programing model (GP) proposed for the prediction of relative crest settlement of concrete faced rock fill dams. To this end information of 30 large dams constructed in seven countries a...In the present study a Genetic Programing model (GP) proposed for the prediction of relative crest settlement of concrete faced rock fill dams. To this end information of 30 large dams constructed in seven countries across the world is gathered with their reported settlements. The results showed that the GP model is able to estimate the dam settlement properly based on four properties, void ratio of dam’s body (e), height (H), vertical deformation modulus (Ev) and shape factor (Sc) of the dam. For verification of the model applicability, obtained results compared with other research methods such as Clements’s formula and the finite element model. The comparison showed that in all cases the GP model led to be more accurate than those of performed in literature. Also a proper compatibility between the GP model and the finite element model was perceived.展开更多
Systems biology requires the development of algorithms that use omics data to infer interaction networks among biomolecules working within an organism. One major type of evolutionary algorithm, genetic programming (GP...Systems biology requires the development of algorithms that use omics data to infer interaction networks among biomolecules working within an organism. One major type of evolutionary algorithm, genetic programming (GP), is useful for its high heuristic ability as a search method for obtaining suitable solutions expressed as tree structures. However, because GP determines the values of parameters such as coefficients by random values, it is difficult to apply in the inference of state equations that describe oscillatory biochemical reaction systems with high nonlinearity. Accordingly, in this study, we propose a new GP procedure called “k-step GP” intended for inferring the state equations of oscillatory biochemical reaction systems. The k-step GP procedure consists of two algorithms: 1) Parameter optimization using the modified Powell method—after genetic operations such as crossover and mutation, the values of parameters such as coefficients are optimized by applying the modified Powell method with secondary convergence. 2) GP using divided learning data—to improve the inference efficiency, imposes perturbations through the addition of learning data at various intervals and adaptations to these changes result in state equations with higher fitness. We are confident that k-step GP is an algorithm that is particularly well suited to inferring state equations for oscillatory biochemical reaction systems and contributes to solving inverse problems in systems biology.展开更多
The surface subsidence induced by mining is a complex problem, which is related with many complex and uncertain factors. Genetic programming (GP) has a good ability to deal with complex and nonlinear problems, therefo...The surface subsidence induced by mining is a complex problem, which is related with many complex and uncertain factors. Genetic programming (GP) has a good ability to deal with complex and nonlinear problems, therefore genetic programming approach is proposed to predict mining induced surface subsidence in this article. First genetic programming technique is introduced, second, surface subsidence genetic programming model is set up by selecting its main affective factors and training relating to practical engineering data, and finally, predictions are made by the testing of data, whose results show that the relative error is approximately less than 10%, which can meet the engineering needs, and therefore, this proposed approach is valid and applicable in predicting mining induced surface subsidence. The model offers a novel method to predict surface subsidence in mining.展开更多
Precise comprehensive evaluation of flood disaster loss is significant for the prevention and mitigation of flood disasters. Here, one of the difficulties involved is how to establish a model capable of describing the...Precise comprehensive evaluation of flood disaster loss is significant for the prevention and mitigation of flood disasters. Here, one of the difficulties involved is how to establish a model capable of describing the complex relation between the input and output data of the system of flood disaster loss. Genetic programming (GP) solves problems by using ideas from genetic algorithm and generates computer programs automatically. In this study a new method named the evaluation of the grade of flood disaster loss (EGFD) on the basis of improved genetic programming (IGP) is presented (IGP-EGFD). The flood disaster area and the direct economic loss are taken as the evaluation indexes of flood disaster loss. Obviously that the larger the evaluation index value, the larger the corresponding value of the grade of flood disaster loss is. Consequently the IGP code is designed to make the value of the grade of flood disaster be an increasing function of the index value. The result of the application of the IGP-EGFD model to Henan Province shows that a good function expression can be obtained within a bigger searched function space; and the model is of high precision and considerable practical significance. Thus, IGP-EGFD can be widely used in automatic modeling and other evaluation systems.展开更多
When acquaintances of a model are little or the model is too complicate to build by using traditional time series methods, it is convenient for us to take advantage of genetic programming (GP) to build the model. Cons...When acquaintances of a model are little or the model is too complicate to build by using traditional time series methods, it is convenient for us to take advantage of genetic programming (GP) to build the model. Considering the complexity of nonlinear dynamic systems, this paper proposes modeling dynamic systems by using the nonlinear difference e-quation based on GP technique. First it gives the method, criteria and evaluation of modeling. Then it describes the modeling algorithm using GP. Finally two typical examples of time series are used to perform the numerical experiments. The result shows that this algorithm can successfully establish the difference equation model of dynamic systems and its predictive result is also satisfactory.展开更多
A new point-tree data structure genetic programming (PTGP) method is proposed. For the discontinuous function regression problem, the proposed method is able to identify both the function structure and discontinuities...A new point-tree data structure genetic programming (PTGP) method is proposed. For the discontinuous function regression problem, the proposed method is able to identify both the function structure and discontinuities points simultaneously. It is also easy to be used to solve the continuous function’s regression problems. The numerical experiment results demonstrate that the point-tree GP is an efficient alternative way to the complex function identification problems.展开更多
In this paper, we present an application of Genetic Programming (GP) to Vietnamese CPI in?ation one-step prediction problem. This is a new approach in building a good forecasting model, and then applying inflation for...In this paper, we present an application of Genetic Programming (GP) to Vietnamese CPI in?ation one-step prediction problem. This is a new approach in building a good forecasting model, and then applying inflation forecasts in Vietnam in current stage. The study introduces the within-sample and the out-of-samples one-step-ahead forecast errors which have positive correlation and approximate to a linear function with positive slope in prediction models by GP. We also build Vector Autoregression (VAR) model to forecast CPI in quaterly data and compare with the models created by GP. The experimental results show that the Genetic Programming can produce the prediction models having better accuracy than Vector Autoregression models. We have no relavant variables (m2, ex) of monthly data in the VAR model, so no prediction results exist to compare with models created by GP and we just forecast CPI basing on models of GP with previous data of CPI.展开更多
Securities fraud is a common worldwide problem, resulting in serious negative consequences to securities market each year. Securities Regulatory Commission from various countries has also attached great importance to ...Securities fraud is a common worldwide problem, resulting in serious negative consequences to securities market each year. Securities Regulatory Commission from various countries has also attached great importance to the detection and prevention of securities fraud activities. Securities fraud is also increasing due to the rapid expansion of securities market in China. In accomplishing the task of securities fraud detection, China Securities Regulatory Commission (CSRC) could be facilitated in their work by using a number of data mining techniques. In this paper, we investigate the usefulness of Logistic regression model, Neural Networks (NNs), Sequential minimal optimization (SMO), Radial Basis Function (RBF) networks, Bayesian networks and Grammar Based Genet- ic Programming (GBGP) in the classification of the real, large and latest China Corporate Securities Fraud (CCSF) database. The six data mining techniques are compared in terms of their performances. As a result, we found GBGP outperforms others. This paper describes the GBGP in detail in solving the CCSF problem. In addition, the Synthetic Minority Over-sampling Technique (SMOTE) is applied to generate synthetic minority class examples for the imbalanced CCSF dataset.展开更多
In this paper, we continue the efforts of the Computational Theory of Intelligence (CTI) by extending concepts to include computational processes in terms of Genetic Algorithms (GA’s) and Turing Machines (TM’s). Act...In this paper, we continue the efforts of the Computational Theory of Intelligence (CTI) by extending concepts to include computational processes in terms of Genetic Algorithms (GA’s) and Turing Machines (TM’s). Active, Passive, and Hybrid Computational Intelligence processes are also introduced and discussed. We consider the ramifications of the assumptions of CTI with regard to the qualities of reproduction and virility. Applications to Biology, Computer Science and Cyber Security are also discussed.展开更多
The present study aims at improving the ability of the canonical genetic programming algorithm to solve problems, and describes an improved genetic programming (IGP). The proposed method can be described as follows: t...The present study aims at improving the ability of the canonical genetic programming algorithm to solve problems, and describes an improved genetic programming (IGP). The proposed method can be described as follows: the first inves-tigates initializing population, the second investigates reproduction operator, the third investigates crossover operator, and the fourth investigates mutation operation. The IGP is examined in two domains and the results suggest that the IGP is more effective and more efficient than the canonical one applied in different domains.展开更多
This paper proposes a Genetic Programming based algorithm that can be used to design optimal controllers. The proposed algorithm will be named a Multiple Basis Function Genetic Programming (MBFGP). Herein, the main id...This paper proposes a Genetic Programming based algorithm that can be used to design optimal controllers. The proposed algorithm will be named a Multiple Basis Function Genetic Programming (MBFGP). Herein, the main ideas concerning the initial population, the tree structure, genetic operations, and other proposed non-genetic operations are discussed in details. An optimization algorithm called numeric constant mutation is embedded to strengthen the search for the optimal solutions. The results of solving the optimal control for linear as well as nonlinear systems show the feasibility and effectiveness of the proposed MBFGP as compared to the optimal solutions which are based on numerical methods. Furthermore, this algorithm enriches the set of suboptimal state feedback controllers to include controllers that have product time-state terms.展开更多
Increasing demand for a fast and reliable face recognition technology has obliged researchers to try and examine different pattern recognition schemes. But until now, Genetic Programming (GP), acclaimed pattern recogn...Increasing demand for a fast and reliable face recognition technology has obliged researchers to try and examine different pattern recognition schemes. But until now, Genetic Programming (GP), acclaimed pattern recognition, data mining and relation discovery methodology, has been neglected in face recognition literature. This paper tries to apply GP to face recognition. First Principal Component Analysis (PCA) is used to extract features, and then GP is used to classify image groups. To further improve the results, a leveraging method is also utilized. It is shown that although GP might not be efficient in its isolated form, a leveraged GP can offer results comparable to other Face recognition solutions.展开更多
文摘Genetic Programming (GP) is an important approach to deal with complex problem analysis and modeling, and has been applied in a wide range of areas. The development of GP involves various aspects, including design of genetic operators, evolutionary controls and implementations of heuristic strategy, evaluations and other mechanisms. When designing genetic operators, it is necessary to consider the possible limitations of encoding methods of individuals. And when selecting evolutionary control strategies, it is also necessary to balance search efficiency and diversity based on representation characteristics as well as the problem itself. More importantly, all of these matters, among others, have to be implemented through tedious coding work. Therefore, GP development is both complex and time-consuming. To overcome some of these difficulties that hinder the enhancement of GP development efficiency, we explore the feasibility of mutual assistance among GP variants, and then propose a rapid GP prototyping development method based on πGrammatical Evolution (πGE). It is demonstrated through regression analysis experiments that not only is this method beneficial for the GP developers to get rid of some tedious implementations, but also enables them to concentrate on the essence of the referred problem, such as individual representation, decoding means and evaluation. Additionally, it provides new insights into the roles of individual delineations in phenotypes and semantic research of individuals.
文摘Estimation of the rock mass modulus of deformation(Em)is one of the most important design parameters in designing many structures in and on rock.This parameter can be obtained by in situ tests,empirical relations between deformation modulus and rock mass classifcation,and estimating from laboratory tests results.In this paper,a back analysis calculation is performed to present an equation for estimation of the rock mass modulus of deformation using genetic programming(GP)and numerical modeling.A database of 40,960 datasets,including vertical stress(rz),horizontal to vertical stresses ratio(k),Poisson’s ratio(m),radius of circular tunnel(r)and wall displacement of circular tunnel on the horizontal diameter(d)for input parameters and modulus of deformation for output,was established.The selected parameters are easy to determine and rock mass modulus of deformation can be obtained from instrumentation data of any size circular galleries.The resulting RMSE of 0.86 and correlation coeffcient of97%of the proposed equation demonstrated the capability of the computer program(CP)generated by GP.
文摘More accurate and reliable estimation of residual strength friction angle(/r)of clay is crucial in many geotechnical engineering applications,including riverbank stability analysis,design,and assessment of earthen dam slope stabilities.However,a general predictive equation for/r,with applicability in a wide range of effective parameters,remains an important research gap.The goal of this study is to develop a more accurate equation for/r using the Pareto Optimal Multi-gene Genetic Programming(POMGGP)approach by evaluating a comprehensive dataset of 290 experiments compiled from published literature databases worldwide.A new framework for integrated equation derivation proposed that hybridizes the Subset Selection of Maximum Dissimilarity Method(SSMD)with Multi-gene Genetic Programming(MGP)and Pareto-optimality(PO)to find an accurate equation for/r with wide range applicability.The final predictive equation resulted from POMGGP modeling was assessed in comparison with some previously published machine learning-based equations using statistical error analysis criteria,Taylor diagram,revised discrepancy ratio(RDR),and scatter plots.Base on the results,the POMGGP has the lowest uncertainty with U95=2.25,when compared with Artificial Neural Network(ANN)(U95=2.3),Bayesian Regularization Neural Network(BRNN)(U95=2.94),Levenberg-Marquardt Neural Network(LMNN)(U95=3.3),and Differential Evolution Neural Network(DENN)(U95=2.37).The more reliable results in estimation of/r derived by POMGGP with reliability 59.3%,and resiliency 60%in comparison with ANN(reliability=30.23%,resiliency=28.33%),BRNN(reliability=10.47%,resiliency=10.39%),LMNN(reliability=19.77%,resiliency=20.29%)and DENN(reliability=27.91%,resiliency=24.19%).Besides the simplicity and ease of application of the new POMGGP equation to a broad range of conditions,using the uncertainty,reliability,and resilience analysis confirmed that the derived equation for/r significantly outperformed other existing machine learning methods,including the ANN,BRNN,LMNN,and DENN equations。
基金This work was supported by the BK-21 FOUR program through National Research Foundation of Korea(NRF)under Ministry of Education.
文摘Detection and classification of the blurred and the non-blurred regions in images is a challenging task due to the limited available information about blur type,scenarios and level of blurriness.In this paper,we propose an effective method for blur detection and segmentation based on transfer learning concept.The proposed method consists of two separate steps.In the first step,genetic programming(GP)model is developed that quantify the amount of blur for each pixel in the image.The GP model method uses the multiresolution features of the image and it provides an improved blur map.In the second phase,the blur map is segmented into blurred and non-blurred regions by using an adaptive threshold.A model based on support vector machine(SVM)is developed to compute adaptive threshold for the input blur map.The performance of the proposed method is evaluated using two different datasets and compared with various state-of-the-art methods.The comparative analysis reveals that the proposed method performs better against the state-of-the-art techniques.
基金National Natural Science Foundations of China(Nos.61271153,61372039)
文摘In many areas, reliability of the digital circuits has become the key factor to restrict circuit development. Fault-tolerant design is the commonly used method to improve the reliability of digital circuits. The current fault-tolerant design methods are based on triple modular redundancy( TMR) or multiple modular redundancy( MMR). These redundancy designs rely on the experience of the designers,and the designed circuits have poor adaptabilities to a complex environment. However, evolutionary design of digital circuits does not rely on prior knowledge. During the evolution, some novel and optimal circuit topologies can be found, and the evolved circuits can feature strong adaptive capacities. Based on Cartesian genetic programming( CGP), a novel method for designing fault-tolerant digital circuits by evolution is proposed,key steps of the evolution are introduced,influences of function sets on evolution are investigated,and as a preliminary result,an evolved full adder with high fault-tolerance is shown.
基金the financial support from the University of Pittsburgh Anthony Gill Chair and the Impactful Resilient Infrastructure Science and Engineering Consortium(IRISE)at University of Pittsburgh.
文摘The American Association of State Highway and Transportation Officials Mechanistic-Empirical Pavement DesignGuide (AASHTO M-E) offers an opportunity to design more economical and sustainable high-volume rigid pavementscompared to conventional design guidelines. It is achieved through optimizing pavement structural andthickness design under specified climate and traffic conditions using advanced M-E principles, thereby minimizingeconomic costs and environmental impact. However, the implementation of AASHTO M-E design for low-volumeconcrete pavements using AASHTOWare Pavement ME Design (Pavement ME) software is often overly conservative.This is because Pavement ME specifies the minimum design thickness of concrete slab as 152.4 mm (6 in.). Thispaper introduces a novel extension of the AASHTO M-E framework for the design of low-volume joint plain concretepavements (JPCPs) without modification of Pavement ME. It utilizes multi-gene genetic programming (MGGP)-based computational models to obtain rapid solutions for JPCP damage accumulation and long-term performanceanalyses. The developed MGGP models simulate the fatigue damage and differential energy accumulations. Thispermits the prediction of transverse cracking and joint faulting for a wide range of design input parameters and axlespectrum. The developed MGGP-based models match Pavement ME-predicted cracking and faulting for rigidpavements with conventional concrete slab thicknesses and enable rational extrapolation of performance predictionfor thinner JPCPs. This paper demonstrates how the developed computational model enables sustainable lowvolumepavement design using optimized ME solutions for Pittsburgh, PA, conditions.
基金supported by the Natural Science Foundation of China (60970047)the Natural Science Foundation of Shandong Province (Y2008G19)the Key Science-Technology Project of Shandong Province (2007GG10001002, 2008GG10001026)
文摘Web image retrieval is a challenging task. One central problem of web image retrieval is to rank a set of images according to how well they meet the user information need. The problem of learning to rank has inspired numerous approaches to resolve it in the text information retrieval, related work for web image retrieval, however, are still limited. We focus on the problem of learning to rank images for web image retrieval, and propose a novel ranking model, which employs a genetic programming architecture to automatically generate an effective ranking function, by combining various types of evidences in web image retrieval, including text information, image visual content features, link structure analysis and temporal information. The experimental results show that the proposed algorithms are capable of learning effective ranking functions for web image retrieval. Significant improvement in relevancy obtained, in comparison to some other well-known ranking techniques, in terms of MAP, NDCG@n and D@n.
基金supported under Australian Research Council’s Discovery Projects funding scheme(project No. DP120101761)
文摘Rolling dynamic compaction (RDC),which employs non-circular module towed behind a tractor,is an innovative soil compaction method that has proven to be successful in many ground improvement applications.RDC involves repeatedly delivering high-energy impact blows onto the ground surface,which improves soil density and thus soil strength and stiffness.However,there exists a lack of methods to predict the effectiveness of RDC in different ground conditions,which has become a major obstacle to its adoption.For this,in this context,a prediction model is developed based on linear genetic programming (LGP),which is one of the common approaches in application of artificial intelligence for nonlinear forecasting.The model is based on in situ density-related data in terms of dynamic cone penetrometer (DCP) results obtained from several projects that have employed the 4-sided,8-t impact roller (BH-1300).It is shown that the model is accurate and reliable over a range of soil types.Furthermore,a series of parametric studies confirms its robustness in generalizing data.In addition,the results of the comparative study indicate that the optimal LGP model has a better predictive performance than the existing artificial neural network (ANN) model developed earlier by the authors.
文摘In the present study a Genetic Programing model (GP) proposed for the prediction of relative crest settlement of concrete faced rock fill dams. To this end information of 30 large dams constructed in seven countries across the world is gathered with their reported settlements. The results showed that the GP model is able to estimate the dam settlement properly based on four properties, void ratio of dam’s body (e), height (H), vertical deformation modulus (Ev) and shape factor (Sc) of the dam. For verification of the model applicability, obtained results compared with other research methods such as Clements’s formula and the finite element model. The comparison showed that in all cases the GP model led to be more accurate than those of performed in literature. Also a proper compatibility between the GP model and the finite element model was perceived.
文摘Systems biology requires the development of algorithms that use omics data to infer interaction networks among biomolecules working within an organism. One major type of evolutionary algorithm, genetic programming (GP), is useful for its high heuristic ability as a search method for obtaining suitable solutions expressed as tree structures. However, because GP determines the values of parameters such as coefficients by random values, it is difficult to apply in the inference of state equations that describe oscillatory biochemical reaction systems with high nonlinearity. Accordingly, in this study, we propose a new GP procedure called “k-step GP” intended for inferring the state equations of oscillatory biochemical reaction systems. The k-step GP procedure consists of two algorithms: 1) Parameter optimization using the modified Powell method—after genetic operations such as crossover and mutation, the values of parameters such as coefficients are optimized by applying the modified Powell method with secondary convergence. 2) GP using divided learning data—to improve the inference efficiency, imposes perturbations through the addition of learning data at various intervals and adaptations to these changes result in state equations with higher fitness. We are confident that k-step GP is an algorithm that is particularly well suited to inferring state equations for oscillatory biochemical reaction systems and contributes to solving inverse problems in systems biology.
基金This paper is supported by Jinchuan Group Ltd.(No.2004-01D).
文摘The surface subsidence induced by mining is a complex problem, which is related with many complex and uncertain factors. Genetic programming (GP) has a good ability to deal with complex and nonlinear problems, therefore genetic programming approach is proposed to predict mining induced surface subsidence in this article. First genetic programming technique is introduced, second, surface subsidence genetic programming model is set up by selecting its main affective factors and training relating to practical engineering data, and finally, predictions are made by the testing of data, whose results show that the relative error is approximately less than 10%, which can meet the engineering needs, and therefore, this proposed approach is valid and applicable in predicting mining induced surface subsidence. The model offers a novel method to predict surface subsidence in mining.
基金The authors would like to acknowledge the funding support of the National Natural Science Foundation of China (No. 50579009, 70425001).
文摘Precise comprehensive evaluation of flood disaster loss is significant for the prevention and mitigation of flood disasters. Here, one of the difficulties involved is how to establish a model capable of describing the complex relation between the input and output data of the system of flood disaster loss. Genetic programming (GP) solves problems by using ideas from genetic algorithm and generates computer programs automatically. In this study a new method named the evaluation of the grade of flood disaster loss (EGFD) on the basis of improved genetic programming (IGP) is presented (IGP-EGFD). The flood disaster area and the direct economic loss are taken as the evaluation indexes of flood disaster loss. Obviously that the larger the evaluation index value, the larger the corresponding value of the grade of flood disaster loss is. Consequently the IGP code is designed to make the value of the grade of flood disaster be an increasing function of the index value. The result of the application of the IGP-EGFD model to Henan Province shows that a good function expression can be obtained within a bigger searched function space; and the model is of high precision and considerable practical significance. Thus, IGP-EGFD can be widely used in automatic modeling and other evaluation systems.
基金Supported by Foundation for University Key Teacher by the Ministry of Education of China
文摘When acquaintances of a model are little or the model is too complicate to build by using traditional time series methods, it is convenient for us to take advantage of genetic programming (GP) to build the model. Considering the complexity of nonlinear dynamic systems, this paper proposes modeling dynamic systems by using the nonlinear difference e-quation based on GP technique. First it gives the method, criteria and evaluation of modeling. Then it describes the modeling algorithm using GP. Finally two typical examples of time series are used to perform the numerical experiments. The result shows that this algorithm can successfully establish the difference equation model of dynamic systems and its predictive result is also satisfactory.
基金Supported by the National Natural Science Foundation(60173046)and the Natural Science Foundation of Province(2002AB040)
文摘A new point-tree data structure genetic programming (PTGP) method is proposed. For the discontinuous function regression problem, the proposed method is able to identify both the function structure and discontinuities points simultaneously. It is also easy to be used to solve the continuous function’s regression problems. The numerical experiment results demonstrate that the point-tree GP is an efficient alternative way to the complex function identification problems.
文摘In this paper, we present an application of Genetic Programming (GP) to Vietnamese CPI in?ation one-step prediction problem. This is a new approach in building a good forecasting model, and then applying inflation forecasts in Vietnam in current stage. The study introduces the within-sample and the out-of-samples one-step-ahead forecast errors which have positive correlation and approximate to a linear function with positive slope in prediction models by GP. We also build Vector Autoregression (VAR) model to forecast CPI in quaterly data and compare with the models created by GP. The experimental results show that the Genetic Programming can produce the prediction models having better accuracy than Vector Autoregression models. We have no relavant variables (m2, ex) of monthly data in the VAR model, so no prediction results exist to compare with models created by GP and we just forecast CPI basing on models of GP with previous data of CPI.
文摘Securities fraud is a common worldwide problem, resulting in serious negative consequences to securities market each year. Securities Regulatory Commission from various countries has also attached great importance to the detection and prevention of securities fraud activities. Securities fraud is also increasing due to the rapid expansion of securities market in China. In accomplishing the task of securities fraud detection, China Securities Regulatory Commission (CSRC) could be facilitated in their work by using a number of data mining techniques. In this paper, we investigate the usefulness of Logistic regression model, Neural Networks (NNs), Sequential minimal optimization (SMO), Radial Basis Function (RBF) networks, Bayesian networks and Grammar Based Genet- ic Programming (GBGP) in the classification of the real, large and latest China Corporate Securities Fraud (CCSF) database. The six data mining techniques are compared in terms of their performances. As a result, we found GBGP outperforms others. This paper describes the GBGP in detail in solving the CCSF problem. In addition, the Synthetic Minority Over-sampling Technique (SMOTE) is applied to generate synthetic minority class examples for the imbalanced CCSF dataset.
文摘In this paper, we continue the efforts of the Computational Theory of Intelligence (CTI) by extending concepts to include computational processes in terms of Genetic Algorithms (GA’s) and Turing Machines (TM’s). Active, Passive, and Hybrid Computational Intelligence processes are also introduced and discussed. We consider the ramifications of the assumptions of CTI with regard to the qualities of reproduction and virility. Applications to Biology, Computer Science and Cyber Security are also discussed.
文摘The present study aims at improving the ability of the canonical genetic programming algorithm to solve problems, and describes an improved genetic programming (IGP). The proposed method can be described as follows: the first inves-tigates initializing population, the second investigates reproduction operator, the third investigates crossover operator, and the fourth investigates mutation operation. The IGP is examined in two domains and the results suggest that the IGP is more effective and more efficient than the canonical one applied in different domains.
文摘This paper proposes a Genetic Programming based algorithm that can be used to design optimal controllers. The proposed algorithm will be named a Multiple Basis Function Genetic Programming (MBFGP). Herein, the main ideas concerning the initial population, the tree structure, genetic operations, and other proposed non-genetic operations are discussed in details. An optimization algorithm called numeric constant mutation is embedded to strengthen the search for the optimal solutions. The results of solving the optimal control for linear as well as nonlinear systems show the feasibility and effectiveness of the proposed MBFGP as compared to the optimal solutions which are based on numerical methods. Furthermore, this algorithm enriches the set of suboptimal state feedback controllers to include controllers that have product time-state terms.
文摘Increasing demand for a fast and reliable face recognition technology has obliged researchers to try and examine different pattern recognition schemes. But until now, Genetic Programming (GP), acclaimed pattern recognition, data mining and relation discovery methodology, has been neglected in face recognition literature. This paper tries to apply GP to face recognition. First Principal Component Analysis (PCA) is used to extract features, and then GP is used to classify image groups. To further improve the results, a leveraging method is also utilized. It is shown that although GP might not be efficient in its isolated form, a leveraged GP can offer results comparable to other Face recognition solutions.