基于泰勒展开图的数据路径高层次验证

泰勒展开图是基于图的表达方式,能够有效地表示多变量多项式.提出泰勒展开图的变量替换算法和变量合并算法.并在此基础上提出一个反向构建泰勒展开图的算法,该算法用于多项式数据路径的行为描述和寄存器传输级实现之间的等价性验证.实验结果表明提出的算法是有效的.     

包装生产线的PLC控制

叙述了采用可编程控制器PLC实现包装生产线的自动控制方法，给出了系统的梯形图和接线图。     

地理环境与传统民居屋顶形态特征的对应思考

民居是建筑中数量最多、历史悠久和分布最广泛的类型,屋顶更是高度集中浓缩了民居的形象,是不折不扣的"第五立面",它是自然和人工造物的结晶。至今为止,虽有许多屋顶方面的研究,但多聚焦在个体的屋顶,较少关注屋顶间的联系,特别是与地域的关联性,为此,该研究通过中国传统民居与中国地图的简单空间叠加以及屋顶形态的视觉分析,试图说明传统民居屋顶形成与自然社会环境的关系,同时解释地理环境与屋顶形态的对应关系和屋顶的个性特征,为今后系统地研究建筑地理学课题提供思路和方法。     

并联电容器装置设计分析

运行中并联电容器装置事故时有发生 ,由于电容器事故不作为考核事故统计 ,忽略了对电容器装置事故的分析。从而掩盖了由于未按《并联电容器装置设计规范》设计而引发了并联电容器装置的事故这一事实     

逻辑表达式图的实现及其在集成电路故障 可测性中的应用

数字电路的可靠性有着至关重要的影响,测试是其重要保证,测试向量的自动生成(ATPG)在数字电路的测试中占有重要地位;逻辑表达式图(Boolean Expression Diagrams,BED)是用于逻辑函数与逻辑电路表达与运算一种数据结构,能够将逻辑电路在线性空间复杂度内表达,是二元判决图(Binary Decision Diagrams, BDD)在概念上的推广且保留着BDD的许多有用的性质。讨论了BED的性质与实现方法,并将BED用于逻辑电路呆滞型故障测试向量的自动生成中,基于BED的测试算法直接将原电路与故障电路做异或运算后用BED表达再化简或判断其可满足性,算法能充分使用逻辑代数的化简规则和利用电路与故障电路的相似性。实验结果表明,基于BED的测试方法具有较低的复杂度。     

利用VC＋＋开发GIS系统

提供了一种实现地理信息系统(GIS)的新的解决方案,即利用VC 开发GIS系统.在这种解决方案中,利用VC 6.0提供的设备环境,实现各种绘图功能,同时,采用面向对象的方法来组织和管理矢量图形数据.其中,重点阐述了实现矢量图形存储的方法.     

房县桥上乡蛤蟆洞特色旅游(地质遗迹)资源的开发与保护

根据对蛤蟆洞化石群产地的地理特征和当地自然资源的分析 ,探讨了蛤蟆洞洞穴生态旅游资源的开发潜力 ,阐明了如何发掘洞穴旅游资源集知识性、趣味性、科普性、科考性为一体的多层次、多专题旅游活动 ,实现洞穴地质旅游资源的可持续发展 ,并提出了在地质旅游资源开发过程中需要注重的问题以及特色生态旅游资源的开发价值与意义。     

GIS技术在环境系统中的应用探讨

简要介绍了地理信息系统(GIS)技术的功能特点,从大气、水、土壤、噪声等四个方面探讨了GIS在环境系统中的应用,指出GIS是研究各环境子系统协同效应的优良技术     

Sequence Algebra, Sequence Decision Diagrams and Dynamic Fault Trees

A large attention has been focused on the Dynamic Fault Trees in the past few years. By adding new gates to static (regular) Fault Trees, Dynamic Fault Trees aim to take into account dependencies among events. Merle et al. proposed recently an algebraic framework to give a formal interpretation to these gates.In this article, we extend Merle et al.'s work by adopting a slightly different perspective. We introduce Sequence Algebras that can be seen as Algebras of Basic Events, representing failures of non-repairable components. We show how to interpret Dynamic Fault Trees within this framework. Finally, we propose a new data structure to encode sets of sequences of Basic Events: Sequence Decision Diagrams. Sequence Decision Diagrams are very much inspired from Minato's Zero-Suppressed Binary Decision Diagrams. We show that all operations of Sequence Algebras can be performed on this data structure.     

A new hierarchical triangle-based point-in-polygon data structure

The point-in-polygon or containment test is fundamental in computational geometry and is applied intensively in geographical information systems. When this test is repeated several times with the same polygon a data structure is necessary in order to reduce the linear time needed to obtain an inclusion result. In the literature different approaches, like grids or quadtrees, have been proposed for reducing the complexity of these algorithms. We propose a new data structure based on hierarchical subdivisions by means of tri-cones, which reduces the time necessary for this inclusion test. This data structure, named tri-tree, decomposes the whole space by means of tri-cones and classifies the edges of the polygon. For the inclusion test only the edges classified in one tri-cone are considered. The tri-tree has a set of properties which makes it specially suited to this aim, with a similar complexity to other data structures, but well suited to polygons which represent regions. We include a theoretical and practical study in which the new data structure is compared with classical ones, showing a significant improvement.