نتایج جستجو برای: directional labeling
تعداد نتایج: 92666 فیلتر نتایج به سال:
Horizontal directional drilling (HDD) is widely used in soil and rock engineering. In a variety of conditions, it is necessary to estimate the torque required for performing the reaming operation. Nevertheless, there is not presently a convenient method to accomplish this task. In this paper, to overcome this difficulty based on the basic concepts of rock engineering systems (RES), a model for ...
In this paper we revisit the idea of pseudo-labeling in context semi-supervised learning where a algorithm has access to small set labeled samples and large unlabeled samples. Pseudo-labeling works by applying pseudo-labels using model trained on combination any previously pseudo-labeled samples, iteratively repeating process self-training cycle. Current methods seem have abandoned approach fav...
Radioimmunotherapy (RIT) of Non-Hodgkin’s lymphoma (NHL) is said to be more advantageous compared to unlabelled therapeutic antibodies. To this date, radiolabelled murine anti-CD20 mAbs, Zevalin® and Bexxar® have been approved for imaging and therapy. A preparation containing rituximab, chimeric mAb radioimmunoconjugate suitable for Lu-177 labeling, could provide better imaging and therapeutic ...
Let $G$ be a $(p,q)$ graph. Let $f:V(G)to{1,2, ldots, k}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $left|t_{f}(i)-t_{f}(j)right|leq 1$, $i,j in {1,2, cdots,k}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labelled with $x$. A graph with a $k$-total prime cordi...
Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an ...
Let $A$ be an abelian group. A graph $G=(V,E)$ is said to be $A$-barycentric-magic if there exists a labeling $l:E(G)longrightarrow Asetminuslbrace{0}rbrace$ such that the induced vertex set labeling $l^{+}:V(G)longrightarrow A$ defined by $l^{+}(v)=sum_{uvin E(G)}l(uv)$ is a constant map and also satisfies that $l^{+}(v)=deg(v)l(u_{v}v)$ for all $v in V$, and for some vertex $u_{v}$ adjacent t...
The improvement in speech recognition in noise obtained with directional microphones compared to omnidirectional microphones is referred to as the directional advantage. Laboratory studies have revealed substantial differences in the magnitude of the directional advantage across hearing-impaired listeners. This investigation examined whether persons who were successful users of directional micr...
Video analysis of crowded scenes is challenging due to the complex motion of individual people in the scene. The collective motion of pedestrians form a crowd flow, but individuals often largely deviate from it as they anticipate and react to each other. Deviations from the crowd decreases the pedestrian’s efficiency: a sociological concept that measures the difference of actual motion from the...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید