TiB2增强Al2O3陶瓷刀具高速干切削摩擦磨损性能

采用TiB2增强Al2O3陶瓷刀具对淬硬钢进行高速干切削试验,利用切削高温作用下的摩擦化学反应,在刀具表面原位生成具有润滑作用的反应膜,从而实现Al2O3/TiB2陶瓷刀具的自润滑.结果表明:低速干切削时,Al2O3/TiB2陶瓷刀具的磨损机制主要表现为粘着磨损和磨料磨损;而在高速干切削时,刀具的磨损机制主要表现为氧化磨损,刀具表面经由氧化反应生成具有润滑作用的反应膜而起到固体润滑作用,从而使刀具的耐磨性能提高,随着TiB2含量和切削速度的增加,反应膜的减摩抗磨作用增强;而在切削区通入氮气时,由于刀具表面氧化膜形成受阻,刀具的抗磨能力有所降低.     

聚晶立方氮化硼刀具切削高锰钢的磨损机制

在半精加工试验条件(切削深度ap=0．5mm，进给量f=0．3mm／r，干切)下研究了聚晶立方氮化硼刀具切削奥氏体高锰钢时的磨损机制，用WDH-Ⅱ型光电温度计测量了切削温度，用工具显微镜测量后刀面磨损量，进而考察了切削时间和切削速度对后刀面磨损量的影响，采用S-250MK型扫描电子显微镜观察刀具前、后刀面的磨损形貌和组成变化．结果表明：当切削温度为400～750℃时，聚晶立方氮化硼刀具同高锰钢中的γ相及其析出相(Fe，Mn)3C之间产生严重的机械磨损；当切削温度超过800℃时，聚晶立方氮化硼刀具同高锰钢单一γ相之间产生扩散磨损；聚晶立方氮化硼刀具适合于高速切削.     

平面弹性力学问题的离散元法

根据离散元的基本原理,基于变形体的理论提出了适用于平面弹性力学问题的界面位移、应变和应力模式,建立了求解平面弹性力学问题的离散元方程和相应的迭代求解方法.通过界面位移可以简洁地将位移和力的边界条件引入离散系统的控制方程,也可以方便地求解节点位移.数值算例表明,与具有相同网格的有限元结果相比,离散元能同时给出精度相对较高的应力解和精度相当的位移解.     

无8-,9-和10-圈的平面图的3-可选择性

寻找平面图是3-或者4-可选择的充分条件是图的染色理论中一个重要研究课题,本文研究了围长至少是4的特殊平面图的选择数,通过权转移的方法证明了每个围长至少是4且不合8-圈,9-圈和10-圈的平面图是3-可选择的．     

一类趋化性生物模型行波解的存在性

我们研究了一类趋化性(Chemotaxis)生物模型在不同情形下行波解的存在性.对D=0的一些情形,利用相平面分析的方法得到了行波解存在的充分必要条件;对D>0的一些情形得到了行波解的存在性,改进了Nagai和Ikeda原有的结果.     

Cayley射影平面的浸入Kaehler曲面

得到了Cayley射影平面的全复浸入Kaehler曲面的一些有趣的拓扑限制。     

基于平面通量展开的三维Pin by Pin输运SP3计算

基于Pin by Pin输运SP3计算是下一代反应堆物理计算方法中一个重要的研究方向.节块法一般采用高阶通量和中子源展开以适应较大的节块尺寸,因此对于Pin by Pin计算来说效率偏低.由于反应堆堆芯不均匀性更多发生在径向,本文提出一种径向基于二维平面通量展开结合轴向常规节块法的综合方法进行三维Pin by Pin输...     

Approximate expressions and the relationship between pyramidalization (out‐of‐plane deformation) characteristics of trigonal centers

Fairly accurate approximate expressions for commonly used characteristics of non‐planarity of trigonal sp²‐hybridized centers are reported. It is shown that the behavior of all these parameters as a function of bond angles (α, β, γ) is determined primarily by the square‐root of the difference [360° ? (α + β + γ)]. This quantity is proposed as a new versatile measure of pyramidalization. © 2012 Wiley Periodicals, Inc.     

Convex Normalizations in Lift-and-Project Methods for 0–1 Programming

Branch-and-Cut algorithms for general 0–1 mixed integer programs can be successfully implemented by using Lift-and-Project (L&P) methods to generate cuts. L&P cuts are drawn from a cone of valid inequalities that is unbounded and, thus, needs to be truncated, or normalized. We consider general normalizations defined by arbitrary closed convex sets and derive dual problems for generating L&P cuts. This unified theoretical framework generalizes and covers a wide group of already known normalizations. We also give conditions for proving finite convergence of the cutting plane procedure that results from using such general L&P cuts.     

Augmented Lagrangian Duality and Nondifferentiable Optimization Methods in Nonconvex Programming

In this paper we present augmented Lagrangians for nonconvex minimization problems with equality constraints. We construct a dual problem with respect to the presented here Lagrangian, give the saddle point optimality conditions and obtain strong duality results. We use these results and modify the subgradient and cutting plane methods for solving the dual problem constructed. Algorithms proposed in this paper have some advantages. We do not use any convexity and differentiability conditions, and show that the dual problem is always concave regardless of properties the primal problem satisfies. The subgradient of the dual function along which its value increases is calculated without solving any additional problem. In contrast with the penalty or multiplier methods, for improving the value of the dual function, one need not to take the penalty like parameter to infinity in the new methods. In both methods the value of the dual function strongly increases at each iteration. In the contrast, by using the primal-dual gap, the proposed algorithms possess a natural stopping criteria. The convergence theorem for the subgradient method is also presented.