CN103208063A - Fragmented time utilizing method for mobile terminal and mobile terminal - Google Patents

Abstract

The invention discloses a fragmented time utilizing method for a mobile terminal and the mobile terminal. The fragmented time utilizing method includes: the mobile terminal receives and saves registered fragmented time periods input by users in advance; the mobile terminal receives and saves schedules established by the users; the mobile terminal receives and saves fragmented tasks input by the users and places the fragmented tasks into a fragmented task list; the mobile terminal finds out that the current schedule is about to be ended, and if the time period between the current schedule and the next schedule coincides to one or several of the fragmented time periods registered by the users, the time periods on the coincidence portion serve as the current fragmented time periods; and the mobile terminal calculates the priority of each fragmented task in the fragmented task list to the current fragmented time periods in terms of any current fragmented time period, and chooses task with the highest priority to prompt for users. By means of the fragmented time utilizing method, effective utilization on the fragmented time can be achieved by the mobile terminal.

Description

Scrappy time utilization method and portable terminal in the portable terminal

Technical field

The present invention relates to the electronic calendar technical field, be specifically related to scrappy time utilization method and portable terminal in the portable terminal.

Background technology

Electronic calendar in the current mobile terminal is mainly reflected on schedule and the task for the management of time: schedule is emphasized the management to the time, thinks little of work complete process and result, require event that the clear and definite time is arranged, and expired schedule is eliminated prompting automatically; Task is then emphasized the management to the course of work and result, and the clear and definite time can be arranged, the restriction that also can have no time, and need the manual terminal procedure of user, not being moved to end of task can be alerted at worktable always.

Mentioning a kind of method that schedule is associated with task in the electronic calendar of the portable terminal that has, is exactly in schedule interlude section, is manually selected and the interpolation task by the user.

In actual life, have a lot of scrappy times to be wasted, as wait for bus, by bus, etc. the people, the sleep before etc.But owing to the scrappy time has uncontinuity and randomness, and in the calendar time management of traditional portable terminal, the arrangement of schedule all is at continuous a period of time, does not utilize for the scrappy time; Then whether there is thing all can remind certain time regardless of the user fully with task relevant a little less than the time, can not be used for utilizing the scrappy time.

At present, also occurred a kind of new electronic calendar in the portable terminal that has, it is inserted into task in the context of schedule, and task will be at specific time alarm like this.Even so, it still has following problem: need the user manually to insert, if task is a lot, this can be a loaded down with trivial details job, is inconvenient to use; On the other hand, task is placed in the context of schedule and shows, and task has also just become schedule like this, incoherent characteristic of the task that weakened and time; Again, it does not utilize other concrete property of task self, as place, the weather of this task, and people's state, if walking, static etc.

As seen, the calendar technology in the existing portable terminal can not make things convenient for, effectively utilize the scrappy time.

Summary of the invention

The invention provides scrappy time utilization method and portable terminal in the portable terminal, effectively to utilize the scrappy time.

Technical scheme of the present invention is achieved in that

Scrappy time utilization method in a kind of portable terminal, this method comprises:

Portable terminal receives and preserves the scrappy time period of registration that the user imports in advance;

Portable terminal receives and preserves the schedule that the user creates;

Portable terminal receives and preserves each scrappy task of user's input, and each scrappy task is put into scrappy task list;

Portable terminal finds that current schedule closes to an end, and overlaps part if find current schedule and time period between the next schedule with the scrappy time period that the user registers, and then will overlap each interior time period of part as each current scrappy time period;

For arbitrary current scrappy time period, portable terminal calculates in the scrappy task list each scrappy task with respect to the priority of this scrappy time period, selects the highest task of priority to send prompting to the user.

Described portable terminal selects the highest task of priority further to comprise after the user sends prompting:

When portable terminal finds that current task is finished, this task is deleted from scrappy task list, do not finish if find the current scrappy time period, then in the scrappy task of residue, select the highest task of priority to send prompting to the user.

Described portable terminal selects the highest task of priority further to comprise after the user sends prompting:

When the current scrappy time period does not also finish, if portable terminal finds to have increased newly scrappy task, then calculate the priority of this newly-increased task with respect to this scrappy time period, again the priority to each scrappy task sorts, and if it is the highest to increase the priority of task newly, then selects and newly-increased task to send prompting to the user.

Described portable terminal selects the highest task of priority further to comprise after the user sends prompting:

When portable terminal is found described next schedule change or cancellation, return and carry out described to overlap part if find current schedule and time period between the next schedule with the scrappy time period that the user registers, then will overlap the action of each interior time period of part as each current scrappy time period.

Described portable terminal calculates each scrappy task in the scrappy task list:

$p_{\mathrm{ki}}={\mathrm{\ω}}_{\mathrm{duration}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{impor}\tan t}^k$

Wherein, p _KiBe the priority of scrappy task k with respect to scrappy time period i;

Be the lasting duration coefficient of task k with respect to scrappy time period i, and, be less than or equal to the scrappy duration t of scrappy time period i when the lasting duration of task k _iThe time,

Otherwise,

Be the important coefficient of task k, and, when important and not urgent as task k,

Maximum; When task k is important and urgent,

Take second place; When task k is inessential and urgent,

Take second place again; When task k is inessential not urgent yet,

Minimum.

Described portable terminal calculates each scrappy task in the scrappy task list:

$p_{\mathrm{ki}}={\mathrm{\ω}}_{\mathrm{status}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{position}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{whether}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{duration}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{continuable}}^k\×{\mathrm{\ω}}_{\mathrm{impor}\tan t}^k$

Wherein, p _KiBe the priority of task k with respect to scrappy time period i;

Be the User Status coefficient of task k with respect to scrappy time period i, and, when the user when walking about,

When the user is static,

Be the position parameter of task k with respect to scrappy time period i, and, as user during in task k desired location, Otherwise,

Be the weather coefficient of task k with respect to scrappy time period i, and, when weather meets task k and carries out required weather,

Otherwise,

Be the lasting duration coefficient of task k with respect to scrappy time period i, and, be less than or equal to the scrappy duration t of scrappy time period i when the lasting duration of task k _iThe time,

Otherwise,

But be the intermittence coefficient of task k, and, as task k intermittently the time,

As the lasting duration of the task k scrappy duration t greater than scrappy time period i _iAnd in the time of intermittently,

Be the important coefficient of task k, and, when important and not urgent as task k,

Maximum; When task k is important and urgent,

Take second place; When task k is inessential and urgent,

Take second place again; When task k is inessential not urgent yet,

Minimum.

Described portable terminal calculates in the scrappy task list and further comprises after the priority of each scrappy task with respect to this scrappy time period:

If portable terminal finds that the priority of the task that priority is the highest is 0, then do not send prompting to the user.

A kind of portable terminal comprises:

Scrappy time period Registering modules: receive and preserve the scrappy time period of registration that the user imports in advance;

Schedule creation module: receive and preserve the schedule that the user creates;

Scrappy task maintenance module: receive each scrappy task of user's input, each scrappy task is put into scrappy task list;

Scrappy time processing module: according to each schedule in the schedule creation module, find that current schedule closes to an end, if the scrappy time period that the user who finds to preserve in time period and the scrappy time period Registering modules between current schedule and the next schedule registers overlaps part, then will overlap each interior time period of part as each current scrappy time period; From scrappy task maintenance module, read scrappy task list, for arbitrary current scrappy time period, calculate in the scrappy task list each scrappy task with respect to the priority of this scrappy time period, select the highest task of priority to send to scrappy task reminders module;

Scrappy task reminders module: receive the scrappy task that scrappy time processing module is sent, should scrappy task reminders give the user.

Described scrappy time processing module is further used for, when finding that current task is finished, this task is deleted from the scrappy task list that scrappy task maintenance module is safeguarded, if finding the current scrappy time period does not finish, then in the scrappy task of residue, select the highest task of priority, this task is sent to scrappy task reminders module.

Described scrappy time processing module is further used for, when the current scrappy time period does not also finish, if increased scrappy task newly in the scrappy task list that the scrappy task maintenance module of discovery is safeguarded, then calculate the priority of this newly-increased task with respect to this scrappy time period, again the priority to each scrappy task sorts, and if it is the highest to increase the priority of task newly, the task that then should increase newly sends to scrappy task reminders module.

Described scrappy time processing module is further used for, when finding next schedule change described in the schedule creation module or cancellation, return and carry out described to overlap part if find current schedule and time period between the next schedule with the scrappy time period that the user registers, then will overlap the action of each interior time period of part as each current scrappy time period.

Described scrappy time processing module is further used for, and calculates in the scrappy task list each scrappy task with respect to the priority of this scrappy time period according to following formula:

$p_{\mathrm{ki}}={\mathrm{\ω}}_{\mathrm{duration}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{impor}\tan t}^k$

Wherein, p _KiBe the priority of scrappy task k with respect to scrappy time period i;

Be the lasting duration coefficient of task k with respect to scrappy time period i, and, be less than or equal to the scrappy duration t of scrappy time period i when the lasting duration of task k _iThe time, Otherwise,

Be the important coefficient of task k, and, when important and not urgent as task k,

Maximum; When task k is important and urgent,

Take second place; When task k is inessential and urgent,

Take second place again; When task k is inessential not urgent yet,

Minimum.

Described scrappy time processing module is further used for, and calculates in the scrappy task list each scrappy task with respect to the priority of this scrappy time period according to following formula:

$p_{\mathrm{ki}}={\mathrm{\ω}}_{\mathrm{status}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{position}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{whether}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{duration}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{continuable}}^k\×{\mathrm{\ω}}_{\mathrm{impor}\tan t}^k$

Wherein, p _KiBe the priority of task k with respect to scrappy time period i;

Be the User Status coefficient of task k with respect to scrappy time period i, and, when the user when walking about,

When the user is static,

Be the position parameter of task k with respect to scrappy time period i, and, as user during in task k desired location,

Otherwise,

Be the weather coefficient of task k with respect to scrappy time period i, and, when weather meets task k and carries out required weather,

Otherwise,

Be the lasting duration coefficient of task k with respect to scrappy time period i, and, be less than or equal to the scrappy duration t of scrappy time period i when the lasting duration of task k _iThe time,

Otherwise,

But be the intermittence coefficient of task k, and, as task k intermittently the time,

As the lasting duration of the task k scrappy duration t greater than scrappy time period i _iAnd in the time of intermittently,

Be the important coefficient of task k, and, when important and not urgent as task k,

Maximum; When task k is important and urgent,

Take second place; When task k is inessential and urgent,

Take second place again; When task k is inessential not urgent yet,

Minimum.

Described scrappy time processing module is further used for, if find that the priority of the task that priority is the highest is 0, then determines not send task reminders to the user.

Compared with prior art, the present invention can calculate the scrappy time automatically according to the arrangement of schedule, and calculates the priority of scrappy task, selects the highest task of priority to send prompting to the user, makes things convenient for, effectively utilized the scrappy time.

Description of drawings

Scrappy time utilization method flow diagram in the portable terminal that Fig. 1 provides for the embodiment of the invention;

The composition synoptic diagram of the portable terminal that Fig. 2 provides for the embodiment of the invention.

Embodiment

The present invention is further described in more detail below in conjunction with drawings and the specific embodiments.

Scrappy time utilization method flow diagram in the portable terminal that Fig. 1 provides for the embodiment of the invention, as shown in Figure 1, its concrete steps are as follows:

Step 101: portable terminal receives and preserves the user and at calendar is set the scrappy time period of the registration of importing in the page in advance.

The user can register the scrappy time period according at ordinary times work and habits and customs.In one day except fixing sleep, have a dinner, working time and the time of schedule is arranged all is the scrappy time.Here because the schedule of every day is unfixed, therefore, the scrappy time period of user's registration be except sleep, have a dinner, time period of off-the-job, owing to do not work weekend, the user registers the different scrappy time periods at working day and weekend certainly.

Step 102: portable terminal receives and preserves the schedule that the user creates.

Each schedule comprises: the initial moment, the finish time, prompting pre-set time etc.Wherein, reminding that can be the finish time pre-set time, also can be a certain moment before the finish time.When reminding be the finish time pre-set time, remind to represent with the finish time pre-set time, also can be with duration 0 expression; When a certain moment of reminding before being the finish time pre-set time, remind to represent in a certain moment before the finish time pre-set time, also can represent with the duration between this finish time in a certain moment before the finish time.

Step 103: portable terminal receives and preserves each scrappy task of user's input, and each scrappy task is put into scrappy task list.

The content of scrappy task is compared with traditional task, except comprising theme, also comprises: estimate to need the time, could be intermittently, place, weather etc.

Step 104: portable terminal finds that any schedule i closes to an end, and judges whether the time period between schedule i+1 and the schedule i overlaps part with the scrappy time period of user's registration, if, execution in step 106; Otherwise, execution in step 105.

Here, this step can begin to carry out by the t duration before schedule i finishes, and as desirable 5 minutes of t, namely finishes to begin in preceding 5 minutes to judge that at schedule i whether the time period between schedule i+1 and the schedule i overlaps part with the scrappy time period that the user registers.

Step 105: portable terminal is determined the no scrappy time between schedule i and the schedule i+1, and this flow process finishes.

Step 106: portable terminal calculates the part that overlaps of scrappy time period that time period and user between schedule i+1 and the schedule i register, this is overlapped each time period in part respectively as each current scrappy time period, calculate the scrappy duration of each current scrappy time period.

For example: when schedule i finished and schedule i+1 when a period of time begins after lunch in a period of time before the lunch, just have two scrappy time periods between schedule i+1 and the schedule i; When the time period between the zero hour of finish time of schedule i and schedule i+1 is just in a scrappy time period of user's registration, just has only a scrappy time period between schedule i and the schedule i+1.

For example: when the time period between the zero hour of finish time of schedule i and schedule i+1 is just in a scrappy time period of user's registration, the scrappy duration t of the unique scrappy time period i between schedule i and the schedule i+1 _iComputing formula as follows:

t _i＝start_time _i+1-end_time _i

Wherein, start_time _I+1Be the initial moment of schedule i+1; End_time _iBe the finish time of schedule i.

Step 107: for arbitrary current scrappy time period, portable terminal calculates in the scrappy task list each scrappy task with respect to the priority of this scrappy time period, according to priority from high to low, all scrappy tasks are sorted, each scrappy task after the ordering is put into current waiting list, from waiting list, select the highest scrappy task of priority to send prompting to the user.

Scrappy task k is with respect to the priority p of scrappy time period i _KiCan be as follows:

$p_{\mathrm{ki}}={\mathrm{\ω}}_{\mathrm{duration}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{impor}\tan t}^k$

Wherein,

Be the lasting duration coefficient of task k with respect to scrappy time period i.The scrappy duration t that is less than or equal to scrappy time period i when the lasting duration of task k _iThe time,

Otherwise,

Wherein, a＞1 is as desirable a=10;

Be the important coefficient of task k,

When important and not urgent as task k,

Maximum is as desirable

When task k is important and urgent, Take second place, as desirable

When task k is inessential and urgent, Take second place again, as desirable When task k is inessential not urgent yet, Minimum is as desirable

In actual applications, calculating p _KiThe time, also can consider simultaneously task could be intermittently, User Status, weather condition, task carry out desired location etc., at this moment, p _KiComputing formula as follows:

$p_{\mathrm{ki}}={\mathrm{\ω}}_{\mathrm{status}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{position}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{whether}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{duration}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{continuable}}^k\×{\mathrm{\ω}}_{\mathrm{impor}\tan t}^k$

Wherein,

Be the User Status coefficient of task k with respect to scrappy time period i.When the user when walking about, When the user is static,

Be the position parameter of task k with respect to scrappy time period i.As user during in task k desired location,

Otherwise,

Be the weather coefficient of task k with respect to scrappy time period i.When weather meets task k and carries out required weather, Otherwise,

But the intermittence coefficient for task k.As task k intermittently the time,

As the lasting duration of the task k scrappy duration t greater than scrappy time period i _iAnd in the time of intermittently,

In actual applications, as the priority p of a task k _Ki, task k is not put into current waiting list at=0 o'clock.

When a task is finished, this task is deleted from current waiting list and scrappy task list, if the current scrappy time period of this moment does not also finish, then from current waiting list, reselect the highest task of priority and send prompting to the user.

During the current scrappy time period, the execution time of schedule i+1, variation took place or schedule i+1 is cancelled, then portable terminal need recomputate the scrappy time period between the schedule i+1 schedule i, namely needs to return the action that step 104 is carried out " judging that whether the time period between schedule i+1 and the schedule i has the part of overlapping with the scrappy time period that the user registers ".

During the current scrappy time period, if there is task to cancel, then need this task is deleted from current waiting list; If increased task newly, then need calculate the priority of this current relatively scrappy time period of newly-increased task, and should increase task newly according to this priority and put into current waiting list, and, if it is the highest to increase the priority of task newly, then should select this newly-increased task to send prompting to the user again.

The composition synoptic diagram of the portable terminal that Fig. 2 provides for the embodiment of the invention, as shown in Figure 2, it mainly comprises: scrappy time period Registering modules 21, schedule creation module 22, scrappy task maintenance module 23, scrappy time processing module 24 and scrappy task reminders module 25, wherein:

