Recurring transaction processing system and approach

Information

  • Patent Grant
  • 8762238
  • Patent Number
    8,762,238
  • Date Filed
    Thursday, June 9, 2005
    20 years ago
  • Date Issued
    Tuesday, June 24, 2014
    11 years ago
Abstract
Transaction-based interactions are facilitated using recurring transaction processing approaches. According to an example embodiment of the present invention, recurring transactions are managed using rules applicable to parties to the transactions (e.g., as can be automatically associated with the recurring transactions based on information in the transactions and the rules). In this regard, transaction information is processed in accordance with rules characterizing the recurring nature of the transaction to which the information applies. Such transaction recurrence may be implemented, for example, using a cyclic, event-driven or other recurring type of condition. Payment related aspects of the transaction are also carried out based on the transaction processing and related recurring characteristics.
Description
FIELD OF THE INVENTION

The present invention is directed to transaction processing and, more specifically, to the processing and management of recurring transactions involving goods and/or services.


BACKGROUND

Transaction processing has typically involved intensive manual effort and, in instances where automatic processing has been used, intensive user intervention. For example, many transaction processes involve the use of a variety of different types of transaction documents such as orders, invoices, receipts and bills of lading (BOL). These types of transaction documents include information associated with the transaction and used by parties to the transaction to monitor and process the transaction. Many of these and other types of transactions occur on a cyclic or other recurring basis, with elements to the transaction that repeat. While repetitive in nature, certain elements of transactions, such as delivery confirmation and payment, are typically addressed on an individual transaction cycle or period basis.


Cyclic and other recurring transaction documents are electronically processed for a multitude of different types of applications. Interaction data (e.g., electronic or physical documents) describing characteristics of a particular transaction is often encountered in varied temporal order at transaction locations that assemble these documents into logical packages for automated processing. For example, there are often multiple parties to the transaction in addition to the common buyer and seller, such as shippers, financial institutions, distributors and regulatory agencies (e.g., customs, taxation agencies). Each of these parties often provides one or more different types of documents that relate to the transaction, and provides these documents at different times. For instance, an invoice may be sent for a cyclic transaction prior to goods or services for the transaction being accepted. Moreover, the quantity of items for certain cyclic transactions widely vary over time, with associated changes in billing and inventory needing to be made. In addition, different parties to a cyclic transaction often use unique accounting-type data, with automated processing limited to specific transaction parties or specific transaction interactions, with little flexibility.


Many cyclic transactions rely upon control data for controlling many different aspects of the transaction. Transaction terms such as those relating to the quantity of goods and/or services, the price per unit of goods and/or services, delivery conditions, payment terms and more are generally set before the transaction is executed and upon a transaction-by-transaction basis. When changes to transaction terms are made, related data must be updated. At times, these changes require changes for two or more parties to the transaction, with interaction required to adequately address the changes. Thus, when a user makes changes to transaction terms, manual interaction between the user and other parties to the transaction is typically required to ensure that the changes are made for all parties.


Another type of incompatibility that has made cyclic transaction processing difficult is related to the common scenario wherein reference numbers or codes used by different parties are not compatible. For example, in transactions involving buyers and sellers, sellers maintain transaction data organized using their own reference numbers or codes. Buyers typically must access the data using a seller's reference number or codes rather than the buyer's reference number. In addition, buyers and sellers typically use different reference numbers or codes for different characteristics of the transaction, making the monitoring and management of recurring transactions difficult. In particular, where changes are made to recurring transactions, as is more likely over time as relative, for example, to one-time transactions, those changes are difficult to monitor and respond to.


Payment and billing related aspects of traditional recurring transactions are particularly susceptible to billing errors and fraud. For example, there often is little to no connection between the delivery of goods and the billing for the delivery and/or the goods, or no connection between different types of accounting information used for related delivery and billing purposes. This may result in double billing, no billing at all, or overbilling. Auditing errors that cause incorrect billing or payment may also occur. In addition, payment can often be delayed while aspects of a particular transaction are being audited and/or disputed, particularly when different transaction documents must be manually parsed and processed. In addition, when the terms of a recurring transaction are changed, the implementation of those changes is often difficult to address for ensuring proper payment and billing. Delay associated with billing reduces working capital resources for parties to the transaction waiting for payment. Moreover, as time passes, payment events such as payment initiation and termination events may vary in occurrence and type.


Additional costs also arise as a result of existing inefficiencies in a variety of recurring transaction-processing approaches. Many of the costs are individually small, but very large in the aggregate. For example, typical parties to transactions incur administrative costs including those relating to creating and delivering transaction documents, resolving billing disputes, providing a signed copy of documents to other parties and posting accounts receivable. In addition, the cost of parsing, recognizing and categorizing documents related to these and other items add to the administrative costs of transactions.


An additional challenge to transaction management is related to the inability to obtain immediate information regarding a transaction. Transaction data from one party is typically not readily available to other transaction parties without direct access to private-party systems. Since the process of interacting and sharing data for transaction management is largely conducted manually, it is very difficult to track a transaction and real-time data is particularly difficult to come by. For example, there are various manual steps involved in order to learn of the status of performance or payment for a recurring transaction.


The above and other difficulties associated with the management and coordination of transactions have presented challenges to transaction processing, and in particular, to the processing of recurring transactions with the various unique aspects related thereto.


SUMMARY

The present invention is directed to overcoming the above-mentioned challenges and others related to the types of approaches and implementations discussed above and in other applications involving recurring transactions. The present invention is exemplified in a number of implementations and applications, some of which are summarized below.


According to an example embodiment of the present invention, recurring transactions are managed using an approach generally involving the use of transaction information for processing payment-related aspects of the recurring transactions.


In a more particular example embodiment of the present invention, cyclic or other recurring-type characteristics assigned to a particular transaction using data based rules are used to process transaction data. When transaction data is received, the data is associated with transaction data based rules using information received with the transaction data. This association is used to identify (e.g., assign) recurring characteristics to use in processing the transaction data, such as for payment-related aspects of the transaction to which the data applies. These payment-related aspects may involve, for example, a payment initiation (e.g., on a recurring cycle) and a payment termination (e.g., at the completion of recurring cycles).


In another example embodiment of the present invention, a transaction-processing system is adapted for managing a plurality of recurring transactions involving merchant offerings among parties including buyers and sellers. The system includes a transaction databank arrangement that implements one or more data storage devices at one or more distinct locations and that is adapted to store information for recurring transactions between buyers and sellers. The stored information generally includes data associated with conditions of the recurring transaction upon which payment is authorized or otherwise facilitated. A transaction processor is adapted to receive transaction-based data from parties to a transaction and, for each particular recurring transaction, to associate transaction-based data with conditions of the recurring transaction upon which payment is authorized. Using the associated conditions, the transaction processor facilitates payment for each transaction. In some applications, the transaction processor further updates the transaction databank arrangement with billed quantities for the recurring transaction, reflecting a quantity or other characteristic of goods and/or services associated with the recurring transaction as indicated in the received transaction-based data.


According to another example embodiment of the present invention a transaction-processing system processes recurring transactions involving merchant offerings among parties including buyers and sellers. The system includes a transaction databank and a computer (processing) arrangement that interacts with the transaction databank for processing the transactions. The databank, implemented in a single or distributed arrangement, is adapted to store information for a plurality of recurring transactions between buyers and sellers. The stored information includes data associated with conditions of each recurring transaction between a buyer and a seller and upon which conditions payment for invoices can be selectively authorized on behalf of the buyer for each transaction. The computer arrangement is adapted to receive transaction data, audit payment of an invoice, authorize payment and update stored data for each particular recurring transaction. The received transaction-based data generally pertains to buyer and seller parties participating in the particular recurring transaction, with information including conditions upon which payment for invoices can be selectively authorized for the particular recurring transaction, which is stored in the transaction databank. The computer arrangement audits payment of an invoice for the particular recurring transaction as a function of data in the invoice and stored data that specifies conditions of the particular recurring transaction upon which payment can be authorized. The computer arrangement authorizes payment as a function of the audit, e.g., in response to the audit indicating that the recurring transaction is ripe for payment (e.g., payment is not premature) and/or that payment is appropriate based on conditions such as the quantity or merchant offerings that are the subject of the payment. Once payment is authorized, data characterizing billed quantities for the recurring transaction are updated in the transaction databank arrangement to include a billed quantity in the invoice for which payment is authorized.


The above summary of the present invention is not intended to describe each illustrated embodiment or every implementation of the present invention. The figures and detailed description that follow more particularly exemplify these embodiments.





BRIEF DESCRIPTION OF THE DRAWINGS

The invention may be more completely understood in consideration of the detailed description of various embodiments of the invention in connection with the accompanying drawings, in which:



FIG. 1 shows a transaction processing arrangement, according to an example embodiment of the present invention;



FIG. 2 is a flow diagram showing an approach for recurring transaction management, according to another example embodiment of the present invention;



FIG. 3 is another flow diagram for the management of cyclic transaction data, according to another example embodiment of the present invention; and



FIG. 4 is a block diagram showing a storage arrangement for storing and processing cyclic transaction information, according to another example embodiment of the present invention.





While the invention is amenable to various modifications and alternative forms, specifics thereof have been shown by way of example in the drawings and will be described in detail. It should be understood, however, that the intention is not necessarily to limit the invention to the particular embodiments described. On the contrary, the intention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the invention as defined by the appended claims.


DETAILED DESCRIPTION

The present invention is believed to be applicable to a variety of different types of approaches and interactions, and has been found to be particularly useful for applications involving the processing of recurring transactions and related aspects thereof. While the present invention is not necessarily limited to such approaches, various aspects of the invention may be appreciated through a discussion of various examples using these and other contexts.


According to an example embodiment of the present invention, a transaction management system uses stored recurring transaction information to manage a transaction involving the exchange of merchant offerings (e.g., goods and/or services) between a buyer and a seller. Payment for the transaction is automatically audited and authorized as a function of the stored recurring transaction information. Upon receipt of invoice-type data (e.g., via an electronic document or other data transfer approach), the invoice-type data is parsed and associated with a particular recurring transaction. The invoice-type data may be generated, for example, by a party to the transaction or automatically (e.g., by the transaction management system) as defined by programming and stored recurring transaction rules. Item quantities such as goods and/or services associated with the invoice-type data are compared with stored recurring transaction characteristics to determine a payment-related condition. The payment-related condition is then used to determine whether the payment should be made and/or whether conditions relating to the payment such as timing and amount (known and/or estimated) should be taken into consideration. For instance, the transaction management system can be programmed to automatically authorize payment (partial or full) for the transaction when the payment-related condition meets selected criteria. If an invoice is premature (i.e., before a contracted payment date), the invoice can be stored for processing once the payment matures. With this approach, a multitude of types of recurring transactions can be automatically managed.


In one implementation, the transaction management system is configured to manage term characteristics of the recurring transaction. For example, the life and frequency of a particular recurring transaction can be managed using fixed and/or variable type data. Fixed data relating to specific times or time periods can be programmed into the transaction management system. Variable data such as conditions life or term related data can also be programmed into the transaction management system (e.g., the life of a recurring transaction expires after a selected quantity of goods and/or services are rendered).


As another example, transaction events such as a payment initiation event or payment termination event can be used to trigger term characteristics of the transaction. For instance, where a particular recurring transaction is to be carried out on a specified cycle for a set time period, a payment initiation event can be used to start the time period. A payment initiation event can also be used to start other functions, such as tracking functions for quantity of goods and/or services rendered. Payment termination events can similarly be used to trigger other term characteristics of the transaction, such as by ending the transaction with a payment termination event. For instance, a payment flagged as a final payment, or a payment that results in a total amount for a particular transaction having been satisfied, such as for a loan, can be used as an indication that a particular transaction should be ended.


In another example embodiment, payment is authorized in accordance with one or more conditions of delivery. The condition(s) of delivery may include, for example, conditions relating to the physical receipt of the goods by a buyer and/or the acceptance/rejection of the goods by a buyer. For instance, payment can be authorized as a function of a certain percentage of the items pertaining to the transaction being delivered as indicated on an invoice. In this regard, the transaction management system authorizes payment when stored recurring transaction information for the transaction associated with the invoice indicates that delivery has been perfected in a manner consistent with the condition of delivery. In some instances, the transaction management system automatically generates an invoice in response to receiving confirmation of delivery in accordance with conditions of delivery sufficient to authorize payment.


In another example embodiment of the present invention, payment is authorized as a function of timing characteristics associated with the particular recurring transaction. For example, parties to the recurring transaction may agree on a particular payment relationship involving the payment for goods/services at a specified time after performance, or on a particular date for outstanding balances. For instance, where parties agree that a cyclic payment is to be made on the 15th of the month, with payments being made for transactions having a particular transaction closing date (e.g., the last day of the previous month).


In other implementations, timing characteristics are related to the performance of the transaction, such as a time of delivery or service. For instance, the amount of payment for the recurring transaction may be predicated by the timing of delivery of goods for the transaction (e.g., with longer delivery times resulting in lower payment). The timing of the performance of a recurring service transaction may be predicated by the date that the service is performed. In this regard, performance characteristics relating to the transactions can be tied to payment.


In another example embodiment of the present invention, a recurring transaction involving a fixed payment is managed with a transaction management system. Transactions to which this approach is amenable include, for example, rental contracts for building space, lease contracts for equipment or automobiles, insurance contracts, service contracts and more. A transaction management system stores characteristics of a recurring transaction for a particular party to a transaction and automatically manages the payment of fees associated with the recurring transaction. In some instances, invoices are automatically generated. In other instances, invoices received are automatically paid. In still other instances, invoices and payments are automatically processed by the transaction management system.


A variable payment approach is used in another implementation, where recurring transaction rules are used to audit invoice-type data in order to authorize an indicated payment. Parties to a transaction agree upon and store transaction-based rules at a transaction management system. These rules include information that can be used by the transaction management system to evaluate a particular payment amount. When invoice-type data is received (or generated) at the transaction management system, the recurring transaction rules associated with the parties to the transaction for which the invoice-type data is generated are used to determine whether a payment can be made and, in some applications, when the payment is to be made.


In some instances, the recurring transaction rules include tolerance (e.g., percentage) information, where payments within a particular range of a target value can be automatically authorized. For example, where a recurring transaction is a utility transaction for heating gas, a target value can be programmed into the transaction management system. This target value can also be tailored to a particular month of the year, with heating-season months generally having a higher target value than non-heating season months. Information used to set the target value may be based on historical data, such as heating gas usage in a previous year, current heating gas prices and average temperature conditions. Recurring transaction rules can be made to automatically approve heating gas invoices within a particular range (e.g., 10%) of target value. The billed amount on a heating gas invoice is processed to determine whether it is within range of a particular target value, with the target value optionally being set using one or more of the above conditions. If the amount billed is within range, the transaction management system automatically authorizes payment. If the amount billed is out of range, payment is not authorized. In some instances, the transaction management system is programmed to pay up to an authorized amount for an out-of range bill. In other instances, the transaction management system is further optionally programmed to automatically flag the invoice-type data for follow-up to determine whether the out of range portion of the bill can be paid.


In another example embodiment of the present invention, the transaction management system interacts with one or more financial institutions for effecting payment. In this regard, the transaction management system uses recurring transaction data for parties to a transaction to determine a condition of payment for a transaction as discussed above. Rules regarding a relationship between a financial institution and a party (e.g., buyer) to the transaction are the used to authorize payment from the financial institution, on behalf of the party to the transaction, to another party (e.g., seller) to the transaction.


In one implementation, the financial institution automatically pays a seller on a cyclic basis as defined by parties to the transaction and in relation to a cyclic nature of goods and/or services pertaining to the transaction. For example, payment from a financial institution to a seller for a cyclic transaction can be effected on a calendar basis (e.g., the 1st of each month) using the transaction management system to trigger payment. The financial institution then collects payment from the buyer in one or more of a variety of manners, using the transaction management system or otherwise. In addition, the financial institution can pay multiple sellers in this manner for a particular buyer, with the buyer correspondingly making a single payment to the financial institution for all payable amounts based on the cyclic transaction.


In another example embodiment of the present invention, the transaction management system automatically categorizes components of recurring transactions into expense type categories for the buyer for whom payment is being authorized. For instance, where a recurring transaction involved the purchase of goods and services relating to different types of business expenses, the transaction management system not only manages the recurring nature of the transaction, it also automatically categorizes components of each recurring transaction into expense-related categories. For general information regarding transaction management and for specific information regarding the classification of expenditures to which the recurring management approaches discussed herein may apply, reference may be made to U.S. patent application Ser. No. 11/121,158 entitled “Transaction Accounting Processing System and Approach” and filed on May 7, 2005. This patent document is fully incorporated herein by reference.


According to another example embodiment of the present invention, recurring interactions are managed using an approach that facilitates automatically processing certain interaction data as a function of common characteristics of the data. Interaction data from two sources (e.g., two documents) is compared and common data that is found in both sources is used to define a particular interaction category. Additional sources bearing the common data are thus grouped into the particular interaction category. For each category and, in some instances, for each type of document or sub-category within each category, recurring attributes are managed and monitored, with recurring transactions being used to automatically update related transaction data. With this approach, interaction data is automatically categorized into groups that can be used to identify documents and other interaction data that belongs to a particular interaction. For general information regarding interactions and for specific information regarding transactions and the use of comparison and grouping of interaction data to which one or more example embodiments discussed herein may apply, reference may be made to U.S. patent application Ser. No. 10/864,761 entitled “Automated Transaction Processing System and Approach,” filed Jun. 9, 2004 and fully incorporated herein by reference.


Turning now to the figures, FIG. 1 shows a transaction processing arrangement 100, according to another example embodiment of the present invention. The transaction processing arrangement 100 includes a transaction processor 110 having a recurring transaction engine 115 that is configured for processing recurring transaction information and, in some applications, for generating the recurring transaction information on a selected basis. The transaction processor 110 is coupled to a database 112 that is used to store information, including recurring transaction rules 113 and transaction party profile data 114, used by the transaction processor 110 and the recurring transaction engine 115 for processing recurring transactions. The database 112 is selectively implemented using one or more data storage arrangements, which may be located at common or distinct locations and coupled via a network or other communications link.


A plurality of user nodes 120, 122, 124, 126 and 128 are communicatively coupled to the transaction processor 110 for passing transaction-related information. The user nodes include one or more of a variety of transaction parties related to a transaction, such as buyers, sellers, shippers, carriers, financial institutions and regulatory entities. For this example description, the user nodes are implemented as follows: user nodes 120-N represent buyers, 122-N represent sellers, 124-N represent seller financial institutions, 126-N represent buyer financial institutions and 128 represents an administrator that manages and otherwise operates the transaction processor 110.


The recurring transaction engine 115 is programmed to employ the recurring transaction rules 113 stored in the database 112 and/or at one of the user nodes 120-128 to automatically determine a payment-related condition of transactions, such as that related to invoice-type data received via, or generated on behalf of, one of the sellers 122-N. The recurring transaction engine 115 determines whether payment for a recurring transaction is appropriate for a variety of transactions, such as in connection with one or more of the above-discussed approaches to the management and processing of recurring transactions. In this regard, when payment-related data is received (or generated) at the transaction processor 110, the recurring transaction engine 115 automatically associates the payment-related data with one or more of the buyer (120-N) and seller (122-N) parties associated with the transaction using the transaction party profile data 114 in the database 112. For example, when transaction data specifies a particular ID or other data that is assigned to the buyer 120 and the seller 122 (or to a transaction therebetween) in the transaction party profile data 114, the recurring transaction engine 115 associates the transaction data with the buyer and seller.


Using the association, recurring transaction rules 113 for one or more of the buyer, seller and transaction therebetween are implemented by the recurring transaction engine 115 to audit the transaction data for authorizing payment therefor. Payment authorization is thus generally based upon user-defined rules that are stored with the recurring transaction rules 113. For instance, in some applications, the recurring transaction rules 113 specify, for a particular transaction, that payment-related data be compared against stored recurring transaction data to determine a condition relating to the payment for goods and/or services that are the subject of the recurring transaction. If certain conditions (e.g., quantity delivered, approval of delivered goods, percentage of services performed) are met, the recurring transaction engine 115 authorizes payment. If these certain conditions are not met, the recurring transaction engine 115 does not authorize payment. Other conditions upon which payment can be made include, for example, one or more of a payment request date in an invoice, a previous payment date, a previous payment amount, an amount of credit available for use on the buyer's behalf, and a payment request amount in the invoice.


Once payment is authorized, a payment processor 116 uses the authorization to facilitate payment to the seller 122 on behalf of the buyer 120 using transaction party profile data 114 and/or recurring transaction rules 113 applicable to one or both of the buyer and seller. Facilitating payment, in this regard, involves one or more of a variety of functions, depending upon the application; such functions include, for example, one or more of transferring funds, extending credit and sending payment authorization. For instance, where the buyer's profile data stored in the database 112 indicates that payment is to be made from the buyer financial institution 126, and where the seller's similarly-stored profile data indicates that payment is to be made to the seller financial institution 124, the payment processor engine 116 initiates the payment. Where credit is to be extended, an amount of credit available to the buyer is made available via the profile data and used to determine a condition of payment (or ability to pay). The payment to the seller financial institution 124 is made directly from the buyer financial institution 126 or, in some applications (e.g., as programmed at the transaction processor 110), to the administrator 128, which in turn sends payment to the seller financial institution 124. In some applications, one or more of the financial institutions 124-N and 126-N have profile information stored with the transaction party profile data 114 and used by the payment processor 116 to interact therewith for facilitating payment. In other applications, one or more of the financial institutions 124-N and 126-N do not have profile information stored in the database 112, but do have sufficient information stored with particular buyer and/or seller profiles in the database 112 for use by the payment processor 116 in facilitating payment.


A fee processor 117 assesses a fee against one or more transaction parties, on behalf of the administrator 128, for processing the recurring transactions. These fees are assessed, for example, as a function of a transaction amount (e.g., a certain percentage thereof), a flat fee per transaction or a fee per amount of usage by a particular transaction party. For instance, keeping with the example of a recurring transaction between the buyer 120 and the seller 122, the fee processor 117 assesses a fee against the seller 122 (or, if selected, the buyer 120) for processing the transactions, with the fee reflecting each recurrence of the recurring transaction.


In some applications, as discussed in part above, the recurring transaction engine 115 processes payment-related conditions that are generated by the recurring transaction engine 115 at the direction of buyer and seller parties engaging in the recurring transaction. For example, where the buyer 120 and seller 122 agree to recurring transaction terms specifying that a payment be made on the first of each month for a year in a specified amount for a particular good or service, the recurring transaction rules 113 for the recurring transaction specify these terms. Once specified, the recurring transaction engine 115 automatically generates a payment authorization on the first of each month, in the specified amount, every month for a year. Taking this example further, the authorization for the payment may specify that the buyer 120 must agree to the payment before it is made, such that the recurring transaction engine 115 generates a payment authorization on the first of the month, in response to an agreement received from the buyer 120. A variety of such payment-related conditions are thus specifiable by parties to transactions processed by the transaction processor 110, as stored in the recurring transaction rules 113 and used to initiate and/or authorize payment for a recurring transaction.


The database 112 can be used to store transaction-related data that can be tailored for characteristics of specific transactions. The stored transaction-related data may include, for example, transaction party profile data 114 that specifies the identity of parties to the transaction. The recurring transaction rules 113 may specify the identity of the transaction (e.g., transaction-specific number, loan number, and account number), beginning and/or ending payment dates and fixed or flexible payment amounts. In addition, processing data such as that used for determining what criteria is sufficient for authorizing payment and for notification of payment-related timing characteristics (e.g., notice of service acceptance) is selectively stored with the recurring transaction rules 113. In this regard, data for each recurring transaction served by the database can be stored accordingly having data of a specific recurring nature as identified, for example, by timing and processing characteristics.


In some instances, the transaction processor 110 is adapted to automatically exchange data with one or more user nodes, with authorization data being used to control information access at one or both of the transaction processor and the user node(s). For instance, using data source identification (e.g., address) and authorization (e.g., password) information stored with the transaction party profile data 114 at the database 112, the transaction processor 110 can access remote data sources at one or more of the user nodes 120-128. Program information stored at the database 112 is used for extracting information from remote data sources. Extracted information includes, for example, payment-related conditions for recurring transactions, payment initiation information, payment termination information and/or merchant offerings provided to a buyer. A comparison and/or other processing approach involving the extracted information is selectively implemented for auditing aspects of and/or facilitating payment for the transaction.


Using user node 120 as an example and wherein the user node includes a processor and a data source (e.g., the user node 120 is a computer), the transaction processor 110 selectively interacts with the processor at the user node 120 to retrieve information stored at the data source. Similarly, a user a user node 120 can, with proper programming and access authorization, access the database 112 via the transaction processor 110 for retrieving, changing and/or storing data, when a request for such access matches information stored with the transaction party profile data 114.


In another implementation, one or more of the user nodes 120-128 includes a user interface configured for receiving information that can be used for interacting with the transaction processor. The user interface may be generated at the user node (using, e.g., an application program), or generated by the transaction processor 110 and accessible by users at the user nodes via a network such as the Internet. In these applications, the user interface facilitates the exchange of information, such as requests for reports, the storage of profile or transaction rule information in the database 112, or data relating to the provision of an invoice.


A variety of transaction events can be used in initiating payment for a particular recurring transaction, depending upon the particular application. These payment initiating events are stored with the recurring transaction rules 116 in the database 112 and implemented by the recurring transaction engine 115 to initiate a payment request (e.g., to facilitate the processing of a received or generated invoice). One such example transaction between the buyer 120 and the seller 122 has a monthly payment cycle, with the transaction event being the first day of each month. In this regard, on the first day of the month, the recurring transaction engine 115 facilitates the initiation of a payment request. In some applications, the recurring transaction rules 116 simply indicate that payment is to be made in a particular amount on the first of the month. In other applications, the recurring transaction rules 116 specify that payment can be made on the first of the month, when certain other criteria are met. Such criteria include, e.g., the seller 122 providing an invoice, the buyer 120 approving an invoice, the buyer acknowledging the receipt of goods and/or services, or an invoice matching, or falling within a particular tolerance of, a predefined amount. Where a new transaction is initiated, a payment initiation may involve the receipt of a notice of service acceptance by the buyer 120. After a first such payment initiation, the recurring transaction rules 113 are used to generate a recurring payment request on the first day of the month, with this example.



FIG. 2 is a flow diagram showing an approach for cyclic transaction management, according to another example embodiment of the present invention. The approach shown in FIG. 2 may be implemented, for example, in connection with the transaction processing arrangement 100 shown in FIG. 1.


At block 210, cyclic accounting profile attributes are stored for a plurality of transaction parties such as buyers, sellers and financial institutions via which payment for transactions between buyers and sellers is transferred. These cyclic accounting profile attributes are stored in a database arrangement. Cyclic transaction events are generated using the stored cyclic accounting profile attributes at block 220. These accounting profile attributes may specify, for example, conditions upon which a transaction event such as a payment initiation is generated (e.g., a date, the receipt of a particular set of data from a transaction party such as a receipt for goods and/or services, or quantity data indicating that a particular item is below a specified level and reorder is appropriate).


Upon receipt of an invoice for a cyclic transaction event at block 230, the transaction database is parsed to identify received items corresponding to the invoice. That is, where an invoice specifies a particular item for which payment is requested, the database is parsed to identify corresponding items. In this regard, if received items in the database indicate a payable condition for the invoice at block 240 (i.e., items for which payment is requested on the invoice have been delivered), payment for the invoice is authorized at block 250. In addition, once payment is authorized and also in connection with block 250, a payment field is updated to reflect the payment for the received items in the database.


If the received items as indicated in the database do not indicate a payable condition for an invoice at block 240, the invoice is placed into a not-payable status at block 260. Such a not-payable status is generally maintained together with the invoice data until such time as the invoice becomes payable. In this regard, the status of the received items as stored in the database is monitored at block 270 and, when the received items indicate a payable condition for the invoice at block 240, payment is facilitated at block 250 as discussed above.


In some applications, and again referring to FIG. 2, payment for a partial amount of items (or services) indicated on an invoice is facilitated at block 250, with payment for other items placed in a not-payable status at block 260. For instance, where an invoice specifies an amount that covers more than an amount of goods received for a particular transaction, payment for a received portion of the goods is facilitated while payment for goods that have not been received is delayed until the receipt thereof. Similarly, where an invoice specifies payment for more than one recurrence in a recurring transaction, payment can accordingly be authorized as a function of each recurrence happening (i.e., in response to the delivery of goods and/or services corresponding to a particular recurrence). For instance, when a particular recurring transaction specifies that a seller is to deliver a set amount of a particular good on the first of each month for one year, a single invoice from the seller can be used to facilitate payment for the transaction. When delivery of each recurrence is reflected in received item data in the database, payment for that recurrence is authorized while payment for any remaining recurrences is withheld.



FIG. 3 is another flow diagram showing an approach to the management of recurring transaction data, with recurring data of a cyclic nature discussed by way of example, according to another example embodiment of the present invention. The approach shown in FIG. 3 may be implemented, for example, in connection with the transaction processing arrangement 100 shown in FIG. 1, for storing and/or updating information such as the recurring transaction rules 113 or other transaction-specific quantity, price or recurrence data, stored in the database 112.


At block 310, transaction data having cyclic transaction identification information is received and cyclic transaction data fields (e.g., stored in a database) are parsed for data that matches the received data at block 320. The identification information includes, for example, buyer or seller identification numbers, a transaction identification number or other information that can be used for associating the transaction data with a particular transaction. If the cyclic transaction identification information does not match stored cyclic transaction data in the data fields at block 330, the process stops at block 340. If there is such a match at block 330, but an update to the stored cyclic transaction information is not allowed (e.g., if the information received at block 310 does not have proper authorization or if access to the stored information is somehow restricted) at block 350, the process stops at block 340.


If there is a match at block 330 and updates are allowed at block 350, the stored cyclic transaction data is updated at block 360 with the transaction data received at block 310. In some applications, notification regarding the update data is provided to associated parties to the cyclic transaction at block 370.



FIG. 4 is a block diagram showing a storage arrangement 400 for storing and processing recurring transaction information, according to another example embodiment of the present invention. A central processor 410 interacts with users 402 via a communications node 405 for receiving and storing transaction data upon which transactions are processed, for receiving information indicating a payment event, for facilitating payment for transactions or for interacting with a variety of users in the facilitation of recurring transactions. For instance, as discussed in connection with FIG. 1, interactions with users 402 via the communications node 405 may involve direct users such as buyers and sellers or indirect users such as financial institutions. In general, the user interaction involves initial interaction for establishing rules or profile information. In addition, the user interaction also typically involves the generation and/or communication of invoice data for recurring transactions. In some applications, the user interaction also involves the communication of updates for updating stored information, of receipts to acknowledge receipt of goods and/or services or of information such as stock quantity that can be used in processing recurring transactions.


The central processor 410 controls the storage of and access to recurring transaction data at storage locations 420, 430, 440 and 450. The storage location 420 is used to store profile information for transaction parties, as applicable to different transactions in which the parties are involved. Each of the storage locations 430-450 is assigned to a particular recurring transaction, with data associated with the particular recurring transaction stored therewith, and including information specifying one or more profiles, in the storage location 420, that apply to the particular recurring transaction.


The data stored in the cyclic transaction data storage locations 430-450 generally includes sufficient information for facilitating payment for recurrences of a particular cyclic transaction, such as information identifying a recurring date or other event at which payment is to be processed, as well as data identifying parties and, ultimately, payment conditions. In some applications, where appropriate, other cyclic transaction data such as order amounts, thresholds, stock levels and others as discussed herein are stored with the cyclic transaction data storage locations 430-450.


While certain aspects of the present invention have been described with reference to several particular example embodiments, those skilled in the art will recognize that many changes may be made thereto without departing from the spirit and scope of the present invention, aspects of which are set forth in the following claims.

Claims
  • 1. A transaction-processing system for processing a plurality of recurring transactions involving merchant offerings among parties including buyers and sellers, the system comprising: a transaction databank arrangement and a computer arrangement, wherein the transaction databank arrangement and the computer arrangement are both remote from the buyers and the sellers, andwherein, for each particular recurring transaction from the plurality of recurring transactions: the particular recurring transaction is between a particular buyer and a particular seller,the transaction databank arrangement stores data representing billed quantities of merchant offerings for the particular recurring transaction, andthe computer arrangement: receives transaction-based data from the particular buyer and the particular seller,stores the received transaction-based data in the transaction databank arrangement, the transaction-based data including conditions upon which payment for invoices can be selectively authorized for the particular recurring transaction on behalf of the particular buyer,receives an electronic communication including data representing an invoice for the particular recurring transaction from the particular seller, the electronic communication being devoid of any identification for the particular recurring transaction that is provided to the particular seller by the particular buyer,audits a payment of the invoice as a function of data in the invoice and the conditions upon which payment for invoices can be authorized for the particular recurring transaction,authorizes the payment of the invoice as a function of the audit of payment of the invoice, andupdates the data representing the billed quantities of the merchant offerings for the particular recurring transaction in the transaction databank arrangement to include a billed quantity of merchant offerings in the invoice, the billed quantity of merchant offerings in the invoice representing a quantity of items from the invoice for which payment is authorized.
  • 2. The system of claim 1, wherein the computer arrangement: determines a condition of payment maturity of the invoice, audits the payment of the invoice by: auditing quantities of merchant offerings specified in the invoice against data representing historical billed and paid quantities of merchant offerings stored in the transaction databank arrangement for the particular recurring transaction, andapproving payment for the quantities of merchant offerings specified in the invoice in response to an indication that the quantities of merchant offerings specified in the invoice have not been previously billed and paid, andin response to the payment of the invoice being determined premature: stores the invoice,monitors the condition of payment maturity, andwhen payment for the invoice is determined to be mature: authorizes the payment of the invoice, andupdates the data representing the historical billed and paid quantities of merchant offerings for the particular recurring transaction to include the quantities of merchant offerings in the invoice.
  • 3. The system of claim 1, wherein the computer arrangement: audits the payment of the invoice by automatically determining whether a quantity of merchant offerings has been previously billed and paid and to approve the payment of the invoice responsive thereto, andaudits and authorizes the payment of the invoice independent of any identification for the particular recurring transaction that is provided to the particular seller by the particular buyer.
  • 4. The system of claim 1, wherein: the transaction databank arrangement stores delivery data indicative of a delivered transaction item quantity, andthe computer arrangement audits the payment of the invoice by comparing transaction item quantity data from the invoice with the delivery data, andthe computer arrangement authorizes the payment of the invoice in response to the audit of the payment of the invoice indicating that the transaction item quantity from the invoice has been delivered.
  • 5. The system of claim 1, wherein: the transaction databank arrangement stores information specifying a termination condition for terminating the particular recurring transaction, andthe computer arrangement terminates the particular recurring transaction as a function of the termination condition.
  • 6. The system of claim 1, wherein: the transaction databank arrangement includes fee information for assessing a fee for processing the particular recurring transaction, andthe computer arrangement assesses the fee for processing the particular recurring transaction against one of the particular buyer and the particular seller.
  • 7. The system of claim 1, wherein the computer arrangement: interacts with remote processing arrangements to extract information specifying payment-related conditions for the particular recurring transaction, andauthorizes the payment of the invoice as a function of the payment-related conditions for the particular recurring transaction.
  • 8. The system of claim 7, wherein the computer arrangement: extracts information from the particular seller that specifies merchant offerings provided to the particular buyer in connection with the particular recurring transaction,audits the payment of the invoice by comparing the merchant offerings provided to the particular buyer in connection with the particular recurring transaction with the conditions upon which payment for invoices can be selectively authorized for the particular recurring transaction, andauthorizes the payment of the invoice by authorizing payment for the specified merchant offerings as a function of the audit.
  • 9. The system of claim 1, wherein: the transaction databank arrangement stores information specifying a payment initiation condition for the particular recurring transaction, andthe computer arrangement initiates a recurring payment for the particular recurring transaction as a function of the payment initiation condition.
  • 10. The system of claim 1, wherein the computer arrangement: audits the payment of the invoice in part by comparing a billed amount in the invoice with specified conditions that indicate an acceptable range of billed amounts, andauthorizes the payment of the invoice as a function of the audit of the payment of the invoice by: authorizing the payment of the invoice in response to the billed amount in the invoice falling in the acceptable range of billed amounts, anddenying the payment of the invoice in response to the billed amount in the invoice falling outside the acceptable range of billed amounts.
  • 11. The system of claim 1, wherein the computer arrangement audits the payment of the invoice as a function of at least one of: a payment request date in the invoice,a previous payment date,a previous payment amount,an amount of credit available for use on behalf of the particular buyer, anda payment request amount in the invoice.
  • 12. The system of claim 1, wherein the computer arrangement: receives transaction-based data including proposed recurring transaction conditions from the particular seller,receives transaction-based data including a notice of service acceptance of the proposed recurring transaction conditions from the particular buyer, andaudits the payment of the invoice as a function of the notice of service acceptance being received.
  • 13. A method for processing recurring transactions involving merchant offerings among parties including buyers and sellers, the method being implemented by data-processing circuitry and comprising: storing information for a plurality of recurring transactions between buyers and sellers in a transaction databank arrangement that is remote from the buyers and the sellers, wherein for each particular recurring transaction from the plurality of recurring transactions: the particular recurring transaction is between a particular buyer and a particular seller,the stored information for the particular recurring transaction includes data representing billed quantities of merchant offerings for the particular recurring transaction and data associated with conditions upon which payment for invoices can be selectively authorized on behalf of the particular buyer, andusing at least one data-processing circuit for: receiving transaction-based data from the particular buyer and the particular seller,storing the received transaction-based data in the transaction databank arrangement, the transaction-based data including conditions upon which payment for invoices can be selectively authorized for the particular recurring transaction,receiving an electronic communication including data representing an invoice for the particular recurring transaction from the seller, the electronic communication being devoid of any identification for the particular recurring transaction that is provided to the particular seller by the particular buyer;auditing a payment of the invoice as a function of data in the invoice, the billed quantities of merchant offerings for the particular recurring transaction and the conditions upon which payment for invoices can be selectively authorized on behalf of the buyer,authorizing the payment of the invoice as a function of the audit, andupdating the data representing the billed quantities of merchant offerings for the particular recurring transaction in the transaction databank arrangement to include a billed quantity of merchant offerings in the invoice, the billed quantity of merchant offerings representing a quantity of items from the invoice for which payment is authorized.
  • 14. The method of claim 13, further comprising: determining a condition of payment maturity of the particular recurring transaction, andin response to the payment for the invoice being determined premature: storing the invoice,monitoring the condition of payment maturity for the particular recurring transaction, andwhen the payment for the invoice is determined to be mature: authorizing the payment of the invoice, andupdating the data representing the billed quantities of merchant offerings for the particular recurring transaction in the transaction databank arrangement to include the billed quantity of merchant offerings in the invoice.
  • 15. The method of claim 13, wherein the method further comprises: extracting information specifying payment-related conditions for the particular recurring transaction from a remote processing arrangement,extracting, from the particular seller, information that specifies merchant offerings provided to the particular buyer in connection with the particular recurring transaction,wherein auditing the payment of the invoice comprises comparing the extracted specified merchant offerings with the payment-related conditions for the particular recurring transaction, andwherein authorizing the payment of the invoice comprises authorizing payment for the extracted specified merchant offerings as a function of the audit, wherein the auditing of the payment of the invoice and authorizing the payment of the invoice is performed independent of any identification for the particular recurring transaction that is provided to the seller by the buyer.
  • 16. The method of claim 13, wherein auditing the payment of the invoice comprises auditing the payment of the invoice as a function of at least one of: a payment request date in the invoice,a previous payment date,a previous payment amount,an amount of credit available for use on behalf the particular buyer, anda payment request amount in the invoice.
  • 17. A transaction-processing system for processing a plurality of recurring transactions involving merchant offerings among parties including buyers and sellers, different ones of the recurring transactions involving different ones of the buyer and sellers, the system comprising a data storage arrangement, a recurring transaction engine, a payment processor, and a fee processor, wherein for each particular recurring transaction in the plurality of recurring transactions: the particular recurring transaction is between a particular buyer and a particular seller,the data storage arrangement stores transaction-based data for the particular recurring transaction, the transaction-based data for the particular recurring transaction including profile information for at least one of the particular buyer and the particular seller, data for identifying financial institutions for implementing the processing of payment for the particular recurring transaction, and data for associating invoices with transaction rules specifying conditions upon which payment for the invoices can be selectively authorized for the particular recurring transaction,in response to receiving a notice of service acceptance from the particular buyer in the particular recurring transaction, the recurring transaction engine: receives electronic communications including data representing invoices for the particular recurring transaction from the particular seller, the electronic communications being devoid of any identification for the particular recurring transaction that is provided to the particular seller by the particular buyer,associates the invoices with the transaction rules as a function of profile information for the particular recurring transaction,audits each associated invoice against the transaction rules associated therewith,authorizes payments for each associated invoice as a function of the audit, andupdates stored data characterizing billed quantities for the particular recurring transaction to include a billed quantity in the invoices for which payment is authorized,the payment processor interacts with a financial institution specified in the profile information stored in the data storage arrangement for the recurring transaction to facilitate payment in response to payment authorization from the recurring transaction engine; andthe fee processor assesses a fee against at least one of the particular buyer and the particular seller for processing the particular recurring transaction.
  • 18. The system of claim 17, wherein the recurring transaction engine: accesses a remote database implemented by one of the particular buyer and the particular seller,extracts, from the remote database, data upon which payment for the particular recurring transaction can be authorized, andaudits each of the invoices associated with the particular recurring transaction against the transaction rules by auditing each of the invoices against the extracted data.
  • 19. The system of claim 17, wherein the recurring transaction engine terminates processing and payment authorization for the particular recurring transaction in response to a transaction termination condition.
  • 20. For use in processing a plurality of recurring business-to-business electronic transactions at a central location that is independent from buyers and sellers in the transactions, a computer-based system for storing and using buyer and seller profile data, data representing historical billed and paid quantities of merchant offerings, and buyer-specified data upon which data in seller-provided invoices can be audited and paid, the computer-based system comprising a central transaction databank arrangement and a computer processor, wherein the central transaction databank arrangement is located remote from the buyers and the sellers involved in the recurring transactions,wherein the central transaction databank arrangement stores said profile and buyer-specified data; andfor each particular recurring transaction from the plurality of recurring transactions: the particular recurring transaction is between a particular buyer and a particular seller,the central transaction databank arrangement stores historical billed quantities of merchant offerings for the particular recurring transaction, andthe computer processor: receives transaction-based data from the particular buyer and the particular seller,stores the received transaction-based data in the central transaction databank arrangement, the transaction-based data including conditions upon which payment for invoices can be selectively authorized for the particular recurring transaction,receives an electronic communication including data representing an invoice for the particular recurring transaction from the seller, the electronic communication being devoid of any identification for the particular recurring transaction that is provided to the seller by the buyer;audits a payment of the invoice as a function of data in the invoice, the stored profile data for the particular buyer and the particular seller, the stored data regarding historical billed and paid quantities of merchant offerings for the particular recurring transaction, and the conditions upon which payment for invoices can be selectively authorized for the particular recurring transaction,authorizes the payment of the invoice as a function of the audit, andupdates the data representing the billed and paid quantities of merchant offerings for the particular recurring transaction to include a billed quantity of merchant offerings in the invoice, the billed quantity of merchant offerings in the invoice representing a quantity of items from the invoice for which payment is authorized.
RELATED PATENT DOCUMENTS

This patent document claims priority under 35 U.S.C. §119 to U.S. Provisional Patent Application Nos. 60/578,689 and 60/578,429, respectively entitled “Automated Cyclic Transaction Processing System and Approach” and “Automated Transaction Processing System and Approach,” both filed on Jun. 9, 2004; this application is a continuation-in-part of U.S. patent application Ser. No. 10/864,761, entitled “Automated Transaction Processing System and Approach,” also filed on Jun. 9, 2004.

