Maturation of limbic corticostriatal activation and connectivity associated with developmental changes in temporal discounting

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.

Ribose 2′-O-methylation provides a molecular signature for the distinction of self and non-self mRNA dependent on the RNA sensor Mda5

The 5'-cap-structures of higher eukaryote mRNAs are ribose 2'-O-methylated. Likewise, a number of viruses replicating in the cytoplasm of eukayotes have evolved 2'-O-methyltransferases to modify autonomously their mRNAs. However, a defined biological role of mRNA 2'-O-methylation remains elusive. Here we show that viral mRNA 2'-O-methylation is critically involved in subversion of type-I-interferon (IFN-I) induction. We demonstrate that human and murine coronavirus 2'-O-methyltransferase mutants induce increased IFN-I expression, and are highly IFN-I sensitive. Importantly, IFN-I induction by 2'-O-methyltransferase-deficient viruses is dependent on the cytoplasmic RNA sensor melanoma differentiation-associated gene 5 (MDA5). This link between MDA5-mediated sensing of viral RNA and mRNA 2'-O-methylation suggests that RNA modifications, such as 2'-O-methylation, provide a molecular signature for the discrimination of self and non-self mRNA.

Strong-segregation limit of the self-consistent field theory for diblock copolymer melts

The self-consistent field theory (SCFT) introduced by Helfand for diblock copolymer melts is expected to converge to the strong-segregation theory (SST) of Semenov in the asymptotic limit, $\chi N \rightarrow \infty$. However, past extrapolations of the lamellar/cylinder and cylinder/sphere phase boundaries, within the standard unit-cell approximation, have cast some doubts on whether or not this is actually true. Here we push the comparison further by extending the SCFT calculations to $\chi N = 512,000$, by accounting for exclusion zones in the coronae of the cylindrical and spherical unit cells, and by examining finite-segregation corrections to SST. In doing so, we provide the first compelling evidence that SCFT does indeed reduce to SST.

A model for self-directed problem-based learning for renal therapeutics

Objective To introduce a new approach to problem-based learning (PBL) for self-directed learning in renal therapeutics. Design This 5-week course, designed for large student cohorts using minimal teaching resources, was based on a series of case studies and subsequent pharmaceutical care plans, followed by intensive and regular feedback from the instructor. Assessment Assessment of achievement of the learning outcomes was based on weekly-graded care plans and peer review assessment, allowing each student to judge the contributions of each group member and their own, along with a written case-study based examination. The pharmaceutical care plan template, designed using a “tick-box” system, significantly reduced staff time for feedback and scoring. Conclusion The proposed instructional model achieved the desired learning outcomes with appropriate student feedback, while promoting skills that are essential for the students' future careers as health care professionals.

Exploring carrier agents in swarm-array computing

How can a bridge be built between autonomic computing approaches and parallel computing systems? The work reported in this paper is motivated towards bridging this gap by proposing a swarm-array computing approach based on ‘Intelligent Agents’ to achieve autonomy for distributed parallel computing systems. In the proposed approach, a task to be executed on parallel computing cores is carried onto a computing core by carrier agents that can seamlessly transfer between processing cores in the event of a predicted failure. The cognitive capabilities of the carrier agents on a parallel processing core serves in achieving the self-ware objectives of autonomic computing, hence applying autonomic computing concepts for the benefit of parallel computing systems. The feasibility of the proposed approach is validated by simulation studies using a multi-agent simulator on an FPGA (Field-Programmable Gate Array) and experimental studies using MPI (Message Passing Interface) on a computer cluster. Preliminary results confirm that applying autonomic computing principles to parallel computing systems is beneficial.

The risk-taking and self-harm inventory for adolescents: Development and psychometric evaluation

In this study, we report on the development and psychometric evaluation of the Risk-Taking (RT) and Self-Harm (SH) Inventory for Adolescents (RTSHIA), a self-report measure designed to assess adolescent RT and SH in community and clinical settings. 651 young people from secondary schools in England ranging in age from 11.6 years to 18.7 years and 71 young people referred to mental health services for SH behavior in London between the ages of 11.9 years and 17.5 years completed the RTSHIA along with standardized measures of adolescent psychopathology. Two factors emerged from the principal axis factoring, and RT and SH were further validated by a confirmatory factor analysis as related, but different, constructs, rather than elements of a single continuum. Inter-item and test–retest reliabilities were high for both components (Cronbach's α = .85, rtt = .90; Cronbach's α .93, rtt = .87), and considerable evidence emerged in support of the measure's convergent, concurrent, and divergent validity. The findings are discussed with regard to potential usefulness of the RTSHIA for research and clinical purposes with adolescents.

