Gait termination in young and older adults : effect of stopping stimulus probability and stimulus delay

Sixteen young (25±2.6 years) and 16 older individuals (69±4.4 years) walked normally then terminated walking rapidly. A visual stopping stimulus was presented 10 ms following ground contact (short delay) and in another condition, at 450 ms prior to toe-off (long delay). Stimulus probability was either high (80% of trials) or low (10%). The younger group stopped faster (463 vs. 574 ms) despite also walking faster (1.29 vs. 1.17 m s⁻¹). Longer delay decreased one-step responses but older participants used significantly more (slower) two-step stopping, which increased stopping time and distance. The additional step may have been pre-planned to maintain medial–lateral stability.

Efficient algorithm for mobile multicast using anycast group

The authors present a novel and efficient multicast algorithm that aims to reduce delay and communication cost for the registration between mobile nodes and mobility agents and solicitation for foreign agent services based on the mobile IP. The protocol applies anycast group technology to support multicast transmissions for both mobile nodes and home/foreign agents. Mobile hosts use anycast tunnelling to connect to the nearest available home/foreign agent where an agent is able to forward the multicast messages by selecting an anycast route to a multicast router so as to reduce the end-to-end delay. The performance analysis and experiments demonstrated that the proposed algorithm is able to enhance the performance over existing remote subscription and bidirectional tunnelling approaches regardless of the locations of mobile nodes/hosts

Delay control and parallel admission algorithms for real-time anycast flow

An anycast flow is a flow that can be connected to any one of the members in a group of designated (replicated) servers (called anycast group). In this paper, we derive a set of formulas for calculating the end-to-end delay bound for the anycast flows and present novel admission control algorithms for anycast flows with real-time constraints. Given such an anycast group, our algorithms can effectively select the paths for anycast flows' admission and connection based on the least end-to-end delay bounds evaluated. We also present a parallel admission control algorithm that can effectively calculate the available paths with a short delay bound for different destinations in the anycast group so that a best path with the shortest delay bound can be chosen.