综合线损分析系统研究

描述了综合线损分析系统应该具有的主要功能和分析内容，介绍了系统实现中应该注意的几个问题、系统内容和实现方法。     

化学计算与图形处理软件设计

近年来 ,化学计算与图形处理越来越受到重视 ,许多用于微机计算的精确公式也相继发表 .介绍了酸碱滴定曲线通用计算公式、络合滴定通用计算公式、氧化还原滴定通用计算公式、混合体系缓冲容量的通用算法以及这些公式在图形处理中的应用 .简要介绍了笔者以Delphi5.0为平台处理图形时的流程及思路 .     

交错群A_5的4度连通对称图的分类

一个图Г称为G-对称的(symmetric).如果其同构群Aut(r)的一个子群G在图r的有向孤集(set of ordered pairs of adjacent vertices)上的作用是传递的(transitive).本文主要结果是:设图Г是4度对称图.全自同构群Aut(r)=A_5,则图r是且仅是如下图之一:(1)Г是15个点的完全图K_5的三维覆盖(3-fold cover)图.(2)Г是完全图K_5.     

Oriented colorings of 2-outerplanar graphs

A graph G is 2-outerplanar if it has a planar embedding such that the subgraph obtained by removing the vertices of the outer face is outerplanar. The oriented chromatic number of an oriented graph H is defined as the minimum order of an oriented graph H^′ such that H has a homomorphism to H^′. In this paper, we prove that 2-outerplanar graphs are 4-degenerate. We also show that oriented 2-outerplanar graphs have a homomorphism to the Paley tournament QR₆₇, which implies that their (strong) oriented chromatic number is at most 67.     

R－X图解法计算多级串联理想混合反应器

论述Ｒ－Ｘ图解法计算多级串联理想混合反应器的基本原理，并结合实例，对Ｒ－Ｘ法的计算步骤予以详细介绍，为多级串联反应器的设计与计算，提供一种新颖适用的图解计算方法。     

Fast Recognition of Fibonacci Cubes

Fibonacci cubes are induced subgraphs of hypercubes based on Fibonacci strings. They were introduced to represent interconnection networks as an alternative to the hypercube networks. We derive a characterization of Fibonacci cubes founded on the concept of resonance graphs. The characterization is the basis for an algorithm which recognizes these graphs in O(mlog n) time. A. Vesel supported by the Ministry of Science of Slovenia under the grant 0101-P-297.     

Longest fault-free paths in hypercubes with vertex faults

The hypercube is one of the most versatile and efficient interconnection networks (networks for short) so far discovered for parallel computation. Let f denote the number of faulty vertices in an n-cube. This study demonstrates that when f ? n − 2, the n-cube contains a fault-free path with length at least 2ⁿ − 2f − 1 (or 2ⁿ − 2f − 2) between two arbitrary vertices of odd (or even) distance. Since an n-cube is a bipartite graph with two partite sets of equal size, the path is longest in the worst-case. Furthermore, since the connectivity of an n-cube is n, the n-cube cannot tolerate n − 1 faulty vertices. Hence, our result is optimal.     

广义AND／OR图的自底向上的启发式搜索算法BHAO

本文首先根据三角模概念，定义了一类新的更具普遍意义的广义ＡＮＤ／ＯＲ图．根据新定义的启发式函数ｈ（ｎ，ｘ）以及广义ＡＮＤ／ＯＲ图的最佳解树之所有子树亦是最佳子解树的原理，提出了广义ＡＮＤ／ＯＲ图的自底向上的启发式搜索算法ＢＨＡＯ．文中证明了算法ＢＨＡＯ的可采纳性．本文还提出了两类新的启发式函数的单调限制概念，并据此研究了算法ＢＨＡＯ的单调限制性质，研究了两个ＢＨＡＯ算法间的比较性质．     

VB与VC优化配合在安全监察软件系统中的应用

安全监察是矿山安全中很重要的环节。利用VC的强大计算功能和VB的编程简单性采用VB与VC优化配合使用的方法开发安全监察软件系统是快速、简单、高效的设计方法。文章对系统的整体结构和信息流程作了简要的介绍，并对系统的每个部分各以一个例子进行简单的阐述。     

人参皂苷Rg分子轨道微扰理论的研究

人参皂苷Rg是具有生理活性的物质，它包括三个异构体：Rg1；Rg2；Rg3其中R83具有很强的抗癌作用。本文通过休克尔分子图形理论对Rg异构体的各分子轨道进行约化，并且根据分子轨道微扰理论求出它们不同本征多项式和本征值。