Measures to prevent portable ladder accidents in the construction industry

Abstract

Ladder accidents account for nearly 5% of all reported occupational accidents in the Swedish construction industry. Eighty-five ladder accident victims were interviewed to obtain detailed information about factors contributing to their accidents. Accidents were almost equally divided between straight ladders (N = 39) and step- ladder (N = 33). The majority of accidents occurred while the victim was working from the ladder. Climbing up and, particularly, down straight ladders was associated with numerous accidents. For straight ladders, sliding at the base was the most common event preceding the injury. Low angle of inclination was a common contributing factor. For step-ladders, tipping sideways was the most common preceding event. Misstepping the final step while descending accounted for 10% of all accidents. More than 90% of the victims fell from less than 4 m. The interviews provided detailed information which served as a basis for proposals for alternatives to portable ladders; a step-scaffold adjustable for work at levels up to 3 m and a portable scaffold for work at levels of 1–3 m. These alternatives are under development. In addition, proposals for improving the stability of current portable ladders are made.     

Use of portable ladders – field observations and self-reported safety performance in the cable TV industry

Abstract

Portable ladders incidents remain a major cause of falls from heights. This study reported field observations of environments, work conditions and safety behaviour involving portable ladders and their correlations with self-reported safety performance. Seventy-five professional installers of a company in the cable and other pay TV industry were observed for 320 ladder usages at their worksites. The participants also filled out a questionnaire to measure self-reported safety performance. Proper setup on slippery surfaces, correct method for ladder inclination setup and ladder secured at the bottom had the lowest compliance with best practices and training guidelines. The observation compliance score was found to have significant correlation with straight ladder inclined angle (Pearson’s r = 0.23, p < 0.0002) and employees’ self-reported safety participation (r = 0.29, p < 0.01). The results provide a broad perspective on employees’ safety compliance and identify areas for improving safety behaviours.

Practitioner Summary: A checklist was used while observing professional installers of a cable company for portable ladder usage at their worksites. Items that had the lowest compliance with best practices and training guidelines were identified. The results provide a broad perspective on employees’ safety compliance and identify areas for improving safety behaviours.     

Data parallel sorting for particle simulation

Sorting on a parallel architecture is a communications intensive event which can incur a high penalty in applications where it is required. In the case of particle simulation, only integer sorting is necessary, and sequential implementations easily attain the minimum performance bound of O(N) for N particles. Parallel implementations, however, have to cope with the parallel sorting problem which, in addition to incurring a heavy communications cost, can make the minimum performance bound difficult to attain. This paper demonstrates how the sorting problem in a particle simulation can be reduced to a merging problem, and describes an efficient data parallel algorithm to solve this merging problem in a particle simulation. The new algorithm is shown to be optimal under conditions usual for particle simulation, and its fieldwise implementation on the Connection Machine is analysed in detail. The new algorithm is about four times faster than a fieldwise implementation of radix sort on the Connection Machine.     

Shoulder muscle loading and task performance for overhead work on ladders versus Mobile Elevated Work Platforms

A high incidence of Musculoskeletal Disorders (MSDs) has been reported in the construction sector. The use of ladders in the workplace has long been identified as a significant risk that can lead to workplace accidents. However, it is unclear if platform types have an effect on the physical risk factors for MSDs in overhead work. The aim of this study is to perform a pilot study on the effects of hand activity on both shoulder muscle loading and task performance while working on ladders versus Mobile Elevated Working Platforms (MEWPs). It is hypothesised that work on ladders would result in greater muscle loading demands, increased levels of discomfort, and reduced performance due to the restrictions on postures that could be adopted. A field study (n = 19) of experienced electricians on a construction site found that workers spent approximately 28% of their working time on ladders versus 6% on MEWPs. However, the durations of individual tasks were higher on MEWPs (153 s) than on ladders (73 s). Additionally, maximum levels of perceived discomfort (on a VAS 0–100) were reported for the shoulders (27), neck (23), and lower regions of the body (22). A simulated study (n = 12) found that task performance and discomfort were not significantly different between platform types (ladder vs. MEWP) when completing either of three tasks: cabling, assembly and drilling. However, platform and task had significant effects (p < 0.05) on median electromyographic (EMG) activity of the anterior deltoid and upper trapezius. EMG amplitudes were higher for the deltoid than the upper trapezius. For the deltoid, the peak amplitudes were, on average, higher for ladder work over MEWP work for the hand intensive cabling (32 vs. 27% Maximal Voluntary Exertion (MVE)) and the assembly task (19 vs. 6% MVE). Conversely, for drilling, the peak EMG amplitudes were marginally lower for ladder compared to the MEWP (3.9 vs. 5.1% MVE). The general implication was that working on the MEWP involved lower shoulder muscle loading for cabling and assembly task. A difference due to platform type was not present for drilling work.     

