An Interactive Model to Teach Motor Skills

There has been a tremendous increase in our knowledge of hum motor performance over the last few decades. Our theoretical understanding of how an individual learns to move is sophisticated and complex. It is difficult however to relate much of this information in practical terms to physical educators, coaches, and therapists concerned with the learning of motor skills (Shumway-Cook & Woolcott, 1995). Much of our knowledge stems from lab testing which often appears to bear little relation to real-life situations. This lack of ecological validity has slowed the flow of information from the theorists and researchers to the practitioners. This paper is concerned with taking some small aspects of motor learning theory, unifying them, and presenting them in a usable fashion. The intention is not to present a recipe for teaching motor skills, but to present a framework from which solutions can be found. If motor performance research has taught us anything, it is that every individual and situation presents unique challenges. By increasing our ability to conceptualize the learning situation we should be able to develop more flexible and adaptive responses to the challege of teaching motor skills. The model presented here allows a teacher, coach, or therapist to use readily available observations and known characteristics about a motor task and to conceptualize them in a manner which allows them to make appropriate teaching/learning decisions.

Parallel nonconvex generalized Benders decomposition for natural gas production network planning under uncertainty

A scenario-based two-stage stochastic programming model for gas production network planning under uncertainty is usually a large-scale nonconvex mixed-integer nonlinear programme (MINLP), which can be efficiently solved to global optimality with nonconvex generalized Benders decomposition (NGBD). This paper is concerned with the parallelization of NGBD to exploit multiple available computing resources. Three parallelization strategies are proposed, namely, naive scenario parallelization, adaptive scenario parallelization, and adaptive scenario and bounding parallelization. Case study of two industrial natural gas production network planning problems shows that, while the NGBD without parallelization is already faster than a state-of-the-art global optimization solver by an order of magnitude, the parallelization can improve the efficiency by several times on computers with multicore processors. The adaptive scenario and bounding parallelization achieves the best overall performance among the three proposed parallelization strategies.