Participants tasted two cups of coffee, decided which they preferred, and then rated each coffee. They were told (in lure) that one of the cups contained "eco-friendly" coffee while the other did not, although the two cups contained identical coffee. In Experiments 1 and 3, but not in Experiment 2, the participants were also told which cup contained which type of coffee before they tasted. The ...

the rapidly expanding fields of pharmacogenomics and pharmacodiagnostics have presented the pathology laboratories with many challenges and opportunities. as custodians of patient tissues, these laboratories are in the logical position to perform biomolecular testing for proper management of patients. in order to meet these challenges, the pathology laboratories of the twenty-first century shou...

let $g=(v‎, ‎e)$ be a graph with $p$ vertices and $q$ edges‎. ‎an emph{acyclic‎ ‎graphoidal cover} of $g$ is a collection $psi$ of paths in $g$‎ ‎which are internally-disjoint and cover each edge of the graph‎ ‎exactly once‎. ‎let $f‎: ‎vrightarrow {1‎, ‎2‎, ‎ldots‎, ‎p}$ be a bijective‎ ‎labeling of the vertices of $g$‎. ‎let $uparrow!g_f$ be the‎ ‎directed graph obtained by orienting the...

background: gallium-66 (t1/2= 9.49 h) is an interesting radionuclide that has potential for positron emission tomography (pet) imaging of biological processes in intermediate to slow target tissue uptake. oxine has been labeled with this radioisotope in the form of [66ga]gallium chloride for its possible diagnostic properties. materials and methods: 66ga was produced in the 30 mev cyclotron (cy...

Abstract. The purpose of the study is to analyze and evaluate theoretical methodological approaches interpretation concept “organic food” its use in economic practice. objectives are: determine essence content food”; assessment practice labeling; identifying inherent internal contradictions relationship with other terms (“bioproduct”, “ecologically clean product”, “natural etc.). Methods. Metho...

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. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....