Massive scale heterogeneous data ingestion and user resolution

Information

  • Patent Grant
  • 11681733
  • Patent Number
    11,681,733
  • Date Filed
    Monday, December 6, 2021
    3 years ago
  • Date Issued
    Tuesday, June 20, 2023
    a year ago
  • Inventors
  • Original Assignees
  • Examiners
    • Giuliani; Giuseppi
    Agents
    • Knobbe, Martens, Olson & Bear, LLP
  • CPC
    • G06F16/337
    • G06F16/24573
    • G06F16/9014
    • G06Q40/03
    • G06F16/9535
  • Field of Search
    • US
    • NON E00000
  • International Classifications
    • G06F16/335
    • G06F16/901
    • G06F16/2457
    • G06Q40/03
    • G06F16/9535
    • Disclaimer
      This patent is subject to a terminal disclaimer.
Abstract
This disclosure relates to data association, attribution, annotation, and interpretation systems and related methods of efficiently organizing heterogeneous data at a massive scale. Incoming data is received and extracted for identifying information (“information”). Multiple dimensionality reducing functions are applied to the information, and based on the function results, the information are grouped into sets of similar information. Filtering rules are applied to the sets to exclude non-matching information in the sets. The sets are then merged into groups of information based on whether the sets contain at least one common information. A common link may be associated with information in a group. If the incoming data includes the identifying information associated with to the common link, the incoming data is assigned the common link. In some embodiments, incoming data are not altered but assigned into domains.
Description
INCORPORATION BY REFERENCE TO ANY PRIORITY APPLICATIONS

Any and all applications for which a foreign or domestic priority claim is identified in the Application Data Sheet as filed with the present application are hereby incorporated by reference under 37 CFR 1.57.


FIELD

This disclosure relates to data association, attribution, annotation, and interpretation systems and related methods of efficiently organizing heterogeneous data elements associated with users at a massive scale. The systems and methods can be implemented to provide real-time access to historical data elements of users that has not previously been available.


BACKGROUND

Credit events can be collected, compiled, and analyzed to provide an individual's creditworthiness in the form of a credit report, which typically includes multiple credit attributes, such as a credit score, credit account information, and other information related to financial worthiness of users. For example, a credit score is important as it can establish necessary level of trust between transacting entities. For example, financial institutions such as lenders, credit card providers, banks, car dealers, brokers, or the like can more safely enter into a business transaction based on credit scores.


SUMMARY

Systems and methods are disclosed related to data association, attribution, annotation, and interpretation system and related methods of efficiently organizing heterogeneous data at a massive scale.


One general aspect includes a computer system for determining account holder identities for collected event information, the computer system including: one or more hardware computer processors; and one or more storage devices configured to store software instructions configured for execution by the one or more hardware computer processors to cause the computer system to: receive, from a plurality of data sources, a plurality of event information associated with a corresponding plurality of events; for each event information: access a data store including associations between data sources and identifier parameters, the identifier parameters including at least an indication of one or more identifiers included in event information from the corresponding data source; determine, based at least on the identifier parameters of the data source of the event information, identifiers included in the event information as indicated in the accessed data store; extract identifiers from the event information based at least on the corresponding identifier parameters, where a combination of the identifiers include a unique identity associated with a unique user; access a plurality of hash function, each associated with a combination of identifiers; for each unique identity, calculate a plurality of hashes by evaluating the plurality of hash functions; based on whether unique identities share a common hash calculated with a common hash function, selectively group unique identities into sets of unique identities associated with common hashes; for each set of unique identities: apply one or more match rules including criteria for comparing unique identities within the set; determine a matching set of unique identities as those meeting one or more of the match rules; merge matching sets of unique identities each including at least one common unique identity to provide one or more merged sets having no unique identity in common with other merged sets; for each merged set: determine an inverted personal identifier; associate the inverted personal identifier to each of the unique identities in the merged set; for each unique identity: identify event information associated with at least one of the combinations of identifiers associated with the unique identity, and associate the inverted personal identifier with the identified event information. Other embodiments of this aspect include corresponding computer systems, apparatus, and computer programs recorded on one or more computer storage devices, each configured to perform the actions of the methods.


Implementations may include one or more of the following features. The computer system where the hash functions include at least: a first hash function that evaluates a first combination of at least portions of a first identifier and at least portions of a second identifier extracted from event information; and a second hash functions that evaluates a second combination of at least portions of the first identifier and at least portions of a third identifier extracted from event information; The computer system where the first hash function is selected based on identifier types of one or more of the first identifier or the second identifier. The computer system where the first identifier is a social security number of the user and the second identifier is a last name of the user, and the first combination is a concatenation less than all of the digits of the social security number and less than all characters of the last name of the user. The computer system where a first set of events includes a plurality of events associated with the first hash and a second set of events includes plurality of events each associated with the second hash. The computer system where the identifiers are selected from: first name, last name, middle initial, middle name, date of birth, social security number, taxpayer id, or national id. The computer system where the computer system generates an inverted map associating an inverted personal identifier to each of the remaining unique identities in the merged sets and stores the map in a data store. The computer system further including, based on the inverted personal identifier assigned to the remaining unique identities, assign the inverted personal identifier to each of the plurality of event information including the remaining unique identities. The computer system where the hash functions include locality sensitive hashing. The computer system where the one or more match rules include one or more identity resolution rules that compare u in the one or more sets with account holder information in an external database or CRM system to identify matches to the one or more match rules. The computer system where the identity resolution rules include criteria indicating match criteria between the account holder information and the identifiers. The computer system where the merging sets includes, for each of one or more sets, repeating the process of: pairing each unique identity in a set with another unique identity in the set to create pairs of unique identity; determining a common unique identity in pairs; and in response to determining the common unique identity, grouping noncommon unique identities from the pairs with the common unique identity until lists of unique identities contained within resulting groups are mutually exclusive between resulting groups. The computer system where the determining a common unique identity in pairs further includes sorting the unique identities in pairs. Implementations of the described techniques may include hardware, a method or process, or computer software on a computer-accessible medium.


Another general aspect includes a computer system including: one or more hardware computer processors, and one or more storage devices configured to store software instructions configured for execution by the one or more hardware computer processors to cause the computer system to: receive a plurality of events from one or more data sources, where at least some of the events have heterogeneous structures; store the events in the heterogeneous structures for access by external processes; for each of the data sources; identify a domain based at least in part on data structure or data from the data source; access a vocabulary associated with the identified domain; and for each event; determine whether the event matches some or all a vocabulary; associate the event with the corresponding domain or vocabulary; associate one or more tags with portions of the event based on the determined domain. Other embodiments of this aspect include corresponding computer systems, apparatus, and computer programs recorded on one or more computer storage devices, each configured to perform the actions of the methods.


Implementations may include one or more of the following features. The computer system further including the software instructions, when executed by the one or more hardware processors, are configured to cause the computer system to: receive a request for information associated with a user in a first domain; execute one or more domain parsers configured to identify events associated with the user having one or more tags associated with the first domain; and provide at least some of the identified events to a requesting entity. The computer system where the at least some of the identified events includes only those portions of the identified events associated with the one or more tags associated with the first domain. Implementations of the described techniques may include hardware, a method or process, or computer software on a computer-accessible medium.


Another general aspect includes a computerized method including, by a computing system having one or more computer processors: receiving a plurality of event information from one or more data sources, where the plurality of event information have heterogeneous data structures; determining a domain for each of the one or more data sources based at least in part on one or more of the data source, a data structure associated with the data source, or event information from the data source; accessing a domain dictionary associated with the determined domain including domain vocabulary, domain grammar, and/or annotation criteria; annotating one or more portions of event information from the determined domain with domain vocabulary where based on annotation criteria; receiving a request for event information or data included in event information; interpreting the event information based on the one or more annotated portions of the event information; and providing the requested data based on the interpretation. Other embodiments of this aspect include corresponding computer systems, apparatus, and computer programs recorded on one or more computer storage devices, each configured to perform the actions of the methods.





BRIEF DESCRIPTION OF THE DRAWINGS

Certain embodiments will now be described with reference to the following drawings. Throughout the drawings, reference numbers may be re-used to indicate correspondence between referenced elements. The drawings are provided to illustrate example embodiments described herein and are not intended to limit the scope of the disclosure or the claims.



FIG. 1A illustrates an example credit data system of the present disclosure, according to some embodiments.



FIG. 1B illustrates an example generation, flow, and storage of credit data, according to some embodiments.



FIG. 2A illustrates an example sequential processing of a collection of heterogeneous events, according to some embodiments, according to some embodiments.



FIG. 2B illustrates an example credit data system interfacing with various applications or services, according to some embodiments.



FIG. 3 illustrates an example credit data system structure for simultaneous creation of the credit state and the credit associates for analytics, according to some embodiments.



FIG. 4 illustrates an example batch indexing process, including identity stripping, identity matching, and identity stamping in this embodiment.



FIG. 5 illustrates an example of identity stripping, according to some embodiments.



FIG. 6 illustrates an example process of reducing dimensionality of data using hash algorithms, according to some embodiments.



FIG. 7 illustrates an example identity resolution process, according to some embodiments.



FIG. 8 illustrates an example set merging process, according to some embodiments.



FIG. 9 illustrates an example of associating inverted personal identifiers (“inverted PIDs”) with unique identities, according to some embodiments.



FIG. 10 illustrates an example of stamping inverted PIDs to credit events, according to some embodiments.



FIGS. 11A-11D illustrate an example implementation of a sample identity matching process.



FIG. 12 is a flowchart of an example method for efficiently organizing heterogeneous data at a massive scale, according to some embodiments.



FIGS. 13A-13C illustrates example data models showing defect probability associated with data as the data flows from data ingestion to data consumption.



FIG. 14 illustrates various types of data sources that may provide heterogeneous event information regarding an individual, which may be accessed and analyzed in various embodiments.



FIG. 15 illustrates example domains and their associated vocabularies, according to some embodiments.



FIG. 16 illustrates an example system for and process of tagging event information and then used the tagged event information in providing data insights, according to some embodiments.



FIG. 17 is a flowchart of an example method for interpreting incoming data so as to minimize defect impact in the system, according to some embodiments.





DETAILED DESCRIPTION OF EMBODIMENTS

This disclosure presents various architectures and embodiments of systems and methods related to data association, attribution, annotation, and interpretation systems and related methods of efficiently organizing heterogeneous data at a massive scale. The disclosed systems and methods can be implemented to provide credit data based on smart and efficient credit data architecture.


More accurate and reliable credit-related information can further boost the confidence levels of entities reviewing the credit-related information. For example, accurate and reliable provision of credit statement, cash flow, balance statement, credit score, or other credit attributes can more accurately paint the creditworthiness of an individual. Ideally, collecting all credit-related information related to an individual and updating the individual's credit attributes every time credit-related information is collected would provide such more accurate and reliable credit attributes. However, there are very real technical challenges that make it difficult to have more timely, accurate, and reliable credit attributes. The same or similar challenges may apply to other types of data collection, storage, analysis etc. For example, systems may also struggle with timely resolution of large masses of event data associated with travel-related events, crime-related events, educational-related events, etc. to particular individuals. Thus, any discussion herein of technical problems and solutions in the context of credit-related information are equally applicable to other types of information.


One technical challenge relates to dealing with sheer volume of credit events that need to be collected, analyzed, stored, and made accessible to requesting entities. For example, if there are 40 million people and each person has 20 accounts (e.g., bank accounts, mortgages, car leases, credit cards), there are 800 million accounts that are constantly generating credit events. By a modest assumption, if each credit event contains 1000 bytes of data, sheer volume of raw credit events for 12 months may be approximately 10 terabytes or more of data. If some internal guidelines or external regulations require 5 years of credit events to be archived, the volume may approach 50 terabytes. The challenge is further complicated by the trend of increasing digital transactions both from increasing population and increased digital transaction adoption. Traditional data collection models where collection and analysis of data are treated as distinct steps in a lateral process may fail to meet the demand for quick analytics, statements, and reports.


Another technical challenge relates to dealing with various formats of the event data. The events may be received from various entities, such as lenders, credit card providers, banks, car dealers, brokers, or the like. Often the entities provide credit events in their proprietary data structure or schema. The collected data are often stored in a database, such as a relational database, which, while providing benefits of structured organization with standard data structures, can be ill-equipped in collecting data having heterogeneous structures. Additionally, such databases may require resource-heavy processes of extract, transform, and load (ETL) operations. The ETL operations often also require extensive programming efforts in incorporating data structures from new data sources.


Even when collected data is successfully transformed to conform to database schemas provided by the databases, often the database schemas are too rigid to accommodate information. Expanding the database schemas can quickly become a gargantuan task as new data sources with disparate data structures continue to become available. Accordingly, database managers are put up against decisions to (1) trim extra information that may become important at some point (essentially trimming to fit square data into a round schema), or (2) disregard available nonconforming information altogether knowing that future analysis will be inaccurate. Both approaches are less than ideal as both approaches introduce incompleteness or inaccuracy.


In addition to challenges in collecting data, there also are technical challenges related to analysis. For example, such systems can be painfully slow to generate a credit report for an individual. From multiple terabytes of data (per year), the systems search for records matching a requesting individual in order to generate a credit statement. Such systems may take days or weeks to calculate credit statements for 40 million people. Not only does the delayed generation of the statements not reflect the current state of the individual, but also indicates that a significant amount of computing resources are tied to the task of generating the statements. This provides a non-optimal mechanism for detecting fraud through the credit data, since data on the credit reports may be several days stale by the time it is provided to the user. Further, even when the fraudulent transaction has been removed, it may take multiple days, weeks, or more for the change to be indicated on an updated credit report. Accordingly, it is not too much of an exaggeration to say that credit statements generated from these reporting systems can be misleading in their reflections of an individual's true creditworthiness.


The delay in obtaining results is not the only challenge in analysis. Often, personally identifiable information of individuals are not exact or up to date. For example, someone may use street address with “101 Main Street” for one credit card, but use “101 Main St.” for her mortgage account or, as is quite common, change phone number. Credit events from one financial institution may have an updated phone number while credit events from another financial institution may have an outdated phone number. Such irregularities and outdated personally identifiable information pose a unique challenge to a data analyst, such as to accurately resolve credit events of a user from multiple sources based on personally identifying information that doesn't match between those events.


Credit data storage and analysis systems may implement data models where rigorous ETL processes are positioned near the data ingestion in order to standardize incoming data, where ETL processes involve restructuring, transformation, and interpretation. As will be described, early interpretation can mean early introduction of defects into the data flow, and the extended life cycle of each defect before the data consumption provides ample propagation opportunity for the defect. Additionally, as such systems update ETL processes for each new incoming data with new data structures, significant software and engineering efforts are expended to incorporate the new incoming data. Eventually, marginal effort to maintain the upstream interpretation can overwhelm such system. Also, ETL processes may transform the original data or create a substantially similar copy of the original data. When some defect in the interpretation process is found after the original data is transformed into a standard form, there can be a severe loss of information. Alternatively, when original event data is substantially copied, there is a waste of storage space and severe impact of processing capabilities of the larger data set. In various implementations of credit data systems, one or more of the following technical problems or challenges may be encountered:

    • The data integration approaches, such as data warehouses and data marts, attempt to extract meaningful data items from incoming data and transform them into a standardized target data structure;
    • As the number of data sources grows, the software required to transform data from multiple types of sources also grows in size and complexity;
    • The marginal effort of bringing a new data source becomes larger and larger as incorporating new data sources and formats requires existing software to be modified;
    • Incorporating new data sources and types may cause the target data structure to be modified, requiring conversion of existing data from one format to another;
    • The complexity of software modifications and data conversions can lead to defects. If the defects go unnoticed for a long period of time, significant effort and cost must be expended to undo the effects of the defects through further software modifications and data conversions, and the cycle can go on;
    • These data integration approaches may have high defect leverage because they try to interpret and transform data closer to the point of ingestion.


Therefore, such credit data systems (and other high volume data analysis systems) are technically challenged at least in their lack of agility, adaptability, accuracy, reliability, interoperability, defect management and storage optimization.


Definitions


In order to facilitate an understanding of the systems and methods discussed herein, a number of terms are defined below. The terms defined below, as well as other terms used herein, should be construed to include the provided definitions, the ordinary and customary meaning of the terms, and/or any other implied meaning for the respective terms. Thus, the definitions below do not limit the meaning of these terms, but only provide exemplary definitions.


The terms “user,” “individual,” “consumer,” and “customer” should be interpreted to include single persons, as well as groups of users, such as, for example, married couples or domestic partners, organizations, groups, and business entities. Additionally, the terms may be used interchangeably. In some embodiments, the terms refer to a computing device of a user rather than, or in addition to, an actual human operator of the computing device.


Personally identifiable information (also referred to herein as “PII”) includes any information regarding a user that alone may be used to uniquely identify a particular user to third parties. Depending on the embodiment, and on the combination of user data that might be provided to a third party, PII may include first and/or last name, middle name, address, email address, social security number, IP address, passport number, vehicle registration plate number, credit card numbers, date of birth, and/or telephone number for home/work/mobile. In some embodiments user IDs that would be very difficult to associate with particular users might still be considered PII, such as if the IDs are unique to corresponding users. For example, Facebook's digital IDs of users may be considered PII to Facebook and to third parties.


User Input (also referred to as “Input”) generally refers to any type of input provided by a user that is intended to be received and/or stored by one or more computing devices, to cause an update to data that is displayed, and/or to cause an update to the way that data is displayed. Non-limiting examples of such user input include keyboard inputs, mouse inputs, digital pen inputs, voice inputs, finger touch inputs (e.g., via touch sensitive display), gesture inputs (e.g., hand movements, finger movements, arm movements, movements of any other appendage, and/or body movements), and/or the like.


Credit data generally refers to user data that is collected and maintained by one or more credit bureaus (e.g., Experian, TransUnion, and Equifax), such as data that affects creditworthiness of a consumer. Credit data may include transactional or state data, including but not limited to, credit inquiries, mortgage payments, loan situations, bank accounts, daily transactions, number of credit cards, utility payments, etc. Depending on the implementation (and possibly regulations of the region in which the credit data is stored and/or accessed), some or all of credit data can be subject to regulatory requirements that limit, for example, sharing of credit data to requesting entities based on the Fair Credit Reporting Act (FCRA) regulations in the United States and/or other similar federal regulations. “Regulated data,” as used herein, often refers to credit data as an example of such regulated data. However, regulated data may include other types of data, such as HIPPA regulated medical data. Credit data can describe each user data item associated with a user, e.g., an account balance, account transactions, or any combination of the user's data items.


Credit file and credit report each generally refer to a collection of credit data associated with a user, such as may be provided to the user, to a requesting entity that the user has authorized to access the user's credit data, or to a requesting entity that has a permissible purpose (e.g., under the FCRA) to access the users credit data without the user's authorization.


Credit Event (or “event”) generally refers to information associated with an event that is reported by an institution (including a bank, a credit card provider, or other financial institutions) to one or more credit bureaus and/or the credit data system discussed herein. Credit events may include, for example, information associated with a payment, purchase, bill payment due date, bank transaction, credit inquiries, and/or any other event that may be reported to a credit bureau. Typically one credit event is associated with one single user. For example, a credit event may be a specific transaction, such as details regarding purchase of a particular product (e.g., Target, $12.53, grocery, etc.) or a credit event may be information associated with a credit line (e.g., Citi credit card, $458 balance, $29 minimum payment, $1000 credit limit, etc. Generally, a credit event is associated with one or more unique identifies, wherein each unique identity includes one or more unique identifiers associated with a particular user (e.g., a consumer). For example, each identifier may include one or more pieces of PII of the user, such as all or some portion of a user's name, physical address, social security number (“SSN”), bank account identifier, email address, phone number, national ID (e.g., passports or driver's license), etc.


Inverted PID refers to a unique identifier that is assigned to a particular user to form a one-to-one relationship. An inverted PID can be associated with an identifier of the user, such as a particular PII (e.g., an SSN of “555-55-5555”) or a combination of identifiers (e.g., a name of “John Smith” and an address of “100 Connecticut Ave”) to form a one-to-many relationships (between the PID and each of multiple combinations of identifiers associated with a user). When an event data includes an identifier or combination of identifiers associated with a particular inverted PID, the particular inverted PID may be associated with (referred to as “stamped” herein) to the event data. Accordingly, a system may use inverted PIDs and their associated identity information to identify event data associated with a particular user based on multiple combinations of user identifiers included in the event data.


Credit Data Systems


Credit data associated with a user is often requested and considered by entities such as lenders, credit card providers, banks, car dealers, brokers, etc. when determining whether to extend credit to the user, whether to allow the user to open an account, whether to rent to the user, and/or in making decisions regarding many other relationships or transactions in which credit worthiness may be factor. An entity requesting credit data, which may include a request for a credit report or a credit score, may submit a credit inquiry to a credit bureau or credit reseller. The credit report or a credit score may be determined at least based on analyzing and computing credit data associated with the user's bank accounts, daily transactions, number of credit cards, loan situations, etc. Furthermore, a previous inquiry from a different entity may also affect the user's credit report or credit score.


Entities (e.g., financial institutions) may also wish to acquire a user's most updated credit data (e.g., credit score and/or credit report) in order to make a better decision whether to extend credit to the user. However, there may be substantial delay in generating a new credit report or credit score. In some cases, the credit bureau may only update a user's credit report or score once a month. As described above, the substantial delay may be caused by the sheer volume of data a credit bureau needs to collect, analyze and compute in order to generate a credit report or credit score. The process of collecting credit data that may affect an user's creditworthiness, such as the user's credit score, from credit events is generally referred to herein as “data ingestion.” Credit data systems may perform data ingestion using lateral data flow from system to system, such as by using a batch ETL process (e.g., as briefly discussed above).


In an ETL data ingestion system, credit events associated with multiple users may be transmitted from different data sources to a Database (Online System), such as one or more relational databases. The online system may extract, transform and load raw data associated with different users from the different data sources. The online system can then normalize, edit, and write the raw data across multiple tables in the first relational database. As the online system inserts data into the database, it must match the credit data with the identifying data about consumers in order to link the data to the correct consumer records. When new data comes in, the online system needs to repeat the process and update the multiple tables in the first relational database. Because incoming data, such as names, addresses, etc. often contain errors, does not conform to established data structures, are incomplete, and/or have other data quality or integrity issues, it is possible that new data would initiate reevaluation of certain previously determined data linkages. In such cases, the online system may unlink and relink credit data to new and/or historical consumer records.


In some cases, certain event data should be excluded from a credit data store, such as if there is a detected error in the data file provided by the data source, or a defect in the credit data system software that may have incorrectly processed historical data. For example, an unintelligent credit data system that stores data in the date format MM/DD/YYYY may accept incoming data from a data source using the date format DD/MM/YY, which may introduce error in a user's creditworthiness calculation. Alternatively, such data may cause the credit data system to reject the data altogether, which may result in incomplete and/or inaccurate calculation of a user's creditworthiness. Worse yet, where the erroneous data has already been consumed by the credit data system to produce a user's (albeit inaccurate) creditworthiness metric, the credit data system may need to address complexities of not only excluding the erroneous data, but also unwinding all the effects of the erroneous data. Failure to do so may leave the online database in an inconsistent or inaccurate state.


Such incremental processing logic makes the data ingestion process complex, error-prone, and slow. In ETL implementations, the online system can send data to a batch system including a second database. The batch system may then extract, transform, and load the data associated with credit attributes of a user to generate credit scores and analytical reports for promotional and account review purposes. Due to the time it takes to extract, transform and load data into the batch system, the credit scores and analytical reports may lag the online system by hours or even days. The lagging batch system, in the event of an update to user identifying data, may continue to reflect old and potentially inaccurate user identifying data such that linkages between incoming credit data and the user data may be broken, thereby providing inaccurate credit data until the linkages are corrected and propagated to the batch system.


Overview of Improved Credit Data System


The present disclosure describes a faster and more efficient credit data system directed to address the above noted technical problems. The credit data system may perform sequential processing of a collection of heterogeneous events, simultaneous creation of a credit state and credit attributes for analytics, a batch indexing process, and/or creation of credit profiles in real-time by merging credit state with real-time events, each of which is described in further detail below.


A batch indexing process may more efficiently associate credit events to correct users at a massive scale by efficiently “clustering” unique identities by first reducing dimensionality of the original credit events, identifying false positives, and providing a whole validated set of unique identities that can be associated with a user. By using inventive combination of processes in a particular order, the credit data system solves the particular problem of efficiently identifying credit events belonging to a particular user in efficiency by powers of magnitudes. Additionally, assignment of inverted PIDs allows for a new and more efficient data arrangement that the credit data system can utilize to provide requested credit data pertaining to a user faster by powers of magnitudes. The improved credit data system can generate various analytics of a user's activities and state (such as a credit report) based on up-to-date credit events associated with that user.


The credit data system may implement a lazy data interpretation, in which the system does not alter the heterogeneous incoming data from multiple data sources, but annotates or tags the data without performing ETL processes on the data. By performing only minimal processing near data ingestion, the credit system minimizes software size and complexity near the data ingestion, thereby greatly reducing defect formation and issues with defect management. Additionally, by doing away with ETL processing and preserving data in their original heterogeneous form, the system can accept any type of data without losing valuable information. Domain categorization and domain vocabulary annotation provides for new data structures that allows for late positioning of the interpretation components, such as parsers. The late positioning of parsers improves over the existing systems by reducing overall defect impact on the system and allowing for easy addition or adaptation of the parsers.


While some embodiments of a credit data system or other similarly named systems are discussed herein with reference to various features and advantages, any of the discussed features and advantages may be combined or separated in the additional limitations of a credit data system.



FIG. 1A illustrates an example credit data system 102 of the present disclosure, which may be implemented by a credit bureau or authorized agent of a credit bureau. In FIG. 1A, the credit data system 102 receives credit events 122A-122C associated with different users 120A-120C. The credit data system 102 may include components such as an indexing engine 104, an identification engine 106, an event cache engine 108, a sorting engine 110, and/or a credit data store 112. As will be described further in detail, the credit data system 102 can efficiently match specific credit events to appropriate corresponding users. The credit data system 102 can store the credit events 122A-122C, credit data 114, and/or associations between the different users and the credit events 122A-122C or credit data 114 in the credit data store 112, which may be a credit database of a credit bureau. In some embodiments, the credit database may be spread across multiple databases and/or multiple credit data stores 112. Thus, the credit data ingestion and storage processes, components, architecture, etc. discussed herein may be used to largely replace existing credit data storage systems, such as batch systems. In response to receiving a credit inquiry request from an external entity 116 (e.g., a financial institution, lender, potential landlord, etc.), the credit data system 102 can quickly generate any requested credit data 118 (e.g. a particular transaction, credit report, credit score, custom credit attributes for the particular requesting entity, etc.) based on updated credit event data of the target user.


Additionally, the credit data system may implement a batch indexing process. The incorporation of the batch indexing process may eliminate the need to ETL data from different credit events to conform to a particular database or data structures and, therefore, may reduce or even eliminate bottlenecks associated with ETL of the credit events. The batch indexing process, as will be described in further detail throughout this application, utilizes the indexing engine 104, identification engine 106, event cache engine 108, sorting engine 110, and/or credit data store 112, which are components of the credit data system 102. The indexing engine 104 can assign hash values to unique identities (further detailed with respect to FIG. 4-10) to facilitate “clustering” of similar unique identities. The identification engine 106 can apply matching rules to resolve any issues with the “clustered” unique identities, thereby generating a subset containing only the validated unique identities associated with a user. The sorting engine 110 can merge the subsets into groups of unique identities associated with a same user. The event cache engine 108 can generate an inverted personal identifier (“inverted PID”) and associate each unique identity in a group with the inverted PID. The credit data system 102 can store the association between inverted PIDs and unique identities as an inverted PID map in the credit data store 112 or in any other accessible data stores. Using the inverted PID map, the credit data system 102 can then stamp credit events containing any of the unique identities in a group with the user-associated inverted PID. The credit data system 102 may store the stamp associations 140 related to the credit events 122A-122N pertaining to a user in a flat file or a database. Each component and their inner workings will are further detailed with respect to FIG. 4-10.


Unaltered Processing of Heterogeneous Credit Events



FIG. 1B illustrates an example generation, flow, and storage of heterogeneous credit event, according to some embodiments. A user 120 conducts transactions with one or more business entities 124A-124N (such as merchants). The transactions may include purchasing, selling, borrowing, loaning, or the like and the transactions may generate credit events. For example, a user 120 purchasing an item on credit using a credit card generates a credit transaction data that is collected by financial institutions 126A-126B (such as VISA, MasterCard, American Express, banks, mortgagers, etc.). The financial institutions 126A-B may share such transactions with a credit data store 112 as credit events 122A-122N.


