Adaptation and application of multi-objective evolutionary algorithms for rule reduction and parameter tuning of fuzzy rule-based systems

Recently, multi-objective evolutionary algorithms have been applied to improve the difficult tradeoff between interpretability and accuracy of fuzzy rule-based systems. It is known that both requirements are usually contradictory, however, these kinds of algorithms can obtain a set of solutions with different trade-offs. This contribution analyzes different application alternatives in order to attain the desired accuracy/interpr-etability balance by maintaining the improved accuracy that a tuning of membership functions could give but trying to obtain more compact models. In this way, we propose the use of multi-objective evolutionary algorithms as a tool to get almost one improved solution with respect to a classic single objective approach (a solution that could dominate the one obtained by such algorithm in terms of the system error and number of rules). To do that, this work presents and analyzes the application of six different multi-objective evolutionary algorithms to obtain simpler and still accurate linguistic fuzzy models by performing rule selection and a tuning of the membership functions. The results on two different scenarios show that the use of expert knowledge in the algorithm design process significantly improves the search ability of these algorithms and that they are able to improve both objectives together, obtaining more accurate and at the same time simpler models with respect to the single objective based approach.

---

Extension of domains of states

We deal with categorical aspects of the extensions of generalized probability measures. In particular, we study various domains of fuzzy sets, describe the relationships between σ-fields of crisp sets and generated Łukasiewicz tribes of measurable functions, and mention some probabilistic aspects. D-posets and sequential continuity play an important role. This work was supported by the Slovak Research and Development Agency under the contract No. APVV-0071-06, Protocol for Scientific and Technological Collaboration between the Republic of Italy and Slovak Republic, Project No. 15: Algebraic and Logical Systems of Soft Computing, and VEGA 2/6088/26.     

An artificial life approach to dense stereo disparity

This article presents an adaptive approach to improving the infection algorithm that we have used to solve the dense stereo matching problem. The algorithm presented here incorporates two different epidemic automata along a single execution of the infection algorithm. The new algorithm attempts to provide a general behavior of guessing the best correspondence between a pair of images. Our aim is to provide a new strategy inspired by evolutionary computation, which combines the behaviors of both automata into a single correspondence problem. The new algorithm will decide which automata will be used based on the transmission of information and mutation, as well as the attributes, texture, and geometry, of the input images. This article gives details about how the rules used in the infection algorithm are coded. Finally, we show experiments with a real stereo pair, as well as with a standard test bed, to show how the infection algorithm works.     

On the Black-Box Complexity of Sperner’s Lemma

We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over pseudo-manifolds of arbitrary dimension. The query complexity of our algorithm is linear in the separation number of the skeleton graph of the manifold and the size of its boundary. As a corollary we get an deterministic query algorithm for the black-box version of the problem 2D-SPERNER, a well studied member of Papadimitriou’s complexity class PPAD. This upper bound matches the deterministic lower bound of Crescenzi and Silvestri. The tightness of this bound was not known before. In another result we prove for the same problem an lower bound for its probabilistic, and an lower bound for its quantum query complexity, showing that all these measures are polynomially related. Research supported by the European Commission IST Integrated Project Qubit Application (QAP) 015848, the OTKA grants T42559 and T46234, and by the ANR Blanc AlgoQP grant of the French Research Ministry.     

Multicriteria decisions on interdependent infrastructure transportation projects using an evolutionary-based framework

When evaluating transportation infrastructure projects and determining which of them will be carried out from a set of projects and given a budget constraint, several criteria need to be considered in the decision. Standard evaluation practices imply the aggregation of impacts into one utility function which is later optimized. Nevertheless these techniques used for translation of different measuring units into monetary terms are highly controversial. Multicriteria techniques can explicitly deal with different measuring units, however, they are not suitable to model interdependence relationships of projects that share a common characteristic (same route, location or target population, for instance). In this research we model this transportation planning problem, the multi-objective transportation infrastructure project selection problem (MTIPSP), as a constrained multi-objective optimization problem with quadratic objective functions, using a variation of the multi-objective 0–1 knapsack problem plus some additional constraints. Given the combinatorial nature of the problem, an evolutionary-based framework is used for the identification of Pareto solutions, and later, those with non-attractive properties are filtered using a Knee Identification Procedure. The final selection of the projects portfolio is made using a well known multicriteria decision aid method and including the decision makers’ preferences based on the existing context.     

Efficient simulation of tissue-like P systems by transition cell-like P systems

In the framework of P systems, it is known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP-complete problems. Nonetheless, it could be sufficient to create an exponential number of membranes in polynomial time. Working with P systems whose membrane structure does not increase in size, it is known that it is not possible to solve computationally hard problems (unless P = NP), basically due to the impossibility of constructing exponential number of membranes, in polynomial time, using only evolution, communication and dissolution rules. In this paper we show how a family of recognizer tissue P systems with symport/antiport rules which solves a decision problem can be efficiently simulated by a family of basic recognizer P systems solving the same problem. This simulation allows us to transfer the result about the limitations in computational power, from the model of basic cell-like P systems to this kind of tissue-like P systems.     

An Interoperable Grid Information System for Integrated Resource Monitoring Based on Virtual Organizations

In many Grid infrastructures different kinds of information services are in use, which utilize different incompatible data structures and interfaces to encode and provide their data. Homogeneous monitoring of these infrastructures with the monitoring data being accessible everywhere independently of the middleware which provided it, is the basis for a consistent status reporting on the Grids’ resources and services. Thus, interoperability or interoperation between the different information services in a heterogeneous Grid infrastructure is required. Monitoring data must contain the identity of the affected Virtual Organization (VO) so that it can be related to the resources and services the VO has allocated to enable VO-specific information provision. This paper describes a distributed architecture for an interoperable information service, which combines data unification and categorization with policies for VO membership, VO resource management and data transformations. This service builds the basis for an integrated and interoperating monitoring of Grids, which provide their data to more than one VO and utilize heterogeneous information services.     

Acclimatization model of an aerobic bioreactor for the treatment of toxic wastewater

This work proposes a mathematical model for the acclimatization process of a bioreactor treating toxic wastewater. Experimental data was used to identify the changing kinetic parameters of the model as acclimatization progresses. It was found that only one key parameter, the specific biomass growth rate function, changed during the acclimatization process. Therefore, an acclimatization model was proposed to explain the changes of this parameter.     

AC electrokinetic pumping on symmetric electrode arrays

AC electro-osmotic (ACEO) pumping is experimentally demonstrated on a symmetric gold electrode array. Using asymmetric connection of electrodes to the applied AC voltage, spatial asymmetry along the array is created, which produces unidirectional flow of electrolyte. An aqueous solution of 100 μM KCl is selected as the pumping fluid. The liquid velocity obtained as a function of voltage and frequency is compared to that generated using travelling-wave electroosmosis (TWEO) with the same electrode array. The expected velocities from the linear electrokinetic models of ACEO and TWEO are computed numerically. The comparison shows that TWEO generates greater velocity amplitudes and the streamlines are smoother than those generated by ACEO.