CN110648032A - Information updating method and device - Google Patents

Information updating method and device Download PDF

Info

Publication number
CN110648032A
CN110648032A CN201810674765.1A CN201810674765A CN110648032A CN 110648032 A CN110648032 A CN 110648032A CN 201810674765 A CN201810674765 A CN 201810674765A CN 110648032 A CN110648032 A CN 110648032A
Authority
CN
China
Prior art keywords
sub
region
area
users
resource allocation
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
Application number
CN201810674765.1A
Other languages
Chinese (zh)
Inventor
张之硕
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jingdong Century Trading Co Ltd
Beijing Jingdong Shangke Information Technology Co Ltd
Original Assignee
Beijing Jingdong Century Trading Co Ltd
Beijing Jingdong Shangke Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Jingdong Century Trading Co Ltd, Beijing Jingdong Shangke Information Technology Co Ltd filed Critical Beijing Jingdong Century Trading Co Ltd
Priority to CN201810674765.1A priority Critical patent/CN110648032A/en
Publication of CN110648032A publication Critical patent/CN110648032A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0207Discounts or incentives, e.g. coupons or rebates
    • G06Q30/0212Chance 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)
  • Physics & Mathematics (AREA)
  • Game Theory and Decision Science (AREA)
  • Marketing (AREA)
  • Finance (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Educational Administration (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

The embodiment of the application discloses an information updating method and device. One embodiment of the method comprises: dividing a target area into at least one sub-area according to a preset area dividing mode; for a sub-area in the at least one sub-area, determining the total number of users of the sub-area and the number of users of the sub-area, which are allocated to resources; updating the resource allocation probability of the sub-region based on the total number of the users of the sub-region and the number of the users of the sub-region which have been allocated with resources; and updating the information of the user account corresponding to the user in the sub-area by using the updated resource allocation probability. This embodiment improves the balance of resource allocation.

Description

Information updating method and device
Technical Field
The embodiment of the application relates to the technical field of computers, in particular to an information updating method and device.
Background
In existing events (e.g., lottery events), there is often a need to allocate resources (e.g., prizes in the lottery event), which are typically all users facing the platform (e.g., e-commerce platform). Currently, in the resource allocation process, the difference of the areas where the users are located is generally not considered. And in general, the resource allocation probability remains unchanged after the configuration is completed until the resource allocation is completed. Naturally, in order to improve the resource allocation effect, it is also possible to allocate resources using a fixed resource allocation probability until the end of allocation, but in this case, a large amount of resources need to be applied.
Disclosure of Invention
The embodiment of the application provides an information updating method and device.
In a first aspect, an embodiment of the present application provides an information updating method, where the method includes: dividing a target area into at least one sub-area according to a preset area dividing mode; for a sub-area in at least one sub-area, determining the total number of users of the sub-area and the number of users of the sub-area, which are allocated to resources; updating the resource allocation probability of the sub-region based on the total number of the users of the sub-region and the number of the users of the sub-region which have been allocated with resources; and updating the information of the user account corresponding to the user in the sub-area by using the updated resource allocation probability.
In some embodiments, updating the resource allocation probability for the sub-region comprises: setting the updating frequency of the resource allocation probability of the sub-region; and updating the resource allocation probability of the sub-area according to the set updating frequency.
In some embodiments, the set update frequency is inversely proportional to the number of sub-regions included in the at least one sub-region.
In some embodiments, determining the total number of users of the sub-region and the number of users to which the sub-region has been allocated resources comprises: acquiring address information of a user in a target area; determining the total number of the users in the sub-area based on the acquired address information of the users and the address information of the sub-area; and determining the number of the users of which the sub-area is allocated to the resource based on the address information of the users of which the resource is allocated and the address information of the sub-area.
In some embodiments, the method further comprises: setting an initial resource allocation probability and a minimum resource allocation probability for the sub-region; and updating the resource allocation probability of the sub-region based on the total number of the users of the sub-region and the number of the users of the sub-region allocated with the resources, wherein the updating comprises the following steps: determining the proportion of the number of users allocated to the resources in the sub-area to the total number of users in the sub-area; and updating the resource allocation probability of the sub-region based on the occupation ratio and a preset exponential decay coefficient, so that the resource allocation probability of the sub-region is attenuated from the initial resource allocation probability to the minimum resource allocation probability.
In a second aspect, an embodiment of the present application provides an information updating apparatus, where the apparatus includes: the sub-region dividing unit is configured to divide the target region into at least one sub-region according to a preset region dividing mode; the information updating unit is configured to determine the total number of users of at least one sub-area and the number of users of the sub-area, which are allocated to resources, for the sub-area; updating the resource allocation probability of the sub-region based on the total number of the users of the sub-region and the number of the users of the sub-region which have been allocated with resources; and updating the information of the user account corresponding to the user in the sub-area by using the updated resource allocation probability.
In some embodiments, the information update unit is further configured to: setting the updating frequency of the resource allocation probability of the sub-region; and updating the resource allocation probability of the sub-area according to the set updating frequency.
In some embodiments, the set update frequency is inversely proportional to the number of sub-regions included in the at least one sub-region.
In some embodiments, the information update unit is further configured to: acquiring address information of a user in a target area; determining the total number of the users in the sub-area based on the acquired address information of the users and the address information of the sub-area; and determining the number of the users of which the sub-area is allocated to the resource based on the address information of the users of which the resource is allocated and the address information of the sub-area.
In some embodiments, the apparatus further comprises: a setting unit configured to set an initial resource allocation probability and a minimum resource allocation probability for the sub-area; and the information updating unit is further configured to: determining the proportion of the number of users allocated to the resources in the sub-area to the total number of users in the sub-area; and updating the resource allocation probability of the sub-region based on the occupation ratio and a preset exponential decay coefficient, so that the resource allocation probability of the sub-region is attenuated from the initial resource allocation probability to the minimum resource allocation probability.
According to the information updating method and device provided by the embodiment of the application, the target area can be divided into at least one sub-area according to the preset area dividing mode, then for the sub-area in the at least one sub-area, the total number of users of the sub-area and the number of users of the sub-area, which are already allocated with resources, can be determined, then the resource allocation probability of the sub-area can be updated based on the total number of users of the sub-area and the number of users of the sub-area, which are already allocated with resources, and finally, the information updating is performed on the user account corresponding to the user of the sub-area by using the updated resource allocation probability, so that the user of the allocated resources can be selected from the users of the sub-area by using the updated resource allocation probability.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 is an exemplary system architecture diagram in which one embodiment of the present application may be applied;
FIG. 2 is a flow diagram of one embodiment of an information update method according to the present application;
FIG. 3 is a schematic diagram of an application scenario of an information update method according to the present application;
FIG. 4 is a flow diagram of yet another embodiment of an information update method according to the present application;
FIG. 5 is a schematic block diagram of one embodiment of an information update apparatus according to the present application;
FIG. 6 is a schematic block diagram of a computer system suitable for use in implementing an electronic device according to embodiments of the present application.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 illustrates an exemplary system architecture 100 to which embodiments of the information updating method or information updating apparatus of the present application may be applied.
As shown in fig. 1, the system architecture 100 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 serves as a medium for providing communication links between the terminal devices 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use the terminal devices 101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. Various client applications, such as shopping applications, web browser applications, search applications, instant messaging tools, mailbox clients, social platform software, etc., may be installed on the terminal devices 101, 102, 103.
The terminal apparatuses 101, 102, and 103 may be hardware or software. When the terminal devices 101, 102, 103 are hardware, they may be various electronic devices having a display screen and supporting the user to view the resource allocation result (e.g., lottery result), including but not limited to smart phones, tablet computers, e-book readers, MP3 players (Moving picture Experts Group Audio Layer III, motion picture Experts compression standard Audio Layer 3), MP4 players (Moving picture Experts Group Audio Layer IV, motion picture Experts compression standard Audio Layer 4), laptop portable computers, desktop computers, and the like. When the terminal apparatuses 101, 102, 103 are software, they can be installed in the electronic apparatuses listed above. It may be implemented as multiple pieces of software or software modules (e.g., to provide distributed services) or as a single piece of software or software module. And is not particularly limited herein.
The server 105 may be a server that provides various services, such as a background server that provides support for resource allocation results (e.g., lottery results) displayed on the terminal devices 101, 102, 103. The background server may analyze and perform other processing on data such as the total number of users in the sub-area and the number of users that have been allocated to the resource, and feed back a processing result (e.g., updated user account information) to the terminal device.
It should be noted that the information updating method provided in the embodiment of the present application is generally executed by the server 105, and accordingly, the information updating apparatus is generally disposed in the server 105.
The server may be hardware or software. When the server is hardware, it may be implemented as a distributed server cluster formed by multiple servers, or may be implemented as a single server. When the server is software, it may be implemented as multiple pieces of software or software modules (e.g., to provide distributed services), or as a single piece of software or software module. And is not particularly limited herein.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
With continued reference to FIG. 2, a flow 200 of one embodiment of an information update method according to the present application is shown. The information updating method comprises the following steps:
step 201, dividing the target area into at least one sub-area according to a preset area division mode.
In this embodiment, for a target area that needs to be allocated with resources, an execution subject of the information updating method (for example, the server 105 shown in fig. 1) may divide the target area into at least one sub-area according to a preset area division manner. As an example, the event requiring resource allocation may be a lottery event of an e-commerce platform, the target area may be all china if the lottery event held by the e-commerce platform is held in all china, and the target area may be beijing if the event held by the e-commerce platform is held in beijing. Here, the resource refers to information of a virtual item that can be embodied in a user account, which can embody an item exchange value or can support purchase of the item, such as an electronic ticket, a point, an account balance, and the like in an e-commerce platform.
It is to be understood that, the execution subject may preset a region division manner for performing region division on the target region, so that the execution subject may divide the target region into at least one sub-region according to the region division manner. For example, if the target area is all china, the area division may be performed in a manner that each level of administration unit (e.g., first level administration unit, second level administration unit, etc.) is a division unit. The execution subject may obtain a plurality of sub-regions smaller than the target region after dividing the target region according to a preset region division manner. Therefore, the resource allocation process can be performed in each sub-area in an isolated manner, so that the problem that some sub-areas consume resources too fast in the target area, which causes too few resources allocated to other sub-areas or no allocable resources is solved, and the resources are allocated more uniformly in the space dimension.
It should be noted that, after the execution main body divides the target region according to a preset region division manner, only one sub-region may be obtained, where the sub-region is the target region. This may be the case regardless of whether the allocation of resources is uniform in the spatial dimension. Therefore, the resource can be uniformly distributed in the spatial dimension by setting the region division mode by the person skilled in the art.
In some optional implementation manners of this embodiment, when the target region is sub-region-divided according to a preset region division manner, the execution main body may initialize each of the divided sub-regions into the memory to become a small region in the memory. For example, the target area is divided into 39364 rural sub-areas throughout china according to four-level administrative districts, and the 39364 rural sub-areas may be initialized into the memory in a predefined data structure. The predefined data structure here may be in the form of a class in an object-oriented programming language, or may also be in the form of a structure struct in a non-object-oriented language. Furthermore, the sub-regions can be organized in a linked list or tree form, so that the resource allocation probability of each sub-region can be updated sequentially by traversing the linked list or tree when the resource allocation probability of the sub-regions is updated. Optionally, if the activity of a certain sub-region is finished, the data of the sub-region may be deleted from the memory, and the memory space is released.
Step 202 can be realized by step 2021 to step 2023. Specifically, the execution subject may perform steps 2021 to 2023 for each of the at least one sub-area divided in step 201, thereby performing resource allocation for each sub-area. As an example, the at least one sub-region into which the target region is divided may include a sub-region a, a sub-region B, a sub-region C, and the like. In this embodiment, the execution subject may perform the following steps on any sub-region (for example, sub-region a) of sub-region a, sub-region B, sub-region C, and the like, so as to implement resource allocation on the sub-region. It can be understood that the information updating method disclosed in this embodiment may be applied to all the sub-areas into which the target area is divided.
Step 2021, determine the total number of users in the sub-region and the number of users in the sub-region that have been allocated to resources.
In this embodiment, the execution subject (e.g., the server 105 shown in fig. 1) may determine the total number of users in the sub-area (e.g., the sub-area a), and further determine the number of users that have been allocated to resources in the sub-area. It is understood that the total number of users in the sub-area may be regarded as constant (or the variation of the total number of users in the sub-area may be regarded as constant within a preset range), and the number of users in the sub-area to which resources have been allocated is gradually increased during the activity period.
In some optional implementation manners of this embodiment, the execution subject may determine, according to the address information of the user, a sub-region to which the user belongs, so as to determine the total number of users in the sub-region (for example, the sub-region a) and the number of users that have been allocated to the resource. Specifically, the execution main body may obtain address information of all users in the target area, and then compare the obtained address information of the users with address information of each sub-area, so as to determine the sub-area to which each user belongs, that is, to determine the total number of users in the sub-area. Further, the execution subject may compare the address information of the user allocated to the resource with the address information of each sub-area, so as to determine the sub-area to which each user allocated to the resource belongs, that is, to determine the number of users allocated to the resource in the sub-area. As an example, the execution subject may use general shipping address information or default shipping address information of the user in the e-commerce platform as the address information of the user.
Step 2022, updating the resource allocation probability of the sub-region based on the total number of users of the sub-region and the number of users of the sub-region that have been allocated with resources.
In this embodiment, based on the total number of users in the sub-area (for example, the sub-area a) obtained in step 2021 and the number of users of the sub-area that have been allocated to resources, the execution subject may update the original resource allocation probability of the sub-area. Here, the user that has been allocated to the resource may be a user whose resource information in the user account has been updated.
It will be appreciated that as the activity progresses, the probability of resource allocation for a sub-region will generally decrease progressively, as will the temperature cooling down over time. Therefore, as the activity progresses, the number of users to which resources have been allocated in the sub-area gradually increases, so that the resource allocation probability of the sub-area can be gradually reduced.
As an example, at the beginning of the lottery event, the execution subject may configure an initial winning probability for the sub-area a, and as the counted number of the won persons in the sub-area a increases in proportion to the total number of users in the sub-area a, the winning probability for the sub-area a may be gradually decreased until the winning probability for the sub-area a is decreased to 0 at the end of the event.
In some optional implementation manners of this embodiment, the execution subject may count, in real time, the number of users that have been allocated to the resource in the sub-area (for example, the sub-area a), and then update the resource allocation probability of the sub-area in real time.
In some optional implementations of this embodiment, the execution subject may further preset an update frequency of the resource allocation probability of the sub-area (e.g., sub-area a). In this case, the execution subject may update the number of users allocated with resources in the sub-area in real time, and then update the resource allocation probability of the sub-area according to the set update frequency. For example, the resource allocation probability of the sub-area a is updated every 5 seconds. It can be understood that, the execution main body may also count the number of users allocated to the resource in the sub-area according to a preset frequency, without counting the number of users allocated to the resource in the sub-area in real time.
In some optional implementations of the present implementation, the update frequency set by the execution subject may be inversely proportional to the number of sub-regions into which the target region is divided. That is, when the number of sub-target regions into which the target region is divided is small (for example, the whole china is divided into 34 provincial sub-regions according to the first-class administrative district as the target region), a relatively high update frequency of the resource allocation probability may be set; when the number of sub-areas into which the target area is divided is large (for example, the whole chinese is divided into 39364 rural sub-areas by four-level administrative districts as the target area), a relatively low update frequency of the resource allocation probability may be set.
Step 2023, updating the information of the user account corresponding to the user in the sub-area by using the updated resource allocation probability.
In this embodiment, based on the updated resource allocation probability of the sub-area (e.g., the sub-area a) obtained in step 2022, the execution main body may select the user to which the resource is allocated from the users in the sub-area according to the updated resource allocation probability, and update the user account information corresponding to the selected user, so as to allocate the resource to the selected user account. As an example, in the coupon drawing activity of the e-commerce platform, the execution subject may select a winning user from the sub area a (e.g., beijing) with the updated resource allocation probability, and update information such as the number or amount of coupons in the account information of the selected user to issue the coupons to the user account of the selected user.
It is understood that the executing entity may allocate resources to all users in the sub-region by using the updated resource allocation probability, in this case, there may be users in the sub-region that repeatedly allocate resources. Alternatively, the executing entity may allocate resources to users to which resources are not allocated in the sub-area by using the updated resource allocation probability, in which case, there is no user to which resources are repeatedly allocated in the sub-area.
With continued reference to fig. 3, fig. 3 is a schematic diagram of an application scenario of the information updating method according to the present embodiment. In the application scenario of fig. 3, the resource allocation event may be a lottery event held by the e-commerce platform in the whole china. The background server may first divide the whole china as a target region into at least one sub-region (e.g., provincial sub-regions of beijing, shanghai, guangdong province, etc.) according to a preset region division manner. Thereafter, for a sub-area (e.g., Beijing) of the at least one sub-area, the back-office server may determine a total number of users for the sub-area and a number of users for which coupons have been distributed. Then, the winning probability of the sub-area is updated based on the total number of users of the sub-area and the number of users of the sub-area to which the coupons have been distributed. And finally, the background server can update the information of the account corresponding to the user in the subarea by using the updated winning probability, namely, the winning user is selected from the subarea by using the updated winning probability, and the coupon is issued to the user account of the winning user.
In the information updating method provided by the above embodiment of the present application, the target area is divided into at least one sub-target area, and a virtual area barrier is formed between the sub-areas, so that the resource is evenly distributed in the spatial dimension, and the resource consumption caused by excessive sub-areas in the target area is avoided. Further, the information updating method provided by the above embodiment of the present application updates the resource allocation probability of the sub-region, thereby avoiding too fast resource consumption caused by unchanged resource allocation probability in the resource allocation process, and reducing the cost.
With further reference to fig. 4, a flow 400 of yet another embodiment of an information update method is shown. The process 400 of the information updating method includes the following steps:
step 401, dividing the target area into at least one sub-area according to a preset area division mode.
In this embodiment, for a target area that needs to be allocated with resources, an execution subject of the information updating method (for example, the server 105 shown in fig. 1) may divide the target area into at least one sub-area according to a preset area division manner. As an example, the event requiring resource allocation may be a lottery event of an e-commerce platform, the target area may be all china if the lottery event held by the e-commerce platform is held in all china, and the target area may be beijing if the event held by the e-commerce platform is held in beijing. It is to be understood that, the execution subject may preset a region division manner for performing region division on the target region, so that the execution subject may divide the target region into at least one sub-region according to the region division manner. For example, if the target area is all china, the area division may be performed in a manner that each level of administration unit (e.g., first level administration unit, second level administration unit, etc.) is a division unit. Here, the resource refers to information of a virtual item that can be embodied in a user account, which can embody an item exchange value or can support purchase of the item, such as an electronic ticket, a point, an account balance, and the like.
The execution subject may obtain a plurality of sub-regions smaller than the target region after dividing the target region according to a preset region division manner. Therefore, the resource allocation process can be performed in each sub-area in an isolated manner, so that the problem that some sub-areas consume resources too fast in the target area, which causes too few resources allocated to other sub-areas or no allocable resources is solved, and the resources are allocated more uniformly in the space dimension.
Step 402 can be realized by the following steps 4021 to 4025. Specifically, it can be realized by step 4021 to step 4025. The execution subject may perform steps 4021 to 4025 for each of at least one of the sub-regions divided in step 401, thereby allocating resources to each sub-region. As an example, the at least one sub-region into which the target region is divided may include a sub-region a, a sub-region B, a sub-region C, and the like. In this embodiment, the execution subject may perform the following steps on any sub-region (for example, sub-region a) of sub-region a, sub-region B, sub-region C, and the like, so as to implement resource allocation on the sub-region. It can be understood that the information updating method disclosed in this embodiment may be applied to all the sub-areas into which the target area is divided.
Step 4021, determining the total number of users in the sub-area and the number of users in the sub-area that have been allocated to resources.
In this embodiment, the execution subject (e.g., the server 105 shown in fig. 1) may determine the total number of users in the sub-area (e.g., the sub-area a), and further determine the number of users that have been allocated to resources in the sub-area. It is understood that the total number of users in the sub-area may be regarded as constant (or the variation of the total number of users in the sub-area may be regarded as constant within a preset range), and the number of users in the sub-area to which resources have been allocated is gradually increased during the activity period. Here, the user that has been allocated to the resource may be a user whose resource information in the user account should be updated.
Step 4022, setting an initial resource allocation probability and a minimum resource allocation probability for the sub-region.
In this embodiment, the execution subject may be set for the sub-area (e.g., sub-area a)Initial resource allocation probability P0And a minimum resource allocation probability P1. Wherein the initial resource allocation probability P0The probability of resource allocation for the sub-region at the start of the activity, minimum probability of resource allocation P, can be1A probability may be assigned for the sub-region of minimum resources throughout the duration of the activity. Here, the initial resource allocation probability P0Is generally greater than the minimum resource allocation probability P1
It can be understood that the executing entity may set the same initial resource allocation probability and the same minimum resource allocation probability for the target region, that is, the initial resource allocation probabilities corresponding to the sub-regions into which the target region is divided are the same and the minimum resource allocation probabilities are also the same. Alternatively, the execution subject may set an initial resource allocation probability and a minimum resource allocation probability for each sub-region, so that the initial resource allocation probability and the minimum resource allocation probability of different sub-regions may be different.
Step 4023, determining the ratio of the number of users allocated to the resource in the sub-area to the total number of users in the sub-area.
In this embodiment, the execution subject may determine in advance the total number m of users in the sub-area (e.g., sub-area a) and the number n of users that have been allocated to the resource. Then, the ratio of the number n of users allocated to the resource in the sub-area to the total number m of users in the sub-area is calculated, namely the value of n/m is calculated. Wherein m and n are natural numbers.
Step 4024, updating the resource allocation probability of the sub-region based on the occupation ratio and the preset exponential decay coefficient, so that the resource allocation probability of the sub-region is attenuated from the initial resource allocation probability to the minimum resource allocation probability.
In this implementation, the execution subject may update the resource allocation probability of the sub-region in an exponentially decaying manner, and thus it may set an exponentially decaying coefficient α in advance. For the sub-area (for example, sub-area a), based on the ratio n/m of the number n of users allocated to the resource to the total number m of users obtained in step 4023, the executing entity may use the ratio n/m and a preset exponential decay coefficient α to perform an exponential decrement processThe resource allocation probability P for the sub-region is updated. The exponential decay coefficient alpha value can influence the decay speed of the resource distribution probability. Thus, the resource allocation probability of the sub-region may be derived from the initial resource allocation probability P of the sub-region0Gradually decaying to a minimum resource allocation probability P1
In some optional implementations of the present implementation, the resource allocation probability P of the sub-region (e.g., sub-region a) is calculated by using the following formula:
P=P1+(P0-P1)×e-α(n/m)
at the beginning of an activity, the number of users allocated to resources in the sub-area is 0, i.e. n is 0. Substituting n-0 into the resource allocation probability formula to obtain the sub-region resource allocation probability P-P0. It can be seen that the resource allocation probability of the sub-region at the beginning of the activity is the initial resource allocation probability P0. As the activity progresses, the number n of users allocated to the resource in the sub-region is closer to the total number m of users in the sub-region, so that the resource allocation probability P of the sub-region is closer to the minimum resource allocation probability P of the sub-region1
Of course, the minimum resource allocation probability P of the above sub-region (e.g., sub-region A)1And may also be 0. At this time, the formula for calculating the updated resource allocation probability P of the sub-region is as follows:
P=P0×e-α(n/m)
in some optional implementation manners of this embodiment, after the execution subject divides the target region into a plurality of sub-regions, the same initial resource allocation probability P may be set for the sub-regions (e.g., sub-region a) therein0And a minimum resource allocation probability P1I.e. P0=P1. In this case, the resource allocation probability P of the sub-region is P0I.e. the resource allocation probability of the sub-area during activity remains unchanged. This may be understood as considering only the uniformity of the allocation of resources in the spatial dimension, and not the amount of consumption of resources.
Step 4025, updating the information of the user account corresponding to the user in the sub-area by using the updated resource allocation probability.
In this embodiment, based on the updated resource allocation probability of the sub-area (for example, the sub-area a) obtained in step 4024, the execution main body may select a user to which the resource is allocated from users in the sub-area according to the updated resource allocation probability, and update user account information corresponding to the selected user, so as to allocate the resource to the selected user account.
It is understood that the executing entity may allocate resources to all users in the sub-region by using the updated resource allocation probability, in this case, there may be users in the sub-region that repeatedly allocate resources. Alternatively, the executing entity may allocate resources to users to which resources are not allocated in the sub-area by using the updated resource allocation probability, in which case, there is no user to which resources are repeatedly allocated in the sub-area.
As can be seen from fig. 4, compared with the embodiment corresponding to fig. 2, the flow 400 of the information updating method in this embodiment highlights the step of updating the resource allocation probability of the sub-region. Therefore, the scheme described in this embodiment can exponentially decrease the allocation probability of the sub-region from the initial resource allocation probability to the minimum resource allocation probability, so that resources can be allocated continuously during the whole activity period, and at the same time, the resource consumption is prevented from being too fast, and the cost is reduced.
With further reference to fig. 5, as an implementation of the method shown in the above-mentioned figures, the present application provides an embodiment of an information updating apparatus, which corresponds to the embodiment of the method shown in fig. 2, and which can be applied to various electronic devices.
As shown in fig. 5, the information updating apparatus 500 of the present embodiment includes: a sub-region dividing unit 501 and an information updating unit 502. The sub-region dividing unit 501 is configured to divide the target region into at least one sub-region according to a preset region dividing manner; the information updating unit 502 is configured to determine, for a sub-region of at least one sub-region, a total number of users of the sub-region and a number of users to which resources have been allocated by the sub-region; updating the resource allocation probability of the sub-region based on the total number of the users of the sub-region and the number of the users of the sub-region which have been allocated with resources; and updating the information of the user account corresponding to the user in the sub-area by using the updated resource allocation probability.
In the information updating apparatus 500 provided in the above embodiment of the application, the sub-region dividing unit 501 may divide the target region into at least one sub-region according to a preset region, and then the information updating unit 502 may determine the total number of users in the sub-region and the number of users already allocated to the resource, and update the resource allocation probability of the sub-region based on the total number of users in the sub-region and the number of users already allocated to the resource, so that the information updating unit 502 may update the user account information corresponding to the user in the sub-region by using the updated resource allocation probability, and improve the balance of resource allocation.
In some optional implementations of this implementation, the information updating unit 502 is further configured to: setting the updating frequency of the resource allocation probability of the sub-region; and updating the resource allocation probability of the sub-area according to the set updating frequency.
In some optional implementations of the present implementation, the set update frequency is inversely proportional to a number of sub-regions included in the at least one sub-region.
In some optional implementations of this implementation, the information updating unit 502 is further configured to: acquiring address information of a user in a target area; determining the total number of the users in the sub-area based on the acquired address information of the users and the address information of the sub-area; and determining the number of the users of which the sub-area is allocated to the resource based on the address information of the users of which the resource is allocated and the address information of the sub-area.
In some optional implementations of this implementation, the apparatus 500 further includes: a setting unit configured to set an initial resource allocation probability and a minimum resource allocation probability for the sub-area; and the information updating unit 502 is further configured to: determining the proportion of the number of users allocated to the resources in the sub-area to the total number of users in the sub-area; and updating the resource allocation probability of the sub-region based on the occupation ratio and a preset exponential decay coefficient, so that the resource allocation probability of the sub-region is attenuated from the initial resource allocation probability to the minimum resource allocation probability.
The units recited in the apparatus 500 correspond to the various steps in the method described with reference to fig. 2 and 4. Thus, the operations and features described above for the method are equally applicable to the apparatus 500 and the units included therein, and are not described in detail here.
Referring now to FIG. 6, a block diagram of a computer system 600 suitable for use in implementing an electronic device (e.g., server 105 of FIG. 1) of an embodiment of the present application is shown. The electronic device shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.
As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU)601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611. The computer program performs the above-described functions defined in the method of the present application when executed by a Central Processing Unit (CPU) 601. It should be noted that the computer readable medium described herein can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer 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 of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, 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. In the present application, a computer 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. In this application, however, a computer readable signal medium may include a propagated data signal with computer 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 computer readable signal medium may also be any computer readable medium that is not a computer 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 computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, 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 computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present application may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes a sub-region dividing unit and an information updating unit. The names of the units do not form a limitation on the units themselves in some cases, for example, the sub-region dividing unit may also be described as a "unit that divides the target region into at least one sub-region according to a preset region dividing manner".
As another aspect, the present application also provides a computer-readable medium, which may be contained in the apparatus described in the above embodiments; or may be present separately and not assembled into the device. The computer readable medium carries one or more programs which, when executed by the apparatus, cause the apparatus to: dividing a target area into at least one sub-area according to a preset area dividing mode; for a sub-area in at least one sub-area, determining the total number of users of the sub-area and the number of users of the sub-area, which are allocated to resources; updating the resource allocation probability of the sub-region based on the total number of the users of the sub-region and the number of the users of the sub-region which have been allocated with resources; and updating the information of the user account corresponding to the user in the sub-area by using the updated resource allocation probability.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the invention. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.

Claims (12)

1. An information updating method, comprising:
dividing a target area into at least one sub-area according to a preset area dividing mode;
for a sub-area in the at least one sub-area, determining the total number of users of the sub-area and the number of users of the sub-area, which are allocated to resources; updating the resource allocation probability of the sub-region based on the total number of the users of the sub-region and the number of the users of the sub-region which have been allocated with resources; and updating the information of the user account corresponding to the user in the sub-area by using the updated resource allocation probability.
2. The method of claim 1, wherein the updating the resource allocation probability of the sub-region comprises:
setting the updating frequency of the resource allocation probability of the sub-region;
and updating the resource allocation probability of the sub-area according to the set updating frequency.
3. The method of claim 2, wherein the set update frequency is inversely proportional to the number of sub-regions included in the at least one sub-region.
4. The method of claim 1, wherein the determining the total number of users of the sub-region and the number of users of the sub-region that have been allocated to resources comprises:
acquiring address information of a user in the target area;
determining the total number of the users in the sub-area based on the acquired address information of the users and the address information of the sub-area;
and determining the number of the users of which the sub-area is allocated to the resource based on the address information of the users of which the resource is allocated and the address information of the sub-area.
5. The method according to one of claims 1-4, wherein the method further comprises: setting an initial resource allocation probability and a minimum resource allocation probability for the sub-region; and
the updating the resource allocation probability of the sub-region based on the total number of users of the sub-region and the number of users of the sub-region that have been allocated with resources includes:
determining the proportion of the number of users allocated to the resources in the sub-area to the total number of users in the sub-area;
and updating the resource allocation probability of the sub-region based on the occupation ratio and a preset exponential decay coefficient, so that the resource allocation probability of the sub-region is attenuated from the initial resource allocation probability to the minimum resource allocation probability.
6. An information updating apparatus comprising:
the sub-region dividing unit is configured to divide the target region into at least one sub-region according to a preset region dividing mode;
an information updating unit configured to determine, for a sub-region of the at least one sub-region, a total number of users of the sub-region and a number of users of the sub-region to which resources have been allocated; updating the resource allocation probability of the sub-region based on the total number of the users of the sub-region and the number of the users of the sub-region which have been allocated with resources; and updating the information of the user account corresponding to the user in the sub-area by using the updated resource allocation probability.
7. The apparatus of claim 6, wherein the information update unit is further configured to:
setting the updating frequency of the resource allocation probability of the sub-region;
and updating the resource allocation probability of the sub-area according to the set updating frequency.
8. The apparatus of claim 7, wherein the set update frequency is inversely proportional to a number of sub-regions included in the at least one sub-region.
9. The apparatus of claim 6, wherein the information update unit is further configured to:
acquiring address information of a user in the target area;
determining the total number of the users in the sub-area based on the acquired address information of the users and the address information of the sub-area;
and determining the number of the users of which the sub-area is allocated to the resource based on the address information of the users of which the resource is allocated and the address information of the sub-area.
10. The apparatus according to one of claims 6-9, wherein the apparatus further comprises: a setting unit configured to set an initial resource allocation probability and a minimum resource allocation probability for the sub-area; and
the information update unit is further configured to:
determining the proportion of the number of users allocated to the resources in the sub-area to the total number of users in the sub-area;
and updating the resource allocation probability of the sub-region based on the occupation ratio and a preset exponential decay coefficient, so that the resource allocation probability of the sub-region is attenuated from the initial resource allocation probability to the minimum resource allocation probability.
11. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-5.
12. A computer-readable medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the method of any one of claims 1-5.
CN201810674765.1A 2018-06-27 2018-06-27 Information updating method and device Pending CN110648032A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810674765.1A CN110648032A (en) 2018-06-27 2018-06-27 Information updating method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810674765.1A CN110648032A (en) 2018-06-27 2018-06-27 Information updating method and device

Publications (1)

Publication Number Publication Date
CN110648032A true CN110648032A (en) 2020-01-03

Family

ID=68988854

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810674765.1A Pending CN110648032A (en) 2018-06-27 2018-06-27 Information updating method and device

Country Status (1)

Country Link
CN (1) CN110648032A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112926822A (en) * 2021-01-19 2021-06-08 北京电解智科技有限公司 Resource allocation method and device
CN113438623A (en) * 2020-03-23 2021-09-24 腾讯科技(深圳)有限公司 Service request response method and device, electronic equipment and storage medium
CN113792994A (en) * 2021-08-25 2021-12-14 深圳市元征科技股份有限公司 Market resource allocation method and device, electronic equipment and storage medium

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113438623A (en) * 2020-03-23 2021-09-24 腾讯科技(深圳)有限公司 Service request response method and device, electronic equipment and storage medium
CN113438623B (en) * 2020-03-23 2023-08-08 腾讯科技(深圳)有限公司 Service request response method, device, electronic equipment and storage medium
CN112926822A (en) * 2021-01-19 2021-06-08 北京电解智科技有限公司 Resource allocation method and device
CN113792994A (en) * 2021-08-25 2021-12-14 深圳市元征科技股份有限公司 Market resource allocation method and device, electronic equipment and storage medium

Similar Documents

Publication Publication Date Title
JP7127010B2 (en) Resource allocation methods, apparatus, electronic equipment, computer readable media and computer programs
US10572285B2 (en) Method and apparatus for elastically scaling virtual machine cluster
CN107341050B (en) Service processing method and device based on dynamic thread pool
CN110648032A (en) Information updating method and device
CN110706093A (en) Accounting processing method and device
CN107426336B (en) Method and device for adjusting push message opening rate
CN108764866B (en) Method and equipment for allocating resources and drawing resources
CN111062572A (en) Task allocation method and device
CN112884098B (en) Card number generation method and device
CN110113176B (en) Information synchronization method and device for configuration server
CN109087139A (en) Advertisement placement method and device for feed stream
CN113344074A (en) Model training method, device, equipment and storage medium
CN111125503B (en) Method and apparatus for generating information
CN111131359A (en) Method and apparatus for generating information
CN113077220A (en) User request processing method and device
CN113127561B (en) Method and device for generating service single number, electronic equipment and storage medium
CN108683608B (en) Method and device for distributing flow
CN113971245A (en) Information pushing method, device and system
CN109471574B (en) Method and device for configuring resources
CN112926822A (en) Resource allocation method and device
CN112632074A (en) Inventory allocation method and device for database, electronic equipment and medium
CN115344359A (en) Computing power resource allocation method, device, computer readable storage medium and equipment
CN112527826B (en) Method and device for processing request
CN112784187A (en) Page display method and device
CN112183799A (en) Task allocation method and device for synthesizing task list

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