On the Rayleigh-Plateau instability

In this paper,we study the surface instability of a cylindrical pore in the absence of stress. This instability is called the Rayleigh-Plateau instabilty. We consider the model developed by Spencer et ...     

Synthesis,Antibacterial, and Antioxidant Evaluation of Novel Series of Condensed Thiazoloquinazoline with Pyrido,Pyrano, and Benzol Moieties as Five- and Six-Membered Heterocycle Derivatives

A novel synthesis of thiazolo[2,3-b]quinazolines 4(a–e), pyrido[2′,3′:4,5]thiazolo[2,3-b]quinazolines {5(a–e), 6(a–e), and 7(a–e)}, pyrano[2′,3′:4,5]thiazolo[2,3-b]quinazolines 8(a–e), and benzo[4,5]thiazolo[2,3-b]quinazoloine9(a–e) derivatives starting from 2-(Bis-methylsulfanyl-methylene)-5,5-dimethyl-cyclohexane-1,3-dione 2 as efficient α,α dioxoketen dithioacetal is reported and the synthetic approaches of these types of compounds will provide an innovative molecular framework to the designing of new active heterocyclic compounds. In our study, we also present optimization of the synthetic method along with a biological evaluation of these newly synthesized compounds as antioxidants and antibacterial agents against the bacterial strains, like S. aureus, E. coli, and P. aeruginosa. Among all the evaluated compounds, it was found that some showed significant antioxidant activity at 10 μg/mL while the others exhibited better antibacterial activity at 100 μg/mL. The results of this study showed that compound 6(c) possessed remarkable antibacterial activity, whereas compound 9(c) exhibited the highest efficacy as an antioxidant. The structures of the new synthetic compounds were elucidated by elemental analysis, IR, ¹H-NMR, and ¹³C-NMR.     

Novel microscopic mechanism of intermixing during growth on soft metallic substrates

Generic computer simulations using empiric interatomic potentials suggest a new, collective mechanism that could be responsible for mixing at heteroepitaxial interfaces. Even if single adsorbate atoms diffuse by hopping on the substrate surface and do not mix at the terraces, two-dimensional islands formed by nucleation may become unstable above a certain critical size and explode upwards forming clusters of several atomic layers. This process is accompanied by strong distortions of the underlying atomic layers, and on soft materials it can result in surface etching and incorporation of substrate atoms into the islands.     

Examination of Template Structural Effects on CEC Chiral Separation Performance of Molecule Imprinted Polymers Made by a Generalized Preparation Protocol

Some acidic chiral templates were used to prepare open tubular (OT) molecule imprinted polymer (MIP) capillary columns to explore the effects of molecular structures of templates on chiral recognition capabilities and to verify the feasibility of the general MIP preparation protocol introduced in the previous study. The templates are phenyl carboxylic acids and their derivatives. Optimization was carried out for chiral separation of template enantiomers for each MIP column through varying pH and composition of eluent. It was found that the preparation protocol can be successfully applied for the appropriate templates with functional groups fulfilling the three-points interaction rule. The chiral separation performances were quite satisfactory for MIPs of such templates although they are yet inferior to the separation performances of the MIP columns fabricated with the templates of profen drugs (2-arylpropionic acids with a large substituent on the phenyl ring). Subtle variations of the template molecular structures have been found to be critical to enhance chiral recognition ability of the resultant MIP column.     

An Identification Problem for First-Order Degenerate Differential Equations

We study a first-order identification problem in a Banach space. We discuss the nondegenerate and mainly the degenerate case. As a first step, suitable hypotheses on the involved closed linear operators are made in order to obtain unique solvability after reduction to a nondegenerate case; the general case is then handled with the help of new results on convolutions. Some applications to partial differential equations motivate this abstract approach.Communicated by I. GalliganiWork partially supported by MIUR (Ministero dell’ Istruzione, dell’ Università e dalla Ricerca), Project PRIN 2004011204 “Analisi Matematica nei Problemi Inversi,” and by the University of Bologna Funds for Selected Research Topics.     

A rapidly convergent five-point algorithm for univariate minimization

This paper presents an algorithm for minimizing a function of one variable which uses function, but not derivative, values at five-points to generate each iterate. It employs quadratic and polyhedral approximations together with a safeguard. The basic method without the safeguard exhibits a type of better than linear convergence for certain piecewise twice continuously differentiable functions. The safeguard guarantees convergence to a stationary point for very general functions and preserves the better than linear convergence of the basic method.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.Research sponsored by the Institut National de Recherche en Informatique et Automatique, Rocquencourt, France, and by the Air Force Office of Scientific Research, Air Force System Command, USAF, under Grant Number AFOSR-83-0210.Research sponsored, in part, by the Institut National de Recherche en Informatique et Automatique, Rocquencourt, France.     

A -algorithm for convex minimization

For convex minimization we introduce an algorithm based on -space decomposition. The method uses a bundle subroutine to generate a sequence of approximate proximal points. When a primal-dual track leading to a solution and zero subgradient pair exists, these points approximate the primal track points and give the algorithm's , or corrector, steps. The subroutine also approximates dual track points that are -gradients needed for the method's -Newton predictor steps. With the inclusion of a simple line search the resulting algorithm is proved to be globally convergent. The convergence is superlinear if the primal-dual track points and the objective's -Hessian are approximated well enough. Dedicated to Terry Rockafellar who has had a great influence on our work via strong support for proximal points and for structural definitions that involve tangential convergence. On leave from INRIA Rocquencourt Research of the first author supported by the National Science Foundation under Grant No. DMS-0071459 and by CNPq (Brazil) under Grant No. 452966/2003-5. Research of the second author supported by FAPERJ (Brazil) under Grant No.E26/150.581/00 and by CNPq (Brazil) under Grant No. 383066/2004-2.     

Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions

This paper studies an algorithm for minimizing a convex function based upon a combination of polyhedral and quadratic approximation. The method was given earlier, but without a good specification for updating the algorithm's curvature matrix. Here, for the case of onedimensional minimization, we provide a specification that insures convergence even in cases where the curvature scalar tends to zero or infinity. Under mild additional assumptions, we show that the convergence is superlinear.