314 results about "Successful completion" patented technology

A smart electronic receipt system that provides intelligent receipts, called Smart Receipts, that electronically document a transaction between two parties and maintains a persistent connection between the two parties following a successful online transaction. A Trusted Agent on the Buyer's client system creates an order record which is stored in a database on a Trusted Agent Server and starts the transaction process with the merchant. A Smart Receipt is delivered by a Smart Receipt Agent over a secure connection from the merchant to the Trusted Agent Server upon successful completion of a purchase and reflects the details of the transaction. It is stored in a secure database on the Trusted Agent Server and is made available to the Buyer (user) through a Trusted Agent located on his machine. The Trusted Agent Server compares the order record Limited Edition Digital Objects (LEDOs) stored in database with the Smart Receipt's LEDO to find the corresponding order record. The Smart Receipt provides the customer with detailed information about an online purchase in a standardized format. Hyperlinks embedded in the Smart Receipt enable the customer to access customer service and order status. The merchant may also embed additional services within the Smart Receipt, including special offers for future purchases. Offers provided in a Smart Receipt can be personalized to a user's preferences which are stored on the Trusted Agent Server. Each Smart Receipt is comprised of a chain of LEDOs with each LEDO object having a unique owner. A Smart Receipt is a dynamic entity and is continuously updated until the Buyer deletes it from the Trusted Agent Server.

An improved monetary system using electronic media to exchange economic value securely and reliably is disclosed. The system provides a complete monetary system having electronic money that is interchangeable with conventional paper money. Also disclosed is a system for open electronic commerce having a customer trusted agent securely communicating with a first money module, and a merchant trusted agent securely communicating with a second money module. Both trusted agents are capable of establishing a first cryptographically secure session, and both money modules are capable of establishing a second cryptographically secure session. The merchant trusted agent transfers electronic merchandise to the customer trusted agent, and the first money module transfers electronic money to the second money module. The money modules inform their trusted agents of the successful completion of payment, and the customer may use the purchased electronic merchandise.

Systems and methods consistent with the present invention enable explicit and multilateral trust across a community of federated servers via a network. A trusted third party establishes a framework of policies and procedures governing a federation. Organizations joining the federation submit to an audit process of internal policies and procedures to ensure compliance with the policies and procedures of the federation. Upon successful completion of an audit, an organization may receive a digital certificate containing the digital public key of the organization and indicating approval of the trusted third party. The organization may then use the associated digital private key for signing security assertions associated with a request for resources from another federation service provider. The service provider may trust the assertion from the organization based on trust placed in trusted third party by the service provider and the trust placed in the organization by the trusted third party.

A method of executing and controlling a workflow process includes a request-response control process for coordinating activities between a plurality of entities, whereby an entity creates and sends a message requesting execution of an activity and another entity receives, parses and responds to the request. The message includes activity-specific data and activity status data. The activity status data signifies, for example, whether a corresponding activity has been successfully performed (i.e., completed) or failed. Process information, including control logic for the workflow process, is specified in an at least one uncompiled document, which may include an extensible stylesheet and an extensible markup language document. A document type definition defines the structure of the document. The control logic may include serial, AND-parallel, OR-parallel, XOR-parallel, CON-parallel and iterative instructions and a definition of successful completion and / or failure for an activity according to the control logic. The control logic also specifies a forward transition for a completed activity and a backward transition for a failed activity. A parser processes the message according to the control logic for the workflow process and the document type definition. A compiled workflow engine and database are not required.

Methods and apparatus, including computer program products, for communications in a distributed software system. An operation request from a remote computer is received, and provisionally executes an operation identified by the operation request. A first message is generated. The first message contains a transaction identifier identifying the operation request, an unsuccessful indicator flag, and a temporary data store. The temporary data store identifies tentatively written data generated by the operation. The first message is stored in a message store. If the successful completion of the operation is detected, a second message is generated. The second message contains the transaction identifier as well as a successful indicator flag. The second message is stored in the message store, and the message is transmitted to the remote computer. If the failure of the operation is detected, the message stored in the message store is transmitted to the remote computer.

An XML schema is compiled into an annotated automaton encoding, which includes a parsing table for structural information and annotation for type information. The representation is extended to include a mapping from schema types to states in a parsing table. To validate a fragment against a schema type, it is necessary simply to determine the state corresponding to the schema type, and start the validation process from that state. When the process returns to the state, fragment validation has reached successful completion. This approach is more efficient than a general tree representation. Only the data representation of the schema information is handled, making it much easier than manipulating validation parser code generated by a parser generator. In addition, only one representation is needed for schema information for both document and fragment validation. This approach also provides a basis for incremental validation after update.