Ergonomic design interventions – a case study involving portable ladders

Portable ladders are one of the most ancient tools conceived by man. They remain ubiquitous and indispensable even today. It is interesting to note that there is little difference between the makeshift portable ladders used throughout history and some still used today. The design of portable ladders seems to have simply evolved, rather than been subject to formal design process, including ergonomic criteria. An analysis of 277 fatalities associated with ladders was conducted to describe the pattern of ladder fatalities and identify and assess ergonomic design controls. All ladder fatalities analysed were found to contain multiple human, equipment (ladder) and environmental causative factors. It is hypothesized that significant gains with regard to reducing future fatalities can be achieved by applying ergonomic design principles to ladders to accommodate predictable and undesirable human behaviour. Without effective future change, the only prediction that can be made is that the pattern of ladder fatalities will simply continue.     

Ergonomic design interventions--a case study involving portable ladders

Portable ladders are one of the most ancient tools conceived by man. They remain ubiquitous and indispensable even today. It is interesting to note that there is little difference between the makeshift portable ladders used throughout history and some still used today. The design of portable ladders seems to have simply evolved, rather than been subject to formal design process, including ergonomic criteria. An analysis of 277 fatalities associated with ladders was conducted to describe the pattern of ladder fatalities and identify and assess ergonomic design controls. All ladder fatalities analysed were found to contain multiple human, equipment (ladder) and environmental causative factors. It is hypothesized that significant gains with regard to reducing future fatalities can be achieved by applying ergonomic design principles to ladders to accommodate predictable and undesirable human behaviour. Without effective future change, the only prediction that can be made is that the pattern of ladder fatalities will simply continue.     

Lower bounds for sorting on mesh-connected architectures

Summary Lower bounds for sorting on mesh-connected arrays of processors are presented. For sorting N=n₁ n ₂...n _r elements on an n ₁×n₂×... ×n _r array 2(n ₁+...+n _r–1)+n _r data interchange steps are needed asymptotically. For two dimensions these bounds are asymptotically best possible provided that n ₁ and n ₂ are powers of 2. In this case the generalized s ²-way merge sort of Thompson and Kung turns out to be asymptotically optimal. The minimal asymptotic bound of 2 2N interchange steps can be obtained only by sorting algorithms suitable for N/2×2N meshes. For r3 dimensions an analysis of aspect-ratios also demonstrates that there exist mesh-connected architectures which are better suited for sorting than simple r-dimensional cubes.This work was done at the Institut für Informatik und Praktische Mathematik, University of Kiel, Federal Republic of Germany     

An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system

Optical interconnections attract many engineers and scientists’ attention due to their potential for gigahertz transfer rates and concurrent access to the bus in a pipelined fashion. These unique characteristics of optical interconnections give us the opportunity to reconsider traditional algorithms designed for ideal parallel computing models, such as PRAMs. Since the PRAM model is far from practice, not all algorithms designed on this model can be implemented on a realistic parallel computing system. From this point of view, we study Cole’s pipelined merge sort [Cole R. Parallel merge sort. SIAM J Comput 1988;14:770–85] on the CREW PRAM and extend it in an innovative way to an optical interconnection model, the LARPBS (Linear Array with Reconfigurable Pipelined Bus System) model [Pan Y, Li K. Linear array with a reconfigurable pipelined bus system—concepts and applications. J Inform Sci 1998;106;237–58]. Although Cole’s algorithm is optimal, communication details have not been provided due to the fact that it is designed for a PRAM. We close this gap in our sorting algorithm on the LARPBS model and obtain an O(log N)-time optimal sorting algorithm using O(N) processors. This is a substantial improvement over the previous best sorting algorithm on the LARPBS model that runs in O(log N log log N) worst-case time using N processors [Datta A, Soundaralakshmi S, Owens R. Fast sorting algorithms on a linear array with a reconfigurable pipelined bus system. IEEE Trans Parallel Distribut Syst 2002;13(3):212–22]. Our solution allows efficiently assign and reuse processors. We also discover two new properties of Cole’s sorting algorithm that are presented as lemmas in this paper.     

A Framework for Simple Sorting Algorithms on Parallel Disk Systems

In this paper we present a simple parallel sorting algorithm and illustrate its application in general sorting, disk sorting, and hypercube sorting. The algorithm (called the (l,m) -mergesort (LMM)) is an extension of the bitonic and odd—even mergesorts. Literature on parallel sorting is abundant. Many of the algorithms proposed, though being theoretically important, may not perform satisfactorily in practice owing to large constants in their time bounds. The algorithm presented in this paper has the potential of being practical. We present an application to the parallel disk sorting problem. The algorithm is asymptotically optimal (assuming that N is a polynomial in M , where N is the number of records to be sorted and M is the internal memory size). The underlying constant is very small. This algorithm performs better than the disk-striped mergesort (DSM) algorithm when the number of disks is large. Our implementation is as simple as that of DSM (requiring no fancy data structures or prefetch techniques.) As a second application, we prove that we can get a sparse enumeration sort on the hypercube that is simpler than that of the classical algorithm of Nassimi and Sahni [16]. We also show that Leighton's columnsort algorithm is a special case of LMM. Online publication December 26, 2000.     

Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness

   Abstract. We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all distinct. Letting N be the number of elements in the input list, we prove a lower bound of (1/π )(ln(N )-1) accesses to the list elements for ordered searching, a lower bound of Ω(N logN ) binary comparisons for sorting, and a lower bound of

A Wait-Free Sorting Algorithm

Sorting is one of a set of fundamental problems in computer science. In this paper we present the first wait-free algorithm for sorting an input array of size N using P ≤ N processors to achieve optimal running time. We show two variants of the algorithm, one deterministic and one randomized, and prove that, with high probability, the latter suffers no more than contention when run synchronously. Known sorting algorithms, when made wait-free through previously established transformation techniques, have complexity O(log ³ N) . The algorithm we present here, when run in the CRCW PRAM model, executes with high probability in O(log N) time when P=N , and O((Nlog N)/P) otherwise, which is optimal amongst comparison-based sorting algorithms. The wait-free property guarantees that the sort will complete despite any delays or failures incurred by the processors. This is a very desirable property from an operating systems point of view, since it allows oblivious thread scheduling as well as thread creation and deletion, without fear of losing the algorithm's correctness. Received May 15, 1998, and in revised form November 17, 1999. Online publication November 19, 2001.     

Effects of foot placement,hand positioning,age and climbing biodynamics on ladder slip outcomes

Ladder falls frequently cause severe injuries; yet the factors that influence ladder slips/falls are not well understood. This study aimed to quantify (1) the effects of restricted foot placement, hand positioning, climbing direction and age on slip outcomes, and (2) differences in climbing styles leading to slips versus styles leading to non-slips. Thirty-two occupational ladder users from three age groups (18–24, 25–44 and 45–64 years) were unexpectedly slipped climbing a vertical ladder, while being assigned to different foot placement conditions (unrestricted vs. restricted toe clearance) and different hand positions (rails vs. rungs). Constraining foot placement increased the climber's likelihood of slipping (p < 0.01), while younger and older participants slipped more than the middle-aged group (p < 0.01). Longer double stance time, dissimilar and more variable foot and body positioning were found in styles leading to a slip. Maintaining sufficient toe clearance and targeting ladder safety training to younger and older workers may reduce ladder falls.

