The Compactness of Commutators on the Heisenberg Group

We consider the commutators of the HSrmander multiplier with CMO-functions on the Heisenberg group. The result of compactness on L^P spaces is proved.     

Thermal effects and band spreading in capillary electro-separation

Summary Four Capillary Electroseparation methods are distinguished. All have an ultimate efficiency limited only by axial diffusion and are in principle capable of achieving 10⁶ plates in <1 hour.The main limitation to performance arises from Ohmic heating of the electrolyte. While forced convection at 10ms^–1 is recommended to keep tubes cool, the parabolic temperature profile within the electrolyte limits the tube bore which can be used. A simple limiting expression is derived: (d_c/m)³ (E/kV m^–1)³ (c/mol dm^–3) <3.3×10⁹.Values of constants underlined     

A path following algorithm for a class of convex programming problems

We present a primal-dual path following interior algorithm for a class of linearly constrained convex programming problems with non-negative decision variables. We introduce the definition of a Scaled Lipschitz Condition and show that if the objective function satisfies the Scaled Lipschitz Condition then, at each iteration, our algorithm reduces the duality gap by at least a factor of (1–/n), where is positive and depends on the curvature of the objective function, by means of solving a system of linear equations which requires no more than O(n³) arithmetic operations. The class of functions having the Scaled Lipschitz Condition includes linear, convex quadratic and entropy functions.     

Computational complexity of LCPs associated with positive definite symmetric matrices

Murty in a recent paper has shown that the computational effort required to solve a linear complementarity problem (LCP), by either of the two well known complementary pivot methods is not bounded above by a polynomial in the size of the problem. In that paper, by constructing a class of LCPs—one of ordern forn 2—he has shown that to solve the problem of ordern, either of the two methods goes through 2 ⁿ pivot steps before termination.However that paper leaves it as an open question to show whether or not the same property holds if the matrix,M, in the LCP is positive definite and symmetric. The class of LCPs in whichM is positive definite and symmetric is of particular interest because of the special structure of the problems, and also because they appear in many practical applications.In this paper, we study the computational growth of each of the two methods to solve the LCP, (q, M), whenM is positive definite and symmetric and obtain similar results.This research is partially supported by Air Force Office of Scientific Research, Air Force Number AFOSR-78-3646. The United States Government is authorized to reproduce and distribute reprints for governmental purposes notwithstanding any copyright notation thereon.     

Second order algorithms for the posynomial geometric programming dual,part I: Analysis

In this paper we analyse algorithms for the geometric dual of posynomial programming problems, that make explicit use of second order information. Out of two possible approaches to the problem, it is shown that one is almost always superior. Interestingly enough, it is the second, inferior approach that has dominated the geometric programming literature.This work was partially supported by the National Research Council of Canada, Grant A3552 and National Science Foundation Grant ENG78-21615.Earlier versions of this paper were presented at the Optimization Days Conference in Montreal (May 1976) and the TIMS meeting in Athens (July 1977).     

A variational approach for a generalized emden-fowler equation

Existence of positive solutions of singular boundary value problems related to Emden-Fowler equation is proved. A general minimization theorem in Sobolev spaces is applied.     

Path-following barrier and penalty methods for linearly constrained problems

In the present paper some barrier and penalty methods (e.g. logarithmic barriers, SUMT, exponential penalties), which define a continuously differentiable primal and dual path, applied to linearly constrained convex problems are studied, in particular, the radius of convergence of Newton’s method depending on the barrier and penalty para-meter is estimated, Unlike using self-concordance properties the convergence bounds are derived by direct estimations of the solutions of the Newton equations. The obtained results establish parameter selection rules which guarantee the overall convergence of the considered barrier and penalty techniques with only a finite number of Newton steps at each parameter level. Moreover, the obtained estimates support scaling method which uses approximate dual multipliers as available in barrier and penalty methods     

MICROEMULSION SYSTEMS WITH A NONIONIC COSURFACTANT

The conditions to obtain W/0 microemulsions using ionic surfactants and a nonionic cosurfactant, a polyoxyethylene alkyl ether, were investigated. The length of the polyoxyethylene chain was critical to obtain the typical water solubilization maximum

The variation of the W/0 microemulsion region with hydrocarbon content was different from that of the usual type of microemulsions having a medium chain length alcohol as cosurfactant. In the present systems the W/0 microemulsion region was not a direct continuation of the inverse micellar area at zero content of hydrocarbon. Addition of hydrocarbon was necessary for the formation of inverse micelles

The microemulsion regions were sensitive to the kind of hydrocarbon used; a sign of the importance of the nonionic surfactant for the stability of this kind of microemulsions.     

分子印迹聚合物传感器的研究与发展

综述了分子印迹聚合物的历史发展、制备方法、聚合体系的选择、性能表征及作用机理。主要介绍了其作为传感器敏感膜方面的应用,并对需解决的问题提出了建议。