CN117435174B - Payment expansion method and system - Google Patents
Payment expansion method and system Download PDFInfo
- Publication number
- CN117435174B CN117435174B CN202311686852.6A CN202311686852A CN117435174B CN 117435174 B CN117435174 B CN 117435174B CN 202311686852 A CN202311686852 A CN 202311686852A CN 117435174 B CN117435174 B CN 117435174B
- Authority
- CN
- China
- Prior art keywords
- payment
- sequence
- interface
- enabling
- program set
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000013507 mapping Methods 0.000 claims abstract description 45
- 238000007499 fusion processing Methods 0.000 claims abstract description 21
- 230000004927 fusion Effects 0.000 claims description 22
- 238000004590 computer program Methods 0.000 claims description 9
- 238000006243 chemical reaction Methods 0.000 claims description 8
- 238000000605 extraction Methods 0.000 claims description 3
- 238000012545 processing Methods 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000003745 diagnosis Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/20—Software design
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The invention provides a payment expansion method and a payment expansion system, wherein the method comprises the following steps: acquiring a plurality of payment universal interfaces, and extracting an enabling program set corresponding to each payment universal interface from a preset database; acquiring a payment program set corresponding to each starting program set in real time, and carrying out fusion processing on the starting program set and the payment program set to generate a plurality of corresponding payment codes; and constructing a mapping relation between each payment code and each payment universal interface one by one, and binding a plurality of payment universal interfaces to a preset payment system based on the mapping relation so as to enable the payment system to finish corresponding fee payment. The invention can simply and rapidly complete the expansion of the payment mode, and correspondingly improves the use experience of the user.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a payment expansion method and a payment expansion system.
Background
With the development of the age, when patients settle the generated fees after the outpatient diagnosis and treatment or hospitalization in the hospital, the payment modes such as cash, weChat and bank card can be used, so that the payment requirements of different patients can be simultaneously met.
When the institution wants to apply a new payment mode, in the process of embedding a new payment flow into the payment system of the hospital, a technician is required to recode the business flow in the hospital, and a re-settlement test is required to be performed on all payment modes.
However, because the related area of the business process is wider, the workload of the technician for recoding the business process is larger, and the time for carrying out the recordation test on all payment modes is longer after the coding is finished, thereby wasting time and energy and correspondingly reducing the working efficiency.
Disclosure of Invention
Based on the above, the invention aims to provide a payment expansion method and a payment expansion system, so as to solve the problem of lower working efficiency caused by time and labor waste in the process of adding a payment mode in the prior art.
The first aspect of the embodiment of the invention provides:
a payment extension method, wherein the method comprises:
acquiring a plurality of payment universal interfaces, and extracting an enabling program set corresponding to each payment universal interface from a preset database;
acquiring a payment program set corresponding to each starting program set in real time, and carrying out fusion processing on the starting program set and the payment program set to generate a plurality of corresponding payment codes;
and constructing a mapping relation between each payment code and each payment universal interface one by one, and binding a plurality of payment universal interfaces to a preset payment system based on the mapping relation so as to enable the payment system to finish corresponding fee payment.
The beneficial effects of the invention are as follows: the starting program set corresponding to each payment universal interface is extracted in real time, further, the payment program set matched with each starting program set is obtained in real time, based on the starting program set and the payment program set, a complete payment code can be formed after fusion processing is carried out on the starting program set and the payment code, and a specific payment flow can be realized. Based on the above, the mapping relation between the payment codes and the payment universal interface is further constructed, and each payment code can be bound into the required payment system through the mapping relation finally, so that a user can complete corresponding payment through the payment system, expansion of a payment mode can be completed simply and rapidly, the working efficiency is improved, and meanwhile, the user experience is improved.
Further, the step of fusing the enablement program set and the payment program set to generate a plurality of corresponding payment codes includes:
when the starting program set and the payment program set are respectively acquired, starting data contained in the starting program set are extracted in real time, and payment data contained in the payment program set are extracted in real time;
and converting the enabling data into a corresponding enabling feature sequence through a first preset algorithm, converting the payment data into a corresponding payment feature sequence, and carrying out fusion processing on the enabling feature sequence and the payment feature sequence to correspondingly generate the payment code.
Further, the step of fusing the enabling feature sequence and the payment feature sequence to correspondingly generate the payment code includes:
when the starting feature sequence is acquired, sequentially detecting a plurality of starting nodes contained in the starting feature sequence from beginning to end, and sequentially adding a corresponding first sequence identifier to each starting node;
when the payment feature sequence is acquired, sequentially detecting a plurality of payment nodes contained in the payment feature sequence from beginning to end, and sequentially adding a corresponding second sequence identifier to each payment node;
and constructing a corresponding relation between the first sequence identifier and the second sequence identifier, and carrying out fusion processing on the enabling characteristic sequence and the payment characteristic sequence based on the corresponding relation so as to correspondingly generate the payment code.
Further, the step of fusing the enabling feature sequence and the payment feature sequence based on the correspondence relationship to correspondingly generate the payment code includes:
splitting the enabling feature sequence into a plurality of corresponding first sequence segments according to a plurality of enabling nodes, and splitting the payment feature sequence into a plurality of corresponding second sequence segments according to a plurality of payment nodes;
and correspondingly connecting each first sequence segment to the starting point of each second sequence segment according to the corresponding relation to generate a corresponding fusion characteristic sequence, and converting the fusion characteristic sequence into the payment code.
Further, the expression of the first preset algorithm is:
wherein W is f (a, b) representing the enabling data or the payment data, a and b representing sequence numbers of data, db representing a conversion coefficient, V representing the enabling feature sequence or the payment feature sequence.
Further, the step of constructing a mapping relationship between each payment code and each payment universal interface one by one includes:
when the payment code is acquired, carrying out full-disc scanning on the payment code so as to correspondingly detect the payment category corresponding to the payment code;
and detecting interface types corresponding to the payment universal interfaces one by one, and constructing the mapping relation according to the payment types and the interface types.
Further, the step of constructing the mapping relationship according to the payment category and the interface category includes:
detecting a payment factor corresponding to the payment category and an interface factor corresponding to the interface category in a preset data table, and judging whether the sum of the payment factor and the interface factor is equal to a preset target value or not in real time;
if the sum of the payment factor and the interface factor is equal to the preset target value in real time, the payment category is judged to correspond to the interface category, and the mapping relation between the payment category and the interface category is correspondingly constructed.
A second aspect of an embodiment of the present invention proposes:
a payment extension system, wherein the system comprises:
the extraction module is used for obtaining a plurality of payment universal interfaces and extracting an enabling program set corresponding to each payment universal interface from a preset database;
the fusion module is used for acquiring the payment program sets corresponding to each starting program set in real time, and carrying out fusion processing on the starting program sets and the payment program sets so as to generate a plurality of corresponding payment codes;
the mapping module is used for constructing a mapping relation between each payment code and each payment universal interface one by one, and binding a plurality of payment universal interfaces to a preset payment system based on the mapping relation so as to enable the payment system to finish corresponding fee payment.
Further, the fusion module is specifically configured to:
when the starting program set and the payment program set are respectively acquired, starting data contained in the starting program set are extracted in real time, and payment data contained in the payment program set are extracted in real time;
and converting the enabling data into a corresponding enabling feature sequence through a first preset algorithm, converting the payment data into a corresponding payment feature sequence, and carrying out fusion processing on the enabling feature sequence and the payment feature sequence to correspondingly generate the payment code.
Further, the fusion module is specifically further configured to:
when the starting feature sequence is acquired, sequentially detecting a plurality of starting nodes contained in the starting feature sequence from beginning to end, and sequentially adding a corresponding first sequence identifier to each starting node;
when the payment feature sequence is acquired, sequentially detecting a plurality of payment nodes contained in the payment feature sequence from beginning to end, and sequentially adding a corresponding second sequence identifier to each payment node;
and constructing a corresponding relation between the first sequence identifier and the second sequence identifier, and carrying out fusion processing on the enabling characteristic sequence and the payment characteristic sequence based on the corresponding relation so as to correspondingly generate the payment code.
Further, the fusion module is specifically further configured to:
splitting the enabling feature sequence into a plurality of corresponding first sequence segments according to a plurality of enabling nodes, and splitting the payment feature sequence into a plurality of corresponding second sequence segments according to a plurality of payment nodes;
and correspondingly connecting each first sequence segment to the starting point of each second sequence segment according to the corresponding relation to generate a corresponding fusion characteristic sequence, and converting the fusion characteristic sequence into the payment code.
Further, the expression of the first preset algorithm is:
wherein W is f (a, b) representing the enabling data or the payment data, a and b representing sequence numbers of data, db representing a conversion coefficient, V representing the enabling feature sequence or the payment feature sequence.
Further, the mapping module is specifically configured to:
when the payment code is acquired, carrying out full-disc scanning on the payment code so as to correspondingly detect the payment category corresponding to the payment code;
and detecting interface types corresponding to the payment universal interfaces one by one, and constructing the mapping relation according to the payment types and the interface types.
Further, the mapping module is specifically further configured to:
detecting a payment factor corresponding to the payment category and an interface factor corresponding to the interface category in a preset data table, and judging whether the sum of the payment factor and the interface factor is equal to a preset target value or not in real time;
if the sum of the payment factor and the interface factor is equal to the preset target value in real time, the payment category is judged to correspond to the interface category, and the mapping relation between the payment category and the interface category is correspondingly constructed.
A third aspect of an embodiment of the present invention proposes:
a computer comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the payment extension method as described above when the computer program is executed.
A fourth aspect of the embodiment of the present invention proposes:
a readable storage medium having stored thereon a computer program, wherein the program when executed by a processor implements the payment extension method as described above.
Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
Fig. 1 is a flowchart of a payment expansion method according to a first embodiment of the present invention;
fig. 2 is a block diagram of a payment expansion system according to a sixth embodiment of the present invention.
The invention will be further described in the following detailed description in conjunction with the above-described figures.
Detailed Description
In order that the invention may be readily understood, a more complete description of the invention will be rendered by reference to the appended drawings. Several embodiments of the invention are presented in the figures. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete.
It will be understood that when an element is referred to as being "mounted" on another element, it can be directly on the other element or intervening elements may also be present. When an element is referred to as being "connected" to another element, it can be directly connected to the other element or intervening elements may also be present. The terms "vertical," "horizontal," "left," "right," and the like are used herein for illustrative purposes only.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used herein in the description of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. The term "and/or" as used herein includes any and all combinations of one or more of the associated listed items.
Referring to fig. 1, a payment expansion method provided by a first embodiment of the present invention is shown, and the payment expansion method provided by the present embodiment can simply and quickly complete expansion of a payment manner, thereby improving working efficiency and improving user experience.
Specifically, the payment expansion method provided in this embodiment specifically includes the following steps:
step S10, a plurality of payment universal interfaces are obtained, and an enabling program set corresponding to each payment universal interface is extracted from a preset database;
step S20, acquiring a payment program set corresponding to each starting program set in real time, and carrying out fusion processing on the starting program set and the payment program set to generate a plurality of corresponding payment codes;
step S30, a mapping relation between each payment code and each payment universal interface is built one by one, and a plurality of payment universal interfaces are bound to a preset payment system based on the mapping relation, so that the payment system finishes corresponding fee payment.
Specifically, in this embodiment, it should be noted that, in order to simply and quickly complete expansion of the payment modes, it is necessary to first obtain a payment generic interface corresponding to each payment mode, specifically, each payment generic interface can correspond to each payment mode, and more specifically, for example, an expandable payment mode includes WeChat payment, payment, and the like. Further, an enabling program set corresponding to each payment universal interface is respectively extracted from a preset program database, and specifically, the enabling program set can enable a corresponding payment flow in a user payment process.
Furthermore, in order to enable each payment mode to be completely operated, a payment program set adapted to each enabled program set needs to be further acquired in real time, and based on the payment program set, fusion processing is performed on the current enabled program set and the payment program set in real time, so that a complete payment code can be finally generated. On the basis, in order to automatically run the payment codes, a mapping relation between each payment code and each payment universal interface, namely a one-to-one correspondence relation, needs to be further constructed. Finally, each payment universal interface is finally bound to a payment system which can be used by a user on the basis of the current mapping relation, so that the user can complete payment of various fees through the payment system in real time.
Second embodiment
Further, the step of fusing the enablement program set and the payment program set to generate a plurality of corresponding payment codes includes:
when the starting program set and the payment program set are respectively acquired, starting data contained in the starting program set are extracted in real time, and payment data contained in the payment program set are extracted in real time;
and converting the enabling data into a corresponding enabling feature sequence through a first preset algorithm, converting the payment data into a corresponding payment feature sequence, and carrying out fusion processing on the enabling feature sequence and the payment feature sequence to correspondingly generate the payment code.
Specifically, in this embodiment, after the required enabling program set and the payment program set are obtained through the above steps, in order to simply and effectively generate the required payment code, the expansion of the payment manner is correspondingly completed. Based on this, it is necessary to first extract, in real time, the enabling data contained in the current enabling program set and the payment data contained in the current payment program set, and at the same time, enable the first preset algorithm set in the background.
Further, the current enabling data is immediately converted into an enabling feature sequence which can be identified by the computer in real time through the current first preset algorithm, and the current payment data is converted into a payment feature sequence which can be identified by the computer, and based on the current enabling feature sequence and the payment feature sequence, fusion processing is only needed to be carried out on the current enabling feature sequence and the payment feature sequence in real time so as to correspondingly generate each payment code.
Further, the step of fusing the enabling feature sequence and the payment feature sequence to correspondingly generate the payment code includes:
when the starting feature sequence is acquired, sequentially detecting a plurality of starting nodes contained in the starting feature sequence from beginning to end, and sequentially adding a corresponding first sequence identifier to each starting node;
when the payment feature sequence is acquired, sequentially detecting a plurality of payment nodes contained in the payment feature sequence from beginning to end, and sequentially adding a corresponding second sequence identifier to each payment node;
and constructing a corresponding relation between the first sequence identifier and the second sequence identifier, and carrying out fusion processing on the enabling characteristic sequence and the payment characteristic sequence based on the corresponding relation so as to correspondingly generate the payment code.
Specifically, in this embodiment, it should also be noted that, after the required enabling feature sequence and the payment feature sequence are obtained through the above steps, special processing needs to be performed on the current two feature sequences respectively at this time, specifically, on one hand, all enabling nodes included in the current enabling feature sequence are extracted in real time, and a corresponding first sequence identifier is added to each enabling node according to the sequence of each enabling node in real time. Correspondingly, on the other hand, all payment nodes contained in the current payment feature sequence are extracted in real time, and corresponding second sequence identifiers are added to each payment node in real time according to the sequence of each payment node. Based on the method, the corresponding relation between the current first sequence identifier and the second sequence identifier is constructed in real time, the relation between the enabling feature sequence and the payment feature sequence can be correspondingly established, and further subsequent fusion processing is completed according to the current corresponding relation, so that fusion efficiency is correspondingly improved.
Third embodiment
Further, the step of fusing the enabling feature sequence and the payment feature sequence based on the correspondence relationship to correspondingly generate the payment code includes:
splitting the enabling feature sequence into a plurality of corresponding first sequence segments according to a plurality of enabling nodes, and splitting the payment feature sequence into a plurality of corresponding second sequence segments according to a plurality of payment nodes;
and correspondingly connecting each first sequence segment to the starting point of each second sequence segment according to the corresponding relation to generate a corresponding fusion characteristic sequence, and converting the fusion characteristic sequence into the payment code.
In addition, in this embodiment, it should be noted that, in order to facilitate the completion of the final fusion, the enabling feature sequence needs to be further split into a plurality of corresponding first sequence segments according to the plurality of enabling nodes, and correspondingly, the payment feature sequence needs to be split into a plurality of corresponding second sequence segments according to the plurality of payment nodes.
Furthermore, the corresponding relation constructed in real time based on the steps can directly connect each first sequence segment to the starting point of each second sequence segment, and finally generate a complete fusion characteristic sequence.
Further, the expression of the first preset algorithm is:
wherein W is f (a, b) representing the enabling data or the payment data, a and b representing sequence numbers of data, db representing a conversion coefficient, V representing the enabling feature sequence or the payment feature sequence.
In addition, in this embodiment, it should be further noted that, in order to effectively complete the conversion of the data, the embodiment sets the first preset algorithm in the background in advance, specifically, only needs to sequentially input the enabling data or the payment data obtained in real time into the current first preset algorithm from beginning to end, so that the current first preset algorithm can output a complete enabling feature sequence or a payment feature sequence in real time, where the conversion coefficient is preset and is a fixed value, and no adjustment is needed in the conversion process so as to facilitate subsequent processing.
Fourth embodiment
Further, the step of constructing a mapping relationship between each payment code and each payment universal interface one by one includes:
when the payment code is acquired, carrying out full-disc scanning on the payment code so as to correspondingly detect the payment category corresponding to the payment code;
and detecting interface types corresponding to the payment universal interfaces one by one, and constructing the mapping relation according to the payment types and the interface types.
In this embodiment, it should be noted that, in order to effectively construct a mapping relationship between each payment code and each payment universal interface, the payment codes are conveniently bound in the payment system. Specifically, after the payment code is acquired, full-disc scanning is required to be performed on the current payment code in real time at this time, so as to correspondingly detect information contained in the current payment code, that is, detect the contained payment type. Further, the interface type corresponding to each payment universal interface is detected in real time, so that the payment universal interface matched with each payment code can be further determined, and a required mapping relation is further constructed.
Fifth embodiment
Further, the step of constructing the mapping relationship according to the payment category and the interface category includes:
detecting a payment factor corresponding to the payment category and an interface factor corresponding to the interface category in a preset data table, and judging whether the sum of the payment factor and the interface factor is equal to a preset target value or not in real time;
if the sum of the payment factor and the interface factor is equal to the preset target value in real time, the payment category is judged to correspond to the interface category, and the mapping relation between the payment category and the interface category is correspondingly constructed.
In this embodiment, it should be noted that, after the payment type and the interface type are determined in the above manner, at this time, the payment factor corresponding to the current payment type and the interface factor corresponding to the current interface type may be detected in a preset factor data table.
Further, whether the sum of the generated payment factor and the interface factor is equal to 1 is determined in real time, wherein it is pointed out that the values of the payment factor and the interface factor are between 0 and 1. Further, if yes, the adaptation of the current payment factor and the interface factor is indicated, a mapping relation between the current payment factor and the interface factor is immediately constructed, and if not, the non-adaptation of the current payment factor and the interface factor is indicated, and other payment factors and interface factors are required to be determined again, so that a required mapping relation is finally constructed.
Referring to fig. 2, a sixth embodiment of the present invention provides:
a payment extension system, wherein the system comprises:
the extraction module is used for obtaining a plurality of payment universal interfaces and extracting an enabling program set corresponding to each payment universal interface from a preset database;
the fusion module is used for acquiring the payment program sets corresponding to each starting program set in real time, and carrying out fusion processing on the starting program sets and the payment program sets so as to generate a plurality of corresponding payment codes;
the mapping module is used for constructing a mapping relation between each payment code and each payment universal interface one by one, and binding a plurality of payment universal interfaces to a preset payment system based on the mapping relation so as to enable the payment system to finish corresponding fee payment.
Further, the fusion module is specifically configured to:
when the starting program set and the payment program set are respectively acquired, starting data contained in the starting program set are extracted in real time, and payment data contained in the payment program set are extracted in real time;
and converting the enabling data into a corresponding enabling feature sequence through a first preset algorithm, converting the payment data into a corresponding payment feature sequence, and carrying out fusion processing on the enabling feature sequence and the payment feature sequence to correspondingly generate the payment code.
Further, the fusion module is specifically further configured to:
when the starting feature sequence is acquired, sequentially detecting a plurality of starting nodes contained in the starting feature sequence from beginning to end, and sequentially adding a corresponding first sequence identifier to each starting node;
when the payment feature sequence is acquired, sequentially detecting a plurality of payment nodes contained in the payment feature sequence from beginning to end, and sequentially adding a corresponding second sequence identifier to each payment node;
and constructing a corresponding relation between the first sequence identifier and the second sequence identifier, and carrying out fusion processing on the enabling characteristic sequence and the payment characteristic sequence based on the corresponding relation so as to correspondingly generate the payment code.
Further, the fusion module is specifically further configured to:
splitting the enabling feature sequence into a plurality of corresponding first sequence segments according to a plurality of enabling nodes, and splitting the payment feature sequence into a plurality of corresponding second sequence segments according to a plurality of payment nodes;
and correspondingly connecting each first sequence segment to the starting point of each second sequence segment according to the corresponding relation to generate a corresponding fusion characteristic sequence, and converting the fusion characteristic sequence into the payment code.
Further, the expression of the first preset algorithm is:
wherein W is f (a, b) representing the enabling data or the payment data, a and b representing sequence numbers of data, db representing a conversion coefficient, V representing the enabling feature sequence or the payment feature sequence.
Further, the mapping module is specifically configured to:
when the payment code is acquired, carrying out full-disc scanning on the payment code so as to correspondingly detect the payment category corresponding to the payment code;
and detecting interface types corresponding to the payment universal interfaces one by one, and constructing the mapping relation according to the payment types and the interface types.
Further, the mapping module is specifically further configured to:
detecting a payment factor corresponding to the payment category and an interface factor corresponding to the interface category in a preset data table, and judging whether the sum of the payment factor and the interface factor is equal to a preset target value or not in real time;
if the sum of the payment factor and the interface factor is equal to the preset target value in real time, the payment category is judged to correspond to the interface category, and the mapping relation between the payment category and the interface category is correspondingly constructed.
A seventh embodiment of the invention provides a computer comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the payment extension method as described above when executing the computer program.
An eighth embodiment of the present invention provides a readable storage medium having stored thereon a computer program, wherein the program when executed by a processor implements a payment extension method as described above.
In summary, the payment expansion method and the payment expansion system provided by the embodiment of the invention can simply and rapidly complete expansion of the payment mode, thereby improving the working efficiency and improving the user experience.
The above-described respective modules may be functional modules or program modules, and may be implemented by software or hardware. For modules implemented in hardware, the various modules described above may be located in the same processor; or the above modules may be located in different processors in any combination.
Logic and/or steps represented in the flowcharts or otherwise described herein, e.g., a ordered listing of executable instructions for implementing logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). In addition, the computer readable medium may even be paper or other suitable medium on which the program is printed, as the program may be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory.
It is to be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above-described embodiments, the various steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, may be implemented using any one or combination of the following techniques, as is well known in the art: discrete logic circuits having logic gates for implementing logic functions on data signals, application specific integrated circuits having suitable combinational logic gates, programmable Gate Arrays (PGAs), field Programmable Gate Arrays (FPGAs), and the like.
In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiments or examples. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
The foregoing examples illustrate only a few embodiments of the invention and are described in detail herein without thereby limiting the scope of the invention. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the invention, which are all within the scope of the invention. Accordingly, the scope of protection of the present invention is to be determined by the appended claims.
Claims (8)
1. A payment extension method, the method comprising:
acquiring a plurality of payment universal interfaces, and extracting an enabling program set corresponding to each payment universal interface from a preset database;
acquiring a payment program set corresponding to each starting program set in real time, and carrying out fusion processing on the starting program set and the payment program set to generate a plurality of corresponding payment codes;
constructing a mapping relation between each payment code and each payment universal interface one by one, and binding a plurality of payment universal interfaces to a preset payment system based on the mapping relation so as to enable the payment system to complete corresponding fee payment;
the step of constructing the mapping relation between each payment code and each payment universal interface one by one comprises the following steps:
when the payment code is acquired, carrying out full-disc scanning on the payment code so as to correspondingly detect the payment category corresponding to the payment code;
detecting interface types corresponding to the payment universal interfaces one by one, and constructing the mapping relation according to the payment types and the interface types;
the step of constructing the mapping relation according to the payment category and the interface category comprises the following steps:
detecting a payment factor corresponding to the payment category and an interface factor corresponding to the interface category in a preset data table, and judging whether the sum of the payment factor and the interface factor is equal to a preset target value or not in real time;
if the sum of the payment factor and the interface factor is equal to the preset target value in real time, the payment category is judged to correspond to the interface category, and the mapping relation between the payment category and the interface category is correspondingly constructed.
2. The payment extension method of claim 1, wherein: the step of fusing the enablement program set and the payment program set to generate a plurality of corresponding payment codes includes:
when the starting program set and the payment program set are respectively acquired, starting data contained in the starting program set are extracted in real time, and payment data contained in the payment program set are extracted in real time;
and converting the enabling data into a corresponding enabling feature sequence through a first preset algorithm, converting the payment data into a corresponding payment feature sequence, and carrying out fusion processing on the enabling feature sequence and the payment feature sequence to correspondingly generate the payment code.
3. The payment extension method of claim 2, wherein: the step of fusing the enabling feature sequence and the payment feature sequence to correspondingly generate the payment code includes:
when the starting feature sequence is acquired, sequentially detecting a plurality of starting nodes contained in the starting feature sequence from beginning to end, and sequentially adding a corresponding first sequence identifier to each starting node;
when the payment feature sequence is acquired, sequentially detecting a plurality of payment nodes contained in the payment feature sequence from beginning to end, and sequentially adding a corresponding second sequence identifier to each payment node;
and constructing a corresponding relation between the first sequence identifier and the second sequence identifier, and carrying out fusion processing on the enabling characteristic sequence and the payment characteristic sequence based on the corresponding relation so as to correspondingly generate the payment code.
4. A payment extension method according to claim 3, characterised in that: the step of fusing the enabling feature sequence and the payment feature sequence based on the correspondence relationship to correspondingly generate the payment code includes:
splitting the enabling feature sequence into a plurality of corresponding first sequence segments according to a plurality of enabling nodes, and splitting the payment feature sequence into a plurality of corresponding second sequence segments according to a plurality of payment nodes;
and correspondingly connecting each first sequence segment to the starting point of each second sequence segment according to the corresponding relation to generate a corresponding fusion characteristic sequence, and converting the fusion characteristic sequence into the payment code.
5. The payment extension method of claim 2, wherein: the expression of the first preset algorithm is as follows:
wherein W is f (a, b) representing the enabling data or the payment data, a and b representing sequence numbers of data, db representing a conversion coefficient, V representing the enabling feature sequence or the payment feature sequence.
6. A payment extension system for implementing the payment extension method of claims 1 to 5, the system comprising:
the extraction module is used for obtaining a plurality of payment universal interfaces and extracting an enabling program set corresponding to each payment universal interface from a preset database;
the fusion module is used for acquiring the payment program sets corresponding to each starting program set in real time, and carrying out fusion processing on the starting program sets and the payment program sets so as to generate a plurality of corresponding payment codes;
the mapping module is used for constructing a mapping relation between each payment code and each payment universal interface one by one, and binding a plurality of payment universal interfaces to a preset payment system based on the mapping relation so as to enable the payment system to finish corresponding fee payment.
7. A computer comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the payment extension method of any one of claims 1 to 5 when the computer program is executed.
8. A readable storage medium, on which a computer program is stored, characterized in that the program, when executed by a processor, implements a payment extension method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311686852.6A CN117435174B (en) | 2023-12-11 | 2023-12-11 | Payment expansion method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311686852.6A CN117435174B (en) | 2023-12-11 | 2023-12-11 | Payment expansion method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117435174A CN117435174A (en) | 2024-01-23 |
| CN117435174B true CN117435174B (en) | 2024-04-09 |
Family
ID=89551692
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311686852.6A Active CN117435174B (en) | 2023-12-11 | 2023-12-11 | Payment expansion method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117435174B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105427101A (en) * | 2015-11-19 | 2016-03-23 | 成都连银信息技术有限公司 | Unified payment access gateway supporting multiple payment channels |
| CN106503555A (en) * | 2016-10-21 | 2017-03-15 | 维沃移动通信有限公司 | A kind of method for ensureing safety of payment and mobile terminal |
| CN107256482A (en) * | 2017-06-09 | 2017-10-17 | 深圳市茁壮网络股份有限公司 | A kind of method of payment and payment mechanism |
| WO2018001120A1 (en) * | 2016-06-28 | 2018-01-04 | 阿里巴巴集团控股有限公司 | Method and device facilitating expansion of primary payment instruments |
| CN108256846A (en) * | 2016-12-28 | 2018-07-06 | 航天信息股份有限公司 | A kind of method and system of integrated payment |
| CA3060205A1 (en) * | 2017-05-10 | 2018-11-15 | Moua Branckay Cesar Serge Mango | Universal fare payment and collection system |
| CN109947994A (en) * | 2018-08-10 | 2019-06-28 | 北京京东金融科技控股有限公司 | Processing method, device, medium and the electronic equipment of payment process |
| CN110442375A (en) * | 2019-07-05 | 2019-11-12 | 中国平安财产保险股份有限公司 | Mobile payment product channel integrates method, apparatus, equipment and storage medium |
| CN112116438A (en) * | 2020-07-31 | 2020-12-22 | 福建亿能达信息技术股份有限公司 | Multi-channel payment integration method, platform, equipment and medium |
-
2023
- 2023-12-11 CN CN202311686852.6A patent/CN117435174B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105427101A (en) * | 2015-11-19 | 2016-03-23 | 成都连银信息技术有限公司 | Unified payment access gateway supporting multiple payment channels |
| WO2018001120A1 (en) * | 2016-06-28 | 2018-01-04 | 阿里巴巴集团控股有限公司 | Method and device facilitating expansion of primary payment instruments |
| CN106503555A (en) * | 2016-10-21 | 2017-03-15 | 维沃移动通信有限公司 | A kind of method for ensureing safety of payment and mobile terminal |
| CN108256846A (en) * | 2016-12-28 | 2018-07-06 | 航天信息股份有限公司 | A kind of method and system of integrated payment |
| CA3060205A1 (en) * | 2017-05-10 | 2018-11-15 | Moua Branckay Cesar Serge Mango | Universal fare payment and collection system |
| CN107256482A (en) * | 2017-06-09 | 2017-10-17 | 深圳市茁壮网络股份有限公司 | A kind of method of payment and payment mechanism |
| CN109947994A (en) * | 2018-08-10 | 2019-06-28 | 北京京东金融科技控股有限公司 | Processing method, device, medium and the electronic equipment of payment process |
| CN110442375A (en) * | 2019-07-05 | 2019-11-12 | 中国平安财产保险股份有限公司 | Mobile payment product channel integrates method, apparatus, equipment and storage medium |
| CN112116438A (en) * | 2020-07-31 | 2020-12-22 | 福建亿能达信息技术股份有限公司 | Multi-channel payment integration method, platform, equipment and medium |
Non-Patent Citations (3)
| Title |
|---|
| Integration Model of Multiple Payment Gateways for Online Split Payment Scenario;Muchsin Hisyam Etc.;2022 International Conference on Information Management and Technology (ICIMTech);20221021;全文 * |
| 基于ESB的医院统一移动支付平台应用研究;袁骏毅;陈璨;;中国医疗设备;20200310(03);全文 * |
| 通信运营商电子渠道服务扩展功能的开发;白勇;中国优秀硕士论文电子期刊网;20200115;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117435174A (en) | 2024-01-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104572072B (en) | A kind of language transfer method and equipment to the program based on MVC pattern | |
| CN103488384A (en) | Voice assistant application interface display method and device | |
| CN110554958A (en) | Graph database testing method, system, device and storage medium | |
| CN104765745A (en) | Method and system for logic verification of load data in database | |
| CN106326116A (en) | Method and device for testing product | |
| CN115730605B (en) | Data analysis method based on multidimensional information | |
| CN113868507A (en) | Bidding information acquisition method and device combining RPA and AI and electronic equipment | |
| CN117435174B (en) | Payment expansion method and system | |
| CN112364828B (en) | Face recognition method and financial system | |
| CN110362313A (en) | A kind of form validation method, client and server | |
| CN107679889B (en) | The recognition methods of potential customers a kind of and terminal device | |
| CN113743732A (en) | Intelligent quality detection method, system, computer and readable storage medium | |
| CN116449092A (en) | Automobile power detection method, system, computer and readable storage medium | |
| CN112464085B (en) | House source recommendation method and device, electronic equipment and storage medium | |
| CN110378735A (en) | Resource information management system and method | |
| CN112329735B (en) | Training method of face recognition model and online education system | |
| CN115643149A (en) | Equipment management method and system | |
| CN112395473A (en) | Method and device for classifying parts in CAE model and storage medium | |
| CN110889369A (en) | Self-service machine equipment and operation method thereof | |
| CN110188274A (en) | Search for error correction method and device | |
| CN111027667B (en) | Method and device for identifying intention category | |
| CN117896410A (en) | User usage data uploading method and system | |
| CN112115346B (en) | Clue data processing method and device | |
| CN115934142A (en) | Geological disaster equipment management method, system, readable storage medium and computer | |
| CN110109976A (en) | Data processing method, device, system and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |