Nothing Special   »   [go: up one dir, main page]

WO2020181858A1 - 资源转移方法、装置及存储介质 - Google Patents

资源转移方法、装置及存储介质 Download PDF

Info

Publication number
WO2020181858A1
WO2020181858A1 PCT/CN2019/125073 CN2019125073W WO2020181858A1 WO 2020181858 A1 WO2020181858 A1 WO 2020181858A1 CN 2019125073 W CN2019125073 W CN 2019125073W WO 2020181858 A1 WO2020181858 A1 WO 2020181858A1
Authority
WO
WIPO (PCT)
Prior art keywords
resource transfer
transfer path
compatible
paths
weight
Prior art date
Application number
PCT/CN2019/125073
Other languages
English (en)
French (fr)
Inventor
王谨平
杨崇灵
黄平财
周天冀
周骑
谢敏
王康
潘秋菊
杜柏松
王晓桐
刘爽
王东峰
张琦
Original Assignee
北京三快在线科技有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 北京三快在线科技有限公司 filed Critical 北京三快在线科技有限公司
Publication of WO2020181858A1 publication Critical patent/WO2020181858A1/zh

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/02Banking, e.g. interest calculation or account maintenance
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/08Payment architectures
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/08Payment architectures
    • G06Q20/085Payment architectures involving remote charge determination or related payment systems
    • G06Q20/0855Payment architectures involving remote charge determination or related payment systems involving a third party
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/08Payment architectures
    • G06Q20/10Payment architectures specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems

Definitions

  • This application relates to the field of data processing, in particular to a resource transfer method, device and storage medium.
  • the resource is the reserve fund of a third-party payment institution.
  • the third-party payment institution makes a withdrawal to the bank account through the corresponding reserve account .
  • the bank accounts corresponding to each reserve account are different, and different banks have different support for reserve funds. Taking into account factors such as improving the timeliness of payment, saving payment costs, and increasing the utilization rate of the reserve fund, it is necessary to adopt appropriate resource transfer methods to allocate funds in the reserve fund account.
  • the related technology selects the optimal resource transfer path set that satisfies the weight requirement from the resource transfer path set composed of multiple resource transfer paths through the cyclic violence allocation algorithm, and allocates funds according to the optimal resource transfer path set.
  • the optimal resource transfer path set that satisfies the weight requirement is selected from the resource transfer path set through the cyclic violence allocation algorithm, which takes a long time and affects the timeliness of allocation.
  • the embodiments of the present application provide a resource transfer method, device, and storage medium, which can solve the above technical problems.
  • the technical solutions are as follows:
  • an embodiment of the present application provides a resource transfer method, and the method includes:
  • the weight of the compatible set of each resource transfer path is sequentially obtained, and the compatible set of any resource transfer path is the set with the highest weight among the sets of mutually compatible paths, and
  • the paths that are compatible with each other are paths that do not overlap in time among the any resource transfer path and all resource transfer paths before the any resource transfer path;
  • the obtaining the weight of the compatible set of each resource transfer path based on the sorting result of the multiple resource transfer paths includes:
  • the method before the obtaining the weight of the first compatible set and the weight of the second compatible set of any resource transfer path based on the sorting result of the multiple resource transfer paths, the method further includes:
  • the method before the obtaining the weight of the first compatible set and the weight of the second compatible set of any resource transfer path based on the sorting result of the multiple resource transfer paths, the method further includes:
  • the second compatible set is acquired based on the start time and the end time of each resource transfer path in all resource transfer paths before any resource transfer path.
  • the transferring the target resource based on the target compatible set includes:
  • the target resource is transferred based on the start time and the end time of each resource transfer path in the target compatible set.
  • the method further includes:
  • the multiple resource transfer paths are sorted according to the sequence of the start time or the end time of each resource transfer path in the multiple resource transfer paths to obtain a sorting result of the multiple resource transfer paths.
  • an embodiment of the present application provides a resource transfer device, the device includes:
  • the first acquisition module is used to acquire multiple resource transfer paths of the target resource
  • the second acquisition module is configured to sequentially acquire the weight of the compatible set of each resource transfer path based on the sorting results of the multiple resource transfer paths, and the compatible set of any resource transfer path is a set of mutually compatible paths A set with the largest weight, the mutually compatible paths are paths that do not overlap with each other in time among all resource transfer paths before any resource transfer path and any resource transfer path;
  • the transfer module is configured to use the compatible set with the largest weight among the compatible sets of each resource transfer path as the target compatible set, and transfer the target resource based on the target compatible set.
  • the second acquisition module includes:
  • the first obtaining unit is configured to obtain the weight of the first compatible set and the weight of the second compatible set of any resource transfer path based on the sort results of the multiple resource transfer paths for any resource transfer path;
  • the second obtaining unit is configured to obtain the weight of the compatible set of any resource transfer path based on the weight of the first compatible set and the weight of the second compatible set according to the following formula;
  • the first The second acquisition module also includes:
  • the third acquiring unit is configured to acquire the start of each resource transfer path in any resource transfer path and all resource transfer paths before any resource transfer path based on the sorting result of the multiple resource transfer paths Time and end time;
  • the fourth obtaining unit is configured to obtain the start time and end time of each resource transfer path in any resource transfer path and all resource transfer paths before any resource transfer path, The first set of all resource transfer paths whose time does not overlap with each other;
  • the fifth acquiring unit is configured to acquire the third compatible set with the largest weight in the set composed of mutually compatible paths in the first set.
  • the first The second acquisition module also includes:
  • a sixth obtaining unit configured to obtain the start time and the end time of each resource transfer path in all resource transfer paths before any resource transfer path based on the sorting results of the multiple resource transfer paths;
  • the seventh obtaining unit is configured to obtain the second compatible set based on the start time and end time of each resource transfer path in all resource transfer paths before any resource transfer path.
  • the transfer module includes:
  • the first determining unit is configured to determine the start time and end time of each resource transfer path in the target compatible set
  • the transfer unit is configured to transfer the target resource based on the start time and the end time of each resource transfer path in the target compatible set.
  • the apparatus further includes:
  • the third acquisition module is configured to acquire the start time or the end time of each resource transfer path in the multiple resource transfer paths;
  • the fourth acquisition module is configured to sort the multiple resource transfer paths according to the sequence of the start time or the end time of each resource transfer path in the multiple resource transfer paths to obtain the multiple resource transfers The sort result of the path.
  • an embodiment of the present application provides a resource transfer device, the device includes a processor and a memory, and at least one instruction is stored in the memory, and the instruction is loaded and executed by the processor to achieve the above Any of the mentioned resource transfer methods.
  • an embodiment of the present application provides a computer-readable storage medium, in which at least one instruction is stored, and the at least one instruction is loaded and executed by a processor to implement any of the above-mentioned instructions.
  • the embodiments of the present application provide a computer program product, in which at least one piece of computer program is stored, and the at least one piece of computer program is loaded and executed by a processor to implement any of the above-mentioned The described resource transfer method.
  • the weight of the compatible set of each resource transfer path is obtained in turn, which can avoid processing incompatible sets, avoiding the same processing for any resource transfer path multiple times, and improving resources
  • the timeliness and accuracy of the transfer are not affected by the weighted resource transfer path, which expands the scope of application of this method.
  • Fig. 1 is a schematic diagram showing the flow of funds between a bank account and a moneybag bank account according to an exemplary embodiment
  • Fig. 2 is a schematic diagram showing an implementation environment according to an exemplary embodiment
  • Fig. 3 is a flow chart showing a method for resource transfer according to an exemplary embodiment
  • Fig. 4 is a schematic diagram showing a fund allocation model according to an exemplary embodiment
  • Fig. 5 is a schematic diagram showing fund allocation tasks after sorting according to an exemplary embodiment
  • Fig. 6 is a schematic diagram showing a target compatible set with the largest weight according to an exemplary embodiment
  • Fig. 7 is a schematic diagram showing a functional structure of a fund allocation service + payment + payment gateway according to an exemplary embodiment
  • Fig. 8 is a schematic structural diagram showing a resource transfer device according to an exemplary embodiment
  • Fig. 9 is a schematic structural diagram showing a second acquisition module according to an exemplary embodiment
  • Fig. 10 is a schematic structural diagram showing a second acquisition module according to an exemplary embodiment
  • Fig. 11 is a schematic structural diagram showing a second acquisition module according to an exemplary embodiment
  • Fig. 12 is a schematic structural diagram of a transfer module according to an exemplary embodiment
  • Fig. 13 is a schematic structural diagram showing a resource transfer device according to an exemplary embodiment
  • Fig. 14 is a schematic structural diagram of a terminal according to an exemplary embodiment
  • Fig. 15 is a schematic diagram showing the structure of a server according to an exemplary embodiment.
  • the resource is the reserve fund of a third-party payment institution.
  • Third-party payment institutions have a large number of collection and payment services, and the funds they receive can be used as reserve funds.
  • the third-party payment institution makes a withdrawal to the bank account through the corresponding reserve account.
  • the funds may circulate in multiple different banks.
  • Figure 1 shows a schematic diagram of the flow of funds between a bank account and a moneybag bank account.
  • the reserve fund account withdraws funds to the first depository account
  • a depository account withdraws money to an ACS (Accounting Data Centralized System) account
  • an ACS account makes a payment to the first payer and payer through a networked map or a networked account.
  • the reserve account makes a payment to the first depository account
  • the first depository account makes a payment to the first payer and payer through UnionPay.
  • the reserve fund account pays out to the first depository account, the first depository account pays out to the second depository account, and the second depository account to UnionPay internal account, the second receiving and paying account, and the third receiving and paying account , The fourth receiving and paying account or the third depository account withdrawing money.
  • ACS account, first depository account, second depository account, first receipt and payment account, second receipt and payment account, third receipt and payment account, fourth receipt and payment account, third depository account, etc. can all pass Other methods of deposit and withdrawal.
  • the second receiving and paying account, the third receiving and paying account, the third depository account, and the fourth receiving and paying account are through the transfer account A, the transfer account B, the transfer account C, and the transfer account respectively.
  • Account D makes a deposit.
  • Different banks have different time and expenses for capital circulation, and the utilization rate of reserve funds is also different.
  • the embodiment of the present application provides a resource transfer method to improve the payment timeliness, save the payment cost, improve the payment experience, and increase the utilization rate of the reserve fund.
  • Fig. 2 is a schematic diagram showing an implementation environment according to an exemplary embodiment. As shown in Fig. 2, the implementation environment includes: at least one terminal 21 and a server 22. The terminal 21 can communicate with the server 22, and at least one terminal 21 passes through The server 22 implements information exchange.
  • the terminal 21 may be any electronic product that can interact with the user through one or more methods such as a keyboard, a touchpad, a touch screen, a remote control, voice interaction, or a handwriting device, such as a PC (Personal Computer, personal computer). Computers), mobile phones, smart phones, PDAs (Personal Digital Assistants), wearable devices, Pocket PCs (Pocket PCs), tablets, etc.
  • PC Personal Computer, personal computer.
  • Computers Personal Computers
  • mobile phones smart phones
  • PDAs Personal Digital Assistants
  • wearable devices wearable devices
  • Pocket PCs Personal PCs
  • tablets etc.
  • the server 22 may be a server, a server cluster composed of multiple servers, or a cloud computing service center.
  • terminal 21 and server 22 are only examples, and other existing or future terminals or servers that are applicable to this application should also be included in the scope of protection of this application, and are used here as The citation method is included here.
  • Fig. 3 is a resource transfer method provided according to an exemplary embodiment, and the method can be applied to a terminal or a server in the foregoing implementation environment. As shown in Figure 3, the method includes:
  • Step 31 Obtain multiple resource transfer paths of the target resource.
  • the terminal or the server obtains multiple resource transfer paths between the start time and the end time of the target resource transfer as the multiple resource transfer paths of the target resource.
  • the target resource can be any resource that needs to be transferred, for example, a resource that needs to be transferred in a collection business, a resource that needs to be transferred in a payment business, etc.
  • the content of the target resource is not limited in this application.
  • the transfer of different resources has different start time and end time.
  • the terminal or server After analyzing the target resource, the terminal or server obtains the start time and end time of the target resource transfer. Further, according to the start time and the end time of the target resource transfer, directly collect the stored multiple resource transfer paths between the start time and the end time of the target resource transfer, or collect the target resource transfer in other devices. Multiple resource transfer paths between the start time and end time.
  • the target resources are transferred according to the set of resource transfer paths.
  • the resource transfer path can be understood as the transfer of resources from one location to another.
  • step 31 the method provided in this embodiment of the present application further includes:
  • Step a Obtain the start time or the end time of each resource transfer path in the multiple resource transfer paths.
  • the terminal or server can obtain the start time, end time and weight of each resource transfer path, and then build a database or resource transfer model that includes multiple resource transfer paths according to the start time, end time and weight of each resource transfer path .
  • the terminal or server obtains the start time or the end time of each resource transfer path later, it can directly obtain it according to the resource transfer model.
  • the start time of the resource transfer path refers to the time when the upstream position in each resource transfer path receives resources.
  • the termination time of the resource transfer path refers to the time when the downstream location in each resource transfer path receives resources.
  • upstream and downstream are both defined based on the direction of circulation of resources.
  • Weight refers to how important a factor or indicator is to the target resource.
  • the method for obtaining the weight may be: analyzing the target resource, determining an influencing scheduling index, and converting the scheduling index into the weight of the target resource.
  • scheduling indicators include but are not limited to: time, cost, and resource utilization.
  • the "resource transfer path” is equivalent to the "fund allocation path”.
  • Figure 4 shows the fund allocation model, which uses time as the horizontal axis and rectangle as the fund allocation path. From top to bottom, it is fund allocation path a, fund allocation path b, fund allocation path c, fund allocation path d, fund allocation path e.
  • the length between the start time and the end time of the resource transfer path is the length of the rectangle.
  • Each account and each account can be regarded as a resource transfer path, and the collection of transfer paths between multiple accounts can be regarded as a resource transfer path collection.
  • Step b Sort the multiple resource transfer paths according to the sequence of the start time or the end time of each resource transfer path in the multiple resource transfer paths to obtain the sorting result of the multiple resource transfer paths.
  • Scenario 1 When the weight of each resource transfer path is the same, it can be sorted according to the sequence of the start time or the end time of each resource transfer path.
  • Scenario 2 When the weight of each resource transfer path is not the same, that is, with weight, it can be sorted according to the order of the termination time of each resource transfer path, so as to be able to accurately determine the difference between any two resource transfer paths Whether there is overlap. For example, some resource transfer paths are weighted as timeliness, and some resource transfer paths are weighted as costs.
  • FIG. 5 it is a schematic diagram of a fund allocation model in which multiple fund allocation paths are sorted in the order of termination time.
  • the multiple fund allocation paths are as follows in the order of termination time: fund allocation path 1, fund allocation path 2, fund allocation path 3, fund allocation path 4, fund allocation path 5, fund allocation path 6, fund allocation path 7, capital Allocation path 8.
  • Step 32 Based on the sorting results of multiple resource transfer paths, obtain the weight of the compatible set of each resource transfer path in turn.
  • the compatible set of any resource transfer path is the set with the highest weight among the sets of mutually compatible paths.
  • a compatible path is a path that does not overlap in time among any resource transfer path and all resource transfer paths before any resource transfer path.
  • the "resource transfer path” can be abbreviated as "path”.
  • Compatibility means that the time of the path does not overlap with each other.
  • the weight of the compatible set refers to the sum of the weights of each path in the compatible set.
  • Time non-overlapping means that the end time of one resource transfer path is less than or equal to the start time of another resource transfer path.
  • the end time of the fund allocation path 1 is less than the start time of the fund allocation path 6, and the time of the fund allocation path 1 and the fund allocation path 6 do not overlap each other.
  • the end time of fund allocation path 1 is equal to the start time of fund allocation path 4, and the end time of fund allocation path 4 is less than the start time of fund allocation path 8, then fund allocation path 1, fund allocation path 4, and fund allocation path 8 The time does not overlap each other.
  • step 32 includes but is not limited to the following sub-steps:
  • Step 321 For any resource transfer path, based on the sorting results of the multiple resource transfer paths, obtain the weight of the first compatible set and the weight of the second compatible set of any resource transfer path.
  • the first compatible set includes: any resource transfer path and the third compatible set
  • the third compatible set includes the set with the largest weight among the set of mutually compatible paths in the first set
  • the first set includes any resource transfer A set of all resource transfer path combinations before the path and that does not overlap with any resource transfer path in time
  • the second compatible set includes: a compatible set of resource transfer paths before any resource transfer path.
  • step 32 further includes:
  • Step 32a Based on the sorting results of multiple resource transfer paths, obtain the start time and end time of each resource transfer path in any resource transfer path and all resource transfer paths before any resource transfer path.
  • the terminal or server can obtain any resource transfer path and the start time and end time of each resource transfer path in all resource transfer paths before any resource transfer path according to the resource transfer model.
  • Step 32b Obtain all resources that do not overlap with the time of any resource transfer path based on any resource transfer path and the start time and end time of each resource transfer path in all resource transfer paths before any resource transfer path The first set of transfer paths.
  • the terminal or the server can obtain the start time and end time of each resource transfer path in any resource transfer path and all resource transfer paths before any resource transfer path, and obtain that it is located before any resource transfer path and is transferred to any resource.
  • the first set is the set of all resource transfer paths whose paths do not overlap each other in time.
  • capital allocation paths that do not overlap with capital allocation path 8 include: capital allocation path 5, capital allocation path 4, capital allocation path 3, capital allocation path 2, capital allocation path 1, then
  • the first set of fund allocation path 8 can be ⁇ 1,2,3,4,5 ⁇ .
  • Step 32c Obtain the third compatible set with the largest weight in the set composed of mutually compatible paths in the first set.
  • step 32 further includes:
  • Step 32A Based on the sorting results of multiple resource transfer paths, obtain the start time and end time of each resource transfer path in all resource transfer paths before any resource transfer path.
  • step 32A The execution method of step 32A is similar to step 32a, and will not be repeated here.
  • Step 32B Obtain a second compatible set based on the start time and end time of each resource transfer path in all resource transfer paths before any resource transfer path.
  • the second compatible set is a compatible set of resource transfer paths before any resource transfer path.
  • Step 322 Obtain the weight of the compatible set of any resource transfer path based on the weight of the first compatible set and the weight of the second compatible set according to the following formula;
  • the third compatible set includes: resource transfer paths 1, 2 ,..., j-1 is the set with the largest weight among the sets of paths that are compatible with each other and the j-th resource transfer path; ⁇ j +OPT(P(j)) is the weight of the first compatible set; OPT (j-1) is the weight of the second compatible set.
  • the second compatible set includes: the set with the largest weight among the set of mutually compatible paths among resource transfer paths 1, 2, ..., j-1; OPT(j ) Is the weight of the compatible set of the jth resource transfer path.
  • Scenario 1 If the jth resource transfer path is selected, these resource transfer paths ⁇ p(i)+1, p(i)+2,... ⁇ are not used, and the compatible set of the jth resource transfer path is contained in ⁇ 1, 2, ..., p(i), j ⁇ .
  • the compatible set of fund allocation path 6 is contained in ⁇ 1, 2, ..., p(i), j ⁇ .
  • Scenario 2 If the j-th resource transfer path is not selected, the compatible set of the j-th resource transfer path is included in ⁇ 1, 2, ..., j-1 ⁇ .
  • the weight ⁇ j +OPT(P(j)) of the first compatible set is greater than the weight OPT(j-1) of the second compatible set, the weight ⁇ j +OPT(P( j)) is the weight of the compatible set of any resource transfer path, and the first compatible set is the compatible set of any resource transfer path.
  • the weight OPT(j-1) of the second compatible set is any resource transfer path
  • the weight of the compatible set, the second compatible set is the compatible set of any resource transfer path.
  • multiple paths do not overlap with each other. After multiple paths are sorted in chronological order, a continuous total resource transfer path can be formed, or multiple intermittent paths can be realized. Resources can be transferred.
  • Step 33 Use the compatible set with the largest weight among the compatible sets of each resource transfer path as the target compatible set, and transfer the target resource based on the target compatible set.
  • the terminal or server obtains the compatible set of any resource transfer path according to step 32, its weight is stored at the same time, so as to facilitate the later efficient acquisition of the target compatible set with the largest weight.
  • the terminal and server gradually obtain the compatible set of fund allocation path 8 based on step 32, and store its weight:
  • the set ⁇ 1,4,8 ⁇ formed by path 1, fund allocation path 4, and fund allocation path 8 is a compatible set of fund allocation path 8.
  • the weight of the compatible set of the fund allocation path 8 is the largest among the compatible sets of the respective fund allocation paths.
  • the compatible set of the fund allocation path 8 is taken as the target compatible set, and the weight of the target compatible set is ⁇ 1 + ⁇ 4 + ⁇ 8 .
  • transferring the target resource based on the target compatible set includes but not limited to the following sub-steps:
  • Step 331 Determine the start time and end time of each resource transfer path in the target compatible set.
  • the terminal or server When the terminal or server obtains the weight of the compatibility set of any resource transfer path, it also stores the corresponding first compatibility set or the second compatibility set. After determining the target compatibility set, the corresponding first compatibility set or The start time and end time of each resource transfer path in the second compatible set.
  • Step 332 Transfer the target resource based on the start time and end time of each resource transfer path in the target compatible set.
  • the terminal or server executes all resource transfer paths in the order of time according to the start time and end time of each resource transfer path in the target compatible set to realize the transfer of the target resource.
  • the resource transfer method provided by the embodiment of the present application obtains the weight of the compatible set of each resource transfer path in turn based on the sorting results of multiple resource transfer paths, which can avoid processing incompatible sets and avoid any resource transfer path Performing the same processing multiple times improves the timeliness and accuracy of resource transfer, and is not affected by the weighted resource transfer path, expanding the scope of application of the method.
  • the target resource can be accurately transferred based on the target compatible set, which improves the utilization rate of the target resource.
  • the search time complexity of the circular brute force allocation algorithm provided by the related technology is O(n*n), and the time complexity of the resource transfer method provided in the embodiment of the present application is O(n*logn). If the initial sequence of the multiple resource transfer paths corresponding to the target resource transfer is the sequence sorted according to the termination time, the time complexity can be reduced to O(n), the time complexity of this method is low, and the target resource transfer can be improved Timeliness and accuracy.
  • the greedy scheduling algorithm provided by related technologies can obtain the set of optimal resource transfer paths, but in the weighted resource transfer path (the weights of multiple resource transfer tasks are different), the optimal resource transfer path cannot be obtained.
  • the collection of optimal resource transfer paths leads to the inability to achieve optimal resource utilization.
  • the resource transfer method provided by the embodiments of the present application is not affected by weighted resource transfer paths, and can obtain an optimal set of compatible resource transfer paths, thereby achieving optimal resource utilization.
  • FIG. 7 shows a schematic diagram of the functional architecture of a fund allocation service + payment + payment gateway.
  • the fund allocation business includes: Allocation Engine (Allocation The engine includes: order management, transaction distribution, order query), allocation timing tasks, allocation rule configuration, allocation monitoring, basic account information (basic account information includes: ACS, First NetPay, First UnionPay, First Bank, Second Bank, third bank, fourth bank, second UnionPay, fifth bank), other businesses (other businesses include: food delivery, smart payment, etc.).
  • Payment includes payment products and payment core. Among them, payment products include: payment, cash withdrawal, card verification, refund, card verification, and fund transfer.
  • Payment core includes: payment transaction engine (payment transaction engine includes: order management, transaction distribution, order query, etc.), list configuration (list configuration includes: acceptance blacklist), CALLER (visitor) information (CALLER information includes: cash withdrawal, card verification , Payment on behalf, refund, fund transfer, etc.), payment monitoring.
  • Payment gateway includes: gateway engine (gateway engine includes: order management, order query, transaction distribution, bill query), payment routing, channel queue management, channel capacity configuration, bank merchant account, gateway monitoring, bank channel (bank channel includes: One Net Union All Channels and First UnionPay. Among them, Net Union All Channels include: UnionPay First Super Net, UnionPay First All Channel, First Bank Super Net, Second Net Union All Channel, Third UnionPay, etc.
  • the first UnionPay includes: the first UnionPay large amount, the second UnionPay small amount, the size of a certain bank, the first bank counterpart, the second bank counterpart, the third bank counterpart, etc.).
  • Fig. 8 is a schematic structural diagram of a resource transfer device according to an exemplary embodiment. As shown in Fig. 8, the device includes:
  • the first obtaining module 81 is configured to obtain multiple resource transfer paths of the target resource.
  • the second acquiring module 82 is configured to sequentially acquire the weight of the compatible set of each resource transfer path based on the sorting results of multiple resource transfer paths, and the compatible set of any resource transfer path is the weight of the set composed of mutually compatible paths
  • the largest set of mutually compatible paths is any resource transfer path and all resource transfer paths before any resource transfer path that do not overlap each other in time.
  • the transfer module 83 is configured to use the compatible set with the largest weight among the compatible sets of each resource transfer path as the target compatible set, and transfer the target resource based on the target compatible set.
  • the second obtaining module 82 includes:
  • the first obtaining unit 91 is configured to obtain the weight of the first compatible set and the weight of the second compatible set of any resource transfer path based on the sorting results of multiple resource transfer paths for any resource transfer path.
  • the second obtaining unit 92 is configured to obtain the weight of the compatible set of any resource transfer path based on the weight of the first compatible set and the weight of the second compatible set according to the following formula;
  • the third compatible set includes: resource transfer paths 1, 2 ,..., j-1 is the set with the largest weight among the sets of paths that are compatible with each other and the j-th resource transfer path; ⁇ j +OPT(P(j)) is the weight of the first compatible set; OPT (j-1) is the weight of the second compatible set.
  • the second compatible set includes: the set with the largest weight among the set of mutually compatible paths among resource transfer paths 1, 2, ..., j-1; OPT(j ) Is the weight of the compatible set of the jth resource transfer path.
  • the first obtaining unit 91 executes the sorting result based on multiple resource transfer paths to obtain the weight of the first compatible set and the weight of the second compatible set of any resource transfer path before the second
  • the obtaining module 82 also includes:
  • the third obtaining unit 101 is configured to obtain the start time and end time of each resource transfer path in any resource transfer path and all resource transfer paths before any resource transfer path based on the sorting results of multiple resource transfer paths.
  • the fourth acquiring unit 102 is configured to acquire the time difference between any resource transfer path and the start time and end time of each resource transfer path in all resource transfer paths before any resource transfer path.
  • the fifth acquiring unit 103 is configured to acquire the third compatible set with the largest weight in the set composed of mutually compatible paths in the first set.
  • the first obtaining unit 91 executes the sorting result based on multiple resource transfer paths to obtain the weight of the first compatible set and the weight of the second compatible set of any resource transfer path, before the second
  • the obtaining module 82 also includes:
  • the sixth obtaining unit 111 is configured to obtain the start time and the end time of each resource transfer path in all resource transfer paths before any resource transfer path based on the sorting results of multiple resource transfer paths;
  • the seventh obtaining unit 112 is configured to obtain a second compatible set based on the start time and end time of each resource transfer path in all resource transfer paths before any resource transfer path.
  • the transfer module 83 includes:
  • the first determining unit 121 is configured to determine the start time and end time of each resource transfer path in the target compatible set.
  • the transfer unit 122 is configured to transfer the target resource based on the start time and the end time of each resource transfer path in the target compatible set.
  • the apparatus provided in the embodiment of the present application further includes:
  • the third acquiring module 131 is configured to acquire the start time or the end time of each resource transfer path in the multiple resource transfer paths.
  • the fourth acquisition module 132 is configured to sort the multiple resource transfer paths according to the sequence of the start time or the end time of each resource transfer path in the multiple resource transfer paths to obtain the sorting result of the multiple resource transfer paths.
  • the resource transfer device obtained by the embodiment of the present application obtains the weight of the compatible set of each resource transfer path in turn by sorting results based on multiple resource transfer paths, which can avoid processing incompatible sets and avoiding any resource transfer
  • the path undergoes the same processing multiple times, which improves the timeliness and accuracy of resource transfer, and is not affected by the weighted resource transfer path, which expands the scope of application of the method.
  • the target resource can be accurately transferred based on the target compatible set, which improves the utilization rate of the target resource.
  • FIG. 14 it shows a schematic structural diagram of a terminal 1400 of a resource transfer method provided by an embodiment of the present application.
  • the terminal 1400 may be a portable mobile terminal, such as a smart phone, a tablet computer, an MP3 player (Moving Picture Experts Group Audio Layer III, dynamic image expert compression standard audio layer 3), MP4 (Moving Picture Experts Group Audio Layer IV, dynamic Video experts compress the standard audio level 4) Player, laptop or desktop computer.
  • the terminal 1400 may also be called user equipment, portable terminal, laptop terminal, desktop terminal and other names.
  • the terminal 1400 includes a processor 1401 and a memory 1402.
  • the processor 1401 may include one or more processing cores, such as a 4-core processor, a 7-core processor, and so on.
  • the processor 1401 may adopt at least one hardware form among DSP (Digital Signal Processing), FPGA (Field-Programmable Gate Array), and PLA (Programmable Logic Array, Programmable Logic Array). achieve.
  • the processor 1401 may also include a main processor and a coprocessor.
  • the main processor is a processor used to process data in the wake state, also called a CPU (Central Processing Unit, central processing unit); the coprocessor is A low-power processor used to process data in the standby state.
  • the processor 1401 may be integrated with a GPU (Graphics Processing Unit, image processor), and the GPU is used to render and draw content that needs to be displayed on the display screen.
  • the processor 1401 may further include an AI (Artificial Intelligence) processor, which is used to process computing operations related to machine learning.
  • AI Artificial Intelligence
  • the memory 1402 may include one or more computer-readable storage media, which may be non-transitory.
  • the memory 1402 may also include high-speed random access memory and non-volatile memory, such as one or more magnetic disk storage devices and flash memory storage devices.
  • the non-transitory computer-readable storage medium in the memory 1402 is used to store at least one instruction, and the at least one instruction is used to be executed by the processor 1401 to implement the resource transfer provided in the method embodiment of the present application. method.
  • the terminal 1400 optionally further includes: a peripheral device interface 1403 and at least one peripheral device.
  • the processor 1401, the memory 1402, and the peripheral device interface 1403 may be connected by a bus or a signal line.
  • Each peripheral device can be connected to the peripheral device interface 1403 through a bus, a signal line, or a circuit board.
  • the peripheral device includes: at least one of a radio frequency circuit 1404, a display screen 1405, a camera 1406, an audio circuit 1407, a positioning component 1408, and a power supply 1409.
  • the peripheral device interface 1403 may be used to connect at least one peripheral device related to I/O (Input/Output) to the processor 1401 and the memory 1402.
  • the processor 1401, the memory 1402, and the peripheral device interface 1403 are integrated on the same chip or circuit board; in some other embodiments, any one of the processor 1401, the memory 1402, and the peripheral device interface 1403 or The two can be implemented on separate chips or circuit boards, which are not limited in this embodiment.
  • the radio frequency circuit 1404 is used for receiving and transmitting RF (Radio Frequency, radio frequency) signals, also called electromagnetic signals.
  • the radio frequency circuit 1404 communicates with a communication network and other communication devices through electromagnetic signals.
  • the radio frequency circuit 1404 converts electrical signals into electromagnetic signals for transmission, or converts received electromagnetic signals into electrical signals.
  • the radio frequency circuit 1404 includes: an antenna system, an RF transceiver, one or more amplifiers, a tuner, an oscillator, a digital signal processor, a codec chipset, a user identity module card, and so on.
  • the radio frequency circuit 1404 can communicate with other terminals through at least one wireless communication protocol.
  • the wireless communication protocol includes but is not limited to: metropolitan area network, various generations of mobile communication networks (2G, 3G, 4G, and 5G), wireless local area network and/or WiFi (Wireless Fidelity, wireless fidelity) network.
  • the radio frequency circuit 1404 may also include NFC (Near Field Communication) related circuits, which is not limited in this application.
  • the display screen 1405 is used for displaying UI (User Interface).
  • the UI can include graphics, text, icons, videos, and any combination thereof.
  • the display screen 1405 also has the ability to collect touch signals on or above the surface of the display screen 1405.
  • the touch signal may be input to the processor 1401 as a control signal for processing.
  • the display screen 1405 may also be used to provide virtual buttons and/or virtual keyboards, also called soft buttons and/or soft keyboards.
  • the display screen 1405 may be one display screen 1405, which is provided with the front panel of the terminal 1400; in other embodiments, there may be at least two display screens 1405, which are respectively arranged on different surfaces of the terminal 1400 or in a folded design; In still other embodiments, the display screen 1405 may be a flexible display screen, which is disposed on the curved surface or the folding surface of the terminal 1400. Moreover, the display screen 1405 can also be set as a non-rectangular irregular pattern, that is, a special-shaped screen.
  • the display screen 1405 may be made of materials such as LCD (Liquid Crystal Display), OLED (Organic Light-Emitting Diode, organic light-emitting diode).
  • the camera assembly 1406 is used to capture images or videos.
  • the camera assembly 1406 includes a front camera and a rear camera.
  • the front camera is set on the front panel of the terminal, and the rear camera is set on the back of the terminal.
  • the camera assembly 1406 may also include a flash.
  • the flash can be a single-color flash or a dual-color flash. Dual color temperature flash refers to a combination of warm light flash and cold light flash, which can be used for light compensation under different color temperatures.
  • the audio circuit 1407 may include a microphone and a speaker.
  • the microphone is used to collect sound waves of the user and the environment, and convert the sound waves into electrical signals and input them to the processor 1401 for processing, or input to the radio frequency circuit 1404 to implement voice communication. For the purpose of stereo collection or noise reduction, there may be multiple microphones, which are respectively set in different parts of the terminal 1400.
  • the microphone can also be an array microphone or an omnidirectional acquisition microphone.
  • the speaker is used to convert the electrical signal from the processor 1401 or the radio frequency circuit 1404 into sound waves.
  • the speaker can be a traditional membrane speaker or a piezoelectric ceramic speaker.
  • the speaker When the speaker is a piezoelectric ceramic speaker, it can not only convert the electrical signal into human audible sound waves, but also convert the electrical signal into human inaudible sound waves for purposes such as distance measurement.
  • the audio circuit 1407 may also include a headphone jack.
  • the positioning component 1408 is used to locate the current geographic location of the terminal 1400 to implement navigation or LBS (Location Based Service, location-based service).
  • the positioning component 1408 may be a positioning component based on the GPS (Global Positioning System, Global Positioning System) of the United States, the Beidou system of China, the Granus system of Russia, or the Galileo system of the European Union.
  • the power supply 1409 is used to supply power to various components in the terminal 1400.
  • the power source 1409 may be alternating current, direct current, disposable batteries, or rechargeable batteries.
  • the rechargeable battery may support wired charging or wireless charging.
  • the rechargeable battery can also be used to support fast charging technology.
  • the terminal 1400 further includes one or more sensors 1410.
  • the one or more sensors 1410 include, but are not limited to: an acceleration sensor 1411, a gyroscope sensor 1412, a pressure sensor 1413, a fingerprint sensor 1414, an optical sensor 1415, and a proximity sensor 1416.
  • the acceleration sensor 1411 can detect the magnitude of acceleration on the three coordinate axes of the coordinate system established by the terminal 1400.
  • the acceleration sensor 1411 can be used to detect the components of the gravitational acceleration on three coordinate axes.
  • the processor 1401 may control the display screen 1405 to display the user interface in a horizontal view or a vertical view according to the gravity acceleration signal collected by the acceleration sensor 1411.
  • the acceleration sensor 1411 may also be used for the collection of game or user motion data.
  • the gyroscope sensor 1412 can detect the body direction and rotation angle of the terminal 1400, and the gyroscope sensor 1412 can cooperate with the acceleration sensor 1411 to collect the user's 3D actions on the terminal 1400. Based on the data collected by the gyroscope sensor 1412, the processor 1401 can implement the following functions: motion sensing (such as changing the UI according to the user's tilt operation), image stabilization during shooting, game control, and inertial navigation.
  • the pressure sensor 1413 may be arranged on the side frame of the terminal 1400 and/or the lower layer of the display screen 1405.
  • the processor 1401 performs left and right hand recognition or quick operation according to the holding signal collected by the pressure sensor 1413.
  • the processor 1401 operates according to the user's pressure on the display screen 1405 to control the operability controls on the UI interface.
  • the operability control includes at least one of a button control, a scroll bar control, an icon control, and a menu control.
  • the fingerprint sensor 1414 is used to collect the user's fingerprint.
  • the processor 1401 identifies the user's identity according to the fingerprint collected by the fingerprint sensor 1414, or the fingerprint sensor 1414 identifies the user's identity according to the collected fingerprint.
  • the processor 1401 authorizes the user to perform related sensitive operations, including unlocking the screen, viewing encrypted information, downloading software, paying, and changing settings.
  • the fingerprint sensor 1414 may be provided on the front, back or side of the terminal 1400. When a physical button or a manufacturer logo is provided on the terminal 1400, the fingerprint sensor 1414 can be integrated with the physical button or the manufacturer logo.
  • the optical sensor 1415 is used to collect the ambient light intensity.
  • the processor 1401 may control the display brightness of the display screen 1405 according to the ambient light intensity collected by the optical sensor 1415. Specifically, when the ambient light intensity is high, the display brightness of the display screen 1405 is increased; when the ambient light intensity is low, the display brightness of the display screen 1405 is decreased.
  • the processor 1401 may also dynamically adjust the shooting parameters of the camera assembly 1406 according to the ambient light intensity collected by the optical sensor 1415.
  • the proximity sensor 1416 also called a distance sensor, is usually arranged on the front panel of the terminal 1400.
  • the proximity sensor 1416 is used to collect the distance between the user and the front of the terminal 1400.
  • the processor 1401 controls the display screen 1405 to switch from the on-screen state to the off-screen state; when the proximity sensor 1416 detects When the distance between the user and the front of the terminal 1400 gradually increases, the processor 1401 controls the display screen 1405 to switch from the rest screen state to the bright screen state.
  • FIG. 14 does not constitute a limitation on the terminal 1400, and may include more or fewer components than shown, or combine certain components, or adopt different component arrangements.
  • the server 1500 may have relatively large differences due to different configurations or performances, and may include one or more processors (central processing units, CPU) 1501 and one Or more than one memory 1502, where at least one instruction is stored in the memory 1502, and the at least one instruction is loaded and executed by the processor 1501 to implement the resource transfer methods provided by the foregoing method embodiments.
  • the server may also have components such as a wired or wireless network interface, a keyboard, an input and output interface for input and output, and the server may also include other components for implementing device functions, which are not described here.
  • a computer device in the illustrated embodiment, includes a processor and a memory, and at least one instruction is stored in the memory. At least one instruction is configured to be executed by one or more processors to implement any one of the aforementioned resource transfer methods.
  • a computer-readable storage medium is further provided, and at least one instruction is stored in the storage medium, and the at least one instruction implements any of the foregoing resource transfer methods when executed by a processor of a computer device.
  • the foregoing computer-readable storage medium may be a read only memory (Read Only Memory, ROM), a random access memory (Random Access Memory, RAM), and a CD-ROM (Compact-Disc Read Only Memory, CD-ROM). , Magnetic tapes, floppy disks and optical data storage devices.
  • ROM Read Only Memory
  • RAM Random Access Memory
  • CD-ROM Compact-Disc Read Only Memory

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Technology Law (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

一种资源转移方法、装置及存储介质,属于数据处理领域。该方法包括:获取目标资源的多个资源转移路径(31);基于多个资源转移路径的排序结果,依次获取每个资源转移路径的兼容集合的权重(32),任一资源转移路径的兼容集合为相互兼容的路径所组成的集合中权重最大的集合,相互兼容的路径为任一资源转移路径及任一资源转移路径之前的所有资源转移路径中时间不相互重叠的路径;将各个资源转移路径的兼容集合中权重最大的兼容集合作为目标兼容集合,基于目标兼容集合对目标资源进行转移(33)。该方法能够高效、准确地对带权重资源进行转移,提高了资源利用率。

Description

资源转移方法、装置及存储介质
本申请要求于2019年03月13日提交的申请号为201910190728.8、发明名称为“资源转移方法、装置及存储介质”的中国专利申请的优先权,其全部内容通过引用结合在本申请中。
技术领域
本申请涉及数据处理领域,特别涉及一种资源转移方法、装置及存储介质。
背景技术
资源转移方法对于资源转移的效率、费用、资源的利用率具有重要的影响。举例来说,资源为第三方支付机构的备付金,用户通过第三方支付机构进行提现、代付、结算等付款操作时,第三方支付机构通过对应的备付金账户向银行账户进行出款。然而,各个备付金账户对应的银行账户不尽相同,不同银行对备付金的支持情况不同。考虑到能够提高打款时效,节省打款费用,提高备付金的利用率等因素,有必要采用合适的资源转移方法对备付金账户中的资金进行调拨。
相关技术通过循环暴力调拨算法从多个资源转移路径构成的资源转移路径集合中筛选出满足权重要求的最优资源转移路径集合,根据最优资源转移路径集合对资金进行调拨。
但是,通过循环暴力调拨算法从资源转移路径集合中筛选出满足权重要求的最优资源转移路径集合,耗时长,影响调拨时效。
发明内容
本申请实施例提供了一种资源转移方法、装置及存储介质,可解决上述技术问题。技术方案如下:
一方面,本申请实施例提供了一种资源转移方法,所述方法包括:
获取目标资源的多个资源转移路径;
基于所述多个资源转移路径的排序结果,依次获取每个资源转移路径的兼容集合的权重,任一资源转移路径的兼容集合为相互兼容的路径所组成的集合中权重最大的集合,所述相互兼容的路径为所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中时间不相互重叠的路径;
将各个资源转移路径的兼容集合中权重最大的兼容集合作为目标兼容集合,基于所述目标兼容集合对所述目标资源进行转移。
可选地,所述基于所述多个资源转移路径的排序结果,获取每个资源转移路径的兼容集合的权重,包括:
对于任一资源转移路径,基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重;
基于所述第一兼容集合的权重、所述第二兼容集合的权重按照下述公式获取所述任一资源转移路径的兼容集合的权重;
Figure PCTCN2019125073-appb-000001
其中,j为第j个资源转移路径;ν j为所述第j个资源转移路径的权重;OPT(P(j))为第三兼容集合的权重,所述第三兼容集合包括:资源转移路径1、2、……、j-1中相互兼容且与所述第j个资源转移路径兼容的路径所组成的集合中权重最大的集合;ν j+OPT(P(j))为 所述第一兼容集合的权重;OPT(j-1)为所述第二兼容集合的权重,所述第二兼容集合包括:资源转移路径1、2、……、j-1中相互兼容的路径所组成的集合中权重最大的集合;OPT(j)为所述第j个资源转移路径的兼容集合的权重。
可选地,所述基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重之前,还包括:
基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间;
基于所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取与所述任一资源转移路径的时间不相互重叠的所有资源转移路径的第一集合;
获取所述第一集合中相互兼容的路径所组成的集合中权重最大的所述第三兼容集合。
可选地,所述基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重之前,还包括:
基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间;
基于所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取所述第二兼容集合。
可选地,所述基于所述目标兼容集合对所述目标资源进行转移,包括:
确定所述目标兼容集合中每个资源转移路径的起始时间和终止时间;
基于所述目标兼容集合中每个资源转移路径的起始时间和终止时间,对所述目标资源进行转移。
可选地,所述获取目标资源的多个资源转移路径之后,还包括:
获取所述多个资源转移路径中每个资源转移路径的起始时间或终止时间;
按照所述多个资源转移路径中每个资源转移路径的起始时间或终止时间的先后顺序,对所述多个资源转移路径进行排序,得到所述多个资源转移路径的排序结果。
另一方面,本申请实施例提供了一种资源转移装置,所述装置包括:
第一获取模块,用于获取目标资源的多个资源转移路径;
第二获取模块,用于基于所述多个资源转移路径的排序结果,依次获取每个资源转移路径的兼容集合的权重,任一资源转移路径的兼容集合为相互兼容的路径所组成的集合中权重最大的集合,所述相互兼容的路径为所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中时间不相互重叠的路径;
转移模块,用于将各个资源转移路径的兼容集合中权重最大的兼容集合作为目标兼容集合,基于所述目标兼容集合对所述目标资源进行转移。
可选地,所述第二获取模块,包括:
第一获取单元,用于对于任一资源转移路径,基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重;
第二获取单元,用于基于所述第一兼容集合的权重、所述第二兼容集合的权重按照下述公式获取所述任一资源转移路径的兼容集合的权重;
Figure PCTCN2019125073-appb-000002
其中,j为第j个资源转移路径;ν j为所述第j个资源转移路径的权重;OPT(P(j))为第三兼容集合的权重,所述第三兼容集合包括:资源转移路径1、2、……、j-1中相互兼容且与所述第j个资源转移路径兼容的路径所组成的集合中权重最大的集合;ν j+OPT(P(j))为所述第一兼容集合的权重;OPT(j-1)为所述第二兼容集合的权重,所述第二兼容集合包括:资源转移路径1、2、……、j-1中相互兼容的路径所组成的集合中权重最大的集合;OPT(j)为 所述第j个资源转移路径的兼容集合的权重。
可选地,所述第一获取单元执行基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重之前,所述第二获取模块还包括:
第三获取单元,用于基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间;
第四获取单元,用于基于所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取与所述任一资源转移路径的时间不相互重叠的所有资源转移路径的第一集合;
第五获取单元,用于获取所述第一集合中相互兼容的路径所组成的集合中权重最大的所述第三兼容集合。
可选地,所述第一获取单元执行基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重之前,所述第二获取模块还包括:
第六获取单元,用于基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间;
第七获取单元,用于基于所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取所述第二兼容集合。
可选地,所述转移模块,包括:
第一确定单元,用于确定所述目标兼容集合中每个资源转移路径的起始时间和终止时间;
转移单元,用于基于所述目标兼容集合中每个资源转移路径的起始时间和终止时间,对所述目标资源进行转移。
可选地,在所述第一获取模块执行所述获取目标资源的多个资源转移路径之后,所述装置还包括:
第三获取模块,用于获取所述多个资源转移路径中每个资源转移路径的起始时间或终止时间;
第四获取模块,用于按照所述多个资源转移路径中每个资源转移路径的起始时间或终止时间的先后顺序,对所述多个资源转移路径进行排序,得到所述多个资源转移路径的排序结果。
另一方面,本申请实施例提供了一种资源转移装置,所述装置包括处理器和存储器,所述存储器中存储有至少一条指令,所述指令由所述处理器加载并执行以实现如上述提及的任一所述的资源转移方法。
另一方面,本申请实施例提供了一种计算机可读存储介质,所述存储介质中存储有至少一条指令,所述至少一条指令由处理器加载并执行以实现如上述提及的任一所述的资源转移方法。
另一方面,本申请实施例提供了一种计算机程序产品,所述计算机程序产品中存储有至少一段计算机程序,所述至少一段计算机程序由处理器加载并执行以实现如上述提及的任一所述的资源转移方法。
本申请实施例提供的技术方案带来的有益效果至少包括:
基于多个资源转移路径的排序结果,依次获取每个资源转移路径的兼容集合的权重,这能够避免对不兼容集合进行处理,避免对任一资源转移路径进行多次相同的处理,提高了资源转移的时效性和准确性,且不受带权重资源转移路径的影响,扩大了该方法的适用范围。通过将各个资源转移路径的兼容集合中权重最大的兼容集合作为目标兼容集合,基于该目标兼容集合能够精确地对目标资源进行转移,提高了目标资源的利用率。
附图说明
为了更清楚地说明本申请实施例中的技术方案,下面将对实施例描述中所需要使用的附图作简单地介绍,显而易见地,下面描述中的附图仅仅是本申请的一些实施例,对于本领域普通技术人员来讲,在不付出创造性劳动的前提下,还可以根据这些附图获得其他的附图。
图1是根据一示例性实施例示出的某银行账户与某钱袋银行账户之间的资金流通示意图;
图2是根据一示例性实施例示出的实施环境的示意图;
图3是根据一示例性实施例示出的一种资源转移方法的流程图;
图4是根据一示例性实施例示出的资金调拨模型的示意图;
图5是根据一示例性实施例示出的资金调拨任务排序后的示意图;
图6是根据一示例性实施例示出的权重最大的目标兼容集合的示意图;
图7是根据一示例性实施例示出的一种资金调拨业务+付款+付款网关的功能架构示意图;
图8是根据一示例性实施例示出的一种资源转移装置的结构示意图;
图9是根据一示例性实施例示出的第二获取模块的结构示意图;
图10是根据一示例性实施例示出的第二获取模块的结构示意图;
图11是根据一示例性实施例示出的第二获取模块的结构示意图;
图12是根据一示例性实施例示出的转移模块的结构示意图;
图13是根据一示例性实施例示出的一种资源转移装置的结构示意图;
图14是根据一示例性实施例示出的一种终端的结构示意图;
图15是根据一示例性实施例示出的一种服务器的结构示意图。
具体实施方式
除非另有定义,本申请实施例所用的所有技术术语均具有与本领域技术人员通常理解的相同的含义。为使本申请的目的、技术方案和优点更加清楚,下面将结合附图对本申请实施方式作进一步地详细描述。
资源转移的不同方法对于资源转移的效率、费用、资源的利用率具有重要的影响。举例来说,资源为第三方支付机构的备付金。第三方支付机构具有大量的收款业务及付款业务,其所收到的资金可作为备付金。用户通过第三方支付机构进行提现、代付、结算等付款操作时,第三方支付机构通过对应的备付金账户向银行账户进行出款。资金由备付金账户流通至目标银行账户时,资金可能流通多个不同银行。举例来说,图1示出了某银行账户与某钱袋银行账户之间的资金流通示意图,如图1所示,备付金账户(资金池账户)向第一存管户出款、第一存管户向ACS(Accounting Data Centralized System,中央银行会计核算数据集中系统)账户出款、ACS账户通过网联映射或网联户向第一收付户出款。或者,备付金账户向第一存管户出款、第一存管户通过银联向第一收付户出款。或者,备付金账户向第一存管户出款、第一存管户向第二存管户出款、第二存管户向银联内部户、第二收付户、第三收付户、第四收付户或第三存管户出款。其中,ACS账户、第一存管户、第二存管户、第一收付户、第二收付户、第三收付户、第四收付户、第三存管户等均能够通过其他方式入款及出款。例如,如图1所示,第二收付户、第三收付户、第三存管户、第四收付户分别通过汇缴户A、汇缴户B、汇缴户C、汇缴户D入款。资金流通不同银行的时间、费用不同,备付金的利用率也不同。对此,本申请实施例提供了一种资源转移方法,以提高打款时效、节省打款费用、改善打款体验、提高备付金的利用率等。
图2是根据一示例性实施例示出的实施环境的示意图,如图2所示,该实施环境包括: 至少一个终端21和服务器22,终端21可与服务器22进行通信连接,至少一个终端21通过服务器22来实现信息互换。
其中,终端21可以是任何一种可与用户通过键盘、触摸板、触摸屏、遥控器、语音交互或手写设备等一种或多种方式进行人机交互的电子产品,例如PC(Personal Computer,个人计算机)、手机、智能手机、PDA(Personal Digital Assistant,个人数字助手)、可穿戴设备、掌上电脑PPC(Pocket PC)、平板电脑等。
服务器22可以是一台服务器,也可以是由多台服务器组成的服务器集群,或者是一个云计算服务中心。
本领域技术人员应能理解上述终端21和服务器22仅为举例,其他现有的或今后可能出现的终端或服务器如可适用于本申请,也应包含在本申请保护范围以内,并在此以引用方式包含于此。
为了便于理解,以资金作为资源,以资金调拨作为资源转移,对本申请实施例提供的资源转移方法进行阐述。
图3是根据一示例性实施例提供的资源转移方法,该方法可应用于上述实施环境的终端或服务器中。如图3所示,该方法包括:
步骤31、获取目标资源的多个资源转移路径。
终端或服务器根据目标资源,获取目标资源转移的起始时间和终止时间之间的多个资源转移路径,作为目标资源的多个资源转移路径。
其中,目标资源可以为需要资源转移的任一资源,例如,收款业务中需要转移的资源,付款业务中需要转移的资源等等,本申请不对目标资源的内容进行限定。不同资源的转移,起始时间和终止时间不同。针对已经确定的目标资源,终端或服务器分析目标资源之后,获取目标资源转移的起始时间和终止时间。进一步地,根据目标资源转移的起始时间和终止时间,直接采集已存储的位于目标资源转移的起始时间和终止时间之间的多个资源转移路径,也可以采集其他设备中位于目标资源转移的起始时间和终止时间之间的多个资源转移路径。
通过选取一个或多个资源转移路径,使目标资源按照资源转移路径的集合进行转移。其中,资源转移路径可以理解为资源由一个位置转移到另一个位置。
可选地,在执行步骤31之后,本申请实施例提供的方法还包括:
步骤a、获取多个资源转移路径中每个资源转移路径的起始时间或终止时间。
终端或服务器可以获取每个资源转移路径的起始时间、终止时间和权重,然后根据每个资源转移路径的起始时间、终止时间和权重,建立包括多个资源转移路径的数据库或资源转移模型。终端或服务器在后期获取每个资源转移路径的起始时间或终止时间时,可以直接根据资源转移模型来获取。
资源转移路径的起始时间指的是:每个资源转移路径中上游位置接收资源的时间。资源转移路径的终止时间指的是:每个资源转移路径中下游位置接收资源的时间。其中,“上游”和“下游”均基于资源的流通方向进行定义。
权重指的是某一因素或指标对目标资源的重要程度。在一种可选地实施方式中,权重的获取方法可以为:对目标资源进行分析,确定影响调度指标,将调度指标转换成该目标资源的权重。其中,调度指标包括但不限于:时间、费用、资源的利用率。
针对于资源为资金的情况,“资源转移路径”相当于“资金调拨路径”。图4为资金调拨模型,其以时间为横轴,以长方形为资金调拨路径,由上至下依次为资金调拨路径a、资金调拨路径b、资金调拨路径c、资金调拨路径d、资金调拨路径e、资金调拨路径f、资金调拨路径g、资金调拨路径h。其中,资源转移路径的起始时间与终止时间之间的长度为长方形的长度。
当资金需要从第三方支付账户调拨至收付户账户时,资金需要顺次由第三方支付账户 调拨至存管户账户、由存管户账户调拨至ACS账户、由ACS账户调拨至网联、由网联调拨至收付户账户。每个账户与每个账户之间均可以看作是一个资源转移路径,多个账户与账户之间转移路径的集合可以看作是资源转移路径集合。
步骤b、按照多个资源转移路径中每个资源转移路径的起始时间或终止时间的先后顺序,对多个资源转移路径进行排序,得到多个资源转移路径的排序结果。
场景1,当每个资源转移路径的权重均相同时,可以按照每个资源转移路径的起始时间或终止时间的先后顺序进行排序。
场景2,当每个资源转移路径的权重不相同时,即为带权重时,可以按照每个资源转移路径的终止时间的先后顺序进行排序,以能够精确地确定任意两个资源转移路径之间是否存在重叠。例如,有的资源转移路径的权重为时效,有的资源转移路径的权重为费用。
举例来说,如图5所示,其为多个资金调拨路径按照终止时间的先后顺序排序后的资金调拨模型示意图。多个资金调拨路径按照终止时间的先后顺序依次为:资金调拨路径1、资金调拨路径2、资金调拨路径3、资金调拨路径4、资金调拨路径5、资金调拨路径6、资金调拨路径7、资金调拨路径8。
步骤32、基于多个资源转移路径的排序结果,依次获取每个资源转移路径的兼容集合的权重,任一资源转移路径的兼容集合为相互兼容的路径所组成的集合中权重最大的集合,相互兼容的路径为任一资源转移路径及任一资源转移路径之前的所有资源转移路径中时间不相互重叠的路径。
需要说明的是:在本申请实施例中,“资源转移路径”可以简写为“路径”。兼容指的是路径的时间不相互重叠。兼容集合的权重指的是兼容集合中每个路径的权重之和。
时间不相互重叠指的是:一个资源转移路径的终止时间小于或等于另一个资源转移路径的起始时间。举例来说,如图5所示,资金调拨路径1的终止时间小于资金调拨路径6的起始时间,则资金调拨路径1和资金调拨路径6的时间不相互重叠。资金调拨路径1的终止时间等于资金调拨路径4的起始时间,资金调拨路径4的终止时间小于资金调拨路径8的起始时间,则资金调拨路径1、资金调拨路径4、资金调拨路径8的时间不相互重叠。
可选地,步骤32包括但不限于以下子步骤:
步骤321、对于任一资源转移路径,基于多个资源转移路径的排序结果,获取任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重。
其中,第一兼容集合包括:任一资源转移路径与第三兼容集合,第三兼容集合包括第一集合中相互兼容的路径所组成的集合中权重最大的集合,第一集合包括任一资源转移路径之前且与任一资源转移路径的时间不相互重叠的所有资源转移路径组合的集合;第二兼容集合包括:任一资源转移路径之前的资源转移路径的兼容集合。
可选地,在基于多个资源转移路径的排序结果,获取任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重之前,步骤32还包括:
步骤32a、基于多个资源转移路径的排序结果,获取任一资源转移路径及任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间。
终端或服务器可以根据资源转移模型来获取任一资源转移路径及位于任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间。
步骤32b、基于任一资源转移路径及任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取与任一资源转移路径的时间不相互重叠的所有资源转移路径的第一集合。
终端或服务器可以根据任一资源转移路径及任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取位于任一资源转移路径之前且与任一资源转移路径的时间不相互重叠的所有资源转移路径的集合,作为第一集合。
比如,如图5所示,与资金调拨路径8的时间不相互重叠的资金调拨路径包括:资金调拨路径5、资金调拨路径4、资金调拨路径3、资金调拨路径2、资金调拨路径1,那么资 金调拨路径8的第一集合可以为{1,2,3,4,5}。
步骤32c、获取第一集合中相互兼容的路径所组成的集合中权重最大的第三兼容集合。
第一集合中相互兼容的路径所组成的集合可能有多个,每个集合对应的权重不同,将第一集合中相互兼容的路径所组成的集合中权重最大的集合作为第三兼容集合。
可选地,在基于多个资源转移路径的排序结果,获取任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重之前,步骤32还包括:
步骤32A、基于多个资源转移路径的排序结果,获取任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间。
步骤32A的执行方法与步骤32a类似,此处不再赘述。
步骤32B、基于任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取第二兼容集合。
第二兼容集合即任一资源转移路径之前的资源转移路径的兼容集合。
步骤322、基于第一兼容集合的权重、第二兼容集合的权重按照下述公式获取任一资源转移路径的兼容集合的权重;
Figure PCTCN2019125073-appb-000003
其中,j为第j个资源转移路径;ν j为第j个资源转移路径的权重;OPT(P(j))为第三兼容集合的权重,第三兼容集合包括:资源转移路径1、2、……、j-1中相互兼容且与第j个资源转移路径兼容的路径所组成的集合中权重最大的集合;ν j+OPT(P(j))为第一兼容集合的权重;OPT(j-1)为第二兼容集合的权重,第二兼容集合包括:资源转移路径1、2、……、j-1中相互兼容的路径所组成的集合中权重最大的集合;OPT(j)为第j个资源转移路径的兼容集合的权重。
举例来说,当j=1时,OPT(1)=ν 1
当j=2时,OPT(2)=max{ν 2+OPT(0),ν 1}=max{ν 2,ν 1};
……。
进一步地,可以按照以下两种场景确定第j个资源转移路径的兼容集合是否包含第j个资源转移路径:
场景1:若选择第j个资源转移路径,则不使用这些资源转移路径{p(i)+1,p(i)+2,……},第j个资源转移路径的兼容集合包含在{1,2,……,p(i),j}。
如图5所示,假如资金调拨路径6的兼容集合包含资金调拨路径6,距离资金调拨路径6最近且兼容的为资金调拨路径2,那么资金调拨路径6的兼容集合中不包括{p(2)+1=3,p(2)+2=4,……}。资金调拨路径6的兼容集合包含在{1,2,……,p(i),j}。
场景2:不选择第j个资源转移路径,则第j个资源转移路径的兼容集合包含在{1,2,……,j-1}。
可以理解的是,当第一兼容集合的权重ν j+OPT(P(j))大于第二兼容集合的权重OPT(j-1)时,第一兼容集合的权重ν j+OPT(P(j))为任一资源转移路径的兼容集合的权重,第一兼容集合为任一资源转移路径的兼容集合。当第一兼容集合的权重ν j+OPT(P(j))小于第二兼容集合的权重OPT(j-1)时,第二兼容集合的权重OPT(j-1)为任一资源转移路径的兼容集合的权重,第二兼容集合为任一资源转移路径的兼容集合。
在任一资源转移路径的兼容集合中,多个路径不相互重叠,多个路径按照时间的先后顺序排序后,可以形成一个连续的资源转移总路径,也可以为间断的多个路径,能够实现对资源进行转移即可。
步骤33、将各个资源转移路径的兼容集合中权重最大的兼容集合作为目标兼容集合,基于目标兼容集合对目标资源进行转移。
终端或服务器根据步骤32获取任一资源转移路径的兼容集合时,同时对其权重进行存 储,以利于后期高效获取权重最大的目标兼容集合。
如图6所示,以资金调拨路径8的兼容集合为例,终端和服务器基于步骤32逐步获取资金调拨路径8的兼容集合,并对其权重进行存储:
OPT(8)=max{ν 8+OPT(5),ν 7}=max{ν 8+max[ν 5,ν 4],ν 7}=max{ν 8+max[ν 5,max(ν 41,ν 3)],ν 7},假如ν 41大于ν 3,且ν 41大于ν 5,ν 841大于ν 7,那么,资金调拨路径1、资金调拨路径4、资金调拨路径8所构成的集合{1,4,8}作为资金调拨路径8的兼容集合。且资金调拨路径8的兼容集合的权重在各个资金调拨路径的兼容集合中最大,将资金调拨路径8的兼容集合作为目标兼容集合,该目标兼容集合的权重为ν 148
可选地,基于目标兼容集合对目标资源进行转移,包括但不限于以下子步骤:
步骤331、确定目标兼容集合中每个资源转移路径的起始时间和终止时间。
终端或服务器在获取任一资源转移路径的兼容集合的权重时,同时将对应的第一兼容集合或第二兼容集合进行存储,在确定目标兼容集合之后,可以对应获取相应的第一兼容集合或第二兼容集合中的每个资源转移路径的起始时间和终止时间。
步骤332、基于目标兼容集合中每个资源转移路径的起始时间和终止时间,对目标资源进行转移。
终端或服务器根据目标兼容集合中每个资源转移路径的起始时间和终止时间,按照时间的先后顺序,执行所有资源转移路径,以实现对目标资源的转移。
本申请实施例提供的资源转移方法,基于多个资源转移路径的排序结果,依次获取每个资源转移路径的兼容集合的权重,这能够避免对不兼容集合进行处理,避免对任一资源转移路径进行多次相同的处理,提高了资源转移的时效性和准确性,且不受带权重资源转移路径的影响,扩大了该方法的适用范围。通过将各个资源转移路径的兼容集合中权重最大的兼容集合作为目标兼容集合,基于该目标兼容集合能够精确地对目标资源进行转移,提高了目标资源的利用率。
进一步地,相关技术提供的循环暴力调拨算法搜索时间的复杂度为O(n*n),本申请实施例提供的资源转移方法的时间的复杂度为O(n*logn)。若目标资源转移时对应的多个资源转移路径的初始序列即为按照终止时间排序后的序列,则时间复杂度可降低为O(n),该方法的时间复杂度低,可以提高目标资源转移的时效性与准确性。
在权重为单位值的前提下,相关技术提供的贪心调度算法能够获取最优资源转移路径的集合,但是在带权重资源转移路径(多个资源转移任务的权重分别不同)中,则不能获取最优资源转移路径集合,从而导致资源利用率无法达到最优。本申请实施例提供的资源转移方法不受带权重资源转移路径的影响,能够获取最优的兼容资源转移路径集合,进而使资源利用率达到最优。
针对于资源为第三方支付机构的备付金的情况,图7示出了一种资金调拨业务+付款+付款网关的功能架构示意图,如图7所示,资金调拨业务包括:调拨引擎(调拨引擎包括:订单管理、交易分发、订单查询)、调拨定时任务、调拨规则配置、调拨监控、账户基础信息(账户基础信息包括:ACS、第一网联、第一银联、第一银行、第二银行、第三银行、第四银行、第二银联、第五银行)、其他业务(其他业务包括:外卖、智能支付等)。付款包括付款产品和付款核心,其中,付款产品包括:代付、提现、验卡、退款、验卡、资金调拨。付款核心包括:付款交易引擎(付款交易引擎包括:订单管理、交易分发、订单查询等)、名单配置(名单配置包括:受理黑名单)、CALLER(访客)信息(CALLER信息包括:提现、验卡、代付、退款、资金调拨等)、付款监控。付款网关包括:网关引擎(网关引擎包括:订单管理、订单查询、交易分发、账单查询)、付款路由、通道排队管理、通道能力配置、银行商户号、网关监控、银行通道(银行通道包括:第一网联全渠道和第一银联。其中,第一网联全渠道包括:第一银联超网、第一银联全渠道、第一银行超网、第二网联全渠道、第三银联等。第一银联包括:第一银联大额、第二银联小额、某行大小额、第一银行同行、第二银行同行、第三银行同行等)。通过资金调拨业务、付款、付款网关中 各个功能的相互配合以及本申请实施例提供的资源转移方法,能够实现对资金的有效调拨。
图8是根据一示例性实施例示出的一种资源转移装置的结构示意图,如图8所示,该装置包括:
第一获取模块81,用于获取目标资源的多个资源转移路径。
第二获取模块82,用于基于多个资源转移路径的排序结果,依次获取每个资源转移路径的兼容集合的权重,任一资源转移路径的兼容集合为相互兼容的路径所组成的集合中权重最大的集合,相互兼容的路径为任一资源转移路径及任一资源转移路径之前的所有资源转移路径中时间不相互重叠的路径。
转移模块83,用于将各个资源转移路径的兼容集合中权重最大的兼容集合作为目标兼容集合,基于目标兼容集合对目标资源进行转移。
可选地,如图9所示,第二获取模块82,包括:
第一获取单元91,用于对于任一资源转移路径,基于多个资源转移路径的排序结果,获取任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重。
第二获取单元92,用于基于第一兼容集合的权重、第二兼容集合的权重按照下述公式获取任一资源转移路径的兼容集合的权重;
Figure PCTCN2019125073-appb-000004
其中,j为第j个资源转移路径;ν j为第j个资源转移路径的权重;OPT(P(j))为第三兼容集合的权重,第三兼容集合包括:资源转移路径1、2、……、j-1中相互兼容且与第j个资源转移路径兼容的路径所组成的集合中权重最大的集合;ν j+OPT(P(j))为第一兼容集合的权重;OPT(j-1)为第二兼容集合的权重,第二兼容集合包括:资源转移路径1、2、……、j-1中相互兼容的路径所组成的集合中权重最大的集合;OPT(j)为第j个资源转移路径的兼容集合的权重。
可选地,如图10所示,第一获取单元91执行基于多个资源转移路径的排序结果,获取任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重之前,第二获取模块82还包括:
第三获取单元101,用于基于多个资源转移路径的排序结果,获取任一资源转移路径及任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间。
第四获取单元102,用于基于任一资源转移路径及任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取与任一资源转移路径的时间不相互重叠的所有资源转移路径的第一集合。
第五获取单元103,用于获取第一集合中相互兼容的路径所组成的集合中权重最大的第三兼容集合。
可选地,如图11所示,第一获取单元91执行基于多个资源转移路径的排序结果,获取任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重之前,第二获取模块82还包括:
第六获取单元111,用于基于多个资源转移路径的排序结果,获取任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间;
第七获取单元112,用于基于任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取第二兼容集合。
可选地,如图12所示,转移模块83,包括:
第一确定单元121,用于确定目标兼容集合中每个资源转移路径的起始时间和终止时间。
转移单元122,用于基于目标兼容集合中每个资源转移路径的起始时间和终止时间,对目标资源进行转移。
可选地,如图13所示,在第一获取模块81执行所述获取目标资源的多个资源转移路 径之前,本申请实施例提供的装置还包括:
第三获取模块131,用于获取多个资源转移路径中每个资源转移路径的起始时间或终止时间。
第四获取模块132,用于按照多个资源转移路径中每个资源转移路径的起始时间或终止时间的先后顺序,对多个资源转移路径进行排序,得到多个资源转移路径的排序结果。
本申请实施例提供的资源转移装置,通过基于多个资源转移路径的排序结果,依次获取每个资源转移路径的兼容集合的权重,这能够避免对不兼容集合进行处理,避免对任一资源转移路径进行多次相同的处理,提高了资源转移的时效性和准确性,且不受带权重资源转移路径的影响,扩大了该方法的适用范围。通过将各个资源转移路径的兼容集合中权重最大的兼容集合作为目标兼容集合,基于该目标兼容集合能够精确地对目标资源进行转移,提高了目标资源的利用率。
参见图14,其示出了本申请实施例提供的一种资源转移方法的终端1400的结构示意图。该终端1400可以是便携式移动终端,比如:智能手机、平板电脑、MP3播放器(Moving Picture Experts Group Audio Layer III,动态影像专家压缩标准音频层面3)、MP4(Moving Picture Experts Group Audio Layer IV,动态影像专家压缩标准音频层面4)播放器、笔记本电脑或台式电脑。终端1400还可能被称为用户设备、便携式终端、膝上型终端、台式终端等其他名称。
通常,终端1400包括有:处理器1401和存储器1402。
处理器1401可以包括一个或多个处理核心,比如4核心处理器、7核心处理器等。处理器1401可以采用DSP(Digital Signal Processing,数字信号处理)、FPGA(Field-Programmable Gate Array,现场可编程门阵列)、PLA(Programmable Logic Array,可编程逻辑阵列)中的至少一种硬件形式来实现。处理器1401也可以包括主处理器和协处理器,主处理器是用于对在唤醒状态下的数据进行处理的处理器,也称CPU(Central Processing Unit,中央处理器);协处理器是用于对在待机状态下的数据进行处理的低功耗处理器。在一些实施例中,处理器1401可以在集成有GPU(Graphics Processing Unit,图像处理器),GPU用于负责显示屏所需要显示的内容的渲染和绘制。一些实施例中,处理器1401还可以包括AI(Artificial Intelligence,人工智能)处理器,该AI处理器用于处理有关机器学习的计算操作。
存储器1402可以包括一个或多个计算机可读存储介质,该计算机可读存储介质可以是非暂态的。存储器1402还可包括高速随机存取存储器,以及非易失性存储器,比如一个或多个磁盘存储设备、闪存存储设备。在一些实施例中,存储器1402中的非暂态的计算机可读存储介质用于存储至少一个指令,该至少一个指令用于被处理器1401所执行以实现本申请中方法实施例提供的资源转移方法。
在一些实施例中,终端1400还可选包括有:外围设备接口1403和至少一个外围设备。处理器1401、存储器1402和外围设备接口1403之间可以通过总线或信号线相连。各个外围设备可以通过总线、信号线或电路板与外围设备接口1403相连。具体地,外围设备包括:射频电路1404、显示屏1405、摄像头1406、音频电路1407、定位组件1408和电源1409中的至少一种。
外围设备接口1403可被用于将I/O(Input/Output,输入/输出)相关的至少一个外围设备连接到处理器1401和存储器1402。在一些实施例中,处理器1401、存储器1402和外围设备接口1403被集成在同一芯片或电路板上;在一些其他实施例中,处理器1401、存储器1402和外围设备接口1403中的任意一个或两个可以在单独的芯片或电路板上实现,本实施例对此不加以限定。
射频电路1404用于接收和发射RF(Radio Frequency,射频)信号,也称电磁信号。射频电路1404通过电磁信号与通信网络以及其他通信设备进行通信。射频电路1404将电信 号转换为电磁信号进行发送,或者,将接收到的电磁信号转换为电信号。可选地,射频电路1404包括:天线系统、RF收发器、一个或多个放大器、调谐器、振荡器、数字信号处理器、编解码芯片组、用户身份模块卡等等。射频电路1404可以通过至少一种无线通信协议来与其它终端进行通信。该无线通信协议包括但不限于:城域网、各代移动通信网络(2G、3G、4G及5G)、无线局域网和/或WiFi(Wireless Fidelity,无线保真)网络。在一些实施例中,射频电路1404还可以包括NFC(Near Field Communication,近距离无线通信)有关的电路,本申请对此不加以限定。
显示屏1405用于显示UI(User Interface,用户界面)。该UI可以包括图形、文本、图标、视频及其它们的任意组合。当显示屏1405是触摸显示屏时,显示屏1405还具有采集在显示屏1405的表面或表面上方的触摸信号的能力。该触摸信号可以作为控制信号输入至处理器1401进行处理。此时,显示屏1405还可以用于提供虚拟按钮和/或虚拟键盘,也称软按钮和/或软键盘。在一些实施例中,显示屏1405可以为一个,设置终端1400的前面板;在另一些实施例中,显示屏1405可以为至少两个,分别设置在终端1400的不同表面或呈折叠设计;在再一些实施例中,显示屏1405可以是柔性显示屏,设置在终端1400的弯曲表面上或折叠面上。甚至,显示屏1405还可以设置成非矩形的不规则图形,也即异形屏。显示屏1405可以采用LCD(Liquid Crystal Display,液晶显示屏)、OLED(Organic Light-Emitting Diode,有机发光二极管)等材质制备。
摄像头组件1406用于采集图像或视频。可选地,摄像头组件1406包括前置摄像头和后置摄像头。通常,前置摄像头设置在终端的前面板,后置摄像头设置在终端的背面。在一些实施例中,后置摄像头为至少两个,分别为主摄像头、景深摄像头、广角摄像头、长焦摄像头中的任意一种,以实现主摄像头和景深摄像头融合实现背景虚化功能、主摄像头和广角摄像头融合实现全景拍摄以及VR(Virtual Reality,虚拟现实)拍摄功能或者其它融合拍摄功能。在一些实施例中,摄像头组件1406还可以包括闪光灯。闪光灯可以是单色温闪光灯,也可以是双色温闪光灯。双色温闪光灯是指暖光闪光灯和冷光闪光灯的组合,可以用于不同色温下的光线补偿。
音频电路1407可以包括麦克风和扬声器。麦克风用于采集用户及环境的声波,并将声波转换为电信号输入至处理器1401进行处理,或者输入至射频电路1404以实现语音通信。出于立体声采集或降噪的目的,麦克风可以为多个,分别设置在终端1400的不同部位。麦克风还可以是阵列麦克风或全向采集型麦克风。扬声器则用于将来自处理器1401或射频电路1404的电信号转换为声波。扬声器可以是传统的薄膜扬声器,也可以是压电陶瓷扬声器。当扬声器是压电陶瓷扬声器时,不仅可以将电信号转换为人类可听见的声波,也可以将电信号转换为人类听不见的声波以进行测距等用途。在一些实施例中,音频电路1407还可以包括耳机插孔。
定位组件1408用于定位终端1400的当前地理位置,以实现导航或LBS(Location Based Service,基于位置的服务)。定位组件1408可以是基于美国的GPS(Global Positioning System,全球定位系统)、中国的北斗系统、俄罗斯的格雷纳斯系统或欧盟的伽利略系统的定位组件。
电源1409用于为终端1400中的各个组件进行供电。电源1409可以是交流电、直流电、一次性电池或可充电电池。当电源1409包括可充电电池时,该可充电电池可以支持有线充电或无线充电。该可充电电池还可以用于支持快充技术。
在一些实施例中,终端1400还包括有一个或多个传感器1410。该一个或多个传感器1410包括但不限于:加速度传感器1411、陀螺仪传感器1412、压力传感器1413、指纹传感器1414、光学传感器1415以及接近传感器1416。
加速度传感器1411可以检测以终端1400建立的坐标系的三个坐标轴上的加速度大小。比如,加速度传感器1411可以用于检测重力加速度在三个坐标轴上的分量。处理器1401可以根据加速度传感器1411采集的重力加速度信号,控制显示屏1405以横向视图或纵向视图进行用户界面的显示。加速度传感器1411还可以用于游戏或者用户的运动数据的采集。
陀螺仪传感器1412可以检测终端1400的机体方向及转动角度,陀螺仪传感器1412可以与加速度传感器1411协同采集用户对终端1400的3D动作。处理器1401根据陀螺仪传感器1412采集的数据,可以实现如下功能:动作感应(比如根据用户的倾斜操作来改变UI)、拍摄时的图像稳定、游戏控制以及惯性导航。
压力传感器1413可以设置在终端1400的侧边框和/或显示屏1405的下层。当压力传感器1413设置在终端1400的侧边框时,可以检测用户对终端1400的握持信号,由处理器1401根据压力传感器1413采集的握持信号进行左右手识别或快捷操作。当压力传感器1413设置在显示屏1405的下层时,由处理器1401根据用户对显示屏1405的压力操作,实现对UI界面上的可操作性控件进行控制。可操作性控件包括按钮控件、滚动条控件、图标控件、菜单控件中的至少一种。
指纹传感器1414用于采集用户的指纹,由处理器1401根据指纹传感器1414采集到的指纹识别用户的身份,或者,由指纹传感器1414根据采集到的指纹识别用户的身份。在识别出用户的身份为可信身份时,由处理器1401授权该用户执行相关的敏感操作,该敏感操作包括解锁屏幕、查看加密信息、下载软件、支付及更改设置等。指纹传感器1414可以被设置终端1400的正面、背面或侧面。当终端1400上设置有物理按键或厂商Logo时,指纹传感器1414可以与物理按键或厂商Logo集成在一起。
光学传感器1415用于采集环境光强度。在一个实施例中,处理器1401可以根据光学传感器1415采集的环境光强度,控制显示屏1405的显示亮度。具体地,当环境光强度较高时,调高显示屏1405的显示亮度;当环境光强度较低时,调低显示屏1405的显示亮度。在另一个实施例中,处理器1401还可以根据光学传感器1415采集的环境光强度,动态调整摄像头组件1406的拍摄参数。
接近传感器1416,也称距离传感器,通常设置在终端1400的前面板。接近传感器1416用于采集用户与终端1400的正面之间的距离。在一个实施例中,当接近传感器1416检测到用户与终端1400的正面之间的距离逐渐变小时,由处理器1401控制显示屏1405从亮屏状态切换为息屏状态;当接近传感器1416检测到用户与终端1400的正面之间的距离逐渐变大时,由处理器1401控制显示屏1405从息屏状态切换为亮屏状态。
本领域技术人员可以理解,图14中示出的结构并不构成对终端1400的限定,可以包括比图示更多或更少的组件,或者组合某些组件,或者采用不同的组件布置。
图15是本申请实施例提供的一种服务器的结构示意图,该服务器1500可因配置或性能不同而产生比较大的差异,可以包括一个或一个以上处理器(central processing units,CPU)1501和一个或一个以上的存储器1502,其中,存储器1502中存储有至少一条指令,至少一条指令由处理器1501加载并执行以实现上述各个方法实施例提供的资源转移方法。当然,该服务器还可以具有有线或无线网络接口、键盘以及输入输出接口等部件,以便进行输入输出,该服务器还可以包括其他用于实现设备功能的部件,在此不做赘述。
在示例中实施例中,还提供了一种计算机设备,计算机设备包括处理器和存储器,存储器中存储有至少一条指令。至少一条指令经配置以由一个或者一个以上处理器执行,以实现上述任一种资源转移方法。
在示例性实施例中,还提供了一种计算机可读存储介质,存储介质中存储有至少一条指令,至少一条指令在被计算机设备的处理器执行时实现上述任一种资源转移方法。
可选地,上述计算机可读存储介质可以是只读存储器(Read Only Memory,ROM)、随机存取存储器(Random Access Memory,RAM)、CD-ROM(Compact-Disc Read Only Memory,只读光盘)、磁带、软盘和光数据存储设备等。
上述所有可选技术方案,可以采用任意结合形式公开可选地实施例,在此不再赘述。
以上所述仅为本申请的说明性实施例,并不用以限制本申请的保护范围,凡在本申请的精神和原则之内,所作的任何修改、等同替换、改进等,均应包含在本申请的保护范围之内。

Claims (20)

  1. 一种资源转移方法,其特征在于,所述方法包括:
    获取目标资源的多个资源转移路径;
    基于所述多个资源转移路径的排序结果,依次获取每个资源转移路径的兼容集合的权重,任一资源转移路径的兼容集合为相互兼容的路径所组成的集合中权重最大的集合,所述相互兼容的路径为所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中时间不相互重叠的路径;
    将各个资源转移路径的兼容集合中权重最大的兼容集合作为目标兼容集合,基于所述目标兼容集合对所述目标资源进行转移。
  2. 根据权利要求1所述的方法,其特征在于,所述基于所述多个资源转移路径的排序结果,获取每个资源转移路径的兼容集合的权重,包括:
    对于任一资源转移路径,基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重;
    基于所述第一兼容集合的权重、所述第二兼容集合的权重按照下述公式获取所述任一资源转移路径的兼容集合的权重;
    Figure PCTCN2019125073-appb-100001
    其中,j为第j个资源转移路径;ν j为所述第j个资源转移路径的权重;OPT(P(j))为第三兼容集合的权重,所述第三兼容集合包括:资源转移路径1、2、……、j-1中相互兼容且与所述第j个资源转移路径兼容的路径所组成的集合中权重最大的集合;ν j+OPT(P(j))为所述第一兼容集合的权重;OPT(j-1)为所述第二兼容集合的权重,所述第二兼容集合包括:资源转移路径1、2、……、j-1中相互兼容的路径所组成的集合中权重最大的集合;OPT(j)为所述第j个资源转移路径的兼容集合的权重。
  3. 根据权利要求2所述的方法,其特征在于,所述基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重之前,还包括:
    基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间;
    基于所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取与所述任一资源转移路径的时间不相互重叠的所有资源转移路径的第一集合;
    获取所述第一集合中相互兼容的路径所组成的集合中权重最大的所述第三兼容集合。
  4. 根据权利要求2所述的方法,其特征在于,所述基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重之前,还包括:
    基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间;
    基于所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取所述第二兼容集合。
  5. 根据权利要求1-4任一项所述的方法,其特征在于,所述基于所述目标兼容集合对所述目标资源进行转移,包括:
    确定所述目标兼容集合中每个资源转移路径的起始时间和终止时间;
    基于所述目标兼容集合中每个资源转移路径的起始时间和终止时间,对所述目标资源进行转移。
  6. 根据权利要求1-4任一项所述的方法,其特征在于,所述获取目标资源的多个资源转移路径之后,还包括:
    获取所述多个资源转移路径中每个资源转移路径的起始时间或终止时间;
    按照所述多个资源转移路径中每个资源转移路径的起始时间或终止时间的先后顺序,对所述多个资源转移路径进行排序,得到所述多个资源转移路径的排序结果。
  7. 一种资源转移装置,其特征在于,所述装置包括:
    第一获取模块,用于获取目标资源的多个资源转移路径;
    第二获取模块,用于基于所述多个资源转移路径的排序结果,依次获取每个资源转移路径的兼容集合的权重,任一资源转移路径的兼容集合为相互兼容的路径所组成的集合中权重最大的集合,所述相互兼容的路径为所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中时间不相互重叠的路径;
    转移模块,用于将各个资源转移路径的兼容集合中权重最大的兼容集合作为目标兼容集合,基于所述目标兼容集合对所述目标资源进行转移。
  8. 根据权利要求7所述的装置,其特征在于,所述第二获取模块,包括:
    第一获取单元,用于对于任一资源转移路径,基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重;
    第二获取单元,用于基于所述第一兼容集合的权重、所述第二兼容集合的权重按照下述公式获取所述任一资源转移路径的兼容集合的权重;
    Figure PCTCN2019125073-appb-100002
    其中,j为第j个资源转移路径;ν j为所述第j个资源转移路径的权重;OPT(P(j))为第三兼容集合的权重,所述第三兼容集合包括:资源转移路径1、2、……、j-1中相互兼容且与所述第j个资源转移路径兼容的路径所组成的集合中权重最大的集合;ν j+OPT(P(j))为所述第一兼容集合的权重;OPT(j-1)为所述第二兼容集合的权重,所述第二兼容集合包括:资源转移路径1、2、……、j-1中相互兼容的路径所组成的集合中权重最大的集合;OPT(j)为所述第j个资源转移路径的兼容集合的权重。
  9. 根据权利要求8所述的装置,其特征在于,所述第一获取单元执行基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重之前,所述第二获取模块还包括:
    第三获取单元,用于基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间;
    第四获取单元,用于基于所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取与所述任一资源转移路径的时间不相互重叠的所有资源转移路径的第一集合;
    第五获取单元,用于获取所述第一集合中相互兼容的路径所组成的集合中权重最大的所述第三兼容集合。
  10. 根据权利要求8所述的装置,其特征在于,所述第一获取单元执行基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重之前,所述第二获取模块还包括:
    第六获取单元,用于基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间;
    第七获取单元,用于基于所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取所述第二兼容集合。
  11. 根据权利要求7-10任一项所述的装置,其特征在于,所述转移模块,包括:
    第一确定单元,用于确定所述目标兼容集合中每个资源转移路径的起始时间和终止时间;
    转移单元,用于基于所述目标兼容集合中每个资源转移路径的起始时间和终止时间,对所述目标资源进行转移。
  12. 根据权利要求7-10任一项所述的装置,其特征在于,在所述第一获取模块执行所述获取目标资源的多个资源转移路径之后,所述装置还包括:
    第三获取模块,用于获取所述多个资源转移路径中每个资源转移路径的起始时间或终止时间;
    第四获取模块,用于按照所述多个资源转移路径中每个资源转移路径的起始时间或终止时间的先后顺序,对所述多个资源转移路径进行排序,得到所述多个资源转移路径的排序结果。
  13. 一种资源转移装置,其特征在于,所述装置包括处理器和存储器,所述存储器中存储有至少一条指令,所述指令由所述处理器加载并执行以实现下述资源转移方法的步骤:
    获取目标资源的多个资源转移路径;
    基于所述多个资源转移路径的排序结果,依次获取每个资源转移路径的兼容集合的权重,任一资源转移路径的兼容集合为相互兼容的路径所组成的集合中权重最大的集合,所述相互兼容的路径为所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中时间不相互重叠的路径;
    将各个资源转移路径的兼容集合中权重最大的兼容集合作为目标兼容集合,基于所述目标兼容集合对所述目标资源进行转移。
  14. 根据权利要求13所述的装置,其特征在于,所述处理器还用于执行下述步骤:
    对于任一资源转移路径,基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径的第一兼容集合的权重和第二兼容集合的权重;
    基于所述第一兼容集合的权重、所述第二兼容集合的权重按照下述公式获取所述任一资源转移路径的兼容集合的权重;
    Figure PCTCN2019125073-appb-100003
    其中,j为第j个资源转移路径;ν j为所述第j个资源转移路径的权重;OPT(P(j))为第三兼容集合的权重,所述第三兼容集合包括:资源转移路径1、2、……、j-1中相互兼容且与所述第j个资源转移路径兼容的路径所组成的集合中权重最大的集合;ν j+OPT(P(j))为所述第一兼容集合的权重;OPT(j-1)为所述第二兼容集合的权重,所述第二兼容集合包括:资源转移路径1、2、……、j-1中相互兼容的路径所组成的集合中权重最大的集合;OPT(j)为所述第j个资源转移路径的兼容集合的权重。
  15. 根据权利要求14所述的装置,其特征在于,所述处理器还用于执行下述步骤:
    基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间;
    基于所述任一资源转移路径及所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取与所述任一资源转移路径的时间不相互重叠的所有资源转移路径的第一集合;
    获取所述第一集合中相互兼容的路径所组成的集合中权重最大的所述第三兼容集合。
  16. 根据权利要求14所述的装置,其特征在于,所述处理器还用于执行下述步骤:
    基于所述多个资源转移路径的排序结果,获取所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间;
    基于所述任一资源转移路径之前的所有资源转移路径中每个资源转移路径的起始时间和终止时间,获取所述第二兼容集合。
  17. 根据权利要求13-16所述的装置,其特征在于,所述处理器还用于执行下述步骤:
    确定所述目标兼容集合中每个资源转移路径的起始时间和终止时间;
    基于所述目标兼容集合中每个资源转移路径的起始时间和终止时间,对所述目标资源进行转移。
  18. 根据权利要求13-16所述的装置,其特征在于,所述处理器还用于执行下述步骤:
    获取所述多个资源转移路径中每个资源转移路径的起始时间或终止时间;
    按照所述多个资源转移路径中每个资源转移路径的起始时间或终止时间的先后顺序,对所述多个资源转移路径进行排序,得到所述多个资源转移路径的排序结果。
  19. 一种计算机可读存储介质,其特征在于,所述存储介质中存储有至少一条指令,所述至少一条指令由处理器加载并执行以实现如权利要求1-6中任一所述的资源转移方法。
  20. 一种计算机程序产品,其特征在于,所述计算机程序产品中存储有至少一段计算机程序,所述至少一段计算机程序由处理器加载并执行以实现如权利要求1-6中任一所述的资源转移方法。
PCT/CN2019/125073 2019-03-13 2019-12-13 资源转移方法、装置及存储介质 WO2020181858A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910190728.8A CN111695981B (zh) 2019-03-13 2019-03-13 资源转移方法、装置及存储介质
CN201910190728.8 2019-03-13

Publications (1)

Publication Number Publication Date
WO2020181858A1 true WO2020181858A1 (zh) 2020-09-17

Family

ID=72426127

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/125073 WO2020181858A1 (zh) 2019-03-13 2019-12-13 资源转移方法、装置及存储介质

Country Status (2)

Country Link
CN (1) CN111695981B (zh)
WO (1) WO2020181858A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112598510B (zh) * 2021-01-06 2024-02-06 中国工商银行股份有限公司 资源数据处理方法和装置
CN115994761A (zh) * 2021-10-20 2023-04-21 腾讯科技(深圳)有限公司 资源转移信息检测方法、装置、设备和存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090070256A1 (en) * 2007-09-04 2009-03-12 Skycash Sp. Z O.O. Systems and methods for payment
CN106559474A (zh) * 2016-09-27 2017-04-05 布比(北京)网络技术有限公司 分布式总账的高吞吐量数据处理方法及系统
CN106779650A (zh) * 2016-12-23 2017-05-31 中山大学 一种基于转账交易流水的客户资金关系圈划分方法
CN106845988A (zh) * 2017-01-23 2017-06-13 杭州恒生云融网络科技有限公司 用于选择支付通道的方法及装置

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
MXPA02011114A (es) * 2000-05-10 2004-03-26 Case Shiller Weiss Inc Tecnicas para invertir en instrumentos de inversion referencial.
US20090063332A1 (en) * 2007-08-29 2009-03-05 Wachovia Corporation Flexible automatic savings programs
US20150294377A1 (en) * 2009-05-30 2015-10-15 Edmond K. Chow Trust network effect
CN108738158B (zh) * 2018-05-11 2021-07-23 长沙学院 一种基于吞吐量优化的lte下行链路调度方法
CN108830572B (zh) * 2018-06-15 2023-11-14 腾讯科技(深圳)有限公司 资源转移方法、装置、存储介质以及设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090070256A1 (en) * 2007-09-04 2009-03-12 Skycash Sp. Z O.O. Systems and methods for payment
CN106559474A (zh) * 2016-09-27 2017-04-05 布比(北京)网络技术有限公司 分布式总账的高吞吐量数据处理方法及系统
CN106779650A (zh) * 2016-12-23 2017-05-31 中山大学 一种基于转账交易流水的客户资金关系圈划分方法
CN106845988A (zh) * 2017-01-23 2017-06-13 杭州恒生云融网络科技有限公司 用于选择支付通道的方法及装置

Also Published As

Publication number Publication date
CN111695981A (zh) 2020-09-22
CN111695981B (zh) 2024-10-29

Similar Documents

Publication Publication Date Title
CN108304265B (zh) 内存管理方法、装置及存储介质
CN112966124B (zh) 知识图谱对齐模型的训练方法、对齐方法、装置及设备
CN111078521A (zh) 异常事件的分析方法、装置、设备、系统及存储介质
CN111028071B (zh) 账单处理方法、装置、电子设备及存储介质
WO2021027890A1 (zh) 车牌图像生成方法、装置及计算机存储介质
CN111462742A (zh) 基于语音的文本显示方法、装置、电子设备及存储介质
CN110673944B (zh) 执行任务的方法和装置
WO2020181858A1 (zh) 资源转移方法、装置及存储介质
CN111914985B (zh) 深度学习网络模型的配置方法、装置及存储介质
CN112398819A (zh) 异常识别的方法及装置
WO2021218634A1 (zh) 内容推送
CN110149408B (zh) 业务数据显示方法、装置、终端及服务器
CN113949678B (zh) 流量控制方法、装置、电子设备及计算机可读存储介质
CN109816047B (zh) 提供标签的方法、装置、设备及可读存储介质
CN110891086B (zh) 资源转移方法、装置、终端、服务器及存储介质
CN111768297A (zh) 状态变换参数获取方法、电子设备及存储介质
CN111429106A (zh) 资源转移凭证的处理方法、服务器、电子设备及存储介质
CN111652432A (zh) 用户属性信息的确定方法、装置、电子设备及存储介质
CN111984738A (zh) 数据关联方法、装置、设备及存储介质
US12111998B2 (en) Touch control method and apparatus, device and storage medium
CN110519378B (zh) 确定目标对象的方法、装置、服务器及存储介质
CN111526221B (zh) 域名质量确定方法、装置及存储介质
CN114138827A (zh) 数据查询方法、装置、设备及计算机可读存储介质
CN114139037A (zh) 确定资源的方法、装置、设备及计算机可读存储介质
CN112102065A (zh) 参数获取方法、装置、电子设备及存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19918735

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19918735

Country of ref document: EP

Kind code of ref document: A1