Synthesis of 5,6-Dihydro-OSW-1 and Its Antitumor Activities

5,6-Dihydro-OSW-1 (1) was synthesized following our previous procedure for the total synthesis of OSW-1. This compound demonstrated slightly stronger potency than that of OSW-1 against the growth of cancer cells.     

Regioselective Synthesis of Multi-substituted Phenylselenomethyl Isoxazolines

A mild, regioselective 1, 3-dipolar cycloaddition protocol for the preparation ofphenylselenomethyl isoxazolines through substituted allyl phenyl selenides and nitrile oxides wasreported.     

Synthesis of New 13-O-Acylavermectin Bl Aglycones

Six new 13-O-acylavermectin Bl aglycones(3-8) were synthesized from avermectin B1 aglycone and their bioactivities were evaluated against Spodoptera exigua, Spodoptera eridania, Tetranychus urticae and Aphis fabae.     

The First Intramolecular Charge Transfer Transition Based on 2-Ureido-4[1H]-pyrimidinone Binding Module

The first intramolecular charge transfer transition based on 2-ureido-4[1H]-pyrimidinone binding module was reported.     

Solid Phase Synthesis of 2-Substituted 1,3-Oxazin-6-ones Using Resin-bound Cyclic Malonic Acid Ester

A facile solid phase synthesis of 2-substituted 1,3-oxazin-6-ones using polymer-supported Meldrum‘s acid has been reported. Reaction of the resin-bound cyclic malonic acid ester with triethyl orthoformate and subsequent double substitution with amide, afforded the corresponding polymer-supported acylaminomethylene cyclic malonic acid ester, which upon thermal treatment led to 1, 3-oxazin-6-ones in good yields and with high purity.     

On Constraint Qualifications in Nonsmooth Optimization

We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here.     

Elliptic and parabolic problems in unbounded domains

We consider elliptic and parabolic problems in unbounded domains. We give general existence and regularity results in Besov spaces and semi‐explicit representation formulas via operator‐valued fundamental solutions which turn out to be a powerful tool to derive a series of qualitative results about the solutions. We give a sample of possible applications including asymptotic behavior in the large, singular perturbations, exact boundary conditions on artificial boundaries and validity of maximum principles. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Artificial boundary conditions for Petrovsky systems of second order in exterior domains and in other domains of conical type

The approximation of solutions to boundary value problems on unbounded domains by those on bounded domains is one of the main applications for artificial boundary conditions. Based on asymptotic analysis, here a new method is presented to construct local artificial boundary conditions for a very general class of elliptic problems where the main asymptotic term is not known explicitly. Existence and uniqueness of approximating solutions are proved together with asymptotically precise error estimates. One class of important examples includes boundary value problems for anisotropic elasticity and piezoelectricity. Copyright © 2004 John Wiley & Sons, Ltd.     

Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.