Colloid chemical approach to nanoelectrode ensembles with highly controllable active area fraction

A novel "bottom-up" approach to highly controllable nanoelectrode ensembles (NEEs) has been developed using colloidal nanoparticle self-assembly techniques. Ibis solution-based strategy allows flexible control over nanoelectrode size, shape, and interspacing of the as-prepared NEEs. Atomic force microscopy (AFM) was proved to be a powerful tool to monitor the NEE topography, which yields parameters that can be used to calculate the fractional nanoelectrode area of the NEEs. AFM, ac impedance, and cyclic voltammetry studies demonstrate that most of nanoelectrodes on the NEEs (at least by 9-min self-assembly) are not diffusionally isolated under conventional ac frequency range and scan rates. As a result, the NEEs behave as "nanoelectrode-patch" assemblies. Besides, the as-prepared NEEs by different self-assembling times show an adjustable sensitivity to heterogeneous electron-transfer kinetics, which may be helpful to sensor applications. Like these NEEs constructed by other techniques, the present NEEs prepared by chemical self-assembly also exhibit the enhancement of electroanalytical detection limit consistent with NEE theory prediction.

Studies of electrochemical quantized capacitance charging of surface ensembles of silver nanoparticles

CTAB-stabilized silver nanoparticles were synthesized by NaBH4 reduction. The as-prepared nanoparticles can be self-assembled on 3-mercaptopropionic acid (MPA) modified gold electrode, which was supported strongly by XPS measurements. Exceptional long-term stability of the as-prepared colloidal silver aqueous solution and the desorption of silver nanoparticle ensemble on MPA after alcohol rinsing proved that these CTAB molecules adsorbed on silver core formed interdigitated bilayer structure. DPV and differential capacitance measurements were performed to characterize the as-prepared silver nanoparticle ensemble. and the interesting quantized capacitance charging behaviors were observed.

A new solid-supported iterative divergent/convergent strategy for the synthesis of dendrimers

A rapid and convenient solid-supported iterative divergent/converpent approach was developed to prepare rigid phenylacetylene dendrimers. The generation number grows very rapidly and the purification at each step is very simple. (C) 2001 Elsevier Science Ltd. All rights reserved.

Recognition of Topological Invariants by Iterative Arrays

A study is made of the recognition and transformation of figures by iterative arrays of finite state automata. A figure is a finite rectangular two-dimensional array of symbols. The iterative arrays considered are also finite, rectangular, and two-dimensional. The automata comprising any given array are called cells and are assumed to be isomorphic and to operate synchronously with the state of a cell at time t+1 being a function of the states of it and its four nearest neighbors at time t. At time t=0 each cell is placed in one of a fixed number of initial states. The pattern of initial states thus introduced represents the figure to be processed. The resulting sequence of array states represents a computation based on the input figure. If one waits for a specially designated cell to indicate acceptance or rejection of the figure, the array is said to be working on a recognition problem. If one waits for the array to come to a stable configuration representing an output figure, the array is said to be working on a transformation problem.

Iterative vs Simultaneous Fuzzy Rule Induction

M. Galea and Q. Shen. Iterative vs Simultaneous Fuzzy Rule Induction. Proceedings of the 14th International Conference on Fuzzy Systems, pages 767-772.

Evolutionary approaches to fuzzy modelling for classification

M. Galea, Q. Shen and J. Levine. Evolutionary approaches to fuzzy modelling. Knowledge Engineering Review, 19(1):27-59, 2004.

Encouraging Complementary Fuzzy Rules within Iterative Rule Learning

M. Galea, Q. Shen and V. Singh. Encouraging Complementary Fuzzy Rules within Iterative Rule Learning. Proceedings of the 2005 UK Workshop on Computational Intelligence, pages 15-22.

Iterative Linearized Density Matrix Propagation for Modeling Coherent Energy Transfer in Photosynthetic Light Harvesting

We present results of calculations [1] that employ a new mixed quantum classical iterative density matrix propagation approach (ILDM , or so called Is‐Landmap) [2] to explore the survival of coherence in different photo synthetic models. Our model studies confirm the long lived quantum coherence , while conventional theoretical tools (such as Redfield equation) fail to describe these phenomenon [3,4]. Our ILDM method is a numerical exactly propagation scheme and can be served as a bench mark calculation tools[2]. Result get from ILDM and from other recent methods have been compared and show agreement with each other[4,5]. Long lived coherence plateau has been attribute to the shift of harmonic potential due to the system bath interaction, and the harvesting efficiency is a balance between the coherence and dissipation[1]. We use this approach to investigate the excitation energy transfer dynamics in various light harvesting complex include Fenna‐Matthews‐Olsen light harvesting complex[1] and Cryptophyte Phycocyanin 645 [6]. [1] P.Huo and D.F.Coker ,J. Chem. Phys. 133, 184108 (2010) . [2] E.R. Dunkel, S. Bonella, and D.F. Coker, J. Chem. Phys. 129, 114106 (2008). [3] A. Ishizaki and G.R. Fleming, J. Chem. Phys. 130, 234111 (2009). [4] A. Ishizaki and G.R. Fleming, Proc. Natl. Acad. Sci. 106, 17255 (2009). [5] G. Tao and W.H. Miller, J. Phys. Chem. Lett. 1, 891 (2010). [6] P.Huo and D.F.Coker in preparation

Mapping Parallel Iterative Algorithms onto Workstation Networks

For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally that the performance of certain parallel applications running on a workstation network can be improved significantly if a congestion control protocol is used to enhance network performance. In this paper, we characterize and analyze the communication requirements of a large class of supercomputing applications that fall under the category of fixed-point problems, amenable to solution by parallel iterative methods. This results in a set of interface and architectural features sufficient for the efficient implementation of the applications over a large-scale distributed system. In particular, we propose a direct link between the application and network layer, supporting congestion control actions at both ends. This in turn enhances the system's responsiveness to network congestion, improving performance. Measurements are given showing the efficacy of our scheme to support large-scale parallel computations.

Control of the orientational order and nonlinear optical response of the "push-pull" chromophore RuPZn via specific incorporation into densely packed monolayer ensembles of an amphiphilic four-helix bundle peptide: characterization of the peptide-chromophore complexes.

"Push-pull" chromophores based on extended pi-electron systems have been designed to exhibit exceptionally large molecular hyperpolarizabilities. We have engineered an amphiphilic four-helix bundle peptide to vectorially incorporate such hyperpolarizable chromophores having a metalloporphyrin moiety, with high specificity into the interior core of the bundle. The amphiphilic exterior of the bundle facilitates the formation of densely packed monolayer ensembles of the vectorially oriented peptide-chromophore complexes at the liquid-gas interface. Chemical specificity designed into the ends of the bundle facilitates the subsequent covalent attachment of these monolayer ensembles onto the surface of an inorganic substrate. In this article, we describe the structural characterization of these monolayer ensembles at each stage of their fabrication for one such peptide-chromophore complex designated as AP0-RuPZn. In the accompanying article, we describe the characterization of their macroscopic nonlinear optical properties.

Gene selection using iterative feature elimination random forests for survival outcomes.

Although many feature selection methods for classification have been developed, there is a need to identify genes in high-dimensional data with censored survival outcomes. Traditional methods for gene selection in classification problems have several drawbacks. First, the majority of the gene selection approaches for classification are single-gene based. Second, many of the gene selection procedures are not embedded within the algorithm itself. The technique of random forests has been found to perform well in high-dimensional data settings with survival outcomes. It also has an embedded feature to identify variables of importance. Therefore, it is an ideal candidate for gene selection in high-dimensional data with survival outcomes. In this paper, we develop a novel method based on the random forests to identify a set of prognostic genes. We compare our method with several machine learning methods and various node split criteria using several real data sets. Our method performed well in both simulations and real data analysis.Additionally, we have shown the advantages of our approach over single-gene-based approaches. Our method incorporates multivariate correlations in microarray data for survival outcomes. The described method allows us to better utilize the information available from microarray data with survival outcomes.

Regularized iterative and non-iterative procedures for object restoration from experimental data

A regularized algorithm for the recovery of band-limited signals from noisy data is described. The regularization is characterized by a single parameter. Iterative and non-iterative implementations of the algorithm are shown to have useful properties, the former offering the advantage of flexibility and the latter a potential for rapid data processing. Comparative results, using experimental data obtained in laser anemometry studies with a photon correlator, are presented both with and without regularization. © 1983 Taylor & Francis Ltd.

A regularized iterative algorithm for limited-angle inverse Radon transform

The tomography problem is investigated when the available projections are restricted to a limited angular domain. It is shown that a previous algorithm proposed for extrapolating the data to the missing cone in Fourier space is unstable in the presence of noise because of the ill-posedness of the problem. A regularized algorithm is proposed, which converges to stable solutions. The efficiency of both algorithms is tested by means of numerical simulations. © 1983 Taylor and Francis Group, LLC.

Regularization of an iterative algorithm for the extrapolation of bandlimited signals

info:eu-repo/semantics/published

Regularized iterative and noniterative procedures for object restoration in the presence of noise :an error analysis

An analysis is carried out, using the prolate spheroidal wave functions, of certain regularized iterative and noniterative methods previously proposed for the achievement of object restoration (or, equivalently, spectral extrapolation) from noisy image data. The ill-posedness inherent in the problem is treated by means of a regularization parameter, and the analysis shows explicitly how the deleterious effects of the noise are then contained. The error in the object estimate is also assessed, and it is shown that the optimal choice for the regularization parameter depends on the signal-to-noise ratio. Numerical examples are used to demonstrate the performance of both unregularized and regularized procedures and also to show how, in the unregularized case, artefacts can be generated from pure noise. Finally, the relative error in the estimate is calculated as a function of the degree of superresolution demanded for reconstruction problems characterized by low space–bandwidth products.