CN112016973A

CN112016973A - Advertisement sorting method and device and computer readable storage medium

Info

Publication number: CN112016973A
Application number: CN202010898827.4A
Authority: CN
Inventors: 廖殷
Original assignee: Chengdu Xinchao Media Group Co Ltd
Current assignee: Chengdu Xinchao Media Group Co Ltd
Priority date: 2020-08-31
Filing date: 2020-08-31
Publication date: 2020-12-01
Anticipated expiration: 2040-08-31
Also published as: CN112016973B

Abstract

The invention discloses an advertisement sequencing method, an advertisement sequencing device and a computer readable storage medium, wherein the method comprises the following steps: when the elevator is in a stop state, acquiring the next pre-stop floor of the elevator and the stop probability of each pre-stop floor in the pre-stop floors; acquiring the playing matching degree between each advertisement to be played and each pre-stopping floor in the advertisements to be played; according to the pre-stopping floors, the stopping probability of each pre-stopping floor and the playing matching degree between each advertisement to be played and each pre-stopping floor, the playing fitness of each advertisement to be played on any pre-stopping floor in the stopped floors is obtained; and sequencing the advertisements to be played according to the sequence of the fitness from high to low to obtain a first advertisement playing list. The invention can reorder the advertisements in the advertisement machine according to the next stop floor of the elevator, thereby ensuring the maximum playing value of each time.

Description

Advertisement sorting method and device and computer readable storage medium

Technical Field

The invention relates to the technical field of elevator advertisement sorting, in particular to an advertisement sorting method and device and a computer readable storage medium.

Background

With the rapid development of the internet, a new generation of multimedia advertisement media is gradually entering the daily life of people, and the gradual popularization of intelligent elevator advertisement machines enables the elevator media to become a symbolic achievement of the new generation of multimedia advertisement media. The elevator advertisement machine can obtain advertisement playing resources from a network or a local storage space, and queue and circularly play advertisement contents according to the advertisement main and media playing rules.

However, the advertisement content in the existing elevator advertisement player is generally queued based on the playing requirements (such as playing times and playing time periods) of the advertiser in combination with the advertisement putting amount of the current advertisement player, the queuing rule is fixed, once the playing content enters the queue, the playing content can be played and displayed circularly, the playing sequence cannot be changed, and the value of each playing of the advertisement cannot be maximized.

Disclosure of Invention

In order to solve the problems that the playing sequence of the existing elevator advertising machine is fixed and the value of each playing of the advertisements cannot be maximized, the invention aims to provide an advertisement sequencing method, an advertisement sequencing device and a computer-readable storage medium, which can reorder the advertisements in the advertising machine according to the stop floor of an elevator and ensure the maximization of the playing value of each time.

In a first aspect, the present invention provides an advertisement ranking method, including:

when an elevator is in a stop state, acquiring the next pre-stop floor of the elevator and the stop probability of each pre-stop floor in the pre-stop floors;

acquiring the playing matching degree between each advertisement to be played and each pre-stopping floor in the advertisements to be played;

according to the pre-stop floors, the stop probability of each pre-stop floor and the play matching degree between each advertisement to be played and each pre-stop floor, obtaining the playing fitness of each advertisement to be played on any pre-stop floor in the pre-stop floors;

and sequencing the advertisements to be played according to the sequence of the fitness from high to low to obtain a first advertisement playing list so as to play the advertisements to be played according to the first advertisement playing list when the elevator runs from the current stop floor to any one of the pre-stop floors.

Based on the disclosure, the invention obtains the next pre-stop floor of the elevator (i.e. the floor at which the elevator is likely to stop next time), and the stop probability of each pre-stop floor in the pre-stop floors (i.e. the probability of each pre-stop floor at which the elevator is likely to stop next time), and simultaneously, combines the play matching degree between each advertisement to be played and each pre-stop floor to obtain the suitability of each advertisement to be played on any pre-stop floor in the pre-stop floors, and finally, the advertisements to be played can be sequenced according to the sequence from large to small of the suitability to obtain the first advertisement play list, so that the elevator can play the advertisements by using the first advertisement play list when running from the current stop floor to any pre-stop floor in the pre-stop floors.

Through the design, the invention can obtain the played fitness of each advertisement to be played according to the next stop position of the elevator, the corresponding stop probability and the playing matching degree of the advertisement to be played at the next stop position, and can then reorder the advertisements to be played according to the fitness, arrange the advertisement with the maximum fitness in front of the playing queue, realize the dynamic adjustment of the advertisement playing list in the advertisement player, further realize the adaptive playing of the advertisement and the floor, and maximize the value of advertisement playing.

In one possible design, obtaining a play matching degree between each advertisement to be played in the advertisements to be played and each pre-stop floor includes:

acquiring the corresponding relation between each advertisement to be played and the running state of the elevator before stopping, each pre-stopping floor and the playing matching degree of each pre-stopping floor;

and obtaining the playing matching degree between each advertisement to be played and each pre-stopping floor according to the corresponding relation between each advertisement to be played, each pre-stopping floor and the running state before stopping.

Based on the above disclosure, the present invention provides a specific method for obtaining the playing matching degree between each advertisement to be played and each pre-stop floor, that is, first, obtaining the corresponding relationship between each advertisement to be played and the running state before the elevator stops, each pre-stop floor and the playing matching degree of each pre-stop floor (the corresponding relationship can be pre-stored in the advertisement player when the user puts in the advertisement, or when the advertisement player is installed, the expression form of the corresponding relationship can be but is not limited to a corresponding relationship table), and finally, obtaining the playing matching degree between each advertisement to be played and each pre-stop floor according to the corresponding relationship between each advertisement to be played and the running state before the elevator stops (i.e. in the corresponding relationship table, according to the running state before the elevator stops and the pre-stop floor, determining the playing matching degree of any advertisement to be played and any pre-stopping floor).

In a possible design, obtaining a fitness of each advertisement to be played being played on any one of the pre-stop floors according to the pre-stop floors, the stop probability of each pre-stop floor, and the play matching degree between each advertisement to be played and each pre-stop floor, including:

multiplying the playing matching degree between the ith advertisement to be played and each pre-stop floor in the advertisements to be played by the stop probability of each pre-stop floor respectively to obtain the playing fitness of the ith advertisement to be played on each pre-stop floor;

adding the suitability of the ith advertisement to be played on each pre-stop floor to obtain the suitability of the ith advertisement to be played on any pre-stop floor, wherein the suitability of each advertisement to be played on any pre-stop floor is obtained when I is from 1 to I, and I is the number of the advertisements to be played.

Based on the above disclosure, the invention discloses a specific calculation method for the broadcast suitability of each advertisement to be broadcast on any pre-stop floor, namely, the broadcast suitability of the ith advertisement to be broadcast on each pre-stop floor is firstly calculated, then the broadcast suitability of the ith advertisement to be broadcast on each pre-stop floor is added, so that the broadcast suitability of the ith advertisement to be broadcast on any pre-stop floor can be obtained, and finally, when I is from 1 to I, the broadcast suitability of each advertisement to be broadcast on any pre-stop floor can be obtained. (for example, if there are 5, 7 and 9 floors of a pre-stop floor where an advertisement is to be played, it is necessary to calculate the suitability of the advertisement being played at the 5 floor, the suitability of the advertisement being played at the 7 floor and the suitability of the advertisement being played at the 9 floor, and finally, the results of the three calculations are added to obtain the suitability of the advertisement being played at the pre-stop floor).

In a possible design, the sorting the advertisements to be played according to the descending order of the suitability to obtain a first advertisement playlist includes:

when the advertisements to be played with the same fitness exist in the advertisements to be played, judging whether the advertisements to be played with the same fitness exist in the advertisements to be played which are sequenced at the last time or not;

if the advertisement to be played exists, the advertisements to be played are sequenced according to the sequence of the fitness from large to small and the order of the non-playing priority, and the first advertisement playing list is obtained.

Based on the above disclosure, the present invention provides a specific rule of sorting, that is, sorting is performed according to the order of the degree of suitability, if there are to-be-played advertisements with the same degree of suitability, it needs to be determined whether the to-be-played advertisements with the same degree of suitability were played in the last sorting, that is, the to-be-played advertisements that are not played are sorted in priority (but sorted to the previous bit of the played to-be-played advertisement), so as to obtain the first advertisement play list.

In a possible design, after the advertisements to be played are sorted in the order of decreasing the suitability to obtain a first advertisement playlist, the method further includes:

determining the starting playing time of each advertisement to be played in the first advertisement playing list;

judging whether the playing time interval between the playing starting time of each advertisement to be played and the last playing ending time of each advertisement to be played is less than a preset time length or not;

if the advertisements to be played with the playing time intervals smaller than the preset time length exist, adjusting the sequencing positions of the advertisements to be played with the playing time intervals smaller than the preset time length in the first advertisement playing list to obtain a second advertisement playing list, wherein the playing time intervals of all the advertisements to be played in the second advertisement playing list are larger than the preset time length.

Based on the above disclosure, the present invention discloses a method for adjusting the order of a first advertisement playlist after obtaining the first advertisement playlist, which is used to avoid the problem that the advertisement to be played after reordering is unreasonable to play due to a short interval between the playing sequence in the last order and the playing sequence of this time (for example, the playing sequence of the advertisement a in the last order is the last bit, and the playing sequence of the advertisement a in the first advertisement playlist is the first bit, so that the advertisement a is continuously played). Therefore, the invention can realize the adjustment of the sequencing sequence of the advertisements to be played in the first advertisement playing list by judging whether the playing time interval between the starting playing time of each advertisement to be played in the first advertisement playing list and the last playing time of the advertisement to be played is less than the preset time length.

For example, the first to-be-played advertisement in the first advertisement playlist is judged, if the playing time interval is less than the preset time length, the advertisement is sorted and shifted by one bit, the advertisement corresponding to the next bit of the advertisement is sorted into the first bit, then whether the playing time interval is less than the preset time length is judged again until the playing time interval is greater than the preset time length, and finally, the judgment is started from the first to-be-sorted advertisement, the above-mentioned judging steps are repeated until all the to-be-played advertisements in the first advertisement playlist are circulated, and when the playing time interval of each to-be-played advertisement is greater than the preset time length, the adjustment is finished to obtain an adjusted playlist, namely, a second advertisement playlist.

In a second aspect, the present invention provides an advertisement ranking device, including: the system comprises a docking probability obtaining unit, a playing matching degree obtaining unit, a fitness calculating unit and an advertisement playing list generating unit;

the stopping probability obtaining list is used for obtaining the next pre-stopping floor of the elevator and the stopping probability of each pre-stopping floor in the pre-stopping floors when the elevator is in a stopping state;

the playing matching degree obtaining unit is used for obtaining the playing matching degree between each advertisement to be played in the advertisements to be played and each pre-stopping floor;

the suitability calculation unit is configured to obtain the suitability of each advertisement to be played being played on any one of the pre-stop floors according to the pre-stop floors, the stop probability of each pre-stop floor, and the play matching degree between each advertisement to be played and each pre-stop floor;

the advertisement playing list generating unit is used for sequencing the advertisements to be played according to the sequence of the fitness from high to low to obtain a first advertisement playing list, so that the advertisements to be played are played according to the first advertisement playing list when the elevator runs from the current stop floor to any one of the pre-stop floors.

In one possible design, the playing matching degree obtaining unit includes: acquiring a subunit and searching the subunit according to the corresponding relation;

the corresponding relation obtaining subunit is used for obtaining the corresponding relation between each advertisement to be played and each pre-stop floor, the running state before stopping and the playing matching degree of each pre-stop floor;

and the searching subunit is configured to obtain a playing matching degree between each advertisement to be played and each pre-stop floor according to a corresponding relationship between each advertisement to be played and each pre-stop floor and the running state before stopping.

In one possible design, the fitness calculating unit includes: a first calculating subunit and a second calculating subunit;

the first calculating subunit is configured to multiply the playing matching degree between the ith advertisement to be played and each of the pre-stop floors by the stop probability of each of the pre-stop floors, respectively, to obtain the suitability of the ith advertisement to be played on each of the pre-stop floors;

the second calculating subunit is configured to add the suitability of the ith advertisement to be played on each of the pre-stop floors to obtain the suitability of the ith advertisement to be played on any of the pre-stop floors, where I is from 1 to I, the suitability of the ith advertisement to be played on any of the pre-stop floors is obtained, and I is the number of the advertisements to be played.

In one possible design, the advertisement playlist generating unit includes: a first judging subunit and a sorting subunit;

the first judging subunit is configured to, when there are to-be-played advertisements with the same suitability in the to-be-played advertisements, judge whether there are to-be-played advertisements to be played after the last sequencing in the to-be-played advertisements with the same suitability;

and the sequencing subunit is configured to sequence the advertisements to be played according to the order of the fitness from high to low and the order of the non-playing priority when the first judging subunit judges that the advertisements to be played exist, so as to obtain the first advertisement playing list.

In one possible design, the apparatus further includes: a determination unit and a second judgment unit;

the determining unit is configured to determine a play start time of each advertisement to be played in the first advertisement play list;

the second judging unit is configured to judge whether a playing time interval between a playing start time of each advertisement to be played and a last playing end time of each advertisement to be played is smaller than a preset time length;

the advertisement playlist generating unit is further configured to, when the second determining unit determines that there is an advertisement to be played whose playing time interval is smaller than the preset time, adjust a sorting position of the advertisement to be played whose playing time interval is smaller than the preset time in the first advertisement playlist to obtain a second advertisement playlist, where a playing time interval of each advertisement to be played in the second advertisement playlist is greater than the preset time.

In a third aspect, the present invention provides another advertisement ranking device, including a memory, a processor and a transceiver, which are connected in communication in sequence, where the memory is used for storing a computer program, the transceiver is used for sending and receiving messages, and the processor is used for reading the computer program and executing the advertisement ranking method as may be designed in any one of the first aspect or the first aspect.

In a fourth aspect, the present invention provides a computer-readable storage medium having stored thereon instructions which, when run on a computer, perform the method of ordering advertisements as may be devised by the first aspect or any one of the first aspects.

In a fifth aspect, the present invention provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method of ordering advertisements as described in the first aspect or any one of the possible designs in the first aspect.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.

FIG. 1 is a flow chart of an advertisement ranking method provided by the present invention.

