The use of treatment theories and procedures for postural control in adult with hemiplegia: A national survey

This study investigated the use of treatment theories and procedures for postural control training used by Occupational Therapists (OTs) when working with hemiplegic adults who have had cerebrovascular accident (CVA) or traumatic brain injury (TBI). The method of data collection was a national survey of 400 randomly selected physical disability OTs with 127 usable surveys returned. Results showed that the most common used treatment theory was neurodevelopmental treatment (NDT), followed by motor relearning program (MRP), proprioceptive neuromuscular facilitation (PNF), Brunnstrom's approach, and the approach of Rood. The most common treatment posture used was sitting, followed by standing, mat activity, equilibrium reaction training, and walking. The factors affecting the use of various treatment theories procedures were years certified, years of clinical experience, work situation and work status. Pearson correlation coefficient analyses found significant positive relationships between treatment theories and postures. There were significant high correlations between usage of all pairs of treatment procedures. ^

Management Training Theories: Tools for Hospitality Managers and Trainers

Management training in the hospitality industry is as important as employee training. There are a number of effective models and approaches for training effective managers. The author reviews these models and offers guidelines for maximizing the results from each of these approaches.

Solving satisfiability, *implication, and equivalence problems in database systems

Satisfiability, implication and equivalence problems are important and widely-encountered database problems that need to be efficiently and effectively solved. We provide a comprehensive and systematic study of these problems. We consider three popular types of arithmetic inequalities, (X op C), (X op Y), and (X op Y + C), where X and Y are attributes, C is a constant of the domain of X, and op $\in\ \{{<},\ {\le},\ {=},\ {\not=},\ {>},\ {\ge}\}.$ These inequalities are most frequently used in a database system, since the first type of inequalities represents $\theta$-join, the second type represents selection, and the third type is popular in deductive databases. We study the problems under the integer domain and the real domain, as well as under two different operator sets.^ Our results show that solutions under different domains and/or different operator sets are quite different. In this dissertation, we either report the first necessary and sufficient conditions as well as their efficient algorithms with complexity analysis, or provide improved algorithms. ^