نتایج جستجو برای: singed distance
تعداد نتایج: 238359 فیلتر نتایج به سال:
It has been hypothesized that Om mutability in Drosophila ananassae (involving spontaneous mutation at 20 loci, resulting in semidominant, nonpleiotropic eye morphology defects) was due to insertion of a transposable element, tom. One particularly unstable X-linked Om allele produced several derivatives, one of which has a more extreme Om phenotype and was accompanied by a singed bristle mutant...
A mixture of positive (friendly) and negative (antagonistic) relations exist among users in most social media applications. However, many such applications do not allow users to explicitly express the polarity of their interactions. As a result most research has either ignored negative links or was limited to the few domains where such relations are explicitly expressed (e.g. Epinions trust/dis...
The Single Instruction, Multiple Data (SIMD) architecture enables to compute in parallel on a single processor. The SIMD operations are implemented on some processors such as Pentium 3/4, Athlon, SPARC, and even on smart cards. This paper proposes efficient algorithms for assembling an elliptic curve addition (ECADD), doubling (ECDBL), and k-iterated ECDBL (k-ECDBL) with SIMD operations. Using ...
let $g$ be a connected graph with vertex set $v(g)$. the degree resistance distance of $g$ is defined as $d_r(g) = sum_{{u,v} subseteq v(g)} [d(u)+d(v)] r(u,v)$, where $d(u)$ is the degree of vertex $u$, and $r(u,v)$ denotes the resistance distance between $u$ and $v$. in this paper, we characterize $n$-vertex unicyclic graphs having minimum and second minimum degree resista...
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
target tracking is the tracking of an object in an image sequence. target tracking in image sequence consists of two different parts: 1- moving target detection 2- tracking of moving target. in some of the tracking algorithms these two parts are combined as a single algorithm. the main goal in this thesis is to provide a new framework for effective tracking of different kinds of moving target...
there is no doubt that human being needs to become integrated with industry and industry needs to be progressed, daily. on the other hand, serious events in industrial units specially in oil industries has been shown that such damages and events are industry related ones. the consequence of such events and damages which resulted in chemical and poisoned explosions and loss of life and property ...
a set $s$ of vertices in a graph $g=(v,e)$ is called a total$k$-distance dominating set if every vertex in $v$ is withindistance $k$ of a vertex in $s$. a graph $g$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (g - x) < gamma_{t}^{k}(g)$ for any vertex $xin v(g)$. in this paper,we investigate some results on total $k$-distance domination-critical of graphs.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید