Genetic programming and bacterial algorithm for neural networks and fuzzy systems design

In the field of control systems it is common to use techniques based on model adaptation to carry out control for plants for which mathematical analysis may be intricate. Increasing interest in biologically inspired learning algorithms for control techniques such as Artificial Neural Networks and Fuzzy Systems is in progress. In this line, this paper gives a perspective on the quality of results given by two different biologically connected learning algorithms for the design of B-spline neural networks (BNN) and fuzzy systems (FS). One approach used is the Genetic Programming (GP) for BNN design and the other is the Bacterial Evolutionary Algorithm (BEA) applied for fuzzy rule extraction. Also, the facility to incorporate a multi-objective approach to the GP algorithm is outlined, enabling the designer to obtain models more adequate for their intended use.

Genetic and bacterial programming for B-Spline neural networks design

The design phase of B-spline neural networks is a highly computationally complex task. Existent heuristics have been found to be highly dependent on the initial conditions employed. Increasing interest in biologically inspired learning algorithms for control techniques such as Artificial Neural Networks and Fuzzy Systems is in progress. In this paper, the Bacterial Programming approach is presented, which is based on the replication of the microbial evolution phenomenon. This technique produces an efficient topology search, obtaining additionally more consistent solutions.

Design of B-spline neural networks using a bacterial programming approach

The design phase of B-spline neural networks represents a very high computational task. For this purpose, heuristics have been developed, but have been shown to be dependent on the initial conditions employed. In this paper a new technique, Bacterial Programming, is proposed, whose principles are based on the replication of the microbial evolution phenomenon. The performance of this approach is illustrated and compared with existing alternatives.

Adaptive generalized predictive control algorithm implemented over an heterogeneous parallel architecture

In this paper a parallel implementation of an Adaprtive Generalized Predictive Control (AGPC) algorithm is presented. Since the AGPC algorithm needs to be fed with knowledge of the plant transfer function, the parallelization of a standard Recursive Least Squares (RLS) estimator and a GPC predictor is discussed here.

Adaptive generalized predictive control algorithm implemented over a DSP network

In this paper a parallel implementation of an Adaprtive Generalized Predictive Control (AGPC) algorithm is presented. Since the AGPC algorithm needs to be fed with knowledge of the plant transfer function, the parallelization of a standard Recursive Least Squares (RLS) estimator and a GPC predictor is discussed here.

Implementation of an daptive generalized predictive control algorithm over an heterogeneous parallel architecture

In this paper a parallel implementation of an Adaprtive Generalized Predictive Control (AGPC) algorithm is presented. Since the AGPC algorithm needs to be fed with knowledge of the plant transfer function, the parallelization of a standard Recursive Least Squares (RLS) estimator and a GPC predictor is discussed here.

Parallel implementation of an adaptive generalized predictive control algorithm

The Adaptive Generalized Predictive Control (AGPC) algorithm can be speeded up using parallel processing. Since the AGPC algorithm needs to be fed with the knowledge of the plant transfer function, the parallelization of a standard Recursive Least Squares (RLS) estimator and a GPC predictor is discussed here.

A computational study of a parallel Branch and Bound algorithm for the quadratic 0-1 programming problem on transputers

Discrete optimization problems are very difficult to solve, even if the dimantion is small. For most of them the problem of finding an ε-approximate solution is already NP-hard.

Parallel implementation of an adaptive generalized predictive control algorithm

The Adaptive Generalized Predictive Control (GPC) algorithm can be speeded up using parallel processing. Since the GPC algorithm needs to be fed with knowledge of the plant transfer function, the parallelization of a standard Recursive Least Squares (RLS) estimator and a GPC predictor is discussed here.

Methodological aspects of a mathematical programming model to evaluate soil tillage technologies in a risky environment

In this work we develop a methodology for the economic evaluation of soil tillage technologies, in a risky environment, and to capture the influence of farmer behaviour on his technology choice. The model has short-term activities, that change with the type of year, and long-term activities, in which sets of traction investment activities are included. Although these activities do not change with the type of year, they lead to different availability of resources for each type of year, since the same tractor has different available fieldwork days under different weather conditions. We prove that the model is sensitive to the greater income variability resulting from the use of alternative technologies and to the balance between income and risk, accounting for the probability of occurrence of each state of nature and giving an investment solution that considers the best production plan for each type of year. (c) 2005 Elsevier B.V. All rights reserved.

Early nutritional programming in fish: tailoring the metabolic use of dietary carbohydrates

Tese de doutoramento, Ciências da Vida, do Mar, da Terra e do Ambiente (Nutrição), Faculdade de Ciências e Tecnologia, Universidade do Algarve, 2015