裂解炉下集气锥形接管失效分析

通过化学成份分析、金相的宏微观考察、Manson-Haferd参数对锥形接管持久寿命的估算,以及热应力的计算,对锥形接管的失效原因进行了分析,认为是由温差应力导致失效。所以应该充分注意高温构件保温措施的有效性,避免非正常温差应力的产生。     

结合锥模型算法的修正多步拟牛顿法

提出一种解决维数较大的无约束优化问题的混合算法.该算法采用了一个开关用于切换修正多步拟牛顿算法和锥模型算法.结果表明,该算法既保留了拟牛顿算法的快速有效性,又将适用范围扩大到了二次模型逼近效果较差的函数,且对于大多数维数较大的函数都是切实可行的.     

基于新水平向量的锥模型算法

从高次模型的角度出发,通过锥模型的高次展开式的推导,设计一个新锥模型的水平向量,提出一个基于新水平向量的锥模型拟牛顿信赖域算法,并证明此算法的收敛性,同时给出与其他算法进行对比的数值结果,并通过数值实验结果表明了此算法的有效性。     

The Geometry and Matching of Lines and Curves Over Multiple Views

This paper describes the geometry of imaged curves in two and three views. Multi-view relationships are developed for lines, conics and non-algebraic curves. The new relationships focus on determining the plane of the curve in a projective reconstruction, and in particular using the homography induced by this plane for transfer from one image to another. It is shown that given the fundamental matrix between two views, and images of the curve in each view, then the plane of a conic may be determined up to a two fold ambiguity, but local curvature of a curve uniquely determines the plane. It is then shown that given the trifocal tensor between three views, this plane defines a homography map which may be used to transfer a conic or the curvature from two views to a third. Simple expressions are developed for the plane and homography in each case.A set of algorithms are then described for automatically matching individual line segments and curves between images. The algorithms use both photometric information and the multiple view geometric relationships. For image pairs the homography facilitates the computation of a neighbourhood cross-correlation based matching score for putative line/curve correspondences. For image triplets cross-correlation matching scores are used in conjunction with line/curve transfer based on the trifocal geometry to disambiguate matches. Algorithms are developed for both short and wide baselines. The algorithms are robust to deficiencies in the segment extraction and partial occlusion.Experimental results are given for image pairs and triplets, for varying motions between views, and for different scene types. The methods are applicable to line/curve matching in stereo and trinocular rigs, and as a starting point for line/curve matching through monocular image sequences.     

A Linear Algorithm for Computing the Homography from Conics in Correspondence

This paper presents a study, based on conic correspondences, on the relationship between two perspective images acquired by an uncalibrated camera. We show that for a pair of corresponding conics, the parameters representing the conics satisfy a linear constraint. To be more specific, the parameters that represent a conic in one image are transformed by a five-dimensional projective transformation to the parameters that represent the corresponding conic in another image. We also show that this transformation is expressed as the symmetric component of the tensor product of the transformation based on point/line correspondences and itself. In addition, we present a linear algorithm for uniquely determining the corresponding point-based transformation from a given conic-based transformation up to a scale factor. Accordingly, conic correspondences enable us to easily handle both points and lines in uncalibrated images of a planar object.     

Lower bound limit analysis of cohesive‐frictional materials using second‐order cone programming

The formulation of limit analysis by means of the finite element method leads to an optimization problem with a large number of variables and constraints. Here we present a method for obtaining strict lower bound solutions using second‐order cone programming (SOCP), for which efficient primal‐dual interior‐point algorithms have recently been developed. Following a review of previous work, we provide a brief introduction to SOCP and describe how lower bound limit analysis can be formulated in this way. Some methods for exploiting the data structure of the problem are also described, including an efficient strategy for detecting and removing linearly dependent constraints at the assembly stage. The benefits of employing SOCP are then illustrated with numerical examples. Through the use of an effective algorithm/software, very large optimization problems with up to 700 000 variables are solved in minutes on a desktop machine. The numerical examples concern plane strain conditions and the Mohr–Coulomb criterion, however we show that SOCP can also be applied to any other problem of lower bound limit analysis involving a yield function with a conic quadratic form (notable examples being the Drucker–Prager criterion in 2D or 3D, and Nielsen's criterion for plates). Copyright © 2005 John Wiley & Sons, Ltd.     

二次曲线的计算方法研究

二次曲线的射影理论是射影几何中极其重要的一个组成部分。利用二次曲线的对应进行物体识别、场景重建及运动分析是计算机视觉中非常活跃的一个研究领域。利用图像坐标计算二次曲线,当图像坐标很大时,就会出现计算故障或者引起计算精度的下降;利用齐次坐标来计算二次曲线,相应地增加计算量。本文从实际计算的角度出发,使用N矢量来表示视平面上所有的点和直线,从二次曲线的定义建立了二次曲线的N矢量计算公式。在此基础上,给出了射影平面上由任意一点或一条直线所确定的二次曲线切点、切线的N矢量计算方法,通过举例分析和实验验证,该算法实用、可靠。     

在普通铣床上加工等导程圆锥螺旋线

等导程圆锥螺旋线的铣削在铣床加工中属较为复杂的工艺过程,本文以模头为例,通过对等导程圆锥螺旋线的形成原理以及加工过程中的挂轮配置、切削刀具选择、铣削过程等的阐述,系统地介绍了等导程螺旋线铣削加工过程。该工艺铣削出的模头螺旋齿的尺寸精度和表面质量有了大幅度提高,进而提高了铝电解碳阳极的质量,提高了工效,降低了生产成本。     

A Parameterization Method from Conic Spline Interpolation

Interpolating a set of planar points is a common problem in CAD. Most constructions of interpolation functions are based on the parameters at the sample points. Assigning parameters to all sample points is a vital step before constructing interpolation functions. The most widely used parameterization method is accumulative chord length parameterization. In this paper, we give out a better method based on the interpolation of conics. Based on this method, a sequence of fairer Hermite curves can be constructed.     

环Zn上广义圆锥曲线多重数字签名方案的分析与改进

文章分析了环上广义圆锥曲线多重数字签名LWL方案的安全性,证明了该方案中攻击者可绕过离散对数问题,伪造针对任意消息的签名。针对上述问题,文章提出了一种改进方案,能有效对抗内部成员攻击、流氓密钥攻击和任意消息的签名伪造攻击,安全性更强。最后分析了改进方案的计算效率和通信量,在同等安全强度下,改进方案比RSA型方案通信量少、计算效率更高。