铁在硫酸中腐蚀电位下的EIS及添加DDA和Cl~-的影响

利用交流阻抗技术和弱极化曲线拟合技术研究了工业纯铁在硫酸溶液及添加Cl-和十二烷基胺(DDA)溶液中的电化学阻抗谱及极化曲线。结果表明DDA在硫酸中缓蚀效应为覆盖效应。Cl-的加入提高了DDA对铁的缓蚀效率,但未改变DDA对铁的缓蚀机理。阻抗谱可用混合电位下的法拉第阻抗理论解释。     

Approximating of conic sections by DP curves with endpoint interpolation

Conic sections have many applications in industrial design, however, they cannot be exactly represented in polynomial form. Hence approximating conic sections with polynomials is a challenging problem. In this paper, we use the monomial form of Delgado and Peña (DP) curves and present a matrix representation for them. Using the matrix form and the least squares method, we propose a simple and efficient algorithm for approximating conic sections by DP curves of arbitrary degree with endpoint interpolation. Finally, we test and compare the proposed algorithm on some numerical examples which validates and confirms efficiency of it.     

Semi‐Regular Triangle Remeshing: A Comprehensive Study

Semi‐regular triangle remeshing algorithms convert irregular surface meshes into semi‐regular ones. Especially in the field of computer graphics, semi‐regularity is an interesting property because it makes meshes highly suitable for multi‐resolution analysis. In this paper, we survey the numerous remeshing algorithms that have been developed over the past two decades. We propose different classifications to give new and comprehensible insights into both existing methods and issues. We describe how considerable obstacles have already been overcome, and discuss promising perspectives.     

Computing Minimum Area Homologies

Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on the quality of the measure. In this paper, we present a similarity measure for any two cycles that are homologous, where we calculate the minimum area of any homology (or connected bounding chain) between the two cycles. The minimum area homology exists for broader classes of cycles than previous measures which are based on homotopy. It is also much easier to compute than previously defined measures, yielding an efficient implementation that is based on linear algebra tools. We demonstrate our algorithm on a range of inputs, showing examples which highlight the feasibility of this similarity measure.     

基于椭圆曲线密码体系的多基联合稀疏表示算法

椭圆曲线已经广泛应用于密码学领域中的公钥密码系统,数字签名验证等。在椭圆曲线密码系统中,标量乘法占据着十分重要的地位。目前已经有一些算法来加快这些十分关键的计算,它们均基于整数的不同表示,以尽量减少一般乘法或点加法的数目。在椭圆曲线现有的各种计算方法中,联合稀疏表式(JSF),w-NAF,双基方法是目前常用并且有效的算法。基于多基整数表示系统,提出一种联合多基稀疏表示方法。多基联合稀疏表示需要较少的位数,并且比JSF和w-NAF更加稀疏,(2,3,5)基表示与(2,3)基表示相比,可以使椭圆曲线标量乘法的运算提高约16%的效益。     

基于伸缩因子的代数曲线曲面变形方法

提出了一种基于伸缩因子的代数曲线曲面变形方法。首先构造了一种用于代数曲线曲面变形的伸缩因子,然后将所构造的伸缩因子分别作用于待变形的代数曲线与曲面,通过改变伸缩因子各参数的取值实现对代数曲线曲面的变形。实例表明,该方法操作方便,易于控制,可获得丰富的变形效果,是一种简单有效的代数曲线曲面变形方法。     

基于三次 B 样条插值曲面的图像放大方法*

为了实现低分辨率图像的高保真放大,利用原图像中相邻四个像素点的像素值及其在放大后的图像中的位置构造出了对应的三次B样条插值曲面,从而较好地估算出了放大后图像中出现的空白像素值。鉴于彩色图的像素点有R、G、B三个分量,分别构造R曲面、G曲面、B曲面对空白像素点的三个分量进行填充。由于采用构造曲面的高度值作为像素值,使得相邻像素点的像素值不存在较大差异,故而尽可能地避免了马赛克现象的产生,实现了图像的高保真放大。通过对比实验,验证了论文方法对图像放大具有非常好的效果。     

广东省三水市思贤滘水道分流影响因素分析

以数学模型为基础手段,采用恒定总流连续方程、能量方程,分析临界状态下定床恒定流和定床非恒定流状态时思贤滘水道分流影响因素。将特殊推广至一般,找出各水力要素与分流量（比）的关系,并将水位、流量无量纲化,绘制出规律性较强的分流比关系曲线,对思贤滘水道分流的研究作出重大贡献。     

隐式多项式曲线的信息相似性分析研究

隐式多项式曲线用来描述数据点集合轮廓具有良好的性质,并已经获得广泛的应用。研究一般商业数据的特点,将一维商业数据变换成二维商业数据,使用隐式多项式曲线对其进行拟合描述,计算这些隐式多项式曲线的相似性,进而实现对商业数据的相似性计算分析。实验结果证明了算法的有效性。     

论区间B样条曲线的升阶与割角的关系

为了解决区间B样条曲线的升阶理论问题,提出区间控制多边形概念,利用双次B样条基函数证明了区间B样条曲线具有升阶性质;并阐明了区间B样条曲线的升阶就是对其控制多边形的割角过程.最后证明了当升阶次数趋于无穷时,区间B样条曲线的控制多边形收敛到该曲线.