Method and system for providing a distributed adaptive rules based dynamic pricing system

Information

  • Patent Grant
  • 8244648
  • Patent Number
    8,244,648
  • Date Filed
    Monday, July 18, 2011
    13 years ago
  • Date Issued
    Tuesday, August 14, 2012
    12 years ago
Abstract
A system for providing distributed control to process transactions is disclosed. The system includes a service provider system having associated therewith a number of rules and a number of meta-rules, a point of service device having associated therewith a number of rules and a number of meta-rules, and a portable device having associated therewith a number of rules and a number of meta-rules. The portable device uses its associated rules to determine an outcome for a transaction. If the portable device is unable to determine the outcome for the transaction, the portable device uses its associated meta-rules to either determine whether one or more of its associated rules can be altered locally in order to determine the outcome or request the point of service device to help determine the outcome using the rules and meta-rules associated with the point of service device. If the point of service device is unable to determine the outcome using its associated rules, the point of service device uses its associated meta-rules to either determine whether one or more of its associated rules can be altered locally in order to determine the outcome or request the service provider system to help determine the outcome using the rules and meta-rules associated with the service provider system.
Description
BACKGROUND OF THE INVENTION

In today's environment, promotion systems often include point of service or sale devices and portable devices. Such systems generally utilize a set of rules to manage and process transactions. Typically, these rules are centrally managed and elements of the rules or the data used in their application are distributed from a central location, such as a server, to the points of service as needed from time to time on a transaction-by-transaction basis. As a result, the bulk of the programming administration is performed at the central location. Conversely, limited transaction processing is performed on the part of the portable devices and/or the point of service devices.


A number of situations often lead to sub-optimal use of such systems, thereby resulting in service delivery that does not meet the performance expectation of the service provider or user. Examples of such situations would include cases where data would be missing or corrupted at the point of service, where the central system would fail to update the rules and data used by the point of service device in a timely fashion, and where centrally defined rules cannot accommodate the variety of situations at the point and time of service, etc.


Sub-optimal use includes, for example, a promotion system where the promotional messages used in the portable devices are out of date; a rewards system where the incentive programs in the system are not delivering consumer appeal; and a price definition system where the dynamic shifts of demand and offer at a particular outlet are not properly integrated in a timely manner.


In addition, conventional systems also limit interactions between service providers that would allow them to jointly optimize the delivery of their services, for instance, where the use of certain forms of payment and promotion for certain products and services are tied together.


Hence, it would be desirable to provide a system that is capable of handling and processing transactions more efficiently in a distributed manner.


BRIEF SUMMARY OF THE INVENTION

In one exemplary embodiment, a system for providing distributed control to process transactions is provided. The system includes a number of nodes, each node having a node order and having associated therewith a number of rules and a number of meta-rules. The rules use a variety of data as inputs including transaction and event related data, device related data and environment related data. The rules also include one or more rules on communications routing between nodes.


A first node uses its associated rules to determine an outcome for a transaction. If the first node is unable to determine the outcome for the transaction using its associated rules, the first node uses its associated meta-rules to either determine whether one or more of its associated rules can be altered locally in order to determine the outcome or request a second node having a node order that is equal to or higher than that of the first node to help determine the outcome using the rules and meta-rules associated with the second node.


If the second node is unable to determine the outcome using its associated rules, the second node uses its associated meta-rules to either determine whether one or more of its associated rules can be altered locally in order to determine the outcome or request a third node having a node order that is equal to or higher than that of the second node to help determine the outcome using the rules and meta-rules associated with the third node.


Moreover, the first node uses historical transaction information to update the rules and meta-rules associated with a node having a node order that is equal to or lower than that of the first node in order to render processing of transactions more efficient.


Each node is configured to receive an administrative request. Upon a node receiving the administrative request, the node is directed to propagate one or more of its associated plurality of rules or meta-rules to another node.


Each node is also configured to collect data relating to the transactions to allow a system provide to manage or maintain system performance.


In another exemplary embodiment, another system for providing distributed control to process transactions is provided. The system includes a number of service provider systems, each service provider system having associated therewith a number of rules and a number of meta-rules; a number of point of service devices, each point of service device having associated therewith a number of rules and a number of meta-rules; and a number of portable devices, each portable device having associated therewith a number of rules and a number of meta-rules.


A portable device uses its associated rules to determine an outcome for a transaction. If the portable device is unable to determine the outcome for the transaction using its associated rules, the portable device then uses its associated meta-rules to either determine whether one or more of its associated rules can be altered locally in order to determine the outcome or request a point of service device to help determine the outcome using the rules and meta-rules associated with the point of service device. Alternatively, the portable device and the point of service device may use their respective associated rules to determine the outcome for the transaction. If the outcome cannot be reached, the point of service device uses its associated meta-rules to either determine whether one or more of the rules associated with either the portable device or the point of service device can be altered locally to determine the outcome or request another point of service device.


If the point of service device is unable to determine the outcome using its associated rules, the point of service device uses its associated meta-rules to either determine whether one or more of its associated rules can be altered locally in order to determine the outcome or request another point of service device or a service provider system to help determine the outcome using the rules and meta-rules associated respectively with this other point of service device and the service provider system.


Optionally, the system further includes a number of network gateways, each network gateway having associated therewith a number of rules and a number of meta-rules. If the point of service device is unable to determine the outcome using its associated rules, the point of service device uses its associated meta-rules to either determine whether one or more of its associated rules can be altered locally in order to determine the outcome or request another point of service device or a network gateway to help determine the outcome using the rules and meta-rules associated respectively with the point of service device and the network gateway.


If the network gateway is unable to determine the outcome using its associated rules, the network gateway uses its associated meta-rules to either determine whether one or more of its associated rules can be altered locally in order to determine the outcome or request another network gateway or a service provider system to help determine the outcome using the rules and meta-rules associated respectively with this other network gateway and the service provider system.


Moreover, the point of service device uses historical transaction information to update the rules and meta-rules associated respectively with one or more portable devices in order to render processing of transactions more efficient. Similarly, the service provider system uses historical transaction information to update the rules and meta-rules associated respectively with one or more point of service devices and one or more portable devices, and one or more network gateways in order to render processing of transactions more efficient.


In yet another exemplary embodiment, a method for providing distributed control to process transactions is provided. The method includes: maintaining a service provider system having associated therewith a number of rules and a number of meta-rules; maintaining a point of service device having associated therewith a number of rules and a number of meta-rules; maintaining a portable device having associated therewith a number of rules and a number of meta-rules; determining an outcome for a transaction using the rules associated with the portable device; and if the outcome cannot be determined using the rules associated with the portable device, using the meta-rules associated with the portable device to either determine whether one or more of the rules associated with the portable device can be altered locally in order to determine the outcome or request the point of service device to help determine the outcome using the rules and meta-rules associated with the point of service device.


The method also comprises: if the outcome cannot be determined using the rules associated with the point of service device, using the meta-rules associated with the point of service device to either determine whether one or more of the rules associated with the point of service device can be altered locally in order to determine the outcome or request the service provider system to help determine the outcome using the rules and meta-rules associated with the service provider system.


The method further comprises: maintaining a network gateway having associated therewith a number of rules and a number of meta-rules; and if the outcome cannot be determined using the rules associated with the point of service device, using the meta-rules associated with the point of service device to either determine whether one or more of the rules associated with the point of service device can be altered locally in order to determine the outcome or request the network gateway to help determine the outcome using the rules and meta-rules associated with the network gateway.


Moreover, the method comprises: if the outcome cannot be determined using the rules associated with the network gateway, using the meta-rules associated with the network gateway to either determine whether one or more of the rules associated with the network gateway can be altered locally in order to determine the outcome or request the service provider system to help determine the outcome using the rules and meta-rules associated with the service provider system; directing the point of service device to use historical transaction information to update the rules and meta-rules associated with the portable device in order to render processing of transactions more efficient; and directing the service provider system to use historical transaction information to update the rules and meta-rules associated respectively with the portable device and the point of service device in order to render processing of transactions more efficient.


Reference to the remaining portions of the specification, including the drawings and claims, will realize other features and advantages of the present invention. Further features and advantages of the present invention, as well as the structure and operation of various embodiments of the present invention, are described in detail below with respect to accompanying drawings, like reference numbers indicate identical or functionally similar elements.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a simplified schematic diagram illustrating the system architecture of one exemplary embodiment of the present invention;



FIG. 2 is a simplified schematic diagram illustrating an exemplary embodiment of a software service agent according to the present invention;



FIG. 3 is a simplified schematic diagram illustrating an exemplary embodiment of the meta-rules formalism according to the present invention;



FIG. 4 is a simplified diagram illustrating various distributed adaptive loyalty schemes that can be implemented according to the present invention;



FIG. 5 is a simplified diagram illustrating the concept of equivalent offers using vector theory according to one exemplary embodiment of the present invention; and



FIG. 6 is a simplified diagram illustrating an offer feedback loop according to one exemplary embodiment of the present invention.





DETAILED DESCRIPTION OF THE INVENTION

The present invention in the form of one or more exemplary embodiments will now be described. As used herein, the following is a glossary of terms with their corresponding definitions:


Portable device: a personal device, with storage and computing ability and sets of unique identifying characteristics, carried by an individual and used to conduct a transaction.


Point of service (sale) device: a device, with storage and computing ability, used to interact with the portable device and, from time to time, with network gateways and/or back-end systems, to conduct a transaction at the point of service or sale.


Back-end system (service provider system): a computing device, separate from the point of service device, that enables the delivery of a service, provides data and software objects required locally for the delivery of the service, and analyzes data about service events/transactions and the point of service state.


Network switch (network gateway): a computing device that enables communications between the point of service devices and the back-end systems and may perform data/transaction processing on behalf of the back-end systems if so configured.


System component (node): a component of the transactional infrastructure; portable devices, point of service devices, network gateways, and back-end systems are the different types of nodes of the system.


Node order: level of authority of a node in the transactional infrastructure; generally, the portable devices have the lowest node order, followed by the point of service devices, the network gateways and the back-end systems in ascending order.


Portable device user: a carrier of the portable device at the time of the transaction with the point of service device.


Portable device issuer: an owner and/or provider of the portable device.


Point of service device operator (acceptor): an entity or person responsible for the operations of the point of service device.


Service provider: a provider of services the delivery of which is enabled by the interaction of the portable device and the point of service device; examples of a service provider include financial institutions providing payment services, merchants providing promotional programs, and product manufacturers.


Network owner (processor): an owner of a network gateway providing connectivity, switching between point of service devices and back-end systems, and optionally, performing transactional processing on behalf of the service providers.


Transaction: a singular interaction between the portable device and the point of service device including a decision related to service delivery; the result of the transaction may be successful, unsuccessful, or in a number of intermediate states as defined by the service provider.


Service request: a call from a system node to a node of a similar (peer to peer) or higher node order to assist in the processing of a transaction based on the rules and meta-rules available at that node.


Administrative request: a call from a system node to a node of a similar (peer to peer) or lower node order to assist in the processing, distribution and management of system data, system states, and distribution of processing rules and meta-rules.


System state: a compilation of states of all components of the transaction system at a given time, including node state, local data, event data and system records; the system state may vary with time.


System performance: average over a period of time of the system states compared to an optimum state.


Service delivery record: a record of past transaction results.


Price computation rules (transaction processing rules): local set of processing rules defining the conditions under which a transaction will be priced locally or referred to a node of a higher order.


Meta-rules: rules governing (1) the definition of equivalence, or substitution between one price computation rule and another; rules are said to be equivalent when their application would result in the same theoretical system performance; rule substitution is the operation by which a node replaces a price computation rule with another to increase the probability of achieving a desired system performance; (2) the administration of the modes, such as viral distribution, of the system management function to service requests like, update of rules and meta-rules and initialization response to the administration request.


Viral distribution (viral transmission): mode of rules propagation not involving a back-end system; propagation occurs when one node provides its rules and meta-rules to another node of equal or lesser order for the purpose of incorporation into the recipient node's sets of rules and meta-rules.


According to one exemplary embodiment, a system is provided for the management and distribution of rules used to determine the allowed price of a product or service to be provided during a transaction. In one aspect, components of the system (nodes), including the back-end systems, the network gateways, the point of service devices, and the portable devices are able to locally utilize corresponding algorithms and/or rules to collectively determine the outcome of a transaction or a service delivery request (transaction processing rule). In one configuration, a service provider initially defines the algorithms and/or rules for all the system nodes that are to be used to process a transaction related to that service provider and may modify such algorithms and/or rules from time to time. As will be further described below, the components are able to adapt these algorithms and/or rules.


