空间柔性机械臂三维动力学数值仿真

本文应用ｄ＇Ａｌｅｍｂｅｒｔ－Ｌａｇｒａｎｇｅ原理，对由基座、（ｎ－１）个柔性连杆及端部负载组成，相互用柱铰连接的柔性链式多体系统进行建模；对在空间技术中，具有一刚杆，两柔杆加上刚性负载所组成的三维机械臂系统，采用Ｇｅａｒ算法进行数值仿真。仿真结果比较符合实际，从而在柔性多体系统的数学模型为刚性常微分方程的情况下，为解决其数值仿真问题，特别是三维问题的数值仿真取得了进展。     

利用计算机进行油气资源评价和勘探决策

本文着重介绍了构成《现代勘探决策理论系统》的5个主要计算机模块,即:生油岩热演化处理、求任意曲边形面积、数学模拟预测资源量、勘探经济评价分析及决策、辅助处理等模块。该系统曾在塔里木盆地和准噶尔盆地的油气资源评价和勘探决策中发挥了作用,受到了专家和用户的好评。     

差动光栅在精密测试中的应用

提出差动光栅概念,举例说明差动光栅在光纤面板刀口响应测试和材料形变自动监测系统等精密测试中的应用。     

MIM隧道结的电子输运特性和发光研究

论述作为一种新型发光器件的ＭＩＭ隧道结的发光机理，报告了该器件的发光现象和Ｉ－Ｖ特性曲线中负阻现象的实验观察。数据显示，结中表面等离极化激元（ＳＰＰ）与粗糙度的耦合是引起光发射的主要方面，ＳＰＰ对隧穿电子的阻塞作用导致了电子输运中的负阻现象。此外，还观察到了直接辐射的紫外峰。     

On the algebraic formulation of certain geometry statements and mechanical geometry theorem proving

In this paper we analyze the algebraic formulations of certain geometry statements appearing in recent literature related to mechanical geometry theorem proving and give several examples to show that one of these formulations can cause serious problems. We clarify a formulation which is essentially due to W. T. Wu and, in our opinion, is the most satisfactory.This author was supported by NSF Grants DCR-8503498 and CCR-8702108.     

汽轮机凝汽器液位测量改进方案

通过分析汽轮机凝汽器液面测量中出现的问题,提出改进的方案,介绍测量的原理及测量的优势所在。     

THE ANALYSIS OF THE SEPARATED LAYERS ALGORITHM BY DOMAIN DECOMPOSITION METHOD

From the principle of of the Domain Decomposition Method (DDM), we analyse the 2nd-order linear elliptic partial differential problems and link the Separated-Layers Algorithm (SLA) with DDM. The mathematical properties of SLA and numerical example are presented to obtain satisfactory computation results. For general linear differential ones, also are the structure of SLA and its characteristics discussed.     

Note on covering monotone orthogonal polygons with star-shaped polygons

In 1986, Keil provided an O(n²) time algorithm for the problem of covering monotone orthogonal polygons with the minimum number of r-star-shaped orthogonal polygons. This was later improved to O(n) time and space by Gewali et al. in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63]. In this paper we simplify the latter algorithm—we show that with a little modification, the first step Sweep1 of the discussed algorithm—which computes the top ceilings of horizontal grid segments—can be omitted.In addition, for the minimum orthogonal guard problem in the considered class of polygons, our approach provides a linear time algorithm which uses O(k) additional space, where k is the size of the optimal solution—the algorithm in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63] uses both O(n) time and O(n) additional space.     

Determining the Castability of Simple Polyhedra

A polyhedron P is castable if its boundary can be partitioned by a plane into two polyhedral terrains. Castable polyhedra can be manufactured easily using two cast parts, where each cast part can be removed from the object without breaking the cast part or the object. If we assume that the cast parts are each removed by a single translation, it is shown that for a simple polyhedron with n vertices, castability can be decided in time and linear space using a simple algorithm. A more complicated algorithm solves the problem in time and space, for any fixed ε > 0. In the case where the cast parts are to be removed in opposite directions, a simple O(n ² )-time algorithm is presented. Finally, if the object is a convex polyhedron and the cast parts are to be removed in opposite directions, a simple algorithm is presented. Received June 1, 1994; revised May 25, 1995.