CN111325577B - Advertisement block resource allocation method in block chain - Google Patents

Advertisement block resource allocation method in block chain Download PDF

Info

Publication number
CN111325577B
CN111325577B CN202010096370.5A CN202010096370A CN111325577B CN 111325577 B CN111325577 B CN 111325577B CN 202010096370 A CN202010096370 A CN 202010096370A CN 111325577 B CN111325577 B CN 111325577B
Authority
CN
China
Prior art keywords
block
advertisement
sponsor
sponsors
advertisements
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
Application number
CN202010096370.5A
Other languages
Chinese (zh)
Other versions
CN111325577A (en
Inventor
李磊
方珲
卜晨阳
吴信东
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hefei University of Technology
Original Assignee
Hefei University of Technology
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 Hefei University of Technology filed Critical Hefei University of Technology
Priority to CN202010096370.5A priority Critical patent/CN111325577B/en
Publication of CN111325577A publication Critical patent/CN111325577A/en
Application granted granted Critical
Publication of CN111325577B publication Critical patent/CN111325577B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241Advertisements
    • G06Q30/0251Targeted advertisements

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Finance (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a method for distributing advertisement block resources in a block chain, which comprises the following steps: 1, a sponsor provides cloud service duration for a block chain system and provides related data of an advertisement to be issued; 2, constructing a first block, and calculating a group of probability intervals according to the ratio of the cloud service time provided by each sponsor to the total cloud service time and the ratio of the advertisement length provided by each sponsor to the total advertisement release length; 3, continuing to construct subsequent blocks, and selecting advertisements of corresponding sponsors to write the advertisements in the advertisement blocks of the corresponding blocks through a probability interval in which random numbers generated by a random number algorithm fall; 4 judging whether the advertisement block resources are completely distributed and deciding to loop or exit. The invention can solve the technical problems of automatic distribution and low distribution efficiency of advertisement block resources in the prior block chain technology, thereby realizing the purpose of accurately delivering the cloud service sponsor advertisement on the block chain.

Description

Advertisement block resource allocation method in block chain
Technical Field
The invention belongs to the technical field of block chains, and particularly relates to an advertisement block resource allocation method in a block chain.
Background
The block link is a new data technology combination, is also a novel decentralized protocol, and has the characteristics of openness, autonomy, information non-tamper property and the like. The block chain is also a public and transparent distributed account book in nature, and the core technology comprises asymmetric encryption, a consensus mechanism and an intelligent contract.
The block chain is provided with a plurality of blocks, each block records all transaction behaviors of all nodes of the block, the blocks are connected in front and back, the next block contains the hash value of the previous block, and all the blocks are connected together to form the block chain.
Advertisement is information data that is widely delivered to the public for a specific need through a certain form of media.
The cloud service is an IT service mode which is distributed and metered according to the requirement and is externally provided under the support of the technical architecture of cloud computing. This service model can replace the IT service built by the user locally.
With the development of the block chain, the application of the block chain gradually enters the cloud computing field and the advertisement operation field, the block chain can be erected on a cloud service platform, and advertisement data can also be written into the block chain. The existing block chain technology has extremely low efficiency in distributing the advertisement block resources, can not realize fair and fair automatic distribution based on a block chain algorithm, and advertisement contracts need offline negotiation and are not intelligent and digital enough, so that a large amount of advertisement block resources are not fully utilized, idle and wasted. A large number of cloud service sponsors and a block chain algorithm per se urgently need an advertisement block resource allocation method with fairness, decentralization and high efficiency.
Disclosure of Invention
The invention aims to solve the defects in the prior art, and provides an advertisement block resource distribution method in a block chain, so as to solve the technical problems of low advertisement block resource distribution efficiency and automatic advertisement block resource distribution in the prior block chain, and further achieve the purpose of accurately putting advertisements of cloud service sponsors on the block chain fairly and fairly.
In order to achieve the purpose, the invention adopts the following technical scheme:
the invention relates to a resource allocation method of advertisement blocks in a block chain, which is characterized in that the resource allocation method is applied to a plurality of miners and n sponsors S = { S = (S) 1 ,s 2 ,…,s i ,…,s n And block chains, where s i Represents the ith sponsor; will the ith sponsor s i Is recorded as g i I th sponsor s i Length of advertisement is marked as l i I th sponsor s i The time length of the cloud service required to be provided is recorded as a i Then the total advertisement length of n sponsors is
Figure BDA0002385381420000011
The total cloud service duration required to be provided by the n sponsors is
Figure BDA0002385381420000021
Assuming that m blocks exist in the block chain, and marking any one block as a jth block; the block length of each block is marked as G, i is more than or equal to 1 and less than or equal to n; j is more than or equal to 1 and less than or equal to m; the advertisement block resource allocation method is carried out according to the following steps:
step 1, initializing j =1, and constructing a jth block;
step 1.1, making the block head of the jth block empty; the block body of the jth block is composed of service contents corresponding to the block chain and subsequent advertisement blocks;
step 1.2, obtaining the ith sponsor s by using the formula (1) i Is selected by the advertisement of (1) i To obtain an initial probability that n sponsors' advertisements are selected { p } 1 ,p 2 ,…,p i ,…,p n }:
Figure BDA0002385381420000022
Step 1.3, calculate the ith sponsor s using equation (2) i Is selected, probability p' i To obtain a probability P '= { P' that the n sponsors 'advertisements are selected' 1 ,p′ 2 ,…,p′ i ,…,p′ n }:
Figure BDA0002385381420000023
In the formula (2), p represents an initial total probability and has
Figure BDA0002385381420000024
Step 1.4, making p' 0 =0, and calculate the ith sponsor s using equation (3) i Is selected, is selected by the advertisement i Thus, the advertisements of n sponsors are selectedProbability interval Y = { Y in (1) = 1 ,y 2 ,…,y i ,…,y n };
Figure BDA0002385381420000025
Step 2, miners provide calculation power to obtain the accounting right of one block in the block chain, and the accounting right is used for constructing the j +1 th block; wherein, the block head of the j +1 th block is the address of the j block; the block body of the (j + 1) th block is a service content and a subsequent advertisement block corresponding to the block chain; the advertisement blocks in the block body of the j +1 th block provide all the character advertisements for all the selected sponsors, and the total length is L 0 (ii) a The block tail of the j +1 th block is the encryption information of the block head and the block body of the j +1 th block;
and 3, after j +1 is assigned to j, judging whether j is greater than or equal to m, if so, indicating that the distribution of the advertisement block resources in the block chain is finished, otherwise, returning to the step 2.
The advertisement block resource allocation method of the present invention is also characterized in that the advertisement content of the advertisement block in the block of the (j + 1) th block in the step 2 is selected according to the following process:
step 2.1, recording the current remaining available blocks of the advertisement blocks in the block body of the j +1 th block as the I-th remaining available block, and initializing I =0;
record the length of the I-th remaining usable block of the advertisement block in the j + 1-th block as
Figure BDA0002385381420000031
And initialize
Figure BDA0002385381420000032
Defining the minimum value of the length of the advertisement provided by all sponsors as L min =min{l i |i=1,2,…,n};
Step 2.2, assigning the value of I +1 to I;
step 2.3, if
Figure BDA0002385381420000033
Then a random number x belonging to the interval [0, 1) is generated by using the Monte Carlo algorithm according to the probability interval Y in which the advertisements of the n sponsors S are selected, and the probability interval Y in which the random number x falls is determined i Determining sponsors s to be allocated in the ith remaining available chunk i And a sponsor mark corresponding to the distributed advertisement is marked as s α Sponsor s α Length of advertisement is recorded as l α (ii) a Otherwise, indicating that the resource allocation of the advertisement block of the (j + 1) th block is finished, and executing the step 3;
step 2.4, if
Figure BDA0002385381420000034
Then will be
Figure BDA0002385381420000035
Is assigned to
Figure BDA0002385381420000036
And will sponsor s α Advertisement content g α After the selected advertisement is selected, returning to the step 2.2; otherwise, return to step 2.3.
Compared with the prior art, the invention has the beneficial effects that:
the method and the device creatively calculate the probability that the advertisements of the sponsors are written into the advertisement blocks according to the cloud service time length resources provided by each sponsor and the complexity of the advertisement data provided by the sponsors in an automatic fair and fair manner, form a group of probability intervals through multiple calculations, and disclose and transparently automatically select the advertisement data from the advertisement data provided by the sponsors and write the advertisement data into the advertisement blocks through the group of probability intervals and a Monte Carlo algorithm, thereby solving the technical problems that the efficiency of the distribution of the advertisement block resources is extremely low in the existing block chain technology, and the decentralized automatic distribution of the advertisement block resources according to the cloud service time length resources provided by the sponsors cannot be realized. The invention has reasonable design, is fair and fair, and realizes the technical effect of accurately releasing the advertisements of the cloud service sponsor on the block chain.
Drawings
Fig. 1 is a flowchart of a block chain-based advertisement block resource allocation method according to the present invention.
Detailed Description
In this embodiment, taking a block chain system sponsored by 6 cloud service sponsors and used in the catering industry as an example, according to the advertisement block resource allocation method based on the block chain in the present invention, a flow is shown in fig. 1, and includes the following steps:
step one, a sponsor provides cloud service duration for a block chain system and provides relevant data of advertisements to be issued.
In the prior art, the application of a block chain system in any industry needs extremely high server cost not only in the catering industry, but also in any industry, after the block chain is applied to the cloud computing field, each block chain system needs to occupy a considerable part of cloud server resources for data operation, and the cloud server resources are replaced by the cloud server time provided by a sponsor in the invention.
Meanwhile, as long as the users in the block chain are in the same, the existing block chain advertisement operation can put advertisements on the users.
In a system consisting of several miners and 6 sponsors S = { S = { (S) } 1 ,s 2 ,s 3 ,s 4 ,s 5 ,s 6 The method is applied to a network environment formed by block chains in the catering industry; the service duration of the cloud server is provided by 6 sponsors, and the cloud service duration provided by the 6 sponsors is a 1 1 month, a 2 2 months, a 3 3 months, a 4 1 month, a 5 2 months, a 6 1 month; the total cloud service duration provided by 6 sponsors is
Figure 1
The month; 6 sponsors all provide own text advertisements, and the ith sponsor s i Is recorded as g i I th sponsor s i Length of advertisement is recorded as l i Are each l 1 =10Byte,l 2 =20Byte,l 3 =50Byte,l 4 =20Byte,l 5 =50Byte,l 6 =50Byte, wherein 1 ≦ i ≦ 6; the total ad length provided by 6 sponsors is
Figure BDA0002385381420000042
The block chain is supposed to have 10000 blocks, any one block is marked as the jth block, the block size of each block is 1MB, and j is more than or equal to 1 and less than or equal to 10000;
and step two, constructing a first block, and calculating a group of probability intervals according to the ratio of the cloud service time provided by each sponsor to the total cloud service time and the ratio of the advertisement length provided by each sponsor to the total advertisement release length.
Initializing j =1, constructing a jth block, enabling the block head of the jth block to be null, and enabling a block body of the jth block to be composed of service contents corresponding to a block chain and subsequent advertisement blocks;
the service content in the block can be written into transaction records, commodity distribution records, food safety inspection, electronic invoices and other contents of catering currencies by taking the catering industry as an example. Regardless of the application of the blockchain to any field, it is possible to attempt to write advertisement data into the advertisement blocks of a block using the method after appropriate adjustment and improvement.
Obtaining the ith sponsor s using equation (1) i Is selected by the advertisement of (1) i To obtain an initial probability p that 6 sponsors' advertisements are selected 1 =2,p 2 =2,p 3 =1.2,p 4 =1,p 5 =0.8,p 6 =0.4;
Figure BDA0002385381420000051
Calculating the ith sponsor s using equation (2) i Is selected, probability p' i Thereby obtainingProbability p 'of advertisements of 6 sponsors being selected' 1 =0.27,p′ 2 =0.27,p′ 3 =0.16,p′ 4 =0.14,p′ 5 =0.11,p′ 6 =0.05;
Figure BDA0002385381420000052
In the formula (2), p represents an initial total probability and has
Figure BDA0002385381420000053
Line of p' 0 =0, and calculate the ith sponsor s using equation (3) i Is selected, is selected by the advertisement i Thereby obtaining a probability interval y of n sponsor's advertisements being selected 1 =[0,0.27),y 2 =[0.27,0.54),y 3 =[0.54,0.70),y 4 =[0.70, 0.84),y 5 =[0.84,0.95),y 6 =[0.95,1);
Figure BDA0002385381420000054
And step three, continuing to construct subsequent blocks, and selecting advertisements of corresponding sponsors to write the advertisements in the advertisement blocks of the corresponding blocks through the probability interval in which the random number generated by the random number algorithm falls.
In this embodiment, the size of the advertisement block in the block body is set to 1024 bytes, and in other application occasions, the space occupied by the advertisement block in the block body can be appropriately changed.
Miners provide accounting right for one block in the calculation power acquisition block chain and are used for constructing a j +1 th block; wherein, the block head of the j +1 th block is the address of the j block; the block body of the (j + 1) th block is a service content and a subsequent advertisement block corresponding to the block chain; the advertisement blocks in the block body of the j +1 block are all character advertisements provided by all selected sponsors, and the total length is 1KB; the block tail of the j +1 th block is the encryption information of the block head and the block body of the j +1 th block; the advertising content of the advertising blocks in the block body will be selected by the following algorithm:
step 3.1, marking the current remaining available block of the advertisement block in the block body of the j +1 th block as the I-th remaining available block, and initializing I =0;
record the length of the I-th remaining available block of the advertisement block in the j + 1-th block as
Figure BDA0002385381420000055
And initialize
Figure BDA0002385381420000056
The minimum value of the advertisement length provided by 6 cloud service sponsors is L min =min{l i |i=1,2,3,4,5,6}=10Byte;
Step 3.2, assigning the value of I +1 to I;
step 3.3, if
Figure BDA0002385381420000061
Then the probability interval y is chosen based on the advertisements of the 6 sponsors 1 ~y 6 A random number x belonging to an interval [0, 1) is generated by using a Monte Carlo algorithm, and the probability interval y falling into the interval x is passed i Determining sponsors s to be allocated in the ith remaining available chunk i And a sponsor mark corresponding to the distributed advertisement is marked as s α Sponsor s α Length of advertisement is recorded as l α (ii) a Otherwise, indicating that the resource allocation of the advertisement block of the (j + 1) th block is finished, and executing the step four;
assuming that the length of the ith remaining usable block is 20 bytes, and there is a space in the ith remaining usable block to write the advertisement of the cloud service sponsor, a random number x belonging to the interval [0, 1) is generated according to the Monte Carlo algorithm, wherein assuming that the random number x is 0.54, the random number x falls into the interval y according to 0.54 3 = [0.54,0.70) may determine that sponsor s should be selected at this time 3 Advertisement content g 3 Write into the I-th remaining available block. If now the length of the ith remaining usable block is 4 bytes, it indicates that there is currently a remainderThere is no more space left in the available blocks for placing the advertisement content of any sponsor, and it also indicates that the resource allocation of the advertisement block of the current block is completed.
Step 3.4, if
Figure BDA0002385381420000062
Then will be
Figure BDA0002385381420000063
Assign to
Figure BDA0002385381420000064
And will sponsor s α Advertisement content g α After the selected advertisement is selected, returning to the step 3.2; otherwise, returning to the step 3.3;
for each advertisement block entered with an advertisement, the size of the currently remaining available block will decrease, and the remaining available block I will also become the remaining available block (I + 1). If the remaining space of the currently remaining available block is 10 bytes, which is greater than or equal to the length of the smallest sponsor advertisement, but we have selected a sponsor advertisement of size 20 bytes, we will go back to step 3 to continue picking a sponsor advertisement of appropriate size until a sponsor advertisement of appropriate size is picked that can be posted to the currently remaining available block.
And step four, after j +1 is assigned to j, judging whether j is greater than or equal to 10000, if so, indicating that the distribution of the advertisement resources in the block chain is finished, otherwise, returning to the step three.
If the value of j is equal to 10000, all advertisement block resources of all blocks in the current block chain are properly filled and used, so that the technical effect that the advertisements of the cloud service sponsor are accurately put on the whole catering industry block chain is realized.

Claims (1)

1. An advertisement block resource allocation method in a block chain is characterized in that the method is applied to a plurality of miners and n sponsors S = { S = (S) } 1 ,s 2 ,...,s i ,...,s n And block chains, where s i Represents the ith sponsor; will be the ith oneHelp the quotient s i Is recorded as g i I th sponsor s i Length of advertisement is recorded as l i The ith sponsor s i The required cloud service duration of (1) is marked as a i Then the total advertisement length of n sponsors is
Figure FDA0003828009070000011
The total cloud service time required to be provided by the n sponsors is as long as
Figure FDA0003828009070000012
Assuming that m blocks exist in the block chain, and marking any one block as a jth block; the block length of each block is marked as G, i is more than or equal to 1 and less than or equal to n; j is more than or equal to 1 and less than or equal to m; the method for distributing the advertisement block resources comprises the following steps:
step 1, initializing j =1, and constructing a jth block;
step 1.1, making the block head of the jth block empty; the block body of the jth block is composed of service contents corresponding to the block chain and subsequent advertisement blocks;
step 1.2, obtaining the ith sponsor s by using the formula (1) i Is selected by the advertisement of (1) i To obtain an initial probability that n sponsor's advertisements are selected p 1 ,p 2 ,…,p i ,…,p n }:
Figure FDA0003828009070000013
Step 1.3, calculate the ith sponsor s using equation (2) i Is selected, probability p' i Thus, the probability that the n sponsor's advertisements were selected P ' = { P ' 1 ,p′ 2 ,…,p′ i ,…,p′ n }:
Figure FDA0003828009070000014
In the formula (2), p represents an initial total probability and has
Figure FDA0003828009070000015
Step 1.4, making p' 0 =0, and calculate the ith sponsor s using equation (3) i Is selected, is the probability interval y of the advertisement being selected i So as to obtain a probability interval Y = { Y) for n sponsors' advertisements to be selected 1 ,y 2 ,…,y i ,…,y n };
Figure FDA0003828009070000016
Step 2, miners provide calculation power to obtain the accounting right of one block in the block chain, and the accounting right is used for constructing the j +1 th block; wherein, the block head of the j +1 th block is the address of the j block; the block body of the (j + 1) th block is a service content and a subsequent advertisement block corresponding to the block chain; the advertisement blocks in the block body of the j +1 th block provide all the character advertisements for all the selected sponsors, and the total length is L 0 (ii) a The block tail of the j +1 th block is the encryption information of the block head and the block body of the j +1 th block;
step 2.1, recording the current remaining available blocks of the advertisement blocks in the block body of the j +1 th block as the I-th remaining available block, and initializing I =0;
record the length of the I-th remaining usable block of the advertisement block in the j + 1-th block as
Figure FDA0003828009070000021
And initialize
Figure FDA0003828009070000022
Defining a minimum value of L for the length of all sponsor-provided advertisements min =min{l i |i=1,2,…,n};
Step 2.2, assigning the value of I +1 to I;
step 2.3, if
Figure FDA0003828009070000023
Then a random number x belonging to the interval [0, 1) is generated by using the Monte Carlo algorithm according to the probability interval Y in which the advertisements of the n sponsors S are selected, and the probability interval Y in which the random number x falls is determined i Determining sponsors s to be allocated in the ith remaining available chunk i And a sponsor mark corresponding to the distributed advertisement is marked as s α Sponsor, s α Length of advertisement is marked as l α (ii) a Otherwise, indicating that the resource allocation of the advertisement block of the (j + 1) th block is finished, and executing the step 3;
step 2.4, if
Figure FDA0003828009070000024
Then will be
Figure FDA0003828009070000025
Assign to
Figure FDA0003828009070000026
And will sponsor s α Advertisement content g α After the selected advertisement is selected, returning to the step 2.2; otherwise, returning to the step 2.3;
and 3, after j +1 is assigned to j, judging whether j is greater than or equal to m, if so, indicating that the distribution of the advertisement block resources in the block chain is finished, otherwise, returning to the step 2.
CN202010096370.5A 2020-02-17 2020-02-17 Advertisement block resource allocation method in block chain Active CN111325577B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010096370.5A CN111325577B (en) 2020-02-17 2020-02-17 Advertisement block resource allocation method in block chain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010096370.5A CN111325577B (en) 2020-02-17 2020-02-17 Advertisement block resource allocation method in block chain

Publications (2)

Publication Number Publication Date
CN111325577A CN111325577A (en) 2020-06-23
CN111325577B true CN111325577B (en) 2022-10-18

Family

ID=71172686

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010096370.5A Active CN111325577B (en) 2020-02-17 2020-02-17 Advertisement block resource allocation method in block chain

Country Status (1)

Country Link
CN (1) CN111325577B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112187765B (en) * 2020-09-23 2023-04-07 深圳前海微众银行股份有限公司 Method and device for selecting target node in block chain

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108985818A (en) * 2018-06-15 2018-12-11 微梦创科网络科技(中国)有限公司 Advertisement delivery system and method based on block chain technology
CN110148014A (en) * 2019-04-24 2019-08-20 深圳市元征科技股份有限公司 Information processing method, device, block chain node device and storage medium
CN110599250A (en) * 2019-09-09 2019-12-20 腾讯科技(深圳)有限公司 Resource playing control method and device and computer storage medium

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10997620B2 (en) * 2017-09-18 2021-05-04 Vertigo Studios, Llc Blockchain-enabled system for controlling advertiser access to personal user data

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108985818A (en) * 2018-06-15 2018-12-11 微梦创科网络科技(中国)有限公司 Advertisement delivery system and method based on block chain technology
CN110148014A (en) * 2019-04-24 2019-08-20 深圳市元征科技股份有限公司 Information processing method, device, block chain node device and storage medium
CN110599250A (en) * 2019-09-09 2019-12-20 腾讯科技(深圳)有限公司 Resource playing control method and device and computer storage medium

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Toward a Decentralized, Trust-Less Marketplace for Brokered IoT Data Trading Using Blockchain;Shaimaa Bajoudah 等;《2019 IEEE International Conference on Blockchain (Blockchain)》;20200102;第339-346页 *
基于区块链的在线广告投放模型;陆歌皓等;《计算机科学》;20190415(第04期);第306-314页 *

Also Published As

Publication number Publication date
CN111325577A (en) 2020-06-23

Similar Documents

Publication Publication Date Title
CN108090225B (en) Database instance running method, device and system and computer readable storage medium
CN107862782A (en) Drawing method and device based on ether mill block chain
CN109389485A (en) Block chain dynamic exciting method under autonomous domain model based on information sharing contribution margin
CN107516245A (en) The information processing method of resource content evaluation platform based on block chain technology
CN108734565A (en) A kind of reference point is real-time to adjust processing method, device and processing server
CN107741986A (en) User's behavior prediction and corresponding information recommend method and apparatus
CN107566133A (en) A kind of resource billing method, device and platform
CN107613309A (en) Live resource self-defined distribution method, storage medium, electronic equipment and system
CN108428114A (en) Information processing method and device, storage medium, the electronic device of project
CN111325577B (en) Advertisement block resource allocation method in block chain
CN109410054A (en) Block chain common recognition method under autonomous domain model based on information sharing contribution margin
CN109858961A (en) Bonusing method of checking card, device, equipment and readable storage medium storing program for executing based on block chain
CN108090211A (en) Hot news method for pushing and device
CN111967994B (en) Intelligent contract creating method and device
CN110298508A (en) Behavior prediction method, device and equipment
CN105528618A (en) Short image text identification method and device based on social network
CN107122805A (en) A kind of user clustering method and apparatus
CN109597680A (en) Task queue's response parameter evaluation method and device
CN107239853B (en) Intelligent housekeeper system based on cloud computing and working method thereof
CN109446597A (en) A kind of the personalized customization statistical method and equipment of construction equipment dosage
CN112015577A (en) Calling method and device of intelligent contract
CN109829759A (en) A kind of Internet advertising alliance system based on block chain
CN109978451A (en) The data safety processing method and device of logistics block chain
CN113988933A (en) Advertisement putting method, device, equipment and medium
TWM625301U (en) System for accelerating consumption and profit sharing

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