System and method for aggregating data from a plurality of data sources

Information

  • Patent Grant
  • 10198515
  • Patent Number
    10,198,515
  • Date Filed
    Monday, August 3, 2015
    8 years ago
  • Date Issued
    Tuesday, February 5, 2019
    5 years ago
Abstract
According to certain aspects, a computer system may be configured to aggregate and analyze data from a plurality of data sources. The system may obtain data from a plurality of data sources, each of which can include various types of data, including email data, system logon data, system logoff data, badge swipe data, employee data, job processing data, etc. associated with a plurality of individuals. The system may also transform data from each of the plurality of data sources into a format that is compatible for combining the data from the plurality of data sources. The system can resolve the data from each of the plurality of data sources to unique individuals of the plurality of individuals. The system can also determine an efficiency indicator based at least in part on a comparison of individuals of the unique individuals that have at least one common characteristic.
Description
TECHNICAL FIELD

The present disclosure relates to systems and techniques for data integration and analysis. More specifically, the present disclosure relates to aggregating data from a plurality of data sources and analyzing the aggregated data.


BACKGROUND

Organizations and/or companies are producing increasingly large amounts of data. Data may be stored across various storage systems and/or devices. Data may include different types of information and have various formats.


SUMMARY

The systems, methods, and devices described herein each have several aspects, no single one of which is solely responsible for its desirable attributes. Without limiting the scope of this disclosure, several non-limiting features will now be discussed briefly.


In one embodiment, a computer system configured to aggregate and analyze data from a plurality of data sources comprises: one or more hardware computer processors configured to execute code in order to cause the system to: obtain data from a plurality of data sources, each of the plurality of data sources comprising one or more of: email data, system logon data, system logoff data, badge swipe data, employee data, software version data, software license data, remote access data, phone call data, or job processing data associated with a plurality of individuals; detect inconsistencies in formatting of data from each of the plurality of data sources; transform data from each of the plurality of data sources into a format that is compatible for combining the data from the plurality of data sources; associate the data from each of the plurality of data sources to unique individuals of the plurality of individuals; and determine efficiency indicators for respective individuals based at least in part on a comparison of data associated with the respective individuals and other individuals that have at least one common characteristic.


In another embodiment, a computer system configured to aggregate and analyze data from a plurality of data sources comprises: one or more hardware computer processors configured to execute code in order to cause the system to: access data from a plurality of data sources, each of the plurality of data sources comprising one or more of: email data, system logon data, system logoff data, badge swipe data, employee data, software version data, software license data, remote access data, phone call data, or job processing data associated with a plurality of individuals; detect inconsistencies in formatting of datum from respective data sources; associate respective datum from the plurality of data sources to respective individuals of the plurality of individuals; and provide statistics associated with respective individuals based on data associated with the respective individuals from the plurality of data sources. In certain embodiments, the code is further configured to cause the computer system to: transform respective datum from the plurality of data sources into one or more formats usable to generate the statistics.


In yet another embodiment, a non-transitory computer readable medium comprises instructions for aggregating and analyzing data from a plurality of data sources that cause a computer processor to: access data from a plurality of data sources, each of the plurality of data sources comprising one or more of: email data, system logon data, system logoff data, badge swipe data, employee data, software version data, software license data, remote access data, phone call data, or job processing data associated with a plurality of individuals; detect inconsistencies in formatting of datum from respective data sources; associate respective datum from the plurality of data sources to respective individuals of the plurality of individuals; and provide statistics associated with respective individuals based on data associated with the respective individuals from the plurality of data sources. In certain embodiments, the instructions are further configured to cause the computer processor to: transform respective datum from the plurality of data sources into one or more formats usable to generate the statistics.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram illustrating one embodiment of a data analysis system configured to aggregate and analyze data from a plurality of data sources.



FIG. 2 is a block diagram illustrating components of the data analysis system of FIG. 1, according to one embodiment.



FIG. 3 is a flowchart illustrating one embodiment of a process for aggregating and analyzing data from a plurality of data sources.



FIG. 4 is a flowchart illustrating one embodiment of a process for performing a quality reliability test for determining the reliability of data from one or more of a plurality of data sources.



FIG. 5 is a flow diagram illustrating examples of types of data that can be aggregated and analyzed for employee efficiency and/or productivity analysis.



FIG. 6 illustrates an example user interface displaying an output of a data analysis system.



FIG. 7 illustrates another example user interface displaying an output of a data analysis system.



FIG. 8 is a block diagram illustrating a computer system with which certain methods discussed herein may be implemented.





DETAILED DESCRIPTION

Overview


Organizations and/or companies may generate, collect, and store large amounts of data related to activities of employees. Such data may be stored across various storage systems and/or devices and may have different formats. For example, data of an organization may be stored in different locations (e.g., different cities, countries, etc.) and different types of media (disk storage, tapes, etc.). Data may be available in the form of web services, databases, flat files, log files, etc. Even within the same organization, the format of various data sources can be different (e.g., different identifiers can be used to refer to an employee). Therefore, it may be difficult to query and extract relevant information from vast amounts of data scattered in different data sources. Accordingly, there is a need for aggregating and analyzing data from various data sources in an efficient and effective way in order to obtain meaningful analysis. For example, there is a need for improved analysis of data from multiple data sources in order to track activities of and determine productivity of employees.


As disclosed herein, a data analysis system may be configured to aggregate and analyze data from various data sources. Such data analysis system may also be referred to as a “data pipeline.” The data pipeline can accept data from various data sources, transform and cleanse the data, aggregate and resolve the data, and generate statistics and/or analysis of the data. The data analysis system can accept data in different formats and transform or convert them into a format that is compatible for combining with data from other data sources. The data analysis system can also resolve the data from different sources and provide useful analysis of the data. Because data from any type or number of data sources can be resolved and combined, the resulting analysis can be robust and provide valuable insight into activities relating to an organization or company. For example, a company can obtain analysis relating to employee email activity, employee efficiency, real estate resource utilization, etc. As used herein, combining of data may refer to associating data items from different data sources without actually combining the data items within a data structure, as well as storing data from multiple data sources together.


Data Pipeline



FIG. 1 is a block diagram illustrating one embodiment of a data analysis system 100 configured to aggregate and analyze data from a plurality of data sources. The data sources may provide data in various data formats that are accepted by the data analysis system 100, such as web services, databases, flat files, log files, etc. The data can be in various formats. In some instances, the data may be defined as CSV, in rows and columns, in XML, etc. The data analysis system 100 can accept data from multiple data sources and produce statistics and/or analysis related to the data. Some examples of types of data sources that the data analysis system 100 can accept as input include employee data, email data, phone log data, email log data, single sign-on (SSO) data, VPN login data, system logon/logoff data, software version data, software license data, remote access data, badge swipe data, etc.


The data analysis system 100 can function as a general transform system that can receive different types of data as input and generate an output specified by an organization or company. For example, the data analysis system 100 can accept employee data and email data of an organization and output a list of top 10 email senders or recipients for each employee. The output from the data analysis system 100 may package the aggregated data in a manner that facilitates querying and performing analysis of the data. One type of querying and/or analysis may be operational efficiency analysis.



FIG. 2 is a block diagram illustrating components of the data analysis system 100 of FIG. 1, according to one embodiment. The data analysis system 200 of FIG. 2 can be similar to the data analysis system 100 of FIG. 1. The data analysis system 200 can accept data from multiple data sources and output processed data. The system 200 can include a data reliability/consistency module 210, a job orchestration module 220, an aggregation/cleansing module 230, and an analysis module 240. The system 200 can include fewer or additional modules or components, depending on the embodiment. One or more modules may be combined or reside on the same computing device, depending on the embodiment. In certain embodiments, functions performed by one module in the system 200 may be performed by another module in the system 200.


The data reliability/consistency module 210 may perform quality reliability tests on various data sources. The system 200 may have access to information about the format of a data source, and the data reliability/consistency module 210 can detect whether the format of the data from the data source is consistent with the expected format. Performing reliability tests prior to aggregating the data can ensure that the output and analysis generated by the system 200 is reliable. Details relating to quality reliability test are explained further below.


The job orchestration module 220 may automate jobs for aggregating, cleansing, and/or analyzing the data. The job orchestration module 220 can manage steps involved in each process and scheduling the steps. For example, the job orchestration module 220 can define and schedule steps for transforming and resolving data from multiple data sources. The job orchestration module 220 can define workflows for various processes, e.g., through coordinated sequences of commands, scripts, jobs, etc. In some embodiments, the system 200 uses open source tools, such as Rundeck, Kettle, etc.


Cleansing/Aggregation


The aggregation/cleansing module 230 aggregates and/or cleanses data from various sources. “Cleansing” may refer to transforming and resolving the data from various sources so that they can be combined. Data in different sources may not be readily combined although the data may relate to a common entity (e.g., an employee or group of employees) and/or same type of information (e.g., time). For example, the IDs used to identify an employee can be different from one data source to another. In such case, the IDs may be mapped so that they can be resolved to specific employees. The system 200 may identify a standard identifier that can map two or more employee IDs used by different data sources to a particular employee. One example of a standard identifier can be the employee's email address. If both data sources include the corresponding email addresses for employee IDs, the data from the two sources can be associated with an employee associated with the email addresses.


In another example, data sources may include timestamp or time data (e.g., employee badge-in time, employee badge-out time, etc.), but the time information in data received from different sources may have the same time reference and, thus, may not be in local time zone of any particular employee (except those employees that may be in the standard time reference used by the organization). For example, an organization may have locations in various time zones, but all timestamps may be represented in UTC (Coordinated Universal Time) or GMT (Greenwich Mean Time) format. In order to make comparison across different time zones, the time information may need to be converted or adjusted according to the local time zone. Each employee's timestamp can be shifted or adjusted so that the time information reflects the local time. The aggregation/cleansing module 230 may obtain the local time zone information based on the employee's city, state, and country information in order to make the appropriate adjustment. Data for employees related to time (e.g., time arrived at office, time checked-out for lunch, etc.) may then be compared in a more meaningful manner with the time entries converted to represent local times. The examples above have been explained for illustrative purposes, and cleansing can include any processing that is performed on the data from multiple sources in order to combine them.


Once the data from various data sources are cleansed, they can be combined and aggregated. For example, multiple different IDs can be mapped to the same employee (or other entity) based on a common or standard identifier such that data using any of those multiple different IDs can each be associated with the same employee. The vast amounts of data can be joined and combined so that they are available for analysis.


In some embodiments, the data can be imported into and aggregated using a distributed computing framework (e.g., Apache Hadoop). A distributed computing framework may allow for distributed processing of large data sets across clusters of computers. Such framework may provide scalability for large amounts of data. Data may be cleansed and/or aggregated using a software that facilitates querying and managing of large data sets in distributed storage (e.g., Apache Hive).


The aggregation/cleansing module 230 can generate an output from the combined data. The output can be defined as appropriate by the organization or company that is requesting the data analysis. The output may combine data and provide an intermediate format that is configured for further analysis, such as querying and/or other analysis. In one example, employee data and email data are aggregated in order to provide an intermediate outcome that may be analyzed to provide insights into employee email activity. For example, an organization may have about 5 billion emails, but querying all emails can be slow and may not yield valuable information. Instead, the aggregation/cleansing module 230 can aggregate the email data and provide an intermediate output including data such as a list of top email senders, top email recipients, top sender domains, top recipient domains, number of sent emails, number of received emails, etc. for each employee. This intermediate output, which is a reduced amount of data, may then be considered in querying. Using the intermediate output, the aggregation/cleansing module 230 may search for top sender/recipient domains, top email sending employees, top email receiving employees, etc. For instance, the aggregation/cleansing module 230 can search through the intermediate output (which can include, e.g., top email senders, top email recipients, top sender domains, top recipient domains, number of sent emails, number of received emails, etc. for each employee) in order to produce statistics and/or analysis for the entire organization (e.g., information such as top email sending employees, top email receiving employees, top domains, etc. and/or information output in user interfaces illustrated in FIGS. 6-7). In this manner, the data can be analyzed and reduced in a manner that makes it easier for organizations to ask questions about various aspects of their operations or business. For instance, a company may be interested in finding out information on its operational efficiency.


In another example, the aggregation/cleansing module 230 can output the number of emails an employee sends in 15-minute buckets (e.g., how many emails an employee has sent every 15 minutes). This output can serve as an intermediate output for determining a relationship between the number of emails an employee sends and employee efficiency or productivity. In other embodiments, the aggregation/cleansing module 230 can generate an output that is not used as an intermediate output for analysis, but that can be directly output to the users (e.g., information output in user interfaces illustrated in FIGS. 6-7). In certain embodiments, the aggregation/cleansing module 230 may provide combined data to the analysis module 240, and the analysis module 240 may generate the intermediate output. For example, the aggregation/cleansing module 230 may resolve and combine the data sets, and the analysis module 240 can generate an intermediate output from the combined data set.


Analysis


The analysis module 240 can perform analysis based on the output from the aggregation/cleansing module 230. For example, the analysis module 240 can perform queries for answering specific questions relating to the operations of an organization. One example question may be what are the top domains that send emails to employees of an organization. The analysis module 240 can search through the top sender domains for all employees and produce a list of top sender domains. The analysis module 240 may be an analysis platform that is built to interact with various outputs from the data analysis system 200, which users from an organization can use to obtain answers to various questions relating to the organization. In some embodiments, the output from the aggregation/cleansing module 230 may be an intermediate output for facilitating further analysis. In other embodiments, the output from the aggregation/cleansing module 230 may be a direct output from the cleansing and/or aggregating step that does not involve an intermediate output.


Quality Reliability Tests


As mentioned above, the system 200 can perform quality reliability tests to determine the reliability of the data from various data sources. The data reliability/consistency module 210 of the system 200 can perform the reliability tests. The data reliability/consistency module 210 can detect inconsistencies and/or errors in the data from a data source. The data reliability/consistency module 210 may have access to information about data from a certain data source, such as the typical size of the data, typical format and/or structure of the data, etc. The data reliability/consistency module 210 may refer to the information about a data source in order to detect inconsistencies and/or errors in received data.


The data reliability/consistency module 210 can flag a variety of issues, including: whether the file size is similar to the file size of previous version of the data, whether the population count is similar to the previously received population count, whether the structure of the data has changed, whether the content or the meaning of the data has changed, etc. In one embodiment, population count may refer to the number of items to expect, for example, as opposed to their size. For example, the data reliability/consistency module 210 can identify that the content or the meaning of a column may have changed if the information used to be numeric but now is text, or if a timestamp used to be in one format but now is in a different format. Large discrepancies or significant deviations in size and/or format can indicate that the data was not properly received or pulled.


The data reliability/consistency module 210 can run one or more tests on data received from a data source. If the data reliability/consistency module 210 determines that data from a data source is not reliable, the system 200 may attempt to pull or receive the data again and run reliability tests until the data is considered sufficiently reliable. By making sure that the data of a data source is reliable, the system 200 can prevent introducing inaccurate data into the analysis further down the process.


In some embodiments, the data reliability/consistency module 210 may also perform quality reliability tests on aggregated data to make sure that the output from the aggregation/cleansing module 230 does not have errors or inconsistencies. In one example, the number of unique employees may be known or expected to be around 250,000. However, if the resolved number of unique employees is much more or less than the known or expected number, this may indicate an error with the output. In such case, the data reliability/consistency module 210 can flag issues with the output and prevent introduction of error in later steps of the process.


Employee Email Activity Example


In one embodiment, the data analysis system 200 aggregates data relating to employees of an organization, such as email activity of the employees. For example, an organization may be interested in finding out about any patterns in employee email activity and employee efficiency. The data analysis system 200 accepts data from at least two data sources: one data source that includes employee data and another data source that includes email data. The email data may be available in the form of email logs from an email server application (e.g., Microsoft Exchange), for example, and may include information such as sender, recipient, subject, body, attachments, etc. The employee data may be accessed in one or more databases, for example, and may include information such as employee ID, employee name, employee email address, etc.


The data reliability/consistency module 210 can perform quality reliability tests on data received from each of the data sources. For example, the data reliability/consistency module 210 can compare the file size of the employee data against the file size of the previously received version of the employee data, or the data reliability/consistency module 210 can compare the file size against an expected size. The data reliability/consistency module 210 can also check whether the structure of the employee data has changed (e.g., number and/or format of rows and columns). The data reliability/consistency module 210 can also run similar tests for the email data. The data reliability/consistency module 210 can check the file size, structure, etc. If the data reliability/consistency module 210 determines that the data from a data source has errors or inconsistencies, the system 200 may try to obtain the data again. The data reliability/consistency module 210 can run the reliability tests on the newly received data to check whether it is now free of errors and/or inconsistencies. Once all (or selected samplings) of the data from the data sources is determined to be reliable, the system 200 can cleanse and aggregate the data from the data sources.


The job orchestration module 220 can schedule the steps involved in cleansing and aggregating data from the various sources, such as employee data and email data. For example, the job orchestration module 220 can define a series of commands to be performed to import data from multiple data sources and transform the data appropriately for combining. As explained above, the data from the data sources can be imported into a distributed computing framework that can accommodate large amounts of data, such as Hadoop. The data can be cleansed and aggregated using the distributed computing framework.


The aggregation/cleansing module 230 can map the employee data and the email data by using the employee's email address. The email data may include emails that have the employee's email address as either the sender or the recipient, and these emails can be resolved to the employee who has the corresponding email address. By mapping the email address to employee ID, the email data can be resolved to unique individuals. After resolving the data to unique individuals, the aggregation/cleansing module 230 can aggregate the data and generate an intermediate output that can be used to perform further analysis (e.g., by the analysis module 240).


Because the size of email data in an organization can be quite large (e.g., 5 billion emails), analyzing all emails after they have been resolved to unique individuals may not be the most efficient way to proceed. Accordingly, the aggregation/cleansing module 230 may make the amount of data to be analyzed more manageable by aggregating or summarizing the data set. In a specific example, the aggregation/cleansing module 230 generates a list of top email senders and top email recipients for each employee from all of the emails associated with that employee. For instance, the aggregation/cleansing module 230 can generate an output of top email senders in the format “sender name,” “sender domain,” and “number of emails from sender” (e.g., “John Doe,” “gmail.com,” “10”). The aggregation/cleansing module 230 can extract the domain information from the sender email address to provide the sender domain information. The aggregation/cleansing module 230 can generate an output of top email recipients for an employee in a similar manner. The aggregation/cleansing module 230 may also extract file extensions for attachments and generate a list of types of attachments and counts of attachments for each employee. The aggregation/cleansing module 230 can generate any intermediate output of interest for each employee, and such intermediate output can be used in further analysis by the analysis module 240. In some embodiments, the intermediate output may be directly output to the users. For example, the system 200 may display in the user interface the list of top senders and top recipients for employees who send and/or receive the most number of emails within the organization.


The users in an organization can interact with the analysis module 240 in order to obtain information regarding operational efficiency. In the above example, the analysis module 240 may produce a list of employees who send the highest number of emails, employees who receive the highest number of emails, employees who receive the highest number of attachments, top domains for all emails, etc. for the whole organization. The final output can be based on the intermediate output for each employee. For example, the top domains for all emails can be determined by querying which domains are most common in the top sender domains and top recipient domains for all employees.


In certain embodiments, the email activity may be compared with other activities of employees (e.g., loan processing as explained below) to determine whether certain patterns or trends in an employee's email activity affect employee efficiency. In some embodiments, the analysis module 240 can generate an efficiency indicator for each employee based on the combined and aggregated data from multiple data sources. An efficiency indicator can provide information relating to the efficiency of an employee. The efficiency indicator may be based on some or all aspects of employee activity.


Loan Processing Example


In another embodiment, the data analysis system 200 accepts data from data sources relating to loan processing. For example, the data analysis system 200 can receive employee data, loan processing data, and other related information in order to analyze employee efficiency in processing loans and factors affecting employee efficiency. The data reliability/consistency module 210 can perform any relevant quality reliability tests on each of the data sources.


The aggregation/cleansing module 230 can cleanse and combine the data from multiple data sources. Any combination of data can be aggregated. For instance, the employee data and the loan processing data can be combined with one or more of: software version or upgrade data, employee arrival/departure time data, training platform data, etc. In one example, the employee data and the loan processing data are combined with software version or upgrade data, and the resulting data may show that employees that have a certain version of the software are more efficient. In another example, the employee data and the loan processing data are combined with employee arrival time, and the resulting data may show that employees who arrive earlier in the day are more efficient.


The analysis module 240 may compare a group of individuals who have one or more common characteristics against each other. For example, a group may be defined by the same position, manager, department, location, etc. The members within a group may be compared to analyze trends. The analysis module 240 may also compare one group against another group. For instance, one group may report to one manager, and another group may report to a different manager. A group of individuals that share a common characteristic may be referred to as a “cohort.” Comparison of groups or cohorts may reveal information about why one group is more efficient than another group. For example, the analysis of the resulting data may show that Group A is more efficient than Group B, and the software for Group A was recently upgraded whereas the software for Group B has not been. Such correlation can allow the organization to decide whether and when to proceed with the software upgrade for Group B.


Real Estate Resource Example


In certain embodiments, the data analysis system 200 can accept data relating to real estate resources of an organization. The data sources may include information relating to one or more of: real estate resource data, costs associated with various real estate resources, state of various real estate resources, employees assigned to various real estate resources, functions assigned to various real estate resources, etc. For example, the data analysis system 200 can accept real estate resource data and employee activity data from multiple data sources. The data from multiple data sources can be combined to analyze whether certain real estate resources can be merged, eliminated, temporarily replace other resources during emergencies, etc. For example, if there are multiple locations of an organization within the same city, it may make sense to merge the offices based on the analysis. Organizations may also determine which real estate resources can carry on fundamental business processes during emergencies or natural disasters, e.g., as part of business continuity planning. The analysis module 240 can perform such analysis based on the resulting output from the aggregation/cleansing module 230. In some embodiments, the aggregation/cleansing module 230 may produce an intermediate output that can be used by the analysis module 240.


OTHER EXAMPLES

In some embodiments, employee activity data can be combined and analyzed to detect any security breaches. The data analysis system 200 can aggregate employee data relating to badge-in time, badge-out time, system login/logout time, VPN login/logout time, etc. in order to identify inconsistent actions. For example, if an employee badged in at 9:30 am at the office and logged on to the system at 9:32 am, but there is a VPN login at 9:30 am, the data analysis system 200 can identify that the VPN login is probably not by the employee.



FIG. 3 is a flowchart illustrating one embodiment of a process 300 for aggregating and analyzing data from a plurality of data sources. The process 300 may be implemented by one or more systems described with respect to FIGS. 1-2 and 8. For illustrative purposes, the process 300 is explained below in connection with the system 100 in FIG. 1. Certain details relating to the process 300 are explained in more detail with respect to FIGS. 1-2 and 4-8. Depending on the embodiment, the process 300 may include fewer or additional blocks, and the blocks may be performed in an order that is different than illustrated.


At block 301, the data analysis system 100 accesses and/or obtains data from a plurality of data sources. In the examples of employee monitoring, the data sources can include various data types, including one or more of: email data, system logon data, system logoff data, badge swipe data, employee data, software version data, software license data, remote access data, phone call data, job processing data, etc. associated with a plurality of individuals. The type of data source accepted by the system 100 can include a database, a web service, a flat file, a log file, or any other format data source. The data in one data source can have a different format from the data in another data source.


At block 302, the system 100 performs a quality reliability test for determining reliability of data from each of the plurality of data sources. Quality reliability tests may be based on expected characteristics of data from a particular data source. Each data source may have a different set of expected characteristics. In one embodiment, the system 100 detects inconsistencies in formatting of data from each of the plurality of data sources. In one embodiment, the system 100 may perform multiple reliability tests on data from each of the plurality of data sources in order to identify any errors or inconsistences in data received from the data sources. For example, the system 100 can check whether the file size matches expected file size, structure of the data matches expected structure, and/or number of entries matches expected number of entries, among other data quality checks. Any significant deviations may signal problems with a particular data source. Details relating to performing quality reliability tests are further explained in connection with FIG. 4.


At block 303, the system 100 transforms the data into a format that is compatible for combining and/or analysis. When the data from different data sources are imported into the system 100, the data from the data sources may not be in a format that can be combined. In one example, time information may be available from multiple data sources, but one time data source can use the universal time, and another data source can use local time. In such case, the time data in one of the data sources should be converted to the format of the other data source so that the combined data has the time same reference.


At block 304, the system 100 resolves the data from each of the plurality of data sources to unique individuals. Unique individuals may be a subset of the plurality of individuals with whom the data from the plurality of data sources is associated. For example, some data sources may include information about individuals who are not employees (e.g., consultants), and such data may not be resolved to specific employees. The system 100 may resolve the data from each of the plurality of data sources at least partly by mapping a column in one data source to a column in another data source.


At block 305, the system 100 generates output data indicating analysis of the resolved data, such as efficiency indicators that are calculated using algorithms that consider data of employees gathered from multiple data sources. In one embodiment, the system 100 determines an efficiency indicator based at least in part on a comparison of individuals of the unique individuals that have at least one common characteristic. The at least one common characteristic can be the same title, same position, same location, same department, same manager or supervisor, etc.


In certain embodiments, the system 100 may generate an intermediate output based on the resolved data, and the system 100 can determine an efficiency indicator based on the intermediate output. The intermediate output may be a reduced version of the resolved data. A reduced version may not contain all of the resolved data, but may include a summary or aggregation of some of the resolved data. For example, the reduced version of employee email data does not contain all employee emails, but can include a list of top senders and top recipients for each employee.


In one embodiment, a first data source of the plurality of data sources includes employee data, and a second data source of the plurality of data sources includes email data. The system 100 can resolve the data from each of the plurality of data sources by resolving the employee data and the email data to unique employees. The efficiency indicator can indicate an efficiency level associated with an employee out of the unique employees.



FIG. 4 is a flowchart illustrating one embodiment of a process 400 for performing a quality reliability test for determining the reliability of data from one or more of a plurality of data sources. The process 400 may be implemented by one or more systems described with respect to FIGS. 1-2 and 8. For illustrative purposes, the process 400 is explained below in connection with the system 100 in FIG. 1. Certain details relating to the process 400 are explained in more detail with respect to FIGS. 1-3 and 5-8. Depending on the embodiment, the process 400 may include fewer or additional blocks, and the blocks may be performed in an order that is different than illustrated.


At block 401, the data analysis system 100 accesses information associated with a format of data from a data source. The information may specify the structure of data (e.g., number of columns, type of data for each column, etc.), expected size of the data, expected number of entries in the data, etc. For example, each data source (or set of data sources) may have a different format.


At block 402, the system 100 determines whether data from a data source is consistent with the expected format of data as indicated in the accessed data format information. For example, the system 100 can check if the structure of the data is consistent with the expected format. The system 100 can also check if the size of the data is similar to the expected size of the data.


At block 403, if data from a data source is not consistent with the expected format, size, or other expected characteristic, the system 100 identifies an inconsistency in the data from the data source. If the system 100 identifies any inconsistencies, the system 100 can output indications of the inconsistency in the data to the user. The system 100 may also attempt to obtain the data from the data source until the data no longer has inconsistencies.



FIG. 5 is a flow diagram illustrating examples of types of data that can be aggregated and analyzed for employee efficiency and/or productivity analysis. In one embodiment, the data analysis system 500 accepts email data 510, building/equipment access data 520, and/or human resources data 530. Based on the imported data, the data analysis system 500 can produce an employee productivity report 550. The employee productivity report 550 can be based on any combination of data from multiple data sources.


As explained above, the building/equipment access data 520 and human resources data 530 can be cleansed and aggregated to perform security-based analysis (e.g., are there any suspicious system logins or remote access). The building/equipment access data 520 and human resources data 530 can also be combined to perform efficiency analysis (e.g., what are the work hour patterns of employees and how efficient are these employees). In other embodiments, the email data 510 can be combined with human resources data 530 to perform efficiency analysis (e.g., how does employee email activity affect efficiency). An organization can aggregate relevant data that can provide answers to specific queries about the organization. Certain details relating to analysis of employee efficiency or email activity is explained in more detail with respect to FIGS. 1-4 and 6-7.


The employee productivity report 550 can provide a comparison of an employee to individuals who share common characteristics. Depending on the embodiment, the employee may be compared to individuals who have different characteristics (e.g., supervisors). The comparison can also be between a group to which an employee belongs and a group to which an employee does not belong.



FIG. 6 illustrates an example user interface 600 displaying an output of a data analysis system. The data analysis system can be similar to systems explained in connection with FIGS. 1-2 and 8. The user interface 600 shows an example of results from employee email analysis. As illustrated, the user interface 600 includes a list of top 10 senders 610, a list of top 10 recipients 620, a list of attachment count 630, and a list of top 10 domains 640.


The list of top 10 senders 610 can include top 10 employees of an organization who sent the most number of emails in a specific time period. The top 10 senders list 610 can show, for each employee in the list, the name of the employee, the email address of the employee, and the total number of emails sent by the employee. The time period or span for which the list 610 is generated can vary depending on the requirements of the organization. For instance, the list 610 may include top 10 senders for a specific day, week, month, etc.


The list of top 10 recipients 620 may be similar to the list of top 10 senders 610. The top 10 recipients list 620 can include top 10 employees of the organization who received the most number of emails in a specific time period. The top 10 recipients list 620 can show, for each employee in the list, the name of the employee, the email address of the employee, and the total number of emails received by the employee. The time period or span for which the top 10 recipients list 620 is generated can be the same as the time period or span for the top 10 senders list 610.


The list of attachment count 630 can list top employees who have sent or received the most number of attachments. The attachment list 630 can display the name of the employee and the total number of attachments. The attachment list 630 can provide an overview of employees who may potentially use a large percentage of storage resources due to sending and/or receiving of numerous attachments.


The list of top 10 domains 640 can show the list of common domains from which emails are sent to the employees of the organization or common domains to which the employees send emails. In the example of FIG. 6, the top domains list 640 lists “gmail.com” as the top domain, “yahoo.com” as the second domain, and so forth. Since employees can send many internal emails, the domain for the organization may not be included in the top domain list.


In this manner, the data analysis system can provide an analysis of certain aspects of employee behavior. The email activity data may be combined and/or aggregated with other types of data in order to examine relationships between employee email activity and other aspects of employee behavior. Such relationships may provide insights into factors that affect employee efficiency.



FIG. 7 illustrates another example user interface 700 displaying an output of a data analysis system. The data analysis system can be similar to systems explained in connection with FIGS. 1-2 and 8. The user interface 700 shows an example of results from employee loan processing analysis. As illustrated, the user interface 700 includes columns for the following information: employee name 710, employee ID 715, employee position/title 720, employee location 725, average badge-in time 730, average badge-out time 735, average number of processed jobs 740, employee efficiency 745, percentage of total emails sent to applicants 750, and average percentage of total emails sent to applicants for others with the same title 755.


Employee name 710 can refer to the name of an employee, and employee ID 715 can be an identifier that designates a particular employee. Position/title 720 can refer to an employee's position or title. The user interface 700 shows two different positions: loan processor and loan processing supervisor. The location 725 can refer to the office location of an employee. The user interface 700 shows three different locations: A, B, and C.


The average badge-in time 730 can refer to the average time an employee badges in to the office during a period of time. The average badge-out time 735 can refer to the average time an employee badges out of the office during a period of time. The average can be calculated based on badge-in or badge-out times over a specific period of time, such as several days, a week, several weeks, a month, etc.


The average number of processed jobs 740 may refer to the number of loan jobs an employee processed over a period of time. The period of time can be determined as appropriate by the organization (e.g., a week, several weeks, a month, etc.). The time period over which the number of jobs is averaged may match the time period used for determining average badge-in time and badge-out time.


The employee efficiency 745 may refer to the efficiency level or indicator associated with an employee. The values shown in user interface 700 are low, medium, and high, but the efficiency level can be defined as any metric or scale that the organization wants.


The percentage of total emails sent to applicants 750 may refer to the percentage of emails sent to loan applicants out of all of the emails sent by an employee. In the user interface 700, 80% of Jane Doe's emails are sent to loan applicants, while 95% of John Smith's emails are sent to loan applicants. John Doe sends only 50% of his emails to loan applicants, and Jane Smith sends 85% of her emails to loan applicants.


The average percentage of total emails sent to applicants for other with the same title 755 can refer to the average percentage for employees that have the same position/title. The data analysis system can provide a point of comparison with other employees with respect to a specific attribute or property. In the example of FIG. 7, the average percentage column provides a point of comparison for percentage of emails sent to loan applicants with respect to employees having the same title. The average percentage for the position of “loan processing supervisor” is 52%, and the average percentage for the position of “loan processor” is 87%. This column can provide a point of comparison with other employees that have the same title. For example, John Doe's percentage of emails sent to applicants is very low compared to the average percentage for all employees who are loan processors.


The user interface 700 also includes a drop-down menu or button 760 that allows the user to change the comparison group. In the example of FIG. 7, the comparison group is other employees that have the same title. The comparison group can be changed by selecting a different category from the options provided in the drop-down menu 760. For example, the user can change the comparison group to employees at the same location or employees at the same location with the same title. The options in the drop-down menu can be a list of item or checkboxes. Depending on the embodiment, multiple items or checkboxes can be selected or checked. The comparison group can be changed by the user as appropriate, and the content displayed in the user interface 700 can be updated accordingly. In some embodiments, the comparison group can have different attributes from an employee, or can be different from the group to which an employee belongs. For example, the comparison group can include employees who have a different position, employees from a different department, etc.


The efficiency level or indicator 745 can be based on any combination of data that may be available to the data analysis system. As explained above, an efficiency indicator can provide information relating to one or more aspects of an employee's efficiency. In one example, the efficiency level can be based on the average number of processed jobs and the time spent in the office during a particular period of time. In another example, the efficiency level can be based on a comparison with other employees. In FIG. 7, the percentage of emails sent to applicants for an employee is compared to the average percentage of emails sent to applicants for employees having the same title. The efficiency level may incorporate the comparison to others having the same title. In such case, the efficiency level for John Doe can be very low since his percentage of emails sent to applicants is far below the average percentage for employees with the same title.


Implementation Mechanisms


According to one embodiment, the techniques described herein are implemented by one or more special-purpose computing devices. The special-purpose computing devices may be hard-wired to perform the techniques, or may include circuitry or digital electronic devices such as one or more application-specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs) that are persistently programmed to perform the techniques, or may include one or more hardware processors programmed to perform the techniques pursuant to program instructions in firmware, memory, other storage, or a combination. Such special-purpose computing devices may also combine custom hard-wired logic, ASICs, or FPGAs with custom programming to accomplish the techniques. The special-purpose computing devices may be desktop computer systems, server computer systems, portable computer systems, handheld devices, networking devices or any other device or combination of devices that incorporate hard-wired and/or program logic to implement the techniques.


Computing device(s) are generally controlled and coordinated by operating system software, such as iOS, Android, Chrome OS, Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix, Linux, SunOS, Solaris, iOS, Blackberry OS, VxWorks, or other compatible operating systems. In other embodiments, the computing device may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface functionality, such as a graphical user interface (“GUI”), among other things.


For example, FIG. 8 is a block diagram that illustrates a computer system 1800 upon which an embodiment may be implemented. For example, the computing system 1800 may comprises a server system that accesses law enforcement data and provides user interface data to one or more users (e.g., executives) that allows those users to view their desired executive dashboards and interface with the data. Other computing systems discussed herein, such as the user (e.g., executive), may include any portion of the circuitry and/or functionality discussed with reference to system 1800.


Computer system 1800 includes a bus 1802 or other communication mechanism for communicating information, and a hardware processor, or multiple processors, 1804 coupled with bus 1802 for processing information. Hardware processor(s) 1804 may be, for example, one or more general purpose microprocessors.


Computer system 1800 also includes a main memory 1806, such as a random access memory (RAM), cache and/or other dynamic storage devices, coupled to bus 1802 for storing information and instructions to be executed by processor 1804. Main memory 1806 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 1804. Such instructions, when stored in storage media accessible to processor 1804, render computer system 1800 into a special-purpose machine that is customized to perform the operations specified in the instructions.


Computer system 1800 further includes a read only memory (ROM) 808 or other static storage device coupled to bus 1802 for storing static information and instructions for processor 1804. A storage device 1810, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 1802 for storing information and instructions.


Computer system 1800 may be coupled via bus 1802 to a display 1812, such as a cathode ray tube (CRT) or LCD display (or touch screen), for displaying information to a computer user. An input device 1814, including alphanumeric and other keys, is coupled to bus 1802 for communicating information and command selections to processor 1804. Another type of user input device is cursor control 1816, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 1804 and for controlling cursor movement on display 1812. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane. In some embodiments, the same direction information and command selections as cursor control may be implemented via receiving touches on a touch screen without a cursor.


Computing system 1800 may include a user interface module to implement a GUI that may be stored in a mass storage device as executable software codes that are executed by the computing device(s). This and other modules may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables.


In general, the word “module,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, Lua, C or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices may be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, magnetic disc, or any other tangible medium, or as a digital download (and may be originally stored in a compressed or installable format that requires installation, decompression or decryption prior to execution). Such software code may be stored, partially or fully, on a memory device of the executing computing device, for execution by the computing device. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules or computing device functionality described herein are preferably implemented as software modules, but may be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage


Computer system 1800 may implement the techniques described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the computer system causes or programs computer system 1800 to be a special-purpose machine. According to one embodiment, the techniques herein are performed by computer system 1800 in response to processor(s) 1804 executing one or more sequences of one or more instructions contained in main memory 1806. Such instructions may be read into main memory 1806 from another storage medium, such as storage device 1810. Execution of the sequences of instructions contained in main memory 1806 causes processor(s) 1804 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions.


The term “non-transitory media,” and similar terms, as used herein refers to any media that store data and/or instructions that cause a machine to operate in a specific fashion. Such non-transitory media may comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 1810. Volatile media includes dynamic memory, such as main memory 1806. Common forms of non-transitory media include, for example, a floppy disk, a flexible disk, hard disk, solid state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge, and networked versions of the same.


Non-transitory media is distinct from but may be used in conjunction with transmission media. Transmission media participates in transferring information between nontransitory media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 1802. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.


Various forms of media may be involved in carrying one or more sequences of one or more instructions to processor 1804 for execution. For example, the instructions may initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 1800 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 1802. Bus 1802 carries the data to main memory 1806, from which processor 1804 retrieves and executes the instructions. The instructions received by main memory 1806 may retrieves and executes the instructions. The instructions received by main memory 1806 may optionally be stored on storage device 1810 either before or after execution by processor 1804.


Computer system 1800 also includes a communication interface 1818 coupled to bus 1802. Communication interface 1818 provides a two-way data communication coupling to a network link 1820 that is connected to a local network 1822. For example, communication interface 1818 may be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 1818 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN (or WAN component to communicated with a WAN). Wireless links may also be implemented. In any such implementation, communication interface 1818 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.


Network link 1820 typically provides data communication through one or more networks to other data devices. For example, network link 1820 may provide a connection through local network 1822 to a host computer 1824 or to data equipment operated by an Internet Service Provider (ISP) 1826. ISP 1826 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 1828. Local network 1822 and Internet 1828 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 1820 and through communication interface 1818, which carry the digital data to and from computer system 1800, are example forms of transmission media.


Computer system 1800 can send messages and receive data, including program code, through the network(s), network link 1820 and communication interface 1818. In the Internet example, a server 1830 might transmit a requested code for an application program through Internet 1828, ISP 1826, local network 1822 and communication interface 1818.


The received code may be executed by processor 1804 as it is received, and/or stored in storage device 1810, or other non-volatile storage for later execution.


Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code modules executed by one or more computer systems or computer processors comprising computer hardware. The processes and algorithms may be implemented partially or wholly in application-specific circuitry.


The various features and processes described above may be used independently of one another, or may be combined in various ways. All possible combinations and subcombinations are intended to fall within the scope of this disclosure. In addition, certain method or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described blocks or states may be performed in an order other than that specifically disclosed, or multiple blocks or states may be combined in a single block or state. The example blocks or states may be performed in serial, in parallel, or in some other manner. Blocks or states may be added to or removed from the disclosed example embodiments. The example systems and components described herein may be configured differently than described. For example, elements may be added to, removed from, or rearranged compared to the disclosed example embodiments.


Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps 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 steps are included or are to be performed in any particular embodiment.


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 steps 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.


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. The foregoing description details certain embodiments of the invention. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the invention can be practiced in many ways. As is also stated above, it should be noted that the use of particular terminology when describing certain features or aspects of the invention should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the invention with which that terminology is associated. The scope of the invention should therefore be construed in accordance with the appended claims and any equivalents thereof.

