912 resultados para diffusion coefficients
Resumo:
An analysis of Stochastic Diffusion Search (SDS), a novel and efficient optimisation and search algorithm, is presented, resulting in a derivation of the minimum acceptable match resulting in a stable convergence within a noisy search space. The applicability of SDS can therefore be assessed for a given problem.
Resumo:
An information processing paradigm in the brain is proposed, instantiated in an artificial neural network using biologically motivated temporal encoding. The network will locate within the external world stimulus, the target memory, defined by a specific pattern of micro-features. The proposed network is robust and efficient. Akin in operation to the swarm intelligence paradigm, stochastic diffusion search, it will find the best-fit to the memory with linear time complexity. information multiplexing enables neurons to process knowledge as 'tokens' rather than 'types'. The network illustrates possible emergence of cognitive processing from low level interactions such as memory retrieval based on partial matching. (C) 2007 Elsevier B.V. All rights reserved.
Resumo:
The current study aims to assess the applicability of direct or indirect normalization for the analysis of fractional anisotropy (FA) maps in the context of diffusion-weighted images (DWIs) contaminated by ghosting artifacts. We found that FA maps acquired by direct normalization showed generally higher anisotropy than indirect normalization, and the disparities were aggravated by the presence of ghosting artifacts in DWIs. The voxel-wise statistical comparisons demonstrated that indirect normalization reduced the influence of artifacts and enhanced the sensitivity of detecting anisotropy differences between groups. This suggested that images contaminated with ghosting artifacts can be sensibly analyzed using indirect normalization.
Resumo:
We present a novel approach to calculating Low-Energy Electron Diffraction (LEED) intensities for ordered molecular adsorbates. First, the intra-molecular multiple scattering is computed to obtain a non-diagonal molecular T-matrix. This is then used to represent the entire molecule as a single scattering object in a conventional LEED calculation, where the Layer Doubling technique is applied to assemble the different layers, including the molecular ones. A detailed comparison with conventional layer-type LEED calculations is provided to ascertain the accuracy of this scheme of calculation. Advantages of this scheme for problems involving ordered arrays of molecules adsorbed on surfaces are discussed.
Resumo:
The kinetics of the reactions of the atoms O(P-3), S(P-3), Se(P-3), and Te((3)p) with a series of alkenes are examined for correlations relating the logarithms of the rate coefficients to the energies of the highest occupied molecular orbitals (HOMOs) of the alkenes. These correlations may be employed to predict rate coefficients from the calculated HOMO energy of any other alkene of interest. The rate coefficients obtained from the correlations were used to formulate structure-activity relations (SARs) for reactions of O((3)p), S(P-3), Se (P-3), and Te((3)p) with alkenes. A comparison of the values predicted by both the correlations and the SARs with experimental data where they exist allowed us to assess the reliability of our method. We demonstrate the applicability of perturbation frontier molecular orbital theory to gas-phase reactions of these atoms with alkenes. The correlations are apparently not applicable to reactions of C(P-3), Si(P-3), N(S-4), and Al(P-2) atoms with alkenes, a conclusion that could be explained in terms of a different mechanism for reaction of these atoms.
Resumo:
Rate coefficients for reactions of nitrate radicals (NO3) with (Z)-pent-2-ene, (E)-pent-2-ene, (Z)-hex-2-ene, (E)-hex-2-ene, (Z)-hex-3-ene, (E)-hex-3-ene and (E)-3-methylpent-2-ene were determined to be (6.55 +/- 0.78) x 10(-13) cm(3) molecule(-1) s(-1), (3.78 +/- 0.45) x 10(-13) cm(3) molecule(-1) s(-1), (5.30 +/- 0.73) x 10(-13) cm(3) molecule(-1) s(-1), (3.83 +/- 0.47) x 10(-13) cm(3) molecule(-1) s(-1), (4.37 +/- 0.49) x 10(-13) cm(3) molecule(-1) s(-1), (3.61 +/- 0.40) x 10(-13) cm(3) molecule(-1) s(-1) and (8.9 +/- 1.5) x 10(-12) cm(3) molecule(-1) s(-1), respectively. We performed kinetic experiments at room temperature and atmospheric pressure using a relative-rate technique with GC-FID analysis. The experimental results demonstrate a surprisingly large cis-trans (Z-E) effect, particularly in the case of the pent-2-enes, where the ratio of rate coefficients is ca. 1.7. Rate coefficients are discussed in terms of electronic and steric influences, and our results give some insight into the effects of chain length and position of the double bond on the reaction of NO3 with unsaturated hydrocarbons. Atmospheric lifetimes were calculated with respect to important oxidants in the troposphere for the alkenes studied, and NO3-initiated oxidation is found to be the dominant degradation route for (Z)-pent-2-ene, (Z)-hex-3-ene and (E)-3-methylpent-2-ene.
Resumo:
This paper represents the last technical contribution of Professor Patrick Parks before his untimely death in February 1995. The remaining authors of the paper, which was subsequently completed, wish to dedicate the article to Patrick. A frequency criterion for the stability of solutions of linear difference equations with periodic coefficients is established. The stability criterion is based on a consideration of the behaviour of a frequency hodograph with respect to the origin of coordinates in the complex plane. The formulation of this criterion does not depend on the order of the difference equation.
Resumo:
The Stochastic Diffusion Search (SDS) was developed as a solution to the best-fit search problem. Thus, as a special case it is capable of solving the transform invariant pattern recognition problem. SDS is efficient and, although inherently probabilistic, produces very reliable solutions in widely ranging search conditions. However, to date a systematic formal investigation of its properties has not been carried out. This thesis addresses this problem. The thesis reports results pertaining to the global convergence of SDS as well as characterising its time complexity. However, the main emphasis of the work, reports on the resource allocation aspect of the Stochastic Diffusion Search operations. The thesis introduces a novel model of the algorithm, generalising an Ehrenfest Urn Model from statistical physics. This approach makes it possible to obtain a thorough characterisation of the response of the algorithm in terms of the parameters describing the search conditions in case of a unique best-fit pattern in the search space. This model is further generalised in order to account for different search conditions: two solutions in the search space and search for a unique solution in a noisy search space. Also an approximate solution in the case of two alternative solutions is proposed and compared with predictions of the extended Ehrenfest Urn model. The analysis performed enabled a quantitative characterisation of the Stochastic Diffusion Search in terms of exploration and exploitation of the search space. It appeared that SDS is biased towards the latter mode of operation. This novel perspective on the Stochastic Diffusion Search lead to an investigation of extensions of the standard SDS, which would strike a different balance between these two modes of search space processing. Thus, two novel algorithms were derived from the standard Stochastic Diffusion Search, ‘context-free’ and ‘context-sensitive’ SDS, and their properties were analysed with respect to resource allocation. It appeared that they shared some of the desired features of their predecessor but also possessed some properties not present in the classic SDS. The theory developed in the thesis was illustrated throughout with carefully chosen simulations of a best-fit search for a string pattern, a simple but representative domain, enabling careful control of search conditions.
Resumo:
In this paper we present a connectionist searching technique - the Stochastic Diffusion Search (SDS), capable of rapidly locating a specified pattern in a noisy search space. In operation SDS finds the position of the pre-specified pattern or if it does not exist - its best instantiation in the search space. This is achieved via parallel exploration of the whole search space by an ensemble of agents searching in a competitive cooperative manner. We prove mathematically the convergence of stochastic diffusion search. SDS converges to a statistical equilibrium when it locates the best instantiation of the object in the search space. Experiments presented in this paper indicate the high robustness of SDS and show good scalability with problem size. The convergence characteristic of SDS makes it a fully adaptive algorithm and suggests applications in dynamically changing environments.
Resumo:
Stochastic Diffusion Search is an efficient probabilistic bestfit search technique, capable of transformation invariant pattern matching. Although inherently parallel in operation it is difficult to implement efficiently in hardware as it requires full inter-agent connectivity. This paper describes a lattice implementation, which, while qualitatively retaining the properties of the original algorithm, restricts connectivity, enabling simpler implementation on parallel hardware. Diffusion times are examined for different network topologies, ranging from ordered lattices, over small-world networks to random graphs.
Resumo:
By using a deterministic approach, an exact form for the synchronous detected video signal under a ghosted condition is presented. Information regarding the phase quadrature-induced ghost component derived from the quadrature forming nature of the vestigial sideband (VSB) filter is obtained by crosscorrelating the detected video with the ghost cancel reference (GCR) signal. As a result, the minimum number of taps required to correctly remove all the ghost components is subsequently presented. The results are applied to both National Television System Committee (NTSC) and phase alternate line (PAL) television.
Resumo:
We show that an analysis of the mean and variance of discrete wavelet coefficients of coaveraged time-domain interferograms can be used as a specification for determining when to stop coaveraging. We also show that, if a prediction model built in the wavelet domain is used to determine the composition of unknown samples, a stopping criterion for the coaveraging process can be developed with respect to the uncertainty tolerated in the prediction.