Two gate variable reduction principles, algorithms of computing K-trees and minimum K-cuts of a network are proposed firstly. 首先提出了网络门限变量的两个化简原则及计算网络K-树和极小K-割的算法。
From the viewpoint of the universal this paper proposed an algorithm which is called the variable universal reduction algorithm. 从论域的角度出发,提出了一种变论域知识约简算法。
We firstly introduce a generalized model of method invocation. According to our generalized model we proposed an algorithm of parallelism analysis. Our algorithm includes three steps, which are variable expression reduction, intra procedure analysis and inter procedure analysis to compute define use sets. 文中首先给出了一般化的方法调用模型,然后基于该模型给出了表达式化简、过程内和过程间分析的算法,该算法可以求出变量的定义和使用集合,用于并行性分析。
Probabilistic Analysis of Variable Load Reduction Factor for Column of Tall Buildings 高层建筑结构柱荷载折减系数的概率分析
Structural optimization of dividing-wall was carried out under the conditions that height and cross-sectional shape parameters were set as independent variable and reduction of the maximum tensile stress was set as optimization objective, its aim was to find a shape that was safer. 以隔墙高度、断面形状参数为自变量,隔墙根部最大拉应力减小为优化目标,对隔墙结构体型进行优选,以寻找具有较大安全储备的隔墙体型。