Giving up on modern foreign languages? Students' perceptions of learning French

This article reports on the findings of an investigation into the attitudes of English students aged 16 to 19 years towards French and how they view the reasons behind their level of achievement. Those students who attributed success to effort, high ability, and effective learning strategies had higher levels of achievement, and students intending to continue French after age 16 were more likely than noncontinuers to attribute success to these factors. Low ability and task difficulty were the main reasons cited for lack of achievement in French, whereas the possible role of learning strategies tended to be overlooked by students. It is argued that learners' self-concept and motivation might be enhanced through approaches that encourage learners to explore the causal links between the strategies they employ and their academic performance, thereby changing the attributions they make for success or failure.

The effects of low-temperature potato storage and washing and soaking pre-treatments on the acrylamide content of French fries

BACKGROUND: Since the discovery in 2002 of acrylamide in a wide range of foods, there has been much work done to explore mechanisms of formation and to reduce acrylamide in commercial products. This study aimed to investigate simple measures which could be used to reduce acrylamide formation in home-cooked French fries, using potatoes from three cultivars stored under controlled conditions and sampled at three time points. RESULTS: The reducing sugar content for all three cultivars increased during storage, which led to increased acrylamide levels in the French fries. Washing and soaking (30 min or 2 h) raw French fries before cooking led to reductions in acrylamide of up to 23, 38 and 48% respectively. Pre-treated fries were lighter in colour after cooking than the corresponding controls. CONCLUSION: Pre-treatments such as soaking or washing raw French fries in water reduce acrylamide and colour formation in the final product when cooking is stopped at a texture-determined endpoint. (c) 2008 Society of Chemical Industry.

Landscape of intelligent cores: An autonomic multi-agent approach for space application

Space applications are challenged by the reliability of parallel computing systems (FPGAs) employed in space crafts due to Single-Event Upsets. The work reported in this paper aims to achieve self-managing systems which are reliable for space applications by applying autonomic computing constructs to parallel computing systems. A novel technique, 'Swarm-Array Computing' inspired by swarm robotics, and built on the foundations of autonomic and parallel computing is proposed as a path to achieve autonomy. The constitution of swarm-array computing comprising for constituents, namely the computing system, the problem / task, the swarm and the landscape is considered. Three approaches that bind these constituents together are proposed. The feasibility of one among the three proposed approaches is validated on the SeSAm multi-agent simulator and landscapes representing the computing space and problem are generated using the MATLAB.

Building communities via a learning landscape

The Learning Landscape project described here is known as RedGloo and has several objectives; among others it aims to help students to make friends, contacts and join communities based on interests and competencies. RedGloo provides a space where students can support each other with personal, academic and career development, sharing insights gained from extracurricular activities as well as their degree programmes. It has shown tendencies of becoming a learning community with several communities of practice.

Landscape state machines: Tools for evolutionary algorithm performance analyses and landscape/algorithm mapping

Many evolutionary algorithm applications involve either fitness functions with high time complexity or large dimensionality (hence very many fitness evaluations will typically be needed) or both. In such circumstances, there is a dire need to tune various features of the algorithm well so that performance and time savings are optimized. However, these are precisely the circumstances in which prior tuning is very costly in time and resources. There is hence a need for methods which enable fast prior tuning in such cases. We describe a candidate technique for this purpose, in which we model a landscape as a finite state machine, inferred from preliminary sampling runs. In prior algorithm-tuning trials, we can replace the 'real' landscape with the model, enabling extremely fast tuning, saving far more time than was required to infer the model. Preliminary results indicate much promise, though much work needs to be done to establish various aspects of the conditions under which it can be most beneficially used. A main limitation of the method as described here is a restriction to mutation-only algorithms, but there are various ways to address this and other limitations.