The control of self-initiated falls from different heights was studied. The objective of the study was to investigate in a quantitative manner the modulation of EMG timing (i.e. onset from take-off and duration from onset to touch-down) and amplitude (before and after foot contact) as a function of fall height. The muscles studied were m. soleus and m. tibialis anterior. Kinematic (ankle joint ...

This paper develops a new approach to the detection of the emergency locator transmitter (ELT) signal using an adaptive line enhancer (ALE). The input signal to the ALE is replaced by its autocorrelation function (ACF) because noise affects the central samples of the autocorrelation function only while it affects all samples of the noisy signal. This gives the ALE the ability to get rid of nois...

Optimal trajectories for spacecraft guidance, be it during orbital transfers or landing sequences are often pre-computed on ground and used as nominal desired solutions later tracked by a secondary control system. Linearization of the dynamics around such nominal profiles allows to cancel the error during the actual navigation phase when the trajectory is executed. In this study, instead, we as...

In this paper, a control approach called Artificial Neural Tissue (ANT) is applied to multirobot excavation for lunar base preparation tasks including clearing landing pads and burying of habitat modules. We show for the first time, a team of autonomous robots excavating a terrain to match a given 3D blueprint. Constructing mounds around landing pads will provide physical shielding from debris ...

This paper studies the role of ‡uctuations in the aggregate price-earning ratio at di¤erent time scales for predicting stock returns and explore the channels through which returns are predicted. Using U.S. quarterly and international monthly data, we …nd that cycles in the price-earning ratio are strong and better predictors of future returns at short and intermediate horizons than the aggregat...

We present a randomized algorithm sorting n integers in O(n p log logn) expected time and linear space. This improves the previous O(n log logn) bound by Anderson et al. from STOC’95. As an immediate consequence, if the integers are bounded by U , we can sort them in O(n p log logU) expected time. This is the first improvement over the O(n log logU) bound obtained with van Emde Boas’ data struc...

It has been shown previously that sorting n items into n locations with a polynomial number of processors requires (logn= log logn) time. We sidestep this lower bound with the idea of Padded Sorting, or sorting n items into n+o(n) locations. Since many problems do not rely on the exact rank of sorted items, a Padded Sort is often just as useful as an unpadded sort. Our algorithm for Padded Sort...