INTUITIVE AND INTERACTIVE BIOMECHANICAL ANALYSIS OF SPORT SKILLS

INTRODUCTION Historically, sport biomechanic laboratories have combined research based commercial software with inhouse programming to meet their requirements. Non-laboratory based independent researchers, teachers, coaches and students have had limited access to suitable and affordable computer based tools for general movement and sports skill analysis. Recent developments in multi-media computing, frame grabbing, and video technology have combined to make powerful desktop computer software feasible and the result has been a proliferation of research based and often hardware dependent computer tools which still leave a majority of teachers, students, coaches, and independent sport skill analysts with limited resources. On the other hand, it appears that computer software program, over time, tend to migrate to'wards a common-look, efficient, intuitive product such as found in word processing, spread sheet and data base management. A sharing of computer analysis approaches in s p a biomechanics will undoubtedly lead to improvements in available software which, in turn, will have a positive impact on research, teaching and learning. The object was to develop a general, portable; sport biomechanic computer analysis program. Fundamental requirements for the analysis program were initially developed. These included: a) window based intuitive, interactive environment, b) a teaching - learning focus, c) a full range of 'tools', from digitizing to processing and output, d) 'trail set up' information including collection point identification, segment parameter data, segment systems design and screen display models, c) calculation procedures, for example, absolute angles, relative angles, segment and system centers of gravity, velocities, accelerations, segment and system forces and moments, energy and momentum, and, d) model and graphics displays. Particular attention was focused on permitting flexible and productive analysis by fust time as well as experienced users. The program was developed and tested over many academic sessions with project and laboratory based classes. The program, in various stages of development, has been used by approximately 800 students over the past four years. In the current academic year the program forms the basis for both structured laboratoties and individual projects for classes totaling more than 300 students. At least 100 students complete their laboratory assignments or individual analyses on 'home' installations. CONCLUSIONS In the near future, sport biomechanic software will migrate towards a common 'look' and, minimally, stand-alone computer analysis programs will be available from CD or Internet sources

Rings and spirals in barred galaxies. I Building blocks

In this paper we present building blocks which can explain the formation and properties both of spirals and of inner and outer rings in barred galaxies. We first briefly summarise the main results of the full theoretical description we have given elsewhere, presenting them in a more physical way, aimed to an understanding without the requirement of extended knowledge of dynamical systems or of orbital structure. We introduce in this manner the notion of manifolds, which can be thought of as tubes guiding the orbits. The dynamics of these manifolds can govern the properties of spirals and of inner and outer rings in barred galaxies. We find that the bar strength affects how unstable the L1 and L2 Lagrangian points are, the motion within the 5A5A5Amanifold tubes and the time necessary for particles in a manifold to make a complete turn around the galactic centre. We also show that the strength of the bar, or, to be more precise, of the non-axisymmetric forcing at and somewhat beyond the corotation region, determines the resulting morphology. Thus, less strong bars give rise to R1 rings or pseudorings, while stronger bars drive R2, R1R2 and spiral morphologies. We examine the morphology as a function of the main parameters of the bar and present descriptive two dimensional plots to that avail. We also derive how the manifold morphologies and properties are modified if the L1 and L2 Lagrangian points become stable. Finally, we discuss how dissipation affects the manifold properties and compare the manifolds in gas-like and in stellar cases. Comparison with observations, as well as clear predictions to be tested by observations will be given in an accompanying paper.Comment: Typos corrected to match the version in press in MNRA

Evaluation of a wave-vector-frequency-domain method for nonlinear wave propagation

A wave-vector-frequency-domain method is presented to describe one-directional forward or backward acoustic wave propagation in a nonlinear homogeneous medium. Starting from a frequency-domain representation of the second-order nonlinear acoustic wave equation, an implicit solution for the nonlinear term is proposed by employing the Green’s function. Its approximation, which is more suitable for numerical implementation, is used. An error study is carried out to test the efficiency of the model by comparing the results with the Fubini solution. It is shown that the error grows as the propagation distance and step-size increase. However, for the specific case tested, even at a step size as large as one wavelength, sufficient accuracy for plane-wave propagation is observed. A two-dimensional steered transducer problem is explored to verify the nonlinear acoustic field directional independence of the model. A three-dimensional single-element transducer problem is solved to verify the forward model by comparing it with an existing nonlinear wave propagation code. Finally, backward-projection behavior is examined. The sound field over a plane in an absorptive medium is backward projected to the source and compared with the initial field, where good agreement is observed

Justifications in Constraint Handling Rules for Logical Retraction in Dynamic Algorithms

We present a straightforward source-to-source transformation that introduces justifications for user-defined constraints into the CHR programming language. Then a scheme of two rules suffices to allow for logical retraction (deletion, removal) of constraints during computation. Without the need to recompute from scratch, these rules remove not only the constraint but also undo all consequences of the rule applications that involved the constraint. We prove a confluence result concerning the rule scheme and show its correctness. When algorithms are written in CHR, constraints represent both data and operations. CHR is already incremental by nature, i.e. constraints can be added at runtime. Logical retraction adds decrementality. Hence any algorithm written in CHR with justifications will become fully dynamic. Operations can be undone and data can be removed at any point in the computation without compromising the correctness of the result. We present two classical examples of dynamic algorithms, written in our prototype implementation of CHR with justifications that is available online: maintaining the minimum of a changing set of numbers and shortest paths in a graph whose edges change.Comment: Pre-proceedings paper presented at the 27th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2017), Namur, Belgium, 10-12 October 2017 (arXiv:1708.07854

EffectiveSan: Type and Memory Error Detection using Dynamically Typed C/C++

Low-level programming languages with weak/static type systems, such as C and C++, are vulnerable to errors relating to the misuse of memory at runtime, such as (sub-)object bounds overflows, (re)use-after-free, and type confusion. Such errors account for many security and other undefined behavior bugs for programs written in these languages. In this paper, we introduce the notion of dynamically typed C/C++, which aims to detect such errors by dynamically checking the "effective type" of each object before use at runtime. We also present an implementation of dynamically typed C/C++ in the form of the Effective Type Sanitizer (EffectiveSan). EffectiveSan enforces type and memory safety using a combination of low-fat pointers, type meta data and type/bounds check instrumentation. We evaluate EffectiveSan against the SPEC2006 benchmark suite and the Firefox web browser, and detect several new type and memory errors. We also show that EffectiveSan achieves high compatibility and reasonable overheads for the given error coverage. Finally, we highlight that EffectiveSan is one of only a few tools that can detect sub-object bounds errors, and uses a novel approach (dynamic type checking) to do so.Comment: To appear in the Proceedings of 39th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI2018