扫掠法有限元网格生成方法

为了提高有限元网格的生成质量,扫掠法生成六面体网格过程中内部节点定位成为关键一步,在研究复杂扫掠体六面体有限元网格生成算法过程中,提出了一种基于扫掠法的六面体网格生成算法,算法利用源曲面已经划分好的网格和连接曲面的结构化网格,用仿射映射逐层投影,生成目标曲面,提出基于Roca算法的内部节点定位的新算法,运用由外向内推进的波前法思想,生成全部的六面体网格。通过实例表明,该算法快速,稳定,可靠,可处理大量复杂2.5维实体六面体网格生成问题。     

约束网格简化

针对三维激光扫描仪获得的彩色人头数据压缩问题,应用多细节层次模型自动生成技术,提出了基于区域分割的约束网格简化算法.在对三维彩色人头数据进行区域分割的基础上,把网格点分为两类,一类为区域边界点,在顶点合并操作中,区域边界点只能与边界点合并;一类为区域内部点,它能与边界点和内部点合并.然后根据区域加权的误差评价函数,生成多细节层次模型.该算法不但保证了压缩比,而且保持人头模型各区域(眼睛、鼻子、嘴、耳朵和头发)的边界和细节.文中最后给出了人头数据的一组简化实例.     

基于Voronoi 最小邻近点集的Delaunay 三角化方法

针对局部条件下网格生成的需求,提出一种基于节点的Delaunay 三角化 生成算法,该算法以Delaunay 三角形及其对偶Voronoi 图的局部性特征为基础,通过在局部 搜索最小Voronoi 邻近点集,来生成约束点附近的局部网格,通过建立背景索引网格,来提 高算法效率。给出算法的原理证明、程序实现、效率分析和测试结果,并给出了算法的应用 领域。     

子域约束扫掠体的六面体网格生成方法

为了保证扫掠法生成六面体网格的效率,必须将扫掠体中的扫掠面划分为结构网格.受到连接体在扫掠面上形成的子域影响,扫掠面的网格划分会出现局部的非结构网格,阻碍扫掠法的应用,为此提出一种新的扫掠方法.该方法将扫掠体中含有子域约束的面网格进行分割,将分割出的结构网格与非结构网格重组为新的扫掠组;在各扫掠组内补充边界点,在边界点内插值生成内部节点,最终完成整个扫掠体六面体网格节点的生成.实例结果表明,文中方法稳定、可靠,可处理复杂2.5D实体六面体网格生成问题.     

一个高效可靠的三维AFT四面体网格生成算法

针对三维推进波前算法(AFT-Advancing Front Technique)存在的效率与收敛性问题,文中提出了一整套改进方案,给出了基于拓扑连接的网格数据结构和基于Hash表的网格元素的插入、查找、删除算法,提高了整个算法的效率.通过在网格生成过程中动态维护前沿的尺寸信息,提高四面体单元的整体质量.在内核回退求解时通过引入前沿优先因子,改变前沿推进的路径,大大增加了回退求解的成功概率;对于极少数不能回退求解的内核采用基于线性规划的插点方法加以解决,这样就基本保证了整个算法的收敛.在网格生成以后,通过删除不必要的内部节点、合并相关四面体单元以及对所有内部节点进行基于角度的优化,从而进一步有效提高了网格质量.数值算例表明,文中提出的改进算法具有接近线性的时间复杂度,生成网格质量好.该算法已经得到工程应用.     

交互式棱柱网格生成方法

针对流动数值模拟中边界层区域棱柱网格生成与修改困难的问题,提出一种基于物面边界约束的交互式棱柱网格生成方法.该方法交互生成物面边界点的空间推进面网格;将边界点空间推进面网格的每层网格点看成边界网格点运动得到,计算对应的边界网格点位移;利用径向基函数插值将边界网格点位移光滑传递给内部网格点,获得内部网格点的空间推进网格;建立所有网格点之间的连接关系,构造棱柱网格单元.基于V型槽、飞机机头等外形对文中方法进行测试,并对该方法存在的一些问题进行了讨论;利用该方法生成一个大展弦比翼身组合体模型的棱柱/四面体混合计算网格,并在PHENGLEI计算平台上进行了数值模拟,结果表明,该方法能够生成高质量的粘性棱柱网格.     

具有聚类功能的边界检测技术的研究

为快速有效地检测聚类的边界点,提出了一种新的基于三角剖分的聚类边界检测算法DTBOUND。该算法通过计算三角剖分图中每个数据点的变异系数将数据集分解成内部点和外部点两部分,然后从每一个未分类的内部点开始进行深度优先遍历,将相连的内部点以及和内部点相连的外部点作为一个聚类;最后从得到的聚类中提取边界点。该算法只有一个参数（变异系数阈值β）,实验结果表明该算法可以快速、有效地识别任意形状、不同大小和不同密度的聚类和聚类的边界点。     

平面离散点集的边界搜索算法

进行有限元仿真首先要建立有限元网格模型。使用不含有任何拓扑信息的离散点集直接进行网格划分可以快速、精确地建立网格模型。使用铺路法进行网格剖分是从边界开始向内生成网格单元。该文提出一种使用搜索盒的搜索平面离散点集边界的算法。该方法将离散点分配到搜索盒中，遍历位于边界的搜索盒，将其中的点连接成边界点链表。该算法能正确地搜索包含有凹点、孔洞特征的离散点集的边界，具有较强的通用性。文中介绍了算法的基本思想，并给出算例。     

一种高效的基于联合熵的边界点检测算法

为了快速有效地检测出聚类的边界点,提出一种将网格技术与联合熵相结合的边界点检测算法.该算法中网格技术用于快速查找数据集中聚类边界所在的网格范围,联合熵用于在边界落入的网格范围内准确识别聚类的边界点.实验结果表明.该算法能够在含有噪声点,孤立点的数据集上,有效地检测出聚类的边界,运行效率高.     

基于网格密度影响因子的多密度聚类算法

提出了网格密度影响因子的概念,通过加权处理考虑了相邻网格的综合影响,能较好地代表当前网格相对密度,然后利用它来识别具有不同密度聚簇的高密度网格单元,并从高密度单元网格进行扩展,直至生成一个聚簇骨架,对边缘网格边界点进行识别和提取,提高网格聚类精度.通过实验验证,新算法能对不同大小与形状的聚簇进行聚类,可以识别具有多个密度的不同类组成的数据集,能捕获聚簇边界点,聚类效果较好.     

BMSweep: Locating Interior Nodes During Sweeping

BMSweep is a new algorithm to determine the location of interior nodes while generating hexahedral meshes using the volume sweeping method. Volume sweeping is performed on two and one half-dimensional volumes by identifying a ‘source’ surface which is meshed with quadrilaterals. These quadrilaterals are then swept through the volume towards a ‘target’ surface generating layers of hexahedra along the way. BMSweep uses background mesh interpolation to locate interior nodes during sweeping. The interpolation method provides for quality element creation, while allowing the volume boundary to vary. The cross-section of the volume can vary along the length of the sweep, the sweep path need not be linear, and the source and target areas need not be flat. Three dimensional volumes can be swept using BMSweep after being decomposed into two and one half-dimensional subvolumes.     

A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions

We present a numerical algorithm for the construction of efficient, high-order quadratures in two and higher dimensions. Quadrature rules constructed via this algorithm possess positive weights and interior nodes, resembling the Gaussian quadratures in one dimension. In addition, rules can be generated with varying degrees of symmetry, adaptable to individual domains. We illustrate the performance of our method with numerical examples, and report quadrature rules for polynomials on triangles, squares, and cubes, up to degree 50. These formulae are near optimal in the number of nodes used, and many of them appear to be new.     

基于裂痕故障块的自适应容错路由表算法

基于裂痕故障块的二维网格自适应容错路由算法是一种有效的容错算法,不仅能够解决活锁问题,而且克服了传统故障块模型中状态良好的节点不能参与路由的缺陷,但同时具有明显的缺点：每次路由到以故障块边界节点为根节点的内部树时,都需要遍历此内部树,因此算法的路由长度并不是最短的。针对上述问题,提出基于裂痕故障块的自适应容错路由表算法,其中路由表由裂痕故障块内部树上的节点创建,通过路由表上保留的有用消息决定是否遍历内部树。实验结果证明,随着网格规模的扩大,该算法最大可减少70％的平均路由长度,并且其实现简单,可以有效地延长网络寿命。     

基于嵌入式及ZigBee技术的居室环境监测系统

