In this position paper, we argue that when we are looking for the best fuzzy logic, we should specify in what sense the best, and that we get different fuzzy logics as “the best” depending on what optimality criterion we use.

Given Ω,Λ ⊂ R two bounded open sets, and f and g two probability densities concentrated on Ω and Λ respectively, we investigate the regularity of the optimal map ∇φ (the optimality referring to the Euclidean quadratic cost) sending f onto g. We show that if f and g are both bounded away from zero and infinity, we can find two open sets Ω′ ⊂ Ω and Λ′ ⊂ Λ such that f and g are concentrated on Ω′ ...

From a conventional mathematical programming model, and in accordance with which fuzzification is used, several models of fuzzy mathematical programming problems can be obtained. This paper deals with the study of the optimality concept for (g,p)-fuzzified mathematical programming problems. An auxiliary parametric mathematical programming problem is presented which allows the above model to be ...

The register allocation problem for an imperative program is often modelled as the coloring problem of the interference graph of the control-ow graph of the program. The interference graph of a ow graph G is the intersection graph of some connected subgraphs of G. These connected subgraphs represent the lives, or life times, of variables, so the coloring problem models that two variables with o...

This paper considers the problem of the design and analysis of experiments for comparing several treatments with a control when heterogeneity is to be eliminated in two directions. A class of row-column designs which are balanced for treatment vs. control comparisons (referred to as the balanced treatment vs. control row-column or BTCRC designs) is proposed. These designs are analogs of the so-...

We define a discrete Laplace-Beltrami operator for simplicial surfaces (Definition 16). It depends only on the intrinsic geometry of the surface and its edge weights are positive. Our Laplace operator is similar to the well known finite-elements Laplacian (the so called “cotan formula”) except that it is based on the intrinsic Delaunay triangulation of the simplicial surface. This leads to new ...

this paper aims at describing the mechanism of german loanwords adaptation with respect to constraints of persian language and within ot framework. consequently the adaptation of consonant clusters and diphthongs as well as the phonemes substituted in loanwords will be examined. prince and smolensky’s (1993) optimality theory with its key notions of faithfulness and markedness constraints is su...

The register allocation problem for an imperative program is often modelled as the coloring problem of the interference graph of the control-ow graph of the program. The interference graph of a ow graph G is the intersection graph of some connected subgraphs of G. These connected subgraphs represent the lives, or life times, of variables, so the coloring problem models that two variables with o...