CN110288382A - A kind of business method of affiliate relationship locking - Google Patents
A kind of business method of affiliate relationship locking Download PDFInfo
- Publication number
- CN110288382A CN110288382A CN201910470264.6A CN201910470264A CN110288382A CN 110288382 A CN110288382 A CN 110288382A CN 201910470264 A CN201910470264 A CN 201910470264A CN 110288382 A CN110288382 A CN 110288382A
- Authority
- CN
- China
- Prior art keywords
- user terminal
- merchant tenninal
- register
- data
- acceleration
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 62
- 230000005540 biological transmission Effects 0.000 claims abstract description 4
- 230000001133 acceleration Effects 0.000 claims description 55
- 230000008569 process Effects 0.000 claims description 26
- 230000001186 cumulative effect Effects 0.000 claims description 21
- 239000012634 fragment Substances 0.000 claims description 15
- 230000007246 mechanism Effects 0.000 claims description 6
- 230000001373 regressive effect Effects 0.000 claims description 4
- 238000009826 distribution Methods 0.000 claims description 2
- 238000003860 storage Methods 0.000 claims description 2
- 230000000977 initiatory effect Effects 0.000 abstract description 3
- 101150025612 POLL gene Proteins 0.000 description 30
- 230000033001 locomotion Effects 0.000 description 14
- 230000008901 benefit Effects 0.000 description 5
- 230000007306 turnover Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 239000000284 extract Substances 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000010408 sweeping Methods 0.000 description 2
- 241001310793 Podium Species 0.000 description 1
- 210000001367 artery Anatomy 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000006073 displacement reaction Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000002955 isolation Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000011112 process operation Methods 0.000 description 1
- 238000004080 punching Methods 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
- 210000003462 vein Anatomy 0.000 description 1
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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
- G06Q30/0222—During e-commerce, i.e. online transactions
-
- 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/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
- G06Q30/0226—Incentive systems for frequent usage, e.g. frequent flyer miles programs or point systems
- G06Q30/0229—Multi-merchant loyalty card systems
-
- 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/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
- G06Q30/0234—Rebates after completed purchase
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- Development Economics (AREA)
- Strategic Management (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)
- Cash Registers Or Receiving Machines (AREA)
Abstract
The present invention relates to a kind of business methods of affiliate relationship locking, what is solved is the technical issues of affiliate relationship cannot efficiently use, by using one, server terminal receives the user terminal identity of merchant tenninal transmission identified and the payment information of user terminal initiation;Two, user terminal identity is carried out data polling matching by server terminal in user terminal identity historical data base, and successful match thens follow the steps three;It fails to match is then defined as source merchant tenninal for merchant tenninal described in step 1, and establishes the function unique relationships of user terminal identity described in source merchant tenninal and step 1, then executes step 4;Three, server terminal calls the source merchant tenninal information established with user terminal identity and have function unique relationships;Four, formality commission is distributed to the technical solution of user terminal, source merchant tenninal and server terminal by server terminal, is preferably resolved the problem, be can be used in the business model of affiliate relationship.
Description
Technical field
The present invention relates to fields, and in particular to a kind of business method of affiliate relationship locking.
Background technique
Membership promotion is a kind of marketing method based on member management, merchant tenninal by the way that ordinary customer is become member,
Member's consumption information is analyzed, the subsequent consumption power for excavating customer draws lifelong consumption value, and the modes such as is continued by client's referral,
The Value Realization of one client is maximized.There are numerous differences in operation thinking and theory with Traditional Marketing mode.Member battalion
Pin, by a variety of management methods such as member's integral, hierarchies, increases the viscosity and liveness of user, subscriber lifecycle is held
It renews and stretches.
The current business method based on member is the relationship of isolation diverging, cannot efficiently use affiliate relationship and generate valence
Value.The present invention provides a kind of business method of affiliate relationship locking, the method shared in the benefit using locking, improve merchant tenninal exhibition visitor or
Expand the initiative of member.
Summary of the invention
The technical problem to be solved by the present invention is to the technologies that affiliate relationship existing in the prior art cannot efficiently use
Problem.A kind of business method of new affiliate relationship locking is provided, the business method of affiliate relationship locking has high-efficient, sharp
With the high feature of rate.
In order to solve the above technical problems, the technical solution adopted is as follows:
A kind of business method of affiliate relationship locking, the business method of the affiliate relationship locking be based on affiliate relationship
The mechanism of the mechanism of locking, affiliate relationship locking includes server terminal, at least two merchant tenninal and user terminal, described
Server terminal is connect with merchant tenninal, and the user terminal is connect at least one of merchant tenninal, server terminal;
The server terminal execution has following procedure:
Step 1, server terminal receive the user terminal identity identified and user terminal of merchant tenninal transmission
The payment information of initiation;
User terminal identity is carried out data by step 2, server terminal in user terminal identity historical data base
Poll matching, successful match then follow the steps three;It fails to match is then defined as source trade company end for merchant tenninal described in step 1
End, and the function unique relationships of user terminal identity described in source merchant tenninal and step 1 are established, then execute step 4;
Step 3, server terminal, which calls to establish with user terminal identity, has the source merchant tenninal of function unique relationships to believe
Breath;
Step 4, server terminal according to payment information calculate formality commission, and by formality commission distribute to user terminal,
Source merchant tenninal and server terminal.
The working principle of the invention: the present invention locks the method shared in the benefit using affiliate relationship, it will member is as a kind of resource
It is effectively utilized, improves the level of resources utilization.Such as: it is consumed for the first time in platform A merchant tenninal, by sweeping two dimensional code branch
It pays or other means and pay successfully, or binding mobile phone, credit card etc., bind as A merchant tenninal permanent membership, Ji Shu A trade company
Terminal flow of the people.When the user terminal again platform B merchant tenninal consume when, platform extract automatically B merchant tenninal should
The part of turnover is as commission, and by three parts of this commission point, portion returns to A merchant tenninal, because B merchant tenninal is dynamic
With the resource of A merchant tenninal, portion is returned to the user terminal and is used again in platform as consumption volume, and portion is returned to flat
Platform is as service charge.If A merchant tenninal member consumes in A merchant tenninal, because being the resource of A merchant tenninal, it is not required to prop up
Pay resource commission.
The conduct consumption volume of the user terminal is wherein returned to, the member of same B merchant tenninal consumes in A merchant tenninal,
Just the automatic part for extracting A merchant tenninal this turnover is as commission for platform, and by three parts of this commission point, portion gives B
Merchant tenninal, portion give B merchant tenninal this member as consumption volume, and a platform is collected as service charge, such as B trade company end
Member is held to consume in B merchant tenninal, then without paying resource commission.
In above scheme, for optimization, further, user terminal identity historical data base stores Active Terminal information,
And the user terminal identity for there are function unique relationships is established with source terminal information.
Further, the commission that server terminal distributes to user terminal is made of payment information code and web-privilege password Web, clothes
The corresponding cipher key sets of history web-privilege password Web of generation are cipher key store by device terminal of being engaged in, and server terminal is by received merchant tenninal
Matching is decrypted in the web-privilege password Web of upload in cipher key store, and successful match, which then returns, allows loading payment information code to be propped up
It pays;The payment information code parses payment information by user terminal or merchant tenninal.
Further, when the source merchant tenninal information that step 3 is called is consistent with the merchant tenninal information of step 1, distribution
Commission to source merchant tenninal is zero.
Further, the data polling, which matches, includes:
Step 1, the user terminal identity of data polling will be needed to replicate in step 2, duplication quantity is A1;
Step 2, user terminal identity historical data base is not overlapped fragment, fragment quantity is A1, fragment result
Form entire user terminal identity historical data base;
Step 3, it is successively completed using acceleration data polling, at the uniform velocity data polling and deceleration data poll in A1 fragment
Subdata poll;
Step 4, the subdata polling result in A1 fragment is subjected to logic or operation, logical consequence is 1 and is defined as
Successful match, logical consequence are 0 and are defined as that it fails to match;
Wherein A1 is positive integer.
Further, FPGA unit is used in step 3, and using stepping time piece algorithm, accelerator time slice t1 is set
And moderating process time slice t2 is calculated by time slice t2 in accelerator in advance when not completing accelerator
Moderating process needs the number of steps of data polling;
Wherein, t1 > t2, t1 and t2 positive integer time values.
Further, accelerator and at the uniform velocity during, setting acceleration register A, rate register V and data wheel
Location register P is ask for realizing the cumulative and judgement of data;Before data polling start, three registers are resetted and are reset,
Guarantee acceleration and speed be start from scratch it is cumulative;
Rate register V is for judging data polling speed state;
Acceleration register A is for judging whether the cumulative of acceleration has spilling;
Poll location register P is for judging whether the cumulative of speed has spilling.
Further, preset data polling speeds Vo:
When the value of the rate register V of characterize data polling speeds is less than pre-set velocity value Vo, it is determined as accelerator:
Value of the adder after time slice reaches to acceleration register A that adds up for acceleration and acceleration value into
In the cumulative deposit acceleration register A of row, if high j value >=1 bit of acceleration register A, it is defined as data spilling, it will
Value phase adduction in the high j bit values and rate register V of acceleration register A is saved in rate register, while will be added
The high j bit of rate register A are reset;
As rate register V value >=pre-set velocity value Vo, it is determined as that data polling speed has reached maximum, remain a constant speed fortune
Row state, acceleration accumulator stop cumulative;
Wherein, j is positive integer;
When a time slice triggers, rate register V and data polling location register P phase adduction are stored to number
According in poll location register P;
High j value >=1 bit of data polling location register P are defined as data spilling, generate a data wheel at this time
The pulse of inquiry, while the high j bit of data polling location register P being reset, and adds up to data polling number of steps;
In moderating process, when determining that register A is accelerated to have data spilling, rate register V is subtracted by subtracter and is added
Fast register A overflow data carries out regressive by ceaselessly time slice, after rate register V value≤0, stops data wheel
It askes.
Further, the merchant tenninal receive user terminal user terminal identity and user terminal initiate
After payment information, user terminal identity, itself merchant tenninal identification code are uploaded to server terminal;
Merchant tenninal receive server terminal issue source merchant tenninal information, distribute to user terminal commission information,
Distribute to the commission information of source merchant tenninal;
Merchant tenninal matches source merchant tenninal information with self information, and successful match will then distribute to source trade company end
The commission information at end stores, and it fails to match then abandons the commission information for distributing to source merchant tenninal.
Beneficial effects of the present invention: the present invention locks the method shared in the benefit by member, improves merchant tenninal and develops member
Initiative, while improving the level of resources utilization, it will member can obtain business earnings as a kind of resource.Meanwhile it providing
A kind of matched method of high-speed data poll, realizes the high-speed data poll of information, improves the efficiency of business method.
Detailed description of the invention
Present invention will be further explained below with reference to the attached drawings and examples.
Fig. 1, the business method flow chart of the affiliate relationship locking in embodiment 1.
Fig. 2, data polling match flow chart.
Fig. 3, stepping time piece algorithm flow chart.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to embodiments, to the present invention
It is further elaborated.It should be appreciated that described herein, specific examples are only used to explain the present invention, is not used to limit
The fixed present invention.
Embodiment 1
The present embodiment provides a kind of business method of affiliate relationship locking, the business method of the affiliate relationship locking is base
In affiliate relationship locking mechanism, affiliate relationship locking mechanism include server terminal, at least two merchant tenninal and use
Family terminal, the server terminal are connect with merchant tenninal, in the user terminal and merchant tenninal, server terminal at least
A kind of connection;
Such as Fig. 1, the server terminal execution has following procedure:
Step 1, server terminal receive the user terminal identity identified and user terminal of merchant tenninal transmission
The payment information of initiation;
User terminal identity is carried out data by step 2, server terminal in user terminal identity historical data base
Poll matching, successful match then follow the steps three;It fails to match is then defined as source trade company end for merchant tenninal described in step 1
End, and the function unique relationships of user terminal identity described in source merchant tenninal and step 1 are established, then execute step 4;
Step 3, server terminal, which calls to establish with user terminal identity, has the source merchant tenninal of function unique relationships to believe
Breath;
Step 4, server terminal according to payment information calculate formality commission, and by formality commission distribute to user terminal,
Source merchant tenninal and server terminal.
The working principle of the present embodiment: the present invention locks the method shared in the benefit using affiliate relationship, it will member is as a kind of money
Source is effectively utilized, and the level of resources utilization is improved.Such as: it is consumed for the first time in platform A merchant tenninal, by sweeping two dimensional code
Payment or other means is paid successfully, or binding mobile phone, credit card etc., binding become A merchant tenninal permanent membership, i.e. category A quotient
Family terminal flow of the people.When the user terminal again platform B merchant tenninal consume when, platform extracts B merchant tenninal automatically
The part of this turnover is as commission, and by three parts of this commission point, portion returns to A merchant tenninal, because of B merchant tenninal
The resource of A merchant tenninal is employed, portion is returned to the user terminal and used again in platform as consumption volume, and portion is returned to
Platform is as service charge.If A merchant tenninal member consumes in A merchant tenninal, because being the resource of A merchant tenninal, it is not required to
Pay resource commission.
The conduct consumption volume of the user terminal is wherein returned to, the member of same B merchant tenninal consumes in A merchant tenninal,
Just the automatic part for extracting A merchant tenninal this turnover is as commission for platform, and by three parts of this commission point, portion gives B
Merchant tenninal, portion give B merchant tenninal this member as consumption volume, and a platform is collected as service charge, such as B trade company end
Member is held to consume in B merchant tenninal, then without paying resource commission.
Specifically, user terminal identity historical data base stores Active Terminal information, and establishes with source terminal information
There is the user terminal identity of function unique relationships.
Specifically, the commission that server terminal distributes to user terminal is made of payment information code and web-privilege password Web, service
The corresponding cipher key sets of history web-privilege password Web of generation are cipher key store by device terminal, and server terminal will be in received merchant tenninal
Matching is decrypted in the web-privilege password Web of biography in cipher key store, and successful match, which then returns, allows loading payment information code to be paid;
The payment information code parses payment information by user terminal or merchant tenninal.Branch in the platform of such commission may be implemented in this
It pays, limitation payment use scope improves the efficiency recycled in commercial podium.
Specifically, it when the source merchant tenninal information that step 3 is called is consistent with the merchant tenninal information of step 1, distributes to
The commission of source merchant tenninal is zero.
Preferably, such as Fig. 2, the data polling, which matches, includes:
Step 1, the user terminal identity of data polling will be needed to replicate in step 2, duplication quantity is A1;
Step 2, user terminal identity historical data base is not overlapped fragment, fragment quantity is A1, fragment result
Form entire user terminal identity historical data base;
Step 3, it is successively completed using acceleration data polling, at the uniform velocity data polling and deceleration data poll in A1 fragment
Subdata poll;
Step 4, the subdata polling result in A1 fragment is subjected to logic or operation, logical consequence is 1 and is defined as
Successful match, logical consequence are 0 and are defined as that it fails to match;
Wherein A1 is positive integer.
Such as Fig. 3, FPGA unit is used in step 3, using stepping time piece algorithm be arranged accelerator time slice t1 with
And moderating process time slice t2 is calculated in accelerator by time slice t2 subtract in advance when not completing accelerator
Fast process needs the number of steps of data polling;
Wherein, t1 > t2, t1 and t2 positive integer time values.
For accelerator and the different situation of moderating process acceleration, the time slice that a t2 can be used shifts to an earlier date
The corresponding data polling number of steps Sd of acceleration of moderating process is calculated, then enters deceleration number after data polling St-Sd step
According to polling procedure.
Specifically, accelerator and at the uniform velocity during, setting acceleration register A, rate register V and data polling
Location register P is for realizing the cumulative of data and judges;Before data polling starts, three registers are resetted and are reset, protected
Card acceleration and speed be start from scratch it is cumulative;
Rate register V is for judging data polling speed state;
Acceleration register A is for judging whether the cumulative of acceleration has spilling;
Poll location register P is for judging whether the cumulative of speed has spilling.
Specifically, preset data polling speeds Vo:
When the value of the rate register V of characterize data polling speeds is less than pre-set velocity value Vo, it is determined as accelerator:
Value of the adder after time slice reaches to acceleration register A that adds up for acceleration and acceleration value into
In the cumulative deposit acceleration register A of row, if high j value >=1 bit of acceleration register A, it is defined as data spilling, it will
Value phase adduction in the high j bit values and rate register V of acceleration register A is saved in rate register, while will be added
The high j bit of rate register A are reset;
As rate register V value >=pre-set velocity value Vo, it is determined as that data polling speed has reached maximum, remain a constant speed fortune
Row state, acceleration accumulator stop cumulative;
Wherein, j is positive integer;
When a time slice triggers, rate register V and data polling location register P phase adduction are stored to number
According in poll location register P;
High j value >=1 bit of data polling location register P are defined as data spilling, generate a data wheel at this time
The pulse of inquiry, while the high j bit of data polling location register P being reset, and adds up to data polling number of steps;
In moderating process, when determining that register A is accelerated to have data spilling, rate register V is subtracted by subtracter and is added
Fast register A overflow data carries out regressive by ceaselessly time slice, after rate register V value≤0, stops data wheel
It askes.
Specifically, the branch that the merchant tenninal receives the user terminal identity of user terminal and user terminal is initiated
After paying information, user terminal identity, itself merchant tenninal identification code are uploaded to server terminal;
Merchant tenninal receive server terminal issue source merchant tenninal information, distribute to user terminal commission information,
Distribute to the commission information of source merchant tenninal;
Merchant tenninal matches source merchant tenninal information with self information, and successful match will then distribute to source trade company end
The commission information at end stores, and it fails to match then abandons the commission information for distributing to source merchant tenninal.
Stepping time piece algorithm is different from the trapezoidal control algolithm of person, and trapezoidal control algolithm is according to number of steps come when calculating
Between, which first calculates each step running frequency, and time parameter is calculated further according to curve movement.
Stepping time piece algorithm is that movement number of steps relevant parameter is calculated according to the time centered on calculating by the time,
Its way is that the time is divided into several suitable time slices, and after each time slice timing reaches, it all will be fast
Degree parameter is added on location parameter, if location parameter overflows, it just exports a pulse, and control data polling runs a step,
Speed parameter changes according to acceleration parameter and time, and as time goes by, speed parameter is increasing, and location parameter overflows
Frequency is higher and higher, then the running frequency of data polling is also higher and higher.
Assuming that time slice is Ts, the maximum frequency of data polling is Vo, and total number of steps of whole process operation is St, is added
The acceleration in fast stage is Au, and the acceleration in decelerating phase is Ad, stop signal Stop.Stepping time piece is realized using FPGA
The process of algorithm, to reach using only adding, subtracting, shifting function realization input frequency parameter control data polling campaign, by FPGA
Dominant frequency be set as 100MHz, the spilling of time slice 950ns, acceleration and speed are 220。
As the algorithmic formula of velocity and acceleration: when known to v=a × t known in Vo, Au, data polling accelerates to maximum
Speed Vo runing time are as follows: t=Vo/Au, with 950ns for a time slice, then accelerator needs the time of data polling
Segment number N are as follows:
Such as Fig. 3, when speed v is also not up to preset Vo, the adder to add up for acceleration reaches in time slice
The value to register A and acceleration value carry out in cumulative deposit register A afterwards, while to the high 12bit for accelerating register A, into
Row judgement is then determined as that data are overflowed if it is larger than or equal to 1, then will be in the value and rate register V of register A high 12bit
Value is added, while being saved in rate register, while the high 12bit of acceleration register A being reset.
Do not stop to trigger with time slice, rate register V does not stop to add up, when the value of V is not less than scheduled velocity amplitude
When Vo, it is believed that speed has arrived at maximum, and remain a constant speed operation at this time, and acceleration accumulator stops cumulative.
32bit poll location register P passes through the height of the register for judging whether the cumulative of speed has spilling
Whether 12bit has spilling to export the pulse of poll matching movement.When a time slice is triggered to next, present speed is posted
Storage V is added with poll location register P, while by value storage into poll location register P.To poll location register P
High 12bit judged, if it is larger than or equal to 1, then it is assumed that data are overflowed, and generate the arteries and veins of poll matching movement at this time
Punching, while the high 12bit of poll location register P being reset, and adds up to poll movement step number.
Such as Fig. 3, poll matching enters the trigger condition of moderating process are as follows: receives and ceases and desist order or complete uniform motion
Step number enters deceleration and stops two conditions.
After receiving deceleration command, algorithm is on the basis of current speed, the value of rate register v at this time, acceleration
Spilling is subtracted to rate register v by subtracter when accelerating register A to have data spilling according to the process of accelerator
Part carries out regressive by ceaselessly time slice, and after speed is less than or equal to 0, poll matches stop motion.Wherein poll bit
It is identical with accelerator to set register portion P.
Poll matches in motion process, and the step number of accelerated motion and the step number of retarded motion are mainly matched by poll and moved
Step number register calculates, and when speed reaches scheduled value, the value in register is exactly the step number of Accelerating running at this time.According to
Known to symmetry when acceleration is identical, the step number of accelerator and the matching operation of moderating process poll is identical.
Therefore it is directed to accelerator and the different situation of moderating process acceleration, the time slice of a 20ns can be used
The corresponding movement step number Sd of acceleration of moderating process is calculated in advance, then poll matching enters after movement St-Sd step and slows down
Process.The characteristics of according to the parallel operation of fpga chip, " 950ns time slice accelerator " and " 20ns time slice accelerates
Process " can carry out operation simultaneously, and can calculate moderating process needs when poll matches and do not complete accelerator
The step number of operation.In this way, it may be implemented to accelerate not identical with the acceleration of moderating process.For not being added
When at and into moderating process, it is only necessary to execute according to moderating process at this time.
Parameter value in the present embodiment is also possible to other numerical value, and parameter value Different Effects are control precision, but not shadow
Ring the realization of function.
The present embodiment solves the different technology of the acceleration in acceleration and deceleration stage using the method for calculating deceleration step number in advance
Problem realizes the characteristics of algorithm is run parallel using FPGA, realizes and solve challenge using low cost.
The algorithm of the present embodiment uses two counters, by ceaselessly adding up in time slice, is overflowed by a high position
Mode detect whether to need to export the pulse of poll movement and export poll motion impulse, while will count after generating spilling
The value of device subtracts high-order part of overflowing and continues to add up, and overflows until next time.Only real-time addition and subtraction and displacement be just for entire algorithm
It realizes, efficiency far is higher than multiplication and division.
The selection and error range in the period of each pulse signal is described in detail in the present embodiment.Using FPGA clock accuracy
Height, error select the period of optimal pulse signal by calculating, can reduce the error range of frequency in ps rank.
Although the illustrative specific embodiment of the present invention is described above, in order to the technology of the art
Personnel are it will be appreciated that the present invention, but the present invention is not limited only to the range of specific embodiment, to the common skill of the art
For art personnel, as long as long as various change the attached claims limit and determine spirit and scope of the invention in, one
The innovation and creation using present inventive concept are cut in the column of protection.
Claims (9)
1. a kind of business method of affiliate relationship locking, it is characterised in that: the business method of the affiliate relationship locking is to be based on
Affiliate relationship locking mechanism, affiliate relationship locking mechanism include server terminal, at least two merchant tenninal and user
Terminal, the server terminal are connect with merchant tenninal, at least one in the user terminal and merchant tenninal, server terminal
Kind connection;
The server terminal execution has following procedure:
Step 1, server terminal receives the user terminal identity of merchant tenninal transmission identified and user terminal is initiated
Payment information;
User terminal identity is carried out data polling by step 2, server terminal in user terminal identity historical data base
Matching, successful match then follow the steps three;It fails to match is then defined as source merchant tenninal for merchant tenninal described in step 1, and
The function unique relationships for establishing user terminal identity described in source merchant tenninal and step 1, then execute step 4;
Step 3, server terminal call the source merchant tenninal information established with user terminal identity and have function unique relationships;
Step 4, server terminal calculates formality commission according to payment information, and formality commission is distributed to user terminal, source quotient
Family terminal and server terminal.
2. the business method of affiliate relationship locking according to claim 1, it is characterised in that: user terminal identity history
Database purchase Active Terminal information, and the user terminal identity for having function unique relationships is established with source terminal information.
3. the business method of affiliate relationship locking according to claim 1, it is characterised in that: server terminal distributes to use
The commission of family terminal is made of payment information code and web-privilege password Web, and server terminal is corresponding close by the history web-privilege password Web of generation
Key collection is combined into cipher key store, and the web-privilege password Web that received merchant tenninal uploads is decrypted server terminal in cipher key store
Match, successful match, which then returns, allows loading payment information code to be paid;The payment information code is whole by user terminal or trade company
End parses payment information.
4. the business method of affiliate relationship locking according to claim 1, it is characterised in that: the source trade company that step 3 is called
When end message is consistent with the merchant tenninal information of step 1, the commission for distributing to source merchant tenninal is zero.
5. the business method of affiliate relationship locking according to claim 1, it is characterised in that: the data polling matching packet
It includes:
Step 1, the user terminal identity of data polling will be needed to replicate in step 2, duplication quantity is A1;
Step 2, user terminal identity historical data base is not overlapped fragment, fragment quantity is A1, fragment result composition
Entire user terminal identity historical data base;
Step 3, subnumber is successively completed using acceleration data polling, at the uniform velocity data polling and deceleration data poll in A1 fragment
According to poll;
Step 4, the subdata polling result in A1 fragment is subjected to logic or operation, logical consequence is 1 and is defined as matching
Success, logical consequence are 0 and are defined as that it fails to match;
Wherein A1 is positive integer.
6. the business method of affiliate relationship locking according to claim 5, it is characterised in that: mono- using FPGA in step 3
Member is arranged accelerator time slice t1 and moderating process time slice t2 using stepping time piece algorithm, adds not completing
When fast process, the number of steps that moderating process needs data polling is calculated in accelerator by time slice t2 in advance;
Wherein, t1 > t2, t1 and t2 positive integer time values.
7. the business method of affiliate relationship locking according to claim 6, it is characterised in that: accelerator and at the uniform velocity process
In, setting acceleration register A, rate register V and data polling location register P are for realizing the cumulative of data and sentence
It is disconnected;Before data polling start, three registers are resetted and are reset, guarantee acceleration and speed be start from scratch it is cumulative;
Rate register V is for judging data polling speed state;
Acceleration register A is for judging whether the cumulative of acceleration has spilling;
Poll location register P is for judging whether the cumulative of speed has spilling.
8. the business method of affiliate relationship locking according to claim 7, it is characterised in that: preset data polling speeds
Vo:
When the value of the rate register V of characterize data polling speeds is less than pre-set velocity value Vo, it is determined as accelerator:
Value and acceleration value of the adder cumulative for acceleration after time slice reaches to acceleration register A carry out tired
Add in deposit acceleration register A, if high j value >=1 bit of acceleration register A, is defined as data spilling, will accelerate
The value phase adduction spent in the high j bit values and rate register V of register A is saved in rate register, while by acceleration
The high j bit of register A are reset;
As rate register V value >=pre-set velocity value Vo, it is determined as that data polling speed has reached maximum, remains a constant speed and run shape
State, acceleration accumulator stop cumulative;
Wherein, j is positive integer;
When a time slice triggers, rate register V and data polling location register P phase adduction are stored to data wheel
It askes in location register P;
High j value >=1 bit of data polling location register P are defined as data spilling, generate a data polling at this time
Pulse, while the high j bit of data polling location register P being reset, and adds up to data polling number of steps;
In moderating process, when determining that register A is accelerated to have data spilling, acceleration is subtracted to rate register V by subtracter and is posted
Storage A overflow data carries out regressive by ceaselessly time slice, after rate register V value≤0, stops data polling.
9. the business method of affiliate relationship locking according to claim 1, it is characterised in that: the merchant tenninal receives
After the payment information that the user terminal identity and user terminal of user terminal are initiated, by user terminal identity, itself quotient
Family terminal recognition code is uploaded to server terminal;
Merchant tenninal receive server terminal issue source merchant tenninal information, distribute to user terminal commission information, distribution
To the commission information of source merchant tenninal;
Merchant tenninal matches source merchant tenninal information with self information, and successful match will then distribute to source merchant tenninal
The storage of commission information, it fails to match then abandons the commission information for distributing to source merchant tenninal.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910470264.6A CN110288382A (en) | 2019-05-31 | 2019-05-31 | A kind of business method of affiliate relationship locking |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910470264.6A CN110288382A (en) | 2019-05-31 | 2019-05-31 | A kind of business method of affiliate relationship locking |
Publications (1)
Publication Number | Publication Date |
---|---|
CN110288382A true CN110288382A (en) | 2019-09-27 |
Family
ID=68003109
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910470264.6A Pending CN110288382A (en) | 2019-05-31 | 2019-05-31 | A kind of business method of affiliate relationship locking |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110288382A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112308559A (en) * | 2020-11-06 | 2021-02-02 | 北京绿善心星球网络科技开发有限公司 | Two-dimensional code management method and device, storage medium and electronic equipment |
CN112541784A (en) * | 2020-12-08 | 2021-03-23 | 北京百度网讯科技有限公司 | Member identification method and device |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050234775A1 (en) * | 2004-04-14 | 2005-10-20 | Pearson Eric E | Self-funded commission management system |
CN102224715A (en) * | 2008-09-23 | 2011-10-19 | 诺基亚公司 | Optimized polling in low resource devices |
CN106296308A (en) * | 2016-08-24 | 2017-01-04 | 广州云移信息科技有限公司 | A kind of trade company's marketing method and system |
CN106934636A (en) * | 2017-02-28 | 2017-07-07 | 杭州搜娱科技有限公司 | Integrated management approach and system |
CN107169138A (en) * | 2017-06-13 | 2017-09-15 | 电子科技大学 | A kind of data distributing method of Based on Distributed memory database query engine |
CN109118277A (en) * | 2018-07-30 | 2019-01-01 | 深圳会花钱科技有限公司 | A kind of fission formula membership information sharing method and its system |
CN109586628A (en) * | 2018-11-15 | 2019-04-05 | 桂林优利特医疗电子有限公司 | A kind of adaptive step motor control algorithm |
-
2019
- 2019-05-31 CN CN201910470264.6A patent/CN110288382A/en active Pending
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050234775A1 (en) * | 2004-04-14 | 2005-10-20 | Pearson Eric E | Self-funded commission management system |
CN102224715A (en) * | 2008-09-23 | 2011-10-19 | 诺基亚公司 | Optimized polling in low resource devices |
CN106296308A (en) * | 2016-08-24 | 2017-01-04 | 广州云移信息科技有限公司 | A kind of trade company's marketing method and system |
CN106934636A (en) * | 2017-02-28 | 2017-07-07 | 杭州搜娱科技有限公司 | Integrated management approach and system |
CN107169138A (en) * | 2017-06-13 | 2017-09-15 | 电子科技大学 | A kind of data distributing method of Based on Distributed memory database query engine |
CN109118277A (en) * | 2018-07-30 | 2019-01-01 | 深圳会花钱科技有限公司 | A kind of fission formula membership information sharing method and its system |
CN109586628A (en) * | 2018-11-15 | 2019-04-05 | 桂林优利特医疗电子有限公司 | A kind of adaptive step motor control algorithm |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112308559A (en) * | 2020-11-06 | 2021-02-02 | 北京绿善心星球网络科技开发有限公司 | Two-dimensional code management method and device, storage medium and electronic equipment |
CN112541784A (en) * | 2020-12-08 | 2021-03-23 | 北京百度网讯科技有限公司 | Member identification method and device |
CN112541784B (en) * | 2020-12-08 | 2024-04-09 | 北京百度网讯科技有限公司 | Member identification method and device |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN107644340A (en) | Risk Identification Method, client device and risk recognition system | |
CN105049539A (en) | Rebating method, device and system | |
CN110288382A (en) | A kind of business method of affiliate relationship locking | |
CN112488706B (en) | Cloud service management method and system based on block chain | |
CN110659906A (en) | Bill information processing method, related device and medium | |
LU102556B1 (en) | Blockchain-enhanced open internet of things access architecture | |
CN109558992A (en) | Based on sale peak value prediction technique, device, equipment and the storage medium from the machine of dealer | |
KR20180011257A (en) | Automatic recharging system, method and server | |
CN107528912A (en) | A kind of automatic method, system and relevant apparatus for realizing distributing real time system | |
CN109146523A (en) | A kind of commodity counterfeit prevention verification system and method based on block chain | |
WO2020011010A1 (en) | Computing power transaction method and computing channel | |
CN110048907A (en) | Global flow control method and device under a kind of cluster environment | |
US20220245634A1 (en) | Blockchain-enhanced open internet of things access architecture | |
CN107608979B (en) | Method and device for identifying potential help-seeking knowledge points of user | |
CN109597680B (en) | Task queuing response parameter estimation method and device | |
CN114331446B (en) | Method, device, equipment and medium for realizing out-of-chain service of block chain | |
CN115442322A (en) | Method, system and equipment for sending shortcut message and computer read-only medium | |
CN110570310B (en) | Block chain transfer method and consensus realization method, device, equipment and medium | |
CN107291757A (en) | The method and mode matching device of pattern match | |
CN110517047A (en) | Virtual objects calling processing method, device and equipment and medium based on block chain | |
CN105592029A (en) | Method and server for synchronizing virtual resource transfer operation state | |
CN113691534B (en) | Identity authentication charging system and method | |
CN104320457A (en) | Network invoice system based on distributed management | |
US20240161115A1 (en) | Fraud detection using real-time and batch features | |
Leonidas et al. | Immediate Mobility Number Portability: Cloud Database Appliance Platform to Provide Central Portability |
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 | ||
RJ01 | Rejection of invention patent application after publication | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190927 |