设计了一套智能家居环境监测系统。系统通过ZigBee终端节点采集居室传感器数据信息,在居室内部建立ZigBee无线网络,并将传感器信息由ZigBee协调器模块传给系统的嵌入式家庭网关,由家庭网关对所接收的数据协议处理后,进行数据融合和模糊处理,最后将其转化成日常生活语言式的直观信息,显示到QT界面系统中。该网关也可以通过无线网络给各个终端节点发送指令信息或Internet网络与外部进行信息的沟通。系统具有手持可移动的特点,不仅可以随意增减节点数,也可将采集节点随意放置,应用于超市或者其他环境中。     

Perimeter discovery in wireless sensor networks

In this paper, we focus on the perimeter detection problem using wireless sensor networks, as perimeter detection has a wide range of uses in several areas. We present a decentralized localized algorithm where sensor nodes determine if they are located along the perimeter of a wireless sensor network. Our proposed algorithm uses the location neighborhood information in conjunction with the Barycentric technique to determine if the sensor node enclosed by neighboring nodes, and consequently, if it is located within the interior of the wireless sensor network. We define performance metrics to analyze the performance of our approach and the simulation shows that the algorithm gives fairly accurate results.     

Stabilization and SDG condition of serially connected vibrating strings system with discontinuous displacement

Based on joint feedback controls, the stabilization issue of a serially connected vibrating strings system is presented. Suppose that the two ends of the strings system are clamped and the vertical force of strings is continuous at interior nodes while the transversal displacement is discontinuous. The vertical force of strings at interior nodes are observed and the compensators are derived from the observation values. Then the feedback controllers are arranged at interior nodes to stabilize this system. Through a detailed spectral analysis, this closed loop system is proved to be asymptotically stable and there exists a sequence of (generalized) eigenvectors of the system that forms a Riesz basis with parentheses for the state space under certain conditions. Hence the spectrum‐determined‐growth (SDG) condition holds. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

基于约简概念格的关联规则提取改进算法*

概念格是关联规则挖掘领域中的一种重要技术,在概念格上生成所有的频繁项集需要对概念格的节点进行排序并进行一一比较。为了提高在概念格上生成频繁项集的效率,本文提出了一个基于约简概念格的生成频繁项集的新算法。该算法通过利用节点之间的父子关系能够直接生成生成全部频繁项集,省略了对节点进行排序的时间开销,并且大大减少了节点比较的次数,从而提高了频繁项集的生成效率。实验结果证明了其可靠性和高效性。     

An image-based texture mapping technique for apparel products exhibition and interior design

In this paper, we propose an image-based texture mapping technique for textile products exhibition that does not require geometric representation of 3D models. Under this technique, a texture grid is built interactively for a target area in an original image. This grid acts as the intermediate space between planar space and texture space. The texture coordinate for each pixel in the target area can be calculated based on this grid, and the 3D effect can be successfully realized by further fine adjustment of the grid. This technique can be applied in apparel products exhibition and interior design.     

减少自反馈测试硬件代价的两种方法

由被测电路自己施加测试向量的内建自测试方法把被测电路视为一种可利用的资源,而不仅仅是被测试的对象.通过将被测电路内部一些节点"反馈"连接到电路的输入端,被测电路可以在由外部加载初始测试向量之后,利用反馈顺序地产生并加载一组测试向量.对这种技术中的分组方法和反馈节点选取方法进行了改进,提出一种附加信息矩阵的面向多个特殊有向图的深度优先公共路径搜索方法和一种贪婪式反馈节点选取方法.对ISCAS85电路和MinTest测试集的仿真实验结果表明,这些方法可以有效减少硬件代价,并提高故障效率.     

Positive Interpolationsquadraturen mit teilweise vorgeschriebenen Stützstellen

In this paper quadrature procedures with partially preassigned nodes are described. They are constructed by integration of a general, linear, hermitian, interpolating operator. Those nodes, which are not preassigned, and for the first free are fixed by the requirement, that all weights of first derivatives in these free nodes vanish in the resulting quadrature formulas. In order to get positive weights for the function-values additional conditions must be settled up. For one (ore two) preassigned node(s) the given sufficient positivity-conditions say, that the preassigned nodes are not situated in the interior of the interval of integration, e. g. for strongly monotone basic-functions which are needed in the construction of the interpolating operator. As special cases the quadratures of Radau and Lobatto are involved. Further quadratures having nodes outside the interval of integration and beeing very siutable for connected formulas for large intervals are contained, partially with unusual interpolating conditions. At last it is shown, how to obtain numerically the free nodes of quadratureswith preassigned nodes from thosewithout preassigned nodes (and vice versa) by making use of inbedding-methods.