This application for letters patent disclosure document describes inventive aspects that include various novel innovations (hereinafter “disclosure”) and contains material that is subject to copyright, mask work, and/or other intellectual property protection. The respective owners of such intellectual property have no objection to the facsimile reproduction of the disclosure by anyone as it appears in published Patent Office file/records, but otherwise reserve all rights.
The present innovations generally address apparatuses, methods and systems for consumer data management and analytics, and more particularly, include MULTI-SOURCE, MULTI-DIMENSIONAL, CROSS-ENTITY, MULTIMEDIA MERCHANT ANALYTICS DATABASE PLATFORM APPARATUSES, METHODS AND SYSTEMS (“MDB”).
However, in order to develop a reader's understanding of the innovations, disclosures have been compiled into a single description to illustrate and clarify how aspects of these innovations operate independently, interoperate as between individual innovations, and/or cooperate collectively. The application goes on to further describe the interrelations and synergies as between the various innovations; all of which is to further compliance with 35 U.S.C. § 112.
Many people share information through online social media streams using various communication devices or applications. Moreover, consumers may access online stores using the Internet on a computer or mobile device to make purchases from various service providers or merchants.
The accompanying appendices and/or drawings illustrate various non-limiting, example, innovative aspects in accordance with the present descriptions:
The leading number of each reference number within the drawings indicates the figure in which that reference number is introduced and/or detailed. As such, a detailed discussion of reference number 101 would be found and/or introduced in
The MULTI-SOURCE, MULTI-DIMENSIONAL, CROSS-ENTITY, MULTIMEDIA MERCHANT ANALYTICS DATABASE PLATFORM APPARATUSES, METHODS AND SYSTEMS (hereinafter “MDB”) transform data aggregated from various computer resources, via MDB components, into updated entity profiles, social graphs and/or investment recommendations. The MDB components, in various embodiments, implement advantageous features as set forth below.
For all of the input types (e.g., consumer transactions 111b, social network interactions 111d (e.g., emails, reviews, text posts, photos, audio/video/multimedia, conversations, chats, etc.), financial institution activity 111a (e.g., acquirers, authorizations, denials, issuers, fraud detection, etc.), merchant activities 111b (e.g., offers, coupons, redemptions, etc.), and/or the like, the mesh server 105 may aggregate and store such inputs in consolidated database 104b.
The mesh server aggregation may be achieved by obtaining a feed of financial transactions (e.g., if the mesh server is also a pay network server), by obtaining complete feed access (e.g., firehose feeds), from social networks (e.g., Facebook, Twitter, etc.), using publically available data API's (e.g., Google search API), and/or the like.
In one embodiment, the feeds may be obtained via high-bandwidth network connections. An example of the high-bandwidth network connections may include multiple optical fiber connections to an Internet backplane such as the multinational Equinix Exchange, New York International Internet eXchange (e.g., “NYIIX”), and/or the like.
The obtained feeds may be stored in fast storage array servers for processing or access by other processing servers. Examples of the fast storage array servers may include server blades such as those manufactured by Dell Computer (e.g., Dell model M820, M620, and/or the like), having multiple RAID fast SSD drives of type SAS with memory cache of type L1, L2, L3, and/or the like. In another embodiment, the feeds may be stored in a public cloud storage service (e.g., Amazon S3, and/or the like) or private cloud (e.g., OpenStack Storage object and/or OpenStack Storage block storage running on servers such as those described above).
In one embodiment, the fast storage servers may employ a distributed file system that provides high-throughput access to stored data. Example file systems suitable for this purpose may include the Hadoop Distributed File System (e.g., “HDFS”), Google BigTable, and/or the like. The file system may be implemented substantially as a key/value store or, in other embodiments, as a structured file system containing directories and files. In some embodiments, a hybrid key/value structured file system may be used in order to utilize the capabilities of both a key/value store and a structured file system. In one embodiment, the fast storage array servers may be connected to one or mesh servers (e.g., 105) for feed processing.
In one embodiment, the mesh servers (e.g., 105) may be server blades such as those described above. In another embodiment, the servers may be virtualized and running on a private virtualization platform such as VMWare ESXi, Xen, OpenStack Compute and/or the like. In still other embodiments, the servers may be virtualized using a publically available cloud service such as Amazon EC2 (e.g., via an Amazon Machine Image/“AMI”, and/or the like) or Rackspace (e.g., by providing a machine image such as a VDI or OVA file suitable for creating a virtualized machine).
The mesh server may generate dictionary short code words for every type of input and associate with that short word with the input (e.g., a MD5 hash, etc. may generate a short word for every type of input, where the resulting short code is unique to each input). This short code to actual data input association, when aggregated, may form the basis of a mesh dictionary. An example of mesh dictionary entry substantially in the following form of XML is:
Segmented portions, complete dictionaries, and/or updates thereto, may thus be sent en masse to mesh analytics clone servers; for example, such update may be done at off-network peak hours set to occur at dynamically and/or at set intervals. This allows the analytics servers to perform analytics operations, and it allows those analytics servers to operate on short codes even without the full underlying backend data being available. In so doing, dictionaries may be analyised using less space than the full underlying raw data would require. Additionally, dictionaries may be distributed between multiple servers. In one embodiment, the dictionaries are replicated across multiple servers and, periodically, synchronized. In one embodiment, any inconstancies in distributed and/or separated dictionaries may be reconciled using demarcation protocol and/or controlled inconsistency reconciliation for replicated data (see D. Barbara H. Garcia-Molina, The case for controlled inconsistency in replicated data,” Proc. of the Workshop on Management of Replicated Data, Houston, Tex., November 1990; D. Barbara H. Garcia-Molina, The demarcation protocol a technique for maintaining arithmetic constraints in distributed database systems, CS-TR-320-91, Princeton University, April 1991; the contents of both which are herein expressly incorporated by reference). In one embodiment, dictionaries may defer any analytic operations that require the backend data until when the caching of the dictionary is complete. It should be noted that throughout this disclosure, reference is made to “payment network server” or “pay network server.” It should be understood that such server may incorporate mesh servers, and it also contemplates that such mesh servers may include a network of mesh analytics clone servers, clustering node servers, clustering servers, and/or the like.
Features that entities may desire include application services 112 such as alerts 112a, offers 112c, money transfers 112n, fraud detection 112b, and/or the like. In some embodiments of the MDB, such originators may request data to enable application services from a common, secure, centralized information platform including a consolidated, cross-entity profile-graph database 101. For example, the originators may submit complex queries to the MDB in a structure format, such as the example below. In this example, the query includes a query to determine a location (e.g., of a user), determine the weather associated with the location, perform analyses on the weather data, and provide an exploded graphical view of the results of the analysis:
A non-limiting, example listing of data that the MDB may return based on a query is provided below. In this example, a user may log into a website via a computing device. The computing device may provide a IP address, and a timestamp to the MDB. In response, the MDB may identify a profile of the user from its database, and based on the profile, return potential merchants for offers or coupons:
In some embodiments, the MDB may provide access to information on a need-to-know basis to ensure the security of data of entities on which the MDB stores information. Thus, in some embodiments, access to information from the centralized platform may be restricted based on the originator as well as application services for which the data is requested. In some embodiments, the MDB may thus allow a variety of flexible application services to be built on a common database infrastructure, while preserving the integrity, security, and accuracy of entity data. In some implementations, the MDB may generate, update, maintain, store and/or provide profile information on entities, as well as a social graph that maintains and updates interrelationships between each of the entities stored within the MDB. For example, the MDB may store profile information on an issuer bank iota (see profile 103a), a acquirer bank 102b (see profile 103b), a consumer 102c (see profile 103c), a user 102d (see profile 103d), a merchant 102e (see profile 103e), a second merchant 102f (see profile 103f). The MDB may also store relationships between such entities. For example, the MDB may store information on a relationship of the issuer bank 102a to the consumer 102c shopping at merchant 102e, who in turn may be related to user 102d, who might bank at the back 102b that serves as acquirer for merchant 102f.
In alternate examples, the MDB may store data in a JavaScript Object Notation (“JSON”) format. The stored information may include data regarding the object, such as, but not limited to: commands, attributes, group information, payment information, account information, etc., such as in the example below:
In some embodiments, the MDB may acquire the aggregated data, and normalize the data into formats that are suitable for uniform storage, indexing, maintenance, and/or further processing via data record normalization component(s) 306 (e.g., such as described in
In some embodiments, the search engine servers may query, e.g., 417a-c, their search databases, e.g., 402a-c, for search results falling within the scope of the search keywords. In response to the search queries, the search databases may provide search results, e.g., 418a-c, to the search engine servers. The search engine servers may return the search results obtained from the search databases, e.g., 419a-c, to the pay network server making the search requests. An example listing of search results 419a-c, substantially in the form of JavaScript Object Notation (JSON)-formatted data, is provided below:
In some embodiments, the pay network server may store the aggregated search results, e.g., 420, in an aggregated search database, e.g., 410a.
In some implementations, the client may generate a purchase order message, e.g., 612, and provide, e.g., 613, the generated purchase order message to the merchant server. For example, a browser application executing on the client may provide, on behalf of the user, a (Secure) Hypertext Transfer Protocol (“HTTP(S)”) GET message including the product order details for the merchant server in the form of data formatted according to the eXtensible Markup Language (“XML”). Below is an example HTTP(S) GET message including an XML-formatted purchase order message for the merchant server:
In some implementations, the merchant server may obtain the purchase order message from the client, and may parse the purchase order message to extract details of the purchase order from the user. The merchant server may generate a card query request, e.g., 614 to determine whether the transaction can be processed. For example, the merchant server may attempt to determine whether the user has sufficient funds to pay for the purchase in a card account provided with the purchase order. The merchant server may provide the generated card query request, e.g., 615, to an acquirer server, e.g., 604. For example, the acquirer server may be a server of an acquirer financial institution (“acquirer”) maintaining an account of the merchant. For example, the proceeds of transactions processed by the merchant may be deposited into an account maintained by the acquirer. In some implementations, the card query request may include details such as, but not limited to: the costs to the user involved in the transaction, card account details of the user, user billing and/or shipping information, and/or the like. For example, the merchant server may provide a HTTP(S) POST message including an XML-formatted card query request similar to the example listing provided below:
In some implementations, the acquirer server may generate a card authorization request, e.g., 616, using the obtained card query request, and provide the card authorization request, e.g., 617, to a pay network server, e.g., 605. For example, the acquirer server may redirect the HTTP(S) POST message in the example above from the merchant server to the pay network server.
In some implementations, the pay network server may determine whether the user has enrolled in value-added user services. For example, the pay network server may query 618 a database, e.g., pay network database 407, for user service enrollment data. For example, the server may utilize PHP/SQL commands similar to the example provided above to query the pay network database. In some implementations, the database may provide the user service enrollment data, e.g., 619. The user enrollment data may include a flag indicating whether the user is enrolled or not, as well as instructions, data, login URL, login API call template and/or the like for facilitating access of the user-enrolled services. For example, in some implementations, the pay network server may redirect the client to a value-add server (e.g., such as a social network server where the value-add service is related to social networking) by providing a HTTP(S) REDIRECT 300 message, similar to the example below:
In some implementations, the pay network server may provide payment information extracted from the card authorization request to the value-add server as part of a value add service request, e.g., 620. For example, the pay network server may provide a HTTP(S) POST message to the value-add server, similar to the example below:
In some implementations, the value-add server may provide a service input request, e.g., 621, to the client. For example, the value-add server may provide a HTML input/login form to the client. The client may display, e.g., 622, the login form for the user. In some implementations, the user may provide login input into the client, e.g., 623, and the client may generate a service input response, e.g., 624, for the value-add server. In some implementations, the value-add server may provide value-add services according to user value-add service enrollment data, user profile, etc., stored on the value-add server, and based on the user service input. Based on the provision of value-add services, the value-add server may generate a value-add service response, e.g., 626, and provide the response to the pay network server. For example, the value-add server may provide a HTTP(S) POST message similar to the example below:
In some implementations, upon receiving the value-add service response from the value-add server, the pay network server may extract the enrollment service data from the response for addition to a transaction data record. In some implementations, the pay network server may forward the card authorization request to an appropriate pay network server, e.g., 628, which may parse the card authorization request to extract details of the request. Using the extracted fields and field values, the pay network server may generate a query, e.g., 629, for an issuer server corresponding to the user's card account. For example, the user's card account, the details of which the user may have provided via the client-generated purchase order message, may be linked to an issuer financial institution (“issuer”), such as a banking institution, which issued the card account for the user. An issuer server, e.g., 608a-n, of the issuer may maintain details of the user's card account. In some implementations, a database, e.g., pay network database 607, may store details of the issuer servers and card account numbers associated with the issuer servers. For example, the database may be a relational database responsive to Structured Query Language (“SQL”) commands. The pay network server may execute a hypertext preprocessor (“PHP”) script including SQL commands to query the database for details of the issuer server. An example PHP/SQL command listing, illustrating substantive aspects of querying the database, is provided below:
In response to obtaining the issuer server query, e.g., 629, the pay network database may provide, e.g., 630, the requested issuer server data to the pay network server. In some implementations, the pay network server may utilize the issuer server data to generate a forwarding card authorization request, e.g., 631, to redirect the card authorization request from the acquirer server to the issuer server. The pay network server may provide the card authorization request, e.g., 632, to the issuer server. In some implementations, the issuer server, e.g., 608, may parse the card authorization request, and based on the request details may query 633 a database, e.g., user profile database 609, for data of the user's card account. For example, the issuer server may issue PHP/SQL commands similar to the example provided below:
In some implementations, on obtaining the user data, e.g., 634, the issuer server may determine whether the user can pay for the transaction using funds available in the account, e.g., 635. For example, the issuer server may determine whether the user has a sufficient balance remaining in the account, sufficient credit associated with the account, and/or the like. If the issuer server determines that the user can pay for the transaction using the funds available in the account, the server may provide an authorization message, e.g., 636, to the pay network server. For example, the server may provide a HTTP(S) POST message similar to the examples above.
In some implementations, the pay network server may obtain the authorization message, and parse the message to extract authorization details. Upon determining that the user possesses sufficient funds for the transaction, the pay network server may generate a transaction data record from the card authorization request it received, and store, e.g., 639, the details of the transaction and authorization relating to the transaction in a database, e.g., pay network database 607. For example, the pay network server may issue PHP/SQL commands similar to the example listing below to store the transaction data in a database:
In some implementations, the pay network server may forward the authorization message, e.g., 640, to the acquirer server, which may in turn forward the authorization message, e.g., 640, to the merchant server. The merchant may obtain the authorization message, and determine from it that the user possesses sufficient funds in the card account to conduct the transaction. The merchant server may add a record of the transaction for the user to a batch of transaction data relating to authorized transactions. For example, the merchant may append the XML data pertaining to the user transaction to an XML data file comprising XML data for transactions that have been authorized for various users, e.g., 641, and store the XML data file, e.g., 642, in a database, e.g., merchant database 604. For example, a batch XML data file may be structured similar to the example XML data structure template provided below:
In some implementations, the server may also generate a purchase receipt, e.g., 643, and provide the purchase receipt to the client. The client may render and display, e.g., 644, the purchase receipt for the user. For example, the client may render a webpage, electronic message, text/SMS message, buffer a voicemail, emit a ring tone, and/or play an audio message, etc., and provide output including, but not limited to: sounds, music, audio, video, images, tactile feedback, vibration alerts (e.g., on vibration-capable client devices such as a smartphone etc.), and/or the like.
With reference to
In some implementations, the issuer server may generate a payment command, e.g., 658. For example, the issuer server may issue a command to deduct funds from the user's account (or add a charge to the user's credit card account). The issuer server may issue a payment command, e.g., 659, to a database storing the user's account information, e.g., user profile database 608. The issuer server may provide a funds transfer message, e.g., 660, to the pay network server, which may forward, e.g., 661, the funds transfer message to the acquirer server. An example HTTP(S) POST funds transfer message is provided below:
In some implementations, the acquirer server may parse the funds transfer message, and correlate the transaction (e.g., using the request_ID field in the example above) to the merchant. The acquirer server may then transfer the funds specified in the funds transfer message to an account of the merchant, e.g., 662.
In some implementations, the pay network server may determine whether the user has enrolled in value-added user services. For example, the pay network server may query a database, e.g., 707, for user service enrollment data. For example, the server may utilize PHP/SQL commands similar to the example provided above to query the pay network database. In some implementations, the database may provide the user service enrollment data, e.g., 708. The user enrollment data may include a flag indicating whether the user is enrolled or not, as well as instructions, data, login URL, login API call template and/or the like for facilitating access of the user-enrolled services. For example, in some implementations, the pay network server may redirect the client to a value-add server (e.g., such as a social network server where the value-add service is related to social networking) by providing a HTTP(S) REDIRECT 300 message. In some implementations, the pay network server may provide payment information extracted from the card authorization request to the value-add server as part of a value add service request, e.g., 710.
In some implementations, the value-add server may provide a service input request, e.g., 711, to the client. The client may display, e.g., 712, the input request for the user. In some implementations, the user may provide input into the client, e.g., 713, and the client may generate a service input response for the value-add server. In some implementations, the value-add server may provide value-add services according to user value-add service enrollment data, user profile, etc., stored on the value-add server, and based on the user service input. Based on the provision of value-add services, the value-add server may generate a value-add service response, e.g., 717, and provide the response to the pay network server. In some implementations, upon receiving the value-add service response from the value-add server, the pay network server may extract the enrollment service data from the response for addition to a transaction data record, e.g., 719-720.
With reference to
In some implementations, the pay network server may obtain the authorization message, and parse the message to extract authorization details. Upon determining that the user possesses sufficient funds for the transaction (e.g., 730, option “Yes”), the pay network server may extract the transaction card from the authorization message and/or card authorization request, e.g., 733, and generate a transaction data record using the card transaction details. The pay network server may provide the transaction data record for storage, e.g., 734, to a database. In some implementations, the pay network server may forward the authorization message, e.g., 735, to the acquirer server, which may in turn forward the authorization message, e.g., 736, to the merchant server. The merchant may obtain the authorization message, and parse the authorization message o extract its contents, e.g., 737. The merchant server may determine whether the user possesses sufficient funds in the card account to conduct the transaction. If the merchant server determines that the user possess sufficient funds, e.g., 738, option “Yes,” the merchant server may add the record of the transaction for the user to a batch of transaction data relating to authorized transactions, e.g., 739-740. The merchant server may also generate a purchase receipt, e.g., 741, for the user. If the merchant server determines that the user does not possess sufficient funds, e.g., 738, option “No,” the merchant server may generate an “authorization fail” message, e.g., 742. The merchant server may provide the purchase receipt or the “authorization fail” message to the client. The client may render and display, e.g., 743, the purchase receipt for the user.
In some implementations, the merchant server may initiate clearance of a batch of authorized transactions by generating a batch data request, e.g., 744, and providing the request to a database. In response to the batch data request, the database may provide the requested batch data, e.g., 745, to the merchant server. The server may generate a batch clearance request, e.g., 746, using the batch data obtained from the database, and provide the batch clearance request to an acquirer server. The acquirer server may generate, e.g., 748, a batch payment request using the obtained batch clearance request, and provide the batch payment request to a pay network server. The pay network server may parse, e.g., 749, the batch payment request, select a transaction stored within the batch data, e.g., 750, and extract the transaction data for the transaction stored in the batch payment request, e.g., 751. The pay network server may generate a transaction data record, e.g., 752, and store the transaction data, e.g., 753, the transaction in a database. For the extracted transaction, the pay network server may generate an issuer server query, e.g., 754, for an address of an issuer server maintaining the account of the user requesting the transaction. The pay network server may provide the query to a database. In response, the database may provide the issuer server data requested by the pay network server, e.g., 755. The pay network server may generate an individual payment request, e.g., 756, for the transaction for which it has extracted transaction data, and provide the individual payment request to the issuer server using the issuer server data from the database.
In some implementations, the issuer server may obtain the individual payment request, and parse, e.g., 757, the individual payment request to extract details of the request. Based on the extracted data, the issuer server may generate a payment command, e.g., 758. For example, the issuer server may issue a command to deduct funds from the user's account (or add a charge to the user's credit card account). The issuer server may issue a payment command, e.g., 759, to a database storing the user's account information. In response, the database may update a data record corresponding to the user's account to reflect the debit/charge made to the user's account. The issuer server may provide a funds transfer message, e.g., 760, to the pay network server after the payment command has been executed by the database.
In some implementations, the pay network server may check whether there are additional transactions in the batch that need to be cleared and funded. If there are additional transactions, e.g., 761, option “Yes,” the pay network server may process each transaction according to the procedure described above. The pay network server may generate, e.g., 762, an aggregated funds transfer message reflecting transfer of all transactions in the batch, and provide, e.g., 763, the funds transfer message to the acquirer server. The acquirer server may, in response, transfer the funds specified in the funds transfer message to an account of the merchant, e.g., 764.
In some embodiments, the social network servers may query, e.g., 1017a-c, their databases, e.g., 1002a-c, for social data results falling within the scope of the social keywords. In response to the queries, the databases may provide social data, e.g., 1018a-c, to the search engine servers. The social network servers may return the social data obtained from the databases, e.g., 1019a-c, to the pay network server making the social data requests. An example listing of social data 1019a-c, substantially in the form of JavaScript Object Notation (JSON)-formatted data, is provided below:
In some embodiments, the pay network server may store the aggregated search results, e.g., 1020, in an aggregated search database, e.g., 1010a.
In some implementations, using the user's input, the client may generate an enrollment request, e.g., 1212, and provide the enrollment request, e.g., 1213, to the pay network server. For example, the client may provide a (Secure) Hypertext Transfer Protocol (“HTTP(S)”) POST message including data formatted according to the eXtensible Markup Language (“XML”). Below is an example HTTP(S) POST message including an XML-formatted enrollment request for the pay network server:
In some implementations, the pay network server may obtain the enrollment request from the client, and extract the user's payment detail (e.g., XML data) from the enrollment request. For example, the pay network server may utilize a parser such as the example parsers described below in the discussion with reference to
In some implementations, the pay network server may redirect the client to a social network server by providing a HTTP(S) REDIRECT 300 message, similar to the example below:
In some implementations, the pay network server may provide payment information extracted from the card authorization request to the social network server as part of a social network authentication enrollment request, e.g., 1217. For example, the pay network server may provide a HTTP(S) POST message to the social network server, similar to the example below:
In some implementations, the social network server may provide a social network login request, e.g., 1218, to the client. For example, the social network server may provide a HTML input form to the client. The client may display, e.g., 1219, the login form for the user. In some implementations, the user may provide login input into the client, e.g., 1220, and the client may generate a social network login response, e.g., 1221, for the social network server. In some implementations, the social network server may authenticate the login credentials of the user, and access payment account information of the user stored within the social network, e.g., in a social network database. Upon authentication, the social network server may generate an authentication data record for the user, e.g., 1222, and provide an enrollment notification, e.g., 1224, to the pay network server. For example, the social network server may provide a HTTP(S) POST message similar to the example below:
Upon receiving notification of enrollment from the social network server, the pay network server may generate, e.g., 1225, a user enrollment data record, and store the enrollment data record in a pay network database, e.g., 1226, to complete enrollment. In some implementations, the enrollment data record may include the information from the enrollment notification 1224.
In other embodiments, the transaction data record template may contain integrated logic, regular expressions, executable meta-commands, language commands and/or the like in order to facilitate properly matching aggregated data with the location and format of the data in the template. In some embodiments, the template may contain logic in a non-template language, such as PHP commands being included in an XML file. As such, in one example, a language key may be used by the template (e.g., “php:<command>”, “java:<function>”, and/or the like). In so doing, the matching template may match a vast array of disparate data formats down into a normalized and standardized format. An example transaction data template record substantially in the form of XML is as follows:
In some implementations, the server may query a database for a normalized data record template, e.g., 1401. The server may parse the normalized data record template, e.g., 1402. In some embodiments, the parsing may parse the raw data record (such as using a parser as described herein and with respect to
With reference to
In some embodiments, the server may obtain the structured data, and perform a standardization routine using the structured data as input (e.g., including script commands, for illustration). For example, the server may remove extra line breaks, spaces, tab spaces, etc. from the structured data, e.g. 1431. The server may determine and load a metadata library, e.g., 1432, using which the server may parse subroutines or functions within the script, based on the metadata, e.g., 1433-1434. In some embodiments, the server may pre-parse conditional statements based on the metadata, e.g., 1435-1436. The server may also parse data 1437 to populate a data/command object based on the metadata and prior parsing, e.g., 1438. Upon finalizing the data/command object, the server may export 1439 the data/command object as XML in standardized encryptmatics format.
The server may select an unclassified data record for processing, e.g., 1603. The server may also select a classification rule for processing the unclassified data record, e.g., 1604. The server may parse the classification rule, and determine the inputs required for the rule, e.g., 1605. Based on parsing the classification rule, the server may parse the normalized data record template, e.g., 1606, and extract the values for the fields required to be provided as inputs to the classification rule. The server may parse the classification rule, and extract the operations to be performed on the inputs provided for the rule processing, e.g., 1607. Upon determining the operations to be performed, the server may perform the rule-specified operations on the inputs provided for the classification rule, e.g., 1608. In some implementations, the rule may provide threshold values. For example, the rule may specify that if the number of products in the transaction, total value of the transaction, average luxury rating of the products sold in the transaction, etc. may need to cross a threshold in order for the label(s) associated with the rule to be applied to the transaction data record. The server may parse the classification rule to extract any threshold values required for the rule to apply, e.g., 1609. The server may compare the computed values with the rule thresholds, e.g., 1610. If the rule threshold(s) is crossed, e.g., 1611, option “Yes,” the server may apply one or more labels to the transaction data record as specified by the classification rule, e.g., 1612. For example, the server may apply a classification rule to an individual product within the transaction, and/or to the transaction as a whole. In other embodiments, the rule may specify criteria that may be present in the mesh in order to generate a new entity (e.g., to create a deduced concept or deduced entity). For example, if a given set of mesh aggregated data contain references the a keyword iPhone, a rule may specify that “iPhone” is to be created as a deduced node within the mesh. This may be done in a recursive manner, such as when the creation of the meta-concept of an “iPhone” may subsequently be combined with created meta-concepts of “iMac” and “iPod” in order to create a master deduced concept of “Apple Computer”, which is thereafter associated with “iPhone,” “iMac,” and “iPod”. In so doing, the rules may allow the mesh, given the aggregated content available as well as inputs (such as category inputs) to automatically create meta-concepts based on rules that are themselves unaware of the concepts. In one embodiment, a rule for the creation of a meta-concept, substantially in the form of XML is:
In the example above, a new deduced entity may be added to the mesh if the number of other entites referencing a given keyword is greater than 50 but less than 500. In one embodiment, the criteria may be specified as a scalar value as shown above. In other embodiments, the criteria may reference a percentage size of the mesh references (such as greater than 5% but less than 10%). In so doing, entities may be added only when they reach a certain absolute threshold, or alternatively when they reach a threshold with respect to the mesh itself. In other embodiments, the criteria may be a function (such as a Python procedure) that may be performed in order to determine if a new meta-entity should be created. In such an embodiment, the rule may take advantage of any language features available (e.g., language method/functions) as well as external data sources (such as by querying Wikipedia for the presence of a page describing the candidate meta-concept, performing a Google Search and only creating the meta concept if greater than a given number of results are returned, and/or the like). In one embodiment, deduced entries may be created based on a specified or relative frequence of occurrence matches (e.g., keyword matches, transaction occurances, and/or the like) within a certain time quantum (e.g., 5 orders for an item within a day/week/month, 100 tweeks a minute about a topic, and/or the like). Deduced entities may become actual mesh entities (and actual mesh entities may be come deduced entities) through the application of similar rules. For example, if an entity is deduced but subsequently the data aggregation shows a sufficient social media discussion regarding a deduced concept, the concept may be changed from a deduced concept to a mesh concept. In so doing, the mesh can adapt to evolving entities that may initially exist only by virtue of their relationship to other nodes, but may ultimately become concepts that the mesh may assign to actual entities.
In some implementations, the server may process the transaction data record using each rule (see, e.g., 1613). Once all classification rules have been processed for the transaction record, e.g., 1613, option “No,” the server may store the transaction data record in a database, e.g., 1614. The server may perform such processing for each transaction data record until all transaction data records have been classified (see, e.g., 1615).
In some embodiments, the app may be configured to automatically detect, e.g., 2112, the presence of a product identifier within an image or video frame grabbed by the device (e.g., via a webcam, in-built camera, etc.). For example, the app may provide a “hands-free” mode of operation wherein the user may move the device to bring product identifiers within the field of view of the image/video capture mechanism of the device, and the app may perform image/video processing operations to automatically detect the product identifier within the field of view. In some embodiments, the app may overlay cross-hairs, target box, and/or like alignment reference markers, e.g., 2115, so that a user may align the product identifier using the reference markers to facilitate product identifier recognition and interpretation.
In some embodiments, the detection of a product identifier may trigger various operations to provide products, services, information, etc. for the user. For example, the app may be configured to detect and capture a QR code having embedded merchant and/or product information, and utilize the information extracted from the QR code to process a transaction for purchasing a product from a merchant. As other examples, the app may be configured to provide information on related products, quotes, pricing information, related offers, (other) merchants related to the product identifier, rewards/loyalty points associated with purchasing the product related to the product identifier, analytics on purchasing behavior, alerts on spend tracking, and/or the like.
In some embodiments, the app may include user interface elements to allow the user to manually search, e.g., 2113, for products (e.g., by name, brand, identifier, etc.). In some embodiments, the app may provide the user with the ability to view prior product identifier captures (see, e.g., 2117a) so that the user may be able to better decide which product identifier the user desires to capture. In some embodiments, the app may include interface elements to allow the user to switch back and forth between the product identification mode and product offer interface display screens (see, e.g., 2117b), so that a user may accurately study deals available to the user before capturing a product identifier. In some embodiments, the user may be provided with information about products, user settings, merchants, offers, etc. in list form (see, e.g., 2117c) so that the user may better understand the user's purchasing options. Various other features may be provided for in the app (see, e.g., 2117d). In some embodiments, the user may desire to cancel product purchasing; the app may provide the user with a user interface element (e.g., 2118) to cancel the product identifier recognition procedure and return to the prior interface screen the user was utilizing.
With reference to
In some embodiments, the user may select to conduct the transaction using a one-time anonymized credit card number, see e.g., 2123f. For example, the app may utilize a pre-designated anonymized set of card details (see, e.g., “AnonCard1,” “AnonCard2”). As another example, the app may generate, e.g., in real-time, a one-time anonymous set of card details to securely complete the purchase transaction (e.g., “Anon It 1X”). In such embodiments, the app may automatically set the user profile settings such that the any personal identifying information of the user will not be provided to the merchant and/or other entities. In some embodiments, the user may be required to enter a user name and password to enable the anonymization features.
With reference to
In some embodiments, the app may utilize predetermined default settings for a particular merchant, e.g., 2131, to process the purchase based on the QR code (e.g., in response to the user touching an image of a QR code displayed on the screen of the user device). However, if the user wishes to customize the payment parameters, the user may activate a user interface element 2135 (or e.g., press and continue to hold the image of the QR code 2132). Upon doing so, the app may provide a pop-up menu, e.g., 2137, providing a variety of payment customization choices, such as those described with reference to
With reference to
For example, a user may go to doctor's office and desire to pay the co-pay for doctor's appointment. In addition to basic transactional information such as account number and name, the app may provide the user the ability to select to transfer medical records, health information, which may be provided to the medical provider, insurance company, as well as the transaction processor to reconcile payments between the parties. In some embodiments, the records may be sent in a Health Insurance Portability and Accountability Act (HIPAA)-compliant data format and encrypted, and only the recipients who are authorized to view such records may have appropriate decryption keys to decrypt and view the private user information.
With reference to
In some embodiments, the MDB may utilize a text challenge procedure to verify the authenticity of the user, e.g., 2151b. For example, the MDB may communicate with the user via text chat, SMS messages, electronic mail, Facebook® messages, Twitter™ tweets, and/or the like. The MDB may pose a challenge question, e.g., 2152b, for the user. The app may provide a user input interface element(s) (e.g., virtual keyboard 2153b) to answer the challenge question posed by the MDB. In some embodiments, the challenge question may randomly selected by the MDB automatically; in some embodiments, a customer service representative 2155b may manually communicate with the user. In some embodiments, the user may not have initiated the transaction, e.g., the transaction is fraudulent. In such embodiments, the user may cancel, e.g., 2158b, the text challenge. The MDB may then cancel the transaction, and/or initiate fraud investigation procedures on behalf of the user. In some embodiments, the app may provide additional user interface elements, e.g., to display previous session 2156b, and provide additional customer support options (e.g., VerifyChat 2157b).
In some implementations, the client may generate a purchase order message, e.g., 2312, and provide, e.g., 2313, the generated purchase order message to the merchant server, e.g., 2303. For example, a browser application executing on the client may provide, on behalf of the user, a (Secure) Hypertext Transfer Protocol (“HTTP(S)”) GET message including the product order details for the merchant server in the form of data formatted according to the eXtensible Markup Language (“XML”). Below is an example HTTP(S) GET message including an XML-formatted purchase order message for the merchant server:
In some implementations, the merchant server may, in response to receiving the purchase order message from the client, generate, e.g., 2314, a request for merchant analytics from a pay network server, e.g., 2305, so that the merchant may provide product offerings for the user. For illustration, in the example above, the merchant server may add an XML-encoded data structure to the body of the purchase order message, and forward the message to the pay network server. An example XML-encoded data snippet that the merchant server may add to the body of the purchase order message before forwarding to the pay network server is provided below:
The merchant server may provide the merchant analytics request, e.g., 2315, to the pay network server. In some implementations, the pay network server may extract the merchant and user profile information from the merchant analytics request. For illustration, the pay network server may extract values of the ‘merchant_ID’ and ‘user_ID’ fields from the merchant analytics request in the examples above. Using the merchant and user profile information, the pay network server may determine whether the merchant and/or user are enrolled in the merchant analytics program. In some implementations, the pay network server may provide the results of merchant analytics only to those entities that are enrolled in the merchant analytics program. For example, the server may query a database, e.g., pay network database 2307, to determine whether the user and/or merchant are enrolled in the merchant analytics program. In some implementations, the pay network server may generate a query the database for user behavior patterns of the user for merchant analytics, e.g., 2317. For example, the database may be a relational database responsive to Structured Query Language (“SQL”) commands. The pay network server may execute a hypertext preprocessor (“PHP”) script including SQL commands to query the database for user behavior patterns of the user. An example PHP/SQL command listing, illustrating substantive aspects of querying the database, is provided below:
In response to obtaining the issuer server query, e.g., 2317, the pay network database may provide, e.g., 2318, the requested behavior patterns data to the pay network server. For example, the user behavior patterns data may comprise pair-wise correlations of various variables to each other, and/or raw user transaction patterns. An example XML-encoded user behavior pattern data file is provided below:
In some implementations, the pay network server may identify products, services and/or other offerings likely desired by the user based on pre-generated user behavioral pattern analysis and user profile, e.g., 2319. The pay network server may generate a query, e.g., 2320, for merchants that may be able to provide the identified products, services, and/or offerings for the user. For example, the pay network server may generate a query based on the GPS coordinates of the user (e.g., obtained from the user's smartphone), the merchant store in which the user currently is present, etc., for merchants in the vicinity of the user who may have products included within the identified products likely desired by the user. In some implementations, the pay network server may also generate a query for offers (e.g., discount offers, Groupon® offers, etc.) that the merchant may be able to offer for the users. For example, the pay network server may utilize PHP/SQL commands similar to those provided above to query a database. In response, the database may provide, e.g., 2321, the requested merchant and/or offer data to the pay network server. In some implementations, the pay network server may generate a real-time merchant analytics report for the merchant, e.g., 2322. In some implementations, the pay network server may generate a real-time geo-sensitive product offer packet for the user, e.g., including such items as (but not limited to): merchant names, location, directions, offers, discounts, interactive online purchase options, instant mobile wallet purchase ability, order hold placing features (e.g., to hold the items for pick up so as to prevent the items going out of stock, e.g., during seasonal shopping times), and/or the like. In some implementations, the pay network server may provide the merchant analytics report, e.g., 2324, to the merchant server, and may provide the real-time geo-sensitive product offer packet, e.g., 2327, to the client. In some implementations, the merchant server may utilize the pay network server's merchant analytics report to generate, e.g., 2325, offer(s) for the user. The merchant server may provide the generated offer(s), e.g., 2326, to the user. In some implementations, the client may render and display, e.g., 2328, the real-time geo-sensitive product offer packet from the pay network server and/or purchase offer(s) from the merchant to the user.
With reference to
In some implementations, the pay network server may parse the investment strategy analysis request, and determine the type of investment strategy analysis required, e.g., 2814. In some implementations, the pay network server may determine a scope of data aggregation required to perform the analysis. The pay network server may initiate data aggregation based on the determined scope, for example, via a Transaction Data Aggregation (“TDA”) component such as described above with reference to
With reference to
With reference to
In some implementations, the server may query a database for a normalized transaction data record template, e.g., 2901. The server may parse the normalized data record template, e.g., 2902. Based on parsing the normalized data record template, the server may determine the data fields included in the normalized data record template, and the format of the data stored in the fields of the data record template, e.g., 2903. The server may obtain transaction data records for normalization. The server may query a database, e.g., 2904, for non-normalized records. For example, the server may issue PHP/SQL commands to retrieve records that do not have the ‘norm_flag’ field from the example template above, or those where the value of the ‘norm_flag’ field is ‘false’. Upon obtaining the non-normalized transaction data records, the server may select one of the non-normalized transaction data records, e.g., 2905. The server may parse the non-normalized transaction data record, e.g., 2906, and determine the fields present in the non-normalized transaction data record, e.g., 2907. The server may compare the fields from the non-normalized transaction data record with the fields extracted from the normalized transaction data record template. For example, the server may determine whether the field identifiers of fields in the non-normalized transaction data record match those of the normalized transaction data record template, (e.g., via a dictionary, thesaurus, etc.), are identical, are synonymous, are related, and/or the like. Based on the comparison, the server may generate a 1:1 mapping between fields of the non-normalized transaction data record match those of the normalized transaction data record template, e.g., 2909. The server may generate a copy of the normalized transaction data record template, e.g., 2910, and populate the fields of the template using values from the non-normalized transaction data record, e.g., 2911. The server may also change the value of the ‘norm_flag’ field to ‘true’ in the example above. The server may store the populated record in a database (for example, replacing the original version), e.g., 2912. The server may repeat the above procedure for each non-normalized transaction data record (see e.g., 2913), until all the non-normalized transaction data records have been normalized.
The server may select an unclassified data record for processing, e.g., 3003. The server may also select a classification rule for processing the unclassified data record, e.g., 3004. The server may parse the classification rule, and determine the inputs required for the rule, e.g., 3005. Based on parsing the classification rule, the server may parse the normalized data record template, e.g., 3006, and extract the values for the fields required to be provided as inputs to the classification rule. For example, to process the rule in the example above, the server may extract the value of the field ‘merchant_id’ from the transaction data record. The server may parse the classification rule, and extract the operations to be performed on the inputs provided for the rule processing, e.g., 3007. Upon determining the operations to be performed, the server may perform the rule-specified operations on the inputs provided for the classification rule, e.g., 3008. In some implementations, the rule may provide threshold values. For example, the rule may specify that if the number of products in the transaction, total value of the transaction, average luxury rating of the products sold in the transaction, etc. may need to cross a threshold in order for the label(s) associated with the rule to be applied to the transaction data record. The server may parse the classification rule to extract any threshold values required for the rule to apply, e.g., 3009. The server may compare the computed values with the rule thresholds, e.g., 3010. If the rule threshold(s) is crossed, e.g., 3011, option “Yes,” the server may apply one or more labels to the transaction data record as specified by the classification rule, e.g., 3012. For example, the server may apply a classification rule to an individual product within the transaction, and/or to the transaction as a whole. In some implementations, the server may process the transaction data record using each rule (see, e.g., 3013). Once all classification rules have been processed for the transaction record, e.g., 3013, option “No,” the server may store the transaction data record in a database, e.g., 3014. The server may perform such processing for each transaction data record until all transaction data records have been classified (see, e.g., 3015).
To generate the forecast, the server may utilize a random sample of transaction data (e.g., approximately 6% of all transaction data within the network of pay servers), and regression analysis to generate model equations for calculating the forecast from the sample data. For example, the server may utilize distributed computing algorithms such as Google MapReduce. Four elements may be considered in the estimation and forecast methodologies: (a) rolling regressions; (b) selection of the data sample (“window”) for the regressions; (c) definition of explanatory variables (selection of accounts used to calculate spending growth rates); and (d) inclusion of the explanatory variables in the regression equation (“candidate” regressions) that may be investigated for forecasting accuracy. The dependent variable may be, e.g., the growth rate calculated from DOC revised sales estimates published periodically. Rolling regressions may be used as a stable and reliable forecasting methodology. A rolling regression is a regression equation estimated with a fixed length data sample that is updated with new (e.g., monthly) data as they become available. When a new data observation is added to the sample, the oldest observation is dropped, causing the total number of observations to remain unchanged. The equation may be estimated with the most recent data, and may be re-estimated periodically (e.g., monthly). The equation may then be used to generate a one-month ahead forecast for year-over-year or month over month sales growth.
Thus, in some implementations, the server may generate N window lengths (e.g., 18 mo, 24 mo, 36 mo) for rolling regression analysis, e.g., 3305. For each of the candidate regressions (described below), various window lengths may be tested to determine which would systemically provide the most accurate forecasts. For example, the server may select a window length may be tested for rolling regression analysis, e.g., 3306. The server may generate candidate regression equations using series generated from data included in the selected window, e.g., 3307. For example, the server may generate various series, such as, but not limited to:
Series (1): Number of accounts that have a transaction in the selected spending category in the current period (e.g., month) and in the prior period (e.g., previous month/same month last year);
Series (2): Number of accounts that have a transaction in the selected spending category in the either the current period (e.g., month), and/or in the prior period (e.g., previous month/same month last year);
Series (3): Number of accounts that have a transaction in the selected spending category in the either the current period (e.g., month), or in the prior period (e.g., previous month/same month last year), but not both;
Series (4): Series (i)+overall retail sales in any spending category from accounts that have transactions in both the current and prior period;
Series (5): Series (i)+Series (2)+overall retail sales in any spending category from accounts that have transactions in both the current and prior period; and
Series (6): Series (i)+Series (2)+Series (3)+overall retail sales in any spending category from accounts that have transactions in both the current and prior period.
With reference to
In some implementations, the server may generate a forecast for a specified forecast period using the selected window length and the candidate regression equation, e.g., 3312. The server may create final estimates for the forecast using DOC estimates for prior period(s), e.g., 3313. For example, the final estimates (e.g., FtY—year-over-year growth, FtM—month-over-month growth) may be calculated by averaging month-over-month and year-over-year estimates, as follows:
DtY=(1+GtY)·Rt-12
DtM=(1+GtM)·At-1
Dt=Mean(DtM,DtY)
Bt-1Y=(1+Gt-1Y)·Rt-13
Bt-1M=At-1
Bt-1=Mean(Bt-1M,Bt-1Y)
FtY=Dt/Rt-12−1
FtM=Dt/Bt-1−1
Here, G represents the growth rates estimated by the regressions for year (superscript Y) or month (superscript M), subscripts refer to the estimate period, t is the current forecasting period); R represents the DOC revised dollar sales estimate; A represents the DOC advance dollar estimate; D is a server-generated dollar estimate, B is a base dollar estimate for the previous period used to calculate the monthly growth forecast.
In some implementations, the server may perform a seasonal adjustment to the final estimates to account for seasonal variations, e.g., 3314. For example, the server may utilize the X-12 ARIMA statistical program used by the DOC for seasonal adjustment. The server may then provide the finalized forecast for the selected spending category, e.g., 3315. Candidate regressions may be similarly run for each spending category of interest (see, e.g., 3316).
Thus, as seen from the discussion above, in various embodiments, the MDB facilitates the creation of analytical models using which the data aggregated by the Centralized Personal Information Platform of the MDB may be utilized to provide business or other intelligence to the various users of the MDB. Examples of analytical models include the components discussed above in the discussion with reference to
In some embodiments, the MDB may utilize metadata (e.g., easily configurable data) to drive an analytics and rule engine that may convert any structured data obtained via the centralized personal information platform, discussed above in this disclosure, into a standardized XML format (“encryptmatics” XML). See
In the encryptmatics XML examples herein, a “key” represents a collection of data values. A “tumblar” represents a hash lookup table that may also allow wild card searches. A “lock” represents a definition including one or more input data sources, data types for the input sources, one or more data output storage variables, and functions/modules that may be called to process the input data from the input data sources. A “door” may refer to a collection of locks, and a vault may represent a model package defining the input, output, feature generation rules and analytical models. Thus, the encryptmatics XML may be thought of as a framework for calling functions (e.g., INSTANT—returns the raw value, LAG—return a key from a prior transaction, ADD—add two keys together, OCCURRENCE—returns the number of times a key value occurred in prior transactions, AVG—returns an average of past and current key values, etc.) and data lookups with a shared storage space to process a grouped data stream.
In some embodiments, a metadata based interpretation engine may populate a data/command object (e.g., an encryptmatics XML data structure defining a “vault”) based on a given data record, using configurable metadata. The configurable metadata may define an action for a given glyph or keyword contained within a data record. The MDB may obtain the structured data, and perform a standardization routine using the structured data as input (e.g., including script commands, for illustration). For example, the MDB may remove extra line breaks, spaces, tab spaces, etc. from the structured data. The MDB may determine and load a metadata library, using which the MDB may parse subroutines or functions within the script, based on the metadata. In some embodiments, the MDB may pre-parse conditional statements based on the metadata. The MDB may also parse data to populate a data/command object based on the metadata and prior parsing. Upon finalizing the data/command object, the MDB may export the data/command object as XML in standardized encryptmatics format. For example, the engine may process the object to export its data structure as a collection of encryptmatics vaults in a standard encryptmatics XML file format. The encryptmatics XML file may then be processed to provide various features by an encryptmatics engine.
As an example, using such a metadata based interpretation engine, the MDB can generate the encryptmatics XML code, provided below, from its equivalent SAS code, provided beneath the encryptmatics XML code generated from it:
As another example, using such a metadata based interpretation engine, the MDB can generate the encryptmatics XML code, provided below, from its equivalent SAS code, provided beneath the encryptmatics XML code generated from it:
Thus, in some embodiments, the MDB may gradually convert the entire centralized personal information platform from structured data into standardized encryptmatics XML format. The MDB may also generate structured data as an output from the execution of the standardized encryptmatics XML application, and add the structured data to the centralized personal information platform databases, e.g., 3610. In some embodiments, the MDB may recursively provides structured data generated as a result of execution of the encryptmatics XML application as input into the EXC component, e.g. 3611.
In one embodiment, the pay network server may query, e.g., 3712, a pay network database, e.g., 3707, for email aggregation API templates for the email provider services. For example, the pay network server may utilize PHP/SQL commands similar to the examples provided above. The database may provide, e.g., 3713, a list of email access API templates in response. Based on the list of API templates, the pay network server may generate email aggregation requests, e.g., 3714. The pay network server may issue the generated email aggregation requests, e.g., 3715a-c, to the email network servers, e.g., 3701a-c. For example, the pay network server may issue PHP commands to request the email provider servers for email data. An example listing of commands to issue email aggregation data requests 3715a-c, substantially in the form of PHP commands, is provided below:
In some embodiments, the email provider servers may query, e.g., 3717a-c, their databases, e.g., 3710a-c, for email aggregation results falling within the scope of the email aggregation request. In response to the queries, the databases may provide email data, e.g., 3718a-c, to the email provider servers. The email provider servers may return the email data obtained from the databases, e.g., 3719a-c, to the pay network server making the email aggregation requests. An example listing of email data 3719a-c, substantially in the form of JavaScript Object Notation (JSON)-formatted data, is provided below:
In some embodiments, the pay network server may store the aggregated email data results, e.g., 3720, in an aggregated database, e.g., 3710a.
In one embodiment, the mesh graph may also contain service items, e.g., 3807, such as a restaurants chicken parmesan or other menu item. The service item and its link to the business 3803, e.g., 3806, 3808, may be determined using a forward web crawl (such as by crawling from a business home page to its menu pages), or by a reverse web crawl, such as by crawling using an Optical Character Recognition scanned menu forwarded through an email exchange and aggregated by an email aggregating component of the MDB.
In one embodiment, the mesh graph may additionally contain meta concepts, e.g., 3810, 3812, 3815. Meta-concepts are conceptual nodes added to the graph by MDB that define not a specific entity (such as a user or a business) nor a specific deduced entity (such as a deduced item or a deduced opportunity), but rather indicate an abstract concept to which many more nodes may relate. For example, through web crawling, e.g., 3814, or email aggregation, e.g., 3817, user reviews may be imported as nodes within the mesh graph, e.g., 3813, 3816. Nodes may be anonymous, e.g., 3813, linked to a specific user's friend (such as to provide specific user recommendations based on a social graph link), e.g., 3816, and/or the like. These reviews may be analyzed for positive concepts or words such as “delightful meal” or “highly recommended” and thereafter be determined by the MDB to be a positive review and linked to a mesh meta-concept of the kind positive review, e.g., 3815. In so doing, the MDB allows disparate aggregated inputs such as email aggregation data, location aggregation data, web crawling or searching aggregated data, and/or the like to be used to roll up concepts into conceptual units.
In one embodiment, these conceptual meta concepts, e.g., 3815, may be further linked to actual items, e.g., 3807. In so doing connections can be formed between real world entities such as actual reviews of items, to meta-concepts such as a positive review or beneficial location, and further linked to actual items as a location. Further meta-concepts may include activities such as dinner, e.g., 3812, a non-entity specific item (e.g., not a restaurant's chicken parmesan and not a mother's chicken parmesan, but chicken parmesan as a concept), e.g., 3811. The connection of actual entity nodes with deduced entity nodes and meta-concept nodes allows the mesh to answer a virtually limitless number of questions regarding a given nodes connections and probable outcomes of a decision.
In one embodiment, nodes within the mesh graph are connected by edges that have no magnitude. In another embodiment, the edges themselves may have meta-data associated with them that enable faster or better querying of the mesh. Example meta data that may be stored at a graph edge include a relative magnitude of connection between nodes, path information regarding other nodes available from the edge, and/or the like. In still other embodiments, intermediate or link nodes, e.g., 3804, 3806, 3808, 3814, 3817, 3809, may be inserted by the MDB into the mesh graph. These intermediate nodes may function as the equivalent of an edge, in that they may describe a relationship between two nodes. In one embodiment, the link nodes may contain information about the nodes that they connect to. In so doing, the number of nodes in the graph that need to be searched in order to find a given type, magnitude or value of connection may be reduced logarithmically. Additionally, the link nodes may contain data about how the relationship between the nodes it links was established, such as by indicating the connection was established via search aggregation, email aggregation, and/or the like.
In one embodiment, the distributed linking node mesh may be stored in a modified open source database such as Neo 4j, OrientDB, HyperGraphDB, and/or the like. An example structure substantially in the form of XML suitable for storing a distributed linking node mesh is:
An example query suitable for querying a distributed linking node mesh is:
In another embodiment, an example query suitable for querying a distributed linking node mesh is:
In one embodiment, the query portion relating to finding a good deal is performed as a MDB search to arrive arrive at a result of a deduced opportunity for lower prices during weekdays, e.g., 3902. The search may then progress to extract the concept of a good deal merged with a restaurant nearby. Using an integrated location capability of a user's device, the user's current location may additionally be provided to the MDB for use in this portion of the query process, to produce a result containing a deduced opportunity for lower prices (e.g., a “good deal”) at a business nearby wherein the lower prices are linked to the business nearby with a certain degree of weight, e.g., 3903. In one embodiment, the search may progress to find results for the concept of a dinner (e.g., meta-concept dinner 3904), which is itself linked through intermedia nodes to the business found in the previous portion of the search, e.g., 3905. In one embodiment, the search may then progress to find connections that indicate that the user 3901 will like the restaurant, e.g., 3906, and that the user's friends will similarly like the restaurant, e.g., 3907. The intermediate searches performed may be then merged to produce a unitary result, e.g., 3908, for a restaurant meeting the full criteria. In cases where no single entity meets all the criteria, the most important criteria to a user may be first determined using its own MDB search, such as a search that determines that a user 3901 has never traveled to a nearby popular location area for dinner and therefore concluding that location is very important to the user. In one embodiment, multiple results 3908 may be returned and ranked for acceptability to both the user and his/her friends, enabling the user to then choose a preferred location.
In one embodiment, languages other than a native meta-data language are passed to a meta-data language conversion component 4108, such as an Encryptmatics XML converter. The converter may convert the language to a meta-data language 4109. In one embodiment, the meta data language may describe data sources 4110 including a private data store (not available to the provided model), an anonymized data store that is based on the private data store (available to the provided model), and/or a public data store. In one embodiment, the meta-data language may be deconverted 4111 to produce data queries and model logic 4112 that is parseable by the MDB interpreter.
In one embodiment, the first unprocessed mesh language operation is extracted from the mesh language definition. An example operation may be “TRIM”, which may strip whitespace from the beginning and end of an input string. A determination is made if the mesh operation has an equivalent operation in the input language, e.g., 4204. Such a determination may be made by executing a sample command against the input binary and observing the output to determine if an error occurred. In other embodiments, a publically available language definition web site may be crawled to determine which function(s) within an input language likely map to the mesh operation equivalent(s). In some instances, there will be a one-to-one mapping between the input language and the meta-data based mesh language. If there is not a one-to-one equivalence, e.g., 4205, a determination is made (using a procedure similar to that employed above) to determine if a combination of input language functions may equate to a mesh language operation, e.g., 4206. For example, an input language that supports both a left-trim (strip space to left of string) and a right-trim operation (strip space to right of string) may be considered to support a mesh TRIM through a combination applying both the left-trim and right-trim operations, producing a substantially equivalent output result.
In one embodiment, if no matching combination is found, e.g., 4207, the mesh operation may be marked as unavailable for the input language, e.g., 4208 and the next unprocessed mesh operation may then be considered. If a matching combination is found, e.g., 4207, an upper bound test may be employed to test the upper bound behavior of the input language operation and compare that to the upper bound behavior of an equivalent mesh operation, e.g., 4209. For example, some languages may perform floating point rounding to a different degree of precision at upper bounds of input. By testing this case, a determination may be made if the equivalent input language function will produce output equivalent to the mesh operation at upper bounds. In one embodiment, a lower bound test may be employed to test the lower bound behavior of the input language operation and compare that to the lower bound behavior of an equivalent mesh operation, e.g., 4210. For example, some languages may perform floating point rounding to a different degree of precision at lower bounds of input. By testing this case, a determination may be made if the equivalent input language function will produce output equivalent to the mesh operation at upper bounds. In one embodiment, other custom tests may then be performed that may be dependent on the mesh operation or the input language operation(s), e.g., 4211. If the results of the test cases above produce output that is different than the expected output for the equivalent mesh operation, e.g., 4212, an offset spanning function may be generated to span the difference between the languages. For example, in the example above if the rounding function in the input language is determined to produce different behavior than the equivalent mesh operation at a lower bound, a function may be provided in the input or mesh language to modify any output of the given input language operations to create an equivalent mesh language operation output. For example, a given floating point number may be rounded to a given level of significant digits to produce equivalent behavior.
In one embodiment, the offset spanning function may not be capable of completely mapping the input language operation(s) to the mesh language operation, e.g., 4214. In one embodiment, previous versions of the mesh language definition, e.g., 4215, may then be tested using a procedure substantially similar to that described above to determine if they may completely map the input language, e.g., 4216. If the previous version of the mesh language definition completely maps the input language, the mesh language definition version for the input language may be set to the previous version, e.g., 4217. For example, a previous version of the mesh language definition may contain different capabilities or function behaviors that allow it to completely map to an input language. If previous versions of the mesh input language do not completely map to the input language, language clipping parameters may be generated, e.g., 4218. Language clipping parameters are input limitations that are placed on an input language such that any inputs within the input limitations range will produce compliant mesh operation output. Inputs outside that range may generate an error. In one embodiment, language clipping parameters may include limits to the upper bound or lower bound of acceptable input. Such limits may be determined by iteratively testing increasing or decreasing inputs in order to find an input range that maps completely to the mesh operation.
In one embodiment, the current mesh operation, input language operation(s) any spanning functions or language clipping parameters, the mesh language version, and/or the like may be stored in an input language definition database, e.g., 4219. If there are more unprocessed mesh language operations, e.g., 4220, the procedure may repeat.
In one embodiment, the variable initialization template and the input language definition are used to create a constants block based on the variable initialization template, e.g., 4310. Within the constants block, any constants that were included in the input language command file may be stored as structured XML. An example constants block, substantially the form of XML is as follows:
In one embodiment, there may be multiple constant blocks defined corresponding to multiple constant values in the input language command file. In other embodiments, constants may be collapsed to one block.
In one embodiment, the input datasources may then be determined based on the input language command file, e.g., 4311. For example, an input datasource may be defined directly in the input language command file (such as by declaring a variable as an array to values in the input language command file). In other embodiments, the inputs may be external to the input language command file, such as a third party library or loaded from an external source file (such as a comma delimited file, via a SQL query to an ODBC compliant database, and/or the like). A mesh language input datasource template may then be retrieved, e.g., 4312, to provide a structure to the MDB to use in formatting the inputs as meta-data. The datasources may be scanned to determine if they are available to the model (such as by executing “1s−1” on a POSIX compliant Unix system), e.g., 4313. If the datasources are available to the model, then a meta data language input block may be created using the input datasource template, the language definition, and the input language command file, e.g., 4314. An example input block substantially in the form of XML is:
In one embodiment, a mesh language output template is determined, e.g., 4315 and an output block is created using a procedure substantially similar to that described above with respect to the constant and input blocks, e.g., 4316. An example output block, substantially in the form of XML is:
In one embodiment, the constant block, input block, and output block are added to a newly created initialization block and the initialization block is added to the current run block, e.g., 4317. An example run block with a complete initialization block included therein, substantially in the form of XML is as follows:
In one embodiment, a vault block will then be created, e.g., 4318. A logic command block will be extracted from the input logic command file, e.g., 4319. A logic command block is a logic block that is a non-outermost non-conditional logic flow. A door block may then be added to the vault block, e.g., 4320. A logic command, representing a discrete logic operation, may then be extracted from the logic command block, e.g., 4321. The logic command may be a tumbler, e.g., 4322, in which case a tumbler key may be looked up in a tumbler database and the tumbler may be processed, e.g., 4323. Further detail with respect to tumbler processing may be found with respect to
In one embodiment, a tumblar file may be substantially in the form of XML as follows:
In one embodiment, the mesh structure may then be updated, e.g., 4604. Further detail regarding updating the mesh structure can be found throughout this specification, drawing and claims, and particularly with reference to
In an alternative embodiment, an example cluster categories request 4606, substantially in the form of an HTTP(S) POST message including XML is:
In one embodiment, the cluster categories request above may be modified by the MDB as a result of aggregated data. For example, a request to create a cluster for an iPod of a given size may be supplemented with alternative models/sizes. In so doing, the mesh may expand a recommendation, graph entity, and/or the like to emcompass concepts that are connected with the primary concept. In one embodiment, this modified cluster may take the form a the form of XML substantially similar to:
In one embodiment, the mesh structure may be updated in response to the cluster categories request, e.g., 4604. In one embodiment, a user 4607 may use his/her mobile device to indicate that they wish to purchase an item based on cluster concepts, e.g., a user bid/buy input 4608. For example, a user may query “I want the TV that AV Geeks thinks is best and I'll pay $1,500 for it”. In one embodiment, the query may be substantially in the form of a language input such as the above, which may be parsed using natural language processing packages such as FreeLing, LingPipe, OpenNLP, and/or the like. In other embodiments, the user may be presented with a structured query interface on their mobile device that allows a restricted set of options and values from which to build a bid/buy input 4608. For example, a user may be given a list of categories (such as may be built by querying a categories database as described with respect to
In an alternative embodiment, the consumer cluster based bid request may be generated using the user interface described herein and with respect to
In one embodiment, in response to the consumer cluster based bid request 4610, the clustering node 4605 may generate a cluster request 4611. A cluster request may be a request to search the mesh in order to find results (e.g., items matching a cluster's buying habits, merchants offering an item, alternative items for purchase, friends that have already purchased items, items the user already owns—based on, for example, past purchase transactions—that may satisfy the request, and/or the like). An example query suitable for querying a distributed linking node mesh is:
In one embodiment, the mesh server may provide a cluster request response 4612. An example cluster request response 4612 substantially in the form of an HTTP(S) POST message including XML is:
In an alternative embodiment, an example cluster request response 4612 substantially in the form of an HTTP(S) POST message including XML is:
In one embodiment, the clustering node 4605 may then process the cluster response and create transaction triggers. Further details regarding cluster request response 4612 processing may be found throughout the specification, drawings and claims and particularly with reference to
In one embodiment, a lead cluster order request may be generated for merchants that were identified as a result of the cluster response analysis, e.g., 4613. In other embodiments, a default list of merchants may be used. A lead cluster order request may contain information relating to the identified purchase that the user 4607 wishes to engage in. In the example above, for example, the analysis may have determined that based on the aggregated AV Geeks user expert preference information, the user should purchase Sony television model KDL 50EX645 or KDL 50EX655. The analysis may also have determined that a given merchant sells those models of television (such as by using aggregated sales transaction data as described herein). A request may then be sent to the merchant indicating a purchase item, a user lead that may execute the purchase and a price the user is willing to pay. In one embodiment, the user identity is not provided or is anonymized such that the merchant does not have information sufficient to determine the actual identity of the user but may determine if they wish to execute the sale to the user. An example lead cluster order request 4614, substantially in the form of an HTTP(S) POST message containing XML data:
In one embodiment, a merchant may accept the order and generate a lead cluster order accept/reject response. In other embodiments, the merchant may indicate that they wish to hold the lead opportunity open and may accept at a later time if no other merchant has filled the lead cluster order request. In still other embodiments, the merchant response may contain a counteroffer for the user (e.g., $1600), which the user may then accept or decline. In one embodiment, the user receives an order acceptance confirmation 4617 indicating that their order has been fulfilled.
In one embodiment, a user may cancel a cluster based bid request prior to the merchant fulfilling the order. For example, a user may transmit a user cancel input 4618 to clustering server 4609. The clustering server may forward the cancel message to the clustering node 4605, e.g., 4619, which may in turn forward the cancel message to the merchant(s) server 4615, e.g., 4620.
In one embodiment, candidate purchase items may be extracted from the cluster request response, e.g., 4705. A merchant database may be queried to determine merchants selling the candidate purchase items. An example merchant database query, substantially in the form of PHP/SQL commands is provided below:
In one embodiment, a maximum price the user is willing to pay is determined, e.g., 4707. An average selling price of the candidate purchase items may be determine (such as by querying a merchant table containing price history, querying a price history table, performing a live crawl of a merchant's web site, and/or the like). If the user's maximum price is not within a given range of the average merchant item price, e.g., 4709, a price trend database may be queried, e.g., 4710. A price trend database may contain historical information relating to the price of an item over time. If the price trend (i.e., the linear extrapolation of the historical prices, and/or the like) shows that the average price of the item will be within 40% of the user's maximum price before the user purchase bid expires, e.g., 4711, the user purchase bid request may be held, e.g., 4712, so that the cluster response analysis may be re-run again before the bid expires. In another embodiment, even if the user's price will not be within a range of the average price of an item at the queried merchants, the user procedure may continue if the user has been marked as a high priority bid user (e.g., a frequent bidder, a new bidder, and/or the like), e.g., 4713. In one embodiment, the first merchant that has stock of the item may be selected, e.g., 4714. If the merchant has received greater than a set amount of bids in a time period, e.g., 4715, another merchant may be selected. In so doing, one merchant may not be overwhelmed with bids. In one embodiment, a lead cluster order request is created and transmitted to the merchant, e.g., 4716.
Similarly, the discovery shopping mode 4821 may provide a view of aggregate consumer response to opinions of experts, divided based on opinions of experts aggregated form across the web (see 4802). Thus, the virtual wallet application may provide visualizations of how well consumers tend to agree with various expert opinion on various product categories, and whose opinions matter to consumers in the aggregate (see 4823-4826). In some embodiments, the virtual wallet application may also provide an indicator (see 4829) of the relative expenditure of the user of the virtual wallet application (see blue bars); thus the user may be able to visualize the differences between the user's purchasing behavior and consumer behavior in the aggregate. The user may be able to turn off the user's purchasing behavior indicator (see 4830). In some embodiments, the virtual wallet application may allow the user to zoom in to and out of the visualization, so that the user may obtain a view with the appropriate amount of granularity as per the user's desire (see 4827-4828). At any time, the user may be able to reset the visualization to a default perspective (see 4831).
With reference to
With reference to
Typically, users, which may be people and/or other systems, may engage information technology systems (e.g., computers) to facilitate information processing. In turn, computers employ processors to process information; such processors 4903 may be referred to as central processing units (CPU). One form of processor is referred to as a microprocessor. CPUs use communicative circuits to pass binary encoded signals acting as instructions to enable various operations. These instructions may be operational and/or data instructions containing and/or referencing other instructions and data in various processor accessible and operable areas of memory 4929 (e.g., registers, cache memory, random access memory, etc.). Such communicative instructions may be stored and/or transmitted in batches (e.g., batches of instructions) as programs and/or data components to facilitate desired operations. These stored instruction codes, e.g., programs, may engage the CPU circuit components and other motherboard and/or system components to perform desired operations. One type of program is a computer operating system, which, may be executed by CPU on a computer; the operating system enables and facilitates users to access and operate computer information technology and resources. Some resources that may be employed in information technology systems include: input and output mechanisms through which data may pass into and out of a computer; memory storage into which data may be saved; and processors by which information may be processed. These information technology systems may be used to collect data for later retrieval, analysis, and manipulation, which may be facilitated through a database program. These information technology systems provide interfaces that allow users to access and operate various system components.
In one embodiment, the MDB controller 4901 may be connected to and/or communicate with entities such as, but not limited to: one or more users from user input devices 4911; peripheral devices 4912; an optional cryptographic processor device 4928; and/or a communications network 4913.
Networks are commonly thought to comprise the interconnection and interoperation of clients, servers, and intermediary nodes in a graph topology. It should be noted that the term “server” as used throughout this application refers generally to a computer, other device, program, or combination thereof that processes and responds to the requests of remote users across a communications network. Servers serve their information to requesting “clients.” The term “client” as used herein refers generally to a computer, program, other device, user and/or combination thereof that is capable of processing and making requests and obtaining and processing any responses from servers across a communications network. A computer, other device, program, or combination thereof that facilitates, processes information and requests, and/or furthers the passage of information from a source user to a destination user is commonly referred to as a “node.” Networks are generally thought to facilitate the transfer of information from source points to destinations. A node specifically tasked with furthering the passage of information from a source to a destination is commonly called a “router.” There are many forms of networks such as Local Area Networks (LANs), Pico networks, Wide Area Networks (WANs), Wireless Networks (WLANs), etc. For example, the Internet is generally accepted as being an interconnection of a multitude of networks whereby remote clients and servers may access and interoperate with one another.
The MDB controller 4901 may be based on computer systems that may comprise, but are not limited to, components such as: a computer systemization 4902 connected to memory 4929.
A computer systemization 4902 may comprise a clock 4930, central processing unit (“CPU(s)” and/or “processor(s)” (these terms are used interchangeable throughout the disclosure unless noted to the contrary)) 4903, a memory 4929 (e.g., a read only memory (ROM) 4906, a random access memory (RAM) 4905, etc.), and/or an interface bus 4907, and most frequently, although not necessarily, are all interconnected and/or communicating through a system bus 4904 on one or more (mother)board(s) 4902 having conductive and/or otherwise transportive circuit pathways through which instructions (e.g., binary encoded signals) may travel to effectuate communications, operations, storage, etc. The computer systemization may be connected to a power source 4986; e.g., optionally the power source may be internal. Optionally, a cryptographic processor 4926 and/or transceivers (e.g., ICs) 4974 may be connected to the system bus. In another embodiment, the cryptographic processor and/or transceivers may be connected as either internal and/or external peripheral devices 4912 via the interface bus I/O. In turn, the transceivers may be connected to antenna(s) 4975, thereby effectuating wireless transmission and reception of various communication and/or sensor protocols; for example the antenna(s) may connect to: a Texas Instruments WiLink WL1283 transceiver chip (e.g., providing 802.11n, Bluetooth 3.0, FM, global positioning system (GPS) (thereby allowing MDB controller to determine its location)); Broadcom BCM 4329 FKUBG transceiver chip (e.g., providing 802.11n, Bluetooth 2.1+EDR, FM, etc.); a Broadcom BCM 4750IUB8 receiver chip (e.g., GPS); an Infineon Technologies X-Gold 618-PMB9800 (e.g., providing 2G/3G HSDPA/HSUPA communications); and/or the like. The system clock typically has a crystal oscillator and generates a base signal through the computer systemization's circuit pathways. The clock is typically coupled to the system bus and various clock multipliers that will increase or decrease the base operating frequency for other components interconnected in the computer systemization. The clock and various components in a computer systemization drive signals embodying information throughout the system. Such transmission and reception of instructions embodying information throughout a computer systemization may be commonly referred to as communications. These communicative instructions may further be transmitted, received, and the cause of return and/or reply communications beyond the instant computer systemization to: communications networks, input devices, other computer systemizations, peripheral devices, and/or the like. It should be understood that in alternative embodiments, any of the above components may be connected directly to one another, connected to the CPU, and/or organized in numerous variations employed as exemplified by various computer systems.
The CPU comprises at least one high-speed data processor adequate to execute program components for executing user and/or system-generated requests. Often, the processors themselves will incorporate various specialized processing units, such as, but not limited to: integrated system (bus) controllers, memory management control units, floating point units, and even specialized processing sub-units like graphics processing units, digital signal processing units, and/or the like. Additionally, processors may include internal fast access addressable memory, and be capable of mapping and addressing memory 4929 beyond the processor itself; internal memory may include, but is not limited to: fast registers, various levels of cache memory (e.g., level 1, 2, 3, etc.), RAM, etc. The processor may access this memory through the use of a memory address space that is accessible via instruction address, which the processor can construct and decode allowing it to access a circuit path to a specific memory address space having a memory state. The CPU may be a microprocessor such as: AMD's Athlon, Duron and/or Opteron; ARM's application, embedded and secure processors; IBM and/or Motorola's DragonBall and PowerPC; IBM's and Sony's Cell processor; Intel's Celeron, Core (2) Duo, Itanium, Pentium, Xeon, and/or XScale; and/or the like processor(s). The CPU interacts with memory through instruction passing through conductive and/or transportive conduits (e.g., (printed) electronic and/or optic circuits) to execute stored instructions (i.e., program code) according to conventional data processing techniques. Such instruction passing facilitates communication within the MDB controller and beyond through various interfaces. Should processing requirements dictate a greater amount speed and/or capacity, distributed processors (e.g., Distributed MDB), mainframe, multi-core, parallel, and/or super-computer architectures may similarly be employed. Alternatively, should deployment requirements dictate greater portability, smaller Personal Digital Assistants (PDAs) may be employed.
Depending on the particular implementation, features of the MDB may be achieved by implementing a microcontroller such as CAST's R8051XC2 microcontroller; Intel's MCS 51 (i.e., 8051 microcontroller); and/or the like. Also, to implement certain features of the MDB, some feature implementations may rely on embedded components, such as: Application-Specific Integrated Circuit (“ASIC”), Digital Signal Processing (“DSP”), Field Programmable Gate Array (“FPGA”), and/or the like embedded technology. For example, any of the MDB component collection (distributed or otherwise) and/or features may be implemented via the microprocessor and/or via embedded components; e.g., via ASIC, coprocessor, DSP, FPGA, and/or the like. Alternately, some implementations of the MDB may be implemented with embedded components that are configured and used to achieve a variety of features or signal processing.
Depending on the particular implementation, the embedded components may include software solutions, hardware solutions, and/or some combination of both hardware/software solutions. For example, MDB features discussed herein may be achieved through implementing FPGAs, which are a semiconductor devices containing programmable logic components called “logic blocks”, and programmable interconnects, such as the high performance FPGA Virtex series and/or the low cost Spartan series manufactured by Xilinx. Logic blocks and interconnects can be programmed by the customer or designer, after the FPGA is manufactured, to implement any of the MDB features. A hierarchy of programmable interconnects allow logic blocks to be interconnected as needed by the MDB system designer/administrator, somewhat like a one-chip programmable breadboard. An FPGA's logic blocks can be programmed to perform the operation of basic logic gates such as AND, and XOR, or more complex combinational operators such as decoders or mathematical operations. In most FPGAs, the logic blocks also include memory elements, which may be circuit flip-flops or more complete blocks of memory. In some circumstances, the MDB may be developed on regular FPGAs and then migrated into a fixed version that more resembles ASIC implementations. Alternate or coordinating implementations may migrate MDB controller features to a final ASIC instead of or in addition to FPGAs. Depending on the implementation all of the aforementioned embedded components and microprocessors may be considered the “CPU” and/or “processor” for the MDB.
The power source 4986 may be of any standard form for powering small electronic circuit board devices such as the following power cells: alkaline, lithium hydride, lithium ion, lithium polymer, nickel cadmium, solar cells, and/or the like. Other types of AC or DC power sources may be used as well. In the case of solar cells, in one embodiment, the case provides an aperture through which the solar cell may capture photonic energy. The power cell 4986 is connected to at least one of the interconnected subsequent components of the MDB thereby providing an electric current to all subsequent components. In one example, the power source 4986 is connected to the system bus component 4904. In an alternative embodiment, an outside power source 4986 is provided through a connection across the I/O 4908 interface. For example, a USB and/or IEEE 1394 connection carries both data and power across the connection and is therefore a suitable source of power.
Interface bus(ses) 4907 may accept, connect, and/or communicate to a number of interface adapters, conventionally although not necessarily in the form of adapter cards, such as but not limited to: input output interfaces (I/O) 4908, storage interfaces 4909, network interfaces 4910, and/or the like. Optionally, cryptographic processor interfaces 4927 similarly may be connected to the interface bus. The interface bus provides for the communications of interface adapters with one another as well as with other components of the computer systemization. Interface adapters are adapted for a compatible interface bus. Interface adapters conventionally connect to the interface bus via a slot architecture. Conventional slot architectures may be employed, such as, but not limited to: Accelerated Graphics Port (AGP), Card Bus, (Extended) Industry Standard Architecture ((E)ISA), Micro Channel Architecture (MCA), NuBus, Peripheral Component Interconnect (Extended) (PCI(X)), PCI Express, Personal Computer Memory Card International Association (PCMCIA), and/or the like.
Storage interfaces 4909 may accept, communicate, and/or connect to a number of storage devices such as, but not limited to: storage devices 4914, removable disc devices, and/or the like. Storage interfaces may employ connection protocols such as, but not limited to: (Ultra) (Serial) Advanced Technology Attachment (Packet Interface) ((Ultra) (Serial) ATA(PI)), (Enhanced) Integrated Drive Electronics ((E)IDE), Institute of Electrical and Electronics Engineers (IEEE) 1394, fiber channel, Small Computer Systems Interface (SCSI), Universal Serial Bus (USB), and/or the like.
Network interfaces 4910 may accept, communicate, and/or connect to a communications network 4913. Through a communications network 4913, the MDB controller is accessible through remote clients 4933b (e.g., computers with web browsers) by users 4933a. Network interfaces may employ connection protocols such as, but not limited to: direct connect, Ethernet (thick, thin, twisted pair 10/100/1000 Base T, and/or the like), Token Ring, wireless connection such as IEEE 802.11a-x, and/or the like. Should processing requirements dictate a greater amount speed and/or capacity, distributed network controllers (e.g., Distributed MDB), architectures may similarly be employed to pool, load balance, and/or otherwise increase the communicative bandwidth required by the MDB controller. A communications network may be any one and/or the combination of the following: a direct interconnection; the Internet; a Local Area Network (LAN); a Metropolitan Area Network (MAN); an Operating Missions as Nodes on the Internet (OMNI); a secured custom connection; a Wide Area Network (WAN); a wireless network (e.g., employing protocols such as, but not limited to a Wireless Application Protocol (WAP), I-mode, and/or the like); and/or the like. A network interface may be regarded as a specialized form of an input output interface. Further, multiple network interfaces 4910 may be used to engage with various communications network types 4913. For example, multiple network interfaces may be employed to allow for the communication over broadcast, multicast, and/or unicast networks.
Input Output interfaces (I/O) 4908 may accept, communicate, and/or connect to user input devices 4911, peripheral devices 4912, cryptographic processor devices 4928, and/or the like. I/O may employ connection protocols such as, but not limited to: audio: analog, digital, monaural, RCA, stereo, and/or the like; data: Apple Desktop Bus (ADB), IEEE 1394a-b, serial, universal serial bus (USB); infrared; joystick; keyboard; midi; optical; PC AT; PS/2; parallel; radio; video interface: Apple Desktop Connector (ADC), BNC, coaxial, component, composite, digital, Digital Visual Interface (DVI), high-definition multimedia interface (HDMI), RCA, RF antennae, S-Video, VGA, and/or the like; wireless transceivers: 802.11a/b/g/n/x; Bluetooth; cellular (e.g., code division multiple access (CDMA), high speed packet access (HSPA(+)), high-speed downlink packet access (HSDPA), global system for mobile communications (GSM), long term evolution (LTE), WiMax, etc.); and/or the like. One typical output device may include a video display, which typically comprises a Cathode Ray Tube (CRT) or Liquid Crystal Display (LCD) based monitor with an interface (e.g., DVI circuitry and cable) that accepts signals from a video interface, may be used. The video interface composites information generated by a computer systemization and generates video signals based on the composited information in a video memory frame. Another output device is a television set, which accepts signals from a video interface. Typically, the video interface provides the composited video information through a video connection interface that accepts a video display interface (e.g., an RCA composite video connector accepting an RCA composite video cable; a DVI connector accepting a DVI display cable, etc.).
User input devices 4911 often are a type of peripheral device 512 (see below) and may include: card readers, dongles, finger print readers, gloves, graphics tablets, joysticks, keyboards, microphones, mouse (mice), remote controls, retina readers, touch screens (e.g., capacitive, resistive, etc.), trackballs, trackpads, sensors (e.g., accelerometers, ambient light, GPS, gyroscopes, proximity, etc.), styluses, and/or the like.
Peripheral devices 4912 may be connected and/or communicate to I/O and/or other facilities of the like such as network interfaces, storage interfaces, directly to the interface bus, system bus, the CPU, and/or the like. Peripheral devices may be external, internal and/or part of the MDB controller. Peripheral devices may include: antenna, audio devices (e.g., line-in, line-out, microphone input, speakers, etc.), cameras (e.g., still, video, webcam, etc.), dongles (e.g., for copy protection, ensuring secure transactions with a digital signature, and/or the like), external processors (for added capabilities; e.g., crypto devices 528), force-feedback devices (e.g., vibrating motors), network interfaces, printers, scanners, storage devices, transceivers (e.g., cellular, GPS, etc.), video devices (e.g., goggles, monitors, etc.), video sources, visors, and/or the like. Peripheral devices often include types of input devices (e.g., cameras).
It should be noted that although user input devices and peripheral devices may be employed, the MDB controller may be embodied as an embedded, dedicated, and/or monitor-less (i.e., headless) device, wherein access would be provided over a network interface connection.
Cryptographic units such as, but not limited to, microcontrollers, processors 4926, interfaces 4927, and/or devices 4928 may be attached, and/or communicate with the MDB controller. A MC68HC16 microcontroller, manufactured by Motorola Inc., may be used for and/or within cryptographic units. The MC68HC16 microcontroller utilizes a 16-bit multiply-and-accumulate instruction in the 16 MHz configuration and requires less than one second to perform a 512-bit RSA private key operation. Cryptographic units support the authentication of communications from interacting agents, as well as allowing for anonymous transactions. Cryptographic units may also be configured as part of the CPU. Equivalent microcontrollers and/or processors may also be used. Other commercially available specialized cryptographic processors include: Broadcom's CryptoNetX and other Security Processors; nCipher's nShield; SafeNet's Luna PCI (e.g., 7100) series; Semaphore Communications' 40 MHz Roadrunner 184; Sun's Cryptographic Accelerators (e.g., Accelerator 6000 PCIe Board, Accelerator 500 Daughtercard); Via Nano Processor (e.g., L2100, L2200, U2400) line, which is capable of performing 500+MB/s of cryptographic instructions; VLSI Technology's 33 MHz 6868; and/or the like.
Generally, any mechanization and/or embodiment allowing a processor to affect the storage and/or retrieval of information is regarded as memory 4929. However, memory is a fungible technology and resource, thus, any number of memory embodiments may be employed in lieu of or in concert with one another. It is to be understood that the MDB controller and/or a computer systemization may employ various forms of memory 4929. For example, a computer systemization may be configured wherein the operation of on-chip CPU memory (e.g., registers), RAM, ROM, and any other storage devices are provided by a paper punch tape or paper punch card mechanism; however, such an embodiment would result in an extremely slow rate of operation. In a typical configuration, memory 4929 will include ROM 4906, RAM 4905, and a storage device 4914. A storage device 4914 may be any conventional computer system storage. Storage devices may include a drum; a (fixed and/or removable) magnetic disk drive; a magneto-optical drive; an optical drive (i.e., Blueray, CD ROM/RAM/Recordable (R)/ReWritable (RW), DVD R/RW, HD DVD R/RW etc.); an array of devices (e.g., Redundant Array of Independent Disks (RAID)); solid state memory devices (USB memory, solid state drives (SSD), etc.); other processor-readable storage mediums; and/or other devices of the like. Thus, a computer systemization generally requires and makes use of memory.
The memory 4929 may contain a collection of program and/or database components and/or data such as, but not limited to: operating system component(s) (operating system); information server component(s) 4916 (information server); user interface component(s) 4917 (user interface); Web browser component(s) 4918 (Web browser); database(s) 4919; mail server component(s) 4921; mail client component(s) 4922; cryptographic server component(s) 4920 (cryptographic server); the MDB component(s) 4935; and/or the like (i.e., collectively a component collection). These components may be stored and accessed from the storage devices and/or from storage devices accessible through an interface bus. Although non-conventional program components such as those in the component collection, typically, are stored in a local storage device 4914, they may also be loaded and/or stored in memory such as: peripheral devices, RAM, remote storage facilities through a communications network, ROM, various forms of memory, and/or the like.
The operating system component 4915 is an executable program component facilitating the operation of the MDB controller. Typically, the operating system facilitates access of I/O, network interfaces, peripheral devices, storage devices, and/or the like. The operating system may be a highly fault tolerant, scalable, and secure system such as: Apple Macintosh OS X (Server); AT&T Plan 9; Be OS; Unix and Unix-like system distributions (such as AT&T's UNIX; Berkley Software Distribution (BSD) variations such as FreeBSD, NetBSD, OpenBSD, and/or the like; Linux distributions such as Red Hat, Ubuntu, and/or the like); and/or the like operating systems. However, more limited and/or less secure operating systems also may be employed such as Apple Macintosh OS, IBM OS/2, Microsoft DOS, Microsoft Windows 2000/2003/3.1/95/98/CE/Millenium/NT/Vista/XP/Win 7 (Server), Palm OS, and/or the like. An operating system may communicate to and/or with other components in a component collection, including itself, and/or the like. Most frequently, the operating system communicates with other program components, user interfaces, and/or the like. For example, the operating system may contain, communicate, generate, obtain, and/or provide program component, system, user, and/or data communications, requests, and/or responses. The operating system, once executed by the CPU, may enable the interaction with communications networks, data, I/O, peripheral devices, program components, memory, user input devices, and/or the like. The operating system may provide communications protocols that allow the MDB controller to communicate with other entities through a communications network 4913. Various communication protocols may be used by the MDB controller as a subcarrier transport mechanism for interaction, such as, but not limited to: multicast, TCP/IP, UDP, unicast, and/or the like.
An information server component 4916 is a stored program component that is executed by a CPU. The information server may be a conventional Internet information server such as, but not limited to Apache Software Foundation's Apache, Microsoft's Internet Information Server, and/or the like. The information server may allow for the execution of program components through facilities such as Active Server Page (ASP), ActiveX, (ANSI) (Objective-) C (++), C# and/or .NET, Common Gateway Interface (CGI) scripts, dynamic (D) hypertext markup language (HTML), FLASH, Java, JavaScript, Practical Extraction Report Language (PERL), Hypertext Pre-Processor (PHP), pipes, Python, wireless application protocol (WAP), WebObjects, and/or the like. The information server may support secure communications protocols such as, but not limited to, File Transfer Protocol (FTP); HyperText Transfer Protocol (HTTP); Secure Hypertext Transfer Protocol (HTTPS), Secure Socket Layer (SSL), messaging protocols (e.g., America Online (AOL) Instant Messenger (AIM), Application Exchange (APEX), ICQ, Internet Relay Chat (IRC), Microsoft Network (MSN) Messenger Service, Presence and Instant Messaging Protocol (PRIM), Internet Engineering Task Force's (IETF's) Session Initiation Protocol (SIP), SIP for Instant Messaging and Presence Leveraging Extensions (SIMPLE), open XML-based Extensible Messaging and Presence Protocol (XMPP) (i.e., Jabber or Open Mobile Alliance's (OMA's) Instant Messaging and Presence Service (IMPS)), Yahoo! Instant Messenger Service, and/or the like. The information server provides results in the form of Web pages to Web browsers, and allows for the manipulated generation of the Web pages through interaction with other program components. After a Domain Name System (DNS) resolution portion of an HTTP request is resolved to a particular information server, the information server resolves requests for information at specified locations on the MDB controller based on the remainder of the HTTP request. For example, a request such as http://123.124.125.126/myInformation.html might have the IP portion of the request “123.124.125.126” resolved by a DNS server to an information server at that IP address; that information server might in turn further parse the http request for the “/myInformation.html” portion of the request and resolve it to a location in memory containing the information “myInformation.html.” Additionally, other information serving protocols may be employed across various ports, e.g., FTP communications across port 21, and/or the like. An information server may communicate to and/or with other components in a component collection, including itself, and/or facilities of the like. Most frequently, the information server communicates with the MDB database 4919, operating systems, other program components, user interfaces, Web browsers, and/or the like.
Access to the MDB database may be achieved through a number of database bridge mechanisms such as through scripting languages as enumerated below (e.g., CGI) and through inter-application communication channels as enumerated below (e.g., CORBA, WebObjects, etc.). Any data requests through a Web browser are parsed through the bridge mechanism into appropriate grammars as required by the MDB. In one embodiment, the information server would provide a Web form accessible by a Web browser. Entries made into supplied fields in the Web form are tagged as having been entered into the particular fields, and parsed as such. The entered terms are then passed along with the field tags, which act to instruct the parser to generate queries directed to appropriate tables and/or fields. In one embodiment, the parser may generate queries in standard SQL by instantiating a search string with the proper join/select commands based on the tagged text entries, wherein the resulting command is provided over the bridge mechanism to the MDB as a query. Upon generating query results from the query, the results are passed over the bridge mechanism, and may be parsed for formatting and generation of a new results Web page by the bridge mechanism. Such a new results Web page is then provided to the information server, which may supply it to the requesting Web browser.
Also, an information server may contain, communicate, generate, obtain, and/or provide program component, system, user, and/or data communications, requests, and/or responses.
Computer interfaces in some respects are similar to automobile operation interfaces. Automobile operation interface elements such as steering wheels, gearshifts, and speedometers facilitate the access, operation, and display of automobile resources, and status. Computer interaction interface elements such as check boxes, cursors, menus, scrollers, and windows (collectively and commonly referred to as widgets) similarly facilitate the access, capabilities, operation, and display of data and computer hardware and operating system resources, and status. Operation interfaces are commonly called user interfaces. Graphical user interfaces (GUIs) such as the Apple Macintosh Operating System's Aqua, IBM's OS/2, Microsoft's Windows 2000/2003/3.1/95/98/CE/Millenium/NT/XP/Vista/7 (i.e., Aero), Unix's X-Windows (e.g., which may include additional Unix graphic interface libraries and layers such as K Desktop Environment (KDE), mythTV and GNU Network Object Model Environment (GNOME)), web interface libraries (e.g., ActiveX, AJAX, (D)HTML, FLASH, Java, JavaScript, etc. interface libraries such as, but not limited to, Dojo, jQuery UI, MooTools, Prototype, script.aculo.us, SWFObject, Yahoo! User Interface, any of which may be used and provide a baseline and means of accessing and displaying information graphically to users.
A user interface component 4917 is a stored program component that is executed by a CPU. The user interface may be a conventional graphic user interface as provided by, with, and/or atop operating systems and/or operating environments such as already discussed. The user interface may allow for the display, execution, interaction, manipulation, and/or operation of program components and/or system facilities through textual and/or graphical facilities. The user interface provides a facility through which users may affect, interact, and/or operate a computer system. A user interface may communicate to and/or with other components in a component collection, including itself, and/or facilities of the like. Most frequently, the user interface communicates with operating systems, other program components, and/or the like. The user interface may contain, communicate, generate, obtain, and/or provide program component, system, user, and/or data communications, requests, and/or responses.
A Web browser component 4918 is a stored program component that is executed by a CPU. The Web browser may be a conventional hypertext viewing application such as Microsoft Internet Explorer or Netscape Navigator. Secure Web browsing may be supplied with 128 bit (or greater) encryption by way of HTTPS, SSL, and/or the like. Web browsers allowing for the execution of program components through facilities such as ActiveX, AJAX, (D)HTML, FLASH, Java, JavaScript, web browser plug-in APIs (e.g., Firefox, Safari Plug-in, and/or the like APIs), and/or the like. Web browsers and like information access tools may be integrated into PDAs, cellular telephones, and/or other mobile devices. A Web browser may communicate to and/or with other components in a component collection, including itself, and/or facilities of the like. Most frequently, the Web browser communicates with information servers, operating systems, integrated program components (e.g., plug-ins), and/or the like; e.g., it may contain, communicate, generate, obtain, and/or provide program component, system, user, and/or data communications, requests, and/or responses. Also, in place of a Web browser and information server, a combined application may be developed to perform similar operations of both. The combined application would similarly affect the obtaining and the provision of information to users, user agents, and/or the like from the MDB enabled nodes. The combined application may be nugatory on systems employing standard Web browsers.
A mail server component 4921 is a stored program component that is executed by a CPU 4903. The mail server may be a conventional Internet mail server such as, but not limited to sendmail, Microsoft Exchange, and/or the like. The mail server may allow for the execution of program components through facilities such as ASP, ActiveX, (ANSI) (Objective-) C (++), C# and/or .NET, CGI scripts, Java, JavaScript, PERL, PHP, pipes, Python, WebObjects, and/or the like. The mail server may support communications protocols such as, but not limited to: Internet message access protocol (IMAP), Messaging Application Programming Interface (MAPI)/Microsoft Exchange, post office protocol (POP S), simple mail transfer protocol (SMTP), and/or the like. The mail server can route, forward, and process incoming and outgoing mail messages that have been sent, relayed and/or otherwise traversing through and/or to the MDB.
Access to the MDB mail may be achieved through a number of APIs offered by the individual Web server components and/or the operating system.
Also, a mail server may contain, communicate, generate, obtain, and/or provide program component, system, user, and/or data communications, requests, information, and/or responses.
A mail client component 4922 is a stored program component that is executed by a CPU 4903. The mail client may be a conventional mail viewing application such as Apple Mail, Microsoft Entourage, Microsoft Outlook, Microsoft Outlook Express, Mozilla, Thunderbird, and/or the like. Mail clients may support a number of transfer protocols, such as: IMAP, Microsoft Exchange, POP S, SMTP, and/or the like. A mail client may communicate to and/or with other components in a component collection, including itself, and/or facilities of the like. Most frequently, the mail client communicates with mail servers, operating systems, other mail clients, and/or the like; e.g., it may contain, communicate, generate, obtain, and/or provide program component, system, user, and/or data communications, requests, information, and/or responses. Generally, the mail client provides a facility to compose and transmit electronic mail messages.
A cryptographic server component 4920 is a stored program component that is executed by a CPU 4903, cryptographic processor 4926, cryptographic processor interface 4927, cryptographic processor device 4928, and/or the like. Cryptographic processor interfaces will allow for expedition of encryption and/or decryption requests by the cryptographic component; however, the cryptographic component, alternatively, may run on a conventional CPU. The cryptographic component allows for the encryption and/or decryption of provided data. The cryptographic component allows for both symmetric and asymmetric (e.g., Pretty Good Protection (PGP)) encryption and/or decryption. The cryptographic component may employ cryptographic techniques such as, but not limited to: digital certificates (e.g., X.509 authentication framework), digital signatures, dual signatures, enveloping, password access protection, public key management, and/or the like. The cryptographic component will facilitate numerous (encryption and/or decryption) security protocols such as, but not limited to: checksum, Data Encryption Standard (DES), Elliptical Curve Encryption (ECC), International Data Encryption Algorithm (IDEA), Message Digest 5 (MD5, which is a one way hash operation), passwords, Rivest Cipher (RC5), Rijndael, RSA (which is an Internet encryption and authentication system that uses an algorithm developed in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman), Secure Hash Algorithm (SHA), Secure Socket Layer (SSL), Secure Hypertext Transfer Protocol (HTTPS), and/or the like. Employing such encryption security protocols, the MDB may encrypt all incoming and/or outgoing communications and may serve as node within a virtual private network (VPN) with a wider communications network. The cryptographic component facilitates the process of “security authorization” whereby access to a resource is inhibited by a security protocol wherein the cryptographic component effects authorized access to the secured resource. In addition, the cryptographic component may provide unique identifiers of content, e.g., employing and MD 5 hash to obtain a unique signature for an digital audio file. A cryptographic component may communicate to and/or with other components in a component collection, including itself, and/or facilities of the like. The cryptographic component supports encryption schemes allowing for the secure transmission of information across a communications network to enable the MDB component to engage in secure transactions if so desired. The cryptographic component facilitates the secure accessing of resources on the MDB and facilitates the access of secured resources on remote systems; i.e., it may act as a client and/or server of secured resources. Most frequently, the cryptographic component communicates with information servers, operating systems, other program components, and/or the like. The cryptographic component may contain, communicate, generate, obtain, and/or provide program component, system, user, and/or data communications, requests, and/or responses.
The MDB database component 4919 may be embodied in a database and its stored data. The database is a stored program component, which is executed by the CPU; the stored program component portion configuring the CPU to process the stored data. The database may be a conventional, fault tolerant, relational, scalable, secure database such as Oracle or Sybase. Relational databases are an extension of a flat file. Relational databases consist of a series of related tables. The tables are interconnected via a key field. Use of the key field allows the combination of the tables by indexing against the key field; i.e., the key fields act as dimensional pivot points for combining information from various tables. Relationships generally identify links maintained between tables by matching primary keys. Primary keys represent fields that uniquely identify the rows of a table in a relational database. More precisely, they uniquely identify rows of a table on the “one” side of a one-to-many relationship.
Alternatively, the MDB database may be implemented using various standard data-structures, such as an array, hash, (linked) list, struct, structured text file (e.g., XML), table, and/or the like. Such data-structures may be stored in memory and/or in (structured) files. In another alternative, an object-oriented database may be used, such as Frontier, ObjectStore, Poet, Zope, and/or the like. Object databases can include a number of object collections that are grouped and/or linked together by common attributes; they may be related to other object collections by some common attributes. Object-oriented databases perform similarly to relational databases with the exception that objects are not just pieces of data but may have other types of capabilities encapsulated within a given object. If the MDB database is implemented as a data-structure, the use of the MDB database 4919 may be integrated into another component such as the MDB component 4935. Also, the database may be implemented as a mix of data structures, objects, and relational structures. Databases may be consolidated and/or distributed in countless variations through standard data processing techniques. Portions of databases, e.g., tables, may be exported and/or imported and thus decentralized and/or integrated.
In one embodiment, the database component 4919 includes several tables 4919a-w. A Users table 4919a may include fields such as, but not limited to: user_id, ssn, dob, first_name, last_name, age, state, address_firstline, address_secondline, zipcode, devices_list, contact_info, contact_type, alt_contact_info, alt_contact_type, and/or the like. The Users table may support and/or track multiple entity accounts on a MDB. A Devices table 4919b may include fields such as, but not limited to: device_id, user_id, client_ip, client_type, client_model, operating_system, os_version, app_installed_flag, and/or the like. An Apps table 4919c may include fields such as, but not limited to: app_id, app_name, app_type, OS_compatibilities_list, version, timestamp, developer_id, and/or the like. An Accounts table 4919d may include fields such as, but not limited to: account_id, account_firstname, account_lastname, account_type, account_num, account_balance_list, billingaddress_line1, billingaddress_line2, billing_zipcode, billing_state, shipping_preferences, shippingaddress_line1, shippingaddress_line2, shipping_zipcode, shipping_state, and/or the like. A Merchants table 4919e may include fields such as, but not limited to: merchant_id, merchant_name, provi merchant_address, ip_address, mac_address, auth_key, port_num, security_settings_list, and/or the like. An Issuers table 4919f may include fields such as, but not limited to: issuer_id, issuer_name, issuer_address, ip_address, mac_address, auth_key, port_num, security_settings_list, and/or the like. An Acquirers table 4919g may include fields such as, but not limited to: acquirer_id, account_firstname, account_lastname, account_type, account_num, account_balance_list, billingaddress_line1, billingaddress_line2, billing_zipcode, billing_state, shipping_preferences, shippingaddress_line1, shippingaddress_line2, shipping_zipcode, shipping_state, and/or the like. A Gateways table 4919h may include fields such as, but not limited to: gateway_id, gateway_name, merchant_id, issuer_id, acquirer_id, user_id, and/or the like. A Transactions table 4919i may include fields such as, but not limited to: transaction_id, order_id, user_id, timestamp, transaction_cost, purchase_details_list, num_products, products_list, product_type, product_params_list, product_title, product_summary, quantity, user_id, client_id, client_ip, client_type, client_model, operating_system, os_version, app_installed_flag, user_id, account_firstname, account_lastname, account_type, account_num, billingaddress_line1, billingaddress_line2, billing_zipcode, billing_state, shipping_preferences, shippingaddress_line1, shippingaddress_line2, shipping_zipcode, shipping_state, merchant_id, merchant_name, merchant_auth_key, and/or the like. A Batches table 4919j may include fields such as, but not limited to: batch_id, parent_batch_id, transaction_id, account_id, user_id, app_id, batch_rules, and/or the like. A Ledgers table 4919k may include fields such as, but not limited to: ledger_id, transaction_id, user_id, merchant_id, issuer_id, acquirer_id, aggregation_id, ledger_name, ledger_value, and/or the like. A Products table 4919l may include fields such as, but not limited to: product_id, product_name, sku, price, inventory_level, stores_carrying, unit_of_measure, and/or the like. A Offers table 4919m may include fields such as, but not limited to: offer_id, merchant_id, offered_to_user_id, offer_type, offer_description, start_date, end_date, num_times_redeemed, and/or the like. A Behavior table 4919n may include fields such as, but not limited to: behavior_id, user_id, behavior_description, behavior_type, behavior_value, date_time_behavior, and/or the like. An Analytics table 4919o may include fields such as, but not limited to: analytics_id, batch_id, user_id, transaction_id, generated_graph, generated_results_set, generated_results_set json, input_data_set, date_time_generated, and/or the like. A Market Data table 4919p may include fields such as, but not limited to: market_data_id, index_name, index_value, last_updated_index_datetime, and/or the like. An Input Languages table 4919q may include fields such as, but not limited to: input_language_id, function_name, function_definition, parent_input_language_id, mesh_language_id, user_id, tumbler_id, aggregation_id, and/or the like. A Mesh Language table 4919r may include fields such as, but not limited to: mesh_language_id, operation_name, operation_min_test_case, operation_max_test_case, operation_custom_test_case, mesh_language_version, mesh_language_updated_date, and/or the like. A Tumblars table 4919s may include fields such as, but not limited to: tumbler_id, user_visible_model_commands, non_user_visible_model_commands, input_key, output_key, and/or the like. An Aggregation table 4919t may include fields such as, but not limited to: aggregation_id, aggregation_data_source, key, value, parent_aggregation_id, and/or the like. A Category table 4919u may include fields such as, but not limited to: category_id, mesh_id, user_id, category_name, category_type, entity_name, is_present_in_mesh, and/or the like. A Mesh table 4919v may include fields such as, but not limited to: mesh_id, mesh_node, mesh_node_value, mesh_edge, mesh_edge_value, mesh_link, mesh_link_value, attributes, tags, keywords, and/or the like. A Price Trends table 4919w may include fields such as, but not limited to: price_trends_id, merchant_id, date_price_observed, number_observations, observed_price, next_check_date, inventory_quantity, and/or the like.
In one embodiment, the MDB database may interact with other database systems. For example, employing a distributed database system, queries and data access by search MDB component may treat the combination of the MDB database, an integrated data security layer database as a single database entity.
In one embodiment, user programs may contain various user interface primitives, which may serve to update the MDB. Also, various accounts may require custom database tables depending upon the environments and the types of clients the MDB may need to serve. It should be noted that any unique fields may be designated as a key field throughout. In an alternative embodiment, these tables have been decentralized into their own databases and their respective database controllers (i.e., individual database controllers for each of the above tables). Employing standard data processing techniques, one may further distribute the databases over several computer systemizations and/or storage devices. Similarly, configurations of the decentralized database controllers may be varied by consolidating and/or distributing the various database components 4919a-w. The MDB may be configured to keep track of various settings, inputs, and parameters via database controllers.
The MDB database may communicate to and/or with other components in a component collection, including itself, and/or facilities of the like. Most frequently, the MDB database communicates with the MDB component, other program components, and/or the like. The database may contain, retain, and provide information regarding other nodes and data.
The MDB component 4935 is a stored program component that is executed by a CPU. In one embodiment, the MDB component incorporates any and/or all combinations of the aspects of the MDB that was discussed in the previous figures. As such, the MDB affects accessing, obtaining and the provision of information, services, transactions, and/or the like across various communications networks. The features and embodiments of the MDB discussed herein increase network efficiency by reducing data transfer requirements the use of more efficient data structures and mechanisms for their transfer and storage. As a consequence, more data may be transferred in less time, and latencies with regard to transactions, are also reduced. In many cases, such reduction in storage, transfer time, bandwidth requirements, latencies, etc., will reduce the capacity and structural infrastructure requirements to support the MDB's features and facilities, and in many cases reduce the costs, energy consumption/requirements, and extend the life of MDB's underlying infrastructure; this has the added benefit of making the MDB more reliable. The generation of the mesh graph and dictionary entries by the MDB has the technical effect of allowing more transaction, search, enrollment and email data to be analyzed and queried by the MDB user without a corresponding increase in data storage server/processing infrastructure. For example, by utilizing the aggregated data record normalization 306, data field recognition 307, entity type classification 308, cross-entity correlation 309, and entity attribute 310 components of the MDB, raw aggregated data may be stored in a more efficient manner and indexed and searched in a manner requiring less physical infrastructure and supporting faster querying with reduced latency (e.g., through the use of a distributed linking node mesh search component). Aspects of the MDB facilitate faster transaction processing by reducing consumer decision latency (e.g., through the provision of customized offers requiring decreased user input and therefore reduced data transfer requirements). Similarly, many of the features and mechanisms are designed to be easier for users to use and access, thereby broadening the audience that may enjoy/employ and exploit the feature sets of the MDB; such ease of use also helps to increase the reliability of the MDB. In addition, the feature sets include heightened security as noted via the Cryptographic components 4920, 4926, 4928 and throughout, making access to the features and data more reliable and secure.
The MDB component may transform data aggregated from various computer resources via MDB components into updated entity profiles and/or social graphs, and/or the like and use of the MDB. In one embodiment, the MDB component takes inputs such as aggregated data from various computer resources, and transforms the inputs via various components (e.g., SRA 4941, CTE 4942, TDA 4943 SDA 4944, VASE 4945, DFR 4946, ETC 4947, CEC 4948, EAA 4949, EPGU 4950, STG 4951, MA 4952, UBPA 4953, UPI 4954, TDN 4955, CTC 4956, TDF 4957, CDA 4958, ESA 4959, BAR 4960, AMS 4961, ADRN 4962, EXC 4963, CRA 4964, and/or the like), into outputs such as updated entity profiles and social graphs within the MDB.
The MDB component enabling access of information between nodes may be developed by employing standard development tools and languages such as, but not limited to: Apache components, Assembly, ActiveX, binary executables, (ANSI) (Objective-) C (++), C# and/or .NET, database adapters, CGI scripts, Java, JavaScript, mapping tools, procedural and object oriented development tools, PERL, PHP, Python, shell scripts, SQL commands, web application server extensions, web development environments and libraries (e.g., Microsoft's ActiveX; Adobe AIR, FLEX & FLASH; AJAX; (D)HTML; Dojo, Java; JavaScript; jQuery(UI); MooTools; Prototype; script.aculo.us; Simple Object Access Protocol (SOAP); SWFObject; Yahoo! User Interface; and/or the like), WebObjects, and/or the like. In one embodiment, the MDB server employs a cryptographic server to encrypt and decrypt communications. The MDB component may communicate to and/or with other components in a component collection, including itself, and/or facilities of the like. Most frequently, the MDB component communicates with the MDB database, operating systems, other program components, and/or the like. The MDB may contain, communicate, generate, obtain, and/or provide program component, system, user, and/or data communications, requests, and/or responses.
The structure and/or operation of any of the MDB node controller components may be combined, consolidated, and/or distributed in any number of ways to facilitate development and/or deployment. Similarly, the component collection may be combined in any number of ways to facilitate deployment and/or development. To accomplish this, one may integrate the components into a common code base or in a facility that can dynamically load the components on demand in an integrated fashion.
The component collection may be consolidated and/or distributed in countless variations through standard data processing and/or development techniques. Multiple instances of any one of the program components in the program component collection may be instantiated on a single node, and/or across numerous nodes to improve performance through load-balancing and/or data-processing techniques. Furthermore, single instances may also be distributed across multiple controllers and/or storage devices; e.g., databases. All program component instances and controllers working in concert may do so through standard data processing communication techniques.
The configuration of the MDB controller will depend on the context of system deployment. Factors such as, but not limited to, the budget, capacity, location, and/or use of the underlying hardware resources may affect deployment requirements and configuration. Regardless of if the configuration results in more consolidated and/or integrated program components, results in a more distributed series of program components, and/or results in some combination between a consolidated and distributed configuration, data may be communicated, obtained, and/or provided. Instances of components consolidated into a common code base from the program component collection may communicate, obtain, and/or provide data. This may be accomplished through intra-application data processing communication techniques such as, but not limited to: data referencing (e.g., pointers), internal messaging, object instance variable communication, shared memory space, variable passing, and/or the like.
If component collection components are discrete, separate, and/or external to one another, then communicating, obtaining, and/or providing data with and/or to other component components may be accomplished through inter-application data processing communication techniques such as, but not limited to: Application Program Interfaces (API) information passage; (distributed) Component Object Model ((D)COM), (Distributed) Object Linking and Embedding ((D)OLE), and/or the like), Common Object Request Broker Architecture (CORBA), Jini local and remote application program interfaces, JavaScript Object Notation (JSON), Remote Method Invocation (RMI), SOAP, process pipes, shared files, and/or the like. Messages sent between discrete component components for inter-application communication or within memory spaces of a singular component for intra-application communication may be facilitated through the creation and parsing of a grammar. A grammar may be developed by using development tools such as lex, yacc, XML, and/or the like, which allow for grammar generation and parsing capabilities, which in turn may form the basis of communication messages within and between components.
For example, a grammar may be arranged to recognize the tokens of an HTTP post command, e.g.:
where Value1 is discerned as being a parameter because “http://” is part of the grammar syntax, and what follows is considered part of the post value. Similarly, with such a grammar, a variable “Value1” may be inserted into an “http://” post command and then sent. The grammar syntax itself may be presented as structured data that is interpreted and/or otherwise used to generate the parsing mechanism (e.g., a syntax description text file as processed by lex, yacc, etc.). Also, once the parsing mechanism is generated and/or instantiated, it itself may process and/or parse structured data such as, but not limited to: character (e.g., tab) delineated text, HTML, structured text streams, XML, and/or the like structured data. In another embodiment, inter-application data processing protocols themselves may have integrated and/or readily available parsers (e.g., JSON, SOAP, and/or like parsers) that may be employed to parse (e.g., communications) data. Further, the parsing grammar may be used beyond message parsing, but may also be used to parse: databases, data collections, data stores, structured data, and/or the like. Again, the desired configuration will depend upon the context, environment, and requirements of system deployment.
For example, in some implementations, the MDB controller may be executing a PHP script implementing a Secure Sockets Layer (“SSL”) socket server via the information sherver, which listens to incoming communications on a server port to which a client may send data, e.g., data encoded in JSON format. Upon identifying an incoming communication, the PHP script may read the incoming message from the client device, parse the received JSON-encoded text data to extract information from the JSON-encoded text data into PHP script variables, and store the data (e.g., client identifying information, etc.) and/or extracted information in a relational database accessible using the Structured Query Language (“SQL”). An exemplary listing, written substantially in the form of PHP/SQL commands, to accept JSON-encoded input data from a client device via a SSL connection, parse the data to extract variables, and store the data to a database, is provided below:
Also, the following resources may be used to provide example embodiments regarding SOAP parser implementation:
and other parser implementations:
all of which are hereby expressly incorporated by reference.
Additional embodiments of the MDB may include:
Additional embodiments of the MDB may include:
Additional embodiments of the MDB may include:
Additional embodiments of the MDB may include:
In order to address various issues and advance the art, the entirety of this application for MDB (including the Cover Page, Title, Headings, Field, Background, Summary, Brief Description of the Drawings, Detailed Description, Claims, Abstract, Figures, Appendices, and otherwise) shows, by way of illustration, various embodiments in which the claimed innovations may be practiced. The advantages and features of the application are of a representative sample of embodiments only, and are not exhaustive and/or exclusive. They are presented only to assist in understanding and teach the claimed principles. It should be understood that they are not representative of all claimed innovations. As such, certain aspects of the disclosure have not been discussed herein. That alternate embodiments may not have been presented for a specific portion of the innovations or that further undescribed alternate embodiments may be available for a portion is not to be considered a disclaimer of those alternate embodiments. It will be appreciated that many of those undescribed embodiments incorporate the same principles of the innovations and others are equivalent. Thus, it is to be understood that other embodiments may be utilized and functional, logical, operational, organizational, structural and/or topological modifications may be made without departing from the scope and/or spirit of the disclosure. As such, all examples and/or embodiments are deemed to be non-limiting throughout this disclosure. Also, no inference should be drawn regarding those embodiments discussed herein relative to those not discussed herein other than it is as such for purposes of reducing space and repetition. For instance, it is to be understood that the logical and/or topological structure of any combination of any program components (a component collection), other components and/or any present feature sets as described in the figures and/or throughout are not limited to a fixed operating order and/or arrangement, but rather, any disclosed order is exemplary and all equivalents, regardless of order, are contemplated by the disclosure. Furthermore, it is to be understood that such features are not limited to serial execution, but rather, any number of threads, processes, services, servers, and/or the like that may execute asynchronously, concurrently, in parallel, simultaneously, synchronously, and/or the like are contemplated by the disclosure. As such, some of these features may be mutually contradictory, in that they cannot be simultaneously present in a single embodiment. Similarly, some features are applicable to one aspect of the innovations, and inapplicable to others. In addition, the disclosure includes other innovations not presently claimed. Applicant reserves all rights in those presently unclaimed innovations including the right to claim such innovations, file additional applications, continuations, continuations in part, divisions, and/or the like thereof. As such, it should be understood that advantages, embodiments, examples, functional, features, logical, operational, organizational, structural, topological, and/or other aspects of the disclosure are not to be considered limitations on the disclosure as defined by the claims or limitations on equivalents to the claims. It is to be understood that, depending on the particular needs and/or characteristics of a MDB individual and/or enterprise user, database configuration and/or relational model, data type, data transmission and/or network framework, syntax structure, and/or the like, various embodiments of the MDB, may be implemented that enable a great deal of flexibility and customization. For example, aspects of the MDB may be adapted for restaurant dining, online shopping, brick-and-mortar shopping, secured information processing, and/or the like. While various embodiments and discussions of the MDB have been directed to electronic purchase transactions, however, it is to be understood that the embodiments described herein may be readily configured and/or customized for a wide variety of other applications and/or implementations.
This application is a continuation application of U.S. patent application Ser. No. 13/758,833 filed Feb.4, 2013, which is a non-provisional of and claims priority under 35 USC §§ 119, 120 to: U.S. provisional patent application Ser. No. 61/594,063, filed Feb. 2, 2012, entitled “CENTRALIZED PERSONAL INFORMATION PLATFORM APPARATUSES, METHODS AND SYSTEMS,” and U.S. patent application Ser. No. 13/520,481, filed Jul. 3, 2012, entitled “Universal Electronic Payment Apparatuses, Methods and Systems”. U.S. patent application Ser. No. 13/758,833 also claims priority under 35 U.S.C. § 365, 371 to PCT application no. PCT/US13/24538, filed Feb. 2, 2013, entitled “MULTI-SOURCE, MULTI-DIMENSIONAL, CROSS-ENTITY, MULTIMEDIA DATABASE PLATFORM APPARATUSES, METHODS AND SYSTEMS”. The entire contents of the aforementioned application(s) are expressly incorporated by reference herein.
Number | Name | Date | Kind |
---|---|---|---|
789106 | Seymour | May 1905 | A |
4896363 | Taylor | Jan 1990 | A |
5177342 | Adams | Jan 1993 | A |
5221838 | Gutman | Jun 1993 | A |
5237164 | Takada | Aug 1993 | A |
5311594 | Penzias | May 1994 | A |
5384449 | Peirce | Jan 1995 | A |
5446890 | Renslo | Aug 1995 | A |
5459656 | Fields | Oct 1995 | A |
5500513 | Langhans | Mar 1996 | A |
5510777 | Pilc | Apr 1996 | A |
5521362 | Powers | May 1996 | A |
5526409 | Conrow | Jun 1996 | A |
5530438 | Bickham | Jun 1996 | A |
5536045 | Adams | Jul 1996 | A |
5590038 | Pitroda | Dec 1996 | A |
5613012 | Hoffman | Mar 1997 | A |
5615110 | Wong | Mar 1997 | A |
5615264 | Kazmierczak | Mar 1997 | A |
5621201 | Langhans | Apr 1997 | A |
5649118 | Carlisle | Jul 1997 | A |
5655007 | McAllister | Aug 1997 | A |
5748737 | Daggar | May 1998 | A |
5781438 | Lee | Jul 1998 | A |
5796832 | Kawan | Aug 1998 | A |
5815657 | Williams | Sep 1998 | A |
5850446 | Berger | Dec 1998 | A |
5878337 | Joao | Mar 1999 | A |
5883810 | Franklin | Mar 1999 | A |
5884271 | Pitroda | Mar 1999 | A |
5892838 | Brady | Apr 1999 | A |
5903830 | Joao | May 1999 | A |
5914472 | Foladare | Jun 1999 | A |
5943624 | Fox | Aug 1999 | A |
5953710 | Fleming | Sep 1999 | A |
5956699 | Wong | Sep 1999 | A |
5963924 | Williams | Oct 1999 | A |
6000832 | Franklin | Dec 1999 | A |
6006200 | Boies | Dec 1999 | A |
6014635 | Harris | Jan 2000 | A |
6044360 | Picciallo | Mar 2000 | A |
6052675 | Checchio | Apr 2000 | A |
6064990 | Goldsmith | May 2000 | A |
6092053 | Boesch | Jul 2000 | A |
6160903 | Hamid | Dec 2000 | A |
6163771 | Walker | Dec 2000 | A |
6182894 | Hackett | Feb 2001 | B1 |
6195447 | Ross | Feb 2001 | B1 |
6202052 | Miller | Mar 2001 | B1 |
6202933 | Poore | Mar 2001 | B1 |
6226624 | Watson | May 2001 | B1 |
6227447 | Campisano | May 2001 | B1 |
6236981 | Hill | May 2001 | B1 |
6263447 | French | Jul 2001 | B1 |
6267292 | Walker | Jul 2001 | B1 |
6327578 | Linehan | Dec 2001 | B1 |
6336099 | Barnett | Jan 2002 | B1 |
6339766 | Gephart | Jan 2002 | B1 |
6341724 | Campisano | Jan 2002 | B2 |
6381584 | Ogram | Apr 2002 | B1 |
6385596 | Wiser | May 2002 | B1 |
6385655 | Smith | May 2002 | B1 |
6422462 | Cohen | Jul 2002 | B1 |
6425523 | Shem-Ur | Jul 2002 | B1 |
6456984 | Demoff | Sep 2002 | B1 |
6473500 | Risafi | Oct 2002 | B1 |
6529725 | Joao | Mar 2003 | B1 |
6535855 | Cahill | Mar 2003 | B1 |
6560581 | Fox | May 2003 | B1 |
6592044 | Wong | Jul 2003 | B1 |
6601761 | Katis | Aug 2003 | B1 |
6636833 | Flitcroft | Oct 2003 | B1 |
6735572 | Landesmann | May 2004 | B2 |
6748367 | Lee | Jun 2004 | B1 |
6805287 | Bishop | Oct 2004 | B2 |
6853982 | Smith | Feb 2005 | B2 |
6857073 | French | Feb 2005 | B2 |
6865522 | Gastiger | Mar 2005 | B1 |
6873974 | Schutzer | Mar 2005 | B1 |
6879965 | Fung | Apr 2005 | B2 |
6891953 | DeMello | May 2005 | B1 |
6898598 | Himmel | May 2005 | B2 |
6901387 | Wells | May 2005 | B2 |
6925439 | Pitroda | Aug 2005 | B1 |
6931382 | Laage | Aug 2005 | B2 |
6934528 | Loureiro | Aug 2005 | B2 |
6938019 | Uzo | Aug 2005 | B1 |
6941285 | Sarcanin | Sep 2005 | B2 |
6944595 | Graser | Sep 2005 | B1 |
6980670 | Hoffman | Dec 2005 | B1 |
6990470 | Hogan | Jan 2006 | B2 |
6991157 | Bishop | Jan 2006 | B2 |
6999943 | Johnson | Feb 2006 | B1 |
7024383 | Mancini | Apr 2006 | B1 |
7028052 | Chapman | Apr 2006 | B2 |
7047041 | Vanska | May 2006 | B2 |
7051002 | Keresman, III | May 2006 | B2 |
7051929 | Li | May 2006 | B2 |
7069249 | Stolfo | Jun 2006 | B2 |
7089208 | Levchin | Aug 2006 | B1 |
7096003 | Joao | Aug 2006 | B2 |
7103576 | Mann | Sep 2006 | B2 |
7111789 | Rajasekaran | Sep 2006 | B2 |
7113930 | Eccles | Sep 2006 | B2 |
7117172 | Black | Oct 2006 | B1 |
7136835 | Flitcroft | Nov 2006 | B1 |
7155411 | Blinn | Dec 2006 | B1 |
7167903 | Percival | Jan 2007 | B2 |
7177835 | Walker | Feb 2007 | B1 |
7177848 | Hogan | Feb 2007 | B2 |
7180457 | Trott | Feb 2007 | B2 |
7194437 | Britto | Mar 2007 | B1 |
7206847 | Alberth | Apr 2007 | B1 |
7209561 | Shankar | Apr 2007 | B1 |
7212979 | Matz | May 2007 | B1 |
RE39736 | Morrill | Jul 2007 | E |
7264154 | Harris | Sep 2007 | B2 |
7266557 | Aschen | Sep 2007 | B2 |
7268667 | Beenau | Sep 2007 | B2 |
7268668 | Beenau | Sep 2007 | B2 |
7287692 | Patel | Oct 2007 | B1 |
7290704 | Ball | Nov 2007 | B1 |
7292999 | Hobson | Nov 2007 | B2 |
7313546 | Alarcon-Luther | Dec 2007 | B2 |
7318049 | Iannacci | Jan 2008 | B2 |
7337119 | Geschwender | Feb 2008 | B1 |
7337144 | Blinn | Feb 2008 | B1 |
7343149 | Benco | Mar 2008 | B2 |
7343351 | Bishop | Mar 2008 | B1 |
7349885 | Gangi | Mar 2008 | B2 |
7350230 | Forrest | Mar 2008 | B2 |
7353382 | Labrou | Apr 2008 | B2 |
7356505 | March | Apr 2008 | B2 |
7357310 | Calabrese | Apr 2008 | B2 |
7359880 | Abel | Apr 2008 | B2 |
7373669 | Eisen | May 2008 | B2 |
7379899 | Junger | May 2008 | B1 |
7379919 | Hogan | May 2008 | B2 |
7392222 | Hamilton | Jun 2008 | B1 |
RE40444 | Linehan | Jul 2008 | E |
7395242 | Blinn | Jul 2008 | B2 |
7398250 | Blinn | Jul 2008 | B2 |
7413113 | Zhu | Aug 2008 | B1 |
7415443 | Hobson | Aug 2008 | B2 |
7427021 | Kemper | Sep 2008 | B2 |
7444676 | Asghari-Kamrani | Oct 2008 | B1 |
7450966 | Vanska | Nov 2008 | B2 |
7469151 | Khan | Dec 2008 | B2 |
7477780 | Boncyk | Jan 2009 | B2 |
7499889 | Golan | Mar 2009 | B2 |
7500607 | Williams | Mar 2009 | B2 |
7505935 | Mendiola | Mar 2009 | B2 |
7533064 | Boesch | May 2009 | B1 |
7536318 | Wolfe | May 2009 | B1 |
7536335 | Weston | May 2009 | B1 |
7536360 | Stolfo | May 2009 | B2 |
7548889 | Bhambri | Jun 2009 | B2 |
7567934 | Flitcroft | Jul 2009 | B2 |
7567936 | Peckover | Jul 2009 | B1 |
7571139 | Giordano | Aug 2009 | B1 |
7571140 | Weichert | Aug 2009 | B2 |
7571142 | Flitcroft | Aug 2009 | B1 |
7580898 | Brown | Aug 2009 | B2 |
7584153 | Brown | Sep 2009 | B2 |
7593858 | Matz | Sep 2009 | B2 |
7593896 | Flitcroft | Sep 2009 | B1 |
7603311 | Yadav-ranjan | Oct 2009 | B1 |
7606560 | Labrou | Oct 2009 | B2 |
7627531 | Breck | Dec 2009 | B2 |
7627895 | Gifford | Dec 2009 | B2 |
7630937 | Mo | Dec 2009 | B1 |
7634295 | Hayaashi | Dec 2009 | B2 |
7644037 | Ostrovsky | Jan 2010 | B1 |
7644859 | Zhu | Jan 2010 | B1 |
7650314 | Saunders | Jan 2010 | B1 |
7660749 | Koski | Feb 2010 | B2 |
7668754 | Bridgelall | Feb 2010 | B1 |
7669760 | Zettner | Mar 2010 | B1 |
7676434 | Evans | Mar 2010 | B2 |
7685037 | Reiners | Mar 2010 | B2 |
7685067 | Britto | Mar 2010 | B1 |
7698221 | Blinn | Apr 2010 | B2 |
7702578 | Fung | Apr 2010 | B2 |
7707113 | Dimartino | Apr 2010 | B1 |
7707120 | Dominguez | Apr 2010 | B2 |
7708194 | Vawter | May 2010 | B2 |
7708198 | Gangi | May 2010 | B2 |
7712655 | Wong | May 2010 | B2 |
7712658 | Gangi | May 2010 | B2 |
7734527 | Uzo | Jun 2010 | B2 |
7739194 | Blinn | Jun 2010 | B2 |
7742984 | Mohsenzadeh | Jun 2010 | B2 |
7753265 | Harris | Jul 2010 | B2 |
7770789 | Oder | Aug 2010 | B2 |
7774076 | Skowronek | Aug 2010 | B2 |
7783569 | Abel | Aug 2010 | B2 |
7784684 | Labrou | Aug 2010 | B2 |
7784685 | Hopkins | Aug 2010 | B1 |
7793851 | Mullen | Sep 2010 | B2 |
7797215 | Zerenner | Sep 2010 | B1 |
7801826 | Labrou | Sep 2010 | B2 |
7801829 | Gray | Sep 2010 | B2 |
7802719 | Johnson | Sep 2010 | B2 |
7805376 | Smith | Sep 2010 | B2 |
7805378 | Berardi | Sep 2010 | B2 |
7810720 | Lovett | Oct 2010 | B2 |
7818264 | Hammad | Oct 2010 | B2 |
7819307 | Lyons | Oct 2010 | B2 |
7827288 | Da | Nov 2010 | B2 |
7828206 | Hessburg | Nov 2010 | B2 |
7828220 | Mullen | Nov 2010 | B2 |
7828992 | Kilickiran | Nov 2010 | B2 |
7835960 | Breck | Nov 2010 | B2 |
7837125 | Biskupski | Nov 2010 | B2 |
7841523 | Oder | Nov 2010 | B2 |
7841539 | Hewton | Nov 2010 | B2 |
7844530 | Ziade | Nov 2010 | B2 |
7844550 | Walker | Nov 2010 | B2 |
7848980 | Carlson | Dec 2010 | B2 |
7849014 | Erikson | Dec 2010 | B2 |
7849020 | Johnson | Dec 2010 | B2 |
7853529 | Walker | Dec 2010 | B1 |
7853995 | Chow | Dec 2010 | B2 |
7865414 | Fung | Jan 2011 | B2 |
7870027 | Tannenbaum | Jan 2011 | B1 |
7873579 | Hobson | Jan 2011 | B2 |
7873580 | Hobson | Jan 2011 | B2 |
7877299 | Bui | Jan 2011 | B2 |
7878400 | Harris | Feb 2011 | B2 |
7890370 | Whitsitt | Feb 2011 | B2 |
7890393 | Talbert | Feb 2011 | B2 |
7891563 | Oder | Feb 2011 | B2 |
7895119 | Praisner | Feb 2011 | B2 |
7896238 | Fein | Mar 2011 | B2 |
7899744 | Bishop | Mar 2011 | B2 |
7904360 | Evans | Mar 2011 | B2 |
7908216 | Davis | Mar 2011 | B1 |
7908227 | Zizzimopoulos | Mar 2011 | B2 |
7922082 | Muscato | Apr 2011 | B2 |
7926714 | Zhu | Apr 2011 | B1 |
7931195 | Mullen | Apr 2011 | B2 |
7933779 | Rooks | Apr 2011 | B2 |
7937324 | Patterson | May 2011 | B2 |
7938318 | Fein | May 2011 | B2 |
7942337 | Jain | May 2011 | B2 |
7954705 | Mullen | Jun 2011 | B2 |
7959076 | Hopkins | Jun 2011 | B1 |
7962418 | Wei | Jun 2011 | B1 |
7967196 | Bierbaum | Jun 2011 | B1 |
7971782 | Shams | Jul 2011 | B1 |
7996259 | Distefano, III | Aug 2011 | B1 |
7996288 | Stolfo | Aug 2011 | B1 |
8016192 | Messerges | Sep 2011 | B2 |
8020763 | Kowalchyk | Sep 2011 | B1 |
8024260 | Hogl | Sep 2011 | B1 |
8025223 | Saunders | Sep 2011 | B2 |
8028041 | Olliphant | Sep 2011 | B2 |
8032438 | Barton | Oct 2011 | B1 |
8041338 | Chen | Oct 2011 | B2 |
8046256 | Chien | Oct 2011 | B2 |
8050997 | Nosek | Nov 2011 | B1 |
8060413 | Castell | Nov 2011 | B2 |
8060448 | Jones | Nov 2011 | B2 |
8060449 | Zhu | Nov 2011 | B1 |
8074876 | Foss | Dec 2011 | B2 |
8074877 | Mullen | Dec 2011 | B2 |
8074879 | Harris | Dec 2011 | B2 |
8082210 | Hansen | Dec 2011 | B2 |
8090351 | Klein | Jan 2012 | B2 |
8095113 | Kean | Jan 2012 | B2 |
8104679 | Brown | Jan 2012 | B2 |
8108261 | Carlier | Jan 2012 | B2 |
RE43157 | Bishop | Feb 2012 | E |
8109436 | Hopkins | Feb 2012 | B1 |
8117127 | Sanders | Feb 2012 | B1 |
8121942 | Carlson | Feb 2012 | B2 |
8121956 | Carlson | Feb 2012 | B2 |
8126449 | Beenau | Feb 2012 | B2 |
8127982 | Casey | Mar 2012 | B1 |
8131666 | OBrien | Mar 2012 | B2 |
8140418 | Casey | Mar 2012 | B1 |
8145188 | Park | Mar 2012 | B2 |
8145561 | Zhu | Mar 2012 | B1 |
8145566 | Ahuja | Mar 2012 | B1 |
8145569 | Gong | Mar 2012 | B2 |
8145898 | Kamalakantha | Mar 2012 | B2 |
8150767 | Wankmueller | Apr 2012 | B2 |
8150772 | Mardikar | Apr 2012 | B2 |
8151328 | Lundy | Apr 2012 | B1 |
8151330 | Vishik | Apr 2012 | B2 |
8151336 | Savoor | Apr 2012 | B2 |
8155999 | De Boer | Apr 2012 | B2 |
8156000 | Thompson | Apr 2012 | B1 |
8156026 | Junger | Apr 2012 | B2 |
8156042 | Winkleman, III | Apr 2012 | B2 |
8156549 | Rice | Apr 2012 | B2 |
8157178 | Dewan | Apr 2012 | B2 |
8157181 | Bates | Apr 2012 | B2 |
8160935 | Bui | Apr 2012 | B2 |
8160959 | Rackley, III | Apr 2012 | B2 |
8165961 | Dimartino | Apr 2012 | B1 |
8166068 | Stevens | Apr 2012 | B2 |
RE43351 | Jordan | May 2012 | E |
8170921 | Stocker | May 2012 | B2 |
8171525 | Pelly | May 2012 | B1 |
8175235 | Mumford | May 2012 | B2 |
8175965 | Moore | May 2012 | B2 |
8175967 | OLeary | May 2012 | B2 |
8175968 | OLeary | May 2012 | B2 |
8175973 | Davis | May 2012 | B2 |
8175975 | Cai | May 2012 | B2 |
8175979 | Baentsch | May 2012 | B2 |
8176416 | Williams | May 2012 | B1 |
8179563 | King | May 2012 | B2 |
8180289 | Glickman | May 2012 | B1 |
8180705 | Kowalchyk | May 2012 | B2 |
8180804 | Narayanan | May 2012 | B1 |
8190513 | Felger | May 2012 | B2 |
8190523 | Patterson | May 2012 | B2 |
8191775 | Hildred | Jun 2012 | B2 |
8195233 | Morikuni | Jun 2012 | B2 |
8195544 | Horsfall | Jun 2012 | B2 |
8195547 | Aaltonen | Jun 2012 | B2 |
8195565 | Bishop | Jun 2012 | B2 |
8195576 | Grigg | Jun 2012 | B1 |
8196131 | Von Behren | Jun 2012 | B1 |
8196813 | Vadhri | Jun 2012 | B2 |
8200582 | Zhu | Jun 2012 | B1 |
8204774 | Chwast | Jun 2012 | B2 |
8204829 | Alvarez | Jun 2012 | B2 |
8205791 | Randazza | Jun 2012 | B2 |
8209245 | Dennes | Jun 2012 | B2 |
8209744 | Zhu | Jun 2012 | B2 |
8214288 | Olliphant | Jul 2012 | B2 |
8214289 | Scipioni | Jul 2012 | B2 |
8214291 | Pelegero | Jul 2012 | B2 |
8214292 | Duggal | Jul 2012 | B2 |
8214293 | Powell | Jul 2012 | B2 |
8214886 | Foley | Jul 2012 | B2 |
8215546 | Lin | Jul 2012 | B2 |
8219411 | Matz | Jul 2012 | B2 |
8219474 | Sutton | Jul 2012 | B2 |
8219489 | Patterson | Jul 2012 | B2 |
8219490 | Hammad | Jul 2012 | B2 |
8220047 | Soghoian | Jul 2012 | B1 |
8224702 | Mangerink | Jul 2012 | B2 |
8224754 | Pastusiak | Jul 2012 | B2 |
8224773 | Spiegel | Jul 2012 | B2 |
8225385 | Chow | Jul 2012 | B2 |
8225997 | Bierbaum | Jul 2012 | B1 |
8227936 | Folk | Jul 2012 | B1 |
8229354 | Sklovsky | Jul 2012 | B2 |
8229808 | Heit | Jul 2012 | B1 |
8229844 | Felger | Jul 2012 | B2 |
8229851 | Doran | Jul 2012 | B2 |
8229852 | Carlson | Jul 2012 | B2 |
8229854 | Stephen | Jul 2012 | B2 |
8233841 | Griffin | Jul 2012 | B2 |
8234183 | Smith | Jul 2012 | B2 |
8239276 | Lin | Aug 2012 | B2 |
8244580 | Mankoff | Aug 2012 | B2 |
8245139 | Michelman | Aug 2012 | B2 |
8249925 | Broms | Aug 2012 | B2 |
8249965 | Tumminaro | Aug 2012 | B2 |
8255278 | Young | Aug 2012 | B1 |
8255323 | Casey | Aug 2012 | B1 |
8255324 | Bercy | Aug 2012 | B2 |
8265993 | Chien | Sep 2012 | B2 |
8275704 | Bishop | Sep 2012 | B2 |
8280777 | Mengerink | Oct 2012 | B2 |
8281991 | Wentker | Oct 2012 | B2 |
8281998 | Tang | Oct 2012 | B2 |
8282002 | Shams | Oct 2012 | B2 |
8285640 | Scipioni | Oct 2012 | B2 |
8285820 | Olliphant | Oct 2012 | B2 |
8285832 | Schwab | Oct 2012 | B2 |
8286875 | Tang | Oct 2012 | B2 |
8290433 | Fisher | Oct 2012 | B2 |
8290819 | Bawcutt | Oct 2012 | B2 |
8290829 | Katz | Oct 2012 | B1 |
8295898 | Ashfield | Oct 2012 | B2 |
8296187 | Light | Oct 2012 | B2 |
8296204 | Templeton | Oct 2012 | B2 |
8296228 | Kloor | Oct 2012 | B1 |
8296231 | Britto | Oct 2012 | B2 |
8301500 | Pharris | Oct 2012 | B2 |
8301510 | Boesch | Oct 2012 | B2 |
8301556 | Hogl | Oct 2012 | B2 |
8311520 | Choi | Nov 2012 | B2 |
8312096 | Cohen | Nov 2012 | B2 |
8321267 | Hoerenz | Nov 2012 | B2 |
8321294 | Carlier | Nov 2012 | B2 |
8321315 | Abel | Nov 2012 | B2 |
8321338 | Baumgart | Nov 2012 | B2 |
8321343 | Ramavarjula | Nov 2012 | B2 |
8321364 | Gharpure | Nov 2012 | B1 |
8326756 | Egendorf | Dec 2012 | B2 |
8326769 | Weisman | Dec 2012 | B1 |
8326770 | Weisman | Dec 2012 | B1 |
8327450 | Clement | Dec 2012 | B2 |
8328095 | Oder | Dec 2012 | B2 |
8332272 | Fisher | Dec 2012 | B2 |
8332275 | Poon | Dec 2012 | B2 |
8332323 | Stals | Dec 2012 | B2 |
8335720 | Juang | Dec 2012 | B2 |
8335726 | Ling | Dec 2012 | B1 |
8335822 | Ahmed | Dec 2012 | B2 |
8335921 | Von Behren | Dec 2012 | B2 |
8335932 | Von Behren | Dec 2012 | B2 |
8336088 | Raj | Dec 2012 | B2 |
8340666 | Ramer | Dec 2012 | B2 |
8341029 | Ramalingam | Dec 2012 | B1 |
8346643 | Boyer | Jan 2013 | B2 |
8346659 | Mohsenzadeh | Jan 2013 | B1 |
8346663 | Kawan | Jan 2013 | B2 |
8346666 | Lindelsee | Jan 2013 | B2 |
8352323 | Fisher | Jan 2013 | B2 |
8352362 | Mohsenzadeh | Jan 2013 | B2 |
8352499 | Bharat | Jan 2013 | B2 |
8352749 | Von Behren | Jan 2013 | B2 |
8355987 | Hirson | Jan 2013 | B2 |
8359070 | Zhu | Jan 2013 | B1 |
8364587 | Nuzum | Jan 2013 | B2 |
8364590 | Casey | Jan 2013 | B1 |
8370264 | Wei | Feb 2013 | B1 |
8376225 | Hopkins | Feb 2013 | B1 |
8380177 | Laracey | Feb 2013 | B2 |
8380349 | Hickman | Feb 2013 | B1 |
8386078 | Hickman | Feb 2013 | B1 |
8387873 | Saunders | Mar 2013 | B2 |
8396750 | Hariharan | Mar 2013 | B1 |
8396810 | Cook | Mar 2013 | B1 |
8401539 | Beenau | Mar 2013 | B2 |
8401898 | Chien | Mar 2013 | B2 |
8401904 | Simakov | Mar 2013 | B1 |
8402555 | Grecia | Mar 2013 | B2 |
8403211 | Brooks | Mar 2013 | B2 |
8412586 | Foulser | Apr 2013 | B1 |
8412623 | Moon | Apr 2013 | B2 |
8412630 | Ross | Apr 2013 | B2 |
8412837 | Emigh | Apr 2013 | B1 |
8417633 | Chmara | Apr 2013 | B1 |
8417642 | Oren | Apr 2013 | B2 |
8423462 | Amacker | Apr 2013 | B1 |
8429521 | Lloyd | Apr 2013 | B2 |
8437633 | Chmara | Apr 2013 | B2 |
8447699 | Batada | May 2013 | B2 |
8453223 | Svigals | May 2013 | B2 |
8453925 | Fisher | Jun 2013 | B2 |
8458487 | Palgon | Jun 2013 | B1 |
8484134 | Hobson | Jul 2013 | B2 |
8485437 | Mullen | Jul 2013 | B2 |
8494959 | Hathaway | Jul 2013 | B2 |
8498908 | Mengerink | Jul 2013 | B2 |
8504475 | Brand | Aug 2013 | B2 |
8504478 | Saunders | Aug 2013 | B2 |
8510816 | Quach | Aug 2013 | B2 |
8433116 | Davis | Sep 2013 | B2 |
8533860 | Grecia | Sep 2013 | B1 |
8538845 | Liberty | Sep 2013 | B2 |
8555079 | Shablygin | Oct 2013 | B2 |
8566168 | Bierbaum | Oct 2013 | B1 |
8567670 | Stanfield | Oct 2013 | B2 |
8571939 | Lindsey | Oct 2013 | B2 |
8577336 | Mechaley | Nov 2013 | B2 |
8577803 | Chatterjee | Nov 2013 | B2 |
8577813 | Weiss | Nov 2013 | B2 |
8578176 | Mattsson | Nov 2013 | B2 |
8583494 | Fisher | Nov 2013 | B2 |
8584251 | McGuire | Nov 2013 | B2 |
8589237 | Fisher | Nov 2013 | B2 |
8589271 | Evans | Nov 2013 | B2 |
8589291 | Carlson | Nov 2013 | B2 |
8595098 | Starai | Nov 2013 | B2 |
8595812 | Bomar | Nov 2013 | B2 |
8595850 | Spies | Nov 2013 | B2 |
8606638 | Dragt | Dec 2013 | B2 |
8606700 | Carlson | Dec 2013 | B2 |
8606720 | Baker | Dec 2013 | B1 |
8615468 | Varadarajan | Dec 2013 | B2 |
8620754 | Fisher | Dec 2013 | B2 |
8635157 | Smith | Jan 2014 | B2 |
8639621 | Ellis | Jan 2014 | B1 |
8646059 | von Behren | Feb 2014 | B1 |
8651374 | Brabson | Feb 2014 | B2 |
8656180 | Shablygin | Feb 2014 | B2 |
8739016 | Goldman | May 2014 | B1 |
8751391 | Freund | Jun 2014 | B2 |
8762263 | Gauthier | Jun 2014 | B2 |
8793186 | Patterson | Jul 2014 | B2 |
8838982 | Carlson | Sep 2014 | B2 |
8856539 | Weiss | Oct 2014 | B2 |
8887308 | Grecia | Nov 2014 | B2 |
9065643 | Hurry | Jun 2015 | B2 |
9070129 | Sheets | Jun 2015 | B2 |
9082119 | Ortiz | Jul 2015 | B2 |
9100826 | Weiss | Aug 2015 | B2 |
9105050 | Tietzen | Aug 2015 | B2 |
9160741 | Wentker | Oct 2015 | B2 |
9195750 | Hayden | Nov 2015 | B2 |
9229964 | Stevelinck | Jan 2016 | B2 |
9245267 | Singh | Jan 2016 | B2 |
9249241 | Dai | Feb 2016 | B2 |
9256871 | Anderson | Feb 2016 | B2 |
9280765 | Hammad | Mar 2016 | B2 |
9307342 | Sojoodi | Apr 2016 | B2 |
9355393 | Purves | May 2016 | B2 |
9448972 | Greenberg | Sep 2016 | B2 |
9524089 | Ghosh | Dec 2016 | B1 |
9530137 | Weiss | Dec 2016 | B2 |
9582598 | Kalgi | Feb 2017 | B2 |
9626351 | Davis | Apr 2017 | B2 |
9710807 | Theurer | Jul 2017 | B2 |
9772987 | Davis | Sep 2017 | B2 |
9804834 | Lopyrev | Oct 2017 | B1 |
9904537 | Lopyrev | Feb 2018 | B2 |
20010037297 | McNair | Mar 2001 | A1 |
20010029485 | Brody | Oct 2001 | A1 |
20010034720 | Armes | Oct 2001 | A1 |
20010054003 | Chien | Dec 2001 | A1 |
20010056359 | Abreu | Dec 2001 | A1 |
20010056409 | Bellovin | Dec 2001 | A1 |
20020002522 | Clift | Jan 2002 | A1 |
20020004783 | Paltenghe | Jan 2002 | A1 |
20020007320 | Hogan | Jan 2002 | A1 |
20020016749 | Borecki | Feb 2002 | A1 |
20020026575 | Wheeler | Feb 2002 | A1 |
20020029193 | Ranjan | Mar 2002 | A1 |
20020035548 | Hogan | Mar 2002 | A1 |
20020040325 | Takae | Apr 2002 | A1 |
20020052778 | Murphy | May 2002 | A1 |
20020073045 | Rubin | Jun 2002 | A1 |
20020077976 | Meyer | Jun 2002 | A1 |
20020077978 | OLeary | Jun 2002 | A1 |
20020087894 | Foley | Jul 2002 | A1 |
20020099642 | Schwankl | Jul 2002 | A1 |
20020099647 | Howorka | Jul 2002 | A1 |
20020099656 | Poh Wong | Jul 2002 | A1 |
20020107755 | Steed | Aug 2002 | A1 |
20020111919 | Weller | Aug 2002 | A1 |
20020112014 | Bennett | Aug 2002 | A1 |
20020116271 | Mankoff | Aug 2002 | A1 |
20020116341 | Hogan | Aug 2002 | A1 |
20020120864 | Wu | Aug 2002 | A1 |
20020133467 | Hobson | Sep 2002 | A1 |
20020138290 | Metcalfe | Sep 2002 | A1 |
20020138445 | Laage | Sep 2002 | A1 |
20020141575 | Hird | Oct 2002 | A1 |
20020143614 | MacLean | Oct 2002 | A1 |
20020147913 | Lun Yip | Oct 2002 | A1 |
20020174030 | Praisner | Nov 2002 | A1 |
20020178370 | Gurevich | Nov 2002 | A1 |
20020194081 | Perkowski | Dec 2002 | A1 |
20030014307 | Heng | Jan 2003 | A1 |
20030018524 | Fishman | Jan 2003 | A1 |
20030026404 | Joyce | Feb 2003 | A1 |
20030028451 | Ananian | Feb 2003 | A1 |
20030028481 | Flitcroft | Feb 2003 | A1 |
20030055785 | Lahiri | Mar 2003 | A1 |
20030080185 | Werther | May 2003 | A1 |
20030097318 | Yu | May 2003 | A1 |
20030101134 | Liu | May 2003 | A1 |
20030126076 | Kwok | Jul 2003 | A1 |
20030130955 | Hawthorne | Jul 2003 | A1 |
20030144935 | Sobek | Jul 2003 | A1 |
20030174823 | Justice | Sep 2003 | A1 |
20030177361 | Wheeler | Sep 2003 | A1 |
20030179230 | Seidman | Sep 2003 | A1 |
20030191709 | Elston | Oct 2003 | A1 |
20030191711 | Jamison | Oct 2003 | A1 |
20030191945 | Keech | Oct 2003 | A1 |
20030195659 | Kasuga | Oct 2003 | A1 |
20030200142 | Hicks | Oct 2003 | A1 |
20030200184 | Dominguez | Oct 2003 | A1 |
20030212589 | Kish | Nov 2003 | A1 |
20030212642 | Weller | Nov 2003 | A1 |
20030216996 | Cummings | Nov 2003 | A1 |
20030220835 | Barnes | Nov 2003 | A1 |
20040010462 | Moon | Jan 2004 | A1 |
20040050928 | Bishop | Mar 2004 | A1 |
20040059682 | Hasumi | Mar 2004 | A1 |
20040068443 | Hopson | Apr 2004 | A1 |
20040078332 | Ferguson | Apr 2004 | A1 |
20040093281 | Silverstein | May 2004 | A1 |
20040103037 | Wetmore | May 2004 | A1 |
20040111698 | Soong | Jun 2004 | A1 |
20040128197 | Bam | Jul 2004 | A1 |
20040138999 | Friedman | Jul 2004 | A1 |
20040139008 | Mascavage | Jul 2004 | A1 |
20040143532 | Lee | Jul 2004 | A1 |
20040148255 | Beck | Jul 2004 | A1 |
20040158532 | Breck | Aug 2004 | A1 |
20040204128 | Zakharia | Oct 2004 | A1 |
20040210449 | Breck | Oct 2004 | A1 |
20040210498 | Freund | Oct 2004 | A1 |
20040215560 | Amalraj | Oct 2004 | A1 |
20040215963 | Kaplan | Oct 2004 | A1 |
20040230536 | Fung | Nov 2004 | A1 |
20040232225 | Bishop | Nov 2004 | A1 |
20040236646 | Wu | Nov 2004 | A1 |
20040254891 | Blinn | Dec 2004 | A1 |
20040260646 | Berardi | Dec 2004 | A1 |
20040267608 | Mansfield | Dec 2004 | A1 |
20040267655 | Davidowitz | Dec 2004 | A1 |
20040267878 | Osias | Dec 2004 | A1 |
20050010483 | Ling | Jan 2005 | A1 |
20050037735 | Courts | Feb 2005 | A1 |
20050038724 | Roever | Feb 2005 | A1 |
20050065819 | Pamela | Mar 2005 | A1 |
20050080730 | Sorrentino | Apr 2005 | A1 |
20050080747 | Anderson | Apr 2005 | A1 |
20050080821 | Breil | Apr 2005 | A1 |
20050097320 | Golan | May 2005 | A1 |
20050101309 | Croome | May 2005 | A1 |
20050102188 | Hutchison | May 2005 | A1 |
20050108178 | York | May 2005 | A1 |
20050137969 | Shah | Jun 2005 | A1 |
20050144082 | Coolman | Jun 2005 | A1 |
20050171894 | Traynor | Aug 2005 | A1 |
20050171898 | Bishop | Aug 2005 | A1 |
20050184145 | Law | Aug 2005 | A1 |
20050187873 | Labrou | Aug 2005 | A1 |
20050192893 | Keeling | Sep 2005 | A1 |
20050192895 | Rogers | Sep 2005 | A1 |
20050199709 | Linlor | Sep 2005 | A1 |
20050220326 | Sim | Oct 2005 | A1 |
20050234817 | VanFleet | Oct 2005 | A1 |
20050246278 | Gerber | Nov 2005 | A1 |
20050246293 | Ong | Nov 2005 | A1 |
20050251446 | Jiang | Nov 2005 | A1 |
20050254714 | Anne | Nov 2005 | A1 |
20050256802 | Ammermann | Nov 2005 | A1 |
20050261967 | Barry | Nov 2005 | A1 |
20050269401 | Spitzer | Dec 2005 | A1 |
20050269402 | Spitzer | Dec 2005 | A1 |
20050273462 | Reed | Dec 2005 | A1 |
20060002607 | Boncyk | Jan 2006 | A1 |
20060020542 | Litle | Jan 2006 | A1 |
20060053056 | Alspach-goss | Mar 2006 | A1 |
20060059277 | Zito | Mar 2006 | A1 |
20060069619 | Walker | Mar 2006 | A1 |
20060075235 | Renkis | Apr 2006 | A1 |
20060085328 | Cohen | Apr 2006 | A1 |
20060085477 | Phillips | Apr 2006 | A1 |
20060124729 | Martin | Jun 2006 | A1 |
20060129427 | Wennberg | Jun 2006 | A1 |
20060163349 | Neugebauer | Jul 2006 | A1 |
20060178918 | Mikurak | Aug 2006 | A1 |
20060178986 | Giordano | Aug 2006 | A1 |
20060178994 | Stolfo | Aug 2006 | A1 |
20060190347 | Cuervo | Aug 2006 | A1 |
20060195598 | Fujita | Aug 2006 | A1 |
20060208060 | Mendelovich | Sep 2006 | A1 |
20060212434 | Crawford | Sep 2006 | A1 |
20060226216 | Keithley | Oct 2006 | A1 |
20060235795 | Johnson | Oct 2006 | A1 |
20060237528 | Bishop | Oct 2006 | A1 |
20060247982 | Stolfo | Nov 2006 | A1 |
20060277143 | Almonte | Dec 2006 | A1 |
20060278704 | Saunders | Dec 2006 | A1 |
20060282332 | Pfleging | Dec 2006 | A1 |
20060293947 | Nicholson | Dec 2006 | A1 |
20070011025 | Cracchiolo | Jan 2007 | A1 |
20070016523 | Blair | Jan 2007 | A1 |
20070022007 | Lawe | Jan 2007 | A1 |
20070038515 | Postrel | Feb 2007 | A1 |
20070038516 | Apple | Feb 2007 | A1 |
20070055571 | Fox | Mar 2007 | A1 |
20070067215 | Agarwal | Mar 2007 | A1 |
20070087820 | Van | Apr 2007 | A1 |
20070094066 | Kumar | Apr 2007 | A1 |
20070100691 | Patterson | May 2007 | A1 |
20070100728 | Rotman | May 2007 | A1 |
20070106504 | Deng | May 2007 | A1 |
20070106607 | Seib | May 2007 | A1 |
20070106627 | Srivastava | May 2007 | A1 |
20070107044 | Yuen | May 2007 | A1 |
20070113289 | Blumenau | May 2007 | A1 |
20070125840 | Law | Jun 2007 | A1 |
20070129955 | Dalmia | Jun 2007 | A1 |
20070136193 | Starr | Jun 2007 | A1 |
20070136211 | Brown | Jun 2007 | A1 |
20070143204 | Claus | Jun 2007 | A1 |
20070150413 | Morgenstern | Jun 2007 | A1 |
20070156726 | Levy | Jul 2007 | A1 |
20070170247 | Friedman | Jul 2007 | A1 |
20070179885 | Bird | Aug 2007 | A1 |
20070180119 | Khivesara | Aug 2007 | A1 |
20070198435 | Siegal | Aug 2007 | A1 |
20070198587 | Kobayasfii | Aug 2007 | A1 |
20070208662 | Jeronimus | Sep 2007 | A1 |
20070208671 | Brown | Sep 2007 | A1 |
20070214078 | Coppinger | Sep 2007 | A1 |
20070214250 | Ahmed | Sep 2007 | A1 |
20070226152 | Jones | Sep 2007 | A1 |
20070233590 | Hardison | Oct 2007 | A1 |
20070233615 | Tumminaro | Oct 2007 | A1 |
20070239502 | Babu | Oct 2007 | A1 |
20070245414 | Chan | Oct 2007 | A1 |
20070276765 | Hazel | Nov 2007 | A1 |
20070288377 | Shaked | Dec 2007 | A1 |
20070291995 | Rivera | Dec 2007 | A1 |
20080004116 | Van | Jan 2008 | A1 |
20080004952 | Koli | Jan 2008 | A1 |
20080010096 | Patterson | Jan 2008 | A1 |
20080013335 | Tsutsumi | Jan 2008 | A1 |
20080015988 | Brown | Jan 2008 | A1 |
20080021829 | Kranzley | Jan 2008 | A1 |
20080027218 | Daugs | Jan 2008 | A1 |
20080027850 | Brittan | Jan 2008 | A1 |
20080029607 | Mullen | Feb 2008 | A1 |
20080035738 | Mullen | Feb 2008 | A1 |
20080048022 | Vawter | Feb 2008 | A1 |
20080052226 | Agarwal | Feb 2008 | A1 |
20080054068 | Mullen | Mar 2008 | A1 |
20080054079 | Mullen | Mar 2008 | A1 |
20080054081 | Mullen | Mar 2008 | A1 |
20080059370 | Sada | Mar 2008 | A1 |
20080065554 | Hogan | Mar 2008 | A1 |
20080065555 | Mullen | Mar 2008 | A1 |
20080077489 | Gilley | Mar 2008 | A1 |
20080086365 | Zollino | Apr 2008 | A1 |
20080090513 | Collins | Apr 2008 | A1 |
20080091553 | Koski | Apr 2008 | A1 |
20080091616 | Helwin | Apr 2008 | A1 |
20080097856 | Blagg | Apr 2008 | A1 |
20080103795 | Jakubowski | May 2008 | A1 |
20080114639 | Meek | May 2008 | A1 |
20080114737 | Neely | May 2008 | A1 |
20080126145 | Racklet, III | May 2008 | A1 |
20080133351 | White | Jun 2008 | A1 |
20080140568 | Henry | Jun 2008 | A1 |
20080140684 | OReilly | Jun 2008 | A1 |
20080147883 | Philyaw | Jun 2008 | A1 |
20080154623 | Derker | Jun 2008 | A1 |
20080162361 | Sklovsky | Jul 2008 | A1 |
20080167965 | Von | Jul 2008 | A1 |
20080172274 | Hurowitz | Jul 2008 | A1 |
20080172331 | Graves | Jul 2008 | A1 |
20080177574 | Marcos | Jul 2008 | A1 |
20080177672 | Brunner | Jul 2008 | A1 |
20080201232 | Walker | Aug 2008 | A1 |
20080201264 | Brown | Aug 2008 | A1 |
20080201265 | Hewton | Aug 2008 | A1 |
20080221945 | Pace | Sep 2008 | A1 |
20080223918 | Williams | Sep 2008 | A1 |
20080228646 | Myers | Sep 2008 | A1 |
20080235261 | Malek | Sep 2008 | A1 |
20080024561 | Fein | Oct 2008 | A1 |
20080243305 | Lee | Oct 2008 | A1 |
20080243702 | Hart | Oct 2008 | A1 |
20080245855 | Fein | Oct 2008 | A1 |
20080245861 | Fein | Oct 2008 | A1 |
20080270300 | Jones | Oct 2008 | A1 |
20080272188 | Keithley | Nov 2008 | A1 |
20080283591 | Oder | Nov 2008 | A1 |
20080288376 | Panthaki | Nov 2008 | A1 |
20080288889 | Hunt | Nov 2008 | A1 |
20080300980 | Benjamin | Dec 2008 | A1 |
20080301055 | Borgs | Dec 2008 | A1 |
20080302869 | Mullen | Dec 2008 | A1 |
20080302876 | Mullen | Dec 2008 | A1 |
20080313264 | Pestoni | Dec 2008 | A1 |
20080319905 | Carlson | Dec 2008 | A1 |
20090006181 | Ghosh | Jan 2009 | A1 |
20090006262 | Brown | Jan 2009 | A1 |
20090010488 | Matsuoka | Jan 2009 | A1 |
20090013266 | Gandhi | Jan 2009 | A1 |
20090018895 | Weinblatt | Jan 2009 | A1 |
20090024527 | Sellen | Jan 2009 | A1 |
20090024636 | Shiloh | Jan 2009 | A1 |
20090037255 | Chiu | Feb 2009 | A1 |
20090037326 | Chitti | Feb 2009 | A1 |
20090037333 | Flitcroft | Feb 2009 | A1 |
20090037388 | Cooper | Feb 2009 | A1 |
20090043702 | Bennett | Feb 2009 | A1 |
20090048934 | Haddad | Feb 2009 | A1 |
20090048971 | Hathaway | Feb 2009 | A1 |
20090061884 | Rajan | Mar 2009 | A1 |
20090063261 | Scribner | Mar 2009 | A1 |
20090064056 | Anderson | Mar 2009 | A1 |
20090076953 | Saville | Mar 2009 | A1 |
20090076966 | Bishop | Mar 2009 | A1 |
20090083065 | Unland | Mar 2009 | A1 |
20090089176 | Mccabe | Apr 2009 | A1 |
20090089193 | Paintin | Apr 2009 | A1 |
20090104888 | Cox | Apr 2009 | A1 |
20090106112 | Dalmia | Apr 2009 | A1 |
20090106151 | Nelsen | Apr 2009 | A1 |
20090106160 | Skowronek | Apr 2009 | A1 |
20090108080 | Meyer | Apr 2009 | A1 |
20090112775 | Chiulli | Apr 2009 | A1 |
20090119176 | Johnson | May 2009 | A1 |
20090119190 | Realini | May 2009 | A1 |
20090119211 | Johnson | May 2009 | A1 |
20090125429 | Takayama | May 2009 | A1 |
20090132347 | Anderson | May 2009 | A1 |
20090132366 | Lam | May 2009 | A1 |
20090132395 | Lam | May 2009 | A1 |
20090134217 | Flitcroft | May 2009 | A1 |
20090144104 | Johnson | Jun 2009 | A1 |
20090144201 | Gierkink | Jun 2009 | A1 |
20090157555 | Biffle | Jun 2009 | A1 |
20090159673 | Mullen | Jun 2009 | A1 |
20090159700 | Mullen | Jun 2009 | A1 |
20090159707 | Mullen | Jun 2009 | A1 |
20090164344 | Shiftan | Jun 2009 | A1 |
20090170608 | Herrmann | Jul 2009 | A1 |
20090171778 | Powell | Jul 2009 | A1 |
20090173782 | Muscato | Jul 2009 | A1 |
20090182664 | Trombley | Jul 2009 | A1 |
20090187492 | Hammad | Jul 2009 | A1 |
20090200371 | Kean | Aug 2009 | A1 |
20090210300 | Cansler | Aug 2009 | A1 |
20090216910 | Duchesneau | Aug 2009 | A1 |
20090222347 | Whitten | Sep 2009 | A1 |
20090228211 | Rasanen | Sep 2009 | A1 |
20090233579 | Castell | Sep 2009 | A1 |
20090234751 | Chan | Sep 2009 | A1 |
20090240620 | Kendrick | Sep 2009 | A1 |
20090241159 | Campagna | Sep 2009 | A1 |
20090248583 | Chhabra | Oct 2009 | A1 |
20090248738 | Martinez | Oct 2009 | A1 |
20090254471 | Seidel | Oct 2009 | A1 |
20090254479 | Pharris | Oct 2009 | A1 |
20090254535 | Eickelmann | Oct 2009 | A1 |
20090265274 | Hahn-Carlson | Oct 2009 | A1 |
20090271246 | Alvarez | Oct 2009 | A1 |
20090271265 | Lay | Oct 2009 | A1 |
20090276347 | Kargman | Nov 2009 | A1 |
20090281948 | Carlson | Nov 2009 | A1 |
20090288012 | Hertel | Nov 2009 | A1 |
20090294527 | Brabson | Dec 2009 | A1 |
20090307060 | Merz | Dec 2009 | A1 |
20090307135 | Gupta | Dec 2009 | A1 |
20090307139 | Mardikar | Dec 2009 | A1 |
20090308921 | Mullen | Dec 2009 | A1 |
20090313132 | McKenna | Dec 2009 | A1 |
20090319638 | Faith | Dec 2009 | A1 |
20090327045 | Olives | Dec 2009 | A1 |
20090327088 | Puthupparambil | Dec 2009 | A1 |
20090327131 | Beenau | Dec 2009 | A1 |
20100004989 | Bonalle | Jan 2010 | A1 |
20100005025 | Kumar | Jan 2010 | A1 |
20100008535 | Abulafia | Jan 2010 | A1 |
20100009663 | Chang | Jan 2010 | A1 |
20100010964 | Skowronek | Jan 2010 | A1 |
20100021149 | Mulder | Jan 2010 | A1 |
20100023386 | Avisar | Jan 2010 | A1 |
20100023455 | Dispensa | Jan 2010 | A1 |
20100023457 | Riviere | Jan 2010 | A1 |
20100036741 | Cleven | Feb 2010 | A1 |
20100036775 | Edens | Feb 2010 | A1 |
20100036884 | Brown | Feb 2010 | A1 |
20100042456 | Stinchcombe | Feb 2010 | A1 |
20100042537 | Smith | Feb 2010 | A1 |
20100042540 | Graves | Feb 2010 | A1 |
20100049879 | Leavitt | Feb 2010 | A1 |
20100057548 | Edwards | Mar 2010 | A1 |
20100063903 | Whipple | Mar 2010 | A1 |
20100070359 | Heasley | Mar 2010 | A1 |
20100076873 | Taylor | Mar 2010 | A1 |
20100078471 | Lin | Apr 2010 | A1 |
20100078472 | Lin | Apr 2010 | A1 |
20100082444 | Lin | Apr 2010 | A1 |
20100082445 | Hodge | Apr 2010 | A1 |
20100082447 | Lin | Apr 2010 | A1 |
20100082455 | Rosenblatt | Apr 2010 | A1 |
20100082480 | Korosec | Apr 2010 | A1 |
20100082481 | Lin | Apr 2010 | A1 |
20100082485 | Lin | Apr 2010 | A1 |
20100082490 | Rosenblatt | Apr 2010 | A1 |
20100082491 | Rosenblatt | Apr 2010 | A1 |
20100088188 | Kumar | Apr 2010 | A1 |
20100088237 | Wankmueller | Apr 2010 | A1 |
20100094730 | Koski | Apr 2010 | A1 |
20100094755 | Kloster | Apr 2010 | A1 |
20100094878 | Soroca | Apr 2010 | A1 |
20100100480 | Altman | Apr 2010 | A1 |
20100106644 | Annan | Apr 2010 | A1 |
20100114664 | Jobin | May 2010 | A1 |
20100120408 | Beenau | May 2010 | A1 |
20100121707 | Goeldi | May 2010 | A1 |
20100125492 | Lin | May 2010 | A1 |
20100125495 | Smith | May 2010 | A1 |
20100125803 | Johnson | May 2010 | A1 |
20100131347 | Sarptipi | May 2010 | A1 |
20100131415 | Sartipi | May 2010 | A1 |
20100133334 | Vadhri | Jun 2010 | A1 |
20100133339 | Gibson | Jun 2010 | A1 |
20100138026 | Kaushal | Jun 2010 | A1 |
20100138347 | Chen | Jun 2010 | A1 |
20100145860 | Pelegero | Jun 2010 | A1 |
20100153865 | Barnes | Jun 2010 | A1 |
20100155470 | Woronec | Jun 2010 | A1 |
20100161433 | White | Jun 2010 | A1 |
20100174599 | Rosenblatt | Jul 2010 | A1 |
20100179855 | Chen | Jul 2010 | A1 |
20100185505 | Sprogoe | Jul 2010 | A1 |
20100185531 | Van | Jul 2010 | A1 |
20100185545 | Royyuru | Jul 2010 | A1 |
20100191578 | Tran | Jul 2010 | A1 |
20100191622 | Reiss | Jul 2010 | A1 |
20100191770 | Cho | Jul 2010 | A1 |
20100198626 | Cho | Aug 2010 | A1 |
20100211445 | Bodington | Aug 2010 | A1 |
20100211452 | D'Angelo et al. | Aug 2010 | A1 |
20100211469 | Salmon | Aug 2010 | A1 |
20100211499 | Zanzot | Aug 2010 | A1 |
20100211505 | Saunders | Aug 2010 | A1 |
20100217613 | Kelly | Aug 2010 | A1 |
20100217682 | Chan | Aug 2010 | A1 |
20100223186 | Hogan | Sep 2010 | A1 |
20100228668 | Hogan | Sep 2010 | A1 |
20100235284 | Moore | Sep 2010 | A1 |
20100243728 | Wiesman | Sep 2010 | A1 |
20100250351 | Gillenson | Sep 2010 | A1 |
20100256976 | Atsmon | Oct 2010 | A1 |
20100258620 | Torreyson | Oct 2010 | A1 |
20100268645 | Martino | Oct 2010 | A1 |
20100276484 | Banerjee | Nov 2010 | A1 |
20100287048 | Ramer | Nov 2010 | A1 |
20100287229 | Hauser | Nov 2010 | A1 |
20100291904 | Musfeldt | Nov 2010 | A1 |
20100293032 | Engelsma | Nov 2010 | A1 |
20100299267 | Faith | Nov 2010 | A1 |
20100299292 | Collazo | Nov 2010 | A1 |
20100305848 | Stallman | Dec 2010 | A1 |
20100306075 | Drance | Dec 2010 | A1 |
20100306076 | Taveau | Dec 2010 | A1 |
20100306113 | Grey | Dec 2010 | A1 |
20100312645 | Niekadlik | Dec 2010 | A1 |
20100312676 | Muthukumaran | Dec 2010 | A1 |
20100312724 | Pinckney | Dec 2010 | A1 |
20100325041 | Berardi | Dec 2010 | A1 |
20100332262 | Horvitz | Dec 2010 | A1 |
20100332283 | Ng | Dec 2010 | A1 |
20110004498 | Readshaw | Jan 2011 | A1 |
20110010292 | Giordano | Jan 2011 | A1 |
20110016047 | Wu | Jan 2011 | A1 |
20110016320 | Bergsten | Jan 2011 | A1 |
20110035273 | Parikh | Feb 2011 | A1 |
20110040640 | Erikson | Feb 2011 | A1 |
20110040655 | Hendrickson | Feb 2011 | A1 |
20110047017 | Lieblang | Feb 2011 | A1 |
20110047075 | Fourez | Feb 2011 | A1 |
20110047076 | Carlson | Feb 2011 | A1 |
20110078082 | Gupta | Mar 2011 | A1 |
20110082789 | Boyd | Apr 2011 | A1 |
20110083018 | Kesanupalli | Apr 2011 | A1 |
20110087596 | Dorsey | Apr 2011 | A1 |
20110087726 | Shim | Apr 2011 | A1 |
20110093335 | Fordyce | Apr 2011 | A1 |
20110093397 | Carlson | Apr 2011 | A1 |
20110099057 | Tenyer | Apr 2011 | A1 |
20110105183 | Hsiao | May 2011 | A1 |
20110106698 | Issacson | May 2011 | A1 |
20110109737 | Aben | May 2011 | A1 |
20110119300 | Marcade | May 2011 | A1 |
20110125597 | Oder | May 2011 | A1 |
20110137740 | Bhattacharya | Jun 2011 | A1 |
20110137742 | Parikh | Jun 2011 | A1 |
20110153437 | Archer | Jun 2011 | A1 |
20110153498 | Makhotin | Jun 2011 | A1 |
20110154466 | Harper | Jun 2011 | A1 |
20110161233 | Tieken | Jun 2011 | A1 |
20110178896 | Nakajima | Jul 2011 | A1 |
20110178926 | Lindelsee | Jul 2011 | A1 |
20110180598 | Morgan | Jul 2011 | A1 |
20110184827 | Hubert | Jul 2011 | A1 |
20110191244 | Dai | Aug 2011 | A1 |
20110208418 | Looney | Aug 2011 | A1 |
20110215146 | Shams | Sep 2011 | A1 |
20110218870 | Shams | Sep 2011 | A1 |
20110221692 | Seydoux | Sep 2011 | A1 |
20110238474 | Carr | Sep 2011 | A1 |
20110238511 | Park | Sep 2011 | A1 |
20110238573 | Varadarajan | Sep 2011 | A1 |
20110246290 | Howard | Oct 2011 | A1 |
20110246317 | Coppinger | Oct 2011 | A1 |
20110251892 | Laracey | Oct 2011 | A1 |
20110258049 | Ramer | Oct 2011 | A1 |
20110258111 | Raj | Oct 2011 | A1 |
20110258123 | Dawkins | Oct 2011 | A1 |
20110270665 | Kim | Nov 2011 | A1 |
20110272471 | Mullen | Nov 2011 | A1 |
20110272478 | Mullen | Nov 2011 | A1 |
20110276380 | Mullen | Nov 2011 | A1 |
20110276381 | Mullen | Nov 2011 | A1 |
20110276424 | Mullen | Nov 2011 | A1 |
20110276425 | Mullen | Nov 2011 | A1 |
20110282780 | French | Nov 2011 | A1 |
20110288684 | Farlow | Nov 2011 | A1 |
20110295745 | White | Dec 2011 | A1 |
20110296508 | Os | Dec 2011 | A1 |
20110302081 | Saunders | Dec 2011 | A1 |
20110312423 | Mosites | Dec 2011 | A1 |
20110320344 | Faith | Dec 2011 | A1 |
20110320345 | Taveau | Dec 2011 | A1 |
20120005026 | Khan | Jan 2012 | A1 |
20120011009 | Lindsey | Jan 2012 | A1 |
20120011063 | Killian | Jan 2012 | A1 |
20120016731 | Smith | Jan 2012 | A1 |
20120022943 | Howard | Jan 2012 | A1 |
20120023026 | Chen | Jan 2012 | A1 |
20120023417 | Nesladek | Jan 2012 | A1 |
20120023567 | Hammad | Jan 2012 | A1 |
20120028609 | Hruska | Feb 2012 | A1 |
20120030047 | Fuentes | Feb 2012 | A1 |
20120030101 | Boyd | Feb 2012 | A1 |
20120035998 | Chien | Feb 2012 | A1 |
20120036071 | Fulton | Feb 2012 | A1 |
20120041881 | Basu | Feb 2012 | A1 |
20120047237 | Arvidsson | Feb 2012 | A1 |
20120066065 | Switzer | Mar 2012 | A1 |
20120066078 | Kingston | Mar 2012 | A1 |
20120072311 | Khan | Mar 2012 | A1 |
20120072350 | Goldthwaite | Mar 2012 | A1 |
20120078735 | Bauer | Mar 2012 | A1 |
20120078798 | Downing | Mar 2012 | A1 |
20120078799 | Jackson | Mar 2012 | A1 |
20120084132 | Khan | Apr 2012 | A1 |
20120084204 | Castell | Apr 2012 | A1 |
20120095852 | Bauer | Apr 2012 | A1 |
20120095865 | Doherty | Apr 2012 | A1 |
20120095895 | Aston | Apr 2012 | A1 |
20120101881 | Taylor | Apr 2012 | A1 |
20120110044 | Nagpal | May 2012 | A1 |
20120116902 | Cardina | May 2012 | A1 |
20120116966 | Tan | May 2012 | A1 |
20120118950 | Belk | May 2012 | A1 |
20120123838 | Sparks | May 2012 | A1 |
20120123882 | Carlson | May 2012 | A1 |
20120123940 | Killian | May 2012 | A1 |
20120124496 | Rose | May 2012 | A1 |
20120129514 | Beenau | May 2012 | A1 |
20120130794 | Strieder | May 2012 | A1 |
20120136780 | El-Awady | May 2012 | A1 |
20120143767 | Abadir | Jun 2012 | A1 |
20120143772 | Abadir | Jun 2012 | A1 |
20120158580 | Eram | Jun 2012 | A1 |
20120158589 | Katzin | Jun 2012 | A1 |
20120158593 | Garfinkle | Jun 2012 | A1 |
20120158792 | MacLaurin | Jun 2012 | A1 |
20120158893 | Boyns | Jun 2012 | A1 |
20120159163 | von Behren | Jun 2012 | A1 |
20120165978 | Li | Jun 2012 | A1 |
20120166333 | von Behren | Jun 2012 | A1 |
20120166655 | Maddali | Jun 2012 | A1 |
20120173431 | Ritchie | Jul 2012 | A1 |
20120173962 | Oh | Jul 2012 | A1 |
20120185386 | Salama | Jul 2012 | A1 |
20120190386 | Anderson | Jul 2012 | A1 |
20120197691 | Grigg | Aug 2012 | A1 |
20120197794 | Grigg | Aug 2012 | A1 |
20120197807 | Schlesser | Aug 2012 | A1 |
20120203664 | Torossian | Aug 2012 | A1 |
20120203666 | Torossian | Aug 2012 | A1 |
20120209749 | Hammad | Aug 2012 | A1 |
20120215640 | Ramer | Aug 2012 | A1 |
20120215648 | Rose | Aug 2012 | A1 |
20120215650 | Oba | Aug 2012 | A1 |
20120215684 | Kidron | Aug 2012 | A1 |
20120215688 | Musser | Aug 2012 | A1 |
20120215696 | Salonen | Aug 2012 | A1 |
20120221421 | Hammad | Aug 2012 | A1 |
20120221502 | Jerram | Aug 2012 | A1 |
20120226582 | Hammad | Sep 2012 | A1 |
20120231844 | Coppinger | Sep 2012 | A1 |
20120233004 | Bercaw | Sep 2012 | A1 |
20120233170 | Musgrove | Sep 2012 | A1 |
20120239417 | Pourfallah | Sep 2012 | A1 |
20120239556 | Magruder | Sep 2012 | A1 |
20120239560 | Pourfallah | Sep 2012 | A1 |
20120246070 | Vadhri | Sep 2012 | A1 |
20120246071 | Jain | Sep 2012 | A1 |
20120246079 | Wilson | Sep 2012 | A1 |
20120254108 | Wedewer | Oct 2012 | A1 |
20120259763 | Pessin | Oct 2012 | A1 |
20120265631 | Cronic | Oct 2012 | A1 |
20120265685 | Brudnicki | Oct 2012 | A1 |
20120271770 | Harris | Oct 2012 | A1 |
20120284035 | Gillin | Nov 2012 | A1 |
20120297446 | Webb | Nov 2012 | A1 |
20120300932 | Cambridge | Nov 2012 | A1 |
20120303425 | Katzin | Nov 2012 | A1 |
20120303503 | Cambridge | Nov 2012 | A1 |
20120303736 | Novotny | Nov 2012 | A1 |
20120303961 | Kean | Nov 2012 | A1 |
20120304273 | Bailey | Nov 2012 | A1 |
20120310725 | Chien | Dec 2012 | A1 |
20120310826 | Chatterjee | Dec 2012 | A1 |
20120310831 | Harris | Dec 2012 | A1 |
20120316992 | Oborne | Dec 2012 | A1 |
20120317035 | Royyuru | Dec 2012 | A1 |
20120317036 | Bower | Dec 2012 | A1 |
20120317149 | Jagota | Dec 2012 | A1 |
20120323664 | Klems | Dec 2012 | A1 |
20120330874 | Jerram | Dec 2012 | A1 |
20130013499 | Kalgi | Jan 2013 | A1 |
20130017784 | Fisher | Jan 2013 | A1 |
20130018757 | Anderson | Jan 2013 | A1 |
20130019098 | Gupta | Jan 2013 | A1 |
20130024364 | Shrivastava | Jan 2013 | A1 |
20130024371 | Hariramani | Jan 2013 | A1 |
20130024916 | Evans | Jan 2013 | A1 |
20130030828 | Pourfallah | Jan 2013 | A1 |
20130031006 | McCullagh | Jan 2013 | A1 |
20130054337 | Brendell | Feb 2013 | A1 |
20130054466 | Muscato | Feb 2013 | A1 |
20130054470 | Campos | Feb 2013 | A1 |
20130054474 | Yeager | Feb 2013 | A1 |
20130080238 | Kelly | Mar 2013 | A1 |
20130081122 | Svigals | Mar 2013 | A1 |
20130090750 | Herrman | Apr 2013 | A1 |
20130091028 | Oder | Apr 2013 | A1 |
20130103574 | Conrad | Apr 2013 | A1 |
20130110658 | Lyman | May 2013 | A1 |
20130111599 | Gargiulo | May 2013 | A1 |
20130117170 | Coppinger | May 2013 | A1 |
20130117185 | Collison | May 2013 | A1 |
20130124290 | Fisher | May 2013 | A1 |
20130124291 | Fisher | May 2013 | A1 |
20130124364 | Mittal | May 2013 | A1 |
20130138525 | Bercaw | May 2013 | A1 |
20130144785 | Karpenko | Jun 2013 | A1 |
20130144888 | Faith | Jun 2013 | A1 |
20130144957 | Sherman | Jun 2013 | A1 |
20130145148 | Shablygin | Jun 2013 | A1 |
20130145172 | Shablygin | Jun 2013 | A1 |
20130151417 | Gupta | Jun 2013 | A1 |
20130159081 | Shastry | Jun 2013 | A1 |
20130159112 | Schultz | Jun 2013 | A1 |
20130159178 | Colon | Jun 2013 | A1 |
20130159184 | Thaw | Jun 2013 | A1 |
20130166332 | Hammad | Jun 2013 | A1 |
20130166402 | Parento | Jun 2013 | A1 |
20130166456 | Zhang | Jun 2013 | A1 |
20130166621 | Zhu | Jun 2013 | A1 |
20130173736 | Krzeminski | Jul 2013 | A1 |
20130179340 | Alba | Jul 2013 | A1 |
20130185202 | Goldthwaite | Jul 2013 | A1 |
20130191286 | Cronic | Jul 2013 | A1 |
20130191289 | Cronic | Jul 2013 | A1 |
20130198071 | Jurss | Aug 2013 | A1 |
20130198080 | Anderson | Aug 2013 | A1 |
20130200146 | Moghadam | Aug 2013 | A1 |
20130204787 | Dubois | Aug 2013 | A1 |
20130204793 | Kerridge | Aug 2013 | A1 |
20130212007 | Mattsson | Aug 2013 | A1 |
20130212017 | Bangia | Aug 2013 | A1 |
20130212019 | Mattsson | Aug 2013 | A1 |
20130212024 | Mattsson | Aug 2013 | A1 |
20130212026 | Powell | Aug 2013 | A1 |
20130212666 | Mattsson | Aug 2013 | A1 |
20130218640 | Kidder | Aug 2013 | A1 |
20130218657 | Salmon | Aug 2013 | A1 |
20130218698 | Moon | Aug 2013 | A1 |
20130218721 | Borhan | Aug 2013 | A1 |
20130218765 | Hammad | Aug 2013 | A1 |
20130218769 | Pourfallah | Aug 2013 | A1 |
20130226799 | Raj | Aug 2013 | A1 |
20130226813 | Voltz | Aug 2013 | A1 |
20130246199 | Carlson | Sep 2013 | A1 |
20130246202 | Tobin | Sep 2013 | A1 |
20130246203 | Laracey | Sep 2013 | A1 |
20130246258 | Dessert | Sep 2013 | A1 |
20130246259 | Dessert | Sep 2013 | A1 |
20130246267 | Tobin | Sep 2013 | A1 |
20130254028 | Salci | Sep 2013 | A1 |
20130254052 | Royyuru | Sep 2013 | A1 |
20130254102 | Royyuru | Sep 2013 | A1 |
20130254117 | von Mueller | Sep 2013 | A1 |
20130262296 | Thomas | Oct 2013 | A1 |
20130262302 | Lettow | Oct 2013 | A1 |
20130262315 | Hruska | Oct 2013 | A1 |
20130262316 | Hruska | Oct 2013 | A1 |
20130262317 | Collinge | Oct 2013 | A1 |
20130275300 | Killian | Oct 2013 | A1 |
20130275307 | Khan | Oct 2013 | A1 |
20130275308 | Paraskeva | Oct 2013 | A1 |
20130282502 | Jooste | Oct 2013 | A1 |
20130282575 | Mullen | Oct 2013 | A1 |
20130282588 | Hruska | Oct 2013 | A1 |
20130297501 | Monk | Nov 2013 | A1 |
20130297504 | Nwokolo | Nov 2013 | A1 |
20130297508 | Belamant | Nov 2013 | A1 |
20130304649 | Cronic | Nov 2013 | A1 |
20130308778 | Fosmark | Nov 2013 | A1 |
20130311382 | Fosmark | Nov 2013 | A1 |
20130317982 | Mengerink | Nov 2013 | A1 |
20130325579 | Salmon | Dec 2013 | A1 |
20130332344 | Weber | Dec 2013 | A1 |
20130339240 | Anderson | Dec 2013 | A1 |
20130339253 | Sincai | Dec 2013 | A1 |
20130346302 | Purves | Dec 2013 | A1 |
20130346305 | Mendes | Dec 2013 | A1 |
20130346314 | Mogollon | Dec 2013 | A1 |
20140006198 | Daly | Jan 2014 | A1 |
20140006283 | Hogg | Jan 2014 | A1 |
20140007213 | Sanin | Jan 2014 | A1 |
20140013106 | Red path | Jan 2014 | A1 |
20140013114 | Red path | Jan 2014 | A1 |
20140013452 | Aissi | Jan 2014 | A1 |
20140019352 | Shrivastava | Jan 2014 | A1 |
20140025581 | Caiman | Jan 2014 | A1 |
20140025585 | Caiman | Jan 2014 | A1 |
20140025958 | Caiman | Jan 2014 | A1 |
20140032417 | Mattsson | Jan 2014 | A1 |
20140032418 | Weber | Jan 2014 | A1 |
20140040127 | Chatterjee | Feb 2014 | A1 |
20140040137 | Carlson | Feb 2014 | A1 |
20140040139 | Brudnicki | Feb 2014 | A1 |
20140040144 | Plomske | Feb 2014 | A1 |
20140040145 | Ozvat | Feb 2014 | A1 |
20140040148 | Ozvat | Feb 2014 | A1 |
20140040628 | Fort | Feb 2014 | A1 |
20140041018 | Bomar | Feb 2014 | A1 |
20140046853 | Spies | Feb 2014 | A1 |
20140047517 | Ding | Feb 2014 | A1 |
20140047551 | Nagasundaram | Feb 2014 | A1 |
20140052532 | Tsai | Feb 2014 | A1 |
20140052620 | Rogers | Feb 2014 | A1 |
20140052637 | Jooste | Feb 2014 | A1 |
20140068706 | Aissi | Mar 2014 | A1 |
20140074637 | Hammad | Mar 2014 | A1 |
20140095589 | Johnson | Apr 2014 | A1 |
20140108172 | Weber | Apr 2014 | A1 |
20140108197 | Smith | Apr 2014 | A1 |
20140114857 | Griggs | Apr 2014 | A1 |
20140136945 | Ligman | May 2014 | A1 |
20140143137 | Carlson | May 2014 | A1 |
20140164243 | Aabye | Jun 2014 | A1 |
20140188586 | Carpenter | Jul 2014 | A1 |
20140294701 | Dai | Oct 2014 | A1 |
20140297534 | Patterson | Oct 2014 | A1 |
20140310080 | Salmon | Oct 2014 | A1 |
20140310183 | Weber | Oct 2014 | A1 |
20140330721 | Wang | Nov 2014 | A1 |
20140330722 | Laxminarayanan | Nov 2014 | A1 |
20140331265 | Mozell | Nov 2014 | A1 |
20140337175 | Katzin | Nov 2014 | A1 |
20140337236 | Wong | Nov 2014 | A1 |
20140344153 | Raj | Nov 2014 | A1 |
20140365295 | Postrel | Dec 2014 | A1 |
20140372308 | Sheets | Dec 2014 | A1 |
20150019443 | Sheets | Jan 2015 | A1 |
20150019944 | Kalgi | Jan 2015 | A1 |
20150026049 | Theurer | Jan 2015 | A1 |
20150032625 | Dill | Jan 2015 | A1 |
20150032626 | Dill | Jan 2015 | A1 |
20150032627 | Dill | Jan 2015 | A1 |
20150046338 | Laxminarayanan | Feb 2015 | A1 |
20150046339 | Wong | Feb 2015 | A1 |
20150052064 | Karpenko | Feb 2015 | A1 |
20150088756 | Makhotin | Mar 2015 | A1 |
20150089350 | Davis | Mar 2015 | A1 |
20150106239 | Gaddam | Apr 2015 | A1 |
20150112870 | Nagasundaram | Apr 2015 | A1 |
20150112871 | Kumnick | Apr 2015 | A1 |
20150120472 | Aabye | Apr 2015 | A1 |
20150127529 | Makhotin | May 2015 | A1 |
20150127547 | Powell | May 2015 | A1 |
20150140960 | Powell | May 2015 | A1 |
20150142673 | Nelsen | May 2015 | A1 |
20150161597 | Subramanian | Jun 2015 | A1 |
20150178724 | Ngo | Jun 2015 | A1 |
20150180836 | Wong | Jun 2015 | A1 |
20150186864 | Jones | Jul 2015 | A1 |
20150193222 | Pirzadeh | Jul 2015 | A1 |
20150195133 | Sheets | Jul 2015 | A1 |
20150199679 | Palanisamy | Jul 2015 | A1 |
20150199689 | Kumnick | Jul 2015 | A1 |
20150220917 | Aabye | Aug 2015 | A1 |
20150269566 | Gaddam | Sep 2015 | A1 |
20150302453 | Tietzen | Oct 2015 | A1 |
20150312038 | Palanisamy | Oct 2015 | A1 |
20150319158 | Kumnick | Nov 2015 | A1 |
20150332262 | Lingappa | Nov 2015 | A1 |
20150339767 | Chen | Nov 2015 | A1 |
20150356560 | Shastry | Dec 2015 | A1 |
20160028550 | Gaddam | Jan 2016 | A1 |
20160042263 | Gaddam | Feb 2016 | A1 |
20160065370 | Le Saint | Mar 2016 | A1 |
20160092696 | Guglani | Mar 2016 | A1 |
20160092872 | Prakash | Mar 2016 | A1 |
20160103675 | Aabye | Apr 2016 | A1 |
20160119296 | Laxminarayanan | Apr 2016 | A1 |
20160224976 | Basu | Aug 2016 | A1 |
20160291920 | Sirpal | Oct 2016 | A1 |
20160379192 | Purves | Dec 2016 | A1 |
20170046696 | Powell | Feb 2017 | A1 |
20170103387 | Weber | Apr 2017 | A1 |
20170134479 | Kalgi | May 2017 | A1 |
20170220818 | Nagasundaram | Aug 2017 | A1 |
20170228723 | Taylor | Aug 2017 | A1 |
20170300314 | Lopyrev | Oct 2017 | A1 |
20170346876 | Lim | Nov 2017 | A1 |
20180075081 | Chipman | Mar 2018 | A1 |
Number | Date | Country |
---|---|---|
1841425 | Oct 2006 | CN |
101025806 | Aug 2007 | CN |
101075316 | Nov 2007 | CN |
101231727 | Jul 2008 | CN |
101388125 | Mar 2009 | CN |
101840550 | Sep 2010 | CN |
0745961 | Dec 1996 | EP |
0855659 | Jul 1998 | EP |
1921578 | May 2008 | EP |
2156397 | Feb 2010 | EP |
2005004621 | Jan 2005 | JP |
2008527495 | Jul 2008 | JP |
2008545210 | Dec 2008 | JP |
2009151730 | Jul 2009 | JP |
2011186660 | Sep 2011 | JP |
2012027824 | Feb 2012 | JP |
20000058839 | Oct 2000 | KR |
100432430 | May 2004 | KR |
20060117177 | Nov 2006 | KR |
20070104087 | Oct 2007 | KR |
2013069539 | Oct 2013 | SG |
2000046769 | Aug 2000 | WO |
2001035304 | May 2001 | WO |
0165502 | Sep 2001 | WO |
2003001866 | Jan 2003 | WO |
03023674 | Mar 2003 | WO |
2003046697 | Jun 2003 | WO |
2003071386 | Aug 2003 | WO |
2003083737 | Oct 2003 | WO |
2004042536 | May 2004 | WO |
2006113834 | Oct 2006 | WO |
2009032523 | Mar 2009 | WO |
2010078522 | Jul 2010 | WO |
2010148704 | Dec 2010 | WO |
2010148737 | Dec 2010 | WO |
2012068078 | May 2012 | WO |
2012098556 | Jul 2012 | WO |
2012142370 | Oct 2012 | WO |
2012167941 | Dec 2012 | WO |
2013048538 | Apr 2013 | WO |
2013056104 | Apr 2013 | WO |
2013119914 | Aug 2013 | WO |
2013179271 | Dec 2013 | WO |
Entry |
---|
Australian Examination Report for AU2017203295 dated Apr. 19, 2018, 4 pages. |
Ratha, N., and Bolle, R., 1. History of Fingerprint Pattern Recognition—1.1 Introduction; 1.2 The Development of Fingerprint Classification Systems “Automatic Fingerprint Recognition Systems,” Springer-Verlag, (2004) (466 pages). |
Office Action dated May 22, 2018 for U.S. Appl. No. 14/216,382 (pp. 1-8). |
Chinese Office Action dated Oct. 10, 2017 for CN Application No. 201280019629.X, 7 pages. |
Pan Kexian “Development of the Location-Based Service LBS Application of Intelligent Mobile Phone”, Information Technologies, Oct. 25, 2009, pp. 134-137, cited on Oct. 10, 2017 in CN201280019629. |
Yang Jingjing “Help Web: Life Search Forerunner” Scientific and Technological Information, Aug. 5, 2010, pp. 36-37, cited on Oct. 10, 2017 in CN201280019629. |
Wang Lepeng et al. “Discuss of Foursquare Pattern and Its Deelopment Strategies in China” Scientific and Technological Information, Aug. 15, 2010, pp. 90-91, cited on Oct. 10, 2017 in CN201280019629. |
Chinese Office Action dated Nov. 6, 2017 for CN Application No. 201280018719.7, 24 pages. |
Business Wire, “New York State Department of Labor Selects JPMorgan Chase to Provide New Banking Services for Unemployment Insurance Benefits; JPMorgan Chase Electronic Services to Help Speed Benefit Payments”, Business Wire, New York, Aug. 4, 2006, 2 p. |
David Breitkopf, “ACS to Take Over Mich. WC Distribution Program”, American Banker, New York, NY: Jul. 20, 2006, vol. 171. Issue 138, p. 6. |
Gopalan, NP & Selvan, B Siva. TCP/IP Illustrated. Prentice-Hall. 2008. pp. 101-102, 175-176 and 235. 7 pages. |
International Search Report and Written Opinion for PCT/US09/54921 dated Oct. 21, 2009. (2 pages). |
International Search Report and Written Opinion for PCT/US11/57173 dated Mar. 15, 2012. (11 pages). |
International Search Report and Written Opinion for PCT/US11/57179 dated Jan. 5, 2012. (7 pages). |
International Search Report and Written Opinion for PCT/US12/37597 dated Sep. 21, 2012 (11 pages). |
International Search Report and Written Opinion for PCT/US12/41437 dated Aug. 24, 2012. (11 pages). |
International Search Report and Written Opinion for PCT/US2010/033229 dated Dec. 29, 2010, 8 pages. |
International Search Report and Written Opinion for PCT/US2010/041860 dated Feb. 1, 2011. (9 pages). |
International Search Report and Written Opinion for PCT/US2010/048344 dated Nov. 15, 2010. (9 pages). |
International Search Report and Written Opinion for PCT/US2013/020411 dated May 21, 2013. 18 pages. |
International Search Report and Written Opinion for PCT/US2013/024538, dated May 31, 2013. 15 pages. |
International Search Report for PCT/US11/49393 dated Dec. 5, 2011. (2 pages). |
International Search Report for PCT/US11/65305 dated Apr. 16, 2012. 2 pages. |
International Search Report for PCT/US12/23856 dated Jun. 6, 2012. 3 pages. |
International Search Report for PCT/US12/24772 dated Jul. 24, 2012. 3 pages. |
International Search Report for PCT/US12/25530 dated Aug. 7, 2012. 4 pages. |
International Search Report for PCT/US12/39638 dated Sep. 24, 2012. 4 pages. |
International Search Report for PCT/US12/45875 dated Nov. 16, 2012. 4 pages. |
International Search Report for PCT/US12/47092 dated Nov. 26, 2012. 11 pages. |
International Search Report for PCT/US12/56759 dated Feb. 25, 2013. 12 pages. |
International Search Report for PCT/US12/57528 dated Dec. 17, 2012. 8 pages. |
International Search Report for PCT/US12/57577 dated Nov. 29, 2012. 2 pages. |
International Search Report and Written Opinion for PCT/US12/66898 dated Feb. 11, 2013. 14 pages. |
International Search Report PCT/US12/27620 dated Aug. 10, 2012. 3 pages. |
Shadrach, D.C. “A Weighted Metric Based Adaptive Algorithm for Web Server Load Balancing.” 2009 Third International Symposium on Intelligent Information Technology Application, http://ieeexplore.ieee.org/xpl/articleDetails.jsp?amumber=5369384, pp. 449-452. |
Aissi et al., U.S. Appl. No. 61/738,832 (unpublished), Management of Sensitive Data filed Dec. 18, 2012. |
Australian Patent Office, Patent Examination Report No. 2 in Australian Patent Application No. 2012217606, dated Jun. 15, 2016, 6 pages. |
Cash et al., U.S. Appl. No. 15/041,495 (unpublished), Peer Forward Authorization of Digital Requests filed Feb. 11, 2016. |
U.S. Appl. No. 12/940,664, entitled “System and Method for Determining Transaction Distance” filed Nov. 5, 2010. |
Dizaj, Mohammad Vahid Alizadeh, Moghaddam, Rexa Askari, Momenebellah, Samad, New Mobile Payment Protocol: Mobile Pay Center Protocol 2 (MPCP2) by Using New Key Agreement Protocol: VAM, 3d International Conference on Electronics Computer Technology, vol. 2, Apr. 2011, pp. 12-18. |
State Intellectual Property Office of the People's Republic of China, First Office Action in Chinese Application No. 201280018719.7, dated Jul. 4, 2016, 15 pages. |
Flurscheim et al., U.S. Appl. No. 15/004,705 (unpublished), Cloud-Based Transactions With Magnetic Secure Transmission filed Jan. 22, 2016. |
Flurscheim et al., U.S. Appl. No. 62/108,403 (unpublished), Wearables With NFC HCE filed Jan. 27, 2015. |
Gaddam et al., U.S. Appl. No. 62/053,736 (unpublished), Completing Transactions Without a User Payment Device, filed Sep. 22, 2014. |
Galland et al., U.S. Appl. No. 62/128,709 (unpublished), Tokenizing Transaction Amounts, filed Mar. 5, 2015. |
Gao, Jerry, Kulkarni, Vijay, Ranavat, Himanshu, Chang, Lee, Mei, Hsing, A2D Barcode-Based Mobile Payment System, 3d International Conference on Multimedia and Ubiquitous Engineering, Jun. 2009, pp. 320-329. |
Hoverson et al., U.S. Appl. No. 62/038,174 (unpublished), Customized Payment Gateway, filed Aug. 15, 2014. |
International Search Report and Written Opinion for PCT/US2014/030517, dated Aug. 18, 2014. (9 pages). |
International Search Report and Written Opinion for PCT/US2012/026205, dated May 29, 2012. 8 pages. |
Kalgi et al., U.S. Appl. No. 62/024,426 (unpublished), Secure Transactions Using Mobile Devices, filed Jul. 14, 2014. |
Kinagi, U.S. Appl. No. 62/117,291 (unpublished), Token and Cryptogram Using Transaction Specific Information filed Feb. 17, 2015. |
Le Saint et al., U.S. Appl. No. 15/008,388 (unpublished), Methods for Secure Credential Provisioning, filed Jan. 27, 2016. |
U.S. Provisional Application No. 61/250,440, filed Oct. 9, 2009, entitled “Systems and Methods to Provide Loyalty Programs”. |
McGuire, U.S. Appl. No. 14/600,523 (unpublished), Secure Payment Processing Usnig Authorization Request, filed Jan. 20, 2015. |
Patterson, U.S. Appl. No. 15/019,157 (unpublished), Token Processing Utilizing Multiple Authorizations, filed Feb. 9, 2016. |
Patterson, U.S. Appl. No. 62/054,346 (unpublished), Mirrored Token Vault, filed Sep. 23, 2014. |
Powell, U.S. Appl. No. 61/926,236 (unpublished), Methods and Systems for Provisioning Mobile Devices With Payment Credentials and Payment Token Identifiers filed Jan. 10, 2014. |
Prakash et al., U.S. Appl. No. 14/955,716 (unpublished), Provisioning Platform for Machine-To-Machine Devices, filed Dec. 1, 2015. |
Prakash et al., U.S. Appl. No. 62/037,033 (unpublished), Sharing Payment Token, filed Aug. 13, 2014. |
Rangarajan et al., U.S. Appl. No. 61/751,763 (unpublished), Payments Bridge filed Jan. 11, 2013. |
Sabba et al., U.S. Appl. No. 15/011,366 (unpublished), Token Check Offline, filed Jan. 29, 2016. |
Sharma et al., U.S. Appl. No. 62/003,717 (unpublished), Mobile Merchant Application filed May 28, 2014. |
Stubbs et al., U.S. Appl. No. 62/103,522 (unpublished), Methods and Systems for Wallet Provider Provisioning filed Jan. 14, 2015. |
Wang, U.S. Appl. No. 62/000,288 (unpublished), Payment System Canonical Address Format, filed May 19, 2014. |
Wang, U.S. Appl. No. 62/042,050 (unpublished), Payment Device Authentication and Authorization System, filed Aug. 26, 2014. |
Wong et al., U.S. Appl. No. 14/966,948 (unpublished), Automated Access Data Provisioning filed Dec. 11, 2015. |
Wong et al., U.S. Appl. No. 61/879,362 (unpublished), Systems and Methods for Managing Mobile Cardholder Verification Methods filed Sep. 18, 2013. |
International Search Report and Written Opinion forPCT/US2013/031084, dated Jun. 4, 2013. 9 pages. |
Written Opinion for PCT/US12/27620 dated Aug. 10, 2012. 5 pages. |
European Patent Office, Supplementary European Search Report and European Search Opinion, in EP Application No. 12749451.6, dated Apr. 20, 2015, 7 pages. |
International Search Report and Written Opinion for PCT/US13/46875, dated Oct. 24, 2013, 14 pages. |
IP Australia, Patent Examination Report No. 1, Australian Application No. 2012220669, dated Sep. 8, 2014, 6 pages. |
IP Australia, Patent Examination Report No. 2, Australian Application No. 2012220669, dated Jun. 8, 2016, 4 pages. |
State Intellectual Property of the People's Republic of China, First Office Action in Chinese Application No. 201280019629, X, dated Aug. 1, 2016, 15 pages. |
International Preliminary Report on Patentability dated Jan. 16, 2014 in related/corresponding PCT Patent Appl. No. PCT/US2012/045601 filed Jul. 5, 2012. (7 pages). |
Smartphone e-payment and Google AD send blog, ‘Google Wallet on Smartphone’, <http://stockpedia.blogspot.kr/2011/06/google-wallet.html> Jun. 10, 2011, pp. 1-3. |
International Preliminary Report on Patentability dated Jan. 14, 2014 cited in related/corresponding International PCT Appl. No. PCT/US2012/045875 filed Jul. 7, 2012. (11 pages). |
Petition for Inter Partes Review of U.S. Pat. No. 8,533,860 Challenging Claims 1-30 Under 35 U.S.C. 312 and 37 C.F.R. 42.104, filed Feb. 17, 2016, Before the USPTO Patent Trial and Appeal Board, IPR 2016-00600, 65 pages. |
Vitt, Elizabeth et al. Data Integration Solutions for Master Data Management (Feb. 2006). https://technet.microsoft.com/en-us/library/aa964123(v=sql.90).aspx (19 pages). |
Vitt, Elizabeth, et al. “Microsoft SQL Server 2005 Analysis Services Performance Guide.” White Paper, White Paper (2007). (116 pages). |
ShopSawy Blog, Feb. 2012. Retrieved from https://web.archive.org/web/20120212104611 /http://shopsawy.com:80/blog/.pp. 1-13. |
Charland et al., Mobile Application Development: Web vs. Native, Apr. 2011, 9 pages. |
Lee et al., osgGap: scene graph library for mobile based on hybrid web app framework, Nov. 2013, 4 pages. |
Immaneni et al., Hybrid retrieval from the unified web, Mar. 2007, 5 pages. |
McCarney et al., “Tapas: Design, Implementation, and Usability Evaluation of a Password Manager,” Copyright 2012, ACM 978 1-4503-1312-4/12/12 (10 pages). |
Lowry P B XML data mediation and collaboration: a proposed comprehensive architecture and query requirements for using XML to mediate heterogeneous data sources and targets, Proceedings of the 34th Hawaii International Conference on System Sciences—2001, Jan. 3, 2001; Jan. 3, 2001-Jan. 6, 2001, IEEE, pp. 1-9. |
Gao et al., “A 2D Barcode-Based Mobile Payment System”, (2009), XP031561633 (10 pages). |
International Search Report and Written Opinion for PCT/US11/57180 dated Mar. 2012 (11 pages). |
International Search Report and Written Opinion for PCT/US12/55636 dated Nov. 30, 2012. 2 pages. |
International Search Report and Written Opinion for PCT/US12/65738 dated Apr. 19, 2013. 9 pages. |
International Search Report and Written Opinion for PCT/US2012/027043 dated Jul. 13, 2012. 15 pages. |
International Search Report and Written Opinion for PCT/US2012/045601 dateed Feb. 1, 2013. 11 pages. |
International Search Report and Written Opinion for PCT/US2012/069557 dated Feb. 22, 2013. 8 pages. |
International Search Report and Writtten Opinion for PCT/US2011/039178 dated Sep. 16, 2011 (7 pages). |
International Search Report for PCT/US12/21000 dated May 15, 2012. 2 pages. |
International Search Report and Written Opinion for PCT/US2010/046833 dated Apr. 26, 2011 (8 pages). |
Dimmick, U.S. Appl. No. 14/952,444 (unpublished), Tokenization Request via Access Device, filed Nov. 25, 2015. |
Dimmick, U.S. Appl. No. 14/952,514 (unpublished), Systems Communications With Non-Sensitive Identifiers, filed Nov. 25, 2015. |
Li, U.S. Appl. No. 61/894,749 (unpublished), Methods and Systems for Authentication and Issuance of Tokens in a Secure Environment filed Oct. 23, 2013. |
Powell, U.S. Appl. No. 61/892,407 (unpublished), Issuer Over-The-Air Update Method and System filed Oct. 17, 2013. |
Stack Exchange, Why aren't there automated translators from one programming language to another, 2010 (5 pages). |
International Preliminary Report on Patentability for PCT/US2010/033229 dated Dec. 29, 2010. (8 pages). |
International Search Report and Written Opinion for PCT/US2012/057528, dated May 29, 2012. (8 pages). |
Petition for Inter Partes Review of U.S. Pat. No. 8,887,308 Challenging Claim 1 Under 35 U.S.C. 312 and 37 C.F. R. 42.104, dated Mar. 3, 2016, before the USPTO Patent Trial and Appeal Board, IPR 2016-00602, 58 pages. |
Petition for Inter Partes Review of U.S. Pat. No. 8,402,555 Challenging Claims 1-26 Under 35 U.S.C. 312 and 37 C.F.R. 42.104, dated Mar. 22, 2016, before the USPTO Patent Trial and Appeal Board, IPR 2016-00789, 65 pages. |
Corrected Petition for Inter Partes Review of U.S. Pat. No. 8,533,860 Challenging Claims 1-30 Under 35 U.S.C. .sctn.312 and 37 C.F.R. sctn.42.104, dated Mar. 14, 2016, before the USPTO Patent Trial and Appeal Board, IPR 2016-00600, 65 pages. |
ShopSavvy Blog. Feb. 2012. Retrieved from https://web.archive.Org/web/20120212104611/http://shopsavvy.com/blog. pp. 1-13 (Year: 2012). |
Chipman, et al., U.S. Appl. No. 15/265,282 (Unpublished), Self-Cleaning Token Vault, filed Sep. 14, 2016. |
Lopez, et al., U.S. Appl. No. 15/462,658 (Unpublished), Replacing Token on a Multi-Token User Device, filed Mar. 17, 2017. |
International Search Report and Written Opinion for PCT/US2010/033547 dated Dec. 14, 2010 (3 pages). |
International Search Report and Written Opinion for PCT/US2010/033861 dated Dec. 9, 2010 (7 pages). |
International Search Report and Written Opinion for PCT/US2010/045445 dated Feb. 24, 2011 (3 pages). |
International Search Report and Written Opinion for PCT/US2010/045500 dated Mar. 29, 2011 (3 pages). |
International Search Report and Written Opinion for PCT/US2011/024941 dated Apr. 19, 2011 (6 pages). |
International Search Report and Written Opinion for PCT/US2011/032093 dated Aug. 24, 2011 (11 pages). |
International Search Report and Written Opinion for PCT/US2011/035268 dated Aug. 5, 2011 (3 pages). |
International Search Report and Written Opinion for PCT/US2011/26734 dated Apr. 29, 2011 (7 pages). |
International Search Report and Written Opinion for PCT/US2011/29790 dated May 19, 2011 (6 pages). |
International Search Report and Written Opinion issued in connection with PCT/US11/42062 dated Sep. 29, 2011 (8 pages). |
Office Action dated Feb. 28, 2018 for U.S. Appl. No. 14/242,403 (pp. 1-11). |
Office Action dated Apr. 12, 2018 for U.S. Appl. No. 13/520,481 (pp. 1-8). |
Notice of Allowance dated Jun. 27, 2018 for U.S. Appl. No. 13/542,443 (pp. 1-13). |
Office Action dated Jun. 22, 2018 for U.S. Appl. No. 13/629,006 (pp. 1-8). |
Office Action dated Jun. 21, 2018 for U.S. Appl. No. 14/216,351 (pp. 1-12). |
Office Action dated Jul. 16, 2018 for U.S. Appl. No. 14/698,317 (pp. 1-13). |
I. Malavolta, Web-based hybrid mobile apps: state of the practice and research opportunities, 2 pages (Year: 2016). |
Lee et al., osgGap: scene graph library for mobile based on hybrid web app framework, 4 pages (Year: 2013). |
Notice of Allowance dated Jul. 23, 2018 for U.S. Appl. No. 15/406,325 (pp. 1-9). |
Office Action dated Sep. 21, 2018 for U.S. Appl. No. 15/839,493 (pp. 1-21). |
Office Action dated Oct. 4, 2018 for U.S. Appl. No. 13/758,472 (pp. 1-22). |
Number | Date | Country | |
---|---|---|---|
20180046623 A1 | Feb 2018 | US |
Number | Date | Country | |
---|---|---|---|
61594063 | Feb 2012 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13758833 | Feb 2013 | US |
Child | 13520481 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13520481 | Mar 2014 | US |
Child | 15717409 | US | |
Parent | PCT/US2013/024538 | Feb 2013 | US |
Child | 13758833 | US |