CN113254487A

CN113254487A - Information pushing method and device

Info

Publication number: CN113254487A
Application number: CN202010082337.7A
Authority: CN
Inventors: 不公告发明人
Original assignee: Beijing ByteDance Network Technology Co Ltd
Current assignee: Beijing ByteDance Network Technology Co Ltd
Priority date: 2020-02-07
Filing date: 2020-02-07
Publication date: 2021-08-13

Abstract

The embodiment of the disclosure provides an information pushing method and device, firstly acquiring complexity information of a task to be processed and the task to be processed, acquiring a task execution time sequence corresponding to a preset task node based on the complexity information of the task to be processed, then determining a first target task execution time from the task execution time sequence based on the historical task execution time for executing a historical task to reach the preset task node and the complexity information of the historical task, taking the first target task execution time as an expected execution time for the task to be processed corresponding to the preset task node, finally acquiring the actual execution time for executing the task to reach the preset task node, and pushing corresponding prompt information according to a comparison result of the actual execution time and the expected execution time, so that a user can timely know the difference between the actual situation and the expected situation for executing the task to reach the preset node, the actual execution situation of the task is more clearly known, so that the user operation can be saved.

Description

Information pushing method and device

Technical Field

The embodiment of the disclosure relates to the technical field of computers, in particular to an information pushing method and device.

Background

In the current task management technology, the task execution condition can be evaluated by the execution time length or the execution speed of the task. The evaluation criterion is generally set manually, and when the execution time length or the execution speed of the task reaches a certain manually set criterion, the capability or the performance of the task execution subject is considered to reach a corresponding level.

However, the manually set criteria do not allow an objective assessment of the task performance. For example, in a learning scene, a user can acquire the actual time length for completing a certain learning task, and then the user judges whether the actual time length reaches the set reference time length according to the set reference time length, so as to determine whether the ability of the user for completing the learning task reaches the corresponding level according to the judgment result.

Disclosure of Invention

The embodiment of the disclosure provides an information pushing method and device.

In a first aspect, an embodiment of the present disclosure provides an information pushing method, where the method includes: the method comprises the steps of obtaining a task to be processed and complexity information of the task to be processed, and obtaining a task execution time length sequence corresponding to a preset task node based on the complexity information of the task to be processed, wherein the task execution time length sequence comprises at least one preset task execution time length; determining a first target task execution time length from the task execution time length sequence as an expected execution time length of the task to be processed corresponding to the preset task node based on the historical task execution time length when the execution historical task reaches the preset task node and the complexity information corresponding to the historical task; and acquiring the actual execution time of the task to be processed reaching the preset task node, and pushing corresponding prompt information according to the comparison result of the actual execution time and the expected execution time.

In some embodiments, obtaining an actual execution time for executing the task to be processed to reach a preset task node, and pushing corresponding prompt information according to a comparison result between the actual execution time and an expected execution time includes: acquiring actual execution time when the task to be processed reaches a preset task node, and comparing the actual execution time with expected execution time; in response to the fact that the actual execution time length is not smaller than the expected execution time length, pushing first prompt information for prompting that the actual task execution speed is not higher than the expected execution speed; and in response to determining that the actual execution time length is less than the expected execution time length, pushing second prompt information for prompting that the actual task execution speed is higher than the expected execution speed.

In some embodiments, in response to determining that the actual execution time period is not less than the expected execution time period, pushing first prompt information for prompting that the actual task execution speed is not higher than the expected execution speed includes: in response to determining that the actual execution duration is not less than the expected execution duration, determining whether a time difference between the actual execution duration and the expected execution duration is greater than a first preset threshold; in response to the fact that the time difference is larger than a first preset threshold value, pushing first prompt information for prompting that the actual task execution speed is not higher than the expected execution speed and the difference between the actual task execution speed and the expected execution speed exceeds a preset difference range; and responding to the fact that the time difference is not larger than a first preset threshold value, and pushing first prompt information for prompting that the actual task execution speed is not higher than the expected execution speed, and the difference between the actual task execution speed and the expected execution speed does not exceed a preset difference range.

In some embodiments, in response to determining that the actual execution time period is less than the expected execution time period, pushing second prompt information for prompting that the actual task execution speed is higher than the expected execution speed includes: in response to determining that the actual execution duration is less than the expected execution duration, determining whether a time difference between the actual execution duration and the expected execution duration is greater than a second preset threshold; in response to the fact that the time difference is larger than a second preset threshold value, pushing second prompt information for prompting that the actual task execution speed is higher than the expected execution speed and the difference between the actual task execution speed and the expected execution speed exceeds a preset difference range; and in response to the fact that the time difference is not larger than a second preset threshold value, pushing second prompt information which prompts that the actual task execution speed is higher than the expected execution speed and the difference between the actual task execution speed and the expected execution speed does not exceed a preset difference range.

In some embodiments, the method further comprises: and in response to the fact that the historical task execution time length when the historical task reaches the preset task node is not recorded in the historical record, determining a second target task execution time length from the task execution time length sequence according to a preset rule, wherein the second target task execution time length is used as an expected execution time length of the task to be processed corresponding to the preset task node.

In some embodiments, the task to be processed includes test questions, the preset task node includes a task node for completing the test questions, and the task execution time length sequence corresponding to the preset task node includes a time length sequence for completing the test questions; the historical task comprises at least one historical test question, and the execution time of the historical task when the execution historical task reaches the preset task node comprises the time for completing the at least one historical test question.

In some embodiments, the pending task comprises a test paper to be completed, the test paper comprising at least one test question; the method for acquiring the task to be processed and the complexity information of the task to be processed comprises the following steps: acquiring the category and the number of the test questions in the test paper to be finished; acquiring difficulty information corresponding to each test question from a preset question bank according to the category of each test question; and acquiring a task execution time length sequence corresponding to a preset task node based on the complexity information of the task to be processed, wherein the task execution time length sequence comprises the following steps: acquiring a time length sequence corresponding to the completion of each test question from a preset question bank based on the difficulty information corresponding to each test question in the test paper to be completed; and determining the time length sequence for completing the test paper to be completed based on the number of the test questions in the test paper to be completed and the time length sequence corresponding to each test question in the test paper to be completed.

In a second aspect, an embodiment of the present disclosure provides an information pushing apparatus, including: the task processing device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is configured to acquire a task to be processed and complexity information of the task to be processed, and acquire a task execution time length sequence corresponding to a preset task node based on the complexity information of the task to be processed, and the task execution time length sequence comprises at least one preset task execution time length; the first determining unit is configured to determine a first target task execution time length from the task execution time length sequence based on the historical task execution time length when the execution historical task reaches the preset task node and the complexity information corresponding to the historical task, and the first target task execution time length is used as the expected execution time length of the task to be processed corresponding to the preset task node; and the pushing unit is configured to acquire the actual execution time of the task to be processed reaching the preset task node and push the corresponding prompt information according to the comparison result of the actual execution time and the expected execution time.

