skip to main content
Guest
My Research
My Account
Sign out
Sign in
This feature requires javascript
Library Search
Find Databases
Browse Search
E-Journals A-Z
E-Books A-Z
Citation Linker
Help
Language:
English
Vietnamese
This feature required javascript
This feature requires javascript
Primo Search
All Library Resources
All
Course Materials
Course Materials
Search For:
Clear Search Box
Search in:
All Library Resources
Or hit Enter to replace search target
Or select another collection:
Search in:
All Library Resources
Search in:
Print Resources
Search in:
Digital Resources
Search in:
Online E-Resources
Advanced Search
Browse Search
This feature requires javascript
Search Limited to:
Search Limited to:
Resource type
criteria input
All items
Books
Articles
Images
Audio Visual
Maps
Graduate theses
Show Results with:
criteria input
that contain my query words
with my exact phrase
starts with
Show Results with:
Search type Index
criteria input
anywhere in the record
in the title
as author/creator
in subject
Full Text
ISBN
ISSN
TOC
Keyword
Field
Show Results with:
in the title
Show Results with:
anywhere in the record
in the title
as author/creator
in subject
Full Text
ISBN
ISSN
TOC
Keyword
Field
This feature requires javascript
An ontology tree coding method based on the equal-length of the same parent and child nodes counting
Digital Resources/Online E-Resources
Citations
Cited by
View Online
Details
Recommendations
Reviews
Times Cited
External Links
This feature requires javascript
Actions
Add to My Research
Remove from My Research
E-mail
Print
Permalink
Citation
EasyBib
EndNote
RefWorks
Delicious
Export RIS
Export BibTeX
This feature requires javascript
Title:
An ontology tree coding method based on the equal-length of the same parent and child nodes counting
Author:
XU JIUYUN
;
LIU JIE
;
ZHANG CHAO
;
SUN ZHONGSHUN
Description:
The invention belongs to the field of WEB service discovery, in particular to an ontology tree coding method based on the equal length of the same parent and child nodes. The method can be divided into three steps: A. describing and analyzing the concept of ontology for topological sorting; B. carrying out binary coding on the ontology tree of the same length as the parent and the child node countaccording to the topological sorting sequence; C. conceptual preservation of the corresponding encoding. The invention provides an ontology tree coding method based on the equal bit length of the same parent and child nodes, so as to overcome the inefficiency of the semantic-based Web service discovery method. 本发明属于WEB服务发现领域,具体是种基于同父子节点计数的等位长的本体树编码方法。主要分为三个步骤:A.描述并解析本体的概念进行拓扑排序;B.针对拓扑排序序列进行同父子节点计数的等位长的本体树二进制编码;C.编码与之对应的概念保存。本发明提供种基于同父子节点计数的等位长的本体树编码方法,以克服基于语义的Web服务发现方法在效率方面不高。
Creation Date:
2018
Language:
Chinese;English
Source:
esp@cenet
This feature requires javascript
This feature requires javascript
Back to results list
This feature requires javascript
This feature requires javascript
Searching Remote Databases, Please Wait
Searching for
in
scope:(TDTS),scope:(SFX),scope:(TDT),scope:(SEN),primo_central_multiple_fe
Show me what you have so far
This feature requires javascript
This feature requires javascript