A novel virtual node method for polygonal elements

A novel polygonal finite element method （PFEM） based on partition of unity is proposed, termed the virtual node method （VNM）. To test the performance of the present method, numerical examples are given for solid mechanics problems. With a polynomial form, the VNM achieves better results than those of traditional PFEMs, including the Wachspress method and the mean value method in standard patch tests. Compared with the standard triangular FEM, the VNM can achieve better accuracy. With the ability to construct shape functions on polygonal elements, the VNM provides greater flexibility in mesh generation. Therefore, several fracture problems are studied to demonstrate the potential implementation. With the advantage of the VNM, the convenient refinement and remeshing strategy are applied.     

一种求解有限元问题结点平衡方程的快速方法

目前随着工程实际问题复杂程度的增加及分析的要求,特别是材料非线性分析的引入,尽管计算机的运算速度、内存、外存容量等不断提高,但并不能完全满足大规模计算的需要,更快、更节省存贮空间的算法一直是有限元法分析过程中的一项核心技术要求。本文针对一些结点及单元均规律化地排列的有限元问题,提出可以透过其相邻结点的关系记录结点平衡方程中系数矩阵的非零元素,无需再像等带宽存贮那样去记录带宽内大量的零元素。此方法可以大大地减少系数矩阵元素的存贮量,从而可以提高计算机读取数据的速度及改善利用迭代法求解的效率。     

甲状腺癌转移性淋巴结的红外光谱研究

联合运用衰减全反射(attenuated total reflectance,ATR)探头与FTIR光谱仪,测定了新鲜离体的甲状腺癌转移性颈部淋巴结20枚和非转移性淋巴结69枚的FTIR光谱,比较两组光谱13个谱带的峰位及相对峰强等28个指标,找出甲状腺癌转移性淋巴结光谱的特征。与非转移性淋巴结相比,转移性淋巴结光谱中与蛋白、脂质、糖类、核酸相关的谱带均发生了明显的变化,具体如下：(1)与蛋白质相关的谱带的相对峰强I_{3 280}/I1 460(P=0.029),I_{1 640}/I_{1 460}(P=0.019),I_{1 546}/I_{1 460}(P=0.004)均显著升高;(2)脂类相关的相对峰强I_{1 743}/I_{1 460}显著降低(P=0.026),而I_{1 400}/I_{14 60}则明显增高(P=0.001);(3)与糖类相关的1 165与1 120 cm-1处峰位P_{1 165}(P=0.019),P_{1 120}(P=0.000)发生明显蓝移(向高波数移动),相对峰强I1 165/I_{1 460}显著降低(P=0.006);(4)与核酸相关的1 085 cm-1处峰位P_{1 085}发生明显地红移(向低波数移动)(P=0.029);(5)其他指认未明的谱带的相对峰强I_{1 303}/I_{1 460}(P=0.008),I_{1 303}/I1 240(P=0.039)均明显升高。与非转移性淋巴结光谱相比较,甲癌转移的淋巴结光谱在多个谱带的峰位或相对峰强方面存在显著的差异。FTIR可应用于术中甲状腺癌转移性淋巴结的探测。     

泡泡布点方法及其并行性

针对无网格和有限元方法中的布点需求,借鉴分子动力学方法和泡泡网格化方法的思想和处理技术,提出一种单纯的布点方法--泡泡布点方法.将区域内的点看作有相互作用力的泡泡,通过动态模拟得到高质量的点集,模拟中不需要网格连接.算例显示,生成的均匀点集和非均匀点集都具有很好的结构和渐进性,并对复杂区域具有很好的适应性.同时由于相互作用力的局部性,该布点方法类似于短程作用的分子动力学模拟,拥有潜在的并行性.通过初步的并行算例,验证了其并行化的可行性.     

弹性动力学的双互易杂交边界点法

将双互易法同杂交边界点法相结合,提出了求解弹性动力问题的新型数值方法------双互易杂交边界点方法. 该算法在求解弹性动力问题时,将控制方程非齐次项的域内积分转化为边界积分. 该方法将问题的解分为通解和特解两部分,通解使用杂交边界点法求得,特解则使用局部径向基函数插值得到,从而实现了使用静力问题的基本解来求解动力问题. 计算时仅仅需要边界上离散点的信息,无论积分还是插值都不需要网格,域内节点仅用来插值非齐次项,因此该算法仍是一种边界类型的无网格方法. 数值算例表明,该方法后处理简单,计算精度高,适合于求解弹性动力问题.      

高压电气设备支架串联体系地震响应半解析法

针对具有集中分布参数柔性节点的多节电瓷型高压电气设备支架串联体系,通过应用分布参数梁振动理论与集中参数通过边界条件的引入,推导出其频率方程,然后通过数值方法求得频率及振型。通过应用Betti定律,推导出具有集中分布参数柔性节点的多节电瓷型高压电气设备支架串联体系振型的正交条件,应用此正交条件对集中参数与分布参数的振动方程解耦,从而得到广义质量及广义荷载,然后通过振型叠加法求解结构的地震响应。最后应用该半解析法与有限元法数值积分法对一330 KV电压互感器支架串联体系地震响应进行分析,分析结果表明,该半解析法求解的地震响应与有限元直接积分法求解的地震响应相一致,从而为具有集中分布参数柔性节点的多节电瓷型高压电气设备支架串联体系的地震响应分析和抗震设计提供了一种新的途径。     

任意平面区域的变尺寸有限元网格划分

利用任意平面域边界表述中的拓年要素定义网格的控制信息,通过引入节点间距函数来控制区域内网格尺寸变化,并将结合前沿生成法和Ｄｅｌａｕｎａｙ三角化方法的优点,优先处理前沿的最长边,尽可能在局部生成边长逐渐减小的Ｄｅｌａｕｎａｙ三角形,最终实验区域内网格的疏密过渡。     

用电磁打点计时器演示"驻波

概述了传统“驻波”演示实验方法的不足,介绍了用电磁打点计时器演示“驻波”的实验方法及其效果。     

DUAL RECIPROCITY HYBRID BOUNDARY NODE METHOD FOR THREE-DIMENSIONAL ELASTICITY WITH BODY FORCE

Combining Dual Reciprocity Method （DRM） with Hybrid Boundary Node Method （HBNM）, the Dual Reciprocity Hybrid Boundary Node Method （DRHBNM） is developed for three-dimensional linear elasticity problems with body force. This method can be used to solve the elasticity problems with body force without domain integral, which is inevitable by HBNM. To demonstrate the versatility and the fast convergence of this method, some numerical examples of 3-D elasticity problems with body forces are examined. The computational results show that the present method is effective and can be widely applied in solving practical engineering problems.     

An Efficient Routing Scheme Based on Node Attributes for Opportunistic Networks in Oceans

Along with the fast development of the marine economy and ever-increasing human activities, handy and reliable marine networking services are increasingly required in recent years. The ocean faces challenges to support cost-effective communication due to its special environments. Opportunistic networks with easy deployment and self-curing capability are expected to play an important role to adapt to such dynamic networking environments. In the literature, routing schemes for opportunistic networks mainly exploit node mobility and local relaying technologies. They did not take into account the impact of node behaviors on encountering opportunities and in case of no further relaying, network performance would be greatly degraded. To solve the problem, we propose an efficient routing scheme based on node attributes for opportunistic networks. We first construct delivery competency to predict the further relay nodes. Then a forwarding willingness mechanism is introduced to evaluate the relaying probability combining device capacity and movement behaviors of nodes. Finally, the utility metric is used to make decisions on message forwarding. The results show that the proposed scheme improves network performance in terms of delivery ratio, average latency, and overhead ratio as compared to other schemes.