Scrappy time period Registering modules 21: receive and preserve the scrappy time period of registration that the user imports in advance.

Schedule creation module 22: receive and preserve the schedule that the user creates.

Scrappy task maintenance module 23: receive each scrappy task of user's input, each scrappy task is put into scrappy task list.

Scrappy time processing module 24: according to each schedule in the schedule creation module 22, find that current schedule closes to an end, if the scrappy time period that the user who finds to preserve in time period and the scrappy time period Registering modules 21 between current schedule and the next schedule registers overlaps part, then will overlap each interior time period of part as each current scrappy time period; From scrappy task maintenance module 23, read scrappy task list, for arbitrary current scrappy time period, calculate in the scrappy task list each scrappy task with respect to the priority of this scrappy time period, select the highest task of priority to send to scrappy task reminders module 25.

Scrappy time processing module 24 is further used for, when finding that current task is finished, this task is deleted from the scrappy task list that scrappy task maintenance module 23 is safeguarded, if finding the current scrappy time period does not finish, then in the scrappy task of residue, select the highest task of priority, this task is sent to scrappy task reminders module 25.

Scrappy time processing module 24 is further used for, when the current scrappy time period does not also finish, if increased scrappy task newly in the scrappy task list that the scrappy task maintenance module 23 of discovery is safeguarded, then calculate the priority of this newly-increased task with respect to this scrappy time period, again the priority to each scrappy task sorts, and if it is the highest to increase the priority of task newly, the task that then should increase newly sends to scrappy task reminders module 25.

Scrappy time processing module 24 is further used for, when finding next schedule change described in the schedule creation module 22 or cancellation, return and carry out described to overlap part if find current schedule and time period between the next schedule with the scrappy time period that the user registers, then will overlap the action of each interior time period of part as each current scrappy time period.

Scrappy time processing module 24 is further used for, and calculates in the scrappy task list each scrappy task with respect to the priority of this scrappy time period according to following formula:

$p_{\mathrm{ki}}={\mathrm{\ω}}_{\mathrm{duration}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{impor}\tan t}^k$

Wherein, p _KiBe the priority of scrappy task k with respect to scrappy time period i;

Be the lasting duration coefficient of task k with respect to scrappy time period i, and, be less than or equal to the scrappy duration t of scrappy time period i when the lasting duration of task k _iThe time,

Otherwise,

Be the important coefficient of task k, and, when important and not urgent as task k,

Maximum; When task k is important and urgent, Take second place; When task k is inessential and urgent,

Take second place again; When task k is inessential not urgent yet, Minimum.

Scrappy time processing module 24 is further used for, and calculates in the scrappy task list each scrappy task with respect to the priority of this scrappy time period according to following formula:

$p_{\mathrm{ki}}={\mathrm{\ω}}_{\mathrm{status}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{position}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{whether}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{duration}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{continuable}}^k\×{\mathrm{\ω}}_{\mathrm{impor}\tan t}^k$

Wherein, p _KiBe the priority of task k with respect to scrappy time period i;

Be the User Status coefficient of task k with respect to scrappy time period i, and, when the user when walking about,

When the user is static,

Be the position parameter of task k with respect to scrappy time period i, and, as user during in task k desired location, Otherwise,

Be the weather coefficient of task k with respect to scrappy time period i, and, when weather meets task k and carries out required weather,

Otherwise,

Be the lasting duration coefficient of task k with respect to scrappy time period i, and, be less than or equal to the scrappy duration t of scrappy time period i when the lasting duration of task k _iThe time,

Otherwise,

But be the intermittence coefficient of task k, and, as task k intermittently the time,

As the lasting duration of the task k scrappy duration t greater than scrappy time period i _iAnd in the time of intermittently,

Be the important coefficient of task k, and, when important and not urgent as task k,

Maximum; When task k is important and urgent,

Take second place; When task k is inessential and urgent,

Take second place again; When task k is inessential not urgent yet,

Minimum.

Scrappy time processing module 24 is further used for, if find that the priority of the task that priority is the highest is 0, then determines not send task reminders to the user.

Scrappy task reminders module 25: receive the scrappy task that scrappy time processing module 24 is sent, should scrappy task reminders give the user.

The above only is preferred embodiment of the present invention, and is in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, is equal to replacement, improvement etc., all should be included within the scope of protection of the invention.

Claims (14)

1. the scrappy time utilization method in the portable terminal is characterized in that this method comprises:

Portable terminal receives and preserves the scrappy time period of registration that the user imports in advance;

Portable terminal receives and preserves the schedule that the user creates;

Portable terminal receives and preserves each scrappy task of user's input, and each scrappy task is put into scrappy task list;

Portable terminal finds that current schedule closes to an end, and overlaps part if find current schedule and time period between the next schedule with the scrappy time period that the user registers, and then will overlap each interior time period of part as each current scrappy time period;

For arbitrary current scrappy time period, portable terminal calculates in the scrappy task list each scrappy task with respect to the priority of this scrappy time period, selects the highest task of priority to send prompting to the user.

2. method according to claim 1 is characterized in that, described portable terminal selects the highest task of priority further to comprise after the user sends prompting:

When portable terminal finds that current task is finished, this task is deleted from scrappy task list, do not finish if find the current scrappy time period, then in the scrappy task of residue, select the highest task of priority to send prompting to the user.

3. method according to claim 1 is characterized in that, described portable terminal selects the highest task of priority further to comprise after the user sends prompting:

When the current scrappy time period does not also finish, if portable terminal finds to have increased newly scrappy task, then calculate the priority of this newly-increased task with respect to this scrappy time period, again the priority to each scrappy task sorts, and if it is the highest to increase the priority of task newly, then selects and newly-increased task to send prompting to the user.

4. method according to claim 1 is characterized in that, described portable terminal selects the highest task of priority further to comprise after the user sends prompting:

When portable terminal is found described next schedule change or cancellation, return and carry out described to overlap part if find current schedule and time period between the next schedule with the scrappy time period that the user registers, then will overlap the action of each interior time period of part as each current scrappy time period.

5. method according to claim 1 is characterized in that, described portable terminal calculates each scrappy task in the scrappy task list and with respect to the priority of this scrappy time period is:

$p_{\mathrm{ki}}={\mathrm{\ω}}_{\mathrm{duration}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{impor}\tan t}^k$

Wherein, p _KiBe the priority of scrappy task k with respect to scrappy time period i;

Be the lasting duration coefficient of task k with respect to scrappy time period i, and, be less than or equal to the scrappy duration t of scrappy time period i when the lasting duration of task k _iThe time,

Otherwise,

Be the important coefficient of task k, and, when important and not urgent as task k,

Maximum; When task k is important and urgent,

Big it; When task k is inessential and urgent,

Take second place again; When task k is inessential not urgent yet,

Minimum.

6. method according to claim 1 is characterized in that, described portable terminal calculates each scrappy task in the scrappy task list and with respect to the priority of this scrappy time period is:

$p_{\mathrm{ki}}={\mathrm{\ω}}_{\mathrm{status}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{position}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{whether}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{duration}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{continuable}}^k\×{\mathrm{\ω}}_{\mathrm{impor}\tan t}^k$

Wherein, p _KiBe the priority of task k with respect to scrappy time period i;

Be the User Status coefficient of task k with respect to scrappy time period i, and, when the user when walking about,

When the user is static,

Be the position parameter of task k with respect to scrappy time period i, and, as user during in task k desired location,

Otherwise,

Be the weather coefficient of task k with respect to scrappy time period i, and, when weather meets task k and carries out required weather,

Otherwise,

Be the lasting duration coefficient of task k with respect to scrappy time period i, and, be less than or equal to the scrappy duration t of scrappy time period i when the lasting duration of task k _iThe time,

Otherwise,

But be the intermittence coefficient of task k, and, as task k intermittently the time, As the lasting duration of the task k scrappy duration t greater than scrappy time period i _iAnd in the time of intermittently,

Be the important coefficient of task k, and, when important and not urgent as task k,

Maximum; When task k is important and urgent,

Take second place; When task k is inessential and urgent,

Take second place again; When task k is inessential not urgent yet,

Minimum.

7. method according to claim 6 is characterized in that, described portable terminal calculates in the scrappy task list and further comprises after the priority of each scrappy task with respect to this scrappy time period:

If portable terminal finds that the priority of the task that priority is the highest is 0, then do not send prompting to the user.

8. a portable terminal is characterized in that, comprising:

Scrappy time period Registering modules: receive and preserve the scrappy time period of registration that the user imports in advance;

Schedule creation module: receive and preserve the schedule that the user creates;

Scrappy task maintenance module: receive each scrappy task of user's input, each scrappy task is put into scrappy task list;

Scrappy time processing module: according to each schedule in the schedule creation module, find that current schedule closes to an end, if the scrappy time period that the user who finds to preserve in time period and the scrappy time period Registering modules between current schedule and the next schedule registers overlaps part, then will overlap each interior time period of part as each current scrappy time period; From scrappy task maintenance module, read scrappy task list, for arbitrary current scrappy time period, calculate in the scrappy task list each scrappy task with respect to the priority of this scrappy time period, select the highest task of priority to send to scrappy task reminders module;

Scrappy task reminders module: receive the scrappy task that scrappy time processing module is sent, should scrappy task reminders give the user.

9. portable terminal according to claim 8, it is characterized in that, described scrappy time processing module is further used for, when finding that current task is finished, this task is deleted from the scrappy task list that scrappy task maintenance module is safeguarded, do not finish if find the current scrappy time period, then in the scrappy task of residue, select the highest task of priority, this task is sent to scrappy task reminders module.

10. portable terminal according to claim 8, it is characterized in that, described scrappy time processing module is further used for, when the current scrappy time period does not also finish, if find to have increased scrappy task newly in the scrappy task list that scrappy task maintenance module safeguards, then calculate this newly-increased task with respect to the priority of this scrappy time period, the priority to each scrappy task sorts again, and if it is the highest to increase the priority of task newly, the task that then should increase newly sends to scrappy task reminders module.

11. portable terminal according to claim 8, it is characterized in that, described scrappy time processing module is further used for, when finding next schedule change described in the schedule creation module or cancellation, return and carry out described to overlap part if find current schedule and time period between the next schedule with the scrappy time period that the user registers, then will overlap the action of each interior time period of part as each current scrappy time period.

12. portable terminal according to claim 8 is characterized in that, described scrappy time processing module is further used for, and calculates in the scrappy task list each scrappy task with respect to the priority of this scrappy time period according to following formula:

$p_{\mathrm{ki}}={\mathrm{\ω}}_{\mathrm{duration}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{impor}\tan t}^{\mathrm{ki}}$

Wherein, p _KiBe the priority of scrappy task k with respect to scrappy time period i;

Be the lasting duration coefficient of task k with respect to scrappy time period i, and, be less than or equal to the scrappy duration t of scrappy time period i when the lasting duration of task k _iThe time,

Otherwise,

Be the important coefficient of task k, and, when important and not urgent as task k,

Maximum; When task k is important and urgent,

Take second place; When task k is inessential and urgent,

Take second place again; When task k is inessential not urgent yet, Minimum.

13. portable terminal according to claim 8 is characterized in that, described scrappy time processing module is further used for, and calculates in the scrappy task list each scrappy task with respect to the priority of this scrappy time period according to following formula:

$p_{\mathrm{ki}}={\mathrm{\ω}}_{\mathrm{status}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{position}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{whether}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{duration}}^{\mathrm{ki}}\×{\mathrm{\ω}}_{\mathrm{continuable}}^k\×{\mathrm{\ω}}_{\mathrm{impor}\tan t}^k$

Wherein, p _KiBe the priority of task k with respect to scrappy time period i;

Be the User Status coefficient of task k with respect to scrappy time period i, and, when the user when walking about,

When the user is static,

Be the position parameter of task k with respect to scrappy time period i, and, as user during in task k desired location,

Otherwise,

Be the weather coefficient of task k with respect to scrappy time period i, and, when weather meets task k and carries out required weather,

Otherwise,

Be the lasting duration coefficient of task k with respect to scrappy time period i, and, be less than or equal to the scrappy duration t of scrappy time period i when the lasting duration of task k _iThe time,

Otherwise,

But be the intermittence coefficient of task k, and, as task k intermittently the time,

As the lasting duration of the task k scrappy duration t greater than scrappy time period i _iAnd in the time of intermittently,

Be the important coefficient of task k, and, when important and not urgent as task k, Maximum; When task k is important and urgent, Take second place; When task k is inessential and urgent,

Take second place again; When task k is inessential not urgent yet,

Minimum.

14. portable terminal according to claim 13 is characterized in that, described scrappy time processing module is further used for, if find that the priority of the task that priority is the highest is 0, then determines not send task reminders to the user.

Images