共查询到20条相似文献,搜索用时 125 毫秒
1.
2.
逻辑函数求补算法及其改进 总被引:2,自引:1,他引:2
逻辑函数求补算法存在的主要问题是时间开销大及需要的存储空间过大。该文在对递归裂变求补算法和基于最小项求补算法进行分析研究的基础上,提出了积项输入、邻项合并、积项输出的无冗余覆盖的逻辑函数求补算法。该求补算法的时间、空间的需求将大大缩小。 相似文献
3.
刘维富 《计算机技术与发展》2002,12(5)
逻辑函数求补是大变量逻辑优化的算法基础.采用二叉树结构,用C语言实现了大变量逻辑函数求补递归算法.详述了求补二叉树的结构和形成过程,以及在求补二叉树上补集的收集方法. 相似文献
4.
5.
逻辑函数数求补是大变量逻辑优化的算法基础,采用二叉树结构,用C语言实现了大变量逻辑函数求补递归算法。详述了求补二叉树的结构和形成过程,以及在求补二叉树上补集的收集方法。 相似文献
6.
在对Espresso算法进行分析改进的基础上,提出了一种基于全域识别的多输入多输出逻辑函数实质本源项、完全冗余项和相对冗余项生成算法,该算法通过对基于积项表示的多输入多输出逻辑函数的余因子计算来进行全域判断,根据全域判断结果来识别实质本源项、完全冗余项和相对冗余项,从而构成实质本源项集合、完全冗余项集合和相对冗余项集合.对基于二级SOP型的多输入多输出逻辑函数设计了多输入多输出逻辑函数优化识别软件系统,允许的最大输入变量数为128、最大输出变量数为256、最大输入输出变量总和为300、最大输入积项数为20 000.软件系统在Pentium 1.8GHz、512MB内存的计算机上通过了Benchmark例题的测试. 相似文献
7.
在对Espresso算法进行分析改进的基础上,提出了一种基于全域识别的多输入多输出逻辑函数实质本源项、完全冗余项和相对冗余项生成算法,该算法通过对基于积项表示的多输入多输出逻辑函数的余因子计算来进行全域判断,根据全域判断结果来识别实质本源项、完全冗余项和相对冗余项,从而构成实质本源项集合、完全冗余项集合和相对冗余项集合。对基于二级SOP型的多输入多输出逻辑函数设计了多输入多输出逻辑函数优化识别软件系统,允许的最大输入变量数为128、最大输出变量数为256、最大输入输出变量总和为300、最大输入积项数为20 000。软件系统在Pentium 1.8GHz、512MB内存的计算机上通过了Benchmark例题的测试。 相似文献
8.
9.
根据单边逻辑函数的特性,介绍了一种多输入多输出单边逻辑函数补集方法,该方法采用二进制特征矩阵B(F)和状态矢量R(F)来描述原函数,进行最小列覆盖的选择形成多输出补集函数的控制矩阵,由控制矩阵与补集函数的状态矢量形成单边单输出补集合逻辑函数,通过多输出逻辑函数分解与合并最终产生多输出单边逻辑函数的补集。我们设计的多输入多输出单边逻辑函数补集算法软件,在P-1.8GHz、512MBRAM的计算机上完成测试和运行,并通过测试检验程序,保证输出结果在逻辑上与输入条件求补等价。 相似文献
10.
11.
提出Vague值向Fuzzy值转化的实用方法的定义。针对文献[6]中的一个Vague值向Fuzzy值转化的均值修正法,提出了加权均值修正法,并证明了这种方法同样是Vague值向Fuzzy转化的一种非常实用的方法。 相似文献
12.
In this paper, we present a new method for analyzing fuzzy risk based on a new method for ranking generalized fuzzy numbers. First, we present a new method for ranking generalized fuzzy numbers. It considers the areas on the positive side, the areas on the negative side and the heights of the generalized fuzzy numbers to evaluate ranking scores of the generalized fuzzy numbers. The proposed method can overcome the drawbacks of some existing methods for ranking generalized fuzzy numbers. Then, we apply the proposed method for ranking generalized fuzzy numbers to develop a new method for dealing with fuzzy risk analysis problems. The proposed method provides us with a useful way to deal with fuzzy risk analysis problems based on generalized fuzzy numbers. 相似文献
13.
Shyi-Ming Chen Ming-Wey Yang Szu-Wei Yang Tian-Wei Sheu Churn-Jung Liau 《Expert systems with applications》2012,39(15):12085-12091
In this paper, we present a new method for multicriteria fuzzy decision making based on interval-valued intuitionistic fuzzy sets, where interval-valued intuitionistic fuzzy values are used to represent evaluating values of the decision-maker with respect to alternatives. First, we propose a new method for ranking interval-valued intuitionistic fuzzy values. Based on the proposed fuzzy ranking method of interval-valued intuitionistic fuzzy values, we propose a new method for multicriteria fuzzy decision making. The proposed multicriteria fuzzy decision making method outperforms Ye’s method (2009) due to the fact that the proposed method can overcome the drawback of Ye’s method (2009), where the drawback of Ye’s method is that it can not distinguish the ranking order between alternatives in some situations. The proposed method provides us with a useful way for dealing with multicriteria fuzzy decision making problems based on interval-valued intuitionistic fuzzy sets. 相似文献
14.
15.
Ikuyo Kaneko 《Computer Methods in Applied Mechanics and Engineering》1980,21(2):193-209
A mathematical programming method is proposed for determining the complete history of (generalized) stresses and strains during a loading process for a class of elastic-plastic structures. This method is based on a pivoting procedure similar to the simplex method for a linear program and is suited for computer implementation. The method is illustrated by a simple truss problem. Based on the method, some results on existence and uniqueness of the solution of the structural problem are established. 相似文献
16.
Yi Yan 《Computer Methods in Applied Mechanics and Engineering》1993,110(3-4):285-299
In this paper, we present a fast method for solving boundary integral equations arising from the exterior Dirichlet problem for the two-dimensional Helmholtz equation. This method combines a quadrature method for discretizing the boundary integral equations with a preconditioned iterative method for solving the resulting dense, nonsymmetric linear systems. Using this method, a polynomial rate of convergence can be obtained by performing a finite number of iterations, which yields high computational efficiency. Various numerical examples are presented. 相似文献
17.
In this paper, we propose a prefix code matching parallel load-balancing method (PCMPLB) to efficiently deal with the load imbalance of solution-adaptive finite element application programs on distributed memory multicomputers. The main idea of the PCMPLB method is first to construct a prefix code tree for processors. Based on the prefix code tree, a schedule for performing load transfer among processors can be determined by concurrently and recursively dividing the tree into two subtrees and finding a maximum matching for processors in the two subtrees until the leaves of the prefix code tree are reached. We have implemented the PCMPLB method on an SP2 parallel machine and compared its performance with two load-balancing methods, the directed diffusion method and the multilevel diffusion method, and five mapping methods, the AE/ORB method, the AE/MC method, the MLkP method, the PARTY library method, and the JOSTLE-MS method. An unstructured finite element graph Truss was used as a test sample. During the execution, Truss was refined five times. Three criteria, the execution time of mapping/load-balancing methods, the execution time of an application program under different mapping/load-balancing methods, and the speedups achieved by mapping/load-balancing methods for an application program, are used for the performance evaluation. The experimental results show that (1) if a mapping method is used for the initial partitioning and this mapping method or a load-balancing method is used in each refinement, the execution time of an application program under a load-balancing method is less than that of the mapping method. (2) The execution time of an application program under the PCMPLB method is less than that of the directed diffusion method and the multilevel diffusion method. 相似文献
18.
In this paper, we present a novel method for fast lossy or lossless compression and decompression of regular height fields. The method is suitable for SIMD parallel implementation and thus inherently suitable for modern GPU architectures. Lossy compression is achieved by approximating the height field with a set of quadratic Bezier surfaces. In addition, lossless compression is achieved by superimposing the residuals over the lossy approximation. We validated the method’s efficiency through a CUDA implementation of compression and decompression algorithms. The method allows independent decompression of individual data points, as well as progressive decompression. Even in the case of lossy decompression, the decompressed surface is inherently seamless. In comparison with the GPU-oriented state-of-the-art method, the proposed method, combined with a widely available lossless compression method (such as DEFLATE), achieves comparable compression ratios. The method’s efficiency slightly outperforms the state-of-the-art method for very high workloads and considerably for lower workloads. 相似文献
19.
Kensuke Yokoi 《Journal of scientific computing》2008,35(2-3):372-396
We propose a simple and practical numerical method for free surface flows. The method is based various methods, the level set method of an interface capturing method, the THINC/WLIC (tangent of hyperbola for interface capturing/weighed line interface calculation) method of an interface tracking method, the CIP-CSL (constrained interpolation profile conservative semi-Lagrangian) method of a conservation equation solver, VSIAM3 (volume/surface integrated average based multi-moment method) of a fluid solver and the CSF (continuum surface force) model of a surface force model. The level set method and the THINC/WLIC method are combined by using a CLSVOF (coupled level set and volume-of-fluid) framework. The method is applied to Rayleigh-Taylor instability with surface tension force and droplet impact on a thin liquid layer (milk crown). 相似文献
20.
谢深泉 《小型微型计算机系统》2011,32(6)
图的表示方法很多,各有其优缺点.采用不同的表示方法,可获得图的不同的时空性能.本文阐述了图的一种新表示方法,该方法用一种命名规则将有向图表示为节点标签表,给出了由节点标签表产生节点链的算法.并用这种称为表方法研究了有向图的回路性质,特别地将它应用于研究de Bruijn回路、欧拉回路和哈密顿回路,给出了计算欧拉回路和哈密顿回路的新方法.本研究表明该方法具有较好的理论和实用价值. 相似文献