Lower back pain is one of the most common medical problems in the world and it is experienced by a huge percentage of people everywhere.Due to its ability to produce a detailed view of the soft tissues,including the s...Lower back pain is one of the most common medical problems in the world and it is experienced by a huge percentage of people everywhere.Due to its ability to produce a detailed view of the soft tissues,including the spinal cord,nerves,intervertebral discs,and vertebrae,Magnetic Resonance Imaging is thought to be the most effective method for imaging the spine.The semantic segmentation of vertebrae plays a major role in the diagnostic process of lumbar diseases.It is difficult to semantically partition the vertebrae in Magnetic Resonance Images from the surrounding variety of tissues,including muscles,ligaments,and intervertebral discs.U-Net is a powerful deep-learning architecture to handle the challenges of medical image analysis tasks and achieves high segmentation accuracy.This work proposes a modified U-Net architecture namely MU-Net,consisting of the Meijering convolutional layer that incorporates the Meijering filter to perform the semantic segmentation of lumbar vertebrae L1 to L5 and sacral vertebra S1.Pseudo-colour mask images were generated and used as ground truth for training the model.The work has been carried out on 1312 images expanded from T1-weighted mid-sagittal MRI images of 515 patients in the Lumbar Spine MRI Dataset publicly available from Mendeley Data.The proposed MU-Net model for the semantic segmentation of the lumbar vertebrae gives better performance with 98.79%of pixel accuracy(PA),98.66%of dice similarity coefficient(DSC),97.36%of Jaccard coefficient,and 92.55%mean Intersection over Union(mean IoU)metrics using the mentioned dataset.展开更多
With the rapid development of the mobile communication and the Internet,the previous web anomaly detectionand identificationmodels were built relying on security experts’empirical knowledge and attack features.Althou...With the rapid development of the mobile communication and the Internet,the previous web anomaly detectionand identificationmodels were built relying on security experts’empirical knowledge and attack features.Althoughthis approach can achieve higher detection performance,it requires huge human labor and resources to maintainthe feature library.In contrast,semantic feature engineering can dynamically discover new semantic featuresand optimize feature selection by automatically analyzing the semantic information contained in the data itself,thus reducing dependence on prior knowledge.However,current semantic features still have the problem ofsemantic expression singularity,as they are extracted from a single semantic mode such as word segmentation,character segmentation,or arbitrary semantic feature extraction.This paper extracts features of web requestsfrom dual semantic granularity,and proposes a semantic feature fusion method to solve the above problems.Themethod first preprocesses web requests,and extracts word-level and character-level semantic features of URLs viaconvolutional neural network(CNN),respectively.By constructing three loss functions to reduce losses betweenfeatures,labels and categories.Experiments on the HTTP CSIC 2010,Malicious URLs and HttpParams datasetsverify the proposedmethod.Results show that compared withmachine learning,deep learningmethods and BERTmodel,the proposed method has better detection performance.And it achieved the best detection rate of 99.16%in the dataset HttpParams.展开更多
To enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called the fuzzy description logics with comparison expressi...To enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called the fuzzy description logics with comparison expressions (FCDLs) is presented. The syntax and semantics of FCDLs are formally defined, and the forms of axioms and assertions in FCDLs knowledge bases are specified. FCDLs combine both fuzzy concepts from the fuzzy description logics (FDLs) and cut concepts from the extended fuzzy description logics (EFDLs) in the same theory. Furthermore, cut concepts are extended into comparison cut concepts in FCDLs to represent comparison expressions between fuzzy membership degrees, which are often used in practice but not supported by the other fuzzy extensions of description logics. FCDLs have more expressive power than FDLs and EFDLs, and are able to represent expressive fuzzy knowledge and to perform reasoning tasks based on them. Therefore, FCDLs can enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web.展开更多
An ontology and metadata for online learning resource repository management is constructed. First, based on the analysis of the use-case diagram, the upper ontology is illustrated which includes resource library ontol...An ontology and metadata for online learning resource repository management is constructed. First, based on the analysis of the use-case diagram, the upper ontology is illustrated which includes resource library ontology and user ontology, and evaluated from its function and implementation; then the corresponding class diagram, resource description framework (RDF) schema and extensible markup language (XML) schema are given. Secondly, the metadata for online learning resource repository management is proposed based on the Dublin Core Metadata Initiative and the IEEE Learning Technologies Standards Committee Learning Object Metadata Working Group. Finally, the inference instance is shown, which proves the validity of ontology and metadata in online learning resource repository management.展开更多
In order to solve the problem of information retrieval on the semantic web, a new semantic information retrieval (SIR) model for searching ontologies on the semantic web is proposed. First, SIR transformed domain on...In order to solve the problem of information retrieval on the semantic web, a new semantic information retrieval (SIR) model for searching ontologies on the semantic web is proposed. First, SIR transformed domain ontologies into global ontologies. Then semantic index terms were extracted from these global ontologies. Based on semantic index terms, logical inferences can be performed and the logical views of the concept can be obtained. These logical views represent the expanded meaning of the concept. Using logical views, SIR can perform the information retrieval and inferences based on the semantic relationships in the documents, not only on the syntactic analysis of the documents. SIR can significantly enhance the recall and precision of the information retrieval by the semantic inference. Finally, the practicability of the SIR model is analyzed.展开更多
In order to solve the problem that the current matchmaking methods for semantic web service mainly focus on the matchmaking of IO (inputs, outputs) descriptions which may result in one-sidedness, a description-logic...In order to solve the problem that the current matchmaking methods for semantic web service mainly focus on the matchmaking of IO (inputs, outputs) descriptions which may result in one-sidedness, a description-logic-based IOPE (inputs, outputs, preconditions, effects) description and matchmaking method is proposed for semantic web service. The description logic concept is used to annotate service IO and the description logic assertion is employed to describe service PE(preconditions, effects). TBox subsumption checking is used to measure the subsumption relationship between IO descriptions of service request and advertising; ABox consistency checking is used for checking the logical implication between PE descriptions of service request and advertising. Based upon the logical implication, four kinds of PE matching degrees are proposed to measure and compare the pros and cons of the results of matchmaking. They are the exact, perfect, side-effect and common match. Experiments show that the method has a higher precision rate under the same recall rate compared with the existing method.展开更多
In order to improve the effectiveness of semantic web service discovery, the semantic bias between an interface parameter and an annotation is reduced by extracting semantic restrictions for the annotation from the de...In order to improve the effectiveness of semantic web service discovery, the semantic bias between an interface parameter and an annotation is reduced by extracting semantic restrictions for the annotation from the description context and generating refined semantic annotations, and then the semantics of the web service is refined. These restrictions are dynamically extracted from the parsing tree of the description text, with the guide of the restriction template extracted from the ontology definition. New semantic annotations are then generated by combining the original concept with the restrictions and represented via refined concept expressions. In addition, a novel semantic similarity measure for refined concept expressions is proposed for semantic web service discovery. Experimental results show that the matchmaker based on this method can improve the average precision of discovery and exhibit low computational complexity. Reducing the semantic bias by utilizing restriction information of annotations can refine the semantics of the web service and improve the discovery effectiveness.展开更多
To promote the efficiency of knowledge base retrieval based on description logic, the concept of assertional graph (AG), which is directed labeled graph, is defined and a new AG-based retrieval method is put forward...To promote the efficiency of knowledge base retrieval based on description logic, the concept of assertional graph (AG), which is directed labeled graph, is defined and a new AG-based retrieval method is put forward. This method converts the knowledge base and query clause into knowledge AG and query AG by making use of the given rules and then makes use of graph traversal to carry out knowledge base retrieval. The experiment indicates that the efficiency of this method exceeds, respectively, the popular RACER and KAON2 system by 0.4% and 3.3%. This method can obviously promote the efficiency of knowledge base retrieval.展开更多
In order to solve the problem of modeling product configuration knowledge at the semantic level to successfully implement the mass customization strategy, an approach of ontology-based configuration knowledge modeling...In order to solve the problem of modeling product configuration knowledge at the semantic level to successfully implement the mass customization strategy, an approach of ontology-based configuration knowledge modeling, combining semantic web technologies, was proposed. A general configuration ontology was developed to provide a common concept structure for modeling configuration knowledge and rules of specific product domains. The OWL web ontology language and semantic web rule language (SWRL) were used to formally represent the configuration ontology, domain configuration knowledge and rules to enhance the consistency, maintainability and reusability of all the configuration knowledge. The configuration knowledge modeling of a customizable personal computer family shows that the approach can provide explicit, computerunderstandable knowledge semantics for specific product configuration domains and can efficiently support automatic configuration tasks of complex products.展开更多
Due to the fact that the existing web service description methods cannot address the issue of service reuse of various levels of granularity, the concept of service component is introduced, which packages together web...Due to the fact that the existing web service description methods cannot address the issue of service reuse of various levels of granularity, the concept of service component is introduced, which packages together web services and choreography, and their operations and properties are presented in a consistent and uniform manner. Service components are published externally as normal web services and can thus be employed by webbased applications. In order to improve reusability and testability of service components, the concept of composition pattern is also proposed, which presents the relationships among service components. The relationships and relationship compositions have a rigorous semantic, so that composite components can be validated at the configuration stage. The composition patterns support to integrate service components of various levels of granularity. Experience indicates that the application assembly can effectively be conducted by understanding, selecting, and reusing components easily.展开更多
This paper tries to discuss one realizable mode of SW(Semantic Web). It is called NVS(Network-Virtual Society). SW is regarded as the next-generation Web. By adding semantics into Web,SW provides interoperability betw...This paper tries to discuss one realizable mode of SW(Semantic Web). It is called NVS(Network-Virtual Society). SW is regarded as the next-generation Web. By adding semantics into Web,SW provides interoperability between applications and facilities to enable automated processing of Web resources. Agent will be the executer in the automated process. After analyzing relational theories and technologies, we put forward the concept and mode of NVS,and gives our reason.展开更多
In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and fun...In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects. Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition (TWC) graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement realtime updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.展开更多
Services discovery based on syntactic matching cannot adapt to the open and dynamic environment of the web. To select the proper one from the web services candidate set provided by syntactic matching, a service select...Services discovery based on syntactic matching cannot adapt to the open and dynamic environment of the web. To select the proper one from the web services candidate set provided by syntactic matching, a service selection method based on semantic similarity is proposed. First, this method defines a web services ontology including QoS and context as semantic supporting, which also provides a set of terms to describe the interfaces of web services. Secondly, the similarity degree of two web services is evaluated by computing the semantic distances of those terms used to describe interfaces. Compared with existing methods, interfaces of web services can be interpreted under ontology, because it provides a formal and semantic specification of conceptualization. Meanwhile, efficiency and accuracy of services selection are improved.展开更多
Web 发展造成了“信息爆炸”和“知识贫乏”的矛盾,基于 XML 和 RDF 发展的语义网是解决这一问题的关键。变“机器可读”为“机器可理解”是语义网的目标,信息服务可以应用语义网的模式和成果,提高搜索的准确率,提供高相关度的个性化服...Web 发展造成了“信息爆炸”和“知识贫乏”的矛盾,基于 XML 和 RDF 发展的语义网是解决这一问题的关键。变“机器可读”为“机器可理解”是语义网的目标,信息服务可以应用语义网的模式和成果,提高搜索的准确率,提供高相关度的个性化服务,构建全新的数字图书馆门户。展开更多
To solve the bottleneck problem in centralized service discovery methods,a novel architecture based on domain ontology for semantic service discovery is proposed.This distributed architecture can adjust the domain par...To solve the bottleneck problem in centralized service discovery methods,a novel architecture based on domain ontology for semantic service discovery is proposed.This distributed architecture can adjust the domain partition and allocate system resources automatically.The characteristics of this mechanism are analyzed,including scalability,self-organization and adaptability.In this mechanism,semantic web service discovery is separated into two parts.First,under balance tree topology,registry proxy can rapidly forward requests to the objective registry center,and avoid the bottleneck problem.Secondly,a semantic distance based service matching algorithm is proposed to promote the effect of service searching.The results of simulation experiments show that the proposed mechanism can serve as a scalable solution for semantic web service publication and discovery.And the improved matching algorithm has higher recall and precision than other algorithms.展开更多
To deal with a lack of semantic interoperability of traditional knowledge retrieval approaches, a semantic-based networked manufacturing (NM) knowledge retrieval architecture is proposed, which offers a series of to...To deal with a lack of semantic interoperability of traditional knowledge retrieval approaches, a semantic-based networked manufacturing (NM) knowledge retrieval architecture is proposed, which offers a series of tools for supporting the sharing of knowledge and promoting NM collaboration. A 5-tuple based semantic information retrieval model is proposed, which includes the interoperation on the semantic layer, and a test process is given for this model. The recall ratio and the precision ratio of manufacturing knowledge retrieval are proved to be greatly improved by evaluation. Thus, a practical and reliable approach based on the semantic web is provided for solving the correlated concrete problems in regional networked manufacturing.展开更多
A global semantics matching and QoS-awareness service selection are proposed when aimed at a web services composition process.Both QoS-aware matching and global semantic matching are considered during the global match...A global semantics matching and QoS-awareness service selection are proposed when aimed at a web services composition process.Both QoS-aware matching and global semantic matching are considered during the global matching.When there are demands for global semantic matching and QoS of service composition,a concrete service set which meets the demands is selected for the whole service composition process and an optimal solution is also achieved.A QoS model is built and the corresponding evaluation method is given for the matching of the service composition process.Based on them,a genetic algorithm is proposed to achieve the maximal global semantic matching degree and fulfill the QoS requirements for the whole service composition process.Experimental results and analysis show that the algorithm is feasible and effective for semantics and QoS-aware service matching.展开更多
文摘Lower back pain is one of the most common medical problems in the world and it is experienced by a huge percentage of people everywhere.Due to its ability to produce a detailed view of the soft tissues,including the spinal cord,nerves,intervertebral discs,and vertebrae,Magnetic Resonance Imaging is thought to be the most effective method for imaging the spine.The semantic segmentation of vertebrae plays a major role in the diagnostic process of lumbar diseases.It is difficult to semantically partition the vertebrae in Magnetic Resonance Images from the surrounding variety of tissues,including muscles,ligaments,and intervertebral discs.U-Net is a powerful deep-learning architecture to handle the challenges of medical image analysis tasks and achieves high segmentation accuracy.This work proposes a modified U-Net architecture namely MU-Net,consisting of the Meijering convolutional layer that incorporates the Meijering filter to perform the semantic segmentation of lumbar vertebrae L1 to L5 and sacral vertebra S1.Pseudo-colour mask images were generated and used as ground truth for training the model.The work has been carried out on 1312 images expanded from T1-weighted mid-sagittal MRI images of 515 patients in the Lumbar Spine MRI Dataset publicly available from Mendeley Data.The proposed MU-Net model for the semantic segmentation of the lumbar vertebrae gives better performance with 98.79%of pixel accuracy(PA),98.66%of dice similarity coefficient(DSC),97.36%of Jaccard coefficient,and 92.55%mean Intersection over Union(mean IoU)metrics using the mentioned dataset.
基金a grant from the National Natural Science Foundation of China(Nos.11905239,12005248 and 12105303).
文摘With the rapid development of the mobile communication and the Internet,the previous web anomaly detectionand identificationmodels were built relying on security experts’empirical knowledge and attack features.Althoughthis approach can achieve higher detection performance,it requires huge human labor and resources to maintainthe feature library.In contrast,semantic feature engineering can dynamically discover new semantic featuresand optimize feature selection by automatically analyzing the semantic information contained in the data itself,thus reducing dependence on prior knowledge.However,current semantic features still have the problem ofsemantic expression singularity,as they are extracted from a single semantic mode such as word segmentation,character segmentation,or arbitrary semantic feature extraction.This paper extracts features of web requestsfrom dual semantic granularity,and proposes a semantic feature fusion method to solve the above problems.Themethod first preprocesses web requests,and extracts word-level and character-level semantic features of URLs viaconvolutional neural network(CNN),respectively.By constructing three loss functions to reduce losses betweenfeatures,labels and categories.Experiments on the HTTP CSIC 2010,Malicious URLs and HttpParams datasetsverify the proposedmethod.Results show that compared withmachine learning,deep learningmethods and BERTmodel,the proposed method has better detection performance.And it achieved the best detection rate of 99.16%in the dataset HttpParams.
基金The National Natural Science Foundation of China(No.60373066,60425206,90412003),the National Basic Research Pro-gram of China (973Program)(No.2002CB312000),the Innovation Plan for Jiangsu High School Graduate Student, the High TechnologyResearch Project of Jiangsu Province (No.BG2005032), and the Weap-onry Equipment Foundation of PLA Equipment Ministry ( No.51406020105JB8103).
文摘To enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called the fuzzy description logics with comparison expressions (FCDLs) is presented. The syntax and semantics of FCDLs are formally defined, and the forms of axioms and assertions in FCDLs knowledge bases are specified. FCDLs combine both fuzzy concepts from the fuzzy description logics (FDLs) and cut concepts from the extended fuzzy description logics (EFDLs) in the same theory. Furthermore, cut concepts are extended into comparison cut concepts in FCDLs to represent comparison expressions between fuzzy membership degrees, which are often used in practice but not supported by the other fuzzy extensions of description logics. FCDLs have more expressive power than FDLs and EFDLs, and are able to represent expressive fuzzy knowledge and to perform reasoning tasks based on them. Therefore, FCDLs can enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web.
基金The Advanced University Action Plan of the Minis-try of Education of China (2004XD-03).
文摘An ontology and metadata for online learning resource repository management is constructed. First, based on the analysis of the use-case diagram, the upper ontology is illustrated which includes resource library ontology and user ontology, and evaluated from its function and implementation; then the corresponding class diagram, resource description framework (RDF) schema and extensible markup language (XML) schema are given. Secondly, the metadata for online learning resource repository management is proposed based on the Dublin Core Metadata Initiative and the IEEE Learning Technologies Standards Committee Learning Object Metadata Working Group. Finally, the inference instance is shown, which proves the validity of ontology and metadata in online learning resource repository management.
基金The National Natural Science Foundation of China (No.60273072),the National High Technology Research and Development Program of China (863Program)(No.2002AA423450).
文摘In order to solve the problem of information retrieval on the semantic web, a new semantic information retrieval (SIR) model for searching ontologies on the semantic web is proposed. First, SIR transformed domain ontologies into global ontologies. Then semantic index terms were extracted from these global ontologies. Based on semantic index terms, logical inferences can be performed and the logical views of the concept can be obtained. These logical views represent the expanded meaning of the concept. Using logical views, SIR can perform the information retrieval and inferences based on the semantic relationships in the documents, not only on the syntactic analysis of the documents. SIR can significantly enhance the recall and precision of the information retrieval by the semantic inference. Finally, the practicability of the SIR model is analyzed.
文摘In order to solve the problem that the current matchmaking methods for semantic web service mainly focus on the matchmaking of IO (inputs, outputs) descriptions which may result in one-sidedness, a description-logic-based IOPE (inputs, outputs, preconditions, effects) description and matchmaking method is proposed for semantic web service. The description logic concept is used to annotate service IO and the description logic assertion is employed to describe service PE(preconditions, effects). TBox subsumption checking is used to measure the subsumption relationship between IO descriptions of service request and advertising; ABox consistency checking is used for checking the logical implication between PE descriptions of service request and advertising. Based upon the logical implication, four kinds of PE matching degrees are proposed to measure and compare the pros and cons of the results of matchmaking. They are the exact, perfect, side-effect and common match. Experiments show that the method has a higher precision rate under the same recall rate compared with the existing method.
基金The National Basic Research Program of China (973Program)(No.2005CB321802)Program for New Century Excellent Talents in University (No. NCET-06-0926)the National Natural Science Foundation of China (No.60403050,90612009)
文摘In order to improve the effectiveness of semantic web service discovery, the semantic bias between an interface parameter and an annotation is reduced by extracting semantic restrictions for the annotation from the description context and generating refined semantic annotations, and then the semantics of the web service is refined. These restrictions are dynamically extracted from the parsing tree of the description text, with the guide of the restriction template extracted from the ontology definition. New semantic annotations are then generated by combining the original concept with the restrictions and represented via refined concept expressions. In addition, a novel semantic similarity measure for refined concept expressions is proposed for semantic web service discovery. Experimental results show that the matchmaker based on this method can improve the average precision of discovery and exhibit low computational complexity. Reducing the semantic bias by utilizing restriction information of annotations can refine the semantics of the web service and improve the discovery effectiveness.
基金The National Natural Science Foundation of China(No.69975010,60374054),the National Research Foundation for the Doctoral Program of Higher Education of China (No.20050007023).
文摘To promote the efficiency of knowledge base retrieval based on description logic, the concept of assertional graph (AG), which is directed labeled graph, is defined and a new AG-based retrieval method is put forward. This method converts the knowledge base and query clause into knowledge AG and query AG by making use of the given rules and then makes use of graph traversal to carry out knowledge base retrieval. The experiment indicates that the efficiency of this method exceeds, respectively, the popular RACER and KAON2 system by 0.4% and 3.3%. This method can obviously promote the efficiency of knowledge base retrieval.
基金The National Natural Science Foundation of China(No.70471023).
文摘In order to solve the problem of modeling product configuration knowledge at the semantic level to successfully implement the mass customization strategy, an approach of ontology-based configuration knowledge modeling, combining semantic web technologies, was proposed. A general configuration ontology was developed to provide a common concept structure for modeling configuration knowledge and rules of specific product domains. The OWL web ontology language and semantic web rule language (SWRL) were used to formally represent the configuration ontology, domain configuration knowledge and rules to enhance the consistency, maintainability and reusability of all the configuration knowledge. The configuration knowledge modeling of a customizable personal computer family shows that the approach can provide explicit, computerunderstandable knowledge semantics for specific product configuration domains and can efficiently support automatic configuration tasks of complex products.
基金The National Basic Research Program of China (973Program) (No.1999032710).
文摘Due to the fact that the existing web service description methods cannot address the issue of service reuse of various levels of granularity, the concept of service component is introduced, which packages together web services and choreography, and their operations and properties are presented in a consistent and uniform manner. Service components are published externally as normal web services and can thus be employed by webbased applications. In order to improve reusability and testability of service components, the concept of composition pattern is also proposed, which presents the relationships among service components. The relationships and relationship compositions have a rigorous semantic, so that composite components can be validated at the configuration stage. The composition patterns support to integrate service components of various levels of granularity. Experience indicates that the application assembly can effectively be conducted by understanding, selecting, and reusing components easily.
文摘This paper tries to discuss one realizable mode of SW(Semantic Web). It is called NVS(Network-Virtual Society). SW is regarded as the next-generation Web. By adding semantics into Web,SW provides interoperability between applications and facilities to enable automated processing of Web resources. Agent will be the executer in the automated process. After analyzing relational theories and technologies, we put forward the concept and mode of NVS,and gives our reason.
基金The National Key Technology R&D Program of Chinaduring the 11th Five-Year Plan Period(No2007BAF23B0302)the Major Research Plan of the National Natural Science Foundation of China(No90818028)
文摘In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects. Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition (TWC) graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement realtime updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.
基金The National Natural Science Foundation of China(No.70471090,70472005),the Natural Science Foundation of Jiangsu Province(No.BK2004052,BK2005046).
文摘Services discovery based on syntactic matching cannot adapt to the open and dynamic environment of the web. To select the proper one from the web services candidate set provided by syntactic matching, a service selection method based on semantic similarity is proposed. First, this method defines a web services ontology including QoS and context as semantic supporting, which also provides a set of terms to describe the interfaces of web services. Secondly, the similarity degree of two web services is evaluated by computing the semantic distances of those terms used to describe interfaces. Compared with existing methods, interfaces of web services can be interpreted under ontology, because it provides a formal and semantic specification of conceptualization. Meanwhile, efficiency and accuracy of services selection are improved.
基金The National Basic Research Program of China(973 Program)(No.2010CB328104,2009CB320501)the National Natural Science Foundation of China(No.61070161,61070158,61003257, 61003311)+2 种基金the National Key Technology R&D Program during the 11th Five-Year Plan Period(No.2010BAI88B03)the Foundation of Jiangsu Provincial Key Laboratory of Netw ork and Information Security (No.BM2003201)Open Research Fund from Key Laboratory of Computer Netw ork and Information Integration of Ministry of Education (Southeast University)
文摘To solve the bottleneck problem in centralized service discovery methods,a novel architecture based on domain ontology for semantic service discovery is proposed.This distributed architecture can adjust the domain partition and allocate system resources automatically.The characteristics of this mechanism are analyzed,including scalability,self-organization and adaptability.In this mechanism,semantic web service discovery is separated into two parts.First,under balance tree topology,registry proxy can rapidly forward requests to the objective registry center,and avoid the bottleneck problem.Secondly,a semantic distance based service matching algorithm is proposed to promote the effect of service searching.The results of simulation experiments show that the proposed mechanism can serve as a scalable solution for semantic web service publication and discovery.And the improved matching algorithm has higher recall and precision than other algorithms.
基金The National High Technology Research and Devel-opment Program of China (863Program) (No2003AA1Z2560,2002AA414060)the Key Science and Technology Program of Shaanxi Province (No2006K04-G10)
文摘To deal with a lack of semantic interoperability of traditional knowledge retrieval approaches, a semantic-based networked manufacturing (NM) knowledge retrieval architecture is proposed, which offers a series of tools for supporting the sharing of knowledge and promoting NM collaboration. A 5-tuple based semantic information retrieval model is proposed, which includes the interoperation on the semantic layer, and a test process is given for this model. The recall ratio and the precision ratio of manufacturing knowledge retrieval are proved to be greatly improved by evaluation. Thus, a practical and reliable approach based on the semantic web is provided for solving the correlated concrete problems in regional networked manufacturing.
基金Specialized Research Fund for the Doctoral Program of Higher Education(No.20050288015)Innovation Funds of Nanjing University of Science and Technology
文摘A global semantics matching and QoS-awareness service selection are proposed when aimed at a web services composition process.Both QoS-aware matching and global semantic matching are considered during the global matching.When there are demands for global semantic matching and QoS of service composition,a concrete service set which meets the demands is selected for the whole service composition process and an optimal solution is also achieved.A QoS model is built and the corresponding evaluation method is given for the matching of the service composition process.Based on them,a genetic algorithm is proposed to achieve the maximal global semantic matching degree and fulfill the QoS requirements for the whole service composition process.Experimental results and analysis show that the algorithm is feasible and effective for semantics and QoS-aware service matching.