In one situation, the universe of possible price computation rules used to determine the price of a product or service is defined by the service provider with the intention of achieving an optimum system performance. The price computation rules may use utilize a variety of data to determine the outcome of the transaction including, for example, environmental data, node data, event (transaction) data including transaction value setting data (such as, price, grades, risk, etc.), system data (such as, node identifier, owner, security classes, scheme participation, etc.), system state data, system components states data, service delivery records, user and service provider data and logs (such as, behavioral data, demographics data, psychographics data, etc.), service logs, observed and desired system performance.


Price computation can be performed in a number of ways. For example, a price computation may be completed at the local node; alternatively, in the case of inconclusive processing at the local node, the price computation can be re-processed either with referral to the local meta-rules for alteration of the local price computation rules or via referral with a service request to a node of a higher order for processing based on the price computation rules and meta-rules stored at that node. Collaborative price computation is performed when a node engages one or more other nodes to participate in the processing of the transaction and/or the adaptation of the rules.


When nodes communicate and propagate to other participating nodes price computation rules and meta-rules, such viral distribution or transmission of rules and meta-rules are defined by the service provider as part of the system's meta-rules. Furthermore, each node can communicate to other nodes its level of participation in response to service requests. The participation level of each node in the system is defined and controlled as part of the meta-rules of the system.


The adaptation of price computation rules is based on rules of equivalence (meta-rules) allowing the substitution of sets of data and associated algorithms between nodes. Such rules of equivalence allow the probability of enhancing system performance to be maximized according to the definition provided by the service provider. The rules of equivalence (meta-rules) are typically defined by the service provider to seek optimization of system performance according to the service provider's business objectives and/or economic model.


The adaptation of price computation rules may happen on a real-time basis as part of the processing of a transaction; or from time to time, using a local node heuristic engine capable of analyzing the node state, node service logs, and available system state data, and based on the local meta-rules; or by receipt of administrative requests.


The meta-rules, or rules of equivalence, are based on the computation and comparison of expected, desired and measured system performance for various price computation rules and the definitions of conditions allowing for the substitution of one set of price computation rules and associated data for another.


The meta-rules are distributed as node to node transactions defined as administrative requests. Response to each administrative request is performed according to pre-existing meta-rules.


The price computation rules and meta-rules are embodied in software agents in each participating node, provided or certified or otherwise recognized by the service provider. The system supports conjoint delivery of services by different service providers. A software agent from one participating service provider may engage a software agent from a different service provider, sharing the same node, to affect the price computation for the delivery of either service or product.


System Nodes



FIG. 1 is a simplified schematic diagram illustrating the system architecture of one exemplary embodiment of the present invention. Referring to FIG. 1, the system 100 includes a hierarchy of nodes including a number of portable devices 102, a number of point of service devices 104, a number of network gateways 106 and a number of back-end systems 108. In an alternative embodiment, the system 100 may include a number of portable devices 102, a number of point of service devices 104 and one back-end system 108.


In an exemplary embodiment, each node includes the following components: one or more service software agents, one or more modules for providing local data system services (such as, data acquisition and storage), one or more base communication modules for node to node communications, and a unique identifier permanently or dynamically assigned for identification within the system 100.


In an exemplary embodiment as shown in FIG. 2, the service software agent includes a price computation engine, a price computation rules store, a meta-rules store, a heuristic engine for meta-rules processing and a communications module configured to interface with the node's base communication modules and/or other locally residing software service agent.


Portable Device Node Characteristics


A node that is a portable device 102 includes the following characteristics. Such node is optionally capable of interacting with a user through a number of devices or system including, for example, a display, a print-out system, a system capable of utilizing the sense of sight, a speaker or microphone, a system capable of utilizing the sense of hearing, a vibrating system, a keypad or a system capable of utilizing the sense of touch. Examples of portable devices 102 include, smart cards, personal digital assistants (PDAs), cellular phones, pagers, memory sticks, dongles and the like.


Point of Service Device Node Characteristics


A node that is a point of service device 104 includes the following characteristics. Such node is capable of communicating with the portable devices 102 via a number of means including, for example, radio frequency, infra-red, direct electrical means and the like. Such node is also capable of interacting with a user or point of service device operator through a number of devices or systems including, for example, a display, a print-out system, a system capable of utilizing the sense of sight, a speaker or microphone, a system capable of utilizing the sense of hearing, a vibrating system, a keypad and a system capable of utilizing with the sense of touch. Such node is further capable of communicating in a substantially real-time basis with a back-end system 108 directly or through a network switch/gateway 106.


The point of service device 104 includes software enabling and allowing the delivery of various types of services including, for example, secure storage of information such as unique device identification information, transaction event information, environmental information and system performance parameters. The point of service device 104 is also capable of measuring certain environmental information such as time, temperature, weather, geographical location. Examples of a point of service device 104 include a personal computer, point of sales device, kiosk, ATM, cellular phone, regular phone and the like.


Network Switch/Gateway Node Characteristics


A node that is a network gateway 106 has the following characteristics. Such node includes software and/or control logic to route service requests and administrative requests based on node identifiers. Such node is capable of communicating with point of service devices 106 and the back-end systems 108 on a substantially real time basis. Such node is further capable of providing peer-to-peer communications with other network switches 106. Communications with the point of service devices 104, the back-end systems 108 and other network gateways 106 are conducted in a secure manner. Examples of network gateways 106 include transaction stored and forward systems, payment network switches, payment network intercept or stand-in processing systems and the like.


Back-end System Node Characteristics


A node that is a back-end system 108 has the following characteristics: it is capable of communicating with point of service devices 106 on a substantially real time basis either directly or through the intermediary of a set of network switches 106. Such node includes software and/or control logic capable of managing price computation rules and meta-rules throughout the system 100. Such node includes software and/or control logic capable of collecting a variety of data including, for example, system state data and services logs, transaction (event) data. The node uses the collected data to perform a number of functions including, for example, reporting functions for the purpose of billing, identifying, managing and counteracting fraud occurring in the system 100 and allowing the system operator to monitor and achieve better system performance, and supporting customer service functions in particular dispute resolution and exception handling. Communications to and from the node may be provided in a secure manner.


Transaction Processing and Service Requests


A portable device 102 typically initiates a transaction by issuing a transaction request to a point of service device 104. Alternatively, the point of service device 104 may initiate a transaction on its own. When the point of service device 104 initiates a transaction or receives a transaction request for a transaction to be initiated, the software service agent within the point of service device 104 collects from the point of service device 104 and the portable device 102 such information as is necessary to determine the price for the goods and/or services to be provided during the transaction, computes the price for the transaction using the collected information and completes the transaction according to rules governing the transaction.


