A team approach in the comprehensive management of children on a general paediatric ward is described. The team comprises paediatricians, nurses, a child psychiatrist, and a social worker, with a psychologist, play-leader, and teachers making important contributions. In this way members of the team learn from each other, and the paediatrician in training gains valuable experience about the mana...

This study explored e-learning problems and solutions reported by 223 students with disabilities, 58 campus disability service providers, 28 professors, and 33 e-learning professionals from Canadian colleges and universities. All four groups indicated, via online questionnaires, problems with: accessibility of websites and course/learning management systems (CMS); accessibility of digital audio...

Lemma 2.2. It suffices to find disjoint L,R ∈ V such that they are (1) Large in Ω(n), or more formally stated, |L||R| ≥ α(n). (2) ∆-separated for ∆ = Ω( 1 logn) Let us define what ∆-separated means so that we can formalize this notion of “farness”. Recall that a distance from a vertex i to a set S is defined as d(i, S) = minj∈S d(i, j) (distance to the closest point in the set) and a distance f...

This article presents a case study of play therapy with an emotionally disturbed abused child. The article discusses the intuitive and individualized approach to the world of the abused child (conceptualized as a "cultured of one") in which the nurse therapist's role is to develop a trusting relationship with the child. Distance between the nurse's world and that of the abused child can be brid...

We study a class of geometric stabbing/covering problems for sets of line segments, rays, and lines in the plane. While we demonstrate that the problems on sets of horizontal/vertical line segments are NP-complete, we show that versions involving (parallel) rays or lines are polynomially solvable.

Consider the symmetric group Sn equipped with the Hamming metric dH . Packing and covering problems in the finite metric space (Sn, dH) are surveyed, including a combination of both.

Finding the closest or farthest line segment (line) from a point are fundamental proximity problems. Given a set S of n points in the plane and another point q, we present optimal O(n logn) time, O(n) space algorithms for finding the closest and farthest line segments (lines) from q among those spanned by the points in S. We further show how to apply our techniques to find the minimum (maximum)...

Classical” optimization problems depending on a probability measure (and corresponding to many applications) belong mostly to a class of nonlinear deterministic optimization problems that are (from the numerical point of view) relatively complicated. On the other hand, these problems fulfill very often “suitable” mathematical properties guaranteing the stability (w.r.t probability measure) and ...

Drug-drug interactions (DDIs) are defined as clinically meaningful alterations in the exposure and response to a drug (called object drug) that has occurred as a result of the co-administration of another drug (called precipitant drug). According a 2011 study, drug-drug interactions (DDIs) are responsible for roughly 220,000 hospital admissions per year (Percha and Altman 2013). However, this n...