CN115879953A - User data processing method, electronic equipment and storage medium - Google Patents
User data processing method, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN115879953A CN115879953A CN202310114645.7A CN202310114645A CN115879953A CN 115879953 A CN115879953 A CN 115879953A CN 202310114645 A CN202310114645 A CN 202310114645A CN 115879953 A CN115879953 A CN 115879953A
- Authority
- CN
- China
- Prior art keywords
- user
- resource
- acquiring
- resources
- avg
- 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.)
- Granted
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Input From Keyboards Or The Like (AREA)
Abstract
The invention provides a user data processing method, which comprises the following steps: acquiring set execution end time and actual execution end time of target events of n users associated with the set interaction event to form a user information table; acquiring user levels of m user level information tables based on the user information tables; if the user level G of the jth user j =G （1+m）/2 Then to G j The resource receiving end of each corresponding user sends the same set resource; otherwise, according to the set rule, the direction G j And the corresponding resource receiving end of each user sends the corresponding resource. The invention also provides an electronic device and a storage medium. The invention can improve the user experience.
Description
Technical Field
The present invention relates to the field of big data, and in particular, to a user data processing method, an electronic device, and a storage medium.
Background
In some application scenarios, for a certain target event to be executed by a user, a corresponding interactive event is set, and when a participating user meets a set condition, a set resource is allocated to the user from a resource pool acquired through the interactive event. However, the existing interaction mode has the problem that each interaction event only aims at one target event, and the user experience is poor.
Disclosure of Invention
Aiming at the technical problems, the technical scheme adopted by the invention is as follows:
the embodiment of the invention provides a user data processing method, which comprises the following steps:
s100, acquiring set execution end time and actual execution end time of target events of n users associated with set interaction events to form a user information table; the ith row of the user information table includes (ID 1) i ，ID2 i ，T1 ie ，T2 ie ，△T i ），ID1 i Is ID of the ith user, ID2 i ID of target event for i-th user, T1 ie Setting execution end time for target event of ith user, T2 ie Actual execution end time, Δ T, of target event for ith user i Is the time difference of the ith user, if (T2) ie -T1 ie ) Is less than or equal to 0, then delta T i =0, otherwise, Δ T i =T2 ie -T1 ie I takes a value from 1 to n;
s200, based on Delta T 1 ,△T 2 ,…， △T i ,…，△T n And a set user level rule, acquiring m user level information tables, wherein the k line of the jth user level information table comprises (ID 1) j k ，△P j k ，G j ），ID1 j k To belong to the jth user class G j ID, Δ P of the kth user in (1) j k Is ID1 j k Corresponding to the time difference of the users, the value of k is 1 to P (j), and P (j) belongs to the j user level G j J is 1 to m, m is an odd number greater than 1; g 1 ＜G 2 ＜…＜G i ＜…＜G m ；
S300, if G j =G （1+m）/2 Then to G j The resource receiving end of each corresponding user sends the same set resource; otherwise, executing S400;
s400, according to the set rule, the direction G j The resource receiving end of each corresponding user sends corresponding resources;
s400 specifically comprises the following steps:
s401, respectively obtaining G j Of the maximum available resource R corresponding to each user j max =R 01 +RC j * f (P (j)) and the minimum available resource R j min =R 02 + RC j *f（P（j）），R 01 Is a preset maximum reference resource, R 02 Is a predetermined minimum reference resource, RC j Is G j A corresponding fixed usage resource; f () is a preset coefficient determination function, and f (P (j)) is positively correlated with P (j);
s402, obtaining G j Corresponding transmittable resource R dj =R j -P（j）*R j mjn ，R j Is G j Corresponding usable resources;
s403, acquiring x = P (j), y = R dj ，z=0；
S404, if x > 0 and y > 0, set z = z +1, perform S405; otherwise, executing S409;
s405, acquiring the z-th random number a z ，a z Is 0 to 1;
s406, acquiring the z th resource r to be sent jz =a z *（y/x）*b j ；b j Is according to G j The determined parameter value;
s407, if r jz ＞R j max Is provided with r jz =R j max ；
S408, obtaining x = x-1, y = y-r z Executing S404;
s409, obtaining G j Corresponding resource set RS to be transmitted j =（r j1 ，r j2 ，…，r js ，…,r jz ) And obtaining G j Corresponding set of time differences DeltaV j =（△V j1 ，△V j2 ，…，△V js ，…, △V jz ），r js Is RS j S-th resource to be sent, and r j1 ≤r j2 ≤…≤r js ≤…≤r jz ；△V js Is Δ V j Is of the s-th time difference, and, Δ V j1 ≤△V j2 ≤…≤△V js ≤…≤△V jz S takes the value from 1 to z;
s410, based on R j And Δ V j R is to js Corresponding resource transmission to DeltaV js And the resource receiving end corresponds to the user.
Another embodiment of the present invention also provides a non-transitory computer readable storage medium, in which at least one instruction or at least one program is stored, and the at least one instruction or the at least one program is loaded and executed by a processor to implement the foregoing method.
Another embodiment of the present invention also provides an electronic device comprising a processor and the aforementioned non-transitory computer-readable storage medium.
The invention has at least the following beneficial effects:
according to the user data processing method provided by the embodiment of the invention, one interactive event can be associated with a plurality of target events, corresponding resources are sent based on the time difference corresponding to the user, and the user experience can be improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a flowchart of a user data processing method according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 1 is a flowchart of a user data processing method according to an embodiment of the present invention.
An embodiment of the present invention provides a user data processing method, as shown in fig. 1, the method may include:
s100, acquiring the set execution end time and the actual execution end time of the target events of the n users related to the set interaction event to form a user information table, wherein the ith row of the user information table comprises (ID 1) i ，ID2 i ，T1 ie ，T2 ie ，△T i ），ID1 i Is ID of the ith user, ID2 i ID of target event for ith user, T1 ie Setting execution end time for target event of ith user, T2 ie Actual execution end time, deltaT, of target event for ith user i Is the time difference of the ith user, if (T2) ie -T1 ie ) Is less than or equal to 0, the execution end time of the target event is realized in advance, then i =0, otherwise, Δ T i =T2 ie -T1 ie And i takes on a value from 1 to n.
In the embodiment of the present invention, the setting interaction event may be determined based on an actual application scenario. A set interaction event may be associated with a plurality of different target events. In one exemplary application scenario, the set interaction event may be a flight delay hazard. In this application scenario, the target event may be a flight, the user is a user taking the flight, the set execution end time of the target event is the scheduled arrival time of the flight, and the actual execution end time of the target event is the actual arrival time of the flight.
In the embodiment of the present invention, the ID of the user may be the unique identification of the user. Where the target event is a flight, the ID of the target event may be the flight number.
In the embodiment of the present invention, the set interactivity event has a start node and an end node, and the time interval between the end node and the start node may be a calculation period of the set interactivity event, for example, 1 day. The set execution end time and the actual execution end time of the target events of the n users associated with the set interactive event may be obtained at the end node of the set interactive event.
S200, based on Δ T 1 ,△T 2 ,…，△T i ,…，△T n And a set user level rule, acquiring m user level information tables, wherein the k line of the jth user level information table comprises (ID 1) j k ，△P j k ，G j ），ID1 j k To belong to the jth user class G j ID, Δ P of the kth user in (1) j k Is ID1 j k Corresponding to the time difference of the users, the value of k is from 1 to P (j), and the P (j) belongs to the j user level G j J is 1 to m, m is an odd number greater than 1, G 1 ＜G 2 ＜…＜G i ＜…＜G m 。
In the embodiment of the invention, m can be set based on actual needs. In one exemplary embodiment of the invention, m =5. In the embodiment of the present invention, the set user level rule may include:
if Δ T i ＞Avg=（△T 1 +△T 2 +…+△T i +…+△T n ) N, and Δ T i Position number L in sequence DeltaX i Less than or equal to ⌊ n x d1 ⌋, then G i = C1; wherein, deltaX is 1 ,△T 2 ,…， △T i ,…，△T n Sequencing according to an ascending sequence to obtain a sequence; c1 is a first user level. d1 is a first setting coefficient, which can be determined based on the actual situation, and in one illustrative example, 0 < d1 < 0.1, preferably, d1=0.05.⌊ ⌋ denotes round-down.
In a practical application scenario, if the delay time of the ith user is greater than the average delay time of the flights, and the ranking in the delay time of all users is located at the first ⌊ n × d1 ⌋, it belongs to the first user level.
If Δ T i > Avg (, and ⌊ n d1 ⌋ < L i Less than or equal to ⌊ n x d2 ⌋, then G i = C2; d2 is a second set coefficient, which can be determined based on actual conditions, in one illustrative example, 0.05 < d2 < 0.4. C2 is the second user level.
In a practical application scenario, if the latency of the ith user is greater than the average latency of flights and the ranking in the latencies of all users is between ⌊ n x d1 ⌋ and ⌊ n x d2 ⌋, then it belongs to the second user level.
If Δ T i = Avg, then G i = C3. And C3 is the second user level.
In a practical application scenario, if the delay time of the ith user is equal to the average delay time of the flight, the ith user belongs to a third user level.
If Δ T i < Avg, and ⌊ n d2 ⌋ < L i Less than or equal to ⌊ n x d3 ⌋, then G i = C4; d3 is a third set coefficient, which can be determined based on actual conditions, and in one illustrative example, 0.4 < d3 < 0.95. C4 is the fourth user level.
In a practical application scenario, if the latency of the ith user is less than the average latency of flights and the ranking in the latencies of all users is between ⌊ n x d2 ⌋ and ⌊ n x d3 ⌋, then it belongs to the fourth user level.
If Δ T i < Avg, and ⌊ n d3 ⌋ < L i ⌊ n d4 ⌋, then G i = C5; d4 is a fourth set coefficient, which can be determined based on actual conditions, in one illustrative example, 0.95 < d3 < 1. C5 is the fourth user level.
In a practical application scenario, if the latency of the ith user is less than the average latency of flights and the ranking in the latencies of all users is between ⌊ n x d3 ⌋ and ⌊ n x d4 ⌋, it belongs to the fifth user level.
S300, if G j =G （1+m）/2 Then to G j The resource receiving end of each corresponding user sends the same set resource; otherwise, S400 is performed.
In the embodiment of the invention, the resource can be a virtual fund flow circulating through a specified channel. The setting resource may be determined based on actual conditions.
S400, according to the set rule, the direction G j And the resource receiving end of each corresponding user sends the corresponding resource. The resource receiving end may be a server capable of receiving and transmitting resources, such as a server of a bank.
Further, in the embodiment of the present invention, S400 may specifically include:
s401, respectively obtaining G j Of the maximum available resource R corresponding to each user j max =R 01 +RC j * f (P (j)) and the minimum available resource R j min =R 02 + RC j *f（P（j）），R 01 Is a preset maximum reference resource, R 02 For a predetermined minimum reference resource, RC j Is G j A corresponding fixed usage resource; f () is a preset coefficient-determining function, and f (P (j)) is positively correlated with P (j). f (P (j)) has the effect that it is desirable to obtain as large an upper limit of resources as possible in users of a certain user level.
In the examples of the present invention, R 02 =R 0 *（1+c），R 0 And C is a set coefficient, and the value of C is 0 to 1, preferably, C =0.2 to 0.4, and more preferably, C =0.2.R 01 The setting may be based on actual conditions.
In the embodiment of the invention, RC j =R j /P（j）。R j Is G j The corresponding available resources.
Further, in an exemplary embodiment of the invention, f (P (j)) = k1+ (P (j)/P1 (j)) × (k 2-k 1), k1 is a first set value, k2 is a second set value, and k2 > k1 > 1, in an exemplary embodiment of the invention, k1 and k2 may be determined based on actual conditions, and in an exemplary embodiment, k1 may be equal to 2, and k2 may be equal to 2Equal to 6. P1 (j) is estimated as belonging to the user class G j May be obtained based on historical data. In one example, P1 (j) = max (P) j （1），P j （2），…，P j （g），…,P j (N）)*f,P j (g) For setting the G-th calculation cycle in the historical time period to belong to G j G is 1 to N, N being the number of calculation cycles within a set historical time period. f is a set parameter, for example, a parameter of 2 or more. The setting history period and f may be set based on actual needs as long as f () can be made to vary smoothly.
S402, obtaining G j Corresponding transmittable resource R dj =R j -P（j）*R j mjn 。R dj The effect of (a) is to ensure that users in each user level get the minimum available resources.
S403, acquiring x = P (j), y = R dj 。
S404, if x > 0 and y > 0, indicating that there are no more users allocated to the resource and the resource is not allocated, setting z = z +1, and executing S405; otherwise, it indicates that each user has allocated resources but has not allocated the transmittable resources, or that there are users that have not allocated resources but have allocated the resources, or that each user has allocated resources and has just allocated the transmittable resources, and S409 is executed.
S405, acquiring the z-th random number a z ，a z Is 0 to 1. Random number a can be randomly generated between 0~1 z 。
S406, acquiring the z th resource r to be sent jz =a z *（y/x）*b j ；b j Is according to G j The determined parameter value; in an exemplary embodiment, the parameter values for different user levels may be different. In a preferred embodiment, the parameter values for each user level may be the same, i.e. b 1 =b 2 =…=b j =…= b m For example, it may be 3~6, preferably 6 times.
S407, if r jz ＞R j max Is provided with r jz =R j max Executing S408; otherwise, directly using r as the current single resource to be sent, and directly executing S408.
S408, obtaining x = x-1, y = y-r z And S404 is performed.
S409, obtaining G j Corresponding resource set RS to be transmitted j =（r j1 ，r j2 ，…，r js ，…,r jz ) And obtaining G j Corresponding set of time differences DeltaV j =（△V j1 ，△V j2 ，…，△V js ，…, △V jz ），r js Is RS j S-th resource to be sent, and r j1 ≤r j2 ≤…≤r js ≤…≤r jZ ；△V js Is Δ V j Of, and, Δ V j1 ≤△V j2 ≤…≤△V js ≤…≤△V jZ S has a value of 1 to z, i.e. G j And sequencing the corresponding resources to be sent in a sequence from small to large. In another embodiment, G may be j The corresponding resources to be transmitted are ordered in descending order, i.e. r j1 ≥r j2 ≥…≥r js ≥…≥r jz ，△V j1 ≥△V j2 ≥…≥△V js ≥…≥△V jz 。
In S409, z ≦ P (j). If in an extreme case, for example, there are no more users allocated to the resource but the resource is already allocated, then z < P (j) is used, i.e. the number of users is reduced to ensure that each user can acquire at least the minimum available resource. Z = P (j) if each user has been allocated resources but the transmittable resources have not been allocated yet, or each user has been allocated resources and the transmittable resources have just been allocated.
S410, based on R j And Δ V j R is to js Corresponding resource transmission to DeltaV js And the resource receiving end corresponds to the user.
In this step, the ordering according to the resource to be sent and the ordering according to the time difference are carried out in sequenceSending, that is, sending the resource to be sent arranged at the s-th bit to the resource receiving end of the user corresponding to the time difference arranged at the s-th bit, that is, r js Corresponding resource transmission to DeltaV js The resource receiving end corresponding to the user can reasonably transmit the resource based on the time difference.
Through S400, there may be a remainder of the transmittable resource corresponding to each user level.
In one embodiment of the invention, R j =（R 0 *n-R c ）*h j ，R c For the resources consumed by the set interaction event, h j Is G j The corresponding resource coefficient is 0~1 based on G j And (5) determining. In a specific example, if G j =G 1 Then h is j =1; if G is j =G 2 Then h is j =0.1；G j =G 4 Then h is j =0.1；G j =G 5 Then h is j And =1. But is not limited thereto and may be set based on actual circumstances.
In another embodiment of the invention, R j =（R 0 *n+R h -R c ）*h j ，R h The resource remaining in the last transmittable resource for the set interactivity event, i.e., the resource remaining in the last (last calculation cycle) resource allocation for the set interactivity event, may be equal to the sum of the resources remaining after the resource is transmitted based on S400 for each user class. Compared with the foregoing embodiment, since the remaining resources in the last resource allocation are added to the current allocation, the resources obtained by the users in each user level can be increased.
In summary, according to the user data processing method provided by the embodiment of the present invention, one interactive event can be associated with multiple target events, and corresponding resources are sent based on the time difference corresponding to the user, so that the user experience can be improved.
Embodiments of the present invention also provide a non-transitory computer-readable storage medium, which may be disposed in an electronic device to store at least one instruction or at least one program for implementing a method of the method embodiments, where the at least one instruction or the at least one program is loaded into and executed by a processor to implement the method provided by the above embodiments.
Embodiments of the present invention also provide an electronic device comprising a processor and the aforementioned non-transitory computer-readable storage medium.
Embodiments of the present invention also provide a computer program product comprising program code means for causing an electronic device to carry out the steps of the method according to various exemplary embodiments of the invention described above in the present description, when said program product is run on the electronic device.
Although some specific embodiments of the present invention have been described in detail by way of illustration, it should be understood by those skilled in the art that the above illustration is only for the purpose of illustration and is not intended to limit the scope of the invention. It will also be appreciated by those skilled in the art that various modifications may be made to the embodiments without departing from the scope and spirit of the invention. The scope of the present disclosure is defined by the appended claims.
Claims (10)
1. A method of processing user data, the method comprising:
s100, acquiring set execution end time and actual execution end time of target events of n users associated with set interaction events to form a user information table; the ith row of the user information table includes (ID 1) i ，ID2 i ，T1 ie ，T2 ie ，△T i ），ID1 i Is ID of the ith user, ID2 i ID of target event for i-th user, T1 ie Setting execution end time for target event of ith user, T2 ie Actual execution end time, deltaT, of target event for ith user i Is the time difference of the ith user, if (T2) ie -T1 ie ) Is less than or equal to 0, then delta T i =0, otherwise, Δ T i =T2 ie -T1 ie I takes a value from 1 to n;
s200, based on Delta T 1 ,△T 2 ,…， △T i ,…，△T n And a set user level rule, acquiring m user level information tables, wherein the k line of the jth user level information table comprises (ID 1) j k ，△P k j ，G j ），ID1 j k To belong to the jth user class G j ID, Δ P of the kth user in (1) k j Is ID1 j k Corresponding to the time difference of the users, the value of k is 1 to P (j), and P (j) belongs to the j user level G j J is 1 to m, m is an odd number greater than 1; g 1 ＜G 2 ＜…＜G i ＜…＜G m ；
S300, if G j =G （1+m）/2 Then to G j The resource receiving end of each corresponding user sends the same set resource; otherwise, executing S400;
s400, according to the set rule, the direction G j The resource receiving end of each corresponding user sends corresponding resources;
s400 specifically comprises the following steps:
s401, respectively obtaining G j Of the maximum available resource R corresponding to each user j max =R 01 +RC j * f (P (j)) and the minimum available resource R j min =R 02 + RC j *f（P（j）），R 01 Is a preset maximum reference resource, R 02 For a predetermined minimum reference resource, RC j Is G j A corresponding fixed usage resource; f () is a preset coefficient determination function, and f (P (j)) is positively correlated with P (j);
s402, obtaining G j Corresponding transmittable resource R dj =R j -P（j）*R j mjn ，R j Is G j Corresponding usable resources;
s403, acquiring x = P (j), y = R dj ，z=0；
S404, if x > 0 and y > 0, set z = z +1, perform S405; otherwise, executing S409;
s405, acquiring the z-th random number a z ，a z Is 0 to 1；
S406, acquiring the z th resource r to be sent jz =a z *（y/x）*b j ；b j Is according to G j The determined parameter value;
s407, if r jz ＞R j max Is provided with r jz =R j max ；
S408, obtaining x = x-1, y = y-r z Executing S404;
s409, obtaining G j Corresponding resource set RS to be transmitted j =（r j1 ，r j2 ，…，r js ，…,r jz ) And obtaining G j Corresponding set of time differences DeltaV j =（△V j1 ，△V j2 ，…，△V js ，…, △V jz ），r js Is RS j S to be sent resource in, and r j1 ≤r j2 ≤…≤r js ≤…≤r jz ；△V js Is Δ V j Is of the s-th time difference, and, Δ V j1 ≤△V j2 ≤…≤△V js ≤…≤△V jz S takes the value from 1 to z;
s410, based on R j And Δ V j R is to js Corresponding resource transmission to DeltaV js And the resource receiving end corresponds to the user.
2. The method of claim 1, wherein R is 02 =R 0 *（1+c），R 0 And c is a set coefficient, and the value is 0 to 1.
3. The method of claim 1, wherein f (P (j)) = k1+ (P (j)/P1 (j)) × (k 2-k 1), and wherein P1 (j) is an estimated belonging user class G j K1 is a first set value, k2 is a second set value, and k2 > k1 > 1.
4. The method of claim 1, wherein m =5.
5. The method of claim 4, wherein the set user-level rules comprise:
if Δ T i > Avg, and Δ T i Position number L in sequence DeltaX i Less than or equal to ⌊ n x d1 ⌋, then G i = C1; wherein d1 is a first setting coefficient, avg = ([ Delta ] T) 1 +△T 2 +…+△T i +…+△T n ) N, Δ X is 1 ,△T 2 ,…， △T i ,…，△T n Sequencing according to an ascending order to obtain a sequence; c1 is a first user level;
if Δ T i Is > Avg, and ⌊ n d1 ⌋ < L i Less than or equal to ⌊ n x d2 ⌋, then G i = C2; d2 is a second set coefficient; c2 is a second user level;
if Δ T i = Avg, then G i = C3; c3 is a third user level; if Δ T i < Avg, and ⌊ n d2 ⌋ < L i ⌊ n d3 ⌋, then G i = C4; d3 is a third set coefficient; c4 is a fourth user level;
if Δ T i < Avg, and ⌊ n d3 ⌋ < L i ⌊ n d4 ⌋, then G i = C5; d4 is a fourth setting coefficient, and C5 is a fifth user level.
6. The method of claim 1, wherein RC is selected from the group consisting of j =R j /P（j）。
7. The method of claim 2, wherein R is j =（R 0 *n-R c ）*h j ，R c For the resources consumed by the set interaction event, h j Is based on G j The determined resource coefficients.
8. The method of claim 2, wherein R is j =（R 0 *n+R h -R c ）*h j ，R h To set the last of an interaction eventRemaining resources, R, in the next-to-send resource c For the resources consumed by the set interaction event, h j Is based on G j The determined resource coefficients.
9. A non-transitory computer readable storage medium having at least one instruction or at least one program stored therein, wherein the at least one instruction or the at least one program is loaded and executed by a processor to implement the method of any one of claims 1-8.
10. An electronic device comprising a processor and the non-transitory computer readable storage medium of claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310114645.7A CN115879953B (en) | 2023-02-15 | 2023-02-15 | User data processing method, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310114645.7A CN115879953B (en) | 2023-02-15 | 2023-02-15 | User data processing method, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115879953A true CN115879953A (en) | 2023-03-31 |
| CN115879953B CN115879953B (en) | 2023-05-12 |
Family
ID=85761153
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310114645.7A Active CN115879953B (en) | 2023-02-15 | 2023-02-15 | User data processing method, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115879953B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE102007029685A1 (en) * | 2007-06-27 | 2009-01-02 | Pevv Gmbh | Route progression determining device for use between e.g. starting and destination points, has data processing unit processing data for determining route progression for two default shifting modes and for default parameter based on modes |
| CN104933530A (en) * | 2015-06-29 | 2015-09-23 | 中国民用航空厦门空中交通管理站 | Air traffic control real-time regulation effectiveness evaluation system |
| CN108009929A (en) * | 2017-12-13 | 2018-05-08 | 北京无线天利移动信息技术股份有限公司 | A kind of flight delay insurance protection amount control method and system |
| CN108197081A (en) * | 2017-11-03 | 2018-06-22 | 上海敬之网络科技有限公司 | A kind of data actuarial model method for building up of flight delay danger |
| CN110163559A (en) * | 2019-04-18 | 2019-08-23 | 平安科技（深圳）有限公司 | Automatic Claims Resolution method, apparatus, computer equipment and storage medium |
| WO2020024420A1 (en) * | 2018-08-01 | 2020-02-06 | 平安科技（深圳）有限公司 | Flight delay response method and apparatus, computer device, and storage medium |
| CN111612432A (en) * | 2020-05-27 | 2020-09-01 | 中航信移动科技有限公司 | Flight delay automatic claim settlement system and method |
-
2023
- 2023-02-15 CN CN202310114645.7A patent/CN115879953B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE102007029685A1 (en) * | 2007-06-27 | 2009-01-02 | Pevv Gmbh | Route progression determining device for use between e.g. starting and destination points, has data processing unit processing data for determining route progression for two default shifting modes and for default parameter based on modes |
| CN104933530A (en) * | 2015-06-29 | 2015-09-23 | 中国民用航空厦门空中交通管理站 | Air traffic control real-time regulation effectiveness evaluation system |
| CN108197081A (en) * | 2017-11-03 | 2018-06-22 | 上海敬之网络科技有限公司 | A kind of data actuarial model method for building up of flight delay danger |
| CN108009929A (en) * | 2017-12-13 | 2018-05-08 | 北京无线天利移动信息技术股份有限公司 | A kind of flight delay insurance protection amount control method and system |
| WO2020024420A1 (en) * | 2018-08-01 | 2020-02-06 | 平安科技（深圳）有限公司 | Flight delay response method and apparatus, computer device, and storage medium |
| CN110163559A (en) * | 2019-04-18 | 2019-08-23 | 平安科技（深圳）有限公司 | Automatic Claims Resolution method, apparatus, computer equipment and storage medium |
| CN111612432A (en) * | 2020-05-27 | 2020-09-01 | 中航信移动科技有限公司 | Flight delay automatic claim settlement system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115879953B (en) | 2023-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110837410B (en) | Task scheduling method and device, electronic equipment and computer readable storage medium | |
| US10127079B2 (en) | Scheduling user requests in a distributed resource system having plurality of schedulers and coordinators | |
| CN108667748B (en) | Method, device, equipment and storage medium for controlling bandwidth | |
| Coffman Jr et al. | Computer scheduling methods and their countermeasures | |
| US7577780B2 (en) | Fine-grained bandwidth control arbiter and the method thereof | |
| CN108845874B (en) | Dynamic resource allocation method and server | |
| CN108540568B (en) | Computing capacity sharing method and intelligent equipment | |
| CN107480078A (en) | A kind of bus bandwidth distribution method, device and chip | |
| CN111143036A (en) | Virtual machine resource scheduling method based on reinforcement learning | |
| Glazebrook et al. | On the optimal allocation of service to impatient tasks | |
| CN109783236B (en) | Method and apparatus for outputting information | |
| CN111813524B (en) | Task execution method and device, electronic equipment and storage medium | |
| CN111143063B (en) | Task resource reservation method and device | |
| CN116915869A (en) | Cloud edge cooperation-based time delay sensitive intelligent service quick response method | |
| CN115879953A (en) | User data processing method, electronic equipment and storage medium | |
| US7086059B2 (en) | Throttling queue | |
| CN114138453B (en) | Resource optimization allocation method and system suitable for edge computing environment | |
| CN116010051A (en) | Federal learning multitasking scheduling method and device | |
| CN114896070A (en) | GPU resource allocation method for deep learning task | |
| CN111258729B (en) | Redis-based task allocation method and device, computer equipment and storage medium | |
| US10853138B2 (en) | Scheduling resource usage | |
| CN108737289B (en) | Storage multipath load balancing method and system | |
| SE522876C2 (en) | Method for assigning time slots in a data communication system | |
| WO2002003192A2 (en) | Device and method for allocating jobs in a network | |
| CN111597034A (en) | Processor resource scheduling method and device, terminal equipment and computer storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |