نتایج جستجو برای: set functions
تعداد نتایج: 1098038 فیلتر نتایج به سال:
In this paper, we define and study the notion of the real-valued functions on a frame $L$. We show that $F(L) $, consisting of all frame homomorphisms from the power set of $mathbb{R}$ to a frame $ L$, is an $f$-ring, as a generalization of all functions from a set $X$ into $mathbb R$. Also, we show that $F(L) $ is isomorphic to a sub-$f$-ring of $mathcal{R}(L)$, the ring of real-valued continu...
let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...
objective : executive functions refer to a group of higher-order cognitive processes responsible for self-regulated and targeted behaviors. this study aimed to investigate the effects of age and gender on executive functions focusing on three distinct areas of attentional control, planning and set-shifting among18-80 year-old healthy subjects. materials and methods: this cross-sectional study e...
In this paper, we consider reinitializing level functions through equation /tþ sgnð/Þðkr/k 1Þ 1⁄4 0 [16]. The method of Russo and Smereka [11] is taken in the spatial discretization of the equation. The spatial discretization is, simply speaking, the second order ENO finite difference with subcell resolution near the interface. Our main interest is on the temporal discretization of the equation...
In this technical report, we aim to give a simple yet detailed analysis of several various submodular maximization algorithms. We start from analyzing the classical greedy algorithm, firstly discussed by Nemhauser et al. (1978), that guarantees a tight bound for constrained maximization of monotonically submodular set functions. We then continue by discussing two randomized algorithms proposed ...
The aim of this paper is to introduce and study the notions of fuzzy upper $e$-limit set, fuzzy lower $e$-limit set and fuzzy $e$-continuously convergent functions. Properties and basic relationships among fuzzy upper $e$-limit set, fuzzy lower $e$- limit set and fuzzy $e$-continuity are investigated via fuzzy $e$-open sets.
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید