Electronic voting systems in undergraduate teaching

One of the major differences undergraduates experience during the transition to university is the style of teaching. In schools and colleges most students study key stage 5 subjects in relatively small informal groups where teacher–pupil interaction is encouraged and two-way feedback occurs through question and answer type delivery. On starting in HE students are amazed by the sizes of the classes. For even a relatively small chemistry department with an intake of 60-70 students, biologists, pharmacists, and other first year undergraduates requiring chemistry can boost numbers in the lecture hall to around 200 or higher. In many universities class sizes of 400 are not unusual for first year groups where efficiency is crucial. Clearly the personalised classroom-style delivery is not practical and it is a brave student who shows his ignorance by venturing to ask a question in front of such an audience. In these environments learning can be a very passive process, the lecture acts as a vehicle for the conveyance of information and our students are expected to reinforce their understanding by ‘self-study’, a term, the meaning of which, many struggle to understand. The use of electronic voting systems (EVS) in such situations can vastly change the students’ learning experience from a passive to a highly interactive process. This principle has already been demonstrated in Physics, most notably in the work of Bates and colleagues at Edinburgh.1 These small hand-held devices, similar to those which have become familiar through programmes such as ‘Who Wants to be a Millionaire’ can be used to provide instant feedback to students and teachers alike. Advances in technology now allow them to be used in a range of more sophisticated settings and comprehensive guides on use have been developed for even the most techno-phobic staff.

Redox control of light-induced charge separation in a transition metal cluster: photochemistry of a methyl viologen-substituted [Os-3(CO)10(a-diimine)] cluster

Sub)picosecond transient absorption (TA) and time-resolved infrared (TRIR) spectra of the cluster [OS3(CO)(10-) (AcPy-MV)](2+) (the clication AcPy-MV = Acpy-MV2+ = [2-pyridylacetimine-N-(2-(1'-methyl-4,4'-bipyridine-1,1'-diium-1-yl) ethyl)] (PF6)(2)) (1(2+)) reveal that photoinduced electron transfer to the electron-accepting 4,4'-bipyridine-1,1'diium (MV2+) moiety competes with the fast relaxation of the initially populated sigmapi* excited state of the cluster to the ground state and/or cleavage of an Os-Os bond. The TA spectra of cluster 12 in acetone, obtained by irradiation into its lowest-energy absorption band, show the characteristic absorptions of the one-electron-reduced MV*(+) unit at 400 and 615 nm, in accordance with population of a charge-separated (CS) state in which a cluster-core electron has been transferred to the lowest pi* orbital of the remote MV2+ unit. This assignment is confirmed by picosecond TRIR spectra that show a large shift of the pilot highest-frequency nu(CO) band of 1(2+) by ca. +40 cm(-1), reflecting the photooxidation of the cluster core. The CS state is populated via fast (4.2 x 10(11) s(-1)) and efficient (88%) oxidative quenching of the optically populated sigmapi* excited state and decays biexponentially with lifetimes of 38 and 166 ps (1:2:1 ratio) with a complete regeneration of the parent cluster. About 12% of the cluster molecules in the sigmapi* excited state form long-lived open-core biradicals. In strongly coordinating acetonitrile, however, the cluster core-to-MV2+ electron transfer in cluster 12+ results in the irreversible formation of secondary photoproducts with a photooxidized cluster core. The photochemical behavior of the [Os-3(CO)(10)(alpha-diimine-MV)](2+) (donor-acceptor) dyad can be controlled by an externally applied electronic bias. Electrochemical one-electron reduction of the MV2+ moiety prior to the irradiation reduces its electron-accepting character to such an extent that the photoinduced electron transfer to MV*+ is no longer feasible. Instead, the irradiation of reduced cluster 1(.)+ results in the reversible formation of an open-core zwitterion, the ultimate photoproduct also observed upon irradiation of related nonsubstituted clusters [Os-3(CO)(10)(alpha-diimine)] in strongly coordinating solvents such as acetonitrile.

Intelligent agents for fault tolerance: from multi-agent simulation to cluster-based implementation

Recent research in multi-agent systems incorporate fault tolerance concepts, but does not explore the extension and implementation of such ideas for large scale parallel computing systems. The work reported in this paper investigates a swarm array computing approach, namely 'Intelligent Agents'. A task to be executed on a parallel computing system is decomposed to sub-tasks and mapped onto agents that traverse an abstracted hardware layer. The agents intercommunicate across processors to share information during the event of a predicted core/processor failure and for successfully completing the task. The feasibility of the approach is validated by simulations on an FPGA using a multi-agent simulator, and implementation of a parallel reduction algorithm on a computer cluster using the Message Passing Interface.

A cluster-based implementation of a fault-tolerant parallel reduction algorithm using swarm-array computing

Recent research in multi-agent systems incorporate fault tolerance concepts. However, the research does not explore the extension and implementation of such ideas for large scale parallel computing systems. The work reported in this paper investigates a swarm array computing approach, namely ‘Intelligent Agents’. In the approach considered a task to be executed on a parallel computing system is decomposed to sub-tasks and mapped onto agents that traverse an abstracted hardware layer. The agents intercommunicate across processors to share information during the event of a predicted core/processor failure and for successfully completing the task. The agents hence contribute towards fault tolerance and towards building reliable systems. The feasibility of the approach is validated by simulations on an FPGA using a multi-agent simulator and implementation of a parallel reduction algorithm on a computer cluster using the Message Passing Interface.

The use of trajectory cluster analysis to interpret trace gas measurements at Mace Head, Ireland

A first step in interpreting the wide variation in trace gas concentrations measured over time at a given site is to classify the data according to the prevailing weather conditions. In order to classify measurements made during two intensive field campaigns at Mace Head, on the west coast of Ireland, an objective method of assigning data to different weather types has been developed. Air-mass back trajectories calculated using winds from ECMWF analyses, arriving at the site in 1995–1997, were allocated to clusters based on a statistical analysis of the latitude, longitude and pressure of the trajectory at 12 h intervals over 5 days. The robustness of the analysis was assessed by using an ensemble of back trajectories calculated for four points around Mace Head. Separate analyses were made for each of the 3 years, and for four 3-month periods. The use of these clusters in classifying ground-based ozone measurements at Mace Head is described, including the need to exclude data which have been influenced by local perturbations to the regional flow pattern, for example, by sea breezes. Even with a limited data set, based on 2 months of intensive field measurements in 1996 and 1997, there are statistically significant differences in ozone concentrations in air from the different clusters. The limitations of this type of analysis for classification and interpretation of ground-based chemistry measurements are discussed.

Multivariable cluster analysis for high-speed industrial machinery

The overall operation and internal complexity of a particular production machinery can be depicted in terms of clusters of multidimensional points which describe the process states, the value in each point dimension representing a measured variable from the machinery. The paper describes a new cluster analysis technique for use with manufacturing processes, to illustrate how machine behaviour can be categorised and how regions of good and poor machine behaviour can be identified. The cluster algorithm presented is the novel mean-tracking algorithm, capable of locating N-dimensional clusters in a large data space in which a considerable amount of noise is present. Implementation of the algorithm on a real-world high-speed machinery application is described, with clusters being formed from machinery data to indicate machinery error regions and error-free regions. This analysis is seen to provide a promising step ahead in the field of multivariable control of manufacturing systems.

A cluster computing implementation of a Monte Carlo simulation of a particle growth mechanism

Clusters of computers can be used together to provide a powerful computing resource. Large Monte Carlo simulations, such as those used to model particle growth, are computationally intensive and take considerable time to execute on conventional workstations. By spreading the work of the simulation across a cluster of computers, the elapsed execution time can be greatly reduced. Thus a user has apparently the performance of a supercomputer by using the spare cycles on other workstations.

Simultaneous observations of reconnection pulses at Cluster and their effects on the cusp aurora observed at the Chinese Yellow River station

While the Cluster spacecraft were located near the high-latitude magnetopause, between 1010 and 1040 UT on 16 January 2004, three typical flux transfer event (FTE) signatures were observed. During this interval, simultaneous and conjugated all‐sky camera measurements, recorded at Yellow River Station, Svalbard, are available at 630.0 and 557.7 nm that show poleward‐moving auroral forms (PMAFs), consistent with magnetic reconnection at the dayside magnetopause. Simultaneous FTEs seen at the magnetopause mainly move northward, but having duskward (eastward) and tailward velocity components, roughly consistent with the observed direction of motion of the PMAFs in all‐sky images. Between the PMAFs meridional keograms, extracted from the all‐sky images, show intervals of lower intensity aurora which migrate equatorward just before the PMAFs intensify. This is strong evidence for an equatorward eroding and poleward moving open‐closed boundary associated with a variable magnetopause reconnection rate under variable IMF conditions. From the durations of the PMAFs, we infer that the evolution time of FTEs is 5–11 minutes from its origin on the magnetopause to its addition to the polar cap.

On merging gradient estimation with mean-tracking techniques for cluster identification

This paper discusses how numerical gradient estimation methods may be used in order to reduce the computational demands on a class of multidimensional clustering algorithms. The study is motivated by the recognition that several current point-density based cluster identification algorithms could benefit from a reduction of computational demand if approximate a-priori estimates of the cluster centres present in a given data set could be supplied as starting conditions for these algorithms. In this particular presentation, the algorithm shown to benefit from the technique is the Mean-Tracking (M-T) cluster algorithm, but the results obtained from the gradient estimation approach may also be applied to other clustering algorithms and their related disciplines.

Neural network basis function center selection using cluster analysis

This paper deals with the selection of centres for radial basis function (RBF) networks. A novel mean-tracking clustering algorithm is described as a way in which centers can be chosen based on a batch of collected data. A direct comparison is made between the mean-tracking algorithm and k-means clustering and it is shown how mean-tracking clustering is significantly better in terms of achieving an RBF network which performs accurate function modelling.

Cluster analysis for multivariable process control

This paper describes the novel use of cluster analysis in the field of industrial process control. The severe multivariable process problems encountered in manufacturing have often led to machine shutdowns, where the need for corrective actions arises in order to resume operation. Production faults which are caused by processes running in less efficient regions may be prevented or diagnosed using a reasoning based on cluster analysis. Indeed the intemal complexity of a production machinery may be depicted in clusters of multidimensional data points which characterise the manufacturing process. The application of a Mean-Tracking cluster algorithm (developed in Reading) to field data acquired from a high-speed machinery will be discussed. The objective of such an application is to illustrate how machine behaviour can be studied, in particular how regions of erroneous and stable running behaviour can be identified.