CN111221508A - Business path design method, design device, electronic device and storage medium - Google Patents
Business path design method, design device, electronic device and storage medium Download PDFInfo
- Publication number
- CN111221508A CN111221508A CN201911115038.2A CN201911115038A CN111221508A CN 111221508 A CN111221508 A CN 111221508A CN 201911115038 A CN201911115038 A CN 201911115038A CN 111221508 A CN111221508 A CN 111221508A
- Authority
- CN
- China
- Prior art keywords
- service
- resource
- target
- task
- last node
- 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
- 238000000034 method Methods 0.000 title claims abstract description 54
- 238000013461 design Methods 0.000 title claims abstract description 28
- 230000015654 memory Effects 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 9
- PCHJSUWPFVWCPO-UHFFFAOYSA-N gold Chemical compound [Au] PCHJSUWPFVWCPO-UHFFFAOYSA-N 0.000 claims description 9
- 229910052737 gold Inorganic materials 0.000 claims description 9
- 239000010931 gold Substances 0.000 claims description 9
- 238000012545 processing Methods 0.000 claims description 9
- 238000004891 communication Methods 0.000 claims description 5
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 9
- 235000013311 vegetables Nutrition 0.000 description 8
- 238000012360 testing method Methods 0.000 description 5
- PEDCQBHIVMGVHV-UHFFFAOYSA-N Glycerine Chemical compound OCC(O)CO PEDCQBHIVMGVHV-UHFFFAOYSA-N 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000012938 design process Methods 0.000 description 2
- 239000003337 fertilizer Substances 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000012216 screening Methods 0.000 description 2
- 230000000007 visual effect Effects 0.000 description 2
- BQCADISMDOOEFD-UHFFFAOYSA-N Silver Chemical compound [Ag] BQCADISMDOOEFD-UHFFFAOYSA-N 0.000 description 1
- 238000005314 correlation function Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 229910052709 silver Inorganic materials 0.000 description 1
- 239000004332 silver Substances 0.000 description 1
- 239000002689 soil Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/20—Software design
-
- A—HUMAN NECESSITIES
- A63—SPORTS; GAMES; AMUSEMENTS
- A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
- A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
- A63F13/60—Generating or modifying game content before or while executing the game program, e.g. authoring tools specially adapted for game development or game-integrated level editor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The embodiment of the application provides a service path design method, a design device, electronic equipment and a storage medium, wherein the method comprises the following steps: acquiring a task service set, a resource pool set corresponding to a target user and service expected benefits; selecting a plurality of task services reaching the service expected income from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the service expected income; analyzing the total amount of resources consumed by each service path, and comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths; and prompting to execute the target service path so as to obtain the expected revenue of the service. The method and the device for designing the service path are beneficial to improving the efficiency of designing the service path, and further improve user experience.
Description
Technical Field
The present application relates to the field of service processing technologies, and in particular, to a method and an apparatus for designing a service path, an electronic device, and a storage medium.
Background
At present, to achieve a certain service purpose, a service flow needs to be executed according to a service path preset by a user, so as to achieve the service purpose; when a plurality of optional schemes exist in a business process, a plurality of optional business paths exist to achieve the business purpose. However, some of the various alternative routes are not suitable for accomplishing the business objectives. For example, when an employee wants to ask for a leave, the employee needs to sequentially give a first level leader, a second level leader and a third level leader for a leave, the third level leader is composed of a board director, a manager and a supervisor, and only one of the third level leader can pass through the leave, so that the employee has multiple optional ways to ask for a leave. However, if the leave process is set to require president leave, the path is not reasonable to design because president things are busy and there is no time to leave. For another example, in a game, in order to achieve a certain game purpose, a developer designs a plurality of game growth lines for the game purpose, but a part of the game growth lines requires a large amount of game resources (e.g., game gold coins) or requires a large amount of growth time (e.g., a long time to brush copies) so that the part of the game growth lines does not meet the actual needs of the user, and the game growth lines are unreasonable.
Therefore, when the service is developed, the design mode of the service path is single, and the actual situation of the service is not considered, so that the problem of unreasonable service path frequently occurs.
Disclosure of Invention
The embodiment of the application provides a service path design method, a design device, electronic equipment and a storage medium, and an optimal service path reaching expected service income is quickly designed according to an existing resource pool set of a target user, so that user experience is improved.
In a first aspect, an embodiment of the present application provides a method for designing a service path, including:
acquiring a task service set, a resource pool set corresponding to a target user and service expected benefits;
selecting a plurality of task services reaching the service expected income from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the service expected income;
analyzing the total amount of resources consumed by each service path, and comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths;
and prompting to execute the target service path so as to obtain the expected revenue of the service.
In a second aspect, an embodiment of the present application provides a traffic path designing apparatus, including:
the acquisition unit is used for acquiring a task service set, a resource pool set corresponding to a target user and expected service benefits;
the processing unit is used for selecting a plurality of task services reaching the service expected income from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the service expected income;
a comparing unit, configured to analyze a total amount of resources consumed by each service path, and compare the total amount of resources consumed by each service path with a resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths;
and the prompting unit is used for prompting the execution of the target service path so as to obtain the expected income of the service.
In a third aspect, embodiments of the present application provide an electronic device, including a processor, a memory, a communication interface, and one or more programs, where the one or more programs are stored in the memory and configured to be executed by the processor, and the program includes instructions for performing the steps in the method according to the first aspect.
In a fourth aspect, embodiments of the present application provide a computer-readable storage medium, which stores a computer program, where the computer program makes a computer execute the method according to the first aspect.
In a fifth aspect, embodiments of the present application provide a computer program product comprising a non-transitory computer-readable storage medium storing a computer program, the computer being operable to cause a computer to perform the method according to the first aspect.
The embodiment of the application has the following beneficial effects:
it can be seen that, in the embodiment of the application, a task service set and a service expected benefit corresponding to a target user can be input in advance, and a plurality of service paths are automatically designed for achieving the service expected benefit through the task service set, so that the efficiency of designing the service paths is improved; and the target service path is selected from the plurality of service paths according to the existing resource pool set of the target user, so that a better service path can be selected for achieving the expected income of the service, the plurality of service paths are tested one by one without investing manpower, the manpower resource is saved, and the user experience is improved.
Drawings
Fig. 1A is a schematic view of a scenario of a service path design provided in an embodiment of the present application;
fig. 1B is a schematic diagram of a service path design provided in an embodiment of the present application;
FIG. 1C is a schematic diagram of a virtual game character growth path according to an embodiment of the present disclosure;
fig. 2A is a schematic flow chart of a service path design provided in an embodiment of the present application;
FIG. 2B is a schematic diagram illustrating a virtual game character growing process according to an embodiment of the present disclosure;
fig. 2C is a schematic diagram of a service path expansion according to an embodiment of the present application;
fig. 3A is a schematic flow chart of another service path design provided in the embodiment of the present application;
FIG. 3B is a schematic diagram of another virtual game character growing process provided in the present application;
fig. 4 is a schematic structural diagram of a service path design apparatus according to an embodiment of the present application;
fig. 5 is a block diagram illustrating functional units of a traffic path design apparatus according to an embodiment of the present disclosure.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all, embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terms "first," "second," "third," and "fourth," etc. in the description and claims of this application and in the accompanying drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, result, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
In order to understand the present application, a description will first be made of a part of the noun referred to in the present application.
Game growth line: in the game, predetermined steps are provided for achieving the game object.
Directed graph: a directed graph refers to an ordered triple (V (D), A (D), ψ D), where ψ D is the correlation function that makes every element (directed edge or arc) in A (D) correspond to an ordered pair of elements (vertices or points) in V (D).
Optimal solution: the best solution can be achieved under the condition of not sacrificing any total target and each partial target; since the global optimal solution is difficult to compute, the local optimal solution is often used instead of the global optimal solution.
Fig. 1A is a schematic view of a scenario of a service path design provided in an embodiment of the present application, including: a user terminal 100 and a traffic path planning apparatus 200. As shown in fig. 1B, the traffic path designing apparatus 200 has a function of expanding a hierarchical directed graph (i.e., a directed acyclic graph) layer by layer based on an Entity-exchange model (Entity-Trade). The user terminal 100 sends a task service set to the user terminal; the service path design device 200 firstly converts the task service set to obtain data conforming to a set format, and introduces a plurality of converted task services and a resource pool set into an Entity-Trade model; in addition, the service path design apparatus 200 further receives the service expected revenue and the resource pool set corresponding to the target user, which are sent by the user terminal 100, through an interface of the system database, introduces the service expected revenue into the Entity-Trade model, and plans a plurality of service paths for achieving the service expected revenue by using the Entity-Trade model; finally, a target service path (optimal service path) is selected from the plurality of service paths by using the resource pool set.
It can be seen that, in the embodiment of the application, the task service is input in advance, and a plurality of service paths are automatically designed for achieving the expected business benefits based on the task service, so that the efficiency of designing the service paths is improved; and according to the owned resource pool set, a target service path is selected from the multiple service paths, so that the optimal service path is selected for achieving the expected income of the service, and the user experience is improved.
First, a process of designing a service path will be described by taking a process of designing a growth line for a virtual game character as an example.
It is understood that the task service set is an upgrade rule set corresponding to the virtual game character, and the expected profit of the service includes a target level of the virtual game character, item types, number of each item, game gold, and the like, wherein the items include weapon types, weapon attributes, ornament types, and the like.
Therefore, according to the expected business profit and the task business set, selecting a previous upgrading rule capable of upgrading to the expected business profit, obtaining the resource types and the resource quantity consumed by upgrading by using the previous upgrading rule, and then selecting a previous upgrading rule capable of upgrading to the previous upgrading rule from the task business set; and analogizing in turn to obtain the upgrading rules under each hierarchy, the resource types required by each upgrading rule and the quantity of each resource. Until the consumed resource is the set basic resource (such as a primary token, physical power, prop, etc.), a plurality of growth routes corresponding to the expected income (growth line target) are obtained, and each growth route is composed of various upgrading rules.
As shown in FIG. 1C, the business expected revenue is to upgrade the virtual game character to 18 levels, obtain a silver martial saber and upgrade the saber's power of attack to 150, obtain the second head, speed boot in the pendant, and obtain the 1W gold coin. Then, the expected income of the service obtained from the pre-input task service set (the upgrading rule) can be obtained by opening the ordinary copy or opening the high-level copy. Thus, the business expectation would be gained by route 1 and route 2 shown in FIG. 1C. And finally, sequentially developing forwards to obtain the upgrading rules under each grade, and further obtaining a plurality of growth lines reaching the expected income of the business.
Furthermore, each growing route can be represented by a multiple linear equation, and the multiple linear equation corresponding to each growing route is solved and approximated through an exploration algorithm, so that the quantity of basic resources consumed by each growing route and the growing time length corresponding to each growing route are obtained; finally, a target growth route (optimal growth route) is selected from the plurality of growth routes according to a preset growth restriction condition, the growth restriction condition including: the growing time is shortest, the total consumed resources are least, the consumption of a certain resource is least, and the matching degree with the resource pool set is one or more of the current owned resource pool set.
It can be seen that in the embodiment of the application, the optimal growth route can be automatically obtained aiming at the growth line target of the virtual game role, and the design process of the game growth route is simplified; moreover, the growth time corresponding to the optimal growth route is short or the resource consumption is low, so that the problem of unreasonable design of the growth route is avoided.
And then, taking greenhouse vegetable cultivation as an example to explain the design process of the service path.
It is understood that the task service is a plurality of growth rules of the vegetable, for example, the growth rules may be x kg for fertilizer application, y kg for watering, and z g for growth; the business expected benefits include weight, ripeness, freshness, yield, reject rate, etc. of the vegetables.
Therefore, selecting a previous growth rule which can be used for growing to the business expected profit from the business expected profit and the task business set, obtaining the resource types and the resource quantity consumed when the previous growth rule is used for cultivating the vegetables, and then selecting a previous growth rule used for growing to the resource types and the resource quantity from the task business set; and analogizing in turn to obtain growth laws under each level, resource types required by each growth law and the quantity of each resource. Until the consumed resource is the set basic resource (such as artificial fertilizer, soil environment, vegetable seedling, etc.), a plurality of growth routes corresponding to the expected profit (growth line goal) are obtained.
Finally, comparing the types and the quantity of the basic resources required by each growth route with the existing resource set to obtain a target growth route; then, the target growth route is used for cultivating the vegetables, so that the vegetables can reach the expected business benefits according to the optimal growth route, the yield, the growth speed and the yield of the vegetables can be improved, and the user experience is improved.
Fig. 2A is a schematic flow chart of a service path design method provided in the embodiment of the present application, where the method includes, but is not limited to, the following steps:
201: and acquiring a task service set, a resource pool set corresponding to a target user and service expected benefits.
When the target user is a virtual game role, the task service in the task service set is a growth rule (upgrade rule) of the virtual game role.
For example, when 5 physical forces are consumed and 5 keys can make a magic deep-well copy once in a game of 'soul nebulous moon biography', 8 magic embers and 2 ten thousand coins can be obtained after the copy is made, the growth rule is converted into an Entity-Trade model and expressed as: trade name: magic deep moon, growth rule: cost: physical strength 5 and key 5, Gain: magic embers 8 and coins 20000.
Wherein the expected revenue of the business is the target which needs to be achieved and is set by the user. For example, the game set by the user in the sommelier nebulous moon story obtains 24 magic embers props, which is the expected revenue of the business.
The resource set is a resource set which is owned currently. For example, if a user currently has 20 points of physical strength, 20 keys and one thousand coins in a game of "soul legend", the 20 points of physical strength and 20 keys and one thousand coins are used as the resource sets of the target user.
202: and selecting a plurality of task services reaching the service expected income from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the service expected income.
Optionally, determining a resource of a previous level according to the expected business revenue and the task business set; and then, determining the resources of the upper hierarchy according to the task service set based on the determined resources of the upper hierarchy, and performing reverse pushing and unfolding on the resources of the upper hierarchy according to the task service set in sequence by analogy until the resources of the upper hierarchy cannot be unfolded. It can be understood that there is not only one intercommunication path between any two adjacent hierarchies, so that all possible service paths between any two adjacent hierarchies are cross-combined to obtain a plurality of service paths, and all service paths between the whole hierarchy are cross-combined to obtain a plurality of service paths.
For example, as in game XXX, the expected revenue of the business is to obtain item X, and item X specified in the plurality of task business sets can be obtained through copy a or copy B, so the item X is first expanded based on the expected revenue of the business to obtain the resources consumed by the previous level to achieve the expected revenue of the business, that is:
in addition, if copy a needs to consume ticket E1 and ticket E2 to open and copy B needs to consume ticket E3 and ticket E4 to open in the task service set, the acquisition of target prop X may be converted into: tickets E1 and E2, or tickets E3 and E4, namely:
and continuing to reversely push, setting a ticket E1 in the task service set to be acquired through the copy C or D, acquiring a ticket E2 through the copy E or F, acquiring an E3 through the copy H or I, and acquiring an E4 through the copy J or K. And at this time, the stage cannot be expanded in the previous stage, all possible service paths for acquiring the prop X can be determined to be { C and E, C and F, D and E, D and F, H and J, H and K, I and J, I and K }, that is:
203: and analyzing the total amount of resources consumed by each service path, and comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths.
Optionally, according to the existing resource pool set, a better service path (i.e. a target service path) is selected from the plurality of service paths, and the better service path is used to achieve the expected service revenue.
204: and prompting to execute the target service path so as to obtain the expected revenue of the service.
Optionally, after the target business path is obtained, the business path is presented in an animation manner on a visual interface, and a process of executing the target business path to achieve the expected business profit is presented.
As shown in fig. 2B, when the target user is a virtual game character, the growth conditions when the virtual game character grows according to the upgrade rule of each node in the target service path are sequentially shown.
It can be seen that, in the embodiment of the application, the task service can be input in advance, and a plurality of service paths are automatically designed for the expected business benefits through the task service, so that the efficiency of designing the service paths is improved; and according to the basic resource pool set, a target service path is selected from the plurality of service paths, so that the reasonability of service path design is improved, and the user experience is improved.
The method for obtaining the service path by hierarchical expansion is described in detail below.
Constructing a directed acyclic graph according to a task service set and service expected benefits to obtain a plurality of task services reaching the service expected benefits, wherein each node except a last node in the directed acyclic graph comprises at least one task service in the plurality of task services, and at least one task service corresponding to the last node is the service expected benefits;
obtaining at least one corresponding sub-service path between any two adjacent nodes in the directed acyclic graph according to at least one task service corresponding to each node;
and performing cross combination on at least one corresponding sub-service path between any two adjacent nodes to obtain a plurality of service paths reaching the expected service income.
Specifically, the expected business profit is taken as the last node in the directed acyclic graph, then at least one first task which reaches the expected business profit in the task business set is determined, the at least one first task is taken as the last node corresponding to the last node, as described above, if the prop X needs to be obtained through the copy a or the copy B, the resource which needs to be consumed by the last node can be obtained as a or B, that is, the first task business of the last node is the consumed resource a or B to obtain the tool X; then, the last node is used as a new last node, and at least one second task service reaching the at least one first task service in the task service set is determined, namely all second task services reaching any one first task service in the task service set are determined; and analogizing in sequence, when the determined new last node meets the preset condition, namely the resource consumed in executing the business task of the new last node meets the preset condition, stopping the expansion, and constructing the directed acyclic graph reaching the expected business benefit according to all the determined last nodes and the last node.
As shown in fig. 2C, each hierarchy is sequentially expanded, the resources required to be consumed by each node are sequentially obtained, and the expansion is stopped until the resources required to be consumed in the hierarchy N are basic resources. { T1, T2, …, Tn } is a sub traffic path from the previous level to this level, and T1, T2, …, Tn is the resource that needs to be consumed by each sub traffic path. And (4) carrying out cross combination on the sub-service paths between any two levels to obtain a plurality of service paths corresponding to the expected income of the service and the required consumed resources on each service path.
A method of selecting a target traffic path from a plurality of traffic paths is provided below.
Wherein the business expected revenue includes at least one target resource and the amount of each target resource.
And obtaining the first resource type consumed by the last node and the quantity of each first resource according to the quantity of each target resource and the task service of the last node corresponding to the last node on each service path. For example, prop X (expected revenue for business) needs to be obtained through 2 copies a or 3 copies B, the first resource type includes a or B, and the number of the first resource copies a is 2, and the number of the copies B is 3; taking the last node as a new last node on each service path; obtaining a second resource type consumed by the last node and the quantity of each second resource according to the first resource type consumed by the last node, the quantity of each first resource and the task service of the last node corresponding to the last node on each service path; when determining the basic resource type consumed by the starting node of each service path and the quantity of each basic resource, obtaining the total quantity of the resources consumed by each service path; finally, the total amount of resources consumed by each service path is compared with the resource pool set of the target user, and the target service path is selected from the plurality of service paths.
That is, by means of the exploration algorithm and the expected business revenue, the resource types consumed by each node of each business path and the quantity of each resource are reversely deduced until the basic resource types and the quantity of each basic resource corresponding to the starting node on each business path are obtained.
Optionally, the implementation process of obtaining the first resource type consumed by the previous node and the quantity of each first resource according to the quantity of each target resource and the task service of the previous node corresponding to the last node on each service path may be:
determining a first target resource in the at least one target resource, wherein the first target resource is a target resource with the least quantity in the at least one target resource;
acquiring a first resource type consumed by a last node according to a task service of the last node corresponding to the last node, and determining a second target resource in the first resource consumed by the last node, wherein the second target resource is a resource which generates the most other resource types from the first resource consumed by the last node, and the other resources at least comprise the first target resource;
determining the quantity of the second target resource according to the quantity of the first target resource;
determining a new first target resource in the at least one target resource, wherein the new first target resource is the resource with the least quantity except the first target resource in the at least one target resource;
determining a new second target resource corresponding to the previous node, wherein the new second target resource is a resource which generates the most other resources except the second target resource from the first resource consumed by the previous node, and the other resources at least comprise the new first target resource;
and determining the quantity of each first resource consumed by the last node corresponding to the last node on each service path according to the new first target resource and the new second target resource.
The process of the exploration algorithm to obtain the target path is described below by a practical example.
For example, the target resources of the business expected revenue are: four resources of 100E1, 150E2, 200E3 and 250E4 are obtained, and the four resources are specified in the task service set and can be obtained through three resources of T1, T2 or T3 in the last node. For example, 5E 1 can be obtained from one T1, 10E 1 and 5E 2 can be obtained from one T2; one T3 could obtain 10E 2, 10E 3 and 10E 4; it may be determined that there are three business paths that achieve the expected revenue for the business, namely T1 and T3, T2 and T3 or T1, T2 and T3. When the total amount of resources consumed by the service path of T1, T2 and T3 is calculated, a multivariate linear equation corresponding to T1, T2 and T3 can be established: a T1+ b T2+ c T3 ═ 100E1+150E2+200E3+250E 4. Therefore, the total amount of resources consumed by the service path is obtained and converted into the values of a, b and c. Since the amount of E1 needed in the target resource is minimal and T1 can only generate E1, T2 can generate T2 at the same time as E1. Therefore, if T2 is preferentially used to reach the target resource E1, 10T 2 are consumed in the previous node, i.e., b equals 10; in addition, after the number of the target resource E1 is reached, the target resource E2 needs to be reached. Since T3 also generates E3 and E4 when generating E2, T3 is used first to reach the target resource E2; in addition, when 100E1 is generated by using 10T1, 50E2 are generated synchronously, so when the target resource E2 is generated by using T3, 10T 3 are needed preliminarily, and 150E2 can be generated; in addition, only T3 can produce E3 and E4, and thus, 25T 3 are actually required to produce 250E 4. Then a is determined to be 0, b is determined to be 10, and c is determined to be 25.
In some possible embodiments, the step of comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user to obtain the target service path in the plurality of service paths may be: constructing a first feature vector according to the basic resource types consumed by each service path and the quantity of each basic resource; constructing a second feature vector according to the basic resource types in the resource pool set corresponding to the target user and the quantity of each basic resource; calculating the cosine similarity of each service path of the first eigenvector and the second eigenvector; and determining according to the cosine similarity of each service path to obtain a target service path in the plurality of service paths.
And taking the service path with the maximum cosine similarity as a target service path.
In some possible embodiments, the step of comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user to obtain the target service path in the plurality of service paths may be: and acquiring the occupation ratio of the number of the set resources consumed by each service path relative to the resource set, and taking the service path with the minimum occupation ratio or the maximum occupation ratio as the target service path. Wherein, the set resource is one or more of the basic resources.
For example, the basic resource includes A, B, C, and the traffic path consuming the least resource B is defined in advance as the target traffic path.
In addition, the number of resource types consumed by each service path can be acquired, and the service path with the minimum number of resource types is used as the target service path.
In addition, screening can be performed according to the growth time required by each service path, and the service path with the shortest growth time can be used as the target service path. The method for screening the target service path is not limited in the application.
Fig. 3A is a schematic flow chart of another service path design method provided in an embodiment of the present application, where the same contents as those in the embodiment shown in fig. 2A are provided in this embodiment, and a description thereof is not repeated here. The method includes, but is not limited to, the steps of:
301: and acquiring a task service set, a resource pool set corresponding to a target user and service expected benefits.
302: and selecting a plurality of task services reaching the service expected income from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the service expected income.
303: and analyzing the total amount of resources consumed by each service path, and comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths.
304: and comparing the target service path with a first service path to determine the rationality of the first service path, wherein the first service path is a service path which is preset to achieve the expected service income.
The type of the basic resources and the quantity of each basic resource required by the target path are compared with the type of the basic resources and the quantity of each basic resource required by the pre-designed first service path, so that the rationality of the first service path is judged.
Further, as shown in fig. 3B, when the first service path is not reasonable, the growth process corresponding to the first service path and the growth process of the target service path are displayed on a visual interface to highlight the difference between the two service paths, so that the user can adjust the task service on the first service path to design an optimal growth route.
Compared with the prior art, the method needs a tester to test after a plurality of services are designed, collects data in the test process, and judges the rationality of the first service path according to the data. According to the method and the device, the optimal service path and the first service path are compared, a large amount of manpower and material resources are not required to be input for testing, the testing process is simplified, the testing time is saved, and meanwhile, the input of manpower and material resources is reduced.
Fig. 4 is a schematic structural diagram of a traffic path designing apparatus 400 according to an embodiment of the present application, and as shown in fig. 4, the traffic path designing apparatus 400 includes a processor, a memory, a communication interface, and one or more programs, where the one or more programs are different from the one or more application programs, and the one or more programs are stored in the memory and configured to be executed by the processor, and the programs include instructions for performing the following steps:
acquiring a task service set, a resource pool set corresponding to a target user and service expected benefits;
selecting a plurality of task services reaching the service expected income from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the service expected income;
analyzing the total amount of resources consumed by each service path, and comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths;
and prompting to execute the target service path so as to obtain the expected revenue of the service.
In some possible embodiments, in selecting a plurality of task services that achieve the expected revenue from the set of task services, and combining the plurality of task services to obtain a plurality of service paths that achieve the expected revenue, the program is specifically configured to execute the following instructions:
constructing a directed acyclic graph according to the task service set and the service expected revenue to obtain a plurality of task services reaching the service expected revenue, wherein each node except the last node in the directed acyclic graph comprises at least one task service in the plurality of task services, and the at least one task service corresponding to the last node is the service expected revenue;
obtaining at least one corresponding sub-service path between any two adjacent nodes in the directed acyclic graph according to at least one task service corresponding to each node;
and performing cross combination on at least one corresponding sub-service path between any two adjacent nodes to obtain a plurality of service paths reaching the expected service income.
In some possible embodiments, the above program is specifically configured to execute the following steps in constructing a directed acyclic graph according to the set of task services and the expected revenue of the services:
using the expected business profit as the last node of the directed acyclic graph
Determining at least one first task service which achieves the expected service income in the task service set to obtain a last node corresponding to the last node;
taking the last node as a new last node;
determining at least one second task service of at least one first task service corresponding to the new last node in the task service set to obtain a last node corresponding to the new last node;
and when the new last node meets a preset condition, constructing a directed acyclic graph reaching the expected business profit according to all the determined last nodes and the last node.
In some possible embodiments, the expected revenue of the business comprises at least one target resource and a quantity of each target resource, and the program is specifically configured to execute the following steps in analyzing a total quantity of resources consumed by each business path:
obtaining a first resource type consumed by a last node and the quantity of each first resource according to the quantity of each target resource and the task service of the last node corresponding to the last node on each service path;
taking the last node as a new last node on each service path;
obtaining a second resource type consumed by the last node and the quantity of each second resource according to the first resource type consumed by the last node, the quantity of each first resource and the task service of the last node corresponding to the last node on each service path;
and when the basic resource type consumed by the starting node of each service path and the quantity of each basic resource are determined, obtaining the total quantity of the resources consumed by each service path.
In some possible embodiments, the program is specifically configured to, in terms of obtaining the first resource type consumed by the previous node and the quantity of each first resource according to the quantity of each target resource and the task service of the previous node corresponding to the last node on each service path, execute the following steps:
determining a first target resource in the at least one target resource, wherein the first target resource is a target resource with the least quantity in the at least one target resource;
acquiring a first resource type consumed by a last node according to a task service of the last node corresponding to the last node, and determining a second target resource in the first resource consumed by the last node, wherein the second target resource is a resource which generates the most other resource types from the first resource consumed by the last node, and the other resources at least comprise the first target resource;
determining the quantity of the second target resource according to the quantity of the first target resource;
determining a new first target resource in the at least one target resource, wherein the new first target resource is the resource with the least quantity except the first target resource in the at least one target resource;
determining a new second target resource corresponding to the previous node, wherein the new second target resource is a resource which generates the most other resources except the second target resource from the first resource consumed by the previous node, and the other resources at least comprise the new first target resource;
and determining the quantity of each first resource consumed by the last node corresponding to the last node on each service path according to the new first target resource and the new second target resource.
In some possible embodiments, in terms of obtaining a target service path in the plurality of service paths by comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user, the program is specifically configured to execute the following instructions:
constructing a first feature vector according to the basic resource types consumed by each service path and the quantity of each basic resource;
constructing a second feature vector according to the basic resource types in the resource pool set corresponding to the target user and the quantity of each basic resource;
calculating the cosine similarity of each service path of the first eigenvector and the second eigenvector;
and determining according to the cosine similarity of each service path to obtain a target service path in the plurality of service paths.
In some possible embodiments, the target user is a virtual game character, the resource pool set corresponding to the target user includes a game gold, an initial prop, and an initial level of the virtual game character, task services in the task service set are upgrade rules of the virtual game character, and the expected revenue of the services includes the target level of the virtual game character;
in the aspect of selecting a plurality of task services which reach the expected service gain from the task service set and combining the plurality of task services to obtain a plurality of service paths which reach the expected service gain, the program is specifically used for executing the following instructions:
selecting a plurality of upgrading rules reaching the target level of the virtual game role from the task service set, and performing cross combination on the plurality of upgrading rules to obtain a plurality of service paths reaching the expected service income;
in analyzing the total amount of resources consumed by each traffic path, the program is specifically configured to execute the following steps:
and determining the game gold, the props and the initial level of the virtual game role consumed by each service path according to the target level of the target virtual game role and the upgrading rule corresponding to each service path.
Fig. 5 shows a block diagram of a possible functional unit of the traffic path designing apparatus 500 according to the above embodiment, where the traffic path designing apparatus 500 includes: an obtaining unit 510, a processing unit 520, a comparing unit 530 and a prompting unit 540, wherein:
an obtaining unit 510, configured to obtain a task service set, a resource pool set corresponding to a target user, and a service expected revenue;
a processing unit 520, configured to select multiple task services that achieve the expected service revenue from the task service set, and combine the multiple task services to obtain multiple service paths that achieve the expected service revenue;
a comparing unit 530, configured to analyze a total amount of resources consumed by each service path, and compare the total amount of resources consumed by each service path with the resource pool set corresponding to the target user to obtain a target service path in the multiple service paths;
a prompting unit 540, configured to prompt execution of the target service path to obtain the expected revenue of the service.
In some possible embodiments, in selecting a plurality of task services that achieve the expected business benefit from the task service set, and combining the plurality of task services to obtain a plurality of service paths that achieve the expected business benefit, the processing unit 520 is specifically configured to:
constructing a directed acyclic graph according to the task service set and the service expected revenue to obtain a plurality of task services reaching the service expected revenue, wherein each node except the last node in the directed acyclic graph comprises at least one task service in the plurality of task services, and the at least one task service corresponding to the last node is the service expected revenue;
obtaining at least one corresponding sub-service path between any two adjacent nodes in the directed acyclic graph according to at least one task service corresponding to each node;
and performing cross combination on at least one corresponding sub-service path between any two adjacent nodes to obtain a plurality of service paths reaching the expected service income.
In some possible embodiments, in constructing a directed acyclic graph according to the task service set and the service expected revenue, the processing unit 520 is specifically configured to:
using the expected business profit as the last node of the directed acyclic graph
Determining at least one first task service which achieves the expected service income in the task service set to obtain a last node corresponding to the last node;
taking the last node as a new last node;
determining at least one second task service of at least one first task service corresponding to the new last node in the task service set to obtain a last node corresponding to the new last node;
and when the new last node meets a preset condition, constructing a directed acyclic graph reaching the expected business profit according to all the determined last nodes and the last node.
In some possible embodiments, the expected revenue of the service includes at least one target resource and a quantity of each target resource, and in terms of analyzing a total quantity of resources consumed by each service path, the comparing unit is specifically configured to:
obtaining a first resource type consumed by a last node and the quantity of each first resource according to the quantity of each target resource and the task service of the last node corresponding to the last node on each service path;
taking the last node as a new last node on each service path;
obtaining a second resource type consumed by the last node and the quantity of each second resource according to the first resource type consumed by the last node, the quantity of each first resource and the task service of the last node corresponding to the last node on each service path;
and when the basic resource type consumed by the starting node of each service path and the quantity of each basic resource are determined, obtaining the total quantity of the resources consumed by each service path.
In some possible embodiments, in terms of obtaining the first resource type consumed by the previous node and the amount of each first resource according to the amount of each target resource and the task service of the previous node corresponding to the last node on each service path, the comparing unit 530 is specifically configured to:
determining a first target resource in the at least one target resource, wherein the first target resource is a target resource with the least quantity in the at least one target resource;
acquiring a first resource type consumed by a last node according to a task service of the last node corresponding to the last node, and determining a second target resource in the first resource consumed by the last node, wherein the second target resource is a resource which generates the most other resource types from the first resource consumed by the last node, and the other resources at least comprise the first target resource;
determining the quantity of the second target resource according to the quantity of the first target resource;
determining a new first target resource in the at least one target resource, wherein the new first target resource is the resource with the least quantity except the first target resource in the at least one target resource;
determining a new second target resource corresponding to the previous node, wherein the new second target resource is a resource which generates the most other resources except the second target resource from the first resource consumed by the previous node, and the other resources at least comprise the new first target resource;
and determining the quantity of each first resource consumed by the last node corresponding to the last node on each service path according to the new first target resource and the new second target resource.
In some possible embodiments, in terms of obtaining a target service path in the multiple service paths by comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user, the comparing unit 530 is specifically configured to:
constructing a first feature vector according to the basic resource types consumed by each service path and the quantity of each basic resource;
constructing a second feature vector according to the basic resource types in the resource pool set corresponding to the target user and the quantity of each basic resource;
calculating the cosine similarity of each service path of the first eigenvector and the second eigenvector;
and determining according to the cosine similarity of each service path to obtain a target service path in the plurality of service paths.
In some possible embodiments, the target user is a virtual game character, the resource pool set corresponding to the target user includes a game gold, an initial prop, and an initial level of the virtual game character, task services in the task service set are upgrade rules of the virtual game character, and the expected revenue of the services includes the target level of the virtual game character;
in respect of selecting a plurality of task services that achieve the expected service gain from the task service set, and combining the plurality of task services to obtain a plurality of service paths that achieve the expected service gain, the processing unit 520 is specifically configured to:
selecting a plurality of upgrading rules reaching the target level of the virtual game role from the task service set, and performing cross combination on the plurality of upgrading rules to obtain a plurality of service paths reaching the expected service income;
in analyzing the total amount of resources consumed by each service path, the comparing unit 530 is specifically configured to:
and determining the game gold, the props and the initial level of the virtual game role consumed by each service path according to the target level of the target virtual game role and the upgrading rule corresponding to each service path.
Embodiments of the present application further provide a computer storage medium, where the computer storage medium stores a computer program, and the computer program is executed by a processor to implement part or all of the steps of any one of the traffic path design methods as described in the above method embodiments.
Embodiments of the present application also provide a computer program product comprising a non-transitory computer readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps of any one of the traffic path design methods as set forth in the above method embodiments.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are exemplary embodiments and that the acts and modules referred to are not necessarily required in this application.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implementing, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of some interfaces, devices or units, and may be an electric or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit may be implemented in the form of hardware, or may be implemented in the form of a software program module.
The integrated units, if implemented in the form of software program modules and sold or used as stand-alone products, may be stored in a computer readable memory. Based on such understanding, the technical solution of the present application may be substantially implemented or a part of or all or part of the technical solution contributing to the prior art may be embodied in the form of a software product stored in a memory, and including several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned memory comprises: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by associated hardware instructed by a program, which may be stored in a computer-readable memory, which may include: flash Memory disks, Read-Only memories (ROMs), Random Access Memories (RAMs), magnetic or optical disks, and the like.
The foregoing detailed description of the embodiments of the present application has been presented to illustrate the principles and implementations of the present application, and the above description of the embodiments is only provided to help understand the method and the core concept of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.
Claims (10)
1. A method for designing a traffic path, comprising:
acquiring a task service set, a resource pool set corresponding to a target user and service expected benefits;
selecting a plurality of task services reaching the service expected income from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the service expected income;
analyzing the total amount of resources consumed by each service path, and comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths;
and prompting to execute the target service path so as to obtain the expected revenue of the service.
2. The method of claim 1, wherein the selecting a plurality of task services from the set of task services to achieve the expected revenue of the service, and combining the plurality of task services to obtain a plurality of service paths to achieve the expected revenue of the service comprises:
constructing a directed acyclic graph according to the task service set and the service expected revenue to obtain a plurality of task services reaching the service expected revenue, wherein each node except the last node in the directed acyclic graph comprises at least one task service in the plurality of task services, and the at least one task service corresponding to the last node is the service expected revenue;
obtaining at least one corresponding sub-service path between any two adjacent nodes in the directed acyclic graph according to at least one task service corresponding to each node;
and performing cross combination on at least one corresponding sub-service path between any two adjacent nodes to obtain a plurality of service paths reaching the expected service income.
3. The method of claim 2, wherein the constructing a directed acyclic graph according to the set of task services and the expected revenue of the services comprises:
using the expected business profit as the last node of the directed acyclic graph
Determining at least one first task service which achieves the expected service income in the task service set to obtain a last node corresponding to the last node;
taking the last node as a new last node;
determining at least one second task service of at least one first task service corresponding to the new last node in the task service set to obtain a last node corresponding to the new last node;
and when the new last node meets a preset condition, constructing a directed acyclic graph reaching the expected business profit according to all the determined last nodes and the last node.
4. The method according to claim 2 or 3, wherein the business expected revenue comprises at least one target resource and the amount of each target resource, and the analyzing the total amount of resources consumed by each business path comprises:
obtaining a first resource type consumed by a last node and the quantity of each first resource according to the quantity of each target resource and the task service of the last node corresponding to the last node on each service path;
taking the last node as a new last node on each service path;
obtaining a second resource type consumed by the last node and the quantity of each second resource according to the first resource type consumed by the last node, the quantity of each first resource and the task service of the last node corresponding to the last node on each service path;
and when the basic resource type consumed by the starting node of each service path and the quantity of each basic resource are determined, obtaining the total quantity of the resources consumed by each service path.
5. The method according to claim 4, wherein obtaining the first resource type consumed by the last node and the amount of each first resource according to the amount of each target resource and the task service of the last node corresponding to the last node on each service path comprises:
determining a first target resource in the at least one target resource, wherein the first target resource is a target resource with the least quantity in the at least one target resource;
acquiring a first resource type consumed by a last node according to a task service of the last node corresponding to the last node, and determining a second target resource in the first resource consumed by the last node, wherein the second target resource is a resource which generates the most other resource types from the first resource consumed by the last node, and the other resources at least comprise the first target resource;
determining the quantity of the second target resource according to the quantity of the first target resource;
determining a new first target resource in the at least one target resource, wherein the new first target resource is the resource with the least quantity except the first target resource in the at least one target resource;
determining a new second target resource corresponding to the previous node, wherein the new second target resource is a resource which generates the most other resources except the second target resource from the first resource consumed by the previous node, and the other resources at least comprise the new first target resource;
and determining the quantity of each first resource consumed by the last node corresponding to the last node on each service path according to the new first target resource and the new second target resource.
6. The method according to claim 4 or 5, wherein the comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths includes: :
constructing a first feature vector according to the basic resource types consumed by each service path and the quantity of each basic resource;
constructing a second feature vector according to the basic resource types in the resource pool set corresponding to the target user and the quantity of each basic resource;
calculating the cosine similarity of each service path of the first eigenvector and the second eigenvector;
and determining according to the cosine similarity of each service path to obtain a target service path in the plurality of service paths.
7. The method of claim 1, wherein the target user is a virtual game character, the resource pool set corresponding to the target user includes game gold, an initial item, and an initial level of the virtual game character, the task service in the task service set is an upgrade rule of the virtual game character, and the expected revenue of the service includes the target level of the virtual game character;
selecting a plurality of task services reaching the service expected income from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the service expected income, wherein the steps of:
selecting a plurality of upgrading rules reaching the target level of the virtual game role from the task service set, and performing cross combination on the plurality of upgrading rules to obtain a plurality of service paths reaching the expected service income;
the analyzing the total amount of resources consumed by each traffic path includes:
and determining the game gold, the props and the initial level of the virtual game role consumed by each service path according to the target level of the target virtual game role and the upgrading rule corresponding to each service path.
8. A traffic path design apparatus, comprising:
the acquisition unit is used for acquiring a task service set, a resource pool set corresponding to a target user and expected service benefits;
the processing unit is used for selecting a plurality of task services reaching the service expected income from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the service expected income;
a comparing unit, configured to analyze a total amount of resources consumed by each service path, and compare the total amount of resources consumed by each service path with a resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths;
and the prompting unit is used for prompting the execution of the target service path so as to obtain the expected income of the service.
9. An electronic device comprising a processor, a memory, a communication interface, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the processor, the programs comprising instructions for performing the steps of the method of any of claims 1-7.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which is executed by a processor to implement the method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911115038.2A CN111221508B (en) | 2019-11-14 | 2019-11-14 | Service path design method, design device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911115038.2A CN111221508B (en) | 2019-11-14 | 2019-11-14 | Service path design method, design device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111221508A true CN111221508A (en) | 2020-06-02 |
| CN111221508B CN111221508B (en) | 2024-04-23 |
Family
ID=70827675
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911115038.2A Active CN111221508B (en) | 2019-11-14 | 2019-11-14 | Service path design method, design device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111221508B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112115171A (en) * | 2020-09-28 | 2020-12-22 | 广州华多网络科技有限公司 | Data aggregation method and device, terminal equipment and computer-readable storage medium |
| CN112418599A (en) * | 2020-10-15 | 2021-02-26 | 重庆市科学技术研究院 | Enterprise growth path planning method and system based on index set |
| CN113052496A (en) * | 2021-04-23 | 2021-06-29 | 深圳壹账通智能科技有限公司 | Method and device for generating business processing flow, electronic equipment and medium |
| CN115738245A (en) * | 2022-11-22 | 2023-03-07 | 乐元素科技(北京)股份有限公司 | Task processing method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060080175A1 (en) * | 2001-02-02 | 2006-04-13 | International Game Technology | Player scoring for customizing a game of chance on a gaming machine |
| US20100167816A1 (en) * | 2002-12-10 | 2010-07-01 | Perlman Stephen G | System and Method for Multi-Stream Video Compression |
| CN101808254A (en) * | 2010-02-12 | 2010-08-18 | 重庆邮电大学 | Static routing and wavelength allocation method based on layered graph |
| CN106339831A (en) * | 2015-07-09 | 2017-01-18 | 阿里巴巴集团控股有限公司 | Method and device for acquiring effective path for service |
| CN110311862A (en) * | 2019-06-14 | 2019-10-08 | 北京邮电大学 | A kind of service chaining mapping method and device |
-
2019
- 2019-11-14 CN CN201911115038.2A patent/CN111221508B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060080175A1 (en) * | 2001-02-02 | 2006-04-13 | International Game Technology | Player scoring for customizing a game of chance on a gaming machine |
| US20100167816A1 (en) * | 2002-12-10 | 2010-07-01 | Perlman Stephen G | System and Method for Multi-Stream Video Compression |
| CN101808254A (en) * | 2010-02-12 | 2010-08-18 | 重庆邮电大学 | Static routing and wavelength allocation method based on layered graph |
| CN106339831A (en) * | 2015-07-09 | 2017-01-18 | 阿里巴巴集团控股有限公司 | Method and device for acquiring effective path for service |
| CN110311862A (en) * | 2019-06-14 | 2019-10-08 | 北京邮电大学 | A kind of service chaining mapping method and device |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112115171A (en) * | 2020-09-28 | 2020-12-22 | 广州华多网络科技有限公司 | Data aggregation method and device, terminal equipment and computer-readable storage medium |
| WO2022062337A1 (en) * | 2020-09-28 | 2022-03-31 | 广州华多网络科技有限公司 | Method and device for data aggregation, terminal device, and computer-readable storage medium |
| CN112115171B (en) * | 2020-09-28 | 2023-11-21 | 广州华多网络科技有限公司 | Data aggregation method, device, terminal equipment and computer readable storage medium |
| CN112418599A (en) * | 2020-10-15 | 2021-02-26 | 重庆市科学技术研究院 | Enterprise growth path planning method and system based on index set |
| CN112418599B (en) * | 2020-10-15 | 2023-02-10 | 重庆市科学技术研究院 | Enterprise growth path planning method and system based on index set |
| CN113052496A (en) * | 2021-04-23 | 2021-06-29 | 深圳壹账通智能科技有限公司 | Method and device for generating business processing flow, electronic equipment and medium |
| CN115738245A (en) * | 2022-11-22 | 2023-03-07 | 乐元素科技(北京)股份有限公司 | Task processing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111221508B (en) | 2024-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111221508A (en) | Business path design method, design device, electronic device and storage medium | |
| Hirst | Discipline impact factors: A method for determining core journal lists | |
| US8924341B2 (en) | Method and system for optimizing mixed integer programming solutions | |
| US20180246962A1 (en) | Playlist list determining method and device, electronic apparatus, and storage medium | |
| CN109271518A (en) | Method and apparatus for carrying out classification display to micro-blog information | |
| CN105300398B (en) | The methods, devices and systems of gain location information | |
| Reese et al. | Frequency regularities of acoustic modes and multi-colour mode identification in rapidly rotating stars | |
| Dechter et al. | Generating random solutions for constraint satisfaction problems | |
| CN111949306B (en) | Pushing method and system supporting fragmented learning of open-source project | |
| CN107423396A (en) | It is a kind of that method is recommended based on the Mashup of function implication relation and cluster | |
| CN110782448A (en) | Rendered image evaluation method and device | |
| Wang et al. | Regional multi-armed bandits with partial informativeness | |
| Álvarez-Miranda et al. | Exact approaches for solving robust prize-collecting Steiner tree problems | |
| EP1469397A2 (en) | Modeling directed scale-free object relationships | |
| Czaplewski et al. | Classification accuracy for stratification with remotely sensed data | |
| KR100751276B1 (en) | System and method for supplying patent map be able to grasp correlation degree between data | |
| CN112989211B (en) | Method and system for determining information similarity | |
| CN112288397A (en) | Flow template configuration method, flow execution method and device and electronic equipment | |
| Snásel et al. | Analyzing social networks using FCA: complexity aspects | |
| CN107562727B (en) | Short text feature extension method based on Bayesian network | |
| CN103218458B (en) | Recommendation method and recommendation server | |
| CN110175283A (en) | A kind of generation method and device of recommended models | |
| Mougiakakou et al. | SCAPEVIEWER: preliminary results of a landscape perception classification system based on neural network technology | |
| Passolt et al. | A Voronoi tessellation based approach to generate hypothetical forest landscapes | |
| CN108415981B (en) | Data dimension generation method, device, equipment and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 40023554 Country of ref document: HK |
|
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |