K_(1,n)-free图具有给定性质的[a,b]-因子的一个充分条件

图G称为K1,n-free图,如果它不含K1,n作为其导出子图.对K1,n-free图具有给定性质的[a,b]-因子涉及到最小度条件进行了研究,得到一个充分条件.     

烷基硫酸盐表面张力的量子化学研究

用AMl量子化学计算法优化了十三烷基硫酸根阴离子和——CH3在不同取代位的十二烷基硫酸根阴离子的几何构型，得到最优构型时最高占据分子轨道能级EHOMO、最低空轨道能级ELUMO、电子能量Eele和偶极矩μ等数据．将这些电子结构数据分别与表面张力相拟合，得到很好的相关性。文中讨论了——CH3在不同位置取代对表面张力的影响。     

弱(L_1,L_2)-BLD映射的正则性

本文首先将文［１］中的ＢＬＤ映射推广为弱（Ｌ１，Ｌ２）－ＢＬＤ映射，并证明了如下正则性结果：存在两个可积指数 Ｐ１＝Ｐ１（ｎ，Ｌ１，Ｌ２）＜ｎ＜ｑ１＝ｑ１（ｎ，Ｌ１，Ｌ２），使得对任意弱（Ｌ１，Ｌ２）－ＢＬＤ映射ｆ∈（Ω，Ｒｎ），都有ｆ∈（Ω，Ｒｎ），即ｆ为（Ｌ１，Ｌ２）－ＢＬＤ映射．     

Using rank-1 lift-and-project closures to generate cuts for 0–1 MIPs, a computational investigation

Various techniques for building relaxations and generating valid inequalities for pure or mixed integer programming problems without special structure are reviewed and compared computationally. Besides classical techniques such as Gomory cuts, Mixed Integer Rounding cuts, lift-and-project and reformulation–linearization techniques, a new variant is also investigated: the use of the relaxation corresponding to the intersection of simple disjunction polyhedra (i.e. the so-called elementary closure of lift-and-project cuts). Systematic comparative computational results are reported on series of test problems including multidimensional knapsack problems (MKP) and MIPLIB test problems. From the results obtained, the relaxation based on the elementary closure of lift-and-project cuts appears to be one of the most promising.     

Preparation of rhodium–phyllosilicate catalysts without leaching in liquid-phase 1-hexene hydrogenation

Rhodium catalysts have been prepared on palygorskite and montmorillonite (clay) supports by reduction with hydrogen (1 atmosphere) at room temperature of a cationic organometallic rhodium compound anchored to the support. The activity of these catalysts for the hydrogenation of liquid-phase 1-hexene remains constant with increase of prehydrogenation time and with re-use for several runs. No rhodium leaching is observed.     

T 1 theorem for Besov spaces on nonhomogeneous spaces

Suppose μ is a Radon measure on ℝ ^d , which may be non doubling. The only condition assumed on μ is a growth condition, namely, there is a constant C₀>0 such that for all x∈supp(μ) and r>0, μ(B(x, r))⪯C₀rⁿ, where 0<n⪯d. We prove T1 theorem for non doubling measures with weak kernel conditions. Our approach yields new results for kernels satisfying weakened regularity conditions, while recovering previously known Tolsa’s results. We also prove T1 theorem for Besov spaces on nonhomogeneous spaces with weak kernel conditions given in [7].     

Structure and electrochemical behaviour of 4,7-diazaheptyl-trimethoxy-silane and vinyl-trialkoxy-silane adsorbed at silver surface

Novel self-assembled monolayers were obtained on silver using 4,7-diazaheptyl-trimethoxy-silane (SiN) and vinyl-trialkoxy-silane (SiVA, where the alkyl group is 3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57,60-eicozaoxa- hexaheptaconan). It was shown that thus modified metal surface was protected against electrooxidation. A densely packed monolayer remained stable and did not desorb from the Ag electrode on the potential cycling. The structure of SiN and SiVA as well as their complexes with Li⁺ cations were calculated and visualised by the AM1d and PM5 semi-empirical methods.     

具P-Laplacian算子型周期边值问题解的存在性

本文利用拓扑度理论和一些分析技巧讨论了具p—Laplacian算子型周期边值问题(φp(χ’))’+d/dt gradF(χ)+gradG(χ)=e(t),χ(0)=χ(T),χ’(0)=χ’(T)解的存在性,在对阻尼项d/dtgradF(χ)没有任何限制的前提下,给出了解存在的充分条件.     

Local Feasible QP-Free Algorithms for the Constrained Minimization of SC1 Functions

We consider the problem of minimizing an SC¹ function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm.