逻辑程序的一种并行执行模型

本文基于静态相关性分析和动态调整相结合的方法，提出了一种逻辑程序的执行模型，它不仅开发了“与“并行，同进也开发了一定的“或“并行，从而有效地加速了逻辑程序的执行。     

智能化系统在新火车站的应用——福州火车站智能化系统设计总结

福州火车站智能化系统包括到发通告、旅客引导显示、客运广播、建筑设备自动控制等7个子系统和系统总集成。     

机械设备大修理与否的经济界限的确定

机械设备的大修理与更新之间存在合理的经济界限。针对传统的确定二者之界限的数学模型提出改进，确定了大修理与重置更新界限的比较原则与方法。     

道路与匝道中线自动绘制的算法与实现

道路与立交匝道平面中线的计算机自动绘制是道路路线CAD软件的核心功能之一,在道路工程计算机动态交互式设计、计算机辅助成图方面具有基础性作用.依据道路中线线形的曲率变化特点,推导了道路中线坐标计算的通用数学模型,并根据一个工程实例在通用图形系统AutoCAD环境下实现了道路与匝道中线的自动绘制.     

一种全局优化的多面体凸分解匹配方法

提出了一种全局优化的多面体匹配方法，该方法对物体的拓扑关系和结构关系进行多级匹配,利用全局优化的松驰迭代方法减少匹配误差，并由匹配的一致性准则进行匹配结果的检测，根据物体的内在特征来进行匹配，从而解决非同构物体的匹配.可广泛应用于物体识别、三维物体重建、医学图象处理等领域，实验证明此方法质量好、自动化程度高，是一种有效的全局优化结构匹配方法．     

GIS中矢量图形的结构分析与VC++中的实现

简要讨论了GIS各类矢量图形元素间的空间拓朴结构及基位置关系 ,并用VC 6 . 0及MFC具体分析了圆弧与多边形区域的相交关系及实现。为利用VC开发专用图形软件提供了有用帮助。     

Boundary knot method for 2D and 3D Helmholtz and convection–diffusion problems under complicated geometry

The boundary knot method (BKM) of very recent origin is an inherently meshless, integration‐free, boundary‐type, radial basis function collocation technique for the numerical discretization of general partial differential equation systems. Unlike the method of fundamental solutions, the use of non‐singular general solution in the BKM avoids the unnecessary requirement of constructing a controversial artificial boundary outside the physical domain. The purpose of this paper is to extend the BKM to solve 2D Helmholtz and convection–diffusion problems under rather complicated irregular geometry. The method is also first applied to 3D problems. Numerical experiments validate that the BKM can produce highly accurate solutions using a relatively small number of knots. For inhomogeneous cases, some inner knots are found necessary to guarantee accuracy and stability. The stability and convergence of the BKM are numerically illustrated and the completeness issue is also discussed. Copyright © 2003 John Wiley & Sons, Ltd.     

Node-pair reliability of network systems with small distances between adjacent nodes

A new method for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence is presented. It is based on a recursive algorithm using the “sliding window” technique, the window being composed of several consecutive nodes. In a single step, the connectivity probabilities for all nodes included in the window are found. Subsequently, the window is moved one node forward. This process is repeated until, in the last step, the window reaches the terminal node. The connectivity probabilities found at that point are used to compute the node-pair reliability of the network system considered. The algorithm is designed especially for graphs with small distances between adjacent nodes, where the distance between two nodes is defined as the absolute value of the difference between the nodes’ numbers. The maximal distance between any two adjacent nodes is denoted by Γ(G), where G symbolizes a random graph. If Γ(G)=2 then the method can be applied for directed as well as undirected graphs whose nodes and edges are subject to failure. This is important in view of the fact that many algorithms computing network reliability are designed for graphs with failure-prone edges and reliable nodes. If Γ(G)=3 then the method's applicability is limited to undirected graphs with reliable nodes. The main asset of the presented algorithms is their low numerical complexity—O(n), where n denotes the number of nodes.     

一般应力比时焊接结构S－N曲线的预测方法

本文考虑了焊接结构的几何形状、受载形式、应力比、残余应力、尺寸效应以及材料等因素对疲劳寿命的影响，利用Ｐｅｔｅｒｓｏｎ公式和极值疲劳切口系数概念，建立了一般应力比时焊接结构Ｓ－Ｎ曲线的预估模型．文中对几类典型的焊接结构的Ｓ－Ｎ曲线进行了预测，预测值与实验结果符合较好．本文方法可以大量减少疲劳实验，具有一定的工程实用价值．