Fig. 2 is a schematic structural diagram of a first advertisement sorting device provided by the present invention.

Fig. 3 is a schematic structural diagram of a second advertisement sorting device provided by the present invention.

Detailed Description

The invention is further described with reference to the following figures and specific embodiments. It should be noted that the following examples are provided to aid understanding of the present invention, but are not intended to limit the present invention. Specific structural and functional details disclosed herein are merely illustrative of example embodiments of the invention. This invention may, however, be embodied in many alternate forms and should not be construed as limited to the embodiments set forth herein.

It will be understood that, although the terms first, second, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first element could be termed a second element, and, similarly, a second element could be termed a first element, without departing from the scope of example embodiments of the present invention.

It should be understood that, for the term "and/or" as may appear herein, it is merely an associative relationship that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, B exists alone, and A and B exist at the same time; for the term "/and" as may appear herein, which describes another associative object relationship, it means that two relationships may exist, e.g., a/and B, may mean: a exists independently, and A and B exist independently; in addition, for the character "/" that may appear herein, it generally means that the former and latter associated objects are in an "or" relationship.

It will be understood that when an element is referred to herein as being "connected," "connected," or "coupled" to another element, it can be directly connected or coupled to the other element or intervening elements may be present. Conversely, if a unit is referred to herein as being "directly connected" or "directly coupled" to another unit, it is intended that no intervening units are present. In addition, other words used to describe the relationship between elements should be interpreted in a similar manner (e.g., "between … …" versus "directly between … …", "adjacent" versus "directly adjacent", etc.).

It is to be understood that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments of the invention. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises," "comprising," "includes" and/or "including," when used herein, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, numbers, steps, operations, elements, components, and/or groups thereof.

It should also be noted that, in some alternative implementations, the functions/acts noted may occur out of the order noted in the figures. For example, two figures shown in succession may, in fact, be executed substantially concurrently, or the figures may sometimes be executed in the reverse order, depending upon the functionality/acts involved.

It should be understood that specific details are provided in the following description to facilitate a thorough understanding of example embodiments. However, it will be understood by those of ordinary skill in the art that the example embodiments may be practiced without these specific details. For example, systems may be shown in block diagrams in order not to obscure the examples in unnecessary detail. In other instances, well-known processes, structures and techniques may be shown without unnecessary detail in order to avoid obscuring example embodiments.

Examples

As shown in fig. 1, the advertisement sorting method provided in the first aspect of this embodiment is suitable for sorting advertisements of any elevator in-elevator advertisement machine, that is, is used for dynamically adjusting a playlist of an elevator in-elevator advertisement machine, thereby realizing matching and playing of advertisements and elevator stop floors, and maximizing advertisement playing value. But may not be limited to including the following steps S101 to S104.

S101, when an elevator is in a stop state, the next pre-stop floor of the elevator and the stop probability of each pre-stop floor in the pre-stop floors are obtained.

Step S101 is to obtain the next possible stop floor (i.e. the pre-stop floor) of the elevator, and the stop probability of stopping at each stop floor (i.e. the probability of each pre-stop floor in the pre-stop floors), so as to provide a data base for the calculation of the suitability of each subsequent advertisement to be played.

For example, when the elevator is in a stop state, the current stop floor is 5 floors, and the next stop floor may have 4 floors, 3 floors, 2 floors, 1 floor and-1 floor, so the pre-stop floor is: floors 4, 3, 2, 1 and-1, and each floor corresponds to a probability of stopping, i.e., a probability of stopping at each pre-stop floor. As shown in table 1, table 1 gives a corresponding table for each pre-stop floor and for the stopping probability of each pre-stop floor.

TABLE 1

Floor where elevator is in stop state	Pre-berthing floor	Probability of docking
			5 layers of	4 storied building	12％
5 layers of	3 storied building	15％
			5 layers of	2 storied building	18％
5 layers of	Floor 1	32％

As can be seen from table 1, each pre-stop floor has a corresponding stop probability.

In this embodiment, the pre-stop floors and the probability of each pre-stop floor are obtained, but not limited to, by finding the historical operation data of the elevator matched with the current operation data of the elevator, the next pre-stop floor of the elevator and the stop probability of each pre-stop floor in the pre-stop floors can be obtained through the historical operation data of the elevator. The specific acquisition process will be described in detail below.

S102, obtaining the playing matching degree between each advertisement to be played and each pre-stopping floor in the advertisements to be played.

Step S102 is a process of obtaining a play matching degree between each advertisement to be played and each pre-stop floor, so as to realize calculation of a suitability together with a stop probability of each pre-stop floor and the pre-stop floor.

In this embodiment, the matching degree between an advertisement and a floor is represented as: whether the advertisement is suitable for playing on the floor can be, but not limited to, measured by percentage, i.e. the larger the percentage, the more suitable the advertisement is for playing. For example, there are advertisements a and B to be played, and the playing matching degrees in level 2 are respectively: 20% and 50%, i.e., B advertisement is better suited to be played in level 2 than A advertisement.

In the present embodiment, the playing matching degree is defined according to the floor attribute and the advertisement attribute, for example, the playing matching degree is defined according to the business scope of the business and company of each floor and the field of the advertisement playing content, and may be defined by, but not limited to, the staff of the advertisement delivery company.

In this embodiment, for example, the obtaining of the playing matching degree between each advertisement to be played in the advertisements to be played and each pre-stop floor may include, but is not limited to, the following steps S102a to S102b.

S102a, acquiring a corresponding relation between each advertisement to be played and the running state before the elevator stops, each pre-stopping floor and the playing matching degree of each pre-stopping floor.

Step S102a is to determine the corresponding relationship between each advertisement to be played and the playing matching degree of the running state before the elevator stops, each pre-stop floor, and each pre-stop floor, that is, after determining which corresponding factors are obtained, the playing matching degree of each advertisement to be played and each pre-stop floor can be obtained.

In this embodiment, the play matching degree between each advertisement to be played and each pre-stop floor is determined by the running state before the elevator stops and the pre-stop floor. That is, to obtain the broadcast matching degree between an advertisement to be broadcast and a pre-stop floor, the running state before the elevator stops and the pre-stop floor must be obtained.

In this embodiment, for example, the correspondence between the above four factors may be, but is not limited to, shown in a form of a correspondence list, as shown in table 2, table 2 gives the same advertisement, and the correspondence list with the pre-stop floor, the operation state before the elevator stops, and the play matching degree.

TABLE 2

As can be seen from table 2, the matching degree of an advertisement to be played on a certain pre-stop floor is determined by the running state of the elevator before stopping and the pre-stop floor. The same pre-stopping floor has different playing matching degrees due to different running states, if the pre-stopping floor is 2 floors, the running state before the elevator stops is an ascending running state, the corresponding playing matching degree is 40%, and when the running state before the elevator stops is a descending running state, the corresponding playing matching degree is 20%.

S102b, obtaining the playing matching degree between each advertisement to be played and each pre-stopping floor according to the corresponding relation between each advertisement to be played, each pre-stopping floor and the running state before stopping.

Step S102b is to determine the play matching degree between each advertisement to be played and any pre-stop floor from the corresponding relationship according to the pre-stop floor and the operation state before the elevator stops.

For example, on the basis of table 2, assuming that the pre-stop floor is 4 floors, the running state before the elevator stops is an up-going state, and the advertisement to be played is 4001132, it can be determined from the table that the matching degree of the advertisement to be played 4001132 on the 4 floors is 20%. Similarly, in the same operating state, the broadcast matching degree at the 5 layers can be found from table 2, and the broadcast matching degree of the advertisement 4001132 to be broadcast at the 5 layers is 0%.

Of course, although only one correspondence table of the advertisement to be played is illustrated in the table 2, in this embodiment, the remaining correspondence tables of the advertisement to be played may be stored in the above form and searched in the above manner, which is not described herein.

After the matching degree between each advertisement to be played and each pre-stop floor is obtained, the calculation of the fitness can be performed, that is, step S103.

S103, according to the pre-stopping floors, the stopping probability of each pre-stopping floor and the playing matching degree between each advertisement to be played and each pre-stopping floor, the fitness of each advertisement to be played on any pre-stopping floor in the pre-stopping floors is obtained.

Step S103 is a calculation process of calculating the suitability of each advertisement to be played being played on any one of the pre-stop floors, so that each advertisement to be played is subsequently sorted according to the size of the suitability.

In the present embodiment, the calculation of the example fitness may include, but is not limited to, the following steps S103a and S103b.

S103a, multiplying the playing matching degree between the ith advertisement to be played and each pre-stop floor in the advertisements to be played with the stop probability of each pre-stop floor respectively to obtain the playing fitness of the ith advertisement to be played on each pre-stop floor.

Step S103a is a calculation process of the suitability of any advertisement to be played among the advertisements to be played on each pre-landing floor.

As can be seen from tables 2 and 1, an advertisement to be played on different pre-stop floors has different stop probabilities and different play matching degrees, and the suitability of any advertisement to be played on any pre-stop floor is obtained by multiplying the corresponding play matching degree by the corresponding stop probability.

For example, the advertisement to be played 4001132 is also taken as the ith advertisement to be played, and it is assumed that the operation state before the elevator stops is an up-going state, and the pre-stop floor is also taken as an example in table 1.

The suitability of the advertisement 4001132 to be played at the 4 th floor is calculated by multiplying the stop probability at the 4 th floor by the matching degree of the advertisement played at the 4 th floor, and the result of the multiplication is the matching degree of the advertisement 4001132 to be played at the 4 th floor.

That is, as can be seen from table 1 and table 2, the stop probability of the pre-stop floor at level 4 is 12%, and the playing matching degree at level 4 is 20%, then the suitability of the advertisement 4001132 to be played at level 4 of the pre-stop floor is: 0.024% for 12% × 20%.

Similarly, the calculation method of the suitability of the advertisement 4001132 to be played on the remaining pre-stop floors is the same as the above example, and will not be described herein.

After the suitability of the ith advertisement to be played on each of the pre-stop floors is obtained, step S103b may be performed, and the suitability of the ith advertisement to be played on each of the pre-stop floors is added, so that the suitability of the ith advertisement to be played on any of the pre-stop floors can be obtained.

S103b, adding the suitability of the ith advertisement to be played on each pre-stop floor to obtain the suitability of the ith advertisement to be played on any pre-stop floor, wherein the suitability of the ith advertisement to be played on any pre-stop floor is obtained when I ranges from 1 to I, and I is the number of the advertisements to be played.

Also taking the above example as an example, from table 1, the pre-stop floors have floors 4, 3, 2, 1 and-1, so the fitness of the pre-stop floors to be played at each floor is:

the fitness played at 4 layers is: 0.024% for 12% × 20%.

The fitness to be played at layer 3 is: 15% × 90% ═ 0.135.

The fitness to be played at layer 2 is: 18% × 40% ═ 0.072.

The fitness played at layer 1 is: 32% × 90% ═ 0.288.

The fitness to be played at layer-1 is: 17% × 40% ═ 0.068.

Therefore, the suitability of the advertisement 4001132 to be played at any of the pre-stop floors is: 0.024+0.135+0.072+0.288+0.068 ═ 0.587.

The method for calculating the suitability of the other advertisements to be played on any one of the pre-stop floors is consistent with the above example, and further description is omitted here.

By the above explanation, the suitability of any advertisement to be played on any pre-stop floor in the pre-stop building can be summarized as the following formula:

W＝∑D_x×P_x

in the formula, W is the suitability of any advertisement to be played on any pre-stop floor, x is the pre-stop floor, D_xFor the broadcast matching degree, P, of the advertisement on the pre-stop floor x_xThe probability of landing at the pre-landing floor x for the advertisement.

After the suitability of each advertisement to be played on any one of the pre-stop floors is obtained, the advertisements to be played can be sorted according to the sequence of the suitability, so as to obtain a first advertisement playing list, as shown in step S104.

S104, sequencing the advertisements to be played according to the sequence of the fitness from high to low to obtain a first advertisement playing list, and playing the advertisements to be played according to the first advertisement playing list when the elevator runs from the current stop floor to any one of the pre-stop floors.

Step S104 is a process of sorting the advertisements to be played according to the order of the degree of suitability, so as to sort the advertisement to be played with the highest degree of suitability first, and play the advertisement with priority.

For example, assuming that there are A, B, C and D advertisements to be played, the fitness calculated by step S103 is: 0.587, 0.485, 0.689, and 0.554.

A, B, C and D four advertisements to be played can be sorted by the size sequence of the fitness, and the sorting is as follows: C. a, D and B, the first advertisement playlist is: C. a, D and B.

In calculating the suitability of each advertisement to be played at any pre-stop floor, the same suitability may occur, so in the present embodiment, the following steps S104a and S104b are further provided, so that when the suitability of the advertisement to be played is the same, the following method may be adopted for sorting.

S104a, when the advertisements to be played with the same fitness exist in the advertisements to be played, judging whether the advertisements to be played with the same fitness exist in the advertisements to be played which are played after the last sequencing.

S104b, if yes, sequencing the advertisements to be played according to the sequence of the suitability from large to small and the non-playing priority to obtain the first advertisement playing list.

In this embodiment, when the suitability of the to-be-played advertisements is the same, it needs to be determined whether the to-be-played advertisements with the same suitability are played after being sorted last time, and then the to-be-played advertisements are sorted according to the order of the suitability from large to small and the order of the priority of not playing.

For example, there are A, B, C advertisements and D advertisements to be played, and the fitness calculated in step S103 is: 0.587, 0.485, and 0.554. That is, the suitability of the B advertisement and the C advertisement is the same, it needs to be determined whether the B advertisement and the C advertisement were played in the last sorting, and if the B advertisement was played in the last sorting, the sorting priority of the C advertisement is higher and needs to be arranged in front of the B advertisement under the condition that the suitability of the B advertisement and the C advertisement is the same in the sorting. Therefore, according to the above sorting rule, the sorting is: A. d, C and B.

In this embodiment, if the advertisements to be played with the same suitability are all played or are not played when the advertisements to be played are sorted last time, the advertisements to be played with the same suitability may not be sorted when the advertisements to be played are sorted.

For example, also taking the above as an example, it is assumed that both the B advertisement and the C advertisement are played or not played during the last sorting, and during the sorting, the B advertisement and the C advertisement are not sorted, and the sorting is: A. d, C and B, and may also be: A. d, B and C.

