An L(h,k)-labeling of a graph G is an assignment non-negative integers to the vertices such that if two u and v are adjacent then they receive labels differ by at least h, when not but there two-hop path between them, k. The span λ labeling difference largest smallest vertex assigned. Let λhk ( )denote admits L(h,k) -labeling using from {0,1,...λ}. A Cayley group called circulant order n, isomo...

Introduction: The use of radiopharmaceuticals is a powerful tool in the management of patients with infectious or inflammatory diseases in nuclear medicine. In this study ofloxacin as a second-generation fluoroquinolone is used to design a desired infection imaging agent after labeling with 99mTc via direct labeling. Methods: Ofloxacin was radiolabeled with 99mTc using di...

Although multiple neuroimaging studies suggest that affect labeling (i.e., putting feelings into words) can dampen affect-related responses in the amygdala, the consequences of affect labeling have not been examined in other channels of emotional responding. We conducted four studies examining the effect of affect labeling on self-reported emotional experience. In study one, self-reported distr...

Graph labeling is considered as one of the most interesting areas in graph theory. A for a simple G (numbering or valuation), an association non -negative integers to vertices G  (vertex labeling) edges (edge both them. In this paper we study graceful k- uniform hypertree and define condition corresponding tree be graceful. if minimum difference vertices’ labels each edge dis...

introduction: the use of radiopharmaceuticals is a powerful tool in the management of patients with infectious or inflammatory diseases in nuclear medicine. in this study ofloxacin as a second-generation fluoroquinolone is used to design a desired infection imaging agent after labeling with 99mtc via direct labeling. methods: ofloxacin was radiolabeled with 99mtc using different concentrations ...

in this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. let g = (v,e) be a graph with p vertices and q edges. g is said be skolem odd difference mean if there exists a function f : v (g) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : e(g) → {1, 3, 5, . . . , 2q−1} d...

Zebrin II (aldolase C) is expressed in a subset of Purkinje cells in the mammalian and avian cerebella such that there is a characteristic parasagittal organization of zebrin-immunopositive stripes alternating with zebrin-immunonegative stripes. Zebrin is expressed not only in the soma and dendrites of Purkinje cells but also in their axonal terminals. Here we describe the distribution of zebri...

Although deficits in facial affect processing have been reported in schizophrenia as well as in borderline personality disorder (BPD), these disorders have not yet been directly compared on facial affect labeling. Using degraded stimuli portraying neutral, angry, fearful and angry facial expressions, we hypothesized more errors in labeling negative facial expressions in patients with schizophre...

In sequence labeling, using higher order features leads to high inference complexity. A lot of studies have been conducted to address this problem. In this paper, we propose a new exact decoding algorithm under the assumption that weights of all higher order features are non-negative. In the worst case, the time complexity of our algorithm is quadratic on the number of higher order features. Co...

for a given graph $g=(v,e)$, let $mathscr l(g)={l(v) : vin v}$ be a prescribed list assignment. $g$ is $mathscr l$-$l(2,1)$-colorable if there exists a vertex labeling $f$ of $g$ such that $f(v)in l(v)$ for all $v in v$; $|f(u)-f(v)|geq 2$ if $d_g(u,v) = 1$; and $|f(u)-f(v)|geq 1$ if $d_g(u,v)=2$. if $g$ is $mathscr l$-$l(2,1)$-colorable for every list assignment $mathscr l$ with $|l(v)|geq k$ ...