نتایج جستجو برای: l r fuzzy variable

تعداد نتایج: 1299774  

Journal: :Mathematical and Computer Modelling 2011
Shuming Wang Junzo Watada

Keywords: Fuzzy variable Independence Operation t-norm Convergence Law of large numbers a b s t r a c t T-independence of fuzzy variables is a more general concept than the classical independence. The objective of this study is to deal with some new properties of T-independent fuzzy variables. First of all, for any general t-norm, some criteria of T-independence are discussed for fuzzy variable...

Journal: :Journal of High Energy Physics 2009

Journal: :Int. J. Approx. Reasoning 1988
Singiresu S. Rao

s 107 ultimate moment); and productivity Ip = (/mat + /man + It)/Iman. Practically, for the fuzzification process (/mat, Ir,a,, It, and Ia are interpreted as fuzzy goals and Isi and Ip as fuzzy constraints), an exponential membership function lk = e -klxl (where k is the importance coefficient) is proposed. Thus by this procedure, the optimal investment is alternative a3, and the hierarchizatio...

Journal: :Int. J. Approx. Reasoning 1988
Elke A. Rundensteiner Lois Wright Hawkes Wyllis Bandler

s 107 ultimate moment); and productivity Ip = (/mat + /man + It)/Iman. Practically, for the fuzzification process (/mat, Ir,a,, It, and Ia are interpreted as fuzzy goals and Isi and Ip as fuzzy constraints), an exponential membership function lk = e -klxl (where k is the importance coefficient) is proposed. Thus by this procedure, the optimal investment is alternative a3, and the hierarchizatio...

Journal: :iranian journal of fuzzy systems 2005
m. m. zahedi m. r. khorashadi-zadeh

in this note by considering a complete lattice l, we define thenotion of an l-fuzzy hyperrelation on a given non-empty set x. then wedefine the concepts of (pom)l-fuzzy graph, hypergraph and subhypergroupand obtain some related results. in particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (pom)l-fuzzy subhypergroups ...

2014
Mehmet Şahin Necati Olgun F. Talay Ali Karakuş

and Applied Analysis 3 3. Main Results Throughout this paper, we will consider lattices as complete lattices,X will denote space, and μ is a membership function of any fuzzy set X. Definition 3.1. If m : σ L → R ∪ {∞} satisfies the following properties, then m is called a lattice measure on the lattice σ-algebra σ L . i m ∅ L0. ii For all f, g ∈ σ L such that m f , m g ≥ L0 : f ≤ g ⇒ m f ≤ m g ...

2010
Yankui Liu Xiaoli Wu

This paper adopts the spread of fuzzy variable as a new criteria in practical risk management problems, and develops a novel fuzzy expectation-spread (E-S) model for portfolio optimization problem. Since the spread is defined by Lebesgue-Stieltjes (L-S) integral, its computation for general fuzzy variables is a challenge issue for research, and usually depends on approximation scheme and soft c...

2014
T. Srinivasarao P. Mallikarajunarao

This paper presents a power flow algorithm to carry out load flow by analysing uncertainties. The proposed algorithm is compared with Fuzzy arithmetic to deal the effect of uncertainity. The proposed method is Interval load flow i.e. Interval Improved Fast Decoupled Power Flow (IIFDPF) that considers input parameters as interval variables and considered method is trapezoidal method have been em...

Journal: :iranian journal of fuzzy systems 0
anatolij dvurecenskij mathematical institute, slovak academy of sciences, stefanikova 49, sk-814 73 bratislava, slovakia and depart. algebra geom, palacky univer., 17. listopadu 12, cz-771 46 olomouc, czech republic omid zahiri university of applied science and technology, tehran, iran

the paper deals with special types of $l$-ordered sets, $l$-fuzzy complete lattices, and fuzzy directed complete posets.first, a theorem for constructing monotone maps is proved, a characterization for monotone maps on an $l$-fuzzy complete lattice is obtained, and it's proved that if $f$ is a monotone map on an $l$-fuzzy complete lattice $(p;e)$, then the least fixpoint of $f$ is meet of ...

2001
Harvey M. Friedman

The main powerful method for establishing termination of term rewriting systems was discovered by Nachum Dershowitz through the introduction of certain natural well founded orderings (lexicographic path orderings). This leads to natural decision problems which may be of the highest computational complexity of any decidable problems appearing in a natural established computer science context. 1....

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید