电网电瓷外绝缘污秽等级的确定

综合分析了确定污秽等级的三要素，重点研究了以等值附盐密度作为定量参数存在的问题，并提出防污闪的根本措施是根据饱和盐密值确定泄漏比距，最后探讨了应用局部表面电导法作为定量参数进行污秽等级划分的优越性。     

Hausdorff局部凸线性拓扑空间中的不动点定理

在Ｈａｕｓｄｏｒｆｆ局部凸线性拓扑空间中，讨论了非扩张型集值映射的不动点问题，并给了了关于单值映射族具有公共不动点的结果，所得结论推广了Ｋａｎｎａｎ定理。     

集值映射下向量优化的最优性条件

研究了赋范空间中具有相依导数和切导数的集值映射的最优化问题。建立了集值映射的约束资格，给出了问题（ＶＰ）具Ｋｕｈｎ－Ｔｕｃｋｅｒ的充分条件和必要条件。     

抛石移距规律初探

从抛体在动水中运动的力学平衡方程式出发，获得了相应的抛石落距计算公式．通过室内资料验证分析表明，与实测结果符合得较好，说明所获公式的结构是合理的，定量描绘是能令人满意的，公式具有较好的实用价值．     

全国煤矿瓦斯地质编图研究成果初步总结

回顾了我国煤矿瓦斯地质编图的过程，总结了边缘交叉学科瓦斯地质研究所取得的成就及其在指导煤矿安全生产和工程中的应用。     

瓦斯地质编图在生产中的运用

通过矿井瓦斯地质编图，将井田划分为严重突出区、一般突出区、突出威胁区，按分区采取防突措施，指导了矿井的安全生产，获得了较好的社会效益和经济效益。     

生成圆弧的等距线约束方法及其应用

栅格圆弧的生成算法在计算机图形学和图像处理中有着大量的应用．一条曲线一定位于该线两侧的两条到该线距离足够小的等距线之间，或认为该曲线受其两侧的两条等距线的约束．本文从真实圆弧曲线受其两侧的等距圆的约束出发，提出一种生成栅格圆弧的等距线约束算法，并分析了该算法的精度．其优点是可单方向连续生成圆弧，且生成的两个相邻栅格圆之间不会有空隙或重叠，因此可直接用于圆域有关的图形生成和栅格点扩散搜索．本文最后研究了该方法在栅格圆环、圆盘及球面、球等生成及Euclid距离变换中的应用．     

应用析取克里格方法估计区域地下水埋深分布

本文比较了几种常用的估计土壤空间变异的计算方法，介绍了析取克里格的理论和计算方法，给出计算区域地下水埋深分布的实例，并对普通克里格和析取克里格的计算方差作了比较。     

Mobile robot localization using a self-organized visual environment representation

Owing to the upcoming applications in the field of service robotics mobile robots are currently receiving increasing attention in industry and the scientific community. Applications in the area of service robotics demand a high degree of system autonomy, which robots without learning capabilities will not be able to meet. Learning is required in the context of action models and appropriate perception procedures. In both areas flexible adaptivity is difficult to achieve especially when high bandwidth sensors (e.g. video cameras) - which are needed in the envisioned unstructured worlds - are used. This paper proposes a new methodology for image-based navigation using a self-organized visual representation of the environment. Self-organization leads to internal representations, which can be used by the robot, but are not transparent to the user. It is shown how this conceptual gap can be bridged.     

On-line Planning for Collision Avoidance on the Nominal Path

In this paper a solution to the obstacle avoidance problem for a mobile robot moving in the two-dimensional Cartesian plane is presented. The robot is modelled as a linear time-invariant dynamic system of finite size enclosed by a circle and the obstacles are modelled as circles travelling along rectilinear trajectories. This work deals with the avoidance problem when the obstacles move in known trajectories. The robot starts its journey on a nominal straight line path with a nominal velocity. When an obstacle is detected to be on a collision course with the robot, the robot must devise a plan to avoid the obstacle whilst minimising a cost index defined as the total sum squared of the magnitudes of the deviations of its velocity from the nominal velocity. The planning strategy adopted here is adjustment of the robot's velocity on the nominal path based on the time of collision between the robot and a moving obstacle, and determination of a desired final state such that its Euclidean distance from the nominal final state is minimal. Obstacle avoidance by deviation from the nominal path in deterministic and random environments is based on the work presented here and is investigated in another paper.