A biomechanical analysis of the farmers walk, and comparison with the deadlift and unloaded walk

This study compared the biomechanical characteristics of the farmers walk, deadlift and unloaded walk. Six experienced male strongman athletes performed farmers' walks and deadlifts at 70% of their 1RM deadlift. Significant differences (p < 0.05) were apparent at knees passing with the farmers lift demonstrating greater trunk extension, thigh angle, knee flexion and ankle dorsiflexion. Significantly greater mean vertical and anterior forces were observed in the farmers lift than deadlift. The farmers walk demonstrated significantly greater peak forces and stride rates and significantly shorter stride lengths, ground contact times, and swing times than unloaded walk. Significantly greater dorsiflexion, knee flexion, thigh angle, and significantly lesser trunk angle at foot strike were also observed in the farmers walk. The farmers lift may be an effective lifting alternative to the deadlift, to generating more anterior-propulsive and vertical force with less stress to the lumbar spine due to the more vertical trunk position

E-Learning Methods as a Driver for the Internationalisation of Web Development Courses

Over the past decade, as software development has moved from a platform specific, desktop based software approach to a web focused environment, the ability to develop courses for wider delivery has increased. At the same time university courses have undergone major changes in teaching mode, with an expectation that online versions of teaching materials should be delivered as readily and to the same quality as in-class materials. This paper examines how the re-development of course materials to support online (off-campus) students as well as on campus students provides an opportunity to deliver those same materials to overseas partners. This is brought about by the need to select programming environments that are readily available to online students, along with detailed learning materials that allow online students to work at the same level of detail as on campus students. The integration of freely available and easily configurable development environments and teaching/assessment items based on those environments provide the opportunity for international teaching partners to support both their staff and students. This support comes from not having to rely on expensive, difficult to configure software systems, and by providing learning materials that are written specifically for those environments, so that both configuration and use of the environments form core elements of the teaching process. Examples of this process from a number of web programming are discussed in the paper, as are the results from both the local and international perspective

Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms

There has been significant progress in understanding the parallelism inherent to iterative sequential algorithms: for many classic algorithms, the depth of the dependence structure is now well understood, and scheduling techniques have been developed to exploit this shallow dependence structure for efficient parallel implementations. A related, applied research strand has studied methods by which certain iterative task-based algorithms can be efficiently parallelized via relaxed concurrent priority schedulers. These allow for high concurrency when inserting and removing tasks, at the cost of executing superfluous work due to the relaxed semantics of the scheduler. In this work, we take a step towards unifying these two research directions, by showing that there exists a family of relaxed priority schedulers that can efficiently and deterministically execute classic iterative algorithms such as greedy maximal independent set (MIS) and matching. Our primary result shows that, given a randomized scheduler with an expected relaxation factor of $k$ in terms of the maximum allowed priority inversions on a task, and any graph on $n$ vertices, the scheduler is able to execute greedy MIS with only an additive factor of poly($k$) expected additional iterations compared to an exact (but not scalable) scheduler. This counter-intuitive result demonstrates that the overhead of relaxation when computing MIS is not dependent on the input size or structure of the input graph. Experimental results show that this overhead can be clearly offset by the gain in performance due to the highly scalable scheduler. In sum, we present an efficient method to deterministically parallelize iterative sequential algorithms, with provable runtime guarantees in terms of the number of executed tasks to completion.Comment: PODC 2018, pages 377-386 in proceeding

Evolution of a Database Security course: using non-enterprise teaching tools

This paper examines the issues in delivering a university unit of teaching in database security, examining problems in database environment selection and the ability to provide hands on training for students via oncampus and online modes. Initial problems with Linux and then Windows based enterprise database environments prompted the adoption of Microsoft Access as a database tool that was easier to deliver in-class and online. Though Access is file based and has fundamental flaws in its security implementation (within the enterprise context) it can be tweaked to emulate RDBMS level security, allowing students to see how a properly designed security model should operate. The paper shows that Microsoft Access can emulate field-level security with a correctly designed table and user model, but that the database itself should only be used to ‘show and tell’ security implementations, not apply them