Accurate placement of a pelvic binder improves reduction of unstable fractures of the pelvic ring

The aim of this study was to assess the accuracy of placement of pelvic binders and to determine whether circumferential compression at the level of the greater trochanters is the best method of reducing a symphyseal diastasis. Patients were identified by a retrospective review of all pelvic radiographs performed at a military hospital over a period of 30 months. We analysed any pelvic radiograph on which the buckle of the pelvic binder was clearly visible. The patients were divided into groups according to the position of the buckle in relation to the greater trochanters: high, trochanteric or low. Reduction of the symphyseal diastasis was measured in a subgroup of patients with an open-book fracture, which consisted of an injury to the symphysis and disruption of the posterior pelvic arch (AO/OTA 61-B/C). We identified 172 radiographs with a visible pelvic binder. Five cases were excluded due to inadequate radiographs. In 83 (50%) the binder was positioned at the level of the greater trochanters. A high position was the most common site of inaccurate placement, occurring in 65 (39%). Seventeen patients were identified as a subgroup to assess the effect of the position of the binder on reduction of the diastasis. The mean gap was 2.8 times greater (mean difference 22 mm) in the high group compared with the trochanteric group (p < 0.01). Application of a pelvic binder above the level of the greater trochanters is common and is an inadequate method of reducing pelvic fractures and is likely to delay cardiovascular recovery in these seriously injured patients.

A more efficient and effective heuristic algorithm for the MapReduce placement problem in cloud computing

The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generalization of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics. Also, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement. The comparison results show that the computation using our mapper/reducer placement is much cheaper while still satisfying the computation deadline.

A new grouping genetic algorithm for the MapReduce placement problem in cloud computing

MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NPcomplete. Thus, in this paper we propose a new grouping genetic algorithm for the mappers/reducers placement problem in cloud computing. Compared with the original one, our grouping genetic algorithm uses an innovative coding scheme and also eliminates the inversion operator which is an essential operator in the original grouping genetic algorithm. The new grouping genetic algorithm is evaluated by experiments and the experimental results show that it is much more efficient than four popular algorithms for the problem, including the original grouping genetic algorithm.

Accelerometer validity and placement for detection of changes in physical activity in dogs under controlled conditions on a treadmill

The objective of the research was to determine the optimal location and method of attachment for accelerometer-based motion sensors, and to validate their ability to differentiate rest and increases in speed in healthy dogs moving on a treadmill. Two accelerometers were placed on a harness between the scapulae of dogs with one in a pouch and one directly attached to the harness. Two additional accelerometers were placed (pouched and not pouched) ventrally on the dog's collar. Data were recorded in 1. s epochs with dogs moving in stages lasting 3. min each on a treadmill: (1) at rest, lateral recumbency, (2) treadmill at 0% slope, 3. km/h, (3) treadmill at 0% slope, 5. km/h, (4) treadmill at 0% slope, 7. km/h, (5) treadmill at 5% slope, 5. km/h, and; (6) treadmill at 5% slope, 7. km/h. Only the harness with the accelerometer in a pouch along the dorsal midline yielded statistically significant increases (P< 0.05) in vector magnitude as walking speed of the dogs increased (5-7. km/h) while on the treadmill. Statistically significant increases in vector magnitude were detected in the dogs as the walking speed increased from 5 to 7. km/h, however, changes in vector magnitude were not detected when activity intensity was increased as a result of walking up a 5% grade. Accelerometers are a valid and objective tool able to discriminate between and monitor different levels of activity in dogs in terms of speed of movement but not in energy expenditure that occurs with movement up hill.

Practical visual odometry for car-like vehicles

A method for calculating visual odometry for ground vehicles with car-like kinematic motion constraints similar to Ackerman's steering model is presented. By taking advantage of this non-holonomic driving constraint we show a simple and practical solution to the odometry calculation by clever placement of a single camera. The method has been implemented successfully on a large industrial forklift and a Toyota Prado SUV. Results from our industrial test site is presented demonstrating the applicability of this method as a replacement for wheel encoder-based odometry for these vehicles.

The special branch : governing mentalities through alternative-site placement

"…one should try to locate power at the extreme points of its exercise, where it is always less legal in character." (Foucault, 1980, p.97) Studies of schooling practices as techniques deriving from a particular art of governing that Foucault (2003b) called ‘governmentality’ have shown how psychopathologising discourses work to construct particular student-subjects and legitimise various practices of exclusion (Gram, 2007b). Here I extend this work to consider the use of alternative-site placement as an intensification in response to governmentality being put ‘at risk’. Governing ‘at a distance’ conjures an illusion of individual freedom which relies on the production of subjects who ‘choose’ to make choices that are consistent with the aspirations of government. In this chapter, it is argued that the designation of a child as ‘disorderly’ legitimises the intrusion of state into the private domain of the family via the Trojan horse of early intervention. This is enabled by the psy-sciences, whose technologies and aims amount to the moral retraining of ‘improper’ future-citizens who, in choosing to choose otherwise, threaten to make visible invisible relations of power. Alternative-site placement in special schools running intensive behaviour modification programs allows for a ‘redoubled insistence’ (Ewald, 1992) of these norms and limits that a ‘disorderly’ child threatens to transgress.

A Memetic Algorithm for the location-based continuously operating reference stations placement problem in Network Real-Time Kinematic

Network Real-Time Kinematic (NRTK) is a technology that can provide centimeter-level accuracy positioning services in real time, and it is enabled by a network of Continuously Operating Reference Stations (CORS). The location-oriented CORS placement problem is an important problem in the design of a NRTK as it will directly affect not only the installation and operational cost of the NRTK, but also the quality of positioning services provided by the NRTK. This paper presents a Memetic Algorithm (MA) for the location-oriented CORS placement problem, which hybridizes the powerful explorative search capacity of a genetic algorithm and the efficient and effective exploitative search capacity of a local optimization. Experimental results have shown that the MA has better performance than existing approaches. In this paper we also conduct an empirical study about the scalability of the MA, effectiveness of the hybridization technique and selection of crossover operator in the MA.

Children's emotions and multimodal appraisal of places : walking with the camera

This sensory ethnography explores the affordances and constraints of multimodal design to represent emotions and appraisal associated with experiencing local places. Digital video production, walking with the camera, and the use of a think-aloud protocol to reflect on the videos, provided an opportunity for the primary school children to represent their emotions and appraisal of places multimodally. Applying a typology from Martin and White's (2005) framework for the Language of Evaluation, children's multimodal emotional responses to places in this study tended toward happiness, security, and satisfaction. The findings demonstrate an explicit connection between children's emotions in response to local places through video, while highlighting the potential for teachers to use digital filmmaking to allow children to reflect actively on their placed experiences and represent their emotional reactions to places through multiple modes.

Now we can “see the forest and the trees too” but there are risks : Camera trapping and privacy law in Australia

The use of camera traps in wildlife management is an increasingly common practice. A phenomenon which is also becoming more common is for such camera traps to unintentionally film individuals engaged in a variety of activities, ranging from the innocent to the nefarious and including lewd or potentially embarrassing behaviour. It is therefore possible for the use of camera traps to accidentally encroach upon the privacy rights of persons who venture into the area of surveillance. In this chapter we describe the legal framework of privacy in Australia and discuss the potential risk of this sleeping tiger for users of camera traps. We also present the results of a survey of camera trap users to assess the frequency of such unintended captures and the nature of activity being filmed before discussing the practical implications of these laws for camera traps users in this country and make recommendations.

Automatic camera exposure control

It is commonplace to use digital video cameras in robotic applications. These cameras have built-in exposure control but they do not have any knowledge of the environment, the lens being used, the important areas of the image and do not always produce optimal image exposure. Therefore, it is desirable and often necessary to control the exposure off the camera. In this paper we present a scheme for exposure control which enables the user application to determine the area of interest. The proposed scheme introduces an intermediate transparent layer between the camera and the user application which combines the information from these for optimal exposure production. We present results from indoor and outdoor scenarios using directional and fish-eye lenses showing the performance and advantages of this framework.

A new approach to the cloud-based heterogeneous MapReduce placement problem

Guaranteeing Quality of Service (QoS) with minimum computation cost is the most important objective of cloud-based MapReduce computations. Minimizing the total computation cost of cloud-based MapReduce computations is done through MapReduce placement optimization. MapReduce placement optimization approaches can be classified into two categories: homogeneous MapReduce placement optimization and heterogeneous MapReduce placement optimization. It is generally believed that heterogeneous MapReduce placement optimization is more effective than homogeneous MapReduce placement optimization in reducing the total running cost of cloud-based MapReduce computations. This paper proposes a new approach to the heterogeneous MapReduce placement optimization problem. In this new approach, the heterogeneous MapReduce placement optimization problem is transformed into a constrained combinatorial optimization problem and is solved by an innovative constructive algorithm. Experimental results show that the running cost of the cloud-based MapReduce computation platform using this new approach is 24:3%-44:0% lower than that using the most popular homogeneous MapReduce placement approach, and 2:0%-36:2% lower than that using the heterogeneous MapReduce placement approach not considering the spare resources from the existing MapReduce computations. The experimental results have also demonstrated the good scalability of this new approach.