Abstract: A methodology of reducing process algebra to a language that facilitates modeling a business workflow process is provided. A process algebra is reduced to a model for business workflow processes. The model is then reduced to a scheduling programming language to allow users to create models of business process by selecting between features of the model and conventional modeling features. The scheduling programming language can be represented as a graphical user interface program that is convertible to a schedule language written in a programmable language. The present invention provides for explicitly representing parallelism within the business workflow process by separating interdependent transactions from independent transactions. The isolation of certain transactions are relaxed, such that users can define transactional boundaries in order to increase granularity of the transaction at an action level and provide visibility of transactions at intermediate steps.

Abstract: The invention provides a database schema for representing a workflow process definition (e.g., a schedule). The database schema may also include one or more bindings associated with the schedule, as well as persisted state information and data. The invention further includes a method for storing schedule information in a storage medium, as well as a computer-readable medium having a data structure stored thereon. The storage of schedule-related information provides for ease of version control, and ease of distribution, for example, where several engines point to the same database as a single source of transaction processing or workflow schedule definitions. The definitional database schema may be advantageously employed to reconstruct the schedule definition language solely from information in a database. In addition, the schema may be used for storing instances of running schedules and data associated therewith. This allows ease of schedule state and data monitoring using existing database query tools.

Abstract: The invention provides a database schema for representing a workflow process definition (e.g., a schedule). The database schema may also include one or more bindings associated with the schedule, as well as persisted state information and data. The invention further includes a method for storing schedule information in a storage medium, as well as a computer-readable medium having a data structure stored thereon. The storage of schedule-related information provides for ease of version control, and ease of distribution, for example, where several engines point to the same database as a single source of transaction processing or workflow schedule definitions. The definitional database schema may be advantageously employed to reconstruct the schedule definition language solely from information in a database. In addition, the schema may be used for storing instances of running schedules and data associated therewith. This allows ease of schedule state and data monitoring using existing database query tools.

Abstract: A method for executing a schedule in a workflow application is provided. The method comprises a hierarchical transaction commit rule allowing access to the data associated with an action in the schedule according to a transaction boundary and the state of the action. The invention further comprises selectively compensating at least one action according to a compensation parameter and at least one transaction boundary after abortion of another action. The invention further provides storing schedule state information to a storage medium based on a transaction boundary within the schedule. In addition, the invention provides for selectively obtaining at least a portion of the schedule state information from the storage medium, and selectively monitoring the schedule execution based on at least a portion of the schedule information obtained from the storage medium. Further provided, is a computer-readable medium having computer-executable instructions for performing the steps of the above methods.

Abstract: Intelligent Trust Management provides a centralized security facility that gives system components a flexible mechanism for implementing security policies. System components such as applications create a request describing an action that needs to be checked against an appropriate security policy. The request is given to a trust system that determines which policy object applies to the request, and may pass request arguments to the policy. The policy objects include executable code that uses any arguments along with dynamically obtained variable information to make a decision. The decision is returned to the system component, which then operates accordingly. Policy objects may maintain state and interface with the user independent of the system component in order to obtain information to make their decisions. Policy objects may call other policy objects and/or mathematically combine the results of other policy objects to make a decision.

Abstract: A server federation cooperatively interacts to fulfill service requests by communicating using data structures that follow a schema in which the meaning of the communicated data is implied by the schema. Thus, in addition to the data being communicated, the meaning of the data is also communication allowing for intelligent decisions and inferences to be made based on the meaning of the data. Cooperative interaction is facilitated over a wide variety of networks by messaging through a common API that supports multiple transport mechanisms. Also, mid-session transfer between client devices is facilitated by schema and the transport-independent messaging structure. The user interfaces of the client devices will appear consistent even if the client devices have different user interface capabilities.

Abstract: A secure transaction system apparatus and method provide for the auditing of secure messages in a computer network. The secure transaction system includes an electronic commerce service which is in communication with multiple consumer computers and multiple merchant computers. The consumer computers initiate consumer transactions between the consumer computers and the merchant computers. Each consumer transaction can include different items, different merchants, different shipping methods and different payment instructions. An order object within the consumer computer stores summaries about the different items, the different merchants, the different shipping methods and different payment instructions during creation of each commercial transaction. While generating transaction data, the consumer computer also generates related audit data.

Abstract: A system is provided to exchange information between a computer and a programmable portable information device (PID) using a standard memory drive, such as a 3.5" disk drive or a PCMCIA port. The PID has a protective encasing with a form factor that is physically compatible with the computer memory drive. In one embodiment, the portable information device has the form factor of a 3.5" memory diskette, while in another embodiment, the portable information device has a form factor of a PCMCIA card. The portable information device includes a keypad and a flat panel display provided on the exterior of the protective encasing, but within the form factor so as not to interrupt the insertion of the portable information device into the memory drive. The uniquely configured portable information device can be inserted into or removed from a standard computer memory drive. When inserted, communication between the portable information device and computer is automatically initiated.

Abstract: An inexpensive, low power visual display device has m n-bit/pixel frame buffers that hold m sets of pixel data, where m>1, and an n-bit controller for switching among the m n-bit/pixel frame buffers at a selected rate during a display cycle. The controller outputs a composite stream of the m sets of pixel data. A display having a matrix of pixels is coupled to the controller to receive the composite stream. The pixels are turned on and off in response to the composite stream of pixel data. Individual pixels have a grayscale shade reflecting an average duration that the individual pixel is on. The visual display device produces m.times.(2.sup.n -1)+1 grayscale shades, including white. The multi-buffer display device can be optimized in a manner which reduces power consumption or increases the number of gray scale colors in comparison to prior art single frame buffer visual display devices. A method for operating visual display devices is also disclosed.

Abstract: A system is provided to exchange information between a computer and a programmable portable information device (PID) using a standard memory drive, such as a 3.5" disk drive or a PCMCIA port. The PID has a protective encasing with a form factor that is physically compatible with the computer memory drive. In one embodiment, the portable information device has the form factor of a 3.5" memory diskette, while in another embodiment, the portable information device has a form factor of a PCMCIA card. The portable information device includes a keypad and a flat panel display provided on the exterior of the protective encasing, but within the form factor so as not to interrupt the insertion of the portable information device into the memory drive. The uniquely configured portable information device can be inserted into or removed from a standard computer memory drive. When inserted, communication between the portable information device and computer is automatically initiated.

Abstract: An exception handler has a priority table which stores information pertaining to priorities for handling one or more concurrently generated interrupts. This table holds all possible priorities of interrupts given the numerous permutations that can arise for any set of active and non-active interrupts. The exception handler also includes a cause register that has flag bits to indicate when an interrupt has been generated. The bits in the cause register define an indexing address to a location in the priority table that contains the priority information for a given combination of active and non-active interrupts. In one implementation, the priority table stores the addresses of interrupt service routines (ISRs) for handling the highest priority active interrupt from among all currently active interrupts. In another implementation, the priority table holds index addresses to a second, ISR address table which associates the interrupts with the addresses of the corresponding ISRs that service them.

Abstract: A visual display system for use in computers includes a frame buffer for holding visual information data in a particular format for ready input to a visual display device. The system also includes a compressed frame buffer for storing the visual information data in a compressed format which can be rapidly decompressed in real-time and used in the visual display device. The data is compressed by a microprocessor during idle times and decompressed by a decompression circuit on the fly. In some circumstances, the power consumed by compressing and then repeatedly handling the compressed data is less than the power used to repeatedly handle the full uncompressed data set. The visual display system analyzes the visual information data and determines whether compression would help save energy. In the event that the handling of compressed data saves energy, the visual display system will use the compressed data set until the information is changed or updated.