Gold ultra-microelectrode arrays: application to the steady-state voltammetry of hydroxide ion in aqueous solution.

Gold ultra-microelectrode arrays are used to explore the electrochemical oxidation of hydroxide ions and are shown to be analytical useful. Two types of ultra-microelectrode arrays are used; the first consist of 256 individual electrodes of 5 microm in radius, 170 of which are electrochemically active in a cubic arrangement which are separated from their nearest neighbour by a distance of 100 microm. The second array compromises 2597 electrodes of 2.5 microm in radius and of which 1550 of which are electrochemically active in a hexagonal arrangement separated by the nearest neighbour by 55 microm. Well defined voltammetric waves are found with peak currents proportional to the concentration of hydroxide ions in the range 50 microM to 1 mM. Detection limits of 20 microM using the 170 ultra-microelectrode and 10 microM with the 1550 ultra-microelectrode array are shown to be possible but with a higher sensitivity of 4 mA M(-1) observed using the 1550 ultra-microelectrode array compared to 1.2 mA M(-1) with the 170 ultra-microelectrode array.     

Group algebras of Kleinian type and groups of units

The algebras of Kleinian type are finite-dimensional semisimple rational algebras A such that the group of units of an order in A is commensurable with a direct product of Kleinian groups. We classify the Schur algebras of Kleinian type and the group algebras of Kleinian type. As an application, we characterize the group rings RG, with R an order in a number field and G a finite group, such that the group of units of RG is virtually a direct product of free-by-free groups.     

A note on the acyclicity of the Koszul complex of a module

We prove the vanishing of the Koszul homology group H _μ(Kos(M)_μ), where μ is the minimal number of generators of M. We give a counterexample that the Koszul complex of a module is not always acyclic and show its relationship with the homology of commutative rings.     

Application of color image segmentation to estrusc detection

Automatic segmentation and classification of color images is a problem of great practical interest in different areas. This paper presents an algorithm for this purpose which is divided in three steps. Firstly, the regions of interest are isolated from the rest of the image based on threshold functions defined in theYUV andYIQ color spaces, producing a set of connected components. Then, a set of features is computed to enable a quantitative evaluation of the segmented objects. Finally, the image is classified by means of a decision rule based on the analysis of the differences between the computed measures and a set of ideally segmented images, according to experts’ assessment. The algorithm was applied to a decision support tool for estrus detection in cattle. This approach constitutes a valuable alternative to improve this process, as it may replace the visual observation by the automatic analysis of pictures taken to cows in controlled environments. Experimental results show that the segmentations obtained with this method are highly satisfactory and they allow a precise classification of the images with low computational complexity.     

Designing a majorization scheme for the recourse function in two-stage stochastic linear programming

We discuss issues pertaining to the domination from above of the second-stage recourse function of a stochastic linear program and we present a scheme to majorize this function using a simpler sublinear function. This majorization is constructed using special geometrical attributes of the recourse function. The result is a proper, simplicial function with a simple characterization which is well-suited for calculations of its expectation as required in the computation of stochastic programs. Experiments indicate that the majorizing function is well-behaved and stable.     

Generating well-behaved utility functions for compromise programming

The purpose of this paper is to seek utility functions satisfying a weak condition which guarantees that the utility optimum always belongs to the compromise set. This set is a special subset of the attainable or feasible set, which is generated through the application of the well-known operational research approach called compromise programming. It is shown that there are large families of utility functions satisfying this condition, thus reinforcing the value of compromise programming as a good surrogate of the traditional utility optimum.Thanks are due to the reviewers for their helpful suggestions. The English editing by Ms. Christine Méndez is appreciated. The authors have been supported by the Comisión Interministerial de Ciencia y Tecnología (CICYT), Madrid, Spain.     

A topological characterization of classical BRST cohomology

The recent identification of classical BRST cohomology with the vertical cohomology of a certain fibration is used to compute it in terms of the classical observables and the topology of the gauge orbits. When the gauge orbits are compact and orientable, a duality theorem is exhibited.