Patent Grant
11170397
The present disclosure generally relates to administering a rewards program. More specifically, the present disclosure relates to administering a dynamically provisioned reward system.
Traditional reward systems provide users with rewards from a fixed pool of rewards. This pool is usually provided to the rewards system when the rewards program is established. Thereafter, the rewards may be provided to user by randomly selecting the reward from the pool. However, because the pool of rewards is usually provided at the outset of the rewards program, the high value rewards may all be provided to certain users at the outset of the rewards program. If the high value rewards are already distributed, users may be less inclined to engage in the activities required to earn the rewards. As such, there is a need to improve the reward distribution in rewards programs.
In various embodiments, the systems, methods, and computer program products (collectively “systems”) described herein are generally configured to administer rewards. The system may be configured to create a rewards program that comprises a duration. The system may distribute a first plurality of rewards in a rewards pool associated with the rewards program, based on a first distribution trigger within the duration associated with the rewards program (e.g., at the time period when the rewards program is created). The system may determine a reward from the first plurality of rewards. The reward may be associated with a transaction account based on an activity associated with the transaction account. The system may also distribute a second plurality of rewards into the rewards pool associated with the rewards program based on a second distribution trigger with the duration associated with the rewards program.
In various embodiments, the first distribution trigger and/or the second distribution trigger may be an average spend level of transactions qualifying for the rewards program, a predetermined period of time, a number of rewards redeemed, a value of rewards provided by the rewards program, a gross transaction value associated with the activities satisfying the rewards program and/or the like.
In various embodiments, the system may distribute a first reward to the transaction account, in response to the activity satisfying a rule. The rule may be associated with the rewards program and/or the first plurality of rewards. The system may also be capable of receiving activity information describing the activity associated with the transaction account.
The features and advantages of the present disclosure will become more apparent from the detailed description set forth below when taken in conjunction with the drawings.
In various embodiments, the systems, methods and computer program products (collectively “system”) described herein provide consumers with the ability to earn rewards based on a consumer's activities (e.g., transactions, purchases, etc.) in a digital channel. Moreover, the rewards system is configured to dynamically distribute one or more subsets of rewards to a rewards program.
The detailed description of various embodiments herein makes reference to the accompanying drawings, which show various embodiments by way of illustration. While these various embodiments are described in sufficient detail to enable those skilled in the art to practice the disclosure, it should be understood that other embodiments may be realized and that logical and mechanical changes may be made without departing from the spirit and scope of the disclosure. Thus, the detailed description herein is presented for purposes of illustration only and not of limitation. For example, the steps recited in any of the method or process descriptions may be executed in any order and are not limited to the order presented. Moreover, any of the functions or steps may be outsourced to or performed by one or more third parties. Furthermore, any reference to singular includes plural embodiments, and any reference to more than one component may include a singular embodiment.
Systems, methods and computer program products are provided. In the detailed description herein, references to “various embodiments”, “one embodiment”, “an embodiment”, “an example embodiment”, etc., indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may not necessarily include the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to affect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described. After reading the description, it will be apparent to one skilled in the relevant art(s) how to implement the disclosure in alternative embodiments.
The phrases consumer, customer, user, account holder, account affiliate, cardmember and/or the like shall include any person, entity, business, government organization, business, software, hardware, machine associated with a transaction account, buys merchant offerings offered by one or more merchants using the account and/or is designated for performing transactions on the account, regardless of whether a physical card is associated with the account. For example, the cardmember may include a transaction account owner, a transaction account user, an account affiliate, a child account user, a subsidiary account user, a beneficiary of an account, a custodian of an account, and/or any other person or entity affiliated or associated with a transaction account.
Phrases and terms similar to an “item” may include any good, service, merchant, information, experience, data, content, access, rental, lease, contribution, account, credit, debit, benefit, right, reward, points, coupons, credits, monetary equivalent, anything of value, something of minimal or no value, monetary value, non-monetary value and/or the like. Moreover, the “transactions” or “purchases” discussed herein may be associated with an item. Furthermore, a “reward” may be an item.
In various embodiments and as used herein, a digital channel may be any suitable channel available to a user over a network, including for example, a social media channel, an entertainment channel, a service channel, a review channel, a service scheduling channel, and/or the like. The channel may include a user interface and user account that may be created by a user. Moreover, the user may be able to access the digital channel through a web client on any suitable electronic device. The digital channel may also be considered a non-traditional purchasing channel (e.g., a channel where information about an item may be present, but where the ability to purchase the item is not available (e.g., social media channel information for an item).
As used herein, a “merchant” may be any person or entity capable of providing a service or an item. A merchant may distribute the item in any way, for example, by exchanging the item for payment. The merchant may be capable of accepting the payment through any suitable payment channel including traditional payment channels including, for example, POS terminals, online payments terminals, transaction account networks and the like. The merchant may also accept payment through non-traditional payment terminals including, for example, social media channels, person to person payments. Further information about person to person payments is described in U.S. patent application Ser. No. 13/640,216, entitled Systems and Methods for Transferring Value via a Social Network, which is herein incorporated by reference in its entirety for any purpose.
In various embodiments, the rewards systems described herein may be configured to dynamically provision rewards to a rewards program. This dynamic provisioning allows the rewards system to distribute high value, medium value and low value rewards to the rewards program throughout the duration of the program. This allows the program to randomly distribute rewards for purchases and provides consumers with a chance to earn a high value, medium value, or low value reward at any time during the duration of the rewards program. “Value” as used herein may include monetary value, sentimental value, experience value, educational value, emotional value, cultural value and/or the like.
In various embodiments, and with reference to
Gaming module 120 may comprise rewards database 122 and rewards distribution engine 124. Rewards database 122 may be configured to receive, distribute, parse, and/or store rewards. Rewards distribution engine 124 may be operably coupled to or in electronic communication with rewards database 122. Rewards distribution engine 124 may be configured to group and/or create subsets of rewards. Moreover, rewards distribution engine may be configured to monitor and/or analyze activities associated with the rewards program. This monitoring or analysis may allow rewards distribution engine 124 to populate or provision subsets or rewards to the rewards program in response to activities associated with the rewards program.
In various embodiments, and with reference to
In response to the reward program providing a reward to a consumer based on a qualifying transaction, gaming module 120 may access or request a reward from rewards distribution engine 124. Based on the request and/or the identifying information, rewards distribution engine may select one or more rewards from rewards database 122. In response to the selecting of the reward, gaming module 120 may provide reward information to reporting engine 130. Reward information may include, for example, information describing the reward, instructions for providing the reward to the consumer, the transaction associated with the reward, the transaction account associated with the reward, reward statistical information, transaction statistical information, and/or the like. Based on the reward information, reporting engine 130 may provide a notification to the consumer through a digital channel, as an e-mail, or by any other suitable communication mechanism (step 240).
The notification of the reward may provide the consumer with instructions and/or a mechanism (e.g., a hyperlink, code, and/or the like) to redeem the reward (Step 250). The reward may be redeemed at a sponsoring merchant (e.g., a merchant who funded the reward) and/or through an identified channel 140 (e.g., a social media channel). The reward may further include the option to share or distribute portions of the reward. The notification may include instructions for distributing or sharing portions of the reward. For example, a reward having a monetary value (e.g., $500 credit) may be provided to a consumer through a social media channel. The reward may be further defined in portions such that the consumer is provided with a portion that can be used by the consumer and one or more portions that can be shared by the consumer. Using the $500 credit as an example, the reward may provide that a portion (e.g., $200) is for the consumer and three additional rewards (e.g., three rewards of $100 credit) may be shared by the consumer. In response to the reward being provided in a social media channel, the portions of the reward may be shared through the social media channel by the consumer (Step 260).
For example, if the reward were provided through a social media channel such as FACEBOOK, the consumer may be able to designate one or more recipients who are associated with the consumer FACEBOOK profile to receive rewards. Moreover, the consumer may be able to define parameters associated with the portions of the reward that are to be shared. For example, the consumer may be able to define an action to be completed in the channel to receive the shared portion of the reward (e.g., a like, a broadcast, an interest selection, and/or the like). Moreover, the reward notification may provide that recipients of the portions of the shared reward take an action (e.g., an action with a merchant, an action in a channel, sync a transaction account with the reward program, and/or the like) to receive the shared portion of the reward. Further and based on the notification and/or redemption, the consumer may receive the reward (Step 270).
In various embodiments, and with reference to
System 300 may receive transaction account information through at least one of a registration portal 311 and/or a digital channel portal 340. Registration portal 311 may be provided by a reward program administrator or a transaction account issuer associated with a reward program. Digital channel portal 340 may be accessible by a user and/or provided through a merchant website, a digital channel, and/or the like. The registration portal 311 and/or digital channel portal 340 may be capable of collecting, storing, recording, transmitting and/or processing registration information (e.g., transaction account information). Registration portal 311 and/or digital channel portal 340 may be further capable of providing the registration information to transaction account sync module 312. For example, system 300 and or registration portal 311 may be associated with a payment processor (e.g., transaction account issuer). In this example, registration portal 311 may request the transaction account information through a channel provided by the transaction account issuer (e.g., a transaction account issuer website). The transaction account information may also be captured through digital channel portal 340 at digital channel 140 by a digital channel provider, a third party, or by system 300. The transaction account information may be captured through a fillable form, through an API or other suitable channel interface.
System 300 may also be capable of receiving consumer profile information for a digital channel. As noted above with respect to the transaction account information, the consumer profile information for the channel may be requested by or provided to system 300 through any suitable channel. The consumer profile information may also be provided in conjunction with or at substantially the same time as the transaction account information. For example, in response to the transaction account information being provided to system 300 through the digital channel, the consumer profile information for the channel may be automatically sent with the captured transaction account information. More specifically, the system capturing the data may request that the consumer be logged into or otherwise known to the digital channel in response to providing the transaction account information, such that, the digital channel can automatically provide the consumer profile information with the transaction account information.
System 300 may also receive a token or code associated with a rewards program and/or channel. The token or code may be used to associate the transaction account with a particular rewards program, reward level, and/or digital channel. In various embodiments, system 300 and/or transaction account sync module 312 may be capable of requesting, defining, and/or associating preferences with the transaction account, reward program, and/or consumer profile for the channel. System 300 may allow the consumer to define various preference related to activities, rewards, notification, sharing, purchasing, shipment, offers, and/or the like.
As noted above, system 300 may also allow a consumer to partially or fully define other preferences. For example, system 300 may allow a user to define one or more shipping addresses to facilitate fulfillment of a reward. System 300 may also allow a user to define how rewards are earned, shared, distributed, provided, and the like for transactions and/or purchase events. For additional information on how offers and/or rewards are earned, distributed, and/or provided, see for example, U.S. patent application Ser. No. 13/439,768, filed, Apr. 4, 2012, and entitled System and Method for Providing International Coupon-Less Discounts, U.S. Provisional Patent Application Ser. No. 61/710,461 filed on Mar. 14, 2012 and entitled “GENERATING MERCHANT RECOMMENDATIONS FOR CONSUMERS” and U.S. Provisional Patent Application Ser. No. 61/646,778 filed on May 14, 2012 and entitled “SYSTEMS AND METHODS FOR TAILORED MARKETING BASED ON FILTERING,” each of which is incorporated by reference in its entirety for all purposes.
As part of preference selection, system 300 may provide a user with the option to associate multiple channels with a single transaction account or multiple transaction accounts with one or more channels. For example, if a user has several digital channels and/or social media profiles (e.g., Facebook, Foursquare, Twitter, LinkedIn, and/of the like), system 300 may request information for each of the digital channels and/or social media profiles or may provide options for a user to select particular channels and/or profiles to associate with one or more accounts, reward types, reward programs, and/or the like. This central linking capability creates a convenient and efficient solution for the user to link her transaction account(s) with multiple channels through a single interface to facilitate reward sharing, notification and/or the like.
In various embodiments and with reference to
System 100 may associate a redemption process for a particular type of reward. For example, in response to a reward being a sharable reward 431, system 100 may require that the consumer redeem the reward (Step 450). Based on the redemption, system 100 may provide one or more option to share the reward (Step 460) through a digital channel or any other suitable mechanism. Based on and/or simultaneously with the sharing action the consumer may also be provided with the consumer's portion of the sharable reward (Step 470).
In response to the reward being a gift card 432 and/or a membership or service 433, system 100 may require that the consumer redeem the reward (Step 450). Because of the nature of the reward, system 100 may request information from the consumer based on the redemption or may evaluate the preferences associated with the consumer's enrollment in the reward program. Based on the information or preferences, system 100 may provide the consumer with the reward (Step 470).
In response to the reward being future activity reward 434 or credit 435, system 100 may provide the reward without requesting additional information from the consumer. For example, where the reward is credit 435, system 100 may provide a statement credit to the transaction account or an instant credit to the transaction based on the authorization (Step 470). This crediting process may be defined by the reward parameters, by the preferences of the consumer, and/or by the preferences of the sponsoring entity, reward program administrator, payment processor, and/or transaction account issuer. Where the reward is future activity reward 434, system 100 may provide a notification or the reward to encourage the consumer to complete the future activity. System 100 may also create a rule associated with the synced and/or registered transaction account such that a future activity that complies with future activity reward 434 provides the reward to the consumer based on the rules associated with the reward, the preferences of the consumer, and/or by the preferences of the sponsoring entity, reward program administrator, payment processor, and/or transaction account issuer (Step 470).
In various embodiments and with reference to
In various embodiments, seeding logic may be capable of setting a predetermined distribution of rewards in the rewards program. The distribution may be constant based on the predetermined distribution or may be dynamic based on factors or triggering events associated with the rewards program and defined in the predetermined distribution. For example, the distribution may sequentially distribute rewards in a predetermined order or may dynamically adjust distribution based on consumer activities, merchant goals, consumer behaviors, time periods, seasons, and/or any other suitable events, parameters or factors.
Seeding logic 527 may be configured to distribute rewards into one or more groups (e.g., rewards A 501, rewards B 502, rewards C 503, and/or rewards D 504). In other words, a pool of rewards associated with a rewards program may be divided into sub-pools or subsets of rewards. These sub-pools may further be distributed based on predetermined selections, such that a sub-pool of rewards has a distribution of rewards (e.g., high value rewards, medium, value rewards, and/or low value rewards). The sub-pools may also be divided based on reward value such that a first pool comprises high value rewards, a second pool comprises medium value rewards, and a third pool comprises low value rewards. The rewards may be introduced into the reward program and distributed through the reward program to consumer in any suitable fashion and/or based on any suitable trigger or distribution event.
Gaming module 120 may be configured to select rewards randomly. Seeding logic 527 may be capable of maintaining a pre-defined or dynamically determined distribution of rewards A 501, rewards B 502, rewards C 503, and/or rewards D 504 in the rewards pool for the reward program. This distribution may be pre-defined by the administrator of the reward program. Seeding logic 527 may also be dynamically determined based on the interest associated with the rewards program, a time or year (e.g., a particular consumer season such as “back to school” or “holiday shopping”), an event (e.g., Christmas), activity associated with the rewards program, and/or the like. As a result, system 100 is able to maintain a distribution or level of rewards A 501, rewards B 502, rewards C 503, and/or rewards D 504 to encourage a desired consumer activity.
Seeding logic 527 may also create distribution of rewards of different values in one or more pools or rewards associated with a rewards program (e.g., rewards A 501, rewards B 502, rewards C 503, and/or rewards D 504). In this example, each pool or subset of rewards may comprise some concentration or percentage of high value rewards, medium value rewards, and low value rewards. These rewards in the pools may be introduced into and distributed to consumers from the rewards program sequentially (e.g., the rewards from rewards A 501 may be distributed until all rewards have been distributed to the consumers, then the rewards from rewards B 502 may be distributed until all rewards have been distributed to consumers and so on). The rewards in the pools may also be dynamically introduced into the rewards program and/or distributed to consumers, providing the consumer with a heightened level of interest and a changing probability of receiving a high value reward. Seeding logic 527 may comprise a trigger event that is associating with the dynamic distribution such that dynamic distribution occurs in response to a trigger event. Seeding logic 527 may also be capable of initiating dynamic distribution over a period of time or at any other suitable point.
Moreover, the seeding logic may define or comprise trigger events. The rewards program may comprise a duration (e.g., a time activities that comply with the program are eligible for rewards) and one or more tiger events. These trigger events may cause gaming module 120 to populate a rewards program with a first pool (e.g., subset) of rewards associated with the rewards program from inventory 526 based on seeding logic 527. For example, in response to a first trigger event (e.g., creation of a reward program), gaming module 120 may distribute a portion of inventory 526 to a pool of rewards associated with the rewards program based on seeding logic 527. These rewards may be distributed to consumers based on activities that satisfy the rules associated with the rewards. In response to a tiger event, gaming module 120 may populate the rewards program with a second pool (e.g., subset) of rewards from inventory 526 based on seeding logic 527. This process may continue as additional trigger events are achieved during the duration of the rewards program.
The trigger event associated with the selection of a pool of rewards and/or the populating of a rewards program may be any suitable event. The event may be dynamically determined or predetermined. For example, the trigger event may be a trend or rate of activities associated with a reward program, an average spend level of transactions qualifying for the rewards program, a predetermined period of time, a number of rewards redeemed, a number of activities associated with a sponsoring entity, a value of rewards selected by gaming module 120, a gross transaction value associated with the spend activities, and/or the like.
In various embodiments, seeding logic 527 is defined prior to initiation of the rewards program. In this way consumers are aware of reward distribution parameters prior to participating in the rewards program. Moreover, consumer may be informed of the dynamic nature of seeding logic 527 to insure that a reward program is fair, interesting, and exciting to consumers. In this way, even though a reward distribution shifts and the probability of receiving a high value reward shifts, consumers are aware of the potential shift based on the published and/or predetermined seeding logic 527 and associated distribution plan.
As such, the systems described herein facilitate purchases in digital channels. The systems described herein further facilitate monitor and rewarding activities or accomplishments in a digital channel. The systems described herein further facilitate confirmation or verification of activities in digital channels based on transaction information.
Any communication, transmission and/or channel discussed herein may include any system or method for delivering content (e.g. data, information, metadata, etc.), and/or the content itself. The content may be presented in any form or medium, and in various embodiments, the content may be delivered electronically and/or capable of being presented electronically. For example, a channel may comprise a website, a uniform resource locator (“URL”), a document (e.g., a Microsoft Word document, a Microsoft Excel document, an Adobe .pdf document, etc.), an “ebook,” an “emagazine,” an application or micro-application (as described below), an SMS or other type of text message, an email, facebook, twitter, MMS and/or other type of communication technology. In various embodiments, a channel may be hosted or provided by a data partner. In various embodiments, the distribution channel may comprise at least one of a merchant website, a social media website, affiliate or partner websites, an external vendor, a mobile device communication, social media network and/or location based service. Distribution channels may include at least one of a merchant website, a social media site, affiliate or partner websites, an external vendor, and a mobile device communication. Examples of social media sites include Facebook®, Foursquare®, Twitter®, MySpace®, LinkedIn®, and the like. Examples of affiliate or partner websites include American Express®, Groupon®, LivingSocial®, and the like. Moreover, examples of mobile device communications include texting, email, and mobile applications for smartphones.
A “consumer profile” or “consumer profile data” may comprise any information or data about a consumer that describes an attribute associated with the consumer (e.g., a preference, an interest, demographic information, personally identifying information, and the like).
In various embodiments, the methods described herein are implemented using the various particular machines described herein. The methods described herein may be implemented using the below particular machines, and those hereinafter developed, in any suitable combination, as would be appreciated immediately by one skilled in the art. Further, as is unambiguous from this disclosure, the methods described herein may result in various transformations of certain articles.
For the sake of brevity, conventional data networking, application development and other functional aspects of the systems (and components of the individual operating components of the systems) may not be described in detail herein. Furthermore, the connecting lines shown in the various figures contained herein are intended to represent exemplary functional relationships and/or physical couplings between the various elements. It should be noted that many alternative or additional functional relationships or physical connections may be present in a practical system.
The various system components discussed herein may include one or more of the following: a host server or other computing systems including a processor for processing digital data; a memory coupled to the processor for storing digital data; an input digitizer coupled to the processor for inputting digital data; an application program stored in the memory and accessible by the processor for directing processing of digital data by the processor; a display device coupled to the processor and memory for displaying information derived from digital data processed by the processor; and a plurality of databases. Various databases used herein may include: client data; merchant data; financial institution data; and/or like data useful in the operation of the system. As those skilled in the art will appreciate, user computer may include an operating system (e.g., Windows NT, Windows 95/98/3000, Windows XP, Windows Vista, Windows 7, OS2, UNIX, Linux, Solaris, MacOS, etc.) as well as various conventional support software and drivers typically associated with computers.
The present system or any part(s) or function(s) thereof may be implemented using hardware, software or a combination thereof and may be implemented in one or more computer systems or other processing systems. However, the manipulations performed by embodiments were often referred to in terms, such as matching or selecting, which are commonly associated with mental operations performed by a human operator. No such capability of a human operator is necessary, or desirable in most cases, in any of the operations described herein. Rather, the operations may be machine operations. Useful machines for performing the various embodiments include general purpose digital computers or similar devices.
In fact, in various embodiments, the embodiments are directed toward one or more computer systems capable of carrying out the functionality described herein. The computer system includes one or more processors, such as processor. The processor is connected to a communication infrastructure (e.g., a communications bus, cross over bar, or network). Various software embodiments are described in terms of this exemplary computer system. After reading this description, it will become apparent to a person skilled in the relevant art(s) how to implement various embodiments using other computer systems and/or architectures. Computer system can include a display interface that forwards graphics, text, and other data from the communication infrastructure (or from a frame buffer not shown) for display on a display unit.
Computer system also includes a main memory, such as for example random access memory (RAM), and may also include a secondary memory. The secondary memory may include, for example, a hard disk drive and/or a removable storage drive, representing a floppy disk drive, a magnetic tape drive, an optical disk drive, etc. The removable storage drive reads from and/or writes to a removable storage unit in a well-known manner. Removable storage unit represents a floppy disk, magnetic tape, optical disk, etc. which is read by and written to by removable storage drive. As will be appreciated, the removable storage unit includes a computer usable storage medium having stored therein computer software and/or data.
In various embodiments, secondary memory may include other similar devices for allowing computer programs or other instructions to be loaded into computer system. Such devices may include, for example, a removable storage unit and an interface. Examples of such may include a program cartridge and cartridge interface (such as that found in video game devices), a removable memory chip (such as an erasable programmable read only memory (EPROM), or programmable read only memory (PROM)) and associated socket, and other removable storage units and interfaces, which allow software and data to be transferred from the removable storage unit to computer system.
Computer system may also include a communications interface. Communications interface allows software and data to be transferred between computer system and external devices. Examples of communications interface may include a modem, a network interface (such as an Ethernet card), a communications port, a Personal Computer Memory Card International Association (PCMCIA) slot and card, etc. Software and data transferred via communications interface are in the form of signals which may be electronic, electromagnetic, optical or other signals capable of being received by communications interface. These signals are provided to communications interface via a communications path (e.g., channel). This channel carries signals and may be implemented using wire, cable, fiber optics, a telephone line, a cellular link, a radio frequency (RF) link, wireless and other communications channels.
The terms “computer program medium” and “computer usable medium” are used to generally refer to media such as removable storage drive and a hard disk installed in hard disk drive. These computer program products provide software to computer system.
Computer programs (also referred to as computer control logic) are stored in main memory and/or secondary memory. Computer programs may also be received via communications interface. Such computer programs, when executed, enable the computer system to perform the features as discussed herein. In particular, the computer programs, when executed, enable the processor to perform the features of various embodiments. Accordingly, such computer programs represent controllers of the computer system.
In various embodiments, software may be stored in a computer program product and loaded into computer system using removable storage drive, hard disk drive or communications interface. The control logic (software), when executed by the processor, causes the processor to perform the functions of various embodiments as described herein. In various embodiments, hardware components such as application specific integrated circuits (ASICs). Implementation of the hardware state machine so as to perform the functions described herein will be apparent to persons skilled in the relevant art(s).
In various embodiments, the server may include application servers (e.g. WEB SPHERE, WEB LOGIC, JBOSS). In various embodiments, the server may include web servers (e.g. APACHE, IIS, GWS, SUN JAVA SYSTEM WEB SERVER).
A web client includes any device (e.g., personal computer) which communicates via any network, for example such as those discussed herein. Such browser applications comprise Internet browsing software installed within a computing unit or a system to conduct online transactions and/or communications. These computing units or systems may take the form of a computer or set of computers, although other types of computing units or systems may be used, including laptops, notebooks, tablets, hand held computers, personal digital assistants, set-top boxes, workstations, computer-servers, main frame computers, mini-computers, PC servers, pervasive computers, network sets of computers, personal computers, such as iPads, iMACs, and MacBooks, kiosks, terminals, point of sale (POS) devices and/or terminals, televisions, or any other device capable of receiving data over a network. A web-client may run Microsoft Internet Explorer, Mozilla Firefox, Google Chrome, Apple Safari, or any other of the myriad software packages available for browsing the internet.
Practitioners will appreciate that a web client may or may not be in direct contact with an application server. For example, a web client may access the services of an application server through another server and/or hardware component, which may have a direct or indirect connection to an Internet server. For example, a web client may communicate with an application server via a load balancer. In an exemplary embodiment, access is through a network or the Internet through a commercially-available web-browser software package.
As those skilled in the art will appreciate, a web client includes an operating system (e.g., Windows NT, 95/98/3000/CE/Mobile, OS2, UNIX, Linux, Solaris, MacOS, PalmOS, etc.) as well as various conventional support software and drivers typically associated with computers. A web client may include any suitable personal computer, network computer, workstation, personal digital assistant, cellular phone, smart phone, minicomputer, mainframe or the like. A web client can be in a home or business environment with access to a network. In an exemplary embodiment, access is through a network or the Internet through a commercially available web-browser software package. A web client may implement security protocols such as Secure Sockets Layer (SSL) and Transport Layer Security (TLS). A web client may implement several application layer protocols including http, https, ftp, and sftp.
In various embodiments, components, modules, and/or engines of the system may be implemented as micro-applications or micro-apps. Micro-apps are typically deployed in the context of a mobile operating system, including for example, a Palm mobile operating system, a Windows mobile operating system, an Android Operating System, Apple iOS, a Blackberry operating system and the like. The micro-app may be configured to leverage the resources of the larger operating system and associated hardware via a set of predetermined rules which govern the operations of various operating systems and hardware resources. For example, where a micro-app desires to communicate with a device or network other than the mobile device or mobile operating system, the micro-app may leverage the communication protocol of the operating system and associated device hardware under the predetermined rules of the mobile operating system. Moreover, where the micro-app desires an input from a user, the micro-app may be configured to request a response from the operating system which monitors various hardware components and then communicates a detected input from the hardware to the micro-app.
As used herein, the term “network” includes any cloud, cloud computing system or electronic communications system or method which incorporates hardware and/or software components. Communication among the parties may be accomplished through any suitable communication channels, such as, for example, a telephone network, an extranet, an intranet, Internet, point of interaction device (point of sale device, personal digital assistant (e.g., iPhone®, Palm Pilot®, Blackberry®), cellular phone, kiosk, etc.), online communications, satellite communications, off-line communications, wireless communications, transponder communications, local area network (LAN), wide area network (WAN), virtual private network (VPN), networked or linked devices, keyboard, mouse and/or any suitable communication or data input modality. Moreover, although the system is frequently described herein as being implemented with TCP/IP communications protocols, the system may also be implemented using IPX, Appletalk, IP-6, NetBIOS, OSI, any tunneling protocol (e.g. IPsec, SSH), or any number of existing or future protocols. If the network is in the nature of a public network, such as the Internet, it may be advantageous to presume the network to be insecure and open to eavesdroppers. Specific information related to the protocols, standards, and application software utilized in connection with the Internet is generally known to those skilled in the art and, as such, need not be detailed herein. See, for example, DILIP NAIK, INTERNET STANDARDS AND PROTOCOLS (1998); JAVA 2 COMPLETE, various authors, (Sybex 1999); DEBORAH RAY AND ERIC RAY, MASTERING HTML 4.0 (1997); and LOSHIN, TCP/IP CLEARLY EXPLAINED (1997) and DAVID GOURLEY AND BRIAN TOTTY, HTTP, THE DEFINITIVE GUIDE (3002), the contents of which are hereby incorporated by reference.
The various system components may be independently, separately or collectively suitably coupled to the network via data links which includes, for example, a connection to an Internet Service Provider (ISP) over the local loop as is typically used in connection with standard modem communication, cable modem, Dish networks, ISDN, Digital Subscriber Line (DSL), or various wireless communication methods, see, e.g., GILBERT HELD, UNDERSTANDING DATA COMMUNICATIONS (1996), which is hereby incorporated by reference. It is noted that the network may be implemented as other types of networks, such as an interactive television (ITV) network. Moreover, the system contemplates the use, sale or distribution of any goods, services or information over any network having similar functionality described herein.
“Cloud” or “Cloud computing” includes a model for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g., networks, servers, storage, applications, and services) that can be rapidly provisioned and released with minimal management effort or service provider interaction. Cloud computing may include location-independent computing, whereby shared servers provide resources, software, and data to computers and other devices on demand. For more information regarding cloud computing, see the NIST's (National Institute of Standards and Technology) definition of cloud computing at http://csrc.nist.gov/publications/nistpubs/900-145/SP900-145.pdf (last visited June 2012), which is hereby incorporated by reference in its entirety.
As used herein, “transmit” may include sending electronic data from one system component to another over a network connection. Additionally, as used herein, “data” may include encompassing information such as commands, queries, files, data for storage, and the like in digital or any other form.
As used herein, “issue a debit”, “debit” or “debiting” refers to either causing the debiting of a stored value or prepaid card-type financial account, or causing the charging of a credit or charge card-type financial account, as applicable.
The system contemplates uses in association with web services, utility computing, pervasive and individualized computing, security and identity solutions, autonomic computing, cloud computing, commodity computing, mobility and wireless solutions, open source, biometrics, grid computing and/or mesh computing.
Any databases discussed herein may include relational, hierarchical, graphical, or object-oriented structure and/or any other database configurations. Common database products that may be used to implement the databases include DB2 by IBM (Armonk, N.Y.), various database products available from Oracle Corporation (Redwood Shores, Calif.), Microsoft Access or Microsoft SQL Server by Microsoft Corporation (Redmond, Wash.), MySQL by MySQL AB (Uppsala, Sweden), or any other suitable database product. Moreover, the databases may be organized in any suitable manner, for example, as data tables or lookup tables. Each record may be a single file, a series of files, a linked series of data fields or any other data structure. Association of certain data may be accomplished through any desired data association technique such as those known or practiced in the art. For example, the association may be accomplished either manually or automatically. Automatic association techniques may include, for example, a database search, a database merge, GREP, AGREP, SQL, using a key field in the tables to speed searches, sequential searches through all the tables and files, sorting records in the file according to a known order to simplify lookup, and/or the like. The association step may be accomplished by a database merge function, for example, using a “key field” in pre-selected databases or data sectors. Various database tuning steps are contemplated to optimize database performance. For example, frequently used files such as indexes may be placed on separate file systems to reduce In/Out (“I/O”) bottlenecks.
More particularly, a “key field” partitions the database according to the high-level class of objects defined by the key field. For example, certain types of data may be designated as a key field in a plurality of related data tables and the data tables may then be linked on the basis of the type of data in the key field. The data corresponding to the key field in each of the linked data tables is preferably the same or of the same type. However, data tables having similar, though not identical, data in the key fields may also be linked by using AGREP, for example. In accordance with one embodiment, any suitable data storage technique may be utilized to store data without a standard format. Data sets may be stored using any suitable technique, including, for example, storing individual files using an ISO/IEC 7816-4 file structure; implementing a domain whereby a dedicated file is selected that exposes one or more elementary files containing one or more data sets; using data sets stored in individual files using a hierarchical filing system; data sets stored as records in a single file (including compression, SQL accessible, hashed via one or more keys, numeric, alphabetical by first tuple, etc.); Binary Large Object (BLOB); stored as ungrouped data elements encoded using ISO/IEC 7816-6 data elements; stored as ungrouped data elements encoded using ISO/IEC Abstract Syntax Notation (ASN.1) as in ISO/IEC 8824 and 8825; and/or other proprietary techniques that may include fractal compression methods, image compression methods, etc.
In one exemplary embodiment, the ability to store a wide variety of information in different formats is facilitated by storing the information as a BLOB. Thus, any binary information can be stored in a storage space associated with a data set. As discussed above, the binary information may be stored on the financial transaction instrument or external to but affiliated with the financial transaction instrument. The BLOB method may store data sets as ungrouped data elements formatted as a block of binary via a fixed memory offset using either fixed storage allocation, circular queue techniques, or best practices with respect to memory management (e.g., paged memory, least recently used, etc.). By using BLOB methods, the ability to store various data sets that have different formats facilitates the storage of data associated with the financial transaction instrument by multiple and unrelated owners of the data sets. For example, a first data set which may be stored may be provided by a first party, a second data set which may be stored may be provided by an unrelated second party, and yet a third data set which may be stored, may be provided by an third party unrelated to the first and second party. Each of these three exemplary data sets may contain different information that is stored using different data storage formats and/or techniques. Further, each data set may contain subsets of data that also may be distinct from other subsets.
As stated above, in various embodiments, the data can be stored without regard to a common format. However, in one exemplary embodiment, the data set (e.g., BLOB) may be annotated in a standard manner when provided for manipulating the data onto the financial transaction instrument. The annotation may comprise a short header, trailer, or other appropriate indicator related to each data set that is configured to convey information useful in managing the various data sets. For example, the annotation may be called a “condition header”, “header”, “trailer”, or “status”, herein, and may comprise an indication of the status of the data set or may include an identifier correlated to a specific issuer or owner of the data. In one example, the first three bytes of each data set BLOB may be configured or configurable to indicate the status of that particular data set; e.g., LOADED, INITIALIZED, READY, BLOCKED, REMOVABLE, or DELETED. Subsequent bytes of data may be used to indicate for example, the identity of the issuer, user, transaction/membership account identifier or the like. Each of these condition annotations are further discussed herein.
The data set annotation may also be used for other types of status information as well as various other purposes. For example, the data set annotation may include security information establishing access levels. The access levels may, for example, be configured to permit only certain individuals, levels of employees, companies, or other entities to access data sets, or to permit access to specific data sets based on the transaction, merchant, issuer, user or the like. Furthermore, the security information may restrict/permit only certain actions such as accessing, modifying, and/or deleting data sets. In one example, the data set annotation indicates that only the data set owner or the user are permitted to delete a data set, various identified users may be permitted to access the data set for reading, and others are altogether excluded from accessing the data set. However, other access restriction parameters may also be used allowing various entities to access a data set with various permission levels as appropriate.
The data, including the header or trailer may be received by a standalone interaction device configured to add, delete, modify, or augment the data in accordance with the header or trailer. As such, in one embodiment, the header or trailer is not stored on the transaction device along with the associated issuer-owned data but instead the appropriate action may be taken by providing to the transaction instrument user at the stand alone device, the appropriate option for the action to be taken. The system may contemplate a data storage arrangement wherein the header or trailer, or header or trailer history, of the data is stored on the transaction instrument in relation to the appropriate data.
One skilled in the art will also appreciate that, for security reasons, any databases, systems, devices, servers or other components of the system may consist of any combination thereof at a single location or at multiple locations, wherein each database or system includes any of various suitable security features, such as firewalls, access codes, encryption, decryption, compression, decompression, and/or the like.
Encryption may be performed by way of any of the techniques now available in the art or which may become available—e.g., Twofish, RSA, El Gamal, Schorr signature, DSA, PGP, PKI, GPG (GnuPG), and symmetric and asymmetric cryptosystems.
The computing unit of the web client may be further equipped with an Internet browser connected to the Internet or an intranet using standard dial-up, cable, DSL or any other Internet protocol known in the art. Transactions originating at a web client may pass through a firewall in order to prevent unauthorized access from users of other networks. Further, additional firewalls may be deployed between the varying components of CMS to further enhance security.
Firewall may include any hardware and/or software suitably configured to protect CMS components and/or enterprise computing resources from users of other networks. Further, a firewall may be configured to limit or restrict access to various systems and components behind the firewall for web clients connecting through a web server. Firewall may reside in varying configurations including Stateful Inspection, Proxy based, access control lists, and Packet Filtering among others. Firewall may be integrated within a web server or any other CMS components or may further reside as a separate entity. A firewall may implement network address translation (“NAT”) and/or network address port translation (“NAPT”). A firewall may accommodate various tunneling protocols to facilitate secure communications, such as those used in virtual private networking. A firewall may implement a demilitarized zone (“DMZ”) to facilitate communications with a public network such as the Internet. A firewall may be integrated as software within an Internet server, any other application server components or may reside within another computing device or may take the form of a standalone hardware component.
The computers discussed herein may provide a suitable website or other Internet-based graphical user interface which is accessible by users. In one embodiment, the Microsoft Internet Information Server (IIS), Microsoft Transaction Server (MTS), and Microsoft SQL Server, are used in conjunction with the Microsoft operating system, Microsoft NT web server software, a Microsoft SQL Server database system, and a Microsoft Commerce Server. Additionally, components such as Access or Microsoft SQL Server, Oracle, Sybase, Informix MySQL, Interbase, etc., may be used to provide an Active Data Object (ADO) compliant database management system. In one embodiment, the Apache web server is used in conjunction with a Linux operating system, a MySQL database, and the Perl, PHP, and/or Python programming languages.
Any of the communications, inputs, storage, databases or displays discussed herein may be facilitated through a website having web pages. The term “web page” as it is used herein is not meant to limit the type of documents and applications that might be used to interact with the user. For example, a typical website might include, in addition to standard HTML documents, various forms, Java applets, JavaScript, active server pages (ASP), common gateway interface scripts (CGI), extensible markup language (XML), dynamic HTML, cascading style sheets (CSS), AJAX (Asynchronous Javascript And XML), helper applications, plug-ins, and the like. A server may include a web service that receives a request from a web server, the request including a URL (http://yahoo.com/stockquotes/ge) and an IP address (123.56.789.234). The web server retrieves the appropriate web pages and sends the data or applications for the web pages to the IP address. Web services are applications that are capable of interacting with other applications over a communications means, such as the internet. Web services are typically based on standards or protocols such as XML, SOAP, AJAX, WSDL and UDDI. Web services methods are well known in the art, and are covered in many standard texts. See, e.g., ALEX NGHIEM, IT WEB SERVICES: A ROADMAP FOR THE ENTERPRISE (3003), hereby incorporated by reference.
Middleware may include any hardware and/or software suitably configured to facilitate communications and/or process transactions between disparate computing systems. Middleware components are commercially available and known in the art. Middleware may be implemented through commercially available hardware and/or software, through custom hardware and/or software components, or through a combination thereof. Middleware may reside in a variety of configurations and may exist as a standalone system or may be a software component residing on the Internet server. Middleware may be configured to process transactions between the various components of an application server and any number of internal or external systems for any of the purposes disclosed herein. WebSphere MQTM (formerly MQSeries) by IBM, Inc. (Armonk, N.Y.) is an example of a commercially available middleware product. An Enterprise Service Bus (“ESB”) application is another example of middleware.
Practitioners will also appreciate that there are a number of methods for displaying data within a browser-based document. Data may be represented as standard text or within a fixed list, scrollable list, drop-down list, editable text field, fixed text field, pop-up window, and the like. Likewise, there are a number of methods available for modifying data in a web page such as, for example, free text entry using a keyboard, selection of menu items, check boxes, option boxes, and the like.
The system and method may be described herein in terms of functional block components, screen shots, optional selections and various processing steps. It should be appreciated that such functional blocks may be realized by any number of hardware and/or software components configured to perform the specified functions. For example, the system may employ various integrated circuit components, e.g., memory elements, processing elements, logic elements, look-up tables, and the like, which may carry out a variety of functions under the control of one or more microprocessors or other control devices. Similarly, the software elements of the system may be implemented with any programming or scripting language such as C, C++, C #, Java, JavaScript, VBScript, Macromedia Cold Fusion, COBOL, Microsoft Active Server Pages, assembly, PERL, PHP, awk, Python, Visual Basic, SQL Stored Procedures, PL/SQL, any UNIX shell script, and extensible markup language (XML) with the various algorithms being implemented with any combination of data structures, objects, processes, routines or other programming elements. Further, it should be noted that the system may employ any number of conventional techniques for data transmission, signaling, data processing, network control, and the like. Still further, the system could be used to detect or prevent security issues with a client-side scripting language, such as JavaScript, VBScript or the like. For a basic introduction of cryptography and network security, see any of the following references: (1) “Applied Cryptography: Protocols, Algorithms, And Source Code In C,” by Bruce Schneier, published by John Wiley & Sons (second edition, 1995); (2) “Java Cryptography” by Jonathan Knudson, published by O'Reilly & Associates (1998); (3) “Cryptography & Network Security: Principles & Practice” by William Stallings, published by Prentice Hall; all of which are hereby incorporated by reference.
As used herein, the term “end user”, “consumer”, “customer”, “cardmember”, “business” or “merchant” may be used interchangeably with each other, and each shall mean any person, entity, government organization, business, machine, hardware, and/or software. A bank may be part of the system, but the bank may represent other types of card issuing institutions, such as credit card companies, card sponsoring companies, or third party issuers under contract with financial institutions. It is further noted that other participants may be involved in some phases of the transaction, such as an intermediary settlement institution, but these participants are not shown.
Each participant is equipped with a computing device in order to interact with the system and facilitate online commerce transactions. The customer has a computing unit in the form of a personal computer, although other types of computing units may be used including laptops, notebooks, hand held computers, set-top boxes, cellular telephones, touch-tone telephones and the like. The merchant has a computing unit implemented in the form of a computer-server, although other implementations are contemplated by the system. The bank has a computing center shown as a main frame computer. However, the bank computing center may be implemented in other forms, such as a mini-computer, a PC server, a network of computers located in the same of different geographic locations, or the like. Moreover, the system contemplates the use, sale or distribution of any goods, services or information over any network having similar functionality described herein
The merchant computer and the bank computer may be interconnected via a second network, referred to as a payment network. The payment network which may be part of certain transactions represents existing proprietary networks that presently accommodate transactions for credit cards, debit cards, and other types of financial/banking cards. The payment network is a closed network that is assumed to be secure from eavesdroppers. Exemplary transaction networks may include the American Express®, VisaNet® and the Veriphone® networks.
The electronic commerce system may be implemented at the customer and issuing bank. In an exemplary implementation, the electronic commerce system is implemented as computer software modules loaded onto the customer computer and the banking computing center. The merchant computer does not require any additional software to participate in the online commerce transactions supported by the online commerce system.
As will be appreciated by one of ordinary skill in the art, the system may be embodied as a customization of an existing system, an add-on product, a processing apparatus executing upgraded software, a stand alone system, a distributed system, a method, a data processing system, a device for data processing, and/or a computer program product. Accordingly, any portion of the system or a module may take the form of a processing apparatus executing code, an internet based embodiment, an entirely hardware embodiment, or an embodiment combining aspects of the internet, software and hardware. Furthermore, the system may take the form of a computer program product on a computer-readable storage medium having computer-readable program code means embodied in the storage medium. Any suitable computer-readable storage medium may be utilized, including hard disks, CD-ROM, optical storage devices, magnetic storage devices, and/or the like.
The system and method is described herein with reference to screen shots, block diagrams and flowchart illustrations of methods, apparatus (e.g., systems), and computer program products according to various embodiments. It will be understood that each functional block of the block diagrams and the flowchart illustrations, and combinations of functional blocks in the block diagrams and flowchart illustrations, respectively, can be implemented by computer program instructions.
These computer program instructions may be loaded onto a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions that execute on the computer or other programmable data processing apparatus create means for implementing the functions specified in the flowchart block or blocks. These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart block or blocks. The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks.
Accordingly, functional blocks of the block diagrams and flowchart illustrations support combinations of means for performing the specified functions, combinations of steps for performing the specified functions, and program instruction means for performing the specified functions. It will also be understood that each functional block of the block diagrams and flowchart illustrations, and combinations of functional blocks in the block diagrams and flowchart illustrations, can be implemented by either special purpose hardware-based computer systems which perform the specified functions or steps, or suitable combinations of special purpose hardware and computer instructions. Further, illustrations of the process flows and the descriptions thereof may make reference to user windows, webpages, websites, web forms, prompts, etc. Practitioners will appreciate that the illustrated steps described herein may comprise in any number of configurations including the use of windows, webpages, web forms, popup windows, prompts and the like. It should be further appreciated that the multiple steps as illustrated and described may be combined into single webpages and/or windows but have been expanded for the sake of simplicity. In other cases, steps illustrated and described as single process steps may be separated into multiple webpages and/or windows but have been combined for simplicity.
The term “non-transitory” is to be understood to remove only propagating transitory signals per se from the claim scope and does not relinquish rights to all standard computer-readable media that are not only propagating transitory signals per se. Stated another way, the meaning of the term “non-transitory computer-readable medium” and “non-transitory computer-readable storage medium” should be construed to exclude only those types of transitory computer-readable media which were found in In Re Nuijten to fall outside the scope of patentable subject matter under 35 U.S.C. § 101.
Phrases and terms similar to an “entity” may include any individual, consumer, customer, group, business, organization, government entity, transaction account issuer or processor (e.g., credit, charge, etc.), merchant, consortium of merchants, account holder, charitable organization, software, hardware, and/or any other type of entity. The terms “user,” “consumer,” “purchaser,” and/or the plural form of these terms are used interchangeably throughout herein to refer to those persons or entities that are alleged to be authorized to use a transaction account.
Phrases and terms similar to “account”, “account number”, “account code” or “consumer account” as used herein, may include any device, code (e.g., one or more of an authorization/access code, personal identification number (“PIN”), Internet code, other identification code, and/or the like), number, letter, symbol, digital certificate, smart chip, digital signal, analog signal, biometric or other identifier/indicia suitably configured to allow the consumer to access, interact with or communicate with the system. The account number may optionally be located on or associated with a rewards account, charge account, credit account, debit account, prepaid account, telephone card, embossed card, smart card, magnetic stripe card, bar code card, transponder, radio frequency card or an associated account.
The system may include or interface with any of the foregoing accounts, devices, and/or a transponder and reader (e.g. RFID reader) in RF communication with the transponder (which may include a fob), or communications between an initiator and a target enabled by near field communications (NFC). Typical devices may include, for example, a key ring, tag, card, cell phone, wristwatch or any such form capable of being presented for interrogation. Moreover, the system, computing unit or device discussed herein may include a “pervasive computing device,” which may include a traditionally non-computerized device that is embedded with a computing unit. Examples may include watches, Internet enabled kitchen appliances, restaurant tables embedded with RF readers, wallets or purses with imbedded transponders, etc. Furthermore, a device or financial transaction instrument may have electronic and communications functionality enabled, for example, by: a network of electronic circuitry that is printed or otherwise incorporated onto or within the transaction instrument (and typically referred to as a “smart card”); a fob having a transponder and an RFID reader; and/or near field communication (NFC) technologies. For more information regarding NFC, refer to the following specifications all of which are incorporated by reference herein: ISO/IEC 18092/ECMA-340, Near Field Communication Interface and Protocol-1 (NFCIP-1); ISO/IEC 21481/ECMA-352, Near Field Communication Interface and Protocol-2 (NFCIP-2); and EMV 4.2 available at http://www.emvo.com/default.aspx.
The account number may be distributed and stored in any form of plastic, electronic, magnetic, radio frequency, wireless, audio and/or optical device capable of transmitting or downloading data from itself to a second device. A consumer account number may be, for example, a sixteen-digit account number, although each credit provider has its own numbering system, such as the fifteen-digit numbering system used by American Express. Each company's account numbers comply with that company's standardized format such that the company using a fifteen-digit format will generally use three-spaced sets of numbers, as represented by the number “0000 000000 00000”. The first five to seven digits are reserved for processing purposes and identify the issuing bank, account type, etc. In this example, the last (fifteenth) digit is used as a sum check for the fifteen digit number. The intermediary eight-to-eleven digits are used to uniquely identify the consumer. A merchant account number may be, for example, any number or alpha-numeric characters that identify a particular merchant for purposes of account acceptance, account reconciliation, reporting, or the like.
In various embodiments, an account number may identify a consumer. In addition, in various embodiments, a consumer may be identified by a variety of identifiers, including, for example, an email address, a telephone number, a cookie id, a radio frequency identifier (RFID), a biometric, and the like.
Phrases and terms similar to “financial institution” or “transaction account issuer” may include any entity that offers transaction account services. Although often referred to as a “financial institution,” the financial institution may represent any type of bank, lender or other type of account issuing institution, such as credit card companies, card sponsoring companies, or third party issuers under contract with financial institutions. It is further noted that other participants may be involved in some phases of the transaction, such as an intermediary settlement institution.
The terms “payment vehicle,” “financial transaction instrument,” “transaction instrument” and/or the plural form of these terms may be used interchangeably throughout to refer to a financial instrument.
Phrases and terms similar to “merchant,” “supplier” or “seller” may include any entity that receives payment or other consideration. For example, a supplier may request payment for goods sold to a buyer who holds an account with a transaction account issuer.
Phrases and terms similar to a “buyer” may include any entity that receives goods or services in exchange for consideration (e.g. financial payment). For example, a buyer may purchase, lease, rent, barter or otherwise obtain goods from a supplier and pay the supplier using a transaction account.
Phrases and terms similar to “internal data” may include any data a credit issuer possesses or acquires pertaining to a particular consumer. Internal data may be gathered before, during, or after a relationship between the credit issuer and the transaction account holder (e.g., the consumer or buyer). Such data may include consumer demographic data. Consumer demographic data includes any data pertaining to a consumer. Consumer demographic data may include consumer name, address, telephone number, email address, employer and social security number. Consumer transactional data is any data pertaining to the particular transactions in which a consumer engages during any given time period. Consumer transactional data may include, for example, transaction amount, transaction time, transaction vendor/merchant, and transaction vendor/merchant location. Transaction vendor/merchant location may contain a high degree of specificity to a vendor/merchant. For example, transaction vendor/merchant location may include a particular gasoline filing station in a particular postal code located at a particular cross section or address. Also, for example, transaction vendor/merchant location may include a particular web address, such as a Uniform Resource Locator (“URL”), an email address and/or an Internet Protocol (“IP”) address for a vendor/merchant. Transaction vendor/merchant, and transaction vendor/merchant location may be associated with a particular consumer and further associated with sets of consumers. Consumer payment data includes any data pertaining to a consumer's history of paying debt obligations. Consumer payment data may include consumer payment dates, payment amounts, balance amount, and credit limit. Internal data may further comprise records of consumer service calls, complaints, requests for credit line increases, questions, and comments. A record of a consumer service call includes, for example, date of call, reason for call, and any transcript or summary of the actual call.
Phrases similar to a “payment processor” may include a company (e.g., a third party) appointed (e.g., by a merchant) to handle transactions. A payment processor may include an issuer, acquirer, authorizer and/or any other system or entity involved in the transaction process. Payment processors may be broken down into two types: front-end and back-end. Front-end payment processors have connections to various transaction accounts and supply authorization and settlement services to the merchant banks' merchants. Back-end payment processors accept settlements from front-end payment processors and, via The Federal Reserve Bank, move money from an issuing bank to the merchant bank. In an operation that will usually take a few seconds, the payment processor will both check the details received by forwarding the details to the respective account's issuing bank or card association for verification, and may carry out a series of anti-fraud measures against the transaction. Additional parameters, including the account's country of issue and its previous payment history, may be used to gauge the probability of the transaction being approved. In response to the payment processor receiving confirmation that the transaction account details have been verified, the information may be relayed back to the merchant, who will then complete the payment transaction. In response to the verification being denied, the payment processor relays the information to the merchant, who may then decline the transaction. Phrases similar to a “payment gateway” or “gateway” may include an application service provider service that authorizes payments for e-businesses, online retailers, and/or traditional brick and mortar merchants. The gateway may be the equivalent of a physical point of sale terminal located in most retail outlets. A payment gateway may protect transaction account details by encrypting sensitive information, such as transaction account numbers, to ensure that information passes securely between the customer and the merchant and also between merchant and payment processor.
Benefits, other advantages, and solutions to problems have been described herein with regard to specific embodiments. However, the benefits, advantages, solutions to problems, and any elements that may cause any benefit, advantage, or solution to occur or become more pronounced are not to be construed as critical, required, or essential features or elements of the disclosure. The scope of the disclosure is accordingly to be limited by nothing other than the appended claims, in which reference to an element in the singular is not intended to mean “one and only one” unless explicitly so stated, but rather “one or more.” Moreover, where a phrase similar to ‘at least one of A, B, and C’ or ‘at least one of A, B, or C’ is used in the claims or specification, it is intended that the phrase be interpreted to mean that A alone may be present in an embodiment, B alone may be present in an embodiment, C alone may be present in an embodiment, or that any combination of the elements A, B and C may be present in a single embodiment; for example, A and B, A and C, B and C, or A and B and C. Although the disclosure includes a method, it is contemplated that it may be embodied as computer program instructions on a tangible computer-readable carrier, such as a magnetic or optical memory or a magnetic or optical disk. All structural, chemical, and functional equivalents to the elements of the above-described exemplary embodiments that are known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be encompassed by the present claims. Moreover, it is not necessary for a device or method to address each and every problem sought to be solved by the present disclosure, for it to be encompassed by the present claims. Furthermore, no element, component, or method step in the present disclosure is intended to be dedicated to the public regardless of whether the element, component, or method step is explicitly recited in the claims. No claim element herein is to be construed under the provisions of 35 U.S.C. 112, sixth paragraph, unless the element is expressly recited using the phrase “means for.” As used herein, the terms “comprises”, “comprising”, or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4833308 | Humble | May 1989 | A |
| 4882675 | Nichtberger et al. | Nov 1989 | A |
| 5467269 | Flaten | Nov 1995 | A |
| 5471669 | Lidman | Nov 1995 | A |
| 5729693 | Holda-Fleck | Mar 1998 | A |
| 5918211 | Sloane | Jun 1999 | A |
| 5923016 | Fredregill et al. | Jul 1999 | A |
| 5948040 | Delorme et al. | Sep 1999 | A |
| 5953706 | Patel | Sep 1999 | A |
| 6009411 | Kepecs | Dec 1999 | A |
| 6018718 | Walker et al. | Jan 2000 | A |
| 6035280 | Christensen | Mar 2000 | A |
| 6039244 | Finsterwald | Mar 2000 | A |
| 6222914 | Mcmullin | Apr 2001 | B1 |
| 6266649 | Linden et al. | Jul 2001 | B1 |
| 6298330 | Gardenswartz et al. | Oct 2001 | B1 |
| 6321208 | Barnett et al. | Nov 2001 | B1 |
| 6330543 | Kepecs | Dec 2001 | B1 |
| 6332126 | Peirce et al. | Dec 2001 | B1 |
| 6336099 | Barnett et al. | Jan 2002 | B1 |
| 6343317 | Glorikian | Jan 2002 | B1 |
| 6360167 | Millington et al. | Mar 2002 | B1 |
| 6370514 | Messner | Apr 2002 | B1 |
| 6381603 | Chan et al. | Apr 2002 | B1 |
| 6414635 | Stewart et al. | Jul 2002 | B1 |
| 6430539 | Lazarus et al. | Aug 2002 | B1 |
| 6434534 | Walker et al. | Aug 2002 | B1 |
| 6542814 | Polidi et al. | Apr 2003 | B2 |
| 6584448 | Laor | Jun 2003 | B1 |
| 6587835 | Treyz et al. | Jul 2003 | B1 |
| 6606619 | Ortega et al. | Aug 2003 | B2 |
| 6691915 | Thaxton et al. | Feb 2004 | B1 |
| 6738711 | Ohmura et al. | May 2004 | B2 |
| 6748365 | Quinlan et al. | Jun 2004 | B1 |
| 6847935 | Solomon et al. | Jan 2005 | B1 |
| 6865544 | Austin | Mar 2005 | B1 |
| 6882290 | French et al. | Apr 2005 | B2 |
| 6883708 | Fiedler et al. | Apr 2005 | B1 |
| 6904408 | Mccarthy et al. | Jun 2005 | B1 |
| 6915265 | Johnson | Jul 2005 | B1 |
| 6937995 | Kepecs | Aug 2005 | B1 |
| 7003476 | Samra et al. | Feb 2006 | B1 |
| 7010497 | Nyhan et al. | Mar 2006 | B1 |
| 7016856 | Wiggins | Mar 2006 | B1 |
| 7016860 | Modani et al. | Mar 2006 | B2 |
| 7054830 | Eggleston et al. | May 2006 | B1 |
| 7072851 | Wilcox et al. | Jul 2006 | B1 |
| 7107238 | Hatakama et al. | Sep 2006 | B2 |
| 7120591 | Solomon et al. | Oct 2006 | B1 |
| 7139793 | Lala et al. | Nov 2006 | B2 |
| 7146328 | Solomon et al. | Dec 2006 | B1 |
| 7165037 | Lazarus et al. | Jan 2007 | B2 |
| 7302429 | Wanker | Nov 2007 | B1 |
| 7392224 | Bauer et al. | Jun 2008 | B1 |
| 7406436 | Reisman | Jul 2008 | B1 |
| 7428505 | Levy et al. | Sep 2008 | B1 |
| 7430521 | Walker et al. | Sep 2008 | B2 |
| 7455226 | Hammond et al. | Nov 2008 | B1 |
| 7472073 | Masi | Dec 2008 | B1 |
| 7493268 | Kepros et al. | Feb 2009 | B2 |
| 7496520 | Handel et al. | Feb 2009 | B1 |
| 7499889 | Golan et al. | Mar 2009 | B2 |
| 7506805 | Chakravarthy | Mar 2009 | B1 |
| 7512551 | Postrel | Mar 2009 | B2 |
| 7596566 | Patwardhan | Sep 2009 | B1 |
| 7599858 | Grady et al. | Oct 2009 | B1 |
| 7618318 | Ciancio et al. | Nov 2009 | B2 |
| 7630935 | Loeger et al. | Dec 2009 | B2 |
| 7636689 | Dent et al. | Dec 2009 | B2 |
| 7647278 | Foth et al. | Jan 2010 | B1 |
| 7653572 | Thompson | Jan 2010 | B1 |
| 7660743 | Messa et al. | Feb 2010 | B1 |
| 7665660 | Degliantoni et al. | Feb 2010 | B2 |
| 7668749 | Kepros et al. | Feb 2010 | B2 |
| 7676467 | Kozyrczak et al. | Mar 2010 | B1 |
| 7681786 | Chakravarthy | Mar 2010 | B1 |
| 7702540 | Woolston | Apr 2010 | B1 |
| 7706808 | Aggarwal et al. | Apr 2010 | B1 |
| 7711586 | Aggarwal et al. | May 2010 | B2 |
| 7734486 | Mortimore, Jr. | Jun 2010 | B2 |
| 7739134 | Mortimore, Jr. | Jun 2010 | B2 |
| 7742954 | Handel et al. | Jun 2010 | B1 |
| 7743002 | Hernandez | Jun 2010 | B2 |
| 7747524 | Brown | Jun 2010 | B2 |
| 7751805 | Neven et al. | Jul 2010 | B2 |
| 7752328 | Mortimore, Jr. et al. | Jul 2010 | B2 |
| 7765119 | Messa | Jul 2010 | B2 |
| 7788141 | Sim | Aug 2010 | B1 |
| 7797199 | Forshaw et al. | Sep 2010 | B2 |
| 7801760 | Handel et al. | Sep 2010 | B2 |
| 7806328 | Chakravarthy | Oct 2010 | B2 |
| 7814029 | Siegel | Oct 2010 | B1 |
| 7844488 | Merriman et al. | Nov 2010 | B2 |
| 7844490 | Patterson | Nov 2010 | B2 |
| 7865513 | Welch et al. | Jan 2011 | B2 |
| 7870022 | Bous et al. | Jan 2011 | B2 |
| 7885862 | Vincent et al. | Feb 2011 | B1 |
| 7899704 | Thompson | Mar 2011 | B1 |
| 7925540 | Orttung et al. | Apr 2011 | B1 |
| 7933810 | Morgenstern | Apr 2011 | B2 |
| 7937330 | Handel et al. | May 2011 | B2 |
| 7941374 | Orttung et al. | May 2011 | B2 |
| 7958017 | Rempe et al. | Jun 2011 | B1 |
| 7962381 | Handel et al. | Jun 2011 | B2 |
| 7966213 | Messa et al. | Jun 2011 | B2 |
| 7970666 | Handel | Jun 2011 | B1 |
| 7991664 | Stone | Aug 2011 | B1 |
| 8070056 | Feldman et al. | Dec 2011 | B2 |
| 8073719 | Orttung et al. | Dec 2011 | B2 |
| 8078496 | Postrel | Dec 2011 | B2 |
| 8082270 | Goyal | Dec 2011 | B2 |
| 8090707 | Orttung et al. | Jan 2012 | B1 |
| 8095402 | Orttung et al. | Jan 2012 | B2 |
| 8108304 | Loeger et al. | Jan 2012 | B2 |
| 8117073 | Orttung et al. | Feb 2012 | B1 |
| 8121953 | Orttung et al. | Feb 2012 | B1 |
| 8126771 | Walker et al. | Feb 2012 | B2 |
| 8126776 | Messa et al. | Feb 2012 | B2 |
| 8131588 | Walker et al. | Mar 2012 | B2 |
| 8140387 | Heywood | Mar 2012 | B2 |
| 8145522 | Warren et al. | Mar 2012 | B2 |
| 8160922 | Postrel | Apr 2012 | B2 |
| 8170916 | Dicker et al. | May 2012 | B1 |
| 8175926 | Handel et al. | May 2012 | B1 |
| 8180682 | Narayanaswami et al. | May 2012 | B2 |
| 8180796 | Mah et al. | May 2012 | B1 |
| 8213423 | Breau et al. | Jul 2012 | B1 |
| 8249934 | Agarwal et al. | Aug 2012 | B2 |
| 8438061 | Grimes | May 2013 | B2 |
| 8459551 | Lee et al. | Jun 2013 | B2 |
| 8463643 | Bennett et al. | Jun 2013 | B2 |
| 8463706 | Cervenka et al. | Jun 2013 | B2 |
| 8463851 | Bennett et al. | Jun 2013 | B2 |
| 8468053 | Bennett et al. | Jun 2013 | B2 |
| 8473334 | Gibbs et al. | Jun 2013 | B2 |
| 8484088 | Orttung et al. | Jul 2013 | B1 |
| 8484093 | Bennett et al. | Jul 2013 | B2 |
| 8489452 | Warner et al. | Jul 2013 | B1 |
| 8489456 | Burgess et al. | Jul 2013 | B2 |
| 8494901 | Magadi et al. | Jul 2013 | B2 |
| 8494914 | Mesaros | Jul 2013 | B2 |
| 8504411 | Subasic et al. | Aug 2013 | B1 |
| 8504423 | Rotbard et al. | Aug 2013 | B2 |
| 8515810 | Grimes | Aug 2013 | B2 |
| 8517258 | Taylor et al. | Aug 2013 | B2 |
| 8543470 | Grady et al. | Sep 2013 | B2 |
| 8554670 | Blank et al. | Oct 2013 | B1 |
| 8560389 | Burgess et al. | Oct 2013 | B2 |
| 8573477 | Bennett et al. | Nov 2013 | B2 |
| 8573491 | Bennett et al. | Nov 2013 | B2 |
| 8606630 | Fordyce, III et al. | Dec 2013 | B2 |
| 8615426 | Carlson | Dec 2013 | B2 |
| 8621215 | Iyer | Dec 2013 | B1 |
| 8626579 | Fordyce, III et al. | Jan 2014 | B2 |
| 8639567 | Winters | Jan 2014 | B2 |
| 8650071 | Pointer et al. | Feb 2014 | B2 |
| 8655695 | Qu et al. | Feb 2014 | B1 |
| 8725635 | Klein et al. | May 2014 | B2 |
| 8874674 | Allison et al. | Oct 2014 | B2 |
| 9009082 | Marshall et al. | Apr 2015 | B1 |
| 9031866 | Ng et al. | May 2015 | B1 |
| 9430773 | Aloni et al. | Aug 2016 | B2 |
| 20010003725 | Wolff et al. | Jun 2001 | A1 |
| 20010014868 | Herz et al. | Aug 2001 | A1 |
| 20010054003 | Chien et al. | Dec 2001 | A1 |
| 20020008292 | Hu et al. | Jan 2002 | A1 |
| 20020052841 | Guthrie et al. | May 2002 | A1 |
| 20020069079 | Vega | Jun 2002 | A1 |
| 20020069312 | Jones | Jun 2002 | A1 |
| 20020095357 | Hunter et al. | Jul 2002 | A1 |
| 20020099824 | Bender et al. | Jul 2002 | A1 |
| 20020138343 | Weatherford et al. | Sep 2002 | A1 |
| 20020178056 | Lim | Nov 2002 | A1 |
| 20020194069 | Thakur et al. | Dec 2002 | A1 |
| 20030027630 | Kelly et al. | Feb 2003 | A1 |
| 20030028426 | Banerjee et al. | Feb 2003 | A1 |
| 20030028518 | Mankoff | Feb 2003 | A1 |
| 20030033211 | Haines et al. | Feb 2003 | A1 |
| 20030061093 | Todd | Mar 2003 | A1 |
| 20030078832 | Alvarez et al. | Apr 2003 | A1 |
| 20030208442 | Cockrill et al. | Nov 2003 | A1 |
| 20030233278 | Marshall | Dec 2003 | A1 |
| 20040039686 | Klebanoff | Feb 2004 | A1 |
| 20040098326 | James et al. | May 2004 | A1 |
| 20040098332 | Dvir | May 2004 | A1 |
| 20040122736 | Strock et al. | Jun 2004 | A1 |
| 20040015338 | Lortscher, Jr. | Aug 2004 | A1 |
| 20040215517 | Chen et al. | Oct 2004 | A1 |
| 20040225509 | Andre | Nov 2004 | A1 |
| 20040225573 | Ling | Nov 2004 | A1 |
| 20040243468 | Cohagan et al. | Dec 2004 | A1 |
| 20050010394 | Bergeron et al. | Jan 2005 | A1 |
| 20050010428 | Bergeron et al. | Jan 2005 | A1 |
| 20050010472 | Quatse et al. | Jan 2005 | A1 |
| 20050021401 | Postrel | Jan 2005 | A1 |
| 20050033583 | Bergeron et al. | Feb 2005 | A1 |
| 20050033605 | Bergeron et al. | Feb 2005 | A1 |
| 20050065848 | Mitchell et al. | Mar 2005 | A1 |
| 20050071225 | Bortolin et al. | Mar 2005 | A1 |
| 20050071227 | Hammad et al. | Mar 2005 | A1 |
| 20050071228 | Bortolin et al. | Mar 2005 | A1 |
| 20050071230 | Mankoff | Mar 2005 | A1 |
| 20050075932 | Mankoff | Apr 2005 | A1 |
| 20050096976 | Nelms | May 2005 | A1 |
| 20050149394 | Postrel | Jul 2005 | A1 |
| 20050159996 | Lazarus et al. | Jul 2005 | A1 |
| 20050165684 | Jensen et al. | Jul 2005 | A1 |
| 20050192863 | Mohan | Sep 2005 | A1 |
| 20050234753 | Pinto et al. | Oct 2005 | A1 |
| 20050240477 | Friday et al. | Oct 2005 | A1 |
| 20050246272 | Kitada et al. | Nov 2005 | A1 |
| 20050273388 | Roetter | Dec 2005 | A1 |
| 20060008524 | Chen et al. | Jan 2006 | A1 |
| 20060026067 | Nicholas et al. | Feb 2006 | A1 |
| 20060041480 | Briggs | Feb 2006 | A1 |
| 20060064372 | Gupta | Mar 2006 | A1 |
| 20060074749 | Kline et al. | Apr 2006 | A1 |
| 20060076400 | Fletcher | Apr 2006 | A1 |
| 20060095434 | Mccullough et al. | May 2006 | A1 |
| 20060111930 | Ayer et al. | May 2006 | A1 |
| 20060116800 | Obradovich et al. | Jun 2006 | A1 |
| 20060122874 | Postrel | Jun 2006 | A1 |
| 20060129426 | Pearson | Jun 2006 | A1 |
| 20060136299 | Ruhmkorf | Jun 2006 | A1 |
| 20060155641 | Postrel | Jul 2006 | A1 |
| 20060167753 | Teague et al. | Jul 2006 | A1 |
| 20060173672 | Bergeron et al. | Aug 2006 | A1 |
| 20060178932 | Lang | Aug 2006 | A1 |
| 20060195359 | Robinson et al. | Aug 2006 | A1 |
| 20060212355 | Teague | Sep 2006 | A1 |
| 20060224449 | Byerley et al. | Oct 2006 | A1 |
| 20060241859 | Kimchi et al. | Oct 2006 | A1 |
| 20060242011 | Bell et al. | Oct 2006 | A1 |
| 20060258397 | Kaplan et al. | Nov 2006 | A1 |
| 20060259364 | Strock et al. | Nov 2006 | A1 |
| 20060271552 | Mcchesney et al. | Nov 2006 | A1 |
| 20060293957 | Petersen et al. | Dec 2006 | A1 |
| 20070000997 | Lambert et al. | Jan 2007 | A1 |
| 20070010942 | Bill | Jan 2007 | A1 |
| 20070022019 | Sherwin et al. | Jan 2007 | A1 |
| 20070033104 | Collins et al. | Feb 2007 | A1 |
| 20070038515 | Postrel | Feb 2007 | A1 |
| 20070038516 | Apple et al. | Feb 2007 | A1 |
| 20070050258 | Dohse | Mar 2007 | A1 |
| 20070061216 | Jain et al. | Mar 2007 | A1 |
| 20070061223 | Rodriguez et al. | Mar 2007 | A1 |
| 20070073599 | Perry et al. | Mar 2007 | A1 |
| 20070083428 | Goldstein | Apr 2007 | A1 |
| 20070094114 | Bufford et al. | Apr 2007 | A1 |
| 20070129995 | Brandow | Jun 2007 | A1 |
| 20070130000 | Assanassios | Jun 2007 | A1 |
| 20070136135 | Loeger et al. | Jun 2007 | A1 |
| 20070146812 | Lawton | Jun 2007 | A1 |
| 20070150349 | Handel et al. | Jun 2007 | A1 |
| 20070157237 | Cordray et al. | Jul 2007 | A1 |
| 20070192178 | Fung et al. | Aug 2007 | A1 |
| 20070192192 | Haberman et al. | Aug 2007 | A1 |
| 20070198354 | Senghore et al. | Aug 2007 | A1 |
| 20070198432 | Pitroda et al. | Aug 2007 | A1 |
| 20070198937 | Paris | Aug 2007 | A1 |
| 20070208879 | Liu | Sep 2007 | A1 |
| 20070210152 | Read | Sep 2007 | A1 |
| 20070214040 | Patel et al. | Sep 2007 | A1 |
| 20070233517 | Dayal | Oct 2007 | A1 |
| 20070244741 | Blume et al. | Oct 2007 | A1 |
| 20070244811 | Tumminaro | Oct 2007 | A1 |
| 20070260513 | Pavlov | Nov 2007 | A1 |
| 20070260523 | Schadt et al. | Nov 2007 | A1 |
| 20070288312 | Wang | Dec 2007 | A1 |
| 20070288372 | Behar et al. | Dec 2007 | A1 |
| 20080003272 | Rapp et al. | Jan 2008 | A1 |
| 20080004917 | Mortimore | Jan 2008 | A1 |
| 20080004919 | Stubbs | Jan 2008 | A1 |
| 20080004980 | Hernandez | Jan 2008 | A1 |
| 20080005148 | Welch et al. | Jan 2008 | A1 |
| 20080021772 | Aloni et al. | Jan 2008 | A1 |
| 20080033857 | Moses | Feb 2008 | A1 |
| 20080040211 | Walker et al. | Feb 2008 | A1 |
| 20080040288 | Mortimore et al. | Feb 2008 | A1 |
| 20080052140 | Neal et al. | Feb 2008 | A1 |
| 20080052151 | Xie et al. | Feb 2008 | A1 |
| 20080059220 | Roth et al. | Mar 2008 | A1 |
| 20080065491 | Bakman | Mar 2008 | A1 |
| 20080077498 | Ariff | Mar 2008 | A1 |
| 20080082418 | Fordyce, III et al. | Apr 2008 | A1 |
| 20080091445 | Mihic | Apr 2008 | A1 |
| 20080091528 | Rampell et al. | Apr 2008 | A1 |
| 20080091549 | Chang et al. | Apr 2008 | A1 |
| 20080091828 | Mortimore | Apr 2008 | A1 |
| 20080109317 | Singh | May 2008 | A1 |
| 20080109489 | Sherwood | May 2008 | A1 |
| 20080116260 | Shafer | May 2008 | A1 |
| 20080120129 | Seubert et al. | May 2008 | A1 |
| 20080120155 | Pliha | May 2008 | A1 |
| 20080133488 | Bandaru et al. | Jun 2008 | A1 |
| 20080147450 | Mortimore | Jun 2008 | A1 |
| 20080147514 | Shuster et al. | Jun 2008 | A1 |
| 20080147773 | Aaron | Jun 2008 | A1 |
| 20080154664 | Kuo et al. | Jun 2008 | A1 |
| 20080162206 | Mak et al. | Jul 2008 | A1 |
| 20080167991 | Carlson et al. | Jul 2008 | A1 |
| 20080189169 | Turpin et al. | Aug 2008 | A1 |
| 20080195475 | Lambert et al. | Aug 2008 | A1 |
| 20080195609 | Paris | Aug 2008 | A1 |
| 20080196060 | Varghese | Aug 2008 | A1 |
| 20080201197 | Orttung et al. | Aug 2008 | A1 |
| 20080201224 | Owens et al. | Aug 2008 | A1 |
| 20080201432 | Orttung et al. | Aug 2008 | A1 |
| 20080210753 | Plozay et al. | Sep 2008 | A1 |
| 20080228580 | Korman | Sep 2008 | A1 |
| 20080255940 | Perreault et al. | Oct 2008 | A1 |
| 20080262925 | Kim et al. | Oct 2008 | A1 |
| 20080263135 | Olliphant | Oct 2008 | A1 |
| 20080270223 | Collins et al. | Oct 2008 | A1 |
| 20080270251 | Coelho et al. | Oct 2008 | A1 |
| 20080276270 | Kotaru et al. | Nov 2008 | A1 |
| 20080281699 | Whitehead | Nov 2008 | A1 |
| 20080281710 | Hoal | Nov 2008 | A1 |
| 20080294624 | Kanigsberg et al. | Nov 2008 | A1 |
| 20080300894 | John | Dec 2008 | A1 |
| 20080300979 | Abhyanker | Dec 2008 | A1 |
| 20080306769 | Roberts et al. | Dec 2008 | A1 |
| 20080313078 | Payne et al. | Dec 2008 | A1 |
| 20090006142 | Orttung et al. | Jan 2009 | A1 |
| 20090006143 | Orttung et al. | Jan 2009 | A1 |
| 20090006188 | Guo et al. | Jan 2009 | A1 |
| 20090006194 | Sridharan et al. | Jan 2009 | A1 |
| 20090012839 | Fusillo et al. | Jan 2009 | A1 |
| 20090015027 | Lambarth et al. | Jan 2009 | A1 |
| 20090016322 | Bell | Jan 2009 | A1 |
| 20090018916 | Seven et al. | Jan 2009 | A1 |
| 20090026523 | Wong et al. | Jan 2009 | A1 |
| 20090030609 | Orttung et al. | Jan 2009 | A1 |
| 20090030742 | Orttung et al. | Jan 2009 | A1 |
| 20090030769 | Orttung et al. | Jan 2009 | A1 |
| 20090030779 | Tollinger et al. | Jan 2009 | A1 |
| 20090032717 | Aykac et al. | Feb 2009 | A1 |
| 20090037264 | Del Favero et al. | Feb 2009 | A1 |
| 20090055292 | Choon et al. | Feb 2009 | A1 |
| 20090063268 | Burgess et al. | Mar 2009 | A1 |
| 20090063351 | Schmeyer et al. | Mar 2009 | A1 |
| 20090076912 | Rajan et al. | Mar 2009 | A1 |
| 20090094048 | Wallace et al. | Apr 2009 | A1 |
| 20090125719 | Cochran et al. | May 2009 | A1 |
| 20090132347 | Anderson et al. | May 2009 | A1 |
| 20090140799 | Kasperkovitz | Jun 2009 | A1 |
| 20090156310 | Fargo | Jun 2009 | A1 |
| 20090164314 | Blythe | Jun 2009 | A1 |
| 20090171842 | Blythe | Jul 2009 | A1 |
| 20090171853 | Georgiou et al. | Jul 2009 | A1 |
| 20090182718 | Waclawik et al. | Jul 2009 | A1 |
| 20090210261 | Mortimore, Jr. | Aug 2009 | A1 |
| 20090228365 | Tomchek et al. | Sep 2009 | A1 |
| 20090247282 | Cheng | Oct 2009 | A1 |
| 20090248457 | Munter et al. | Oct 2009 | A1 |
| 20090248543 | Nihalani et al. | Oct 2009 | A1 |
| 20090259499 | Bhojwani et al. | Oct 2009 | A1 |
| 20090271263 | Regmi et al. | Oct 2009 | A1 |
| 20090276306 | Hicks | Nov 2009 | A1 |
| 20090287562 | Bosch et al. | Nov 2009 | A1 |
| 20090288012 | Hertel et al. | Nov 2009 | A1 |
| 20090288140 | Huber et al. | Nov 2009 | A1 |
| 20090289111 | Motycka et al. | Nov 2009 | A1 |
| 20090313109 | Bous et al. | Dec 2009 | A1 |
| 20090319353 | Palmeri | Dec 2009 | A1 |
| 20090327062 | Botes | Dec 2009 | A1 |
| 20090327129 | Collas et al. | Dec 2009 | A1 |
| 20100002722 | Porat et al. | Jan 2010 | A1 |
| 20100010656 | Yotsukura et al. | Jan 2010 | A1 |
| 20100010657 | Do et al. | Jan 2010 | A1 |
| 20100011466 | da Costa e Silva et al. | Jan 2010 | A1 |
| 20100014574 | Homma et al. | Jan 2010 | A1 |
| 20100014576 | Komamura | Jan 2010 | A1 |
| 20100017987 | Lyons | Jan 2010 | A1 |
| 20100019157 | Furlan et al. | Jan 2010 | A1 |
| 20100021141 | Yamashita et al. | Jan 2010 | A1 |
| 20100057565 | Au-Yeung et al. | Mar 2010 | A1 |
| 20100076777 | Paretti et al. | Mar 2010 | A1 |
| 20100079336 | Skibiski et al. | Apr 2010 | A1 |
| 20100082418 | Loeger et al. | Apr 2010 | A1 |
| 20100082446 | Hjelm et al. | Apr 2010 | A1 |
| 20100088149 | Sullivan et al. | Apr 2010 | A1 |
| 20100088174 | Cohagan et al. | Apr 2010 | A1 |
| 20100094697 | Cavanaugh | Apr 2010 | A1 |
| 20100094698 | Cawley | Apr 2010 | A1 |
| 20100094699 | Beal | Apr 2010 | A1 |
| 20100106568 | Grimes | Apr 2010 | A1 |
| 20100106596 | Grimes | Apr 2010 | A1 |
| 20100114686 | Carlson et al. | May 2010 | A1 |
| 20100131342 | Thibedeau et al. | May 2010 | A1 |
| 20100131840 | Walker et al. | May 2010 | A1 |
| 20100138299 | Preston et al. | Jun 2010 | A1 |
| 20100145778 | Fordyce, III et al. | Jun 2010 | A1 |
| 20100145786 | Fordyce, III | Jun 2010 | A1 |
| 20100145798 | Richards | Jun 2010 | A1 |
| 20100145860 | Pelegero | Jun 2010 | A1 |
| 20100153194 | Oram | Jun 2010 | A1 |
| 20100203963 | Allen et al. | Aug 2010 | A1 |
| 20100228613 | Anderson et al. | Sep 2010 | A1 |
| 20100241502 | Walker et al. | Sep 2010 | A1 |
| 20100241559 | O'Connor et al. | Sep 2010 | A1 |
| 20100250351 | Gillenson et al. | Sep 2010 | A1 |
| 20100250356 | Gillenson et al. | Sep 2010 | A1 |
| 20100257047 | Foodman et al. | Oct 2010 | A1 |
| 20100312629 | Wolf et al. | Dec 2010 | A1 |
| 20100325048 | Carlson et al. | Dec 2010 | A1 |
| 20100332307 | Parento | Dec 2010 | A1 |
| 20110000449 | Mortimore, Jr. et al. | Jan 2011 | A1 |
| 20110002936 | Ferlin et al. | Jan 2011 | A1 |
| 20110004546 | Thomas | Jan 2011 | A1 |
| 20110016115 | Craswell et al. | Jan 2011 | A1 |
| 20110019115 | Jun et al. | Jan 2011 | A1 |
| 20110022448 | Strock et al. | Jan 2011 | A1 |
| 20110022455 | Wolf et al. | Jan 2011 | A1 |
| 20110022503 | Parker-Yules | Jan 2011 | A1 |
| 20110029364 | Roeding et al. | Feb 2011 | A1 |
| 20110029367 | Olson | Feb 2011 | A1 |
| 20110035266 | Patterson | Feb 2011 | A1 |
| 20110040539 | Szymczyk et al. | Feb 2011 | A1 |
| 20110047023 | Lieblang et al. | Feb 2011 | A1 |
| 20110055880 | Archer | Mar 2011 | A1 |
| 20110066483 | Salmon et al. | Mar 2011 | A1 |
| 20110066548 | Rodin | Mar 2011 | A1 |
| 20110078030 | Borst et al. | Mar 2011 | A1 |
| 20110083101 | Sharon et al. | Apr 2011 | A1 |
| 20110087530 | Fordyce, III et al. | Apr 2011 | A1 |
| 20110087531 | Winters et al. | Apr 2011 | A1 |
| 20110093327 | Fordyce, III et al. | Apr 2011 | A1 |
| 20110093335 | Fordyce, III et al. | Apr 2011 | A1 |
| 20110093361 | Morales | Apr 2011 | A1 |
| 20110106607 | Alfonso et al. | May 2011 | A1 |
| 20110119133 | Igelman et al. | May 2011 | A1 |
| 20110125561 | Marcus | May 2011 | A1 |
| 20110125565 | Macilwaine et al. | May 2011 | A1 |
| 20110131077 | Tan | Jun 2011 | A1 |
| 20110137716 | Reuthe et al. | Jun 2011 | A1 |
| 20110137717 | Reuthe et al. | Jun 2011 | A1 |
| 20110137721 | Bansal | Jun 2011 | A1 |
| 20110145047 | Chetty et al. | Jun 2011 | A1 |
| 20110145149 | Valdes et al. | Jun 2011 | A1 |
| 20110161149 | Kaplan | Jun 2011 | A1 |
| 20110161172 | Lee | Jun 2011 | A1 |
| 20110167440 | Greenfield | Jul 2011 | A1 |
| 20110178845 | Rane et al. | Jul 2011 | A1 |
| 20110178928 | Carmichael et al. | Jul 2011 | A1 |
| 20110184792 | Butcher et al. | Jul 2011 | A1 |
| 20110213670 | Strutton et al. | Sep 2011 | A1 |
| 20110231224 | Winters | Sep 2011 | A1 |
| 20110231235 | Macllwaine et al. | Sep 2011 | A1 |
| 20110231246 | Bhatia et al. | Sep 2011 | A1 |
| 20110238469 | Gershman et al. | Sep 2011 | A1 |
| 20110246219 | Smith et al. | Oct 2011 | A1 |
| 20110246272 | Joa | Oct 2011 | A1 |
| 20110246279 | Joa | Oct 2011 | A1 |
| 20110246280 | Satyavolu et al. | Oct 2011 | A1 |
| 20110246281 | Satyavolu et al. | Oct 2011 | A1 |
| 20110246287 | Wright et al. | Oct 2011 | A1 |
| 20110246299 | Satyavolu et al. | Oct 2011 | A1 |
| 20110251883 | Satyavolu et al. | Oct 2011 | A1 |
| 20110251891 | Satyavolu et al. | Oct 2011 | A1 |
| 20110251934 | Satyavolu et al. | Oct 2011 | A1 |
| 20110258011 | Burns et al. | Oct 2011 | A1 |
| 20110258027 | Lee | Oct 2011 | A1 |
| 20110264490 | Durvasula et al. | Oct 2011 | A1 |
| 20110270617 | Anto et al. | Nov 2011 | A1 |
| 20110270666 | Welsh et al. | Nov 2011 | A1 |
| 20110276373 | Juszczak et al. | Nov 2011 | A1 |
| 20110276377 | Kim et al. | Nov 2011 | A1 |
| 20110282702 | Mortimore, Jr. | Nov 2011 | A1 |
| 20110288918 | Cervenka et al. | Nov 2011 | A1 |
| 20110295749 | Scalisi | Dec 2011 | A1 |
| 20110302011 | Yoder et al. | Dec 2011 | A1 |
| 20110307509 | Hsiao et al. | Dec 2011 | A1 |
| 20110313840 | Mason et al. | Dec 2011 | A1 |
| 20110313874 | Hardie et al. | Dec 2011 | A1 |
| 20110320250 | Gemmell et al. | Dec 2011 | A1 |
| 20120000496 | Satyavolu et al. | Jan 2012 | A1 |
| 20120004964 | Satyavolu et al. | Jan 2012 | A1 |
| 20120004965 | Satyavolu et al. | Jan 2012 | A1 |
| 20120004966 | Satyavolu et al. | Jan 2012 | A1 |
| 20120004969 | Satyavolu et al. | Jan 2012 | A1 |
| 20120004970 | Satyavolu et al. | Jan 2012 | A1 |
| 20120004975 | Satyavolu et al. | Jan 2012 | A1 |
| 20120010932 | Satyavolu et al. | Jan 2012 | A1 |
| 20120010933 | Satyavolu et al. | Jan 2012 | A1 |
| 20120010934 | Walker et al. | Jan 2012 | A1 |
| 20120010936 | Satyavolu et al. | Jan 2012 | A1 |
| 20120010937 | Hanson et al. | Jan 2012 | A1 |
| 20120022923 | Walker et al. | Jan 2012 | A1 |
| 20120023122 | Gregov et al. | Jan 2012 | A1 |
| 20120029990 | Fisher | Feb 2012 | A1 |
| 20120029996 | Lang et al. | Feb 2012 | A1 |
| 20120030048 | Manley et al. | Feb 2012 | A1 |
| 20120035997 | Burgess et al. | Feb 2012 | A1 |
| 20120036079 | Jacob Sushil et al. | Feb 2012 | A1 |
| 20120046958 | Pynadath et al. | Feb 2012 | A1 |
| 20120047008 | Alhadeff et al. | Feb 2012 | A1 |
| 20120053987 | Satyavolu et al. | Mar 2012 | A1 |
| 20120059701 | Van Der Veen et al. | Mar 2012 | A1 |
| 20120066037 | Glen | Mar 2012 | A1 |
| 20120066046 | Satyavolu et al. | Mar 2012 | A1 |
| 20120066050 | Satyavolu | Mar 2012 | A1 |
| 20120066051 | Black et al. | Mar 2012 | A1 |
| 20120066062 | Yoder et al. | Mar 2012 | A1 |
| 20120072270 | Waylonis et al. | Mar 2012 | A1 |
| 20120078689 | Rothschild | Mar 2012 | A1 |
| 20120101881 | Theresa et al. | Apr 2012 | A1 |
| 20120109751 | Binenstock et al. | May 2012 | A1 |
| 20120130737 | Finizio et al. | May 2012 | A1 |
| 20120150641 | Dobbs et al. | Jun 2012 | A1 |
| 20120150740 | Isaacson et al. | Jun 2012 | A1 |
| 20120196568 | Bakshi | Aug 2012 | A1 |
| 20120197707 | Cohagan et al. | Aug 2012 | A1 |
| 20120197887 | Anderson | Aug 2012 | A1 |
| 20120203604 | Baker et al. | Aug 2012 | A1 |
| 20120203846 | Hull et al. | Aug 2012 | A1 |
| 20120209672 | Winner et al. | Aug 2012 | A1 |
| 20120209695 | Winner et al. | Aug 2012 | A1 |
| 20120209696 | Winner et al. | Aug 2012 | A1 |
| 20120209771 | Winner et al. | Aug 2012 | A1 |
| 20120220308 | Ledlie | Aug 2012 | A1 |
| 20120221400 | Tietzen | Aug 2012 | A1 |
| 20120221437 | Yoo | Aug 2012 | A1 |
| 20120221479 | Schneck, III et al. | Aug 2012 | A1 |
| 20120226530 | Gebb et al. | Sep 2012 | A1 |
| 20120239417 | Pourfallah et al. | Sep 2012 | A1 |
| 20120239479 | Amaro et al. | Sep 2012 | A1 |
| 20120246004 | Book et al. | Sep 2012 | A1 |
| 20120253852 | Pourfallah et al. | Oct 2012 | A1 |
| 20120253957 | Bakshi | Oct 2012 | A1 |
| 20120271691 | Hammad et al. | Oct 2012 | A1 |
| 20120278127 | Kirakosyan et al. | Nov 2012 | A1 |
| 20120296724 | Faro et al. | Nov 2012 | A1 |
| 20120303425 | Katzin et al. | Nov 2012 | A1 |
| 20120303430 | Tiku et al. | Nov 2012 | A1 |
| 20130006737 | Goldberg | Jan 2013 | A1 |
| 20130006766 | Dedeoglu et al. | Jan 2013 | A1 |
| 20130013396 | Vinson et al. | Jan 2013 | A1 |
| 20130024256 | Wolf et al. | Jan 2013 | A1 |
| 20130024274 | Villars | Jan 2013 | A1 |
| 20130040654 | Parish | Feb 2013 | A1 |
| 20130041902 | Swann et al. | Feb 2013 | A1 |
| 20130060623 | Walker et al. | Mar 2013 | A1 |
| 20130060644 | Le Ouay et al. | Mar 2013 | A1 |
| 20130073336 | Heath | Mar 2013 | A1 |
| 20130073361 | Silver | Mar 2013 | A1 |
| 20130073366 | Heath | Mar 2013 | A1 |
| 20130073371 | Bosworth et al. | Mar 2013 | A1 |
| 20130073374 | Heath | Mar 2013 | A1 |
| 20130073376 | Heath | Mar 2013 | A1 |
| 20130073377 | Heath | Mar 2013 | A1 |
| 20130073387 | Heath | Mar 2013 | A1 |
| 20130073388 | Heath | Mar 2013 | A1 |
| 20130073389 | Heath | Mar 2013 | A1 |
| 20130073400 | Heath | Mar 2013 | A1 |
| 20130073473 | Heath | Mar 2013 | A1 |
| 20130073568 | Federov et al. | Mar 2013 | A1 |
| 20130080239 | Okerlund | Mar 2013 | A1 |
| 20130080259 | Durvasula et al. | Mar 2013 | A1 |
| 20130091000 | Hagey et al. | Apr 2013 | A1 |
| 20130103472 | Burgess et al. | Apr 2013 | A1 |
| 20130110555 | Dunham et al. | May 2013 | A1 |
| 20130110604 | Rooke et al. | May 2013 | A1 |
| 20130124283 | Kaulbach et al. | May 2013 | A1 |
| 20130132175 | Claessen et al. | May 2013 | A1 |
| 20130132183 | Klein et al. | May 2013 | A1 |
| 20130145016 | Vantalon et al. | Jun 2013 | A1 |
| 20130151602 | Mcclelland et al. | Jun 2013 | A1 |
| 20130019119 | Mark et al. | Jul 2013 | A1 |
| 20130173320 | Bank et al. | Jul 2013 | A1 |
| 20130173478 | Farhi | Jul 2013 | A1 |
| 20130179246 | Ross | Jul 2013 | A1 |
| 20130212177 | Friedman | Aug 2013 | A1 |
| 20130218653 | Rooke et al. | Aug 2013 | A1 |
| 20130238412 | Boncyk et al. | Sep 2013 | A1 |
| 20130246146 | Fischer et al. | Sep 2013 | A1 |
| 20130246185 | Hardman et al. | Sep 2013 | A1 |
| 20130260727 | Knudson et al. | Oct 2013 | A1 |
| 20130262209 | Boyer et al. | Oct 2013 | A1 |
| 20130262214 | Baird | Oct 2013 | A1 |
| 20130268333 | Ovick et al. | Oct 2013 | A1 |
| 20130275192 | Aissa | Oct 2013 | A1 |
| 20130304563 | Haupt et al. | Nov 2013 | A1 |
| 20130325946 | Allison et al. | Dec 2013 | A1 |
| 20130346170 | Epstein et al. | Dec 2013 | A1 |
| 20140006129 | Heath | Jan 2014 | A1 |
| 20140006132 | Barker | Jan 2014 | A1 |
| 20140025451 | Knowles et al. | Jan 2014 | A1 |
| 20140025452 | Knowles et al. | Jan 2014 | A1 |
| 20140025453 | Knowles et al. | Jan 2014 | A1 |
| 20140025460 | Knowles et al. | Jan 2014 | A1 |
| 20140046675 | Harwood et al. | Feb 2014 | A1 |
| 20140046744 | Hagey | Feb 2014 | A1 |
| 20140046748 | Nagarajan et al. | Feb 2014 | A1 |
| 20140046794 | Vallery et al. | Feb 2014 | A1 |
| 20140108108 | Artman et al. | Apr 2014 | A1 |
| 20140108521 | Marquess et al. | Apr 2014 | A1 |
| 20140149200 | Chatterjee | May 2014 | A1 |
| 20140164199 | Wilkes | Jun 2014 | A1 |
| 20140258032 | Psota et al. | Sep 2014 | A1 |
| 20150039393 | Jain | Feb 2015 | A1 |
| 20150073980 | Griffin et al. | Mar 2015 | A1 |
| 20150170256 | Pettyjohn et al. | Jun 2015 | A1 |
| 20150248702 | Chatterton | Sep 2015 | A1 |
| 20160086212 | Tietzen | Mar 2016 | A1 |
| 20160253737 | Chang | Sep 2016 | A1 |
| 20200193470 | Chatterjee | Jun 2020 | A1 |
| Entry |
|---|
| Managing Databases with Binary Large Objects, Shapiro et al., 105 1-9 173199 1999 IEEE. |
| Todorova, Aleksandra, “The Best Rewards Programs,” www.smartmoney.com, Sep. 2005, pp. 1-2. |
| Quora, What is a token in programming? Available at https://www.quora.com/What-is-a-token-in-programming. |
| Number | Date | Country | |
|---|---|---|---|
| 20200193470 A1 | Jun 2020 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 13686608 | Nov 2012 | US |
| Child | 16706066 | US |