Each credit event 122A-122N can contain one or more unique identities that associate the credit event 122A-122N with a particular user 120 who generated the credit event 122A-122N. A unique identity may include various user identifying information, such as a name (first, middle, last, and/or full name), address, social security number (“SSN”), bank account information, email address, phone number, national ID (passport or driver's license), etc. The unique identities can also include partial names, partial address, partial phone number, partial national ID, etc. When the financial institutions 126A-126B provide credit events 122A-122N for collection and analysis by a credit data system, generally the credit events can be recognized as being associated with a particular user through a combination of user identifying information. For example, there may be multiple people who share same first name and last name (consider “James Smith”) and thus first name and last name may be overly inclusive of other users' credit events. However, combinations of user identifying information, such as full name plus phone number, can provide satisfactory identification. While each financial institution 126 may provide credit events 122A-122N in different formats, the credit events are likely to include user identifying information or combinations of user identifying information that can be used to associate to which user the credit event should be associated. Such user identifying information or combinations of user identifying information forms a unique identity of the user. Accordingly, multiple unique identities may be associated with a particular user.


The credit data system can work with heterogeneous credit events 122A-122N having different data structure and providing different unique identity along with the credit events 122A-122N. For example, a credit event from a mortgager financial institution may include SSN and national ID, whereas a credit event from VISA may include name and address, but not SSN or national ID. The credit data system, instead of performing ETL on the credit events 122A-122N to standardize the credit events 122A-122N for storage on the credit data store 112, can perform an batch indexing process (as later described in detail with respect to FIGS. 4-10) to come up with an inverted PID for a set of unique identities likely to be associated with the user 120. The inverted PID can be assigned to the credit events 122A-122N.


As will be described in further detail, the batch indexing process reduces or eliminates significant computing resource overhead associated with ETL of heterogeneous formats, significantly cuts down processing overhead. Additionally, assigning an inverted PID to a credit event is beneficial in that, once correct inverted PID is assigned to a credit event, the credit data system 120 no longer needs to manage credit events based on the contained unique identities. In other words, once the credit data system 120 has identified a user associated with a credit event, it does not need to perform searching operation to find unique identities in credit events 122A-122N but simply look for the credit events 122A-122N assigned user's inverted PID. For example, in response to receiving a credit data request 118 from an external entity 116 (such as a financial institution, a lender, potential landlord, etc.), the credit data system with the batch indexing process can quickly compile a list of credit events of a user 120 with the user's inverted PID and provide any requested credit data 114 almost instantaneously.


Example of Sequential Processing of Collection of Heterogeneous Events



FIGS. 2A-2B illustrates an example of sequential processing of a collection of heterogeneous events. The credit data system can receive raw credit events from high throughput data sources 202 through a high throughput ingestion process 204. The credit data system can then store the raw credit events in a data store 206. The credit data system can conduct a high throughput cleanse process 208 on the raw credit events. The credit data system can then generate and store canonical cleansed events in a data store 210. The credit data system can conduct a high throughput identify resolution and key stamping process 212. The credit data system can store the identified events with key stamping in a data store 214. The identified credit events can then be sorted in process 216 and stored into an event collection data store 218.


The credit data system can also generate bureau views in process 220. In the process 220, the credit data system can load a user event collection (identified events in the data store 214 that may have optionally been sorted by the sorting process 216) associated with a user in memory at process 222 from the event collections data store 218. The system can then calculate attributes 224, score models 226, and generate nested bureau view 228. The credit data system can then store the attribution calculation in an analytics data (columnar) store 230. The analytics data can be used in applications 234 to generate a credit score for the user. The nested bureau view can be stored in credit state (KV Container) data store 232. The data in the credit state data store can be used in data steward application process 236 and credit inquiry service 238.


During the sequential processing, the credit events may remain in the same state as they are transmitted to the credit data system by the financial institutions. Financial data may also remain the same.


Example of Simultaneous Creation of a Credit State and Credit Attributes for Analytics



FIG. 3 illustrates an example credit data structure of simultaneous creation of the credit state and the credit attributes for analytics. The data structure 300 may virtually be divided to three interactive layers: a batch layer 302, a serving layer 320, and a speed layer 340. In the batch layer 302, high throughput data sources 304 may transmit raw credit events to a data store 310 through a high throughput ingestion process 306. The credit data system can curate and PID stamp 312 the raw credit events and store the curated credit events in a data store 314. The credit data system can then precompute 316 the curated credit events associated with each user to generate a credit state and store each user's credit state in a data store 322. The credit data system can store all the credit attributes associated with each user in a data store 324. The credit attributes associated with a user may then be access by various credit applications 326.


In the speed layer 340, various high frequency data sources 342 may transmit new credit events to the credit data system through a high frequency ingestion process 344. The credit data system can conduct a low latency curation process 348 and then store the new credit events associated with various users in a data store 350. The new credit events associated with a user may cause changes in the user's credit state. The new credit state may be stored in a data store 328. The credit data system can then conduct a credit profile lookup service process 330 to look for a watermark to find the stored credit state associated with the user. In some embodiments, the event cache engine is configured to allow even very recent credit events that aren't yet recorded to the user's full credit state to be included in credit attributes that are provided to third party requesters. For example, while event data is being added to credit data store (e.g., which may take hours or event days to complete), the event stored in the new credit events data store 350 may store the most recent credit events and be accessed when credit inquiries are received. Thus, requested reports/scoring may include credit events within milliseconds of receiving the event from a creditor.


The credit data system can use various bureau applications 332 to calculate a credit score or generate a credit report for the user based on the new credit state. Additionally, the credit data system can send instructions the high frequency ingestion process 344 via a high frequency message channel 352. The new credit events can be transmitted by the high frequency ingestion process 344 again to a file writer process 346. The credit data system can then store the new credit events into an event batch 308. The new credit events can then be stored to the data store 310 through the high throughput ingestion process 306.


The credit data system can store credit events in its original form, generate a credit state based on the credit events and calculate attributes for a user. When a new credit event is transmitted from a financial institution, or an error is detected in an existing credit event by a financial institution, the credit data system can conduct a credit profile lookup service to make changes in the credit state or merge the credit state with real-time events. The credit data system can generate an updated credit profile based on the updated credit state.


The simultaneous creation of the credit state and the credit attributes can monitor changes in a user's credit state and update credit attributes when changes are detected. The changes in the user's credit state may be caused by a new credit event or an error detected in an existing credit event. The credit events may remain the same at least partly because the credit data system do not extract, transform and load data into database. If there is an invalid event detected later by the credit data system, the credit data system can simply exclude the invalid event from future creation. Thus, real-time reporting of events can be reflected on a user's profile within minutes with the help of the credit data system.


Example of Batch Indexing Process



FIG. 4 illustrates a batch indexing process, which includes processes of: identity stripping 402, identity matching 410, and identity stamping 440, according to some embodiments. The batch indexing process can be an especially powerful process in identifying and grouping disparate unique identities of the user (e.g., a credit event from VISA with an outdated phone number can be grouped with a credit event from American Express with an updated phone number). One benefit of the grouping disparate identities is that a user's credit data can be accurate and complete. The batch indexing process can make the credit data system far more efficient and responsive.


The identity stripping process 402 extracts identity fields (e.g., SSN, national ID, phone number, email, etc.) from credit events. The credit data system can partition 404 credit events by different financial institutions (e.g., credit card providers or lenders) and/or accounts. The credit data system can then extract 406 identity fields from the partitioned credit events without modifying the credit events. The identity stripping process 402 may include a specialized extraction process for each different credit event format provided by different financial institutions. In some embodiments, the identity stripping process 402 may conduct a deduplication process 406 to remove same or substantially similar identity fields before generating unique identity, which may be a combination of identity fields, associated with the credit event. This process will be further detailed with respect to FIG. 5.


In the identity matching process 410, the credit data system can perform a process that reduces dimensionality of the unique identities determined in the identity stripping process 402. For example, a locality sensitive hashing 412 process can be such a process. The locality sensitive hashing process, depending on design of the hashing process, can calculate hash values (e.g., identity hashes 414) that have increased or decreased collision probability based on similarity of the original hash keys (e.g., unique identities 408). For example, a well-designed hashing process can take disparate but similar unique identifiers, such as “John Smith, 1983/08/24, 92833-2983” and “Jonathan Smith, 1983/08/24, 92833” (full name, birthdate, and ZIP codes) and digest the disparate but similar unique identifiers into a same hash value. Based on the sharing of the common hash value, the two unique identities can be grouped into a set as potentially matching unique identities associated to a user (the details of the hash-based grouping process will be further detailed with respect to FIG. 6).


However, because hash functions can result in unintended collisions, the hash-based sets can contain false positives (e.g., wrongly associating some credit events not associated with a user to the user. For example, one of John's unique identities may have a same hash value with one of Jane's unique identity and, after hash value association, may get grouped into a same set of unique identities associated with Jane). The credit data system can apply a matching rule application 416 on the sets of unique identities to remove the false positive unique identities from the sets. Various matching rules can be designed to optimize the chance of detecting the false positives. An example match rule can be “only exact match of national ID,” which would remove, from a set of unique identities associated with a user, unique identities that do not include the national ID on file. Another match rule may be “minimum match on both name and ZIP code,” where minimum may be determined based on a calculated score of the match on both name and ZIP code compared against the minimum threshold score. Once false positives are removed from each set, the resulting matched identity subsets 418 contain only the unique identities that are validated.


In some embodiments, the match rules may be designed with trustworthiness of each user identifier in mind. For example, driver's license number from Department of Motor Vehicles can be associated with high confidence level and may not require much beyond inspecting the driver's license numbers for an exact match. On the other hand, a ZIP code provides for lower confidence level. Also, the match rules may be designed to take into account history associated with a particular record. If the record comes from an established bank account having a long history, the match rule may not need to apply strict scrutiny. On the other hand, if the record comes from a newly opened account, a stricter match rule may be required to remove false positives (e.g., identify records in a set that are likely associated with another user). This process will be further detailed with respect to FIG. 7. The match rules may be applied to some or all of the sets. Similarly, some or all of the match rules may be applied to a set.


The subsets 418 of unique identities can then be merged with other subsets containing other unique identities of the user. Each subset 418 contain only the unique identities correctly identifying a user. However, the subsets 418, due to possible false negatives from the dimensionality reducing process, are not guaranteed to digest into a same hash value. Accordingly, some unique identity associated with a user may, when grouped based on hash values, be put in disparate subsets 418. With set merging 420 process, when subsets common unique identities, the credit data system can merge the two subsets into one group (e.g., matched identities 422) containing all the unique identities associated with a particular user.


The credit data system can then assign an inverted PID to each unique identity in the merged group. From the assignments, the credit data system can then create 424 an inverted PID map 426 where each inverted PID is associated with multiple unique identities in the group associated with a particular user. This process will be further detailed with respect to FIG. 9.


In the example identity stamping process 440, the inverted PID map 426 may be used to stamp the partitioned credit events 404 to generate PID stamped credit events 430. In some embodiments, the inverted PID stamping leaves the credit events associated with the inverted PID unaltered. This process will be further detailed with respect to FIG. 10.


Example of Identity Stripping



FIG. 5 illustrates an example of an identity stripping process, according to some embodiments. In some embodiments, the credit data system may “curate” heterogeneous credit events 510 (e.g., e1, e2, e3, e4, e5 . . . ) received from various financial institutions. “Curation” may be considered as a process of fixing obvious quality issues. For example, a street address may be “100 Main Street” or “100 Main St.” The credit data system can recognize the obvious quality issue of having no space between the street number and street name, and/or modify “St.” to read “Street,” or vice versa. The curation process can smartly fix some identified quality issues while not fixing some other identified quality issues. For example, while an address above can be a candidate for curation, curating user names may be less than ideal. Truncating, replacing, or otherwise modifying user names may cause more trouble than leaving the information whole. Accordingly, in some embodiments, the credit data system may selectably curate credit events 502.


The credit data system can partition credit events 504 by different financial institutions and/or accounts. The credit data system can extract 406 identity fields of the credit events and may optionally conduct a deduplication process to eliminate redundant identity fields. The credit data system may then generate unique identities based on the extracted identity fields. The identity stripping process starts with the credit events 510 and extracts unique identities 512. In the example of FIG. 5, credit events e1, e2, e3, e4, e5 . . . 510 may contain records: r1, r2, r3, r4 . . . 512. Records in turn, may contain some or all of a unique identity.



FIG. 5 describes the benefits of an identity stripping process. Where there are 40 million people each having 20 accounts generating credit events (each occupying 1000 bytes per event) over 10 years, there exist approximately 96 terabytes of credit event data. On the other hand, where there is same number of people having same number of accounts, only approximately 3.2 terabyte is occupied by identity attributes of the credit events. If correct association between credit events and a particular user can be made with the stripped unique identities 408 (which include 1/30 of the credit event data), a credit data system has significantly narrowed the universe of data that needs to be analyzed for association to the particular user. Therefore, the credit data system has already significantly reduced computational overhead of the next identity matching process.


Example of Identity Matching: Locality Sensitive Hashing



FIG. 6 illustrates an example process of reducing dimensionality of data using hash algorithms, according to some embodiments. The records containing unique identities (r1-r16) from the identity stripping process are listed on the rows and different hash functions (h1-hk) are listed on the columns. The tabular presentation having rows and columns are for illustrative purpose only and the process may be implemented in any reasonably applicable methods. Additionally, the rate of collision (i.e., applying a hash function on disparate records resulting in same hash values) in the illustration does not reflect the likelihood of collision when real credit events are concerned.


Multiple hash functions (e.g., h1602, h5604, etc.) can be applied on each records (e.g., r1-r16) to generate hash values (e.g., h1606, h5608, h1610, h1612, etc.). Here, each row-column combination represents a hash function of the column being applied on a record of the row to generate a hash value of the row-column combination. For example, has function h1602 applied on unique identity r2620 generates hash value h1610.


In some embodiments, each hash function can be designed to control a probability of collision for a given record. For example, h1602 may be a hash function focusing on finding similar first names by causing collision with other records having similar first names. On the other hand, h5604 may be a hash function focusing on SSN, where likelihood of collision is lower than the hash function focusing on finding similar first names h1. Various hash functions may be designed to better control collision likelihood. One of the benefits of the disclosed credit data system is its capacity to substitute or supplement various hash functions. The credit data system does not require a particular type of hash function, but allows the user (e.g., a data engineer) to experiment with and engineer to improve the overall system by simply interfacing different hash function. This advantage can be significant. For example, when the data engineer wants to migrate the credit data system into another country using another character set, say Chinese or Korean, the data engineer can replace hashing functions directed toward English alphabet to hashing functions that provide better results for Chinese or Korean characters. Also, where national ID is of different format, such as Korea using 12 digit numbers for SSN as opposed to 9 digits SSN in US, a hash function better suited for 12 digit number can replace the 9 digit hash function.


While FIG. 6 illustrates records r1-r16 without modification, some embodiments may pre-process the records to come up with modified records that are better suited for a given hash function. For example, a first name in a record may be concatenated with a last name in the record to form a temporary record for use by a hash function specializing in such modified record. Another example may be truncating 9 SSN number to last 4 digits before applying a hash function. Similarly, a user may modify records to better control collision likelihood and the results.



FIG. 6 illustrates hash function h1 generating two different hash values, h1606 and 610 and h1612. The records {r1, r2, r3, r4, and r5} are associated with hash value h1606 while records {r12, r13, r14, r15, and r16} are associated with hash value h1612. Based on association with a particular hash value, records can be grouped into sets. For example, the illustration shows hash value h1′ group 630 and hash value h1″ group 632 containing the associated records. Similarly, FIG. 6 identifies and presents a total of six sets of records based on common hash values associated with the records. As hash values h1606 and h5608 show for record r1, each record may be associated with multiple hash values each for each hash function.


As described with respect to FIG. 4, records having common hash value may be grouped (“clustered”) into a set. For example, the records {r1, r2, r3, r4, r5} share a common hash value h1′ and are grouped into a set 630. Similarly, records {r2, r7, r15} share a common hash value of h4′ and are grouped into a set 632. As the two groups show, some of the records (for example, r2) may be grouped into more than one set, while some records are grouped into one set


Such hash value based grouping can be an incredibly fast grouping process that does not require much computing resources to execute. A hash function has low operational complexity and calculating hash values for massive amount of data can execute in a relatively short time. By grouping similar records together into sets, the process of identifying which records are associated with a particular user is greatly simplified. In a sense, the universe of all credit events that require association to the user has been narrowed to only the records in the sets.


However, as briefly mentioned with respect to FIG. 4, using hash functions and resulting hash values to group records can be less than ideal because it can contain false positives. In some embodiments, the resulting sets can carry “potential matches,” but the sets may contain records that have not yet been rigorously validated in their association with the user. For example, the set 630 of records having a particular hash value h1′, which are {r1, r2, r3, r4, r5} may contain records that is contained in the set 630 not by the virtue of having similar unique identity, but by the virtue of having a common hash value.


The credit data system then uses a rigorous identity resolution process (“matching rules applications”) to remove such false positives from each set.


Example of Identity Matching: Matching Rules



FIG. 7 illustrates an example identity resolution process, according to some embodiments. After the grouping process described with respect to FIG. 6, the credit data system can apply one or more identity resolution rules (“matching rules”) on the sets of records remove false-positive records from the sets. Various matching rules can be designed to optimize the chance of detecting false positives. An example matching rule can be “only exact match of national ID,” which would remove, from a set of potentially matching records associated with a user, such as records that had same hash value which assigned them to a same set, but upon inspection by the matching rule, are found to have disparate national ID. The matching rules may be based on exact or similar match. For example, the matching rules may also include “a perfect match on national ID, a minimum match on national ID and surname, a perfect match on national ID and similar match on surname.”


In some embodiments, the matching rules may compute one or more confidence scores and compare against one or more associated thresholds. For example, a matching rule of “minimum match on both name and ZIP code” may have a threshold score that determines the minimum match and the matching rule may throw out a record having a computed score below the threshold value. The matching rules may inspect identifiers of records (e.g., names, national IDs, age, birthdate, etc.), format, length, or other properties and/or attributes of the records. Some examples include:

    • Content: reject unless national ID provides exact match.
    • Content: accept when there is a minimum match on national ID AND last name.
    • Content: accept when there is an exact match on national ID AND similar match on first name.
    • Format: reject when user identifying information (e.g., SSN) do not contain 9 digits.
    • Length: reject when user identifying information do not match length of an associated onfile user identifying information.
    • Content, format, and length: reject when driver's license do not start with “CA” AND followed by X number of digits.


The matching rules can also be any other combinations of such criteria.


The resulting subsets 418 after application of matching rules contain same or fewer records compared to the original sets. FIG. 7 illustrates the original sets (e.g., 702 and 704) after the hash value grouping process of FIG. 6 and the resulting subsets (e.g., 712 and 714) after the application of the matching rules. For example, in their respective order, sets associated with h1′, h2′, h3′, h4′, h1″, h2′ originally contained, respectively, 5, 6, 4, 3, 5, and 3 records. After the application of the matching rules, the resulting subsets contain, respectively, 3, 3, 2, 2, 2, and 2 records all of which were previously contained in the original sets. Using the matching rules boosts confidence that all the remaining records are associated with the user.


Example of Identity Matching: Set Merging



FIG. 8 illustrates an example set merging process, according to some embodiments. As discussed regarding existing systems, users sometimes change their personally identifiable information. An example was provided for a user who may not have updated his phone number associated with a mortgager. When the user has updated his phone number with a credit card provider, such as VISA, the reported credit events from the mortgager and VISA will contain different phone numbers while other information are the same. Such irregularities pose a unique challenge to a data analyst because, while both credit events should be associated with a particular user, the associated unique identities may be different and thus hashing function may not group them into a same set. When the records containing the unique identities are not grouped into a same set, the matching rules cannot fix the false negative (the records should have been put in a same set but were not). Thus, there exists a need to identify such irregular records generated by a same user and correctly associate the records to the user. Set merging process provides a solution that efficiently addresses the issue.


After the matching process of FIG. 7, each resulting subsets contain records that can be associated with a user with high confidence. In FIG. 8, there are 6 such subsets. The first subset 802 contains {r1, r3, r5} and the second subset 804 contains {r3, r5, r15}. The two subsets may have become separate subsets because all of the hash functions did not result in a common hash value.


A closer inspection of the first subset and the second subset reveals both subsets contain at least one common record, r3. Because each subset is associated with a unique user, all records in a same subset can also be associated with the same unique user. Logic dictates that if at least one common record exists in two disparate subsets that is associated with a unique user, the two disparate subsets should both be associated with the unique user and the two disparate subsets can be merged into a single group containing all the records in the two subsets. Therefore, based on the common record, r3, the first subset 802 and the second subset 804 are combined to yield an expanded group containing the records (i.e., {r1, r3, r5, r15} of the two subsets after the set merge process. Similarly, another subset 808 containing {r2, r15} can be merged into the expanded group based on the common record r15 to form a further expanded group 820 containing {r1, r2, r3, r5, r15}. Similarly, another group 822 containing {r10, r12, r16} can be formed based on other subsets 806 and 810. After the set merge process is complete, all the resulting groups will be records that are mutually exclusive. Each merged groups may contain all the records containing unique identities associated with a user.


Example Set Merging Process


The above illustrated set merging can use various methods. Speed of merging sets may be important when sheer volume of records count in the millions or even billions. Here, one efficient grouping method is described.


The group algorithm first reduces each set into relationships of degree 2 (i.e., pairs). The algorithm then groups the relationships of degree 2 by the leftmost record. The algorithm then reverses or rotates the relationships of degree 2 to generate additional pairs. Then, the algorithm again groups the relationships of degree 2 by the leftmost record. Similarly, the algorithm repeats these processes until the all subsets are merged into final groups. Each final group can be associated with one user.


For illustrative purpose, subsets in FIG. 7 after matching rules are put through the algorithm. The subsets are:


{r1, r3, r5}, {r3, r5, r15}, {r10, r12}, {r2, r15}, {r12, r16}, and {r1, r3}.


Starting with the subsets, pairs of records (i.e., reducing each group into relationships of degree 2) are generated from the subsets. For example, the first subset containing {r1, r3, r5} can generate pairs:

    • (r1, r3)
    • (r3, r5)
    • (r1, r5)


The second subset containing {r3, r5, r15} can generate pairs:

    • (r3, r5)
    • (r5, r15)
    • (r3, r15)


The third subset containing {r10, r12} can generate pair:

    • (r10, r12)


The fourth subset containing {r2, r15} can generate pair:

    • (r2, r15)


The fifth subset containing {r12, r16} can generate pair:

    • (r12, r16)


The sixth subset containing {r1, r3} can generate pair:

    • (r1, r3)


The example merging process may list all the pairs. Because duplicates do not contain any additional information, the duplicates have been removed:

    • (r1, r3)
    • (r3, r5)
    • (r1, r5)
    • (r5, r15)
    • (r3, r15)
    • (r10, r12)
    • (r2, r15)
    • (r12, r16)


Rotate or reverse each pair:

    • (r1, r3)
    • (r3, r1)
    • (r3, r5)
    • (r5, r3)
    • (r1, r5)
    • (r5, r1)
    • (r5, r15)
    • (r15, r5)
    • (r3, r15)
    • (r15, r3)
    • (r10, r12)
    • (r12, r10)
    • (r2, r15)
    • (r15, r2)
    • (r12, r16)
    • (r16, r12)


Group by first record where the first record is common between the pairs:

    • {r1, r3, r5}
    • {r3, r1, r5, r15}
    • {r5, r3, r1, r15}—duplicate
    • {r15, r5, r3, r2}
    • {r10, r12}
    • {r12, r10, r16}
    • {r2, r15}
    • {r16, r12}


Another round of generating pairs. Duplicates are not shown:

    • (r1, r3)
    • (r3, r5)
    • (r1, r5)
    • (r3, r15)
    • (r1, r15)
    • (r5, r15)
    • (r15, r5)
    • (r15, r3)
    • (r15, r2)
    • (r5, r2)
    • (r3, r2)
    • (r10, r12)
    • (r12, r10)
    • (r12, r16)
    • (r10, r16)
    • (r2, r15)
    • (r16, r12)


Rotate or reverse each pair. Duplicates are not shown:

    • (r1, r3)
    • (r3, r5)
    • (r1, r5)
    • (r3, r15)
    • (r1, r15)
    • (r15, r1)
    • (r5, r15)
    • (r5, r3)
    • (r5, r1)
    • (r3, r1)
    • (r15, r5)
    • (r15, r3)
    • (r15, r2)
    • (r5, r2)
    • (r2, r5)
    • (r3, r2)
    • (r2, r3)
    • (r10, r12)
    • (r12, r10)
    • (r12, r16)
    • (r10, r16)
    • (r16, r10)
    • (r2, r15)
    • (r16, r12)


Group by leftmost record where the first record is common between the pairs:

    • {r1, r3, r5, r15}
    • {12, r3, r5, 115}
    • {r3, r1, r2, r5, r15}
    • {r5, r1, r2, r3, r15}—duplicate
    • {r10, r12, r16}
    • {r12, r10, r16}—duplicate
    • {r15, r1, r2, r3, r5}—duplicate
    • {r16, r10, r12}—duplicate


Another round of generating pairs. Duplicates are not shown:

    • (r1, r3)
    • (r1, r5)
    • (r1, r15)
    • (r2, r3)
    • (r2, r5)
    • (r2, r15)
    • (r3, r5)
    • (r3, r15)
    • (r5, r15)
    • (r1, r2)
    • (r2, r1)
    • (r10, r12)
    • (r10, r16)
    • (r12, r16)


Rotate or reverse each pair. Duplicates are not shown:

    • (r1, r3)
    • (r3, r1)
    • (r1, r5)
    • (r5, r1)
    • (r1, r15)
    • (r16, r1)
    • (r2, r3)
    • (r3, r2)
    • (r2, r5)
    • (r5, r2)
    • (r2, r15)
    • (r15, r2)
    • (r3, r5)
    • (r5, r3)
    • (r3, r15)
    • (r15, r3)
    • (r5, r15)
    • (r15, r5)
    • (r1, r2)
    • (r2, r1)
    • (r10, r12)
    • (r12, r10)
    • (r10, r16)
    • (r16, r10)
    • (r12, r16)
    • (r16, r12)


Group by leftmost record where the first record is common between the pairs:


{r1, r2, r3, r5, r15} {r3, r1, r2, r5, 05}-duplicate {r5, r1, r2, r3, 05}-duplicate {r10, r12, r16}{r12, r10, r16}-duplicate {r16, r10, 02}-duplicate


By repeating the example process of (1) creating pairs, (2) rotating or reversing each pair, (3) group by leftmost record, the subsets merge into the resulting groups illustrated in FIG. 8, which are {r1, r2, r3, r5, r15}, and {r10, r12, r16}.


Example of Creating Inverted PID and Identity Stamping of Events



FIG. 9 illustrates an example process of associating inverted PIDs with identifiers, according to some embodiments. For each final group that is associated with one user, the credit data system can assign an inverted PID. The inverted PID may be generated by the credit data system in a sequential order. FIG. 9 provides two final groups, a first group 902 containing {r1, r2, r3, r5, r15} and a second group 904 containing {r10, r12, r16}. The first group is assigned an inverted PID of p1 whereas the second group is assigned an inverted PID of p2. Each inverted PID is associated with all of the records contained within the assigned group.


The credit data system can create an inverted PID map 426 containing associations between records and inverted PIDs. The inverted PID map 426 may be stored as a flat file or on a structured database. The credit data system may, once an inverted PID map is generated, incrementally update the map 426. As noted with respect to FIG. 8, each group represents a collection of all records (and unique identities contained within the records) that are associated with a particular user. Therefore, whenever two records have a same inverted PID, the credit data system may determine the records to be associated with a particular user regardless of the disparity in the records. The inverted PIDs can be used to stamp credit events.



FIG. 10 illustrates an example of identity stamping process. The credit data process can access and provide lender and/or account partitioned events 404 and the inverted PID map 426 as inputs to a stamping process 428 to generate PID stamped events 430 based on the one or more unique identities contained within the associated records. The stamped credit events 430 can be stored in a data store.


From the hash functions that group similar records into potential matches to set merging to stamping inverted PID to credit events, the credit data system maximizes grouping. Grouping is used to narrow the analyzed universe of credit events, and to quickly access credit events in the future. Using the intelligent grouping instead of performing computationally heavy searching, the credit data system is improved by orders of magnitude. For example, retrieving credit events associated with a user with inverted PID and generating a credit statement has improved 100 times in efficiency.



FIGS. 11A-11D illustrate, to facilitate the disclosure, the example identity matching process of FIG. 6-FIG. 8 with concrete data. FIG. 11A provides the example process of reducing dimensionality of data using hash algorithms applied to concrete values in a tabular form. The leftmost records column 11102 of the table in FIG. 11A lists records r1-r16 contained within credit events. For example, record r1 may be {“John Smith”, “111-22-3443”, “Jun. 10, 1970”, “100 Connecticut Ave”, “Washington DC”, “20036”} and record r2 may be {“Jonah Smith”, “221-11-4343”, “Jun. 10, 1984”, “100 Connecticut Ave”, “YourTown DC”, “20036”} and so forth.


These records contain user identifying information (for example, record r1654 contains user identifying information “John Smith” (name), “111-22-3443” (SSN), “Jun. 10, 1970” (birthday), “100 Connecticut Ave” (street address), “YourTown DC” (city and state), “20036” (ZIP code). The user identifying information were extracted from credit events (FIG. 4, 406) and optionally deduplicated. The user identifying information can, alone or in combination, provide a unique identity, which can associate the record, and the associated credit event, to a particular user. As illustrated, the records can include unique identities.


Various financial institutions can provide more or less of different user identifying information. For example, VISA may provide only the first name and the last name (see, for example, r1) while American Express may provide middle name in addition to first name and last name (see, for example, r15). Some financial institutions may provide credit events that are missing one or more user identifying information all together, such as not providing driver's license number (for instance, r1-r16 do not include driver's license numbers).


Although there is no limit to how many hash functions may be applied to the records, FIG. 11A illustrates three example hash functions, h111104, h211106, and h311108. As described, each hash function can be designed to focus (i.e., increase or decrease collision rates) on different personal identifier or combinations of personal identifiers. Additionally, although not required, the personal identifiers can be pre-processed to generate hash keys that facilitate the objective of each hash functions. For example, hash function h111104 uses pre-processed hash key that “sums SSN digits, uses last name, birth month, birth day of month.” The record r1 can be pre-processed to provide a hash key “21Smith0610.” Using pre-processing of h111104, the records r2, r3, r4, and r5 will also provide the same hash key “21Smith0610.” However, for hash function h111104, the record r14 will provide a different hash key of “47Smith0610.” The different hash keys are likely to result in different hash values. For example, the same hash key “21Smith0610” of r1, r2, r3, r4, and r5 results in “KNOONKL” while the hash key “47Smith0610” resulted in some other hash value. Thus, according to the hash function h111104, the records sharing same hash value “KNOONKL” (i.e., r1, r2, r3, r4, and r5) are grouped as potential matches.


Hash function h211106 uses a different pre-processing, namely “SSN, birth month, birth day of month.” The records r3, r5, and r15, according to the pre-processing of h211106, produce a hash key of “111-22-34340610.” Using the hash function h211106, the hash keys calculate to “VB556NB.” However, hash functions can result in unintended collisions (in other words, false positives). The unintended collisions result in unintended record in a set of potential matches. For example, record r14, according to the pre-processing of the hash function h211106, resulted in a hash key of “766-87-16420610,” which is different with the hash key “111-22-34340610” associated with r3, r5, and r15, but nevertheless computed into same hash value “VB556NB.” Thus, when records are associated based on sharing a shame hash value from a hash function, the potential set of records belonging to a certain user may have unintendedly included a record belonging to a different user. As described, and also will be illustrated with concrete samples in FIG. 11B, matching rules can help resolve identity of the false positive records in each set.


Each hash function may result in more than one set of potential matching records. For example, FIG. 11A illustrates hash function computing two sets of hash values “VB556NB” and “NH1772TT.” Each hash value set is a set of potentially matching records. According to the example, hash function h211106 produces “VB556NB” hash value has a potentially matching record set {r3, r5, r14, r16} and “NH1772TT” hash value has a potentially matching record set {r8, r9, r10, r12}.



FIG. 11B illustrates the sets 11202, 11204, 11206, 11208 of potentially matching records according to their common hash values. Based on FIG. 11A, the potentially matching record set 11202 associated with the hash value “KNOONKL” includes {r1, r2, r3, r4, r5}. Similarly, the potentially matching record set 11204 associated with the hash value “VB556NB” includes {r3, r5, r14, r16}. The potentially matching record set 11206 associated with the hash value “NH1772TT” includes {r8, r9, r10, r12}. Similarly, the potentially matching record set 11208 associated with the hash value “BBGT77TG” includes {r12, r13, r14, r15, r16}.


Each set may include false positives. For example, although the potentially matching record set 11202 associated with the hash value “KN00NKL” includes {r1, r2, r3, r4, r5}, r2 and r4 do not seem to belong to the set of records that should be associated to John (Frederick) Smith because r2 has different “SSN and birth year” and r4 has different “first name, SSN, birth year, address, city, state, and ZIP code.” Determining whether any of the r1, r3, or r5 are false positives are trickier because there are only slight variations in SSN and birth year (rotated two digits in SSN or birth year that is only one year apart). Therefore, the records r2 and r4 are likely to be false positives while r1, r3, r5 are true positives. Similarly, other sets may contain true positives and false positives.



FIG. 11C illustrates application of one or more matching rules to resolve identity (i.e., remove such false positives) from the sets in FIG. 11B. Variety of match rules was disclosed with respect to FIG. 7. For example, applying one such rule of “exact match on last name, rotations of up to two digits in SSN AND birth year less than 2 years apart” can successfully remove the possible false positives from the set 11302, thereby providing a subset containing only {r1, r3, r5}. In some embodiments, the records in a set may be compared against an on file data of the user (e.g., verified user identifying information). In some embodiments, the records in a set themselves may be compared against each other to determine the highly probable true positive personal identifiers first then apply the matching rules against the determined personal identifiers.


In some embodiments, the matching rules can calculate confidence scores and compare against thresholds to accept or reject a record in a set. For example, the set 11304 with hash value “VB556NB” may use a rule that calculates character-matching score on name. The record r14 has full name “Eric Frederick” which at best, among other records in the set 11304, matches 9 characters out of 18 characters of “John Frederick Smith” and/or “John Smith Frederick.” Therefore, a score of 50% may be calculated and compared against a minimum match threshold of, say 70%, and the credit data system may reject r14 from the set 11304. Other matching rules can be designed and applied to the sets 11302, 11304, 11306, 11308 to remove rejected records and generate subsets. In some embodiments, some or all of such matching rules may be applied across different sets 11302, 11304, 11306, 11308. FIG. 11C illustrates, subsets that contain {r1, r3, r5}, {r3, r5, r15}, {r10, r12}, and {r12, r16}.



FIG. 11D illustrates application of set merging rules on subsets 11302, 11304, 11306, 11308 identified in FIG. 11C, thereby providing merged groups 11402, 11404. Each subsets 11302, 11304, 11306, 11308 from FIG. 11C contain records that can be associated with a user with high confidence. FIG. 11C, after the application of the matching rules, provides 4 such subsets. The first subset 11302 contains {r1, r3, r5} and the second subset 11304 contains {r3, r5, 05}.


A closer inspection of the first subset and the second subset reveals both subsets contain at least one common record, r3. Because each subset is associated with a unique user, all records in a same subset can also be associated with the same unique user. Logic dictates that if at least one common record exists in two disparate subsets that are associated with a unique user, the two disparate subsets should both be associated with the unique user and the two disparate subsets can be merged into a single group containing all the records in the two subsets. Therefore, based on the common record, r3, the first subset 11302 and the second subset 11304 are combined to yield a group 11402 containing all the records (i.e., {r1, r3, r5, r15} of the two subsets after the set merge process. Similarly, another group 11404 containing {r10, r12, r16} can be formed based on other subsets 11306 and 11308. After the set merge process is complete, all the resulting groups will have mutually exclusive records. Each merged groups may contain all the records containing unique identities associated with a user.


When the algorithm described in regards to FIG. 8 is applied to the original subsets:

    • {r1, r3, r5}, {r3, r5, r15}, {r10, r12}, and, {r12, r16}


Starting with the subsets, pairs of records (i.e., reducing each group into relationships of degree 2) are generated from the subsets. For example, the first subset containing {r1, r3, r5} can generate pairs:

    • (r1, r3)
    • (r1, r5)
    • (r3, r5)


The second subset containing {r3, r5, r15} can generate pairs:

    • (r3, r5)
    • (r3, r15)
    • (r5, r15)


The third subset containing {r10, r12} can generate pair:

    • (r10, r12)


The fourth subset containing {r12, r16} can generate pair:

    • (r12, r16)


The example merging process may list all the pairs. Because duplicates do not contain any additional information, the duplicates have been removed:

    • (r1, r3)
    • (r1, r5)
    • (r3, r5)
    • (r3, r15)
    • (r5, r15)
    • (r10, r12)
    • (r12, r16)


Rotate or reverse each pair:

    • (r1, r3)
    • (r3, r1)
    • (r1, r5)
    • (r5, r1)
    • (r3, r5)
    • (r5, r3)
    • (r3, r15)
    • (r15, r3)
    • (r5, r15)
    • (r15, r5)
    • (r10, r12)
    • (r12, r10)
    • (r12, r16)
    • (r16, r12)


Group by first record where the first record is common between the pairs:

    • {r1, r3, r5}
    • {r3, r1, r5, r15}
    • {r5, r1, r3, r15}
    • {r10, r12}
    • {r12, r10, r16}
    • {r15, r3, r5}
    • {r16, r12}


Another round of generating pairs. Duplicates are not shown:

    • (r3, r1)
    • (r3, r5)
    • (r3, r15)
    • (r1, r5)
    • (r1, r15)
    • (r5, r15)
    • (r10, r12)
    • (r16, r12)
    • (r10, r16)


Rotate or reverse each pair. Duplicates are not shown:

    • (r3, r1)
    • (r1, r3)
    • (r3, r5)
    • (r5, r3)
    • (r3, r15)
    • (r15, r3)
    • (r1, r5)
    • (r5, r1)
    • (r1, r15)
    • (r15, r1)
    • (r5, r15)
    • (r15, r5)
    • (r10, r12)
    • (r12, r10)
    • (r16, r12)
    • (r12, r16)
    • (r10, r16)
    • (r16, r10)


Group by leftmost record where the first record is common between the pairs:

    • {r1, r3, r5, r15}
    • {r3, r1, r5, 05}—duplicate
    • {r5, r1, r3, 05}—date
    • {r10, r12, r16}
    • {r12, r10, r16}—duplicate
    • {r15, r1, r3, r15}—duplicate
    • {r16, r12, 00}—duplicate


After application of the set merging algorithm, two groups {r1, r3, r5, r15} and {r10, r12, r16} each containing mutually exclusive records remain.



FIG. 12 is a flowchart 1200 of an illustrative method for efficiently organizing heterogeneous data at a massive scale. The illustrated method is implemented by a computing system, which may be a credit data system. The method 1200 begins at block 1202, where the computing system receives a plurality of event information from one or more data sources. The event information data source may be a financial institution. In some embodiments, the event information may have heterogeneous data structures between the event information from a same financial institution and/or across multiple financial institutions. The event information contains at least one personally identifiable information (“identity field” or “identifier) that associates the event information to an account holder who is associated with an account that generated the credit event. For example, credit event information (or for short, “credit event”) can contain one or more identity field that associates the credit event to a particular user who generated the credit event by executing a credit transaction.


The computer system may access the plurality of event information by directly accessing a memory device or data store where a pre-existing event information from the data sources are stored, or the event information may be obtained in real-time over a network.


At block 1204, the computer system may extract identity fields of account holders included in the event information. The identity field extraction can involve formatting, transformation, matching, parsing, or the like. The identity fields can include SSN, name, address, ZIP code, phone number, e-mail address, or anything that can be, alone or in combination, used to attribute event information to an account holder. For example, name and address may be enough to identify an account holder. Also, an SSN may be used to identify an account holder. When the event information count in the billions and are received from many data sources using heterogeneous formats, some accounts may not provide certain identity fields and some identity fields may contain mistyped or wrong information. Therefore, when working with a massive amount of event information, it is important to consider combinations of identity fields. For example, relying on just SSN to distinguish account holders can result in misidentification of associated account holders where SSN is mistyped. By relying on other available identity fields, such as names and address, a smart computer system can correctly attribute event information to a same user. Combinations of identity fields can form unique identities used to attribute event information to users who are associated with the events.


At block 1206, the computer system may optionally deduplicate the unique identities to remove same unique identities. For example, one event information may provide, when extracted, “John Smith”, “555-55-5555” (SSN), “jsmith@email.com” (e-mail), and “333-3333-3333” phone number. Another event may also provide “John Smith”, “555-55-5555” (SSN), “jsmith@email.com” (e-mail), and “333-3333-3333” phone number. The unique identities of the two event information are the same, and thus can be candidates for deduplication. One of the unique identities may be removed so that only the non-duplicated unique identities are subject to operations at block 1208.


At block 1208, the computer system may reduce dimensionality of the unique identities with a plurality of dimensionality reduction processes. Goal in this block is to “cluster” unique identities based on some similarities contained in the unique identities. An example process that may be used to reduce the dimensionality of the unique identities based on contained similarities may be a locality sensitive hashing function. The computer system may provide plurality such dimensionality reduction processes, each process focusing on one aspect of similarity contained within the unique identities, to provide multiple “clusters” of similar (and potentially attributable to a particular user) unique identities. When locality sensitive hashing functions are used, unique identities are associated with hash values, wherein each hash function applied generates a hash value for a given unique identity. Accordingly, each unique identity may be associated with a hash value for each hash function.


At block 1210, the computer system groups the unique identities into sets based at least in part on the results of the dimensionality reductions functions having a common value. The grouping into sets is extensively detailed at an abstract level with FIG. 6 and with concrete sample values with FIG. 11B. As described with respect to FIG. 6 and FIG. 11B, the resulting sets contain potential matches and can also contain false positives.


At block 1212, the computer system, for each set of unique identities, applies one or more match rules with criteria to remove the false positives. After the application of the match rules resulting in the removal of the false positives, the sets may become subsets of their previous sets before the application of the matching rules including only the verified unique identities.


At block 1214, the computer system merges the subsets to arrive at groups of unique identities. The set merge process includes identifying common unique identities in the subsets, and when the computer system finds at least one common unique identity, merges the subsets that contain the common unique identity. The set merging is extensively detailed at an abstract level with FIG. 8 and with concrete sample values with FIG. 11D. Also, an example of an efficient method of set merging was disclosed above. After the set merging, the merged groups include mutually exclusive unique identities.


At block 1216, the computer system provides a unique inverted PID for each of the groups. In a sense, this process is recognizing that each group represents a unique account holder. At block 1218, the computer system assigns the inverted PID provided for each group to all the unique identities contained within each associated group. In a sense, this process is recognizing that each of the unique identifiers, when found in event information, can identify the event information to belong to the particular account holder associated with the inverted PID.


At block 1220, the computer system inspects event information to find a unique identifier and, when a unique identifier is found, stamps the event information with an inverted PID associated with the unique identifier.


Ingestion and Consumption of Heterogeneous Data Collections (HDC)


When a system is collecting and analyzing a massive amount of heterogeneous data, there exists a possibility that some of the incoming data contain or lead to a “defect.” Defect may be broadly defined as any factor that leads to a software modification or data conversion. For example, some financial institutions that report credit events may provide non-standardized data that requires extensive ETL processing as part of data ingestion. In the process of ETL, some defects may be introduced. An example may be phone numbers using “(###) ###-####” format as opposed to “###.###.####” format. Another example is European date format versus US date format. Yet another example may be defects introduced as a result of adoption of daylight savings time. Accordingly, these defects can be introduced due to a software bug in ETL process or lack of design generalizability. Sometimes, human errors can also be a factor and cause some forms of defects. Therefore, there is a room for improving existing systems that are inadequately prepared to address defect formation and handling.


Existing data integration approaches, such as data warehouses and data marts, attempt to extract meaningful data items from incoming data and transform them into a standardized target data structure. Often, as the number of data sources providing heterogeneous data grows, software and engineering efforts required to transform or otherwise address the growing number of heterogeneous data collection also grows in size and complexity. Such system requirements and human requirements can grow to a point that marginal effort of modifying existing system and maintaining the modified system can lead to more defects. For example, incorporating a new data sources and formats can require existing system's data structure to be modified, which can at times require conversion of existing data from old data format to a new data format. The conversion process can introduce new defects. If the defects go unnoticed for a long period of time, significant effort and cost must be expended to undo the effects of the defects through further software modifications and data conversions. Ironically, such further software modifications and data conversions can also lead to defects.


The credit data systems described herein address the defect management problem by implementing what may be called a “lazy interpretation” of data, which is further detailed with respect to defect models of FIGS. 13A-13C below.


Defect Models



FIG. 13A is a general defect model 13100 showing defect probability associated with data as the data flows from data ingestion to data consumption (i.e., from left to right) across multiple system states. A system can have an associated “defect surface” 13102, which can be defined as the probability distribution of having defects for a given software component based upon its functional scope and design complexity. The height of the defect surface 13102 can reflect the defect probability P(D) for a combination of functional scope and design complexity. In other words, where software's functional scope and design complexity is high, the height of the defect surface 13102 will be high. Where software's functional scope and design complexity is low, the height of the defect surface 13102 will be low. The defect surface 13102 is mostly flat, indicating that software's functional scope and design complexity does not change across the states.



FIG. 13A also illustrates a related concept of “defect leverage.” A defect leverage can be defined as the amount (or, distance) of downstream software components that may be impacted by a given defect. A defect near data ingestion 13104 has greater distance toward downstream and thus has greater defect leverage than a defect near data consumption 13106. From the defect probability and defect leverage, a defect moment can be calculated, which can be defined as:

Defect Moment=Defect Probability*Defect Leverage.


The defect moment can be understood as a defect's probable impact on the system. An integrated sum of the defect moment can quantify the expected value of the amount of defects for the system. Therefore, minimizing the sum of defect moment is desirable.



FIG. 13B illustrates a defect surface model 13200 for a system using ETL processes. The restructuring, transformation, and standardization (all of which can be a part of ETL processes) are provided at the early data ingestion. Also, interpretation occurs at early ingestion as well in order to assist the ETL process. Insight gathering as part of analysis and reporting occur at the end of the data flow, near the data consumption.


As described, the ETL processes can increase in complexity when dealing with heterogeneous data sources. Accordingly, FIG. 13B illustrates a defect surface 13202 that is high (indicating high functional scope and software complexity) near the data ingestion and lower near the data consumption. The system exhibits highest defect surface 13202 where defect leverage is the highest (near data ingestion) and the lowest defect surface 13202 where the defect leverage is the lowest (near data consumption).


This type of high-to-low defect surface 13202 poses issues when defect moment is considered. Defect moment was defined as a product of defect probability and defect leverage, where the integrated sum of the defect moment quantifies the expected value of the amount of defects for the system. In this existing system, because high values are multiplied with high values and low values with low values, the integrated sum of the products can be quite large. Accordingly, the expected value of the amount of defects can be quite large.



FIG. 13C illustrates a defect surface model for the credit data system. Contrary to the existing systems, the credit data system does not execute ETL processes (e.g., restructuring, transformation, standardization, recoding, etc.) but may limit its processing to validating, curating (e.g., performing quality control), and matching/linking the incoming data. The validation, curation, and matching/linking processes are not as complex as the software components for ETL process and have low probability of defect. Thus, FIG. 13C illustrates the credit data system's defect surface 13302 low near the data ingestion and high near the data consumption. Accordingly, the credit data system exhibits lowest defect surface 13302 where defect leverage is the highest (near data ingestion) and the highest defect surface 13302 where the defect leverage is the lowest (near data consumption).


This type of low-to-high defect surface 13302 is highly beneficial when defect moment is considered. In the credit data system, because low defect probabilities are multiplied with high defect leverages and high defect probabilities are multiplied with low defect leverages, the integrated sum of the products can be much smaller than in existing systems. Therefore, the credit data system provides an improved defect management in relation to data ingestion and data consumption.


Lazy Interpretation of Data


A “lazy interpretation” system, instead of interpreting incoming data near data ingestion (as the data model 13200 for traditional systems in FIG. 13B illustrates), delays the interpretation as late as possible in the data-to-insight pipeline in order to minimize the integrated defect moment. FIG. 13C illustrates an example defect model 13300 of such lazy interpretation system according to one implementation.


The lazy interpretation system can accept any type of event data, such as from data sources that have various data types, formats, structures, meanings, etc. For example, FIG. 14 illustrates various types of event data related to an anchoring entity 1402, shown as a particular user in this example. An anchoring entity may be any other entity for which resolution of event data is provided. For example, an anchoring entity may be a particular user and various data sources may provide heterogeneous data events, such as vehicle loan records 1404, mortgage records 1406, credit card records 1408, utility records 1410, DMV records 1412, court records 1414, tax records 1416, employment records 1418, etc., associated with the particular user.


In some embodiments, as new event data is accessed, the system identifies only the minimal information required to attach the data to a correct anchoring entity. For example, an anchoring entity may be a particular user and the minimum information required for attaching the new data to the particular user may be identifying information such as name, national ID, or address. When receiving new data, the system may look for this minimal set of identifying information of the particular user in the data and attaches the data with one or more user association tags (for example, where anchoring entity is a user associated with credit events, an inverted PID is one example of a user-associated tag). For a given data, the lazy interpretation system can later use the tags to identify a correct anchoring entity. The process of attaching a tag can be the matching/linking process in FIG. 13C. In some embodiments, the matching/linking process does not alter the incoming data or data structure.


The tagging/matching/linking process may be akin to cataloging a book. For example, based on an International Standard Book Number (“ISBN”), book title, and/or author of a book, a librarian can place the book on a correct section and shelf. The content or plot of the book is not necessary in the cataloging process. Similarly, based on minimal information that identifies an anchoring entity, a vehicle loan record 1404 can be associated with a particular anchoring entity. In some embodiments, each record and/or data source may be associated with a domain (further described with respect to FIG. 15). For example, a vehicle loan record 1404 or the vehicle loan data source may be associated with a “vehicle loan domain,” a credit card record 1408 or the credit card data source may be associated with a “credit domain,” and a mortgage record 1406 or the mortgage data source may be associated with a “mortgage domain.”


In some embodiments, the lazy interpretation system may include an Anchoring Entity Resolution (AER) process that corrects tags attached to the previously received data to be associated with the best known anchoring entity. The best known anchoring entity may dynamically change based on information contained in the new incoming data, such as based on the analytics of previously received data, or based on improvements in anchoring entity resolution itself. In some embodiments, the anchoring entity resolution may update the previously attached tags. The anchoring entity resolution process may periodically or continuously run in the background or foreground, may be automatically triggered by the occurrence of a predefined event, and/or initiated by a system overseer, requesting entity, or other user.


The lazy interpretation system limits the probability of defect to the interpretation and handling of identifying information. By doing away with the ETL processes of traditional systems, the lazy interpretation system reduces software and engineering efforts required to transform or otherwise address the growing size and complexity of heterogeneous data collection. As FIG. 13C illustrates, the defect surface 13302 is lowered for states that are further upstream from the states near the data consumption, thereby reducing the defect moments.


Domain Dictionary and Vocabulary


The lazy interpretation system may include one or more parsers (FIG. 13C, 13304) for interpretation of data. Unlike existing systems with interpretation component (FIG. 13B, 13204) positioned near the data ingestion, the lazy interpretation system has the interpretation component (e.g., “parsers”) positioned further toward the data consumption (FIG. 13C, 13304). Parsers may be associated with domains, such as credit domain 1502, utility domain 1504, and/or mortgage domain 1506.


The lazy interpretation system may associate incoming data or data sources with one or more domains. For example, a credit card record 1408 or its data source may have been associated with the “credit domain.” Each domain includes a dictionary that includes vocabulary for the domain. FIG. 15 illustrates domains and their associated vocabularies. For example, a credit domain 1502 may have an associated dictionary including vocabulary of “@credit_limit,” “@current_balance,” and “@past_due_balance.” Similarly, a utility domain 1504 may have an associated dictionary including vocabulary of “@current_balance,” and “@past_due_balance” As illustrated, vocabularies may be repeated across different domains, such as “@current_balance” and “past_due_balance.” However, each domain has its sets of rules for interpretation and parsers associated with a particular domain can appropriately interpret identical vocabulary in one domain distinctly from the vocabulary in another domain based on each record's respective domain.


Based on the dictionary and the vocabularies contained within, the one or more parsers inspect the contents of the records and tag fields or values with the matching vocabulary. The parsing process may be akin to scanning through the books to identify/interpret relevant content. Similar to scanning history books for contents relevant to “George Washington” and tagging contents describing George Washington's birthplace, birth date, age, or the like with “@george_washington,” a credit parser 1508 may scan records from a credit data source or records in the credit domain and identify/interpret contents that could be relevant to credit limit and tag the identified/interpreted contents with “@credit_limit” tag (FIG. 16 illustrates examples of tagging identified contents with @credit_limit). Similarly a utility domain parser 1510 may scan records, such as a utility invoice, from a utility data source or records in the utility domain and identify contents that could be relevant to past due balance and tag the identified contents with “@past_due_balance” tag.


Once tagged, downstream components including consistency checking, insight, and/or reporting in FIG. 13C can analyze the content of a record using the vocabulary for the record's domain. In some embodiments, a downstream component (e.g., any insight calculation component 1512) may interpret records from more than one domain for its use. For example, a mortgage scoring component can look for “@credit_limit” in data from the credit domain before making a determination on a potential mortgagee's creditworthiness.


Advantageously, the lazy interpretation provides the benefit of reducing the defects' effects. The above described interpretation by the parsers is, as FIG. 13C, 13304 illustrates, closer to the data consumption than the interpretation existing systems offer. Therefore, the defects in the lazy interpretation system have limited leverage, and thus have reduced impact.


Another benefit the lazy interpretation system provides is that the system does not need to alter the original or existing heterogeneous event data. Instead of ETL processing to standardize the data for storage and interpretation, the system tags and postpones interpretation to parsers. If one or more parsers are found to introduce defects into a domain, a data engineer simply can update the one or more domain parsers. Because the original or existing event data has not been altered, re-executing parsers can quickly eliminate defects without loss of data. Additionally, in some embodiments, because a data is not copied throughout the data flow, a data engineer may curate, delete, or exclude any data without needing to update other databases.


Therefore, the lazy interpretation system's data ingestion does not need ETL processes and, therefore, the lazy interpretation system allows new data sources to be brought in rapidly and at low cost.



FIG. 16 illustrates an example process 1600 of lazy interpretation using some sample content, according to some embodiments. A domain dictionary 1602 may include a domain vocabulary 1604 and domain grammar 1606. The domain vocabulary 1604 may include keyword definitions for annotating (e.g., tagging as described with respect to FIG. 15) data. The domain vocabulary 1604 can include “primary words” and “composite words.” In some embodiments, the primary words are tags that are directly associated (or “annotated”) with some portion of the heterogeneous data. For example, the lazy interpretation system tagged some portion of the incoming data 1610 with @CreditLimit and @Balance. Composite words are synthesized from one or more primary words or other variables with domain grammar 1606. An example of domain grammar 1606 may be that “an average balance for N records equals summing each account balance and dividing by N,” which may be expressed in domain grammar 1606 with two primary words @Balance as “@AverageBalance[n]=Sum(@Balance)/n).


The domain dictionary 1602 may also include predefined source templates 1608 for heterogeneous data sources. The source templates 1608 act as a lens to expose important fields. For example, a simple example source template can be “for incoming data 1610 from a VISA data source, 6th data field is a @CreditLimit and 7th data field is a @Balance.” The annotation contributor 1612 can use one or more such source templates 1608 to tag/annotate incoming data in a domain to generate annotated data 1614. In some embodiments, machine learned models and/or other artificial intelligence may be used to supplement or replace source templates 1608 in determining and exposing important fields.


The lazy interpretation system may also include one or more domain parsers 1616. The domain parser 1616 can use annotations/tags and rules embedded in its software to present fully annotated data to applications. In some embodiments, the domain parser can, in addition to or in place of the annotations/tags that the annotation contributor 1612 provides, provide some annotations/tags to generate the fully annotated data. The domain parser 1616 can refer to the domain dictionary 1602 in its presentation of the fully annotated data to the applications or in its own annotation/tagging.


A score calculation application 1618 and an insight calculation application 1620 are provided as the example applications that can use the fully annotated data. The score calculation application 1618 may, based on the annotated data calculate a credit score (or other scores) of one or more users and provide to a requesting entity. Similarly, the insight calculation application 1620 may provide analytics or reports including balance statement, cash flow statement, spending habits, possible saving tips, etc. In some embodiments, various applications, including the score calculation 1618 and insight calculation 1620 applications, may use the fully annotated data in conjunction with the inverted PID from the batch indexing process to quickly identify all the annotated records belonging to a particular user and generate a report or analytic relating to the user.



FIG. 17 is a flowchart 1700 of an illustrative method for interpreting incoming data so as to minimize defect impact in the system, according to some embodiments. Depending on the embodiment, the method of FIG. 17 may include fewer or additional blocks and the blocks may be performed in an order that is different than illustrated.


Beginning at block 1702, the interpretation system (e.g., one or more components of the credit data system discussed elsewhere herein) receives a plurality of event information (see, FIG. 14) from one or more data sources. A data source may be a mortgager, credit card provider, utility company, vehicle dealer providing vehicle loan records, DMV, courts, IRS, employer, banks, or any other source of information that may be associated with entities for which entity resolution is desired. In some embodiments, the data sources provide the plurality of event information in heterogeneous data formats or structures.


At block 1704, the lazy interpretation system determines a category or type of information (also referred to herein as a “domain”) associated with the data sources. The determination of a domain for a data source may be based on information provided by the data source. In some embodiments, the system may be able to determine (or confirm in situations where the data source provides domain information) the associated domain from inspection of the data source's data structure. In some embodiments, the event information may include some cues indicative of the domain of a particular data source and the system may be able to determine a domain for the data source based on the cues. For example, if event information (or a large portion of event information) includes the terms “water” or “gas,” the system may automatically determine that the data source should be associated with a utility domain.


At block 1706, the system accesses a domain dictionary for the determined domain. The domain dictionary may include a domain vocabulary, domain grammar, and/or annotation criteria, examples of wherein are described above with respect to FIG. 16.


At block 1708, the system annotates event information from the determined domain with the domain's dictionary. For example, based on the annotation criteria, the system evaluates the event information and identifies one or more portions which can be annotated with domain vocabulary. FIG. 16 illustrates example event information 1610 before annotation and then the annotated event information 1614 with annotations associated with certain event information. In some embodiments, the event information are updated only with the domain annotations (such as in the example annotated event information 1614) and are otherwise unaltered. In some embodiments, once event information are annotated, they are left undisturbed until the system receives a data request for the event information, such as information associated with particular annotations (e.g., requests for @Creditlimit data of event information may be requested to calculate an overall credit limit across multiple accounts of a consumer, which may be included in a credit report or similar consumer risk analysis report).


At block 1710, the system receives data requests for event information. The requests may be for the event information (e.g., all event information that includes a particular annotation or combination of annotations) or for particular data included in the event information (e.g., portions of event information specifically associated with an annotation). For example, with respect to the annotated event information 1614 of FIG. 16, a request may be for the whole annotated credit event information or only @Balance data in the credit event information. The data request may be from another component of the system, such as score calculation application, insight calculation application, or the like, or may be from another requesting entities, such as a third party.


At block 1712, the system analyzes event information with one or more domain parsers to identify the information requested. As described with reference to FIG. 16, the domain parsers may use the domain dictionaries to interpret the event information. For example, a domain parser may use a domain vocabulary to find one or more primary words. Then, the domain parser may use a domain grammar to determine a composite word based on the one or more primary words. In some embodiments, a domain parser may request another domain parser to provide necessary data for its interpretation. For example, a mortgage domain parser may request @credit_score from a credit domain parser in generating its composite word according to a domain grammar requiring a credit score. At block 1714, the system provides the requested data to a requesting application or a requesting entity.


Additional Embodiments

It is to be understood that not necessarily all objects or advantages may be achieved in accordance with any particular embodiment described herein. Thus, for example, certain embodiments may be configured to operate in a manner that achieves or optimizes one advantage or group of advantages as taught herein without necessarily achieving other objects or advantages as may be taught or suggested herein.


All of the processes described herein may be embodied in, and fully automated, via software code modules executed by a computing system that includes one or more computers or processors. In some embodiments, at least some of the processes may be implemented using virtualization techniques such as, for example, cloud computing, application containerization, or Lambda architecture, etc., alone or in combination. The code modules may be stored in any type of non-transitory computer-readable medium or other computer storage device. Some or all the methods may be embodied in specialized computer hardware.


Many other variations than those described herein will be apparent from this disclosure. For example, depending on the embodiment, certain acts, events, or functions of any of the algorithms described herein can be performed in a different sequence or can be added, merged, or left out altogether (for example, not all described acts or events are necessary for the practice of the algorithms). Moreover, in certain embodiments, acts or events can be performed concurrently, for example, through multi-threaded processing, interrupt processing, or multiple processors or processor cores or on other parallel architectures, rather than sequentially. In addition, different tasks or processes can be performed by different machines and/or computing systems that can function together.


Conditional language such as, among others, “can,” “could,” “might” or “may,” unless specifically stated otherwise, are understood within the context as used in general to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or processes. Thus, such conditional language is not generally intended to imply that features, elements and/or processes are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or processes are included or are to be performed in any particular embodiment.


Disjunctive language such as the phrase “at least one of X, Y, or Z,” unless specifically stated otherwise, is understood with the context as used in general to present that an item, term, etc., may be either X, Y, or Z, or any combination thereof (for example, X, Y, and/or Z). Thus, such disjunctive language is not generally intended to, and should not, imply that certain embodiments require at least one of X, at least one of Y, or at least one of Z to each be present.


Any process descriptions, elements or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or elements in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown, or discussed, including substantially concurrently or in reverse order, depending on the functionality involved as would be understood by those skilled in the art.


Unless otherwise explicitly stated, articles such as “a” or “an” should generally be interpreted to include one or more described items. Accordingly, phrases such as “a device configured to” are intended to include one or more recited devices. Such one or more recited devices can also be collectively configured to carry out the stated recitations. For example, “a processor configured to carry out recitations A, B and C” can include a first processor configured to carry out recitation A working in conjunction with a second processor configured to carry out recitations B and C.


It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure.

Claims
  • 1. A computer system for determining account holder identities for collected event information, the computer system comprising: one or more hardware computer processors; andone or more storage devices configured to store software instructions configured for execution by the one or more hardware computer processors to cause the computer system to: receive, from a plurality of data sources, a plurality of event information, the event information comprising heterogeneous data structures;for each event information: access a data store including associations between data sources and identifier parameters, the identifier parameters including at least an indication of one or more identifiers included in event information from the corresponding data source;determine, based at least on the identifier parameters of the data source of the event information, identifiers included in the event information as indicated in the accessed data store; andextract identifiers from the event information based at least on the corresponding identifier parameters, wherein a combination of the identifiers comprise a unique identity associated with a unique user;access a plurality of hash functions, each associated with a combination of identifiers;for each unique identity, calculate a plurality of hashes by evaluating the plurality of hash functions;based on whether unique identities share a common hash calculated with a common hash function, selectively group unique identities into sets of unique identities associated with common hashes;for each set of unique identities: apply one or more match rules including criteria for comparing unique identities within the set; anddetermine a matching set of unique identities as those meeting one or more of the match rules;merge matching sets of unique identities each including at least one common unique identity to provide one or more merged sets comprising no unique identity in common with other merged sets by repeating until the matching sets are merged, a process of creating pairs of records from each matching set, reversing each pair, and grouping by leftmost record where the leftmost record is common between the pairs, each merged set associated with one user;for each merged set: determine an inverted personal identifier; andassociate the inverted personal identifier to each of the unique identities in the merged set to create an inverted personal identifier map;for each unique identity, use the inverted personal identifier map to: identify event information associated with at least one of the combinations of identifiers associated with the unique identity; and associate the inverted personal identifier with the identified event information, wherein each inverted personal identifier is associated with multiple unique identities in the merged set associated with the unique user and wherein the identified event information is associated with multiple events that are associated with the unique user.
  • 2. The computer system of claim 1, wherein the hash functions include at least: a first hash function that evaluates a first combination of at least portions of a first identifier and at least portions of a second identifier extracted from event information; anda second hash function that evaluates a second combination of at least portions of the first identifier and at least portions of a third identifier extracted from event information.
  • 3. The computer system of claim 2, wherein the first hash function is selected based on identifier types of one or more of the first identifier or the second identifier.
  • 4. The computer system of claim 2, wherein the first identifier is a social security number of the unique user and the second identifier is a last name of the unique user, and the first combination is a concatenation less than all of the digits of the social security number and less than all characters of the last name of the unique user.
  • 5. The computer system of claim 2, wherein a first set of events includes a plurality of events associated with the first hash and a second set of events includes the plurality of events associated with the second hash.
  • 6. The computer system of claim 1, wherein the identifiers are selected from: first name, last name, middle initial, middle name, date of birth, social security number, taxpayer ID, or national ID.
  • 7. The computer system of claim 1, wherein the computer system generates an inverted map associating an inverted personal identifier to each of the remaining unique identities in the merged sets and stores the map in a data store.
  • 8. The computer system of claim 1, further comprising, based on the inverted personal identifier assigned to the remaining unique identities, assign the inverted personal identifier to each of the plurality of event information including the remaining unique identities.
  • 9. The computer system of claim 1, wherein the hash functions comprise locality sensitive hashing.
  • 10. The computer system of claim 1, wherein the one or more match rules include one or more identity resolution rules that compare unique identities in the one or more sets with account holder information in an external database or CRM system to identify matches to the one or more match rules.
  • 11. The computer system of claim 10, wherein the identity resolution rules include criteria indicating match criteria between the account holder information and the identifiers.
  • 12. The computer system of claim 1, wherein creating pairs of records from each matching set includes pairing each unique identity in a set with another unique identity in the set to create pairs of unique identity and wherein grouping by the leftmost record where the leftmost record is common between the pairs includes grouping noncommon unique identities from the pairs with the common unique identity until lists of unique identities contained within resulting groups are mutually exclusive between resulting groups.
  • 13. The computer system of claim 12, wherein the process further comprises sorting the unique identities in pairs.
  • 14. The computer system of claim 1, wherein the plurality of event information comprises information about at least one credit event.
US Referenced Citations (1884)
Number Name Date Kind
3316395 Lavin et al. Apr 1967 A
4163290 Sutherlin et al. Jul 1979 A
4305059 Benton Dec 1981 A
4346442 Musmanno Aug 1982 A
4491725 Pritchard Jan 1985 A
4578530 Zeidler Mar 1986 A
4736294 Gill Apr 1988 A
4774664 Campbell et al. Sep 1988 A
4812628 Boston et al. Mar 1989 A
4827508 Shear May 1989 A
4868570 Davis Sep 1989 A
4872113 Dinerstein Oct 1989 A
4876592 Von Kohorn Oct 1989 A
4891503 Jewell Jan 1990 A
4895518 Arnold Jan 1990 A
4935870 Burk, Jr. et al. Jun 1990 A
4947028 Gorog Aug 1990 A
4989141 Lyons et al. Jan 1991 A
5013038 Luxenberg et al. May 1991 A
5025138 Cuervo Jun 1991 A
5025373 Keyser, Jr. et al. Jun 1991 A
5034807 Von Kohorn Jul 1991 A
5060153 Nakagawa Oct 1991 A
5148365 Dembo Sep 1992 A
5216612 Cornett et al. Jun 1993 A
5220501 Lawlor et al. Jun 1993 A
5239462 Jones et al. Aug 1993 A
5247575 Sprague et al. Sep 1993 A
5259766 Sack Nov 1993 A
5262941 Saladin Nov 1993 A
5274547 Zoffel et al. Dec 1993 A
5301105 Cummings, Jr. Apr 1994 A
5317636 Vizcaino May 1994 A
5325509 Lautzenheiser Jun 1994 A
5336870 Hughes et al. Aug 1994 A
5341429 Stringer et al. Aug 1994 A
5361201 Jost et al. Nov 1994 A
5500513 Langhans et al. Mar 1996 A
5528701 Aref Jun 1996 A
5555409 Leenstra, Sr. et al. Sep 1996 A
5557514 Seare et al. Sep 1996 A
5583760 Klesse Dec 1996 A
5590038 Pitroda Dec 1996 A
5611052 Dykstra et al. Mar 1997 A
5615408 Johnson Mar 1997 A
5621201 Langhans et al. Apr 1997 A
5629982 Micali May 1997 A
5630070 Dietrich et al. May 1997 A
5630127 Moore et al. May 1997 A
5640551 Chu et al. Jun 1997 A
5640577 Scharmer Jun 1997 A
5644778 Burks et al. Jul 1997 A
5649114 Deaton et al. Jul 1997 A
5655129 Ito Aug 1997 A
5659725 Levy et al. Aug 1997 A
5659731 Gustafson Aug 1997 A
5666528 Thai Sep 1997 A
5692107 Simoudis et al. Nov 1997 A
5696907 Tom Dec 1997 A
5699527 Davidson Dec 1997 A
5704029 Wright, Jr. Dec 1997 A
5704044 Tarter et al. Dec 1997 A
5708422 Blonder et al. Jan 1998 A
5732400 Mandler Mar 1998 A
5737732 Gibson et al. Apr 1998 A
5739512 Tognazzini Apr 1998 A
5745654 Titan Apr 1998 A
5745706 Wolfberg et al. Apr 1998 A
5748098 Grace May 1998 A
5754632 Smith May 1998 A
5754939 Herz et al. May 1998 A
5764923 Tallman et al. Jun 1998 A
5765143 Sheldon et al. Jun 1998 A
5768423 Aref et al. Jun 1998 A
5774692 Boyer et al. Jun 1998 A
5774883 Andersen Jun 1998 A
5778405 Ogawa Jul 1998 A
5793972 Shane Aug 1998 A
5797136 Boyer et al. Aug 1998 A
5802142 Browne Sep 1998 A
5812840 Shwartz Sep 1998 A
5819291 Haimowitz et al. Oct 1998 A
5822410 McCausland et al. Oct 1998 A
5822750 Jou et al. Oct 1998 A
5822751 Gray et al. Oct 1998 A
5825884 Zdepski et al. Oct 1998 A
5828837 Elkland Oct 1998 A
5832068 Smith Nov 1998 A
5832447 Rieker et al. Nov 1998 A
5835915 Carr et al. Nov 1998 A
5842185 Chancey et al. Nov 1998 A
5842211 Horadan et al. Nov 1998 A
5844218 Kawan et al. Dec 1998 A
5857174 Dugan Jan 1999 A
5870721 Norris Feb 1999 A
5875236 Jankowitz Feb 1999 A
5878403 DeFrancesco Mar 1999 A
5881131 Farris et al. Mar 1999 A
5884287 Edesess Mar 1999 A
5893090 Friedman et al. Apr 1999 A
5903830 Joao et al. May 1999 A
5903881 Schrader et al. May 1999 A
5905985 Malloy et al. May 1999 A
5907828 Meyer et al. May 1999 A
5914472 Foladare et al. Jun 1999 A
5918217 Maggioncalda et al. Jun 1999 A
5924082 Silverman et al. Jul 1999 A
5926800 Baronowski et al. Jul 1999 A
5930759 Moore et al. Jul 1999 A
5930764 Melchione et al. Jul 1999 A
5930776 Dykstra et al. Jul 1999 A
5933809 Hunt et al. Aug 1999 A
5940812 Tengel et al. Aug 1999 A
5950172 Klingman Sep 1999 A
5950179 Buchanan et al. Sep 1999 A
5953710 Fleming Sep 1999 A
5956693 Geerlings Sep 1999 A
5960430 Haimowitz et al. Sep 1999 A
5961593 Gabber et al. Oct 1999 A
5963932 Jakobsson et al. Oct 1999 A
5966695 Melchione et al. Oct 1999 A
5966699 Zandi Oct 1999 A
5970478 Walker et al. Oct 1999 A
5978780 Watson Nov 1999 A
5991411 Kaufman et al. Nov 1999 A
5995947 Fraser et al. Nov 1999 A
5999596 Walker et al. Dec 1999 A
6006333 Nielsen Dec 1999 A
6012044 Maggioncalda et al. Jan 2000 A
6014632 Gamble et al. Jan 2000 A
6014645 Cunningham Jan 2000 A
6014688 Venkatraman et al. Jan 2000 A
6018723 Siegel et al. Jan 2000 A
6021397 Jones et al. Feb 2000 A
6026381 Barton, III et al. Feb 2000 A
6029149 Dykstra et al. Feb 2000 A
6038551 Barlow et al. Mar 2000 A
6044351 Jones Mar 2000 A
6044352 Deavers Mar 2000 A
6055570 Nielsen Apr 2000 A
6064987 Walker May 2000 A
6067522 Warady et al. May 2000 A
6070141 Houvener May 2000 A
6070147 Harms et al. May 2000 A
6070241 Edwards et al. May 2000 A
6073104 Field Jun 2000 A
6073106 Rozen et al. Jun 2000 A
6073140 Morgan et al. Jun 2000 A
6085242 Chandra Jul 2000 A
6088686 Walker et al. Jul 2000 A
6094643 Anderson et al. Jul 2000 A
6098052 Kosiba et al. Aug 2000 A
6105007 Norris Aug 2000 A
6108641 Kenna et al. Aug 2000 A
6115690 Wong Sep 2000 A
6115694 Cheetham et al. Sep 2000 A
6119103 Basch et al. Sep 2000 A
6121901 Welch et al. Sep 2000 A
6128599 Walker Oct 2000 A
6128602 Northington et al. Oct 2000 A
6128603 Dent Oct 2000 A
6128624 Papierniak et al. Oct 2000 A
6129273 Shah Oct 2000 A
6144948 Walker et al. Nov 2000 A
6144957 Cohen et al. Nov 2000 A
6151601 Papierniak et al. Nov 2000 A
6154729 Cannon et al. Nov 2000 A
6157707 Baulier et al. Dec 2000 A
6157927 Schaefer et al. Dec 2000 A
6161139 Win et al. Dec 2000 A
6163770 Gamble et al. Dec 2000 A
6171112 Clark et al. Jan 2001 B1
6173284 Brown Jan 2001 B1
6178442 Yamazaki Jan 2001 B1
6182229 Nielsen Jan 2001 B1
6185543 Galperin et al. Feb 2001 B1
6199077 Inala et al. Mar 2001 B1
6202053 Christiansen et al. Mar 2001 B1
6208973 Boyer et al. Mar 2001 B1
6223171 Chaudhuri et al. Apr 2001 B1
6233566 Levine et al. May 2001 B1
6233588 Marchoili et al. May 2001 B1
6249770 Erwin et al. Jun 2001 B1
6253202 Gilmour Jun 2001 B1
6253203 O'Flaherty et al. Jun 2001 B1
6256630 Glial et al. Jul 2001 B1
6263334 Fayyad et al. Jul 2001 B1
6263337 Fayyad et al. Jul 2001 B1
6263447 French et al. Jul 2001 B1
6269325 Lee et al. Jul 2001 B1
6269369 Robertson Jul 2001 B1
6275824 O'Flaherty et al. Aug 2001 B1
6282658 French et al. Aug 2001 B2
6285987 Roth et al. Sep 2001 B1
6298348 Eldering Oct 2001 B1
6304860 Martin et al. Oct 2001 B1
6304869 Moore et al. Oct 2001 B1
6311169 Duhon Oct 2001 B2
6317783 Freishtat et al. Nov 2001 B1
6321205 Eder Nov 2001 B1
6321339 French et al. Nov 2001 B1
6324524 Lent et al. Nov 2001 B1
6330546 Gopinathan et al. Dec 2001 B1
6330575 Moore et al. Dec 2001 B1
6339769 Cochrane et al. Jan 2002 B1
6343279 Bissonette et al. Jan 2002 B1
6366903 Agrawal et al. Apr 2002 B1
6374229 Lowrey et al. Apr 2002 B1
6374230 Walker et al. Apr 2002 B1
6384844 Stewart et al. May 2002 B1
6385594 Lebda et al. May 2002 B1
6393406 Eder May 2002 B1
6397197 Gindlesperger May 2002 B1
6397224 Zubeldia et al. May 2002 B1
6405173 Honarvar Jun 2002 B1
6405181 Lent et al. Jun 2002 B2
6405245 Burson et al. Jun 2002 B1
6424878 Barker et al. Jul 2002 B1
6430539 Lazarus et al. Aug 2002 B1
6446200 Ball et al. Sep 2002 B1
6448980 Kumar et al. Sep 2002 B1
6453297 Burks et al. Sep 2002 B1
6453353 Win et al. Sep 2002 B1
6456983 Keyes et al. Sep 2002 B1
6457012 Jatkowski Sep 2002 B1
6463533 Calamera et al. Oct 2002 B1
6477565 Daswani et al. Nov 2002 B1
6496819 Bello et al. Dec 2002 B1
6496827 Kozam et al. Dec 2002 B2
6496931 Rajchel et al. Dec 2002 B1
6496936 French et al. Dec 2002 B1
6505168 Rothman et al. Jan 2003 B1
6513018 Culhane Jan 2003 B1
6517587 Satyavolu et al. Feb 2003 B2
6523021 Monberg et al. Feb 2003 B1
6523022 Hobbs Feb 2003 B1
6523041 Morgan et al. Feb 2003 B1
6532450 Brown et al. Mar 2003 B1
6542894 Lee et al. Apr 2003 B1
6543683 Hoffman Apr 2003 B2
6564210 Korda et al. May 2003 B1
6567791 Lent et al. May 2003 B2
6567850 Freishtat et al. May 2003 B1
6574623 Laung et al. Jun 2003 B1
6574736 Andrews Jun 2003 B1
6581059 Barrett et al. Jun 2003 B1
6587841 DeFrancesco Jul 2003 B1
6598030 Siegel et al. Jul 2003 B1
6601173 Mohler Jul 2003 B1
6601234 Bowman-Amuah Jul 2003 B1
6611816 Lebda et al. Aug 2003 B2
6618727 Wheeler et al. Sep 2003 B1
6622131 Brown et al. Sep 2003 B1
6622266 Goddard et al. Sep 2003 B1
6629245 Stone et al. Sep 2003 B1
6633910 Rajan et al. Oct 2003 B1
6636803 Hartz, Jr. et al. Oct 2003 B1
6647383 August et al. Nov 2003 B1
6651220 Penteroudakis et al. Nov 2003 B1
6658393 Basch et al. Dec 2003 B1
6665677 Wotring et al. Dec 2003 B1
6684093 Kuth Jan 2004 B2
6691136 Lee et al. Feb 2004 B2
6708166 Dysart et al. Mar 2004 B1
6714944 Shapiro et al. Mar 2004 B1
6725381 Smith et al. Apr 2004 B1
6725425 Rajan et al. Apr 2004 B1
6734886 Hagan et al. May 2004 B1
6738748 Wetzer May 2004 B2
6738759 Wheeler et al. May 2004 B1
6742001 Ripley May 2004 B2
6748426 Shaffer et al. Jun 2004 B1
6750985 Rhoads Jun 2004 B2
6754665 Futagami et al. Jun 2004 B1
6766327 Morgan, Jr. et al. Jul 2004 B2
6766946 Iida et al. Jul 2004 B2
6782379 Lee Aug 2004 B2
6782390 Lee et al. Aug 2004 B2
6795812 Lent et al. Sep 2004 B1
6802042 Rangan et al. Oct 2004 B2
6804346 Mewhinney Oct 2004 B1
6804701 Muret et al. Oct 2004 B2
6805287 Bishop et al. Oct 2004 B2
6807533 Land et al. Oct 2004 B1
6816871 Lee Nov 2004 B2
6823319 Lynch et al. Nov 2004 B1
6826535 Wood et al. Nov 2004 B2
6839690 Foth et al. Jan 2005 B1
6839714 Wheeler et al. Jan 2005 B2
6842782 Malik et al. Jan 2005 B1
6845448 Chaganti et al. Jan 2005 B1
6847942 Land et al. Jan 2005 B1
6850895 Brodersen et al. Feb 2005 B2
6853997 Wotring et al. Feb 2005 B2
6857073 French et al. Feb 2005 B2
6865680 Wu et al. Mar 2005 B1
6871220 Rajan et al. Mar 2005 B1
6873972 Marcial et al. Mar 2005 B1
6901406 Nabe et al. May 2005 B2
6910624 Natsuno Jun 2005 B1
6928487 Eggebraaten et al. Aug 2005 B2
6934714 Meinig Aug 2005 B2
6947984 Schweitzer et al. Sep 2005 B2
6947989 Gullotta et al. Sep 2005 B2
6950807 Brock Sep 2005 B2
6950858 Ogami Sep 2005 B2
6954757 Zargham et al. Oct 2005 B2
6962336 Glass Nov 2005 B2
6968319 Remington et al. Nov 2005 B1
6976056 Kumar Dec 2005 B1
6983379 Spalink et al. Jan 2006 B1
6983478 Grauch et al. Jan 2006 B1
6985887 Sunstein et al. Jan 2006 B1
6985898 Ripley et al. Jan 2006 B1
6988085 Hedy Jan 2006 B2
6999941 Agarwal Feb 2006 B1
7003476 Samra et al. Feb 2006 B1
7003491 Starkman Feb 2006 B2
7003504 Angus et al. Feb 2006 B1
7013310 Messing et al. Mar 2006 B2
7016870 Jones et al. Mar 2006 B1
7016907 Boreham et al. Mar 2006 B2
7028001 Muthuswamy et al. Apr 2006 B1
7028052 Chapman et al. Apr 2006 B2
7035855 Kilger et al. Apr 2006 B1
7039176 Borodow et al. May 2006 B2
7039607 Watarai et al. May 2006 B2
7039656 Tsai et al. May 2006 B1
7043476 Robson May 2006 B2
7047251 Reed et al. May 2006 B2
7050982 Sheinson et al. May 2006 B2
7050989 Hurt et al. May 2006 B1
7058817 Ellmore Jun 2006 B1
7062458 Maggioncalda et al. Jun 2006 B2
7062475 Szabo et al. Jun 2006 B1
7065566 Menard et al. Jun 2006 B2
7069240 Spero et al. Jun 2006 B2
7069249 Stolfo et al. Jun 2006 B2
7072842 Provost et al. Jul 2006 B2
7075894 Hein et al. Jul 2006 B2
7076462 Nelson et al. Jul 2006 B1
7076475 Honarvar et al. Jul 2006 B2
7082435 Guzman et al. Jul 2006 B1
7083087 Gangi Aug 2006 B1
7085997 Wu et al. Aug 2006 B1
7092898 Mattick et al. Aug 2006 B1
7107241 Pinto Sep 2006 B1
7117172 Black Oct 2006 B1
7120599 Keyes Oct 2006 B2
7124144 Christianson et al. Oct 2006 B2
7133840 Kenna et al. Nov 2006 B1
7133935 Hedy Nov 2006 B2
7143063 Lent Nov 2006 B2
7155739 Bari et al. Dec 2006 B2
7165037 Lazarus et al. Jan 2007 B2
7167907 Shaffer et al. Jan 2007 B2
7171371 Goldstein Jan 2007 B2
7174302 Patricelli et al. Feb 2007 B2
7178096 Rangan et al. Feb 2007 B2
7181427 DeFrancesco Feb 2007 B1
7184974 Shishido Feb 2007 B2
7185016 Rasmussen Feb 2007 B1
7188107 Moon et al. Mar 2007 B2
7188169 Buus et al. Mar 2007 B2
7188252 Dunn Mar 2007 B1
7191150 Shao et al. Mar 2007 B1
7191451 Nakagawa Mar 2007 B2
7197468 Patricelli et al. Mar 2007 B1
7200602 Jonas Apr 2007 B2
7206768 deGroeve et al. Apr 2007 B1
7212995 Schulkins May 2007 B2
7219107 Beringer May 2007 B2
7221377 Okita et al. May 2007 B1
7222369 Vering et al. May 2007 B2
7234156 French et al. Jun 2007 B2
7234160 Vogel et al. Jun 2007 B2
7236950 Savage et al. Jun 2007 B2
7240059 Bayliss et al. Jul 2007 B2
7240363 Ellingson Jul 2007 B1
7243369 Bhat et al. Jul 2007 B2
7246067 Austin et al. Jul 2007 B2
7246068 Thomas, Jr. Jul 2007 B2
7249048 O'Flaherty Jul 2007 B1
7249072 Nearhood et al. Jul 2007 B1
7249076 Pendleton et al. Jul 2007 B1
7249096 Lasater et al. Jul 2007 B1
7249113 Continelli et al. Jul 2007 B1
7251625 Anglum Jul 2007 B2
7254558 Hinkle et al. Aug 2007 B2
7263497 Wiser et al. Aug 2007 B1
7263548 Daswani et al. Aug 2007 B2
7272591 Ghazal et al. Sep 2007 B1
7277869 Starkman Oct 2007 B2
7277900 Ganesh et al. Oct 2007 B1
7280980 Hoadley et al. Oct 2007 B1
7280983 Kuroda et al. Oct 2007 B2
7281652 Foss Oct 2007 B2
7283998 Moon et al. Oct 2007 B2
7289971 O'Neil et al. Oct 2007 B1
7295988 Reeves Nov 2007 B1
7296734 Pliha Nov 2007 B2
7298872 Glisson Nov 2007 B2
7302420 Aggarwal et al. Nov 2007 B2
7305359 Bonnell Dec 2007 B2
7308417 Nathan Dec 2007 B1
7310617 Cunningham Dec 2007 B1
7313538 Wilmes et al. Dec 2007 B2
7314166 Anderson et al. Jan 2008 B2
7315837 Sloan et al. Jan 2008 B2
7318224 Honarvar et al. Jan 2008 B2
7328233 Salim et al. Feb 2008 B2
7328276 Alisuag Feb 2008 B2
7333635 Tsantes et al. Feb 2008 B2
7333937 Baldwin, Jr. et al. Feb 2008 B2
7337133 Bezos et al. Feb 2008 B1
7337468 Metzger Feb 2008 B2
7340424 Gang et al. Mar 2008 B2
7340434 Schnall Mar 2008 B2
7340679 Botscheck et al. Mar 2008 B2
7343295 Pomerance Mar 2008 B2
7346576 Lent et al. Mar 2008 B2
7346703 Cope Mar 2008 B2
7356506 Watson et al. Apr 2008 B2
7356516 Richey et al. Apr 2008 B2
7366694 Lazerson Apr 2008 B2
7367011 Ramsey et al. Apr 2008 B2
7370044 Mulhern et al. May 2008 B2
7373335 Cleghorn et al. May 2008 B2
7376603 Mayr et al. May 2008 B1
7379880 Pathria et al. May 2008 B1
7379913 Steele et al. May 2008 B2
7380707 Man Jun 2008 B1
7383215 Navarro et al. Jun 2008 B1
7383988 Slonecker, Jr. Jun 2008 B2
7386466 McLean et al. Jun 2008 B2
7386554 Ripley et al. Jun 2008 B2
7389305 Kindig et al. Jun 2008 B1
7392216 Palmgren et al. Jun 2008 B1
7395232 Pilato Jul 2008 B1
7395273 Khan et al. Jul 2008 B2
7403919 Chacko et al. Jul 2008 B2
7403923 Elliott et al. Jul 2008 B2
7403942 Bayliss Jul 2008 B1
7409369 Homuth et al. Aug 2008 B1
7418417 Chacko et al. Aug 2008 B2
7421322 Silversmith et al. Sep 2008 B1
7421442 Gelb et al. Sep 2008 B2
7424439 Fayyad et al. Sep 2008 B1
7424520 Daswani et al. Sep 2008 B2
7433864 Malik Oct 2008 B2
7451095 Bradley et al. Nov 2008 B1
7451113 Kasower Nov 2008 B1
7460857 Roach, Jr. Dec 2008 B2
7467127 Baccash et al. Dec 2008 B1
7467401 Cicchitto Dec 2008 B2
7475118 Leiba et al. Jan 2009 B2
7478157 Bohrer et al. Jan 2009 B2
7479949 Jobs et al. Jan 2009 B2
7480631 Merced et al. Jan 2009 B1
7483842 Fung et al. Jan 2009 B1
7490356 Lieblich et al. Feb 2009 B2
7505938 Lang et al. Mar 2009 B2
7505939 Lent et al. Mar 2009 B2
7527967 Chao et al. May 2009 B2
7529698 Joao May 2009 B2
7533179 Tarquini et al. May 2009 B2
7536329 Goldberg et al. May 2009 B2
7536346 Aliffi et al. May 2009 B2
7536348 Shao et al. May 2009 B2
7542993 Satterfield et al. Jun 2009 B2
7543739 Brown et al. Jun 2009 B2
7546266 Beirne et al. Jun 2009 B2
7546271 Chmielewski et al. Jun 2009 B1
7552080 Willard et al. Jun 2009 B1
7552086 Rajasekar et al. Jun 2009 B1
7552089 Bruer et al. Jun 2009 B2
7552190 Freishtat et al. Jun 2009 B1
7556192 Wokaty, Jr. Jul 2009 B2
7559217 Bass Jul 2009 B2
7562093 Gelb et al. Jul 2009 B2
7562184 Henmi et al. Jul 2009 B2
7562814 Shao et al. Jul 2009 B1
7571138 Miri et al. Aug 2009 B2
7571473 Boydstun et al. Aug 2009 B1
7577934 Anonsen et al. Aug 2009 B2
7580884 Cook Aug 2009 B2
7584126 White Sep 2009 B1
7584127 Byrne et al. Sep 2009 B2
7584146 Duhon Sep 2009 B1
7584197 Dant Sep 2009 B2
7587366 Grim, III et al. Sep 2009 B2
7593889 Raines et al. Sep 2009 B2
7593891 Kornegay et al. Sep 2009 B2
7593892 Balk et al. Sep 2009 B2
7596512 Raines et al. Sep 2009 B1
7596716 Frost et al. Sep 2009 B2
7603317 Adler et al. Oct 2009 B2
7603701 Gaucas Oct 2009 B2
7606725 Robertson et al. Oct 2009 B2
7610229 Kornegay Oct 2009 B1
7613600 Krane Nov 2009 B2
7613671 Serrano-Morales et al. Nov 2009 B2
7617116 Amar et al. Nov 2009 B2
7620592 O'Mara et al. Nov 2009 B2
7624068 Heasley et al. Nov 2009 B1
7630932 Danaher et al. Dec 2009 B2
7630933 Peterson et al. Dec 2009 B2
7634737 Beringer et al. Dec 2009 B2
7640200 Gardner et al. Dec 2009 B2
7647274 Peterson et al. Jan 2010 B2
7647344 Skurtovich, Jr. et al. Jan 2010 B2
7653592 Flaxman et al. Jan 2010 B1
7653593 Zarikian et al. Jan 2010 B2
7653688 Bittner Jan 2010 B2
7657540 Bayliss Feb 2010 B1
7668840 Bayliss et al. Feb 2010 B2
7672833 Blume et al. Mar 2010 B2
7672879 Kumar et al. Mar 2010 B1
7672924 Scheurich et al. Mar 2010 B1
7672926 Ghazal et al. Mar 2010 B2
7676410 Petralia Mar 2010 B2
7676418 Chung et al. Mar 2010 B1
7676751 Allen et al. Mar 2010 B2
7685209 Norton et al. Mar 2010 B1
7689451 Vives Mar 2010 B2
7689505 Kasower Mar 2010 B2
7689506 Fei et al. Mar 2010 B2
7689526 Byrnes et al. Mar 2010 B2
7690032 Peirce Mar 2010 B1
7693787 Provinse Apr 2010 B2
7698163 Reed et al. Apr 2010 B2
7698214 Lindgren Apr 2010 B1
7698217 Phillips et al. Apr 2010 B1
7698445 Fitzpatrick et al. Apr 2010 B2
7707059 Reed et al. Apr 2010 B2
7707102 Rothstein Apr 2010 B2
7707164 Kapochunas et al. Apr 2010 B2
7707271 Rudkin et al. Apr 2010 B2
7711635 Steele et al. May 2010 B2
7711636 Robida et al. May 2010 B2
7720750 Brody May 2010 B2
7720846 Bayliss May 2010 B1
7725385 Royer et al. May 2010 B2
7729959 Wells et al. Jun 2010 B1
7729983 Ellis Jun 2010 B1
7730078 Schwabe et al. Jun 2010 B2
7734522 Johnson et al. Jun 2010 B2
7739139 Robertson et al. Jun 2010 B2
7742982 Chaudhuri et al. Jun 2010 B2
7747480 Agresta et al. Jun 2010 B1
7747559 Leitner et al. Jun 2010 B2
7752132 Stewart et al. Jul 2010 B2
7752236 Williams et al. Jul 2010 B2
7752535 Satyavolu Jul 2010 B2
7756789 Welker et al. Jul 2010 B2
7765166 Beringer et al. Jul 2010 B2
7765279 Kalb et al. Jul 2010 B1
7765311 Itabashi et al. Jul 2010 B2
7769657 Chacko et al. Aug 2010 B2
7769696 Yoda Aug 2010 B2
7769998 Lynch et al. Aug 2010 B2
7774257 Maggioncalda et al. Aug 2010 B2
7774270 MacCloskey Aug 2010 B1
7783515 Kumar et al. Aug 2010 B1
7783562 Ellis Aug 2010 B1
7788040 Haskell et al. Aug 2010 B2
7788147 Haggerty et al. Aug 2010 B2
7788152 Haggerty et al. Aug 2010 B2
7788155 Jones et al. Aug 2010 B2
7792715 Kasower Sep 2010 B1
7792732 Haggerty et al. Sep 2010 B2
7797252 Rosskamm et al. Sep 2010 B2
7797725 Lunt et al. Sep 2010 B2
7801807 DeFrancesco et al. Sep 2010 B2
7801812 Conlin et al. Sep 2010 B2
7801828 Candella et al. Sep 2010 B2
7801956 Cumberbatch et al. Sep 2010 B1
7805345 Abrahams et al. Sep 2010 B2
7810036 Bales et al. Oct 2010 B2
7814004 Haggerty et al. Oct 2010 B2
7814005 Imrey et al. Oct 2010 B2
7818228 Coulter Oct 2010 B1
7818229 Imrey et al. Oct 2010 B2
7818231 Rajan Oct 2010 B2
7830382 Cirit et al. Nov 2010 B2
7832006 Chen et al. Nov 2010 B2
7835983 Lefner et al. Nov 2010 B2
7836111 Shan Nov 2010 B1
7840484 Haggerty et al. Nov 2010 B2
7841008 Cole et al. Nov 2010 B1
7844604 Balo et al. Nov 2010 B2
7848972 Sharma Dec 2010 B1
7848978 Imrey et al. Dec 2010 B2
7849004 Choudhuri et al. Dec 2010 B2
7849014 Erikson Dec 2010 B2
7853493 DeBie et al. Dec 2010 B2
7853518 Cagan Dec 2010 B2
7853984 Antell et al. Dec 2010 B2
7853998 Blaisdell et al. Dec 2010 B2
7856386 Hazlehurst et al. Dec 2010 B2
7860782 Cash et al. Dec 2010 B2
7860786 Blackburn et al. Dec 2010 B2
7870078 Clark et al. Jan 2011 B2
7870151 Mayer et al. Jan 2011 B2
7873677 Messing et al. Jan 2011 B2
7877304 Coulter Jan 2011 B1
7880728 de los Reyes et al. Feb 2011 B2
7890420 Haggerty et al. Feb 2011 B2
7895139 Sullivan et al. Feb 2011 B2
7899750 Klieman et al. Mar 2011 B1
7900052 Joans Mar 2011 B2
7904306 Johnson et al. Mar 2011 B2
7904367 Chung et al. Mar 2011 B2
7908242 Achanta Mar 2011 B1
7912770 Haggerty et al. Mar 2011 B2
7912842 Bayliss et al. Mar 2011 B1
7912865 Akerman et al. Mar 2011 B2
7925578 Hong et al. Apr 2011 B1
7925582 Kornegay et al. Apr 2011 B1
7930195 Heyns et al. Apr 2011 B2
7930242 Morris et al. Apr 2011 B2
7930252 Bender et al. Apr 2011 B2
7941363 Tanaka et al. May 2011 B2
7941365 Bradley et al. May 2011 B1
7945510 Bradley et al. May 2011 B1
7958126 Schachter Jun 2011 B2
7966192 Pagliari et al. Jun 2011 B2
7966255 Wong et al. Jun 2011 B2
7970676 Feinstein Jun 2011 B2
7970679 Kasower Jun 2011 B2
7970698 Gupta et al. Jun 2011 B2
7974919 Conlin et al. Jul 2011 B2
7975299 Balducci et al. Jul 2011 B1
7979908 Millwee Jul 2011 B2
7983932 Kane Jul 2011 B2
7983975 Jones et al. Jul 2011 B2
7983976 Nafeh et al. Jul 2011 B2
7983979 Holland, IV Jul 2011 B2
7987124 Holden et al. Jul 2011 B1
7991688 Phelan et al. Aug 2011 B2
7991689 Brunzell et al. Aug 2011 B1
7991901 Tarquini et al. Aug 2011 B2
7996912 Spalink et al. Aug 2011 B2
8001034 Chung et al. Aug 2011 B2
8001040 Keithley Aug 2011 B2
8001041 Hoadley et al. Aug 2011 B2
8001042 Brunzell et al. Aug 2011 B1
8001043 Walker et al. Aug 2011 B1
8001153 Skurtovich, Jr. et al. Aug 2011 B2
8001235 Russ et al. Aug 2011 B2
8005738 Chacko et al. Aug 2011 B2
8005759 Hirtenstein et al. Aug 2011 B2
8005795 Galipeau et al. Aug 2011 B2
8015107 Kornegay et al. Sep 2011 B2
8015614 Matsuzaki et al. Sep 2011 B2
8019828 Cash et al. Sep 2011 B2
8019843 Cash et al. Sep 2011 B2
8024263 Zarikian et al. Sep 2011 B2
8024264 Chaudhuri et al. Sep 2011 B2
8024778 Cash et al. Sep 2011 B2
8032932 Speyer et al. Oct 2011 B2
8055579 Davies et al. Nov 2011 B2
8060423 Rukonic et al. Nov 2011 B1
8060424 Kasower Nov 2011 B2
8060441 Stewart et al. Nov 2011 B2
8060502 Churi et al. Nov 2011 B2
8060541 Dant Nov 2011 B2
8064586 Shaffer et al. Nov 2011 B2
8065233 Lee et al. Nov 2011 B2
8065234 Liao et al. Nov 2011 B2
8065264 Achanta Nov 2011 B1
8073768 Haggerty et al. Dec 2011 B2
8073785 Candella et al. Dec 2011 B1
8078524 Crawford et al. Dec 2011 B2
8078527 Cerise et al. Dec 2011 B2
8078528 Vicente et al. Dec 2011 B1
8082202 Weiss Dec 2011 B2
8086523 Palmer Dec 2011 B1
8095443 DeBie Jan 2012 B2
8095458 Peterson et al. Jan 2012 B2
8099309 Bober Jan 2012 B1
8099341 Varghese Jan 2012 B2
8099356 Feinstein et al. Jan 2012 B2
8104679 Brown Jan 2012 B2
8127982 Casey et al. Mar 2012 B1
8127986 Taylor et al. Mar 2012 B1
8131614 Haggerty et al. Mar 2012 B2
8131685 Gedalius et al. Mar 2012 B1
8131777 McCullouch Mar 2012 B2
8135642 Krause Mar 2012 B1
8160960 Fei et al. Apr 2012 B1
8161104 Tomkow Apr 2012 B2
8165940 Meimes et al. Apr 2012 B2
8170998 Churi et al. May 2012 B2
8175889 Girulat et al. May 2012 B1
8180654 Berkman et al. May 2012 B2
8190629 Wu et al. May 2012 B2
8190998 Bitterlich May 2012 B2
8195549 Kasower Jun 2012 B2
8201257 Andres et al. Jun 2012 B1
8204774 Chwast et al. Jun 2012 B2
8204812 Stewart et al. Jun 2012 B2
8214238 Fairfield et al. Jul 2012 B1
8219535 Kobori et al. Jul 2012 B1
8219771 Le Neel Jul 2012 B2
8224723 Bosch et al. Jul 2012 B2
8225395 Atwood et al. Jul 2012 B2
8234498 Britti et al. Jul 2012 B2
8239130 Upstill et al. Aug 2012 B1
8244635 Freishtat et al. Aug 2012 B2
8255978 Dick Aug 2012 B2
8266065 Dilip et al. Sep 2012 B2
8266168 Bayliss Sep 2012 B2
8266515 Satyavolu Sep 2012 B2
8271378 Chaudhuri et al. Sep 2012 B2
8280805 Abrahams et al. Oct 2012 B1
8285613 Coulter Oct 2012 B1
8285656 Chang et al. Oct 2012 B1
8290840 Kasower Oct 2012 B2
8296229 Yellin et al. Oct 2012 B1
8306986 Routson et al. Nov 2012 B2
8311936 Haggerty et al. Nov 2012 B2
8312033 McMillan Nov 2012 B1
8315942 Haggerty et al. Nov 2012 B2
8321334 Kornegay et al. Nov 2012 B1
8321339 Imrey et al. Nov 2012 B2
8321952 Spalink et al. Nov 2012 B2
8326672 Haggerty et al. Dec 2012 B2
8326725 Elwell et al. Dec 2012 B2
8327429 Speyer et al. Dec 2012 B2
8335741 Kornegay et al. Dec 2012 B2
8340685 Cochran et al. Dec 2012 B2
8345790 Sartori et al. Jan 2013 B2
8355967 Debie et al. Jan 2013 B2
8359210 Altinger et al. Jan 2013 B1
8364518 Blake et al. Jan 2013 B1
8364588 Celka et al. Jan 2013 B2
8370371 Moncla et al. Feb 2013 B1
8380590 Rukonic et al. Feb 2013 B1
8380618 Kazenas et al. Feb 2013 B1
8386377 Xiong et al. Feb 2013 B1
8392334 Hirtenstein et al. Mar 2013 B2
8412593 Song et al. Apr 2013 B1
8418254 Britti et al. Apr 2013 B2
8433512 Lopatenko et al. Apr 2013 B1
8433648 Keithley et al. Apr 2013 B2
8442886 Haggerty et al. May 2013 B1
8458062 Dutt et al. Jun 2013 B2
8458074 Showalter Jun 2013 B2
8463595 Rehling et al. Jun 2013 B1
8463919 Tarquini et al. Jun 2013 B2
8464046 Kragh Jun 2013 B1
8464939 Taylor et al. Jun 2013 B1
8468198 Tomkow Jun 2013 B2
8473354 Psota et al. Jun 2013 B2
8478674 Kapczynski et al. Jul 2013 B1
8484211 Bayliss Jul 2013 B2
8489502 Morris et al. Jul 2013 B2
8495077 Bayliss Jul 2013 B2
8495384 DeLuccia Jul 2013 B1
8498930 Chung et al. Jul 2013 B2
8504456 Griffin et al. Aug 2013 B2
8504470 Chirehdast Aug 2013 B1
8510184 Imrev et al. Aug 2013 B2
8510189 Imrey et al. Aug 2013 B2
8515828 Wolf et al. Aug 2013 B1
8515844 Kasower Aug 2013 B2
8515862 Zhang et al. Aug 2013 B2
8521628 Gowen et al. Aug 2013 B1
8521729 Churi et al. Aug 2013 B2
8527596 Long et al. Sep 2013 B2
8533030 Dhir et al. Sep 2013 B1
8533118 Weller et al. Sep 2013 B2
8538980 MacKenzie Sep 2013 B1
8549472 Tilwani Oct 2013 B1
8560161 Kator et al. Oct 2013 B1
8560434 Morris et al. Oct 2013 B2
8560436 Ingram et al. Oct 2013 B2
8566029 Lopatenko et al. Oct 2013 B1
8566141 Nagdev et al. Oct 2013 B1
8571971 Brown et al. Oct 2013 B1
8572083 Snell et al. Oct 2013 B1
8583593 Achanta Nov 2013 B1
8589069 Lehman Nov 2013 B1
8589208 Kruger et al. Nov 2013 B2
8589286 Kornegay et al. Nov 2013 B1
8595101 Daukas et al. Nov 2013 B1
8600854 Mayr et al. Dec 2013 B2
8600886 Ramavarjula et al. Dec 2013 B2
8606666 Courbage et al. Dec 2013 B1
8606694 Campbell et al. Dec 2013 B2
8620579 Upstill et al. Dec 2013 B1
8621562 Antell et al. Dec 2013 B2
8626618 Psota et al. Jan 2014 B2
8631242 Britti et al. Jan 2014 B2
8639616 Rolenaitis et al. Jan 2014 B1
8639920 Stack et al. Jan 2014 B2
8646101 Millwee Feb 2014 B1
8650407 Britti et al. Feb 2014 B2
8660919 Kasower Feb 2014 B2
8660943 Chirehdast Feb 2014 B1
8671107 Scully et al. Mar 2014 B2
8671115 Skurtovich, Jr. et al. Mar 2014 B2
8677129 Milana et al. Mar 2014 B2
8694390 Imrey et al. Apr 2014 B2
8694420 Oliai Apr 2014 B1
8694502 Bayliss Apr 2014 B2
8705718 Baniak et al. Apr 2014 B2
8706474 Blume et al. Apr 2014 B2
8719159 Keithley May 2014 B2
8725613 Celka et al. May 2014 B1
8732004 Ramos et al. May 2014 B1
8738515 Chaudhuri et al. May 2014 B2
8738516 Dean et al. May 2014 B1
8744956 DiChiara et al. Jun 2014 B1
8756099 Keithley et al. Jun 2014 B2
8762053 Lehman Jun 2014 B1
8762243 Jenkins et al. Jun 2014 B2
8768826 Imrey et al. Jul 2014 B2
8768914 Scriffignano et al. Jul 2014 B2
8775299 Achanta et al. Jul 2014 B2
8781877 Kruger et al. Jul 2014 B2
8781882 Arboletti et al. Jul 2014 B1
8781951 Lewis et al. Jul 2014 B2
8781953 Kasower Jul 2014 B2
8782217 Arone et al. Jul 2014 B1
8788701 Byrnes et al. Jul 2014 B1
8805805 Kobori et al. Aug 2014 B1
8806218 Hatakeda Aug 2014 B2
8818888 Kapczynski et al. Aug 2014 B1
8825544 Imrey et al. Sep 2014 B2
8856894 Dean et al. Oct 2014 B1
8862566 Leitner et al. Oct 2014 B2
8903741 Imrey et al. Dec 2014 B2
8930251 DeBie Jan 2015 B2
8930262 Searson et al. Jan 2015 B1
8930263 Mahacek et al. Jan 2015 B1
8931058 DiChiara et al. Jan 2015 B2
8938399 Herman Jan 2015 B1
8938432 Rossmark et al. Jan 2015 B2
8949981 Trollope et al. Feb 2015 B1
8954459 McMillan et al. Feb 2015 B1
8965934 Prieditis Feb 2015 B2
8966649 Stack et al. Feb 2015 B2
8972400 Kapczynski et al. Mar 2015 B1
9043930 Britti et al. May 2015 B2
9053589 Kator et al. Jun 2015 B1
9053590 Kator et al. Jun 2015 B1
9057616 Lopatenko et al. Jun 2015 B1
9057617 Lopatenko et al. Jun 2015 B1
9058627 Wasser et al. Jun 2015 B1
9075848 Churi et al. Jul 2015 B2
9076276 Kator et al. Jul 2015 B1
9116918 Kim Aug 2015 B1
9143541 Szamonek et al. Sep 2015 B1
9147042 Haller et al. Sep 2015 B1
9152727 Balducci et al. Oct 2015 B1
9165044 Psenka et al. Oct 2015 B2
9183363 Millwee Nov 2015 B1
9189789 Hastings et al. Nov 2015 B1
9213461 Eraker et al. Dec 2015 B2
9251541 Celka et al. Feb 2016 B2
9256624 Skurtovich, Jr. et al. Feb 2016 B2
9256904 Haller et al. Feb 2016 B1
9268803 Kapochunas et al. Feb 2016 B2
9305300 Mulhern et al. Apr 2016 B2
9324087 Routson et al. Apr 2016 B2
9342783 Chang et al. May 2016 B1
9438570 Milana et al. Sep 2016 B2
9443268 Kapczynski et al. Sep 2016 B1
9449346 Hockey et al. Sep 2016 B1
9489694 Haller et al. Nov 2016 B2
9529851 Smith Dec 2016 B1
9535959 Sun et al. Jan 2017 B2
9553936 Dijk et al. Jan 2017 B2
9558519 Burger Jan 2017 B1
9569797 Rohn et al. Feb 2017 B1
9595023 Hockey et al. Mar 2017 B1
9595051 Stack et al. Mar 2017 B2
9607336 Dean et al. Mar 2017 B1
9636053 Peterson et al. May 2017 B2
9646058 Churi et al. May 2017 B2
9652802 Kasower May 2017 B1
9684905 Haller et al. Jun 2017 B1
9690820 Girulat, Jr. Jun 2017 B1
9697263 Girulat, Jr. Jul 2017 B1
9705863 Britti et al. Jul 2017 B2
9710523 Skurtovich, Jr. et al. Jul 2017 B2
9710852 Olson et al. Jul 2017 B1
9760553 Hecht-Nielse Sep 2017 B1
9774681 Zoldi et al. Sep 2017 B2
9792648 Haller et al. Oct 2017 B1
9866561 Psenka et al. Jan 2018 B2
9955003 Cody et al. Apr 2018 B2
9989501 Tat et al. Jun 2018 B2
10003591 Hockey et al. Jun 2018 B2
10075446 McMillan et al. Sep 2018 B2
10102536 Hickman et al. Oct 2018 B1
10104059 Hockey et al. Oct 2018 B2
10108818 Curcio et al. Oct 2018 B2
10115102 Burrell et al. Oct 2018 B2
10115155 Haller et al. Oct 2018 B1
10117609 Peterson et al. Nov 2018 B2
10180861 Raghavan et al. Jan 2019 B2
10262362 Hu et al. Apr 2019 B1
10282790 Kolbrener et al. May 2019 B1
10319029 Hockey et al. Jun 2019 B1
10339330 Riley et al. Jul 2019 B2
10362058 Hu et al. Jul 2019 B2
10367888 Zoldi et al. Jul 2019 B2
10380654 Hirtenstein et al. Aug 2019 B2
10402792 Lin et al. Sep 2019 B2
10417704 Searson et al. Sep 2019 B2
10437895 Chang et al. Oct 2019 B2
10503798 Chen et al. Dec 2019 B2
10515084 Sun et al. Dec 2019 B2
10523653 Hockey et al. Dec 2019 B2
10530761 Hockey et al. Jan 2020 B2
10547739 Cody et al. Jan 2020 B2
10579647 Allsopp et al. Mar 2020 B1
10580025 Hickman et al. Mar 2020 B2
10580724 Britti et al. Mar 2020 B2
10614463 Hockey et al. Apr 2020 B1
10650448 Haller et al. May 2020 B1
10691825 Jones et al. Jun 2020 B2
10693840 Peterson et al. Jun 2020 B2
10726491 Hockey et al. Jul 2020 B1
10735183 Mehta et al. Aug 2020 B1
10757154 Jacobs et al. Aug 2020 B1
10810218 Ng et al. Oct 2020 B2
10885139 Chen et al. Jan 2021 B2
10887457 Degeorgis et al. Jan 2021 B1
10909617 Kasower Feb 2021 B2
10963434 Rodriguez et al. Mar 2021 B1
10979560 Cody et al. Apr 2021 B2
10984404 Nack et al. Apr 2021 B2
11004147 Haller et al. May 2021 B1
11042662 Riley et al. Jun 2021 B2
11107158 Hu et al. Aug 2021 B1
11157872 McMillan et al. Oct 2021 B2
11159593 Jacobs et al. Oct 2021 B1
11163943 Billman et al. Nov 2021 B2
11227001 Rege et al. Jan 2022 B2
11263218 Pieniazek et al. Mar 2022 B2
11270275 Anderson et al. Mar 2022 B2
11308170 Chang et al. Apr 2022 B2
11328083 Jones et al. May 2022 B2
11379821 Butvin et al. Jul 2022 B2
11443316 Burrell et al. Sep 2022 B2
11461383 Xie et al. Oct 2022 B2
11468186 Dong et al. Oct 2022 B2
20010000536 Tarin Apr 2001 A1
20010011247 O'Flaherty et al. Aug 2001 A1
20010014868 Herz et al. Aug 2001 A1
20010014878 Mitra et al. Aug 2001 A1
20010027413 Bhutta Oct 2001 A1
20010029470 Schultz et al. Oct 2001 A1
20010029482 Tealdi et al. Oct 2001 A1
20010034618 Kessler et al. Oct 2001 A1
20010034631 Kiselik Oct 2001 A1
20010037332 Miller et al. Nov 2001 A1
20010039523 Iwamoto Nov 2001 A1
20010039532 Coleman, Jr. et al. Nov 2001 A1
20010042785 Walker et al. Nov 2001 A1
20010044729 Pomerance Nov 2001 A1
20010044756 Watkins et al. Nov 2001 A1
20010049274 Degraeve Dec 2001 A1
20010049620 Blasko Dec 2001 A1
20020004736 Roundtree et al. Jan 2002 A1
20020004774 Defarlo Jan 2002 A1
20020010594 Levine Jan 2002 A1
20020010664 Rabideau et al. Jan 2002 A1
20020010701 Kosciuszko Jan 2002 A1
20020013827 Edstrom et al. Jan 2002 A1
20020026507 Sears et al. Feb 2002 A1
20020026519 Itabashi et al. Feb 2002 A1
20020032635 Harris et al. Mar 2002 A1
20020032645 Nozaki et al. Mar 2002 A1
20020032647 Delinsky et al. Mar 2002 A1
20020033846 Balasubramanian et al. Mar 2002 A1
20020035511 Haji et al. Mar 2002 A1
20020035520 Weiss Mar 2002 A1
20020042763 Pillay et al. Apr 2002 A1
20020049624 Raveis, Jr. Apr 2002 A1
20020049701 Nabe et al. Apr 2002 A1
20020049738 Epstein Apr 2002 A1
20020052836 Galperin et al. May 2002 A1
20020052841 Guthrie et al. May 2002 A1
20020052884 Farber et al. May 2002 A1
20020055869 Hegg May 2002 A1
20020069122 Yun et al. Jun 2002 A1
20020077964 Brody et al. Jun 2002 A1
20020087460 Hornung Jul 2002 A1
20020091635 Dilip et al. Jul 2002 A1
20020091650 Ellis Jul 2002 A1
20020091706 Anderson et al. Jul 2002 A1
20020099628 Takaoka et al. Jul 2002 A1
20020099635 Guiragosian Jul 2002 A1
20020099641 Mills et al. Jul 2002 A1
20020099824 Bender et al. Jul 2002 A1
20020099936 Kou et al. Jul 2002 A1
20020103809 Starzl et al. Aug 2002 A1
20020103933 Garon et al. Aug 2002 A1
20020107765 Walker Aug 2002 A1
20020107849 Hickey et al. Aug 2002 A1
20020111816 Lortscher et al. Aug 2002 A1
20020111890 Sloan et al. Aug 2002 A1
20020111910 Walsh Aug 2002 A1
20020116247 Tucker et al. Aug 2002 A1
20020119824 Allen Aug 2002 A1
20020120757 Sutherland et al. Aug 2002 A1
20020128962 Kasower Sep 2002 A1
20020131565 Scheuring et al. Sep 2002 A1
20020133365 Grey et al. Sep 2002 A1
20020133462 Shteyn Sep 2002 A1
20020133504 Vlahos et al. Sep 2002 A1
20020138297 Lee Sep 2002 A1
20020138445 Laage et al. Sep 2002 A1
20020138470 Zhou Sep 2002 A1
20020143943 Lee et al. Oct 2002 A1
20020147617 Schoenbaum et al. Oct 2002 A1
20020147669 Taylor et al. Oct 2002 A1
20020147695 Khedkar et al. Oct 2002 A1
20020147801 Gullotta et al. Oct 2002 A1
20020152166 Dutta et al. Oct 2002 A1
20020156676 Ahrens et al. Oct 2002 A1
20020156797 Lee et al. Oct 2002 A1
20020161496 Yamaki Oct 2002 A1
20020161664 Shaya et al. Oct 2002 A1
20020165757 Lisser Nov 2002 A1
20020165839 Taylor et al. Nov 2002 A1
20020169747 Chapman et al. Nov 2002 A1
20020173984 Robertson et al. Nov 2002 A1
20020173994 Ferguson, III Nov 2002 A1
20020174048 Dheer et al. Nov 2002 A1
20020184054 Cox et al. Dec 2002 A1
20020184255 Edd et al. Dec 2002 A1
20020188478 Breeland et al. Dec 2002 A1
20020188544 Wizon et al. Dec 2002 A1
20020194103 Nabe Dec 2002 A1
20020194117 Nabe et al. Dec 2002 A1
20020194120 Russell et al. Dec 2002 A1
20020198736 Harrison Dec 2002 A1
20020198800 Shamrakov Dec 2002 A1
20020198806 Blagg et al. Dec 2002 A1
20020198824 Cook Dec 2002 A1
20020198830 Randell et al. Dec 2002 A1
20030002671 Inchalik et al. Jan 2003 A1
20030009415 Lutnick et al. Jan 2003 A1
20030009418 Green et al. Jan 2003 A1
20030009426 Ruiz-Sanchez Jan 2003 A1
20030014336 Dao et al. Jan 2003 A1
20030018549 Fei et al. Jan 2003 A1
20030018558 Heffner et al. Jan 2003 A1
20030018578 Schultz Jan 2003 A1
20030023531 Fergusson Jan 2003 A1
20030027635 Walker et al. Feb 2003 A1
20030028402 Ulrich et al. Feb 2003 A1
20030028477 Stevenson et al. Feb 2003 A1
20030036926 Starkey et al. Feb 2003 A1
20030036995 Lazerson Feb 2003 A1
20030037054 Dutta et al. Feb 2003 A1
20030041019 Vagim, III et al. Feb 2003 A1
20030041031 Hedy Feb 2003 A1
20030041050 Smith et al. Feb 2003 A1
20030046112 Dutta et al. Mar 2003 A1
20030046222 Bard et al. Mar 2003 A1
20030046311 Baidya et al. Mar 2003 A1
20030050795 Baldwin, Jr. et al. Mar 2003 A1
20030050796 Baldwin, Jr. et al. Mar 2003 A1
20030050882 Degen et al. Mar 2003 A1
20030055931 Cravo De Almeida et al. Mar 2003 A1
20030064705 Desierio Apr 2003 A1
20030065563 Elliott et al. Apr 2003 A1
20030069839 Whittington et al. Apr 2003 A1
20030069943 Bahrs et al. Apr 2003 A1
20030078877 Beirne et al. Apr 2003 A1
20030078897 Florance et al. Apr 2003 A1
20030097342 Whittingtom May 2003 A1
20030097380 Mulhern et al. May 2003 A1
20030101111 Dang et al. May 2003 A1
20030101344 Wheeler et al. May 2003 A1
20030105728 Yano et al. Jun 2003 A1
20030105733 Boreham Jun 2003 A1
20030105742 Boreham et al. Jun 2003 A1
20030110111 Nalebuff et al. Jun 2003 A1
20030115122 Slater et al. Jun 2003 A1
20030126072 Brock Jul 2003 A1
20030135451 O'Brien et al. Jul 2003 A1
20030153299 Perfit et al. Aug 2003 A1
20030154162 Danaher et al. Aug 2003 A1
20030158749 Olchanski et al. Aug 2003 A1
20030158776 Landesmann Aug 2003 A1
20030158960 Engberg Aug 2003 A1
20030163416 Kitajima Aug 2003 A1
20030163435 Payone Aug 2003 A1
20030163483 Zingher et al. Aug 2003 A1
20030163513 Schaeck et al. Aug 2003 A1
20030171942 Gaito Sep 2003 A1
20030172039 Guy Sep 2003 A1
20030187780 Arthus et al. Oct 2003 A1
20030191731 Stewart et al. Oct 2003 A1
20030195830 Merkoulovitch et al. Oct 2003 A1
20030195859 Lawrence Oct 2003 A1
20030200151 Ellenson et al. Oct 2003 A1
20030204429 Botscheck et al. Oct 2003 A1
20030204752 Garrison Oct 2003 A1
20030208412 Hillestad et al. Nov 2003 A1
20030212618 Keyes et al. Nov 2003 A1
20030212654 Harper et al. Nov 2003 A1
20030220858 Lam et al. Nov 2003 A1
20030229507 Perge Dec 2003 A1
20030229580 Gass et al. Dec 2003 A1
20030229892 Sardera Dec 2003 A1
20030233259 Mistretta et al. Dec 2003 A1
20030236738 Lange et al. Dec 2003 A1
20040006488 Fitall et al. Jan 2004 A1
20040006536 Kawashima et al. Jan 2004 A1
20040010443 May et al. Jan 2004 A1
20040010458 Friedman Jan 2004 A1
20040019799 Vering et al. Jan 2004 A1
20040023637 Johnson et al. Feb 2004 A1
20040024709 Yu et al. Feb 2004 A1
20040030621 Cobb Feb 2004 A1
20040030629 Freeman et al. Feb 2004 A1
20040030649 Nelson et al. Feb 2004 A1
20040030667 Xu et al. Feb 2004 A1
20040039688 Sulkowski et al. Feb 2004 A1
20040044563 Stein Mar 2004 A1
20040044615 Xue et al. Mar 2004 A1
20040044617 Lu Mar 2004 A1
20040044673 Brady et al. Mar 2004 A1
20040049473 Gower et al. Mar 2004 A1
20040050928 Bishop et al. Mar 2004 A1
20040052357 Logan et al. Mar 2004 A1
20040054619 Watson et al. Mar 2004 A1
20040064402 Dreyer et al. Apr 2004 A1
20040073456 Gottlieb et al. Apr 2004 A1
20040078323 Johnston et al. Apr 2004 A1
20040078324 Lonnberg et al. Apr 2004 A1
20040083215 de Jong Apr 2004 A1
20040083482 Makagon et al. Apr 2004 A1
20040088237 Moenickheim et al. May 2004 A1
20040088255 Zielke et al. May 2004 A1
20040098625 Lagadec et al. May 2004 A1
20040103147 Flesher et al. May 2004 A1
20040107250 Marciano Jun 2004 A1
20040111292 Hutchins Jun 2004 A1
20040111305 Gavan et al. Jun 2004 A1
20040111358 Lange et al. Jun 2004 A1
20040111359 Hudock Jun 2004 A1
20040111363 Trench et al. Jun 2004 A1
20040117235 Shacham Jun 2004 A1
20040117302 Weichert et al. Jun 2004 A1
20040117358 Von Kaenel et al. Jun 2004 A1
20040122696 Beringer Jun 2004 A1
20040128150 Lundegren Jul 2004 A1
20040128156 Beringer et al. Jul 2004 A1
20040128227 Whipple et al. Jul 2004 A1
20040128230 Oppenheimer et al. Jul 2004 A1
20040133493 Ford et al. Jul 2004 A1
20040133509 McCoy et al. Jul 2004 A1
20040133513 McCoy et al. Jul 2004 A1
20040133515 McCoy et al. Jul 2004 A1
20040138994 DeFrancesco et al. Jul 2004 A1
20040138995 Hershkowitz et al. Jul 2004 A1
20040139025 Coleman Jul 2004 A1
20040141005 Banatwala et al. Jul 2004 A1
20040143546 Wood et al. Jul 2004 A1
20040143596 Sirkin Jul 2004 A1
20040153330 Miller et al. Aug 2004 A1
20040153437 Buchan Aug 2004 A1
20040153448 Cheng et al. Aug 2004 A1
20040153521 Kogo Aug 2004 A1
20040158521 Newton Aug 2004 A1
20040158523 Dort Aug 2004 A1
20040158723 Root Aug 2004 A1
20040159700 Khan et al. Aug 2004 A1
20040167793 Masuoka et al. Aug 2004 A1
20040176995 Fusz Sep 2004 A1
20040177030 Shoham Sep 2004 A1
20040177114 Friedman et al. Sep 2004 A1
20040186807 Nathans et al. Sep 2004 A1
20040193535 Barazesh Sep 2004 A1
20040193538 Raines Sep 2004 A1
20040199456 Flint et al. Oct 2004 A1
20040199458 Ho Oct 2004 A1
20040199462 Starrs Oct 2004 A1
20040199789 Shaw et al. Oct 2004 A1
20040204948 Singletary et al. Oct 2004 A1
20040215553 Gang et al. Oct 2004 A1
20040215554 Kemper et al. Oct 2004 A1
20040215555 Kemper et al. Oct 2004 A1
20040215556 Merkley, Jr. et al. Oct 2004 A1
20040215584 Yao Oct 2004 A1
20040220865 Lozowski et al. Nov 2004 A1
20040220896 Finlay et al. Nov 2004 A1
20040220918 Scriffignano et al. Nov 2004 A1
20040221043 Su et al. Nov 2004 A1
20040225099 Hohberg et al. Nov 2004 A1
20040225545 Turner et al. Nov 2004 A1
20040225594 Nolan, III et al. Nov 2004 A1
20040225596 Kemper et al. Nov 2004 A1
20040225597 Oppenheimer et al. Nov 2004 A1
20040225643 Alpha et al. Nov 2004 A1
20040230534 McGough Nov 2004 A1
20040243450 Bernard, Jr. et al. Dec 2004 A1
20040243506 Das Dec 2004 A1
20040243588 Tanner et al. Dec 2004 A1
20040249532 Kelly et al. Dec 2004 A1
20040254935 Chagoly et al. Dec 2004 A1
20040255127 Arnouse Dec 2004 A1
20040267660 Greenwood et al. Dec 2004 A1
20040267714 Frid et al. Dec 2004 A1
20050004855 Jenson et al. Jan 2005 A1
20050004870 McGaughey Jan 2005 A1
20050005168 Dick Jan 2005 A1
20050010513 Duckworth et al. Jan 2005 A1
20050010555 Gallivan Jan 2005 A1
20050021476 Candella et al. Jan 2005 A1
20050027633 Fortuna et al. Feb 2005 A1
20050027983 Klawon Feb 2005 A1
20050027995 Menschik et al. Feb 2005 A1
20050038737 Norris Feb 2005 A1
20050049991 Aggarwal Mar 2005 A1
20050055231 Lee Mar 2005 A1
20050055275 Newman et al. Mar 2005 A1
20050058262 Timmins et al. Mar 2005 A1
20050060332 Bernstein et al. Mar 2005 A1
20050071328 Lawrence Mar 2005 A1
20050080697 Foss et al. Apr 2005 A1
20050080821 Breil et al. Apr 2005 A1
20050086071 Fox, Jr. et al. Apr 2005 A1
20050086072 Fox, Jr. et al. Apr 2005 A1
20050086126 Patterson Apr 2005 A1
20050086176 Dahlgren Apr 2005 A1
20050086261 Mammone Apr 2005 A1
20050091164 Varble Apr 2005 A1
20050097017 Hanratty May 2005 A1
20050097039 Kulcsar et al. May 2005 A1
20050097320 Golan et al. May 2005 A1
20050102180 Gailey et al. May 2005 A1
20050102206 Savasoglu et al. May 2005 A1
20050102226 Oppenheimer et al. May 2005 A1
20050105719 Huda May 2005 A1
20050108396 Bittner May 2005 A1
20050108631 Amorin et al. May 2005 A1
20050113991 Rogers et al. May 2005 A1
20050114335 Wesinger, Jr. et al. May 2005 A1
20050114344 Wesinger, Jr. et al. May 2005 A1
20050114345 Wesinger, Jr. et al. May 2005 A1
20050125291 Demkiw Grayson et al. Jun 2005 A1
20050125350 Tidwell et al. Jun 2005 A1
20050125397 Gross et al. Jun 2005 A1
20050130704 McParland et al. Jun 2005 A1
20050137899 Davies et al. Jun 2005 A1
20050137912 Rao et al. Jun 2005 A1
20050137963 Ricketts et al. Jun 2005 A1
20050154617 Ruggieri et al. Jul 2005 A1
20050154664 Guy et al. Jul 2005 A1
20050154665 Kerr Jul 2005 A1
20050154769 Eckart et al. Jul 2005 A1
20050187948 Monitzer et al. Aug 2005 A1
20050192008 Desai et al. Sep 2005 A1
20050193093 Mathew et al. Sep 2005 A1
20050197953 Broadbent et al. Sep 2005 A1
20050203768 Florance Sep 2005 A1
20050208461 Krebs et al. Sep 2005 A1
20050209880 Drelicharz et al. Sep 2005 A1
20050209922 Hofmeister Sep 2005 A1
20050216953 Ellingson Sep 2005 A1
20050226224 Lee et al. Oct 2005 A1
20050228748 Togher et al. Oct 2005 A1
20050246338 Bird Nov 2005 A1
20050251474 Shinn et al. Nov 2005 A1
20050257250 Mitchell et al. Nov 2005 A1
20050262158 Sauermann Nov 2005 A1
20050267840 Holm-Blagg et al. Dec 2005 A1
20050273423 Kiai et al. Dec 2005 A1
20050273431 Abel et al. Dec 2005 A1
20050273849 Araujo et al. Dec 2005 A1
20050276401 Madill et al. Dec 2005 A1
20050279827 Mascavage et al. Dec 2005 A1
20050288998 Verma et al. Dec 2005 A1
20050289003 Thompson et al. Dec 2005 A1
20060014129 Coleman et al. Jan 2006 A1
20060015425 Brooks Jan 2006 A1
20060020611 Gilbert et al. Jan 2006 A1
20060029107 McCullough et al. Feb 2006 A1
20060031158 Orman Feb 2006 A1
20060032909 Seegar Feb 2006 A1
20060036543 Blagg et al. Feb 2006 A1
20060036748 Nusbaum et al. Feb 2006 A1
20060041670 Musseleck et al. Feb 2006 A1
20060059073 Walzak Mar 2006 A1
20060059086 Mulhern Mar 2006 A1
20060069635 Ram et al. Mar 2006 A1
20060074793 Hibbert et al. Apr 2006 A1
20060074991 Lussier et al. Apr 2006 A1
20060079211 Degraeve Apr 2006 A1
20060080139 Mainzer Apr 2006 A1
20060080233 Mendelovich et al. Apr 2006 A1
20060080251 Fried et al. Apr 2006 A1
20060085334 Murphy Apr 2006 A1
20060085361 Hoerle et al. Apr 2006 A1
20060085454 Blegen et al. Apr 2006 A1
20060089842 Medawar Apr 2006 A1
20060095363 May May 2006 A1
20060100944 Reddin et al. May 2006 A1
20060100954 Schoen May 2006 A1
20060106670 Cai et al. May 2006 A1
20060123461 Lunt et al. Jun 2006 A1
20060129419 Flaxer et al. Jun 2006 A1
20060131390 Kim Jun 2006 A1
20060136330 DeRoy et al. Jun 2006 A1
20060136595 Satyavolu Jun 2006 A1
20060149674 Cook et al. Jul 2006 A1
20060155573 Hartunian Jul 2006 A1
20060155639 Lynch et al. Jul 2006 A1
20060155780 Sakairi et al. Jul 2006 A1
20060161554 Lucovsky et al. Jul 2006 A1
20060163347 Foss et al. Jul 2006 A1
20060173772 Hayes et al. Aug 2006 A1
20060177226 Ellis Aug 2006 A1
20060178971 Owen et al. Aug 2006 A1
20060178983 Nice et al. Aug 2006 A1
20060179050 Giang et al. Aug 2006 A1
20060184410 Ramamurthy et al. Aug 2006 A1
20060184440 Britti et al. Aug 2006 A1
20060184585 Grear et al. Aug 2006 A1
20060195351 Bayburtian Aug 2006 A1
20060195688 Drissi et al. Aug 2006 A1
20060202012 Grano et al. Sep 2006 A1
20060204051 Holland, IV Sep 2006 A1
20060212386 Willey et al. Sep 2006 A1
20060212407 Lyon Sep 2006 A1
20060229799 Nimmo et al. Oct 2006 A1
20060229943 Mathias et al. Oct 2006 A1
20060229961 Lyftogt et al. Oct 2006 A1
20060229996 Keithley et al. Oct 2006 A1
20060233332 Toms Oct 2006 A1
20060235743 Long et al. Oct 2006 A1
20060235935 Ng Oct 2006 A1
20060241923 Xu et al. Oct 2006 A1
20060242046 Haggerty et al. Oct 2006 A1
20060242047 Haggerty et al. Oct 2006 A1
20060259364 Strock et al. Nov 2006 A1
20060265323 Winter et al. Nov 2006 A1
20060267999 Cash et al. Nov 2006 A1
20060271457 Romain et al. Nov 2006 A1
20060271633 Adler Nov 2006 A1
20060276171 Pousti Dec 2006 A1
20060277089 Hubbard et al. Dec 2006 A1
20060277092 Williams Dec 2006 A1
20060277141 Palmer Dec 2006 A1
20060278704 Saunders et al. Dec 2006 A1
20060282359 Nobili et al. Dec 2006 A1
20060282429 Hernandez-Sherrington et al. Dec 2006 A1
20060282819 Graham et al. Dec 2006 A1
20060287764 Kraft Dec 2006 A1
20060287766 Kraft Dec 2006 A1
20060287767 Kraft Dec 2006 A1
20060288090 Kraft Dec 2006 A1
20060293932 Cash et al. Dec 2006 A1
20060294199 Bertholf Dec 2006 A1
20070011020 Martin Jan 2007 A1
20070011030 Bregante et al. Jan 2007 A1
20070011032 Bregante et al. Jan 2007 A1
20070011083 Bird et al. Jan 2007 A1
20070016500 Chatterji et al. Jan 2007 A1
20070016501 Chatterji et al. Jan 2007 A1
20070016517 Solomon Jan 2007 A1
20070016518 Atkinson et al. Jan 2007 A1
20070016520 Gang et al. Jan 2007 A1
20070022141 Singleton et al. Jan 2007 A1
20070027778 Schellhammer et al. Feb 2007 A1
20070030282 Cash et al. Feb 2007 A1
20070038483 Wood Feb 2007 A1
20070038497 Britti et al. Feb 2007 A1
20070038568 Greene et al. Feb 2007 A1
20070043654 Libman Feb 2007 A1
20070045402 Rothschild Mar 2007 A1
20070045405 Rothschild Mar 2007 A1
20070047714 Baniak et al. Mar 2007 A1
20070067207 Haggerty et al. Mar 2007 A1
20070067285 Blume et al. Mar 2007 A1
20070067297 Kublickis Mar 2007 A1
20070067437 Sindambiwe Mar 2007 A1
20070078741 Haggerty et al. Apr 2007 A1
20070083460 Bachenheimer Apr 2007 A1
20070083463 Kraft Apr 2007 A1
20070088950 Wheeler et al. Apr 2007 A1
20070093234 Willis et al. Apr 2007 A1
20070094137 Phillips et al. Apr 2007 A1
20070094230 Subramaniam et al. Apr 2007 A1
20070094241 Blackwell et al. Apr 2007 A1
20070094264 Nair Apr 2007 A1
20070106582 Baker et al. May 2007 A1
20070112668 Celano et al. May 2007 A1
20070118393 Rosen et al. May 2007 A1
20070118410 Nadal May 2007 A1
20070127702 Shaffer et al. Jun 2007 A1
20070130070 Williams Jun 2007 A1
20070156554 Nikoley et al. Jul 2007 A1
20070156589 Zimler et al. Jul 2007 A1
20070156692 Rosewarne Jul 2007 A1
20070156718 Hossfeld et al. Jul 2007 A1
20070162414 Horowitz et al. Jul 2007 A1
20070168267 Zimmerman et al. Jul 2007 A1
20070179798 Inbarajan Aug 2007 A1
20070185797 Robinson Aug 2007 A1
20070192121 Routson et al. Aug 2007 A1
20070192122 Routson et al. Aug 2007 A1
20070192347 Rossmark et al. Aug 2007 A1
20070198336 Thompson Aug 2007 A1
20070198407 Winter Aug 2007 A1
20070204338 Aiello et al. Aug 2007 A1
20070208640 Banasiak et al. Sep 2007 A1
20070214000 Shahrabi et al. Sep 2007 A1
20070220611 Socolow et al. Sep 2007 A1
20070226010 Larsen Sep 2007 A1
20070226047 Ward Sep 2007 A1
20070226093 Chan et al. Sep 2007 A1
20070226114 Haggerty et al. Sep 2007 A1
20070226129 Liao et al. Sep 2007 A1
20070233591 Newton Oct 2007 A1
20070244732 Chatterji et al. Oct 2007 A1
20070244782 Chimento Oct 2007 A1
20070250441 Paulsen et al. Oct 2007 A1
20070250459 Schwarz et al. Oct 2007 A1
20070255654 Whipple et al. Nov 2007 A1
20070255655 Kemper et al. Nov 2007 A1
20070258626 Reiner Nov 2007 A1
20070260539 Delinsky Nov 2007 A1
20070261114 Pomerantsev Nov 2007 A1
20070262137 Brown Nov 2007 A1
20070266439 Kraft Nov 2007 A1
20070279187 Hekmatpour et al. Dec 2007 A1
20070282730 Carpenter et al. Dec 2007 A1
20070282736 Conlin et al. Dec 2007 A1
20070284433 Domenica et al. Dec 2007 A1
20070288338 Hoadley Dec 2007 A1
20070288360 Seeklus Dec 2007 A1
20070294195 Curry et al. Dec 2007 A1
20070294431 Adelman et al. Dec 2007 A1
20070299699 Policelli et al. Dec 2007 A1
20070299759 Kelly Dec 2007 A1
20070299770 Delinsky Dec 2007 A1
20070299771 Brody Dec 2007 A1
20080010203 Grant Jan 2008 A1
20080010206 Coleman Jan 2008 A1
20080015979 Bentley Jan 2008 A1
20080021804 Deckoff Jan 2008 A1
20080022281 Dubhashi et al. Jan 2008 A1
20080027858 Benson Jan 2008 A1
20080033742 Bernasconi Feb 2008 A1
20080033750 Burriss et al. Feb 2008 A1
20080033956 Saha et al. Feb 2008 A1
20080046351 Wiener et al. Feb 2008 A1
20080052182 Marshall Feb 2008 A1
20080052224 Parker Feb 2008 A1
20080052244 Tsuei et al. Feb 2008 A1
20080059224 Schechter Mar 2008 A1
20080059317 Chandran et al. Mar 2008 A1
20080059352 Chandran Mar 2008 A1
20080059364 Tidwell et al. Mar 2008 A1
20080059449 Webster et al. Mar 2008 A1
20080065530 Talbert et al. Mar 2008 A1
20080072316 Chang et al. Mar 2008 A1
20080082536 Schwabe et al. Apr 2008 A1
20080086400 Ardelean et al. Apr 2008 A1
20080091519 Foss Apr 2008 A1
20080097768 Godshalk Apr 2008 A1
20080103959 Carroll et al. May 2008 A1
20080103972 Lanc May 2008 A1
20080109315 Huang et al. May 2008 A1
20080109740 Prinsen et al. May 2008 A1
20080109875 Kraft May 2008 A1
20080115191 Kim et al. May 2008 A1
20080120133 Krishnaswami et al. May 2008 A1
20080120569 Mann et al. May 2008 A1
20080133322 Kalla et al. Jun 2008 A1
20080140507 Hamlisch et al. Jun 2008 A1
20080162383 Kraft Jul 2008 A1
20080172324 Johnson Jul 2008 A1
20080177655 Zalik Jul 2008 A1
20080183504 Highley Jul 2008 A1
20080183564 Tien et al. Jul 2008 A1
20080184270 Cole et al. Jul 2008 A1
20080189202 Zadoorian et al. Aug 2008 A1
20080195548 Chu et al. Aug 2008 A1
20080195600 Deakter Aug 2008 A1
20080201257 Lewis et al. Aug 2008 A1
20080201401 Pugh et al. Aug 2008 A1
20080205655 Wilkins et al. Aug 2008 A1
20080205774 Brinker et al. Aug 2008 A1
20080208610 Thomas et al. Aug 2008 A1
20080208631 Morita et al. Aug 2008 A1
20080208726 Tsantes et al. Aug 2008 A1
20080208735 Balet et al. Aug 2008 A1
20080208873 Boehmer Aug 2008 A1
20080216156 Kosaka Sep 2008 A1
20080221972 Megdal et al. Sep 2008 A1
20080222015 Megdal et al. Sep 2008 A1
20080222027 Megdal et al. Sep 2008 A1
20080222706 Renaud et al. Sep 2008 A1
20080244008 Wilkinson et al. Oct 2008 A1
20080249869 Angell et al. Oct 2008 A1
20080255922 Feldman et al. Oct 2008 A1
20080263058 Peden Oct 2008 A1
20080270209 Mauseth et al. Oct 2008 A1
20080270294 Lent et al. Oct 2008 A1
20080270295 Lent et al. Oct 2008 A1
20080288283 Baldwin, Jr. et al. Nov 2008 A1
20080294501 Rennich et al. Nov 2008 A1
20080294540 Celka et al. Nov 2008 A1
20080301016 Durvasula et al. Dec 2008 A1
20080301188 O'Hara Dec 2008 A1
20080306750 Wunder et al. Dec 2008 A1
20080312969 Raines et al. Dec 2008 A1
20080319832 Liebe Dec 2008 A1
20080319889 Hammad Dec 2008 A1
20080319909 Perkins et al. Dec 2008 A1
20080320575 Gelb et al. Dec 2008 A1
20090006475 Udezue et al. Jan 2009 A1
20090007231 Kaiser et al. Jan 2009 A1
20090012889 Finch Jan 2009 A1
20090018986 Alcorn et al. Jan 2009 A1
20090018996 Hunt et al. Jan 2009 A1
20090024428 Hudock, Jr. Jan 2009 A1
20090024505 Patel et al. Jan 2009 A1
20090030776 Walker et al. Jan 2009 A1
20090031426 Dal Lago et al. Jan 2009 A1
20090043691 Kasower Feb 2009 A1
20090044279 Crawford et al. Feb 2009 A1
20090048877 Binns et al. Feb 2009 A1
20090048957 Celano Feb 2009 A1
20090055322 Bykov et al. Feb 2009 A1
20090055894 Lorsch Feb 2009 A1
20090060343 Rosea Mar 2009 A1
20090089190 Girulat Apr 2009 A1
20090094064 Tyler et al. Apr 2009 A1
20090094237 Churl et al. Apr 2009 A1
20090094674 Schwartz et al. Apr 2009 A1
20090099960 Robida et al. Apr 2009 A1
20090106846 Dupray et al. Apr 2009 A1
20090112650 Iwane Apr 2009 A1
20090113532 Lapidous Apr 2009 A1
20090119169 Chandratillake et al. May 2009 A1
20090119199 Salahi May 2009 A1
20090119299 Rhodes May 2009 A1
20090132347 Anderson et al. May 2009 A1
20090138335 Lieberman May 2009 A1
20090144102 Lopez Jun 2009 A1
20090144160 Haggerty et al. Jun 2009 A1
20090150166 Leite et al. Jun 2009 A1
20090150238 Marsh et al. Jun 2009 A1
20090158030 Rasti Jun 2009 A1
20090164232 Chmielewski et al. Jun 2009 A1
20090164380 Brown Jun 2009 A1
20090171723 Jenkins Jul 2009 A1
20090172815 Gu et al. Jul 2009 A1
20090182661 Irwin Jul 2009 A1
20090183259 Rinek et al. Jul 2009 A1
20090210807 Xiao et al. Aug 2009 A1
20090210886 Bhojwani et al. Aug 2009 A1
20090216591 Buerger et al. Aug 2009 A1
20090216640 Masi Aug 2009 A1
20090222308 Zoldi et al. Sep 2009 A1
20090222379 Choudhuri et al. Sep 2009 A1
20090222449 Hom et al. Sep 2009 A1
20090228918 Rolff et al. Sep 2009 A1
20090234665 Conkel Sep 2009 A1
20090234775 Whitney et al. Sep 2009 A1
20090234876 Schigel et al. Sep 2009 A1
20090240609 Cho et al. Sep 2009 A1
20090240624 James et al. Sep 2009 A1
20090248573 Haggerty et al. Oct 2009 A1
20090249440 Platt et al. Oct 2009 A1
20090254375 Martinez et al. Oct 2009 A1
20090254656 Vignisson et al. Oct 2009 A1
20090254971 Herz et al. Oct 2009 A1
20090271248 Sherman et al. Oct 2009 A1
20090271265 Lay et al. Oct 2009 A1
20090276244 Baldwin, Jr. et al. Nov 2009 A1
20090289110 Regen et al. Nov 2009 A1
20090313049 Joao et al. Dec 2009 A1
20090313562 Appleyard et al. Dec 2009 A1
20090327120 Eze et al. Dec 2009 A1
20090328173 Jakobson et al. Dec 2009 A1
20100009320 Wilkelis Jan 2010 A1
20100009663 Chang Jan 2010 A1
20100010935 Shelton Jan 2010 A1
20100011428 Atwood et al. Jan 2010 A1
20100023434 Bond Jan 2010 A1
20100023448 Eze Jan 2010 A1
20100030578 Siddique et al. Feb 2010 A1
20100030677 Melik-Aslanian et al. Feb 2010 A1
20100037299 Karasick et al. Feb 2010 A1
20100042517 Paintin et al. Feb 2010 A1
20100042583 Gervais Feb 2010 A1
20100049803 Ogilvie et al. Feb 2010 A1
20100082476 Bowman Apr 2010 A1
20100094704 Subramanian et al. Apr 2010 A1
20100094758 Chamberlain et al. Apr 2010 A1
20100107225 Spencer et al. Apr 2010 A1
20100114724 Ghosh et al. May 2010 A1
20100114744 Gonen May 2010 A1
20100122316 Lyon May 2010 A1
20100142698 Spottiswoode et al. Jun 2010 A1
20100145836 Baker et al. Jun 2010 A1
20100153707 Lentz, II Jun 2010 A1
20100169159 Rose et al. Jul 2010 A1
20100169264 O'Sullivan Jul 2010 A1
20100174638 Debie et al. Jul 2010 A1
20100185546 Pollard Jul 2010 A1
20100188684 Kumara Jul 2010 A1
20100205076 Parson et al. Aug 2010 A1
20100205087 Hubler et al. Aug 2010 A1
20100211445 Bodington Aug 2010 A1
20100211636 Starkenburg et al. Aug 2010 A1
20100217837 Ansari et al. Aug 2010 A1
20100223168 Haggerty et al. Sep 2010 A1
20100228658 Ketelsen et al. Sep 2010 A1
20100248681 Phills Sep 2010 A1
20100250338 Banerjee et al. Sep 2010 A1
20100250410 Song et al. Sep 2010 A1
20100250411 Rodski Sep 2010 A1
20100250497 Redlich et al. Sep 2010 A1
20100250509 Andersen Sep 2010 A1
20100253686 Alsbury et al. Oct 2010 A1
20100257102 Perlman Oct 2010 A1
20100262535 Lent et al. Oct 2010 A1
20100268660 Ekdahl Oct 2010 A1
20100293090 Domenikos et al. Nov 2010 A1
20100299251 Thomas Nov 2010 A1
20100299252 Thomas Nov 2010 A1
20100299260 Thomas Nov 2010 A1
20100299262 Handler Nov 2010 A1
20100324986 Thomas Dec 2010 A1
20100325035 Hilgers et al. Dec 2010 A1
20100325036 Thomas Dec 2010 A1
20110004514 Thomas Jan 2011 A1
20110004546 Thomas Jan 2011 A1
20110009707 Kaundinya et al. Jan 2011 A1
20110016042 Cho et al. Jan 2011 A1
20110023115 Wright Jan 2011 A1
20110029427 Haggerty et al. Feb 2011 A1
20110035315 Langley Feb 2011 A1
20110040736 Kalaboukis Feb 2011 A1
20110054981 Faith et al. Mar 2011 A1
20110060654 Elliott et al. Mar 2011 A1
20110060673 Delinsky et al. Mar 2011 A1
20110078073 Annappindi et al. Mar 2011 A1
20110113084 Ramnani May 2011 A1
20110113086 Long et al. May 2011 A1
20110125595 Neal et al. May 2011 A1
20110125632 Neel May 2011 A1
20110126275 Anderson et al. May 2011 A1
20110131123 Griffin et al. Jun 2011 A1
20110131131 Griffin et al. Jun 2011 A1
20110137760 Rudie et al. Jun 2011 A1
20110137789 Kortina et al. Jun 2011 A1
20110142213 Baniak et al. Jun 2011 A1
20110161218 Swift Jun 2011 A1
20110164746 Nice et al. Jul 2011 A1
20110166988 Coulter Jul 2011 A1
20110173116 Yan et al. Jul 2011 A1
20110178841 Rane et al. Jul 2011 A1
20110178899 Huszar Jul 2011 A1
20110178922 Imrey et al. Jul 2011 A1
20110179139 Starkenburg et al. Jul 2011 A1
20110184838 Winters et al. Jul 2011 A1
20110196791 Dominguez Aug 2011 A1
20110202474 Mele et al. Aug 2011 A1
20110211445 Chen Sep 2011 A1
20110219421 Ullman et al. Sep 2011 A1
20110238566 Santos Sep 2011 A1
20110258050 Chan et al. Oct 2011 A1
20110264566 Brown Oct 2011 A1
20110270779 Showalter Nov 2011 A1
20110270925 Mina Nov 2011 A1
20110282779 Megdal et al. Nov 2011 A1
20110295733 Megdal et al. Dec 2011 A1
20120005070 McFall et al. Jan 2012 A1
20120011056 Ward et al. Jan 2012 A1
20120023011 Hurwitz Jan 2012 A1
20120029956 Ghosh et al. Feb 2012 A1
20120030216 Churl et al. Feb 2012 A1
20120030771 Pierson et al. Feb 2012 A1
20120054592 Jaffe et al. Mar 2012 A1
20120066065 Switzer Mar 2012 A1
20120066084 Sneyders Mar 2012 A1
20120066106 Papadimitriou Mar 2012 A1
20120072464 Cohen Mar 2012 A1
20120101938 Kasower Apr 2012 A1
20120101939 Kasower Apr 2012 A1
20120106801 Jackson May 2012 A1
20120108274 Acebo Ruiz et al. May 2012 A1
20120109990 Yamasaki May 2012 A1
20120110467 Blake et al. May 2012 A1
20120116951 Chung et al. May 2012 A1
20120117509 Powell et al. May 2012 A1
20120123931 Megdal et al. May 2012 A1
20120123942 Song et al. May 2012 A1
20120124498 Santoro et al. May 2012 A1
20120136763 Megdal et al. May 2012 A1
20120136774 Imrey et al. May 2012 A1
20120150587 Kruger et al. Jun 2012 A1
20120158460 Kruger et al. Jun 2012 A1
20120158574 Brunzell et al. Jun 2012 A1
20120158654 Behren et al. Jun 2012 A1
20120173339 Flynt et al. Jul 2012 A1
20120173406 Fei et al. Jul 2012 A1
20120173417 Lohman et al. Jul 2012 A1
20120179536 Kalb et al. Jul 2012 A1
20120198556 Patel et al. Aug 2012 A1
20120204026 Shi et al. Aug 2012 A1
20120215682 Lent et al. Aug 2012 A1
20120216125 Pierce Aug 2012 A1
20120226916 Hahn et al. Sep 2012 A1
20120232958 Silbert Sep 2012 A1
20120239553 Gonen et al. Sep 2012 A1
20120239583 Dobrowolski Sep 2012 A1
20120246060 Conyack, Jr. et al. Sep 2012 A1
20120253852 Pourfallah et al. Oct 2012 A1
20120254018 Davies et al. Oct 2012 A1
20120265607 Belwadi Oct 2012 A1
20120265661 Megdal et al. Oct 2012 A1
20120278227 Kolo et al. Nov 2012 A1
20120278767 Stibel et al. Nov 2012 A1
20120284118 Mamich, Jr. et al. Nov 2012 A1
20120290660 Rao et al. Nov 2012 A1
20120317016 Hughes Dec 2012 A1
20120324388 Rao et al. Dec 2012 A1
20130006825 Robida et al. Jan 2013 A1
20130018811 Britti et al. Jan 2013 A1
20130031109 Roulson et al. Jan 2013 A1
20130031113 Feng et al. Jan 2013 A1
20130031624 Britti et al. Jan 2013 A1
20130060603 Wagner Mar 2013 A1
20130066775 Milam Mar 2013 A1
20130103571 Chung et al. Apr 2013 A1
20130110565 Means et al. May 2013 A1
20130117087 Coppinger May 2013 A1
20130124263 Amaro et al. May 2013 A1
20130124392 Achanta et al. May 2013 A1
20130125010 Strandell May 2013 A1
20130132151 Stibel et al. May 2013 A1
20130159168 Evans Jun 2013 A1
20130173447 Rothschild Jul 2013 A1
20130173449 Ng et al. Jul 2013 A1
20130173451 Kornegay et al. Jul 2013 A1
20130173481 Hirtenstein et al. Jul 2013 A1
20130185293 Boback Jul 2013 A1
20130191261 Chandler et al. Jul 2013 A1
20130205135 Lutz Aug 2013 A1
20130211986 Debie et al. Aug 2013 A1
20130226783 Haggerty et al. Aug 2013 A1
20130268357 Heath Oct 2013 A1
20130279676 Baniak et al. Oct 2013 A1
20130293363 Plymouth Nov 2013 A1
20130332338 Yan et al. Dec 2013 A1
20130332341 Papadimitriou Dec 2013 A1
20130332342 Kasower Dec 2013 A1
20130332467 Bornea et al. Dec 2013 A1
20130339249 Weller et al. Dec 2013 A1
20140012734 Megdal et al. Jan 2014 A1
20140025562 Rothrock et al. Jan 2014 A1
20140032265 Paprocki et al. Jan 2014 A1
20140032300 Zhang et al. Jan 2014 A1
20140032723 Nema Jan 2014 A1
20140040182 Gilder et al. Feb 2014 A1
20140061302 Hammad Mar 2014 A1
20140074689 Lund et al. Mar 2014 A1
20140089167 Kasower Mar 2014 A1
20140110477 Hammad Apr 2014 A1
20140136422 Jung et al. May 2014 A1
20140156500 Lassen et al. Jun 2014 A1
20140156501 Howe Jun 2014 A1
20140156503 Lassen et al. Jun 2014 A1
20140157375 Britti et al. Jun 2014 A1
20140164112 Kala Jun 2014 A1
20140164519 Shah Jun 2014 A1
20140172687 Chirehdast Jun 2014 A1
20140244353 Winters Aug 2014 A1
20140258083 Achanta et al. Sep 2014 A1
20140258089 Pearson et al. Sep 2014 A1
20140279329 Dancel Sep 2014 A1
20140304263 Vaitheeswaran et al. Oct 2014 A1
20140316969 Imrey Oct 2014 A1
20140324655 Kolathur Oct 2014 A1
20150026014 Kasower Jan 2015 A1
20150066772 Griffin et al. Mar 2015 A1
20150228016 Chandler Aug 2015 A1
20150254329 Agarwal et al. Sep 2015 A1
20150269506 Britti et al. Sep 2015 A1
20150278277 Agrawal et al. Oct 2015 A1
20150278944 Searson et al. Oct 2015 A1
20150287091 Koran Oct 2015 A1
20150295906 Ufford et al. Oct 2015 A1
20150310543 DeBie Oct 2015 A1
20150326580 McMillan et al. Nov 2015 A1
20150339769 deOliveira et al. Nov 2015 A1
20160004728 Balet et al. Jan 2016 A1
20160048700 Stransky-Heilkron Feb 2016 A1
20160055487 Votaw et al. Feb 2016 A1
20160071175 Reuss et al. Mar 2016 A1
20160092997 Shen et al. Mar 2016 A1
20160227037 Roybal et al. Aug 2016 A1
20160328476 Chang et al. Nov 2016 A1
20160342999 Rouston et al. Nov 2016 A1
20170041296 Ford et al. Feb 2017 A1
20170046526 Chan et al. Feb 2017 A1
20170046652 Haldenby et al. Feb 2017 A1
20170046664 Haldenby et al. Feb 2017 A1
20170046693 Haldenby et al. Feb 2017 A1
20170048021 Yanovsky et al. Feb 2017 A1
20170061138 Lambert Mar 2017 A1
20170098096 Redberg Apr 2017 A1
20170109735 Sheng et al. Apr 2017 A1
20170177809 Bull et al. Jun 2017 A1
20170200223 Kasower Jul 2017 A1
20170228820 Rohn Aug 2017 A1
20170249481 Edison Aug 2017 A1
20170262821 Imrey et al. Sep 2017 A1
20170278182 Kasower Sep 2017 A1
20180060596 Hamel et al. Mar 2018 A1
20180060600 Hamel et al. Mar 2018 A1
20180062835 Hamel et al. Mar 2018 A1
20180075527 Nagla et al. Mar 2018 A1
20180089379 Collins et al. Mar 2018 A1
20180150599 Valdes et al. May 2018 A1
20180183768 Lobban et al. Jun 2018 A1
20180205707 Bellala et al. Jul 2018 A1
20180218069 Rege et al. Aug 2018 A1
20180239914 Chen et al. Aug 2018 A1
20180253702 Dowding Sep 2018 A1
20180276222 Belknap et al. Sep 2018 A1
20180276661 van Wingerden Sep 2018 A1
20180302215 Salgueiro et al. Oct 2018 A1
20180309567 Wooden Oct 2018 A1
20180330516 Baca et al. Nov 2018 A1
20180343265 McMillan et al. Nov 2018 A1
20190065516 Barker Feb 2019 A1
20190188717 Putnam et al. Jun 2019 A1
20190251558 Liu et al. Aug 2019 A1
20190318122 Hockey et al. Oct 2019 A1
20190347627 Lin et al. Nov 2019 A1
20190356672 Bondugula et al. Nov 2019 A1
20200074109 Pieniazek et al. Mar 2020 A1
20200089905 Jones et al. Mar 2020 A1
20200106764 Hockey et al. Apr 2020 A1
20200106765 Hockey et al. Apr 2020 A1
20200143363 Schmidt May 2020 A1
20200153627 Wentz May 2020 A1
20200201878 Putnam et al. Jun 2020 A1
20200210492 Chang et al. Jul 2020 A1
20200211103 Searson et al. Jul 2020 A1
20200213206 Bracken et al. Jul 2020 A1
20200219181 Kasower Jul 2020 A1
20200226284 Yin Jul 2020 A1
20200265155 Dong et al. Aug 2020 A1
20200279053 Jones et al. Sep 2020 A1
20200285679 Chen et al. Sep 2020 A1
20200327150 Kunjur et al. Oct 2020 A1
20200327560 Anderson et al. Oct 2020 A1
20200364246 Farrell Nov 2020 A1
20200387634 Jones et al. Dec 2020 A1
20200394675 Bradford Dec 2020 A1
20210004373 Sankaran et al. Jan 2021 A1
20210034613 Ng et al. Feb 2021 A1
20210042366 Hicklin et al. Feb 2021 A1
20210064725 Miller et al. Mar 2021 A1
20210065160 Butvin et al. Mar 2021 A1
20210158299 Baggett May 2021 A1
20210158368 Baggett May 2021 A1
20210357707 Bondugula et al. Nov 2021 A1
20210400120 Prieditis Dec 2021 A1
20220019733 Billman et al. Jan 2022 A1
20220027853 McMillan et al. Jan 2022 A1
20220070294 Cody et al. Mar 2022 A1
20220156394 Riley et al. May 2022 A1
20220222368 Min et al. Jul 2022 A1
Foreign Referenced Citations (137)
Number Date Country
2004220812 Sep 2004 AU
2010200017 Jan 2010 AU
2022204452 Jul 2022 AU
2 611 595 Dec 2006 CA
2 868 933 Oct 2013 CA
3 060 136 May 2020 CA
2 792 070 Oct 2021 CA
1290373 Apr 2001 CN
101452555 Jun 2009 CN
102096886 Jun 2011 CN
102663650 Sep 2012 CN
106255985 Dec 2016 CN
112036952 Dec 2020 CN
0 350 907 Jan 1990 EP
0 419 889 Apr 1991 EP
0 458 698 Nov 1991 EP
0 468 440 Jan 1992 EP
0 554 083 Aug 1993 EP
0 566 736 Aug 1993 EP
0 559 358 Sep 1993 EP
0 869 652 Oct 1998 EP
0 913 789 May 1999 EP
0 919 942 Jun 1999 EP
0 977 128 Feb 2000 EP
1 028 401 Aug 2000 EP
0 772 836 Dec 2001 EP
1 850 278 Oct 2007 EP
1 988 501 Nov 2008 EP
3 201 804 Apr 2020 EP
3 846 104 Jul 2021 EP
2 752 058 Apr 2020 ES
1 322 809 Jul 1973 GB
349972 Apr 2016 IN
10-222559 Aug 1998 JP
10-261009 Sep 1998 JP
10-293732 Nov 1998 JP
2000-331068 Nov 2000 JP
2001-282957 Oct 2001 JP
2001-297141 Oct 2001 JP
2001-344463 Dec 2001 JP
2001-357256 Dec 2001 JP
2002-149778 May 2002 JP
2002-163449 Jun 2002 JP
2002-163498 Jun 2002 JP
2002-259753 Sep 2002 JP
2003-016261 Jan 2003 JP
2003-271851 Sep 2003 JP
2003-316881 Nov 2003 JP
2003-316950 Nov 2003 JP
10-2000-0036594 Jul 2000 KR
10-2000-0063995 Nov 2000 KR
10-2001-0016349 Mar 2001 KR
10-2001-0035145 May 2001 KR
10-2002-0007132 Jan 2002 KR
10-2004-0078798 Sep 2004 KR
10-2013-0107394 Oct 2013 KR
2007-015510 Apr 2008 MX
2 181 216 Apr 2002 RU
I256569 Jun 2006 TW
WO 94012943 Jun 1994 WO
WO 95012857 May 1995 WO
WO 95034155 Dec 1995 WO
WO 96000945 Jan 1996 WO
WO 98041931 Sep 1998 WO
WO 98041932 Sep 1998 WO
WO 98041933 Sep 1998 WO
WO 98049643 Nov 1998 WO
WO 99017225 Apr 1999 WO
WO 99017226 Apr 1999 WO
WO 99038094 Jul 1999 WO
WO 99046710 Sep 1999 WO
WO 00004465 Jan 2000 WO
WO 00011574 Mar 2000 WO
WO 00028441 May 2000 WO
WO 00055778 Sep 2000 WO
WO 00065469 Nov 2000 WO
WO 01004821 Jan 2001 WO
WO 01009752 Feb 2001 WO
WO 01009792 Feb 2001 WO
WO 01010090 Feb 2001 WO
WO 01016896 Mar 2001 WO
WO 01039090 May 2001 WO
WO 01039589 Jun 2001 WO
WO 01041083 Jun 2001 WO
WO 01041355 Jun 2001 WO
WO 01057720 Aug 2001 WO
WO 01080053 Oct 2001 WO
WO 01084281 Nov 2001 WO
WO 02013047 Feb 2002 WO
WO 02071176 Sep 2002 WO
WO 2004031986 Apr 2004 WO
WO 2004084098 Sep 2004 WO
WO 2004088464 Oct 2004 WO
WO 2004114160 Dec 2004 WO
WO 2005022348 Mar 2005 WO
WO 2005059781 Jun 2005 WO
WO 2005124619 Dec 2005 WO
WO 2006050278 May 2006 WO
WO 2006099081 Sep 2006 WO
WO 2006099492 Sep 2006 WO
WO 2006135451 Dec 2006 WO
WO 2007004158 Jan 2007 WO
WO 2007106393 Sep 2007 WO
WO 2007106786 Sep 2007 WO
WO 2007106787 Sep 2007 WO
WO 2008021061 Feb 2008 WO
WO 2008022289 Feb 2008 WO
WO 2008042614 Apr 2008 WO
WO 2008054403 May 2008 WO
WO 2008127288 Oct 2008 WO
WO 2008147918 Dec 2008 WO
WO 2009061342 May 2009 WO
WO 2009064840 May 2009 WO
WO 2009076555 Jun 2009 WO
WO 2009099448 Aug 2009 WO
WO 2009117468 Sep 2009 WO
WO 2009117518 Sep 2009 WO
WO 2010129257 Nov 2010 WO
WO 2010132492 Nov 2010 WO
WO 2013009920 Jan 2013 WO
WO 2013066633 May 2013 WO
WO 2014018900 Jan 2014 WO
WO 2014066816 May 2014 WO
WO 2014088895 Jun 2014 WO
WO 2014137759 Sep 2014 WO
WO 2015057538 Apr 2015 WO
WO 2018144612 Aug 2018 WO
WO 2018236732 Dec 2018 WO
WO 2019089439 May 2019 WO
WO 2019136407 Jul 2019 WO
WO 2019157491 Aug 2019 WO
WO 2019183483 Sep 2019 WO
WO 2020146667 Jul 2020 WO
WO 2020198236 Oct 2020 WO
WO 2020232137 Nov 2020 WO
WO 2021081516 Apr 2021 WO
WO 2022109613 May 2022 WO
Non-Patent Literature Citations (487)
Entry
Official Communication in Indian Patent Application No. 201917029540, dated Jan. 7, 2022.
Extended European Search Report for Application No. EP12747205, dated Feb. 11, 2022.
International Preliminary Report on Patentability in Application No. PCT/US2020/012976, dated Jul. 22, 2021.
Official Communication in Australian Patent Application No. 2018215082, dated Jan. 21, 2022.
U.S. Appl. No. 15/885,239, 2018/0218069, Massive Scale Heterogeneous Data Ingestion and User Resolution, filed Jan. 31, 2018.
U.S. Appl. No. 12/705,489, filed Feb. 12, 2010, Bargoli et al.
U.S. Appl. No. 12/705,511, filed Feb. 12, 2010, Bargoli et al.
“A New Approach to Fraud Solutions”, BasePoint Science Solving Fraud, pp. 8, 2006.
Abrahams, Steven W., “The New View in Mortgage Prepayments: Insight from Analysis at the Loan-By-Loan Level,” The Journal of Fixed Income, Jun. 1997, vol. 7, No. 1, pp. 8-21.
“ACS Company Birch & Davis Wins Texas CHIP Contract,” PR Newswire, Section: Financial News, May 17, 2000, Dallas, TX, pp. 3.
Actuate, “Delivering Enterprise Information for Corporate Portals”, White Paper, 2004, pp. 1-7.
Aharony et al., “Social Area Networks: Data Networking of the People, by the People, for the People,” 2009 International Conference on Computational Science and Engineering, May 2009, pp. 1148-1155.
Akl, Selim G., “Digital Signatures: A Tutorial Survey,” Computer, Feb. 1983, pp. 15-24.
Aktas et al., “Personalizing PageRank Based on Domain Profiles”, WEBKDD workshop: Webmining and Web Usage Analysis, Aug. 22, 2004, pp. 83-90.
Aktas et al., “Using Hyperlink Features to Personalize Web Search”, WEBKDD workshop: Webmining and Web Usage Analysis, Aug. 2004.
“An Even Better Solution to Financing Elective Surgery . . . ”, Unicorn Financial, pp. 7, http://web.archive.org/web/20000816161359/http://www.unicornfinancial.com/, as downloaded Oct. 15, 2008.
Apte, et al., “A Probabilistic Estimation Framework for Predictive Modeling Analytics,” IBM Systems Journal, 2002, vol. 41, No. 3, pp. 438-448.
“Authorizing Safety Net Public Health Programs,” Hearing before the Subcommittee on Health of the Committee on Energy and Commerce, House of Representatives, One Hundred Seventh Congress, First Session, Serial No. 107-57, dated Aug. 1, 2001, 226 pgs.
AISG's National Underwriting Database, A-PLUS, is Now the Largest in the Industry, Business Wire, Aug. 7, 1997.
An Expert System for Determining Medicaid Eligibility, Journal of Medical Systems, vol. 12, Nov. 5, 1988, in 10 pages.
Announcing TrueProfiler, http://web.archive.org/web/20021201123646/http://www.truecredit.com/index.asp, dated Dec. 1, 2002, 2 pages.
Anonymous, “Credit-Report Disputes Await Electronic Resolution,” Credit Card News, Chicago, Jan. 15, 1993, vol. 5, No. 19, p. 5.
Anonymous, “MBNA Offers Resolution of Credit Card Disputes,” Hempstead, Feb. 2002, vol. 68, No. 2, p. 47.
Antonopoulos, Andreas M., “Mastering Bitcoin: Unlocking Digital Crypto-Currencies”, O'Reilly, Dec. 2014, First Edition, pp. 282.
“AT&T Expected to Turn Up Heat in Card Wars”, American Banker, May 27, 1993, vol. 158, No. 101, pp. 3.
Avery et al., “Consumer Credit Scoring: Do Situational Circumstances Matter?”, Journal of Banking & Finance, vol. 28, 2004, pp. 835-856.
Awoonor-Williams, Princess Josephine, Ph.D. “Gender and Credit: An Analysis of Women's Experience in the Credit Market”, ProQuest Dissertations and Theses, May 2004, pp. 148.
Babcock, Gwen, “Aggregation Without Aggravation: Determining Spatial Contiguity and Joining Geographic Areas Using Hashing”, SAS Global Forum 2010, Reporting and Information Visualization, Paper 223-2010, pp. 17.
“Balance Transfers Offer Opportunities”, Risk Credit Risk Management Report, Jan. 29, 1996, vol. 6, No. 2, pp. 2.
Bancroft, John, “Tools Help Managers with Risk Management,” Real Estate Finance Today, May 26, 1997, pp. 11-12.
“Bank of America Direct Web-Based Network Adds Core Functionality To Meet Day-To-Day Treasury Needs”, Business Wire, Oct. 25, 1999. pp. 2.
Barone, Robert P., “The Integrated Approach to Branch Service Delivery,” American Banker, Aug. 6, 1991, http://www.highbeam.com/doc/1G1-11128400.html.
Barry, Ellen, “Life, Liberty, and the Pursuit of Lipo,” The Boston Phoenix, News & Opinion, dated Apr. 6, 1998, as downloaded at http://weeklywire.com/ww/04-06-98/boston_feature_1.html (1 of 12) [Oct. 15, 2008 2:35:25 PM].
Belford, Terrence, “Technology Quarterly: Computers, Internet Speeds Credit Checks System Tailored for Doctors, Dentists,” The Globe and Mail (Canada), Section: Report on Business Special Reports, p. C10, Mar. 18, 1997.
“Beverly Hills Man Convicted of Operating ‘Bust-Out’ Schemes that Caused More than $8 Million in Losses”, Department of Justice, Jul. 25, 2006, 2 Pgs.
Bienkowski, Nik, “A New Tool for Portfolio Risk Management—Gold Bullion”, Apr. 2003, pp. 6.
Bilotta, Caryn, “Understanding Credit Scores,” Pittsburgh Post—Gazette, May 9, 2010.
“Birch & Davis Wins Texas CHIP Contract,” Birch & Davis Press Release, dated Jan. 4, 2000, 3 pgs., as downloaded from http://web.archive.org/web/20010304065515/www.birchdavis.com/txchip.htm (1 of 3) [Oct. 20, 2008 9:49:18 AM].
Bitran et al., “Mailing Decisions in Catalog Sales Industry”, Management Science (JSTOR), vol. 42, No. 9, pp. 1364-1381, Sep. 1996.
Boss, Shira J. “Elective Surgery Without the Plastic: Low-Interest Medical Financing Provides Alternative to Credit Cards,” factiva, Crain's New York Business, 2 pgs., dated Jun. 22, 1998.
Brick, et al. “Unit and Item Response, Weighting, and Imputation Procedures in the 1993 National Household Education Survey (NHES:93)” U.S. Department of Education. National Center for Education Statistics, Working Paper No. 97-05, Washington, D.C., pp. 30, Feb. 1997.
Broward County CAP Grant Application, as printed on Aug. 10, 2009, 41 pgs.
Brown et al., “ALCOD IDSS: Assisting the Australian Stock Market Surveillance Team's Review Process,” Applied Artificial Intelligence Journal, Dec. 1, 1996, pp. 625-641.
Burr Ph.D., et al., “Utility Payments as Alternative Credit Data: A Reality Check”, Asset Builders of America, Inc., Oct. 5, 2006, pp. 1-18, Washington, D.C.
“Bust-Out Schemes”, Visual Analytics Inc. Technical Product Support, Newsletter vol. 4, Issue 1, Jan. 2005, pp. 7.
Buxfer, http://www.buxfer.com/ printed Feb. 5, 2014 in 1 page.
Cáceres, et al., “Measurement and Analysis of IP Network Usage and Behavior”, IEEE Communications Magazine, pp. 144-151, May 2000.
Calnan, Christopher, “Tenet, Fair Isaac invest $20M in startup,” MHT, Mass High Tech: The Journal of New England Technology, dated Jul. 23, 2007, 2 pgs.
Cantor, R. and Packer, F., “The Credit Rating Industry,” FRBNY Quarterly Review, Summer-Fall, 1994, pp. 1-24.
Capps et al., “Recent Changes in Texas Welfare and Work, Child Care and Child Welfare Systems,” Assessing the New Federalism, The Urban Institute, State Update No. 1, 24 pgs., Jun. 2001.
CAPStone Newsletter, Sep. 2001, 8 pgs., as downloaded from http://web.archive.org/web/20011213115738/www.capcommunity.hrsa.gov/Newsletter/Newsletter12.htm (1 of 8) [Oct. 18, 2008 2:39:47 PM].
Card Marketing, Use the Latest CRM Tools and Techniques, www.CardForum.com, vol. 5 No. 10, Dec. 2001.
Census Geography, Excerpted from the Geographic Reference Manual, Nov. 1994, pp. 5.
“Chase Gets Positive,” Bank Technology News, May 6, 2000, vol. 14, No. 5, p. 33.
Chatterjee et al., “Expenditure Patterns and Aggregate Consumer Behavior, Some Experiments with Australian and New Zealand Data”, The Economic Record, vol. 70, No. 210, Sep. 1994, pp. 278-291.
Check, http://check.me/ printed Feb. 5, 2014 in 3 pages.
Cheney, Karen, “Fix Your Nose, If You Wish, But Not With This New Loan,” Money Magazine, vol. 27, No. 5, 1 pg., dated May 1, 1998.
Chiba et al., “Mobility Management Schemes for Heterogeneity Support in Next Generation Wireless Networks”, 3rd EuroNGI Conference on, 2007, pp. 143-150.
Chores & Allowances, “Do Kids Have Credit Reports?” Oct. 15, 2007, http://choresandallowances.blogspot.com/2007/10/do-kids-have-credit-reports.html, pp. 5.
CISCO: What-If Simulator, http://www.ciscocredit.com/whatifsim.html printed Oct. 12, 2012 in 2 pages.
CISCO: Your Mortgage Credit Reporting Specialists, http://www.ciscocredit.com/cc_Services.html printed Oct. 12, 2012 in 4 pages.
“Cole Taylor Bank Chooses Integrated E-Banking/E-Payments/Reconciliation Solution From Fundtech”, Business Wire, Oct. 21, 1999, pp. 2.
“Consumer Reports Finds American-Made Vehicles Close Reliability Gap with European-Made Vehicle—As Japanese Continue to Set New Benchmarks for the Industry”, Consumer Reports: Consumers Union, Yonkers, NY, Apr. 2003, pp. 2.
Corepoint Health, “The Continuity of Care Document—Changing the Landscape of Healthcare Information Exchange,” Jan. 2009, pp. 9.
CreditAnalyst, Digital Matrix Systems, as printed out Mar. 4, 2008, pp. 2.
CreditSesame; “FAQ's”; http://www.creditsesame.Com/how-we-help/faqs/#cb printed Dec. 5, 2011 in 8 pages.
CreditSesame; “Promote Your Financial Responsibility to Get an Edge in Life”; http://www.creditsesame.com/credit-badge/printed Dec. 2, 2011 in 1 page.
Credittoolkit, Digital Matrix Systems, as printed out Mar. 4, 2008, pp. 2.
CreditXpert, http://www.creditxpert.com/Products/individuals.asp printed Oct. 12, 2012 in 1 page.
“Credit Information Bureaus and ‘CIBIL’”, http://www.icicibank.com/cibil.html printed Aug. 22, 2012 in 3 pages.
CreditKarma: How Credit Karma Works, http://www.creditkarma.com/help/howitworks printed Oct. 12, 2012 in 2 pages.
Credit Source Online: The Secrets of Raising Your Credit Score, http://www.creditsourceonline.com/secrets-of-raising-your-credit-score.html printed Oct. 12, 2012 in 4 pages.
Cohen et al., “Optimizer: IBM's Multi Echelon Inventory System for Managing Service Logistics”, Interfaces, vol. 20, No. 1, Jan.-Feb. 1990, pp. 65-82.
ComScore Networks Launches Business Unit to Help Credit Card Marketers Master Online and Multi-Channel Strategies—Solutions Provide Unprecedented Insight Into Customer Acquisition and Usage Opportunities, Reston, VA, Oct. 11, 2001, 2 pages.
“Consumers Gain Immediate and Full Access to Credit Score Used by Majority of U.S. Lenders”, PR Newswire, ProQuest Copy, Mar. 19, 2001, p. 1.
Credit Card Management, “Neural Nets Shoot for Jackpot,” Dec. 1995, pp. 1-6.
“Creditcheck Monitoring Services,” Dec. 11, 2000, pp. 1, lines 21-23.
Credit Risk Management Report, Potomac, Mar. 9, 1998, vol. 8, No. 4.
CreditXpert Inc., CreditXpert 3-Bureau Comparison™, 2002, pp. 5, as archived Jun. 8, 2003 from http://web.archive.org/web/20030608171018/http://cred itxpert.com/CreditXpert%203-Bureau%20Comparison(TM)%20sample.pdf.
CreditXpert Inc., CreditXpert Credit Score & Analysis™, Jan. 11, 2000, pp. 6, http://web.archive.org/web/20030611070058/http://www.creditxpert.com/CreditXpert%20Score%20&%20Analysis%20and%20Credit%20Wizard%20sample.pdf.
CreditXpert Inc., CreditXpert Essentials™, Advisor View-Experian on Jul. 7, 2003, http://www.creditxpert.com/cx_ess_app.pdf.
CreditXpert Inc., CreditXpert Essentials™, Advisor View-TransUnion on Oct. 10, 1999, pp. 6, http://web.archive.org/web/20041211052543/http://creditxpert.com/cx_ess_app.pdf.
CreditXpert Inc., CreditXpert Essentials™, Applicant View-TransUnion on Oct. 10, 1999, pp. 6, http://www.creditxpert.com/cx_ess_app.pdf.
CreditXpert Inc., CreditXpert What-If Simulator™, 2002, pp. 8, as archived Jun. 30, 2003 from http://web.archive.org/web/20030630132914/http://creditxpert.com/CreditXpert%20What-If%20Simulator(TM)%20sample.pdf.
“D&B Corporate Family Linkage”, D&B Internet Access for U.S. Contract Customers, https://www.dnb.com/ecomp/help/linkage.htm as printed Dec. 17, 2009, pp. 1.
Dankar et al., “Efficient Private Information Retrieval for Geographical Aggregation”, Procedia Computer Science, 2014, vol. 37, pp. 497-502.
Dash, Julekha, “Java on the Street,” Software Magazine, Oct. 1, 1997, vol. 17, No. 11, p. 2.
Dataman Group, “Summarized Credit Statistics,” Aug. 22, 2001, http://web.archive.org/web/20010822113446/http://www.datamangroup.com/summarized_credit.asp.
“Data Loss Prevention (DLP) Software”, http://www.symantec.com/data-loss-prevention/ printed Apr. 8, 2013 in 8 pages.
“Data Protection”, http://compliantprocessing.com/data-protection/ printed Apr. 8, 2013 in 4 pages.
David, Alexander, “Controlling Information Premia by Repackaging Asset-Backed Securities,” The Journal of Risk and Insurance, Dec. 1997, 26 pages.
Davies, Donald W., “Applying the RSA Digital Signature to Electronic Mail,” Computer, Feb. 1983, pp. 55-62.
Davis, Lisa, “Safety in Numbers,” Business North Carolina, Sep. 1, 1995, vol. 15, No. 9, p. 24.
“Debt Settlement: Watch Video on how to Pay Your Debt Faster”, http://www.debtconsolidationcare.com/debt-settlement.html printed Jan. 9, 2013 in 6 pages.
Demby, Elayne, “Special Report: Letting Consumers Know the Score—and More”, Collections and Credit Risk, New York, Feb. 2003, vol. 8, Issue 2, p. 53, pp. 3.
DentalFinancing.com, “Financial services for patients and dental professionals,”, 7 pgs., as downloaded from http://web.archive.org/web/20010607151954/www.dentalfinancing.com/dentist/index.asp (1 of 2) [Oct. 15, 2008 3:55:16 PM].
Department of Real Estate, http://web.archive.org/web/20040619190012/http://www.dre.ca.gov/pubs_sub.htm, Jun. 19, 2004, in 5 pages.
Department of Real Estate, “Reference Book,” http://web.archive.org/web/20041011063158/http://www.dre.ca.gov/pdf_docs/ref17.pdf, Jun. 18, 2004, Chapter 17, pp. 311-382.
DiBartolomeo, Dan, “Portfolio Optimization: The Robust Solution,” Prudential Securities Quantitative Conference, Dec. 21, 1993, pp. 8.
Dietz, Ellen, “Dental Office Management,” 8 pgs., pp. 316-321, Jul. 16, 1999.
Dillon et al., “Good Science”, Marketing Research: A Magazine of Management & Applications TM, Winter 1997, vol. 9, No. 4; pp. 11.
Downes et al., Dictionary of Finance and Investment Terms, Fifth Edition, Nov. 1, 1998, pp. 332-333.
Downing, Jr.; Richard, “Changes to the Credit Reporting Act,” Mortgage Banking, Apr. 1, 1998, vol. 58, No. 7, pp. 82-85.
Dymi, Amilda, Need for Leads Spurs Some Upgrades, Origination News-Special Report, May 1, 2008, vol. vol. 17, Issue No. 8, pp. p. 24, Atlanta, Copyright 2008 SourceMedia, Inc.
Ecredable: Discover your AMP Credit Rating™, http://www.ecredable.com/how-it-works/amp-credit-rating printed Oct. 12, 2012 in 2 pages.
EFunds Introduces QualiFileSM, Deluxe Corporation, eFunds Press Release and Product Launch, Sep. 23, 1999, Milwaukee, WI.
Electronic Privacy Information Center, “The Fair Credit Reporting Act” 15 USC 1681 (1992), 10 pgs., as downloaded from http://epic.org/privacy/financial/fcra.html on Mar. 19, 2008.
Ellwood, Marilyn, “The Medicaid Eligibility Maze: Coverage Expands, but Enrollment Problems Persist, Findings from a Five-State Study,” Mathematica Policy Research, Inc., Occasional Paper No. 30, 56 pgs., Dec. 1999.
Elmasri et al., “Fundamentals of Database Systems, Third Edition (Excerpts)”, Jun. 2000, pp. 253, 261, 268-70, 278-80, 585, 595.
Equifax: Consumer Bureau, http://www.equifax.co.in/financial-services/consumer_bureau/en_in#RiskScore printed Oct. 12, 2012 in 3 pages.
Equifax Consumer Credit Report http://www.equifax.com/home/, as retrieved on Sep. 17, 2008.
Ettorre, “Paul Kahn on Exceptional Marketing,” Management Review, vol. 83, No. 11, Nov. 1994, pp. 48-51.
“Equifax and FICO Serve Consumers”, Mortgage Servicing News, Mar. 2001, vol. 5, No. 3, p. 19.
Expensr.com http://www.expensr.com/, as retrieved on Sep. 17, 2008.
Experian, http://www.experian.com/printed Oct. 12, 2012 in 1 page.
Experian Announces PLUS Score; Experian Press Release dated Oct. 16, 2003; Experian Global Press Office.
Experian Consumer Credit Report http://www.experian.com/, as retrieved on Sep. 17, 2008.
“Experian Helps Verify the Identity of Patients and Provide Secure Enrollment to Healthcare Portals by Integrating with Major Electronic Medical Records Platform,” http://press.experian.com/United-States/Press-Release/experian-helps-verify-the-identity-of-patients-and-provide-secure-enrollment-to-healthcare.aspx?&p=1, Dec. 19, 2013, pp. 2.
“Experian Launches Portfolio Monitor—Owner NoticesSM”, News Release, Feb. 2003, Costa Mesa, CA.
Experian-Scorex Announces New Credit Simulation Tool, PR Newswire, Costa Mesa, CA, Jun. 13, 2005.
Experian, Custom Strategist and Qualifile from Funds, Jun. 2000, in 2 pages.
Experian, “Enabling e-business”, White Paper, Jan. 2001, pp. 21.
Experian Information Solutions, Inc., Credit Trends: Access Credit Trending Information Instantly, http://kewaneecreditbureau.com/Credit.Trends.pdf, Aug. 2000, pp. 4.
Experian, “Instant Prescreen: Offer preapproved credit at the point of sale”, Oct. 2000, pp. 2, http://www.cdillinois.com/pdf_file/instant_prescreen_ps.pdf.
Experian: Improve Outcomes Through Applied Customer Insight, Brochure, Nov. 2009, pp. 20.
Experian: Mosaic Geodemographic Lifestyle Segmentation on Consumerview [Data Card], as printed from http://datacards.experian.com/market?page=research/datacard_print&prin, Apr. 6, 2012, pp. 4.
Experian: Mosaic Public Sector 2009 Launch, Jul. 2009, pp. 164.
Experian: Mosaic United Kingdom, Brochure, Jun. 2009, pp. 24.
Experian: Mosaic UK—Optimise the Value of Your Customers and Locations, Now and in the Future, Brochure, Sep. 2010, pp. 24.
Experian: Mosaic UK—Unique Consumer Classification Based on In-Depth Demographic Data, as printed from http://www.experian.co.uk/business-strategies/mosaic-uk.html, Jul. 30, 2012, pp. 2.
Experian: Mosaic USA, Brochure, May 2009, pp. 14.
Experian: Mosaic USA—Consumer Lifestyle Segmentation [Data Card], Dec. 2009, pp. 2.
Experian: Public Sector, as printed form http://publicsector.experian.co.uk/Products/Mosaicpublicsector.aspx, Jul. 2009, pp. 2.
Experian, “Experian Rental Payment Data,” http://www.experian.com/rentbureau/rental-data.html printed Nov. 22, 2013 in 2 pages.
Fair Isaac Announces Integrated, End-to-End Collection and Recovery Solution, Business Wire, New York, Sep. 2, 2004, p. 1.
Fair Isaac Corporation, my FICO Sample FICO Score Simulatorp. . . .
Fair Isaac Corporation, myFICO: Calculators: Credit Assessment, as printed Jun. 8, 2005 in 2 pages, http://www.myfico.com/CreditEducation/Calculators/CreditAssessment.aspx.
Fair Isaac Corporation, myFICO: Help: FICO Score Simulator, as printed Jun. 8, 2005 in 2 pages, http://www.myfico.com/Help/Simulator.aspx?fire=5.
Fair Isaac Corporation, myFICO: Products: Suze Orman's FICO Kit Platinum, as printed Jun. 8, 2005 in 4 pages, http://www.myfico.com/Products/FICOKit/Description.aspx.
Fair Isaac Corporation, myFICO: Products: Suze Orman's FICO® Kit Platinum: FICO Score Check, as printed Jun. 7, 2005 in 1 page, http://www.myfico.com/Products/FICOKit/Sample03.html.
Fair Isaac Corporation, myFICO: Products: Suze Orman's FICO®. Kit Platinum: Look for Errors, as printed Jun. 7, 2005 in 3 pages http://www.myfico.com/Products/FICOKit/Sample02.html.
Fair Isaac Corporation, myFICO: Products: Suze Orman's FICO® Kit Platinum: Your FICO Score, as printed Jun. 7, 2005 in 1 page, http://www.mvfico.com/Products/FICOKit/Sample01.html.
Fair Isaac Corporation, myFICO: Sample: FICO Score Simulator, as printed Jun. 8, 2005 in 5 pages, http://www.rnyfico.com/Content/Samples/Sample_ScoreSimulator.asp.
Fair Isaac Corporation, myFICO: Sample: FICO Score Simulator: Max Out All Your Credit Cards, as printed Jun. 8, 2005 in 2 pages, http://www.myfico.com/Content/Samples/Sample_ScoreSimulatorResults.asp?Simulation=4&ReportID=1& productID=&Execute.x=105&Execute.y=23.
Fair Isaac Corporation, myFICO: Sample: FICO Score Simulator: Miss Payments on All Accounts With a Payment Due, as printed Jun. 8, 2005 in 2 pages, http://www.myfico.com/Content/Samples/Sample_ScoreSimulatorResults.asp?miss_payment=radiobutton &Simulation=2&ReportID=1&ProductID=&Execute.x81&Execute.y=28>.
Fair Isaac Corporation, myFICO: Sample: FICO Score Simulator: Pay Down Delinquent Balances First, as printed Jun. 8, 2005 in 2 pages, http://www.myfico.com/Content/Samples/Sample_ScoreSimulatorResults.asp?textfieldCC=750&Simulation=7&ReportID=1&ProductID=&PayDelinquent.x=78&PayDelinquent.y=30.
Fair Isaac Corporation, myFICO: Sample: FICO Score Simulator: Pay Down the Balances on All Your Credit Cards, as printed Jun. 8, 2005 in 2 pages, http://www.myfico.com/Content/Samples/Sample_ScoreSimulatorResults.asp?textfieldCC1=750&SelectMonths=1&PayOption=radiobutton&textfieldCC=750&Simulation=3&ReportID=1&ProductID=&Execute.x=57&Execute.y=22.
Fair Isaac Corporation, myFICO: Sample: FICO Score Simulator: Pay Your Bills on Time, as printed Jun. 8, 2005 in 2 pages, http://www.myfico.com/Content/Samples/Sample_ScoreSimulatorResults.asp?select1=1&Simulation=1 &ReportID=1&ProductID=&PayBillsOnTime.x=93&PayBillsOnTime.y=23.
Fair Isaac Corporation, myFICO: Sample: FICO Score Simulator: Seek New Credit, as printed Jun. 8, 2005 in 2 pages, http://www.myfico.com/Content/Samples/Sample_ScoreSimulatorResults.asp7new _credit=radiobutton&textfield5A=3000&tectfield5B=&textfield5C=&Simulation=5&ReportID=1&ProductID=&NewCredit.x=62&NewCredit.y=20.
Fair Isaac Corporation, myFICO: Sample: FICO Score Simulator: Suggested Best Action, as printed Jun. 8, 2005 in 2 pages, http://www.myfico.com/Content/Samples/Sample_ScoreSimulatorResults.asp?Simulation=111&ReportID=1&ProductID=&TopAction.x=66&TopAction.y=16.
Fair Isaac Corporation, myFICO: Sample: FICO Score Simulator: Transfer Credit Card Balances, as printed Jun. 8, 2005 in 2 pages, http://www.myfico.com/Content/Samples/Sample_ScoreSimulatorResults.asp?textfield222=5000&Simulation=6&ReportID=1&ProductID=&TransferBalance.x=86&TransferBalance.y=24.
FamilySecure.com; “Identity Theft Protection for the Whole Family | FamilySecure.com” http://www.familysecure.com/, as retrieved on Nov. 5, 2009.
Fan et al., “Design of Customer Credit Evaluation System for E-Business”, 2004 IEEE International Conference on Systems, Man and Cybernetics, 2004, pp. 392-397.
Felsenthal, Edward, “Health Costs; Managed Care Helps Curb Costs, Study Says,” The Wall Street Journal, dated Aug. 12, 1991.
Fenner, Peter, “Mobile Address Management and Billing for Personal Communications”, 1st International Conference on Universal Personal Communications, 1992, ICUPC '92 Proceedings, pp. 253-257.
Fickenscher, Lisa, “Merchant American Express Seeks to Mine its Data on Cardholder Spending Patterns,” American Banker, vol. 162, Issue 56, Mar. 24, 1997, pp. 1-2.
“Fictitious Business Name Records”, Westlaw Database Directory, http://directory.westlaw.com/scope/default.asp?db=FBN-ALL&RS-W...&VR=2.0 as printed Dec. 17, 2009, pp. 5.
“Fighting the New Face of Fraud”, FinanceTech, http://www.financetech.com/showArticle.jhtml?articleID=167100405, Aug. 2, 2005.
“Financing Medical Procedures A Lucrative But Risky Business,” Credit Risk Management Report, vol. 10, Issue 15, 2 pgs., dated Aug. 7, 2000.
Financial Engines, http://corp.financialengines.com/ printed Oct. 12, 2012 in 1 page.
Fisher, Joseph, “Access to Fair Credit Reports: Current Practices and Proposed Legislation,” American Business Law Journal, Fall 1981, vol. 19, No. 3, p. 319.
Forrest, David, “Achieving Perfect Credit—Lesson 3: Assessing Your Situation,” https://web.archive.org/web/20140828173720/http://www.fool.com/seminars/ev/index.htm?sid=0029&lid=300, as archived Aug. 28, 2014, copyright 1995-2002, in 7 pages.
Frank, John, “Scoring Takes on a New Meaning,” Credit Card Management, Sep. 1996, vol. 9, No. 6, pp. 155-159.
“Fraud Alert | Learn How”. Fight Identity Theft, http://www.fightidentitytheft.com/flag.html, accessed on Nov. 5, 2009.
“FTC Testifies: Identity Theft on the Rise”, FTC News Release, Mar. 7, 2000, pp. 3.
“Fund Manager,” Portfolio Management Software website, indexed into Google on Jan. 7, 2005, Retrieved Oct. 24, 2014 http://www.fundmanagersoftware.com/, http://www.fundmanagersoftware.com/help/gph_tp_pieasset.html, http://www.fundmanagersoftware.com/demo2.html.
GAO-03-661, Best Practices: Improved Knowledge of DOD Service Contracts Could Reveal Significant Savings, GAO, Jun. 2003.
Garcia-Molina et al., “Database Systems: The Complete Book”, Prentice Hall, Inc., Ch. 15, Oct. 1, 2001, pp. 713-715.
“Geographic Aggregation Tool SAS Beta Version 4.1”, Environmental Health Surveillance Section, New York State Dept. in Health, Troy, NY, Mar. 24, 2015, pp. 10.
Gibbs, Adrienne; “Protecting Your Children from Identity Theft,” Nov. 25, 2008, http://www.creditcards.com/credit-card-news/identity-ID-theft-and-kids-children-1282.php, pp. 4.
Gilje, Shelby, “Credit Agency Moving Into Health Care,” NewsRoom, The Seattle Times, Section: SCENE, Mar. 22, 1995, pp. 3, http://web2.westlaw.com/result/documenttext.aspx?rs=WLW8.03&ss+CNT&rp=%2fWelc . . . .
Gilje, Shelby, “Keeping Tabs On Businesses That Keep Tabs On Us”, NewsRoom, The Seattle Times, Section: SCENE, Apr. 19, 1995, pp. 4.
Gionis et al., “Similarity Search in High Dimensions via Hashing”, Sep. 7, 1999, pp. 518-529.
Giudici, Paolo, “Bayesian Data Mining, with Application to Benchmarking and Credit Scoring,” Applied Stochastic Models in Business and Industry, 2001, vol. 17, pp. 69-81.
“GLBA Compliance and FFIEC Compliance” http://www.trustwave.com/financial-services.php printed Apr. 8, 2013 in 1 page.
Glenn, Brandon, “Multi-provider patient portals get big boost with ONC ruling”, Feb. 25, 2013, http://medicaleconomics.modernmedicine.com/medical-economics/news/user-defined-tags/meaningful-use/multi-provider-patient-portals-get-big-boost in 2 pages.
Goldstein, Jacob, “The Newest Vital Sign: Your Credit Score,” The Wall Street Journal, Health Blog, as viewed at http://blogs.wsj.com/health/2008/03/18/the-newest-vital-sign-your-cr, Mar. 18, 2008, pp. 3.
Gopalan, R., “Panning for Sales-Force Gold”, Intelligent Enterprise, Dec. 21, 1999, vol. 2, No. 18, pp. 39-43.
“Green Tree Investors May Go To Court,” Mar. 4, 1998, http://web.archive.org/web/20001101080021 /http://www.channel4000.com/news/stories/news-980304-120038.html.
“Groups Demand Government Action on Online Marketing to Children,” American Marketplace, Apr. 4, 1996, vol. 17, No. 7, p. 53.
Gualtieri et al., “The Forrester Wave™: Big Data Streaming Analytics, Q1 2016”, Forrester®, Mar. 30, 2016, pp. 14, https://www.sas.com/content/dam/SAS/en_us/doc/analystreport/forrester-big-data-streaming-analytics-108218.pdf.
Haffar, Imad, “‘SPAM’: A Computer Model for Management of Spare-Parts Inventories in Agricultural Machinery Dealerships”, Computers and Electronics in Agriculture, vol. 12, Issue 4, Jun. 1995, pp. 323-332.
Hampton et al., “Mapping Health Data: Improved Privacy Protection With Donut Method Geomasking”, American Journal of Epidemiology, Sep. 3, 2010, vol. 172, No. 9, pp. 8.
Handfield et al., “Managing Component Life Cycles in Dynamic Technological Environments”, International Journal of Purchasing and Materials Management, Tempe, Spring 1994, vol. 30, No. 2, pp. 20-28.
Healow.com, Various screenshots from page titled “Health and Online Wellness,” https://healow.com/apps/jsp/webview/index.jsp printed Aug. 19, 2013 in 4 pages.
Healthspek.com, “How Good Are We?” http://healthspek.com/how-good-are-we/ printed Jan. 21, 2014 in 2 pages.
“Healthspek Users Can Now Import Their Doctors' Records into Their Personal Health Record,” PRWeb, Nashville, TN, Jan. 14, 2014, pp. 1 http://www.prweb.com/releases/2014/01/prweb11485346.htm.
Healy, Thomas J., “The New Science of Borrower Behavior,” Mortgage Banking, vol. 58, No. 5, pp. 26-35, Feb. 1, 1998.
Henry, M.D., Kimberly A., “The Face-Lift Sourcebook,” Oct. 11, 2000, 3 pgs. (p. 207).
Herron, Janna, “Social Media-Based Credit Score?”, http://www.bankrate.com/financing/credit-cards/social-media-based-credit-score/, posted Friday, Jan. 13, 2012, printed Nov. 22, 2013 in 2 pages.
Hill, Kerry, “Identity Theft Your Social Security Number Provides Avenue For Thieves”, NewsRoom, Wisconsin State Journal, Sep. 13, 1998, pp. 4.
ID Analytics, “ID Analytics® Consumer Notification Service” printed Apr. 16, 2013 in 2 pages.
ID Theft Assist, “Do You Know Where Your Child's Credit Is?”, Nov. 26, 2007, http://www.idtheftassist.com/pages/story14, pp. 3.
Ideon, Credit-Card Registry that Bellyflopped this Year, Is Drawing some Bottom-Fishers, The Wall Street Journal, Aug. 21, 1995, pp. C2.
IgiHealth.com, “Orbit® PHR: Personal Health Record (PHR),” http://www.igihealth.com/consumers/orbit_phr.html, printed Jan. 21, 2014 in 2 pages.
“Impac Funding Introduces Enhanced Website for Static Pool Tracking of MBS Transactions,” Waltham, MA; Webpage printed out from http://www.lewtan.com/press/1208044_Impac-Lewtan.htm on Mar. 20, 2008.
“Improving the Implementation of State Children's Health Insurance Programs for Adolescents Report of an Invitational Conference Sponsored by the American Academy of Pediatrics, Section on Adolescent Health,” Pediatrics, Official Journal of the American Academy of Pediatrics, Section on Adolescent Health, Sep. 26-27, 1999, 9 pages.
Inderfurth et al., “Decision Support for Spare Parts Acquisition in Post Product Life Cycle”, Central European Journal of Operations Research, 2008, vol. 16, pp. 17-42.
IndiCareTM, On-Line Patient Assistant Program, Website Users Manual, JBI Associates, LLC, Jan. 1997, pp. 17.
Insightsone.com, “Healthcare,” http://insightsone.com/healthcare-predictive-analytics/ printed Mar. 6, 2014 in 5 pages.
Instant Access to Credit Reports Now Available Online with DMS' CreditBrowser-based system also Simplifies Credit Decisioning and Offers a Central Point of Control, Business Wire, Dallas, May 23, 2000, p. 0264.
“Intelligent Miner Applications Guide”, IBM Corp., Apr. 2, 1999, Chapters 4-7, pp. 33-132.
Internal Revenue Service Data Book 2000, Issued Aug. 2001, Revised May 2003.
“Japan's JAAI System Appraises Used Cars Over Internet”, Asia Pulse, Mar. 3, 2000, p. 1.
Jaro, Matthew A., “Probabilistic Linkage of Large Public Health Data Files”, Statistics in Medicine, 1995, vol. 14, pp. 491-498.
Jones, Yvonne, “Consumers Understood the Basics but Could Benefit from Targeted Educational Efforts,” GAO U.S. Government Accountability Office, Mar. 16, 2005, pp. 128, http://www.gao.gov/products/GAO-05-223.
“JPMorgan Worldwide Securities Services to Acquire Paloma's Middle and Back Office Operations,” Webpage printed from http://www.jpmorgan.com on Apr. 1, 2009.
“Judging Credit: Consumers Need Better Finance Tools”, News Journal, Daytona Beach, FL, Dec. 28, 2002.
Käki, Anssi, “Forecasting in End-Of-Life Spare Parts Procurement”, Master's Thesis, Helsinki University of Technology, System Analysis Laboratory, Jul. 27, 2007, pp. 84.
Kauffman et al., “Research Directions on the Role an Impact of ICT in Microfinance”, Proceedings of the 43rd Hawaii International Conference on System Sciences, 2010, pp. 10.
Kent, Heather, “Huge declines in price as competition heats up in Vancouver's booming laser-surgery market,” CMAJ, Octobers, 1999; 161 (7), pp. 857-858.
Khare et al., “Nutch: A Flexible and Scalable Open-Source Web Search Engine”, CommerceNet Labs Technical Reprt 04-04, Nov. 2004, pp. 15.
Kim et al., “Optimal Pricing, EOL (End of Life) Warranty, and Spare Parts Manufacturing Strategy Amid Product Transition”, European Journal of Operation Research, 2008, vol. 188, pp. 723-745.
Klein, et al., “A Constant-Utility Index of the Cost of Living”, The Review of Economic Studies, Sep. 1, 1947, vol. 15, No. 2, pp. 84-87.
Klein, et al., “An Econometric Model of the United States: 1929-1952”, North-Holland Publishing Company, Amsterdam, Jun. 1, 1955, pp. 4-41.
Klein, Lawrence R., “The Keynesian Revolution”, New York, The MacMillan Company, Jan. 1, 1947, pp. 56-189.
Krupp, James A.G., “Forecasting for the Automotive Aftermarket”, The Journal of Business Forecasting Methods & Systems, Winter 1993-1994, vol. 12, No. 4, ABI/Inform Global, pp. 8-12.
Kulkosky, Edward, “Credit Scoring Appeal Transcends Underwriting,” American Banker, vol. 161, No. 93, p. 8, May 15, 1996.
Kuykendall, Lavonne, “Divergent Paths in Early Pacts with Credit Bureaus”, American Banker, May 30, 2002, vol. 167, No. 3, pp. 2.
Kwan et al., “Protection of Geoprivacy and Accuracy of Spatial Information: How Effective Are Geographical Masks?” Carographica, Summer 2004, vol. 39, No. 2, pp. 15-27.
Lan, Joe, “The Top Portfolio Management Software,” http://www.aaii.com/computerizedinvesting/article/the-top-portfolio-management-software, Includes Discussion thread, Fourth Quarter 2011, pp. 17.
Lanubile, et al., “Evaluating Empirical Models for the Detection of High-Risk Components: Some Lessons Learned”, 20th Annual Software Engineering Workshop, Nov. 29-30, 1995, Greenbelt, Maryland, pp. 1-6.
Lapide, Larry, “New Developments in Business Forecasting”, The Journal of Business Forecasting, Spring 2002, pp. 12-14.
Lavelle, Marianne, “Health Plan Debate Turning To Privacy Some Call for Safeguards On Medical Disclosure. Is a Federal Law Necessary?,” The National Law Journal, vol. 16, No. 39, dated May 30, 1994, as downloaded from http://web2.westlaw.com/result/.
Lee, W.A., “Experian Eyes Payments, Mulls Deals” American Banker: The Financial Services Daily, 2pgs., New York, NY, May 30, 2003.
Lee, W.A.; “Fair Isaac Taps Institutions for Credit Score Distribution”, American Banker: The Financial Services Daily, New York, NY, Apr. 9, 2002, vol. 167, Issue 67, 1 Page.
Lee, W.A., “Money, Quicken, and the Value of Alliances”, American Banker: The Financial Services Daily, 2pgs., New York, NY, Jul. 28, 2003.
Lendingtree.com, “Lender Ratings & Reviews,” http://web.archive.org/web/20091015043716/http://www.lendingtree.com/lender-reviews/, Oct. 15, 2009, in 21 pages.
Letter to Donald A. Robert from Carolyn B. Maloney, dated Oct. 31, 2007, pp. 2.
Letter to Donald A. Robert from Senator Charles E. Schumer, dated Oct. 11, 2007, pp. 2.
Letter to Harry C. Gambill from Carolyn B. Maloney, dated Oct. 31, 2007, pp. 2.
Letter to Harry C. Gambill from Senator Charles E. Schumer, dated Oct. 11, 2007, pp. 2.
Letter to Richard F. Smith from Carolyn B. Maloney, dated Oct. 31, 2007, pp. 2.
Letter to Richard F. Smith from Senator Charles E. Schumer, dated Oct. 11, 2007, pp. 2.
Li et al., “Automatic Verbal Information Verification for User Authentication”, IEEE Transactions on Speech and Audio Processing, vol. 8, No. 5, Sep. 2000, pp. 585-596.
Lifelock, “Identity Theft F.A.Q.” http://web.archive.org/web/20080215093614/http://www.identitytheftkiller.com/promo/faq.php, Feb. 15, 2008, pp. 8.
LifeLock; “How Can LifeLock Protect My Kids and Family?” http://www.lifelock.com/lifelock-for-people/how-we-do-it/how-can-lifelock-protect-my-kids-and-family printed Mar. 14, 2008 in 1 page.
Lifelock, “Personal Identity Theft Protection & Identity Theft Products,” http://www.lifelock.com/lifelock-for-people, accessed Nov. 5, 2007.
Lifelock, Various Pages, www.lifelock.com/, Jan. 9, 2007, pp. 49.
Littwin, Angela, “Beyond Usury: A Study of Credit-Card Use and Preference Among Low-Income Consumers”, Texas Law Review, vol. 86, No. 3, pp. 451-506; Feb. 2008.
Lobo, Jude, “MySAP.com Enterprise Portal Cookbook,” SAP Technical Delivery, Feb. 2002, vol. 1, pp. 1-13.
Longo, Tracey, “Managing Money: Your Family Finances”, Kiplinger's Personal Finance Magazine, Jun. 1, 1995, vol. 49, No. 6, pp. 4.
Lorette, Kristie, “Howto Successfully Dispute Inaccuracies on Your Credit Report,” http://web.archive.org/web/20110531184149/http://www.quizzle.com/blog/2011/03/how-to-successfully-dispute-inaccuracies-on-your-credit-report/, Mar. 25, 2011, in * pages.
Loshin, Intelligent Enterprise: Better Insight for Business Decisions, “Value-Added Data: Merge Ahead”, Feb. 9, 2000, vol. 3, No. 3, 5 pages.
Lovelace, Robin, “IPFinR: An Implementation of Spatial Microsimulation in R”, RL's Powerstar, Jun. 12, 2013, pp. 9, https://robinlovelace.wordpress.com/2013/06/12/ipfinr-an-implementation-of-spatial-microsimulation-in-r/.
Lund, Graham, “Credit Bureau Data: Maximizing the Benefits,” Credit Management, May 2004, ProQuest Central, pp. 44-45.
Maciejewski et al., “Understanding Syndromic Hotspots—A Visual Analytics Approach”, Conference Paper, IEEE Symposium on Visual Analytics Science and Technology, Oct. 21-23, 2017, pp. 35-42.
Magid, Lawrence, J., Business Tools: When Selecting an ASP Ensure Data Mobility, Los Angeles Times, Los Angeles, CA, Feb. 26, 2001, vol. C, Issue 4, pp. 3.
Manilla, http://www.manilla.com/how-it-works/ printed Feb. 5, 2014 in 1 page.
Mathematica Policy Research, Inc., “1998 Health Care Survey of DoD Beneficiaries: Technical Manual,” Jul. 1999.
McGovern, Celeste, Jayhawk Medical Acceptance. (Brief Article), Alberta Report, 1 pg., dated Aug. 23, 1999.
McLaughlin, Nancy H., “Homeless, pregnant and alone Dana Sides knows her baby is likely to come in a month, but she has No. idea where she will go after leaving the hospital,” NewsRoom, Greensboro News & Record (NC), Section: General News, dated Dec. 6, 2001.
McNamara, Paul, “Start-up's pitch: The Envelope, please,” Network World, Apr. 28, 1997, vol. 14, No. 17, p. 33.
“MediCredit Announces Major Investment from Medstone; Financing Will Enable Dramatic Expansion of Online Services,” Business Wire, pp. 2, dated May 12, 2000.
MediCredit, Patient Financing, “Thought you couldn't afford Cosmetic Surgery?,” 3 pgs., as downloaded from http://web.archive.org/web/19970601060333/http://www.medicredit.com/ (1 of 2) [Oct. 15, 2008 3:16:31 PM].
Medick et al., “German Agency to Mine Facebook to Assess Creditworthiness”, Jun. 7, 2012, http://www.spiegel.de/international/germany/german-credit-agency-plans-to-analyze-individual-facebook-pages-a-837539.html printed Nov. 22, 2013 in 2 pages.
Menge, Falko, “Enterprise Service Bus”, Free and Open Source Software Conference, 2007, pp. 6.
MERit Credit Engine™, Diagram, https://web.archive.org/web/20020204202530/http://creditengine.net/diagram.htm, copyright 1997, archived Feb. 4, 2002, pp. 1.
Merriam Webster's Collegiate Dictionary, 10th Edition, Jan. 1, 1993, p. 79.
MicroBilt, “PRBC Credit Reporting Agency—Payment Reporting Builds Credit,” retrieved from http://www.microbilt.com/nontraditional-credit-report.aspx and corresponding “Sample Report,” retrieved from http://www.microbilt.com/pdfs/PRBC%20Sample%20Report%20(complete).pdf printed Nov. 21, 2013 in 8 pages.
Microfinance Africa, “Philippines: Microfinance Players to get Their Own Credit Info Bureau,” Apr. 5, 2011, http://microfinanceafrica.net/microfinance-around-the-world/philippines-microfinance-players-to-get-their-own-credit-info-bureau/ printed Nov. 22, 2013 in 2 pages.
Microsoft, “Expand the Reach of Your Business,” Microsoft Business Solutions, 2004, in 16 pages.
Miller, Margaret, “Credit Reporting Systems Around the Globe: The State of the Art in Public and Private Credit Registries”, Jun. 2000, pp. 32, http://siteresources.worldbank.org/INTRES/Resources/469232-1107449512766/Credit_Reporting_Systems_Around_The_Globe.pdf.
Miller, Joe, “NADA Used-Car Prices Go Online”, Automotive News, Jun. 14, 1999, p. 36.
Mint.com, http://www.mint.com/ printed Sep. 18, 2008 in 2 pages.
Mint.com, http://www.mint.com/how-it-works/ printed Feb. 5, 2013 in 2 pages.
Montgomery County Housing Report, Residential Market Report, Jan. 2004 in 6 pages.
Moore, John R., Jr. “Forecasting and Scheduling for Past-Model Replacement Parts”, Management Science, Application Series, vol. 18, No. 4, Part 1, Dec. 1971, pp. B-200-B-213.
“Mosaic” (geodemography), available from http://en.wikipedia.org/wiki/Mosaic_(geodemography), as last modified Jul. 13, 2012. pp. 4.
MS Money Software by Microsoft http://www.microsoft.com/Money/default.mspx as retrieved on Sep. 17, 2008.
Mvelopes, http://www.mvelopes.com/ printed Feb. 5, 2014 in 2 pages.
MyFico, http://www.myfico.com/products/ficoone/sample/sample_scoresimulator.aspx printed Oct. 12, 2012 in 3 pages.
My ID Alerts, “Why ID Alerts” http://www.myidalerts.com/why-id-alerts.jsps printed Apr. 3, 2012 in 2 pages.
My ID Alerts, “How it Works” http://www.myidalerts.com/how-it-works.jsps printed Apr. 3, 2012 in 3 pages.
MyReceipts, http://www.myreceipts.com/, printed Oct. 16, 2012 in 1 page.
MyReceipts—How it Works, http://www.myreceipts.com/howItWorks.do, printed Oct. 16, 2012 in 1 page.
“Name Availability Records”, Westlaw Database Directory, http://directory.westlaw.com/scope/default.asp?db=NA-ALL&RS=W...&VR=2.0 as printed Dec. 17, 2009, pp. 5.
National Alert Registry Launches RegisteredOffendersList.org to Provide Information on Registered Sex Offenders, May 16, 2005, pp. 2, http://www.prweb.com/printer/240437.htm accessed on Oct. 18, 2011.
National Alert Registry Offers Free Child Safety “Safe From Harm” DVD and Child Identification Kit, Oct. 24, 2006. pp. 2, http://www.prleap.com/pr/53170 accessed on Oct. 18, 2011.
National Alert Registry website titled, “Does a sexual offender live in your neighborhood”, Oct. 22, 2006, pp. 2, http://web.archive.org/wb/20061022204835/http://www.nationallertregistry.com/accessed on Oct. 13, 2011.
Nelson et al., “Efficient, Automatic Web Resource Harvesting”, Conference: Eighth ACM International Workshop on Web Information and Data Management (WIDM 2006), Arlington, Virginia, USA, Nov. 10, 2006, pp. 8.
“New FICO score extends lenders' reach to credit-underserved millions”, Viewpoints: News, Ideas and Solutions from Fair Isaac, Sep./Oct. 2004 as downloaded from http://www.fairisaac.com/NR/exeres/F178D009-B47A-444F-BD11-8B4D7D8B3532,frame . . . in 6 pages.
“New Privista Product Provides Early Warning System to Combat Identity Theft”, PR Newswire, Oct. 24, 2000, PR Newswire Association, Inc., New York.
“NewsHound: NewsHound User Guide Internet E-Mail”, of record as early as May 2, 1997, pp. 11.
Newsroom, “CIGNA Report Withdrawn As Foe Sees Opening,” Insurance Regulator, State Survey, Sep. 9, 1996, vol. 8, Issue 34, pp. 4.
“New for Investors: Asset Allocation, Seasoned Returns and More,” Prosper, http://blog.prosper.com/2011/10/27/new-for-investors-asset-allocation-seasoned-returns-and-more/, Oct. 27, 2011, pp. 4.
Next Card: About Us, http://web.cba.neu.edu/˜awatson/NextCardCase/NextCardAboutUs.htm printed Oct. 23, 2009 in 10 pages.
“Normalize,” http://www.merriam-webster.com/dictionary/normalize printed Jun. 14, 2010.
Novack, Janet, “The Coming Fight over FICO,” Forbes, Dec. 18, 1995, vol. 156, No. 14, p. 96.
Occasional CF Newsletter; http://www.halhelms.com/index.cfm?fuseaction=newsletters.oct.1999; Oct. 1999.
Office of Integrated Analysis and Forecasting, DOE/EIA-M065(2004), Model Documentation Report: Macroeconomic Activity Module (MAM) of the National Energy Modeling System, EIA, Washington DC, Feb. 2004.
Organizing Maniac's Blog—Online Receipts Provided by MyQuickReceipts.com, http://organizingmaniacs.wordpress.com/2011/01/12/online-receipts-provided-by-myquickreceipts.com/dated Jan. 12, 2011 printed Oct. 16, 2012 in 3 pages.
Packer, A. H., “Simulation and Adaptive Forecasting an Applied to Inventory Control”, Operations Research, Jul. 1965, vol. 15, No. 4, pp. 660-679.
Pagano, et al., “Information Sharing in Credit Markets,” Dec. 1993, The Journal of Finance, vol. 48, No. 5, pp. 1693-1718.
“Parse”, Definition from PC Magazine Encyclopedia, http://www/pcmag.com/encyclopedia_term_0,2542,t=parse&i=48862,00.asp as downloaded Mar. 5, 2012.
Partnoy, Frank, Rethinking Regulation of Credit Rating Agencies: An Institutional Investor Perspective, Council of Institutional Investors, Apr. 2009, pp. 21.
Paustian, Chuck, “Every Cardholder a King Customers get the Full Treatment at Issuers' Web Sites,” Card Marketing, New York, Mar. 2001, vol. 5, No. 3, pp. 4.
Pennsylvania Law Weekly, “Discriminating Against Victims Admitting Domestic Abuse Can Lead to Denial of Insurance Coverage,” vol. XVIII, No. 26, dated Jun. 26, 1996, 2 pgs., as downloaded from http://web2.westlaw.com/result/documenttext.aspx?rs=WLW8.
PersonalCapital.com, http://www.personalcapital.com/how-it-works printed Feb. 5, 2014 in 5 pages.
Peters, Peter-Paul, “A Spare Parts Configurator for the European Service Business” (Graduation Report), Honeywell, Industrial Service Logistic Center, Amsterdam, The Netherlands, Mar. 2000, pp. 80.
Phinisee, Tamarind, “Banks, FTC Step Up Efforts to Address Identity Theft”, San Antonio Business Journal; San Antonio, Jul. 5, 2002, vol. 16, No. 24, pp. 5.
Planet Receipt—Home, http://www.planetreceipt.com/home printed Oct. 16, 2012 in 1 page.
Planet Receipt—Solutions & Features, http://www.planetreceipt.com/solutions-features printed Oct. 16, 2012 in 2 pages.
Ponniah, Paulraj, “Data Warehousing Fundamentals: A Comprehensive Guide for IT Professionals”, Wiley-Interscience Publication, pp. 257-289, 377-397, Aug. 3, 2001.
Porter, G. Zell, “An Economic Method for Evaluating Electronic Component Obsolescence Solutions”, www.gidep.org/data/dmsms/library/zell.pdf, May 1998, pp. 1-9.
“PostX to Present at Internet Showcase”, PR Newswire, Apr. 28, 1997, pp. 2.
PostX, “PostX® Envelope and ActiveView”, http://web.archive.org/web/19970714203719/http://www.postx.com/priducts_fm.html, Jul. 14, 1997 (retrieved Nov. 7, 2013) in 2 pages.
Powerforms: Declarative Client-Side For Field Validation, ISSN 1386-145x, Dec. 2000.
“PremierGuide Announces Release 3.0 of Local Search Platform”, Business Wire, Mar. 4, 2004, Palo Alto, CA, p. 5574.
“ProClarity and Microsoft to Host Free Seminar Series on Retail Analytics with Independent Analyst Firm-ProClarity to Share Best Forrester Analysts to Discuss Trends and the Future of the Retail”; Business Wire; pp. 2; Aug. 13, 2003.
“Qualifying For Debt Settlement”, http://www.certifieddebt.com/debt/settlement-qualifications.shtml printed Jan. 9, 2013 in 2 pages.
Quantix Software, “Investment Account Manager,” available at https://www.youtube.com/watch?v=1UwNTEER1Kk, as published Mar. 21, 2012.
Quicken Online by Intuit http://www.quicken.intuit.com/, as retrieved on Sep. 17, 2008.
“Quicken Support”, http://web.archive.org/web/20071231040130/http://web.intuit.com/support/quicken/docs/d_qif.html as archived Dec. 31, 2007 in 6 pages.
Rahm, et al. “Data Cleaning: Problems and Current Approaches”, Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, Dec. 2000, vol. 23, No. 4, pp. 11.
Raman, et al., “Potter's Wheel: An Interactive Data Cleaning System”, Proceedings of the 27th VLDB Conference, Roma, Italy, 2001, pp. 10.
Ramaswamy, Vinita M., Identity-Theft Toolkit, The CPA Journal, Oct. 1, 2006, vol. 76, Issue 10, pp. 66-70.
RAP Interactive, Inc. and Web Decisions: Proudly Presents Live Decisions, A Powerful New Information and Technology Resource that Revolutionizes Interactive Marketing, downloaded from www.webdecisions.com/pdf/LiveDecisions_Bro.pdf, as printed on Aug. 13, 2007.
Ratner, Juliana, “GMAC to Sell Risk-Management Advice; Target is 150 Biggest Home Loan Servicers,” American Banker, vol. 161, No. 53, p. 16, Mar. 19, 1996.
“Recognition and use by Appraisers of Energy-Performance Benchmarking Tools for Commercial Buildings,” prepared by the Institute for Market Transformation, NYSERDA, Feb. 2003, pp. 6.
Repici et al., “The Comma Separated Value (CSV) File Format”, http://creativyst.com/Doc/Articles/CSV/CSV01.htm, Creativyst, Inc., 2002, pp. 10.
“Resolve Debt for Less: With Help from Freedom Financial” http://www.debtsettlementusa.com/ printed Jan. 9, 2013 in 6 pages.
“RF/Spectrum to Offer Score,” National Mortgage News, Special Report; Credit Reporting & Scaring, Jun. 9, 1997, p. 40.
Risk Monitors, “New GMAC Unit Focuses on Portfolio Risk,” PR Newswire, Mar. 13, 1996, pp. 2. http://www.thefreelibrary.com/NEW+GMAC+UNIT+FOCUSES+ON+PORTFOLIO+RISK-a018092212.
Roos, Gina, “Web-Based Service Helps OEMs Cure Parts Obsolescence Blues”, Electronic Engineering Times, Oct. 8, 2001, p. 86.
Roth, Andrew, “CheckFree to Introduce E-Mail Billing Serving,” American Banker, New York, Mar. 13, 2001, vol. 166, No. 49, pp. 3.
Rubin, Rita, “Cosmetic Surgery On Credit, Finance plans let patients reconstruct now, pay later,” The Dallas Morning News, 2 pgs., dated Sep. 10, 1988.
Santarini, Michael, “Forecasts the Probable Obsolescence of Components—Module Predicts Parts Life”, Electronic Engineering Times, Jan. 11, 1999, vol. 1, p. 48.
SAS, “SAS® Information Delivery Portal”, Fact Sheet, 2008, in 4 pages.
Saunders, A., “Data Goldmine,” Management Today, London: Mar. 1, 2004, 6 pages.
Sawyers, Arlena, “NADA to Offer Residual Guide”, Automotive News, May 22, 2000, p. 1.
Sax, Michael M., Data Collection and Privacy Protection: An International Perspective, Presentation: Managing Online Risk and Liability Conference, Aug. 31, 1999, pp. 58.
Schneier, B. “Applied Cryptography”, John Wiley & Sons, Second Edition, pp. 435-447, 1996.
Schmidt, David, “Environmental Impact: The Changing Credit Reporting Landscape,” Business Credit, Apr. 2003, vol. 105, No. 4, pp. 14 (electronic copy provided in 5 pages).
“ScoreNet® Network”, FairIsaac, web.archive.org/web/20071009014242/http://www.fairisaac.com/NR/rdonlyres/AC4C2F79-4160-4E44-B0CB-5C899004879A/0/ScoreNetnetworkBR.pdf, May 2006, pp. 6.
Screenshot for Investment Account Manager v.2.8.3, published at http://www.aaii.com/objects/get/1642.gif by at least Aug. 30, 2011 in 1 page.
Sealey, Geraldine, “Child ID Theft Can Go Unnoticed for Years”, http://abcnews.go.com/US/story?id=90257, Sep. 12, 2003 in 9 pages.
SearchAmerica, “Payment Advisor Suite TM”, Solutions, 2009, pp. 2.
Selz, Michael, “Lenders Find Niche In Cosmetic Surgery That Isn't Insured—But Since You Can't Repossess A Nose Job, Risks Aren't Restricted to the Patients,” Wall Street Journal, New York, N.Y., Jan. 1997, p. A.1, 3 pgs.
“Settling Your Debts—Part 1 in Our Debt Settlement Series”, http://www.creditinfocenter.com/debt/settle_debts.shtml printed Jan. 9, 2013 in 6 pages.
“Shareholders Sue Green Tree Financial,” Dated Dec. 4, 1997, http://web.archive.org/web/20000419070107/http://www.wcco.com/news/stories/news-971204-092238.html.
ShoeBoxed, https://www.shoeboxed.com/sbx-home/ printed Oct. 16, 2012 in 4 pages.
Simpson, Glyn, “Microsoft (MS) Money MSMoney FAQ, Help and Information Pages”, pp. 2, Copyright ©Glyn Simpson 1998-2007, http://web.archive.org/web/20071018075531/http://money.mvps.org/faq/article/196.aspx.
Singletary, Michelle “Ratings for the Credit Raters”, The Washington Post, The Color of Money column Mar. 24, 2002 in 1 page.
Singletary, Michelle, “Score One for Open Credit Ratings”, The Washington Post, Washington DC, Jun. 18, 2000, 3 pages.
Smith, Richard M., “The Web Bug FAQ”, Nov. 11, 1999, Version 1.0, pp. 4.
Smith, Wendell R., “Product Differentiation and Market Segmentation as Alternative Marketing Strategies”, The Journal of Marketing, The American Marketing Association, Brattleboro, Vermont, Jul. 1956, vol. XXI, pp. 3-8.
So et al., “Modelling and Model Validation of the Impact of the Economy on the Credit Risk of Credit Card Portfolios”, The Journal of Risk Model Validation (93-126), vol. 4, No. 4, Winter (Year: 2010).
“STAGG Variables Sum Up Credit Attributes for Automated Decisions”, PRWeb, May 11, 2011, pp. 2. http://www.prweb.com/releases/2011/5/prweb8404324.htm.
Stallings, W. “Cryptography and Network Security Principles and Practice”, Prentice Hall, Second Edition, pp. 295, 297, Jul. 15, 1998.
Stanton, T.H., “Credit Scoring and Loan Scoring as Tools for Improved Management of Federal Credit Programs”, Financier, Philadelphia, Summer 1999, vol. 6, 36 pages.
“StarNet Financial, Inc. Acquires Proprietary Rights to Sub-Prime Underwriting System Through Strategic Alliance With TRAkkER Corporation”, PR Newswire, Dallas, TX, Sep. 13, 1999.
State of Wisconsin, Division of Health Care Financing, Department of Health and Family Services: 1999-2001 Biennial Report, pp. 17-21.
Steele, Georgia, “Fair, Isaac Seeks Mortgage Tech Opportunities,” National Mortgage News, Special Report; B& C Lending, Mar. 23, 1998, p. 34.
Stein, Benchmarking Default Prediction Models: Pitfalls and Remedies in Model Validation, Moody's KMV, Revised Jun. 13, 2002, Technical Report #020305; New York.
Stone, “Linear Expenditure Systems and Demand Analysis: An Application to the Pattern of British Demand”, The Economic Journal: The Journal of The Royal Economic Society, Sep. 1954, pp. 511-527, vol. LXIV, Macmillan & Co., London.
Sullivan, Deidre, “Scoring Borrower Risk,” Mortgage Banking, Nov. 1994, vol. 55, No. 2, pp. 94-98.
Sullivan, Laurie, “Obsolete-Parts Program Thriving”, EBN, Manhasset, NY, Jan. 21, 2002, Issue 1296, p. 26.
Sumner, Anthony, “Tackling The Issue of Bust-Out Fraud”, Experian: Decision Analytics, Dec. 18, 2007, pp. 24.
Sumner, Anthony, “Tackling The Issue of Bust-Out Fraud”, e-News, Experian: Decision Analytics, pp. 4, [Originally Published in Retail Banker International Magazine Jul. 24, 2007].
Tan et al., “Modeling of Web Robot Navigational Patterns”, 2000, Department of Computer Science; University of Minnesota, pp. 7.
Tao, Lixin, “Shifting Paradigms with the Application Service Provider Model”; Concordia University, IEEE, Oct. 2001, Canada.
Taylor, Marshall, “Loan-Level Pricing Draws Interest From Investors,” Real Estate Finance Today, Jul. 7, 1997, vol. 14, No. 14. p. 10.
Tennant, Don, “How a Health Insurance Provider Uses Big Data to Predict Patient Needs,” http://www.itbusinessedge.com/blogs/from-under-the-rug/how-a-health-insurance-provider-uses-big-data-to-predict-patient-needs.html, printed Mar. 6, 2014 in 2 pages.
Texas Department of Human Services, 1999 Annual Report, 60 Years of Progress, Medial Services 9P137, Publication No. DHS-600-FY99.
Thatlook.com, Cosmetic Surgery Financing, 3 pgs, as downloaded from http://web.archive.org/web/200001214113900/www.thatlook.com/cosmetic_surgery_financing.cfm (1 of 2) [Oct. 15, 2008 4:11:47 PM].
“The Best of the Best,” Mortgage Technology, Nov. 1, 2003, vol. 10, No. 8, pp. 34-53.
TheMorningCall.com, “Cheap Ways to Foil Identity Theft,” www.mcall.com/business/columnists/all-karp.5920748jul01,0 . . . , published Jul. 1, 2007.
Thomas, David, “Report on Networks and Electronic Communications Newcourt Credit Turns to Extranet Services / A PC Connects To 1,200 Users At Once”, The Globe and Mail (Canada), Section: Report on Business Special Report, Nov. 12, 1996, pp. 2.
Todorova, Aleksandra, “Protecting Your Child's Identity”, Smart Money, Published Aug. 2, 2007, pp. 1-5.
TRAkkER Corporation website, trakkercorp.com, TRAkkER Software Description, May 26, 2000, available at http://web.archive.org/web/20000526234204/http://trakkercorp.com/page4.html.
“TransUnion—Child Identity Theft Inquiry”, TransUnion, http://www.transunion.com/corporate/personal/fraudldentityTheft/fraudPrevention/childIDInquiry.page as printed Nov. 5, 2009 in 4 pages.
TransUnion Consumer Credit Report http://www.transunion.com/, as retrieved on Sep. 17, 2008.
TransUnion: Vantagescore®—Consistency in Credit Scoring, http://www.transunion.com/personal-credit/credit-reports/vantage-score.page printed Oct. 12, 2012 in 2 pages.
Trulia, “Trulia Estimates,” http://www.trulia.com/trulia_estimates/, printed Feb. 18, 2014 in 2 pages.
Tuman, Diane, “What is a Zestimate?” Mar. 2013, pp. 5, http://www.zillow.com/wikipages/What-is-a-Zestimate/.
US Legal, Description, http://www.uslegalforms.com/us/US-00708-LTR.htm printed Sep. 4, 2007 in 2 pages.
Vamosi, Robert, “How to Handle ID Fraud's Youngest Victims,” Nov. 21, 2008, http://news.cnet.com/8301-10789_3-10105303-57.html.
Van Collie, Shimon, “The Road to Better Credit-Card Marketing,” Bank Technology News, Sep. 1995, pp. 4.
Various Posts from the http://www.2p.wrox.com Forums: http://web.archive.org/web/2005045221950/http://p2p.wrox.com/topic.asp?TOPIC_ID=6513 , dated Nov. 15, 2003-Oct. 7, 2004.
Verstraeten, Geert, Ph.D.; Issues in predictive modeling of individual customer behavior: Applications in targeted marketing and consumer credit scoring; Universiteit Gent (Belgium), Dec. 2005.
Wahl, Martin, “The Stampede to Subprime,” Mortgage Banking, Oct. 1, 1997, vol. 58, No. 1, p. 26(7).
“WashingtonPost.com and Cars.com Launch Comprehensive Automotive Web Site For the Washington Area”, PR Newswire, Oct. 22, 1998. pp. 2.
Washington State Office of Public Defense, “Criteria and Standards for Determining and Verifying Indigency,” dated Feb. 9, 2001.
Watts, Craig, “Consumers Now Can Know What Loan Rate Offers to Expect Based on Their FICO Credit Score at MyFICO.com,” San Rafael, CA, Mar. 6, 2002, pp. 2, http://www.myfico.com/PressRoom/PressReleases/2002_03_06.aspx.
Watts, Craig, “Fair, Isaac and Equifax Give Consumers New Score Power Tools Offering Greater Insights for Managing Their Credit Health,” May 21, 2002, pp. 3, http://www.myfico.com/PressRoom/PressReleases/2002_05_21.aspx.
Web Page posted at: http://web.archive.org/web20040805124909/http://www.oracle.com/technology/sample_codete/tech/pl_sql/htdocs/x/Case/start.htm, pp. 1 and 4 of the webpages posted on Jan. 7, 2003.
Web Pages printed Nov. 2, 2004 of Internet Draft entitled “Tunneling SSL Through a WWW Proxy”, Luotonen, Ari, Netscape Communications Corporation (Dec. 14, 1995); 4 pages. http://muffin.doit.org/docs/rfc/tunneling.sub.--ssl.html.
Webpage printed from http://www.magnum.net/pdfs/RapUpBrochure.pdf as printed Mar. 3, 2008.
“We Eliminate Bad Debt”, as printed from http://www.webcreditbureau.com/start/, dated Aug. 22, 2012, 1 Page.
Webpage printed out from http://www.jpmorgan.com/cm/ContentServer?c=TS Content&pagename=jpmorgan%2Fts%2FTS_Content%2FGeneral&cid=1139403950394 on Mar. 20, 2008, Feb. 13, 2006, New York, NY.
Webster, Lee R., “Failure Rates & Life-Cycle Costs”, Consulting-Specifying Engineer, Apr. 1998, vol. 23, No. 4, ABI/INFORM Global, p. 42.
“Web Site Fuels Elective Surgery Trend; The Complete Resource to Paying for Cosmetic Surgery, Laser Vision Correction and Cosmetic Dentistry,” Business Wire, Apr. 7, 1999, pp. 2.
Wesabe.com http://www.wesabe.com/, as retrieved on Sep. 17, 2008.
West, David, “Neural Network Credit Scoring Models”, Computers & Operations Research, vol. 27, 2000, pp. 1131-1152.
White, Ron, “How Computers Work”, Special 10th Anniversary, Seventh Edition, Que Corporation, Indianapolis, IN, Oct. 2003, pp. 23.
Williams, Mark, “Results of the 1998 NASFAA Salary Survey”, News from NASFAA, 1998.
Wilson, Andrea, “Escaping the Alcatraz of Collections and Charge-Offs”, http://www.transactionworld.net/articles/2003/october/riskMgmt1.asp, Oct. 2003.
Window on State Government, Susan Combs, Texas Comptroller of Public Accounts, Chapter 8: Health and Human Services, “Improve the Medicaid Eligibility Determination Process,” 9 pgs., as downloaded Apr. 9, 2008 from http://www.window.state.tx.us/etexas2001/recommend/ch08.
Wisconsin Department of Workforce Development, BadgerCare Medicaid Application Credit Report Authorization Form, dated Jun. 21, 2001, effective date, Jul. 1, 2001.
Wisconsin Department of Workforce Development, BadgerCare Medicaid Notification of Eligibility, dated Jul. 25, 2000, effective date, Jul. 1, 2000.
Wood, Greg, “Top Streaming Technologies for Data Lakes and Real-Time Data”, http://blog.zaloni.com/top-streaming-technologies-for-data-lakes-and-real-time-data, Sep. 20, 2016 in 3 pages.
Working, Holbrook, “Statistical Laws of Family Expenditure”, Journal of the American Statistical Association, pp. 43-56, vol. 38, American Statistical Association, Washington, D.C., Mar. 1943.
Yang, et al., “An Analysis of the Ex Ante Probabilities of Mortgage Prepayment and Default”, Real Estate Economics, Dec. 1998, vol. 26, No. 4, pp. 651-676.
YODLEE | Money Center, https://yodleemoneycenter.com/ printed Feb. 5, 2014 in 2 pages.
You Need A Budget, http://www.youneedabudget.com/features printed Feb. 5, 2014 in 3 pages.
Yücesan et al., “Distributed Web-Based Simulation Experiments for Optimization”, Simulation Practice and Theory 9, Oct. 2001, pp. 73-90.
Zandbergen, Paul A., “Ensuring Confidentiality of Geocoded Health Data: Assessing Geographic Masking Strategies for Individual-Level Data”, Review Article, Hindawi Publishing Corporation, Advances in Medicine, VI. 2014, pp. 14.
Zimmerman et al., “A Web-Based Platform for Experimental Investigation of Electric Power Auctions,” Decision Support Systems, Jan. 1999, vol. 24, pp. 193-205.
Zoot—Decision Engine, www.zootweb.com/decision_engine.html, as printed on Mar. 3, 2008.
Zoot—Instant Rules GUI, www.zootweb.com/instant_rules_GUI.html as printed Mar. 3, 2008.
Zoot—Pre-Built Standard Attributes, www.zootweb.com/credit_attributes.html as printed Mar. 3, 2008.
Zoot—Rules Management GUI, www.zootweb.com/business_rules_GUI.html as printed Mar. 3, 2008.
Declaration of Paul Clark, DSc. for Inter Partes Review of U.S. Pat. No. 8,504,628 (Symantec Corporation, Petitioner), dated Jan. 15, 2014 in 76 pages.
Exhibit D to Joint Claim Construction Statement, filed in Epsilon Data Management, LLC, No. 2:12-cv-00511-JRG (E.D. Tex.) (combined for pretrial purposes with RPost Holdings. Inc., et al. v. Experian Marketing Solutions. Inc., No. 2:12-cv-00513-JRG (E.D. Tex.)) Filed Jan. 14, 2014 in 9 pages.
First Amended Complaint in Civil Action No. 2:12-cv-511-JRG (Rpost Holdings, Inc. And Rpost Communications Limited V. Constant Contact, Inc.; et al.) filed Feb. 11, 2013 in 14 pages.
First Amended Complaint in Civil Action No. 2:12-cv-511-JRG (Rpost Holdings, Inc. And Rpost Communications Limited V. Epsilon Data Management, LLC.) filed Sep. 13, 2013 in 9 pages.
First Amended Complaint in Civil Action No. 2:12-cv-513-JRG (Rpost Holdings, Inc. And Rpost Communications Limited V. Experian Marketing Solutions, Inc.) filed Aug. 30, 2013 in 9 pages.
Petition for Covered Business Method Patent Review in U.S. Pat. No. 8,161,104 (Experian Marketing Solutions, Inc., Epsilon Data Management, LLC, and Constant Contact, Inc., v. Rpost Communications Limited) dated Jan. 29, 2014 in 90 pages.
Source Code Appendix attached to U.S. Appl. No. 08/845,722 by Venkatraman et al., Exhibit A, Part 1 & 2, pp. 32.
Application as filed in U.S. Appl. No. 10/452,155, dated May 30, 2003.
Preliminary Amendment in U.S. Appl. No. 10/452,155, dated Sep. 15, 2003.
Office Action in U.S. Appl. No. 10/452,155, dated Jan. 25, 2008.
Examiner Interview Summary in U.S. Appl. No. 10/452,155, dated Jul. 23, 2008.
Office Action in U.S. Appl. No. 10/452,155, dated Oct. 2, 2008.
Examiner Interview Summary in U.S. Appl. No. 10/452,155, dated Jan. 14, 2009.
Examiner Interview Summary in U.S. Appl. No. 10/452,155, dated Jul. 21, 2009.
Notice of Allowance in U.S. Appl. No. 10/452,155, dated Aug. 19, 2009.
International Preliminary Report on Patentability and Written Opinion for Application No. PCT/US2005/041814, dated Dec. 27, 2007.
International Search Report and Written Opinion in PCT Application No. PCT/US07/76152, dated Mar. 20, 2009.
Official Communication in Australian Patent Application No. 2012281182, dated Jul. 8, 2014.
Official Communication in Australian Patent Application No. 2012281182, dated May 19, 2015.
Official Communication in Chinese Patent Application No. 201280041782.2, dated Mar. 4, 2016.
Official Communication in European Patent Application No. 12811546.6, dated Nov. 25, 2014.
Official Communication in European Patent Application No. 12811546.6, dated Sep. 18, 2015.
Official Communication in Indian Patent Application No. 490/DELNP/2014, dated Jun. 20, 2019.
Official Communication in Russian Patent Application No. 2014101674/08, dated Dec. 15, 2014.
International Search Report and Written Opinion for Application No. PCT/US2012/046316, dated Sep. 28, 2012.
International Preliminary Report on Patentability and Written Opinion for Application No. PCT/US2012/046316, dated Jan. 14, 2014.
International Search Report and Written Opinion for Application No. PCT/US09/60393, dated Dec. 23, 2009.
International Search Report and Written Opinion for Application No. PCT/US09/37565, dated May 12, 2009.
International Search Report and Written Opinion for Application No. PCT/US2010/034434, dated Jun. 23, 2010.
International Preliminary Report on Patentability for Application No. PCT/US2010/034434, dated Feb. 4, 2014.
International Search Report and Written Opinion for Application No. PCT/US2013/052342, dated Nov. 21, 2013.
International Preliminary Report on Patentability for Application No. PCT/US2013/052342, dated Feb. 5, 2015.
Official Communication in Australian Patent Application No. 2013356451, dated Jun. 22, 2015.
Official Communication in Chinese Patent Application No. 201380006862.9, dated Aug. 2, 2016.
Official Communication in European Patent Application No. 13860724.7, dated May 21, 2015.
Official Communication in Russian Patent Application No. 2014127000, dated Dec. 23, 2015.
International Search Report and Written Opinion for Application No. PCT/US2013/072102, dated Apr. 18, 2014.
International Preliminary Report on Patentability and Written Opinion for Application No. PCT/US2013/072102, dated Jun. 9, 2015.
Official Communication in Australian Patent Application No. 2014203430, dated Aug. 15, 2015.
Official Communication in Chinese Patent Application No. 201480000626.0, dated Aug. 1, 2016.
Official Communication in European Patent Application No. 14733951.9, dated Sep. 11, 2015.
Official Communication in Russian Patent Application No. 2014127320, dated Jul. 5, 2016.
International Search Report and Written Opinion for Application No. PCT/US2014/019142, dated Jun. 20, 2014.
International Preliminary Report on Patentability and Written Opinion for Application No. PCT/US2014/019142, dated Sep. 17, 2015.
International Search Report and Written Opinion for Application No. PCT/US2017/048265, dated Dec. 5, 2017.
International Preliminary Report on Patentability in Application No. PCT/US2017/048265, dated Mar. 7, 2019.
Partial Supplementary European Search Report for Application No. EP12747205, dated May 14, 2020.
Extended European Search Report for Application No. EP12747205, dated Aug. 14, 2020.
International Search Report and Written Opinion for Application No. PCT/US2018/016258, dated May 16, 2018.
International Preliminary Report on Patentability in Application No. PCT/US2018/016258, dated Aug. 15, 2019.
International Search Report and Written Opinion for Application No. PCT/US2020/012976, dated May 6, 2020.
Provisional Application as filed in U.S. Appl. No. 60/168,272, dated Dec. 1, 1999 in 14 pages.
Provisional Application as filed in U.S. Appl. No. 60/168,276, dated Dec. 1, 1999 in 82 pages.
Provisional Application as filed in U.S. Appl. No. 60/213,367, dated Jun. 23, 2000 in 20 pages.
Application as filed in U.S. Appl. No. 09/653,595, dated Aug. 31, 2000.
Application as filed in U.S. Appl. No. 09/790,453, dated Feb. 22, 2001.
Office Action in U.S. Appl. No. 09/790,453, dated Jan. 20, 2006.
Office Action in U.S. Appl. No. 09/790,453, dated Jul. 11, 2006.
Office Action in U.S. Appl. No. 09/790,453, dated Dec. 1, 2006.
Office Action in U.S. Appl. No. 09/790,453, dated May 10, 2007.
Office Action in U.S. Appl. No. 09/790,453, dated Mar. 21, 2008.
Application as filed in U.S. Appl. No. 10/183,135, filed Jun. 25, 2002.
Office Action in U.S. Appl. No. 10/183,135, dated Oct. 22, 2007.
Final Office Action in U.S. Appl. No. 10/183,135, dated Apr. 14, 2008.
Office Action in U.S. Appl. No. 10/183,135, dated Aug. 21, 2008.
Office Action in U.S. Appl. No. 10/183,135, dated Feb. 26, 2009.
Office Action in U.S. Appl. No. 10/183,135, dated Aug. 18, 2009.
Office Action in U.S. Appl. No. 10/183,135, dated Feb. 19, 2010.
Final Office Action in U.S. Appl. No. 10/183,135, dated Sep. 22, 2010.
Office Action in U.S. Appl. No. 10/183,135, dated Mar. 25, 2011.
Notice of Allowance in U.S. Appl. No. 10/183,135, dated Aug. 15, 2011.
Office Action in U.S. Appl. No. 11/169,769, dated Mar. 24, 2010.
Application as Filed in U.S. Appl. No. 11/363,984, dated Feb. 27, 2006.
Office Action in in U.S. Appl. No. 11/363,984, dated Dec. 26, 2008.
Related Publications (1)
Number Date Country
20220138238 A1 May 2022 US
Provisional Applications (1)
Number Date Country
62452701 Jan 2017 US
Continuations (1)
Number Date Country
Parent 15885239 Jan 2018 US
Child 17457757 US