Claims
  • 1. A computer system comprising: a hardware computer processor configured to execute code to cause the computer system to:access first data from a first data source, the first data source comprising electronic communication data;determine, for each of a plurality of electronic communications of the first data, an individual associated with the electronic communication;generate, for each individual, a summary of electronic communications associated with the individual;obtain second data from a second data source, the second data source comprising one or more logs of work activities, wherein the second data source is different from the first data source;determine, for each of a plurality of work activity logs of the second data, an individual associated with the work activity log;generate, for each individual, a second summary of work activity logs associated with the individual, wherein at least the summary of electronic communications and the second summary of work activity logs are each accessible by the computer system;determine, a first group of unique individuals each sharing a first common characteristic indicated in the second data and a second group of unique individuals each sharing a second common characteristic indicated in the second data;generate a first intermediate output aggregating summaries of electronic communications of individuals in the first group, wherein the intermediate output comprises a reduced version of at least some of the summaries of electronic communications;generate a second intermediate output aggregating summaries of electronic communications of individuals in the second group;determine a first efficiency indicator for the first group based at least in part on comparison of the first intermediate output associated with the first group and the second intermediate output associated with the second group,generate user interface data for displaying a user interface on a user computing device, the user interface including an indication of the first group, an indication of the second group, and the determined first efficiency indicator;receive, via input from the user interface, selection of a comparison characteristic;determine, a third group of unique individuals each sharing the comparison characteristic;generate a third intermediate output aggregating summaries of electronic communications of individuals in the third group;determine a second efficiency indicator for the first group based at least in part on comparison of the first intermediate output associated with the first group and the third intermediate output associated with the third group, andupdate the user interface data so that the user interface includes an indication of the first group, an indication of the third group and the determined second efficiency indicator.
  • 2. The computer system of claim 1, wherein the hardware computer processor is further configured to execute the code in order to cause the computer system to: access expected format information indicating an expected format of data from the first or second data source; anddetect an inconsistency in a format of the data from the first or second data source as compared to the expected format.
  • 3. The computer system of claim 2, wherein the hardware computer processor is further configured to execute the code in order to cause the computer system to: in response to the detection of the inconsistency, obtain the first or second data from the respective first or second data source such that the first or second data no longer has the inconsistency.
  • 4. The computer system of claim 2, wherein the hardware computer processor is further configured to execute the code in order to cause the computer system to: display, in the user interface, an indicator of the inconsistency.
  • 5. The computer system of claim 1, wherein the hardware computer processor is further configured to execute the code in order to cause the computer system to: determine a first file size for the first or second data;access a previous file size for a previous version of the first or second data;detect a discrepancy in size between the previous file size and the first file size; andin response to the detection of the discrepancy, obtain the first or second data from the respective first or second data source such that the first or second data no longer has the discrepancy.
  • 6. The computer system of claim 1, wherein the first common characteristic comprises: a badge swipe time within a timespan;a software version; ora number of email messages sent or received.
  • 7. A computer implement method comprising: accessing first data from a first data source, the first data source comprising electronic communication data; determining, for each of a plurality of electronic communications of the first data, an individual associated with the electronic communication; generating, for each individual, a summary of electronic communications associated with the individual; obtaining second data from a second data source, the second data source comprising one or more logs of work activities, wherein the second data source is different from the first data source; determining, for each of a plurality of work activity logs of the second data, an individual associated with the work activity log; generate, for each individual, a second summary of work activity logs associated with the individual, wherein at least the summary of electronic communications and the second summary of work activity logs are each accessible by the computer system;determining, a first group of unique individuals each sharing a first common characteristic indicated in the second data and a second group of unique individuals each sharing a second common characteristic indicated in the second data: generating a first intermediate output aggregating summaries of electronic communications of individuals in the first group, wherein the intermediate output comprises a reduced version of at least some of the summaries of electronic communications; generating a second intermediate output aggregating summaries of electronic communications of individuals in the second group; determining a first efficiency indicator for the first group based at least in part on comparison of the first intermediate output associated with the first group and the second intermediate output associated with the second group, generating user interface data for displaying a user interface on a user computing device, the user interface including an indication of the first group, an indication of the second group, and the determined first efficiency indicator; receiving, via input from the user interface, selection of a comparison characteristic; determining, a third group of unique individuals each sharing the comparison characteristic; generating a third intermediate output aggregating summaries of electronic communications of individuals in the third group; determining a second efficiency indicator for the first group based at least in part on comparison of the first intermediate output associated with the first group and the third intermediate output associated with the third group, and updating the user interface data so that the user interface includes an indication of the first group, an indication of the third group and the determined second efficiency indicator.
  • 8. A non-transitory computer readable medium storing software instructions configured to cause a computing system to: access first data from a first data source, the first data source comprising electronic communication data; determine, for each of a plurality of electronic communications of the first data, an individual associated with the electronic communication; generate, for each individual, a summary of electronic communications associated with the individual; obtain second data from a second data source, the second data source comprising one or more logs of work activities, wherein the second data source is different from the first data source; determine, for each of a plurality of work activity logs of the second data, an individual associated with the work activity log; generate, for each individual, a second summary of work activity logs associated with the individual, wherein at least the summary of electronic communications and the second summary of work activity logs are each accessible by the computer system;determine, a first group of unique individuals each sharing a first common characteristic indicated in the second data and a second group of unique individuals each sharing a second common characteristic indicated in the second data; generate a first intermediate output aggregating summaries of electronic communications of individuals in the first group, wherein the intermediate output comprises a reduced version of at least some of the summaries of electronic communications; generate a second intermediate output aggregating summaries of electronic communications of individuals in the second group; determine a first efficiency indicator for the first group based at least in part on comparison of the first intermediate output associated with the first group and the second intermediate output associated with the second group, generate user interface data for displaying a user interface on a user computing device, the user interface including an indication of the first group, an indication of the second group, and the determined first efficiency indicator; receive, via input from the user interface, selection of a comparison characteristic; determine, a third group of unique individuals each sharing the comparison characteristic; generate a third intermediate output aggregating summaries of electronic communications of individuals in the third group; determine a second efficiency indicator for the first group based at least in part on comparison of the first intermediate output associated with the first group and the third intermediate output associated with the third group, and update the user interface data so that the user interface includes an indication of the first group, an indication of the third group and the determined second efficiency indicator.
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. This application is a continuation of U.S. application Ser. No. 14/304,741, filed Jun. 13, 2014, which claims the benefit of U.S. Provisional Application No. 61/914,229, filed Dec. 10, 2013. Each of these applications are hereby incorporated by reference herein in their entireties.

US Referenced Citations (1152)
Number Name Date Kind
5109399 Thompson Apr 1992 A
5241625 Epard et al. Aug 1993 A
5329108 Lamoure Jul 1994 A
5412769 Maruoka et al. May 1995 A
5414838 Kolton et al. May 1995 A
5418950 Li et al. May 1995 A
5428737 Li et al. Jun 1995 A
5428776 Rothfield Jun 1995 A
5444819 Negishi Aug 1995 A
5454104 Steidlmayer et al. Sep 1995 A
5542089 Lindsay et al. Jul 1996 A
5568390 Hirota et al. Oct 1996 A
5608899 Li et al. Mar 1997 A
5613105 Xbikowski et al. Mar 1997 A
5632009 Rao et al. May 1997 A
5670987 Doi et al. Sep 1997 A
5701456 Jacopi et al. Dec 1997 A
5724575 Hoover et al. Mar 1998 A
5781704 Rossmo Jul 1998 A
5794228 French et al. Aug 1998 A
5794229 French et al. Aug 1998 A
5798769 Chiu et al. Aug 1998 A
5819226 Gopinathan et al. Oct 1998 A
5819238 Fernholz Oct 1998 A
5826021 Mastors et al. Oct 1998 A
5832218 Gibbs et al. Nov 1998 A
5845300 Comer Dec 1998 A
5845530 Brockmeyer et al. Dec 1998 A
5857329 Bingham Jan 1999 A
5872973 Mitchell et al. Feb 1999 A
5878434 Draper et al. Mar 1999 A
5892900 Ginter et al. Apr 1999 A
5897636 Kaeser Apr 1999 A
5902349 Endo et al. May 1999 A
5911138 Li et al. Jun 1999 A
5918225 White et al. Jun 1999 A
5966706 Biliris et al. Oct 1999 A
5999911 Berg et al. Dec 1999 A
6006242 Poole et al. Dec 1999 A
6012042 Black et al. Jan 2000 A
6057757 Arrowsmith et al. May 2000 A
6065026 Cornelia et al. May 2000 A
6072942 Stockwell et al. Jun 2000 A
6091956 Hollenberg Jul 2000 A
6094643 Anderson et al. Jul 2000 A
6104401 Parsons Aug 2000 A
6134582 Kennedy Oct 2000 A
6161098 Wallman Dec 2000 A
6189005 Chakrabarti et al. Feb 2001 B1
6208985 Krehel Mar 2001 B1
6219053 Tachibana et al. Apr 2001 B1
6232971 Haynes May 2001 B1
6236994 Swartz et al. May 2001 B1
6237138 Hameluck et al. May 2001 B1
6243706 Moreau et al. Jun 2001 B1
6243717 Gordon et al. Jun 2001 B1
6247019 Davies Jun 2001 B1
6279018 Kudrolli et al. Aug 2001 B1
6289334 Reiner et al. Sep 2001 B1
6289338 Stoffel et al. Sep 2001 B1
6311181 Lee et al. Oct 2001 B1
6313833 Knight Nov 2001 B1
6321274 Shakib et al. Nov 2001 B1
6341310 Leshem et al. Jan 2002 B1
6349315 Sonoyama et al. Feb 2002 B1
6366933 Ball et al. Apr 2002 B1
6369835 Lin Apr 2002 B1
6370538 Lamping et al. Apr 2002 B1
6430305 Decker Aug 2002 B1
6456997 Shukla Sep 2002 B1
6463404 Appleby Oct 2002 B1
6496774 Davies Dec 2002 B1
6496817 Whang et al. Dec 2002 B1
6513019 Lewis Jan 2003 B2
6519627 Dan et al. Feb 2003 B1
6523019 Borthwick Feb 2003 B1
6532449 Goertzel et al. Mar 2003 B1
6549944 Weinberg et al. Apr 2003 B1
6560620 Ching May 2003 B1
6581068 Bensoussan et al. Jun 2003 B1
6594672 Lampson et al. Jul 2003 B1
6608559 Lemelson et al. Aug 2003 B1
6631496 Li et al. Oct 2003 B1
6640231 Andersen et al. Oct 2003 B1
6642945 Sharpe Nov 2003 B1
6643613 McGee et al. Nov 2003 B2
6662202 Krusche et al. Dec 2003 B1
6665683 Meltzer Dec 2003 B1
6674434 Chojnacki et al. Jan 2004 B1
6714936 Nevin, III Mar 2004 B1
6745382 Zothner Jun 2004 B1
6748481 Parry et al. Jun 2004 B1
6775675 Nwabueze et al. Aug 2004 B1
6801201 Escher Oct 2004 B2
6820135 Dingman Nov 2004 B1
6828920 Owen et al. Dec 2004 B2
6839745 Dingari et al. Jan 2005 B1
6851108 Syme et al. Feb 2005 B1
6857120 Arnold et al. Feb 2005 B1
6876981 Berckmans Apr 2005 B1
6877137 Rivette et al. Apr 2005 B1
6907426 Hellerstein et al. Jun 2005 B2
6920453 Mannila et al. Jul 2005 B2
6944821 Bates et al. Sep 2005 B1
6976024 Chavez et al. Dec 2005 B1
6976210 Silva et al. Dec 2005 B1
6978419 Kantrowitz Dec 2005 B1
6980984 Huffman et al. Dec 2005 B1
6985950 Hanson et al. Jan 2006 B1
7028223 Kolawa et al. Apr 2006 B1
7036085 Barros Apr 2006 B2
7043449 Li et al. May 2006 B1
7043702 Chi et al. May 2006 B2
7055110 Kupka et al. May 2006 B2
7058648 Lightfoot et al. Jun 2006 B1
7085890 Kashyap Aug 2006 B2
7086028 Davis et al. Aug 2006 B1
7089541 Ungar Aug 2006 B2
7111231 Huck et al. Sep 2006 B1
7133409 Willardson Nov 2006 B1
7139800 Bellotti et al. Nov 2006 B2
7155728 Prabhu et al. Dec 2006 B1
7158878 Rasmussen et al. Jan 2007 B2
7162475 Ackerman Jan 2007 B2
7168039 Bertram Jan 2007 B2
7171427 Witowski et al. Jan 2007 B2
7174377 Bernard et al. Feb 2007 B2
7181423 Blanchard et al. Feb 2007 B2
7185065 Holtzman et al. Feb 2007 B1
7213030 Jenkins May 2007 B1
7216133 Wu et al. May 2007 B2
7216299 Knight May 2007 B2
7237192 Stephenson et al. Jun 2007 B1
7240330 Fairweather Jul 2007 B2
7246090 Thomas Jul 2007 B1
7269786 Malloy et al. Sep 2007 B1
7278105 Kitts Oct 2007 B1
7290698 Poslinski et al. Nov 2007 B2
7333998 Heckerman et al. Feb 2008 B2
7356504 Muller Apr 2008 B2
7370047 Gorman May 2008 B2
7379811 Rasmussen et al. May 2008 B2
7379903 Caballero et al. May 2008 B2
7392254 Jenkins Jun 2008 B1
7401038 Masuda Jul 2008 B2
7403921 Tanpoco et al. Jul 2008 B2
7403922 Lewis et al. Jul 2008 B1
7403942 Bayliss Jul 2008 B1
7406592 Polyudov Jul 2008 B1
7409357 Schaf et al. Aug 2008 B2
7426654 Adams et al. Sep 2008 B2
7437728 Stackhouse et al. Oct 2008 B2
7441182 Beilinson et al. Oct 2008 B2
7454466 Bellotti et al. Nov 2008 B2
7461158 Rider et al. Dec 2008 B2
7467375 Tondreau et al. Dec 2008 B2
7469238 Satchwell Dec 2008 B2
7487139 Fraleigh et al. Feb 2009 B2
7502786 Liu et al. Mar 2009 B2
7519589 Charnock et al. Apr 2009 B2
7525422 Bishop et al. Apr 2009 B2
7529727 Arning et al. May 2009 B2
7529734 Dirisala May 2009 B2
7533069 Fairweather May 2009 B2
7542934 Markel Jun 2009 B2
7546245 Surpin et al. Jun 2009 B2
7546353 Hesselink et al. Jun 2009 B2
7558677 Jones Jul 2009 B2
7574409 Patinkin Aug 2009 B2
7574428 Leiserowitz et al. Aug 2009 B2
7579965 Bucholz Aug 2009 B2
7587352 Arnott Sep 2009 B2
7590582 Dunne Sep 2009 B2
7596285 Brown et al. Sep 2009 B2
7603229 Goldberg et al. Oct 2009 B2
7610290 Kruy et al. Oct 2009 B2
7614006 Molander Nov 2009 B2
7617232 Gabbert et al. Nov 2009 B2
7620582 Masuda Nov 2009 B2
7620628 Kapur et al. Nov 2009 B2
7627489 Schaeffer et al. Dec 2009 B2
7627812 Chamberlain et al. Dec 2009 B2
7630931 Rachev et al. Dec 2009 B1
7634717 Chamberlain et al. Dec 2009 B2
7640173 Surpin et al. Dec 2009 B2
7657478 De Diego Feb 2010 B2
7685042 Monroe et al. Mar 2010 B1
7685083 Fairweather Mar 2010 B2
7703021 Flam Apr 2010 B1
7706817 Bamrah et al. Apr 2010 B2
7712049 Williams et al. May 2010 B2
7716067 Surpin et al. May 2010 B2
7716077 Mikurak May 2010 B1
7716227 Hao et al. May 2010 B1
7725530 Sah et al. May 2010 B2
7725547 Albertson et al. May 2010 B2
7725728 Ama et al. May 2010 B2
7730082 Sah et al. Jun 2010 B2
7730109 Rohrs et al. Jun 2010 B2
7756843 Palmer Jul 2010 B1
7757220 Griffith et al. Jul 2010 B2
7770100 Chamberlain et al. Aug 2010 B2
7783679 Bley Aug 2010 B2
7805457 Viola et al. Sep 2010 B1
7809703 Balabhadrapatruni et al. Oct 2010 B2
7818291 Ferguson et al. Oct 2010 B2
7818658 Chen Oct 2010 B2
7835966 Satchwell Nov 2010 B2
7848995 Dalal Dec 2010 B2
7853573 Warner et al. Dec 2010 B2
7870493 Pall et al. Jan 2011 B2
7877421 Berger et al. Jan 2011 B2
7880921 Dattilo et al. Feb 2011 B2
7894984 Rasmussen et al. Feb 2011 B2
7899611 Downs et al. Mar 2011 B2
7904913 Sim-Tang et al. Mar 2011 B2
7908521 Sridharan et al. Mar 2011 B2
7912842 Bayliss Mar 2011 B1
7917376 Bellin et al. Mar 2011 B2
7920963 Jouline et al. Apr 2011 B2
7933862 Chamberlain et al. Apr 2011 B2
7941321 Greenstein et al. May 2011 B2
7958147 Turner et al. Jun 2011 B1
7962281 Rasmussen et al. Jun 2011 B2
7962495 Jain et al. Jun 2011 B2
7962848 Bertram Jun 2011 B2
7970240 Chao et al. Jun 2011 B1
7971150 Raskutti et al. Jun 2011 B2
7984374 Caro et al. Jun 2011 B2
7979424 Dettinger et al. Jul 2011 B2
8001465 Kudrolli et al. Aug 2011 B2
8001482 Bhattiprolu et al. Aug 2011 B2
8010507 Poston et al. Aug 2011 B2
8010545 Stefik et al. Aug 2011 B2
8015487 Roy et al. Sep 2011 B2
8024778 Cash et al. Sep 2011 B2
8036632 Cona et al. Oct 2011 B1
8036971 Aymeloglu et al. Oct 2011 B2
8041714 Aymeloglu et al. Oct 2011 B2
8042110 Kawahara et al. Oct 2011 B1
8046283 Burns Oct 2011 B2
8054756 Chand et al. Nov 2011 B2
8060421 Wang Nov 2011 B1
8065606 Gralnick et al. Nov 2011 B1
8073857 Sreekanth Dec 2011 B2
8082172 Chao et al. Dec 2011 B2
8103543 Zwicky Jan 2012 B1
8103962 Embley et al. Jan 2012 B2
8108138 Bruce et al. Jan 2012 B2
8112425 Baum et al. Feb 2012 B2
8117022 Linker Feb 2012 B2
8126848 Wagner Feb 2012 B2
8134457 Velipasalar et al. Mar 2012 B2
8145703 Frishert et al. Mar 2012 B2
8185819 Sah et al. May 2012 B2
8214361 Sandler et al. Jul 2012 B1
8214490 Vos et al. Jul 2012 B1
8214764 Gemmell et al. Jul 2012 B2
8225201 Michael Jul 2012 B2
8229902 Vishniac et al. Jul 2012 B2
8229947 Fujinaga Jul 2012 B2
8230333 Decherd et al. Jul 2012 B2
8271461 Pike et al. Sep 2012 B2
8280880 Aymeloglu et al. Oct 2012 B1
8290838 Thakur et al. Oct 2012 B1
8290926 Ozzie et al. Oct 2012 B2
8290942 Jones et al. Oct 2012 B2
8301464 Cave et al. Oct 2012 B1
8301904 Gryaznov Oct 2012 B1
8302855 Ma et al. Nov 2012 B2
8312367 Foster Nov 2012 B2
8312546 Alme Nov 2012 B2
8326727 Aymeloglu et al. Dec 2012 B2
8352174 Milstein et al. Jan 2013 B2
8352881 Champion et al. Jan 2013 B2
8364642 Garrod Jan 2013 B1
8368695 Howell et al. Feb 2013 B2
8397171 Klassen et al. Mar 2013 B2
8412707 Mianji Apr 2013 B1
8417409 Bast et al. Apr 2013 B2
8417715 Bruckhaus et al. Apr 2013 B1
8429194 Aymeloglu et al. Apr 2013 B2
8429527 Arbogast Apr 2013 B1
8433702 Carrino et al. Apr 2013 B1
8433703 Schneider et al. Apr 2013 B1
8447722 Ahuja et al. May 2013 B1
8452790 Mianji May 2013 B1
8463036 Ramesh et al. Jun 2013 B1
8473454 Evanitsky et al. Jun 2013 B2
8484115 Aymeloglu et al. Jul 2013 B2
8484549 Burr et al. Jul 2013 B2
8489331 Kopf et al. Jul 2013 B2
8489641 Seefeld et al. Jul 2013 B1
8494941 Aymeloglu et al. Jul 2013 B2
8498984 Hwang et al. Jul 2013 B1
8499287 Shafi et al. Jul 2013 B2
8510743 Hackborn et al. Aug 2013 B2
8514082 Cova et al. Aug 2013 B2
8515207 Chau Aug 2013 B2
8554579 Tribble et al. Oct 2013 B2
8554653 Falkenborg et al. Oct 2013 B2
8554709 Goodson et al. Oct 2013 B2
8554719 McGrew Oct 2013 B2
8560413 Quarterman Oct 2013 B1
8560494 Downing Oct 2013 B1
8577911 Stepinski et al. Nov 2013 B1
8589273 Creeden et al. Nov 2013 B2
8595234 Siripuapu et al. Nov 2013 B2
8600872 Yan Dec 2013 B1
8601326 Kirn Dec 2013 B1
8620641 Farnsworth et al. Dec 2013 B2
8639552 Chen Jan 2014 B1
8639757 Zang et al. Jan 2014 B1
8645332 Cohen Feb 2014 B1
8646080 Williamson et al. Feb 2014 B2
8666861 Li et al. Mar 2014 B2
8676857 Adams et al. Mar 2014 B1
8688573 Ruknoic et al. Apr 2014 B1
8689108 Duffield et al. Apr 2014 B1
8713467 Goldenberg et al. Apr 2014 B1
8726379 Stiansen et al. May 2014 B1
8732574 Burr et al. May 2014 B2
8739278 Varghese May 2014 B2
8742934 Sarpy et al. Jun 2014 B1
8744890 Bernier Jun 2014 B1
8745516 Mason et al. Jun 2014 B2
8763078 Castellucci et al. Jun 2014 B1
8781169 Jackson et al. Jul 2014 B2
8786605 Curtis et al. Jul 2014 B1
8787939 Papakipos et al. Jul 2014 B2
8788407 Singh et al. Jul 2014 B1
8798354 Bunzel et al. Aug 2014 B1
8799799 Cervelli et al. Aug 2014 B1
8799867 Peri-Glass et al. Aug 2014 B1
8812960 Sun et al. Aug 2014 B1
8830322 Nerayoff et al. Sep 2014 B2
8832594 Thompson et al. Sep 2014 B1
8868537 Colgrove et al. Oct 2014 B1
8903717 Elliot Dec 2014 B2
8909597 Aymeloglu et al. Dec 2014 B2
8909656 Kumar et al. Dec 2014 B2
8917274 Ma et al. Dec 2014 B2
8924388 Elliot et al. Dec 2014 B2
8924389 Elliot et al. Dec 2014 B2
8924429 Fisher et al. Dec 2014 B1
8924872 Bogomolov et al. Dec 2014 B1
8935201 Fisher et al. Jan 2015 B1
8937619 Sharma et al. Jan 2015 B2
8938686 Erenrich et al. Jan 2015 B1
8949164 Mohler Feb 2015 B1
8984390 Aymeloglu et al. Mar 2015 B2
9009171 Grossman et al. Apr 2015 B1
9009827 Albertson et al. Apr 2015 B1
9021260 Falk et al. Apr 2015 B1
9021384 Beard et al. Apr 2015 B1
9031981 Potter et al. May 2015 B1
9032531 Scorvo et al. May 2015 B1
9043696 Meiklejohn et al. May 2015 B1
9043894 Dennison et al. May 2015 B1
9092482 Harris et al. Jul 2015 B2
9100428 Visbal Aug 2015 B1
9105000 White et al. Aug 2015 B1
9116975 Shankar et al. Aug 2015 B2
9129219 Robertson et al. Sep 2015 B1
9229966 Aymeloglu et al. Jan 2016 B2
9280532 Cicerone Mar 2016 B2
9292388 Fisher et al. Mar 2016 B2
9330120 Colgrove et al. May 2016 B2
9348677 Marinelli, III et al. May 2016 B2
9367463 Biswal et al. Jun 2016 B2
9378524 Aymeloglu et al. Jun 2016 B2
9449074 Fisher et al. Sep 2016 B1
9852205 Tamayo Dec 2017 B2
9880987 Burr et al. Jan 2018 B2
9898335 Marinelli, III Feb 2018 B1
20010011243 Dembo et al. Aug 2001 A1
20010021936 Bertram Sep 2001 A1
20010027424 Torigoe Oct 2001 A1
20020007329 Alcaly et al. Jan 2002 A1
20020007331 Lo et al. Jan 2002 A1
20020026404 Thompson Feb 2002 A1
20020030701 Knight Mar 2002 A1
20020032677 Morgenthaler et al. Mar 2002 A1
20020033848 Sciammarella et al. Mar 2002 A1
20020035590 Eibach et al. Mar 2002 A1
20020040336 Blanchard et al. Apr 2002 A1
20020059126 Ricciardi May 2002 A1
20020065708 Senay et al. May 2002 A1
20020087570 Jacquez et al. Jul 2002 A1
20020091707 Keller Jul 2002 A1
20020095360 Joao Jul 2002 A1
20020095658 Shulman Jul 2002 A1
20020099870 Miller et al. Jul 2002 A1
20020103705 Brady Aug 2002 A1
20020116120 Ruiz et al. Aug 2002 A1
20020130907 Chi et al. Sep 2002 A1
20020138383 Rhee Sep 2002 A1
20020147671 Sloan et al. Oct 2002 A1
20020156812 Krasnoiarov et al. Oct 2002 A1
20020174201 Ramer et al. Nov 2002 A1
20020184111 Swanson Dec 2002 A1
20020194119 Wright et al. Dec 2002 A1
20030004770 Miller et al. Jan 2003 A1
20030009392 Perkowski Jan 2003 A1
20030009399 Boerner Jan 2003 A1
20030023620 Trotta Jan 2003 A1
20030028560 Kudrolli et al. Feb 2003 A1
20030039948 Donahue Feb 2003 A1
20030065605 Gatto Apr 2003 A1
20030065606 Satchwell Apr 2003 A1
20030065607 Satchwell Apr 2003 A1
20030078827 Hoffman Apr 2003 A1
20030093401 Czahkowski et al. May 2003 A1
20030093755 O'Carroll May 2003 A1
20030105759 Bess et al. Jun 2003 A1
20030105833 Daniels Jun 2003 A1
20030115481 Baird et al. Jun 2003 A1
20030126102 Borthwick Jul 2003 A1
20030130996 Bayerl et al. Jul 2003 A1
20030140106 Raguseo Jul 2003 A1
20030144868 MacIntyre et al. Jul 2003 A1
20030163352 Surpin et al. Aug 2003 A1
20030167423 Murakami Sep 2003 A1
20030172021 Huang Sep 2003 A1
20030172053 Fairweather Sep 2003 A1
20030177112 Gardner Sep 2003 A1
20030182177 Gallagher Sep 2003 A1
20030182313 Federwisch et al. Sep 2003 A1
20030184588 Lee Oct 2003 A1
20030187761 Olsen et al. Oct 2003 A1
20030200217 Ackerman Oct 2003 A1
20030212670 Yalamanchi et al. Nov 2003 A1
20030212718 Tester Nov 2003 A1
20030225755 Iwayama et al. Dec 2003 A1
20030229848 Arend et al. Dec 2003 A1
20040003009 Wilmot Jan 2004 A1
20040006523 Coker Jan 2004 A1
20040032432 Baynger Feb 2004 A1
20040034570 Davis Feb 2004 A1
20040044648 Anfindsen et al. Mar 2004 A1
20040064256 Barinek et al. Apr 2004 A1
20040083466 Dapp et al. Apr 2004 A1
20040085318 Hassler et al. May 2004 A1
20040088177 Travis et al. May 2004 A1
20040095349 Bito et al. May 2004 A1
20040098731 Demsey et al. May 2004 A1
20040103088 Cragun et al. May 2004 A1
20040103124 Kupkova May 2004 A1
20040111410 Burgoon et al. Jun 2004 A1
20040111480 Yue Jun 2004 A1
20040117387 Civetta et al. Jun 2004 A1
20040126840 Cheng et al. Jul 2004 A1
20040133500 Thompson et al. Jul 2004 A1
20040139212 Mukherjee et al. Jul 2004 A1
20040143602 Ruiz et al. Jul 2004 A1
20040143796 Lerner et al. Jul 2004 A1
20040153418 Hanweck Aug 2004 A1
20040153451 Phillips et al. Aug 2004 A1
20040153837 Preston et al. Aug 2004 A1
20040163039 Gorman Aug 2004 A1
20040181554 Heckerman et al. Sep 2004 A1
20040193599 Liu et al. Sep 2004 A1
20040193600 Kaasten et al. Sep 2004 A1
20040193608 Gollapudi et al. Sep 2004 A1
20040205492 Newsome Oct 2004 A1
20040205644 Shaughnessy et al. Oct 2004 A1
20040210763 Jonas Oct 2004 A1
20040221223 Yu et al. Nov 2004 A1
20040236688 Bozeman Nov 2004 A1
20040254658 Sherriff et al. Dec 2004 A1
20040260702 Cragun et al. Dec 2004 A1
20040267746 Marcjan et al. Dec 2004 A1
20050004911 Goldberg et al. Jan 2005 A1
20050010472 Quatse et al. Jan 2005 A1
20050021397 Cui et al. Jan 2005 A1
20050021877 Varpela et al. Jan 2005 A1
20050027632 Zeitoun et al. Feb 2005 A1
20050027705 Sadri et al. Feb 2005 A1
20050028094 Allyn Feb 2005 A1
20050039116 Slack-Smith Feb 2005 A1
20050039119 Parks et al. Feb 2005 A1
20050060712 Miller et al. Mar 2005 A1
20050060713 Miller et al. Mar 2005 A1
20050065811 Chu et al. Mar 2005 A1
20050075962 Dunne Apr 2005 A1
20050075966 Duka Apr 2005 A1
20050080769 Gemmell Apr 2005 A1
20050086207 Heuer et al. Apr 2005 A1
20050090911 Ingargiola et al. Apr 2005 A1
20050091186 Elish Apr 2005 A1
20050097441 Herbach et al. May 2005 A1
20050108001 Aarskog May 2005 A1
20050120080 Weinreb et al. Jun 2005 A1
20050125715 Di Franco et al. Jun 2005 A1
20050131935 O'Leary et al. Jun 2005 A1
20050133588 Williams Jun 2005 A1
20050149455 Bruesewitz et al. Jul 2005 A1
20050154628 Eckart et al. Jul 2005 A1
20050154769 Eckart et al. Jul 2005 A1
20050162523 Darrell et al. Jul 2005 A1
20050166144 Gross Jul 2005 A1
20050171881 Ghassemieh et al. Aug 2005 A1
20050180330 Shapiro Aug 2005 A1
20050182709 Belcsak et al. Aug 2005 A1
20050182793 Keenan et al. Aug 2005 A1
20050183005 Denoue et al. Aug 2005 A1
20050210409 Jou Sep 2005 A1
20050226473 Ramesh Oct 2005 A1
20050246327 Yeung et al. Nov 2005 A1
20050251786 Citron et al. Nov 2005 A1
20050256703 Markel Nov 2005 A1
20050262004 Sakata et al. Nov 2005 A1
20050262057 Lesh et al. Nov 2005 A1
20050262493 Schmidt et al. Nov 2005 A1
20050262512 Schmidt et al. Nov 2005 A1
20050278286 Djugash et al. Dec 2005 A1
20060004740 Dettinger et al. Jan 2006 A1
20060010130 Leff et al. Jan 2006 A1
20060020398 Vernon et al. Jan 2006 A1
20060026120 Carolan et al. Feb 2006 A1
20060026170 Kreitler et al. Feb 2006 A1
20060026561 Bauman et al. Feb 2006 A1
20060031779 Theurer et al. Feb 2006 A1
20060045470 Poslinski et al. Mar 2006 A1
20060047590 Anderson et al. Mar 2006 A1
20060052984 Nakadate et al. Mar 2006 A1
20060053097 King et al. Mar 2006 A1
20060053170 Hill et al. Mar 2006 A1
20060059072 Boglaev Mar 2006 A1
20060059139 Robinson Mar 2006 A1
20060059423 Lehmann et al. Mar 2006 A1
20060064181 Kato Mar 2006 A1
20060070046 Balakrishnan et al. Mar 2006 A1
20060074730 Shukla et al. Apr 2006 A1
20060074866 Chamberlain et al. Apr 2006 A1
20060074881 Vembu et al. Apr 2006 A1
20060074967 Shaburov Apr 2006 A1
20060080316 Gilmore et al. Apr 2006 A1
20060080616 Vogel et al. Apr 2006 A1
20060080619 Carlson et al. Apr 2006 A1
20060093222 Saffer et al. May 2006 A1
20060116943 Willain Jun 2006 A1
20060116991 Calderwood Jun 2006 A1
20060129746 Porter Jun 2006 A1
20060129992 Oberholtzer et al. Jun 2006 A1
20060136513 Ngo et al. Jun 2006 A1
20060139375 Rasmussen et al. Jun 2006 A1
20060142949 Helt Jun 2006 A1
20060143034 Rothermel Jun 2006 A1
20060143075 Carr et al. Jun 2006 A1
20060143079 Basak et al. Jun 2006 A1
20060149596 Surpin et al. Jul 2006 A1
20060155654 Plessis et al. Jul 2006 A1
20060203337 White Sep 2006 A1
20060209085 Wong et al. Sep 2006 A1
20060218206 Bourbonnais et al. Sep 2006 A1
20060218405 Ama et al. Sep 2006 A1
20060218491 Grossman et al. Sep 2006 A1
20060218637 Thomas et al. Sep 2006 A1
20060224356 Castelli et al. Oct 2006 A1
20060235786 DiSalvo Oct 2006 A1
20060241856 Cobleigh et al. Oct 2006 A1
20060241974 Chao et al. Oct 2006 A1
20060242040 Rader Oct 2006 A1
20060242630 Koike et al. Oct 2006 A1
20060253502 Raman et al. Nov 2006 A1
20060259524 Horton Nov 2006 A1
20060265311 Dean et al. Nov 2006 A1
20060265397 Bryan et al. Nov 2006 A1
20060265417 Amato et al. Nov 2006 A1
20060271277 Hu et al. Nov 2006 A1
20060271838 Carro Nov 2006 A1
20060271884 Hurst Nov 2006 A1
20060277460 Forstall et al. Dec 2006 A1
20060279630 Aggarwal et al. Dec 2006 A1
20060288046 Gupta et al. Dec 2006 A1
20070000999 Kubo et al. Jan 2007 A1
20070005582 Navratil et al. Jan 2007 A1
20070011150 Frank Jan 2007 A1
20070011304 Error Jan 2007 A1
20070016363 Huang et al. Jan 2007 A1
20070027851 Kruy et al. Feb 2007 A1
20070038646 Thota Feb 2007 A1
20070038962 Fuchs et al. Feb 2007 A1
20070043686 Teng et al. Feb 2007 A1
20070055598 Arnott et al. Mar 2007 A1
20070055599 Arnott Mar 2007 A1
20070057966 Ohno et al. Mar 2007 A1
20070061259 Zoldi et al. Mar 2007 A1
20070061752 Cory Mar 2007 A1
20070067233 Dalal Mar 2007 A1
20070067285 Blume Mar 2007 A1
20070078832 Ott et al. Apr 2007 A1
20070083541 Fraleigh et al. Apr 2007 A1
20070088596 Berkelhamer et al. Apr 2007 A1
20070091868 Hollman et al. Apr 2007 A1
20070094248 McVeigh et al. Apr 2007 A1
20070094312 Sim-Tang Apr 2007 A1
20070094389 Nussey et al. Apr 2007 A1
20070106582 Baker et al. May 2007 A1
20070112714 Fairweather May 2007 A1
20070113164 Hansen et al. May 2007 A1
20070118527 Winje et al. May 2007 A1
20070136115 Doganaksoy et al. Jun 2007 A1
20070150369 Zivin Jun 2007 A1
20070150801 Chidlovskii et al. Jun 2007 A1
20070150805 Misovski Jun 2007 A1
20070156673 Maga Jul 2007 A1
20070168269 Chuo Jul 2007 A1
20070168270 De Diego Arozamena et al. Jul 2007 A1
20070168336 Ransil et al. Jul 2007 A1
20070168871 Jenkins Jul 2007 A1
20070174760 Chamberlain et al. Jul 2007 A1
20070178501 Rabinowitz et al. Aug 2007 A1
20070185867 Maga Aug 2007 A1
20070192265 Chopin et al. Aug 2007 A1
20070192281 Cradick et al. Aug 2007 A1
20070198571 Ferguson et al. Aug 2007 A1
20070208497 Downs et al. Sep 2007 A1
20070208498 Barker et al. Sep 2007 A1
20070208736 Tanigawa et al. Sep 2007 A1
20070219882 May Sep 2007 A1
20070220604 Long Sep 2007 A1
20070226617 Traub et al. Sep 2007 A1
20070233709 Abnous Oct 2007 A1
20070233756 D'Souza et al. Oct 2007 A1
20070239606 Eisen Oct 2007 A1
20070240062 Christena et al. Oct 2007 A1
20070245339 Bauman et al. Oct 2007 A1
20070260582 Liang Nov 2007 A1
20070266336 Nojima et al. Nov 2007 A1
20070271317 Carmel Nov 2007 A1
20070282951 Selimis et al. Dec 2007 A1
20070284433 Domenica et al. Dec 2007 A1
20070294643 Kyle Dec 2007 A1
20070299697 Friedlander et al. Dec 2007 A1
20080005063 Seeds Jan 2008 A1
20080010440 Altman et al. Jan 2008 A1
20080015920 Fawls et al. Jan 2008 A1
20080016155 Khalatian Jan 2008 A1
20080016216 Worley et al. Jan 2008 A1
20080040250 Salter Feb 2008 A1
20080040684 Crump Feb 2008 A1
20080046481 Gould et al. Feb 2008 A1
20080046803 Beauchamp et al. Feb 2008 A1
20080051989 Welsh Feb 2008 A1
20080052142 Bailey et al. Feb 2008 A1
20080069081 Chand et al. Mar 2008 A1
20080077597 Butler Mar 2008 A1
20080077642 Carbone et al. Mar 2008 A1
20080082486 Lermant et al. Apr 2008 A1
20080091693 Murthy Apr 2008 A1
20080097816 Freire et al. Apr 2008 A1
20080103798 Domenikos et al. May 2008 A1
20080103996 Forman et al. May 2008 A1
20080104019 Nath May 2008 A1
20080104407 Horne et al. May 2008 A1
20080109714 Kumar et al. May 2008 A1
20080126344 Hoffman et al. May 2008 A1
20080126951 Sood et al. May 2008 A1
20080133310 Kim et al. Jun 2008 A1
20080140387 Linker Jun 2008 A1
20080140576 Lewis et al. Jun 2008 A1
20080148398 Mezack et al. Jun 2008 A1
20080155440 Trevor et al. Jun 2008 A1
20080162616 Gross et al. Jul 2008 A1
20080172607 Baer Jul 2008 A1
20080177782 Poston et al. Jul 2008 A1
20080177994 Mayer Jul 2008 A1
20080183639 DiSalvo Jul 2008 A1
20080195417 Surpin et al. Aug 2008 A1
20080195608 Clover Aug 2008 A1
20080195672 Hamel et al. Aug 2008 A1
20080196016 Todd Aug 2008 A1
20080201313 Dettinger et al. Aug 2008 A1
20080208820 Usey et al. Aug 2008 A1
20080215543 Huang et al. Sep 2008 A1
20080215546 Baum et al. Sep 2008 A1
20080222295 Robinson et al. Sep 2008 A1
20080228467 Womack et al. Sep 2008 A1
20080243711 Aymeloglu et al. Oct 2008 A1
20080243799 Rozich et al. Oct 2008 A1
20080249845 Aronowich et al. Oct 2008 A1
20080249957 Masuyama et al. Oct 2008 A1
20080255973 El Wade et al. Oct 2008 A1
20080263468 Cappione et al. Oct 2008 A1
20080267107 Rosenberg Oct 2008 A1
20080267386 Cooper Oct 2008 A1
20080270316 Guidotti et al. Oct 2008 A1
20080276167 Michael Nov 2008 A1
20080278311 Grange et al. Nov 2008 A1
20080281580 Zabokritski Nov 2008 A1
20080288306 MacIntyre et al. Nov 2008 A1
20080288471 Wu et al. Nov 2008 A1
20080301042 Patzer Dec 2008 A1
20080301559 Martinsen et al. Dec 2008 A1
20080301643 Appleton et al. Dec 2008 A1
20080313132 Hao et al. Dec 2008 A1
20080313243 Poston et al. Dec 2008 A1
20080313281 Scheidl et al. Dec 2008 A1
20090002492 Velipasalar et al. Jan 2009 A1
20090006150 Prigge et al. Jan 2009 A1
20090006271 Crowder Jan 2009 A1
20090007056 Prigge et al. Jan 2009 A1
20090018996 Hunt et al. Jan 2009 A1
20090027418 Maru et al. Jan 2009 A1
20090030915 Winter et al. Jan 2009 A1
20090031401 Cudich et al. Jan 2009 A1
20090037912 Stoitsev et al. Feb 2009 A1
20090043762 Shiverick et al. Feb 2009 A1
20090055251 Shah et al. Feb 2009 A1
20090055487 Moraes et al. Feb 2009 A1
20090076845 Bellin et al. Mar 2009 A1
20090083275 Jacob et al. Mar 2009 A1
20090088964 Schaaf et al. Apr 2009 A1
20090089651 Herberger et al. Apr 2009 A1
20090094166 Aymeloglu et al. Apr 2009 A1
20090094217 Dettinger et al. Apr 2009 A1
20090106178 Chu Apr 2009 A1
20090106242 McGrew Apr 2009 A1
20090106305 Murakami Apr 2009 A1
20090106308 Killian et al. Apr 2009 A1
20090112678 Luzardo Apr 2009 A1
20090112745 Stefanescu Apr 2009 A1
20090112922 Barinaga Apr 2009 A1
20090119309 Gibson et al. May 2009 A1
20090125359 Knapic May 2009 A1
20090125369 Kloosstra et al. May 2009 A1
20090125459 Norton et al. May 2009 A1
20090132921 Hwangbo et al. May 2009 A1
20090132953 Reed et al. May 2009 A1
20090138307 Belcsak et al. May 2009 A1
20090143052 Bates et al. Jun 2009 A1
20090144262 White et al. Jun 2009 A1
20090144274 Fraleigh et al. Jun 2009 A1
20090144747 Baker Jun 2009 A1
20090150868 Chakra et al. Jun 2009 A1
20090161147 Klave Jun 2009 A1
20090164387 Armstrong et al. Jun 2009 A1
20090164934 Bhattiprolu et al. Jun 2009 A1
20090171939 Athsani et al. Jul 2009 A1
20090172511 Decherd et al. Jul 2009 A1
20090172674 Bobak et al. Jul 2009 A1
20090172821 Daira et al. Jul 2009 A1
20090177962 Gusmorino et al. Jul 2009 A1
20090179892 Tsuda et al. Jul 2009 A1
20090187464 Bai et al. Jul 2009 A1
20090187546 Whyte et al. Jul 2009 A1
20090187548 Ji et al. Jul 2009 A1
20090187556 Ross et al. Jul 2009 A1
20090193012 Williams Jul 2009 A1
20090193050 Olson Jul 2009 A1
20090199047 Vaitheeswaran et al. Aug 2009 A1
20090199106 Jonsson et al. Aug 2009 A1
20090222400 Kupershmidt et al. Sep 2009 A1
20090222759 Drieschner Sep 2009 A1
20090222760 Halverson et al. Sep 2009 A1
20090228365 Tomchek et al. Sep 2009 A1
20090228507 Jain et al. Sep 2009 A1
20090234720 George et al. Sep 2009 A1
20090248721 Burton et al. Oct 2009 A1
20090248757 Havewala et al. Oct 2009 A1
20090249244 Robinson et al. Oct 2009 A1
20090254970 Agarwal et al. Oct 2009 A1
20090271343 Vaiciulis et al. Oct 2009 A1
20090281839 Lynn et al. Nov 2009 A1
20090282068 Shockro et al. Nov 2009 A1
20090287470 Farnsworth et al. Nov 2009 A1
20090292626 Oxford Nov 2009 A1
20090299830 West et al. Dec 2009 A1
20090307049 Elliott et al. Dec 2009 A1
20090313250 Folting et al. Dec 2009 A1
20090313311 Hoffmann et al. Dec 2009 A1
20090313463 Pang et al. Dec 2009 A1
20090319418 Herz Dec 2009 A1
20090319891 MacKinlay Dec 2009 A1
20090319996 Shafi et al. Dec 2009 A1
20090327157 Dunne Dec 2009 A1
20100011282 Dollard et al. Jan 2010 A1
20100030722 Goodson et al. Feb 2010 A1
20100031141 Summers et al. Feb 2010 A1
20100042922 Bradateanu et al. Feb 2010 A1
20100057600 Johansen et al. Mar 2010 A1
20100057622 Faith et al. Mar 2010 A1
20100057716 Stefik et al. Mar 2010 A1
20100070426 Aymeloglu et al. Mar 2010 A1
20100070427 Aymeloglu et al. Mar 2010 A1
20100070464 Aymeloglu et al. Mar 2010 A1
20100070489 Aymeloglu et al. Mar 2010 A1
20100070523 Delgo et al. Mar 2010 A1
20100070531 Aymeloglu et al. Mar 2010 A1
20100070842 Aymeloglu et al. Mar 2010 A1
20100070844 Aymeloglu et al. Mar 2010 A1
20100070845 Facemire et al. Mar 2010 A1
20100070897 Aymeloglu et al. Mar 2010 A1
20100073315 Lee et al. Mar 2010 A1
20100082541 Kottomtharayil Apr 2010 A1
20100082671 Li et al. Apr 2010 A1
20100094765 Nandy Apr 2010 A1
20100098318 Anderson Apr 2010 A1
20100100963 Mahaffey Apr 2010 A1
20100114817 Broeder et al. May 2010 A1
20100114831 Gilbert et al. May 2010 A1
20100114887 Conway et al. May 2010 A1
20100122152 Chamberlain et al. May 2010 A1
20100131457 Heimendinger May 2010 A1
20100131502 Fordham May 2010 A1
20100145902 Boyan et al. Jun 2010 A1
20100145909 Ngo Jun 2010 A1
20100161646 Ceballos et al. Jun 2010 A1
20100161735 Sharma Jun 2010 A1
20100162176 Dunton Jun 2010 A1
20100162371 Geil Jun 2010 A1
20100169192 Zoldi et al. Jul 2010 A1
20100169376 Chu Jul 2010 A1
20100169405 Zhang Jul 2010 A1
20100191563 Schlaifer et al. Jul 2010 A1
20100198684 Eraker et al. Aug 2010 A1
20100199167 Uematsu et al. Aug 2010 A1
20100199225 Coleman et al. Aug 2010 A1
20100204983 Chung et al. Aug 2010 A1
20100205108 Mun Aug 2010 A1
20100205662 Ibrahim et al. Aug 2010 A1
20100223260 Wu Sep 2010 A1
20100228812 Uomini Sep 2010 A1
20100235915 Memon et al. Sep 2010 A1
20100250412 Wagner Sep 2010 A1
20100262688 Hussain et al. Oct 2010 A1
20100280857 Liu et al. Nov 2010 A1
20100283787 Hamedi et al. Nov 2010 A1
20100293174 Bennett et al. Nov 2010 A1
20100306285 Shah et al. Dec 2010 A1
20100306713 Geisner et al. Dec 2010 A1
20100312530 Capriotti Dec 2010 A1
20100312837 Bodapati et al. Dec 2010 A1
20100313119 Baldwin et al. Dec 2010 A1
20100313239 Chakra et al. Dec 2010 A1
20100318924 Frankel et al. Dec 2010 A1
20100321399 Ellren et al. Dec 2010 A1
20100325526 Ellis et al. Dec 2010 A1
20100325581 Finkelstein et al. Dec 2010 A1
20100330801 Rouh Dec 2010 A1
20110004626 Naeymi-Rad et al. Jan 2011 A1
20110016108 Pelenur et al. Jan 2011 A1
20110029526 Knight et al. Feb 2011 A1
20110035396 Merz et al. Feb 2011 A1
20110041084 Karam Feb 2011 A1
20110047159 Baid et al. Feb 2011 A1
20110055074 Chen et al. Mar 2011 A1
20110060753 Shaked et al. Mar 2011 A1
20110061013 Bilicki et al. Mar 2011 A1
20110066497 Gopinath et al. Mar 2011 A1
20110066933 Ludwig Mar 2011 A1
20110074811 Hanson et al. Mar 2011 A1
20110078055 Faribault et al. Mar 2011 A1
20110078173 Seligmann et al. Mar 2011 A1
20110093327 Fordyce, III et al. Apr 2011 A1
20110093490 Schindlauer et al. Apr 2011 A1
20110099133 Chang et al. Apr 2011 A1
20110099628 Lanxner et al. Apr 2011 A1
20110117878 Barash et al. May 2011 A1
20110119100 Ruhl et al. May 2011 A1
20110131082 Manser Jun 2011 A1
20110131122 Griffin et al. Jun 2011 A1
20110131547 Elaasar Jun 2011 A1
20110137766 Rasmussen et al. Jun 2011 A1
20110145401 Westlake Jun 2011 A1
20110153384 Horne et al. Jun 2011 A1
20110153592 DeMarcken Jun 2011 A1
20110161096 Buehler et al. Jun 2011 A1
20110167105 Ramakrishnan et al. Jul 2011 A1
20110170799 Carrino et al. Jul 2011 A1
20110173032 Payne et al. Jul 2011 A1
20110173093 Psota et al. Jul 2011 A1
20110179042 Aymeloglu et al. Jul 2011 A1
20110185316 Reid et al. Jul 2011 A1
20110185401 Bak et al. Jul 2011 A1
20110208565 Ross et al. Aug 2011 A1
20110208724 Jones et al. Aug 2011 A1
20110208822 Rathod Aug 2011 A1
20110213655 Henkin Sep 2011 A1
20110218934 Elser Sep 2011 A1
20110218955 Tang Sep 2011 A1
20110219450 McDougal et al. Sep 2011 A1
20110225198 Edwards et al. Sep 2011 A1
20110225482 Chan et al. Sep 2011 A1
20110225586 Bentley et al. Sep 2011 A1
20110231305 Winters Sep 2011 A1
20110238495 Kang Sep 2011 A1
20110251951 Kolkowtiz Oct 2011 A1
20110252282 Meek et al. Oct 2011 A1
20110258072 Kerker et al. Oct 2011 A1
20110258158 Resende et al. Oct 2011 A1
20110258216 Supakkul et al. Oct 2011 A1
20110270604 Qi et al. Nov 2011 A1
20110270705 Parker Nov 2011 A1
20110270834 Sokolan et al. Nov 2011 A1
20110270871 He et al. Nov 2011 A1
20110289397 Eastmond et al. Nov 2011 A1
20110289407 Naik et al. Nov 2011 A1
20110289420 Morioka et al. Nov 2011 A1
20110291851 Whisenant Dec 2011 A1
20110295649 Fine Dec 2011 A1
20110307382 Siegel et al. Dec 2011 A1
20110310005 Chen et al. Dec 2011 A1
20110314007 Dassa et al. Dec 2011 A1
20110314024 Chang et al. Dec 2011 A1
20110321008 Jhoney et al. Dec 2011 A1
20120011238 Rathod Jan 2012 A1
20120011245 Gillette et al. Jan 2012 A1
20120013684 Robertson et al. Jan 2012 A1
20120019559 Siler et al. Jan 2012 A1
20120022945 Falkenborg et al. Jan 2012 A1
20120030140 Aymeloglu et al. Feb 2012 A1
20120036013 Neuhaus et al. Feb 2012 A1
20120036434 Oberstein Feb 2012 A1
20120050293 Carlhian et al. Mar 2012 A1
20120054284 Rakshit Mar 2012 A1
20120059853 Jagota Mar 2012 A1
20120066166 Curbera et al. Mar 2012 A1
20120066296 Appleton et al. Mar 2012 A1
20120072825 Sherkin et al. Mar 2012 A1
20120078595 Balandin et al. Mar 2012 A1
20120079363 Folting et al. Mar 2012 A1
20120084117 Tavares et al. Apr 2012 A1
20120084118 Bai et al. Apr 2012 A1
20120084287 Lakshminarayan et al. Apr 2012 A1
20120101952 Raleigh et al. Apr 2012 A1
20120102022 Miranker et al. Apr 2012 A1
20120106801 Jackson May 2012 A1
20120117082 Koperda et al. May 2012 A1
20120131512 Takeuchi et al. May 2012 A1
20120136804 Lucia May 2012 A1
20120137235 TS et al. May 2012 A1
20120143816 Zhang et al. Jun 2012 A1
20120144335 Abeln et al. Jun 2012 A1
20120158585 Ganti Jun 2012 A1
20120159307 Chung et al. Jun 2012 A1
20120159362 Brown et al. Jun 2012 A1
20120159399 Bastide et al. Jun 2012 A1
20120159449 Arnold et al. Jun 2012 A1
20120170847 Tsukidate Jul 2012 A1
20120173381 Smith Jul 2012 A1
20120173985 Peppel Jul 2012 A1
20120174057 Narendra et al. Jul 2012 A1
20120180002 Campbell et al. Jul 2012 A1
20120188252 Law Jul 2012 A1
20120191446 Binsztok et al. Jul 2012 A1
20120196557 Reich et al. Aug 2012 A1
20120196558 Reich et al. Aug 2012 A1
20120197651 Robinson et al. Aug 2012 A1
20120203708 Psota et al. Aug 2012 A1
20120208636 Feige Aug 2012 A1
20120215784 King et al. Aug 2012 A1
20120221511 Gibson et al. Aug 2012 A1
20120221553 Wittmer et al. Aug 2012 A1
20120221580 Barney Aug 2012 A1
20120226523 Weiss Sep 2012 A1
20120245976 Kumar et al. Sep 2012 A1
20120246148 Dror Sep 2012 A1
20120254129 Wheeler et al. Oct 2012 A1
20120278249 Duggal et al. Nov 2012 A1
20120284345 Costenaro et al. Nov 2012 A1
20120284719 Phan et al. Nov 2012 A1
20120290506 Muramatsu et al. Nov 2012 A1
20120290879 Shibuya et al. Nov 2012 A1
20120296907 Long et al. Nov 2012 A1
20120311684 Paulsen et al. Dec 2012 A1
20120323888 Osann, Jr. Dec 2012 A1
20120330801 McDougal et al. Dec 2012 A1
20120330973 Ghuneim et al. Dec 2012 A1
20130006426 Healey et al. Jan 2013 A1
20130006725 Simanek et al. Jan 2013 A1
20130006916 McBride et al. Jan 2013 A1
20130013577 Fee et al. Jan 2013 A1
20130016106 Yip et al. Jan 2013 A1
20130018796 Kolhatkar et al. Jan 2013 A1
20130024268 Manickavelu Jan 2013 A1
20130024731 Shochat et al. Jan 2013 A1
20130036346 Cicerone Feb 2013 A1
20130046635 Grigg et al. Feb 2013 A1
20130046842 Muntz et al. Feb 2013 A1
20130054306 Bhalla Feb 2013 A1
20130054551 Lange Feb 2013 A1
20130057551 Ebert et al. Mar 2013 A1
20130060786 Serrano et al. Mar 2013 A1
20130061169 Pearcy et al. Mar 2013 A1
20130073377 Heath Mar 2013 A1
20130073454 Busch Mar 2013 A1
20130078943 Biage et al. Mar 2013 A1
20130086482 Parsons Apr 2013 A1
20130096968 Van Pelt Apr 2013 A1
20130096988 Grossman et al. Apr 2013 A1
20130097130 Bingol et al. Apr 2013 A1
20130097482 Marantz et al. Apr 2013 A1
20130101159 Chao et al. Apr 2013 A1
20130110746 Ahn May 2013 A1
20130110822 Ikeda et al. May 2013 A1
20130110877 Bonham et al. May 2013 A1
20130111320 Campbell et al. May 2013 A1
20130117651 Waldman et al. May 2013 A1
20130124193 Holmberg May 2013 A1
20130132348 Garrod May 2013 A1
20130150004 Rosen Jun 2013 A1
20130151148 Parundekar et al. Jun 2013 A1
20130151305 Akinola et al. Jun 2013 A1
20130151388 Falkenborg et al. Jun 2013 A1
20130151453 Bhanot et al. Jun 2013 A1
20130157234 Gulli et al. Jun 2013 A1
20130166348 Scotto Jun 2013 A1
20130166480 Popescu et al. Jun 2013 A1
20130166550 Buchmann et al. Jun 2013 A1
20130176321 Mitchell et al. Jul 2013 A1
20130179420 Park et al. Jul 2013 A1
20130185245 Anderson Jul 2013 A1
20130185307 El-Yaniv et al. Jul 2013 A1
20130198624 Aymeloglu et al. Aug 2013 A1
20130218974 Cao Aug 2013 A1
20130224696 Wolfe et al. Aug 2013 A1
20130225212 Khan Aug 2013 A1
20130226318 Procyk Aug 2013 A1
20130226944 Baid et al. Aug 2013 A1
20130226953 Markovich et al. Aug 2013 A1
20130231862 Delling et al. Sep 2013 A1
20130232045 Tai et al. Sep 2013 A1
20130232220 Sampson Sep 2013 A1
20130238616 Rose et al. Sep 2013 A1
20130238664 Hsu et al. Sep 2013 A1
20130246170 Gross et al. Sep 2013 A1
20130246537 Gaddala Sep 2013 A1
20130246597 Iizawa et al. Sep 2013 A1
20130251233 Yang et al. Sep 2013 A1
20130262328 Federgreen Oct 2013 A1
20130262527 Hunter et al. Oct 2013 A1
20130263019 Castellanos et al. Oct 2013 A1
20130267207 Hao et al. Oct 2013 A1
20130268520 Fisher et al. Oct 2013 A1
20130279757 Kephart Oct 2013 A1
20130282696 John et al. Oct 2013 A1
20130290011 Lynn et al. Oct 2013 A1
20130290161 Aymeloglu et al. Oct 2013 A1
20130290825 Arndt et al. Oct 2013 A1
20130293553 Burr et al. Nov 2013 A1
20130297619 Chandrasekaran et al. Nov 2013 A1
20130304770 Boero et al. Nov 2013 A1
20130311375 Priebatsch Nov 2013 A1
20130325826 Agarwal et al. Dec 2013 A1
20140006404 McGrew et al. Jan 2014 A1
20140012724 O'Leary et al. Jan 2014 A1
20140012796 Petersen et al. Jan 2014 A1
20140012886 Downing et al. Jan 2014 A1
20140019936 Cohanoff Jan 2014 A1
20140032506 Hoey et al. Jan 2014 A1
20140033010 Richardt et al. Jan 2014 A1
20140040371 Gurevich et al. Feb 2014 A1
20140047319 Eberlein Feb 2014 A1
20140047357 Alfaro et al. Feb 2014 A1
20140058914 Song et al. Feb 2014 A1
20140059038 McPherson et al. Feb 2014 A1
20140067611 Adachi et al. Mar 2014 A1
20140068487 Steiger et al. Mar 2014 A1
20140074855 Zhao et al. Mar 2014 A1
20140074888 Potter et al. Mar 2014 A1
20140081685 Thacker et al. Mar 2014 A1
20140095273 Tang et al. Apr 2014 A1
20140095363 Caldwell Apr 2014 A1
20140095509 Patton Apr 2014 A1
20140108068 Williams Apr 2014 A1
20140108074 Miller Apr 2014 A1
20140108380 Gotz et al. Apr 2014 A1
20140108985 Scott et al. Apr 2014 A1
20140115589 Marinelli, III et al. Apr 2014 A1
20140115610 Marinelli, III et al. Apr 2014 A1
20140120864 Manolarakis May 2014 A1
20140123279 Bishop et al. May 2014 A1
20140129261 Bothwell et al. May 2014 A1
20140129936 Richards et al. May 2014 A1
20140136285 Carvalho May 2014 A1
20140143009 Brice et al. May 2014 A1
20140143025 Fish May 2014 A1
20140149436 Bahrami et al. May 2014 A1
20140156527 Grigg et al. Jun 2014 A1
20140157172 Peery et al. Jun 2014 A1
20140164502 Khodorenko et al. Jun 2014 A1
20140181833 Bird et al. Jun 2014 A1
20140189536 Lange et al. Jul 2014 A1
20140195515 Baker et al. Jul 2014 A1
20140195887 Ellis et al. Jul 2014 A1
20140214482 Williams et al. Jul 2014 A1
20140214579 Shen et al. Jul 2014 A1
20140222521 Chait Aug 2014 A1
20140222752 Isman et al. Aug 2014 A1
20140222793 Sadkin et al. Aug 2014 A1
20140229554 Grunin et al. Aug 2014 A1
20140237354 Burr et al. Aug 2014 A1
20140244388 Manouchehri et al. Aug 2014 A1
20140258285 Lavine Sep 2014 A1
20140267294 Ma Sep 2014 A1
20140267295 Sharma Sep 2014 A1
20140279824 Tamayo Sep 2014 A1
20140279865 Kumar Sep 2014 A1
20140310266 Greenfield Oct 2014 A1
20140316911 Gross Oct 2014 A1
20140333651 Cervelli et al. Nov 2014 A1
20140337772 Cervelli et al. Nov 2014 A1
20140344230 Krause et al. Nov 2014 A1
20140358789 Boding et al. Dec 2014 A1
20140358829 Hurwitz Dec 2014 A1
20140366132 Stiansen et al. Dec 2014 A1
20150012509 Kirn Jan 2015 A1
20150019394 Unser et al. Jan 2015 A1
20150046481 Elliot Feb 2015 A1
20150046870 Goldenberg et al. Feb 2015 A1
20150073929 Psota et al. Mar 2015 A1
20150073954 Braff Mar 2015 A1
20150089424 Duffield et al. Mar 2015 A1
20150095773 Gonsalves et al. Apr 2015 A1
20150100897 Sun et al. Apr 2015 A1
20150100907 Erenrich et al. Apr 2015 A1
20150106379 Elliot et al. Apr 2015 A1
20150112641 Faraj Apr 2015 A1
20150120176 Curtis et al. Apr 2015 A1
20150134512 Mueller May 2015 A1
20150134666 Gattiker et al. May 2015 A1
20150135256 Hoy et al. May 2015 A1
20150161611 Duke et al. Jun 2015 A1
20150169709 Kara et al. Jun 2015 A1
20150169726 Kara et al. Jun 2015 A1
20150170077 Kara et al. Jun 2015 A1
20150178743 Aymeloglu et al. Jun 2015 A1
20150178825 Huerta Jun 2015 A1
20150178877 Bogomolov et al. Jun 2015 A1
20150186821 Wang et al. Jul 2015 A1
20150187036 Wang et al. Jul 2015 A1
20150188872 White Jul 2015 A1
20150205848 Kumar et al. Jul 2015 A1
20150227295 Meiklejohn et al. Aug 2015 A1
20150254220 Burr et al. Sep 2015 A1
20150261817 Harris et al. Sep 2015 A1
20150269030 Fisher et al. Sep 2015 A1
20150309719 Ma et al. Oct 2015 A1
20150310005 Ryger et al. Oct 2015 A1
20150317342 Grossman et al. Nov 2015 A1
20150324868 Kaftan et al. Nov 2015 A1
20150338233 Cervelli et al. Nov 2015 A1
20150379413 Robertson et al. Dec 2015 A1
20160004764 Chakerian et al. Jan 2016 A1
20160026923 Erenrich et al. Jan 2016 A1
20160299652 Aymeloglu et al. Oct 2016 A1
20180075007 Burr et al. Mar 2018 A1
20180075126 Tamayo Mar 2018 A1
20180113740 Marinelli et al. Apr 2018 A1
Foreign Referenced Citations (95)
Number Date Country
2828264 Apr 2014 CA
2829266 Jun 2017 CA
102546446 Jul 2012 CN
103167093 Jun 2013 CN
102054015 May 2014 CN
102014103482 Sep 2014 DE
102014204827 Sep 2014 DE
102014204830 Sep 2014 DE
102014204834 Sep 2014 DE
102014213036 Jan 2015 DE
102014215621 Feb 2015 DE
0652513 May 1995 EP
1109116 Jun 2001 EP
1146649 Oct 2001 EP
1647908 Apr 2006 EP
1672527 Jun 2006 EP
1926074 May 2008 EP
2350817 Aug 2011 EP
2487610 Aug 2012 EP
2551799 Jan 2013 EP
2555126 Feb 2013 EP
2560134 Feb 2013 EP
2562709 Feb 2013 EP
2634745 Sep 2013 EP
2743839 Jun 2014 EP
2778913 Sep 2014 EP
2778914 Sep 2014 EP
2778974 Sep 2014 EP
2778977 Sep 2014 EP
2778986 Sep 2014 EP
2779082 Sep 2014 EP
2835745 Feb 2015 EP
2835770 Feb 2015 EP
2838039 Feb 2015 EP
2846241 Mar 2015 EP
2851852 Mar 2015 EP
2858014 Apr 2015 EP
2858018 Apr 2015 EP
2863326 Apr 2015 EP
2863346 Apr 2015 EP
2869211 May 2015 EP
2876587 May 2015 EP
2884439 Jun 2015 EP
2884440 Jun 2015 EP
2889814 Jul 2015 EP
2891992 Jul 2015 EP
2892197 Jul 2015 EP
2911078 Aug 2015 EP
2911100 Aug 2015 EP
2921975 Sep 2015 EP
2940603 Nov 2015 EP
2940609 Nov 2015 EP
2963595 Jan 2016 EP
2366498 Mar 2002 GB
2513472 Oct 2014 GB
2513721 Nov 2014 GB
2508503 Jan 2015 GB
2516155 Jan 2015 GB
2517582 Feb 2015 GB
2508293 Apr 2015 GB
2518745 Apr 2015 GB
1194178 Sep 2015 HK
2012778 Nov 2014 NL
2013134 Jan 2015 NL
2013306 Feb 2015 NL
2011613 Jun 2016 NL
624557 Dec 2014 NZ
622485 Mar 2015 NZ
616212 May 2015 NZ
616299 Jul 2015 NZ
WO 00009529 Feb 2000 WO
WO 00034895 Jun 2000 WO
WO 01025906 Apr 2001 WO
WO 2001088750 Nov 2001 WO
WO 02065353 Aug 2002 WO
WO 2005104736 Nov 2005 WO
WO 2005116851 Dec 2005 WO
WO 2008064207 May 2008 WO
WO 2008121499 Oct 2008 WO
WO 2009042548 Apr 2009 WO
WO 2009051987 Apr 2009 WO
WO 2009061501 May 2009 WO
WO 2010000014 Jan 2010 WO
WO 2010030913 Mar 2010 WO
WO 2010030914 Mar 2010 WO
WO 2010030915 Mar 2010 WO
WO 2010030917 Mar 2010 WO
WO 2010030919 Mar 2010 WO
WO 2010030946 Mar 2010 WO
WO 2010030949 Mar 2010 WO
WO 2013030595 Mar 2010 WO
WO 2012025915 Mar 2012 WO
WO 2012119008 Sep 2012 WO
WO 2013010157 Jan 2013 WO
WO 2013102892 Jul 2013 WO
Non-Patent Literature Citations (530)
Entry
“A Quick Guide to UniProtKB Swiss-Prot & TrEMBL,” Sep. 2011, pp. 2.
“A Tour of Pinboard,” http://pinboard.in/tour as printed May 15, 2014 in 6 pages.
“E-MailRelay,” http://web.archive.org/web/20080821175021/http://emailrelay.sourceforge.net/ Aug. 21, 2008, pp. 2.
“The FASTA Program Package,” fasta—36.3.4, Mar. 25, 2011, pp. 29.
Anonymous, “A Real-World Problem of Matching Records,” Nov. 2006, http://grupoweb.upf.es/bd-web/slides/uliman.pdf pp. 1-16.
Anonymous, “Frequently Asked Questions about Office Binder 97,” http://web.archive.org/web/20100210112922/http://support.microsoft.com/kb/843147, tprinted Dec. 18, 2006 in 5 pages.
Bae et al., “Partitioning Algorithms for the Computation of Average Iceberg Queries,” DaWaK 2000, LNCS 1874, pp. 276_286.
Ballesteros et al., “Batching: A Design Pattern for Efficient and Flexible Client/Server Interaction,” Transactions on Pattern Languages of Programming, Springer Berlin Heildeberg, 2009, pp. 48-66.
Bogle et al., “Reducing Cross-Domain Call Overhead Using Batched Futures,” SIGPLAN No. 29, Oct. 10, 1994 pp. 341-354.
Bogle, Phillip Lee, “Reducing Cross-Domain Call Overhead Using Batched Futures,” May 1994, Massachusetts Institute of Technology, pp. 96.
Brandel, Mary, “Data Loss Prevention Dos and Don'ts,” http://web.archive.org/web/20080724024847/http://www.csoonline.com/article/221272/Dos_and_Don_ts_for_Data_Loss_Prevention, Oct. 10, 2007, pp. 5.
Canese et al., “Chapter 2: PubMed: The Bibliographic Database,” The NCBI Handbook, Oct. 2002, pp. 1-10.
Chazelle et al., “The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables,” SODA '04 Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 30-39.
Delcher et al., “Identifying Bacterial Genes and Endosymbiont DNA with Glimmer,” BioInformatics, vol. 23, No. 6, 2007, pp. 673-679.
Delicious, http://delicious.com/ as printed May 15, 2014 in 1 page.
Donjerkovic et al., “Probabilistic Optimization of Top N Queries,” Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, 1999, pp. 411-422.
Fang et al., “Computing Iceberg Queries Efficiently,” Proceedings of the 24th VLDB Conference New York, 1998, pp. 299-310.
Gu et al., “Record Linkage: Current Practice and Future Directions,” Jan. 15, 2004, pp. 32.
Han et al., “Efficient Computation of Iceberg Cubes with Complex Measures,” ACM Sigmod, May 21-24, 2001, pp. 1-12.
Hua et al., “A Multi-attribute Data Structure with Parallel Bloom Filters for Network Services”, HiPC 2006, LNCS 4297, pp. 277-288, 2006.
Ivanova et al., “An Architecture for Recycling Intermediates in a Column-Store,” Proceedings of the 35th Sigmod International Conference on Management of Data, Sigmod '09, Jun. 29, 2009, p. 309.
Jacques, M., “An extensible math expression parser with plug-ins,” Code Project, Mar. 13, 2008. Retrieved on Jan. 30, 2015 from the internet: http://www.codeproject.com/Articies/7335/An-extensible-math-expresson-parsor-with-plug-ins.
Johnson, Maggie, “Introduction to YACC and Bison”.
Johnson, Steve, “Access 2013 on demand,” Access 2013 on Demand, May 9, 2013, Que Publishing.
Kahan et al., “Annotea: an Open RDF Infrastructure for Shared Web Annotations”, Computer Networks, Elsevier Science Publishers B.V., vol. 39, No. 5, dated Aug. 5, 2002, pp. 589-608.
Karp et al., “A Simple Algorithm for Finding Frequent Elements in Streams and Bags,” ACM Transactions on Database Systems, vol. 28, No. 1, Mar. 2003, pp. 51Ð55.
Kitts, Paul, “Chapter 14: Genome Assembly and Annotation Process,” The NCBI Handbook, Oct. 2002, pp. 1-21.
Leela et al., “On Incorporating Iceberg Queries in Query Processors,” Technical Report, TR-2002-01, Database Systems for Advanced Applications Lecture Notes in Computer Science, 2004, vol. 2973.
Lim et al., “Resolving Attribute Incompatibility in Database Integration: An Evidential Reasoning Approach,” Department of Computer Science, University of Minnesota, 1994, http://reference.kfupm.edu.sa/content/resolving_attribute_incompatibility_in_d_531691.pdf pp. 1-10.
Litwin et al., “Multidatabase Interoperability,” IEEE Computer, Dec. 1986, vol. 19, No. 12, http://www.lamsade.dauphine.fr/˜litwin/mdb-interoperability.pdf, pp. 10-18.
Liu et al., “Methods for Mining Frequent Items in Data Streams: An Overview,” Knowledge and Information Systems, vol. 26, No. 1, Jan. 2011, pp. 1-30.
Madden, Tom, “Chapter 16: The BLAST Sequence Analysis Tool,” The NCBI Handbook, Oct. 2002, pp. 1-15.
Mendes et al., “TcruziKB: Enabling Complex Queries for Genomic Data Exploration,” IEEE International Conference on Semantic Computing, Aug. 2008, pp. 432-439.
Mizrachi, Ilene, “Chapter 1: GenBank: The Nuckeotide Sequence Database,” The NCBO Handbook, Oct. 2002, pp. 1-14.
Nadeau et al., “A Survey of Named Entity Recognition and Classification,” Jan. 15, 2004, pp. 20.
Nin et al., “On the Use of Semantic Blocking Techniques for Data Cleansing and Integration,” 11th International Database Engineering and Applications Symposium, 2007, pp. 9.
Pythagoras Communications Ltd., “Microsoft CRM Duplicate Detection,” Sep. 13, 2011, https://www.youtube.com/watch?v=j-7Qos0DD0Kc.
Qiang et al., “A Mutual-Information-Based Approach to Entity Reconciliation in Heterogeneous Databases,” Proceedings of 2008 International Conference on Computer Science & Software Engineering, IEEE Computer Society, New York, NY, Dec. 12-14, 2008, pp. 666-669.
Russell et al., “NITELIGHT: A Graphical Tool for Semantic Query Construction,” 2008, pp. 10.
Sekine et al., “Definition, Dictionaries and Tagger for Extended Named Entity Hierarchy,” May 2004, pp. 1977-1980.
Sigrist, et al., “PROSITE, a Protein Domain Database for Functional Characterization and Annotation,” Nucleic Acids Research, 2010, vol. 38, pp. D161-D166.
Sirotkin et al., “Chapter 13: The Processing of Biological Sequence Data at NCBI,” The NCBI Handbook, Oct. 2002, pp. 1-11.
Smart et al., “A Visual Approach to Semantic Query Design Using a Web-Based Graphical Query Designer,” 16th International Conference on Knowledge Engineering and Knowledge Management (EKAW 2008), Acitrezza, Catania, Italy, Sep. 29-Oct. 3, 2008, pp. 16.
Stamos et al., “Remote Evaluation,” Journal ACM Transactions on Programming Languages and Systems (TOPLAS) vol. 12, Issue 4, Oct. 1990, pp. 537-564.
Wikipedia, “Machine Code”, p. 1-5, printed Aug. 11, 2014.
Xobni, “About Page,” http://www.xobni.com/about/ printed Jun. 26, 2014 in 2 pages.
Xobni, “Blog,” http://blog.xobni.com/ printed Jun. 26, 2014 in 11 pages.
Xobni, http://www.xobni.com/ printed Jun. 26, 2014 in 5 pages.
Zhao et al., “Entity Matching Across Heterogeneous Data Sources: An Approach Based on Constrained Cascade Generalization,” Data & Knowledge Engineering, vol. 66, No. 3, Sep. 2008, pp. 368-381.
International Search Report and Written Opinion for Patent Application No. PCT/US2009/056707 dated Mar. 2, 2010.
Notice of Acceptance for New Zealand Patent Application No. 616212 dated Jan. 23, 2015.
Notice of Acceptance for New Zealand Patent Application No. 616299 dated Apr. 7, 2015.
Notice of Acceptance for New Zealand Patent Application No. 622485 dated Nov. 24, 2014.
Notice of Allowance for U.S. Appl. No. 13/767,779 dated Mar. 17, 2015.
Notice of Allowance for U.S. Appl. No. 14/254,757 dated Sep. 10, 2014.
Notice of Allowance for U.S. Appl. No. 14/254,773 dated Aug. 20, 2014.
Official Communication for Australian Patent Application No. 2013237658 dated Feb. 2, 2015.
Official Communication for Australian Patent Application No. 2013237710 dated Jan. 16, 2015.
Official Communication for Australian Patent Application No. 2014201506 dated Feb. 27, 2015.
Official Communication for Australian Patent Application No. 2014201507 dated Feb. 27, 2015.
Official Communication for Australian Patent Application No. 2014201580 dated Feb. 27, 2015.
Official Communication for Australian Patent Application No. 2014203669 dated May 29, 2015.
Official Communication for Canadian Patent Application No. 2807899 dated Oct. 24, 2014.
Official Communication for Canadian Patent Application No. 2828264 dated Apr. 28, 2015.
Official Communication for Canadian Patent Application No. 2829266 dated Apr. 28, 2015.
Official Communication for European Patent Application No. 08730336.8 dated Jun. 6, 2012.
Official Communication for European Patent Application No. 08839003.4 dated Aug. 14, 2012.
Official Communication for European Patent Application No. 13157474.1 dated May 28, 2013.
Official Communication for European Patent Application No. 14158958.0 dated Apr. 16, 2015.
Official Communication for European Patent Application No. 14158958.0 dated Jun. 3, 2014.
Official Communication for European Patent Application No. 14158977.0 dated Jun. 10, 2014.
Official Communication for European Patent Application No. 14158977.0 dated Apr. 16, 2015.
Official Communication for European Patent Application No. 14159175.0 dated Jul. 17, 2014.
Official Communication for European Patent Application No. 14159629.6 dated Sep. 22, 2014.
Official Communication for European Patent Application No. 14159629.6 dated Jul. 31, 2014.
Official Communication for German Patent Application No. 10 2013 221 052.3 dated Mar. 24, 2015.
Official Communication for German Patent Application No. 10 2013 221 057.4 dated Mar. 23, 2015.
Official Communication for Great Britain Patent Application No. 1404486.1 dated May 21, 2015.
Official Communication for Great Britain Patent Application No. 1404486.1 dated Aug. 27, 2014.
Official Communication for Great Britain Patent Application No. 1404489.5 dated May 21, 2015.
Official Communication for Great Britain Patent Application No. 1404489.5 dated Aug. 27, 2014.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Aug. 20, 2014.
Official Communication for Great Britain Patent Application No. 1404574.4 dated Dec. 18, 2014.
Official Communication for Great Britain Patent Application No. 1411984.6 dated Dec. 22, 2014.
Official Communication for Netherlands Patent Application No. 2013134 dated Apr. 20, 2015.
Official Communication for New Zealand Patent Application No. 616212 dated May 7, 2014.
Official Communication for New Zealand Patent Application No. 616212 dated Oct. 9, 2013.
Official Communication for New Zealand Patent Application No. 616299 dated Jan. 26, 2015.
Official Communication for New Zealand Patent Application No. 622389 dated Mar. 20, 2014.
Official Communication for New Zealand Patent Application No. 622404 dated Mar. 20, 2014.
Official Communication for New Zealand Patent Application No. 622414 dated Mar. 24, 2014.
Official Communication for New Zealand Patent Application No. 622439 dated Mar. 24, 2014.
Official Communication for New Zealand Patent Application No. 622439 dated Jun. 6, 2014.
Official Communication for New Zealand Patent Application No. 622473 dated Jun. 19, 2014.
Official Communication for New Zealand Patent Application No. 622473 dated Mar. 27, 2014.
Official Communication for New Zealand Patent Application No. 622484 dated Apr. 2, 2014.
Official Communication for New Zealand Patent Application No. 622485 dated Nov. 21, 2014.
Official Communication for New Zealand Patent Application No. 628161 dated Aug. 25, 2014.
Official Communication for U.S. Appl. No. 13/608,864 dated Mar. 17, 2015.
Official Communication for U.S. Appl. No. 13/608,864 dated Jun. 8, 2015.
Official Communication for U.S. Appl. No. 13/657,635 dated Mar. 30, 2015.
Official Communication for U.S. Appl. No. 13/657,656 dated May 6, 2015.
Official Communication for U.S. Appl. No. 13/657,656 dated Oct. 7, 2014.
Official Communication for U.S. Appl. No. 13/827,491 dated Dec. 1, 2014.
Official Communication for U.S. Appl. No. 13/827,627 dated Mar. 2, 2015.
Official Communication for U.S. Appl. No. 13/831,791 dated Mar. 4, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Mar. 11, 2015.
Notice of Allowance for U.S. Appl. No. 14/516,386 dated Sep. 1, 2017.
Notice of Allowance for U.S. Appl. No. 14/715,834 dated Sep. 27, 2017.
Notice of Allowance for U.S. Appl. No. 15/144,602 dated Sep. 7, 2017.
Official Communication for European Patent Application No. 12181585.6 dated Sep. 4, 2015.
Official Communication for European Patent Application No. 12181585.6 dated Jan. 7, 2013.
Official Communication for European Patent Application No. 14158861.6 dated Nov. 2, 2016.
Official Communication for European Patent Application No. 15159520.4 dated Jul. 20, 2016.
Official Communication for New Zealand Patent Application No. 616299 dated Oct. 9, 2013.
Official Communication for U.S. Appl. No. 12/556,321 dated Jun. 30, 2017.
Official Communication for U.S. Appl. No. 14/134,558 dated Aug. 26, 2016.
Official Communication for U.S. Appl. No. 14/562,420 dated Jul. 3, 2017.
Official Communication for U.S. Appl. No. 14/618,213 dated Oct. 24, 2017.
Official Communication for U.S. Appl. No. 14/715,834 dated Aug. 28, 2017.
Official Communication for U.S. Appl. No. 15/220,021 dated Jul. 12, 2017.
“A First Look: Predicting Market Demand for Food Retail using a Huff Analysis,” TRF Policy Solutions, Jul. 2012, pp. 30.
“A Word About Banks and the Laundering of Drug Money,” Aug. 18, 2012, http://www.golemxiv.co.uk/2012/08/a-word-about-banks-and-the-laundering-of-drug-money/.
“GrabUp—What a Timesaver!” http://atichris.com/191/grabup/, Aug. 11, 2008, pp. 3.
“HunchLab: Heat Map and Kernel Density Calculation for Crime Analysis,” Azavea Journal, printed from www.azavea.com/blogs/newsletter/v4i4/kernel-density-capabilities-added-to-hunchlab/ on Sep. 9, 2014, 2 pages.
“Money Laundering Risks and E-Gaming: A European Overview and Assessment,” 2009, http://www.cf.ac.uk/socsi/resources/Levi_Final_Money_Laundering_Risks_egaming.pdf.
“Potential Money Laundering Warning Signs,” snapshot taken 2003, https://web.archive.org/web/20030816090055/http://finsolinc.com/ANTI-MONEY%20LAUNDERING%20TRAINING%20GUIDES.pdf.
“Refresh CSS Ellipsis When Resizing Container—Stack Overflow,” Jul. 31, 2013, retrieved from internet http://stackoverflow.com/questions/17964681/refresh-css-ellipsis-when-resizing-container, retrieved on May 18, 2015.
“Using Whois Based Geolocation and Google Maps API for Support Cybercrime Investigations,” http://wseas.us/e-library/conferences/2013/Dubrovnik/TELECIRC/TELECIRC-32.pdf.
“Java Remote Method Invocation: 7—Remote Object Activation,” Dec. 31, 2010, retrieved from the internet Mar. 15, 2016 https://docs.oracle.com/javase/7/docs/platform/rmi/spec/rmi-activation2.html.
Abbey, Kristen, “Review of Google Docs,” May 1, 2007, pp. 2.
About 80 Minutes, “Palantir in a Number of Parts—Part 6—Graph,” Mar. 21, 2013, pp. 1-6, retrieved from the internet http://about80minutes.blogspot.nl/2013/03/palantir-in-number-of-parts-part-6-graph.html retrieved on Aug. 18, 2015.
Acklen, Laura, “Absolute Beginner's Guide to Microsoft Word 2003,” Dec. 24, 2003, pp. 15-18, 34-41, 308-316.
Adams et al., “Worklets: A Service-Oriented Implementation of Dynamic Flexibility in Workflows,” R. Meersman, Z. Tani et al. (Eds.): OTM 2006, LNCS, 4275, pp. 291-308, 2006.
Alur et al., “Chapter 2: IBM InfoSphere DataStage Stages,” IBM InfoSphere DataStage Data Flow and Job Design, Jul. 1, 2008, pp. 35-137.
Amnet, “5 Great Tools for Visualizing Your Twitter Followers,” posted Aug. 4, 2010, http://www.amnetblog.com/component/content/article/115-5-grate-tools-for-visualizing-your-twitter-followers.html.
Ananiev et al., “The New Modality API,” http://web.archive.org/web/20061211011958/http://java.sun.com/developer/technicalArticles/J2SE/Desktop/javase6/modality/ Jan. 21, 2006, pp. 8.
Appacts, “Smart Thinking for Super Apps,” http://www.appacts.com Printed Jul. 18, 2013 in 4 pages.
Apsalar, “Data Powered Mobile Advertising,” “Free Mobile App Analytics” and various analytics related screen shots http://apsalar.com Printed Jul. 18, 2013 in 8 pages.
Ashraf, “Protect your Google Account (Gmail) by enabling SMS (text message) notifications for Suspicious Activity,” online article from dotTech, Jan. 24, 2013, https://dottech.org/94405/how-to-setup-text-message-sms-google-notifications-for-suspicious-activity/.
Azad, Khalid, “A Visual Guide to Version Control,” http://betterexplained.com/articles/a-visual-guide-to-version-control/, Sep. 27, 2007 in 11 pages.
Beverley, Bill, “Windows Tips & Tricks,” http://alamopc.org/pcalamode/columns/beverley/bb0301.shtml, Mar. 2001 in 5 pages.
Bluttman et al., “Excel Formulas and Functions for Dummies,” 2005, Wiley Publishing, Inc., pp. 280, 284-286.
Bouajjani et al., “Analysis of Recursively Parallel Programs,” PLDI09: Proceedings of the 2009 ACM Sigplan Conference on Programming Language Design and Implementation, Jun. 15-20, 2009, Dublin, Ireland, pp. 203-214.
Boyce, Jim, “Microsoft Outlook 2010 Inside Out,” Aug. 1, 2010, retrieved from the internet https://capdtron.files.wordpress.com/2013/01/outlook-2010-inside_out.pdf.
Bradbard, Matthew, “Technical Analysis Applied,” http://partners.futuresource.com/fastbreak/2007/0905.htm, Sep. 5, 2007, pp. 6.
Breierova et al., “An Introduction to Sensitivity Analysis,” Publsihed by Massachusetts Institute of Technology, Cambridge, MA, Oct. 2001, pp. 67.
Bugzilla@Mozilla, “Bug 18726—[feature] Long-click means of invoking contextual menus not supported,” http://bugzilla.mozilla.org/show_bug.cgi?id=18726 printed Jun. 13, 2013 in 11 pages.
Capptain—Pilot Your Apps, http://www.capptain.com Printed Jul. 18, 2013 in 6 pages.
Celik, Tantek, “CSS Basic User Interface Module Level 3 (CSS3 UI),” Section 8 Resizing and Overflow, Jan. 17, 2012, retrieved from internet http://www.w3.org/TR/2012/WD-css3-ui-20120117/#resizing-amp-overflow retrieved on May 18, 2015.
Chaudhuri et al., “An Overview of Business Intelligence Technology,” Communications of the ACM, Aug. 2011, vol. 54, No. 8.
Chen et al., “A Novel Emergency Vehicle Dispatching System,” 2013 IEEE 77th Vehicular Technology Conference, IEEE, Jun. 2, 2013, 5 pages.
Chen et al., “Bringing Order to the Web: Automatically Categorizing Search Results,” CHI 2000, Proceedings of the SIGCHI conference on Human Factors in Computing Systems, Apr. 1-6, 2000, The Hague, The Netherlands, pp. 145-152.
Chung, Chin-Wan, “Dataplex: An Access to Heterogeneous Distributed Databases”, Communications of the ACM, Association for Computing Machinery, Inc., vol. 33, Issue No. 1, pp. 70-80, Jan. 1, 1990.
Cohn, et al., “Semi-supervised clustering with user feedback,” Constrained Clustering: Advances in Algorithms, Theory, and Applications 4.1 (2003): 17-32.
Conner, Nancy, “Google Apps: The Missing Manual,” May 1, 2008, pp. 15.
Countly Mobile Analytics, http://count.ly/ Printed Jul. 18, 2013 in 9 pages.
Definition “Identify”, downloaded Jan. 22, 2015, 1 page.
Definition “Overlay”, downloaded Jan. 22, 2015, 1 page.
Devanbu et al., “Authentic Third-party Data Publication”, http://www.cw.ucdavis.edu/˜devanbu/authdbpub.pdf, p. 19, 2000.
Distimo—App Analytics, http://www.distimo.com/app-analytics Printed Jul. 18, 2013 in 5 pages.
Dramowicz, Ela, “Retail Trade Area Analysis Using the Huff Model,” Directions Magazine, Jul. 2, 2005 in 10 pages, http://www.directionsmag.com/articles/retail-trade-area-analysis-using-the-huff-model/123411.
Dreyer et al., “An Object-Oriented Data Model for a Time Series Management System,” Proceedings of the 7th International Working Conference on Scientific and Statistical Database Management, Charlottesville, Virginia USA, Sep. 28-30, 1994, pp. 12.
Eklund et al., “A Dynamic Multi-source Dijkstra's Algorithm for Vehicle Routing,” Intelligent Information Systems, 1996, pp. 329-333.
Fischer et al., “Populating a Release History Database From Version Control and Bug Tracking Systems,” Software Maintenance, 2003, ICSM 2003, Proceedings International Conference, pp. 1-10.
Flurry Analytics, http://www.flurry.com/ Printed Jul. 18, 2013 in 14 pages.
Galliford, Miles, “Snaglt Versus Free Screen Capture Software: Critical Tools for Website Owners,” http://www.subhub.com/articles/free-screen-capture-software, Mar. 27, 2008, pp. 11.
Gesher, Ari, “Palantir Screenshots in the Wild: Swing Sightings,” The Palantir Blog, Sep. 11, 2007, pp. 1-12, retrieved from the internet https://www.palantir.com/2007/09/palantir-screenshots/ retrieved on Aug. 18, 2015.
GIS-NET 3 Public_Department of Regional Planning. Planning & Zoning Information for Unincorporated LA County. Retrieved Oct. 2, 2013 from http://gis.planning.lacounty.gov/GIS-NET3_Public/Viewer.html.
Goldstein et al., “Stacks Lazy Threads: Implementing a Fast Parallel Call,” Journal of Parallel and Distributed Computing, Jan. 1, 1996, pp. 5-20.
Google Analytics Official Website—Web Analytics & Reporting, http://www.google.com/analytics.index.html Printed Jul. 18, 2013 in 22 pages.
Gorr et al., “Crime Hot Spot Forecasting: Modeling and Comparative Evaluation”, Grant 98-IJ-CX-K005,1019 May 6, 2002, 37 pages.
Goswami, Gautam, “Quite Writly Said!,” One Brick at a Time, Aug. 21, 2005, pp. 7.
Griffith, Daniel A., “A Generalized Huff Model,” Geographical Analysis, Apr. 1982, vol. 14, No. 2, pp. 135-144.
Hansen et al., “Analyzing Social Media Networks with NodeXL: Insights from a Connected World”, Chapter 4, pp. 53-67 and Chapter 10, pp. 143-164, published Sep. 2010.
Hardesty, “Privacy Challenges: Analysis: It's Surprisingly Easy to Identify Individuals from Credit-Card Metadata,” MIT News on Campus and Around the World, MIT News Office, Jan. 29, 2015, 3 pages.
Hart et al., “A Formal Basis for the Heuristic Determination of Minimum Cost Paths,” IEEE Transactions on Systems Science and Cybernetics, IEEE, vol. 1, No. 2, Jul. 1, 1968, pp. 100-107.
Hibbert et al., “Prediction of Shopping Behavior Using a Huff Model Within a GIS Framework,” Healthy Eating in Context, Mar. 18, 2011, pp. 16.
Hogue et al., “Thresher: Automating the Unwrapping of Semantic Content from the World Wide Web”, 14th International Conference on World Wide Web, WWW 2005: Chiba, Japan, May 10-14, 2005.
Huang et al., “Systematic and Integrative Analysis of Large Gene Lists Using David Bioinformatics Resources,” Nature Protocols, 4.1, 2008, 44-57.
Huff et al., “Calibrating the Huff Model Using ArcGIS Business Analyst,” ESRI, Sep. 2008, pp. 33.
Huff, David L., “Parameter Estimation in the Huff Model,” ESRI, ArcUser, Oct.-Dec. 2003, pp. 34-36.
Jenks et al., “Nomadic Threads: A Migrating Multithreaded Approach to Remote Memory Accesses in Multiprocessors,” Parallel Architectures and Compilation Techniques, 1996, Oct. 20, 1996, pp. 2-11.
JetScreenshot.com, “Share Screenshots via Internet in Seconds,” http://web.archive.org/web/20130807164204/http://www.jetscreenshot.com/, Aug. 7, 2013, pp. 1.
Jotshi et al., “Dispatching and Routing of Emergency Vehicles in Disaster Mitigation Using Data Fusion.” Socio-Economic Planning Sciences, Pergamon, Amsterdam, Netherlands, vol. 43, No. 1, Mar. 1, 2009, 24 pages.
Keylines.com, “An Introduction to KeyLines and Network Visualization,” Mar. 2014, http://keylines.com/wp-content/uploads/2014/03/KeyLines-White-Paper.pdf downloaded May 12, 2014 in 8 pages.
Keylines.com, “KeyLines Datasheet,” Mar. 2014, http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheet.pdf downloaded May 12, 2014 in 2 pages.
Keylines.com, “Visualizing Threats: Improved Cyber Security Through Network Visualization,” Apr. 2014, http://keylines.com/wp-content/uploads/2014/04/Visualizing-Threats1.pdf downloaded May 12, 2014 in 10 pages.
Kontagent Mobile Analytics, http://www.kontagent.com/ Printed Jul. 18, 2013 in 9 pages.
Kwout, http://web.archive.org/web/20080905132448/http://www.kwout.com/ Sep. 5, 2008, pp. 2.
Li et al., “Interactive Multimodal Visual Search on Mobile Device,” IEEE Transactions on Multimedia, vol. 15, No. 3, Apr. 1, 2013, pp. 594-607.
Liu, Tianshun, “Combining GIS and the Huff Model to Analyze Suitable Locations for a New Asian Supermarket in the Minneapolis and St. Paul, Minnesota USA,” Papers in Resource Analysis, 2012, vol. 14, pp. 8.
Localytics—Mobile App Marketing & Analytics, http://www.localytics.com/ Printed Jul. 18, 2013 in 12 pages.
Manno et al., “Introducing Collaboration in Single-user Applications through the Centralized Control Architecture,” 2010, pp. 10.
Manske, “File Saving Dialogs,” http://www.mozilla.org/editor/ui_specs/FileSaveDialogs.html, Jan. 20, 1999, pp. 7.
Map Builder, “Rapid Mashup Development Tool for Google and Yahoo Maps!” http://web.archive.org/web/20090626224734/http://www.mapbuilder.net/ printed Jul. 20, 2012 in 2 pages.
Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.yahoo.com.
Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.bing.com.
Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.google.com.
Mentzas et al. “An Architecture for Intelligent Assistance in the Forecasting Process,” Proceedings of the Twenty-Eighth Hawaii International Conference on System Sciences, Jan. 3-6, 1995, vol. 3, pp. 167-176.
Microsoft—Developer Network, “Getting Started with VBA in Word 2010,” Apr. 2010, http://msdn.microsoft.com/en-us/library/ff604039%28v=office.14%29.aspx as printed Apr. 4, 2014 in 17 pages.
Microsoft Office—Visio, “About connecting shapes,” http://office.microsoft.com/en-us/visio-help/about-connecting-shapes-HP085050369.aspx printed Aug. 4, 2011 in 6 pages.
Microsoft Office—Visio, “Add and glue connectors with the Connector tool,” http://office.microsoft.com/en-us/visio-help/add-and-glue-connectors-with-the-connector-tool-HA010048532.aspx?CTT=1 printed Aug. 4, 2011 in 1 page.
Microsoft Windows, “Microsoft Windows Version 2002 Print Out 2,” 2002, pp. 1-6.
Microsoft, “Introduction to Versioning,” http://office.microsoft.com/en-us/sharepointtechnolgy/HA010021576.aspx?mode=print, 2007 in 3 pages.
Microsoft, “How Word Creates and Recovers the AutoRecover files,” http://support.microsoft.com/kb/107686, Article ID: 107686, printed Feb. 11, 2010 in 3 pgaes.
Microsoft, “Managing Versions and Checking Documents in and Out (Windows SharePoint Services 2.0),” http://technet.microsoft.com/en-us/library/cc287876.aspx, Aug. 22, 2005 in 2 pages.
Microsoft, “Registering an Application to a URI Scheme,” http://msdn.microsoft.com/en-us/library/aa767914.aspx, printed Apr. 4, 2009 in 4 pages.
Microsoft, “Using the Clipboard,” http://msdn.microsoft.com/en-us/library/ms649016.aspx, printed Jun. 8, 2009 in 20 pages.
Mitzenmacher, Michael, “Compressed Bloom Filters,” IEEE/ACM Transactions on Networking, vol. 10, No. 5, Oct. 2002, pp. 604-612.
Mixpanel—Mobile Analytics, https://mixpanel.com/ Printed Jul. 18, 2013 in 13 pages.
Mohring et al., “Partitioning Graphs to Speedup Dijkstra's Algorithm,” ACM Journal of Experimental Algorithmics, Association of Computing Machinery, New York, New York, vol. 11, Jan. 1, 2006, 29 pages.
Nierman, “Evaluating Structural Similarity in XML Documents”, 6 pages, 2002.
Nitro, “Trick: How to Capture a Screenshot as PDF, Annotate, Then Share It,” http://blog.nitropdf.com/2008/03/04/trick-how-to-capture-a-screenshot-as-pdf-annotate-it-then-share/, Mar. 4, 2008, pp. 2.
Nolan et al., “MCARTA: A Malicious Code Automated Run-Time Analysis Framework,” Homeland Security (HST) 2012 IEEE Conference on Technologies for, Nov. 13, 2012, pp. 13-17.
Olanoff, Drew, “Deep Dive with the New Google Maps for Desktop with Google Earth Integration, It's More than Just a Utility,” May 15, 2013, pp. 1-6, retrieved from the internet: http://web.archive.org/web/20130515230641/http://techcrunch.com/2013/05/15/deep-dive-with-the-new-google-maps-for-desktop-with-google-earth-integration-its-more-than-just-a-utility/.
Online Tech Tips, “Clip2Net—Share files, folders and screenshots easily,” http://www.online-tech-tips.com/free-software-downloads/share-files-folders-screenshots/, Apr. 2, 2008, pp. 5.
Open Web Analytics (OWA), http://www.openwebanalytics.com/ Printed Jul. 19, 2013 in 5 pages.
O'Reilly.com, http://oreilly.com/digitalmedia/2006/01/01/mac-os-x-screenshot-secrets.html published Jan. 1, 2006 in 10 pages.
Palantir Technolgies, “Palantir Labs—Timeline,” Oct. 1, 2010, retrieved from the internet https://www.youtube.com/watch?v=JCgDW5bru9M retrieved on Aug. 19, 2015.
Palmas et al., “An Edge-Bunding Layout for Interactive Parallel Coordinates” 2014 IEEE Pacific Visualization Symposium, pp. 57-64.
Perdisci et al., “Behavioral Clustering of HTTP-Based Malware and Signature Generation Using Malicious Network Traces,” USENIX, Mar. 18, 2010, pp. 1-14.
Piwik—Free Web Analytics Software. http://piwik.org/ Printed Jul. 19, 2013 in18 pages.
Plá{hacek over (s)}il et al., “An Architectural View of Distributed Objects and Components in CORBA, Java RMI and COM/DCOM,” Software—Concepts & Tools, vol. 19, No. 1, Jun. 1, 1998, pp. 14-28.
Quest, “Toad for ORACLE 11.6—Guide to Using Toad,” Sep. 24, 2012, pp. 1-162.
Reedy, Sarah, “Policy and Charging Rules Function (PCRF),” Sep. 13, 2010, http://www.lightreading.com/document.asp?doc_id=680015 printed Dec. 10, 2013 in 4 pages.
Rouse, Margaret, “OLAP Cube,” http://searchdatamanagement.techtarget.com/definition/OLAP-cube, Apr. 28, 2012, pp. 16.
Schroder, Stan, “15 Ways to Create Website Screenshots,” http://mashable.com/2007/08/24/web-screenshots/, Aug. 24, 2007, pp. 2.
Schwieger, V., “Sensitivity Analysis as a General Tool for Model Optimisation-Examples for Trajectory Estimation,” 3rd IAG/12th FIG Symposium, Baden, Germany, May 22-24, 2006, Published by IAG, 2006, pp. 10.
Schwieger, V., “Variance-Based Sensitivity Analysis for Model Evaluation in Engineering Surveys,” INGEO 2004 and FIG Regional Central and Eastern European Conference on Engineering Surveying, Nov. 11-13, 2004, Published by INGEO, Bratislava, Slovakia, 2004, pp. 10.
Shi et al., “A Scalable Implementation of Malware Detection Based on Network Connection Behaviors,” 2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, IEEE, Oct. 10, 2013, pp. 59-66.
SnagIt, “SnagIt 8.1.0 Print Out 2,” Software release date Jun. 15, 2006, pp. 1-3.
SnagIt, “SnagIt 8.1.0 Print Out,” Software release date Jun. 15, 2006, pp. 6.
SnagIt, “SnagIt Online Help Guide,” http://download.techsmith.com/snagit/docs/onlinehelp/enu/snagit_help.pdf, TechSmith Corp., Version 8.1, printed Feb. 7, 2007, pp. 284.
StatCounter—Free Invisible Web Tracker, Hit Counter and Web Stats, http://statcounter.com/ Printed Jul. 19, 2013 in 17 pages.
Symantec Corporation, “E-Security Begins with Sound Security Policies,” Announcement Symantec, Jun. 14, 2001.
TestFlight—Beta Testing on the Fly, http://testflightapp.com/ Printed Jul. 18, 2013 in 3 pages.
Thompson, Mick, “Getting Started with GEO,” Getting Started with GEO, Jul. 26, 2011.
Traichal et al., “Forecastable Default Risk Premia and Innovations,” Journal of Economics and Finance, Fall 1999, vol. 23, No. 3, pp. 214-225.
trak.io, http://trak.io/ printed Jul. 18, 2013 in 3 pages.
Umagandhi et al., “Search Query Recommendations Using Hybrid User Profile with Query Logs,” International Journal of Computer Applications, vol. 80, No. 10, Oct. 1, 2013, pp. 7-18.
UMBC CMSC 341 Introduction to Trees dated Aug. 3, 2007.
UserMetrix, http://usermetrix.com/android-analytics printed Jul. 18, 2013 in 3 pages.
Valentini et al., “Ensembles of Learning Machines”, M. Marinaro and R. Tagliaferri (Eds.): WIRN VIETRI 2002, LNCS 2486, pp. 3-20.
Vose et al., “Help File for ModelRisk Version 5,” 2007, Vose Software, pp. 349-353. [Uploaded in 2 Parts].
Wagner et al., “Dynamic Shortest Paths Containers,” Electronic Notes in Theoretical Computer Science, vol. 92, No. 1, 2003, pp. 1-19.
Wahl, Jim, “How to Create a Small Multiple Masterpiece in Tableau (v.4 vs v.5)”, Nov. 10, 2014, pp. 20, https://www.dataz.io/pages/diffpages.action?originalId=1278132&pageId=1277980.
Wang et al., “Research on a Clustering Data De-Duplication Mechanism Based on Bloom Filter,” IEEE 2010, 5 pages.
Warren, Christina, “TUAW Faceoff: Screenshot apps on the firing line,” http://www.tuaw.com/2008/05/05/tuaw-faceoff-screenshot-apps-on-the-firing-line/, May 5, 2008, pp. 11.
Wikipedia, “Federated Database System,” Sep. 7, 2013, retrieved from the internet on Jan. 27, 2015 http://en.wikipedia.org/w/index.php?title=Federated_database_system&oldid=571954221.
Wikipedia, “Multimap,” Jan. 1, 2013, https://en.wikipedia.org/w/index.php?title=Multimap&oldid=530800748.
Wollrath et al., “A Distributed Object Model for the Java System,” Proceedings of the 2nd Conference on USENEX, Conference on Object-Oriented Technologies (COOTS), Jun. 17, 1996, pp. 219-231.
Wright et al., “Palantir Technologies VAST 2010 Challenge Text Records—Investigations into Arms Dealing,” Oct. 29, 2010, pp. 1-10, retrieved from the internet http://hcil2.cs.umd.edu/newvarepository/VAST%20Challenge%202010/challenges/MC1%20-%20Investigations%20into%20Arms%20Dealing/entries/Palantir%20Technologies/ retrieved on Aug. 20, 2015.
Yahoo, http://web.archive.org/web/20020124161606/http://finance.yahoo.com/q?s=%05eIXIC&d=c . . . printed Mar. 6, 2012 in 2 pages.
Yang et al., “An Enhanced Routing Method with Dijkstra Algorithm and AHP Analysis in GIS-based Emergency Plan,” Geoinformatics, 2010 18th International Conference on, IEEE, Piscataway, New Jersey, Jun. 18, 2010, 6 pages.
Yang et al., “HTML Page Analysis Based on Visual Cues”, A129, pp. 859-864, 2001.
International Search Report and Written Opinion for Patent Application No. PCT/US2008/056439 dated Jun. 8, 2009.
International Search Report and Written Opinion for Patent Application No. PCT/US2008/077244 dated Nov. 28, 2008.
International Search Report and Written Opinion for Patent Application No. PCT/US2009/056700 dated Apr. 15, 2010.
International Search Report and Written Opinion for Patent Application No. PCT/US2009/056703 dated Mar. 15, 2010.
International Search Report and Written Opinion for Patent Application No. PCT/US2009/056705 dated Mar. 26, 2010.
International Search Report and Written Opinion for Patent Application No. PCT/US2009/056738 dated Mar. 29, 2010.
International Search Report and Written Opinion for Patent Application No. PCT/US2009/056742 dated Apr. 19, 2010.
Notice of Acceptance for Australian Patent Application No. 2014250678 dated Oct. 7, 2015.
Notice of Allowance for U.S. Appl. No. 12/556,318 dated Nov. 2, 2015.
Notice of Allowance for U.S. Appl. No. 13/196,788 dated Dec. 18, 2015.
Notice of Allowance for U.S. Appl. No. 13/411,291 dated Apr. 22, 2016.
Notice of Allowance for U.S. Appl. No. 13/657,635 dated Jan. 29, 2016.
Notice of Allowance for U.S. Appl. No. 13/657,656 dated May 10, 2016.
Notice of Allowance for U.S. Appl. No. 13/826,228 dated Mar. 27, 2015.
Notice of Allowance for U.S. Appl. No. 13/827,627 dated Apr. 11, 2016.
Notice of Allowance for U.S. Appl. No. 13/922,212 dated Mar. 9, 2016.
Notice of Allowance for U.S. Appl. No. 14/019,534 dated Feb. 4, 2016.
Notice of Allowance for U.S. Appl. No. 14/102,394 dated Aug. 25, 2014.
Notice of Allowance for U.S. Appl. No. 14/108,187 dated Aug. 29, 2014.
Notice of Allowance for U.S. Appl. No. 14/135,289 dated Oct. 14, 2014.
Notice of Allowance for U.S. Appl. No. 14/148,568 dated Aug. 26, 2015.
Notice of Allowance for U.S. Appl. No. 14/149,608 dated Aug. 5, 2014.
Notice of Allowance for U.S. Appl. No. 14/192,767 dated Dec. 16, 2014.
Notice of Allowance for U.S. Appl. No. 14/225,084 dated May 4, 2015.
Notice of Allowance for U.S. Appl. No. 14/265,637 dated Feb. 13, 2015.
Notice of Allowance for U.S. Appl. No. 14/268,964 dated Dec. 3, 2014.
Notice of Allowance for U.S. Appl. No. 14/294,098 dated Dec. 29, 2014.
Notice of Allowance for U.S. Appl. No. 14/302,279 dated Apr. 5, 2016.
Notice of Allowance for U.S. Appl. No. 14/304,741 dated Apr. 7, 2015.
Notice of Allowance for U.S. Appl. No. 14/319,161 dated May 4, 2015.
Notice of Allowance for U.S. Appl. No. 14/323,935 dated Oct. 1, 2015.
Notice of Allowance for U.S. Appl. No. 14/326,738 dated Nov. 18, 2015.
Notice of Allowance for U.S. Appl. No. 14/473,552 dated Jul. 24, 2015.
Notice of Allowance for U.S. Appl. No. 14/473,860 dated Jan. 5, 2015.
Notice of Allowance for U.S. Appl. No. 14/479,863 dated Mar. 31, 2015.
Notice of Allowance for U.S. Appl. No. 14/486,991 dated May 1, 2015.
Notice of Allowance for U.S. Appl. No. 14/504,103 dated May 18, 2015.
Notice of Allowance for U.S. Appl. No. 14/552,336 dated Nov. 3, 2015.
Notice of Allowance for U.S. Appl. No. 14/581,902 dated Nov. 13, 2015.
Notice of Allowance for U.S. Appl. No. 14/616,080 dated Apr. 2, 2015.
Notice of Allowance for U.S. Appl. No. 14/746,671 dated Jan. 21, 2016.
Notice of Allowance for U.S. Appl. No. 14/923,364 dated May 6, 2016.
Notice of Allowance for U.S. Appl. No. 15/066,970 dated Jun. 29, 2016.
Official Communication for Australian Patent Application No. 2014201511 dated Feb. 27, 2015.
Official Communication for Australian Patent Application No. 2014202442 dated Mar. 19, 2015.
Official Communication for Australian Patent Application No. 2014210604 dated Jun. 5, 2015.
Official Communication for Australian Patent Application No. 2014210614 dated Jun. 5, 2015.
Official Communication for Australian Patent Application No. 2014213553 dated May 7, 2015.
Official Communication for Australian Patent Application No. 2014250678 dated Jun. 17, 2015.
Official Communication for Canadian Patent Application No. 2807899 dated Jul. 20, 2015.
Official Communication for Canadian Patent Application No. 2828264 dated Apr. 11, 2016.
Official Communication for Canadian Patent Application No. 2829266 dated Apr. 1, 2016.
Official Communication for Canadian Patent Application No. 2846414 dated Apr. 13, 2016.
Official Communication for European Patent Application No. 09812700.3 dated Apr. 3, 2014.
Official Communication for European Patent Application No. 09813693.0 dated Apr. 8, 2014.
Official Communication for European Patent Application No. 13157474.1 dated Apr. 29, 2016.
Official Communication for European Patent Application No. 13157474.1 dated Oct. 30, 2015.
Official Communication for European Patent Application No. 14158861.6 dated Jun. 16, 2014.
Official Communication for European Patent Application No. 14159175.0 dated Feb. 4, 2016.
Official Communication for European Patent Application No. 14159418.4 dated Oct. 8, 2014.
Official Communication for European Patent Application No. 14159464.8 dated Feb. 18, 2016.
Official Communication for European Patent Application No. 14159464.8 dated Jul. 31, 2014.
Official Communication for European Patent Application No. 14162372.8 dated Apr. 30, 2015.
Official Communication for European Patent Application No. 14180142.3 dated Feb. 6, 2015.
Official Communication for European Patent Application No. 14180281.9 dated Jan. 26, 2015.
Official Communication for European Patent Application No. 14180321.3 dated Apr. 17, 2015.
Official Communication for European Patent Application No. 14180432.8 dated Jun. 23, 2015.
Official Communication for European Patent Application No. 14186225.0 dated Feb. 13, 2015.
Official Communication for European Patent Application No. 14187739.9 dated Jul. 6, 2015.
Official Communication for European Patent Application No. 14187996.5 dated Feb. 12, 2015.
Official Communication for European Patent Application No. 14189344.6 dated Feb. 20, 2015.
Official Communication for European Patent Application No. 14189347.9 dated Mar. 4, 2015.
Official Communication for European Patent Application No. 14189802.3 dated May 11, 2015.
Official Communication for European Patent Application No. 14191540.5 dated May 27, 2015.
Official Communication for European Patent Application No. 14197879.1 dated Apr. 28, 2015.
Official Communication for European Patent Application No. 14197895.7 dated Apr. 28, 2015.
Official Communication for European Patent Application No. 14197938.5 dated Apr. 28, 2015.
Official Communication for European Patent Application No. 14199182.8 dated Mar. 13, 2015.
Official Communication for European Patent Application No. 14200246.8 dated May 29, 2015.
Official Communication for European Patent Application No. 14200298.9 dated May 13, 2015.
Official Communication for European Patent Application No. 15155845.9 dated Oct. 6, 2015.
Official Communication for European Patent Application No. 15155846.7 dated Jul. 8, 2015.
Official Communication for European Patent Application No. 15159520.4 dated Jul. 15, 2015.
Official Communication for European Patent Application No. 15165244.3 dated Aug. 27, 2015.
Official Communication for European Patent Application No. 15175106.2 dated Nov. 5, 2015.
Official Communication for European Patent Application No. 15175151.8 dated Nov. 25, 2015.
Official Communication for European Patent Application No. 15181419.1 dated Sep. 29, 2015.
Official Communication for European Patent Application No. 15183721.8 dated Nov. 23, 2015.
Official Communication for European Patent Application No. 15184764.7 dated Dec. 14, 2015.
Official Communication for Great Britain Patent Application No. 1318666.3 dated Mar. 25, 2014.
Official Communication for Great Britain Patent Application No. 1318667.1 dated Mar. 28, 2014.
Official Communication for Great Britain Patent Application No. 1404457.2 dated Aug. 14, 2014.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Jun. 11, 2015.
Official Communication for Great Britain Patent Application No. 1408025.3 dated Nov. 6, 2014.
Official Communication for Great Britain Patent Application No. 1413935.6 dated Jan. 27, 2015.
Official Communication for Netherlands Patent Application No. 2011613 dated Aug. 13, 2015.
Official Communication for Netherlands Patent Application No. 2011627 dated Aug. 14, 2015.
Official Communication for Netherlands Patent Application No. 2012417 dated Sep. 18, 2015.
Official Communication for Netherlands Patent Application No. 2012421 dated Sep. 18, 2015.
Official Communication for Netherlands Patent Application No. 2012436 dated Nov. 6, 2015.
Official Communication for Netherlands Patent Application No. 2012437 dated Sep. 18, 2015.
Official Communication for Netherlands Patent Application No. 2012438 dated Sep. 21, 2015.
Official Communication for Netherlands Patent Application No. 2013306 dated Apr. 24, 2015.
Official Communication for New Zealand Patent Application No. 622513 dated Apr. 3, 2014.
Official Communication for New Zealand Patent Application No. 622517 dated Apr. 3, 2014.
Official Communication for New Zealand Patent Application No. 623323 dated Apr. 17, 2014.
Official Communication for New Zealand Patent Application No. 623323 dated Jun. 6, 2014.
Official Communication for New Zealand Patent Application No. 624557 dated May 14, 2014.
Official Communication for New Zealand Patent Application No. 627962 dated Aug. 5, 2014.
Official Communication for New Zealand Patent Application No. 628263 dated Aug. 12, 2014.
Official Communication for New Zealand Patent Application No. 628495 dated Aug. 19, 2014.
Official Communication for New Zealand Patent Application No. 628585 dated Aug. 26, 2014.
Official Communication for New Zealand Patent Application No. 628840 dated Aug. 28, 2014.
Official Communication for U.S. Appl. No. 12/210,947 dated Jul. 1, 2013.
Official Communication for U.S. Appl. No. 12/210,947 dated Aug. 19, 2014.
Official Communication for U.S. Appl. No. 12/210,947 dated Nov. 28, 2014.
Official Communication for U.S. Appl. No. 12/210,947 dated Apr. 8, 2011.
Official Communication for U.S. Appl. No. 12/210,980 dated Mar. 10, 2015.
Official Communication for U.S. Appl. No. 12/556,318 dated Jul. 2, 2015.
Official Communication for U.S. Appl. No. 12/556,321 dated Feb. 25, 2016.
Official Communication for U.S. Appl. No. 12/556,321 dated Oct. 6, 2016.
Official Communication for U.S. Appl. No. 12/556,321 dated Jul. 7, 2015.
Official Communication for U.S. Appl. No. 13/079,690 dated Sep. 11, 2013.
Official Communication for U.S. Appl. No. 13/079,690 dated Jan. 29, 2014.
Official Communication for U.S. Appl. No. 13/079,690 dated Mar. 5, 2015.
Official Communication for U.S. Appl. No. 13/196,788 dated Oct. 23, 2015.
Official Communication for U.S. Appl. No. 13/196,788 dated Nov. 25, 2015.
Official Communication for U.S. Appl. No. 13/218,238 dated Nov. 21, 2013.
Official Communication for U.S. Appl. No. 13/218,238 dated Oct. 25, 2013.
Official Communication for U.S. Appl. No. 13/218,238 dated Jul. 29, 2013.
Official Communication for U.S. Appl. No. 13/218,238 dated Jan. 6, 2014.
Official Communication for U.S. Appl. No. 13/247,987 date Apr. 2, 2015.
Official Communication for U.S. Appl. No. 13/247,987 dated Sep. 22, 2015.
Official Communication for U.S. Appl. No. 13/411,291 dated Oct. 1, 2015.
Official Communication for U.S. Appl. No. 13/411,291 dated Jul. 15, 2015.
Official Communication for U.S. Appl. No. 13/657,635 dated Jul. 10, 2014.
Official Communication for U.S. Appl. No. 13/657,635 dated Oct. 7, 2015.
Official Communication for U.S. Appl. No. 13/669,274 dated May 6, 2015.
Official Communication for U.S. Appl. No. 13/728,879 dated Mar. 17, 2015.
Official Communication for U.S. Appl. No. 13/799,535 dated Jul. 29, 2014.
Official Communication for U.S. Appl. No. 13/799,535 dated Feb. 3, 2014.
Official Communication for U.S. Appl. No. 13/827,491 dated Jun. 22, 2015.
Official Communication for U.S. Appl. No. 13/827,491 dated Mar. 30, 2016.
Official Communication for U.S. Appl. No. 13/827,491 dated Oct. 9, 2015.
Official Communication for U.S. Appl. No. 13/827,627 dated Oct. 20, 2015.
Official Communication for U.S. Appl. No. 13/827,627 dated Dec. 22, 2015.
Official Communication for U.S. Appl. No. 13/827,627 dated Aug. 26, 2015.
Official Communication for U.S. Appl. No. 13/831,791 dated Aug. 6, 2015.
Official Communication for U.S. Appl. No. 13/835,688 dated Jun. 17, 2015.
Official Communication for U.S. Appl. No. 13/839,026 dated Aug. 4, 2015.
Official Communication for U.S. Appl. No. 13/922,212 dated Jan. 5, 2015.
Official Communication for U.S. Appl. No. 13/937,063 dated Apr. 22, 2016.
Official Communication for U.S. Appl. No. 14/019,534 dated Jul. 20, 2015.
Official Communication for U.S. Appl. No. 14/019,534 dated Sep. 4, 2015.
Official Communication for U.S. Appl. No. 14/025,653 dated Mar. 3, 2016.
Official Communication for U.S. Appl. No. 14/025,653 dated Oct. 6, 2015.
Official Communication for U.S. Appl. No. 14/134,558 dated May 16, 2016.
Official Communication for U.S. Appl. No. 14/134,558 dated Oct. 7, 2015.
Official Communication for U.S. Appl. No. 14/141,252 dated Oct. 8, 2015.
Official Communication for U.S. Appl. No. 14/148,568 dated Oct. 22, 2014.
Official Communication for U.S. Appl. No. 14/148,568 dated Mar. 26, 2015.
Official Communication for U.S. Appl. No. 14/196,814 dated May 5, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 10, 2014.
Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 2, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Dec. 21, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Feb. 27, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 11, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 2, 2014.
Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 20, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Jan. 4, 2016.
Official Communication for U.S. Appl. No. 14/225,160 dated Feb. 11, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated Aug. 12, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated May 20, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated Oct. 22, 2014.
Official Communication for U.S. Appl. No. 14/225,160 dated Jul. 29, 2014.
Official Communication for U.S. Appl. No. 14/265,637 dated Nov. 18, 2014.
Official Communication for U.S. Appl. No. 14/265,637 dated Sep. 26, 2014.
Official Communication for U.S. Appl. No. 14/268,964 dated Sep. 3, 2014.
Official Communication for U.S. Appl. No. 14/289,596 dated Jul. 18, 2014.
Official Communication for U.S. Appl. No. 14/289,596 dated Jan. 26, 2015.
Official Communication for U.S. Appl. No. 14/289,596 dated Apr. 30, 2015.
Official Communication for U.S. Appl. No. 14/289,599 dated Jul. 22, 2014.
Official Communication for U.S. Appl. No. 14/289,599 dated May 29, 2015.
Official Communication for U.S. Appl. No. 14/289,599 dated Sep. 4, 2015.
Official Communication for U.S. Appl. No. 14/294,098 dated Aug. 15, 2014.
Official Communication for U.S. Appl. No. 14/294,098 dated Nov. 6, 2014.
Official Communication for U.S. Appl. No. 14/302,279 dated Sep. 24, 2015.
Official Communication for U.S. Appl. No. 14/304,741 dated Mar. 3, 2015.
Official Communication for U.S. Appl. No. 14/304,741 dated Aug. 6, 2014.
Official Communication for U.S. Appl. No. 14/306,138 dated Sep. 14, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated Feb. 18, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated Sep. 23, 2014.
Official Communication for U.S. Appl. No. 14/306,138 dated Dec. 24, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated May 26, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated Dec. 3, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Feb. 19, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Dec. 24, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Aug. 7, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Sep. 9, 2014.
Official Communication for U.S. Appl. No. 14/306,154 dated Mar. 11, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated May 15, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated Nov. 16, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated Jul. 6, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated Sep. 9, 2014.
Official Communication for U.S. Appl. No. 14/319,161 dated Jan. 23, 2015.
Official Communication for U.S. Appl. No. 14/319,765 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/319,765 dated Jun. 16, 2015.
Official Communication for U.S. Appl. No. 14/319,765 dated Nov. 25, 2014.
Official Communication for U.S. Appl. No. 14/319,765 dated Feb. 4, 2015.
Official Communication for U.S. Appl. No. 14/323,935 dated Jun. 22, 2015.
Official Communication for U.S. Appl. No. 14/323,935 dated Nov. 28, 2014.
Official Communication for U.S. Appl. No. 14/323,935 dated Mar. 31, 2015.
Official Communication for U.S. Appl. No. 14/326,738 dated Dec. 2, 2014.
Official Communication for U.S. Appl. No. 14/326,738 dated Jul. 31, 2015.
Official Communication for U.S. Appl. No. 14/326,738 dated Mar. 31, 2015.
Official Communication for U.S. Appl. No. 14/451,221 dated Oct. 21, 2014.
Official Communication for U.S. Appl. No. 14/463,615 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Nov. 13, 2014.
Official Communication for U.S. Appl. No. 14/463,615 dated May 21, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Jan. 28, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Dec. 9, 2015.
Official Communication for U.S. Appl. No. 14/473,552 dated Feb. 24, 2015.
Official Communication for U.S. Appl. No. 14/479,863 dated Dec. 26, 2014.
Official Communication for U.S. Appl. No. 14/483,527 dated Jun. 22, 2015.
Official Communication for U.S. Appl. No. 14/483,527 dated Jan. 28, 2015.
Official Communication for U.S. Appl. No. 14/483,527 dated Oct. 28, 2015.
Official Communication for U.S. Appl. No. 14/486,991 dated Mar. 10, 2015.
Official Communication for U.S. Appl. No. 14/490,612 dated Aug. 18, 2015.
Official Communication for U.S. Appl. No. 14/504,103 dated Mar. 31, 2015.
Official Communication for U.S. Appl. No. 14/504,103 dated Feb. 5, 2015.
Official Communication for U.S. Appl. No. 14/516,386 dated Feb. 24, 2016.
Official Communication for U.S. Appl. No. 14/516,386 dated Apr. 27, 2017.
Official Communication for U.S. Appl. No. 14/516,386 dated Jun. 30, 2016.
Official Communication for U.S. Appl. No. 14/516,386 dated Nov. 4, 2016.
Official Communication for U.S. Appl. No. 14/552,336 dated Jul. 20, 2015.
Official Communication for U.S. Appl. No. 14/562,524 dated Nov. 10, 2015.
Official Communication for U.S. Appl. No. 14/562,524 dated Sep. 14, 2015.
Official Communication for U.S. Appl. No. 14/562,524 dated Feb. 18, 2016.
Official Communication for U.S. Appl. No. 14/571,098 dated Nov. 10, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 24, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 5, 2015.
Official Communication for U.S. Appl. No. 14/579,752 dated Aug. 19, 2015.
Official Communication for U.S. Appl. No. 14/579,752 dated May 26, 2015.
Official Communication for U.S. Appl. No. 14/618,213 dated May 16, 2017.
Official Communication for U.S. Appl. No. 14/631,633 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/639,606 dated Oct. 16, 2015.
Official Communication for U.S. Appl. No. 14/639,606 dated May 18, 2015.
Official Communication for U.S. Appl. No. 14/639,606 dated Jul. 24, 2015.
Official Communication for U.S. Appl. No. 14/676,621 dated Oct. 29, 2015.
Official Communication for U.S. Appl. No. 14/676,621 dated Jul. 30, 2015.
Official Communication for U.S. Appl. No. 14/715,834 dated Apr. 13, 2016.
Official Communication for U.S. Appl. No. 14/715,834 dated Jun. 28, 2016.
Official Communication for U.S. Appl. No. 14/715,834 dated Feb. 19, 2016.
Official Communication for U.S. Appl. No. 14/726,211 dated Apr. 5, 2016.
Official Communication for U.S. Appl. No. 14/726,353 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/746,671 dated Nov. 12, 2015.
Official Communication for U.S. Appl. No. 14/800,447 dated Dec. 10, 2015.
Official Communication for U.S. Appl. No. 14/813,749 dated Sep. 28, 2015.
Official Communication for U.S. Appl. No. 14/842,734 dated Nov. 19, 2015.
Official Communication for U.S. Appl. No. 14/877,229 dated Mar. 22, 2016.
Official Communication for U.S. Appl. No. 14/923,374 dated May 23, 2016.
Official Communication for U.S. Appl. No. 14/923,374 dated Feb. 9, 2016.
Official Communication for U.S. Appl. No. 15/017,324 dated Apr. 22, 2016.
Restriction Requirement for U.S. Appl. No. 13/839,026 dated Apr. 2, 2015.
International Search Report and Written Opinion for Patent Application No. PCT/US2008/077528 dated Dec. 4, 2008.
Notice of Acceptance for Australian Patent Application No. 2014201553 dated Feb. 19, 2018.
Notice of Acceptance for Australian Patent Application No. 2014201558 dated Mar. 1, 2018.
Official Communication for U.S. Appl. No. 14/562,420 dated Nov. 17, 2017.
Official Communication for U.S. Appl. No. 15/220,021 dated Dec. 14, 2017.
Official Communication for U.S. Appl. No. 12/556,321 dated Mar. 26, 2018.
Official Communication for U.S. Appl. No. 14/562,420 dated May 25, 2018.
Official Communication for U.S. Appl. No. 14/618,213 dated Mar. 29, 2018.
Official Communication for U.S. Appl. No. 15/847,720 dated Jun. 12, 2018.
Official Communication for U.S. Appl. No. 15/847,720 dated Mar. 8, 2018.
Provisional Applications (1)
Number Date Country
61914229 Dec 2013 US
Continuations (1)
Number Date Country
Parent 14304741 Jun 2014 US
Child 14816599 US