Dual–primal proximal point algorithms for extended convex programming

This paper presents a class of dual–primal proximal point algorithms (PPAs) for extended convex programming with linear constraints. By choosing appropriate proximal regularization matrices, the application of the general PPA to the equivalent variational inequality of the extended convex programming with linear constraints can result in easy proximal subproblems. In theory, the sequence generated by the general PPA may fail to converge since the proximal regularization matrix is asymmetric sometimes. So we construct descent directions derived from the solution obtained by the general PPA. Different step lengths and descent directions are chosen with the negligible additional computational load. The global convergence of the new algorithms is proved easily based on the fact that the sequences generated are Fejér monotone. Furthermore, we provide a simple proof for the O(1/t) convergence rate of these algorithms.     

碾压混凝土中石粉含量精确控制研究与应用

通过在碾压混凝土中掺入工业化粉磨加工的石粉代替部分砂,使砂中石粉总含量满足碾压混凝土的要求,从而改善碾压混凝土的性能,保证其质量.从不同石粉含量的碾压棍凝土试验研究结果分析,以及金安桥水电站大坝碾压混凝土施工质量控制结果分析可知,混凝土生产时必须对外掺石粉量进行精确控制,确保掺入代砂石粉后石粉总量不变,才能确保碾压混凝土的质量稳定.     

Ehrenfeucht-Fraïssé games in finite set theory

In this article, with Ehrenfeucht-Fraïssé games we prove that Δ₁≠Δ₀ on BFR, which implies Δ≠Δ₀ on BFR, and thus solve an open problem raised by Albert Atserias in his dissertation (Δ₀,Δ₁,Δ are fragments of first order logic and BFR is a class of finite sets which in essence is equivalent to a class of finite pure arithmetic structures with built-in BIT predicate).     

间接竞争ELISA方法用于脱落酸的检测

该文研制了植物激素脱落酸(ABA)间接竞争酶联免疫试剂盒,该试剂盒可对ABA进行快速检测.文中成功制备了脱落酸和牛血清蛋白的交联物(ABA-BSA),并对交联物的浓度、抗体稀释度、酶标二抗稀释度对实验的影响进行了考察.结果表明,该试剂盒具有高灵敏性,最低检出浓度为1.38 ng/mL,在10ns/mL～1 000 ng/mL之间,吸光度与浓度的对数呈良好的线性关系.样品添加回收率在95.98%～102.25%之间,平均回收率为100.18%,变异系数(CV)在1.27%～4.68%之间,平均变异系数为3.18%.