CN114240641B - Credit transfer method and system - Google Patents
Credit transfer method and system Download PDFInfo
- Publication number
- CN114240641B CN114240641B CN202210168543.9A CN202210168543A CN114240641B CN 114240641 B CN114240641 B CN 114240641B CN 202210168543 A CN202210168543 A CN 202210168543A CN 114240641 B CN114240641 B CN 114240641B
- Authority
- CN
- China
- Prior art keywords
- credit
- transfer
- enterprise
- node
- flow
- 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
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/03—Credit; Loans; Processing thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/067—Enterprise or organisation modelling
-
- 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
- G06Q30/00—Commerce
- G06Q30/018—Certifying business or products
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Finance (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Technology Law (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a credit transfer method and a credit transfer system, wherein the credit transfer method comprises the following steps: splitting and circulating the credit based on the tree structure data chain; wherein, the rule of splitting circulation includes: the sub credit amount which belongs to the same divided credit amount can not be transferred again after being transferred out by the sub node; and sub credit amounts from two different root credit amounts can not be combined into one sub credit amount to be split and circulated; modeling the credit splitting and flow transferring process based on the closure table, and enabling the transferring-out node to be a joint primary key of the transfer transaction for the same credit transferred out by the transferring-in node. The invention can improve the tracking and backtracking efficiency of the credit circulation link, reduce the integrity of circulation record data and the consistency control difficulty, and simplify the data verification process.
Description
Technical Field
The invention relates to the technical field of credit circulation, in particular to a credit circulation method and a credit circulation system capable of realizing credit splitting and tracking backtracking of a circulation data chain.
Background
The core of the supply chain financial business is based on accounts payable of core enterprises, and the conversion of enterprise credit into 'payment commitment' which can be circulated, financed and flexibly configured to complete the multi-level credit transfer between enterprises in the supply chain; meanwhile, the system cooperates with a bank, and the bank carries out guarantee to realize that:
1. the separation of commodity exchange and currency exchange reduces the demand of payment enterprises on operating funds;
2. the credit circulation of the core enterprise is guaranteed by a bank, so that the risk of bad account of the seller is effectively reduced;
3. online circulation, timely transmission of credit and related service information, accurate feedback of market demand information and financing party operation information, and reduction of financing risk;
in order to realize the tracking and backtracking of credit split and circulation data chains, a common linked list data structure and a common linked list data method are used for circulating each split and recording a credit owner and an owned credit limit before splitting, and a credit receiver and an accepted limit after splitting. Forming a record group corresponding to a plurality of splitting records from a credit source through a primary splitting flow; and forming a record set consisting of a plurality of record groups through multi-stage splitting circulation.
In the practical application of credit flow, flow of 4-5 levels can occur, the splitting times can reach 200 times and 300 times, which relate to 100 suppliers and 200 suppliers, and a plurality of credit sources are parallel to cause the cases of cross flow and reverse flow; from the analysis of the circulation process, the split levels are crossed to form a closed loop. Thus, the above conventional data structure and corresponding algorithm, when multiple credit sources are circulated in parallel, have the following problems:
1) tracking and backtracking the credit circulation link, the efficiency is low, and recursive search is needed to complete the query of a complete link;
2) data integrity and consistency of credit flow are not easy to control, and the change of any flow record needs to check the constraint relation of all upstream and downstream flow records.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a credit flow method and a credit flow system, which can improve the tracking and backtracking efficiency of a credit flow link, reduce the integrity of flow record data and the consistency control difficulty, and simplify the data verification process.
The invention discloses a credit transfer method, which comprises the following steps:
splitting and circulating the credit based on the tree structure data chain; wherein the rule for splitting the flow comprises: the sub credit amount which belongs to the same divided credit amount can not be transferred again after being transferred out by the sub node; and sub-credits from two different root credits cannot be merged into one sub-credit for split circulation;
modeling the credit split flow transfer process based on the closure table, and taking the same credit transferred from the transfer node as a joint primary key of the transfer transaction by the transfer node; wherein the closure table comprises: type of credit packet, egress node, ingress node, flow hierarchy and credit.
As a further improvement of the invention, the credit split circulation management model established based on the closure table sequentially comprises the following steps:
a credit flow path including a superior credit ID, a subordinate credit ID, and a flow level;
the credit transfer node comprises a credit transfer node ID, a credit ID, a granted enterprise code, an accepted enterprise code, a transfer credit and transfer time;
the credit comprises a credit ID, a core enterprise opening code, an enterprise accepting code, a corresponding account receivable ID, an opening credit limit and opening time;
accounts receivable due to due including an ID of accounts receivable due to due, an enterprise code due to due, an amount receivable due to due, a transferred credit and a time receivable due to due;
a core enterprise and an upstream enterprise, the core enterprise and the upstream enterprise including an enterprise code and an enterprise name.
As a further improvement of the invention, the method also comprises the following steps:
and inquiring a complete transfer link through one-time search based on the closure table.
As a further improvement of the present invention, the query method for the assignment link includes:
selecting transfer links of the same type of the credit packets from the closure table; or the like, or a combination thereof,
and selecting a transfer link from a certain transfer node from the closure table.
The invention also discloses a credit circulation system, which comprises:
the splitting module is used for splitting and circulating the credit based on the tree-structured data chain; wherein the rule for splitting the flow comprises: the sub credit amount which belongs to the same divided credit amount can not be transferred again after being transferred out by the sub node; and sub-credits from two different root credits cannot be merged into one sub-credit for split circulation;
the tracking backtracking module is used for modeling the credit split flow transfer process based on the closure table and setting the same credit transferred from the transfer node as a joint primary key of the transfer transaction by the transfer node; wherein the closure table comprises: type of credit packet, egress node, ingress node, flow level and credit.
As a further improvement of the invention, the credit split flow management model established based on the closure table sequentially comprises:
a credit flow path including a superior credit ID, a subordinate credit ID, and a flow level;
the credit transfer node comprises a credit transfer node ID, a credit ID, a granted enterprise code, an accepted enterprise code, a transfer credit and transfer time;
the credit amount comprises a credit amount ID, a core enterprise opening code, an enterprise accepting code, a corresponding account receivable ID, a credit amount opening amount and opening time;
accounts receivable due to due including an ID of accounts receivable due to due, an enterprise code due to due, an amount receivable due to due, a transferred credit and a time receivable due to due;
a core enterprise and an upstream enterprise, the core enterprise and the upstream enterprise including an enterprise code and an enterprise name.
As a further improvement of the invention, the method also comprises the following steps:
and inquiring a complete transfer link through one-time search based on the closure table.
As a further improvement of the present invention, the query method for the assignment link includes:
selecting transfer links of the same type of the credit packets from the closure table; or the like, or a combination thereof,
and selecting a transfer link from a certain transfer node from the closure table.
Compared with the prior art, the invention has the beneficial effects that:
based on the actual application of supply chain finance, the invention establishes a credit split circulation rule and simplifies a complex data chain with a mesh structure into a data chain with a tree structure;
the data structure of the closure table is adopted to model the credit splitting and circulating process, the complexity of data link tracking and backtracking is reduced, the algorithm for updating the data link is simplified, and the efficiency of credit searching, adding and updating is effectively improved.
Drawings
FIG. 1 is a flow chart of credits for a conventional mesh structure;
FIG. 2 is a tree credit flow diagram disclosed in the present invention;
FIG. 3 is a schematic diagram illustrating a closure table-based credit split flow model established according to the present invention;
fig. 4 is a schematic diagram of credit line splitting disclosed in embodiment 1 of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
The invention is described in further detail below with reference to the following drawings:
supporting the transfer of credit, the following basic constraint conditions need to be satisfied:
1. the receivable balance > = 0 for upstream enterprises (transfer-in nodes);
2. credit balance of upstream enterprise (transfer-in node) = 0;
3. the core enterprise (roll-out node) can only grant credit and cannot accept the credit;
4. and sigma core enterprises grant credit amount =sigmaeach upstream enterprise (transfer-in node) credit amount balance.
Credit flow needs support:
1. a new node (a transfer-in node) can be added under any transfer-out node;
2. any leaf node (roll-out node) not linked with the roll-in node can be deleted;
3. updating the amount of credit flow between the roll-out node and the roll-in node, and updating the credit balance of the roll-out node at the same time;
4. the credit circulation chain can be tracked and traced back quickly.
With enterprises as node units, the existing credit flow chain will become a mesh structure as shown in fig. 1, which results in that the check of the above constraints will be very difficult.
Meanwhile, the data structure describing the mesh structure is complex, and the algorithm is abnormally complex for operations of adding, deleting, changing and checking which need to be realized in circulation. For model management of mesh structures, attempts have been made to employ mesh databases.
The core of the mesh database is nodes for establishing a mesh data model, and the processing method is to decompose a mesh structure into a plurality of secondary tree structures called as a system; a family type is a description of a relationship between two or more record types; in one system type, one record type is in a leading position, which is called as a system main record type, and the other record types are called as member record types; the association between the family and the member is a one-to-many association. The advantages of the mesh database model are that it can describe the real world more directly, and the flow chain tracking and backtracking is fast. But the disadvantage is that the structure is complicated, and the integrity and consistency of data are difficult to maintain as the application environment expands.
Therefore, the invention provides a credit circulation method, which comprises the following steps:
s1, splitting and circulating the credit based on the tree structure data chain; wherein the content of the first and second substances,
as shown in fig. 2, the rule for splitting the flow includes:
1) the sub credit amount which belongs to the same credit amount and is split out cannot be transferred in again after being transferred out by the sub node; the constraint is in accordance with business logic, namely, the credit amount which is already transferred out by a certain discount amount cannot be purchased by a higher discount amount;
for example, as shown in fig. 2, G01 cannot be transferred into the container after being transferred out of G05 and G06;
2) the sub credit amounts from two different root credit amounts can not be combined into one sub credit amount to be split and circulated, namely, the sub credit amount can only be directly transferred out or transferred out after being split, and the constraint is in accordance with business logic;
for example, as shown in fig. 2, after H01 is shifted out by G01 and G02, G01 and G02 cannot be combined into H03.
Based on this, the present invention can simplify the data chain of the mesh structure as shown in fig. 1 into the data chain of the tree structure as shown in fig. 2.
S2, after the mesh structure is converted into a tree structure, modeling is carried out on the credit split flow transfer process based on a closure table, and the same credit transferred from a transfer node (core enterprise) to a transfer node (upstream enterprise) is a joint primary key of transfer transaction; wherein the content of the first and second substances,
the closure table includes: the type of the credit packet, the roll-out node, the roll-in node, the flow hierarchy and the credit;
as shown in fig. 3, the credit split flow management model and the establishment method established based on the closure table sequentially include:
a credit transfer path, wherein the credit transfer path comprises a superior credit ID, a subordinate credit ID and a transfer level;
the credit transfer node comprises a credit transfer node ID, a credit ID, a granted enterprise code, an accepted enterprise code, a transfer credit and transfer time;
the credit comprises a credit ID, a core enterprise opening code, an enterprise accepting code, a corresponding account receivable ID, an credit opening amount and opening time;
the accounts payable comprises accounts payable ID, enterprise code, amount payable, transferred credit and amount payable time;
core enterprise and upstream enterprise, the core enterprise and upstream enterprise including enterprise code and enterprise name.
Based on the closure table, a complete transfer link is inquired through one-time search; for example, transfer links of the same type of credit package are selected from the closure table; alternatively, a transfer link from a certain transfer node is selected from the closure table.
The closure table is a simple and elegant solution for solving the hierarchical storage, records all node relations in the table, and is not only a direct parent-child relation; the closure model is adopted to manage the credit circulation, and is simpler compared with other common models; in the aspect of ensuring the integrity of the reference, the consistency of addition, deletion and modification can be ensured through transaction control; through the credit circulation path, the complete credit circulation link is inquired, so that multilayer recursion is avoided, the efficiency is high, and the performance comparison is shown in a table 1:
TABLE 1
The invention also provides a credit circulation system, comprising:
a splitting module, configured to implement S1;
a trace back module, configured to implement S2 described above.
Example 1:
the core enterprise H01 has credited 1000 and 600 ten thousand business events to the upstream two enterprises G01 and G02, respectively, based on accounts receivable. The enterprises of G01 and G02 transfer the credit to upstream suppliers, and a credit line splitting process shown in FIG. 4 is formed; based on the closure table, the split record is recorded, as shown in table 2:
TABLE 2
In practical application, if the transfer link is split by tracing the credit line of the core enterprise trust package C010001, a complete transfer link can be queried by one search, as shown in table 3:
TABLE 3
The searching method comprises the following steps:
SELECT UPSTRM_ENT, DWNSTM_ENT, DISTANCE FROM CRDT_TRSF_FLOW
WHERE CORE_CRDT=’ C010001’ ORDER BY DISTANCE ASC
in practical applications, if a transfer link from a certain enterprise (e.g. G01) is to be traced, the complete transfer link can be searched by one search, as shown in table 4:
TABLE 4
The searching method comprises the following steps:
WITH RECURSIVE _children AS
(
SELECT ctf.* FROM CRDT_TRSF_FLOW ctf WHERE ctf.DWNSTM_ENT='G01'
UNION ALL
SELECT ctf.* FROM _children,CRDT_TRSF_FLOW ctf WHERE ctf.DWNSTM_ENT=_children.UPSTRM_ENT
)
SELECT * FROM _children order by distance
the invention has the advantages that:
1. inquiring a complete credit circulation data chain, simplifying recursive search into index search once, and improving the efficiency by n times (n is the maximum credit circulation level);
2. a credit circulation record is newly built, only one-time closure table insertion operation is needed, and efficiency is doubled compared with that of common adjacency table operation (a sub-table record needs to be newly built and a superior table needs to be updated);
3. and updating a credit flow record, namely only one time of updating the closure table, and the efficiency is doubled compared with that of the common adjacent table operation (the sub-table records need to be updated respectively and the upper-level table records need to be updated).
The above is only a preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes will occur to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (8)
1. A credit flow method, comprising:
splitting and circulating the credit based on the tree structure data chain; wherein the rule for splitting the flow comprises: the sub credit amount which belongs to the same divided credit amount can not be transferred again after being transferred out by the sub node; and sub-credits from two different root credits cannot be merged into one sub-credit for split circulation;
modeling the credit split flow transfer process based on the closure table, and taking the same credit transferred from the transfer node as a joint primary key of the transfer transaction by the transfer node; wherein the closure table comprises: type of credit packet, egress node, ingress node, flow hierarchy and credit.
2. The credit flow method of claim 1, wherein the credit split flow management model established based on the closure table sequentially comprises:
a credit flow path including a superior credit ID, a subordinate credit ID, and a flow level;
the credit transfer node comprises a credit transfer node ID, a credit ID, a granted enterprise code, an accepted enterprise code, a transfer credit and transfer time;
the credit comprises a credit ID, a core enterprise opening code, an enterprise accepting code, a corresponding account receivable ID, an opening credit limit and opening time;
accounts receivable due to due including an ID of accounts receivable due to due, an enterprise code due to due, an amount receivable due to due, a transferred credit and a time receivable due to due;
a core enterprise and an upstream enterprise, the core enterprise and the upstream enterprise including an enterprise code and an enterprise name.
3. The credit circulation method of claim 1, further comprising:
and inquiring a complete transfer link through one-time search based on the closure table.
4. The credit transfer method of claim 3, wherein the inquiry method of the transfer link comprises:
selecting transfer links of the same type of the credit packets from the closure table; or the like, or a combination thereof,
and selecting a transfer link from a certain transfer node from the closure table.
5. A credit circulation system, comprising:
the splitting module is used for splitting and transferring the credit based on the data chain with the tree structure; wherein the rule for splitting the flow comprises: the sub credit amount which belongs to the same divided credit amount can not be transferred again after being transferred out by the sub node; and sub-credits from two different root credits cannot be merged into one sub-credit for split circulation;
the tracking backtracking module is used for modeling the credit split flow transfer process based on the closure table and setting the same credit transferred from the transfer node as a joint primary key of the transfer transaction by the transfer node; wherein the closure table comprises: type of credit packet, egress node, ingress node, flow hierarchy and credit.
6. The credit flow system of claim 5, wherein the credit split flow management model established based on the closure table sequentially comprises:
a credit flow path including a superior credit ID, a subordinate credit ID, and a flow level;
the credit transfer node comprises a credit transfer node ID, a credit ID, a granted enterprise code, an accepted enterprise code, a transfer credit and transfer time;
the credit comprises a credit ID, a core enterprise opening code, an enterprise accepting code, a corresponding account receivable ID, an opening credit limit and opening time;
accounts receivable due to due including an ID of accounts receivable due to due, an enterprise code due to due, an amount receivable due to due, a transferred credit and a time receivable due to due;
a core enterprise and an upstream enterprise, the core enterprise and the upstream enterprise including an enterprise code and an enterprise name.
7. The credit circulation system of claim 5, further comprising:
and inquiring a complete transfer link through one-time search based on the closure table.
8. The credit circulation system of claim 7, wherein the inquiry method of the transfer link comprises:
selecting transfer links of the same type of the credit packets from the closure table; or the like, or, alternatively,
and selecting a transfer link from a certain transfer node from the closure table.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210168543.9A CN114240641B (en) | 2022-02-24 | 2022-02-24 | Credit transfer method and system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210168543.9A CN114240641B (en) | 2022-02-24 | 2022-02-24 | Credit transfer method and system |
Publications (2)
Publication Number | Publication Date |
---|---|
CN114240641A CN114240641A (en) | 2022-03-25 |
CN114240641B true CN114240641B (en) | 2022-05-20 |
Family
ID=80747973
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210168543.9A Active CN114240641B (en) | 2022-02-24 | 2022-02-24 | Credit transfer method and system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN114240641B (en) |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6873972B1 (en) * | 2000-08-01 | 2005-03-29 | General Electric Company | Systems and methods for credit line monitoring |
CN104809190A (en) * | 2015-04-21 | 2015-07-29 | 浙江大学 | Database access method of tree-like structure data |
CN107679983A (en) * | 2017-10-20 | 2018-02-09 | 京北方信息技术股份有限公司 | Amount tree constructing method and device, amount take route inspection method and apparatus |
CN109615511A (en) * | 2019-01-07 | 2019-04-12 | 北京锐融天下科技股份有限公司 | A kind of supply chain banking software system and method |
CN111179094A (en) * | 2020-01-06 | 2020-05-19 | 广东穗银云链科技有限公司 | Block chain-based certificate transfer management method |
CN111708849A (en) * | 2020-06-18 | 2020-09-25 | 北京同邦卓益科技有限公司 | Data management method, device, equipment and storage medium |
-
2022
- 2022-02-24 CN CN202210168543.9A patent/CN114240641B/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6873972B1 (en) * | 2000-08-01 | 2005-03-29 | General Electric Company | Systems and methods for credit line monitoring |
CN104809190A (en) * | 2015-04-21 | 2015-07-29 | 浙江大学 | Database access method of tree-like structure data |
CN107679983A (en) * | 2017-10-20 | 2018-02-09 | 京北方信息技术股份有限公司 | Amount tree constructing method and device, amount take route inspection method and apparatus |
CN109615511A (en) * | 2019-01-07 | 2019-04-12 | 北京锐融天下科技股份有限公司 | A kind of supply chain banking software system and method |
CN111179094A (en) * | 2020-01-06 | 2020-05-19 | 广东穗银云链科技有限公司 | Block chain-based certificate transfer management method |
CN111708849A (en) * | 2020-06-18 | 2020-09-25 | 北京同邦卓益科技有限公司 | Data management method, device, equipment and storage medium |
Non-Patent Citations (1)
Title |
---|
额度授信管理系统的设计与实现;蔡秀娟;《赤峰学院学报(自然科学版)》;20141231;第30卷(第12期);20-22 * |
Also Published As
Publication number | Publication date |
---|---|
CN114240641A (en) | 2022-03-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN107766579B (en) | Method for designing main data management system based on XBRL standard | |
US8364517B2 (en) | Computer-implemented systems and methods for forecast reconciliation | |
US8583593B1 (en) | Systems and methods for optimizing database queries | |
US11532040B2 (en) | International cash management software using machine learning | |
CN110209826A (en) | A kind of financial map construction and analysis method towards bank risk control | |
WO2000068860A2 (en) | Method of social network generation for customer relationships | |
CN108108452B (en) | Finance data storage and inquiry system, finance data storage and querying method | |
US20100174628A1 (en) | Use of separate rib ledgers in a computerized enterprisere source planning system | |
US11995622B2 (en) | Method of international cash management using machine learning | |
CN111596956B (en) | Information processing method and device based on block chain, electronic equipment and medium | |
US11188981B1 (en) | Identifying matching transfer transactions | |
Dong et al. | Cost index predictions for construction engineering based on LSTM neural networks | |
CN114240641B (en) | Credit transfer method and system | |
CN107980147B (en) | Tracking data flows in a distributed computing system | |
Stoykova et al. | Risk management and accounting with Fintech | |
Dong et al. | On some extended mixed integer optimization models of the Eisenberg–Noe model in systemic risk management | |
D’Atri et al. | Towards trustworthy financial reports using blockchain | |
CN111723129B (en) | Report generation method, report generation device and electronic equipment | |
CN105389337A (en) | Method for searching big data space for statistical significance mode | |
Wang et al. | Blockchain-Based Distributed Reputation for a Cap-and-Trade Carbon Emission System | |
CN1988475A (en) | Data integrating method for logic isomeric system in counterpart network | |
McCowan et al. | Decision support system to evaluate and compare concession options | |
CN113449005B (en) | Account management method and device | |
Van Thanh Le et al. | Enabling Financial Reports Transparency and Trustworthiness using Blockchain Technology | |
Panjaitan et al. | User’s Acceptance and Intention of Blockchain Technology with UTAUT 3 Model: Beneficial or Detrimental in the Indonesian Banking Industry |
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 |