Assembly of the transition metal substituted polyoxometalates ZnW11M(H2O)O-39(n-) (M = Mn, Cu, Fe, Co, Cr, Ni, Zn) on 4-aminobenzoic acid modified glassy carbon electrode and their electrochemical study

Through layer-by-layer assembly, a series of undecatungstozincates monosubstituted by first-row transition metals, ZnW11M(H2O)O-39(n-) (M=Cr, Mn, Fe, Co, Ni, Cu. or Zn) were first successfully immobilized on a 4-aminobenzoic acid modified glassy carbon electrode surface. The electrochemical behaviors of these polyoxometalates were investigated. They exhibit some special properties in the films different from those in homogeneous aqueous solution. The Cu-centered reaction mechanism in the ZnW11Cu multilayer film was described. The electrocatalytic behaviors of these multilayer film electrodes to the reduction of H2O2 and BrO3- were comparatively studied.

Investigation of the model compounds at 4-aminobenzoic acid modified glassy carbon electrode by scanning electrochemical microscopy

In this paper, we studied the reactions of both potassium ferricyanide and hexaammineruthenium(III) chloride at a 4-aminobenzoic acid (4-ABA) modified glassy carbon electrode (GCE) by scanning electrochemical microscopy (SECM) in different pH solutions. The surface of the modified electrode has carboxyl groups, the dissociation of which are strongly dependent upon the solution pH values. The rate constant kb of the oxidation of ferrocyanide on the modified electrode can be obtained by fitting the experimental tip current-distance (I-T-d) curves with the theoretical values. The surface pK(a) of the 4-ABA modified GCE was estimated from the plot of standard rate constant k(o) versus the solution pH and is equal to 3.2, which is in good agreement with the reported result. The SECM approach curves for Ru(NH3)(6)(3+) both on the bare and the modified electrodes show similar diffusion control processes. These results can be explained by the electrostatic interactions between the modified electrode surface and the model compounds with different charges. (C) 2001 Elsevier Science BN. All rights reserved.

Formation of a self-assembled monolayer of 2-mercapto-3-n-octylthiophene on gold

Monolayer assembly of 2-mercapto-3-n-octylthiophene (MOT) having a relatively large headgroup onto gold surface from its dilute ethanolic solutions has been investigated by electrochemistry. An electrochemical capacitance measurement on the permeability of the monolayer to aqueous ions, as compared with its alkanethiol counterpart [CH3(CH2)(9)SH (DT)] with a similar molecular length, shows that the self-assembled monolayers (SAMs) of MOT can be penetrated by aqueous ions to some extent. Furthermore, organic molecular probes, such as dopamine, can sufficiently diffuse into the monolayer because a diffusion-limited current peak is observed when the dopamine oxidation reaction takes place, showing that the monolayer is loosely packed or dominated by defects. But the results of electron transfer to aqueous redox probes (including voltammetry in Fe(CN)(6)(3-/4-) solutions and electrochemical ac impedance spectrum) confirm that the monolayer can passivate the gold electrode surface effectively for its very low ratio of pinhole defects. Moreover, a heterogeneous patching process involving addition of the surfactants into the SAMs provides a mixed or hybrid membrane that has superior passivating properties. These studies show that the MOT monolayer on the electrode can provide an excellent barrier for hydrated ionic probe penetration but cannot resist the organic species penetration effectively. The unusual properties of the SAMs are attributed to the entity of the relatively large thiophene moiety between the carbon chain and the thiol group.

FABRICATION OF STM TIPS WITH CONTROLLED GEOMETRY BY ELECTROCHEMICAL ETCHING AND ECSTM TIPS COATED WITH PARAFFIN

We have presented two simple methods of ''unfixed-position shield'' and ''pulling out'' for making sharp STM Pt-Ir tips with low aspect ratio by electrochemical etching in KCN/NaOH aqueous solution and ECSTM tips coated with paraffin. By limiting the elec

STUDIED ON THE SIMULTANEOUS SPECTROPHOTOMETRIC DETERMINATION OF INORGANIC MULTICOMPONENT SYSTEMS .3. DETERMINATION OF MICROAMOUNTS OF TUNGSTEN, MOLYBDENUM AND TITANIUM

