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.展开更多
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.展开更多
针对海运货物邮件实体识别中存在识别精度不高、实体边界确定困难的问题,提出一种结合深度学习与规则匹配的识别方法。其中:深度学习方法是在BiLSTM-CRF(Bidirectional Long Short Term Memory-Conditional Random Field)模型的基础上...针对海运货物邮件实体识别中存在识别精度不高、实体边界确定困难的问题,提出一种结合深度学习与规则匹配的识别方法。其中:深度学习方法是在BiLSTM-CRF(Bidirectional Long Short Term Memory-Conditional Random Field)模型的基础上添加词的字符级特征,并融入多头注意力机制以捕获邮件文本中长距离依赖;规则匹配方法则根据领域实体特点制定规则来完成识别。根据货物邮件特点将语料进行标注并划分为:货物名称、货物重量、装卸港口、受载期和佣金五个类别。在自建语料中设置多组对比实验,实验表明所提方法在海运货物邮件实体识别的F1值达到79.3%。展开更多
As the first step of service restoration of distribution system,rapid fault diagnosis is a significant task for reducing power outage time,decreasing outage loss,and subsequently improving service reliability and safe...As the first step of service restoration of distribution system,rapid fault diagnosis is a significant task for reducing power outage time,decreasing outage loss,and subsequently improving service reliability and safety.This paper analyzes a fault diagnosis approach by using rough set theory in which how to reduce decision table of data set is a main calculation intensive task.Aiming at this reduction problem,a heuristic reduction algorithm based on attribution length and frequency is proposed.At the same time,the corresponding value reduction method is proposed in order to fulfill the reduction and diagnosis rules extraction.Meanwhile,a Euclid matching method is introduced to solve confliction problems among the extracted rules when some information is lacking.Principal of the whole algorithm is clear and diagnostic rules distilled from the reduction are concise.Moreover,it needs less calculation towards specific discernibility matrix,and thus avoids the corresponding NP hard problem.The whole process is realized by MATLAB programming.A simulation example shows that the method has a fast calculation speed,and the extracted rules can reflect the characteristic of fault with a concise form.The rule database,formed by different reduction of decision table,can diagnose single fault and multi-faults efficiently,and give satisfied results even when the existed information is incomplete.The proposed method has good error-tolerate capability and the potential for on-line fault diagnosis.展开更多
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.展开更多
For the past three decades, interoperability among heterogeneous systems had been a hard nut to crack due to the schematic and semantic perspectives that exist between objects. These systems were built under different...For the past three decades, interoperability among heterogeneous systems had been a hard nut to crack due to the schematic and semantic perspectives that exist between objects. These systems were built under different data models. As such, levels of the local schemas are semantically very poor due to the limited expressiveness of traditional data models in which they were designed. Further more, most of the existing schema integration architectural components are inadequately equipped to handle the mapping schemas, especially when the semantics and structural conflicts are involved. This paper introduces an Intelligent Binary Schema Matching system (IBSMS), which exploits the phenomenon of making its components intelligent. That’s equipping its components such as translators and integrators with adequate knowledge about various data models. This allows the components acquire enough intelligence to maneuver or manipulate the correspondence between constructs from different models. In addition, the system has a Binary Matcher, which compares the attribute correspondences of various databases in a pairwise form, in order to establish the equivalences. With the establishment of the mappings, the users shall be able to access them (mappings) for their desired usage.展开更多
基金Supported by the National Natural Science Foundation of China (20476007)
文摘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.
基金R & D Infrastructure and Facility Development(No2005DKA64201)the National High Technology Research and De-velopment Program of China (863Program) (No2006AA12Z202)
文摘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.
文摘针对海运货物邮件实体识别中存在识别精度不高、实体边界确定困难的问题,提出一种结合深度学习与规则匹配的识别方法。其中:深度学习方法是在BiLSTM-CRF(Bidirectional Long Short Term Memory-Conditional Random Field)模型的基础上添加词的字符级特征,并融入多头注意力机制以捕获邮件文本中长距离依赖;规则匹配方法则根据领域实体特点制定规则来完成识别。根据货物邮件特点将语料进行标注并划分为:货物名称、货物重量、装卸港口、受载期和佣金五个类别。在自建语料中设置多组对比实验,实验表明所提方法在海运货物邮件实体识别的F1值达到79.3%。
基金Project Supported by National Natural Science Foundation of China (50607023), Natural Science Femdation of CQ CSTC (2006BB2189)
文摘As the first step of service restoration of distribution system,rapid fault diagnosis is a significant task for reducing power outage time,decreasing outage loss,and subsequently improving service reliability and safety.This paper analyzes a fault diagnosis approach by using rough set theory in which how to reduce decision table of data set is a main calculation intensive task.Aiming at this reduction problem,a heuristic reduction algorithm based on attribution length and frequency is proposed.At the same time,the corresponding value reduction method is proposed in order to fulfill the reduction and diagnosis rules extraction.Meanwhile,a Euclid matching method is introduced to solve confliction problems among the extracted rules when some information is lacking.Principal of the whole algorithm is clear and diagnostic rules distilled from the reduction are concise.Moreover,it needs less calculation towards specific discernibility matrix,and thus avoids the corresponding NP hard problem.The whole process is realized by MATLAB programming.A simulation example shows that the method has a fast calculation speed,and the extracted rules can reflect the characteristic of fault with a concise form.The rule database,formed by different reduction of decision table,can diagnose single fault and multi-faults efficiently,and give satisfied results even when the existed information is incomplete.The proposed method has good error-tolerate capability and the potential for on-line fault diagnosis.
基金Project(50474033)supported by the National Natural Science Foundation of China
文摘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.
文摘For the past three decades, interoperability among heterogeneous systems had been a hard nut to crack due to the schematic and semantic perspectives that exist between objects. These systems were built under different data models. As such, levels of the local schemas are semantically very poor due to the limited expressiveness of traditional data models in which they were designed. Further more, most of the existing schema integration architectural components are inadequately equipped to handle the mapping schemas, especially when the semantics and structural conflicts are involved. This paper introduces an Intelligent Binary Schema Matching system (IBSMS), which exploits the phenomenon of making its components intelligent. That’s equipping its components such as translators and integrators with adequate knowledge about various data models. This allows the components acquire enough intelligence to maneuver or manipulate the correspondence between constructs from different models. In addition, the system has a Binary Matcher, which compares the attribute correspondences of various databases in a pairwise form, in order to establish the equivalences. With the establishment of the mappings, the users shall be able to access them (mappings) for their desired usage.