let g be a (p, q) graph. let k be an integer with 2 ≤ k ≤ p and f from v (g) to the set {1, 2, . . . , k} be a map. for each edge uv, assign the label |f(u) − f(v)|. the function f is called a k-difference cordial labeling of g if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...

Let G be a (p,q) graph and A be a group. We denote the order of an element $a in A $ by $o(a).$  Let $ f:V(G)rightarrow A$ be a function. For each edge $uv$ assign the label 1 if $(o(f(u)),o(f(v)))=1 $or $0$ otherwise. $f$ is called a group A Cordial labeling if $|v_f(a)-v_f(b)| leq 1$ and $|e_f(0)- e_f(1)|leq 1$, where $v_f(x)$ and $e_f(n)$ respectively denote the number of vertices labelled w...

BACKGROUND Accurate quantification in molecular imaging is essential to improve the assessment of novel drugs and compare the radiobiological effects of therapeutic agents prior to in-human studies. The aim of this study was to investigate the challenges and feasibility of pre-clinical quantitative imaging and mouse-specific dosimetry of 111In-labelled radiotracers. Attenuation, scatter and par...

This vignette describes the functionality implemented in the MSnbase package. MSnbase aims at (1) facilitating the import, processing, visualisation and quantification of mass spectrometry data into the Renvironment [1] by providing specific data classes and methods and (2) enabling the utilisation of throughput-high data analysis pipelines provided by the Bioconductor [2] project.

Current person re-identification (re-id) methods assume that (1) pre-labelled training data are available for every camera pair, (2) the gallery size for re-identification is moderate. Both assumptions scale poorly to real-world applications when camera network size increases and gallery size becomes large. Human verification of automatic model ranked re-id results becomes inevitable. In this w...

We present an algorithm for omputing the pre x of an automaton. Automata onsidered are non-deterministi , labelled on words, and an have "-transitions. The pre x automaton of an automaton A has the following hara teristi properties. It has the same graph as A. Ea h a epting path has the same label as in A. For ea h state q, the longest ommon pre x of the labels of all paths going from q to an i...

The biliary excretion and blood/plasma ratios of four novel 5-bromo-6-alkoxy- 5,6-dihydro prodrugs to S-ethyl-2'-deoxyuridine (EDU) including (-)-trans-(5S, 6S)-S-bromo-S-ethyl-6-methoxy-S, 6-dihydro-2'-deoxyuridine (BMEDU), (+ )-trans( SR, 6R)-S-bromo-S-ethyl-6-ethoxy-S, 6-deoxyuridine (BEEDU), (+ )-trans-(SR, 6R)-5-bromo-5-ethyl-6-ethoxy -S, 6-dihydro-S '-O-valeryl-2 ':.deoxyuridine (VBE...