期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Knowledge Graph Construction and Rule Matching Approach for Aerospace Product Manufacturability Assessment
1
作者 Ziyan Liu Zujie Zheng +1 位作者 Lebao Wu Zuhua Jiang 《Journal of Harbin Institute of Technology(New Series)》 2025年第1期1-14,共14页
After the design of aerospace products is completed,a manufacturability assessment needs to be conducted based on 3D model's features in terms of modeling quality and process design,otherwise the cost of design ch... After the design of aerospace products is completed,a manufacturability assessment needs to be conducted based on 3D model's features in terms of modeling quality and process design,otherwise the cost of design changes will increase.Due to the poor structure and low reusability of product manufacturing feature information and assessment knowledge in the current aerospace product manufacturability assessment process,it is difficult to realize automated manufacturability assessment.To address these issues,a domain ontology model is established for aerospace product manufacturability assessment in this paper.On this basis,a structured representation method of manufacturability assessment knowledge and a knowledge graph data layer construction method are proposed.Based on the semantic information and association information expressed by the knowledge graph,a rule matching method based on subgraph matching is proposed to improve the precision and recall.Finally,applications and experiments based on the software platform verify the effectiveness of the proposed knowledge graph construction and rule matching method. 展开更多
关键词 knowledge graph aerospace product manufacturability assessment rule matching
在线阅读 下载PDF
More efficient ontology matching algorithm for integrating heterogeneous web resources 被引量:1
2
作者 刘晨 韩燕波 +1 位作者 陈旺虎 丁维龙 《Journal of Southeast University(English Edition)》 EI CAS 2007年第3期381-384,共4页
To improve the performance of the ontology matching process, a more efficient ontology matching algorithm, which can effectively eliminate unnecessary operations of matching entities, is proposed. By the theoretical a... To improve the performance of the ontology matching process, a more efficient ontology matching algorithm, which can effectively eliminate unnecessary operations of matching entities, is proposed. By the theoretical analysis and proof, a set of matching rules are summarized for depicting inherent relations among matching results of entities. Based on these rules, the proposed algorithm can reuse the matching results of two entities to directly determine the matching results of their adjacent entities. Thereby, redundant operations of matching adjacent entities can be avoided, which can improve the performance of the whole matching process. The experimental results show that, compared with related algorithms, the proposed algorithm has high matching accuracy and can remarkably reduce the consuming time of the whole matching process. So, the proposed algorithm is more competent for the large-scale ontology matching which often occurs in the practical heterogeneous web resources integration project. 展开更多
关键词 ontology matching matching performance matching rule
在线阅读 下载PDF
An efficient embedding tree matching algorithm based on metaphoric dependency syntax tree
3
作者 冯少荣 肖文俊 《Journal of Central South University》 SCIE EI CAS 2009年第2期275-279,共5页
To find out all dependency relationships in which metaphors probably exist between syntax constituents in a given sentence,a dependency tree matching algorithm oriented to Chinese metaphor processing is proposed based... To find out all dependency relationships in which metaphors probably exist between syntax constituents in a given sentence,a dependency tree matching algorithm oriented to Chinese metaphor processing is proposed based on a research of unordered tree inclusion matching.In this algorithm,the pattern library is composed of formalization dependency syntax trees that are derived from large-scale metaphor sentences.These kinds of metaphor sentences are saved in the pattern library in advance.The main process of this algorithm is up-down searching and bottom-up backtracking revising.The algorithm discovers potential metaphoric structures in Chinese sentences from metaphoric dependency pattern library.Finally,the feasibility and efficiency of the new matching algorithm are further testified by the results of a series of experiments on dependency pattern library.Hence,accurate dependency relationships can be achieved through this algorithm. 展开更多
关键词 pattern recognition tree matching algorithm dependency tree rule matching metaphor information processing
在线阅读 下载PDF
Forward heuristic breadth-first reasoning based on rule match for biomass hybrid soft-sensor modeling in fermentation process
4
作者 安莉 王建林 《Journal of Beijing Institute of Technology》 EI CAS 2012年第1期128-133,共6页
Biomass is a key parameter in fermentation process, directly influencing the performance of the fermentation system as well as the quality and yield of the targeted product. Hybrid soft-sensor modeling is a good metho... Biomass is a key parameter in fermentation process, directly influencing the performance of the fermentation system as well as the quality and yield of the targeted product. Hybrid soft-sensor modeling is a good method for on-line estimation of biomass. Structure of hybrid soft-sensor model is a key to improve the estimating accuracy. In this paper, a forward heuristic breadth-first reasoning approach based on rule match is proposed for constructing structure of hybrid model. First, strategy of forward heuristic reasoning about facts is introduced, which can reason complex hybrid model structure in the event of few known facts. Second, rule match degree is defined to obtain higher esti- mating accuracy. The experiment results of Nosiheptide fermentation process show that the hybrid modeling process can estimate biomass with higher accuracy by adding transcendental knowledge and partial mechanism to the process. 展开更多
关键词 fermentation process BIOMASS soft-sensor modeling rule match
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部