نتایج جستجو برای: e open set
تعداد نتایج: 1961413 فیلتر نتایج به سال:
Visual counting, a task that aims to estimate the number of objects from an image/video, is open-set problem by nature as population can vary in $$[0,+\infty )$$ theory. However, collected data are limited reality, which means only closed set observed. Existing methods typically model this through regression, while they prone suffer unseen scenes with counts out scope set. In fact, counting has...
The government organizations in Africa, Asia and South America are adopting OSS solutions because of its low cost and availability of cheap skilled programmers in their countries to customize the software to their needs. In a study conducted to track the usage of OSS, it was found that OSS is extensively promoted in countries like India, China and Taiwan followed by South Korea, Malaysia, Singa...
A edge 2-rainbow dominating function (E2RDF) of a graph G is a function f from the edge set E(G) to the set of all subsets of the set {1,2} such that for any edge.......................
Let $G$ and $H$ be graphs. The tensor product $Gotimes H$ of $G$ and $H$ has vertex set $V(Gotimes H)=V(G)times V(H)$ and edge set $E(Gotimes H)={(a,b)(c,d)| acin E(G):: and:: bdin E(H)}$. In this paper, some results on this product are obtained by which it is possible to compute the Wiener and Hyper Wiener indices of $K_n otimes G$.
eCommerce is generally assumed to be an unequivocal benefit for regional areas. Drawing upon the globalisation literature and the experience in Australia as a case study, this paper questions whether eCommerce is an unequivocal benefit and suggests that at least in some cases eCommerce may lead to the increased import of goods and service into non-metropolitan regions and the domination of thes...
This paper examines power structures that make E-Commerce adoption amongst Small and Medium Enterprises in least developing countries a daunting task. The study adopts structuration theory as a lens, focusing specifically on structures of domination. The results indicate that at organizational level, lack of management support was the reason. However this was caused by government’s reluctance t...
For a given transitive binary relation e on a set E, the transitive closures of open (i.e., co-transitive in e) sets, called the regular closed subsets, form an ortholattice Reg(e), the extended permutohedron on e. This construction, which contains the poset Clop(e) of all clopen sets, is a common generalization of known notions such as the generalized permutohedron on a partially ordered set o...
let $g$ be a finite group and $pi_{e}(g)$ be the set of element orders of $g $. let $k in pi_{e}(g)$ and $s_{k}$ be the number of elements of order $k $ in $g$. set nse($g$):=${ s_{k} | k in pi_{e}(g)}$. in this paper, it is proved if $|g|=|$ pgl$_{2}(q)|$, where $q$ is odd prime power and nse$(g)= $nse$($pgl$_{2}(q))$, then $g cong $pgl$_
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید