正交各向异性材料的混合硬化弹塑性本构方程

建立了混合硬化正交各向异性材料的屈服准则,进而推导了与之相关的塑性流动法则.根据简单应力状态的实验曲线,可得到广义等效应力-应变关系.初始屈服曲面与材料的弹性常数有关,材料退化为各向同性且只考虑各向同性硬化时,屈服函数退化为Huber-Mises屈服函数,相关的本构方程退化为Prandtl-Reuss方程.     

考虑损伤效应的正交各向异性板的弹塑性后屈曲分析

基于弹塑性力学和损伤理论,建立了一个与应力球张量有关的正交各向异性材料的混合硬化屈服准则,该准则无量纲化后与各向同性材料的Mises准则同构,进而建立了混合硬化正交各向异性材料的增量型弹塑性损伤本构方程和损伤演化方程．基于经典非线性板理论,得到了考虑损伤效应的正交各向异性板的增量型非线性平衡方程,且采用有限差分法和迭代法进行求解．数值算例中,讨论了损伤演化、初始缺陷对正交各向异性板弹塑性后屈曲行为的影响．数值结果显示了弹塑性后屈曲与弹性后屈曲的不同,并且损伤和损伤演化对板的弹塑性后屈曲的影响不可忽略．     

正交异性理想塑性材料平面应力问题的裂纹尖端应力场

本文在裂纹尖端场的应力分量仅仅是θ的函数的假设下,利用Hill屈服准则和平衡方程导出了正交异性理想塑性材料平面应力问题中裂纹尖端场的微分方程;在允许应力不连续线存在的情况下,把解析表达和数值计算法结合起来,得到了Ⅰ型和Ⅱ型裂纹尖端的应力场.     

高速扩展裂纹尖端的各向异性塑性场

在裂纹尖端的应力分量都只是θ的函数的条件下,利用定常运动方程,应力应变关系及Hill各向异性屈服条件,我们得到反平面应变和平面应变两者裂纹尖端的各向异性塑性场的一般解.将这些一般解用于具体裂纹,我们就求出了Ⅰ型和Ⅱ型裂纹的高速扩展尖端的各向异性塑性场,     

高速扩展平面应力裂纹尖端的各向异性塑性场

在裂纹尖端的应力分量都只是θ的函数的条件下,利用定常运动方程,Hill各向异性屈服条件及应力应变关系,我们得到高速扩展平面应力裂纹尖端的各向异性塑性场的一般解.将这个一般解用于四种各向异性特殊情形,我们就导出这四种特殊情形的一般解.最后,本文给出X=Y=Z情形的高速扩展平面应力Ⅰ型裂纹尖端的各向异性塑性场.     

高速扩展裂纹尖端的各向异性塑性应力场

在理想弹塑性材料中,高速扩展裂纹尖端的应力分量都只是θ的函数.利用这个条件以及定常运动方程、应力应变关系与Hill各向异性屈服条件,我们得到反平面应变和平面应变两者的一般解.将这两个一般解分别用于扩展Ⅲ型裂纹和Ⅰ型裂纹,我们就求出了Ⅱ型裂纹和Ⅰ型裂纹的高速扩展尖端的各向异性塑性应力场.     

平面应变和反平面应变复合型裂纹尖端的各向异性塑性应力场

在裂纹尖端的理想塑性应力分量都只是θ的函数的条件下,利用平衡方程,各向异性塑性应力应变率关系、相容方程和Hill各向异性屈服条件,本文导出了平面应变和反平面应变复合型裂纹尖端的各向异性塑性应力场的一般解析表达式.将这些一般解析表达式用于复合型裂纹,我们就可以得到Ⅰ-Ⅲ、Ⅱ-Ⅲ及Ⅰ-Ⅱ-Ⅲ复合型裂纹尖端的各向异性塑性应力场的解析表达式.     

应变空间中的岩土屈服准则与本构关系

本文从Илъюшин公设出发评述了在应变空间中研究岩土弹塑性问题的必要性和特点.建立了应力不变量与弹性应变不变量之间的关系式,实现了应力屈服面到应变屈服面的转换,导出和讨论了十二个以应力表达的屈服准则的应变表达式.应用正交法则导出了十二个与上述应变屈服准则相联系的理想塑性材料的本构关系.本文工作的结果可供实际应用,并有助于应变空间塑性理论的进一步研究.     

四面体中的Jani(c)不等式

R.R.Jani(c)曾建立如下不等式[1]: ∑ra/hb+hc≥3/2 (1) 其中ha、hb、hc、ra、rb、rc分别为△ABC三边上的高和旁切圆半径.∑表示循环和. 本文将其类比到四面体中,得到四面体中的Jani(c)不等式.     

一个优美的几何不等式

定理设△ABC的边长为a,b,c,对应的旁切圆半径分别为ra,rb,rc,则 (1)/(ra)-(1)/(rb)2+(1)/(rb)-(1)/(rc)2+(1)/(rc)-(1)/(ra)2 ≥4(1)/(a)-(1)/(b)2+(1)/(b)-(1)/(c)2+(1)/(c)-(1)/(a)2.     

管件无模拉伸成形力能参数数学模型研究

对不锈钢管件无模拉伸变形速度场及力能参数进行了理论及实验研究.分析了不锈钢管件无模拉伸的变形模型、速度场以及力能参数的影响因素及影响规律,采用上限法确定了不锈钢管件无模拉伸速度场及力能参数物理模型,填补了国内外关于不锈钢管件无模拉伸变形及力能参数物理模型研究的空白.为不锈钢管件无模拉伸工艺工业化应用奠定基础.     

Drawing a viscoelastic extrudate

The problem of the shape of a drawn viscoelastic extrudate of arbitrary cross section is investigated. The solution of the problem is represented as a superposition of the nonstationary extension under constant load and the motion determined by the throughput of the process. As an example, calculations are made for a circular polyethylene extrudate.Mekhanika Polimerov, Vol. 3, No. 2, pp. 326–333, 1967     

抓阄问题与全概率公式

以抓阄问题为例,通过对其进行逐步深入的分析,循序渐进的展现全概率公式的基本思想和基本形式；讨论事件复杂性的来源和寻找完备事件组的自然方法.     

Drawing orders using less ink

An algorithm is presented to draw Hasse-diagrams of partially ordered sets (orders). It uses two heuristic principles to generate good pictures for a wide range of orders. These two principles are (i) The total length of all edges of the diagram should be small (with the vertices kept at a minimal distance) and (ii) the vertices are constrained to coincide with the grid points of a given rectangular planar grid. The benefits are quite straightforward sine (i) using less ink means less confusion and (ii) the restriction to grid points tends to keep the number of different slopes small. Since the program was conceived as a readily usable tool (with the emphasis on results rather than on perfection), we are well aware of the fact that it will lend itself easily to improvements in many aspects.     

Drawing series parallel digraphs symmetrically

In this paper we present algorithms for drawing series parallel digraphs with as much symmetry as possible. The first step is to compute a certain kind of automorphism, called an “upward planar automorphism” for an input series parallel digraph. The next step uses these automorphisms to construct a symmetric drawing of the graph. We present several variations of the second step, with visibility drawings, “bus-orthogonal” drawings, and polyline drawings. All algorithms run in linear time.     

Drawing c-planar biconnected clustered graphs

In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon.     

Drawing planar graphs with circular arcs

In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the area of drawings in which edges are drawn using exactly one circular arc. We also give an algorithm for drawing n -vertex planar graphs such that the edges are sequences of two continuous circular arcs. The algorithm runs in O(n) time and embeds the graph on the O(n)\times O(n) grid, while maintaining Θ(1/d(v)) angular resolution, where d(v) is the degree of vertex v . Since in this case we use circular arcs of infinite radius, this is also the first algorithm that simultaneously achieves good angular resolution, small area, and at most one bend per edge using straight-line segments. Finally, we show how to create drawings in which edges are smooth C ¹ -continuous curves, represented by a sequence of at most three circular arcs. Received September 30, 1999, and in revised form March 27, 2000. Online publication October 26, 2000.