1) graph and tree
"与或"图和"与或"树AND-OR
2) and/or tree
与或树
1.
Research on decomposition and transformation of complex decision problem based on cloud and/or tree;
基于云与或树的复杂决策问题规约研究
2.
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设计具有更好的产品配置柔性。
3) And/Or tree
与/或树
1.
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.
通过基于业务实例的工作流模型分解,将工作流授权合理性问题分解为业务实例、业务实例的并发任务集合、并发任务集合中任务的授权合理性问题,得到工作流授权合理性问题的与/或树表示。
2.
Meantime,research the knowledge representation with causal reasoning iterative and inference engine searching mechanism based on the and/or tree.
同时,研究规则类知识在知识库中的因果迭代表示方法以及基于与/或树的推理机搜索机制,并利用JSP技术实现与知识库相对分离的推理机,建立了某型直升机的远程诊断专家系统。
3.
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网的推理得到与/或树的最优解树。
4) and/or tree
[自]与或树
5) And/or graph
与或图
1.
Improvement of connectivity sieve algorithms for disassembly AND/OR graph;
对拆卸与或图连通性判定算法的改进和研究
2.
By comparing three models of Connection graph, Direct graph and AND/OR graph, the paper points out the merits and shortcomings of each model.
本文通过无向图、有向图和与或图三种以图论为基础的拆卸回收模型的比较,指出了各种模型存在的优缺点,为完善面向拆卸回收的绿色设计结构模型提供依据。
6) AND/OR graph
与/或图
1.
Based on the logic dependent relation and first-order logic,AND/OR graphs of single target with unit agent,and single target with multi-agent,joint targets with multi-agent were gotten respectively.
在分析逻辑依赖关系与一阶谓词表示法基础上,分别给出了单agent单目标、多agent单目标、多agent联合目标的逻辑依赖关系的与/或图表达方法,并应用与/或图的AO*搜索算法,以多agent单目标情形为例,演示多agent系统中逻辑依赖关系的计算过程。
补充资料：气象树——青冈树(图）
 |
青冈树又名青冈栎，因它的叶子会随天气的变化而变化，所以称为“气象树”。
青冈树为亚热带树种，我国南方多见，它对气候条件反应敏感，是因为叶片中所含的叶绿素和花青素的比值变化形成的。在长期干旱之后，即将下雨之前，遇上强光闷热天，叶绿素合成受阻，使花青素在叶片中占优势，叶片逐渐变成红色。
有些地方的农民根据平时对青冈树的观察，得出了经验：当树叶变红时，这个地区在一两天内会下大雨，雨过天晴，树叶又呈深绿色。农民根据这个信息，预报气象，安排农活。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。