CN114500636A - Scientific and technological resource service discovery method and device based on graph - Google Patents
Scientific and technological resource service discovery method and device based on graph Download PDFInfo
- Publication number
- CN114500636A CN114500636A CN202210061678.5A CN202210061678A CN114500636A CN 114500636 A CN114500636 A CN 114500636A CN 202210061678 A CN202210061678 A CN 202210061678A CN 114500636 A CN114500636 A CN 114500636A
- Authority
- CN
- China
- Prior art keywords
- service
- parameter
- node
- parameter set
- scientific
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a scientific and technological resource service discovery method and device based on a graph, and relates to the technical fields of Web service discovery, scientific and technological resources, graphs and the like.
Description
Technical Field
The invention relates to the technical field of Web service discovery, scientific and technological resources, graphs and the like, in particular to a scientific and technological resource service discovery method and device based on graphs.
Background
Scientific resources are the general term for the human, material, financial, organization, management, information, and other software and hardware elements engaged in scientific activities, or emphasizes the collection of some elements. It provides material guarantee for scientific and technological activities, basic condition guarantee for scientific and technological management, decision making and scientific research, and is an important strategic resource of the country.
The Web service is a service-oriented architecture technology, provides services through a standard Web protocol, and aims to ensure that application services of different platforms can interoperate. According to the definition of W3C, a Web service (Web service) should be a software system to support the interactive operation of different machines between networks. Web services are typically composed of a number of Application Program Interfaces (APIs) that execute requests for services submitted by clients through a remote server over a network, such as the Internet (Internet).
Service discovery (Service discovery) is the automatic detection of devices and services provided by devices within a computer network. Service discovery protocol (service discovery protocol) helps to discover a network transport protocol of a service. The purpose of service discovery is to offload for user self-configuration.
The scientific and technological resource service has the characteristics of distribution, cross-domain, isomerism and the like, particularly the distributed attribute, is an obvious characteristic in the big data era, avoids single-point faults, accelerates the response speed and improves the throughput. With the development of computer technology, the number of Web services on the Internet is rapidly increased, and the description language adopted by the Web services is an XML language, so that the Web services have the advantages of cross-platform, cross-language, low coupling and the like. Web services, a specific implementation of a Service Oriented Architecture (SOA), have basic roles of service provider and service requester. As it becomes more difficult for a service requester to obtain a required service from a large number of Web services, how to quickly and accurately find a service satisfying a user request is a key problem to be solved for Web service discovery.
Service discovery methods are broadly divided into two categories: (1) grammar-based service discovery and semantic-based service discovery. And (4) adopting a matching algorithm to carry out matching calculation on the services of the registration center one by one in grammar-based service discovery, and selecting the best service. The method is simple and easy to realize, and has the defects that the process of matching one by one is time-consuming and low in efficiency, and meanwhile, the recall ratio and the precision ratio are low, so that the method cannot cope with the current situation of explosive growth of Web services, cannot solve the problems of word ambiguity of texts and the like; (2) the Web service discovery method based on semantics has great disadvantages, an ontology base needs to be constructed by resource experts mastering domain knowledge, corresponding ontologies need to be established in each domain, the consumption of manpower and material resources is high, and public cognitive standards are lacked.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides a scientific and technological resource service discovery method and device based on a graph aiming at the distributed characteristic of the scientific and technological resource service, and the efficiency of Web service discovery can be improved.
The technical scheme adopted by the invention is as follows:
a scientific and technological resource service discovery method based on a graph comprises the following steps:
creating each piece of service information of scientific and technological resource service into a service node, creating a parameter node aiming at each parameter in an input parameter set and an output parameter set in the service node, and connecting the parameter node with the service node;
comparing whether the input parameter set and the output parameter set of each two service nodes have intersection, and if so, creating a directed edge between the two service nodes; the parameter nodes, the service nodes and the directed edges form graph data;
according to an initial parameter set and a target parameter set of a service request, an initial state node and a target state node in graph data, calculating the distance d (w) from the service node of each service w which can be called by the current state to the initial state node, and according to the distance d (w), calculating the distance from the parameter node of each output parameter p in the output parameter set of the service to the initial state node
When it is satisfied with
When it is, then update
Wherein eta (w) is science and technologyThe cost of calls between resource services;
obtaining prefix service preWS (p) of each output parameter p of each service w when meeting
If yes, the service w is marked as prefix service prews (p) of parameter p, that is, prews (p) ═ w; prefix service w of parameter p means that p is one of the output parameters of service w, i.e. p ∈ wo；
After the service w is called, the output parameter set of the service w is added into the current state of the service, the currently called service is merged into the called service set, and a service discovery set is generated until the current state contains the target parameter set of the service request.
Further, when creating the directed edge, marking according to whether the input parameter set and the output parameter set of the two service nodes are completely matched.
Further, the air conditioner is provided with a fan,
the calculation formula of (a) is as follows:
wherein ow (p) is a service set capable of outputting parameter p, for
All have p ∈ wo，woIs a set of output parameters; p 'is an output parameter, and p' is equal to wi，wiIs an input parameter set.
Further, the air conditioner is provided with a fan,
rian initial set of parameters for the service request.
Further, when prefix service is acquired, setting an input parameter set in a current state as a requested initial parameter set, and setting a service set which is accessed currently as an empty set; if the current state does not contain the target parameter set of the service request, searching the service; in each round of search process, a service set which can be called in the current state is calculated, and a prefix service preWS (p) of an output parameter p is recorded or updated in the calculation process.
A scientific and technological resource service discovery device based on a graph comprises a memory and a processor, wherein a computer program is stored in the memory, and the processor realizes the steps of the method when executing the program.
A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the above-mentioned method.
Compared with the prior art, the invention has the beneficial effects that:
1. according to the method, scientific and technological resource services are converted into the graph, and the single Web services are organically associated, so that the Web service discovery problem is converted into the directed graph shortest path problem in the graph theory, and a heuristic algorithm is applied to solve the target service set, so that the Web service discovery is realized. The experimental result shows that compared with the traditional service discovery method, the method saves a large amount of manpower and material cost, and improves the efficiency and the accuracy of service discovery.
2. The invention can improve the response speed of the Web service and improve the satisfaction degree of the user. Most of the non-functional attributes (QoS) used in service discovery in the past are attributes such as price and reputation. The invention aims at the characteristics of scientific and technological resource services, uses a new QoS attribute-distributed attribute, thereby realizing the rapid screening of Web services with the optimal quality of service QoS in Web services with similar functional attributes, and effectively improving the problems of long response time, low throughput and the like existing in the past service discovery.
3. The invention considers that the application of the scientific and technological resource service is increasingly wide, and meanwhile, the scientific and technological resource service has the remarkable characteristics of cross-domain, isomerism, distribution and the like. The invention stores the Web service of the type by means of the graph structure, the addition and deletion of the service are only related to adjacent nodes, and the characteristic of local update ensures that the scientific and technological resource service discovery method based on the graph is more flexible, efficient and easy to expand compared with other methods.
Drawings
FIG. 1 is a diagram-based scientific and technological resource service discovery process framework;
FIG. 2 is a process for constructing graph nodes;
FIG. 3 is a flow of creating a directed edge;
FIG. 4 is an execution flow of the shortest path method to find a target service set;
fig. 5 is a service relationship diagram of scientific and technological resource services.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
The scientific and technological resource service method based on the graph provided by the invention establishes scientific and technological resource services as graph nodes, establishes the relationship between the scientific and technological resource services as edges, takes the calling cost between the scientific and technological resource services as the QoS attribute of the service, takes the cost value as the weight of the edges, realizes the shortest path search of the directed graph based on the QoS attribute of the service in the heuristic algorithm of service discovery, and finishes the screening of the prefix service set. Mainly comprises 5 steps: (1) creating a graph node; (2) creating a graph edge; (3) calculating the distance; (4) prefix service calculation; (5) and generating a service discovery set. As shown in fig. 1.
(1) Graph node creation
And establishing a service node according to each service of the scientific and technological resource service, and establishing a parameter node according to each parameter in the input parameter set and the output parameter set of the service. The pseudo code of the algorithm for creating the service node is shown as algorithm 1, when the algorithm is started, scientific and technological resource service file information is input, and services s in the files are traversed in sequenceiAnd extracting the information of the service and creating a service node. Lines 5-11 extract the parameter information for the service, create each parameter node for the service, and connect the parameter nodes with the service node, as shown in fig. 2.
In Algorithm 1, QiQoS attribute information for a service, IiTo input parameters, OiTo output the parameters, viAs serving node, piIs a parameter node.
(3) Creation of edges in a graph
And creating directed edges between service nodes according to the relation between the scientific and technological resource services, wherein an algorithm pseudo code for creating the directed edges between the services is shown as an algorithm 2. When the algorithm is started, each service node is traversed, the input parameter set and the output parameter set of each two service nodes are compared, if an intersection exists, an edge is created between the two service nodes, and the service nodes are marked as partial matching or complete matching according to a matching relation, as shown in fig. 3.
In Algorithm 2, Ivi,OviRepresenting a service node viA set of input parameters and a set of output parameters,
(4) distance calculation
Inputting an initial parameter set r of a service request r when calculating a distanceiAnd a target parameter set roAnd constructing an initial state and a target state, which correspond to the initial state node and the target state node. The calculated distances include two types: one is the output parameter set w of the service nodeoOf each output parameter p from the initial state
(i.e. the distance from the parameter node of the service that can be called by the current state to the initial state node), and the other is the distance d (w) between the service w and the initial state (i.e. the distance from the service node that can be called by the current state to the initial state node). When it is satisfied with
Updating
During calculation, aiming at each service w ∈ curWS in the service set curWS which can be called by the curS in the current state, the distance d (w) between the service w and the initial state is calculated, and the output parameter set w of the service is calculated according to d (w)oIs the distance of each output parameter p from the initial state
The calculation formula of (a) is as follows:
in the above formula, ow (p) is a service set capable of outputting the parameter p, that is:
all have p ∈ wo(ii) a p 'is an output parameter, and p' is equal to wi，wiIs an input parameter set; η (w) is the QoS attribute of the technology resource service, i.e. the cost (e.g. response time) of the technology resource service invocation, and is assigned as the weight of the edge.
As will be explained below
Why it is from the initial state riMinimum acquisition cost to parameter p. First, if a service w is called, the existing output parameter set P (denoted as state curS in the algorithm) must contain the input parameter set w of the service wiI.e. by
Therefore invoking service w needs to wait until wiAre obtained, thus from riThe minimum distance from the state where the service w can be invoked is
As shown in fig. 4. Thus obtaining the parameter p ∈ w through the service woThe cost of (a) is:
thus, by comparing all prefix services for parameter p, the minimum cost for p is finally obtained
Initialization
The rule of (1) is as follows:
(5) prefix service computation
For each service w in the set of services currws that can be invoked by the current state curS, at the start of the algorithm, the input parameter set of the current state curS is set to the requested initial parameter set riThe currently accessed service set V is set as an empty set. If the current state curS does not yet contain the requested target parameter set roThen a search for services is started. In each search round, a service set curWS that can be invoked at the current state curS is computed. The prefix of p is recorded or updated in this calculation to serve preWS (p). Set of output parameters w for traversal service woThen, calculate the slave riMinimum distance to output parameter p
When it is satisfied with
Shortest distance of parameter p is updated
At the same time, the prefix service prews (p) of the parameter p is updated, and the current service w is recorded as the prefix service prews (p) for acquiring the parameter p.
(6) Service discovery set generation
After calling the service w, the output parameter set w of the service w is collectedoMerging into the current state curS, merging the currently invoked service set curWS into the invoked service set C. Finally, the state curS contains the target set of parameters r to the requestoAt that time, the search process stops and a service discovery set is generated. The service discovery algorithm 3 is as follows:
in Algorithm 3, C is the set of services accessed, PDwsFor prefix service set of all parameters, p' is input parameter set w of service wiThe parameter (1).
Example (b):
in order to make the objects, technical solutions and advantages of the present invention clearer and easier to understand, the following will further explain details of the technical solution of the scientific and technological resource service discovery method based on the drawings in conjunction with the specific embodiments.
The technology resource service has a distributed characteristic, which is embodied in that the technology resource is often located in a plurality of systems in different regions, and the cross-domain quality of service (QoS) depends on the response time of the service. The invention provides a scientific and technological resource service discovery method based on a graph, which adds the response time of a service into the graph as the QoS attribute of the service and effectively realizes a service discovery algorithm. The specific implementation is as follows:
first assume that there are 5 Web services: w1, w2, w3, w4 and w5, which are respectively:
service w 1: the method comprises the steps of inputting a parameter set { unified coding D, year C }, outputting a parameter set { scientific research expenditure F, the number G of employees, talent introduction condition H }, and providing a geographical position (Zhanjiang city, Guangdong province).
Service w 2: the method comprises the steps of inputting a parameter set (university name B and year C), outputting a parameter set (scientific research expenditure J and number K of teachers at work), and determining the geographic position of a service provider (Nanning city of Guangxi Zhuang nationality autonomous region).
Service w 3: the method comprises the steps of inputting a parameter set (scientific research expenditure F of scientific research institutions, the number G of staff of the scientific research institutions, the scientific research expenditure J of universities and the number K of staff of universities), outputting a parameter set (average scientific research expenditure L of the scientific research institutions, average scientific research expenditure M of the universities and average scientific research expenditure N of the universities, and providing geographic positions of service providers (Hainan province, Haikou city).
Service w 4: the method comprises the steps of inputting a parameter set { scientific research institute name A }, outputting a parameter set { unified coding D, address details I }, and providing a geographical position (Zhanjiang city, Guangdong province).
Service w 5: the method comprises the steps of inputting a parameter set { scientific research institute name A and year C }, outputting a parameter set { unified code D, talent introduction condition P }, and providing a service provider geographical position (Zhanjiang city, Guangdong province).
The service requester is located in Beijing, the initiated request is represented by r, the request input set ri is { scientific research institute name A, university name B and year C }, and the request output set ro is { scientific research expense L of the average of the scientific research institutions, M of the average of the scientific research expense of the university and N }.
The scientific and technological resource service discovery method based on the graph comprises two processes of construction of a service relation graph and generation of a service discovery set. The method comprises the following specific steps:
step 1: according to the services, a service relation graph is constructed, and the specific construction process is further divided into the following steps:
step 1.1: graph node creation
Writing the input and output parameters of the service, the class information of the service, the cost (QoS) for calling between the scientific and technological resource services and other information into a service file, forming the service file after removing the failure service, traversing each service in the service file, and creating a service node N according to the name of the service and the cost (QoS) for calling between the scientific and technological resource servicesSA parameter node N is created in turn for each parameter in the input and output parameter sets of a servicePAnd then associating the parameter node with the service node. One service node may be found corresponding to a plurality of parameter nodes. The flow of creating graph nodes is shown in fig. 2.
Step 1.3: and creating a graph edge.
For the 5 scientific and technological resource services in this embodiment, because the directed edges are established, 20 combinations need to be considered to determine whether the directed edges exist. Considering the establishment of the directed edges from the service w1 to the service w3, first considering the output parameter set α ═ F, G, H of the service w1 and then considering the input parameter set β ═ F, G, J, K of the service w3, it can be found that α ∞ β is not null, considering the establishment of the directed edges, if null, no processing is performed. Because of the fact that
If the service relationship graph does not hold, the attributes of the directed edges are marked as partial matching, the corresponding line in the service relationship graph is a dotted line, and if the service relationship graph does not hold, the attributes of the directed edges are marked as partial matching, and the corresponding line in the service relationship graph is a broken line
If true, it is marked as a complete match and the lines in the service relationship graph are marked as solid lines. A flowchart for creating edge nodes is shown in fig. 3. The service relationship diagram is shown in fig. 5.
Step 2: the service relation graph is used as a basis, the fact that the service planning graph is simply constructed for search traversal is considered, time complexity is in an index level, and therefore a heuristic algorithm based on graph planning is used, the algorithm can achieve efficient service discovery on the polynomial complexity level, and an approximately optimal solution is obtained.
Algorithm to request input set riAs an initial value of the current state curS, the target state is the request output set ro. Based on the service relationship diagram, the specific implementation process can be further subdivided into the following steps:
step 2.1: distance calculation
Definition of
Wherein
Represents the state from the initial state riDistance to current parameter p, d (w) denotes the distance from current state riMaximum distance before call w, η (w) represents the call current clothingThe cost of the transaction.
Step 2.2: prefix service set generation
Traversing the current state can call each service in the service set curWS corresponding to each output parameter p of each service, if satisfied
The prefix w of p is updated.
Step 2.3: service discovery set generation
The current state contains roThe search is complete and the service discovery set is preWS.
The Web service assumed above uses the service discovery algorithm, and the specific steps are as follows:
initialization: input request set ri-A, B, C, output request set ro{ L, M, N }. It is assumed that the cost of invoking a service is derived from its response time and distributed attributes as: η (w1) ═ 2, η (w2) ═ 1, η (w3) ═ 3, η (w4) ═ 2, and η (w5) ═ 1.
The first iteration: current state curS ═ riThe tunable service set curWS is { w2, w4, w5}, d (w2) is 0, d (w4) is 0, d (w5) is 0,
updating curS { (A, B, C, D, I, P, J, K }, V { (w2, w4, w5}, if not satisfied
A second iteration is performed.
And (3) second iteration: the current state is currs ═ { a, B, C, D, I, P, J, K }, the set of callable services currws ═ w1},
updating curS { (a, B, C, D, I, P, J, K, F, G, H }, V { (w1, w2, w4, w5}, if not satisfied
A third iteration is performed.
And a third iteration: the current state is currs ═ a, B, C, D, I, P, J, K, F, G, H, V ═ w1, w2, w4, w5, the tunable service set currws ═ w3,
update currs { a, B, C, D, I, P, J, K, F, G, H, L, M, N }, V { w1, w2, w3, w4, w5 }. Satisfy the requirement of
The iteration terminates.
And generating a service discovery set preWS { w1, w2, w3, w4 and w5 }. The direct prefix service corresponding to each output parameter is shown in the following table:
table 1: prefix service
| A | B | C | D | F | G | H | I | J | K | L | M | N | P |
| — | — | — | w5 | w1 | w1 | w1 | w4 | w2 | w2 | w3 | w3 | w3 | w5 |
It should be noted that the above embodiments are only specific cases of the present invention, and the described embodiments are intended to explain the technical solutions of the present invention, and should not be construed as limiting the present invention. Equivalent substitutions and modifications of the related technical solutions or technical features of the present invention by a person of ordinary skill should fall into the protection scope of the present invention.
Claims (7)
1. A scientific and technological resource service discovery method based on a graph is characterized by comprising the following steps:
establishing each piece of service information of the scientific and technological resource service as a service node, establishing a parameter node aiming at each parameter in an input parameter set and an output parameter set in the service node, and connecting the parameter node with the service node;
comparing whether the input parameter set and the output parameter set of each two service nodes have intersection, and if so, creating a directed edge between the two service nodes; the parameter nodes, the service nodes and the directed edges form graph data;
according to an initial parameter set and a target parameter set of a service request, an initial state node and a target state node in graph data, calculating the distance d (w) from the service node of each service w which can be called by the current state to the initial state node, and according to the distance d (w), calculating the distance from the parameter node of each output parameter p in the output parameter set of the service to the initial state node
When it is satisfied with
Then update
Wherein eta (w) is the calling cost among the scientific and technological resource services;
obtaining prefix service preWS (p) of each output parameter p of each service w when meeting
If yes, the service w is marked as prefix service prews (p) of parameter p, that is, prews (p) ═ w;
after the service w is called, the output parameter set of the service w is added into the current state of the service, the currently called service is merged into the called service set, and a service discovery set is generated until the current state contains the target parameter set of the service request.
2. The method of claim 1, wherein in creating a directed edge, a flag is made as to whether the input parameter set and the output parameter set of two service nodes are perfect matches.
3. The method of claim 1,
the calculation formula of (a) is as follows:
wherein ow (p) is a service set capable of outputting parameter p, for
All have p ∈ wo，woIs a set of output parameters; p 'is an output parameter, and p' is equal to wi，wiIs an input parameter set.
4. The method of claim 1 or 3,
rian initial set of parameters for the service request.
5. The method of claim 1, wherein when acquiring prefix service, setting an input parameter set of a current state as an initial parameter set of a request, and setting a service set which has been accessed currently as an empty set; if the current state does not contain the target parameter set of the service request, searching the service; in each round of search process, a service set which can be called in the current state is calculated, and a prefix service preWS (p) of an output parameter p is recorded or updated in the calculation process.
6. A map-based scientific resource service discovery apparatus comprising a memory having stored thereon a computer program and a processor that when executed implements the steps of the method of any one of claims 1 to 5.
7. A computer-readable storage medium, storing a computer program which, when executed by a processor, carries out the steps of the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210061678.5A CN114500636B (en) | 2022-01-19 | 2022-01-19 | Graph-based scientific and technological resource service discovery method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210061678.5A CN114500636B (en) | 2022-01-19 | 2022-01-19 | Graph-based scientific and technological resource service discovery method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114500636A true CN114500636A (en) | 2022-05-13 |
| CN114500636B CN114500636B (en) | 2023-06-20 |
Family
ID=81472909
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210061678.5A Active CN114500636B (en) | 2022-01-19 | 2022-01-19 | Graph-based scientific and technological resource service discovery method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114500636B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116738246A (en) * | 2023-06-12 | 2023-09-12 | 烟台大学 | Combined service dynamic reconstruction method and system for service demand change |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100010974A1 (en) * | 2008-07-09 | 2010-01-14 | International Business Machines Corporation | Apparatus and Method of Semantic Service Correlation System |
| CN101634994A (en) * | 2009-08-28 | 2010-01-27 | 北京大学 | Service discovery and combination device |
| US20100191555A1 (en) * | 2009-01-29 | 2010-07-29 | Emil Shmul | Business service discovery |
| US20160308712A1 (en) * | 2015-04-16 | 2016-10-20 | Hewlett-Packard Development Company, L.P. | Business service discovery |
| CN107590243A (en) * | 2017-09-14 | 2018-01-16 | 中国人民解放军信息工程大学 | The personalized service recommendation method to be sorted based on random walk and diversity figure |
| CN109408046A (en) * | 2018-09-05 | 2019-03-01 | 河海大学 | A kind of shortest path web service composition method based on figure |
| CN110691000A (en) * | 2019-10-15 | 2020-01-14 | 山东理工大学 | Web service combination method based on fusion of FAHP and planning graph |
| CN111400611A (en) * | 2020-02-17 | 2020-07-10 | 华北电力大学 | Service discovery method based on Web complex relationship network |
| CN111708936A (en) * | 2020-05-26 | 2020-09-25 | 中国人民解放军海军工程大学 | Web service recommendation system and method based on similarity propagation strategy |
-
2022
- 2022-01-19 CN CN202210061678.5A patent/CN114500636B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100010974A1 (en) * | 2008-07-09 | 2010-01-14 | International Business Machines Corporation | Apparatus and Method of Semantic Service Correlation System |
| US20100191555A1 (en) * | 2009-01-29 | 2010-07-29 | Emil Shmul | Business service discovery |
| CN101634994A (en) * | 2009-08-28 | 2010-01-27 | 北京大学 | Service discovery and combination device |
| US20160308712A1 (en) * | 2015-04-16 | 2016-10-20 | Hewlett-Packard Development Company, L.P. | Business service discovery |
| CN107590243A (en) * | 2017-09-14 | 2018-01-16 | 中国人民解放军信息工程大学 | The personalized service recommendation method to be sorted based on random walk and diversity figure |
| CN109408046A (en) * | 2018-09-05 | 2019-03-01 | 河海大学 | A kind of shortest path web service composition method based on figure |
| CN110691000A (en) * | 2019-10-15 | 2020-01-14 | 山东理工大学 | Web service combination method based on fusion of FAHP and planning graph |
| CN111400611A (en) * | 2020-02-17 | 2020-07-10 | 华北电力大学 | Service discovery method based on Web complex relationship network |
| CN111708936A (en) * | 2020-05-26 | 2020-09-25 | 中国人民解放军海军工程大学 | Web service recommendation system and method based on similarity propagation strategy |
Non-Patent Citations (6)
| Title |
|---|
| NACÉRA TEMGLIT;MOHAMED AHMED NACER: "" Graph based approach for dynamic discovery of composite web services"", 《2012 IEEE CONFERENCE ON OPEN SYSTEMS》 * |
| YANG YU等: ""Web Service Discovery Based on Knowledge Graph and Similarity Network"", 《2020 IEEE WORLD CONGRESS ON SERVICES (SERVICES)》 * |
| 张进;傅秀芬;: "利用匹配关系图的Web服务发现方法", 计算机工程与设计, no. 10 * |
| 曹渝昆;丁明伟;: "一种基于本体的语义Web服务发现模型", 计算机系统应用, no. 04 * |
| 李勇: ""分布式Web服务发现机制研究"", 《中国博士学位论文全文数据库信息科技辑》 * |
| 李国栋;李樨;柳长安;: "基于Web Services异构资源汇集与共享系统", 计算机技术与发展, no. 12 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116738246A (en) * | 2023-06-12 | 2023-09-12 | 烟台大学 | Combined service dynamic reconstruction method and system for service demand change |
| CN116738246B (en) * | 2023-06-12 | 2023-12-26 | 烟台大学 | Combined service dynamic reconstruction method and system for service demand change |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114500636B (en) | 2023-06-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20220035600A1 (en) | API Specification Generation | |
| US8626835B1 (en) | Social identity clustering | |
| WO2019019385A1 (en) | Cross-platform data matching method and apparatus, computer device and storage medium | |
| CN112000763B (en) | Method, device, equipment and medium for determining competition relationship of interest points | |
| Zervakis et al. | Efficient continuous multi-query processing over graph streams | |
| Kim et al. | Influence maximization based on reachability sketches in dynamic graphs | |
| US20210073235A1 (en) | Incremental data retrieval based on structural metadata | |
| CN105573971B (en) | Table reconfiguration device and method | |
| CN114500636A (en) | Scientific and technological resource service discovery method and device based on graph | |
| Kolli et al. | How actors of social networks affect differently on the others? Addressing the critique of equal importance on actor-network theory by use of social network analysis | |
| US11200245B2 (en) | Fuzzy searching and applications therefor | |
| US20180308057A1 (en) | Joint optimization and assignment of member profiles | |
| CN114422582B (en) | Dynamic service combination method and device for technological resources | |
| US20170322778A1 (en) | Rapid identification of object properties in an evolving domain model of an enterprise application on the cloud | |
| US11016830B2 (en) | Entity-based service operation for object-based persistence | |
| US7720881B2 (en) | Role based groups | |
| CN115185997A (en) | Host information processing method and device, electronic equipment and storage medium | |
| US20220284309A1 (en) | Aligning knowledge graphs using subgraph typing | |
| CN114238576A (en) | Data matching method and device, computer equipment and storage medium | |
| US11580322B2 (en) | Scalable attributed graph embedding for large-scale graph analytics | |
| Glantz et al. | Tree-based coarsening and partitioning of complex networks | |
| Wang et al. | On searching multiple disjoint shortest paths in scale-free networks with hyperbolic geometry | |
| CN112035581A (en) | Model-based task processing method, device, equipment and medium | |
| US7725500B2 (en) | Role based groups | |
| CN111400611A (en) | Service discovery method based on Web complex relationship network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |