Since using environments that are made according to the service oriented architecture, we have more effective and dynamic applications. Semantic matchmaking process is finding valuable service candidates for substitution. It is a very important aspect of using semantic Web Services. Our proposed matchmaker algorithm performs semantic matching of Web Services on the basis of input and output descriptions of semantic Web Services matching. This technique takes advantages from a graph structure and flow networks. Our novel approach is assigning matchmaking scores to semantics of the inputs and outputs parameters and their types. It makes a flow network in which the weights of the edges are these scores, using FordFulkerson algorithm, we find matching rate of two web services. So, all services should be described in the same Ontology Web Language. Among these candidates, best one is chosen for substitution in the case of an execution failure. Our approach uses the algorithm that has the least running time among all others that can be used for bipartite matching. The importance of problem is that in real systems, many fundamental problems will occur by late answering. So system`s service should always be on and if one of them crashes, it would be replaced fast. Semantic web matchmaker eases this process.
翻译：使用以服务为导向的结构环境后,我们拥有更有效的动态应用程序。 语义匹配程序正在寻找有价值的服务候选人替换。 这是使用语义网络服务的一个非常重要的方面 。 我们推荐的配配方算法在输入和输出描述语义网络服务匹配的基础上对网络服务进行语义匹配。 这一技术从图表结构和流程网络中获得了优势。 我们的新做法是将匹配评分分配给输入和输出参数及其类型的语义。 它是一个流动网络, 边端的权重就是这些评分, 使用 FordFulkerson 算法, 我们找到两个网络服务的匹配率。 因此, 所有服务都应该用相同的语义网络语言描述 。 在这些候选人中, 最好的一种是在执行失败的情况下被选择替换 。 我们的方法是使用在其它所有可以用于双方匹配的时间中运行最少的算法。 问题的重要性在于, 在现实系统中, 有许多基本的问题会发生于迟报。 因此, 系统的服务应该总是在运行上, 并且如果它们中的某个崩溃过程会很快被替换 。 Seman 。
相关内容
微信扫码咨询专知VIP会员