نتایج جستجو برای: strong binary relation
تعداد نتایج: 762501 فیلتر نتایج به سال:
a necessary and sufficient condition in terms of lower cut sets are given for the insertion of a $gamma-$continuous function between two comparable real-valued functions.
the concept of -semihypergroups is a generalization of semigroups, a generalization of semihypergroups and a generalization of -semigroups. in this paper, we study the concept of semiprime ideals in a -semihypergroup and prove some results. also, we introduce the notion of -hypergroups and closed -subhypergroups. finally, we study the concept of -semihypergroups associated to binary...
The concept of algebraic hyperstructures introduced by Marty as a generalization of ordinary algebraic structures. In an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. The concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyperrings and a generalizat...
heteropoly acids (hpa) and their salts have advantages as catalysts which make them both economically and environmentally attractive, strong br?nsted acidity, exhibiting fast reversible multi-electron redox transformations under rather mild conditions, very high solubility in polar solvents, fairly high thermal stability in the solid states, and efficient oxidizing ability, so that they are imp...
it is well known fact that binary relations are generalized mathematical functions. contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. some basic operations on functions such as the inverse and composition are applicable to binary relations as well. depending on the domain or range or both are fuzzy value fuzzy set, i...
In this note we nd the exact solution for the minimal recurrence S n = min bn=2c k=1 faS n?k + bS k g; where a and b are positive integers and a b. We prove that the solution is the same as that of the recurrence relation S n = aS dn=2e + bS bn=2c. In other words, S n = S 1 +(a+b?1)S 1 P n?1 i=1 a z(i) b blg nc?z(i) , where z(i) is the number of zeros in the binary representation of i. The proo...
We consider a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this family of meta-Fibonacci sequences and two families of related sequences we derive ordinary generating functions and recurrence relations. Included in these fami...
It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...
Further results on MAP optimality and strong consistency of certain classes of morphological filters
Morphological openings and closings can be viewed as consistent MAP estimators of smooth random binary image signals immersed in i.i.d. clutter, or suffering from i.i.d. random dropouts. We revisit this viewpoint under much more general assumptions and show that, quite surprisingly, the above interpretation is still valid.
the concept of algebraic hyperstructures introduced by marty as a generalization of ordinary algebraic structures. in an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. the concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyper rings and a generalizat...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید