| 摘要 |
The present invention relates to a method for providing availability services by coordinating between calendars, comprising the steps of: a) dividing each calendar into time cubes such that each calendar is represented as a chronological sequence of uniform time scales (e.g., in a ribbon-like form); b) defining each cube on each specific calendar according to one of the following availability states: free, occupied or pending; c) allowing a user to send data representing an invitation to an event to one or more contacts for approval, and when an invitation of one or more contacts has been approved, opening a secure "private room" and importing to said "private room" the schedule of each approved contact in a confidential manner, such that each schedule of each contact includes data representing only their availability states, wherein all approved contacts including said user are defined as attendees of said event; d) at said secured "private room", searching all imported schedules simultaneously to find at least one option of common available matching time cubes among all attendee that defined as "free" state, or sequence or other combinations of "free" state time cubes between all attendees, and considering all terms as given by said attendees and the data of said event, including time differences between all attendees and approximated traveling time of each attendee; and e) setting the free matching time cubes as occupied, either automatically or after being approved by said attendees, including the proximate traveling time to the meeting / event for each attendee. |
