U.S. patent application number 09/879954 was filed with the patent office on 2001-10-11 for schedule retrieval method for controlling schedules and schedule server apparatus with multistageous idle-time retrieval means.
Invention is credited to Miyazaki, Tadashi, Nakayama, Yoshinori.
Application Number | 20010029462 09/879954 |
Document ID | / |
Family ID | 17119175 |
Filed Date | 2001-10-11 |
United States Patent
Application |
20010029462 |
Kind Code |
A1 |
Nakayama, Yoshinori ; et
al. |
October 11, 2001 |
Schedule retrieval method for controlling schedules and schedule
server apparatus with multistageous idle-time retrieval means
Abstract
A method in which idle time retrieval is not lumped together but
multistageously so that a burden on a host person for retrieving
idle time for subjects of participation is lightened. The subjects
of participation are divided into some groups so that idle time is
retrieved group by group on the basis of a given retrieval
condition. The retrieval is continued unless the retrieval is
completed for all the groups.
Inventors: |
Nakayama, Yoshinori; (Tokyo,
JP) ; Miyazaki, Tadashi; (Toda-shi, JP) |
Correspondence
Address: |
ANTONELLI TERRY STOUT AND KRAUS
SUITE 1800
1300 NORTH SEVENTEENTH STREET
ARLINGTON
VA
22209
|
Family ID: |
17119175 |
Appl. No.: |
09/879954 |
Filed: |
June 14, 2001 |
Related U.S. Patent Documents
|
|
|
|
|
|
Application
Number |
Filing Date |
Patent Number |
|
|
09879954 |
Jun 14, 2001 |
|
|
|
09379104 |
Aug 23, 1999 |
|
|
|
09379104 |
Aug 23, 1999 |
|
|
|
08931655 |
Sep 16, 1997 |
|
|
|
5974394 |
|
|
|
|
Current U.S.
Class: |
705/7.18 ;
705/7.19 |
Current CPC
Class: |
G06Q 10/1095 20130101;
G06Q 10/06311 20130101; G06Q 10/109 20130101; G06Q 10/1093
20130101 |
Class at
Publication: |
705/9 ;
705/7 |
International
Class: |
G06F 017/60 |
Foreign Application Data
Date |
Code |
Application Number |
Sep 17, 1996 |
JP |
08-244472 |
Claims
What is claimed is:
1. A schedule retrieval method for retrieving a schedule,
comprising: a first step of accepting an initial or first
conference-holding condition of said schedule; a second step of
dividing a subject of said schedule into a plurality of groups; a
third step of comparing one group in said plurality of groups
obtained by division with said first conference-holding condition
to make a coincident result be a new or second conference-holding
condition; a fourth step of comparing one of said plurality of
groups, which is not yet compared with any previous
conference-holding conditions, with the one previous
conference-holding condition to make a coincident result be a
further new or newest conference-holding condition; a fifth step of
performing said fourth step on all the remaining ones of said
plurality of groups which are not yet compared with any previous
conference-holding conditions; and a sixth step of outputting a
retrieval result obtained by said fifth step.
2. A schedule server apparatus connected to terminal apparatuses
allocated to schedule-reserving persons and schedule-reserved
persons through a communication line for retrieving idle time of a
schedule, comprising: a communication control means for
transmitting data to said terminal apparatuses and receiving data
from said terminal apparatuses; and a multistageous idle-time
retrieval means having a function of dividing each of schedules
registered for a plurality of persons and a plurality of equipments
into a plurality of groups and retrieving common idle time from one
of said plurality of groups to make an idle-time retrieval result
be a retrieval condition for retrieving idle time from the schedule
of another group.
3. A schedule server apparatus according to claim 2, wherein
degrees of significance are given to participants respectively so
that schedules of said participants are grouped in the order of the
degree of significance to thereby output idle time correspondingly
to the degrees of significance.
4. A schedule server apparatus according to claim 2, further
comprising means for making registration for a special group,
wherein idle time is retrieved so that at least one of participants
and equipments in said special group satisfies a condition.
5. A recording medium capable of being read by a computer which
retrieves idle time of a schedule comprising: a first step of
accepting an initial or first conference-holding condition of said
schedule; a second step of dividing a subject of said schedule into
a plurality of groups; a third step of comparing one group in said
plurality of groups obtained by division with said first
conference-holding condition to make a coincident result be a new
or second conference-holding condition; a fourth step of comparing
one of said plurality of groups, which is not yet compared with any
previous conference-holding conditions, with the one previous
conference-holding condition to make a coincident result be a
further new or newest conference-holding condition; a fifth step of
performing said fourth step on all the remaining ones of said
plurality of groups which are not yet compared with any previous
conference-holding conditions; and a sixth step of outputting a
retrieval result obtained by said fifth step.
Description
BACKGROUND OF THE INVENTION
[0001] The present invention relates to a schedule management
system for transmitting and receiving individual and equipmental
schedule data between individuals and equipments.
[0002] For example, even in the case where a host person of a
meeting in an office beforehand informs subjects of participation
in the meeting of the date when the meeting will be held, the host
person must sufficiently grasp the schedules of the subjects of
participation to reduce absentees as extremely as possible.
[0003] A technique described in JP-A-5-181867 is a known example
most relevant to the present invention.
[0004] In the conventional technique, a place retrieval function
for retrieving the place for the meeting to be suitable to the
scheduled date of the meeting and a term retrieval function for
calculating the date on which the largest number of persons will
participate in the meeting are used in the schedule management
system to thereby make it possible to aid the generation of notice
of the meeting on the schedule to reduce absentees as extremely as
possible.
[0005] There is however a first problem in the conventional
technique that the place retrieval function and the term retrieval
function need be used repetitively, so that the host person must
re-input or correct the date of the meeting because these functions
must be executed repetitively unless an expected result is
obtained.
[0006] There is a second problem that the date on which absentees
will be reduced most extremely is not always an optimum retrieval
result because the participants are different in significance in
accordance with the schedule of the meeting to be held.
Practically, the participants are different in significance judged
by the host person as to whether they are essential participants or
optional participants. Accordingly, such a date on which the
largest number of participants can attend the meeting but some
essential participants can not attend the meeting may be
retrieved.
[0007] There is a third problem that there is no means for
retrieving the schedule of the meeting for a person representing an
arbitrary group because the schedules for the participants are
inputted individually when the term retrieval function is used. In
the case of such a schedule, the date most suitable to the
condition in which at least one representative participant is
selected from a group necessary for participation in the meeting is
required.
[0008] As described above, it is important that the schedule
management system is used to make a schedule just as the host
person of the meeting designs.
SUMMARY OF THE INVENTION
[0009] A computer system according to the present invention is
configured such that terminal systems allocated to a host person
and subjects of participation are connected to each other so that
data can be transmitted and received between these terminal
systems, and the computer system is provided with a schedule
management function for storing schedules of the host person and
the subjects of participation, and a function for storing
equipmental schedules reserved by the host person separately from
the schedules of the host person and the subjects of
participation.
[0010] According to the present invention, the problems in the
schedule management system is solved by the provision of the
following functions.
[0011] To solve the aforementioned first problem, as in the
multistageous idle-time retrieval system, schedules registered for
participants and equipments are divided into a plurality of groups
so that an idle-time retrieval result for one group is re-set in a
retrieval condition for retrieving idle time for another group. By
this function, the retrieval can be narrowed to the retrieval
result to be intended by the host person.
[0012] To solve the aforementioned second problem, there is
provided a function for setting significance for the participants
and equipments. Schedules of participants and equipments are
classified into groups by significance so that idle-time retrieval
is executed multistageously. As a result, idle time can be
retrieved so that the significance of the participants and
equipments is satisfied.
[0013] To solve the aforementioned third problem, there is provided
a function for registering equipments and participants in a
plurality of special groups. At least one participant or at least
one equipment in each special group must satisfy an idle-time
retrieval condition. By the registration of the special groups, the
date of the meeting by arbitrary persons representing the special
groups using an arbitrary equipment can be retrieved.
BRIEF DESCRIPTION OF THE DRAWINGS
[0014] FIG. 1 is a functional configuration view of a computer
system as an embodiment of the present invention;
[0015] FIG. 2 is a flow chart of an operating procedure in the
embodiment of the present invention;
[0016] FIG. 3 is a processing view for explaining the operating
procedure in the embodiment of the present invention by way of
specific example;
[0017] FIG. 4 is a processing view for explaining the operating
procedure in the embodiment of the present invention by way of
specific example;
[0018] FIG. 5 is a processing view for explaining the embodiment of
the present invention by way of specific example particularly in
the case where degrees of significance are given to
participants;
[0019] FIG. 6 is a processing view for explaining the embodiment of
the present invention by way of specific example particularly in
the case where degrees of significance are given to
participants;
[0020] FIG. 7 is a processing view for explaining the embodiment of
the present invention by way of specific example particularly in
the case where special group definition is provided; and
[0021] FIG. 8 is a processing view for explaining the embodiment of
the present invention by way of specific example particularly in
the case where special group definition is provided.
DESCRIPTION OF THE PREFERRED EMBODIMENT
[0022] An embodiment of the computer system according to the
present invention will be described below with reference to the
drawings.
[0023] FIG. 1 shows a functional configuration view of the computer
system in this embodiment.
[0024] As shown in FIG. 1, the computer system in this embodiment
is designed so that a plurality of client apparatuses 101, 102, . .
. are connected to a schedule server apparatus 114 through a
communication line 113. The schedule server apparatus 114 is
connected to databases 108 to 111 in which various kinds of
information are stored.
[0025] The plurality of client apparatuses 101, 102, . . . are
allocated to a host person and subjects of participation with
respect to a meeting. For example, in FIG. 1, the client apparatus
101 is allocated to a host person of a meeting and the client
apparatus 102 is allocated to a participant of the meeting.
[0026] Incidentally, the configuration of the client apparatus 101
is the same as that of the client apparatus 102 so that each client
apparatus may be used for a host person or for a subject of
participation.
[0027] In this embodiment, the client apparatus 101 has an input
controller 104 for permitting data inputting for performing
schedule inputting of the host person or the subject of
participation of the meeting and performing idle-time retrieval, a
display controller 105 for displaying an input schedule and
outputting retrieval results for persons and equipments, and a
communication controller 106 for transmitting and receiving data
between the schedule server apparatus 114 and the client
apparatuses.
[0028] The schedule server apparatus 114 is connected to various
databases 108 to 111 which will be described later, and has a
database access unit 107 for making access to the various databases
108 to 111, a multistageous idle-time retrieval unit 112 as a
function for retrieving idle time for subjects of participation or
equipments in a term designated by the host person, and a
communication controller 115 for transmitting data to the client
apparatuses 101, 102, . . . and receiving data from the client
apparatuses 101, 102, . . . , through the communication line 113.
The above-mentioned databases include an equipment user account
database 108, an equipment user schedule database 109 for storing
schedules of the subjects of participation and the host person, an
equipment manager account database 110 and an equipment schedule
database 111 for storing schedules of equipments.
[0029] With respect to the multistageous idle-time retrieval means
112 in this embodiment, an overall processing procedure for
retrieving idle time for subjects of participation will be
described with reference to FIG. 2 and the processing procedure in
FIG. 2 will be described on the basis of specific data with
reference to FIGS. 3 and 4.
[0030] Incidentally, it is assumed now that schedules for subjects
of participation are inputted one by one through the input
controller 104.
[0031] First, the host person in an event such as a meeting, or the
like, selects some groups of subjects of participation for the
meeting and inputs other conditions (step 201 in FIG. 2, and step
301 in FIG. 3).
[0032] Because retrieval is not completed yet at this point of
time, a step 202 shifts the control to a step 203.
[0033] In the step 301 in the specific example of FIG. 3, idle time
from 9 o'clock to 19 o'clock is searched as a condition. This is
made to be a retrieval condition 3005.
[0034] Here, idle-time retrieval is made for Group-I 3001 (steps
204 and 302). In this embodiment, first, comparison is made between
A-schedule data 3003 and a retrieval condition (meeting-holding
condition) 3005. From 9 o'clock to 13 o'clock the A-schedule data
3003 has idle time from 10 o'clock to 13 o'clock and from 14
o'clock to 19 o'clock. This result is used as a new retrieval
condition for B-schedule data 3004. A result 401, which shows that
the idle time common to this new retrieval condition and the
B-schedule data 3004 is from 10 o'clock to 12 o'clock, from 14
o'clock to 16 o'clock and from 17 o'clock to 19 o'clock, is
obtained and stored in a memory (not shown) in the schedule server
apparatus 114.
[0035] Because control is further shifted to the step 202 but
retrieval is not completed yet, the step 202 shifts control to the
step 203.
[0036] In the step 203, the previous retrieval result 401 is used
as a retrieval condition in the current retrieval.
[0037] Here, idle-time retrieval is made for Group-II 3002 in the
same manner as in the Group-I 3001 (steps 204 and 402).
[0038] In a step 205, a retrieval result is obtained and stored in
the memory of the schedule server apparatus 114.
[0039] Because control is further shifted to the step 202 and
retrieval is completed at this point of time, the step 202 shifts
control to a step 206.
[0040] Here, the retrieval result is displayed on the display
controller 105 of the client apparatus 101 through the
communication controller 115 of the schedule server apparatus 114
and the communication controller 106 of the client apparatus 101,
so that the content of the display shows a result 403 requested by
the host person (the step 206).
[0041] The above description is the gist of the multistageous
idle-time retrieval method.
[0042] Next, the case where the retrieval method is divided more
multistageously to widen the retrieval condition will be described
below.
[0043] Processing using specific data in this embodiment will be
described with reference to FIGS. 5 and 6.
[0044] When retrieval conditions are inputted, degrees of
significance can be given to the respective subjects of
participation of the meeting to be held as to whether each subject
of participation is essential or not. Significance may be
classified into two values, good and bad, or may be classified into
several values.
[0045] In this embodiment, three values "essential" 511, "optional"
512 and "selective" 513 are prepared as degrees of significance.
Here, "essential" means an essential participant for the meeting,
"optional" means an optional participant and "selective" means a
specially unnecessary participant.
[0046] In an input example 501 in FIG. 5, as the degrees of
significance expressing whether essential or not for the meeting to
be held, Group I is set to "essential" 511, Group II is set to
"optional" 512 and Group III is set to "selective" 513.
[0047] The input condition is directly used as the retrieval
condition so that idle time common to the Group I and the input
condition is retrieved by the multistageous idle-time retrieval
unit 112 (502).
[0048] After that, retrieval by the multistageous idle-time
retrieval means 112 is performed group by group and the retrieval
result is additionally and successively stored in the memory of the
schedule server apparatus 114 without changing the idle time zone
determined by the previous retrieval result.
[0049] For example, because a member belonging to the Group I is
essential, idle time common to the Group I and the retrieval
condition is necessarily stored in the memory. On the other hand,
the retrieval result for the Group II is as shown in 601. That is,
while the idle time common to the Group I and the input condition
remains in the memory, idle time common to the Group I and the
Group II is additionally stored in the memory. The same rule
applies also to the Group III. Finally, a result in accordance with
priority is outputted as the retrieval result 602.
[0050] A retrieval condition may be inputted so that at least one
person representing each group is required to attend the meeting. A
specific example of such a case will be described with reference to
FIGS. 7 and 8.
[0051] Incidentally, in this embodiment, it is assumed that a
meeting room group 7000 is registered as a special group for
schedules other than persons' schedules. The meeting room group
includes equipments such as a meeting room, a tennis court, etc. In
this embodiment, Equipment Y and Equipment Z are registered as the
meeting room group.
[0052] First, it is assumed now that a retrieval condition 701 for
idle time is inputted. An input condition is directly used as the
retrieval condition so that idle time common to the Equipment Y and
the input condition is retrieved (702).
[0053] The retrieval result is as shown in 703. Here, not only idle
time common to the Equipment Y and the input condition is stored in
the memory of the schedule server apparatus 114 but also the input
condition expressing no member is stored in the memory.
[0054] The multistageous idle-time retrieval unit 112 is not used
for the first group subjected to retrieval. For the second group et
seq., retrieval is performed by the multistageous idle time
retrieval unit 112. As retrieval stages, retrieval is performed for
respective subjects of participation as shown in G 704, H 802 and I
804. Incidentally, also in this case, the retrieval result is added
successively without changing the idle time as the previous
retrieval result. Though not shown, the idle time retrieval goes to
retrieval of idle time common to the Equipment Z and the retrieval
condition and retrieval of idle time common to G and the retrieval
condition when the retrieval up to J is completed. Finally, if only
the schedule including at least one element from each group is
outputted as the retrieval result, the result may be that which is
expected by the host person.
[0055] As described above, the idle time retrieval is divided
multistageously so that the retrieval result can be narrowed to a
result intended by the host person.
[0056] Further, degrees of significance are given to subjects of
participation for the meeting so that a time zone in which
essential participants can attend the meeting can be retrieved.
Accordingly, a burden on the host person can be also lightened.
[0057] Furthermore, idle time can be retrieved so that at least one
participant or at least one equipment such as a room satisfies the
condition necessarily.
[0058] Alternatively, the schedule server apparatus 114 may be
replaced by an exclusive-use server apparatus.
[0059] Alternatively, the person and equipment retrieval unit may
be provided in the client apparatuses 101, 102, . . . , not in the
schedule server apparatus 114.
[0060] As is obvious from the above description, in the computer
system according to the present invention, the multistageous
idle-time retrieval unit is used so that the retrieval result for
the subjects of participation for the meeting or for the place
where the meeting is to be held can be narrowed easily and
speedily. Accordingly, labor and time required for the host
person's determination of the term in which the meeting is to be
held can be lightened extremely.
[0061] Further, degrees of significance are set to the subjects of
participation respectively so that a time zone in which essential
participants can attend the meeting necessarily can be retrieved.
Accordingly, a burden on the host person can be also lightened.
[0062] In addition, idle time can be retrieved so that at least one
participant or at least one equipment such as a room satisfies the
condition necessarily.
* * * * *