Practitioner Summary: Ladder falls frequently cause severe occupational fall injuries. This study aims to identify safer ladder climbing techniques and individuals at risk of falling. The results suggest that ladders with unrestricted toe clearance and ladder climbing training programmes, particularly for younger and older workers, may reduce ladder slipping risk.     

Introspective Sorting and Selection Algorithms

Quicksort is the preferred in-place sorting algorithm in many contexts, since its average computing time on uniformly distributed inputs is Θ(N log N), and it is in fact faster than most other sorting algorithms on most inputs. Its drawback is that its worst-case time bound is Θ(N²). Previous attempts to protect against the worst case by improving the way quicksort chooses pivot elements for partitioning have increased the average computing time too much – one might as well use heapsort, which has a Θ(N log N) worst-case time bound, but is on the average 2–5 times slower than quicksort. A similar dilemma exists with selection algorithms (for finding the i-th largest element) based on partitioning. This paper describes a simple solution to this dilemma: limit the depth of partitioning, and for subproblems that exceed the limit switch to another algorithm with a better worst-case bound. Using heapsort as the ‘stopper’ yields a sorting algorithm that is just as fast as quicksort in the average case, but also has an Θ(N log N) worst case time bound. For selection, a hybrid of Hoare's FIND algorithm, which is linear on average but quadratic in the worst case, and the Blum–Floyd–Pratt–Rivest–Tarjan algorithm is as fast as Hoare's algorithm in practice, yet has a linear worst-case time bound. Also discussed are issues of implementing the new algorithms as generic algorithms, and accurately measuring their performance in the framework of the C+:+ Standard Template Library. ©1997 by John Wiley & Sons, Ltd.     

Communication-Efficient Sorting Algorithms on Reconfigurable Array of Processors With Slotted Optical Buses

The reconfigurable array with slotted optical buses (RASOB) has recently received a lot of attention from the research community. In this paper, we first discuss the reconfiguration methods and communication capabilities of the RASOB architecture. Then, we use this architecture for the implementation of efficient sorting algorithms on the 1D RASOB and the 2D RASOB. Our parallel sorting algorithm on the 1D RASOB is based on an efficient divide-and-conquer scheme. It sortsNdata items usingNprocessors inO(k) communication cycles where k is the size of the data items to be sorted in bits. We further develop a parallel sorting algorithm on the 2D RASOB based on the sorting algorithm on the 1D RASOB in conjunction with the well known Rotatesort algorithm. Similarly, this algorithm sortsNdata items on a 2D RASOB of sizeNinO(k) communication cycles. These sorting algorithms are much more efficient than state-of-the-art sorting algorithms on reconfigurable arrays of processors withelectronicbuses using the same number of processors.     

A New and Faster Gaussian Elimination Based Fault Tolerant Systolic Linear System Solver

This paper presents a new systolic algorithm for thecompletesolution of a system ofNlinear equations in (N²/2 +O(N)) time steps using 2Nprocessing elements (PEs). It is based on a variant of the Gaussian elimination (GE) algorithm called the successive GE and is faster than any existing GE based algorithm usingO(N) PEs. We also suggest two fault tolerant schemes that tolerate up toNPE failures. The first scheme is a time redundancy based approach with no hardware overhead and 100% time overhead. This scheme can tolerate up toNPE failures. The second scheme is based on algorithm based fault tolerance (ABFT) and usesNextra PEs to tolerate up toN− 1 PE failures with very little time overhead. The number of errors that can be detected/corrected in both schemes is more than that in any existing fault tolerant systolic array.     

Fast computation of sample entropy and approximate entropy in biomedicine

Both sample entropy and approximate entropy are measurements of complexity. The two methods have received a great deal of attention in the last few years, and have been successfully verified and applied to biomedical applications and many others. However, the algorithms proposed in the literature require O(N²) execution time, which is not fast enough for online applications and for applications with long data sets. To accelerate computation, the authors of the present paper have developed a new algorithm that reduces the computational time to O(N^3/2)) using O(N) storage. As biomedical data are often measured with integer-type data, the computation time can be further reduced to O(N) using O(N) storage. The execution times of the experimental results with ECG, EEG, RR, and DNA signals show a significant improvement of more than 100 times when compared with the conventional O(N²) method for N = 80,000 (N = length of the signal). Furthermore, an adaptive version of the new algorithm has been developed to speed up the computation for short data length. Experimental results show an improvement of more than 10 times when compared with the conventional method for N > 4000.     

Examining joint loading and self-reported exertion and discomfort during ladder handling

Ladder handling by telecommunications technicians represents an indispensable part of their daily work, but may generate musculoskeletal injury risk. These workers have a high prevalence of shoulder and back injuries, motivating research to quantify postures and loading using different ladders during common handling tasks. Twenty-five participants completed carry, raise (against a wall or free standing), and simulated removal from a van roof tasks using three ladders (8.5m 2-piece wood; 8.5m 2-piece fibreglass, 9.2m 3-piece wood). Data collection included kinematics and kinetics during these ladder handling tasks, as well as perceived discomfort, perceived exertion and post-collection ladder and task preferences. Significant effects depended on task and ladder. Dominant arm (the arm completing the primary action) elevation was higher while extending the ladder (114.7 ± 3.4°) than the carry task (53.5 ± 3.5°) (p < 0.05). Joint moments in the dominant shoulder and trunk were highest for the 2-piece wood ladder (59.0 ± 2.2 Nm and 254.8 ± 8.8 Nm) averaged across all tasks. Joint forces were increased when using the 2-piece wood ladder compared to the 3-piece wood ladder (p < 0.05), while the greatest discomfort in the shoulders occurred using the 2-piece wood ladder in the carry task. Many tasks approached or exceeded strength capability of a 50th percentile male's predicted strength. While no ladder universally mitigated physical demands while lowering perceptual difficulty, construction differences yielded trends toward preferring the 2-piece fibreglass or 3-piece wood ladders over the 2-piece wood ladder. This work has direct relevance to workplaces with ladder handling and provides recommendations for ladder selection and strength requirements across tasks.     

An efficient external sorting with minimal space requirement

An efficient external sorting algorithm with minimal space requirement is presented in this article. The average number of passes over the data is approximately 1 +Ln(N + 1)/4B, whereN is the number of records in the file to be sorted, andB is the buffer size. The external storage requirement is only the file itself, no additional disk space is required. The internal storage requirement is four buffers: two for input, and two for output. The buffer size can be adjusted to the available memory space. A stack of size log₂ N is also required.This work was partially supported by a fellowship and grant from Western Michigan University.     

Changes in Subsidiary Reaction Time and Heart-Rate During Car Driving,Passenger Travel and Stationary Conditions*

Distinction can be drawn between three types of letter sorting machines and these types can also be used to classify other kinds of machine and task. In one type (‘paced ’) the speed of operation is set by the machine : in another (‘ unpaced’) the speed is determined by the operator's own actions, and in a third (‘ lagged ’) the speed is determined by the operator, but a minimum time (a ‘ time lag ’) has to elapse between one operation and the next. The performance of 7 operators on a lagged letter sorting machine was observed over a period of 9 months. Records were taken of mean sorting rate, and of the distribution of sorting times. Practice effects are shown to have been continuing at the end of this period, and it is argued that the distribution of sorting times has been affected by the machine' lag.

By assuming a distribution that would be expected if there were no lag, tables are presented which estimate what the sorting rate would be (a) if there were no log at all, (b) for different values of lag and (c) for different values of paced rate.     

Fast deterministic selection on mesh-connected processor arrays

We present a deterministic algorithm for selecting the element of rankk amongN=n ² elements, 1kN, on ann×n mesh-connected processor array in 1.45n parallel computation steps, using constant-sized queues (for large enoughn). This is a considerable improvement over the best previous deterministic algorithm, which was based upon sorting and requires2n+o(n) steps. Our algorithm can be generalized to solve the problem of selection on higher-dimensional meshes. In particular, we present an algorithm for the three-dimensional mesh which achieves a time bound better than any of the previously known deterministic results.This research was done while all three authors were at the University of Rochester, New York.