in order to have better insight of project characteristics, different kinds of fuzzy analysis for project networks have been recently proposed, most of which consider activities duration as the main and only source of imprecision and vagueness, but as it is usually experienced in real projects, the structure of the network is also subject to changes. in this paper we consider three types of imp...

The shapes of terms used in fuzzy systems have adopted several ‘conventions’. Terms are almost invariably normalised (having a maximum membership value of 1), convex (having a single maximum or plateau maxima) and distinct (being restricted in their degree of overlap: often expressed as some variation on the concept that all membership values at any point in the universe of discourse sum to 1 a...

In this paper, characterizations of the degree to which a mapping $mathcal{T} : L^{X}longrightarrow M$ is an $(L, M)$-fuzzy topology are studied in detail.What is more, the degree to which an $L$-subset is an $L$-open set with respect to $mathcal{T}$ is introduced.Based on that, the degrees to which a mapping $f: Xlongrightarrow Y$ is continuous,open, closed or a quotient mapping with respect t...

Every lattice is the complete join of all its one-element sublattices. In this paper we address the question: Which lattices L have the property that L is finitely join reducible in SubL? That is, when do there exist proper sublattices A, B such that L = A∨B? In particular, could it be that every nontrivial lattice has this property, in which case every element of SubL would be finitely join re...

Let L be a finite distributive lattice. Let Sub0(L) be the lattice {S | S is a sublattice of L} ∪ {∅} and let ∗[Sub0(L)] be the length of the shortest maximal chain in Sub0(L). It is proved that if K and L are non-trivial finite distributive lattices, then ∗[Sub0(K × L)] = ∗[Sub0(K)] + ∗[Sub0(L)]. A conjecture from the 1984 Banff Conference on Graphs and Order is thus proved. 1 Motivation Let L...

we show that the lattice of all ideals of a ring $r$ can be embedded in the lattice of all its fuzzyideals in uncountably many ways. for this purpose, we introduce the concept of the generalizedcharacteristic function $chi _{s}^{r} (a)$ of a subset $a$ of a ring $r$ forfixed $r , sin [0,1] $ and show that $a$ is an ideal of $r$ if, and only if, its generalizedcharacteristic function $chi _{s}^{...

based on credibilistic value-at-risk (cvar) of regularfuzzy variable, we introduce a new cvar reduction method fortype-2 fuzzy variables. the reduced fuzzy variables arecharacterized by parametric possibility distributions. we establishsome useful analytical expressions for mean values and secondorder moments of common reduced fuzzy variables. the convex properties of second order moments with ...

Rene88 samples were investigated using atom probe tomography and x-ray diffraction using a monochromated synchrotron beam with different energy values to determine the preferred site occupancy of various alloying elements within the ordered γ’ precipitates. Samples were solutionized and cooled at 24 degree C/min with subsequent aging at 760 degrees C. The synchrotron-based x-ray diffraction res...

In this paper, firstly, we gain some basic properties and characterization theorems of the differential and local sub-differential of the fuzzy mapping, obtain an important result that the local sub-differential of fuzzy mapping is an empty set or a convex set. Secondly, we generalize the concept of local differentiability of fuzzy mapping, and obtain some basic properties about the concept. At...

This paper considers dissimilarity measures and clustering techniques for two special cases of set-defined objects: fuzzy granules and subsequence time series. To deal with clustering of such kind of objects, we propose two implementations that generalize the Fuzzy C-Means algorithm to granular feature spaces. Granular computing is a paradigm oriented towards capturing and processing meaningful...