The point of service device 104 may have to “negotiate” with the portable device 102 to access such information as it requires, for instance, performing the necessary mutual authentication to ensure the security and integrity of the information exchanged. Such negotiation utilizes the price computation engine residing on the portable device 102. Thus, information used in the context of the transaction may be acquired, read from storage and/or computed by both devices. Examples of such types of information include time of day and temperature information which is acquired during the transaction, device identification and user information which is read from storage and transaction information including, for example, transaction number and transaction cryptogram, which is computed during the transaction.


In the event that the local price computation rules do not permit the point of service device 104 to arrive at a satisfactory outcome (i.e., a definitive decision between multiple processing options cannot be reached), the point of service device 104 may attempt to process the transaction by (1) substituting price computation rules per the local meta-rules book or (2) sending a service request to a higher order node which may be a network switch 106 or back-end system 108, if communication with such higher order node is possible. Such service request is then processed by the receiving node as if it was a transaction request to be processed locally according to the transaction processing rules and/or and the local price computation rules in place at that node. In the event that the receiving node is similarly unable to arrive at a satisfactory outcome, then the receiving node may attempt to process the transaction according to its meta-rules book or refer the transaction to a node of equal or higher order if possible.


System Management


A service provider is responsible for initializing the various system nodes in order to deliver services offered by such service provider. Such initialization may occur via a connection to the service provider's back end system or via injection locally on the individual nodes prior to their connection to the system 100. The service provider also defines the set of meta-rules to be used in the system 100. Such rules are defined for each participating nodes and include such definitions as rules of equivalence and rules of communications.


Rules of equivalence or meta-rules are rules that govern substitution of a price computation rule with another. Such substitution could formally be described as the definition of a local algebra across the n-space of applicable price computation rules as follow: If Σn is defined as the n-space representing all possible system states, including system level data and node local data (acquired or computed), a price computation rule or operator can be defined as a numerical function custom character on Σn. System Performance is then defined as a numerical function custom character defining a topology for Θk, the universe of possible price computation functions for the system. A meta-rule is then defined as a transfer function custom character from Θk into Θk with the following construction rule:

custom character(custom character1,custom character2,custom character3, . . . ,custom charactern)=custom charactery if custom character(custom charactery)≧custom character(custom character1,custom character2,custom character3, . . . ,custom charactern)
FIG. 3 is a simplified schematic diagram illustrating an exemplary embodiment of the meta-rules formalism according to the present invention.


Rules of communication dictate the instances and/or conditions under which service requests and administrative requests are performed. Requirements related to system overall security and integrity are included within such rules. This in particular includes the methods by which service and administrative requests are routed to the appropriate node and the process by which meta-rules are updated during an administrative request.


The service provider is responsible for the installation and/or distribution of the meta-rules to participating nodes. Initialization of system nodes includes the basic rules whereby meta-rules are received and locally updated. Subsequently, distribution of meta-rules books to system nodes can take several forms including, for example, injection in the node prior to its connection to the system, communication to the node specifically for receiving meta-rules book updates, and viral propagation from node to node of lower or equal order.


Once a system is operational, price computation rules book evolves locally per the conditions measured at that particular node as to the performance of the system. To ensure system integrity as well as provide the ability for the service provider to continuously upgrade the set of meta-rules, the system nodes from time to time may be required to provide different types of information to the back-end system including, for example, a copy of the then current local price computation rules book, a copy of the local price computation logs, and other local node state data. Such exchange of information is performed in response to an administrative request from the back-end system to nodes of lower order, which request may also include at that time data to update locally the transaction or price computation rules book, the meta-rules book and other system data such as identifiers, keys, etc.


Practical Examples


The following is a number of practical examples further illustrating the present invention as described above.


Distributed Loyalty System


Instead of a basic storage area in the portable and base device as is the case today, in one exemplary embodiment, the present invention provides the token with a heuristic function of modeling reward programs within an economic surface area. Such a surface area is delimited by three (3) or more equations, each equation representing a consumer behavior model that a sponsor develops to maximize revenue based on economic formulas encompassing consumer past behavior, product generation cost and profitability.


In one exemplary embodiment, the present invention is used to implement various distributed adaptive loyalty schemes as shown in FIG. 4. The traditional purchase transaction can be described as stimulus. The rewards, coupons, discounts, passes, are a loyalty system's responses. The new system's stimulus/response mechanism provides portable and base devices with portable rules engine (distributed) having the ability to function in real-time to create closed-loop, modular system for repeatedly accepting stimulus and providing adaptive responses.


Adaptive responses are offered at the point of service. According to one exemplary aspect, each transaction is analyzed and a user's individual profile is updated. The profile determines the appropriate scheme rules and thresholds to utilize.


The result of the data mining functions then generates such equations, which could be updated on a regular basis. Instead of downloading parameter files, the back-end system rules engine downloads the new equations and their coordinates ((x1, y1), (x2, y2), etc). Each and every equation is an economic model that encapsulates a minimum and maximum value for a given set of products, e.g., dairy products like cheese, milk, yogurt, with specific reward functions, get one free, 18% off etc. Generically speaking, an algebra for every space is generated, the intersection of spaces constitutes the economic reward that is provided to the consumer.