In some embodiments, the pushing unit comprises: the comparison module is configured to acquire the actual execution time of the task to be processed reaching the preset task node and compare the actual execution time with the expected execution time; the first pushing module is configured to respond to the fact that the actual execution time length is not smaller than the expected execution time length, and push first prompting information for prompting that the actual task execution speed is not higher than the expected execution speed; and the second pushing module is configured to push second prompting information for prompting that the actual task execution speed is higher than the expected execution speed in response to the fact that the actual execution time length is smaller than the expected execution time length.

In some embodiments, the first pushing module is further configured to: in response to determining that the actual execution duration is not less than the expected execution duration, determining whether a time difference between the actual execution duration and the expected execution duration is greater than a first preset threshold; in response to the fact that the time difference is larger than a first preset threshold value, pushing first prompt information for prompting that the actual task execution speed is not higher than the expected execution speed and the difference between the actual task execution speed and the expected execution speed exceeds a preset difference range; and responding to the fact that the time difference is not larger than a first preset threshold value, and pushing first prompt information for prompting that the actual task execution speed is not higher than the expected execution speed, and the difference between the actual task execution speed and the expected execution speed does not exceed a preset difference range.

In some embodiments, the second pushing module is further configured to: in response to determining that the actual execution duration is less than the expected execution duration, determining whether a time difference between the actual execution duration and the expected execution duration is greater than a second preset threshold; in response to the fact that the time difference is larger than a second preset threshold value, pushing second prompt information for prompting that the actual task execution speed is higher than the expected execution speed and the difference between the actual task execution speed and the expected execution speed exceeds a preset difference range; and in response to the fact that the time difference is not larger than a second preset threshold value, pushing second prompt information which prompts that the actual task execution speed is higher than the expected execution speed and the difference between the actual task execution speed and the expected execution speed does not exceed a preset difference range.

In some embodiments, the apparatus further comprises: and the second determining unit is configured to determine a second target task execution time length from the task execution time length sequence according to a preset rule in response to detecting that the execution history task in the history record reaches the preset historical task execution time length of the task node, and the second target task execution time length is used as the expected execution time length of the task to be processed corresponding to the preset task node.

In some embodiments, the pending task comprises a test paper to be completed, the test paper comprising at least one test question; the acquisition unit is further configured to: acquiring the category and the number of the test questions in the test paper to be finished; acquiring difficulty information corresponding to each test question from a preset question bank according to the category of each test question; acquiring a time length sequence corresponding to the completion of each test question from a preset question bank based on the difficulty information corresponding to each test question in the test paper to be completed; and determining the time length sequence for completing the test paper to be completed based on the number of the test questions in the test paper to be completed and the time length sequence corresponding to each test question in the test paper to be completed.

In a third aspect, an embodiment of the present disclosure provides an electronic device, including: one or more processors; a storage device having one or more programs stored thereon; when the one or more programs are executed by the one or more processors, the one or more processors implement the information pushing method as described in any of the embodiments in the first aspect.

In a fourth aspect, an embodiment of the present disclosure provides a computer-readable medium, on which a computer program is stored, which, when executed by a processor, implements the information pushing method as described in any one of the embodiments in the first aspect.

The information pushing method and the device provided by the embodiment of the disclosure firstly obtain a task to be processed and complexity information of the task to be processed, obtain a task execution time length sequence corresponding to a preset task node based on the complexity information of the task to be processed, then determine a first target task execution time length from the task execution time length sequence as an expected execution time length of the task to be processed corresponding to the preset task node based on a historical task execution time length when the historical task is executed to the preset task node and complexity information corresponding to the historical task, finally obtain an actual execution time length when the task to be processed reaches the preset task node, and push corresponding prompt information according to a comparison result of the actual execution time length and the expected execution time length, so that a user can timely know a difference between an actual situation and an expected situation when the task to be processed reaches the preset node, the actual situation of executing the task to be processed to the preset node is known more clearly, the level of the actual situation does not need to be further known according to the expected situation, and therefore user operation is saved.

Drawings

Other features, objects and advantages of the disclosure will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:

FIG. 1 is an exemplary system architecture diagram in which one embodiment of the present disclosure may be applied;

FIG. 2 is a flow diagram for one embodiment of a method for information push, according to an embodiment of the present disclosure;

FIG. 3 is a schematic diagram of an application scenario of an information push method according to an embodiment of the present disclosure;

FIG. 4 is an exemplary flowchart for pushing corresponding hint information based on a comparison of actual execution duration and expected execution duration in accordance with an embodiment of the present disclosure;

FIG. 5 is an exemplary flow chart for pushing first prompt information according to an embodiment of the disclosure;

FIG. 6 is an exemplary flow chart for pushing second toast according to an embodiment of the present disclosure;

FIG. 7 is a schematic diagram of an embodiment of an information pushing device, according to an embodiment of the present disclosure;

FIG. 8 is a schematic structural diagram of an electronic device suitable for use in implementing embodiments of the present disclosure.

Detailed Description

The present disclosure is described in further detail below with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant disclosure and are not limiting of the disclosure. It should be noted that, for the convenience of description, only the parts relevant to the related disclosure are shown in the drawings.

It should be noted that, in the present disclosure, the embodiments and features of the embodiments may be combined with each other without conflict. The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.

Fig. 1 shows an exemplary system architecture 100 of an information pushing method and an information pushing apparatus to which embodiments of the present disclosure may be applied.

As shown in fig. 1, the system architecture 100 may include

terminal devices

104, 105, a network 106, and

servers

101, 102, 103. The network 106 serves as a medium for providing communication links between the

terminal devices

104, 105 and the

servers

101, 102, 103. Network 106 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.

A user may interact with the

servers

101, 102, 103 via the network 106 via the

terminal devices

104, 105 to receive or transmit information or the like. The

end devices

104, 105 may have various applications installed thereon, such as reading-type applications, data analysis applications, instant messaging tools, social platform software, search-type applications, shopping-type applications, data processing applications, and the like.

The

terminal devices

104, 105 may be hardware or software. When the terminal device is hardware, it may be various electronic devices having a display screen and supporting communication with the server, including but not limited to a smart phone, a tablet computer, a laptop portable computer, a desktop computer, and the like. When the terminal device is software, the terminal device can be installed in the electronic devices listed above. It may be implemented as multiple pieces of software or software modules, or as a single piece of software or software module. And is not particularly limited herein.

The

servers

101, 102, 103 may be servers that provide various services, such as background servers that receive requests sent by terminal devices with which communication connections are established. The background server can receive and analyze the request sent by the terminal device, and generate a processing result.

The server may be hardware or software. When the server is hardware, it may be various electronic devices that provide various services to the terminal device. When the server is software, it may be implemented as a plurality of software or software modules for providing various services to the terminal device, or may be implemented as a single software or software module for providing various services to the terminal device. And is not particularly limited herein.

It should be noted that the information pushing method provided by the embodiment of the present disclosure may be executed by the

terminal devices

104 and 105 or the

servers

101, 102 and 103. Accordingly, the information pushing device is arranged in the

terminal equipment

104, 105 or the

server

101, 102, 103.

It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

With continued reference to fig. 2, a flow 200 of one embodiment of an information push method according to the present disclosure is shown. The information pushing method comprises the following steps:

step 210, obtaining the task to be processed and the complexity information of the task to be processed, and obtaining a task execution time length sequence corresponding to a preset task node based on the complexity information of the task to be processed.

In this step, the execution main body on which the information push method is executed may obtain a task to be processed in a memory reading, camera scanning, or user input manner, where the task to be processed may be a task executed by an electronic device such as a terminal device or a server, for example, a training task of a neural network model, an operation request processing task of a client, and the like; the task to be processed may also be a task to be performed by a person as a task performing subject, such as an article to be read, a test question to be completed, or a test paper to be completed, and so on. The to-be-processed task may include task data such as type information of the to-be-processed task and/or content of the to-be-processed task. As an example, when the task to be processed is a task executed by the electronic device, the execution main body may read, through the memory, or send an acquisition request to another device to acquire task data of the task to be executed; or, when the task to be processed is a test question or a test paper to be completed, the executing body may further acquire related task data through image scanning or data input by a user.

The execution main body may obtain the complexity information corresponding to the to-be-processed task based on the type information of the to-be-processed task and/or a preset corresponding relationship between the content of the to-be-processed task and the complexity information. The type information of the tasks to be processed, the content of the tasks to be processed and the complexity information of the tasks to be processed have a preset corresponding relation, different types of information of the tasks to be processed correspond to different complexity information, and different contents correspond to different complexity information. As an example, when the task to be processed is a task to be executed by the electronic device, the complexity information may be a complexity of each data and operation of the task to be executed; or, when the task to be processed is an article to be read, the complexity information may be the difficulty of understanding the content of the article; or, when the task to be processed is a test question or a test paper to be completed, the complexity information may be difficulty of the test question or difficulty of a question in the test paper.

Then, the execution main body may search at least one task execution duration corresponding to a preset task node in a preset relationship list according to the complexity information of the task to be processed and the preset task node of the task to be processed to obtain a task execution duration sequence, where the preset relationship list includes a plurality of tasks, the complexity information corresponding to each task, a plurality of task nodes corresponding to each task, and at least one task execution duration corresponding to each task node.

The preset task node may be a node whose task completion progress reaches a preset progress, and may include, for example, a completion node (task progress 100%) or a node whose task progress is 50%, and so on. Each preset task node is provided with a preset task execution time sequence, each task execution time in the task execution time sequence can correspond to different task execution capacity levels, and the different task execution capacity levels can represent different task processing capacities or the performance of a task execution main body. And the task execution time length sequence corresponding to each preset task node consists of at least one task execution time length. Each of the at least one task execution time length may be a statistical result obtained by counting execution time lengths of the same task executed by different electronic devices or people, and each time length may represent an execution capacity of the same task executed by the different electronic devices or people.

In some optional implementation manners of this embodiment, the task to be processed may include a test question, the preset task node may include a task node that completes the test question, and the task execution time length sequence corresponding to the preset task node includes a time length sequence that completes the test question.

The executing body may acquire the test question by means of camera scanning or user input. In an exemplary scenario, a camera may be disposed on the smart desk, and the executing body receives an instruction from a user to open the smart desk, and scans a test question image on the smart desk through the camera. Then, the topic content of the test question can be obtained through image recognition and the like, and the complexity information corresponding to the topic content of the test question is obtained in a preset question bank according to the topic content of the test question, for example, the complexity information may be difficulty information. And finally, the execution main body can search at least one time length for completing the test questions in a preset question bank according to the complexity information of the test questions to obtain a time length sequence for completing the test questions, wherein the preset question bank can comprise the question contents of a plurality of test questions, the complexity information corresponding to the question contents of each test question and at least one time length corresponding to the completed test questions.

In the implementation mode, when the task to be processed is the test question, the time length sequence for completing the test question is determined in the preset question bank according to the complexity information of the test question, so that the determined time length sequence of each test question is more accurate.

In some optional implementations of this embodiment, the to-be-processed task may further include a test paper to be completed, where the test paper includes at least one test question. The execution main body can acquire the task to be processed and the complexity information of the task to be processed through the following steps: acquiring the category and the number of the test questions in the test paper to be finished; and acquiring difficulty information corresponding to each test question from a preset question bank according to the category of each test question.

The executing body can acquire the test paper to be finished through modes of camera shooting scanning or user input and the like. In an exemplary scenario, a camera may be disposed on the smart desk, and the executing body receives an instruction from a user to open the smart desk, and starts to scan an image of a test paper to be completed on the smart desk through the camera. Then, the executing body may obtain the subject content of each test question and the number of the test questions in the test paper to be completed through image recognition and the like, and obtain a category corresponding to the subject content of each test question in a preset question library according to the subject content of each test question, where the category may be a type of the test question, such as a math question, a Chinese question, an english question, or a math application question, a math arithmetic question, and the like. And finally, the execution main body searches the difficulty information corresponding to the question content of each test question in a preset question library according to the acquired question content of each test question and the category of each test question. The preset question bank can also comprise difficulty information corresponding to each question content in each question category.

The execution main body can also realize the task execution time length sequence corresponding to the preset task node based on the complexity information of the task to be processed through the following steps: acquiring a time length sequence corresponding to the completion of each test question from a preset question bank based on the difficulty information corresponding to each test question in the test paper to be completed; and determining the time length sequence for completing the test paper to be completed based on the number of the test questions in the test paper to be completed and the time length sequence corresponding to each test question in the test paper to be completed.

The executing main body can determine at least one time length for completing the test question corresponding to each test question in a preset question bank based on the difficulty information corresponding to the question content of each test question, and at the moment, the executing main body obtains a time length sequence for completing the test question corresponding to each test question. The preset question bank also comprises at least one time length for completing the test question corresponding to the question content of each test question, and each time length can represent the time length for completing the test question of different users, can also represent the percentage of the number of people corresponding to the time length, and can also represent different speed grades. Then, the execution main body can obtain the time length sequence for completing the test paper to be completed by correspondingly adding the time lengths with the same speed grade in each time length sequence according to the time length sequence for completing the test paper corresponding to each test question and the number of the test questions in the test paper.

As a specific example, the number of the test questions in the to-be-completed test paper acquired by the execution main body is 3, and the time length sequence for completing the test question corresponding to each test question has 3 speed levels, for example, the time length sequence for completing the test question 1 is 3 minutes, 5 minutes, and 7 minutes, the time length sequence for completing the test question 2 is 5 minutes, 7 minutes, and 9 minutes, and the time length sequence for completing the test question 3 is 2 minutes, 4 minutes, and 6 minutes, the execution main body may add the time lengths corresponding to the same speed level in the time length sequences for 3 test questions to obtain the time length sequence for completing the to-be-completed test paper, for example, add 3 minutes corresponding to test question 1, 5 minutes corresponding to test question 2, and 2 minutes corresponding to test question 3 to obtain 10 minutes, add 5 minutes corresponding to test question 1, 7 minutes corresponding to test question 2, and 4 minutes corresponding to test question 3 to obtain 16 minutes, adding 7 minutes corresponding to the test question 1, 9 minutes corresponding to the test question 2 and 6 minutes corresponding to the test question 3 to obtain 22 minutes, wherein the obtained time sequence for completing the test paper to be completed is 10 minutes, 16 minutes and 22 minutes.

According to the implementation mode, in a scene that a student finishes a test paper, the time length sequence corresponding to the test paper to be finished can be further objectively and accurately determined by acquiring information such as the type and the number of the test paper to be finished, the test paper formed by different test paper combinations can be flexibly adapted, and further the expected execution time length capable of more accurately matching with the task execution main body capacity can be determined in subsequent steps.

Step 220, based on the historical task execution time when the execution historical task reaches the preset task node and the complexity information corresponding to the historical task, determining a first target task execution time from the task execution time sequence as an expected execution time of the task to be processed corresponding to the preset task node.

In this step, the execution main body may obtain a history record after obtaining the complexity information of the task to be processed and the task execution time sequence corresponding to the preset task node, where the history record includes a plurality of history tasks, the complexity information of each history task, a history task node corresponding to each history task, and a history execution time corresponding to each history task node.

The execution main body compares the complexity information of each historical task in the acquired historical record with the complexity information of the task to be processed according to the complexity information of the task to be processed and a preset task node, and finds out the historical task matched with the complexity information of the task to be processed. For example, the execution main body may find out a historical task identical to the complexity information of the task to be processed among the historical tasks by comparison. The execution main body determines a plurality of historical task nodes corresponding to the historical tasks in the historical records, searches for historical execution time corresponding to the historical task nodes as preset task nodes, and determines the searched historical execution time as the historical task execution time from the historical tasks to the preset task nodes. Or, the execution main body determines a plurality of historical task nodes corresponding to each historical task in the historical record according to the preset task nodes and the complexity information of the tasks to be processed, and searches the corresponding historical execution time length when the historical task node corresponding to each historical task is the preset task node, so that the historical task execution time length from the execution of the plurality of historical tasks to the preset task node is obtained. And then the execution main body compares the obtained complexity information of each historical task with the complexity information of the task to be processed, and further determines the historical task matched with the complexity information of the task to be processed. For example, the execution main body may find a historical task that is the same as the complexity information of the task to be processed, among the plurality of historical tasks obtained by comparison. And the execution main body determines the historical task execution time from the execution of the plurality of historical tasks to the preset historical task execution time of the task node, wherein the historical task execution time is matched with the complexity information of the task to be processed.

And then the execution main body searches the time length which meets a preset condition from the acquired task execution time length sequence according to the determined historical task execution time length from the historical task execution to a preset task node, and determines the time length as a first target task execution time length, wherein the preset condition can comprise the same time length as the determined historical task execution time length, or the minimum long distance with the determined historical task execution time length, or the increase within the range of the preset time length on the basis of the determined historical task execution time length. The execution main body takes the determined first target task execution time length as an expected execution time length from the execution of the task to be processed to a preset task node, and can also present the expected execution time length to a user. Meanwhile, the expected execution duration can be adjusted by the user so as to meet different requirements of the user.

In some optional implementation manners of this embodiment, the task to be processed may include test questions, the historical task may include at least one historical test question, and the historical task execution time for executing the historical task to reach the preset task node may include the time for completing the at least one historical test question.

As a specific example, a plurality of historical test questions are stored in the history of the execution subject, and each historical test question corresponds to complexity information and a time length for completing each historical test question. After the execution main body obtains the complexity information of the test questions to be completed as X, searching the historical test questions with the complexity information of X in the historical records. And then the execution main body determines the completion duration Y corresponding to the historical test question in the historical record according to the searched historical test question with the complexity information of X. And finally, the execution main body selects a time length which is close to the execution time length Y of the historical test questions in the time length sequence of the test questions to be completed as a first target task execution time length according to the time length Y of the historical test questions, and determines the first target task execution time length as the expected execution time length of the test questions.

And step 230, acquiring the actual execution time of the task to be processed reaching the preset task node, and pushing corresponding prompt information according to the comparison result of the actual execution time and the expected execution time.

In this step, the execution main body may obtain an actual execution time length from the execution of the task to be processed to the preset task node through time length detection or user input, for example, the execution main body may obtain the actual execution time length through calculation of time corresponding to each operation in the log, may record the actual execution time length through the camera, and may also receive the actual execution time length input by the user. The execution subject may then compare the obtained actual execution duration with the expected execution duration to obtain a comparison result, where the comparison result may represent a relative magnitude relationship between the actual execution duration and the expected execution duration. Finally, the execution main body pushes prompt information corresponding to the comparison result according to the comparison result between the actual execution duration and the expected execution duration, and when the comparison result is that the actual execution duration is longer than the expected execution duration, the prompt information corresponding to the comparison result may include information for prompting that the actual execution speed is lower than the expected execution speed, and as an example, the prompt information may be "you currently finish speed is lower than the expected value, please continue to add fuel"; alternatively, when the comparison result is that the actual execution time length is not greater than the expected execution time length, the prompt information corresponding to the comparison result may include information for prompting that the actual execution speed is not higher than the expected execution speed, and the prompt information may be "you currently finish speed has exceeded the expected value, please continue to hold", as an example.

With continuing reference to fig. 3, fig. 3 is a schematic diagram of an application scenario of the information push method according to the present embodiment. In the application scenario of fig. 3, the task to be processed may be reading an article, the terminal 310 may send an article acquisition request to the service 320, and the server 320 acquires the corresponding article from the database according to the article acquisition request and acquires the understanding difficulty of the article. Then, the service 320 obtains, according to the understanding difficulty of the article, a time length sequence of reading the article corresponding to the article from the database, where the time length sequence includes at least one preset time length, each time length may be a statistical result obtained by performing statistics on the time lengths of reading the article by multiple users, and each time length may represent a different reading speed. The server 320 may then obtain a historical article with the same understanding difficulty as the article from the history, obtain the historical time length of the current user reading the historical article, and then select, by the server 320, a time length similar to the historical time length from the time length sequence of the article that is completely read according to the obtained historical time length as the expected time length of the current user reading the article. The server 320 then sends the article to the terminal 310, and the terminal 310 presents the received article to the current user. Finally, the terminal 310 may obtain the actual time length of the article read by the current user through real-time detection, and send the actual time length to the server 320. The server 320 compares the received actual time length with the expected time length, determines that the actual time length is smaller than the expected time length as a comparison result, sends prompt information corresponding to the comparison result to the terminal 310, and the terminal 310 presents the received prompt information to the current user, wherein the prompt information is that "your current reading speed exceeds the expected speed".

The information pushing method provided by the embodiment of the disclosure comprises the steps of obtaining a task to be processed and complexity information of the task to be processed, obtaining a task execution time sequence corresponding to a preset task node based on the complexity information of the task to be processed, then determining a first target task execution time from the task execution time sequence based on a historical task execution time when an execution historical task reaches the preset task node and complexity information corresponding to the historical task, wherein the first target task execution time is used as an expected execution time when the task to be processed corresponds to the preset task node, finally obtaining an actual task execution time when the task to be processed reaches the preset task node, pushing corresponding prompt information according to a comparison result of the actual task execution time and the expected execution time, evaluating the actual execution condition of the task to be processed by utilizing the expected execution time, and avoiding artificial evaluation of the actual execution condition, the evaluation of the actual execution condition of the task to be processed is more objective, the accuracy of the evaluation is further improved, and meanwhile, the user can timely know the difference between the actual condition and the expected condition of the task to be processed to the preset node. And the expected execution time length is determined according to the historical execution time length, so that the user can know the progress or the step-back of the actual execution situation of the current task to be processed compared with the historical situation. Further, each time length in the task execution time length sequence can represent the execution capacity of different electronic equipment or people for executing the same task, so that the expected execution time length determined from the task execution time length sequence can represent the execution capacity of other electronic equipment or other people for executing the task to be processed to the preset task node, the method can obtain the difference between the actual execution capacity of the execution main body and the execution capacity of other electronic equipment or other people, and the objectivity and the accuracy for evaluating the actual execution capacity are improved.

In some optional implementation manners of this embodiment, referring to fig. 4, in step 230, obtaining an actual execution time for executing the task to be processed to reach the preset task node, pushing the corresponding prompt information according to a comparison result between the actual execution time and the expected execution time, and executing according to the following procedures:

step 410, obtaining the actual execution time of the task to be processed reaching the preset task node, and comparing the actual execution time with the expected execution time.

In this step, the execution main body may obtain the actual execution time for executing the task to be processed to reach the preset task node through time length detection or user input. And then the execution main body compares the acquired actual execution duration with the expected execution duration, and judges whether the actual execution duration is not less than the expected execution duration.

When the actual execution time length is not less than the expected execution time length as a result of the determination in step 401, step 420 is executed, and in response to determining that the actual execution time length is not less than the expected execution time length, first prompt information for prompting that the actual execution speed is not higher than the expected execution speed is pushed.

In this step, the execution main body determines by judgment that the actual execution time period is not less than the desired execution time period, that is, the actual execution speed is not higher than the desired execution speed. Then, the executing main body pushes a first prompt message reflecting the comparison result according to the comparison result, where the first prompt message may be used to prompt that the actual execution speed is not higher than the expected execution speed, for example, the first prompt message may be "you currently finish speed is lower than the expected value, please continue to add fuel", or "you currently finish speed is slower, please continue to add fuel", or the like.

When the actual execution time length is smaller than the expected execution time length as a result of the determination in step 401, step 430 is executed, and in response to determining that the actual execution time length is smaller than the expected execution time length, second prompt information for prompting that the actual execution speed is higher than the expected execution speed is pushed.

In this step, the execution subject described above determines that the actual execution time period is smaller than the desired execution time period by judgment, that is, the actual execution speed is higher than the desired execution speed. Then, the executing agent pushes a second prompt message reflecting the comparison result according to the comparison result, where the second prompt message may be used to prompt that the actual execution speed is higher than the expected execution speed, for example, the second prompt message may be "you 'current completion speed has exceeded the expected value, please continue to hold", or "you' current completion speed is faster, please continue to hold", or the like.

In this implementation manner, the execution main body can push different prompt information according to the comparison result between the actual execution speed and the expected execution speed, so that the prompt information can reflect the difference between the actual execution situation and the expected execution situation of the task to be processed, and the user can know the difference through the prompt information.

In some optional implementations of this embodiment, with further reference to fig. 5, in the step 420, in response to determining that the actual execution time length is not less than the expected execution time length, pushing the first prompt information for prompting that the actual execution speed is not higher than the expected execution speed may be performed according to the following flow:

step 510, in response to determining that the actual execution duration is not less than the expected execution duration, determining whether a time difference between the actual execution duration and the expected execution duration is greater than a first preset threshold.

In this step, after determining that the actual execution time length is not less than the expected execution time length by the execution main body, a time difference between the actual execution time length and the expected execution time length may be further calculated. And then the execution main body compares the obtained time difference with a first preset threshold value, and judges whether the obtained time difference is greater than the first preset threshold value.

The first preset threshold may be set according to the expected execution duration or the task execution duration sequence, for example, when the expected execution duration is larger, the value of the first preset threshold may be set to be larger; or when the value of the expected execution period is small, the value of the first preset threshold may be set to a smaller value. For example, the desired execution time period is 60 minutes, and the first preset threshold may be set to 10 minutes; or the desired execution time period is 20 minutes, the first preset threshold may be set to 3 minutes.

When the determination result in the step 501 is that the time difference between the actual execution time length and the expected execution time length is greater than the first preset threshold, step 520 is executed, and in response to determining that the time difference is greater than the first preset threshold, first prompt information for prompting that the actual execution speed is not higher than the expected execution speed and that the difference between the actual execution speed and the expected execution speed exceeds a preset difference range is pushed.

In this step, the execution main body determines that the time difference between the actual execution time length and the expected execution time length is greater than a first preset threshold value through judgment. Then, the executing agent pushes a first prompt message reflecting the determination result according to the determination result, where the first prompt message may be used to prompt that the actual execution speed is not higher than the expected execution speed and the difference between the actual execution speed and the expected execution speed exceeds a preset difference range, for example, the first prompt message may be "you currently finish speed is lower than the expected value and the difference between the current execution speed and the expected value is large, please continue to refuel" or the like.

As a specific example, when the first preset threshold is 10 minutes, the expected execution duration is 60 minutes, the actual execution duration is 80 minutes, the execution main body obtains that the time difference between the actual execution duration and the expected execution duration is 20 minutes, and by determining that the time difference is greater than the first preset threshold, the first prompt message "you currently finish at a speed lower than the expected value and have a large difference from the expected value, please continue to add fuel" is pushed.

When the judgment result in the step 501 is that the time difference between the actual execution time length and the expected execution time length is not greater than the first preset threshold, step 530 is executed, and in response to determining that the time difference is not greater than the first preset threshold, first prompt information for prompting that the actual execution speed is not higher than the expected execution speed and the difference between the actual execution speed and the expected execution speed does not exceed a preset difference range is pushed.

In this step, the execution subject determines that the time difference between the actual execution time period and the expected execution time period is not greater than a first preset threshold value by judgment. Then, the executing main body pushes a first prompt message reflecting the judgment result according to the judgment result, where the first prompt message may be used to prompt that the actual execution speed is not higher than the expected execution speed and the difference between the actual execution speed and the expected execution speed does not exceed a preset difference range, for example, the first prompt message may be "you's current completion speed is lower than the expected value but is close to the expected value, please continue to add fuel", or "you's current completion speed is slightly lower than the expected value, please continue to add fuel", or the like.

As a specific example, when the first preset threshold is 10 minutes, the expected execution duration is 60 minutes, the actual execution duration is 65 minutes, the execution main body obtains that the time difference between the actual execution duration and the expected execution duration is 5 minutes, and pushes the first prompt message "you have a current completion speed lower than the expected value but close to the expected value, please continue to add fuel" by judging that the time difference is smaller than the first preset threshold.

In this implementation manner, the execution main body can push different first prompt information according to the time difference between the actual execution time and the expected execution time, so that diversification of the prompt information is satisfied, and meanwhile, the prompt information can further reflect the actual difference between the actual execution situation and the expected execution situation, so that the difference between the actual execution situation and the expected execution situation is more visualized.

In some optional implementations of this embodiment, further referring to fig. 6, in the step 430, in response to determining that the actual execution time length is less than the expected execution time length, pushing second prompt information for prompting that the actual execution speed is higher than the expected execution speed may be performed according to the following flow:

in response to determining that the actual execution duration is less than the expected execution duration, it is determined whether a time difference between the actual execution duration and the expected execution duration is greater than a second preset threshold, step 610.

In this step, after determining that the actual execution time length is smaller than the expected execution time length through judgment, the execution main body may further calculate a time difference between the actual execution time length and the expected execution time length. And then the execution main body compares the acquired time difference with a second preset threshold value, and judges whether the acquired time difference is greater than the second preset threshold value.

The second preset threshold may be set according to the expected execution duration or the task execution duration sequence, for example, when the expected execution duration is larger, the value of the first preset threshold may be set to be larger; or when the value of the expected execution period is small, the value of the first preset threshold may be set to a smaller value. The second preset threshold may or may not coincide with the first preset threshold. For example, the desired execution time period is 60 minutes, and the second preset threshold may be set to 10 minutes; or the desired execution time period is 20 minutes, the second preset threshold may be set to 3 minutes.

When the judgment result in the step 601 is that the time difference between the actual execution time length and the expected execution time length is greater than the second preset threshold, step 620 is executed, and in response to determining that the time difference is greater than the second preset threshold, second prompt information for prompting that the actual execution speed is higher than the expected execution speed and that the difference between the actual execution speed and the expected execution speed exceeds a preset difference range is pushed.

In this step, the execution main body determines that the time difference between the actual execution time length and the expected execution time length is greater than a second preset threshold value through judgment. Then, the executing entity pushes a second prompt message reflecting the determination result according to the determination result, where the second prompt message may be used to prompt that the actual execution speed is higher than the expected execution speed and the difference between the actual execution speed and the expected execution speed exceeds a preset difference range, for example, the second prompt message may be "you' current completion speed far exceeds the expected value, please continue to keep" or the like.

As a specific example, when the second preset threshold is 10 minutes, the expected execution duration is 60 minutes, the actual execution duration is 40 minutes, the execution main body obtains that the time difference between the actual execution duration and the expected execution duration is 20 minutes, and by determining that the time difference is greater than the second preset threshold, the second prompt message "you have far exceeded the expected value at the current completion speed, please keep it" is pushed.

When the judgment result in the step 601 is that the time difference between the actual execution time length and the expected execution time length is not greater than the second preset threshold, step 630 is executed, in response to determining that the time difference is not greater than the second preset threshold, second prompt information for prompting that the actual execution speed is higher than the expected execution speed and the difference between the actual execution speed and the expected execution speed does not exceed a preset difference range is pushed.

In this step, the execution subject determines that the time difference between the actual execution time period and the expected execution time period is not greater than a second preset threshold value by judgment. Then, the executing main body pushes a second prompt message reflecting the determination result according to the determination result, where the second prompt message may be used to prompt that the actual execution speed is higher than the expected execution speed and that the difference between the actual execution speed and the expected execution speed does not exceed a preset difference range, for example, the second prompt message may be "you just finish the speed exceeding the expected value and please keep it, or" you finish the speed closer to the expected value and please keep it ", or the like.

As a specific example, when the second preset threshold is 10 minutes, the expected execution duration is 60 minutes, the actual execution duration is 55 minutes, the execution main body obtains that the time difference between the actual execution duration and the expected execution duration is 5 minutes, and pushes the second prompt message that "you just finish the speed at present and just exceed the expected value, please keep it" by judging that the time difference is smaller than the second preset threshold.

In this implementation manner, the execution main body can push different second prompt information according to the time difference between the actual execution time length and the expected execution time length, so that diversification of the prompt information is satisfied, and meanwhile, the prompt information can further reflect the actual difference between the actual execution situation and the expected execution situation, so that the difference between the actual execution situation and the expected execution situation is more visualized.

In an actual scenario, after pushing prompt information corresponding to a comparison result according to the comparison result between the actual execution duration and the expected execution duration, the execution main body may present a display interface for reselecting a new expected execution duration to a user, and the user may select the new expected execution duration from the display interface as an expected execution duration for executing a task matching the complexity of the task to be processed next time. As an example, when the speed of completing one test question by the user is lower than the desired speed, the executing main body may push a prompt message "please continue to add oil if the current completion speed is lower than the desired speed" to the user, at this time, the executing main body may present a display interface to the user, where the display interface may include a key for reselecting the desired time length, and the user may adjust the desired time length by using the key, and use the adjusted desired time length as the desired time length for completing the test question with the same difficulty as the test question next time.

Or the execution main body can also automatically adjust the expected duration according to the actual execution duration after pushing the prompt information corresponding to the comparison result according to the comparison result between the actual execution duration and the expected execution duration, and takes the adjusted expected duration as the expected execution duration when the task matched with the complexity of the task to be processed is executed next time. In some optional implementation manners of this embodiment, the information pushing method may further include: and in response to the fact that the historical task execution time length when the historical task reaches the preset task node is not recorded in the historical record, determining a second target task execution time length from the task execution time length sequence according to a preset rule, wherein the second target task execution time length is used as an expected execution time length of the task to be processed corresponding to the preset task node.

In this implementation manner, the history record may include a plurality of history tasks, complexity information of each history task, a history task node corresponding to each history task, and a history execution duration corresponding to each history task node. The execution main body acquires the to-be-processed task, the complexity information of the to-be-processed task and the task execution duration sequence corresponding to the preset task node, and then acquires the historical record. And then the execution main body detects the historical tasks in the historical records and judges whether the historical tasks matched with the complexity information of the tasks to be processed exist in the historical records. And determining that no history task matched with the complexity information of the task to be processed is recorded in the history record, wherein the execution main body can determine a second target task execution time length from the task execution time length sequence according to a preset rule as an expected execution time length of the task to be processed corresponding to a preset task node. Or when the history task matched with the complexity information of the task to be processed is judged and determined to be recorded in the history record, whether the preset task node exists in the history node corresponding to the history task is further judged, and when the execution main body determines that the preset task node does not exist in the history node corresponding to the history task, the execution duration of the history task, which is used for executing the history task and reaches the preset task node, does not exist in the history record. At this time, according to a preset rule, determining a second target task execution time length from the task execution time length sequence as an expected execution time length of the task to be processed corresponding to a preset task node.

The preset rule may be a target task execution duration selection rule set in advance. The task execution duration sequence may be a plurality of task execution durations arranged according to time lengths, for example, 10 minutes, 20 minutes, 30 minutes, 40 minutes, and 50 minutes, and the preset rule may be that a task execution duration of an intermediate level is preferentially selected in the task execution duration sequence, for example, 30 minutes is selected as a second target task execution duration; or the task execution duration with the longest time in the task execution duration sequence may be selected preferentially, for example, 50 minutes is selected as the second target task execution duration.