Feasibility of guided CBT self-help for childhood anxiety disorders in primary care

Anxiety disorders in childhood are common, disabling and run a chronic course. Cognitive Behaviour Therapy (CBT) effective but is expensive and trained therapists are scarce. Guided self-help treatments may be a means of widening access to treatment. This study aimed to examine the feasibility of guided CBT self-help for childhood anxiety disorders in Primary Care, specifically in terms of therapist adherence, patient and therapist satisfaction and clinical gain. Participants were children aged 5-12 years referred to two Primary Child and Adolescent Mental Health Services (PCAMHSs) in Oxfordshire, UK, who met diagnostic criteria for a primary anxiety disorder. Of the 52 eligible children, 41 anxious children were assessed for anxiety severity and interference before and after receiving CBT self-help, delivered via the parent (total therapy time= 5 hours) by Primary Mental Health Workers (PMHWs). Therapy sessions were rated for treatment adherence and patients and PMHWs completed satisfaction questionnaires after treatment completion. Over 80% of therapy sessions were rated at a high level of treatment adherence. Parents and PMHWs reported high satisfaction with the treatment. 61% of the children assessed no longer met criteria for their primary anxiety disorder diagnosis following treatment, and 76% were rated as ‘much’/’very much’ improved on the Clinician’s Global Impression-Improvement scale. There were significant reductions on parent and child report measures of anxiety symptoms, interference, and depression. Preliminary exploration indicated that parental anxiety was associated with child treatment outcome. The findings suggest that guided CBT self-help represents a promising treatment for childhood anxiety in primary care.

Neural network enhanced generalised minimum variance self-tuning controller for nonlinear discrete-time systems

A neural network enhanced self-tuning controller is presented, which combines the attributes of neural network mapping with a generalised minimum variance self-tuning control (STC) strategy. In this way the controller can deal with nonlinear plants, which exhibit features such as uncertainties, nonminimum phase behaviour, coupling effects and may have unmodelled dynamics, and whose nonlinearities are assumed to be globally bounded. The unknown nonlinear plants to be controlled are approximated by an equivalent model composed of a simple linear submodel plus a nonlinear submodel. A generalised recursive least squares algorithm is used to identify the linear submodel and a layered neural network is used to detect the unknown nonlinear submodel in which the weights are updated based on the error between the plant output and the output from the linear submodel. The procedure for controller design is based on the equivalent model therefore the nonlinear submodel is naturally accommodated within the control law. Two simulation studies are provided to demonstrate the effectiveness of the control algorithm.

Filtering techniques in self-tuning

In the last few years a state-space formulation has been introduced into self-tuning control. This has not only allowed for a wider choice of possible control actions, but has also provided an insight into the theory underlying—and hidden by—that used in the polynomial description. This paper considers many of the self-tuning algorithms, both state-space and polynomial, presently in use, and by starting from first principles develops the observers which are, effectively, used in each case. At any specific time instant the state estimator can be regarded as taking one of two forms. In the first case the most recently available output measurement is excluded, and here an optimal and conditionally stable observer is obtained. In the second case the present output signal is included, and here it is shown that although the observer is once again conditionally stable, it is no longer optimal. This result is of significance, as many of the popular self-tuning controllers lie in the second, rather than first, category.

Self-tuning regulators—a state space approach

This paper employs a state space system description to provide a pole placement scheme via state feedback. It is shown that when a recursive least squares estimation scheme is used, the feedback employed can be expressed simply in terms of the estimated system parameters. To complement the state feedback approach, a method employing both state feedback and linear output feedback is discussed. Both methods arc then compared with the previous output polynomial type feedback schemes.

An implicit pole-assignment self-tuning regulator

A new self-tuning implicit pole-assignment algorithm is presented which, through the use of a pole compression factor and different RLS model and control structures, overcomes stability and convergence problems encountered in previously available algorithms. Computational requirements of the technique are much reduced when compared to explicit pole-assignment schemes, whereas the inherent robustness of the strategy is retained.