Detailed analytical investigation of magnetic field line random walk in turbulent plasmas: I. Two-component slab/two-dimensional turbulence

The random displacement of magnetic field lines in the presence of magnetic turbulence in plasmas is investigated from first principles. A two-component (slab/two-dimensional composite) model for the turbulence spectrum is employes. An analytical investigation of the asymptotic behavior of the field-line mean square displacement (FL-MSD) is carried out. It is shown that the magnetic field lines behave superdifusively for every large values of the position variable z, since the FL-MSD sigma varies as sigma similar to z(4/3). An intermediate diffusive regime may also possible exist for finite values of z under conditions which are explicitly determined in terms of the intrinsic turbulent plasma parameters. The superdiffusie asymptotic result is confirmed numerically via an iterative algorithm. The relevance to previous resuslts is discussed.

Detailed analytical investigation of magnetic field line random walk in turbulent plasmas: II. Isotropic turbulence

The random walk of magnetic field lines in the presence of magnetic turbulence in plasmas is investigated from first principles. An isotropic model is employed for the magnetic turbulence spectrum. An analytical investigation of the asymptotic behavior of the field-line mean-square displacement is carried out. in terms of the position variable z. It is shown that varies as similar to z ln z for large distance z. This result corresponds to a superdiffusive behavior of field line wandering. This investigation complements previous work, which relied on a two-component model for the turbulence spectrum. Contrary to that model, quasilinear theory appears to provide an adequate description of the field line random walk for isotropic turbulence.

A similarity measure for graphs with low computational complexity

We present and analyze an algorithm to measure the structural similarity of generalized trees, a new graph class which includes rooted trees. For this, we represent structural properties of graphs as strings and define the similarity of two Graphs as optimal alignments of the corresponding property stings. We prove that the obtained graph similarity measures are so called Backward similarity measures. From this we find that the time complexity of our algorithm is polynomial and, hence, significantly better than the time complexity of classical graph similarity methods based on isomorphic relations. (c) 2006 Elsevier Inc. All rights reserved.

Discrete Conditional Phase-type models utilising classification trees: Application to modelling health service capacities

Discrete Conditional Phase-type (DC-Ph) models consist of a process component (survival distribution) preceded by a set of related conditional discrete variables. This paper introduces a DC-Ph model where the conditional component is a classification tree. The approach is utilised for modelling health service capacities by better predicting service times, as captured by Coxian Phase-type distributions, interfaced with results from a classification tree algorithm. To illustrate the approach, a case-study within the healthcare delivery domain is given, namely that of maternity services. The classification analysis is shown to give good predictors for complications during childbirth. Based on the classification tree predictions, the duration of childbirth on the labour ward is then modelled as either a two or three-phase Coxian distribution. The resulting DC-Ph model is used to calculate the number of patients and associated bed occupancies, patient turnover, and to model the consequences of changes to risk status.

Evaluation of Random Delay Insertion against DPA on FPGAs

Side-channel attacks (SCA) threaten electronic cryptographic devices and can be carried out by monitoring the physical characteristics of security circuits. Differential Power Analysis (DPA) is one the most widely studied side-channel attacks. Numerous countermeasure techniques, such as Random Delay Insertion (RDI), have been proposed to reduce the risk of DPA attacks against cryptographic devices. The RDI technique was first proposed for microprocessors but it was shown to be unsuccessful when implemented on smartcards as it was vulnerable to a variant of the DPA attack known as the Sliding-Window DPA attack.Previous research by the authors investigated the use of the RDI countermeasure for Field Programmable Gate Array (FPGA) based cryptographic devices. A split-RDI technique wasproposed to improve the security of the RDI countermeasure. A set of critical parameters wasalso proposed that could be utilized in the design stage to optimize a security algorithm designwith RDI in terms of area, speed and power. The authors also showed that RDI is an efficientcountermeasure technique on FPGA in comparison to other countermeasures.In this article, a new RDI logic design is proposed that can be used to cost-efficiently implementRDI on FPGA devices. Sliding-Window DPA and realignment attacks, which were shown to beeffective against RDI implemented on smartcard devices, are performed on the improved RDIFPGA implementation. We demonstrate that these attacks are unsuccessful and we also proposea realignment technique that can be used to demonstrate the weakness of RDI implementations.

Increasing entanglement through engineered disorder in the random Ising chain

The ground-state entanglement entropy between block of sites in the random Ising chain is studied by means of the Von Neumann entropy. We show that in presence of strong correlations between the disordered couplings and local magnetic fields the entanglement increases and becomes larger than in the ordered case. The different behavior with respect to the uncorrelated disordered model is due to the drastic change of the ground state properties. The same result holds also for the random three-state quantum Potts model.

On the ability to metaphorize: Talking trees and singing tigers in the English classroom

This article reviews and discusses how metaphor as a trope has been regarded as an essential element in rhetorical approaches to reading and to writing. In addition it considers the extent to which, while metaphor-making is a fundamental cognitive capacity, a metaphorizing habit of mind may be especially pertinent to some aspects of aesthetic activity in English and it has salience also in a multimodal environment. There is exploration of how contemporary practice in the English classroom could accommodate and consolidate the ability to metaphorize.

Combined antenna and localized plasmon resonance in Raman scattering from Random arrays of silver-coated, vertically aligned multiwalled carbon nanotubes

The electric field enhancement associated with detailed structure within novel optical antenna nanostructures is modeled using the surface integral equation technique in the context of surface-enhanced Raman scattering (SERS). The antennae comprise random arrays of vertically aligned, multi-walled carbon nanotubes dressed with highly granular Ag. Different types of "hot-spot" underpinning the SERS are identified, but contrasting characteristics are revealed. Those at the outer edges of the Ag grains are antenna driven with field enhancement amplified in antenna antinodes while intergrain hotspots are largely independent of antenna activity. Hot-spots between the tops of antennae leaning towards each other also appear to benefit from antenna amplification.

Topological mappings between graphs, trees and generalized trees

We present novel topological mappings between graphs, trees and generalized trees that means between structured objects with different properties. The two major contributions of this paper are, first, to clarify the relation between graphs, trees and generalized trees, a graph class recently introduced. Second, these transformations provide a unique opportunity to transform structured objects into a representation that might be beneficial for a processing, e.g., by machine learning techniques for graph classification. (c) 2006 Elsevier Inc. All rights reserved.