Browse Prior Art Database

Automated Presentation of Time-Chained Data Elements

IP.com Disclosure Number: IPCOM000114903D
Original Publication Date: 1995-Feb-01
Included in the Prior Art Database: 2005-Mar-30
Document File: 2 page(s) / 77K

Publishing Venue

IBM

Related People

Weber, OW: AUTHOR

Abstract

Disclosed is a system which automatically generates a graphical calendar of the appropriate size containing time-chained data elements. This is accomplished by giving the user a Chain Function (CF), and automatically locating and converting the appropriate data entries into calendar format.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Automated Presentation of Time-Chained Data Elements

      Disclosed is a system which automatically generates a graphical
calendar of the appropriate size containing time-chained data
elements.  This is accomplished by giving the user a Chain Function
(CF), and automatically locating and converting the appropriate data
entries into calendar format.

      To illustrate, consider a software application which utilizes
data records containing a time stamp.  For example, telephone
applications enable a user to access a log of phone calls.  This log
is displayed in a list box of entries showing the date and time of
the call, as well as the identity of the other party.  The user would
frequently like to identify all calls from/to a certain party.  For
example, when the user returns after an absence from the office,
he/she checks the log to see if any calls were received during the
absence.  If so, the user would frequently like to see a history of
all previous calls with this party.  This is necessary to understand
how often this party has been trying to call, and it could remind the
user of the items discussed during previous calls.  The problem is
that the user can only manually scan the log to isolate the previous
calls from said party.  With the disclosed system, the user can
automatically view the said history in a concise graphical format, as
opposed to paging through multiple pages of the list box while
manually scanning for a particular name.

      Suppose the user accesses the log of time-chained events and
notices that John Doe has called.  The user selects that item and
then he/she selects the CF.  The system automatically searches the
Name column of all entries in the log, isolating all entries for this
party.  The system determines that there were 3 other calls...