37 resultados para Delay discounting
Resumo:
Temporal discounting (TD) matures with age, alongside other markers of increased impulse control, and coherent, self-regulated behaviour. Discounting paradigms quantify the ability to refrain from preference of immediate rewards, in favour of delayed, larger rewards. As such, they measure temporal foresight and the ability to delay gratification, functions that develop slowly into adulthood. We investigated the neural maturation that accompanies the previously observed age-related behavioural changes in discounting, from early adolescence into mid-adulthood. We used functional magnetic resonance imaging of a hypothetical discounting task with monetary rewards delayed in the week to year range. We show that age-related reductions in choice impulsivity were associated with changes in activation in ventromedial prefrontal cortex (vmPFC), anterior cingulate cortex (ACC), ventral striatum (VS), insula, inferior temporal gyrus, and posterior parietal cortex. Limbic frontostriatal activation changes were specifically associated with age-dependent reductions in impulsive choice, as part of a more extensive network of brain areas showing age-related changes in activation, including dorsolateral PFC, inferior parietal cortex, and subcortical areas. The maturational pattern of functional connectivity included strengthening in activation coupling between ventromedial and dorsolateral PFC, parietal and insular cortices during selection of delayed alternatives, and between vmPFC and VS during selection of immediate alternatives. We conclude that maturational mechanisms within limbic frontostriatal circuitry underlie the observed post-pubertal reductions in impulsive choice with increasing age, and that this effect is dependent on increased activation coherence within a network of areas associated with discounting behaviour and inter-temporal decision-making.
Resumo:
The present study examined the effects of a pre-movement delay on the kinematics of prehension in middle childhood. Twenty-five children between the ages of 5 and 11 years made visually open-loop reaches to two different sized objects at two different distances along the midline. Reaches took place either (i) immediately, or (ii) 2 s after the occlusion of the stimulus. In all age groups, reaches following the pre-movement delay were characterised by longer movement durations, lower peak velocities, larger peak grip apertures and longer time spent in the final slow phase of the movement. This pattern of results suggests that the representations that control the transport and grasp component are affected similarly by delay, and is consistent with the results previously reported for adults. Such representations therefore appear to develop before the age of 5. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
In this paper, we present an on-line estimation algorithm for an uncertain time delay in a continuous system based on the observational input-output data, subject to observational noise. The first order Pade approximation is used to approximate the time delay. At each time step, the algorithm combines the well known Kalman filter algorithm and the recursive instrumental variable least squares (RIVLS) algorithm in cascade form. The instrumental variable least squares algorithm is used in order to achieve the consistency of the delay parameter estimate, since an error-in-the-variable model is involved. An illustrative example is utilized to demonstrate the efficacy of the proposed approach.
Resumo:
We investigate the spectrum of certain integro-differential-delay equations (IDDEs) which arise naturally within spatially distributed, nonlocal, pattern formation problems. Our approach is based on the reformulation of the relevant dispersion relations with the use of the Lambert function. As a particular application of this approach, we consider the case of the Amari delay neural field equation which describes the local activity of a population of neurons taking into consideration the finite propagation speed of the electric signal. We show that if the kernel appearing in this equation is symmetric around some point a= 0 or consists of a sum of such terms, then the relevant dispersion relation yields spectra with an infinite number of branches, as opposed to finite sets of eigenvalues considered in previous works. Also, in earlier works the focus has been on the most rightward part of the spectrum and the possibility of an instability driven pattern formation. Here, we numerically survey the structure of the entire spectra and argue that a detailed knowledge of this structure is important within neurodynamical applications. Indeed, the Amari IDDE acts as a filter with the ability to recognise and respond whenever it is excited in such a way so as to resonate with one of its rightward modes, thereby amplifying such inputs and dampening others. Finally, we discuss how these results can be generalised to the case of systems of IDDEs.
Resumo:
This paper analyzes the delay performance of Enhanced relay-enabled Distributed Coordination Function (ErDCF) for wireless ad hoc networks under ideal condition and in the presence of transmission errors. Relays are nodes capable of supporting high data rates for other low data rate nodes. In ideal channel ErDCF achieves higher throughput and reduced energy consumption compared to IEEE 802.11 Distributed Coordination Function (DCF). This gain is still maintained in the presence of errors. It is also expected of relays to reduce the delay. However, the impact on the delay behavior of ErDCF under transmission errors is not known. In this work, we have presented the impact of transmission errors on delay. It turns out that under transmission errors of sufficient magnitude to increase dropped packets, packet delay is reduced. This is due to increase in the probability of failure. As a result the packet drop time increases, thus reflecting the throughput degradation.
Resumo:
In 1967 a novel scheme was proposed for controlling processes with large pure time delay (Fellgett et al, 1967) and some of the constituent parts of the scheme were investigated (Swann, 1970; Atkinson et al, 1973). At that time the available computational facilities were inadequate for the scheme to be implemented practically, but with the advent of modern microcomputers the scheme becomes feasible. This paper describes recent work (Mitchell, 1987) in implementing the scheme in a new multi-microprocessor configuration and shows the improved performance it provides compared with conventional three-term controllers.
Resumo:
This work investigates the optimum decision delay and tap-length of the finite-length decision feedback equalizer. First we show that, if the feedback filter (FBF) length Nb is equal to or larger than the channel memory v and the decision delay Δ is smaller than the feedforward filter (FFF) length Nf, then only the first Δ+1 elements of the FFF can be nonzero. Based on this result we prove that the maximum effective FBF length is equal to the channel memory v, and if Nb ≥ v and Nf is long enough, the optimum decision delay that minimizes the MMSE is Nf-1.
Resumo:
The power of an adaptive equalizer is maximized when the structural parameters including the tap-length and decision delay can be optimally chosen. Although the method for adjusting either the tap-length or decision delay has been proposed, adjusting both simultaneously becomes much more involved as they interact with each other. In this paper, this problem is solved by putting a linear prewhitener before the equalizer, with which the equivalent channel becomes maximum-phase. This implies that the optimum decision delay can be simply ¯xed at the tap-length minus one, while the tap-length can then be chosen using a similar approach as that proposed in our previous work.