Therefore, by the advertisement sequencing method described in detail in the steps S101 to S104, the suitability of each advertisement to be played can be obtained according to the next stop position of the elevator and the corresponding stop probability, and the playing matching degree of the advertisement at the next stop position, and then each advertisement to be played can be reordered according to the suitability, and the advertisement with the largest suitability is arranged in front of the playing queue, so that the dynamic adjustment of the advertisement playing list in the advertisement player is realized, the adaptive playing of the advertisement and the floor is realized, and the value of advertisement playing is maximized.

In order to ensure the advertisement playing effect of the advertisement to be played using the first advertisement playing list and avoid the problem of continuous playing of the same advertisement, in this embodiment, the following steps S105 to S107 are further provided to adjust the order of the advertisements to be played in the first advertisement playing list.

And S105, determining the starting playing time of each advertisement to be played in the first advertisement playing list.

Step S105 is to determine the playing start time corresponding to each advertisement to be played after the current sorting, so as to provide a data basis for the determination in step S106.

S106, judging whether the playing time interval between the starting playing time of each advertisement to be played and the last playing ending time of each advertisement to be played is less than a preset time length.

S107, if the advertisements to be played exist, the playing time interval of which is smaller than the preset time length, the sequencing positions of the advertisements to be played, the playing time interval of which is smaller than the preset time length, in the first advertisement playing list are adjusted to obtain a second advertisement playing list, wherein the playing time interval of each advertisement to be played in the second advertisement playing list is larger than the preset time length.

Step S106 is to perform a process of determining a playing time interval and a preset time length of each advertisement to be played, and if there is an advertisement to be played whose playing time interval is less than the preset time length, step S107 is required to adjust a sorting position of the advertisement to be played whose playing time interval is less than the preset time length in the first advertisement playing list, and after adjustment, the condition that each advertisement to be played satisfies is that: the playing time interval of each advertisement to be played is greater than the preset time length.

In this embodiment, for example, the to-be-played advertisement with the playing time interval smaller than the preset time length, the method for adjusting the sorting position in the first advertisement playlist may be, but is not limited to, the following steps S107a to S107 d.

S107a, judging whether the playing time interval of the first sequenced advertisement to be played in the first advertisement playing list is smaller than a preset time interval.

And S107b, if yes, shifting the sequencing of the first to-be-played advertisement after sequencing, and changing the sequencing of the next to-be-played advertisement into the first, wherein the next to-be-played advertisement is the next to-be-played advertisement which is sequenced for the first time and corresponds to the first to-be-played advertisement.

S107c, judging whether the playing time interval of the first sequenced advertisement to be played after the shift is less than the preset time length.

S107d, if yes, the current ranking of the first ranked advertisement is shifted one digit backward.

S107e, repeating the steps S107c and S107d until the playing time interval of the first ordered advertisement is longer than a preset time.

S107f, repeating the steps S107 a-S107 e, and obtaining a second advertisement playing list when the interval time between the playing start time of any one of the advertisements to be played and the playing start time of the last playing of the advertisement to be played is larger than the preset time.

The following describes steps S107a to S107f in detail with reference to specific examples.

Based on the above example, the first advertisement playlist is: C. a, D and B, wherein the playing time intervals between the four advertisements and the last playing time of the four advertisements are: 30s, 55s, 60s and 70s, wherein the playing time lengths of the four advertisements are as follows: 20s, 30s, 40s and 25 s. Then the steps of making the determination are:

firstly, if the playing time interval of the advertisement C is 30s and is less than the preset time length of 50s, the ordering of the advertisement C needs to be shifted by one bit, and meanwhile, the ordering of the next advertisement needs to be changed into the first one, wherein the next advertisement is firstly ordered into the next advertisement to be played, of which the first bit corresponds to the advertisement to be played. The first order is that the first advertisement corresponding to the advertisement to be played is advertisement C, and the next advertisement is advertisement A. Therefore, after step S107b, the ranking of the advertisements becomes: A. c, D and B.

At this time, it is also necessary to determine whether the playing time interval of the current ordering of the C advertisement is less than a preset time length, because the current C advertisement becomes the second advertisement, and the previous advertisement is the a advertisement, the playing time interval of the current C advertisement is: the 30s +30s (the playing time of the a advertisement) is 60s, which is longer than the preset time, that is, the ordering of the C advertisement does not need to be adjusted.

Then, the relationship between the playing time interval of the advertisement ordered as the first place and the preset time length can be judged, the advertisement ordered as the first place is the advertisement A, the playing time interval is 55s and is more than 50s, therefore, the ordering does not need to be adjusted, then the relationship between the playing time interval corresponding to the second advertisement ordered and the preset time length is judged, through the above, the advertisement ordered as the second place is the advertisement C, the playing time interval is changed into 60s and is also more than the preset time length, therefore, the third advertisement ordered, namely the advertisement D and the advertisement D, is judged to be not changed, the playing time interval in the initial ordering is 60s and is more than the preset time length 50s, therefore, the adjustment is not needed, finally, the relationship between the playing time interval ordered as the fourth advertisement and the preset time length is judged, namely the playing time interval of the advertisement B (the ordering is not changed, and originally also 70s), again greater than the preset duration, so no adjustment is required.

Finally, after the first advertisement playlist is adjusted through steps S107 a-S107 f, the obtained second advertisement playlist is: A. c, D and B.

In addition, there is another case, specifically:

assume that the first ad playlist is: C. a, D and B, wherein the playing time intervals between the four advertisements and the last playing time of the four advertisements are: 30s, 20s, 60s and 70s, wherein the playing time lengths of the four advertisements are as follows: 20s, 30s, 40s and 25 s.

Since the first advertisement playlist is the same and the time interval between the C advertisements is the same, the determination of the first ordered advertisement and the subsequent ordering adjustment are the same as above, and after the adjustment, the ordering becomes: A. c, D and B.

At this time, it is necessary to determine the playing time interval and the preset time length of the currently ordered first advertisement, where the currently ordered first advertisement is the advertisement a, the playing time interval is 20S, and is less than the preset time length 50S, so it is necessary to shift the order of the advertisement a by one bit (i.e., step S107b), and then change the next advertisement that is first ordered to be the advertisement corresponding to the first bit (i.e., the advertisement C) into the first one, and in the current playlist, the next advertisement of the advertisement C is the advertisement D. Therefore, the adjusted ordering is: D. a, C and B.

Then, the relationship between the playing time interval of the current sequence of the advertisement A and the preset time length is judged. That is, the currently ordered playing time interval of the advertisement a is: the 20s +40s (the playing time of the D advertisement) is 60s, which is longer than the preset time, so that the current ordering of the a advertisement does not need to be adjusted.

Then, the playing time interval of the D advertisement is 60s and is more than 50s when the playing time interval of the current sorted first advertisement and the preset duration are judged, namely the playing time interval of the D advertisement, so that the sorting of the D advertisement is not required to be adjusted.

Then, judging the playing time interval of the advertisement A and the preset time length, wherein the playing time interval corresponding to the current sequencing of the advertisement A is judged to be 60s and is more than the preset time length without adjustment; then, the relationship between the playing time interval of the currently sequenced third advertisement and the preset time length is judged, that is, the playing time interval of the C advertisement (which is 30s +30s (the playing time length of the a advertisement) +40s (the playing time length of the D advertisement) ═ 100s) is greater than the preset time length, so that the current sequencing position of the C advertisement does not need to be adjusted; and finally, judging that the playing time interval of the advertisement B which is the playing time interval of the corresponding advertisement with the fourth bit and is currently sorted is also larger than the preset time length, and no adjustment is needed.

Therefore, after the adjustment of the first advertisement playlist through steps S107 a-S107 f, the obtained second advertisement playlist is: D. a, C and B.

Through the method for adjusting the first advertisement playlist described in detail in the foregoing steps S107a to S107f, the present invention can avoid the problem of continuous playing of the same advertisement by adjusting the playing time interval between the starting playing time and the last ending playing time of the advertisement to be played, thereby further improving the advertisement playing effect.

Given below, a specific implementation method for acquiring the next pre-stop floor of the elevator and the stop probability of each pre-stop floor in the pre-stop floors when the elevator is in a stop state can be, but is not limited to, the following steps S201 to S204.

S201, obtaining historical operation data of the elevator.

Step S201 is to obtain the historical operation data of the elevator, so as to provide a data base for the subsequent calculation of the stopping probability.

In this embodiment, the historical operation data of the elevator can be, but is not limited to: operational data 6 months, 12 months, 18 months, or 24 months prior to the current time. In the embodiment, historical operation data of the elevator 6 months before the current time is obtained by way of example.

In this embodiment, a corresponding speed sensor, a corresponding gravity sensor and a corresponding pressure sensor can be installed on the elevator advertisement machine, and a corresponding data processing module (such as an STM32 processor or an STC51 processor) is provided to collect elevator operation data, the collected data can be stored in the advertisement machine or uploaded to a server to complete storage of the operation data, and further record of the elevator operation data is realized.

In this embodiment, for example, when the historical operation data is collected, the historical operation data is collected at a fixed frequency, for example, the collected data is collected every 100ms, that is, the collected data each time is used as one piece of historical operation data, and one piece of historical operation data includes the collection time, the floor where the elevator is currently located, and the current operation state of the elevator.

In this embodiment, since the data acquisition is realized by using a sensor, there may be a problem of a sensor detection error, so as to ensure that data used for calculating the elevator stop probability is accurate and reliable, a data error-screening step is further provided, which may be, but is not limited to, the following method:

and false data in the historical operating data is manually eliminated so as to ensure that the historical operating data for subsequent data processing is accurate and reliable. In this embodiment, the error data refers to: time discontinuous data and floor error data.

Wherein, the discontinuous data of time means: data that suddenly appears before or after the current time during a continuous period of time may be considered temporally discontinuous data. For example, the historical operating data acquired within a certain period of time is data from 13 minutes and 30 seconds at 1 point on 8/7/2020/7 to 34 minutes and 2 seconds at 4 points on 7/8/2020/7, and data of 5 minutes and 40 seconds at 8 points on 8/7/2020/7 and/or data of 12 minutes and 59 seconds at 7 points on 8/6/2020/8/59 suddenly appear in the data, and one of the two data after the current time and one before the current time can be considered as error data.

And the floor error data is: and the data is not consistent with the total floor number of the building where the elevator is located. For example, the total floor of the building where the elevator is located is 31 floors, but if 32 floors of operation data appear in the acquired historical operation data, the operation data of any 32 floors are considered as error data.

Through the data error screening step, accurate and reliable data can be provided for subsequent data processing, data division and parking probability calculation, and the problem that the accuracy of parking probability calculation is influenced by error data is avoided.

The following is an example of the historical operation data of the elevator acquired in step S201, as shown in table 3.

TABLE 3

Floor where elevator is currently located	Current running state of elevator	Time of acquisition
			2 to 3 layers	Uplink is carried out	2020-05-17 11:22:33.120
2 to 3 layers	Uplink is carried out	2020-05-17 11:22:33.220
			3 layers of	Stop	2020-05-17 11:22:33.320
3 layers of	Stop	2020-05-17 11:22:33.420
			3 layers of	Stop	2020-05-17 11:22:33.520
3 layers of	Stop	2020-05-17 11:22:33.620
			3 layers of	Stop	2020-05-17 11:22:33.720
3 layers of	Stop	2020-05-17 11:22:33.820
			3 to 4 layers	Uplink is carried out	2020-05-17 11:22:33.920
3 to 4 layers	Uplink is carried out	2020-05-17 11:22:34.020
			3 to 4 layers	Uplink is carried out	2020-05-17 11:22:34.120

As can be seen from table 3, the interval between each piece of historical operation data is 100ms (of course, the collection frequency is not fixed, and may be actually set according to the specific use), and each piece of historical operation data includes the floor where the elevator is currently located, the current operation state of the elevator, and the collection time. The rest historical operation data is the same as the composition structure of table 1, and is not described herein.

After the historical operation data of the elevator is obtained, step S202 can be performed to realize data processing on the historical operation data and provide a data basis for subsequent data division.

S202, performing data processing on the historical operation data to obtain first type data, wherein each first type data in the first type data comprises corresponding current time, a current floor, a previous operation state and a next elevator stop floor when the elevator is in a stop state, and the previous operation state is ascending or descending.

Because the elevator is reciprocated between the bottommost floor and the topmost floor, the current floor and the previous running state (which is equivalent to the running state before the elevator stops being an ascending or descending state) of the elevator in the stopping state need to be known, and then the next stop of the elevator can be predicted according to the information, namely the stop probability of the elevator stopping at other floors from the current floor is calculated.

Therefore, the data processing method provided in step S202 needs to be used to obtain the current floor of the elevator in the information and the previous running state.

In this embodiment, the data processing is to perform data screening first and then perform data association, where the purpose of the screening is to find out that the current operation state of the elevator is stopped, and the current operation state of the elevator in the previous historical operation data of the current historical operation data is the historical operation data of uplink or downlink; and the data association is the association among the next stop floor of the elevator, the floor where the elevator is currently located and the last running state of the elevator, and then the floor where the elevator is currently located is used as a parameter condition for participating in calculating the stop probability of the elevator stopping at other floors from the floor where the elevator is currently located.

In the present embodiment, the exemplary data processing (i.e., the process of data filtering and data association) may include, but is not limited to, the following steps S202 a-S202 d.

S202a, screening out historical operation data meeting preset conditions from the historical operation data, wherein the preset conditions are that the current operation state of the elevator is stopped, the current operation state of the elevator in the last historical operation data of the current historical operation data is ascending or descending, and the current operation state of the elevator in the last historical operation data of the current historical operation data is the last operation state.

Step S202a is a process of data filtering, wherein the filtering conditions are: the current running state of the elevator is stop, and the current running state of the elevator in the previous historical running data of the current historical running data is ascending or descending; the function of this step is to perform a lookup of the data when the elevator is in a stopped state. Because the current running state of the elevator is stopped, the elevator is in a stopping state (namely not ascending or descending), namely the corresponding current floor of the elevator in the stopping state can be obtained, so that a data basis is provided for obtaining the next subsequent stopping floor.