The absorption spectra of W, Mo and Ti-phenylfluorone cetyltrimethylammonium bromide complexes and the optimum conditions for the simultaneous spectrophotometric determination of microamounts of W, Mo and Ti were studied. In order to examine the effect of the errors of calibration matrix on the analytical resulte, the approach of selecting the analytical wavelengths was investigated and the comparison of computation results between AKC method (the matrix representation of Beer-Lambert's Law) and ...

Structural Saliency: The Detection of Globally Salient Structures Using a Locally Connected Network

Certain salient structures in images attract our immediate attention without requiring a systematic scan. We present a method for computing saliency by a simple iterative scheme, using a uniform network of locally connected processing elements. The network uses an optimization approach to produce a "saliency map," a representation of the image emphasizing salient locations. The main properties of the network are: (i) the computations are simple and local, (ii) globally salient structures emerge with a small number of iterations, and (iii) as a by-product of the computations, contours are smoothed and gaps are filled in.

A Theory of Networks for Appxoimation and Learning

Learning an input-output mapping from a set of examples, of the type that many neural networks have been constructed to perform, can be regarded as synthesizing an approximation of a multi-dimensional function, that is solving the problem of hypersurface reconstruction. From this point of view, this form of learning is closely related to classical approximation techniques, such as generalized splines and regularization theory. This paper considers the problems of an exact representation and, in more detail, of the approximation of linear and nolinear mappings in terms of simpler functions of fewer variables. Kolmogorov's theorem concerning the representation of functions of several variables in terms of functions of one variable turns out to be almost irrelevant in the context of networks for learning. We develop a theoretical framework for approximation based on regularization techniques that leads to a class of three-layer networks that we call Generalized Radial Basis Functions (GRBF), since they are mathematically related to the well-known Radial Basis Functions, mainly used for strict interpolation tasks. GRBF networks are not only equivalent to generalized splines, but are also closely related to pattern recognition methods such as Parzen windows and potential functions and to several neural network algorithms, such as Kanerva's associative memory, backpropagation and Kohonen's topology preserving map. They also have an interesting interpretation in terms of prototypes that are synthesized and optimally combined during the learning stage. The paper introduces several extensions and applications of the technique and discusses intriguing analogies with neurobiological data.

Properties and Applications of Shape Recipes

In low-level vision, the representation of scene properties such as shape, albedo, etc., are very high dimensional as they have to describe complicated structures. The approach proposed here is to let the image itself bear as much of the representational burden as possible. In many situations, scene and image are closely related and it is possible to find a functional relationship between them. The scene information can be represented in reference to the image where the functional specifies how to translate the image into the associated scene. We illustrate the use of this representation for encoding shape information. We show how this representation has appealing properties such as locality and slow variation across space and scale. These properties provide a way of improving shape estimates coming from other sources of information like stereo.

Automatically Recovering Geometry and Texture from Large Sets of Calibrated Images

Three-dimensional models which contain both geometry and texture have numerous applications such as urban planning, physical simulation, and virtual environments. A major focus of computer vision (and recently graphics) research is the automatic recovery of three-dimensional models from two-dimensional images. After many years of research this goal is yet to be achieved. Most practical modeling systems require substantial human input and unlike automatic systems are not scalable. This thesis presents a novel method for automatically recovering dense surface patches using large sets (1000's) of calibrated images taken from arbitrary positions within the scene. Physical instruments, such as Global Positioning System (GPS), inertial sensors, and inclinometers, are used to estimate the position and orientation of each image. Essentially, the problem is to find corresponding points in each of the images. Once a correspondence has been established, calculating its three-dimensional position is simply a matter of geometry. Long baseline images improve the accuracy. Short baseline images and the large number of images greatly simplifies the correspondence problem. The initial stage of the algorithm is completely local and scales linearly with the number of images. Subsequent stages are global in nature, exploit geometric constraints, and scale quadratically with the complexity of the underlying scene. We describe techniques for: 1) detecting and localizing surface patches; 2) refining camera calibration estimates and rejecting false positive surfels; and 3) grouping surface patches into surfaces and growing the surface along a two-dimensional manifold. We also discuss a method for producing high quality, textured three-dimensional models from these surfaces. Some of the most important characteristics of this approach are that it: 1) uses and refines noisy calibration estimates; 2) compensates for large variations in illumination; 3) tolerates significant soft occlusion (e.g. tree branches); and 4) associates, at a fundamental level, an estimated normal (i.e. no frontal-planar assumption) and texture with each surface patch.

AMAR: A Computational Model of Autosegmental Phonology

This report describes a computational system with which phonologists may describe a natural language in terms of autosegmental phonology, currently the most advanced theory pertaining to the sound systems of human languages. This system allows linguists to easily test autosegmental hypotheses against a large corpus of data. The system was designed primarily with tonal systems in mind, but also provides support for tree or feature matrix representation of phonemes (as in The Sound Pattern of English), as well as syllable structures and other aspects of phonological theory. Underspecification is allowed, and trees may be specified before, during, and after rule application. The association convention is automatically applied, and other principles such as the conjunctivity condition are supported. The method of representation was designed such that rules are designated in as close a fashion as possible to the existing conventions of autosegmental theory while adhering to a textual constraint for maximum portability.

Automated Acquisition of Evolving Informal Descriptions

The Listener is an automated system that unintrusively performs knowledge acquisition from informal input. The Listener develops a coherent internal representation of a description from an initial set of disorganized, imprecise, incomplete, ambiguous, and possibly inconsistent statements. The Listener can produce a summary document from its internal representation to facilitate communication, review, and validation. A special purpose Listener, called the Requirements Apprentice (RA), has been implemented in the software requirements acquisition domain. Unlike most other requirements analysis tools, which start from a formal description language, the focus of the RA is on the transition between informal and formal specifications.

Syntax-Based Analytic Reading of Musical Scores

As part of a larger research project in musical structure, a program has been written which "reads" scores encoded in an input language isomorphic to music notation. The program is believed to be the first of its kind. From a small number of parsing rules the program derives complex configurations, each of which is associated with a set of reference points in a numerical representation of a time-continuum. The logical structure of the program is such that all and only the defined classes of events are represented in the output. Because the basis of the program is syntactic (in the sense that parsing operations are performed on formal structures in the input string), many extensions and refinements can be made without excessive difficulty. The program can be applied to any music which can be represented in the input language. At present, however, it constitutes the first stage in the development of a set of analytic tools for the study of so-called atonal music, the revolutionary and little understood music which has exerted a decisive influence upon contemporary practice of the art. The program and the approach to automatic data-structuring may be of interest to linguists and scholars in other fields concerned with basic studies of complex structures produced by human beings.

On Motion Planning with Uncertainty

Robots must successfully plan and execute tasks in the presence of uncertainty. Uncertainty arises from errors in modeling, sensing, and control. Planning in the presence of uncertainty constitutes one facet of the general motion planning problem in robotics. This problem is concerned with the automatic synthesis of motion strategies from high level task specification and geometric models of environments. In order to develop successful motion strategies, it is necessary to understand the effect of uncertainty on the geometry of object interactions. Object interactions, both static and dynamic, may be represented in geometrical terms. This thesis investigates geometrical tools for modeling and overcoming uncertainty. The thesis describes an algorithm for computing backprojections o desired task configurations. Task goals and motion states are specified in terms of a moving object's configuration space. Backprojections specify regions in configuration space from which particular motions are guaranteed to accomplish a desired task. The backprojection algorithm considers surfaces in configuration space that facilitate sliding towards the goal, while avoiding surfaces on which motions may prematurely halt. In executing a motion for a backprojection region, a plan executor must be able to recognize that a desired task has been accomplished. Since sensors are subject to uncertainty, recognition of task success is not always possible. The thesis considers the structure of backprojection regions and of task goals that ensures goal recognizability. The thesis also develops a representation of friction in configuration space, in terms of a friction cone analogous to the real space friction cone. The friction cone provides the backprojection algorithm with a geometrical tool for determining points at which motions may halt.

Representations and evolutionary operators for the scheduling of pump operations in water distribution networks.

Reducing the energy consumption of water distribution networks has never had more significance. The greatest energy savings can be obtained by carefully scheduling the operations of pumps. Schedules can be defined either implicitly, in terms of other elements of the network such as tank levels, or explicitly by specifying the time during which each pump is on/off. The traditional representation of explicit schedules is a string of binary values with each bit representing pump on/off status during a particular time interval. In this paper, we formally define and analyze two new explicit representations based on time-controlled triggers, where the maximum number of pump switches is established beforehand and the schedule may contain less switches than the maximum. In these representations, a pump schedule is divided into a series of integers with each integer representing the number of hours for which a pump is active/inactive. This reduces the number of potential schedules compared to the binary representation, and allows the algorithm to operate on the feasible region of the search space. We propose evolutionary operators for these two new representations. The new representations and their corresponding operations are compared with the two most-used representations in pump scheduling, namely, binary representation and level-controlled triggers. A detailed statistical analysis of the results indicates which parameters have the greatest effect on the performance of evolutionary algorithms. The empirical results show that an evolutionary algorithm using the proposed representations improves over the results obtained by a recent state-of-the-art Hybrid Genetic Algorithm for pump scheduling using level-controlled triggers.

Knowledge representation for fuzzy model composition

X. Fu and Q. Shen. 'Knowledge representation for fuzzy model composition', in Proceedings of the 21st International Workshop on Qualitative Reasoning, 2007, pp. 47-54. Sponsorship: EPSRC