US Referenced Citations (480)
Number Name Date Kind
4114027 Slater et al. Sep 1978 A
4270042 Case May 1981 A
4305059 Benton Dec 1981 A
4412287 Braddock, III Oct 1983 A
4507778 Tan Mar 1985 A
4567359 Lockwood Jan 1986 A
4713761 Sharpe et al. Dec 1987 A
4725719 Oncken et al. Feb 1988 A
4750119 Cohen et al. Jun 1988 A
4799156 Shavit et al. Jan 1989 A
4926325 Benton et al. May 1990 A
4949272 Vanourek et al. Aug 1990 A
4960981 Benton et al. Oct 1990 A
4992940 Dworkin Feb 1991 A
4995112 Aoyama Feb 1991 A
4996662 Cooper et al. Feb 1991 A
5008827 Sansone et al. Apr 1991 A
5017766 Tamada et al. May 1991 A
5025372 Burton et al. Jun 1991 A
5040132 Schuricht et al. Aug 1991 A
5043908 Manduley et al. Aug 1991 A
5054096 Beizer Oct 1991 A
5077694 Sansone et al. Dec 1991 A
5117364 Barns-Slavin et al. May 1992 A
5151948 Lyke Sep 1992 A
5153842 Dlugos, Sr. et al. Oct 1992 A
5159667 Borrey et al. Oct 1992 A
5161109 Keating et al. Nov 1992 A
5168444 Cukor et al. Dec 1992 A
5175416 Mansvelt et al. Dec 1992 A
5208446 Martinez May 1993 A
5218188 Hanson Jun 1993 A
5220501 Lawlor et al. Jun 1993 A
5222018 Sharpe et al. Jun 1993 A
5231569 Myatt et al. Jul 1993 A
5238349 Grace, Sr. Aug 1993 A
5285383 Lindsey et al. Feb 1994 A
5293310 Carroll et al. Mar 1994 A
5329589 Fraser et al. Jul 1994 A
5334823 Noblett, Jr. et al. Aug 1994 A
5334824 Martinez Aug 1994 A
5337246 Carroll et al. Aug 1994 A
5357563 Hamilton et al. Oct 1994 A
5393963 Thomas et al. Feb 1995 A
5426281 Abecassis Jun 1995 A
5440634 Jones et al. Aug 1995 A
5483445 Pickering Jan 1996 A
5485369 Nicholls et al. Jan 1996 A
5500513 Langhans et al. Mar 1996 A
5631821 Muso May 1997 A
5631827 Nicholls et al. May 1997 A
5652749 Davenport et al. Jul 1997 A
5666493 Wojcik et al. Sep 1997 A
5671362 Cowe et al. Sep 1997 A
5677955 Doggett et al. Oct 1997 A
5694334 Donahue et al. Dec 1997 A
5694551 Doyle et al. Dec 1997 A
5699528 Hogan Dec 1997 A
5712990 Henderson Jan 1998 A
5717989 Tozzoli et al. Feb 1998 A
5719771 Buck et al. Feb 1998 A
5732400 Mandler Mar 1998 A
5754854 Kanamori et al. May 1998 A
5770844 Henn Jun 1998 A
5774170 Hite et al. Jun 1998 A
5790790 Smith et al. Aug 1998 A
5794207 Walker et al. Aug 1998 A
5799286 Morgan et al. Aug 1998 A
5806063 Dickens Sep 1998 A
5842178 Giovannoli Nov 1998 A
5845283 Williams Dec 1998 A
5870719 Maritzen et al. Feb 1999 A
5892900 Ginter et al. Apr 1999 A
5893080 McGurl et al. Apr 1999 A
5896530 White Apr 1999 A
5897645 Watters Apr 1999 A
5910896 Hahn-Carlson Jun 1999 A
5917830 Chen et al. Jun 1999 A
5918216 Miksovsky et al. Jun 1999 A
5918229 Davis et al. Jun 1999 A
5920847 Kolling et al. Jul 1999 A
5924082 Silverman et al. Jul 1999 A
5924089 Silverman et al. Jul 1999 A
5930363 Stanford et al. Jul 1999 A
5931917 Nguyen et al. Aug 1999 A
5943670 Prager et al. Aug 1999 A
5956690 Haggerson et al. Sep 1999 A
5956700 Landry Sep 1999 A
5960407 Vivona Sep 1999 A
5970475 Barnes et al. Oct 1999 A
5973475 Schaffa et al. Oct 1999 A
5978567 Rebane et al. Nov 1999 A
5982891 Ginter et al. Nov 1999 A
5987506 Carter et al. Nov 1999 A
5991728 DeBusk et al. Nov 1999 A
5991801 Rebec et al. Nov 1999 A
5995976 Walker et al. Nov 1999 A
6012041 Brewer et al. Jan 2000 A
6016477 Ehnebuske et al. Jan 2000 A
6021202 Anderson et al. Feb 2000 A
6026374 Chess Feb 2000 A
6029140 Martin et al. Feb 2000 A
6029150 Kravitz Feb 2000 A
6043819 LeBrun et al. Mar 2000 A
6044362 Neely Mar 2000 A
6047268 Bartoli et al. Apr 2000 A
6055519 Kennedy et al. Apr 2000 A
6058380 Anderson et al. May 2000 A
6070150 Remington et al. May 2000 A
6085200 Hill et al. Jul 2000 A
6097834 Krouse et al. Aug 2000 A
6115649 Sakata Sep 2000 A
6115711 White Sep 2000 A
6119163 Montiero et al. Sep 2000 A
6128602 Northington et al. Oct 2000 A
6131087 Luke et al. Oct 2000 A
6141653 Conklin et al. Oct 2000 A
6151588 Tozzoli et al. Nov 2000 A
6157924 Austin Dec 2000 A
6167378 Webber, Jr. Dec 2000 A
6169542 Hooks et al. Jan 2001 B1
6199046 Heinzle et al. Mar 2001 B1
6204763 Sone Mar 2001 B1
6209095 Anderson et al. Mar 2001 B1
6223168 McGurl et al. Apr 2001 B1
6236972 Shkedy May 2001 B1
6246994 Wolven et al. Jun 2001 B1
6254000 Degen et al. Jul 2001 B1
6260024 Shkedy Jul 2001 B1
6266640 Fromm et al. Jul 2001 B1
6267292 Walker et al. Jul 2001 B1
6275813 Berka Aug 2001 B1
6285916 Kadaba et al. Sep 2001 B1
6317737 Gorelik et al. Nov 2001 B1
6323894 Katz et al. Nov 2001 B1
6324522 Peterson et al. Nov 2001 B2
6324551 Lamping et al. Nov 2001 B1
6330550 Brisebois et al. Dec 2001 B1
6338044 Cook et al. Jan 2002 B1
6357042 Srinivasan et al. Mar 2002 B2
6366289 Wallace Apr 2002 B1
6381587 Guzelsu Apr 2002 B1
6389402 Ginter et al. May 2002 B1
6418441 Call Jul 2002 B1
6421691 Kajitani Jul 2002 B1
6442533 Hinkle Aug 2002 B1
6477510 Johnson Nov 2002 B1
6486899 Bush et al. Nov 2002 B1
6490567 Gregory Dec 2002 B1
6493685 Ensel et al. Dec 2002 B1
6499036 Gurevich Dec 2002 B1
6505169 Bhagavath et al. Jan 2003 B1
6505172 Johnson et al. Jan 2003 B1
6507826 Maners Jan 2003 B1
6510383 Jones Jan 2003 B1
6510384 Okano Jan 2003 B2
6526443 Goldsmith et al. Feb 2003 B1
6539360 Kadaba Mar 2003 B1
6571149 Hahn-Carlson May 2003 B1
6598026 Ojha et al. Jul 2003 B1
6607081 Graef et al. Aug 2003 B2
6629081 Cornelius et al. Sep 2003 B1
6673479 McArthur et al. Jan 2004 B2
6684384 Bickerton et al. Jan 2004 B1
6687713 Mattson et al. Feb 2004 B2
6697702 Hahn-Carlson Feb 2004 B1
6704612 Hahn-Carlson Mar 2004 B1
6721613 Yamamoto et al. Apr 2004 B1
6721715 Nemzow Apr 2004 B2
6741968 Jacoves et al. May 2004 B2
6751630 Franks et al. Jun 2004 B1
6785661 Mandler et al. Aug 2004 B1
6789252 Burke et al. Sep 2004 B1
6792459 Elnozahy et al. Sep 2004 B2
6820038 Wetzer et al. Nov 2004 B1
6829590 Greener et al. Dec 2004 B1
6832212 Zenner et al. Dec 2004 B1
6833865 Fuller et al. Dec 2004 B1
6850900 Hare et al. Feb 2005 B1
6873963 Westbury et al. Mar 2005 B1
6873997 Majjasie et al. Mar 2005 B1
6879962 Smith et al. Apr 2005 B1
6882983 Furphy et al. Apr 2005 B2
6882986 Heinemann et al. Apr 2005 B1
6889194 Kadaba May 2005 B1
6895438 Ulrich May 2005 B1
6915268 Riggs et al. Jul 2005 B2
6937922 Benda et al. Aug 2005 B2
6941281 Johnson Sep 2005 B1
6944595 Graser et al. Sep 2005 B1
6973258 Yoo et al. Dec 2005 B1
6983278 Yu et al. Jan 2006 B1
6988111 Chow et al. Jan 2006 B2
6999943 Johnson et al. Feb 2006 B1
7047210 Srinivasan May 2006 B1
7054841 Tenorio May 2006 B1
7069234 Cornelius et al. Jun 2006 B1
7069248 Huber Jun 2006 B2
7076652 Ginter et al. Jul 2006 B2
7079176 Freeman et al. Jul 2006 B1
7099304 Liu et al. Aug 2006 B2
7110959 Hahn-Carlson Sep 2006 B2
7110979 Tree Sep 2006 B2
7113964 Bequet et al. Sep 2006 B1
7117170 Bennett et al. Oct 2006 B1
7120871 Harrington Oct 2006 B1
7124150 Majjasie et al. Oct 2006 B2
7130822 Their et al. Oct 2006 B1
7131069 Rush et al. Oct 2006 B1
7133835 Fusz et al. Nov 2006 B1
7136467 Brockman et al. Nov 2006 B2
7143058 Sugimoto et al. Nov 2006 B2
7146337 Ward et al. Dec 2006 B1
7149744 Tenorio Dec 2006 B1
7162458 Flangan et al. Jan 2007 B1
7177836 German et al. Feb 2007 B1
7181017 Nagel et al. Feb 2007 B1
7203662 Das et al. Apr 2007 B2
7206768 DeGroeve et al. Apr 2007 B1
7222081 Sone May 2007 B1
7243139 Ullman et al. Jul 2007 B2
7254588 Sung et al. Aug 2007 B2
7257560 Jacobs et al. Aug 2007 B2
7263506 Lee et al. Aug 2007 B2
7324976 Gupta et al. Jan 2008 B2
7327952 Enomoto Feb 2008 B2
7340433 Kay et al. Mar 2008 B1
7346575 Ahles et al. Mar 2008 B1
7363261 Whitehead et al. Apr 2008 B2
7366684 Douglas Apr 2008 B1
7373365 Varadarajan et al. May 2008 B2
7386502 Butcher, III Jun 2008 B1
7392934 Hahn-Carlson et al. Jul 2008 B2
7415471 Coleman Aug 2008 B1
7415617 Ginter et al. Aug 2008 B2
7433845 Flitcroft et al. Oct 2008 B1
7437310 Dutta Oct 2008 B1
7448063 Freeman et al. Nov 2008 B2
7475024 Phan Jan 2009 B1
7496519 Hahn-Carlson et al. Feb 2009 B2
7499875 May et al. Mar 2009 B1
7529706 Kulasooriya et al. May 2009 B2
7536354 DeGroeve et al. May 2009 B1
7536362 Starr et al. May 2009 B2
7548884 Thomas Jun 2009 B1
7558793 Topolovac et al. Jul 2009 B1
7574363 Bodin Aug 2009 B2
7574386 Hahn-Carlson et al. Aug 2009 B2
7587363 Cataline et al. Sep 2009 B2
7590575 Yu et al. Sep 2009 B2
7617146 Keaton et al. Nov 2009 B2
7627499 Hahn-Carlson Dec 2009 B2
7634455 Keene et al. Dec 2009 B1
7640195 Von Zimmermann et al. Dec 2009 B2
7660788 Clark Feb 2010 B1
7693791 Hahn-Carlson et al. Apr 2010 B2
7702563 Balson et al. Apr 2010 B2
7725372 Hahn-Carlson May 2010 B2
7765136 Northington et al. Jul 2010 B2
7822653 Hahn-Carlson et al. Oct 2010 B2
7890395 Phelan Feb 2011 B2
7925551 Hahn-Carlson et al. Apr 2011 B2
7970671 Hahn-Carlson et al. Jun 2011 B2
8050938 Green et al. Nov 2011 B1
8060410 Hahn-Carlson Nov 2011 B2
8069054 Hahn-Carlson et al. Nov 2011 B2
8103575 Hinkle Jan 2012 B1
8126785 Hahn-Carlson et al. Feb 2012 B2
8266024 Hahn-Carlson et al. Sep 2012 B2
8392285 Hahn-Carlson Mar 2013 B2
8396811 Hahn-Carlson Mar 2013 B1
20010009002 Logan et al. Jul 2001 A1
20010011241 Nemzow Aug 2001 A1
20010014878 Mitra Aug 2001 A1
20010025262 Ahmed Sep 2001 A1
20010032154 Schlummer Oct 2001 A1
20010032171 Brink et al. Oct 2001 A1
20010032183 Landry Oct 2001 A1
20010039522 Saxon Nov 2001 A1
20010047311 Singh Nov 2001 A1
20010056395 Khan Dec 2001 A1
20020007302 Work et al. Jan 2002 A1
20020016765 Sacks et al. Feb 2002 A1
20020026374 Moneymaker et al. Feb 2002 A1
20020032649 Selvarajan Mar 2002 A1
20020035488 Aquila et al. Mar 2002 A1
20020038277 Yuan Mar 2002 A1
20020038305 Bahl et al. Mar 2002 A1
20020040304 Shenoy et al. Apr 2002 A1
20020042782 Albazz et al. Apr 2002 A1
20020046081 Albazz et al. Apr 2002 A1
20020046125 Speicher et al. Apr 2002 A1
20020046147 Livesay et al. Apr 2002 A1
20020046169 Keresman et al. Apr 2002 A1
20020048369 Ginter et al. Apr 2002 A1
20020049622 Lettich et al. Apr 2002 A1
20020055850 Powell et al. May 2002 A1
20020059122 Inoue et al. May 2002 A1
20020059134 Ebbs et al. May 2002 A1
20020062278 Ingram et al. May 2002 A1
20020065736 Willner et al. May 2002 A1
20020065738 Riggs et al. May 2002 A1
20020069177 Carrott et al. Jun 2002 A1
20020072956 Willems et al. Jun 2002 A1
20020077978 O'Leary et al. Jun 2002 A1
20020087344 Billings et al. Jul 2002 A1
20020087455 Tsagarakis Jul 2002 A1
20020095355 Walker et al. Jul 2002 A1
20020103661 Albazz et al. Aug 2002 A1
20020107761 Kark et al. Aug 2002 A1
20020107794 Furphy et al. Aug 2002 A1
20020111886 Chenevich et al. Aug 2002 A1
20020116288 Nakajima Aug 2002 A1
20020116334 Bennett et al. Aug 2002 A1
20020116348 Phillips et al. Aug 2002 A1
20020120570 Loy Aug 2002 A1
20020123919 Brockman et al. Sep 2002 A1
20020123973 Eccles et al. Sep 2002 A1
20020143858 Teague et al. Oct 2002 A1
20020147655 Say Oct 2002 A1
20020156797 Lee et al. Oct 2002 A1
20020161719 Manning et al. Oct 2002 A1
20020174034 Au et al. Nov 2002 A1
20020184527 Chun et al. Dec 2002 A1
20020194174 Calkins et al. Dec 2002 A1
20020198829 Ludwig et al. Dec 2002 A1
20020198833 Wohlstadter Dec 2002 A1
20030004823 Sagy Jan 2003 A1
20030005876 Boswell Jan 2003 A1
20030014325 Biffar et al. Jan 2003 A1
20030018563 Kilgour et al. Jan 2003 A1
20030026404 Joyce et al. Feb 2003 A1
20030033205 Nowers et al. Feb 2003 A1
20030033240 Balson et al. Feb 2003 A1
20030041008 Grey et al. Feb 2003 A1
20030046089 Menninger et al. Mar 2003 A1
20030050876 Tawara et al. Mar 2003 A1
20030055675 Twennaar Mar 2003 A1
20030055779 Wolf Mar 2003 A1
20030055783 Cataline et al. Mar 2003 A1
20030074206 Hoffman et al. Apr 2003 A1
20030074298 Daum Apr 2003 A1
20030093320 Sullivan May 2003 A1
20030097318 Yu et al. May 2003 A1
20030115129 Feaver Jun 2003 A1
20030117446 Esposito-Ross et al. Jun 2003 A1
20030126047 Hollar et al. Jul 2003 A1
20030135425 Leavitt Jul 2003 A1
20030135435 Aharoni Jul 2003 A1
20030139985 Hollar et al. Jul 2003 A1
20030144901 Coulter et al. Jul 2003 A1
20030149674 Good et al. Aug 2003 A1
20030154163 Phillips et al. Aug 2003 A1
20030158811 Sanders et al. Aug 2003 A1
20030163431 Ginter et al. Aug 2003 A1
20030187796 Swift et al. Oct 2003 A1
20030191711 Jamison et al. Oct 2003 A1
20030195815 Li et al. Oct 2003 A1
20030200172 Randle Oct 2003 A1
20030200185 Huerta et al. Oct 2003 A1
20030212617 Stone et al. Nov 2003 A1
20030220863 Holm et al. Nov 2003 A1
20030225883 Greaves et al. Dec 2003 A1
20030233252 Haskell et al. Dec 2003 A1
20030233286 Hahn-Carlson et al. Dec 2003 A1
20030233292 Richey et al. Dec 2003 A1
20030233321 Scolini et al. Dec 2003 A1
20040010463 Hahn-Carlson Jan 2004 A1
20040019562 Viberg Jan 2004 A1
20040034578 Oney et al. Feb 2004 A1
20040039696 Harmon et al. Feb 2004 A1
20040049446 Seljeseth Mar 2004 A1
20040068431 Smith et al. Apr 2004 A1
20040095237 Chen et al. May 2004 A1
20040098350 Labrou et al. May 2004 A1
20040098663 Rey et al. May 2004 A1
20040107123 Haffner et al. Jun 2004 A1
20040107125 Guheen et al. Jun 2004 A1
20040117383 Lee et al. Jun 2004 A1
20040123129 Ginter et al. Jun 2004 A1
20040139032 Rowan Jul 2004 A1
20040153389 Lortscher Aug 2004 A1
20040153403 Sadre Aug 2004 A1
20040153407 Club et al. Aug 2004 A1
20040158510 Fisher Aug 2004 A1
20040172360 Mabrey et al. Sep 2004 A1
20040172368 Johnson et al. Sep 2004 A1
20040181468 Harmon et al. Sep 2004 A1
20040184163 Nishioka et al. Sep 2004 A1
20040186806 Sinclair et al. Sep 2004 A1
20040187075 Maxham et al. Sep 2004 A1
20040201074 Khandros et al. Oct 2004 A1
20040225574 Arnold et al. Nov 2004 A1
20040230536 Fung et al. Nov 2004 A1
20040230601 Joao et al. Nov 2004 A1
20040243690 Hancock et al. Dec 2004 A1
20040254808 Bennett et al. Dec 2004 A1
20040260634 King et al. Dec 2004 A1
20050015332 Chen Jan 2005 A1
20050021363 Stimson et al. Jan 2005 A1
20050021527 Zhang et al. Jan 2005 A1
20050027613 Takekuma et al. Feb 2005 A1
20050027651 DeVault et al. Feb 2005 A1
20050033660 Solomon Feb 2005 A1
20050033760 Fuller et al. Feb 2005 A1
20050055306 Miller et al. Mar 2005 A1
20050075964 Quinn et al. Apr 2005 A1
20050119980 Kohavi et al. Jun 2005 A1
20050125260 Green et al. Jun 2005 A1
20050131839 Cordery et al. Jun 2005 A1
20050137947 Schaub et al. Jun 2005 A1
20050149378 Cyr et al. Jul 2005 A1
20050165699 Hahn-Carlson Jul 2005 A1
20050177435 Lidow Aug 2005 A1
20050177507 Bandych et al. Aug 2005 A1
20050192896 Hutchison et al. Sep 2005 A1
20050216368 Wechsel Sep 2005 A1
20050234820 MacKouse et al. Oct 2005 A1
20050240592 Mamou et al. Oct 2005 A1
20050246192 Jauffred et al. Nov 2005 A1
20050251478 Yanavi Nov 2005 A1
20050256802 Ammermann et al. Nov 2005 A1
20050274792 Hahn-Carlson et al. Dec 2005 A1
20050278220 Hahn-Carlson et al. Dec 2005 A1
20050278221 Hahn-Carlson et al. Dec 2005 A1
20050278244 Yuan Dec 2005 A1
20050278251 Hahn-Carlson Dec 2005 A1
20050278255 Hahn-Carlson et al. Dec 2005 A1
20050283437 McRae et al. Dec 2005 A1
20050289023 Hahn-Carlson et al. Dec 2005 A1
20050289024 Hahn-Carlson et al. Dec 2005 A1
20060004670 McKenney et al. Jan 2006 A1
20060010058 D'Hers et al. Jan 2006 A1
20060015454 Hahn-Carlson Jan 2006 A1
20060036476 Klem Feb 2006 A1
20060041487 Santalo et al. Feb 2006 A1
20060116957 May et al. Jun 2006 A1
20060167762 Hahn-Carlson Jul 2006 A1
20060167791 Hahn-Carlson Jul 2006 A1
20060167792 Hahn-Carlson Jul 2006 A1
20060233334 Bingaman et al. Oct 2006 A1
20060287983 Chauhan Dec 2006 A1
20070022021 Walker et al. Jan 2007 A1
20070055582 Hahn-Carlson Mar 2007 A1
20070136278 Grazioli et al. Jun 2007 A1
20070156584 Barnes et al. Jul 2007 A1
20070192178 Fung et al. Aug 2007 A1
20070208635 Van Luchene et al. Sep 2007 A1
20070214065 Kahlon et al. Sep 2007 A1
20070214077 Barnes et al. Sep 2007 A1
20070246528 Kubo et al. Oct 2007 A1
20070262140 Long Nov 2007 A1
20070271160 Stone et al. Nov 2007 A1
20070282724 Barnes et al. Dec 2007 A1
20070282744 Barnes et al. Dec 2007 A1
20070299769 Fowler et al. Dec 2007 A1
20080082374 Kennis et al. Apr 2008 A1
20080086396 Hahn-Carlson Apr 2008 A1
20080103972 Lanc May 2008 A1
20080172314 Hahn-Carlson Jul 2008 A1
20080215456 West et al. Sep 2008 A1
20080249940 Hahn-Carlson et al. Oct 2008 A1
20080281752 Chien Nov 2008 A1
20090171727 Hahn-Carlson Jul 2009 A1
20090192922 Hahn-Carlson Jul 2009 A1
20090259576 Hahn-Carlson Oct 2009 A1
20090265274 Hahn-Carlson et al. Oct 2009 A1
20090287590 Hahn-Carlson Nov 2009 A1
20090287598 Hahn-Carlson Nov 2009 A1
20090292630 Hahn-Carlson et al. Nov 2009 A1
20090307114 Hahn-Carlson Dec 2009 A1
20100017315 Hahn-Carlson Jan 2010 A1
20100049650 Keaton et al. Feb 2010 A1
20100070397 Hahn-Carlson et al. Mar 2010 A1
20100138325 Hahn-Carlson Jun 2010 A1
20100185540 Hahn-Carlson et al. Jul 2010 A1
20100205054 Hahn-Carlson et al. Aug 2010 A1
20110004544 Baum Jan 2011 A1
20110029404 Hahn-Carlson et al. Feb 2011 A1
20120158558 Hahn-Carlson et al. Jun 2012 A1
Foreign Referenced Citations (23)
Number Date Country
0339850 Feb 1989 EP
0407026 Jan 1991 EP
0425421 May 1991 EP
0779587 Jun 1997 EP
1659526 May 2006 EP
2543327 Sep 1984 FR
2398894 Sep 2004 GB
2001312680 Nov 2001 JP
WO 9707468 Feb 1997 WO
WO 9908218 Feb 1999 WO
WO 0062225 Oct 2000 WO
WO 0109782 Feb 2001 WO
WO 0135570 May 2001 WO
WO 0148659 Jul 2001 WO
WO 0182193 Nov 2001 WO
WO 0188813 Nov 2001 WO
WO 0126017 Dec 2001 WO
WO 0221405 Mar 2002 WO
WO 0206920 Sep 2002 WO
WO 03034178 Apr 2003 WO
WO 2005124635 Dec 2005 WO
WO 2006071881 Jul 2006 WO
WO 2008045793 Apr 2008 WO
Non-Patent Literature Citations (21)
Entry
Spencer et al., “JIT Systems and external logistics suppliers,” International Journal of Operations & Production Management, v14, n6, pp. 60-74, 1994.
White, How Computers Work, Sep. 1999, 93 pp.
Professional Builder (1993) www.highbeam.com, Contracts & Law: Part III 8 pp.
South China Morning Post, Hong Kong, Buying “Products over the Net,” Jul. 2000, 2 pp.
Xcitek Press Release, “U.S. Bank Selects Xcitek for Corporate Actions Data and XSP for Corporate Actions Automation,” NY, NY, Dec. 2003, 1 pp.
Berhad, “Fueling financial oil for the economy,” The New Straits Times Press (Malaysia), Dec. 10, 2001, 3 pp.
Singh, “A new road to recovery,” Risk, pp. 108-110, Sep. 2004.
“Credit Derivatives and Mortgage-backed Bonds in Capital Adequacy Requirements for Market Risk,” http://www.rahoitustarkastus.fi/Eng/Regulation/FSA—standards/FSA—interpretations/4—2005.html, Apr. 2005, 5 pp.
Brochure: SAP Supplier Relationship Management—At a Glance, SAP, 2003, 16 pp.
Brochure: Self-Service Procurement: Slashing Costs and Saving Time, SAP, 2003, 12 pp.
Electronic Commerce News, “Sarbanes-Oxley Continue to be Key Issue in Corporate Payments Space,” Sep. 1, 2003, v8, issue 18, 7 pp.
Fletcher, “Limits on reinsurance offsets sought by California regulator,” Business Insurance, May 8, 1995 4 pp.
Denver Business Wire, “Jd Edwards Continues to drive network-centric applications delivery with OneWorld enhancements,” Jun. 16, 1997, p. 06160089.
Notice from the European Patent Office concerning business methods, dated Oct. 1, 2007, 2 pp.
Egan, “Administrative Orders from the Office of the Governor of Alaska,” Jul. 18, 1972, 3 pp. http://www.gov.state.ak.us/admin-orders/018.html.
Bodnar, “Estimating Exchange Rate Exposure: Issues in Model Structure,” Financial Management v32, n1, pp. 35-67, 2003.
Plewka, “Germany seizes the Emu initiative,” International Tax Review, v8, n5, pp. 43-46, May 1997.
Huang, “Exchange Risk and Exchange Rate Pass-Through,” v67/02-A of Dissertation Abstracts International, 2005.
McKeefry, “Seeking microcontrollers desperately,” Electronic Buyers News, n972, Sep. 11, 1995, 6 pp.
Mallory, Great Plains Accounting v.7 (Great Plains Software's accounting software) (Product Announcement), Apr. 22, 1993, 3 pp.
Russell, “Kitting out is now in (Use of component kits is expanding as distributors develop added-value activities),” Electronic Times (online), n 852, Apr. 17, 1997, 4 pp.
Related Publications (1)
Number Date Country
20050283434 A1 Dec 2005 US
Provisional Applications (2)
Number Date Country
60578689 Jun 2004 US
60578429 Jun 2004 US
Continuation in Parts (1)
Number Date Country
Parent 10864761 Jun 2004 US
Child 11149978 US