冷轧带钢激光拼焊的焊缝在线检测研究

焊缝质量在线检测是冷轧带钢激光拼焊过程中的重要关键技术之一。为了解决武钢TRUMPF12000 轴快流激光拼焊设备在焊接过程中出现的错边、拼缝、焊缝形态等问题,采用3个传感器分别采集焊前间隙图像信息、焊接过程图像信息以及焊后焊缝图像信息,利用OTSU 自动计算图像阈值、运用投影矩阵的方法将图像坐标转换到工件坐标,编写程序提取图像特征点的方式建立焊缝质量在线检测系统,并以5m/min焊接速率对3mm厚冷轧板进行焊接实验,测量焊接试样焊缝宽度相对误差在4.42%左右。结果表明,焊缝质量检测系统可以计算出较为准确的焊缝宽度、焊缝错边量等信息。     

连续的异变——普雷斯顿-斯科特-科恩的建筑设计思想

本文通过系统的介绍普雷斯顿·斯科特·科恩从早期实验性质的到现今中国一系列的建筑设计实践，探究其新颖的设计手法并从中总结出一般规律，并希望以此重新审视设计的方法与过程以及所要解决的问题。     

球面上基本几何元素的园弧投影

本文提出了一种球面上基本几何元素的园弧投影变换方法,并建立了三轴及对应的二轴园弧投影体系。然后,系统地阐明了点、各种球面曲线以及球面的园弧投影方法和性质。这样,就使我们对球面的研究又多了一种工具     

用子午投影法建立回转曲面轮廓线的方程式

强调了子午投影法的两个特点,即几何元素至回转轴和至水平投影面的距离都不改变。提出以这两个不变量建立直线的子午投影的方程式,也就是确定回转曲面轮廓线的方程式。以二维的平面曲线的方程式代替了三维空间曲面的方程式。文中通过方程式的推导,论证了上述观点,并以此为基础,进一步论述了各种特殊位置直线的子午投影的方程式,以及这些子午投影旋转后所形成的曲面。     

Adaptive learning of fuzzy BSB and GBSB neural models

This article deals with a special class of neural autoassociative memory, namely, with fuzzy BSB and GBSB models and their learning algorithms. These models defined on a hypercube solve the problem of fuzzy clusterization of a data array owing to the fact that the vertices of the hypercube act as point attractors. A membership function is introduced that allows one to classify data that belong to overlapping clusters. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 18–28, November–December 2006.     

一种GF(2~n)上椭圆曲线标量乘的混合坐标系统

在有限域GF(2n)上的椭圆曲线公开加密系统已经得到了广泛的应用,其中最重要并且花费运行时间最多的运算就是计算标量乘。为了提高标量乘的运算速度,提出了一种改进的坐标系统,在此基础上构建出一种用于计算标量乘的算法中新的混合坐标系统。算法的时间复杂度的对比分析表明:在新的混合坐标系统下,算法时间复杂度比已有坐标系统下的算法时间复杂度降低了5%左右。     

两种3维重建方法的比较

对基于本质矩阵和基于绝对二次曲面的两种重建方法进行了比较研究,仿真实验和真实图像实验结果表明,尽管基于绝对二次曲面的重建方法比较抽象,很多人对这种方法不太熟悉,但是该方法无论是在重建精度还是鲁棒性方面都优于基于本质矩阵的重建方法,这一发现对实际应用有非常重要的指导作用.     

基于两视图重建的平面纹理校正和映射

在3维场景里漫游,纹理映射是展示场景真实感的主要手段。纹理通常由照片获得,但由于某些不可抗拒的原因,只能得到透视变形的纹理图像。讨论了如何纠正平面纹理的透视变形,及其相应的纹理映射,其过程是在两视图重建的基础上,对原平面进行投影变换,并用插值方法获得纹理,从而映射到模型上。在投影变换的过程中对已有算法进行了改进以达到较好的效果,并对实验结果进行了分析和讨论。该方法适用于构建虚拟的3维场景及去除由于透视变形而产生的图像模糊。     

Data Distribution in a Peer to Peer Storage System

This article presents distributions for data storage in a P2P system. In peer to peer storage system we have to face a continuous stream of peer failures. So to insure data durability data are usually disseminated using a dispersal redundant scheme and a dynamic data reconstruction process is used to rebuild lost data. There is an important communication traffic to maintain data integrity. So, it is important to reduce the impact of this reconstruction process on peer. To minimize end user traffic according to the reconstruction process, distribution must take into account a new measure: The maximum disturbance cost of a peer. To begin with, we define a static distribution scheme which minimizes this reconstruction cost based on prime numbers theory. We compare this distribution with the random distribution, the most used in data distribution.This Project () is supported by the ACI GRID CGP2P and the ACI MD GDX.     

A modal proof theory for final polynomial coalgebras

An infinitary proof theory is developed for modal logics whose models are coalgebras of polynomial functors on the category of sets. The canonical model method from modal logic is adapted to construct a final coalgebra for any polynomial functor. The states of this final coalgebra are certain “maximal” sets of formulas that have natural syntactic closure properties.

The syntax of these logics extends that of previously developed modal languages for polynomial coalgebras by adding formulas that express the “termination” of certain functions induced by transition paths. A completeness theorem is proven for the logic of functors which have the Lindenbaum property that every consistent set of formulas has a maximal extension. This property is shown to hold if the deducibility relation is generated by countably many inference rules.

A counter-example to completeness is also given. This is a polynomial functor that is not Lindenbaum: it has an uncountable set of formulas that is deductively consistent but has no maximal extension and is unsatisfiable, even though all of its countable subsets are satisfiable.