If the consumer does not buy within the proposed multidimensional area (as shown in FIG. 4 (it is a 2-space system because of the difficulty of representing an n-space system), it requires the portable device request a change in parameters and translates into a change of slope of the linear programming equation changing elements in some of the spaces. With the present invention, the stimulus is not just limited to purchase transactions but includes transactions initiated from other use of the portable device, for example, balance/status queries (no purchases) and access device. In addition, more dimensions of stimuli can be captured and analyzed at the point of sale thus allowing the system to deploy more effective responses. For example, traditional stimuli capture transactional data, i.e., whether purchase was made or not. According to one exemplary embodiment, with a distributed adaptive system, stimulus data can encompass spatial (where), historical (purchase history) and temporal (when) dimensions.


Vending Machines with Adaptive Pricing


Vending machines are generally off-line devices that are designed to deliver goods for a set price. The price may be adapted according to each device but is generally done arbitrarily. Yet many instances would exist to optimize the performance of a given device. The performance of a device could be defined as the maximization of profit margins generated by the device, the maximization of sales per device and the optimization of service calls for the device.


Each of these performance criteria can become the foundation for a set of price setting rules used to fluctuate the price of the goods delivered according to the environment. For instance, soda machines might increase their price when the ambient temperature increases due to the expected increase in demand. Through the use of a local heuristic engine, the elasticity of demand vs. price and temperature can be plotted and extrapolated and therefore prices may be constantly adjusted. Such a method may be used to either maximize profit or to maximize sales, to ensure that most of the demand for the beverages is captured. Other parameters that might easily influence the price of the goods could include the time of day and day of the week, effectively taking into account the sensitivity of demand according to these parameters.


One issue with vending machines is the need to adequately replenish them. In the event of available communications link, a machine might “call for service”. Alternatively the machine may use inventory control and pricing methods to maximize the number of sales in between scheduled service visits, thus reducing the overall cost of servicing the machine and optimizing the sales per unit. Through this example, it can be seen that price can thus be set according to a set of computation rules (in this instance, the price as a function of the goods selected) and meta-rules, comparing the measured vs. desired performance of the system (profit, sales, service calls, etc.) and the measured sensitivity to various local parameters (temperature, time, time to next visit . . . ) to adapt locally the price of the goods delivered, without requiring a central intervention. Furthermore, service logs (in this case the evolution of sales vs. price as a function of the other registered parameters) may be used by the goods distributors to develop more efficient meta-rules where multiple parameters and rules may be used to evolve product pricing.


Adaptive Targeted Offering


Adaptive targeted offering allows the intelligence distribution within the system. Hence, the rules can be locally updated by the portable device, the point of service device or the network gateway with certain predetermined and defined parameters to provide equivalent offers. This is a powerful tool to allow a very flexible adaptation to the given environment and the buying habits of the portable device user. The offers can be modified to motivate the portable device users to try offers they would not otherwise have tried without the help of the incentives. The intelligence in the systems allows a certain level of neural learning within the system enhanced by the feedback loop created by the adaptation of the offers and the measurement of the response.


The concept of equivalent offers can be easily explained using vector theory as shown in FIG. 5 where the offer depicted by vector AD is equivalent to the two step offer depicted by vectors AB and BD as well as vectors AC and CD. FIG. 6 illustrates a feedback loop which provides the means to adjust the offers based on the previous execution and provides the necessary means to stabilize the purchasing behavior.


Benefits of the present invention relate to its ability to increase the value derived from a transactional system without incurring significant networking costs. In fact, given the presence of heuristic components in every system node to potentially adapt price computation as a function of system performance, the role of back-end systems becomes more one of monitoring system states and performance and propagating updates to the meta-rules book to continuously enhance the overall system performance.


The present invention is applicable to a number of systems related to payment applications. Furthermore, the present invention is described in terms that allows it to cover the breadth of emerging forms of payment tokens including application that would include heuristics for price computation, or provide for distributed management of price computation systems.


The present invention could be expanded beyond the notion of dynamic pricing to other decisions that might be performed at the point and time of service. Thus, this invention may be expanded further into fields that involve decision making with a consumer token. It is, for instance, possible to envision such an approach being used in areas such as traveler security. Equally, the present invention could play a role in the emerging contactless applications.


It should be understood that the present invention as described above can be implemented in the form of control logic using computer software in a modular or integrated manner. Based on the disclosure and teachings provided herein, a person of ordinary skill in the art will know and appreciate other ways and/or methods to implement the present invention using hardware and a combination of hardware and software.


It is understood that the examples and embodiments described herein are for illustrative purposes only and that various modifications or changes in light thereof will be suggested to persons skilled in the art and are to be included within the spirit and purview of this application and scope of the appended claims. All publications, patents, and patent applications cited herein are hereby incorporated by reference for all purposes in their entirety.

Claims
  • 1. A method associated with a point of service device and a portable device, the method comprising: interacting with the portable device in a transaction, wherein the point of service device is associated with a plurality of rules and plurality of meta-rules; anddetermining, by the point of service device, if the rules can be altered locally to determine an outcome for the transaction, and if the rules cannot be altered locally, then requesting a service provider system to help determine the outcome for the transaction, wherein the portable device and the point of service device are further configured so that when the portable device and the point of service are unable to determine the outcome for the purchase transaction, the point of service device uses its plurality of meta-rules to either determine whether one or more of the plurality of rules in either the portable device or the point of service can be altered locally in order to determine the outcome or request a service provider system to help determine the outcome using the plurality of rules and the plurality of meta-rules in the service provider system.
  • 2. The method of claim 1, wherein the portable device is associated with a plurality of rules and a plurality of meta-rules.
  • 3. The method of claim 1, further comprising receiving an administrative request, from the service provider system, wherein the administrative request includes an update to the plurality of rules and an update to plurality of meta-rules associated with the point of service device, and a time to perform the update.
  • 4. The method of claim 1, wherein the point of service device uses historical transaction information to alter locally the plurality of rules and plurality of meta-rules associated with the point of service device.
  • 5. The method of claim 1, further comprising measuring, by the point of service device, environmental information, including time, temperature, weather, or geographical location.
  • 6. The method of claim 5, wherein the point of service device uses the environmental information to update the plurality of rules and plurality of meta-rules associate with the point of service device.
  • 7. The method of claim 1, further comprising collecting information from the portable device to determine the outcome.
  • 8. A point of service device, comprising: a processor; anda computer readable medium comprising code executable by the processor to perform a method associated with the point of service device and a portable device, the method comprising: storing a plurality of rules and a plurality of meta-rules associated with the point of service device;interacting with the portable device in a transaction; anddetermining if the rules can be altered locally to determine an outcome for the transaction, and if the rules cannot be altered locally, then requesting a service provider system to help determine the outcome for the transaction, wherein the portable device and the point of service device are further configured so that when the portable device and the point of service device are unable to determine the outcome for the purchase transaction, the point of service device uses it plurality of meta-rules to either determine whether one or more of the plurality of rules in either the portable device or the point of service device can be altered locally in order to determine the outcome or request a service provider system to help determine the outcome using the plurality of rules and the plurality of meta-rules in the service provider system.
  • 9. The point of service device of 8, wherein the point of service device is further configured to measure environmental information including the time, temperature, weather, or geographical location.
  • 10. The point of service device of 9, wherein the point of service device is configured to store information, including unique device identification information, transaction event information, and environmental information, and system performance parameters.
  • 11. A method associated with a service provider system and a point of service device, the method comprising: communicating through a network gateway with the point of service device;collecting data at the service provider system, from the point of service device, wherein the service provider system is associated with a plurality of rules and a plurality of meta-rules;receiving a request from the point of service device to help determine an outcome for a transaction; anddetermining, by the service provider system, the outcome for the transaction, wherein the point of service device is further configured so that when the service provider system and the point of service device are unable to determine the outcome, a processor in the service provider system uses its plurality of meta-rules to either determine whether one or more of the plurality of rules in either the point of service device or the service provider system can be altered in order to determine the outcome.
  • 12. The method of claim 11, further comprising: determining, by the service provider system, an update to the plurality of rules and plurality of meta-rules associated with the point of service device; androuting an administrative request to the point of service device.
  • 13. The method of claim 12, wherein the administrative request includes an update to the plurality of rules and an update to plurality of meta-rules associated with the point of service device, and a time to perform the update.
  • 14. The method of claim 11, wherein the data collected from the point of service device includes system state data and transaction event data.
  • 15. The method of claim 11, wherein the service provider system uses historical transaction information to update the plurality of rules and plurality of meta-rules associated with the point of service device.
  • 16. The method of claim 11, wherein the service provider system and the point of service device communicate in real-time.
  • 17. The method of 11, the method further comprising: defining, at the service provider system, a plurality of rules and a plurality of meta-rules associated with a point of service device; anddistributing and installing, from the service provider system to the point of service device, the plurality of rules and the plurality of meta-rules associated with the point of service device.
  • 18. A service provider system, comprising: a processor; anda computer-readable medium, comprising code executable by the processor to perform a method associated with the service provider system and a point of service device, the method comprising: storing a plurality of rules and a plurality of meta-rules associated with the service provider system;communicating through a network gateway with the point of service device, wherein the point of service device is associated with a plurality of rules and a plurality of meta-rules;collecting data at the service provider system, from the point of service device;receiving a request from the point of service device to help determine an outcome for a transaction; anddetermining, by the service provider system, the outcome for the transaction, wherein the point of service device is further configured so that when the service provider system and the point of service device are unable to determine the outcome, the service provider system uses its plurality of meta-rules to either determine whether one or more of the plurality of rules in either the point of service device or the service provider system can be altered in order to determine the outcome.
  • 19. The system of 18, wherein the service provider system is configured to route an administrative request to the point of service device.
  • 20. The system of claim 19, wherein the administrative request includes an update to the plurality of rules and an update to the plurality of meta-rules associated with the point of service device, and a time to perform the update.
CROSS-REFERENCES TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 10/678,034, filed Sep. 30, 2003, entitled “METHOD AND SYSTEM FOR PROVIDING A DISTRIBUTED ADAPTIVE RULES BASED DYNAMIC PRICING SYSTEM, the disclosure of which is hereby incorporated by reference in its entirety for all purposes.

US Referenced Citations (247)
Number Name Date Kind
3935933 Tanaka et al. Feb 1976 A
4011433 Tateisi et al. Mar 1977 A
4108350 Forbes, Jr. Aug 1978 A
4124109 Bissell et al. Nov 1978 A
4195864 Morton et al. Apr 1980 A
4412631 Haker Nov 1983 A
4544590 Egan Oct 1985 A
4568403 Egan Feb 1986 A
4649515 Thompson et al. Mar 1987 A
4674041 Lemon et al. Jun 1987 A
4723212 Mindrum et al. Feb 1988 A
4742215 Daughters et al. May 1988 A
4794530 Yukiura et al. Dec 1988 A
4825053 Caille Apr 1989 A
4837422 Dethloff et al. Jun 1989 A
4841712 Roou Jun 1989 A
4868376 Lessin et al. Sep 1989 A
4882675 Nichtberger et al. Nov 1989 A
4910672 Off et al. Mar 1990 A
4930129 Takahira May 1990 A
4941090 McCarthy Jul 1990 A
4949256 Humble Aug 1990 A
4954003 Shea Sep 1990 A
4970658 Durbin et al. Nov 1990 A
4985615 Iijima Jan 1991 A
4992940 Dworkin Feb 1991 A
5019452 Watanabe et al. May 1991 A
5019695 Itako May 1991 A
5025372 Burton et al. Jun 1991 A
5056019 Schultz et al. Oct 1991 A
5060793 Hyun et al. Oct 1991 A
5060804 Beales et al. Oct 1991 A
5063596 Dyke Nov 1991 A
5115888 Schneider May 1992 A
5117355 McCarthy May 1992 A
5128752 Von Kohorn Jul 1992 A
5161256 Iijima Nov 1992 A
5173851 Off et al. Dec 1992 A
5185695 Pruchnicki Feb 1993 A
5200889 Mori Apr 1993 A
5202826 McCarthy Apr 1993 A
5227874 Von Kohorn Jul 1993 A
5256863 Ferguson et al. Oct 1993 A
5285278 Holman Feb 1994 A
5287181 Holman Feb 1994 A
5287268 McCarthy Feb 1994 A
5299834 Kraige Apr 1994 A
5308120 Thompson May 1994 A
5353218 De Lapa et al. Oct 1994 A
5380991 Valencia et al. Jan 1995 A
RE34915 Nichtberger et al. Apr 1995 E
5402549 Forrest Apr 1995 A
5412756 Bauman et al. May 1995 A
5417458 Best et al. May 1995 A
5420606 Begum et al. May 1995 A
5450938 Rademacher Sep 1995 A
5466010 Spooner Nov 1995 A
5471669 Lidman Nov 1995 A
5473690 Grimonprez et al. Dec 1995 A
5483444 Heintzeman et al. Jan 1996 A
5484998 Bejnar et al. Jan 1996 A
5491326 Marceau et al. Feb 1996 A
5491838 Takahisa et al. Feb 1996 A
5500681 Jones Mar 1996 A
5501491 Thompson Mar 1996 A
5513102 Auriemma Apr 1996 A
5515270 Weinblatt May 1996 A
5530232 Taylor Jun 1996 A
5531482 Blank Jul 1996 A
5535118 Chumbley Jul 1996 A
5537314 Kanter Jul 1996 A
5559313 Claus et al. Sep 1996 A
5564073 Takahisa Oct 1996 A
5577266 Takahisa et al. Nov 1996 A
5577915 Feldman Nov 1996 A
5578808 Taylor Nov 1996 A
5579537 Takahisa Nov 1996 A
5594493 Nemirofsky Jan 1997 A
5612868 Off et al. Mar 1997 A
5621812 Deaton et al. Apr 1997 A
5642485 Deaton et al. Jun 1997 A
5644723 Deaton et al. Jul 1997 A
5649114 Deaton et al. Jul 1997 A
5649118 Carlisle et al. Jul 1997 A
5650209 Ramsburg et al. Jul 1997 A
5687322 Deaton et al. Nov 1997 A
5689100 Carrithers et al. Nov 1997 A
5710886 Christensen et al. Jan 1998 A
5727153 Powell Mar 1998 A
5734838 Robinson et al. Mar 1998 A
5742845 Wagner Apr 1998 A
5754762 Kuo et al. May 1998 A
5761648 Golden et al. Jun 1998 A
5765141 Spector Jun 1998 A
5767896 Nemirofsky Jun 1998 A
5774870 Storey Jun 1998 A
5776287 Best et al. Jul 1998 A
5791991 Small Aug 1998 A
5794210 Goldhaber et al. Aug 1998 A
5797126 Helbling et al. Aug 1998 A
5802519 De Jong Sep 1998 A
5804806 Haddad et al. Sep 1998 A
5806044 Powell Sep 1998 A
5806045 Biorge et al. Sep 1998 A
5815658 Kuriyama Sep 1998 A
5822735 De Lapa et al. Oct 1998 A
5822737 Ogram Oct 1998 A
5832457 O'Brien et al. Nov 1998 A
5844218 Kawan et al. Dec 1998 A
5845259 West et al. Dec 1998 A
5855007 Jovicic et al. Dec 1998 A
5857175 Day et al. Jan 1999 A
5859419 Wynn Jan 1999 A
RE36116 McCarthy Feb 1999 E
5865340 Alvern Feb 1999 A
5865470 Thompson Feb 1999 A
5868498 Martin Feb 1999 A
5880769 Nemirofsky et al. Mar 1999 A
5884271 Pitroda Mar 1999 A
5884277 Khosla Mar 1999 A
5884278 Powell Mar 1999 A
5887271 Powell Mar 1999 A
5890135 Powell Mar 1999 A
5892827 Beach et al. Apr 1999 A
5898838 Wagner Apr 1999 A
5899998 McGauley et al. May 1999 A
5903732 Reed et al. May 1999 A
5905246 Fajkowski May 1999 A
5905908 Wagner May 1999 A
5907350 Nemirofsky May 1999 A
5907830 Engel et al. May 1999 A
5909486 Walker et al. Jun 1999 A
5912453 Gungl et al. Jun 1999 A
5915019 Ginter et al. Jun 1999 A
5915244 Jack et al. Jun 1999 A
5923884 Peyret et al. Jul 1999 A
5924072 Havens Jul 1999 A
5926795 Williams Jul 1999 A
5928082 Clapper, Jr. Jul 1999 A
5931947 Burns et al. Aug 1999 A
5943651 Oosawa Aug 1999 A
5950173 Perkowski Sep 1999 A
5953047 Nemirofsky Sep 1999 A
5953705 Oneda Sep 1999 A
5956694 Powell Sep 1999 A
5956695 Carrithers et al. Sep 1999 A
5958174 Ramsberg et al. Sep 1999 A
5960082 Haenel Sep 1999 A
5963917 Ogram Oct 1999 A
5969318 Mackenthun Oct 1999 A
5970469 Scroggie et al. Oct 1999 A
5974399 Giuliani et al. Oct 1999 A
5974549 Golan Oct 1999 A
5978013 Jones et al. Nov 1999 A
5987795 Wilson Nov 1999 A
5997042 Blank Dec 1999 A
6000608 Dorf Dec 1999 A
6002771 Nielsen Dec 1999 A
6003113 Hoshino Dec 1999 A
6003134 Kuo et al. Dec 1999 A
6005942 Chan et al. Dec 1999 A
6009411 Kepecs Dec 1999 A
6012635 Shimada et al. Jan 2000 A
6014634 Scroggie et al. Jan 2000 A
6024286 Bradley et al. Feb 2000 A
6035280 Christensen Mar 2000 A
6038551 Barlow et al. Mar 2000 A
6041309 Laor Mar 2000 A
6047325 Jain et al. Apr 2000 A
6049778 Walker et al. Apr 2000 A
6052468 Hillhouse Apr 2000 A
6052690 De Jong Apr 2000 A
6052785 Lin et al. Apr 2000 A
6055509 Powell Apr 2000 A
6061660 Eggleston et al. May 2000 A
6067526 Powell May 2000 A
6070147 Harms et al. May 2000 A
6073238 Drupsteen Jun 2000 A
6076068 Delapa Jun 2000 A
6076069 Laor Jun 2000 A
6089611 Blank Jul 2000 A
6094656 De Jong Jul 2000 A
6101422 Furlong Aug 2000 A
6101477 Hohle et al. Aug 2000 A
6105002 Powell Aug 2000 A
6105865 Hardesty Aug 2000 A
6105873 Jeger Aug 2000 A
6112987 Lambert et al. Sep 2000 A
6112988 Powell Sep 2000 A
6119933 Wong et al. Sep 2000 A
6119945 Muller et al. Sep 2000 A
6122631 Berbec et al. Sep 2000 A
6129274 Suzuki Oct 2000 A
6144948 Walker et al. Nov 2000 A
6151586 Brown Nov 2000 A
6151587 Mathias Nov 2000 A
6154751 Ault et al. Nov 2000 A
6161870 Blank Dec 2000 A
6164549 Richards Dec 2000 A
6170061 Beser Jan 2001 B1
6173269 Solokl et al. Jan 2001 B1
6173891 Powell Jan 2001 B1
6179205 Sloan Jan 2001 B1
6179710 Sawyer et al. Jan 2001 B1
6183017 Najor et al. Feb 2001 B1
6185541 Scroggie et al. Feb 2001 B1
6189100 Barr et al. Feb 2001 B1
6189878 Meese Feb 2001 B1
6195666 Schneck et al. Feb 2001 B1
6210276 Mullins Apr 2001 B1
6216014 Proust et al. Apr 2001 B1
6216204 Thiriet Apr 2001 B1
6220510 Everett et al. Apr 2001 B1
6222914 McMullin Apr 2001 B1
6230143 Simons et al. May 2001 B1
6237145 Narasimhan et al. May 2001 B1
6241287 Best et al. Jun 2001 B1
6243687 Powell Jun 2001 B1
6243688 Kalina Jun 2001 B1
6244958 Acres Jun 2001 B1
6266647 Fernandez Jul 2001 B1
6267263 Emoff et al. Jul 2001 B1
6269158 Kim Jul 2001 B1
6279112 O'Toole, Jr. et al. Aug 2001 B1
6282516 Giuliani Aug 2001 B1
6292785 McEvoy et al. Sep 2001 B1
6292786 Deaton et al. Sep 2001 B1
6296191 Hamann et al. Oct 2001 B1
6299530 Hansted et al. Oct 2001 B1
6321208 Barnett et al. Nov 2001 B1
6385723 Richards May 2002 B1
6390374 Carper et al. May 2002 B1
6480935 Carper et al. Nov 2002 B1
6549773 Linden et al. Apr 2003 B1
6549912 Chen Apr 2003 B1
6612490 Herrendoerfer et al. Sep 2003 B1
6681995 Sukeda et al. Jan 2004 B2
6689345 Lezer Feb 2004 B2
20020002468 Spagna et al. Jan 2002 A1
20020076051 Nii Jun 2002 A1
20030055792 Kinoshita et al. Mar 2003 A1
20030093344 Sesek May 2003 A1
20030187794 Irwin et al. Oct 2003 A1
20040141661 Hanna et al. Jul 2004 A1
20040204078 Fare et al. Oct 2004 A1
20050076110 Mathew et al. Apr 2005 A1
20050172033 Mathew et al. Aug 2005 A1
Foreign Referenced Citations (120)
Number Date Country
200039412 Dec 2000 AU
1002756 May 1991 BE
2293944 Aug 2000 CA
2267041 Sep 2000 CA
2317138 Jan 2002 CA
19522527 Jan 1997 DE
19848712 Apr 2000 DE
19960978 Aug 2000 DE
10015103 Oct 2000 DE
0203424 Dec 1986 EP
0292248 Nov 1988 EP
0475837 Mar 1992 EP
0540095 May 1993 EP
0658862 Jun 1995 EP
0675614 Oct 1995 EP
0682327 Nov 1995 EP
0875841 Nov 1998 EP
0936530 Aug 1999 EP
0938050 Aug 1999 EP
0938051 Aug 1999 EP
0944007 Sep 1999 EP
0949595 Oct 1999 EP
0982692 Mar 2000 EP
0984404 Mar 2000 EP
1085395 Mar 2001 EP
1102320 May 2001 EP
1111505 Jun 2001 EP
1113387 Jul 2001 EP
1113407 Jul 2001 EP
1168137 Jan 2002 EP
1233333 Aug 2002 EP
2772957 Jun 1999 FR
2793048 Nov 2000 FR
2794543 Dec 2000 FR
2796176 Jan 2001 FR
2804234 Jul 2001 FR
2331381 May 1999 GB
2343091 Apr 2000 GB
2351379 Dec 2000 GB
2355324 Apr 2001 GB
2000112864 Apr 2000 JP
2000181764 Jun 2000 JP
2001202484 Jul 2001 JP
2001236232 Aug 2001 JP
10-2000-0039297 May 2001 KR
2001-0044823 Jun 2001 KR
2001-0058742 Jul 2001 KR
2002-0021237 Mar 2002 KR
WO 9016126 Dec 1990 WO
WO 9625724 Aug 1996 WO
WO 9638945 Dec 1996 WO
WO 9642109 Dec 1996 WO
WO 9705582 Feb 1997 WO
WO 9710562 Mar 1997 WO
WO 9739424 Oct 1997 WO
WO 9802834 Jan 1998 WO
WO 9809257 Mar 1998 WO
WO 9820465 May 1998 WO
WO 9843169 Oct 1998 WO
WO 9843212 Oct 1998 WO
WO 9852153 Nov 1998 WO
WO 9910824 Mar 1999 WO
WO 9916030 Apr 1999 WO
WO 9919846 Apr 1999 WO
WO 9944172 Sep 1999 WO
WO 9945507 Sep 1999 WO
WO 9949415 Sep 1999 WO
WO 9949426 Sep 1999 WO
WO 0039714 Jul 2000 WO
WO 0046665 Aug 2000 WO
WO 0054507 Sep 2000 WO
WO 0057315 Sep 2000 WO
WO 0057613 Sep 2000 WO
WO 0062265 Oct 2000 WO
WO 0062472 Oct 2000 WO
WO 0067185 Nov 2000 WO
WO 0068797 Nov 2000 WO
WO 0068902 Nov 2000 WO
WO 0068903 Nov 2000 WO
WO 0069183 Nov 2000 WO
WO 0075775 Dec 2000 WO
WO 0077750 Dec 2000 WO
WO 0104851 Jan 2001 WO
WO 0106341 Jan 2001 WO
WO 0108087 Feb 2001 WO
WO 0113572 Feb 2001 WO
WO 0215037 Feb 2001 WO
WO 0115397 Mar 2001 WO
WO 0118633 Mar 2001 WO
WO 0118746 Mar 2001 WO
WO 0129672 Apr 2001 WO
WO 0133390 May 2001 WO
WO 0140908 Jun 2001 WO
WO 0142887 Jun 2001 WO
WO 0144900 Jun 2001 WO
WO 0144949 Jun 2001 WO
WO 0147176 Jun 2001 WO
WO 0150229 Jul 2001 WO
WO 0152575 Jul 2001 WO
WO 0155955 Aug 2001 WO
WO 0159563 Aug 2001 WO
WO 0161620 Aug 2001 WO
WO 0165545 Sep 2001 WO
WO 0167694 Sep 2001 WO
WO 0171648 Sep 2001 WO
WO 0171679 Sep 2001 WO
WO 0173530 Oct 2001 WO
WO 0173533 Oct 2001 WO
WO 0178020 Oct 2001 WO
WO 0180563 Oct 2001 WO
WO 0184377 Nov 2001 WO
WO 0184474 Nov 2001 WO
WO 0184512 Nov 2001 WO
WO 0188705 Nov 2001 WO
WO 0206978 Jan 2002 WO
WO 0210962 Feb 2002 WO
WO 0214991 Feb 2002 WO
WO 0221315 Mar 2002 WO
WO 0229577 Apr 2002 WO
WO 02088895 Nov 2002 WO
Related Publications (1)
Number Date Country
20120016756 A1 Jan 2012 US
Continuations (1)
Number Date Country
Parent 10678034 Sep 2003 US
Child 13185241 US