Let V be a finite set of order v. A (v,k,A.) covering design of index A. and block size k is a collection of k-element subsets, called blocks, such that every 2-subset of V occurs in at least '}.. blocks. The covering problem is to determine the minimum number of blocks, a (v, k, A.), in a covering design. It is well known that a(v,k''}..)Lr~~=~'}..ll=(v,k,A.), where rxl is the smallest integer

Parent training (PT) is an evidence-based treatment for reducing and preventing child conduct problems and abusive parenting. However, questions have been raised about the dissemination of PT to culturally diverse families who hold different views on childrearing. Group PT was applied in two Chinese immigrant families illustrating strategies for addressing potential cultural barriers. The Incre...

It is known that optimal stopping problems for controlled diffusion processes can be transformed into optimal control problems by using the method of randomized stopping (see [2] and [8]). Since only a few optimal stopping problems can be solved analytically (see [13]), one has to resort to numerical approximations of the solution. In such cases, one would like to know the rate of convergence o...

BACKGROUND Recurrent throat problems in children are common and have an impact on the family. The appropriateness of surgery will depend on both clinical and social factors. OBJECTIVES The aim of this study was to assess the impact on the whole family when a child is suffering from recurrent throat problems, and investigate related parental attitudes. METHODS A total of 1190 parents of chil...

Following previous theoretical work by Srinivasan (FOCS 2001) and the first author (STACS 2006) and a first experimental evaluation on random instances (ALENEX 2009), we investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algorithmic problems, namely low-congestion routing in n...

0