WO2020181858A1 - Procédé de transfert de ressources, dispositif et support de stockage - Google Patents

Procédé de transfert de ressources, dispositif et support de stockage 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)
Chinese (zh)
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/fr

Links

Images

Classifications

    • 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
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/02—Banking, e.g. interest calculation or account maintenance
    • 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/08—Payment architectures
    • 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/08—Payment architectures
    • G06Q20/085—Payment architectures involving remote charge determination or related payment systems
    • G06Q20/0855—Payment architectures involving remote charge determination or related payment systems involving a third party
    • 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/08—Payment architectures
    • G06Q20/10—Payment 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

L'invention concerne un procédé de transfert de ressources, un dispositif, et un support de stockage, appartenant au domaine technique du traitement de donnés. Le procédé comprend les étapes consistant à : acquérir une pluralité de chemins de transfert de ressources d'une ressource cible (31) ; acquérir séquentiellement, sur la base d'un résultat de tri de la pluralité de chemins de transfert de ressources, des poids d'ensembles de compatibilité des chemins de transfert de ressources respectifs (32), l'ensemble de compatibilité d'un chemin de transfert de ressources donné étant l'ensemble ayant le poids le plus élevé parmi des ensembles, lesdits ensembles étant constitués chacun de chemins mutuellement compatibles, et les chemins mutuellement compatibles étant constitués du chemin de transfert de ressources donné et de tous les chemins de transfert de ressources qui viennent avant ledit chemin de transfert de ressources et qui ne se chevauchent pas dans le temps ; et désigner, parmi les ensembles de compatibilité des chemins de transfert de ressources respectifs, un ensemble de compatibilité ayant le poids le plus élevé en tant qu'ensemble de compatibilité cible, et transférer la ressource cible sur la base de l'ensemble de compatibilité cible (33). Le procédé peut transférer de manière efficace et précise des ressources pondérées et améliorer l'utilisation des ressources.
PCT/CN2019/125073 2019-03-13 2019-12-13 Procédé de transfert de ressources, dispositif et support de stockage WO2020181858A1 (fr)

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 (fr) 2020-09-17

Family

ID=72426127

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/125073 WO2020181858A1 (fr) 2019-03-13 2019-12-13 Procédé de transfert de ressources, dispositif et support de stockage

Country Status (2)

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

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
CN1441934A (zh) * 2000-05-10 2003-09-10 宏观证券研究公司 投资于代理资产的技术
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
CN111695981B (zh) 2024-10-29
CN111695981A (zh) 2020-09-22

Similar Documents

Publication Publication Date Title
CN108304265B (zh) 内存管理方法、装置及存储介质
CN112966124B (zh) 知识图谱对齐模型的训练方法、对齐方法、装置及设备
CN111078521A (zh) 异常事件的分析方法、装置、设备、系统及存储介质
CN111028071B (zh) 账单处理方法、装置、电子设备及存储介质
CN110673944B (zh) 执行任务的方法和装置
WO2021027890A1 (fr) Procédé et dispositif de production d'image de plaque d'immatriculation, et support de stockage informatique
CN111462742A (zh) 基于语音的文本显示方法、装置、电子设备及存储介质
WO2020181858A1 (fr) Procédé de transfert de ressources, dispositif et support de stockage
CN112398819A (zh) 异常识别的方法及装置
CN111914985B (zh) 深度学习网络模型的配置方法、装置及存储介质
WO2021218634A1 (fr) Poussée de contenu
CN110149408B (zh) 业务数据显示方法、装置、终端及服务器
CN113949678B (zh) 流量控制方法、装置、电子设备及计算机可读存储介质
CN109816047B (zh) 提供标签的方法、装置、设备及可读存储介质
CN110891086B (zh) 资源转移方法、装置、终端、服务器及存储介质
CN111768297A (zh) 状态变换参数获取方法、电子设备及存储介质
CN111429106A (zh) 资源转移凭证的处理方法、服务器、电子设备及存储介质
CN111652432A (zh) 用户属性信息的确定方法、装置、电子设备及存储介质
CN111984738A (zh) 数据关联方法、装置、设备及存储介质
CN110519378B (zh) 确定目标对象的方法、装置、服务器及存储介质
US12111998B2 (en) Touch control method and apparatus, device and storage medium
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