Developers use algorithms and data structures every day of their working lives. Having a good under-standing of these algorithms and knowledge of when to apply them is essential to producing softwarethat not only works correctly, but also performs efficiently.
This book aims to explain those algorithms and data structures most commonly encountered in day-to-day software development, while remaining at all times practical, concise, and to the point, with little orno verbiage to distract from the core concepts and examples.
This paper presents an interactive technique that
produces static hairstyles by generating individual hair strands
of the desired shape and color, subject to the presence of gravity
and collisions. A variety of hairstyles can be generated by
adjusting the wisp parameters, while the deformation is solved
efficiently, accounting for the effects of gravity and collisions.
Wisps are generated employing statistical approaches. As for
hair deformation, we propose a method which is based on
physical simulation concepts but is simplified to efficiently
solve the static shape of hair. On top of the statistical wisp
model and the deformation solver, a constraint-based styler
is proposed to model artificial features that oppose the natural
flow of hair under gravity and hair elasticity, such as a hairpin.
Our technique spans a wider range of human hairstyles than
previously proposed methods, and the styles generated by this
technique are fairly realistic.
Rao-Blackwellised Particle Filters (RBPFs) are a class of Particle
Filters (PFs) that exploit conditional dependencies between
parts of the state to estimate. By doing so, RBPFs can
improve the estimation quality while also reducing the overall
computational load in comparison to original PFs. However,
the computational complexity is still too high for many
real-time applications. In this paper, we propose a modified
RBPF that requires a single Kalman Filter (KF) iteration per
input sample. Comparative experiments show that while good
convergence can still be obtained, computational efficiency is
always drastically increased, making this algorithm an option
to consider for real-time implementations.
2.0.12 (May 13th, 2004)
- Flag driver threads with PF_FREEZE to support software suspend.
2.0.11 (May 7th, 2004)
- Avoid split-completion bugs in certain PCI-X chipsets by
breaking up large completion entry DMAs on ADB boundaries.
2.0.10 (April 9th, 2004)
- Return "command timeout" status instead of "selection timeout
status" to the SCSI mid-layer in response to selection timeouts.
While the latter may seem more correct, the mid-layer will not
offline devices suffering from persistent selection timeouts.
This leads to extremely long recovery times for devices that
go missing. Returning command timeout status causes the mid-layer
to enter recovery and eventually offline persistently missing
devices.
