Browse Prior Art Database

Methodology for Creating a Directed Graph From Unitary Transformation Paths

IP.com Disclosure Number: IPCOM000120203D
Original Publication Date: 1991-Apr-01
Included in the Prior Art Database: 2005-Apr-02
Document File: 3 page(s) / 71K

Publishing Venue

IBM

Related People

Williams, ML: AUTHOR [+2]

Abstract

This article describes a methodology for creating a graphical representation of the relationship between a set of unitary transforms available in a system.

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

Methodology for Creating a Directed Graph From Unitary Transformation
Paths

      This article describes a methodology for creating a
graphical representation of the relationship between a set of unitary
transforms available in a system.

      A convenient way of presenting the available transforms to an
end user is needed to show the relationship that a set of unitary
transforms have to each other.  This disclosure describes a
methodology to present this information in a graphical form so that
the user can quickly determine the transforms available.

      Fig. 1 shows an example of a set of available transform
programs that is available to a user.  Read through the objects to
discover the first object which cannot be transformed into, but which
can be transformed to other documents. Using Fig. 1, IA5 is the first
object which no other objects can be transformed into.  This object
will serve as the origin object.  If there is no object that cannot
be transformed into, select the object that has the least number of
transforms into the object.

      Next, scan the object to which no transforms can be converted
on the object, this object will serve as a destination object. Notice
in Fig. 1 that MO:DCA does not appear on the left side of any of
the arrows for transforms. If such object does not exist, use an
object that has the least number of transforms into it.  It should
also be noted that more than one destination node object may exist.

      Fr...