醋酸乙烯酯-马来酸酐共聚物与水解聚丙烯酰胺高分子络合物的研究

<正> 某些高分子在溶液中可以通过次价力形成高分子络合物.根据次价力的不同,可分为四类:聚电解质络合物、氢键络合物、立体络合物和电荷转移络合物.部分水解聚丙烯酰胺(简称HPAM)是在水悬浮体中被广泛使用的絮凝剂,醋酸乙烯酯-马来酸酐共聚物(简称VAMA)是一种能力很强的泥浆稀释剂.研究二者在水溶液中的相互作用,在理论上和应用上都有重要意义.我们曾研究了粘土对它们的吸附作用、改变泥浆流变性以     

Spectrophotometric study of complexation equilibria with H-point standard addition and H-point curve isolation methods

The use of H-point curve isolation (HPCIM) and H-point standard addition methods (HPSAM) for spectrophotometric studies of complex formation equilibria are proposed. One step complex formation, two successive stepwise and mononuclear complex formation systems, and competitive complexation systems are studied successfully by the proposed methods. HPCIM is used for extracting the spectrum of complex or sum of complex species and HPSAM is used for calculation of equilibrium concentrations of ligand for each sample. The outputs of these procedures are complete concentration profiles of equilibrium system, spectral profile of intermediate components, and good estimation of conditional formation constants. The reliability of the method is evaluated using model data. Spectrophotometric studies of murexide-calcium, dithizone-nickel, methyl thymol blue (MTB)-copper, and competition of murexide and sulfate ions for complexation with zinc, are used as experimental model systems with different complexation stoichiometries and spectral overlapping of involved components.     

一类非线性复微分方程的超越亚纯解北大核心CSCD

本文主要研究非线性复微分方程f^(4)+a(z)ff^((k))=p_(1)(z)e^(α_(1)(z))+p_(2)(z)e^(α_(2)(z))的超越亚纯解,其中a,p_(1),p_(2)是非零的有理函数,α_(1),α_(2)是非常数的多项式.进一步地,考虑当亚纯解存在时,α_(1),α_(2),p_(1)和p_(2)所满足的条件.另外,还讨论了非线性复微分方程f^(3)+a(z)f’=p_(1)(z)e^(ν(z))+p_(2)(z)e^(-ν(z))的亚纯解的存在性,其中a,p_(1),p_(2)是非零的有理函数,ν是非常数的多项式.所得的结果直接推广了一些已知的结果.     

带有随机初值的复值Ginzburg-Landau方程的弱平均动力学*

本文研究了无界域上的带有随机初值的复值Ginzburg-Landau方程.首先, 基于解过程的全局适定性, 建立了带有随机初值的Ginzburg-Landau方程的平均随机动力系统.然后, 证明了弱拉回平均随机吸引子的存在唯一性以及随机吸引子的周期性,并将其进一步推广到加权空间L²(?, L²_σ(R)).     

An exact algorithm for the capacitated shortest spanning arborescence

We are given a complete and loop-free digraphG=(V, A), whereV={1,...,n} is the vertex set,A={(i, j) :i, j V} the arc set, andr V is a distinguishedroot vertex. For each arc (i, j) A, letc _ij be the associatedcost, and for each vertexi, letq _i 0 be the associateddemand (withq _r =0). Moreover, a nonnegativebranch capacity, Q, is defined.A Capacitated Shortest Spanning Arborescence rooted at r (CSSA _r ) is a minimum cost partial digraph such that: (i) each vertexj r has exactly one entering arc; (ii) for each vertexj r, a path fromr toj exists; (iii) for each branch leaving vertexr, the total demand of the vertices does not exceed the branch capacity,Q. A variant of theCSSA _r problem (calledD-CSSA _r ) arises when the out-degree of the root vertex is constrained to be equal to a given valueD. These problems are strongly NP-hard, and find practical applications in routing and network design. We describe a new Lagrangian lower bound forCSSA _r andD-CSSA _r problems, strengthened in a cutting plane fashion by iteratively adding violated constraints to the Lagrangian problem. We also present a new lower bound based on projection leading to the solution of min-cost flow problems. The two lower bounds are then combined so as to obtain an overall additive lower bounding procedure. The additive procedure is then imbedded in a branch-and-bound algorithm whose performance is enhanced by means of reduction procedures, dominance criteria, feasibility checks and upper bounding. Computational tests on asymmetric and symmetric instances from the literature, involving up to 200 vertices, are given, showing the effectiveness of the proposed approach.     

Twistor holomorphic Lagrangian surfaces in the complex projective and hyperbolic planes

We completely classify all the twistor holomorphic Lagrangian immersions in the complex projective plane ², i.e. those Lagrangian immersions such that their twistor lifts to the twistor space over ² are holomorphic. This classification provides a one-parameter family of examples of Lagrangian spheres in ².Research partially supported by a DGICYT grant No. PB91-0731.     

A two-phase algorithm for the partial accessibility constrained vehicle routing problem

In the partial accessibility constrained vehicle routing problem, a route can be covered by two types of vehicles, i.e. truck or truck + trailer. Some customers are accessible by both vehicle types, whereas others solely by trucks. After introducing an integer programming formulation for the problem, we describe a two-phase heuristic method which extends a classical vehicle routing algorithm. Since it is necessary to solve a combinatorial problem that has some similarities with the generalized assignment problem, we propose an enumerative procedure in which bounds are obtained from a Lagrangian relaxation. The routine provides very encouraging results on a set of test problems.     

Phipps's lagrangian and hamiltonian

In this work it is derived Phipps's Lagrangian function and Phipps's Hamiltonian function. This allows the utilization of Phipps's interaction in the Lagrangian and Hamiltonian frameworks.Dedicated to Thomas E. Phipps, Jr. on the occasion of his 70th birthday (1995).     

Lewis酸催化高区域选择合成对位柑菁醛的研究

Ｌｅｗｉｓ酸催化高区域选择合成对位柑菁醛的研究尹笃林，银董红，李谦和（湖南师范大学精细催化合成研究所，长沙４１００８１）关键词月桂烯，丙烯醛，对位柑菁醛，Ｄｉｅｌｓ－Ａｌｄｅｒ反应，Ｌｅｗｉｓ酸，络合催化。１．前言可从松节油资源中制取的月桂烯（ｍｙｒ...     

LnSrNiO4-λ系列复合氧化物的物化性质与对NO分解的催化性能

用柠檬酸络合法合成了Ｋ２ＮｉＦ４结构的ＬｎＳｒＮｉＯ４－λ（Ｌｎ＝Ｌａ，Ｐｒ，Ｎｄ，Ｓｍ，Ｇｄ）系列稀土取代类钙钛石型复合氧化物催化剂，对该系列催化剂的固态物理、化学性质及其对ＮＯ分解的催化性能进行研究。结果表明，该系列复合氧化物催化剂对ＮＯ分解活性都很高，在此基础上对该系列复合氧化物中稀土元素对ＮＯ分解反应的取代效应进行了探讨。