S-粗集与数据挖掘单位圆特征

给出单向S-粗集(one direction singular rough sets)、单向S-粗集对偶(dual of one direction singular rough sets)的结构。单向S-粗集与单向S-粗集对偶是改进Z.Pawlak粗集得到的,单向S-粗集与单向S-粗集对偶具有动态特性。给出单向S-粗集、单向S-粗集对偶与Z.Pawlak粗集的关系。S-粗集具有三类形式:单向S-粗集、单向S-粗集对偶、双向S-粗集,利用单向S-粗集、单向S-粗集对偶,给出数据内挖掘、数据外挖掘概念,给出数据内挖掘的外同心圆定理、数据外挖掘的内同心圆定理,并给出其应用。S-粗集是粗集理论与应用研究的新分支。     

二叉树的先序遍历和中序遍历的非递归算法

从二叉树先序遍历递归算法的执行过程的分析入手,总结出二叉树先序遍历的实质,从而得出利用栈的二叉树的非递归算法。最后,再从分析二叉树中序遍历与先序遍历过程实质的不同之处,得出了二叉树中序遍历的非递归算法。重点在于对二叉树先序和中序遍历过程实质的分析。     

PBB/VPLS双栈技术及其效率分析

PBB技术和VPLS技术是城域以太网技术发展的两个方向,PBB/VPLS双栈技术通过PBB与VPLS报文之间的互相转换实现了网络融合。文章从VPN中主机之间互相学习MAC地址的角度研究了PBB/VPLS双栈网络的效率;通过理论上的分析计算,得出了当所有主机获取其他主机MAC地址之后ARP报文被公网设备转发的次数和;对组网方式进行了研究,旨在减少公网设备转发ARP报文的次数,提升双栈网络的效率。     

Dual watermark for image tamper detection and recovery

An effective dual watermark scheme for image tamper detection and recovery is proposed in this paper. In our algorithm, each block in the image contains watermark of other two blocks. That is to say, there are two copies of watermark for each non-overlapping block in the image. Therefore, we maintain two copies of watermark of the whole image and provide second chance for block recovery in case one copy is destroyed. A secret key, which is transmitted along with the watermarked image, and a public chaotic mixing algorithm are used to extract the watermark for tamper recovery. By using our algorithm, a 90% tampered image can be recovered to a dim yet still recognizable condition (PSNR ). Experimental results demonstrate that our algorithm is superior to the compared techniques, especially when the tampered area is large.     

类算法在保险行业的运用与分析

聚类分析是数据挖掘中的非常重要的技术,通过对数据挖掘中常用聚类算法的分类分析比较,使得人们在实际应用中能方便、快捷地找到最好的聚类算法以解决实际问题,然后通过一个实例运用聚类来进行分析和实践。     

基于二重差分法的光流场运动检测

对视频图像序列中运动目标的检测,是计算机视觉领域长期关注的问题.传统的Horn-Schunck光流算法非常耗时,不利于在视频图像序列中做实时分析,故提出采用结合背景差分法与帧间差分法的二重差分法(DS)来做光流算法的预处理.实验结果也表明二重差分法的光流算法(DSOF)比单纯用Horn-Schunck方法计算光流效率更高,用时更短,能更好地满足对视频图像序列做实时运动检测分析的需求.     

Solving the Beck and Wieland model with optimal experimentation in DualPC

Currently, there is a renewed interest in the use of optimal experimentation (adaptive control) in economics. Example are found in [Amman and Kendrick, 1999], [Amman and Kendrick, 2003], [Cosimano, in?press], [Cosimano and Gapen, 2005b], [Cosimano and Gapen, 2005a], [Cosimano and Gapen, 2006], [Tesfaselassie et?al., 2007], [Tucci, 1997], [Wieland, 2000a] and [Wieland, 2000b]. In this paper we present the Beck & Wieland model [Beck, G., & Wieland, V. (2002). Learning and control in a changing economic environment. Journal of Economic Dynamics and Control, 26, 1359-1378] and the methodology to solve this model with time-varying parameters using the various control methods described in [Kendrick, 1981] and [Kendrick, 2002]. Furthermore, we also provide numerical results using the DualPC software [Amman, H. M., & Kendrick, D. A. (1999). The DualI/DualPC software for optimal control models: User’s guide. Working paper, Austin, TX 78712, USA: Center for Applied Research in Economics, University of Texas] and show first evidence that optimal experimentation or Dual Control may produce better results than Expected Optimal Feedback.     

3D-line clipping algorithms — a comparative study

Some well-known line-polyhedron intersection methods are summed up and new accelerating modifications presented. Results of comparison of known and newly developed methods are included. New methods use the fact that each line can be described as the intersection of two planes.     

催化裂化装置龟甲网双层衬里的改进

通过对催化裂化装置老的龟甲网双层社里使用情况的调查研究以及对存在问题的分析,提出了改进措施。经近几年的实际应用考核证明,改进措施是行之有效的。在此基础上制订了院标“ＢＬ型隔热耐磨衬里施工技术要求”。     

Dual geometric perception for cross-domain road segmentation

Road segmentation plays an important role in navigation systems and autonomous driving. However, many methods in road segmentation are based on supervised learning and suffer from performance degradation in the real world. There is a certain domain gap (distribution shift problem) between the source domain (training data) and the target domain (testing data). In this paper, we propose a Dual-Geometric Perception (DGP) approach for cross-domain road segmentation, which jointly uses semantic and dual-geometric information to learn the domain-invariant feature for road segmentation. First, we propose an RGB-N dual stream network structure, which effectively fuses normal vector information and RGB information to reduce domain gap. Moreover, a dual geometric adversarial learning strategy is proposed to utilize depth-aware and normal vector features to perform better domain alignment. Furthermore, a self-training learning strategy is used to further improve the model’s generalizability in the target domain. Extensive experiments demonstrate that our proposed DGP achieves superior performance on lane-to-lane and lane-to-sidewalk road domain adaptation tasks.