AU769808B2 - Apparatus for allocating time to an event - Google Patents

Description

WO 00/26828 PCT/GB99/03605 APPARATUS FOR ALLOCATING TIME TO AN EVENT The invention relates to a diary system suitable particularly but not exclusively for assisting in the management of information flows for a user.

Modern computers are multifunctional devices that enable a user to process data not only from a local source but also from remote sources connected through local area networks and wide area networks such as the internet.

The user can send and receive emails and generally use the computer as a workstation from which many different day-to-day tasks can be performed.

So-called personal organiser software is available to facilitate management of such day-to-day tasks. For example Microsoft Outlook marketed by Microsoft Corporation, provides a group of program suites accessible through a single window which allows email to be sent, logged, received, making use of address information from a common database. Also, the software includes a diary and scheduling system, which allows the user to interrogate diaries of other users on a network, so as to arrange meetings and other appointments. However, with this package and others, the user must make a large number of decisions concerning prioritisation and scheduling of incoming and outgoing data because these diary systems are essentially merely electronic versions of paper, or manual diaries.

In an attempt to develop tools to be used in complex tasks involving many degrees of freedom and variables, artificial intelligence aids such as fuzzy logic, artificial neural networks and genetic algorithms have been integrated into the decision making core of such systems. United States patent 5781731 describes a system used for scheduling meetings, particularly for conferences. The system is directed towards resolving accommodation, resources and scheduling constraints, and the scheduling part involves allowing potential attendees to specify a preferred time for the meeting in the form of "around The system allows the delegates to specify meeting preferences in a format such as "around X day of X month". The n~l~ system processes these time requests from each of the delegates, attempting to find a time period that satisfies all of the preferences. When a solution has been reached, the system attempts to schedule the event in question within the time period. The goal is to find accommodation for a period equal to the time required by the event, and this may be a function of factual constraints such as room availability, lunch break, times of previously held meetings etc. The patent describes one approach as marching forward in blocks of time, which blocks are equal to the time of the meeting, within the time period until all of these constraints are satisfied.

Any discussion of the prior art throughout the specification should in no way be considered as an admission that such prior art is widely known or forms part of common general knowledge in the field.

It is an object of the present invention to overcome or ameliorate at least one of the disadvantages of the prior art, or to'provide. a useful alternative.

In accordance with a first embodiment of the present invention there is provided apparatus for identifying a time with respect to an event in a scheduling system comprising: input means for receiving: event identifying data comprising an identifier for a processable event; and 20 a fuzzy logic statement associated with the processable event, the fuzzy logic "statement identifying a duration and a start time thereof; S(ii) means for storing: event identifying data; and temporal preference information associated with said event identifying data; (iii) means arranged to access a temporal schedule, the temporal schedule being Co arranged to store allocated times in respect of at least one previously allocated event; (iv) processing means for: applying a predetermined function to convert the received fuzzy logic statement into temporal preference information; and reviewing temporal preference information corresponding to the at least one previously allocated event, together with the temporal preference information for the processab e event in order to identify an available time for the processable event in the temporal schedule that satisfies the temporal preference information both of the or each previously allocated event and of the processable event.

Advantageously the fuzzy logic statement for a processable event describes both or either of a start time for the processable event and/or duration for the processable event, where the start time and/or duration relates to a period in a single day or a period that extends over a plurality of days.

Preferably the temporal preference information for a processable event describes an end time and a duration for the processable event, and the apparatus further comprises monitoring means for monitoring the temporal schedule and alerting means for outputting an alert signal in the event that available time in the temporal schedule conflicts with the said temporal preference information.

Conveniently, times are identified for two or more processable events. The apparatus may further be arranged to provide a system for scheduling a meeting between two entities.

Preferably the storage means further comprises means to store constraint information, and the input means is arranged to further receive constraint information relating to the processable event. In such an arrangement of the apparatus said reviewing performed by the processing means further includes reviewing said stored constraint :ii: information together with constraint information received by the input means, in order to identify respective start times for each of the at least two events in the temporal schedule that satisfy both types of constraint information.

According to a second aspect of the present invention, there is provided an apparatus for scheduling a meeting between two entities, including a plurality of apparatus as described above.

According to a third aspect of the present invention, there is provided a method of allocating a time with respect to an event in a scheduling system comprising the steps 0-0 of: 000: identifying a processable event; (ii) inputting a fuzzy logic statement associated with the processable event, the S 30 fuzzy logic statement identifying a duration and a start time of an event; (iii) converting the fuzzy logic statement into temporal preference information associated with the processable event in accordance with a predetermined function; (iv) storing: event identifying data; temporal preferences associated with the event identifying data; accessing a temporal schedule for storing allocated times in respect at least one previously allocated event; and (vi) reviewing temporal preference information corresponding to the at least one previously allocated event, together with the temporal preference information for the processable event in order to identify an available time for the processable event in the temporal schedule that satisfies the temporal preference information of both the or each previously allocated event and the processable event.

In the context of the preferred embodiment of the present invention, an event is referred to as a task, or a diary entry, and input means to identify the event is generally described with reference to inputting information relating to that task, via a graphical user interface application. The means for indicating a fuzzy logic statement associated with the event is similarly provided by a feature of the graphical user interface application, and the fuzzy logic statement may be a statement such as "around 1 hour".

The means for storing existing diary entries relates to where the time and task information is stored, once the diary has processed the diary entry, and the temporal schedule is the graphical user interface which displays existing diary entries as per a paper diary. The predetermined function is described in terms of a fuzzy function 20 accompanying the fuzzy logic statement, and the temporal preference information is 2 referred to as a plurality of preferences as a function of times (duration, start times, deadlines). The processing means that identifies a time for allocation to an event is provided by various software components, and these are described by their functionality in the following description.

According to a forth aspect of the present invention there is provided a method of allocating time to a processable event according to a method as described above when C the processable event is a meeting between a plurality of entities, the method comprising S•the steps of: sending a first preferred time period from the first temporal schedule to a 30 further temporal schedule; the temporal schedule receiving a second preferred time period from the further temporal schedule, which second preferred time period has been processed to 4aaccount for stored temporal preference information relating to the further temporal schedule; and combining the first and second preferred time periods so as to allocate a time to the meeting that satisfies preferences of the temporal preferences of both temporal preference information.

According to another aspect of the invention there is provided a computer program comprising a set of instructions to cause a computer to perform the method as described above.

Further aspects, features and advantages of the apparatus for allocating a time to an event will now be described, by way of example only, as embodiments of the present invention, with reference to the accompanying drawings, in which: Figure 1 is a schematic block diagram of the hardware of a computer system configured to run apparatus for co-ordinating tasks of the present invention,--------

S..

.*oooS .oo.oj •oo* WO 00/26828 PCT/GB99/03605 Figure 2 is a schematic diagram showing apparatus for co-ordinating tasks interacting with a plurality of intelligent agents according to the present invention, Figure 3 is a schematic diagram showing apparatus according to a first embodiment for co-ordinating tasks of Figure 2, Figure 4 is a schematic diagram showing the Java thread processes comprising part of the apparatus of Figure 3, Figure 5 is a schematic diagram showing apparatus according to a second embodiment for co-ordinating tasks of Figure 2, Figure 6 is a schematic view of the display provided by diary assistant shown in Figure 2, for making a diary entry; Figure 7 is a schematic view of the diary display; Figure 8 is a table of fuzzy rankings for the diary preference "early morning" shown in Figure 6; Figure 9 is a flow diagram of the diary entry process according to a first embodiment, Figure 10 is a flow diagram of the diary entry process according to a second embodiment; Figure 11 is a schematic view of the display provided by the diary assistant shown in Figure 2 according to a third embodiment, Figure 12 is a block diagram of the diary entry process according to a third embodiment; Figure 13 is a schematic view of the display provided by the diary assistant shown in Figure 2 according to a fourth embodiment; Figure 14 is a schematic diagram showing an arrangement of diary assistants according to a fifth embodiment, together with a graphical display of a host diary preference function according to the fifth embodiment; Figures 15a and 15b are, in combination, parts of a flow diagram of a negotiation process of the fifth embodiment; Figure 16 is a block diagram illustrating operation of the email assistant shown in Figure 2; n -rrc mmnr~ia l l;11-*;xi;,7r WO 00/26828 PCT/GB99/03605 6 Figure 17a is a schematic diagram showing internals of a Bayes net arrangement forming part of the apparatus shown in Figure 16; Figure 17b is a schematic diagram showing a Bayes net for prioritising incoming emails according to address information; Figure 17c is a schematic diagram showing a Bayes net for prioritising emails according to user's past preferences for reading previously received emails; Figure 18 is a block diagram illustrating a process for ranking emails according to the importance of their subject field to the user; Figure 19 is a block diagram of a process for monitoring the computer users past preferences for reading previously received emails; Figure 20 illustrates schematically means of alerting the user that an email has arrived, in accordance with the invention; Figure 20 is a schematic block diagram showing implementation features relating to the email assistant shown in Figure Figure 22 is a flow diagram for controlling answering of incoming telephone calls, illustrating operation of the telephone assistant shown in Figure 2; Figure 23a is a block diagram illustrating a tree Bayes net used to calculate a priority associated with each caller; Figure 23b is a block diagram illustrating a further Bayes net, which takes as inputs the outputs from Figure 23a, together with information relating to user activities; Figure 24 is a schematic view of the display provided by the telephone assistant; Figure 25 is a schematic block diagram showing implementation features relating to the telephone assistant shown in Figure 2; Figure 26 is a graph of the output of the video camera providing the imaging device shown in Figure 1; Figure 27 is a schematic flow diagram of a process performed by the multimodal interface shown in Figure 2; Figure 28 is a schematic diagram of various user states detected by the process shown in Figure 22; WO 00/26828 PCT/GB99/03605 7 Figure 29 is a block diagram illustrating a process for ranking the stress level of the computer user; and Figure 30 is a block diagram showing means for detecting use of low level inputs for monitoring stress levels according to the process shown in Figure 29.

Overview Figure 1 shows a generally conventional computer system 100 that comprises: a conventional keyboard 101; a display screen 103, such as a CRT or plasma screen; a mouse 105; a processor 107 such as a Pentium 'M processor; random access memory 109; a hard disc drive 111; an audio input 113 such as a microphone to detect utterances from the user; an imaging device 114, such as a gaze tracker or video camera; and input/output interfaces 115 to connect the workstation to a local area network (LAN) and wider area networks (WAN) such as the internet, to facilitate data exchange including email messaging with remote users connected to such networks.

The interface 115 also allows control of a plain old telephone set (POTS) and the components shown in Figure 1 are interconnected by a common bus 117. In addition to the single system configuration shown in Figure 1, several computer systems (not shown) may be interconnected over a local area network via the input/output interface 115.

In a conventional manner, the processor 107 runs programs held on hard disc memory 111, making use of RAM 109, under the control of keyboard 101 and mouse 105, together with imaging device 114 to provide data on the display 103. Audio inputs can be made through the audio input 113 for use by speech recognition software. The arrangement can thus provide the usual database, word-processing and spreadsheet functionality associated with a personal computer by the use of conventional software packages stored on the hard disc memory 111. Access to a printer (not shown) may be provided.

Referring also to Figure 2, apparatus 305 for co-ordinating tasks to be executed by a computer system 100 may be stored on the hard disc drive 111 for processing by WO 00/26828 PCT/GB99/03605 8 the processor 107. The apparatus 305 may be part of an intelligent assistant system 219 which enables users to devote their time to highly complex tasks while the system 219 takes some decisions on behalf of the user based on previous observations of the user, thus enabling the user to increase productivity. Typical tasks to be performed by the system include time, information and communication management. When the computer system comprises several computer workstations, interconnected via the input/output interface 115, several intelligent assistant systems 219 may be active and may communicate with one another.

In the context of the present invention, a "user" is not necessarily limited to a human entity, as it might well be another piece of equipment or a software agent.

As shown in Figure 2, such a system 219 may additionally comprise a set of autonomous systems 201, 203, 205, 207, 209, 211, generally referred to as agents or assistants, specialising in various tasks such as diary management, telephone call filtering and email prioritisation, web search and telephone directory enquiry: 0 System 211 comprises a diary assistant, which, as will be explained in more detail later, assists the user to make diary entries using fuzzy reasoning techniques; e System 209 comprises a multi-modal interface to facilitate entry of data in a number of modalities. The module 209 may be configured as described in British Telecom Technical Journal (BTTJ) Vol. 16, No. 3, July 1998, K. C. Tsui et al, "Intelligent Multimodal Systems, pp 134-144.

0 System 247 comprises a database that may contain names and contact details of associates of the user, along with a user profile comprising user preference parameters, which can be accessed by the other systems 201, 203, 205, 207, 209, 211; System 203 comprises an assistant for interrogating and processing data from a classified telephone directory service such as Talking Pages as described in more detail in British Telecom Technical Journal (BTTJ) Vol. 16, No. 3, July 1998, "YPA An Intelligent Director Enquiry Assistant" A. De Roeck et al pp 145-155; ~nmar,~:lrrllllx iisr!inrrn lilullr i. lirmrr-l- -riri7nrin-ir 1 llnl i lrr il 1 i lrul mnnrl* rwrrrmml,3~;~,nmm--n~ nri~ r~d~a~iluluunuurra~i~i~u~L~ WO 00/26828 PCT/GB99/03605 9 SSystem 201 comprises a web assistant for browsing the World Wide Web.

The web assistant develops an interest model of the users interests and preferences, using intelligent reasoning techniques. This is described in more detail in British Telecom Technical Journal (BTTJ) Vol. 16, No. 3, July 1998, "The Personalisation of Agent Services" S. Soltysiak et al pp 110-117; System 205 comprises an email assistant for determining whether incoming email warrants immediate attention or can be reviewed at a later date; System 207 comprises a telephone assistant, which determines whether a call should be answered immediately, or whether the call may be postponed to a later time or date.

Each agent has its own interface and interacts with the user in its own particular way, and the agents communicate with one another by message passing. These agents are essentially reactive agents that respond to events in the user's environment (such as emails and telephone calls) by initiating interactions with the user, and all of the agents make use of intelligent reasoning computing techniques in order to provide enhanced assistance to the user.

Co-ordinator Co-ordination of information in the form of inter-agent collaboration has been presented as a feature of many known systems such as the ZEUS system discussed above, and the present system 219 similarly performs such interactions (albeit that the implementation of collaboration is different). However, system 219 additionally provides co-ordination of the presentation of information to the user, which involves considering the constraints of an additional entity, the user (although the entity may be another agent, or process). In general, after an agent has completed its task, its next course of action will be to present the corresponding task results to the user.

However, in the absence of some means of controlling when these results are presented, the user may be overloaded with information from many agents simultaneously. Thus co-ordination of agent information is necessary to avoid increasing the cognitive load on the user. This co-ordination typically includes WO 00/26828 PCT/GB99/03605 managing the interaction between the agents and the user; performing tasks on behalf of the user that requires the action of more than one agent; and scheduling actions to be performed at appropriate times. This therefore involves receiving task information from other agents, processing the task information into executable system actions, such as the action of allowing an agent to display information to the user, and maintaining a temporal database of these system actions. Although the system disclosed in patent application W099105597 (described above) is able to schedule and re-schedule tasks, the issue of scheduling presentation of task information to the user so as to avoid a communication overload at any one time is not addressed.

The apparatus 305 may be a co-ordinating agent having a three-tier architecture (reactive deliberative meta-reasoning) capable of planning, scheduling and subsequently executing its own future actions, and it is distinguished from the other reactive agents 201, 203, 205, 207, 209 described above by virtue of this scheduling capability. Thus the co-ordinating agent, hereinafter referred to as a 'coordinator', is generally descriptive of the apparatus 305 as a first embodiment of the co-ordinator.

The co-ordinator 305 functions under the control of means 403, which may be provided by Java threads, although it is understood that that the use of Java is inessential to the co-ordinator and that any other method of concurrently running multiple processes would provide the means 403. Java is a good choice of language for developing multi-agent applications because of its object-oriented and multithreaded characteristics, enabling each agent to comprise many objects and several threads. It also has the advantage of being portable across operating systems, as well as providing a rich set of class libraries that include excellent network communication facilities.

Thus referring to Figure 3, the first embodiment provides a co-ordinator 305 for coordinating tasks to be executed by the computer system 100, including scheduling means 307 to schedule and/or reschedule tasks and execution means 309 to effect ~mnilanm~Elr~~ nnnlun~lounlr illrm~nnn l;rlrliu;ril ~mriL;illn~;r lm:rrmm*vm:unllmnnrrn 31~ lon l*17?~o*n nrInn~~rrrr:n l nrnnrsr l~:nnll Illn nnam*lnrm, Int rnrrlrmnnulrr7nl- ilunm, lrrr nn rl.lrl r~r no ilriii i -I;iu* ii~ rr ,lr~r; iimirlu Illi~ilhin~lmc~t~c~t~c~t~c~t~c~t~a~ WO 00/26828 PCT/GB99/03605 11 execution of the same. The co-ordinator 305 is operable to receive task information 311 and to maintain a temporal record 315 of the schedule of the tasks, such that when a change is made to a task or a new task is sent to the co-ordinator 305, it 305 informs the scheduling means 307 and updates the temporal record 315 accordingly. The co-ordinator 305 also includes a library 323 of task plans, each of which task plans includes a pre-specified action list actionable to perform a corresponding task. The user can explicitly specify an interruption status for allowing or otherwise interruptions to the user, and this may be input to the co-ordinator as task information 311. Typically, the interruption status includes information as to whether the user will accept or refuse interruptions (from, for example telephone calls and email notifications) and the co-ordinator 305 includes a simple interface allowing the user to set these preferences.

The co-ordinator 305 also includes a world model 313, which world model 313 comprises a diary of user tasks and the interruption status, and is accessed by the co-ordinator 305 when scheduling tasks and updating the temporal record 315.

When the co-ordinator 305 forms part of the intelligent assistant system 219, which 219 includes a diary assistant 211 as one of the intelligent agents, the world model 313 replicates the information stored by the diary assistant 211. The world model 313 may store the diary of user tasks as a list of tasks, and each task has a timeslot associated therewith. Each timeslot is defined by a start time and a duration, and when the task information 311 includes, for example, a request to supply information to the user, the scheduling means 307 schedules execution of the request to occur in a free timeslot of the world model 313. If the request involves a task to be performed by the co-ordinator 305 and/or other agents, the timeslot duration may be implicit in the task when scheduled, and this may be used to update the temporal record 315, together with the time that the task was initiated. In practice, if the request is to display information to the user and if the current timeslot is not free, the co-ordinator 305 will either not attempt to schedule the task, and refuse the request, or will schedule the task for a free timeslot in the future, having regard to the world model 313, and the corresponding executable task will be output from the co-ordinator 305 at that time. In the first situation the source of the request will have to re-initiate the WO 00/26828 PCT/GB99/036 0 12 request at a later time. In the second situation and the first situation when the current timeslot is free, the corresponding executable task may simply be communication between the co-ordinator 305 and the source of the request to permit the source to communicate with the user.

Java threads 417, 419, 421, shown in Figure 4, are operable to concurrently execute a plurality of processes, each of which is responsible for executing various processes comprising the co-ordinator 305. When the co-ordinator 305 receives task information 311, a first Java thread 417 translates this into a system goal 427, and retrieves a corresponding plan 429 from the plan library 323. This plan 429 consists of a set of action templates for achieving a particular goal, and the thread 417 is required to instantiate 431 the action template in order to form an executable task using parameters supplied with the goal 427. The task information 311 may include parameters such as a deadline time, which is transferred to the system goal 427, and is then used in conjunction with the action template to specify execution times and a corresponding executable task 433 by the scheduling means 307.

Two types of deadlines may be specified: "as soon as possible", and "as late as possible before the deadline". The goal 427 may have been filtered by a filter (not shown), which is specified by a set of meta-rules and whose job is to select only those tasks that are desirable and are believed to be achievable by the co-ordinator 305. The scheduling means 307 schedules tasks based on the preferred type of scheduling ("as soon as possible", or "as late as possible before the deadline"), taking into account, by consulting the world model 313, other tasks to be executed.

Once an action has been scheduled, the temporal record 315, which is a list of active tasks to be performed by the whole system 219, is updated.

Once a task has been processed into an executable task 433 as described above, a second thread 419 picks up the task. The second Java thread 419 repeatedly checks 435 to see whether a task needs executing, and if there is a task to be executed, the execution means 309 passes the information required to execute the task from the co-ordinator 305, as shown in Figures 3 and 4. The second thread 419 may run WO 00/26828 PCT/GB99/03605 13 every 15 seconds to check whether tasks need executing, and is capable of retrieving one task in each cycle. If a series of tasks have been retrieved in successive cycles, the tasks are executed sequentially depending on the order in which they were retrieved.

A third Java thread 421 processes the updating of new task information 311, which includes maintaining the world record 313 of the user's activities. This is achieved in part by checking every second for new task information 311, which includes checking for the interruption status information, and by interfacing with the first and second threads 417, 419. New task information 311 may effect deletion of any goals no longer required (corresponding to new information task 311) and scheduling of a replacement (if applicable), or of a new goal. This is shown in Figure 4 as a feedback path 439, containing task information 311, to the first thread 417.

The co-ordinator 305 may also include means for storing user preference 303, which user preference, in the case of the co-ordinator 305, may include preferred times for performing various tasks, thus enabling the co-ordinator 305 to schedule actions in response to various system goals (such as issuing reminders to read low priority emails). In terms of the standard three-tier agent architecture described above, the task information 311 forms part of the reactive layer; the world model 313, scheduling means 307, goals 427, plan library 323 and execution means 309 form part of the deliberative layer; and the stored user preference 303 and temporal record 315 form part of the meta-reasoning layer.

As described above, the co-ordinator 305 is also operable to manage interactions between the user and the intelligent assistant system 219. Thus, when the system 219 includes a plurality of intelligent agents 201, 203, 205, 207, 209, 211, the co-ordinator 305 interacts with the intelligent agents so as to schedule presentation of their information to the user, taking into account the interruption status, such as "will not accept any interruptions". This is shown schematically in Figure 2, and the intelligent agents may include at least some of a diary assistant, an email assistant, a Web assistant and a yellow pages assistant. When the system 219 WO 00/26828 PCT/GB99/03605 14 includes the diary assistant 211, this is used to re-set the interruption status every minutes, so that if the user has forgotten to re-set the status to "active" (i.e."will accept interruptions"), the system 219 takes control and allows interruptions from events such as meeting reminders etc. Clearly the user can override this automatic switch if desired.

As can be appreciated from the foregoing description, the co-ordinator 305 is not a centralised controller for the system 219. Although the co-ordinator 305 can request the agents 201, 203, 205, 207, 209, 211 to effect execution 309 of the tasks passed from the co-ordinator 305, the agents may not perform these tasks. The agents communicate with each other using the Zeus Open Messaging Architecture (detailed in footnote and they 201, 203, 205, 207, 209, 211 operate mostly under the operation of the user, although as described above, notification of information to the user is routed through the co-ordinator 305 as shown in Figure 2 by the squares 241. In Figure 2, the ellipses 243 represent requests from the coordinator 305 to the agents, and may correspond to the information for effecting task execution 309. The diamonds 245 represent a record of the user's preferences or interests, having been extracted from a database 247 containing user profile data.

Thus the agents 201, 203 linked to the diamonds 245 may be web and yellow pages assistants.

Figure 5 of the accompanying drawings shows apparatus for co-ordinating tasks to be executed by a computer system according to a second embodiment of the coordinator generally similar to that of Figures 3 and 4 in which like parts have been given like reference numerals and will not be described further in detail. The second embodiment includes a co-ordinator 305 for co-ordinating tasks to be executed by the computer system 100, but the world model 313 functionality is provided by the diary assistant 211, which stores the user tasks as a list of tasks. As described with reference to the first embodiment, the task information 311 may include, for example, a request to supply information to the user, in which case the execution means 309 will send an execution task to the diary assistant 211, and the diary assistant will schedule execution of the request to occur in a free time of the user's o ar ~n n~n.nmn .luml l~~a m *.nrn i nr r~ r~~n~lrllmn~i i~i~~m -rululrnr~~ WO 00/26828 PCT/GB99/03605 diary. The manner in which such tasks may be scheduled by the diary assistant 211 is described in detail later in the description.

The following presents two scenarios to illustrate the two embodiments of the coordinator in operation. The first is a lunch booking entered into the diary by the user, together with a non-interruptible one-hour meeting starting at noon, and the second is a booking entered into the diary to arrange a holiday at a particular, prearranged time in the future.

Lunch Booking: The diary agent 211, forming one of the intelligent agents, sends a message to the co-ordinator 305, represented as a new information task 311 in Figure 3, describing the lunch booking and meeting. The information task 311 includes parameters relevant to the same, which for this case include a deadline of 5 minutes before the end of the meeting, and details of the person with whom he would be lunching. This 311 is translated into a goal 427, and the appropriate plan 429 is retrieved from the plan library 323. A typical plan 429 for such a scenario may include a yellow pages search for a restaurant; finding the web page of the person having lunch with the user; and reminding the user of the lunch appointment. The scheduling means 307 then specifies a corresponding executable task 433, which may be passed to the execution means 309, and includes an action on the co-ordinator 305 to cause the appropriate agents to process their respective actions (in this case via ellipses 243 to web and yellow pages assistants 201, 203). The following code fragments describe these processes: //basic goal reduction planner Goal GoalList.getGoal 0; If (Goal NULL) Plan Plnibrary.f etchPlan(Goal); Plan =PlanLibrary.fetchPlanl(Goal); WIWt ~YIIRWfp~rmirIml rmlmiam:lcr:l:r la~~y~i rrrmanlnnla~mrr rrrusi~n~L~~R n~ nulnr l l Il:nnu~mrirr ll-s~I~,ru.*rr r~-~L71 .r~mismnsnn Irr~*m~. ;---~,l-n~Pnilu~~m_~armr~c WO 00/26828 PCT/GB99/03605 16 If (Plan NULL) Scheduler.schedule (Goal, Plan); Goal.setStatus (REDUCED); //assumes that now is the current time Task TaskList.getTask (now); While (Task NULL) executeTask (Task); Task.setStatus (COMPLETED); Task TaskList.getTask (now); When the agents 201, 203 have finished searching, they have to notify the user of the results. This is routed via the co-ordinator 305, shown by squares 41 on Figure 3, in order to determine whether the user is able to accept interrupts. The coordinator 305 accesses the world model 313, which includes details of all of the user's current and future tasks and the interruption status, in order to anticipate a next available timeslot to interrupt the user with the information. Once a timeslot has been ascertained, the co-ordinator 305 may pass an information task 311, including the ascertained time as a parameter, to the scheduling means 307 and this is scheduled in with other user's tasks in the manner described above (goal 427 plan 429 instantiate 431 and schedule 433 send to execute 309 by another agent if required).

Holiday Booking ~WIA "O~e ~mtlrrnm~narrr lr mm ull TVm~lr WO 00/26828 PCT/GB99/03605 17 The user makes an entry using the diary assistant 211, forming one of the intelligent agents. The user thus makes a diary entry to arrange a holiday at a particular, pre-arranged time in the future. Prior to this diary entry, the co-ordinator 305 will ensure that appropriate data is collated and entered into the diary so that the user can successfully request a diary instruction. Thus the user is prompted to enter into the diary an instruction "holiday" which prompts the user for a desired holiday destination.

The diary assistant 211 sends a message to the co-ordinator 305, represented as a new information task 311 in Figure 3, describing the holiday. This 311 is translated into a goal 427, and the appropriate plan 429 is retrieved from the plan library 323.

A typical plan 429 for such a scenario may include a yellow pages search for a travel agent and finding the web page of the corresponding agents. The scheduling means 307 then specifies a corresponding executable task 433, which may be passed to the execution means 309, and includes an action on the co-ordinator 305 to cause the appropriate agents to process their respective actions In this case, the schedule involves the use of the classified directory assistant 203 and the web assistant 201. The execution means 309 thus instructs the assistants 203, 201 to carry out tasks to obtain data relevant to the holiday.

The directory assistant 203 is instructed to obtain data from travel agents listed in classified directories that offer deals relating to the desired holiday destination. The web assistant 201 is similarly instructed to surf the web to find corresponding information on the internet. Thus, the names and telephone numbers, and possibly other information, of travel agents that offer an appropriate service are obtained.

When the agents 201, 203 have finished searching, they have to notify the user of the results. The data obtained by the directory and web assistants 203, 201 is sent to the co-ordinator 305 as new task information 311. This is translated into a goal 427, having a plan 429 associated therewith, which in this case includes sending a message to the diary to display the results. The execution means 309 thus sends the data to the diary entry slot in the diary operated by ~3w~ I WO 00/26828 PCT/GB99/03605 18 diary assistant 211 for scheduling therein. Thus, at the time dictated by an appropriate diary entry, the user is presented with suitable data to enable telephone calls to be made to travel agents in order to arrange the holiday.

Thus, the co-ordinator 305 lifts the burden of many of the steps of arranging a holiday from the user by making reference to a previously defined plan and carrying out a schedule of tasks in accordance with the plan. It will be understood that a number of different plans can be held in the plan library 323 to execute different tasks which may involve other of the assistants shown in Figure 2.

The co-ordinator thus extends existing agent systems to include temporally specific goals and intentions, and specifically includes apparatus for scheduling and coordinating the presentation of information from system agents to the user. The apparatus may include a system that both maintains a temporal world model of the system tasks and schedules interruptions to the user, or it may include a system for maintaining a temporal record of system tasks separate from, but interactive with, a system that schedules interactions with the user. In both embodiments described above, the apparatus is capable of rescheduling actions in responses to changes in the system tasks.

Diary Assistant Apparatus for allocating time to an event may generally be a software agent known as a diary atsistant. The diary assistant 211 uses fuzzy reasoning and scheduling techniques to assist the user in managing a diary so that the user does not have to specifically select a particular diary slot.

There are a number of embodiments of the diary assistant, the first of which enables a single diary entry to be scheduled over a single day, and may be referred to as a local mode of diary entry. When the user invokes the diary, a diary screen is displayed on the display 103, as shown in Figure 7. This may be achieved either by typing an appropriate command at the command m~ rrl~l I I nn rrl r ~n:l~orn:uI an-lni rP:arr~r* ,a:rrl v~ll~;i!nrrrPmrur~lr WO 00/26828 PCT/GB99/03605 19 prompt or by activating the diary icon displayed on the screen 103, which icon forms part of the assistant software suite.

Referring to Figure 7, the diary screen displays each day as contiguous diary slots of a half-hour duration. As shown in Figure 6, the user is prompted to specify details of the diary entry i.e. narrative, in window 605 when the user selects an appropriate menu option from the diary screen. This may be entered via the multi-modal interface 209 e.g. by using the keyboard or selected from the list provided at 604.The preferred duration of the event to be scheduled is entered at window 603, which duration may be entered as a fuzzy entry. For example, when the event is a meeting, and if the user types "around 1 hour" into entry box 603, the diary assistant can apply a corresponding fuzzy function when scheduling the meeting into the diary.

Examples of typical fuzzy functions that may be applied for an input of "around 1 hour" may include: Sa triangular function that peaks with a value of 1 for durations of 1 hour, and tails either side to a value of 0.3 for durations of 30 minutes and 1 hour 30 minutes (where "around 1 hour" means "Meeting to take anything between 30 minutes and 1 hour 30 minutes"); a trapezoidal function that has a value of 0 for all durations less than 1 hour; a value of 1 for durations between 1 hour and 1 hour 15 minutes; then tails off to a value of 0.3 at 1 hour 30 minutes (where "around 1 hour" means "Meeting to take at least one hour, preferably not longer").

The user may set a desired fuzzy function, depending on the type of meeting.

The user is also prompted to indicate in window 607 whether the event described in window 605 is interruptible or not i.e. whether the user does not want to be disturbed during the duration of the diary entry, e.g. during an important meeting. These parameters defining the diary entry may be described as constraints of the entry.

slin~nl~ri~iinl~l. Il*srr~nrunrnn WO 00/26828 PCT/GB99/03605 A Mouse cursor (not shown) can be used to enter a preferred start time for the diary entry in window 601.

When the cursor is moved onto window 601, a further window 609 is displayed, allowing the user either to choose one of a number of fuzzy definitions for the start time of the meeting or to type the start time, or fuzzy definition explicitly. In this example, the user can operate the mouse to choose early morning 611, late morning 613, afternoon 615. When the user enters a time in window 617, the diary assistant can seek a diary slot generally around the entered time.

In the following description, it will be assumed that the "early morning" time 611 has been selected and that the local mode is operative for Wednesday as shown in Figure 7. The early morning window 611 has an associated fuzzy function shown in Figure 8. For the early morning selection, the diary assistant assumes that time slots from 8.00 am to 9.30 are within range and each of them is given a fuzzy ranking between 0 and 1. The time slot of 8.30 am is preferred and is given fuzzy ranking 1. The time slot of 8.00 am is next preferred and given a ranking of 0.75. This is followed in preference by the 9.00 am time slot which is given a ranking of 0.5 and the time slot of 9.30 am is least preferred, with a ranking of 0.25.

It will be understood that the fuzzy rankings shown in Figure 8 are only one example of different values that can be used. Generally the values may be defined by a function which has a peak at the most desirable time and tails which decrease on either side, towards zero. For example a triangular function could be used, with a peak at the most preferred time and straight line slopes to zero on either side, with a total timewidth of two hours.

Alternatively a trapezoidal function, or functions having a mixture of a flat portion, a slope and a peak could be used to define the fuzzy rankings.

m .nn r Irrr*r~m~nl .inl.i~R~iT-l.r*~ I II.I U~I 'lil~lil~*. .~l~rrm~mn.

WO 00/26828 PCT/GB99/03605 21 Certain time slots may already be filled with previous diary entries and so the diary assistant seeks to find the most preferred free entry according to the fuzzy rankings. This will now be described with reference to Figure 9.

S9.1 The assistant 211 reviews the time slots within the preference range set by the table shown in Figure 8. It will be understood that some of the time slots may have already been taken by previous diary entries; SS9.2 The assistant 211 decodes the selection into dates or periods within the system diary and attempts to make the diary entry according to the fuzzy rankings of Figure 8. This is achieved by initially inserting the new task into a space according to the order of preference shown in Figure 8, which may include moving tasks already scheduled into the diary. If suitable time slots are available, this merely involves selecting the available time slots according to the order of preference shown in Figure 8. However, if sufficient time slots are not available, the assistant 211 makes use of an iterative improvement algorithm in order to review the previously entered diary items and their fuzzy rankings in order to determine whether they can be shunted, without changing their order so as to open a sufficient span of time slots to allow the new diary entry to be inserted. A suitable iterative improvement algorithm is described in "Artificial Intelligence A Modern Approach" by S. Russell and P. Norvig, Prentice Hall, USA pp 111 113. The fact that both the duration and start times of the events are described by fuzzy functions provides considerable flexibility in scheduling diary entries.

S9.3 The result of running the algorithm is reviewed. If successful, the new diary entry is entered into appropriate time slots at step S9.4 and the previous diary entries are, if necessary, shunted, without changing their order to accommodate the new diary entry. Alternatively, if the outcome of running the algorithm at step S9.2 is unsuccessful, the diary entry is not made and is instead entered on a "To Do" list at step S9.5 of Figure 9.

i i- WO 00/26828 PCT/GB99/03605 22 The following code fragments describe the specific implementation of the iterative improvement method described at step S9.2: Schedule(Allocation A) N neighbouring solution states of A; N is a set of allocations neighbouring A (reachable by a single transformation step)// if (N indicates that there are no neighbouring states that satisfy the scheduling constraints// return A else A' best state in N; is the element of N with the highest score// if (score(A') score(A)) score returns a number between 0 and 1 according to a predetermined fuzzy function// return A else return Schedule(A') It will be understood that the late morning and afternoon windows 613, 615 have associated fuzzy ranking tables that correspond to the table of Figure 8, but for the late morning and afternoon respectively.

As regards the "around" window 617, a fuzzy ranking table is provided which defines fuzzy rankings in a time window around the entered time.

Thus, the time slot which includes the entered time has the highest fuzzy W nl-lu.llr .n~osl~smr llurrn lin, 14ll*mu l lunl y~~l !na~*n rra 3 .r!.mnmr l Ir .r~~inrn WO 00/26828 PCT/GB99/03605 23 ranking and time slots further away from this have progressively lower fuzzy rankings.

The previously described embodiment constitutes a local mode of operation of the diary assistant, in which a single diary entry is made on a particular day. A second embodiment of the diary assistant enables multiple diary entries to be scheduled over several days, and may be referred to as a global mode of diary entry. The global mode may be used to schedule a set of partially scheduled and unscheduled tasks, which may, for example, be tasks on the 'To Do' list discussed above, or tasks which have been placed on the diary, some of which may have been entered at 'fixed' times. In the case of selecting tasks to be scheduled from the 'To-Do' list, the user may indicate the tasks that are required to be scheduled, while tasks that are 'fixed' at a particular time may be so indicated by double clicking on the diary entry in the diary. These 'fixed' diary entries will not be shunted around when the diary assistant performs its scheduling.

In this mode of operation, scheduling of multiple tasks may be performed over a plurality of days. When these tasks are entered into the diary, the user can operate the mouse to enter early or late in the week in the window 601 as described above, or alternatively a date range may be selected (not shown).

This then provides the fuzzy parameters to be used in the global mode.

Referring to Figure 10, these may be used to find an appropriate slot in a day as follows: S10.1 The system may start with a partial schedule for tasks that have been entered into the diary by the user, and are 'fixed' this is retrieved, along with the tasks selected from the 'TO-DO' list; S10.2 The assistant 211 orders all of the tasks to be scheduled according to their constraints. Thus the most constrained tasks, such as those that are limited to a specific start time, appear first, and the least constrained tasks appear last, where a measure of the degree of constraint may be the number l:I.l nor- Il.p r*ril~n~ii, I**a II inlnlrmnn.il~n~..v Ivrlrol-..nnnrilrurmu~s~en~mrr*~,~,,~~n FElumllmli~m~ ifinnn... nr-ll~na~-- WO 00/26828 PCT/GB99/03605 24 of possible slots that could be assigned to a task. Thus, a preference of a Monday morning task is more constrained than a Monday task, which is more constrained than an early week task.

S10.3 Once the tasks are in order, they are scheduled one by one, following the above order. The search applied to schedule the tasks may be a standard "depth-first with backtracking" method, such as is described in "Artificial Intelligence A Modern Approach", supra pp. 77 78, in which tasks are assigned timeslots in order, and in the event of not reaching a solution, the search backtracks to an earlier point and tries an alternative timeslot.

The following code fragments describe the specific implementation of the depthfirst method used in step S10.3: Schedule(TaskSet T, Allocation A) if indicates that there are no free timeslots in the allocation that satisfy the user preference scheduling constraints// return A; %success else t first(T); T rest(T); p user preference for t; S free timeslots in A satisfying p; if (5 0) return null; backtrack If S returns with no free timeslots to satisfy the first task t, which (first task t) is determined by the order generated at step 510.2, the procedure returns ("backtracks") to try another set of conditions that will satisfy the preferences of this task// else WO 00/26828 PCT/GB99/03605 repeat s first(S); S =rest(S); A' Schedule(T, A union until null) or return A' //This takes each of the tasks in order, (where the order has been set by step 510.2 above) and schedules them one at a time. If a time cannot be found that satisfies the preferences of the task in question, the procedure will return a pointer to the task and will "backtrack" in order to find a time that will satisfy the preferences. When all of the tasks have been scheduled the procedure returns.// The global mode is thus directed towards satisfying all preferences accompanying the tasks to be scheduled and the assistant tries to allocate timeslots that best match the preferences.

A third embodiment of the diary assistant is concerned with "roughly scheduling" tasks over a month, week, day or hour (local or global). "Roughly scheduling" means that the diary is not required to allocate a specific time to the entry, but is instead required to assess the availability of suitable time periods for completing whichever task corresponds to the entry. As an example of an entry that may utilise this embodiment, a user may enter "complete an 18 hour task by the end of this week" into the diary on a Monday morning. All the user wishes to know is whether, within the constraints of the fixed diary entries entered using the first and second embodiments described above, there are sufficient time periods (in this example the time period is 18 hours) available for this task to be completed.

Preferably the diary will inform the user as the number of available periods reduces, and the diary will maintain a "To-do" list detailing which tasks have the "roughly scheduled" status.

WO 00/26828 PCT/GB99/03605 26 In this embodiment, the diary screen displays time as contiguous diary slots that are commensurate with the scale of time period for which the event is to be roughly scheduled. Thus if a task requires to be completed in a week, the diary may display weeks within a month, while if a task requires to be completed in a day, the diary may display days within a week (not shown).

Referring to Figure 11, the user interface accompanying this diary entry is a modified version of that shown in Figure 6. The user may select one of several such user interfaces to enter the task, where each corresponds to an approximate duration of the task to be completed (order of hours, days, weeks etc.). Figure 11 shows a diary entry screen corresponding to a task that is estimated to take several days, and thus the options available in window 1101 allow a user to select from periods of several days in a week.

As described with reference to the first embodiment, the entry screen has a set of fields 1101 to 1115 which the user selects. In a first field 1101, the user may enter a preferred time to perform the task, either selecting from several possible selections such as "early in week" 1103, "middle of week" 1105, "end of week" 1107, or explicitly entering the preferred time into the first field 1101.

In second and third fields 1113,1111, the user may also enter a preferred duration and deadlines such as "by the end of this week". The preferred duration entered in the second field 1113 may be fuzzy as for the first embodiment. In a fourth field 1115, the user may enter a description of the task, such as meeting, admin, lunch etc.

The diary decodes the selection into dates or periods within the system diary and applies a fuzzy logic function, which may be similar to that described with reference to Figure 8, thereto, the maximum of which coincides with this selection (as described with reference to the first embodiment). Clearly the time periods in this embodiment may vary from 30 minutes (for example "I must send an email to A by Friday, duration of writing email is approximately 30 mins"), to WO 00/26828 PCT/GB99/03605 27 the 18 hour task described above, or longer still, as dictated by the duration box 1113. The user may also enter a description of the task into a fourth field 1115.

Thus in operation, and with reference to Figure 12, the "rough scheduling" procedure comprises the following steps: SS12.1 User enters fuzzy definitions in the first and second fields 1101 and 1113, together with a deadline time into third field 1111 and a task description into the fourth field 1115; S12.2 Diary assistant 211 assesses the availability of potential time periods that would satisfy the task requirement. This may include starting at the deadline time displayed in the diary entry screen, and working backwards therefrom, scheduling all of the tasks that are both on the "To-Do" list and are fixed in time, as described above with reference to the first and second embodiments. This may then be followed by an assessment of capacity, realised, for example, by summing the durations of these allocated diary entries in the potential time periods, subtracting the summation from the potential time periods to give a free period, and comparing the free period with the duration of the diary entry. Clearly, for a task of, say, multiple hours, this method may result in the task being split over non-continuous time slots in the diary (for example: 2 hours free on Friday, but the 2 hours are 2 x 1 hour slots either side of a meeting which is fixed); S12.3 As new entries are entered according to the first and second embodiments, the assessment at S12.2 may be repeated in order to continually assess the number of potential time periods available to the user; S12.4 If the number of available rough time periods falls below a predetermined number, the user may be informed by the diary, by a series of warnings.

Thus, for the above example of roughly scheduling an 18 hour task, which had been entered into the diary as "later in the week", deadline of "by the end of this week", duration 18 hours, there may be several times available which meet these requirements. However, by Wednesday of that week, with a potential influx of WO 00/26828 PCT/GB99/03605 28 new scheduled tasks according to the first and second embodiments, there may be very few times available.

The diary assistant 211 may be operable to automatically reduce the time allocated to one of these roughly scheduled tasks at various stages of completion thereof. The user may highlight the task in question on the rough "To-do" list described above in order to indicate that he has started working on that task.

This may cause the diary to start a system clock against this time. Once the user has finished working on the task, and he communicates this to the diary via the "To-do" list, the clock stops. Depending on how much time that the user has spent on that task, the diary assistant may re-compute the availability of potential time periods that would satisfy the task requirement, (where the task requirement has been modified according to the time calculated by the system).

The three embodiments described above demonstrate the flexibility of the diary assistant to accommodate a range of scheduling requirements. In practice human beings often categorise tasks according to whether they are required to be done at a specific time (obvious start time and deadline), or whether they should be done by a certain time, for example to fit within project parameters, or other people's schedules. Thus the combination of the first, second and third embodiments allow these different scheduling constraints over a range of time scales without the specific need to look for a particular vacant diary slot.

The above embodiments assume that the tasks to be scheduled are independent of each other. In practice, however, several tasks may be inter-related for example a presentation scheduled as a Monday task at 4 pm may include diary entries for preparing for the presentation along with writing a paper to be distributed at the presentation. The tasks would, in the embodiments described above, be entered as separate diary entries, and if, for example, the date and/or time of the presentation changed, the entries corresponding to preparation of the paper and presentation material would require moving manually if the original inter-task time is to be preserved.

WO 00/26828 PCT/GB99/03605 29 A fourth embodiment of the diary assistant allows the user to specify constraints between tasks, which may be referred to as inter-task constraints, at the time of entering the tasks into the diary. This is effected by means of a task plan 1300, shown in Figure 13 of the accompanying drawings. A task plan 1300 may include task elements, or tasks, that are directly related to one another, such as, with reference to the above example of a presentation, preparing for the presentation and writing a paper 1303, 1305. A task plan may also include task elements that are not directly related, such as attending a meeting and writing a paper, where the user wishes to explicitly relate the tasks together in some way, e.g. temporally (not shown). In the presentation example, such inter-task constraints may include the number of days between preparing for the presentation and writing the paper relative to the presentation date itself. These inter-task constraints may be accompanied by time preferences specific to each task described above for the first, second and third embodiments, such as task duration.

The relationships between tasks may be defined using a task plan editor 1304, which may be a visual programming interface such as that shown in Figure 13.

Each task may be represented as a box, for example boxes 1301, 1303, and the relationship between tasks may be defined by links 1307 and/or arrows 1309 therebetween. Arrows 1309 may be used to define a temporal precedence order between the said tasks, while links 1307 may be used to specify constraints between tasks where no direct temporal relationship exists. The links 1307 may store information describing inter-task relationships that are not precedentrelated. These may include constraints such as "at the same time of day", and are fuzzy definitions that are resolved into times on the diary according to fuzzy relationships similar to those described above with reference to Figure 8 when the diary assistant 211 processes the task plan. A link 1307 could therefore be used for tasks that can be done in any order, which in the above example of a presentation may include booking a room and ordering refreshments; although -7 WO 00/26828 PCT/GB99/03605 those tasks have to happen before the presentation itself, they can happen in parallel.

In the present embodiment, where tasks are inter-linked, typically one of the tasks acts as an anchor for the other tasks. Referring to the above example tasks of a presentation, preparing a report and preparing the presentation itself, the presentation acts as an anchor for the other tasks. Thus, with reference to Figure 13, the anchor task T1 1301 is first added to the task plan, and all other tasks are constrained by this task, either directly or indirectly. In the task plan editor 1304, this task T1 may appear red, and all other tasks may appear green, thus distinguishing the main task from other tasks. The precedence is unidirectional, as symbolically indicated by the arrows 1309. This means that if a task T3 forming a task element of a specific task plan (which includes, say, 5 tasks T1, T2, T3, T4, T5, listed in order of dependency constraint) is moved to a different time, only T4 and T5 will be re-scheduled by the diary as a result of the move. In this example, task T1 is the anchor task, and as it is higher up the inter-task hierarchy than T3, it is unaffected by the move. The dependency constraint may be given by the shortest path to the main task as dictated by the arrows, together with the links, and the order in which tasks are constrained follows a directed a-cyclic graph.

Tasks may be added to a plan via menu option 1311, which enables the user to specify a task description, either explicitly in 1317 or by selecting from a pick list 1321, a duration of task 1315, and any additional temporal constraints particular to the task in question via dialogue box 1323. Once added to the plan, the tasks may be edited, moved or deleted either by double clicking on the box in question, dragging the box around the screen, or selecting an appropriate menu option. The links 1307 and arrows 1309 may be similarly added to and edited in the task plan.

Template task plans may be created for specific task categories, such as meetings, presentations, seminars, where the core task elements characterising I??!(?'I~1III~L!(LR!III.I1Cll(le3I1 '!li I *1 *1""'~i~illlill~-~11111111 1 101111 I(IIIVIUI" WO 00/26828 PCT/GB99/03605 31 the task are standard. Thus a user can create a 'New' 'Meeting' task plan, whereupon the plan editor will invoke the elements defined in the template. The user may then edit and add to these elements to produce a customised plan as required.

Once a plan is completed, it is submitted to the diary assistant 211 for scheduling into the user's diary. Whilst editing, clearly the plan may be saved and closed without submitting it for scheduling. The scheduling procedure comprises the following steps (not shown in a Figure): S13.1 The assistant 211 orders all of the tasks elements, or tasks, according to their dependencies. Thus the most constrained tasks, such as task T1, appear first, and the least constrained tasks appear last, where a measure of the degree of constraint may be the number of possible periods that could be assigned to a task (determined by the fuzzy precedence on links 1307) together with the inter-task order (determined by the arrows 1309); S13.2 Once the tasks are in order, they are scheduled one by one, following the above order. The search applied to schedule the tasks may be a standard "depth-first with backtracking" method, described in step S10.3, in which tasks are assigned timeslots or time periods in order, such that in the event of not reaching a solution, the search backtracks to an earlier point and tries an alternative timeslot or time period.

This embodiment is thus similar to the global mode described in the second embodiment, and is directed towards optimally satisfying all precedents accompanying the task elements to be scheduled.

If, after scheduling the task plan, one of the task elements is independently edited within the diary, the diary assistant 211 will attempt to satisfy the intertask plan criteria as well as any new conditions introduced by the change. If the two conditions are incompatible, the user may be informed and prompted to review either the task plan or the most recent change. If a higher priority status WO 00/26828 PCT/GB99/03605 32 has been attributed to the overall task plan, the diary assistant 211 may ignore the independent change and retain the original schedule, informing the user of its decision. Clearly this feature is common to all embodiments of the diary assistant.

Thus for the first example given, where the date of a presentation 1301 changes, task elements of preparing for the task and writing the paper 1303, 1305 will be re-scheduled as a result of the single action of moving task 1301 corresponding to the date of the presentation itself. In other words, the task element precedence specified by the arrows 1309 enables a whole task plan to be rescheduled by moving the anchor task only.

Each task, or task element, comprising a task plan may be the responsibility of, or "owned by", one user, but the user may vary between task elements. The user who initiated the anchor task 1301 may own the task plan itself. Users having access to edit a task plan may be specified by the owner of the task plan (not shown), and the user responsible for the task element(s) may be specified in a field (not shown) in the dialogue box 1323. When each of the users has a diary assistant to manage their schedules, the diary assistant associated with the user that owns the task plan will send a message to each of the other respective users once the task plan has been completed. For each user, this message may include details of the task element(s) to be performed by the user, together with the temporal preferences specified in the "Add/Edit Task" dialog box 1323. The respective diary assistant will then attempt to schedule the task element(s) in accordance with the methods described in previous embodiments.

Referring to the example of the presentation task, the owner of the task plan may be the user giving the presentation, and this user may also be responsible for drafting the report and drafting the presentation material. However, booking a room and ordering refreshments may be the responsibility of the owner's secretary. Thus once the owner has submitted the task plan to its diary assistant for scheduling, and the owner's diary assistant has ordered the tasks according WO 00/26828 PCT/GB99/03605 33 to the dependencies within the task plan (S13.1 above), the owner's diary assistant will send a message to the secretary's diary assistant. This message will specify the task element(s) to be performed by the secretary together with the temporal conditions resulting from the ordering at S13.1, and the secretary's diary assistant will accordingly schedule a time for these task element(s).

In order to pass information between diary assistants as described above, the assistants communicate with each other using the Zeus Open Messaging Architecture. Details of this architecture may be found in 'ZEUS: An advanced tool-kit for engineering distributed multi-agent systems', Proceedings of the third International conference on Practical applications of intelligent agents and multiagent technology, 1998, 377-391.

It is understood that implementation features such as menu options, dialogue boxes, arrows, links and task boxes are inessential to the diary assistant, and that any equivalent means could be used to realise the above embodiments of the invention.

A fifth embodiment of the diary assistant applies the fuzzy and scheduling techniques disclosed in the first and second embodiments to enable meetings to be scheduled between a host and participants of the meeting. Both the host and the participants have diary assistants 211 to manage their diaries, shown in Figure 14, and it is assumed that the host diary assistant 1401 is the initiator of the meeting. Existing products, such as Microsoft Outlook Calendar, allow a host to request a meeting, but the host is required to specify an exact time, and the participant is required to manually check his or her diary before confirming or declining the offered time. The scheduling system described in "An automated meeting scheduling system that utilises user preferences", Haynes et al, Autonomous Agents 97 pp. 308-316 presents a system that includes a set of distributed agents which are designed to schedule meetings. The system is designed to be adaptive to environmental demands and user preferences, where the preferences relate to a range of parameters including accommodation, WO 00/26828 PCT/GB99/03605 34 meeting length, participants of the meeting etc. In this system the preferences are specified in relation to a threshold value, where the thresholds are unique to each user. When a user specifies a value above the threshold, this is a positive return, whereas if the user specifies a value below a threshold, this is a negative return. For example, in the case of selecting a date for a meeting, the user may set the threshold at 0.4, and return 0.25 for a Monday and 0.7 for a Friday, indicating a 'no' for Monday and a 'yes' for Friday. Messages, including suggestions of free time slots, are passed between agents using email, and the participant's scheduling system examines the preferences set by the users in the manner described above in order to return attendance possibilities.

By contrast, the diary assistant makes use of the fuzzy techniques embedded within the diary assistants to handle requests for meeting times so as to allow the host to offer a series of periods within which the meeting should be scheduled. Each series of periods may decrease in time scale, in an attempt to converge towards a mutually convenient time for the meeting. Examples of typical time scales that may be used include early in the week, specific day early in week, period within day, specific hour in period.

The procedure whereby the assistants interact in an attempt to find a mutually convenient time for the meeting is called 'negotiation', and the replies from the participant's diary assistants are called 'bids'. Thus the bids are assessed by the host diary assistant, which negotiates a time that satisfies the bids. The bids are a function of the free slots in a participant's diary, together with the participant's preference. Referring to Figure 14, the former may be extracted by the participant's diary assistant 1403 without interaction with the associated user, while the latter involves the same diary assistant 1403 asking the associated user to specify a fuzzy preference profile. The functions used to derive free timeslots may be similar to those described above in relation to the first and second embodiments, thus including an iterative improvement algorithm.

WO 00/26828 PCT/GB99/03605 As discussed with reference to passing messages between diary assistants in the fourth embodiment, the diary assistants communicate with each other using the Zeus Open Messaging Architecture.

The following steps, with reference to Figures 15a and 15b, outline the system in operation: S15.1 The host diary assistant 1401 may commence a first round of negotiations by sending a request to the participant's diary assistants 1403, which request specifies a period in the week for holding the meeting, such as "early in week"; SS15.2 Each of the participant's diary assistants 1403 consults its respective diary in order to extract all of the free time slots in the participant's diary that fall within "early in the week", and requests preferences within the early week time period. The preference may be specified by the participant as a function of days within the period: as a fuzzy function for example the participant may prefer Tuesday the most, then Monday, then Wednesday.

This may then be translated into a fuzzy function over the early week period, where the function has a maximum at Tuesday; S15.3 Preferences for each day within the early week period are then calculated as an average preference for all available time slots i.e. the participant's preferences and the free time slots are averaged, and these values are sent to the host's diary assistant 1401 as bids for the meeting; S15.4 The host's diary assistant 1401 combines each of these inputs from the participant's diary assistants 1403, in an attempt to find a day that is agreeable to all participants. The host may calculate a weighted-average of the bids, which may be achieved by weighting each of the bids by a fuzzy function specific to the host. Thus, for example, the host may specify a fuzzy function that has a maximum at Monday 1405, as shown in Figure 14, and minimum at Wednesday 1407 for the early week period, and each of the bids will be multiplied by such a function. This therefore biases the meeting to the host's preferences; WO 00/26828 PCT/GB99/03605 36 S15.5 If any of the days within the early morning period results in a zero value, the meeting may not be scheduled on this day, so that ultimately there may be no days available to schedule the meeting within the early morning period. In this case the host diary assistant may review its diary and backtrack to the closest point where there were alternatives to consider.

Ultimately, this may require recommencing the process at $15.1, sending out requests for a different period in the week. Alternatively, the host may have a list of preferred attendees, and if one of the zero bids has been generated by an attendee of minor importance, the meeting may be scheduled irrespective of his preference; S15.6 Once the host's diary assistant has returned a day that maximises the preferences of all participants, the host diary assistant starts the second round of negotiations for a time of day. This may include sending requests for bids for "early morning", "late morning", "early afternoon", etc.; S15.7 The participant's diary assistants repeat the steps described in S15.2 above, this time deriving a fuzzy function around periods in a single day.

Thus, a participant may prefer early morning the most, early afternoon next, and late morning the least. In this case the fuzzy function will have two peaks, one smaller than the other, with a trough in the middle. This will be combined with the participant's free time slots, derived by the assistant directly, and returned to the host diary assistant as the second round bid as described in S15.3; S15.8 The host diary assistant repeats step S15.4 and may again apply its own preference function for a particular time of day; S15.9 Once the host's diary assistant has returned a time of day that maximises the preferences of all participants, the host diary assistant starts the third round of negotiations for a specific time. Thus, if the host calculated a maximum preference for early in the morning, the diary assistant may send the times of 08:00, 09:00, 10:00 to the participant's diary assistants.

Alternatively, the host dairy assistant may send the prevailing time resulting from its manipulations at S15.8 to the participant's diary assistants, leaving the same to bid for times within that time of day. It is implicit that each I YIYII~~"'lnII 11(1 i 11!11! 1~1 I I I--n i 1111 1~ WO 00/26828 PCT/GB99/03605 37 assistant 'knows' what hours define these times of day, and even if there is a slight mismatch in interpretation of the hours that constitute a specific time of day, for example, "early morning", it may be assumed that there will be sufficient overlap to enable a meeting time to be scheduled; e S15.10 The participant's diary assistants repeat the step of S15.2, and returns their bids to the host's diary assistant for the time of day as described in $15.3; SS15.11 the host's diary assistant finally calculates the average of the specific time bids, preferably without applying it's own weighting function at this final stage. The time having the maximum preference is returned as the time of the meeting.

Clearly the situation described in S15.5 may occur after receiving bids for time of day and time in the day, and in these circumstances, the procedure outlined in S15.5 may be followed. Thus the host's diary assistant 1401 may backtrack to the previous point in the current level of negotiation where there were alternative times available and then try a different time. The above scenario describes three rounds of negotiations, but it is understood that the process may occur over more, or less rounds, depending on the time scale of the initial negotiation try to find a week in a month that suits all participants in the first instance).

Additional features that may affect the participant's preferences include type of meeting team meeting, 1:1 meeting, conference, which may require availability over extended periods of time), and this may be factored into the fuzzy preference function specified by the participants. When calculating the maximum preference at each round of negotiations, the host's diary assistant may test the preference against a predetermined threshold, which controls whether or not a time should be selected. In practice, this has the effect of forcing the host's diary assistant to back-track to other days in the week/periods in the day/time in period, depending on at what stage the preference value falls below the threshold, in order to find a time that satisfies the threshold criteria.

WO 00/26828 PCT/GB99/03605 38 Participants of the meeting may not have diary assistants 211, and communication between participants and the host of the meeting may not be effected entirely through Zeus messaging. For example, some participants may be running Microsoft Outlook, or Lotus Notes, which maintains its own calendar function. In this situation there may be provided a shell (not shown) that interfaces with the third party application, and the steps described above (with reference to Figures 15a and 15b) may be performed at the shell level. The shell would therefore perform at least three functions communicating with the third party diary system, processing data received therefrom, and communicating with the host's diary assistant. The latter steps may follow the above procedure, and communication between the shell and third party application may be via email, for example. This may also apply to the fourth embodiment when the task element(s) comprising the task plan are the responsibility of different users.

The diary assistant may also be operable to receive messages from the coordinator 305, which messages typically include requests to supply information to the user. The diary assistant may examine the timeslots in the user's diary, and will schedule execution of the request to occur in a free timeslot. If the user has no appointments booked in at the time that the request arrives, the diary will send a message to the co-ordinator to allow the information to be displayed to the user immediately.

Implementation The diary assistant described with reference to the above examples may be embodied in the following software components: The functionality of the diary assistant may be co-ordinated through the diary assistant GUI, which may be written in Java (shown in Figure 7); The tasks, days and description of tasks may be objects written in Java; The scheduling, described in steps S9.2, S10.3, S13.2 and S15.2 above, may be written as functions in Prolog or Fril logic programming languages, and these functions may be invoked within a respective Java class; ~ilm~rn~n~ -Ilrmirr--r*sr nl ll ill li l I Y' 1~IY(I I i i~l~Tm~2~Ll~liml li'Ilii ur i:l~ur~yi~- rlrr~i~~L~L~~imrr,~lr." r*~sr iin, l'i r r;r:T~~~ifi a~rnri 11 11119 ~*llml ~C:li i I1 Il- nil ^1.~7~1r~1/1~71117rII nO:~-LI -Ilitlll~~lin(~-L -PL:t~l ll~~a~O~L"ml WO 00/26828 PCT/GB99/03605 39 The graphical interface used for designing plans of tasks in the fourth embodiment may be an editor object written in Java; The initiation of negotiations and bids from host and participant diary assistants respectively may be handled by Java objects which embed functions, also written in Java, to handle the inputs from multiple participants, according to step S15.4, for example.

It is understood that the use of Java and the logic programming languages are inessential to the diary assistant.

The diary assistant 211 may be run on either a Unix or a Windows operating system providing the OS is equipped with the relevant components to support Java and either of Fril or Prolog.

When the diary assistant 211 is run on a Unix platform, the following Unix commands may be entered at the keyboard to invoke the assistant 211: 1.1 java oma.agents.ANServer ANS -nogui -t 1 -f n .db (ii) sleep (iii) java oma.agents.Facilitator broker -nogui -t 1 -s nl.db 1.2 cd diary; (ii) java -Dia.distrib $IA_DISTRIB oma.agents.AgentShell Diary -s nl.db -e; (iii) DiaryAssistant 1.1 invokes the processes required for the diary assistants to communicate with each other using the Zeus Open Messaging Architecture supra, and 1.2 invokes the diary assistant itself, and these are thus the commands required for the fifth embodiment.

WO 00/26828 PCT/GB99/03605 java -Dia.distrib $IADISTRIB DiaryAssistant This invokes the diary assistant itself when the first four embodiments alone are run.

The $IA_DISTRIB is a Unix parameter giving the location of files containing information about the user name, location for diary files, etc.).

If the diary assistant 211 were to be run on a Windows OS, there would be a similar parameter required, but the syntax of the commands listed above may be different.

Email Assistant A first embodiment of apparatus for processing communications received by a user over a communications link is a software agent generally referred to as an email assistant, which is used to manage both incoming and outgoing emails. As is well known, emails have as a header, information concerning the sender, the recipient and the subject of the email, and this information, which may generally be referred to as identification information, may be used to assess a priority status of the message.

Email has greatly facilitated communication interchange between users connected in a network. However, emails tend to proliferate in number and a user at a particular workstation can be inundated with messages that take a significant amount of time to open and read. Some emails are of crucial importance whereas others are of only marginal interest. It would therefore be helpful to filter emails according to priority. In some conventional systems, emails are given a priority by the sender, but the user can only determine the actual priority by reading the email itself.

The email assistant 205 helps the user to manage both incoming and outgoing email messages. It pro-actively notifies the user of new incoming messages and computes a priority status, which is used to provide advice WO 00/26828 PCT/GB99/03605 41 for handling the message. Furthermore, the email assistant 205 observes differences between how the message is actually handled compared to the advice computed by the assistant, and modifies its parameters so as to reflect the user's preferences.

Referring to Figure 16, the email assistant makes use of a Bayes net arrangement 1601 in order to make a suggestion 1603 as to whether the email is of relatively high or low priority and thus whether it should be read immediately or can be left until a later time.

The email assistant has the following identification information inputs to the Bayes net arrangement 1601, shown in Figures 16 and 17a: data 1605 concerning the destination address(es) of incoming emails; data 1607 concerning the importance to the user of the subject matter of the incoming email, as signified by its title; and history data 1609 concerning the user's previous reading of emails from the sender and the user's previous sending of emails to the sender of the incoming email.

These three analysed inputs provide three parameters by which an email may be prioritised, and the email assistant may make use of various rules in conjunction with Bayes nets, such as fuzzy logic, and/or pattern matching techniques, in order to determine a priority rating for an incoming email.

Clearly, the outputs from each of these parameters will be combined to provide a single recommendation for the priority of the email. The emails may then be stored in various lists according to their level of priority for example: High, Medium, Low; or Now, Today, This week, This month, Never.

Address data: II I)I1- 1~(1 Il ~-iri~llrrnl rn, 1~11(111111~~11~:lr1R--l-illllll( lll(*: Y1"II'UWli"'~- rll~~!?r ?1II~Y~LU-~LLU~?Vlli'll(*1C11?.111113::n I I~(II~V-~LL~ ~lli~ll-IL~-IL~- WO 00/26828 PCT/GB99/03605 42 When an email arrives, the identification information is analysed. Referring to Figure 17a, and considering analysis of the destination address field, this may be achieved in the following manner.

The string from the message header field (eg raw data is analysed by logical sensors which return boolean values: 1. To Me sensor 1701: true if my email address appears, false otherwise; 2. To Others sensor 1703: true if there is at least one email address different from mine, false otherwise; 3. To List sensor 1705: true if at least one of the user defined mailing list addresses appears in the string, false otherwise.

The "To Others" sensor 1703 may return a value in defined as 1/(number of other recipients), or some fuzzy sets {Few, Many) may be defined and input into other fuzzy rules, e.g. 1707 shown in Figure 17a, within the net arrangement 1601.

The "To Me" sensor 1701 may further include an identifier such as a number, which indicates whether the "To Me" address is present in the "TO" field, or the "CC" field, and the priority of the message may be weighted accordingly. There is a further email address category that of "Apparently to", which is often used by machine generated emails and mailing lists, and this may also have an identifier associated therewith.

Alternatively, the identifiers may be boolean values, or there may be one sensor associated with each of the possible recipient "To me" subcategories ("TO/CC/App- TO").

The information provided by the destination address of incoming emails 1605 may be input to a Bayes net 1709, shown in Figures 17a and 17b, to compute a priority associated with the sender. As known in the art, a Bayes net considers the causal relation of history data in order to modify the a-priori probability of the occurrence of an event. A discussion of Bayes nets is

L

1 n~ r I~ I WO 00/26828 PCT/GB99/03605 43 given by S. Russell and P. Norvig, supra. The email assistant 205 may have one network for each known sender, and a default network for use when an email is received from a sender for the first time. As known in the art, emails can be addressed to an individual address, can be copied to one or more other people and can also be sent using a predefined mailing list, for example to all engineers in a particular company or to a group of customers. In this example, it is assumed that an email addressed solely the user is high priority. It is assumed to have reduced priority if copied to another person. If copied to more than one person, it is assumed to have a lesser priority still. If sent via a mailing list, it is assumed to have an even lower priority.

The priorities associated with the destination address, for a user receiving the e/mail, may therefore be learnt along the lines of: Message sent to me: Read Now; Message sent to me and others: Read Today; Message sent to mailing list: Read this Month; such that the address field of an incoming email is analysed and propagated through the Bayes net to provide a priority output corresponding to the address field.

However these values, which are based on address information only, provide only a first approximation to how the user would prioritise the emails. In practice, the Bayes net is operable to adapt the weights applied to each of these categories, based on how the receiving user is observed to deal with the email. Thus, the email assistant 205 may suggest that the user should read the email immediately, but in practice, the user may choose to read it later in the day. If that is the case, the assistant 205 should modify the weights in the Bayes net such that the next time an email is received it can anticipate how the user will want to deal with it, and suggest accordingly.

1!II1IV~I!1I 1*1II11IIIIIII.III nilll(~~Yll(l~i. /II1I II):(I VI(J:(I1II~MI1III illli:-~li"a~~~~ ~l Rlinillu;un rmnr, nlle -r r n nl Ilmnn~z~.~ nlrrrrnmmunlrunmr rnaa~r~lm*-rrrr~; nulmrllm"rulm, WO 00/26828 PCT/GB99/03605 44 As an alternative to using a Bayes net to determine the priority of an email based on the address field, a ranking factor may be applied to emails (not shown). A ranking factor is defined having a value range between 1 for high importance and 0 for no importance. In this example, the ranking is set equal to: If the email is directed to the user alone, the email is given an importance ranking 1; if the email is copied solely to another, the email is given an importance ranking 0.8; if the email has been copied to several others, the email is ranked with an importance of if the email is part of a mailing list the importance ranking is set to be 0.3 i.e. low importance.

It will be understood that the specific ranking values described above are examples and that in practice, the importance attributed to each particular category of email by the individual user may change with time. As for the Bayes net 1709, the rankings can be learnt over a period of time by monitoring the user's behaviour with respect to the reading of incoming emails. One way of learning these rankings may be to maintain a log of incoming and outgoing emails, and this information may be stored either by the email assistant itself, or in a user profile stored in the database 247.

Subiect data: The data 1607 concerning the subject field of incoming emails will now be discussed in relation to Figure 18: At step S18.1, the subject of the incoming email is detected from its header; At step S18.2, a profile of important subjects is developed, pertinent to the individual user. For example, if a user has recently sent a number of emails using the same title entered into the subject field, the title of the incoming email is deemed to be important to the user. It will be I WO 00/26828 PCT/GB99/03605 understood that techniques such as fuzzy recognition or clustering can be used to identify different presentations of the same topic in the subject field; SAt step S18.3, the importance of the incoming email is ranked by making a comparison between the profile developed at step S18.2 and the actual subject of the incoming email identified at step S1 8.1.

The step performed at S18.2 may alternatively or in part be performed by accessing and updating a user profile stored centrally within the database 247. Such a centrally located user profile may include a variety of key words that have been contributed by other assistants, and these may also be used to decide whether the text in the subject field is likely to be of interest to the user.

History data: Derivation of the history data 1609 from previous emails will now be described. Information relating to the time taken for the user to read or respond 1715 to incoming emails 1605 may be input to a second Bayes net 1713, shown in Figures 17a and 17c. This may be combined with the priority information derived from the Bayes Net 1709 associated with the sender, as shown in Figure 17a at 1714, in order to compute a more refined priority associated with the sender. If an email is read quickly after receipt, this indicates that the user considers emails from a particular sender to be important. If the user has, in the past, taken a long time to read an email from a particular sender after receipt, this indicates that the user considers emails from a particular sender to be of low importance.

The second Bayes net 1713 relates the delay between notification and user action 1717, taking into account the uncertainty in whether the user has seen the notification or not 1719. The delay between notification and user action 1717 may be derived from a log (not shown) of sent and received emails, as a function of dates and times. This log is maintained by the email assistant i I~ WO 00/26828 PCT/GB99/03605 46 205, and it may be a log private to the email assistant alone, or it may be part of the centrally stored user profile. Thus, the time of receipt and the time of reading of a previously received email can be analysed in order to determine the time between these two actions.

The uncertainty referred to above may result from, for example, a user attending a meeting when the notification arrives. For the duration of the meeting the user is unable to read the email, and any delay in responding to emails that arrive during this time should not be attributed to a preference as a function of the sender. One way of reducing uncertainty is to establish, from the user's schedule, whether the user was occupied during the time of interest (time of interest: time that the email was not read). The email assistant 205 could therefore receive or request inputs from the diary assistant 211, and the date and time information stored in the log file should be checked against times and durations of events scheduled for the user. If there is a delay between receipt and reading of an email during a time when the user was involved in another task such as a meeting, this should be input at the node 1719 of the Bayes net 1713 as "not seen". This could similarly apply to the situation where emails are received, but the user is not logged into a terminal at the time of email receipt (user not in office, user working without computer switched on etc.) The outputs of this net 1713 and the first net 1709 may be combined 1714 using a fuzzy rule or by taking a weighted average of the respective outputs.

Alternatively, the email assistant may use information stored in the log to calculate a priority based on history data 1609. Thus, referring to Figure 19: At step S19.1, an analysis is carried out of the time previously taken to read emails from individual addresses i.e. individual senders.

I- -i I ~c~ WO 00/26828 PCT/GB99/03605 47 At step S19.2, when an email from a particular sender is received, a decision is made concerning the time taken to read emails from the sender, in the past. If emails previously were read within less than a given time, i.e. deemed to be important, the incoming email is given a high ranking 1. However, if previous emails from the sender were previously read within greater than the given time, the incoming email is given a low ranking 0.

Incoming emails may also be processed according to previously observed actions of the user. If an email was recently sent by the user to the sender of the current, incoming email i.e. the user is expecting a reply, the incoming email is given a high ranking but otherwise a low ranking. Thus the address and time sent data on the email log is analysed in order to determine when the user last sent an email to the sender of the incoming email. If an email was sent within less than a given time, the incoming email is given a high ranking 1 whereas if an email was not sent within the given time, the incoming email is given a low ranking 0.

Referring back to Figure 16, the three inputs to the Bayes net arrangement 1605, 1607, 1609 are processed to provide a suggestion 1603 concerning the relative importance of the incoming email, and these are combined to provide a general priority of the email. It will be understood that not all of the inputs are necessarily needed for the net 1601 to make a suggestion 1603. The assistant 205 may store the values corresponding to each sender in a 'Belief vector', which is an array of priority values, typically [Read Now, Read Today, Read This Week, Read this Month, Read Never], which, when added together, equal the value of 1. The element that has the maximum probability indicates the message's priority. The mapping between priority and suggestions is illustrated in Table 1 for a few example suggestions.

Table 1 WO 00/26828 PCT/GB99/03605 48 Suggestion Message High priority Suggest read mail now Medium Suggest read mail priority This Week Low priority Suggest read mail This Month Figure 20 illustrates how the suggestion message 1603 may be displayed to the user. The screen of display 103 (Figure 1) is shown with a work area 2001 on which data processing is carried out. The status bar 2003 is shown below the work area. Thus, the user may be operating a word processor to prepare a document. When an incoming email is received, a mail icon 2007 is displayed on the status bar 2003. This indicates the arrival of the email but not it's content. Thus, the user must decide whether to stop word processing and open the newly arrived email or whether to continue word processing. If the email is of peripheral importance, it would be better to continue with the word-processing rather than break concentration. In accordance with the functionality provided by email assistant, the user moves the mouse cursor 2006 onto the mail icon 2003, which results in a mail priority window 2005 being displayed. The mail window 2005 may contain a message selected according to Table 1 above, depending on the suggestion 1603 made by the Bayes net arrangement shown in Figure 16, along with the sender's details, the size and subject of the email, and may list the recipients(s).

Thus, if the incoming mail is suggested to be of low priority, the user is immediately informed of this fact and can continue word-processing.

However, if the email is suggested to be of high priority, the user can stop word-processing and open the newly received email message. The message in window 2005 is a suggestion only and thus can be overridden by the user if deemed appropriate.

WO 00/26828 PCT/GB99/03605 49 The communication of email arrival may be further controlled by priority thresholds. For example, message 2005 may be controlled such that it only displays when the priority exceeds a certain value, or satisfies a certain condition (such as the subject field includes "READ NOW"). This feature may be particularly useful as it allows the user to work substantially without interruption, but addresses the need to notify the same of urgent, or specifically categorised tasks.

The above procedures for assigning and updating priority status to an email may be illustrated by the following example: A message arrives and is analysed according to the above mechanisms, based on the three identifying parameters; The probability distributions output from the Bayes Net and/or rules are used to compute a priority, which is thus a combination of results from analysing all three input parameters, and may be identifiable from the belief vector; The priority is output from the email assistant 205 to the user, together with a suggestion based on the priority value; If the priority is Read Now, and the user chooses to read the message later in the day, the message is routed to the 'Read Today' list; SThe email assistant 205 learns how the user has handled the message, and the 'Read Today' element is given more weight for that sender and/or subject field in the relevant input parameter computing mechanism Bayes net address list, history data; fuzzy logic rule address); SThe next time a message arrives with corresponding features, the email assistant 205 computes a new priority based on the user's preference learnt during the previous interaction.

SUltimately the email assistant 205 may learn the user's behaviour and reaction to messages of computed priorities, in order to automatically organise and sort incoming messages based on the learnt behaviour.

,ll rr~ I iln.ilLl..ci^til ll~~l(lli.flIl:.i.Y11-m~i'l..l~ n"'"lllll Il l L~ illiiilllll-i~~l~dli11ii~ WO 00/26828 PCT/GB99/03605 The email assistant 205 may have a user interface (not shown), which may be represented as a dialogue box or the like, and which allows the user to view the emails in lists corresponding to the priority ratings listed above.

The user may thus scan through a category of emails by selecting the relevant list, which may be accessible via pop-up menus or their equivalent, and then selecting an email for reading. The user interface may also offer some of the standard features of standard email systems, such as a 'Compose email' option.

Implementation: Figure 21 shows a schematic diagram of a typical Unix implementation of the email assistant 205. Incoming emails at the mail server are picked up by calling a PERL script in a .forward file 2101, which is a standard mechanism used to forward emails to predetermined locations, for each message 2103. It has the effect of running incoming mail through the commands of the script rather than allowing the mail to sit in the in-box.

The script copies the message 2103 onto a local disc 2105 with an internal number and concurrently updates the current mail count 2107 in a file stored on the local disk. This process is event-driven and provides the interface between the email assistant 205 and the Unix platform.

The email assistant 205 may be written in Java, and may thus have a plurality of threads that are capable of running concurrently. A Java thread 2109 may be used to check the mail count periodically, such that when a change is detected, the corresponding message 2103 is retrieved using the email number 2107.

Thus, the load on the mail server is reduced through delegation of the reasoning process to the local machine (client machine) that the email assistant 205 is running on.

-i~r I ~u~r l~ ru~l~i~~iz~i;~i~s~nuiu~ unnni il r~n.rr *ornaue~Nul~wnuun~:lImn nrar*mi*rlunnl I~rnl~r ll I ilrlinrr n r urnrnnnlnlal n* m~ larn mr*rin~lm~l2~rruil rr, ulnr~lr~nn~ WO 00/26828 PCT/GB99/03605 51 Telephone assistant A second embodiment of apparatus for processing of communications received by a user over a communications link is a telephone assistant, which is generally similar to the first embodiment described above, for which a description of the operative terms has been given. The telephone assistant 207 is used to manage a user's incoming telephone calls by performing call screening on incoming phone calls. The calling line identifier (CLI) of incoming calls may generally be referred to as identification information of the phone call.

Referring to Figure 22, a Bayes net arrangement 2201 can be used to restrict answering of incoming telephone calls. Data derived from the CLI 2205 and data from the diary assistant 2207 is fed into the net 2201 as shown in the Figure and an output 2203 is provided to control answering of incoming telephone calls.

Referring to Figures 22 and 23a, the priority associated with each caller may be represented in a Bayes net 2301 tree, located within the arrangement 2201, where each branch of the tree 2301 represents a caller that the user may expect to receive a call from 2303, 2305, 2307. There may be an additional branch, represented as 'other' 2309 in Figure 23, which is used as a default to filter calls from unknown callers. The CLI of incoming calls may be used as identification data in the Bayes net 2301, such that when an incoming call is received, the telephone assistant 207 uses the CLI to search a database for the corresponding name of the caller.

This database may be either stored within the telephone assistant or within a user profile, preferably located centrally in the database 247, to be accessed by the telephone assistant 207.

The conditional probabilities 2311, 2313, 2315 of the Bayes net tree 2301 are initially set so that all of the calls are accepted. The telephone assistant 207 can then observe how the user manages the calls, and refine the WO 00/26828 PCT/GB99/03605 52 probabilities within the Bayes net tree 2301 in a manner similar to that described in the first embodiment.

The Bayes net arrangement 2201 may also receive data 2207 from the diary assistant 211, relating to diary entries which indicate that the user has planned certain activities relating to the caller identified as described above. This data is incorporated in a second Bayes net 2317, shown in Figure 23b, which is also located within the arrangement 2201. The second net 2317 has, as inputs, the importance of the call based on the caller's identity, which is input from the Bayes net tree 2301, together with information relating to whether or not the user has a meeting scheduled with the caller. This information may be further categorised by proximity of meeting, meeting type and frequency of calls: Time of the meeting in relation to time of the call 2319. This information may be available via the diary assistant 211, and passed to the telephone assistant 207 via the message passing described earlier; Is the meeting work or play-related business meeting or leisure meeting) 2321; 9 How frequently the caller makes calls to the user 2323. This information may conveniently be stored in the database, against the caller's ID details.

Furthermore, the diary may contain a diary entry indicating that a call is expected, in which case the net 2317 takes this into account when prioritising the incoming call. Also, the diary may indicate that at a particular time, the user is uninterruptabie, in which case call answering will be barred automatically. This information may be incorporated into the second Bayes net 2317 in a similar manner to that described above for the type of meeting 2321.

When a call is received, and the above information has been extracted and processed in the second Bayes net 2317, the telephone assistant 207 WO 00/26828 PCT/GB99/03605 53 outputs a recommended priority status. This is shown in Figure 22 as the suggestion for call to be answered at 2203.

The assistant 207 may operate in three modes: Accept calls, Refuse calls, Filter calls according to the priority analysis output from the Bayes net arrangement 2201.

The operating mode may be selected via a graphical user interface 2401 such as that shown in Figure 24: the caller ID is detailed in 2403; the mode of call acceptance is selectable from a pick list at 2405; and the selected priority threshold is displayed at 2407. The assistant 207 provides the user with a further option of accepting or ignoring the call at 2409. The interface may contain a keypad to dial phone numbers directly, and a text field where the user can type the name of the person to call.

If the assistant is set to operate in either accept or refuse calls mode, the user effectively overrides the assistant's computations. If the assistant is set to operate in filter call mode, then calls will be announced to the user as a function of the computed priority compared to the selected priority, at 2407.

In the refuse calls mode or filter mode, the telephone assistant 207 can instruct the interface 115 shown in Figure 1 to inhibit ringing of a telephone, so as not to interrupt the user unless the incoming call is analysed to be of a predetermined importance. In this situation, the incoming call may be diverted to a messaging service.

WO 00/26828 PCT/GB99/03605 54 The user can also set triggers in the trigger tab 2411 of Figure 24 by associating a pre-recorded message with a caller's name or number. When a new call arrives, the assistant 207 checks for existing triggers and fetches the corresponding message. This message is then automatically played to the caller.

The above procedures for assigning and updating priority status to a phone call may be illustrated by the following example: 0 The assistant 207 translates the number with the name of the caller in the database, then checks for triggers; e Assuming no triggers have been set for this caller, the assistant computes a priority for the call by inputting caller information, frequency of calls received from a person, diary information into the Bayes net arrangement 2201. This information is propagated through the net to provide a priority; o Assuming that the user interface 2401 has been set to 'filter emails' at 2405, this computed priority will be compared to the selected value and the call processed accordingly.

Implementation One implementation 2501 of the second embodiment uses BT Callscape 2503 to interact with a Public Service Telephone Network (PSTN) analogue telephone line, as shown in Figure 25 of the accompanying drawings. Callscape is a product of British Telecommunications Public Limited Company which provides computer telephony integration (CTI) and calling line identification (CLI). It is available as an external hardware device that connects to the serial port of a computer. Telephony events (lifting of receiver, receiving incoming calls, sending outgoing calls) may be processed by an application running on the computer. The telephone may be a Meridian digital phone 2505, which uses a Meridian Communication adapter as a hardware board located in the telephone handset, which also connects to the serial port of the computer.

WO 00/26828 PCT/GB99/03605 The assistant 207 may be implemented in the Java programming language, and the arrival of a phone call may be detected by a thread 2507, which provides a server front end to the Callscape client. The assistant 207 may interface with Callscape 2503 via an ActiveX component having a Visual Basic layer to initiate connection to the telephone assistant server. Incoming calls are thus signalled to the thread, which then notifies the telephone assistant 207 with the CLI.

Multi-modal interface Referring to Figures 1 and 2, apparatus according to an embodiment of apparatus for identifying user activities at a workstation may be provided by a multi-modal interface 209 arranged to identify such activities.

A multi-modal interface 209 is provided between two separate entities, a human and a machine, which are physically separated, but are able to exchange data through a number of information channels or modes, such as via a keyboard 101, display screen 103, mouse 105 and an audio channel 113. The multi-modal interface 209 is primarily used to process what a user explicitly communicates to the machine, but it may also extract information implicitly, by observing user actions. This may be described as obtaining high-level information about the user by observing low-level modalities, such as the keyboard 101 and the mouse 105, and this information may be used to provide user-friendly interactions and additional functionality.

Multi-modal Interface: Detecting user presence: Referring to Figure 27, a first embodiment of the present invention is concerned with detecting whether or not the user is present at a workstation. In order to achieve this, two data sources 2701, 2703 are input to the user activity data processing step 2705. The first data source is provided by an imaging device 114, and the other of the data sources 2703 is provided by data from the keyboard 101 and mouse 105.

i~~~u~~anFKnn rii-irr: Iluil ~lttr m~m;--riilsIllrrmllu-I:e~ll~L~- ;llrri;t?~L~~m ~rIr rllnl ri *n llmn~~~rnila~inllar nmer~ Inmn.ir WO 00/26828 PCTIGB99/03605 56 Referring to Figure 26, the first of the two sources 2701 outputs a signal indicative of discontinuities 2601, 2603 that occur when a user enters and leaves the vicinity of the workstation. Figure 26 presents inter-frame difference recorded by an imaging device such as a video camera as a function of time, and illustrates a user firstly approaching the workstation, sitting next to it ready for use and then leaving the vicinity of the workstation. The approach of the user produces an initial upward step 2600 in the output of the camera and then as the user becomes positioned next to the workstation ready for use, a pulse 2601 is produced.

Thereafter, the output settles to a relatively steady level 2605b. When the user leaves, another pulse 2603 is produced in the output.

As can be seen in Figure 26, the level that occurs whilst the user is present 2605b, using the workstation, is much the same as when there is no-one present at the workstation 2605a. It is therefore difficult to determine from the output whether the user is present or absent from the workstation. The second data source 2703 is thus used in conjunction with information from the first data source 2701 in order to differentiate between user absence and user presence.

The second data source 2703, may be provided by either or both of the keyboard 103 and the mouse 105, and data may be retrieved from these inputs by monitoring their usage by monitoring means (described below).

Briefly, the monitoring means comprises sensor detectors, which are operable to detect usage of various types of key and mouse actions, and are further operable to calculate a rate of operation of these actions over a predetermined period of time.

Figure 28 shows how the information extracted from the first and second data sources 2701, 2703 are combined in order to distinguish user presence in the flat periods 2605a, 2605b shown in Figure 26: I~ ~r i r WO 00/26828 PCT/GB99/03605 57 2801 The initial state is Unknown. In this state only inputs from the second data Source 2703 are considered; 2802 The state is set to Present when the monitoring means detects activity from the second data source 2703; 2803 The state is set to Absent when no input is detected from the second data source 2703, but activity is detected from the first sensor 2701. When in the absent state, the second data source 2703 takes precedence over the first data source 2701; S2804 The state is set to Background after reaching state 2803 when further activity is detected from the first sensor 2701 but no change of state is detected from the second data source 2703. If the second data source 2703 persistently fails to detect any activity 2806, the system will return to the Absent state, but if activity is detected at the second data source 2703, the state is set to Present.

Multi-modal interface for activity and state of mind detection The low-level data inputs described above can also be used by the multimodal interface 209 to provide high level data such as the level of stress exhibited by the user. Data from low level inputs will be dependent on the activity carried out by the user, his familiarity with using the inputs and his reaction times and perceptual acuity, among other factors, and these should be taken into account when determining stress levels from such data. The following is a description of data measurement and processing by the multimodal interface for the purpose of state of mind detection in addition to activity.

When the user has been detected as present, as described above with reference to Figure 28, data inputs 2703 from both the keyboard 101 and the mouse 103 may be analysed in terms of, for example, frequency and mode of use thereof. The following presents a brief overview of how the system estimates user activity with reference to Figure 29 of the accompanying drawings. The components effecting the querying and quantifying of data are described thereafter: WO 00/26828 PCT/GB99/03605 58 "Every few seconds, the low-level sensors are queried for the frequency of use of each type of keys: 1. S29.1 Detect the rate at which the user operates, for example, the "delete" key. For example, usage of the delete key at a relatively high rate may indicate that the user is making many mistakes which in turn may indicate that the user is under high levels of stress; 2. S29.2 Detect the rate at which the user operates a text key, in this case the "return" key. Heavy use of the return key 0 indicates a high error rate and hence, possibly, high stress. Use of other keys such as control keys and mouse movement can also be analysed in order to detect usage, as an indication of stress, at step S29.2.

Current values are compared with user-independent values via predetermined rules to determine the activity.

One way of implementing such monitoring is illustrated in Figure 30, which shows a plurality of monitoring means 3001, 3003 corresponding to monitoring of text keys (such as the "return" key) and delete keys respectively. Each of these monitoring means gathers information from sensor, frequency and time-out detectors.

Figure 30 shows monitoring means for monitoring two events text key usage and delete key usage 3001, 3003. Other events, such as those listed below, may similarly be detected by corresponding monitoring means (not shown in a Figure): Text keys usage 3001; Delete keys usage (includes backspace key) 3003; Control keys usage (includes 'end', 'home', 'page up' etc.); Mouse motion; Mouse drag speed; Mouse click usage; 0 Mouse motion and drag directions.

II a I 71 I.iiPII- I .117~.~8~11)1~11LIllIP*l(*in *~TPf~Ol~i~~ll~~ ln 1 1I1 ~a~uu Iranrm r-mr, WO 00/26828 PCT/GB99/03605 59 Referring to the two monitoring means shown in Figure 30, the sensor detectors 3009, 3015 detect events relating to use of the text and/or delete keys. The frequency detectors 3011, 3017 receive information from the sensor detectors 3009, 3015 and thereby monitor rate of use of the above events in real-time. The time-out detectors 3013, 3019 similarly receive information from the sensor detectors 3009, 3015 in order to determine whether an event has occurred during a given period of time.

The frequency detector may use time-stamped information from the sensor detector together with data from the time-out detector in order to detect determine levels of use (including periods of inaction) of the inputs.

In operation, and with reference to the delete key monitoring means 3003, a delete key detector 3015 sends the timestamp of each delete key stroke to a frequency detector 3017 which determines the rate at which the delete keys are being used. Data recorded by a corresponding time-out detector 3019 may be combined with information from the frequency detector 3017, and the frequency detector may perform a statistical analysis thereof. The statistical analysis may include computing an average of timestamp differences between events, shown at step S29.3 in Figure 29, and this data is used to rank the stress level of the user.

It will be understood that the system can monitor the usage of the delete key and the return key under all conditions and thus determine an average rate for the user. This average rate may be stored and updated in a user profile, which may be accessible from the co-ordinator assistant 305, shown in operative association with the multi-modal interface 209 in Figure 2, so that when the usage rate exceeds the average significantly, a condition of high stress is indicated. For example, the following algorithm may be applied to assess the user's current level of stress: Assuming that the current user activity is writing wlm~mn l n rlzrIra*,l-lr, lit Ilrrrmla;i;r ~i-li~~Rmn~~milrls:il n lrmlilrmm~i-r*nn*l: rnri ~Errrr li I n*r~ip* ~l r I lr~- *r~r WO 00/26828 PCT/GB99/03605 IF (Current text speed Average text speed)& (Current mistake speed Average text speed)

THEN

State high stress ELSE IF (Current text speed Average text speed) (Current mistake speed Average mistake speed)

THEN

State tired

ELSE

State normal This can be quantified by a stress ranking which may range between 1 and 0, where 1 high stress and 0 normal.

As described above, the state of mind of the user is determined in the context of the current user task, and the low-level inputs may further be used by the multi-modal interface 209 to determine high level information such as the task defining the user activity.

Accordingly inputs from the text keys, delete keys, and control keys (not shown) and from the mouse (not shown), may be monitored by monitoring means as described above with respect to Figure 30 for type and frequency of use. Considering the operation of text sensor detector 3009, the timestamp of each text key is sent to a frequency detector 3011, which determines the rate at which the text keys are being used. Data recorded by the corresponding time-out detector 3013 may be combined with information from the frequency detector 301 1 as described above, and the resulting statistical quantities may be compared with base values, which are user independent, according to the following rules: WO 00/26828 PCT/GB99/03605 61 IF Text speed is HIGH (compared to base value) Mistake speed is HIGH Control key usage is HIGH

OR

Text speed is VERY HIGH (compared to base value)

THEN

TASK= WRITING Where HIGH and VERY HIGH are predetermined levels and may also be specified in the user profile, but are user-independent.

Table 2 presents a general correlation between events (use of text keys, use of mouse etc.) and user activity, or task: Table 2 Task Actual User Action Sensor Detectors active Reading-only Periodic scrolling Motion speed Direction Writing (text) Typing Text, control, mistake keys speed Drawing Mouse use Motion, drag and clicks speed Programming Change of active All keyboard or mouse speed window Text, Control, Mistake keys Typing When the mouse sensor detectors detect movement of the mouse (not shown), the direction and rate of use can be determined by monitoring mouse events associated with the mouse position co-ordinates. The co-ordinates of the pointer of the mouse are recorded by the detector and are passed to the WO 00/26828 PCT/GB99/03605 62 corresponding frequency detector, which fits a line to the points indicating latest positions and a rate of change of positions of the pointer of the mouse.

The stress ranking and user activity information may be used to modify a user's work plan. The information may be input into the co-ordinator 305, or it may be fed directly to any one of the assistants, shown in Figure 2.

When the co-ordinator receives the information and if, for example, the user is manifesting high levels of stress, the co-ordinator may inhibit or modify plans that are currently being carried out in order to reduce the amount of information supplied to the user. However, if the user is sitting at the workstation and appears to be relaxed, the co-ordinator 18 may be configured to only provide a very low level of filtering of incoming emails and telephone calls in order to keep the user occupied. Similarly if the user is involved in a task that is coupled with non-interruptible status, the coordinator may restrict the amount of information supplied to the user to enable him to continue without interruptions. Typically, filtering such as described above may be controlled by thresholds set within the coordinator, and these thresholds may be a function both of the information to be passed on by the co-ordinator and of the assistant to which the information is directed.

If the stress ranking information is sent directly into one of the assistants, for example into the email or telephone assistant, the assistant itself will have thresholds set which are solely a function of the assistant.

Implementation For the multi-modal interface 209 applications described above, each of the monitoring means 3001, 3003, 3005, 3007 and corresponding sensor, frequency and time-out detectors may be written in Java to enable concurrent monitoring and gathering of data, although use of Java is inessential. Any language that facilitates simultaneous operation of the WO 00/26828 PCT/GB99/03605 63 monitoring means, frequency detectors, and time-out detectors may be used. Thus information from each of the monitoring means may be integrated in real-time and analysed to determine the user's task. For example, the time-out detectors may poll for a signal every few seconds, and this information may be cross-referenced with frequency detector information and time-out detectors from other monitoring means to determine whether the user is reading or thinking. This information may also be used to determine whether the user is tired, which may indicate the stress of the user as described above.

Each Sensor detector is based on a Java events listener, which is written using Java 1.1 event model. When a sensor detector handles an event, it tests whether this event corresponds to it or not. If the event is relevant to the sensor, the event and the date thereof is stored in the frequency detector, which is a Java object.

The frequency detector computes a speed of use of events either in an eventdependent way or in a time-dependent way and stores the timestamps of the events in a sorted-a object (sorted array) and a counter object. The sorted-a object is a tool that is used to compute statistics relating to speed from a set of events, and in the apparatus for identifying user activities at a workstation is implemented to compute the median of the stored speed of events. The counter object computes and stores a speed of use of an event on a longer period of time, so as to provide the time-dependent information.

The time-out detector is a Java object that stores occurrences of events over a time scale that is suitable for detecting long periods of inactivity.

The imaging device described in the first embodiment may be a gaze tracker, which is a device that monitors eyeball movement of the user. The direction of gaze of the user can be determined and the user can use this feature by directing his/her gaze to a particular part of the display 103 in WO 00/26828 PCT/GB99/03605 64 order for instance to select data for data processing operations. One example of a gaze tracker is described in US Patent 4 836 670. Known gaze trackers consist of a TV camera directed towards the eye of the user together with pattern recognition software running on the computer, which analyses the image developed by the camera in order to determine the direction of view of the user. This is correlated with the configuration of a display being viewed by the user so as to determine which window or region of the display is being viewed by the user. The imaging device may alternatively be a camera suitable for use in videoconferences and which is capable of providing around 15 frames of image per second. Changes in the camera view may be observed by calculating the difference between neighbouring frames in corresponding pixel positions to output inter-frame temporal information such as is shown in Figure 26.

Many modifications and variations fall within the scope of the invention, which is intended to cover all permutations and combinations of the individual modes of operation of the various assistants described herein.

As will be understood by those skilled in the art, the invention described above may be embodied in one or more computer programs. These programmes can be contained on various transmission and/or storage mediums such as a floppy disc, CD-ROM, or magnetic tape so that the programmes can be loaded onto one or more general purpose computers or could be downloaded over a computer network using a suitable transmission medium.

Unless the context clearly requires otherwise, throughout the description and the claims, the words "comprise", "comprising" and the like are to be construed in an inclusive as opposed to an exclusive or exhaustive sense; that is to say, in the sense of "including, but not limited to".

ra~ l l ?u ~~r3~r??olr ~ur_~slrrulnl;liir ~~sa*u lnll~urll~lIr lrr3lrlr nn I II* rirm ln *i i ul ~lmmr ummr i~iI:lrwa~lrullrE

Claims (9)

1. Apparatus for identifying a time with respect to an event in a scheduling system comprising: input means for receiving: event identifying data comprising an identifier for a processable event; and a fuzzy logic statement associated with the processabl e event, the fuzzy logic statement identifying a duration and a start time thereof; (ii) means for storing: event identifying data; and temporal preference information associated with said event identifying data; (iii) means arranged to access a temporal schedule, the temporal schedule being arranged to store allocated times in respect of at least one previously allocated event; (iv) processing means for: applying a predetermined function to convert the received fuzzy logic statement into temporal preference information; and reviewing temporal preference information corresponding to the at least one previously allocated event, together with the temporal preference information for the processable event in order to identify an available time for the processable event in the temporal schedule that satisfies the temporal preference information both of the or each previously allocated event and of the processable event.

2. Apparatus according to claim 1, wherein the apparatus further comprises monitoring means for monitoring the temporal schedule and alerting means for outputting an alert signal in the event that available time in the temporal schedule V" conflicts with said temporal preference information.

3. Apparatus according to claim 1 or claim 2, wherein the means for storing is further arranged to store constraint information. S4. Apparatus according to claim 3, wherein the processing means is further arranged to review the said stored constraint information together with constraint information received in respect of the processable event, in order to identify an available time for the processable event that satisfies both types of constraint information. -66- Apparatus for scheduling a meeting between two entities, including a plurality of apparatus according to anyone of the preceding claims.

6. Apparatus according to anyone of the preceding claims, wherein the fuzzy logic statement for a processable event describes both or either of: a preferred start time for the processable event; and/or (ii) a preferred duration for the processable event.

7. Apparatus according to anyone of the preceding claims, wherein the temporal preference information for a processable event comprises preference values associated with different respective start times.

8. Apparatus according to anyone of the preceding claims, wherein the fuzzy logic statement for a processable event describes both or either of: a period in a single day; and/or (ii) a period that extends over a plurality of days.

9. Apparatus according to anyone of the preceding claims, wherein the input means is both or either of: a graphical user interface operable to receive fuzzy logic statements via the keyboard; and/or (ii) a speech interface operable to receive fuzzy logic statements via a speech synthesising system.

10. A method of allocating a time with respect to an event in a scheduling system comprising the steps of: identifying a processable event; (ii) inputting a fuzzy logic statement associated with the processable event, the fuzzy logic statement identifying a duration and a start time of an event; (iii) converting the fuzzy logic statement into temporal preference information associated with the processable event in accordance with a predetermined function; S(iv) storing: event identifying data; temporal preferences associated with the event identifying data; accessing a temporal schedule for storing allocated times in respect at least one previously allocated event; and -11.1-11-1 l lrrwli~~lnrlrlnnnc~

67- (vi) reviewing temporal preference information corresponding to the at least one previously allocated event, together with the temporal preference information for the processable event in order to identify an available time for the processable event in the temporal schedule that satisfies the temporal preference information of both the or each previously allocated event and the processable event. 11. A method according to claim 10, in which the reviewing step (vi) includes the steps of: removing all of the stored events from the temporal schedule; allocating a start time and duration to the processable event, which allocated start time and duration maximise the preferences corresponding to the processable event; allocating start times and durations to the stored events until all of the stored events have been re-entered into the temporal schedule; quantifying preference satisfaction, which preference satisfaction provides a measure of how well the preferences associated with each of the existing events have been satisfied in the allocation of step and repeating steps and until the preference satisfactions have been maximised for all events. 12. A method according to claim 10, in which the reviewing step (vi) includes the steps of: o(a) removing all of the stored events from the temporal schedule; organising the processable event and the stored events into an order in accordance with temporal preference information relating to the processable event and to stored temporal preference information and; and allocating start times and durations to the stored and processable events in oooo accordance with the order. o••o 13. A method according to either of claim 11 or claim 12, in which, when the o:o•• temporal preference information for a processable event describes an end time and a duration for the processable event, the reviewing step (vi) includes the steps of: identifying periods that are unassigned to events in the temporal schedule when all of the events have been allocated start times; comparing the periods with the duration of the processable event; and -68- providing a notification to the user if the duration of the unassigned periods are less than the duration of the processable event. 14. A method of allocating time to a processable event according to anyone of claims 11 to 13 when the processable event is a meeting between a plurality of entities, the method comprising the steps of: sending a first preferred time period from the first temporal schedule to a further temporal schedule; the temporal schedule receiving a second preferred time period from the further temporal schedule, which second preferred time period has been processed to account for stored temporal preference information relating to the further temporal schedule; and combining the first and second preferred time periods so as to allocate a time to the meeting that satisfies preferences of the temporal preferences of both temporal preference information. 15 A method according to claim 14, in which either or both of: the processable event; and/or (ii) the temporal preference statement associated with the processable event is entered into a graphical user interface via the keyboard. *16. Apparatus according to claims 1 to 9, further comprising a plurality of intelligent autonomous systems that help the user with certain computer based tasks. 17. Apparatus according to claim 16, wherein the intelligent autonomous systems "include at least some of an email assistant, a telephone assistant and a web assistant. 18. Apparatus according to claim 17, including means responsive to an input signal indicative of a state of mind of a user. 19. A computer program comprising a set of instructions to cause a computer to perform the method according to claims 10 to oooo Apparatus for identifying a time substantially as herein described with reference to any one of the embodiments of the invention illustrated in the accompanying drawings. 21. Apparatus for scheduling a meeting substantially as herein described with reference to any one of the embodiments of the invention illustrated in the accompanying drawings. I ~n .lr7lrln~nm~*l*r Pmllrrj- sl:r--mlr+r*ll r r sn;mr:ill irrlrrll:ll :ir~rslr,,srnnl arnnrc~n -69- 22. A method of allocating a time substantially as herein described with reference to any one of the embodiments of the invention illustrated in the accompanying drawings. 23. A computer program substantially as herein described with reference to any one of the embodiments of the invention illustrated in the accompanying drawings. DATED this 11 th Day of November, 2003 BALDWIN SHELSTON WATERS Attorneys for: BRITISH TELECOMMUNICATIONS public limited company **ooo *oo• *oooo o* o* o C117" ~'LI ll~lt~llZ1~ ~II1UIII~:3(IUII-FUIt~~ 11~~17r71~W