C- and N-Amidotrichloroethylation of Azoles

1H-Pyrazoles, triazoles, and imidazoles in reaction with ethoxycarbonylimine and arylsulfonylimines of chloral yield addition products, corresponding 1-(1-amidotrichloroethyl)azoles. Derivatives of 1-alkylpyrazoles and pyrazolones react with chloral 4-chlorophenylsulfonylimine to furnish products of C-amidotrichloroethylation into position 4 of the azole ring.     

BRST cohomology and highest weight vectors. I

We initiate a program to study certain recent problems in non-compact coset CFT by the BRST approach. We derive a reduction formula for the BRST cohomology by making use of a twisting by highest weight modules. As illustrations, we apply the formula to the bosonic string model and a rank one non-compact coset model [DPL]. Our formula provides a completely new approach to non-compact coset construction.Partially supported by NSF Grant DMS-8703581     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

Coverings of topological loops

In this paper, we show that in some cases, no proper covering of a locally compact group topologically generated by left translations of a topological loop can occur as the group topologically generated by left translations of a topological loop. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 22, Algebra and Geometry, 2004.     

A method for calculating invariant subspaces of symmetric hyperbolic equations

An algorithm is constructed for calculating invariant subspaces of symmetric hyperbolic systems arising in electromagnetic, acoustic, and elasticity problems. Discrete approximations are calculated for subspaces that correspond to minimal eigenvalues and smooth eigenfunctions. Difficulties related to the presence of an infinite-dimensional kernel in the differential operator are successfully handled. The efficiency of the algorithm is demonstrated using acoustics equations.     

Fibrations of bigroupoids

Using Brown's construction (J. Algebra 15 (1970) 103) of an exact 6-term sequence for a fibration of groupoids we show how an exact 9-term sequence can be associated to a fibration of bigroupoids. Applications to topology and algebra are given.     

Laser induced copper electroless plating on polyimide with Q-switch Nd:YAG laser

The results of laser induced deposition of copper on polyimide substrate from copper electrolyte solution are reported. Unlike most work reported in the literatures where CW Ar⁺ lasers were used, a second harmonic (532 nm wavelength) Q-switch Nd:YAG laser was used for our experiments. The deposition process was conducted by laser-catalyzing of the polyimide surface and subsequent photothermal-accelerated reduction of copper-complex ions in an alkaline reducing environment. The characteristics of the deposited copper line were investigated in terms of laser beam scanning speed, and the number of scans. The surface morphology and chemical composition of the deposited copper were analyzed using field emission scanning electron microscope (FESEM) and energy dispersive spectrometer (EDX). The optimum processing conditions have been identified. The copper deposit was found to adhere well to the substrate.     

Reductions of interval nonlinear programming problem

A general nonlinear programming problem with interval functions is considered. Two reductions of this problem to the deterministic nonlinear programming problem are proposed, and illustrative examples are discussed.     

A Modified Quasi-Newton Method for Structured Optimization with Partial Information on the Hessian

This paper develops a modified quasi-Newton method for structured unconstrained optimization with partial information on the Hessian, based on a better approximation to the Hessian in current search direction. The new approximation is decided by both function values and gradients at the last two iterations unlike the original one which only uses the gradients at the last two iterations. The modified method owns local and superlinear convergence. Numerical experiments show that the proposed method is encouraging comparing with the methods proposed in [4] for structured unconstrained optimization Presented at the 6th International Conference on Optimization: Techniques and Applications, Ballarat, Australia, December 9–11, 2004