三维Delaunay剖分的断层直接插入算法

研究了在三维空间中进行的Delaunay四面体剖分。在讨论了四面体网格与插入的受限平面数据的各种相交构形的基础上,提出了一种断层直接插入的算法。该算法可以应用于三维数据点集的受限四面体剖分,也可以应用于不同的数据场网格之间的相交运算等问题。     

等代数结构面网格剖分下三维弹性问题的代数多重网格法

在一种等代数结构面网格剖分下,建立了求解三维弹性问题有限元方程的代数多重网格法及相应的预处理共轭梯度法,详细描述了代数多重网格方法中网格粗化技术与插值算子的构造,并将所构造的代数多重网格法应用于某些实际问题如非均匀介质、高应力梯度问题的数值求解.结果表明,建立的代数多重网格法对求解三维弹性问题是十分有效的,具有很好的鲁棒性,较直接解法和其它常用迭代方法具有明显的优越性.     

飞行器RCS计算中曲面剖分技术研究与实现

飞行器RCS预估计算是隐身技术研究中的重要研究内容。论述了利用飞行器外形的特点,在满足飞行器设计误差的前提下使用平面和柱面对飞行器的整机作NURBS曲面逼近,然后用柱面和平面剖分代替曲面的剖分。实现了飞行器整机模型的指定边长的三角剖分。这种方法不同于有限元计算的网格剖分,具有网格单元与曲面曲率无关和剖分速度快等特点。     

四阶特征值问题的各向异性有限元方法

本文的主要目的是讨论在各向异性网络剖分下四阶特征值问题的双三次Hernmite有限元逼近。由于该网格不同于传统有限元方法中的正则性剖分或拟一致剖分,在理论分析过程中不能直接使用Sobolev插值理论。本文将利用新的技巧,导出与传统网格剖分下相同的最优误差估计。     

使用多重网格算法的一种途径

采用坐标变换方法，将物理平面中任意几何区域上的非均匀网格剖分映射到计算平面中规则区域上的均匀网格剖分，这种处理使得对某些问题的多重网格算法成为方便可行，文后给出了两个算例。     

面向四面体网格生成的曲面Delaunay三角化算法

提出了一种曲面域Delaunay三角网格的直接构造算法。该算法在曲面网格剖分的边界递归算法和限定Delaunay四面体化算法的基础上,利用曲面采样点集的空间Delaunay四面体网格来辅助曲面三角网格的生成,曲面上的三角网格根据最小空球最小准则由辅助四面体网格中选取,每个三角形都满足三维Delaunay空球准则,网格质量有保证,并且极大的方便了进一步的曲面边界限定下的Delaunay四面体化的进行。     

三角网格曲面的球面参数化

提出了一种球面参数化三角网格曲面的方法。结合平面凸参数化和球面参数化,计算出封闭网格的切割线边界,网格边界映射到球面的凸区域边界上。然后分别参数化各子网格,最后将三角网格内部点映射到球面上。并用实例验证了此方法的可行性和有效性。     

基于映射理论的网格生成新方法及应用研究

基于映射函数理论提出二维/三维流场的网格生成新方法。针对实际应用中对场函数变密度的要求,提出可控制网格疏密度的插值公式,并以此对典型物体周围流场进行网格剖分,验证其有效性。针对圆形域(柱形域)流场网格生成质量的缺陷,提出在目标域中建立内置块的新策略,统计分析网格最小内角分布,并与原方法对比分析,以验证改进效果。运用自编程序,对具有复杂外形的空间膜结构进行流场网格剖分,并将该网格导入Ansys-CFX软件,进而数值模拟结构表面风压分布。经验证,该方法可有效地运用于流场网格剖分。     

多孔Al2O3陶瓷膜的修饰及其蒸汽分离性能的研究

采用原子层控制生长化学气相淀积方法对多孔γ -Al2 O3陶瓷膜进行缩孔修饰研究 .多孔陶瓷膜表层孔中淀积的Al2 O3大大减小了薄膜的孔径 .用缩孔修饰后的γ -Al2 O3陶瓷膜进行水蒸气分离实验 ,获得极好的分效果 ,相对湿度为 12 %时 ,水蒸气与氧气的分离系数达到 71.     

正交平面织物球面成型渔网模型的几何分析

为了从理论上表征平面正交织物球面成型后的几何特征, 提出基于坐标变换求解渔网模型的新方法, 确定单层正交平面织物在球面上铺覆成型后的网格位置、 织物剪切变形和纱线弯曲变形。依据弧长不变条件确定方形织物完全包覆球面后的对称面上的网格位置和局部坐标系下中间网格的位置, 利用坐标变换获得中间网格在整体坐标系成型球面上的坐标位置; 根据变形前后的网格形状确定织物面内剪切变形和两个方向纱线的弯曲曲率, 为织物的球面成型性评价提供几何参数。通过实例证明了当网格尺寸远小于球体半径时铺覆变形程度与网格 尺寸无关, 也与球体半径无关。铺覆后织物的剪切变形和纱线弯曲变形分布只与织物在球面上的球坐标位置有关。     

A fast algorithm for expansion over spherical harmonics

Algorithms for expansion over spherical harmonics are often used in electrostatic field calculation, calculation of the density functions in quantum chemistry and calculation of molecular surfaces. It usually includes expansion over spherical harmonics of degrees to several dozens. The usual method is to use an integration method over some grid on the unit sphere and in fact is a multiplication of the matrix of values of spherical harmonics in the grid points by a vector of values of the expanding function in the set of points. This algorithm executes O(NL²) operations whereN is the number of the grid points andL is the maximal degree of the spherical harmonics involved. We provide an algorithm of complexity O(NLlog² L) for multiplication of the matrix of values of spherical harmonics in points of an arbitrary grid on the unit sphere. The algorithm is based on interrelation between spherical harmonics and Legendre polynomials and on a fast algorithm for expansion over Legendre polynomials.     

Adsorption of Barium Atoms on Silicon Carbide

Technical Physics Letters - The adsorption of barium atoms on C and Si faces of 3C-, 6H-, and 4H-SiC polytypes is examined using the Haldane–Anderson model. The charge transfer from a barium...     

Simple Common Plane contact algorithm

The common‐plane (CP) algorithm is widely used in the discrete element method to model contact forces between interacting particles or blocks of rock. A new simple contact algorithm, similar to the CP algorithm, is proposed to model discontinuities such as joints, faults and material interfaces in an explicit finite difference code. The CP is defined as a plane separating interacting faces of grid cells, instead of blocks or particles used in the original CP method. The new method does not require iterations even for very stiff contacts. It is very robust and easy to implement, both in 2D and 3D parallel codes. Copyright © 2011 John Wiley & Sons, Ltd.     

A New Task Scheduling Scheme Based on Genetic Algorithm for Edge Computing

With the continuous evolution of smart grid and global energy interconnection technology, amount of intelligent terminals have been connected to power grid, which can be used for providing resource services as edge nodes. Traditional cloud computing can be used to provide storage services and task computing services in the power grid, but it faces challenges such as resource bottlenecks, time delays, and limited network bandwidth resources. Edge computing is an effective supplement for cloud computing, because it can provide users with local computing services with lower latency. However, because the resources in a single edge node are limited, resource-intensive tasks need to be divided into many subtasks and then assigned to different edge nodes by resource cooperation. Making task scheduling more efficient is an important issue. In this paper, a two-layer resource management scheme is proposed based on the concept of edge computing. In addition, a new task scheduling algorithm named GA-EC(Genetic Algorithm for Edge Computing) is put forth, based on a genetic algorithm, that can dynamically schedule tasks according to different scheduling goals. The simulation shows that the proposed algorithm has a beneficial effect on energy consumption and load balancing, and reduces time delay.     

Beamforming方法的阵列研究及其在噪声源识别中的应用

