Ion-channel sensors based on ETH 1001 ionophore embedded in charged-alkanethiol self-assembled monolayers on gold electrode surfaces.

An ion-channel sensor was demonstrated by immobilizing ETH 1001, an ionophore for ion-selective electrodes, on a gold electrode surface. The approach for preparing the sensor was to incorporate the ionophore into a mixed self-assembled monolayer of 10-mercaptodecanesulfonate and 11-hydroxy-1-undecanethiol formed on the surface. The voltammetric responses for the thus prepared sensor to the primary cation Ca(2+) were observed by using [Fe(CN)(6)](3-/4-) as an electroactive marker. The ionophore was stably immobilized on the electrode surface with the hydrophobic interaction between its alkyl chains and those of the alkanethiol. The introduction of a proper charge density to the electrode surface improved the sensor sensitivity with retaining the selective response to Ca(2+) against Mg(2+) with concentrations above 10(-4) M.     

Thin films of peroxopolytungstic acids: applications to optical waveguide components

Thin films of peroxohetero(carbon)polytungstic acid (CW-HPA) and carbon-free isopolytungstic acid (W-IPA) were prepared, and examined in terms of optical and etching properties. Thermal decomposition was found to give good results in removing excess hydrogen peroxide (H₂O₂) during the preparation of CW-HPA and W-IPA. It was shown for the first time that thin films of CW-HPA and W-IPA have very high refractive indices (larger than 2.0) when sufficiently dried. Optical waveguide (OWG) characteristics of these films were examined using a slab-type OWG structure and ARROW (Antiresonance Reflection Optical Waveguide)-type structures. An embossing technique was applied to make diffractional grating couplers.     

A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations

be a network, where is an undirected graph with nodes and edges, is a set of specified nodes of , called terminals, and each edge of has a nonnegative integer capacity . If the total capacity of edges with one end at is even for every non-terminal node , then is called inner Eulerian. A free multiflow is a collection of flows between arbitrary pairs of terminals such that the total flow through each edge does not exceed its capacity. In this paper we first generalize a method in Karzanov [11] to find a maximum integer free multiflow in an inner Eulerian network, in time, where is the complexity of finding a maximum flow between two terminals. Next we extend our algorithm to solve the so-called laminar locking problem on multiflows, also in time. We then consider analogs of the above problems in inner balanced directed networks, which means that for each non-terminal node , the sums of capacities of arcs entering and leaving are the same. We show that for such a network a maximum integer free multiflow can be constructed in time, and then extend this result to the corresponding locking problem. Received: March 24, 1997     

Implementing an efficient minimum capacity cut algorithm

In this paper, we present an efficient implementation of theO(mn + n ² logn) time algorithm originally proposed by Nagamochi and Ibaraki (1992) for computing the minimum capacity cut of an undirected network. To enhance computation, various ideas are added so that it can contract as many edges as possible in each iteration. To evaluate the performance of the resulting implementation, we conducted extensive computational experiments, and compared the results with that of Padberg and Rinaldi's algorithm (1990), which is currently known as one of the practically fastest programs for this problem. The results indicate that our program is considerably faster than Padberg and Rinaldi's program, and its running time is not significantly affected by the types of the networks being solved.Corresponding author.     

Spectrophotometric determination of uric acid based on fading of o-hydroxyhydroquinonephthalein-palladium(II)-hexadecyltrimethyl-ammonium complex.

A simple and highly sensitive spectrophotometric method for the determination of uric acid (UA) was established based on fading of the o-hydroxyhydroquinonephthalein-palladium(II)-hexadecyltrimethylammonium complex. In the determination of UA, Beer's law is obeyed in the range of 0.01-0.20 microg ml(-1), with an effective molar absorptivity at 635 nm, the relative standard deviation being 6.5 x 10(5) dm(3) mol(-1) cm(-1) and 1.5% (n = 5). This method is about 20-times more sensitive than the conventional methods. The method was successfully applied to the assay of UA in human urine.     

Reaction Intermediates on TiO2(110) Identified by Time-Lapse Scanning Tunneling Microscopy

The present account describes first time examples of scanning tunneling microscope (STM) visualization of reaction intermediates on a metal oxide surface. The topographic response of reactant-adsorbed TiO₂(110) surfaces to a temperature increment or to a pressure increment was monitored as a sequence of STM images. Acetates thermally decomposing to ketene were resolved in a temperature-jump STM observation. The kinetics of the acetate consumption was determined on the number of acetates resolved in the microscope images and agreed with the macroscopic rate law of ketene production. A pressure-jump study revealed how a chemisorbed carboxylate (RCOO^-) is exchanged by another carboxylate (R'COO^-) supplied from the ambient vapor phase. An impinging R'COOH was immobilized on the top of a RCOO^- and then squeezed itself into the monolayer of the RCOO^-. One of the carboxylates in the squeezed state returned to the vapor phase via the immobilized state.     

Global Convergence Properties of Nonlinear Conjugate Gradient Methods with Modified Secant Condition

Conjugate gradient methods are appealing for large scale nonlinear optimization problems. Recently, expecting the fast convergence of the methods, Dai and Liao (2001) used secant condition of quasi-Newton methods. In this paper, we make use of modified secant condition given by Zhang et al. (1999) and Zhang and Xu (2001) and propose a new conjugate gradient method following to Dai and Liao (2001). It is new features that this method takes both available gradient and function value information and achieves a high-order accuracy in approximating the second-order curvature of the objective function. The method is shown to be globally convergent under some assumptions. Numerical results are reported.