In the implementation mode, when it is detected that the execution history task in the history record does not record the execution history task reaching the preset history task execution time of the task node or the history task matched with the complexity information of the task to be processed is not recorded, the target execution time can be selected according to the preset rule, so that the diversity of the selection rule of the target task execution time is improved.

With further reference to fig. 7, as an implementation of the methods shown in the above figures, the present disclosure provides one embodiment of an information pushing apparatus. This device embodiment corresponds to the method embodiment shown in fig. 2.

As shown in fig. 7, the information pushing apparatus 700 of the present embodiment may include: an obtaining unit 710 configured to obtain a task to be processed and complexity information of the task to be processed, and obtain a task execution duration sequence corresponding to a preset task node based on the complexity information of the task to be processed, where the task execution duration sequence includes at least one preset task execution duration; a first determining unit 720, configured to determine, based on a historical task execution time for executing a historical task to reach a preset task node and complexity information corresponding to the historical task, a first target task execution time from the task execution time sequence as an expected execution time for the task to be processed corresponding to the preset task node; and the pushing unit 730 is configured to acquire the actual execution time of the task to be processed reaching the preset task node, and push the corresponding prompt information according to the comparison result of the actual execution time and the expected execution time.

In some optional implementations of this implementation, the pushing unit 730 includes: the comparison module is configured to acquire the actual execution time of the task to be processed reaching the preset task node and compare the actual execution time with the expected execution time; the first pushing module is configured to respond to the fact that the actual execution time length is not smaller than the expected execution time length, and push first prompting information for prompting that the actual task execution speed is not higher than the expected execution speed; and the second pushing module is configured to push second prompting information for prompting that the actual task execution speed is higher than the expected execution speed in response to the fact that the actual execution time length is smaller than the expected execution time length.

In some optional implementations of this implementation, the first pushing module is further configured to: in response to determining that the actual execution duration is not less than the expected execution duration, determining whether a time difference between the actual execution duration and the expected execution duration is greater than a first preset threshold; in response to the fact that the time difference is larger than a first preset threshold value, pushing first prompt information for prompting that the actual task execution speed is not higher than the expected execution speed and the difference between the actual task execution speed and the expected execution speed exceeds a preset difference range; and responding to the fact that the time difference is not larger than a first preset threshold value, and pushing first prompt information for prompting that the actual task execution speed is not higher than the expected execution speed, and the difference between the actual task execution speed and the expected execution speed does not exceed a preset difference range.

In some optional implementations of this implementation, the second pushing module is further configured to: in response to determining that the actual execution duration is less than the expected execution duration, determining whether a time difference between the actual execution duration and the expected execution duration is greater than a second preset threshold; in response to the fact that the time difference is larger than a second preset threshold value, pushing second prompt information for prompting that the actual task execution speed is higher than the expected execution speed and the difference between the actual task execution speed and the expected execution speed exceeds a preset difference range; and in response to the fact that the time difference is not larger than a second preset threshold value, pushing second prompt information which prompts that the actual task execution speed is higher than the expected execution speed and the difference between the actual task execution speed and the expected execution speed does not exceed a preset difference range.

In some optional implementations of this implementation, the apparatus further includes: and the second determining unit is configured to determine a second target task execution time length from the task execution time length sequence according to a preset rule in response to detecting that the execution history task in the history record reaches the preset historical task execution time length of the task node, and the second target task execution time length is used as the expected execution time length of the task to be processed corresponding to the preset task node.

In some optional implementation manners of the present embodiment, the task to be processed includes a test question, the preset task node includes a task node for completing the test question, and the task execution time sequence corresponding to the preset task node includes a time sequence for completing the test question; the historical task comprises at least one historical test question, and the execution time of the historical task when the execution historical task reaches the preset task node comprises the time for completing the at least one historical test question.

In some optional implementations of the present implementation, the task to be processed includes a test paper to be completed, and the test paper includes at least one test question; the acquisition unit is further configured to: acquiring the category and the number of the test questions in the test paper to be finished; acquiring difficulty information corresponding to each test question from a preset question bank according to the category of each test question; acquiring a time length sequence corresponding to the completion of each test question from a preset question bank based on the difficulty information corresponding to each test question in the test paper to be completed; and determining the time length sequence for completing the test paper to be completed based on the number of the test questions in the test paper to be completed and the time length sequence corresponding to each test question in the test paper to be completed.

The device provided by the above embodiment of the disclosure first obtains the task to be processed and the complexity information of the task to be processed, obtains the task execution time sequence corresponding to the preset task node based on the complexity information of the task to be processed, then determines the first target task execution time from the task execution time sequence as the expected execution time of the task to be processed corresponding to the preset task node based on the historical task execution time when the execution historical task reaches the preset task node and the complexity information corresponding to the historical task, finally obtains the actual execution time when the execution task reaches the preset task node, and pushes the corresponding prompt information according to the comparison result of the actual execution time and the expected execution time, so that the user can know the difference between the actual situation and the expected situation when the execution task to be processed reaches the preset node in time, the actual situation of executing the task to be processed to the preset node is known more clearly, the level of the actual situation does not need to be further known according to the expected situation, and therefore user operation is saved.

Referring now to FIG. 8, shown is a schematic diagram of an electronic device 800 suitable for use in implementing embodiments of the present disclosure. The electronic device shown in fig. 8 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.

As shown in fig. 8, an electronic device 800 may include a processing means (e.g., central processing unit, graphics processor, etc.) 801 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage means 808 into a Random Access Memory (RAM) 803. In the RAM803, various programs and data necessary for the operation of the electronic apparatus 800 are also stored. The processing apparatus 801, the ROM 802, and the RAM803 are connected to each other by a bus 804. An input/output (I/O) interface 805 is also connected to bus 804.

Generally, the following devices may be connected to the I/O interface 805: input devices 806 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 807 including, for example, a Liquid Crystal Display (LCD), speakers, vibrators, and the like; storage 808 including, for example, magnetic tape, hard disk, etc.; and a communication device 809. The communication means 809 may allow the electronic device 800 to communicate wirelessly or by wire with other devices to exchange data. While fig. 8 illustrates an electronic device 800 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided. Each block shown in fig. 8 may represent one device or may represent multiple devices as desired.

In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication means 809, or installed from the storage means 808, or installed from the ROM 802. The computer program, when executed by the processing apparatus 801, performs the above-described functions defined in the methods of the embodiments of the present disclosure.

It should be noted that the computer readable medium of the embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In embodiments of the disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In embodiments of the present disclosure, however, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.

The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: the method comprises the steps of obtaining a task to be processed and complexity information of the task to be processed, and obtaining a task execution time length sequence corresponding to a preset task node based on the complexity information of the task to be processed, wherein the task execution time length sequence comprises at least one preset task execution time length; determining a first target task execution time length from the task execution time length sequence as an expected execution time length of the task to be processed corresponding to the preset task node based on the historical task execution time length when the execution historical task reaches the preset task node and the complexity information corresponding to the historical task; and acquiring the actual execution time of the task to be processed reaching the preset task node, and pushing corresponding prompt information according to the comparison result of the actual execution time and the expected execution time.

Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, and including conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units described in the embodiments of the present disclosure may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes an acquisition unit, a first determination unit, and a pushing unit. The names of the units do not limit the unit itself in some cases, for example, the acquiring unit may also be described as a unit that acquires the task to be processed and the complexity information of the task to be processed, and acquires the task execution time length sequence corresponding to the preset task node based on the complexity information of the task to be processed.

The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is made without departing from the inventive concept as defined above. For example, the above features and (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure are mutually replaced to form the technical solution.

Claims

1. An information push method, comprising:

the method comprises the steps of obtaining a task to be processed and complexity information of the task to be processed, and obtaining a task execution time sequence corresponding to a preset task node based on the complexity information of the task to be processed, wherein the task execution time sequence comprises at least one preset task execution time;

determining a first target task execution time length from the task execution time length sequence based on the historical task execution time length when the execution historical task reaches the preset task node and the complexity information corresponding to the historical task, wherein the first target task execution time length is used as the expected execution time length of the task to be processed corresponding to the preset task node;

and acquiring the actual execution time of the task to be processed reaching the preset task node, and pushing corresponding prompt information according to the comparison result of the actual execution time and the expected execution time.

2. The method according to claim 1, wherein the acquiring an actual execution time for executing the task to be processed to reach the preset task node, and pushing corresponding prompt information according to a comparison result between the actual execution time and the expected execution time comprises:

acquiring the actual execution time of the task to be processed reaching the preset task node, and comparing the actual execution time with the expected execution time;

in response to the fact that the actual execution time length is not smaller than the expected execution time length, pushing first prompt information for prompting that the actual task execution speed is not higher than the expected execution speed;

and in response to determining that the actual execution time length is smaller than the expected execution time length, pushing second prompt information for prompting that the actual task execution speed is higher than the expected execution speed.

3. The method of claim 2, wherein the pushing first prompting information for prompting that an actual task execution speed is not higher than a desired execution speed in response to determining that the actual execution time length is not less than the desired execution time length comprises:

in response to determining that the actual execution duration is not less than the expected execution duration, determining whether a time difference between the actual execution duration and the expected execution duration is greater than a first preset threshold;

in response to the fact that the time difference is larger than the first preset threshold value, pushing first prompt information for prompting that the actual task execution speed is not higher than the expected execution speed and the difference between the actual task execution speed and the expected execution speed exceeds a preset difference range;

and responding to the fact that the time difference is not larger than the first preset threshold value, and pushing first prompt information for prompting that the actual task execution speed is not higher than the expected execution speed, and the difference between the actual task execution speed and the expected execution speed is not larger than a preset difference range.

4. The method of claim 2, wherein the pushing second prompting information for prompting an actual task execution speed to be higher than a desired execution speed in response to determining that the actual execution time length is less than the desired execution time length comprises:

in response to determining that the actual execution duration is less than the expected execution duration, determining whether a time difference between the actual execution duration and the expected execution duration is greater than a second preset threshold;

in response to the fact that the time difference is larger than the second preset threshold value, pushing second prompt information for prompting that the actual task execution speed is higher than the expected execution speed and the difference between the actual task execution speed and the expected execution speed exceeds a preset difference range;

and in response to the fact that the time difference is not larger than the second preset threshold value, pushing second prompt information which prompts that the actual task execution speed is higher than the expected execution speed and the difference between the actual task execution speed and the expected task execution speed does not exceed a preset difference range.

5. The method of any of claims 1-4, wherein the method further comprises:

and in response to the fact that the historical task execution time length when the historical task is not recorded in the historical record to reach the preset historical task execution time length of the task node is detected, determining a second target task execution time length from the task execution time length sequence according to a preset rule, wherein the second target task execution time length is used as the expected execution time length of the task to be processed corresponding to the preset task node.

6. The method according to claim 5, wherein the task to be processed comprises a test question, the preset task nodes comprise task nodes for completing the test question, and the task execution time length sequence corresponding to the preset task nodes comprises a time length sequence for completing the test question;

the historical task comprises at least one historical test question, and the time for executing the historical task to reach the preset historical task node comprises the time for completing the at least one historical test question.

7. The method of claim 6, wherein the to-be-processed task comprises a test paper to be completed, the test paper comprising at least one test question;

the acquiring the task to be processed and the complexity information of the task to be processed includes:

acquiring the category and the number of the test questions in the test paper to be finished;

acquiring difficulty information corresponding to each test question from a preset question bank according to the category of each test question; and

the method for acquiring the task execution duration sequence corresponding to the preset task node based on the complexity information of the task to be processed comprises the following steps:

acquiring a time length sequence corresponding to the completion of each test question from the preset question library based on the difficulty information corresponding to each test question in the test paper to be completed;

and determining the time length sequence for completing the test paper to be completed based on the number of the test questions in the test paper to be completed and the time length sequence corresponding to each test question in the test paper to be completed.

8. An information pushing apparatus comprising:

the task processing device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is configured to acquire a task to be processed and complexity information of the task to be processed, and acquire a task execution time length sequence corresponding to a preset task node based on the complexity information of the task to be processed, and the task execution time length sequence comprises at least one preset task execution time length;

a first determining unit, configured to determine, based on a historical task execution time for executing a historical task to reach the preset task node and complexity information corresponding to the historical task, a first target task execution time from the task execution time sequence as an expected execution time of the task to be processed corresponding to the preset task node;

and the pushing unit is configured to acquire the actual execution time for executing the task to be processed to reach the preset task node, and push corresponding prompt information according to the comparison result of the actual execution time and the expected execution time.

9. The apparatus of claim 8, wherein the pushing unit comprises:

the comparison module is configured to acquire the actual execution time for executing the task to be processed to reach the preset task node, and compare the actual execution time with the expected execution time;

a first pushing module configured to push first prompt information for prompting that an actual task execution speed is not higher than an expected execution speed in response to determining that the actual execution time length is not less than the expected execution time length;

a second pushing module configured to push second prompt information for prompting that the actual task execution speed is higher than the expected execution speed in response to determining that the actual execution time length is less than the expected execution time length.

10. The apparatus of claim 9, wherein the first pushing module is further configured to:

11. The apparatus of claim 9, wherein the second pushing module is further configured to:

12. The apparatus of any of claims 8-11, wherein the apparatus further comprises:

and the second determining unit is configured to determine a second target task execution time length from the task execution time length sequence according to a preset rule in response to detecting that the execution history task in the history record reaches the preset historical task execution time length of the task node, and the second target task execution time length is used as the expected execution time length of the task to be processed corresponding to the preset task node.

13. The device of claim 12, wherein the task to be processed comprises a test question, the preset task nodes comprise task nodes for completing the test question, and the task execution time sequence corresponding to the preset task nodes comprises a time sequence for completing the test question;

14. The apparatus of claim 13, wherein the to-be-processed task comprises a test paper to be completed, the test paper comprising at least one test question;

the acquisition unit is further configured to:

15. An electronic device, comprising:

one or more processors;

a storage device for storing one or more programs,

the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of any of claims 1-7.

16. A computer-readable medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-7.