Improvement of connectivity sieve algorithms for disassembly AND/OR graph;
对拆卸与或图连通性判定算法的改进和研究
By comparing three models of Connection graph, Direct graph and AND/OR graph, the paper points out the merits and shortcomings of each model.
本文通过无向图、有向图和与或图三种以图论为基础的拆卸回收模型的比较,指出了各种模型存在的优缺点,为完善面向拆卸回收的绿色设计结构模型提供依据。
Research on decomposition and transformation of complex decision problem based on cloud and/or tree;
基于云与或树的复杂决策问题规约研究
This paper formalizes a product structure with related characteristics based on AND/OR tree,and shows that the employment of this formalization can achieve a more flexible BOM design.
形式化定义和描述了一种基于与或树的产品结构及其相关特性,基于该结构的BOM设计具有更好的产品配置柔性。
This paper systematically describes the model of an AND/OR network as well as a feasibility testing algorithm for AND/OR precedence constrained task scheduling.
系统描述了与/或网模型及与/或优先约束任务调度的可行性判定算法。
The process consists in building the operation rule tree with the help of and/or tree according to the operation task, and decomposing it into sub-trees, from which the feasible operation series is extracted to realize the transformation of the status of the specific device from the initial status into goal status.
其过程为:根据给定的操作任务,借助“与或”树建立规则树,然后分解为方案树,最后从方案树中整理出操作序列,实现系统中目标设备由初始状态向目标状态的转换。
By decomposing workflow model based on their business instances,the verification of WAR was reduced to that of its business instances,the parallel task sets of the business instances and the tasks authorization reasonability in the parallel task set,thus the corresponding And/Or tree notat.
通过基于业务实例的工作流模型分解,将工作流授权合理性问题分解为业务实例、业务实例的并发任务集合、并发任务集合中任务的授权合理性问题,得到工作流授权合理性问题的与/或树表示。
Meantime,research the knowledge representation with causal reasoning iterative and inference engine searching mechanism based on the and/or tree.
同时,研究规则类知识在知识库中的因果迭代表示方法以及基于与/或树的推理机搜索机制,并利用JSP技术实现与知识库相对分离的推理机,建立了某型直升机的远程诊断专家系统。
This paper studies how to solve AND/OR tree in Artificial Intelligence with Petri Net,and presents a way that first converts a AND/OR tree to the relative Petri Net,and then obtains a solution tree of the original AND/OR tree through its reverse tree,and finally gets the optimal solution tree of AND /OR tree with fuzzy Petri Net inference.
研究了用Petri网求解人工智能中与/或树的问题,提出了一种把与/或树转换成相应的Petri网,并通过其逆网求得原与/或树的解树的方法,可进而利用模糊Petri网的推理得到与/或树的最优解树。