样品粗糙度对材料SHPB动态压缩性能的影响

有效消减样品端面摩擦力是保证分离式霍普金森压杆（split Hopkinson pressure bar, SHPB）实验结果有效性和准确性的必要条件。为了研究样品粗糙度和润滑效果对端面摩擦力和最终实验结果的影响,以应变率效应不敏感且性能稳定的紫铜为研究对象,通过机械加工配合酸蚀的方法制备了3种典型表面粗糙度的紫铜样品,分别在二硫化钼（MoS₂）充分润滑和完全不润滑的条件下各自开展高精度的SHPB重复动态压缩实验研究。结果表明,通常认为能够有效消减金属样品端面摩擦力的MoS₂仅能够在样品粗糙度不大于0.8 μm的情况下起到较好的润滑效果,随着紫铜样品粗糙度的增加,MoS₂的润滑效果不断降低,端面摩擦力不断增大,实验结果的分散性也显著增加。样品端面粗糙度为1.6 μm时,MoS₂已不能有效消减端面摩擦力;样品端面粗糙度达到3.2 μm时,MoS₂的润滑效果几乎为零。SHPB实验中使用MoS₂润滑金属样品时,压杆和样品实验端面的粗糙度需达到0.8 μm;腐蚀液处理后的金属样品外表面粗糙度难以达到0.8 μm,实验过程中需对样品端面进行比MoS₂润滑效果更好的润滑处理,或对实验结果进行扣除端面摩擦力的修正才能够保证实验结果的有效性和准确性。     

Strong Convergence Theorem for Multiple Sets Split Feasibility Problems in Banach Spaces

The purpose of this article is to study the iterative approximation of solution to multiple sets split feasibility problems in p-uniformly convex real Banach spaces that are also uniformly smooth. We propose an iterative algorithm for solving multiple sets split feasibility problems and prove a strong convergence theorem of the sequence generated by our algorithm under some appropriate conditions in p-uniformly convex real Banach spaces that are also uniformly smooth.     

The A4‐structure of a graph

We define the A₄‐structure of a graph G to be the 4‐uniform hypergraph on the vertex set of G whose edges are the vertex subsets inducing 2K₂, C₄, or P₄. We show that perfection of a graph is determined by its A₄‐structure. We relate the A₄‐structure to the canonical decomposition of a graph as defined by Tyshkevich [Discrete Math 220 (2000) 201–238]; for example, a graph is indecomposable if and only if its A₄‐structure is connected. We also characterize the graphs having the same A₄‐structure as a split graph.     

四圈图的Spread

图的spread定义为图的邻接矩阵的最大特征值与最小特征值的差.本文确定了n(n≥84)顶点四圈图中spread最大的唯一的图.     

大理岩动态劈裂拉伸的SHPB实验研究

利用直径100 mm的Hopkinson压杆和薄圆形铝片作为波形整形器,用不同弹速径向冲击平台巴西圆盘试样以研究大理岩的动态拉伸强度。分析了试样的应变率、破坏时间、破坏模式,以及破坏过程中的载荷-应变关系,得到了关于大理岩在高应变率下拉伸强度及弹性模量的一些结论。考虑了试样的尺寸大小及两个平台附近应力的时间不均匀性与空间不均匀性对实验结果的影响。同时,利用有限元法对平台巴西圆盘试样的动态应力分布进行了数值模拟,验证了动态劈裂拉伸实验的有效性。     

Split graphs whose half-strong endomorphisms form a monoid

In this paper,the half-strong,the locally strong and the quasi-strong endomorphisms of a split graph are investigated.Let X be a split graph and let End(X),hEnd(X),lEnd(X) and qEnd(X) be the endomorphism monoid,the set of all half-strong endomorphisms,the set of all locally strong endomorphisms and the set of all quasi-strong endomorphisms of X,respectively.The conditions under which hEnd(X) forms a submonoid of End(X) are given.It is shown that lEnd(X) = qEnd(X) for any split graph X.The conditions under which lEnd(X)(resp.qEnd(X)) forms a submonoid of End(X) are also given.In particular,if hEnd(X) forms a monoid,then lEnd(X)(resp.qEnd(X)) forms a monoid too.     

A new approach to solve a set of nonlinear split boundary value problems

In this paper, we propose a new approach based on conjunction of the orthogonal collocation on finite elements method with decoupling and quasi-linearization technique to approximate solutions of a set of nonlinear split boundary value problems. The numerical stability, the convergence and the accuracy of the results are checked by this algorithm. The approach developed in this study is illustrated by some numerical examples. These examples are solved using a special software package which implements the proposed algorithms.     

不同冲击速度下泡沫铝变形和应力的不均匀性

利用常规Hopkinson杆实验装置和改进的Hopkinson杆实验装置对泡沫铝试件进行冲击压缩实验,同时用高速摄影装置对实验过程进行全程跟踪拍摄。通过改变冲击速度,观测到了3种不同的变形模式。将得到的高速摄影图像用数字图像相关方法进行分析,讨论了3种模式下全场应变不同的发展过程,并依此讨论应力的不均匀性,为研究不同冲击速度下变形不均匀对泡沫铝动态力学行为的影响提供了新的方法。     

开放式多中心需求可拆分VRP及混沌遗传模拟退火算法

综合考虑客户需求量允许被拆分、配送系统拥有多个配送中心且车辆可就近返回配送中心的运输模式,建立以配送中心日均建设成本、车辆派遣成本、理货成本和油耗成本之和最小为目标的数学模型,并根据问题特征设计了混沌遗传模拟退火算法对问题进行求解。通过对不同规模以及不同类型的算例进行实验,验证了混沌遗传模拟退火算法求解本文问题的有效性。     

An inertial method for a solution of split equality of monotone inclusion and the f$$ f $$-fixed point problems in Banach spaces

In this paper, we propose an inertial algorithm for solving split equality of monotone inclusion and $f$-fixed point of Bregman relatively $f$-nonexpansive mapping problems in reflexive real Banach spaces. Using the Bregman distance function, we prove a strong convergence theorem for the algorithm produced by the method in real reflexive Banach spaces. In addition, we provide some applications of our method and give numerical results to demonstrate the applicability and efficiency of the proposed method.