CN112288206A - Resource allocation method and device, computer storage medium and electronic equipment - Google Patents
Resource allocation method and device, computer storage medium and electronic equipment Download PDFInfo
- Publication number
- CN112288206A CN112288206A CN202010098929.8A CN202010098929A CN112288206A CN 112288206 A CN112288206 A CN 112288206A CN 202010098929 A CN202010098929 A CN 202010098929A CN 112288206 A CN112288206 A CN 112288206A
- Authority
- CN
- China
- Prior art keywords
- resource allocation
- value
- time period
- activity
- target time
- 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
- 238000013468 resource allocation Methods 0.000 title claims abstract description 204
- 238000000034 method Methods 0.000 title claims abstract description 64
- 230000000694 effects Effects 0.000 claims abstract description 137
- 238000004590 computer program Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 14
- 230000008569 process Effects 0.000 description 10
- 238000012545 processing Methods 0.000 description 7
- 241000219112 Cucumis Species 0.000 description 5
- 235000015510 Cucumis melo subsp melo Nutrition 0.000 description 5
- FJJCIZWZNKZHII-UHFFFAOYSA-N [4,6-bis(cyanoamino)-1,3,5-triazin-2-yl]cyanamide Chemical compound N#CNC1=NC(NC#N)=NC(NC#N)=N1 FJJCIZWZNKZHII-UHFFFAOYSA-N 0.000 description 5
- 238000006243 chemical reaction Methods 0.000 description 4
- 230000009191 jumping Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000001514 detection method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000001174 ascending effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
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
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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/063—Operations research, analysis or management
- G06Q10/0637—Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
-
- 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/0201—Market modelling; Market analysis; Collecting market data
-
- 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/0239—Online discounts or incentives
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Marketing (AREA)
- Game Theory and Decision Science (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Data Mining & Analysis (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present disclosure relates to the technical field of computers, and provides a resource allocation method, a resource allocation apparatus, a computer storage medium, and an electronic device, wherein the resource allocation method includes: when detecting that the activity participation user has historical resource allocation data in a target time period, acquiring the average value of the historical resource allocation data in the target time period; when the average value is larger than a first reference value, determining a resource allocation value corresponding to the activity participation user according to the average value and the generated first random number; and when the average value is less than or equal to the first reference value, determining a resource allocation value corresponding to the activity participation user according to the generated second random number. The resource allocation method in the disclosure can solve the technical problems of unbalanced resource allocation and low participation enthusiasm of users in the prior art, improve the participation enthusiasm of the users, and ensure the balance of resource allocation.
Description
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a resource allocation method, a resource allocation apparatus, a computer storage medium, and an electronic device.
Background
With the rapid development of computer and internet technologies, related resource transformation platforms (such as retail stores) are rapidly developing and growing, and the activity of the red-covered melon is gradually an important means for attracting users to browse and improving the activity of the users.
At present, users participating in resource allocation activities are generally sorted first, then random numbers are generated, and the amount of resources distributed by each user is determined according to the sorting results of the users. Therefore, the resource amount obtained by the user continuously counting several days is small, even zero, so that the activity participation enthusiasm of the user is reduced, and the user activity degree and the user visit amount of the related store are reduced.
In view of the above, there is a need in the art to develop a new method and apparatus for allocating bonus resources.
It is to be noted that the information disclosed in the background section above is only used to enhance understanding of the background of the present disclosure.
Disclosure of Invention
The present disclosure is directed to a resource allocation method, a resource allocation apparatus, a computer storage medium, and an electronic device, so as to avoid, at least to a certain extent, the disadvantage of poor balance of resource allocation in the prior art.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.
According to a first aspect of the present disclosure, there is provided a resource allocation method, including: when detecting that the activity participation user has historical resource allocation data in a target time period, acquiring an average value of the historical resource allocation data in the target time period; when the average value is larger than a first reference value, determining a resource allocation value corresponding to the activity participation user according to the average value and the generated first random number; the first random number is smaller than the preset resource number of the first reward resource; when the average value is smaller than or equal to the first reference value, determining a resource allocation value corresponding to the activity participation user according to the generated second random number; the second random number is smaller than the preset resource number of the second reward resource.
In an exemplary embodiment of the present disclosure, the method further comprises: and when the fact that the historical resource allocation data in the target time period do not exist in the activity participation user is detected, determining a resource allocation value corresponding to the activity participation user according to the generated second random number.
In an exemplary embodiment of the present disclosure, when the average value is greater than a first reference value, determining a resource allocation value corresponding to the activity participation user according to the average value and the generated first random number includes: when the average value is larger than a first reference value, acquiring a target difference value of the average value and the first reference value; obtaining a target product of the target difference value and the first random number; and determining the sum of the average value and the target product as a resource allocation value corresponding to the activity participation user.
In an exemplary embodiment of the present disclosure, when the average value is equal to a second reference value, obtaining an associated numerical value corresponding to the second reference value; determining a resource allocation value corresponding to the activity participation user according to the correlation value, the difference value between the second reference value and the correlation value and the generated third random number; wherein the second reference value is greater than the first reference value.
In an exemplary embodiment of the present disclosure, the obtaining of the associated numerical value corresponding to the second reference value includes: and determining the product of the second reference value and a preset threshold value as an associated numerical value corresponding to the second reference value.
In an exemplary embodiment of the present disclosure, the obtaining an average value of the historical resource allocation data in a target time period when it is detected that the activity participation user has historical resource allocation data in the target time period includes: when detecting that the activity participation user has historical resource allocation data in a target time period, acquiring the total amount of the historical resource allocation data; and obtaining the average value of the historical resource allocation data in the target time period according to the duration of the target time period and the total amount of the historical resource allocation data.
In an exemplary embodiment of the disclosure, after detecting that the activity participation user has historical resource allocation data within a target time period, the method further comprises: when the activity starting time is earlier than the starting time of the target time period, or the activity starting time is the same as the starting time of the target time period, sequentially acquiring the historical resource allocation data of the activity participating users in the target time period according to the sequence of the time points included in the target time period from early to late; and when the activity starting time is later than the starting time of the target time period, sequentially acquiring the historical resource allocation data of the activity participation users in the target time period after the activity starting time according to the sequence from the late to the early of the time points contained in the target time period.
According to a second aspect of the present disclosure, there is provided a resource allocation apparatus comprising: the data acquisition module is used for acquiring the average value of historical resource allocation data in a target time period when the historical resource allocation data in the target time period exist in an activity participation user; the first allocation module is used for determining a resource allocation value corresponding to the activity participation user according to the average value and the generated first random number when the average value is larger than a first reference value; the first random number is smaller than the preset resource number of the first reward resource; a second allocating module, configured to determine, according to a second random number generated when the average value is less than or equal to the first reference value, a resource allocation value corresponding to the activity participation user; the second random number is smaller than the preset resource number of the second reward resource.
According to a third aspect of the present disclosure, there is provided a computer storage medium having stored thereon a computer program which, when executed by a processor, implements the resource allocation method of the first aspect described above.
According to a fourth aspect of the present disclosure, there is provided an electronic device comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the resource allocation method of the first aspect described above via execution of the executable instructions.
As can be seen from the foregoing technical solutions, the resource allocation method, the resource allocation apparatus, the computer storage medium and the electronic device in the exemplary embodiments of the present disclosure have at least the following advantages and positive effects:
in the technical solutions provided by some embodiments of the present disclosure, on one hand, when it is detected that the activity-participating user has historical resource allocation data within the target time period, an average value of the historical resource allocation data within the target time period is obtained, so that the historical resource allocation condition of the activity-participating user can be accurately known, and the rationality of subsequent resource allocation is ensured. On the other hand, when the average value is larger than the first reference value, determining a resource allocation value corresponding to the activity participation user according to the average value and the generated first random number (the resource number is smaller than the preset first reward resource); when the average value is smaller than or equal to the first reference value, the resource allocation value corresponding to the activity participation user is determined according to the generated second random number (the number of the resources of the preset second reward resource is smaller), the activity participation users can be classified according to the numerical value of the average value, different resource allocation schemes are set for different types of users, the technical problem that in the prior art, partial users are continuously divided into fewer resources due to the fact that the random number is completely used for allocating the resources for the users, the participation enthusiasm of the users is low is solved, and the activity of the users and the resource conversion rate of related sales outlets are improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.
FIG. 1 is a flow diagram illustrating a method for resource allocation in an exemplary embodiment of the prior art;
FIG. 2 is a flow diagram illustrating a resource allocation method in another exemplary embodiment in the prior art;
FIG. 3 is a flow chart illustrating a method for resource allocation in an exemplary embodiment of the present disclosure;
FIG. 4 is a sub-flow diagram illustrating a method of resource allocation in an exemplary embodiment of the present disclosure;
FIG. 5 is a sub-flow diagram illustrating a method for resource allocation in an exemplary embodiment of the present disclosure;
FIG. 6 is a flowchart illustrating an overall process of a resource allocation method according to an exemplary embodiment of the disclosure;
Fig. 7 is a schematic structural diagram of a resource allocation apparatus in an exemplary embodiment of the present disclosure;
FIG. 8 shows a schematic diagram of a structure of a computer storage medium in an exemplary embodiment of the disclosure;
fig. 9 shows a schematic structural diagram of an electronic device in an exemplary embodiment of the present disclosure.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and the like. In other instances, well-known technical solutions have not been shown or described in detail to avoid obscuring aspects of the present disclosure.
The terms "a," "an," "the," and "said" are used in this specification to denote the presence of one or more elements/components/parts/etc.; the terms "comprising" and "having" are intended to be inclusive and mean that there may be additional elements/components/etc. other than the listed elements/components/etc.; the terms "first" and "second", etc. are used merely as labels, and are not limiting on the number of their objects.
Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities.
Currently, resource allocation schemes in the related art generally include two kinds, that is, the following existing scheme 1 and existing scheme 2.
With respect to prior art scheme 1, reference may be made to fig. 1, where fig. 1 shows a schematic flowchart of a resource allocation method in an exemplary embodiment in the prior art, and includes steps S101 to S108, and a specific process of prior art scheme 1 is explained below with reference to fig. 1. In step S101, an original resource amount is set; in step S102, the participating users queue up, and the newly-entered user inserts the tail of the queue; in step S103, extracting the user from the head of the queue according to the queue first-in first-out rule; in step S104, a random number is generated in the range of [0, maxNum ] as the amount of resources available to the user (maxNum, i.e. the value of the original resource amount); in step S105, it is determined whether the resource amount available to the user is 0; in step S106, if yes, the user does not obtain the resource; in step S107, if not, determining whether the amount of the currently remaining resource is greater than or equal to the amount of the resource available to the user; in step S108, if yes, the user obtains a resource; if not, jumping to step S106, and the user does not obtain the resource.
With respect to the existing scheme 2, reference may be made to fig. 2, where fig. 2 shows a flowchart of a resource allocation method in another exemplary embodiment in the prior art, including steps S201 to S208, and the following explains a specific process of the existing scheme 2 in conjunction with fig. 2. In step S201, an original resource amount is set; in step S202, the personal identification numbers of all users participating in the melon division activity are added to the queue; in step S203, determining whether the random user has the resource melon qualification according to the personal identification code of the user; in step S204, if yes, the personal identification number of the user is added to the list; in step S205, if not, it is determined that the user does not obtain the resource; in step S206, a random number is generated in the range of [0, maxNum ] as the amount of the resource (maxNum is the value of the original resource amount) that the user in the list can obtain; in step S207, it is determined whether the amount of the resource remaining at present is greater than or equal to the amount of the resource available to the user; in step S208, if yes, the user obtains the resource; if not, the process goes to step S205, and the user does not obtain the resource.
Obviously, the two schemes are both a scheme of sequencing and randomly generating the resource allocation amount, and meanwhile, limited by the generation of the random number, the user needs to determine the specific amount of the resource to be acquired according to the random number and the amount of the remaining resource, and an unbalanced condition that the amount of the resource is small or zero may exist for several consecutive days of the user, so that the enthusiasm of the user is reduced, and the activity degree of the user in store activities and the access amount of the user are reduced.
In the embodiments of the present disclosure, a resource allocation method is provided first, which overcomes, at least to some extent, the disadvantage of the resource allocation method provided in the prior art that the balance is poor.
Fig. 3 is a flowchart illustrating a resource allocation method according to an exemplary embodiment of the present disclosure, where an execution subject of the resource allocation method may be a server that allocates resources.
Referring to fig. 3, a resource allocation method according to one embodiment of the present disclosure includes the steps of:
step S310, when detecting that the activity participation user has historical resource distribution data in a target time period, acquiring the average value of the historical resource distribution data in the target time period;
step S320, when the average value is larger than the first reference value, determining a resource allocation value corresponding to the activity participation user according to the average value and the generated first random number;
step S330, when the average value is less than or equal to the first reference value, determining a resource allocation value corresponding to the activity participation user according to the generated second random number;
the first random number is smaller than the preset resource number of the first reward resource; the second random number is smaller than the preset number of resources of the second reward resource.
In the technical solution provided in the embodiment shown in fig. 3, on one hand, when it is detected that the activity-participating user has historical resource allocation data within the target time period, an average value of the historical resource allocation data within the target time period is obtained, so that the historical resource allocation condition of the activity-participating user can be accurately known, and the rationality of subsequent resource allocation is ensured. On the other hand, when the average value is larger than the first reference value, determining a resource allocation value corresponding to the activity participation user according to the average value and the generated first random number (the resource number is smaller than the preset first reward resource); when the average value is smaller than or equal to the first reference value, the resource allocation value corresponding to the activity participation user is determined according to the generated second random number (the number of the resources of the preset second reward resource is smaller), the activity participation users can be classified according to the numerical value of the average value, different resource allocation schemes are set for different types of users, the technical problem that in the prior art, partial users are continuously divided into fewer resources due to the fact that the random number is completely used for allocating the resources for the users, the participation enthusiasm of the users is low is solved, and the activity of the users and the resource conversion rate of related sales outlets are improved.
The following describes the specific implementation process of each step in fig. 3 in detail:
in an exemplary embodiment of the present disclosure, the resource may be a virtual asset that a red envelope of a shop, a voucher, and a point, etc. set by an off-line retail store (or an on-line internet transaction platform) can be used to deduct cash. The activity participating users may be users participating in the above-described resource allocation activity (e.g., store red envelope, voucher, credit, etc.), for example, the users may scan the relevant activity two-dimensional code of the store to participate in the above-described resource allocation activity.
Before the resource allocation activity is started, the related resource manager can preset a first reward resource and a second reward resource. For example, when the resource is a red packet, the total reward resource may be set to 1200 yuan, where the first reward resource is 1000 yuan, and the second reward resource is 200 yuan, it should be noted that a specific value of the reward resource may be set according to an actual situation, and belongs to the protection scope of the present disclosure. Therefore, different melon resources are set for different types of users, the condition that the numerical value of the resources allocated to the users is continuously 0 is avoided, and the ordered proceeding of melon distribution activities is ensured.
When a user participates in a resource allocation activity, a personal identification number (such as a telephone number, an identity card number, an email account number and the like) of the activity participation user can be acquired so as to detect whether the activity participation user has historical resource allocation data in a target time period. The historical resource allocation data refers to resource data allocated for the user to participate in the resource allocation activity in the past target time period.
Illustratively, when the target time period is (No. 2/month 1-No. 2/month 7, total 7 days), if the activity participation user has the historical resource allocation data of at least one day in the target time period, the activity participation user is regarded as having the historical resource allocation data in the target time period. On the contrary, when it is detected that the activity participation user does not have the historical resource allocation data of any day in the target time period (No. 2/month 1-No. 2/month 7, total 7 days), it can be determined that the activity participation user does not have the historical resource allocation data in the target time period. It should be noted that the target time period may be set as a sliding window of any duration, and specifically, may be set by itself according to an actual situation, and belongs to the protection scope of the present disclosure.
After detecting that the activity participation user has the historical resource allocation data in the target time period, illustratively, when the activity start time is earlier than the start time of the target time period, or the activity start time is the same as the start time of the target time period, the historical resource allocation data of the activity participation user in the target time period are sequentially acquired according to the sequence of the time points included in the target time period from early to late. For example, when the activity start time is 1 month 30 days (earlier than the start time 2 month 1 day of the target time period), or if the activity start time is No. 2 month 1 (equal to the start time 2 month 1 day of the target time period), the above-mentioned historical resource allocation data may be detected and acquired in the order of time points included in the target time period from early to late (2 month 1 day, 2 month 2 day, 2 month 3 day … … 2 month 7 day). Therefore, the comprehensiveness of data detection and acquisition can be ensured, and data omission is avoided.
Specifically, the following tables 1 and 2 may be referred to, for example, table 1 is historical resource allocation data corresponding to the detected activity participation user a, and table 2 is historical resource allocation data corresponding to the detected activity participation user B. When the existence of the historical resource allocation data (No. 2/1-No. 2/7) of the activity participation user A is detected, the historical resource allocation data in the target time period of the existence of the activity participation user A can be determined. When the historical resource allocation data of the activity participation user B (No. 2/3) is detected, the historical resource allocation data of the activity participation user B in the target time period can be determined.
TABLE 1
| 2 month and 1 day | 2 months and 2 days | 2 month and 3 days | 2 month and 4 days | 2 month and 5 days | 2 month and 6 days | 2 month and 7 days |
| 6 | 8 | 12 | 23 | 4 | 20 | 11 |
TABLE 2
| 2 month and 1 day | 2 months and 2 days | 2 month and 3 days | 2 month and 4 days | 2 month and 5 days | 2 month and 6 days | 2 month and 7 days |
| 0 | 0 | 7 | 0 | 0 | 0 | 0 |
In an exemplary embodiment of the present disclosure, when the activity start time is later than the start time of the target time period, the historical resource allocation data of the activity participating users in the target time period after the activity start time is sequentially acquired in the order from late to early of the time points included in the target time period. For example, when the activity start time is No. 2/month 5, and No. 2/month 5 is later than the activity start time, No. 2/month 1, the historical resource allocation data of the activity participation user in the target time period after the activity start time is sequentially acquired in the order from late to early (2/month 7, 2/month 6, 2/month 5) (that is, the data of No. 2/month 7 to No. 2/month 5 are acquired in the reverse order, and the data of No. 2/month 5 to No. 2/month 1 are not required to be acquired) according to the time points included in the target time period. Therefore, the data acquisition process which is invalid in acquisition can be avoided, the defect that the data acquisition efficiency is low when the target time period is too long is avoided, and the data detection and acquisition efficiency is improved.
In step S310, when it is detected that the activity participation user has the historical resource allocation data within the target time period, an average value of the historical resource allocation data within the target time period is acquired.
In the exemplary embodiment of the disclosure, when it is detected that the activity-participating user has resource allocation data within the target time period, an average value of the historical resource allocation data within the target time period may be obtained, so that the historical resource allocation condition of the activity-participating user can be accurately known, and the rationality of subsequent resource allocation is ensured.
Specifically, referring to fig. 4, fig. 4 shows a sub-flow diagram of a resource allocation method in an exemplary embodiment of the present disclosure, and specifically shows a sub-flow diagram of obtaining an average value of historical resource allocation data in a target time period when it is detected that there is historical resource allocation data in the target time period in an activity participation user, including steps S401 to S402, and the following explains step S310 with reference to fig. 4.
In step S401, when it is detected that the activity participation user has the historical resource allocation data within the target time period, the total amount of the historical resource allocation data is acquired.
In an exemplary embodiment of the present disclosure, referring to table 1 above and the related explanation of the above steps, when it is detected that the activity-participating user a has historical resource allocation data within the target time period, the total amount S of the historical resource allocation data of the activity-participating user a may be acquired AIs 6+8+12+23+4+20+11 ═ 84.
Referring to table 2 and the related explanation of the above steps, when it is detected that the activity-participating user B has the historical resource allocation data within the target time period, the total amount S of the historical resource allocation data of the activity-participating user B may be obtainedBIs 7.
In step S402, an average value of the historical resource allocation data in the target time period is obtained according to the duration of the target time period and the total amount of the historical resource allocation data.
In the exemplary embodiment of the present disclosure, after the allocation times are obtained, an average value of the historical resource allocation data in the target time period may be obtained according to the duration of the target time period and the total amount of the historical resource allocation data. Specifically, the total amount of the historical resource allocation data may be divided by the duration of the target time period (7 days) to obtain an average value of the historical resource allocation data in the target time period. Then, illustratively, for the activity participating user a: average value of A ═ SA/TA84/7-12. For activity participating user B: average value B ═ SB/TB＝7/7＝1。
In step S320, when the average value is greater than the first reference value, a resource allocation value corresponding to the activity participation user is determined according to the average value and the generated first random number.
In an exemplary embodiment of the present disclosure, after obtaining an average value corresponding to historical resource allocation data of each activity participation user, if the average value is greater than a first reference value, a resource allocation value corresponding to the activity participation user may be determined according to the average value and the generated first random number. Wherein the first random number is smaller than the preset number of the first reward resource. The first reward resource is the preset allocation resource for the activity participation user of which the average value is larger than the first reference value.
Specifically, referring to fig. 5, fig. 5 shows a sub-flow diagram of a resource allocation method in an exemplary embodiment of the present disclosure, and specifically shows a sub-flow diagram for determining a resource allocation value corresponding to an activity participation user according to an average value and a generated first random number if the average value is greater than a first reference value, where the sub-flow diagram includes steps S501 to S502, and the following explains step S320 with reference to fig. 5.
In step S501, when the average value is greater than the first reference value, a target difference value of the average value and the first reference value is acquired.
In an exemplary embodiment of the present disclosure, when the average value is greater than a first reference value (a preset reference value, for example, 10, which may be numerically changed according to actual conditions), a target difference value of the average value and the first reference value may be obtained. Illustratively, referring to the above-mentioned steps for explanation, if the average value a of the activity participation user a is 12, and 12 is greater than 10, the target difference between the obtained average value a and the first reference value is 12-10 — 2.
In step S502, a target product of the target difference value and the first random number is acquired.
In an exemplary embodiment of the present disclosure, after the above target difference value is obtained, a target product of the target difference value and the generated first random number may be obtained. Illustratively, with reference to the above-mentioned related explanation of steps, when the first bonus resource is 1000, the generated first random number may be any rational number at [0,1000], for example: 0.5. the product of the target difference and the first random number is 2 x 0.5-1.
In step S503, the sum of the average value and the target product is determined as the resource allocation value corresponding to the activity-participating user.
In an exemplary embodiment of the present disclosure, after the target product is obtained, the sum of the average value and the target product may be determined as the resource allocation value corresponding to the activity-participating user, and for example, referring to the relevant explanations of step S501 and step S502, when the average value a is 10 and the target difference value is 1, then 10+1 is 11, and 11 may be determined as the resource allocation value corresponding to the activity-participating user a. Therefore, the resource allocation value 11 is larger than the average value 10, so that the resource allocation value of the user can be ensured to be in an ascending trend, the technical problems that in the prior art, the resource is allocated to the user completely by the random number, so that part of users are continuously allocated to less resources, and the participation enthusiasm of the user is low are solved, and the activity of the user and the resource conversion rate of related sales shops are improved.
In an exemplary embodiment of the present disclosure, when the average value is equal to a second reference value (a preset value greater than the first reference value, for example, 30), a correlation value corresponding to the second reference value may be obtained, specifically, the correlation value may be obtained by multiplying the second reference value by a preset threshold (a rational number greater than 0 and less than 1, and a value may be changed according to an actual situation, for example, 0.6), and is 30 × 0.6 — 18.
After the correlation value is obtained, the difference between the second reference value and the correlation value is 30-18 to 12, and further, the resource allocation value corresponding to the activity participation user may be determined according to the obtained correlation value, the difference between the second reference value and the correlation value, and the generated third random number. For example, when the generated third random number is 0.1 (the third random number is a rational number greater than 0 and smaller than 1), it is determined that the resource allocation value corresponding to the activity participation user may be 18+12 × 0.1 — 19.2. Therefore, the situation that the resource allocation values of other activity participating users are too small and the numerical difference is large due to the fact that the resource allocation values of the activity participating users are too large can be avoided, and the balance of resource allocation is guaranteed.
With continued reference to fig. 3, in step S330, when the average value is less than or equal to the first reference value, a resource allocation value corresponding to the activity-participating user is determined according to the generated second random number.
In an exemplary embodiment of the present disclosure, when the average number is less than or equal to the first reference value, a resource allocation value corresponding to the activity participation user may be determined according to a second random number generated, the second random number being less than a preset number of resources of the second reward resource. For example, referring to the related explanation of step S402, taking the active participant B as an example, if the average value B is 1 and the first reference value is 10, it may be determined that the average value B is smaller than the first reference value, and then a second random number may be generated, where the second random number is smaller than the total number of the second reward resources (200), that is, the value range of the second random number is [0, 200], and for example, if the generated second random number a is 16, then the resource allocation value corresponding to the active participant B may be determined to be 16.
In the exemplary embodiment of the present disclosure, it should be noted that when it is detected that the activity participation user does not have the historical resource allocation data in the target time period, the resource allocation value corresponding to the activity participation user may also be determined according to the generated second random number, for example, when the activity participation user C does not have the historical resource allocation data in the target time period, the second random number b may be generated, and for example, when the generated second random number b is 17, the resource allocation value corresponding to the activity participation user C may be determined to be 17.
Therefore, additional reward resources which can be allocated can be developed for the activity participation users of which the average number is less than or equal to the first reference value and the historical resource allocation value does not exist, different resource allocation schemes are set for different types of users, and the reasonability of resource allocation is ensured.
In an exemplary embodiment of the present disclosure, fig. 6 shows an overall flowchart of a resource allocation method in an exemplary embodiment of the present disclosure, which includes steps S601 to S607, and a specific implementation is explained below with reference to fig. 6.
In step S601, start;
in step S602, detecting whether there is historical resource allocation data for the activity-participating user;
in step S603, if no (there is no historical resource allocation data), determining the generated second random number as a resource allocation value of the activity participation user; in step S604, end;
in step S605, if yes (there is historical resource allocation data), an average value of the historical resource allocation data is calculated;
in step S606, it is determined whether the obtained average value is greater than a first reference value;
in step S607, if yes (the average value is greater than the first reference value), calculating a resource allocation value corresponding to the activity participation user according to the average value and the generated first random number; skipping to the step S604 and ending;
If not (the average value is less than or equal to the first reference value), jumping to the step S603, and determining the generated second random number as the resource allocation value of the activity participation user; and jumping to the step S604 and ending.
Therefore, the activity participation users can be classified according to the numerical value of the average value, different resource allocation schemes are set for different types of users, the technical problems that in the prior art, resources are allocated to the users completely by means of random numbers, so that part of users are continuously allocated to fewer resources, and the participation enthusiasm of the users is low are solved, and the activity of the users and the resource conversion rate of related sales shops are improved.
The present disclosure also provides a resource allocation apparatus, and fig. 7 shows a schematic structural diagram of the resource allocation apparatus in an exemplary embodiment of the present disclosure; as shown in fig. 7, the resource allocation apparatus 700 may include a data acquisition module 701, a first allocation module 702, and a second allocation module 703. Wherein:
a data obtaining module 701, configured to, when it is detected that there is historical resource allocation data in a target time period for an activity-participating user, obtain an average value of the historical resource allocation data in the target time period.
In an exemplary embodiment of the disclosure, the data obtaining module is configured to, after detecting that the activity participation user has the historical resource allocation data in the target time period, when the activity start time is earlier than the start time of the target time period, or the activity start time is the same as the start time of the target time period, sequentially obtain the historical resource allocation data of the activity participation user in the target time period in an order from early to late according to time points included in the target time period; when the activity starting time is later than the starting time of the target time period, the historical resource allocation data of the activity participation users in the target time period after the activity starting time are sequentially acquired according to the sequence from the late to the early of the time points contained in the target time period.
In an exemplary embodiment of the disclosure, the data obtaining module is configured to obtain an average value of the historical resource allocation data in the target time period when the presence of the historical resource allocation data in the target time period is detected for the activity participation user.
In an exemplary embodiment of the disclosure, the data obtaining module is configured to, when it is detected that there is historical resource allocation data within a target time period for an activity-participating user, obtain an allocation number corresponding to the historical resource allocation data; and obtaining the average value of the historical resource distribution data in the target time period according to the distribution times and the total amount of the historical resource distribution data.
A first allocation module 702, configured to determine, when the average value is greater than a first reference value, a resource allocation value corresponding to the activity participation user according to the average value and the generated first random number; the first random number is smaller than the preset number of resources of the first bonus resource.
In an exemplary embodiment of the present disclosure, the first distribution module is configured to obtain a target difference value between the average value and the first reference value when the average value is greater than the first reference value; obtaining a target product of the target difference value and the first random number; and determining the sum of the average value and the target product as a resource allocation value corresponding to the activity participation user.
In an exemplary embodiment of the disclosure, the first allocation module is configured to, when the average value is equal to the second reference value, obtain an associated numerical value corresponding to the second reference value; determining a resource allocation value corresponding to the activity participation user according to the correlation value, the difference value between the second reference value and the correlation value and the generated third random number; wherein the second reference value is larger than the first reference value.
In an exemplary embodiment of the disclosure, the first allocation module is configured to determine a product of the second reference value and the preset threshold as an associated numerical value corresponding to the second reference value.
A second allocating module 703, configured to determine, according to the generated second random number, a resource allocation value corresponding to the activity participating user when the average value is less than or equal to the first reference value; the second random number is smaller than the preset number of resources of the second reward resource.
In an exemplary embodiment of the present disclosure, the second allocating module is configured to determine, when the average value is less than or equal to the first reference value, a resource allocation value corresponding to the activity participation user according to the generated second random number; the second random number is smaller than the preset number of resources of the second reward resource.
In an exemplary embodiment of the disclosure, the second allocation module is configured to determine, according to the generated second random number, a resource allocation value corresponding to the activity participation user when it is detected that the activity participation user does not have historical resource allocation data within the target time period.
The specific details of each module in the resource allocation apparatus have been described in detail in the corresponding resource allocation method, and therefore are not described herein again.
It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
Moreover, although the steps of the methods of the present disclosure are depicted in the drawings in a particular order, this does not require or imply that the steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions, etc.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
In an exemplary embodiment of the present disclosure, there is also provided a computer storage medium capable of implementing the above method. On which a program product capable of implementing the above-described method of the present specification is stored. In some possible embodiments, various aspects of the disclosure may also be implemented in the form of a program product comprising program code for causing a terminal device to perform the steps according to various exemplary embodiments of the disclosure described in the "exemplary methods" section above of this specification, when the program product is run on the terminal device.
Referring to fig. 8, a program product 800 for implementing the above method according to an embodiment of the present disclosure is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present disclosure is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
A computer readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
In addition, in an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.
As will be appreciated by one skilled in the art, aspects of the present disclosure may be embodied as a system, method or program product. Accordingly, various aspects of the present disclosure may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
An electronic device 900 according to this embodiment of the disclosure is described below with reference to fig. 9. The electronic device 900 shown in fig. 9 is only an example and should not bring any limitations to the functionality or scope of use of the embodiments of the present disclosure.
As shown in fig. 9, the electronic device 900 is embodied in the form of a general purpose computing device. Components of electronic device 900 may include, but are not limited to: the at least one processing unit 910, the at least one storage unit 920, a bus 930 connecting different system components (including the storage unit 920 and the processing unit 910), and a display unit 940.
Wherein the storage unit stores program code that is executable by the processing unit 910 to cause the processing unit 910 to perform steps according to various exemplary embodiments of the present disclosure described in the above section "exemplary method" of the present specification. For example, the processing unit 910 may perform the following as shown in fig. 3: step S310, when detecting that the activity participation user has historical resource distribution data in a target time period, acquiring the average value of the historical resource distribution data in the target time period; step S320, when the average value is larger than the first reference value, determining a resource allocation value corresponding to the activity participation user according to the average value and the generated first random number; the first random number is smaller than the preset resource number of the first reward resource; step S330, when the average value is less than or equal to the first reference value, determining a resource allocation value corresponding to the activity participation user according to the generated second random number; the second random number is smaller than the preset number of resources of the second reward resource.
The storage unit 920 may include a readable medium in the form of a volatile storage unit, such as a random access memory unit (RAM)9201 and/or a cache memory unit 9202, and may further include a read only memory unit (ROM) 9203.
The electronic device 900 may also communicate with one or more external devices 1000 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 900, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 900 to communicate with one or more other computing devices. Such communication may occur via input/output (I/O) interface 950. Also, the electronic device 900 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN) and/or a public network, such as the Internet) via the network adapter 960. As shown, the network adapter 960 communicates with the other modules of the electronic device 900 via the bus 930. It should be appreciated that although not shown, other hardware and/or software modules may be used in conjunction with the electronic device 900, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
Furthermore, the above-described figures are merely schematic illustrations of processes included in methods according to exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
Claims (10)
1. A method for resource allocation, comprising:
when detecting that the activity participation user has historical resource allocation data in a target time period, acquiring an average value of the historical resource allocation data in the target time period;
when the average value is larger than a first reference value, determining a resource allocation value corresponding to the activity participation user according to the average value and the generated first random number; the first random number is smaller than the preset resource number of the first reward resource;
when the average value is smaller than or equal to the first reference value, determining a resource allocation value corresponding to the activity participation user according to the generated second random number; the second random number is smaller than the preset resource number of the second reward resource.
2. The method of claim 1, further comprising:
and when the fact that the historical resource allocation data in the target time period do not exist in the activity participation user is detected, determining a resource allocation value corresponding to the activity participation user according to the generated second random number.
3. The method according to claim 1, wherein when the average value is greater than a first reference value, determining a resource allocation value corresponding to the activity-participating user according to the average value and the generated first random number comprises:
When the average value is larger than a first reference value, acquiring a target difference value of the average value and the first reference value;
obtaining a target product of the target difference value and the first random number;
and determining the sum of the average value and the target product as a resource allocation value corresponding to the activity participation user.
4. The method according to claim 1 or 2, characterized in that the method further comprises:
when the average value is equal to a second reference value, acquiring a correlation value corresponding to the second reference value;
determining a resource allocation value corresponding to the activity participation user according to the correlation value, the difference value between the second reference value and the correlation value and the generated third random number;
wherein the second reference value is greater than the first reference value.
5. The method according to claim 4, wherein the obtaining of the associated numerical value corresponding to the second reference value comprises:
and determining the product of the second reference value and a preset threshold value as an associated numerical value corresponding to the second reference value.
6. The method of claim 5, wherein obtaining an average of historical resource allocation data over a target time period when the presence of historical resource allocation data over the target time period is detected by the active participant user comprises:
When detecting that the activity participation user has historical resource allocation data in a target time period, acquiring the total amount of the historical resource allocation data;
and obtaining the average value of the historical resource allocation data in the target time period according to the duration of the target time period and the total amount of the historical resource allocation data.
7. The method of claim 1, wherein after detecting historical resource allocation data for a target period of time of presence of an actively engaged user, the method further comprises:
when the activity starting time is earlier than the starting time of the target time period, or the activity starting time is the same as the starting time of the target time period, sequentially acquiring the historical resource allocation data of the activity participating users in the target time period according to the sequence of the time points included in the target time period from early to late;
and when the activity starting time is later than the starting time of the target time period, sequentially acquiring the historical resource allocation data of the activity participation users in the target time period after the activity starting time according to the sequence from the late to the early of the time points contained in the target time period.
8. A resource allocation apparatus, comprising:
the data acquisition module is used for acquiring the average value of historical resource allocation data in a target time period when the historical resource allocation data in the target time period exist in an activity participation user;
the first allocation module is used for determining a resource allocation value corresponding to the activity participation user according to the average value and the generated first random number when the average value is larger than a first reference value; the first random number is smaller than the preset resource number of the first reward resource;
a second allocating module, configured to determine, according to a second random number generated when the average value is less than or equal to the first reference value, a resource allocation value corresponding to the activity participation user; the second random number is smaller than the preset resource number of the second reward resource.
9. A computer storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the resource allocation method of any one of claims 1 to 7.
10. An electronic device, comprising:
a processor; and
a memory for storing executable instructions of the processor;
Wherein the processor is configured to perform the resource allocation method of any one of claims 1-7 via execution of the executable instructions.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010098929.8A CN112288206A (en) | 2020-02-18 | 2020-02-18 | Resource allocation method and device, computer storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010098929.8A CN112288206A (en) | 2020-02-18 | 2020-02-18 | Resource allocation method and device, computer storage medium and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112288206A true CN112288206A (en) | 2021-01-29 |
Family
ID=74420175
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010098929.8A Pending CN112288206A (en) | 2020-02-18 | 2020-02-18 | Resource allocation method and device, computer storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112288206A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114980333A (en) * | 2022-05-20 | 2022-08-30 | 中国联合网络通信集团有限公司 | Method and device for verifying resource allocation result, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160125333A1 (en) * | 2014-11-04 | 2016-05-05 | Yu Cheng | Efficient computerized calculation of resource reallocation scheduling schemes |
| CN109600414A (en) * | 2018-08-13 | 2019-04-09 | 北京字节跳动网络技术有限公司 | A kind of resource allocation methods, device, equipment and storage medium |
| CN110008008A (en) * | 2017-12-29 | 2019-07-12 | 广东欧珀移动通信有限公司 | Applied program processing method and device, electronic equipment, computer readable storage medium |
| CN110033148A (en) * | 2018-01-11 | 2019-07-19 | 北京三快在线科技有限公司 | Method and device, electronic equipment for service resource allocation |
-
2020
- 2020-02-18 CN CN202010098929.8A patent/CN112288206A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160125333A1 (en) * | 2014-11-04 | 2016-05-05 | Yu Cheng | Efficient computerized calculation of resource reallocation scheduling schemes |
| CN110008008A (en) * | 2017-12-29 | 2019-07-12 | 广东欧珀移动通信有限公司 | Applied program processing method and device, electronic equipment, computer readable storage medium |
| CN110033148A (en) * | 2018-01-11 | 2019-07-19 | 北京三快在线科技有限公司 | Method and device, electronic equipment for service resource allocation |
| CN109600414A (en) * | 2018-08-13 | 2019-04-09 | 北京字节跳动网络技术有限公司 | A kind of resource allocation methods, device, equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 李星宇: "微信红包金额真的是随机分配的吗？", 《经济资料译丛》, no. 04, 15 October 2016 (2016-10-15), pages 27 - 33 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114980333A (en) * | 2022-05-20 | 2022-08-30 | 中国联合网络通信集团有限公司 | Method and device for verifying resource allocation result, electronic equipment and storage medium |
| CN114980333B (en) * | 2022-05-20 | 2024-05-14 | 中国联合网络通信集团有限公司 | Verification method and device of resource allocation result, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110807649A (en) | Invitation reward method and system for financial products | |
| CN110135912B (en) | Information pushing method and device, server and storage medium | |
| CN111612502A (en) | Resource allocation method and device based on activity task and electronic equipment | |
| CN109600344A (en) | Identify the method, apparatus and electronic equipment of risk group | |
| CN111461776A (en) | Resource distribution method, device, equipment and storage medium | |
| CN110955640A (en) | Cross-system data file processing method, device, server and storage medium | |
| CN110659438A (en) | Method, apparatus and computer storage medium for issuing reading reward | |
| CN115578138A (en) | Marketing method, marketing device, marketing medium and computing equipment | |
| CN109711849B (en) | Ether house address portrait generation method and device, electronic equipment and storage medium | |
| CN112288206A (en) | Resource allocation method and device, computer storage medium and electronic equipment | |
| CN110688401A (en) | Dynamic cache processing method and device, storage medium and electronic equipment | |
| CN110689425A (en) | Method and device for pricing quota based on income and electronic equipment | |
| CN110750346B (en) | Task operation optimization method, device, terminal and storage medium | |
| CN110070383B (en) | Abnormal user identification method and device based on big data analysis | |
| CN104301205A (en) | Interaction guiding method and device | |
| CN115016890A (en) | Virtual machine resource allocation method and device, electronic equipment and storage medium | |
| CN110033242B (en) | Working time determining method, device, equipment and medium | |
| CN114201729A (en) | Method, device and equipment for selecting matrix operation mode and storage medium | |
| CN113590495A (en) | Method, device, equipment and storage medium for determining test coverage rate | |
| CN112508631A (en) | User policy distribution method and device and electronic equipment | |
| CN115292562B (en) | Big data based qualified user screening method, device, medium and computing equipment | |
| CN109614066A (en) | Information display method and device | |
| CN111680867B (en) | Resource allocation method and device and electronic equipment | |
| CN113328913B (en) | Method, device and system for improving project testing efficiency | |
| CN109800981B (en) | Threshold setting method and device, storage medium and electronic equipment |
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: 20210129 |