在传统平面网格阵列基础上提出一种改进的三层立体分层网格阵列布局方法,并比较十字阵列、平面网格阵列在不同条件下的指向性,结果显示立体网格阵列的指向性在三者中是最好的。对于脉动球声源的识别仿真研究,验证了基于三层立体网格阵列的波束成形方法的可行性,可以有效地识别和定位噪声源。     

一种数据网格存储模型与并行下载调度算法

针对在数据网格中创建多副本虽可有效提升下载速度、降低网络流量,但多副本创建会带来大量存储开销和网络流量开销,以及基于GridFTP协议的各种并行下载算法虽可进一步提升下载速度,但仍不能解决多副本对存储空间和网络流量的影响的问题,提出了一个能保证数据的完整性、存储的可靠性和降低存储空间的数据网格存储模型,并基于该存储模型和GridFTP协议,提出了一个并行下载调度算法。实验表明,该算法只需要较少的冗余便可达到现有的针对全副本的并行下载算法可达到的理想下载速度,取得较好的效果,实现并行快速传输、节约存储空间和降低网络流量的目标。     

微平面模型取向与权重的改进计算方法

在介绍微平面模型中数值离散算法的基础上,指出了现有文献中对微平面取向及权重的确定方法的特点和不足。针对微平面取向不够均匀以及微平面形状和物理意义不明确的问题,提出了一种基于正多面体表面网格划分后向球面进行投影的方法计算微平面取向,再利用球面几何的知识计算微平面权重的方法。在比选基于不同微平面划分方案时,提出了拟合宏观弹性刚度矩阵的优化目标。计算结果表明,该文所提方法可以得到微平面形状、大小完全均匀的划分方案,计算精度比文献中的最优方案更精确。     

三维激光测量的投影算法

在三维激光测量系统中,投影算法的研究和改进具有很重要的实际意义.本文首先分析了标准投影算法的原理,进行了理论公式的推导.同时,为了满足对更高性能算法的要求,在标准投影算法的不足的基础上,提出了全网格线性投影算法.通过对全网格线性投影算法原理和公式推导,可以发现全网格线性投影算法不但具有更高精度和速度,而且具有更强的自适应性和鲁棒性.本文给出了其原理和全部公式的推导,并完成了实验,给出了使用全网格线性投影法得出的实际三维扫描图像,得到了满意的结果.     

Service reliability and performance in grid system with star topology

The paper considers grid computing systems in which the resource management systems (RMS) can divide service tasks into subtasks and send the subtasks to different resources for parallel execution. In order to provide desired level of service reliability the RMS can assign the same subtasks to several independent resources for parallel execution.The service reliability and performance indices are introduced and a fast numerical algorithm for their evaluation for arbitrary subtask distribution in grid with star architecture is presented. This algorithm is based on the universal generating function technique.Illustrative examples are presented.     

Small blend suppression from B-rep models in computer-aided engineering analysis

In mechanical design, small blending is a common operation used to improve the strength and aesthetics of the workpiece. In blending operations, certain smooth faces are added to the boundary representation (B-rep) model to smooth sharp edges and vertices. These faces are termed ‘blend faces.’ However, they may affect the quality of analysis; these faces should be meshed with tiny meshes, which may result in an increase in computational time and reduced accuracy of simulation results. Hence, small blend suppression is an approach for improving the quality of generated meshes. Blend suppression is a technique for reverting a blended computer-aided design model to its original unblended status. This study proposes a blend suppression algorithm for removing blend faces in computer-aided engineering (CAE) analysis. The proposed algorithm operates as follows: (1) edge blend faces and vertex blend faces are grouped individually, (2) new geometric data are computed, (3) new elements are added to the data structure of the B-rep model, (4) all data related to blend faces are deleted, and (5) all topological data in the B-rep model are updated. Several examples are presented in this paper to demonstrate the feasibility of the proposed method for blend suppression as well as its advantage in improving the quality of meshes in CAE analysis.