Recursive neuro fuzzy techniques for online identification and control

Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores

Data fusion with computational intelligence techniques: a case study of fuzzy inference for terrain assessment

Dissertação apresentada para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Unfuzzying fuzzy parsing

Dissertação de Mestrado em Engenharia Informática

Fuzzy maintenance costs of a wind turbine pitch control device

This paper deals with the problem of estimation maintenance costs for the case of the pitch controls system of wind farms turbines. Previous investigations have estimated these costs as (traditional) “crisp” values, simply ignoring the uncertainty nature of data and information available. This paper purposes an extended version of the estimation model by making use of the Fuzzy Set Theory. The results alert decision-makers to consequent uncertainty of the estimations along with their overall level, thus improving the information given to the mainte-nance support system.

Recurrence relations for Clifford algebra-valued orthogonal polynomials

The theory of orthogonal polynomials of one real or complex variable is well established as well as its generalization for the multidimensional case. Hypercomplex function theory (or Clifford analysis) provides an alternative approach to deal with higher dimensions. In this context, we study systems of orthogonal polynomials of a hypercomplex variable with values in a Clifford algebra and prove some of their properties.

From software extensions to product lines of dataflow programs

Abstract Dataflow programs are widely used. Each program is a directed graph where nodes are computations and edges indicate the flow of data. In prior work, we reverse-engineered legacy dataflow programs by deriving their optimized implementations from a simple specification graph using graph transformations called refinements and optimizations. In MDE-speak, our derivations were PIM-to-PSM mappings. In this paper, we show how extensions complement refinements, optimizations, and PIM-to-PSM derivations to make the process of reverse engineering complex legacy dataflow programs tractable. We explain how optional functionality in transformations can be encoded, thereby enabling us to encode product lines of transformations as well as product lines of dataflow programs. We describe the implementation of extensions in the ReFlO tool and present two non-trivial case studies as evidence of our work’s generality

Semigroup operators and applications

Dissertação de mestrado em Matemática

Fuzzy-Clusteranalyse : Methoden zur Exploration von Daten mit fehlenden Werten sowie klassifizierten Daten

Fuzzy-Clusteranalyse, Fuzzy-Datenanlayse

Objective function based fuzzy clustering in air traffic management

Data analysis, fuzzy clustering, fuzzy rules, air traffic management

Partially supervised learning of fuzzy classification rules

Fuzzy classification, semi-supervised learning, data mining

Data-driven system identification via evolutionary retrieval of Takagi-Sugeno fuzzy models

Systemidentification, evolutionary automatic, data-driven model, fuzzy Takagi-Sugeno grammar, genotype interpretability, toxicity-prediction

Representations of lattice point sets : theory, algorithms, applications

Magdeburg, Univ., Fak. für Mathematik, Habil.-Schr., 2006

Non-classical error bounds in the central limit theorem

The classical central limit theorem states the uniform convergence of the distribution functions of the standardized sums of independent and identically distributed square integrable real-valued random variables to the standard normal distribution function. While first versions of the central limit theorem are already due to Moivre (1730) and Laplace (1812), a systematic study of this topic started at the beginning of the last century with the fundamental work of Lyapunov (1900, 1901). Meanwhile, extensions of the central limit theorem are available for a multitude of settings. This includes, e.g., Banach space valued random variables as well as substantial relaxations of the assumptions of independence and identical distributions. Furthermore, explicit error bounds are established and asymptotic expansions are employed to obtain better approximations. Classical error estimates like the famous bound of Berry and Esseen are stated in terms of absolute moments of the random summands and therefore do not reflect a potential closeness of the distributions of the single random summands to a normal distribution. Non-classical approaches take this issue into account by providing error estimates based on, e.g., pseudomoments. The latter field of investigation was initiated by work of Zolotarev in the 1960's and is still in its infancy compared to the development of the classical theory. For example, non-classical error bounds for asymptotic expansions seem not to be available up to now ...

Lattice point inequalities and face numbers of polytopes in view of central symmetry

Magdeburg, Univ., Fak. für Mathematik, Diss., 2012