In this paper, we define the notions of fuzzy congruence relations and fuzzy convex subalgebras on a commutative residuated lattice and we obtain some related results. In particular, we will show that there exists a one to one correspondence between the set of all fuzzy congruence relations and the set of all fuzzy convex subalgebras on a commutative residuated lattice. Then we study fuzzy...

In this paper, we propose a new method for fuzzy numbers. In this method, we assume that Ai= (ai1, ai2, ai3, ai4) is to be a fuzzy number. So, the convex combination of ai1 and ai2 and also the convex combination of ai3 and ai4 are obtained separately. Then, Mic and Mis that are to be the convex combinations and the standard deviation respectively we acquire them from these components. Finally,...

Jonathan M. Borwein1, Xianfu Wang August 13, 1999 ABSTRACT. We prove a \typi al" subdi erentiability prin iple and apply it to a variety of omplete metri spa es of ontinuous fun tions on separable Bana h spa es; so as to obtain existen e of fun tions with maximal subdi erentials when ordered by in lusion. The relationship between ontinuous fun tions with maximal subdi erentials and nowhere mono...

the rational cubic function with three parameters has been extended to rational bi-cubic function to visualize the shape of regular convex surface data. the rational bi-cubic function involves six parameters in each rectangular patch. data dependent constraints are derived on four of these parameters to visualize the shape of convex surface data while other two are free to refine the shape of s...

in this note we first redefine the notion of a fuzzy hypervectorspace (see [1]) and then introduce some further concepts of fuzzy hypervectorspaces, such as fuzzy convex and balance fuzzy subsets in fuzzy hypervectorspaces over valued fields. finally, we briefly discuss on the convex (balanced)hull of a given fuzzy set of a hypervector space.

It is well-known that many business administration decision problems can be formulated as optimization problems. There are well over four hundred algo rithms to solve such problems. However, these algorithms are custom-made for each specific type of problem. This has lead to classification of problems, such as linear, fractional, quadratic, convex and non-convex programs. This paper pres ents a...

We formulate an algebra of binary tem poral relations between events the number of occurrences of which is unknown but which are known to recur in time Onto logically we view the temporal domain of recurring events as a set of convex in tervals of unknown cardinality Thus an explicit declarative representation of time adequate to solve reasoning problems in volving recurring events indicates a ...

knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering  in which there is no need to  be peculiar about how to select initial values. due to properly converting the task of optimization to an equivalent...

10 This paper addresses the optimal design and planning of sustainable chemical supply 11 chains (SCs) in the presence of uncertainty in the damage model used to evaluate 12 their environmental performance. The environmental damage is assessed through 13 the Eco-indicator 99, which includes recent advances made in Life Cycle Assess14 ment (LCA). The overall problem is formulated as a bi-criteri...

‎In this paper‎, ‎we study the convex combinations of harmonic mappings obtained by shearing a class of slit conformal mappings‎. ‎Sufficient conditions for the convex combinations of harmonic mappings of this family to be univalent and convex in the horizontal direction are derived‎. ‎Several examples of univalent harmonic mappings constructed by using these methods are presented to illustrate...