Testing Turing's five minutes, parallel-paired imitation game

Purpose – The purpose of this paper is to consider Turing's two tests for machine intelligence: the parallel-paired, three-participants game presented in his 1950 paper, and the “jury-service” one-to-one measure described two years later in a radio broadcast. Both versions were instantiated in practical Turing tests during the 18th Loebner Prize for artificial intelligence hosted at the University of Reading, UK, in October 2008. This involved jury-service tests in the preliminary phase and parallel-paired in the final phase. Design/methodology/approach – Almost 100 test results from the final have been evaluated and this paper reports some intriguing nuances which arose as a result of the unique contest. Findings – In the 2008 competition, Turing's 30 per cent pass rate is not achieved by any machine in the parallel-paired tests but Turing's modified prediction: “at least in a hundred years time” is remembered. Originality/value – The paper presents actual responses from “modern Elizas” to human interrogators during contest dialogues that show considerable improvement in artificial conversational entities (ACE). Unlike their ancestor – Weizenbaum's natural language understanding system – ACE are now able to recall, share information and disclose personal interests.

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.

Neurofuzzy mixture of experts network parallel learning and model construction algorithms

A connection between a fuzzy neural network model with the mixture of experts network (MEN) modelling approach is established. Based on this linkage, two new neuro-fuzzy MEN construction algorithms are proposed to overcome the curse of dimensionality that is inherent in the majority of associative memory networks and/or other rule based systems. The first construction algorithm employs a function selection manager module in an MEN system. The second construction algorithm is based on a new parallel learning algorithm in which each model rule is trained independently, for which the parameter convergence property of the new learning method is established. As with the first approach, an expert selection criterion is utilised in this algorithm. These two construction methods are equivalent in their effectiveness in overcoming the curse of dimensionality by reducing the dimensionality of the regression vector, but the latter has the additional computational advantage of parallel processing. The proposed algorithms are analysed for effectiveness followed by numerical examples to illustrate their efficacy for some difficult data based modelling problems.

Electron spin resonance study of puff-resolved free radical formation in mainstream cigarette smoke

Puff-by-puff resolved gas phase free radicals were measured in mainstream smoke from Kentucky 2R4F reference cigarettes using ESR spectroscopy. Three spin-trapping reagents were evaluated: PBN, DMPO and DEPMPO. Two procedures were used to collect gas phase smoke on a puff-resolved basis: i) the accumulative mode, in which all the gas phase smoke up to a particular puff was bubbled into the trap (i.e., the 5th puff corresponded to the total smoke from the 1st to 5th puffs). In this case, after a specified puff, an aliquot of the spin trap was taken and analysed; or, ii) the individual mode, in which the spin trap was analysed and then replaced after each puff. Spin concentrations were determined by double-integration of the first derivative of the ESR signal. This was compared with the integrals of known standards using the TEMPO free radical. The radicals trapped with PBN were mainly carbon-centred, whilst the oxygen-centred radicals were identified with DMPO and DEPMPO. With each spin trap, the puff-resolved radical concentrations showed a characteristic pattern as a function of the puff number. Based on the spin concentrations, the DMPO and DEPMPO spin traps showed better trapping efficiencies than PBN. The implication for gas phase free radical analysis is that a range of different spin traps should be used to probe complex free radical reactions in cigarette smoke.

Electron paramagnetic resonance investigation of the free radicals in the gas and particulate phases of cigarette smoke using spin-trapping techniques

Free radicals in cigarette smoke have been studied using spin trapping EPR techniques. 2R4F reference cigarettes were smoked using 35 ml puff volumes of 2 seconds duration, once every 60 seconds. The particulate phase of the smoke was separated from the gas phase by passing the smoke through a Cambridge filter pad. For both phases, free radicals were measured and identified. A range of spin-traps was employed: PBN, DMPO, DEPMPO, and DPPH-PBN. In the gas-phase, short-lived carbon- and oxygen- centered radicals were identified; the ratios between them changed during the smoking runs. For the first puffs, C-centered radicals predominated while for the later puffs, O-centered radicals were mainly observed. The particulate phase and the ‘tar’ were studied as well.

A hydrogen-1 nuclear magnetic resonance, mass spectral and extended Hückel study of some olefin complexes of rhodium(I) and iridium(I) and the crystal and molecular structure of η4-2,4-dimethylpenta-1,4-diene(η5-formylcyclopentadienyl)rhodium(I)

A 1H NMR study of monosubstituted η-cyclopentadienyl-rhodium(I) complexes of type LLRh(C5H4X) and -iridium(I) complexes of type L2Ir(C5H4X) (L = ethene, LL = 1,3- or 1,5-diolefin; X = C(C6H5)3, CHO, or COOCH3) has been carried out. For complexes of both metals in which the neutral ligand is ethene or a non-conjugated diolefin the NMR spectra of the cyclopentadienyl protons are unusual in that H(2), H(5) resonate to high field either at room temperature or below. The corresponding NMR spectra for the cyclopentadienyl ring protons of complexes where the neutral ligand is a conjugated diene are, with one exception, normal. A single crystal X-ray structural analysis of (η4-2,4-dimethylpenta-1,4-diene)(η5-formylcyclopentadienyl)rhodium(I) (which exhibits an abnormal 1H NMR spectrum) reveals substantial localisation of electron density in the C(3)C(4) Cp ring bond (1.283(33) Å) which may be consistent with a contribution from an ‘allyl-ene’ rotamer to the ring—metal bonding scheme. An extended Hückel calculation with self consistent charge iteration was performed on this complex. The results predict a greater Mulliken overlap population for the C(3)C(4) bond in the cyclopentadienyl ring and show that the localisation is dependent on both the Cp ring substituent and the nature of the diolefin. The mass spectral fragmentation patterns of some representative diene complexes of iridium(I) and rhodium(I) are presented.

Parallel pipelined histogram architectures

Proposed is a unique cell histogram architecture which will process k data items in parallel to compute 2q histogram bins per time step. An array of m/2q cells computes an m-bin histogram with a speed-up factor of k; k ⩾ 2 makes it faster than current dual-ported memory implementations. Furthermore, simple mechanisms for conflict-free storing of the histogram bins into an external memory array are discussed.