Wolfgang Golubski

Fuzzy regression: a genetic programming approach

Given some data pairs (X~/sub i/, Y~/sub i/), 1/spl les/i/spl les/k, of fuzzy numbers, we are interested in finding a fuzzy function F which best fits the given data. Because of fuzzy arithmetic, we cannot compute a fuzzy function with F(X~/sub i/)=Y~/sub i/ for all i, as in the crisp case. Therefore, we used a genetic programming approach to find a suitable fuzzy function. We present some tests and argue that this method is quite suitable for obtaining a fuzzy function which can explain the given data.

Theoretical and empirical results on dynamic load balancing in an object-based distributed environment

We present theoretical and empirical investigations to explore the potential of dynamic load balancing for homogeneous systems. We introduce the object-based programming environment MOM. Then we define an own load balancing algorithm called Gating and compare it with other well known algorithms, theoretically, in a simulation and in the MOM system. The obtaining results are discussed.

A complete semantics for SMALLTALK-80

In this paper we introduce a formal model of the object-oriented programming language SMALLTALK-80. The model can be useful for different applications in the framework of language design and implementation like compiter or interpreter generation, correctness proofs of the implementations, and standardization of the language.

Genetic Programming: A Parallel Approach

In this paper we introduce a parallel master-worker model for genetic programming where the master and each worker have their own equal-sized populations. The workers execute in parallel starting with the same population and are synchronized after a given interval where all worker populations are replaced by a new one. The proposed model will be applied to symbolic regression problems. Test results on two test series are presented.

New Results on Fuzzy Regression by Using Genetic Programming

In this paper we continue the work on symbolic fuzzy regression problems. That means that we are interested in finding a fuzzy function f, which best matches given data pairs (Xi, Yi) 1 ? i ? k of fuzzy numbers. We use a genetic programming approach for finding a suitable fuzzy function and will present test results about linear, quadratic and cubic fuzzy functions.

SOLAT-a Simple Object-Oriented Language Analyzing Tool

Static program analysis, like data-flow analysis, is of central importance for enabling efficient implementations of object-oriented languages. The authors present a tool called SOLAT (Simple Object-Oriented Language Analyzing Tool) which can handle various program analyses in an unique framework. They describe, as an example of program analysis, a type analysis based on interprocedural data-flow analysis and show its benefits by empirical results. Furthermore, SOLAT provides a graphical interface to manage the results obtained by type analysis and can therefore be successfully used as an annotation or debugging tool during program development.

Tree-Stack Automata

We introduce a new model of stack automata, the “tree-stack automata,” extending the linear stack to a tree-stack. A main subject of our investigations is to explore the relationship between tree-stack automata and stack automata. The main result of this paper is that tree-stack have the same recognition power as stack-pushdown automata, another (well-known) extension of stack automata. Therefore we obtain that the class of languages accepted by the one-way (linear) stack automata is a proper subset of the class of languages accepted by the one-way tree-stack automata and that two-way tree-stack automata have the same recognition power as two-way (linear) stack automata. As a special case of tree-stack automata we consider tree-pushdown automata. As opposed to stack automata the tree-pushdown storage does not extend the recognition power of one-way (resp. two-way) pushdown automata.