Meanwhile, the current operation state of the elevator in the previous historical operation data is also limited, on one hand, the historical operation data is further screened, and data useless for calculating the stopping probability is removed, for example, the operation states of two adjacent data of the elevator are both stopped (for example, because the data are collected according to the preset frequency, and the elevator stops for 1 minute, a plurality of pieces of data are collected in the minute, and the current operation states of the elevator in the data are both stopped, the data are not only useless for calculating the stopping probability of the elevator, but also cause interference, and therefore, the data need to be removed). On the other hand, the current operation state of the elevator is correlated with the current operation state of the elevator of the previous historical operation data (i.e. step S202b), and the data base is provided for the subsequent data correlation with the next stop floor of the elevator in the corresponding filtered historical operation data recorded by the previous operation state.

And S202b, recording the last operation state corresponding to the screened historical operation data into the corresponding screened historical operation data to obtain second type data, wherein each piece of second type data in the second type data comprises the corresponding current time, the current floor and the last operation state when the elevator is in the stop state.

Step S202b is to perform a process of associating the previous operating state with the filtered historical operating data, i.e., record the previous operating state into the corresponding filtered historical operating data.

For example, data screening was performed on the basis of table 3; as can be seen from table 3, the current operating state of the elevator is stopped: the 3 rd to 8 th historical operation data in the table 3, but only the 3 rd data which satisfies the condition that the current operation state of the elevator in the previous historical operation data is the ascending or descending data. Finally, the current operation state of the elevator in the previous historical operation data is recorded, that is, for the 3 rd data, as can be seen from table 3, the current operation state of the elevator in the previous historical operation data is an ascending line, that is, the previous operation state is an ascending line, so that the second type data is obtained after recording.

Through steps S202a and S202b, the second type data corresponding to the 3 rd historical operating data becomes: floor where elevator is currently located: floor 3, the current running state of the elevator: stop, current time: 2020-05-1711:22:33.320, last operating state: and (4) ascending.

The composition structure of the rest of the screened historical operating data is the same as that of the above example, and is not described herein.

Referring to table 4, table 4 shows the second type data obtained by performing step S102a and step S102b, but the data in table 4 is only exemplary.

TABLE 4

As can be seen from table 4, the first 3 columns of data in each row in the table are the screened historical operation data, and the last column of data is the current operation state of the elevator in the previous historical operation data of the current historical operation data. The current running state of the screened historical running data of the elevator is stopped, and the acquisition time in the table 1 corresponds to the current time when the elevator is in the stopped state.

After the second type data is obtained, the next stop floor of the elevator at the floor where the elevator is currently located in each second type data can be searched, so that the association between the next stop floor of the elevator, the previous operation state and the current stop floor is realized, the first type data is obtained, and a data basis is provided for subsequent data division and probability calculation, as shown in steps S202c and S202d.

And S202c, searching the next stopping floor of the elevator of the floor where each piece of second type data is located in the historical operation data, wherein the next stopping floor of the elevator is the floor where the elevator is located in the next historical operation data of the current second type data.

And S202d, recording the next stopping floor of the elevator into the second type data to obtain the first type data.

The following describes the steps S202c and S202d by way of example, based on table 4:

the first piece of the second type data is the current floor: floor 3, current operating state: stop, current time: 2020-05-1711:22: 34.120, last operating state: ascending; if the next stopping floor of the elevator of the floor where the elevator is located in the data is found to be 5 floors, then at this moment, the 5 floors are recorded in the data, and the obtained first type data is as follows: the floor where the current station is: floor 3, current operating state: stop, current time: 2020-05-1711:22: 34.120, last operating state: ascending, and stopping the elevator at the next floor: and (5) building.

The manner of searching for the next stopping floor of the elevator of each of the other second type data is the same as the above example, and the obtained first type data is only different from the corresponding next stopping floor of the elevator, which is not illustrated herein.

For ease of understanding, on the basis of table 4, after performing step S202c and step S202d, the obtained first type data may be as shown in table 5.

TABLE 5

As can be seen from table 5, each piece of the first type data includes the current time, the floor where the elevator is currently located, the previous operation state, and the next stop floor of the elevator, which correspond to when the elevator is stopped (i.e., the current operation state of the elevator is stopped).

Through the steps S202 a-S202 d, the data processing of the historical operating data (namely, the data screening and the data association) can be realized, the first type data is obtained, and a data basis is provided for the subsequent data division and the calculation of the parking probability.

After the first type data is obtained, step S203 is performed, and the operation state is divided according to the previous operation state in the first type data, that is, step S203 is performed.

S203, the first type data is divided into an uplink sequence data and a downlink sequence data, wherein the uplink sequence data comprises a plurality of first type data with an uplink previous operation state, and the downlink sequence data comprises a plurality of first type data with a downlink previous operation state.

In step S203, the first type data is divided according to the previous operation state, that is, the data in the previous operation state that is uplink is divided into uplink sequence data, and the data in the previous operation state that is downlink is divided into downlink sequence data.

For example, as shown in table 5, the operation states are divided into the first, second, third, fourth, fifth, eleventh, twelfth and thirteenth data, and the previous operation states of the first, second, third, fourth, fifth, eleventh, twelfth and thirteenth data are all uplink data, and are divided into uplink sequence data, and the previous operation states of the remaining data are downlink data, and are divided into downlink sequence data, as shown in table 6.

TABLE 6

As can be seen from table 6, there are 8 pieces of the first type data in which the previous operation state is uplink in the uplink sequence data, and there are 5 pieces of the first type data in which the previous operation state is downlink in the downlink sequence data.

After the uplink sequence data and the downlink sequence data are obtained, step S204 may be performed to calculate the stopping probability of the elevator stopping at each of the other floors from the floor where the elevator is currently located by using the uplink sequence data or the downlink sequence data.

And S204, determining the stopping probability of the elevator stopping at other floors from the current floor by using the uplink sequence data or the downlink sequence data.

Step S204 is to perform data statistics in the uplink sequence data or the downlink sequence data according to the current floor and the previous running state of the elevator, so as to calculate the stopping probability of the elevator by using the counted data.

In this embodiment, for convenience of illustration, the current floor may be represented by n, and the remaining floors are represented by k, that is, n floors and k floors for the current floor, where n and k are integers, and n is not equal to k, and the calculation of the stop probability may be performed in, but not limited to, the following steps S204a to S204c.

S204a, counting the number of first type data with n layers of floors where the current floor is located from the uplink sequence data

And S204b, counting the number of the first type data, wherein the floor where the elevator is located at present is n layers, and the next stopping floor of the elevator is k layers, from the uplink sequence data.

And S204c, dividing the number of the first type data with the current floor as n layers and the next stopping floor of the elevator as k layers by the number of the first type data with the current floor as n layers to obtain the stopping probability of the elevator stopping at the k layers from the n layers.

Step S204a is to count the number of the first type data of the floor where the elevator is currently located as n floors, and step S204b is to count the number of the first type data of the floor where the elevator is currently located as n floors and the next stop floor of the elevator is k floors.

For example, if the floor currently located is 3 floors (that is, N is 3), and the previous operation state is an uplink, it is necessary to count the number of pieces of the first type data of the floor currently located is 3 floors, that is, 2 pieces of the first type data, in the uplink sequence data.

Assuming that the stopping probability of the next stopping floor of the elevator is 8 floors (i.e. k is 8), it can be seen from table 6 that the current floor is 3 floors, the number of data pieces of the next stopping floor of the elevator is 8 floors is 1, and similarly, the number of data pieces of the first type of data pieces of the next stopping floor of the elevator is n floors, and the number of data pieces of the next stopping floor of the elevator is k floors can be recorded as M.

Therefore, the landing probability of the elevator from 3 floors to 8 floors is 50%, M/N1/2.

Similarly, when the previous operation state is downlink, only corresponding data statistics need to be performed in the downlink sequence, which is the same as the principle of the steps S204a to S204c, and thus, the description is omitted.

In this embodiment the next stop floor of the elevator is then the pre-stop floor in step S101, i.e. floor k is the pre-stop floor.

Therefore, as long as the current floor and the previous running state corresponding to the elevator in the stopping state are known, statistics of corresponding data can be carried out in the uplink sequence data or the downlink sequence data obtained in the application, the calculation of the stopping probability of the elevator from the floor where the elevator is currently located to other floors is further realized, and finally, the most probable floor to which the elevator is stopped is judged according to the stopping probability.

As shown in fig. 2, a second aspect of the present embodiment provides a hardware apparatus for implementing the advertisement ranking method in the first aspect of the embodiment, including: the system comprises a docking probability obtaining unit, a playing matching degree obtaining unit, a fitness calculating unit and an advertisement playing list generating unit.

The stop probability obtaining list is used for obtaining the next pre-stop floor of the elevator and the stop probability of each pre-stop floor in the pre-stop floors when the elevator is in a stop state.

And the playing matching degree acquisition unit is used for acquiring the playing matching degree between each advertisement to be played in the advertisements to be played and each pre-stopping floor.

The suitability calculation unit is configured to obtain, according to the pre-stop floors, the stop probability of each pre-stop floor, and the play matching degree between each advertisement to be played and each pre-stop floor, the suitability of each advertisement to be played on any one of the pre-stop floors.

In one possible design, the playing matching degree obtaining unit includes: the corresponding relation obtaining subunit and the searching subunit.

And the corresponding relation obtaining subunit is used for obtaining the corresponding relation between each advertisement to be played and each pre-stop floor, the running state before stopping and the playing matching degree of each pre-stop floor.

In one possible design, the fitness calculating unit includes: a first calculating subunit and a second calculating subunit.

The first calculating subunit is configured to multiply the playing matching degree between the ith advertisement to be played in the advertisements to be played and each of the pre-stop floors by the stop probability of each of the pre-stop floors, respectively, to obtain the suitability of the ith advertisement to be played on each of the pre-stop floors.

In one possible design, the advertisement playlist generating unit includes: a first judging subunit and a sorting subunit.

The first judging subunit is configured to, when there are to-be-played advertisements with the same suitability in the to-be-played advertisements, judge whether there are to-be-played advertisements to be played after the last sorting in the to-be-played advertisements with the same suitability.

In one possible design, the apparatus further includes: a determination unit and a second judgment unit.

The determining unit is configured to determine a play start time of each advertisement to be played in the first advertisement playlist.

The second judging unit is configured to judge whether a playing time interval between the starting playing time of each advertisement to be played and the last ending playing time of each advertisement to be played is less than a preset time length.

For the working process, the working details, and the technical effects of the hardware apparatus provided in this embodiment, reference may be made to the first aspect of the embodiment, which is not described herein again.

As shown in fig. 3, a third aspect of this embodiment provides a second advertisement ranking device, including a memory, a processor, and a transceiver, which are sequentially connected in a communication manner, where the memory is used to store a computer program, the transceiver is used to transmit and receive a message, and the processor is used to read the computer program and execute the advertisement ranking method according to the first aspect of this embodiment.

For example, the Memory may include, but is not limited to, a Random Access Memory (RAM), a Read Only Memory (ROM), a Flash Memory (Flash Memory), a First In First Out (FIFO), and/or a First In Last Out (FILO), and the like; the processor may not be limited to a microprocessor of a model number STM32F105 series, a reduced instruction set computer (RSIC) microprocessor, an architecture processor such as X86, or a processor integrated with a neural-Network Processing Unit (NPU); the transceiver may be, but is not limited to, a wireless fidelity (WIFI) wireless transceiver, a bluetooth wireless transceiver, a General Packet Radio Service (GPRS) wireless transceiver, a ZigBee wireless transceiver (ieee802.15.4 standard-based low power local area network protocol), a 3G transceiver, a 4G transceiver, and/or a 5G transceiver, etc. In addition, the device may also include, but is not limited to, a power module, a display screen, and other necessary components.

A fourth aspect of the present embodiment provides a computer-readable storage medium storing instructions including the advertisement ranking method according to the first aspect of the present embodiment, that is, the computer-readable storage medium has instructions stored thereon, and when the instructions are executed on a computer, the advertisement ranking method according to the first aspect of the present invention is executed. The computer-readable storage medium refers to a carrier for storing data, and may include, but is not limited to, floppy disks, optical disks, hard disks, flash memories, flash disks and/or Memory sticks (Memory sticks), etc., and the computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices.

For the working process, the working details, and the technical effects of the computer-readable storage medium provided in this embodiment, reference may be made to the first aspect of the embodiment, which is not described herein again.

A fifth aspect of the present embodiments provides a computer program product comprising instructions which, when run on a computer, wherein the computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus, cause the computer to perform the method of advertisement ranking according to the first aspect of the embodiments.

The embodiments described above are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.

Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device to perform the methods described in the embodiments or some portions of the embodiments.

The invention is not limited to the above alternative embodiments, and any other various forms of products can be obtained by anyone in the light of the present invention, but any changes in shape or structure thereof, which fall within the scope of the present invention as defined in the claims, fall within the scope of the present invention.

Claims

1. A method of ordering advertisements, comprising:

2. The method of claim 1, wherein obtaining a play matching degree between each of the advertisements to be played and each of the pre-stop floors comprises:

3. The method of claim 1, wherein obtaining the suitability of each advertisement to be played at any one of the pre-stop floors according to the pre-stop floor, the stop probability of each pre-stop floor, and the play matching degree between each advertisement to be played and each pre-stop floor comprises:

4. The method of claim 1, wherein sorting the advertisements to be played in order of the goodness-of-fit from large to small to obtain a first advertisement playlist comprises:

5. The method of claim 1, wherein after sorting the advertisements to be played in order of decreasing suitability to obtain a first advertisement playlist, the method further comprises:

6. An advertisement ranking apparatus, comprising: the system comprises a docking probability obtaining unit, a playing matching degree obtaining unit, a fitness calculating unit and an advertisement playing list generating unit;

7. The apparatus of claim 6, wherein the play matching degree obtaining unit comprises: acquiring a subunit and searching the subunit according to the corresponding relation;

8. The apparatus of claim 6, wherein the fitness calculation unit comprises: a first calculating subunit and a second calculating subunit;

9. An advertisement ranking apparatus, comprising: the advertisement sorting method comprises a memory, a processor and a transceiver which are sequentially connected in a communication mode, wherein the memory is used for storing a computer program, the transceiver is used for receiving and sending messages, and the processor is used for reading the computer program and executing the advertisement sorting method according to any one of claims 1-5.

10. A computer-readable storage medium characterized by: the computer-readable storage medium has stored thereon instructions which, when run on a computer, perform the method of sorting advertisements of any of claims 1-5.