Naturalistic study of the risky situations faced by novice riders

This article sets out to identify the typical risky situations experienced by novice motorcyclists in the real world just after licensing. The procedure consists of a follow-up of six novices during their first two months of riding with their own motorbike instrumented with cameras. The novices completed logbooks on a daily basis in order to identify the risky situations they encountered, and were given face-to-face interviews to identify the context and their shortcomings during the reported events. Data show a large number of road configurations considered as risky by the riders (248 occurrences), especially during the first two weeks. The results revealed that a lack of hazard perception skills contributed to the majority of these incidents. These situations were grouped together to form clusters of typical incident scenarios on the basis of their similarities. The most frequent scenario corresponds to a lane change in dense traffic (15% of all incidents). The discussion shows how this has enhanced our understanding of novice riders’ behaviour and how the findings can improve training and licensing. Lastly, the main methodological limitations of the study and some guidelines for improving future naturalistic riding studies are presented.

Practitioner Summary:

This article aims to identify the risky situations of novice motorcyclists in real roads. Two hundred forty-eight events were recorded and 13 incident scenarios identified. Results revealed that a lack of hazard perception contributed to the majority of these events. The most frequent scenario corresponds to a lane change in dense traffic.     

A method for a robust optimization of joint product and supply chain design

This paper proposes a method for finding a robust solution to the problem of joint product family and supply chain design. Optimizing product design and the supply chain network at the same time brings substantial benefits. However, this approach involves decisions that can generate uncertainties in the long term. The challenge is to come up with a method that can adapt to most possible environments without straying too far from the optimal solution. Our approach is based on the generation of scenarios that correspond to combinations of uncertain parameters within the model. The performance of designs resulting from these scenario optimizations are compared to the performance of each of the other design scenarios, based on their probability of occurrence. The proposed methodology will allow practitioners to choose a suitable design, from the most profitable to the most reliable.     

Light-efficient photography

In this paper, we consider the problem of imaging a scene with a given depth of field at a given exposure level in the shortest amount of time possible. We show that by 1) collecting a sequence of photos and 2) controlling the aperture, focus, and exposure time of each photo individually, we can span the given depth of field in less total time than it takes to expose a single narrower-aperture photo. Using this as a starting point, we obtain two key results. First, for lenses with continuously variable apertures, we derive a closed-form solution for the globally optimal capture sequence, i.e., that collects light from the specified depth of field in the most efficient way possible. Second, for lenses with discrete apertures, we derive an integer programming problem whose solution is the optimal sequence. Our results are applicable to off-the-shelf cameras and typical photography conditions, and advocate the use of dense, wide-aperture photo sequences as a light-efficient alternative to single-shot, narrow-aperture photography.     

Adaptive records for volume irradiance caching

In this paper, we present a new irradiance caching scheme using Monte Carlo ray tracing for efficiently rendering participating media. The irradiance cache algorithm is extended to participating media. Our method allows to adjust the density of cached records depending on illumination changes. Direct and indirect contributions can be stored in the records but also multiple scattering. An adaptive shape of the influence zone of records, depending on geometrical features and irradiance variations, is introduced. To avoid a high density of cached records in low interest areas, a new method controls the density of the cache when adding new records. This record density control depends on the interpolation quality and on the photometric characteristics of the medium. Reducing the number of records accelerates both the computation pass and the rendering pass by decreasing the number of queries to the cache data structure (Kd-tree). Finally, instead of using an expensive ray marching to find records that cover the ray, we gather all the contributive records along the ray. With our method, pre-computing and rendering passes are significantly speeded-up.     

Design and Implementation of a PKI-Based End-to-End Secure Infrastructure for Mobile E-Commerce

The popularity of handheld mobile devices and deployment of the public key infrastructure in many parts of the world have led to the development of electronic commerce on mobile devices. For the current version of mobile phones, the main challenge is the limited computing capacity on these devices for PKI-based end-to-end secure transactions. This paper presents a new architecture and protocol for authentication and key exchange as well as the supporting infrastructure that is suitable for the mobile phone environment. The system requirements and our solutions in addressing these requirements in the restrictive environment are discussed. An evaluation of the system performance is also included. The system has been implemented and is supporting some real-life applications.     

Is Grover’s Algorithm a Quantum Hidden Subgroup Algorithm?

The arguments given in this paper suggest that Grover’s and Shor’s algorithms are more closely related than one might at first expect. Specifically, we show that Grover’s algorithm can be viewed as a quantum algorithm which solves a non-abelian hidden subgroup problem (HSP). But we then go on to show that the standard non-abelian quantum hidden subgroup (QHS) algorithm can not find a solution to this particular HSP. This leaves open the question as to whether or not there is some modification of the standard non-abelian QHS algorithm which is equivalent to Grover’s algorithm.      

Intermittent microclimate cooling during exercise-heat stress in US army chemical protective clothing

The effectiveness of intermittent, microclimate cooling for men who worked in US Army chemical protective clothing (modified mission-oriented protective posture level 3; MOPP 3) was examined. The hypothesis was that intermittent cooling on a 2 min on-off schedule using a liquid cooling garment (LCG) covering 72% of the body surface area would reduce heat strain comparably to constant cooling. Four male subjects completed three experiments at 30 degrees C, 30% relative humidity wearing the LCG under the MOPP 3 during 80 min of treadmill walking at 224 +/- 5 W . m(-2). Water temperature to the LCG was held constant at 21 degrees C. The experiments were; 1) constant cooling (CC); 2) intermittent cooling at 2-min intervals (IC); 3) no cooling (NC). Core temperature increased (1.6 +/- 0.2 degrees C) in NC, which was greater than IC (0.5 +/- 0.2 degrees C) and CC (0.5 +/- 0.3 degrees C) ( p < 0.05). Mean skin temperature was higher during NC (36.1 +/- 0.4 degrees C) than IC (33.7 +/- 0.6 degrees C) and CC (32.6 +/- 0.6 degrees C) and mean skin temperature was higher during IC than CC ( p < 0.05). Mean heart rate during NC (139 +/- 9 b . min(-1)) was greater than IC (110 +/- 10 b . min(-1)) and CC (107 +/- 9 b . min(-1)) ( p < 0.05). Cooling by conduction (K) during NC (94 +/- 4 W . m(-2)) was lower than IC (142 +/- 7 W . m(-2)) and CC (146 +/- 4 W . m(-2)) ( p < 0.05). These findings suggest that IC provided a favourable skin to LCG gradient for heat dissipation by conduction and reduced heat strain comparable to CC during exercise-heat stress in chemical protective clothing.     

Optical merger of direct vision with virtual images for scaled teleoperation

Scaled teleoperation is increasingly prevalent in medicine, as well as in other applications of robotics. Visual feedback in such systems is essential and should make maximal use of natural hand-eye coordination. This paper describes a new method of visual feedback for scaled teleoperation in which the operator manipulates the handle of a remote tool in the presence of a registered virtual image of the target in real time. The method adapts a concept already used successfully in a new medical device called the sonic flashlight, which permits direct in situ visualization of ultrasound during invasive procedures. The sonic flashlight uses a flat-panel monitor and a half-silvered mirror to merge the visual outer surface of a patient with a simultaneous ultrasound scan of the patient's interior. Adapting the concept to scaled teleoperation involves removing the imaging device and the target to a remote location and adding a master-slave control device. This permits the operator to see his hands, along with what appears to be the tool, and the target, merged in a workspace that preserves natural hand-eye coordination. Three functioning prototypes are described, one based on ultrasound and two on light microscopy. The limitations and potential of the new approach are discussed.