SOME BLENDING INTERPOLATION METHODS IN CAGD

Some of the blending interpolation methods (which) stated by a convex combination technique are presented. This includes C1 ,C2 blending triangular interpolanls and C1 -blending quadrilateral inter polanls for surfaces. The mentioned methods can be generalized to the construction of C" blending interpolants.     

Quantitative stability of variational systems: III.ε-approximate solutions

We prove that the-optimal solutions of convex optimization problems are Lipschitz continuous with respect to data perturbations when these are measured in terms of the epi-distance. A similar property is obtained for the distance between the level sets of extended real valued functions. We also show that these properties imply that the-subgradient mapping is Lipschitz continuous.Research supported in part by the National Science Foundation and the Air Force Office of Scientific Research.     

Effect of the modification of silica on thermal properties and flammability of cross-linked butadiene-acrylonitrile rubbers

The paper presents the results of testing the thermal stability and flammability of butadiene-acrylonitrile rubber vulcanizates with different contents of combined acrylonitrile: Perbunan NT 1845 and Perbunan NT 3945 from Bayer, containing unmodified and bromine- or iodine-modified silica. The test results were obtained with the use of a derivatograph, measurements of flammability by the method of oxygen index, in air and also with the use of a cone calorimeter. The effect of the modification on the zeta potential was also examined. A considerable reduction in the flammability of nitrile rubber vulcanizates filled with silica can be obtained by the modification of filler with bromine or iodine. All the vulcanizates containing modified silica are self-extinguishing. An appropriate filling of NBR 39 vulcanizates with bromine-modified silica makes it possible to obtain non-flammable polymeric materials. They neither ignite nor glow under the action of a flame source for 30 s. The findings can be a rational basis for the synthesis of modified silica that can act as active filler and effective flame-retardant agent at the same time.     

Facets for the cut cone I

We study facets of the cut coneC _n , i.e., the cone of dimension 1/2n(n – 1) generated by the cuts of the complete graph onn vertices. Actually, the study of the facets of the cut cone is equivalent in some sense to the study of the facets of the cut polytope. We present several operations on facets and, in particular, a lifting procedure for constructing facets ofC _n+1 from given facets of the lower dimensional coneC _n . After reviewing hypermetric valid inequalities, we describe the new class of cycle inequalities and prove the facet property for several subclasses. The new class of parachute facets is developed and other known facets and valid inequalities are presented.     

Generalizations of Slater's constraint qualification for infinite convex programs

In this paper we study constraint qualifications and duality results for infinite convex programs (P) = inf{f(x): g(x) – S, x C}, whereg = (g ₁,g ₂) andS = S ₁ ×S ₂,S _i are convex cones,i = 1, 2,C is a convex subset of a vector spaceX, andf andg _i are, respectively, convex andS _i -convex,i = 1, 2. In particular, we consider the special case whenS ₂ is in afinite dimensional space,g ₂ is affine andS ₂ is polyhedral. We show that a recently introduced simple constraint qualification, and the so-called quasi relative interior constraint qualification both extend to (P), from the special case thatg = g ₂ is affine andS = S ₂ is polyhedral in a finite dimensional space (the so-called partially finite program). This provides generalized Slater type conditions for (P) which are much weaker than the standard Slater condition. We exhibit the relationship between these two constraint qualifications and show how to replace the affine assumption ong ₂ and the finite dimensionality assumption onS ₂, by a local compactness assumption. We then introduce the notion of strong quasi relative interior to get parallel results for more general infinite dimensional programs without the local compactness assumption. Our basic tool reduces to guaranteeing the closure of the sum of two closed convex cones.     

Analytical chemistry and the cone penetrometer: In situ chemical characterization of the subsurface

The development of novel microanalytical techniques forin situ chemical characterization of the terrestrial subsurface environment has grown significantly over the last decade, particularly those instruments that are interfaced to the cone penetrometer. Cone penetrometer testing (CPT) has emerged as an effective means to introduce samplers and probes forin situ analysis of contaminants in soil and groundwater matrices. A variety ofin situ chemical samplers for CPT have been developed that can be driven into the subsurface to collect soil gas, groundwater, or soil samples at depth, thus providing a means of determining the vertical and horizontal extent of contamination. Cone penetrometer testing is also being explored as a means to deliverin situ subsurface sensor probes, including probes based on laser-induced fluorescence, Raman, and infrared spectroscopies for organics; on laser-induced breakdown and X-ray fluorescence spectroscopies for heavy metals; and on passive gamma-ray spectroscopy for radionuclides. The range of analytical technologies used in CPT for the determination of organic and inorganic species in the subsurface is described.     

Bayes estimation with spherically symmetric,convex loss

Summary It is desired to estimate a parameter with the loss function of the formL(θ, a)=W(‖θ−a‖), where is convex, differentiable, and non-decreasing. With this structure a characterization of Bayes estimators is given. Also it is noted that if the sample space, , for the observation,X, is a complete separable metric space then a Bayes estimator exists.     

Banach空间半线性发展方程的周期解

把上、下解方法引入到有序Ｂａｎａｃｈ空间中的半线性发展方程周期解问题，利用正算子半群特征与单调迭代程序，获得了最大周期解与最小周期解的存在性．所得的结果概括和推广了常微分方程与偏微分方程中的有关结论     

Convexifactors,generalized convexity and vector optimization

In this article we study a recently introduced notion of non-smooth analysis, namely convexifactors. We study some properties of the convexifactors and introduce two new chain rules. A new notion of non-smooth pseudoconvex function is introduced and its properties are studied in terms of convexifactors. We also present some optimality conditions for vector minimization in terms of convexifactors.