Comparison of the computational cost of a Monte Carlo and deterministic algorithm for computing bilinear forms of matrix powers

In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can be used to construct solutions for the problems of solving systems of linear algebraic equations, matrix inversion and finding extremal eigenvalues. An almost Optimal Monte Carlo (MAO) algorithm for computing bilinear forms of matrix polynomials is presented. Results for the computational costs of a balanced algorithm for computing the bilinear form of a matrix power is presented, i.e., an algorithm for which probability and systematic errors are of the same order, and this is compared with the computational cost for a corresponding deterministic method.

A blueprint for affective computing: A sourcebook

A Blueprint for Affective Computing: A sourcebook and manual is the very first attempt to ground affective computing within the disciplines of psychology, affective neuroscience, and philosophy. This book illustrates the contributions of each of these disciplines to the development of the ever-growing field of affective computing. In addition, it demonstrates practical examples of cross-fertilization between disciplines in order to highlight the need for integration of computer science, engineering and the affective sciences.

Spectroscopy of ultrathin epitaxial rutile TiO[sub 2](110) films grown on W(100)

Epitaxial ultrathin titanium dioxide films of 0.3 to similar to 7 nm thickness on a metal single crystal substrate have been investigated by high resolution vibrational and electron spectroscopies. The data complement previous morphological data provided by scanned probe microscopy and low energy electron diffraction to provide very complete characterization of this system. The thicker films display electronic structure consistent with a stoichiometric TiO2 phase. The thinner films appear nonstoichiometric due to band bending and charge transfer from the metal substrate, while work function measurements also show a marked thickness dependence. The vibrational spectroscopy shows three clear phonon bands at 368, 438, and 829 cm(-1) (at 273 K), which confirms a rutile structure. The phonon band intensity scales linearly with film thickness and shift slightly to lower frequencies with increasing temperature, in accord with results for single crystals. (c) 2007 American Institute of Physics.

Ultrafast charge separation in a photoreactive rhenium-appended porphyrin assembly monitored by picosecond transient infrared spectroscopy

Rhenium(bipyridine)(tricarbonyl)(picoline) units have been linked covalently to tetraphenylmetalloporphyrins of magnesium and zinc via an amide bond between the bipyridine and one phenyl substituent of the porphyrin. The resulting complexes, abbreviated as [Re(CO)(3)(Pic)Bpy-MgTPP][OTf] and [Re(CO)(3)(Pic)Bpy-ZnTPP][OTf], exhibit no signs of electronic interaction between the Re(CO)(3)(bpy) units and the metalloporphyrin units in their ground states. However, emission spectroscopy reveals solvent-dependent quenching of porphyrin emission on irradiation into the long-wavelength absorption bands localized on the porphyrin. The characteristics of the excited states have been probed by picosecond time-resolved absorption (TRVIS) spectroscopy and time-resolved infrared (TRIR) spectroscopy in nitrile solvents. The presence of the charge-separated state involving electron transfer from MgTPP or ZnTPP to Re(bpy) is signaled in the TRIR spectra by a low-frequency shift in the nu(CO) bands of the Re(CO)(3) moiety similar to that observed by spectroelectrochemical reduction. Long-wavelength excitation of [Re(CO)(3)(Pic)Bpy-MTPP][OTf] results in characteristic TRVIS spectra of the S-1 state of the porphyrin that decay with a time constant of 17 ps (M = Mg) or 24 ps (M = Zn). The IR bands of the CS state appear on a time scale of less than 1 ps (Mg) or ca. 5 ps (Zn) and decay giving way to a vibrationally excited (i.e., hot) ground state via back electron transfer. The IR bands of the precursors recover with a time constant of 35 ps (Mg) or 55 ps (Zn). The short lifetimes of the charge-transfer states carry implications for the mechanism of reaction in the presence of triethylamine.

Low-lying excited states and primary photoproducts of [Os-3(CO)(10)-(s-cis-L)] (L = cyclohexa-1,3-diene, buta-1,3-diene)] clusters studied by picosecond time-resolved UV/Vis and IR spectroscopy and by density functional theory

Combined picosecond transient absorption and time-resolved infrared studies were performed, aimed at characterising low-lying excited states of the cluster [Os-3(CO)(10)(s-cis-L)] (L= cyclohexa-1,3-diene, 1) and monitoring the formation of its photoproducts. Theoretical (DFT and TD-DFT) calculations on the closely related cluster with L=buta-1,3-diene (2') have revealed that the low-lying electronic transitions of these [Os-3(CO)(10)(s-cis-1,3-diene)] clusters have a predominant sigma(core)pi*(CO) character. From the lowest sigmapi* excited state, cluster 1 undergoes fast Os-Os(1,3-diene) bond cleavage (tau=3.3 ps) resulting in the formation of a coordinatively unsaturated primary photoproduct (1a) with a single CO bridge. A new insight into the structure of the transient has been obtained by DFT calculations. The cleaved Os-Os(1,3-diene) bond is bridged by the donor 1,3-diene ligand, compensating for the electron deficiency at the neighbouring Os centre. Because of the unequal distribution of the electron density in transient la, a second CO bridge is formed in 20 ps in the photoproduct [Os-3(CO)(8)(mu-CO)(2)- (cyclohexa-1,3-diene)] (1b). The latter compound, absorbing strongly around 630 nm, mainly regenerates the parent cluster with a lifetime of about 100 ns in hexane. Its structure, as suggested by the DFT calculations, again contains the 1,3-diene ligand coordinated in a bridging fashion. Photoproduct 1b can therefore be assigned as a high-energy coordination isomer of the parent cluster with all Os-Os bonds bridged.

Synthesis, spectroscopy and spectroelectrochemistry of chlorocarbonyl {1,2-bis[(2,6-diisopropylphenyl)imino]-acenaphthene-kappa(2)-N,N '}rhodium (I)

Reaction of the dinuclear complex [{Rh(CO)(2)}(2) (mu-Cl)(2)]with an alpha-diimine ligand, 1,2- bis[(2,6-diisopropylphenyl) imino] acenaphthene (iPr(2)Ph-bian), produces square-planar [RhCl(CO)(iPr(2)Ph-bian)]. For the first time, 2: 1 and 1: 1 alpha-diimine/dimer reactions yielded the same product. The rigidity of iPr(2)Ph-bian together with its flexible electronic properties and steric requirements of the 2,6-diisopropyl substituents on the benzene rings allow rapid closure of a chelate bond and replacement of a CO ligand instead of chloride. A resonance Raman study of [RhCl(CO)(iPr(2)Ph-bian)] has revealed a predominant Rh-to-bian charge transfer (MLCT) character of electronic transitions in the visible spectral region. The stabilisation of [RhCl(CO)(iPr(2)Ph-bian)] in lower oxidation states by the pi-acceptor iPr(2)Ph-bian ligand was investigated in situ by UV-VIS, IR and EPR spectroelectrochemistry at variable temperatures. The construction of the novel UV-VIS-NIR-IR low-temperature OTTLE cell used in these studies is described in the last part of the paper.

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.

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.

A simple fluid cell for the study of aqueous solutions using THz time-domain spectroscopy

We describe a fluid cell for the measurement of aqueous solutions of biomolecules adapted particularly for the requirements of THz time-domain spectroscopy. The design is simple, requires small-volume samples, avoids cross-contamination and is inexpensive.

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.