BACKGROUND Motivational interviewing (M.I.) is an option for modifying an individual's behavior. It is used as an educational method in recent years. The aim of our study was to indicate whether or not education, using lecture alone and lecture with M.I., would affect the performance of nursing personnel regarding their hand hygiene. If so, which of these two methods were most effective for thi...

Objective: To find out efficacy and benefits of early intervention of coma arousal therapy on coma patients after sustaining traumatic head injury. Materials and methods: Thirty comatose patients with traumatic head injury were systematic randomly selected. Both experimental group and control group were having 15 patients each. Patients in experimental group were given coma arousal therapy whil...

Two experiments were conducted to explore the effects of a sodium saccharin-based dietary sweetener (Sucram) on growth performance, health, and physiological responses of feedlot steers. In Exp. 1, 173 newly-received male calves purchased from auction barns were fed 0, 100, 200, or 300 g of Sucram/t of DM over 56 d. Overall, ADG and G:F (P > 0.10) were not different among treatments, but steers...

A many-to-many k-disjoint path cover of a graph joining two disjoint vertex subsets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. It is classified as paired if each source in S is required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we develop Ore-type sufficient conditions for the ...

Given a graph G, and two vertex sets S and T of size k each, a many-tomany k-disjoint path cover of G joining S and T is a collection of k disjoint paths between S and T that cover every vertex of G. It is classified as paired if each vertex of S must be joined to a designated vertex of T , or unpaired if there is no such constraint. In this article, we first present a necessary and sufficient ...

A many-to-many k-disjoint path cover (k-DPC for short) of a graph G joining the pairwise disjoint vertex sets S and T , each of size k, is a collection of k vertex-disjoint paths between S and T , which altogether cover every vertex of G. This is classified as paired, if each vertex of S must be joined to a specific vertex of T , or unpaired, if there is no such constraint. In this paper, we de...

In the study of paired comparisons (PC), items may be ranked or issues may be prioritized through subjective assessment of certain judges. PC models are developed and then used to serve the purpose of ranking. The PC models may be studied through classical or Bayesian approach. Bayesian inference is a modern statistical technique used to draw conclusions about the population parameters. Its bea...

Health-related quality of life (HRQoL) was examined in patients' and their respective spouses' perspectives five years after cardiac bypass surgery. Participants completed the Short-Form 36 (SF-36) which consists of eight domains and two component summary scores measuring physical and mental HRQoL (PCS and MCS respectively). Paired t tests were used to compare couples responses (n=56 pairs) wit...

This paper describes a more efficient paired comparison method that reduces the number of trials necessary for converting a table of paired comparisons into scaler data. Instead of comparing every pair of samples (the complete method), a partial method is used that makes more comparisons between closer samples than between more distant samples. A sorting algorithm is used to efficiently order t...