Assessing and managing computational risk involved with integrating third party computing functionality within a computing system

Information

  • Patent Grant
  • 11816224
  • Patent Number
    11,816,224
  • Date Filed
    Monday, October 31, 2022
    a year ago
  • Date Issued
    Tuesday, November 14, 2023
    6 months ago
Abstract
In general, various aspects of the present disclosure provide methods, apparatuses, systems, computing devices, computing entities, and/or the like for addressing a modified risk rating identifying a risk to an entity of having computer-implemented functionality provided by a vendor integrated with a computing system of the entity. In accordance various aspects, a method is provided that comprises: receiving a first assessment dataset for computer-implemented functionality; detecting an inconsistency between a value of an attribute for the computer-implemented functionality specified in the first assessment dataset and a corresponding value of the attribute specified in a second assessment dataset for the computer-implemented functionality; modifying a risk rating that identifies a risk to the entity of having the computer-implemented functionality integrated with the computing system to generate a modified risk rating based on the inconsistency; and in response, performing an action with respect to the computing system to address the modified risk rating.
Description
TECHNICAL FIELD

The present disclosure is generally related to data processing systems and methods for assisting entities in a manner to ensure proper access control, usage control, and protection of data involved with computer-implemented functionality provided by a vendor from maliciously caused destruction, unauthorized modification, or unauthorized disclosure.


BACKGROUND

Significant technical challenges are often encountered by entities (e.g., organizations, companies, institutes, and/or the like) with respect to integrating computing systems of the entities with computer-implemented functionality (e.g., services, software applications, computing system capacity, and/or the like) provided by independent third party entities, also referred to as vendors. For example, a particular entity may use a computing system in supporting an e-commerce website. Here, the entity may integrate computer-implemented functionality in the form of a service with the computing system that is provided through a vendor to validate the identity of visitors to a website. Visitors to the website may provide identifying information that the computing system submits to the integrated service to validate the visitors' identities. For example, the service may be provided in a software-as-a-service environment. Therefore, the integration of the service in the computing system may involve installing an application programming interface (API) within the computing system to provide access to the service over a network such as the Internet.


However, an entity's integration of the service with its computing system can expose the computing system to significant risk. For example, installing the API within the computing system can provide a channel for a nefarious third-party to gain access to the computing system through the vendor's service. Such access can expose the computing system to experiencing a data breach, being hacked, having malware (e.g., a virus and/or ransomware) installed within the computing system, and/or the like. Therefore, any entity that is onboarding computer-implemented functionality provided through a vendor with a computing system of the entity must be able to recognize, manage, and mitigate risks associated with such integration in an effective manner to ensure integrity of the computing system is maintained. Accordingly, a need exists in the art for improved systems and methods to facilitate and assist an entity in successfully recognizing, managing, and mitigating risks associated with integrating computing systems of the entity with computer-implemented functionality (e.g., services, software applications, computing system capacity, and/or the like) provided by vendors.


SUMMARY

In general, various aspects of the present disclosure provide methods, apparatuses, systems, computing devices, computing entities, and/or the like. In accordance various aspects, a method is provided that comprises: providing, by computing hardware, a first question from a set of questions found in an electronic assessment for display on a user interface, wherein the user interface solicits a first answer to the first question, and the set of questions relates to computer-implemented functionality provided by a vendor; receiving, by the computing hardware and via the user interface, the first answer to the first question to provide a first question/answer pairing; mapping, by the computing hardware, the first question/answer pairing to an attribute related to the computing-implemented functionality; mapping, by the computing hardware, the attribute to a second question/answer pairing, wherein the second question/answer pairing: is related to the attribute, comprises a second question of the set of questions, and comprises a second answer provided to the second question; comparing, by the computing hardware, the first answer to the second answer to identify an inconsistency in the first answer with respect to the second answer; determining, by the computing hardware, to address the inconsistency; and responsive to determining to address the inconsistency, performing, by the computing hardware, an action to address the inconsistency, wherein the action comprises at least one of: (1) prompting, via the user interface, to provide at least one of supporting information or supporting documentation to address the inconsistency, (2) providing, via the user interface, a follow up question related to the inconsistency, or (3) requesting, via the user interface, the inconsistency in the first answer to be redressed.


In some aspects, determining to address the inconsistency comprises processing the inconsistency via a decision engine to generate a relevance of the inconsistency, the decision engine comprising a rules-based model configured to use a set of rules in determining a level of the inconsistency as a measure of the relevance of the inconsistency. In some aspects, the method further comprises determining, by the computing hardware, the action to perform by: processing at least one of the first question/answer pairing or the second question/answer pairing using a machine-learning model to generate a data representation having a set of predictions in which each prediction is associated with a particular action to take to address the inconsistency; and selecting, based on the set of predictions, the action to address the inconsistency. In some aspects, the machine-learning model is trained using training data derived from responses to follow up requests previously provided for inconsistencies detected in past assessment question/answer pairings that comprises at least one of (1) whether the inconsistencies detected in the past assessment question/answer pairings were ignored, (2) whether related follow up actions for the inconsistencies detected in the past assessment question/answer pairings were ignored, (3) particular types of actions taken in response to the inconsistencies detected in the past assessment question/answer pairings, or (4) at least one of a framework or standard that is mapped to the past assessment question/answer pairings.


In some aspects, mapping the first question/answer pairing to the attribute related to the computing-implemented functionality and mapping the attribute to the second question/answer pairing is performed via a data structure that maps the first question/answer pairing and the second question/answer pairing to the attribute. In some aspects, the first answer and the second answer are in a freeform text format and comparing the first answer to the second answer to identify the inconsistency in the first answer with respect to the second answer involves: performing a natural language processing technique on the first answer to generate a first embedded representation of the first answer, performing the natural language processing technique on the second answer to generate a second embedded representation of the second answer, and comprising the first embedded representation to the second embedded representation to identify the inconsistency. In some aspects, the method further comprises determining, by the computing hardware, the action to take to address the inconsistency based on at least one of a type of the attribute or a past response to a past inconsistency related to the attribute.


In accordance with various aspects, a system is provided comprising a non-transitory computer-readable medium storing instructions and a processing device communicatively coupled to the non-transitory computer-readable medium. In particular aspects, the processing device is configured to execute the instructions and thereby perform operations comprising: providing a first question found in an electronic assessment for display on a user interface, wherein the user interface solicits a first answer to the first question, and the first question relates to computer-implemented functionality; receiving, via the user interface, the first answer to the first question to provide a first question/answer pairing; mapping the first question/answer pairing to a plurality of attributes related to the computing-implemented functionality; mapping the plurality of attributes to a second question/answer pairing, wherein the second question/answer pairing comprises a second question, and a second answer provided to the second question; comparing the first answer to the second answer to identify an inconsistency in the first answer with respect to the second answer; determining to address the inconsistency; and responsive to determining to address the inconsistency, performing an action to address the inconsistency, wherein the action comprises at least one of: (1) prompting, via the user interface, to provide at least one of supporting information or supporting documentation to address the inconsistency, (2) providing, via the user interface, a follow up question related to the inconsistency, or (3) requesting, via the user interface, the inconsistency in the first answer to be redressed.


In some aspects, determining to address the inconsistency comprises processing the inconsistency using a rules-based model configured to use a set of rules in determining a level of the inconsistency as a measure of a relevance of the inconsistency. In some aspects, the operations further comprise determining the action to perform by: processing at least one of the first question/answer pairing or the second question/answer pairing using a machine-learning model to generate a data representation having a set of predictions in which each prediction is associated with a particular action to take to address the inconsistency; and selecting, based on the set of predictions, the action to address the inconsistency. In some aspects, the machine-learning model is trained using training data derived from responses to follow up requests previously provided for inconsistencies detected in past assessment question/answer pairings that comprises at least one of (1) whether the inconsistencies detected in the past assessment question/answer pairings were ignored, (2) whether related follow up actions for the inconsistencies detected in the past assessment question/answer pairings were ignored, (3) particular types of actions taken in response to the inconsistencies detected in the past assessment question/answer pairings, or (4) at least one of a framework or standard that is mapped to the past assessment question/answer pairings.


In some aspects, mapping the first question/answer pairing to the plurality of attributes related to the computing-implemented functionality and mapping the plurality of attributes to the second question/answer pairing is performed via a data structure that maps the first question/answer pairing and the second question/answer pairing to the plurality of attributes. In some aspects, the first answer and the second answer are in a freeform text format and comparing the first answer to the second answer to identify the inconsistency in the first answer with respect to the second answer involves: performing a natural language processing technique on the first answer to generate a first embedded representation of the first answer, performing the natural language processing technique on the second answer to generate a second embedded representation of the second answer, and comprising the first embedded representation to the second embedded representation to identify the inconsistency. In some aspects, the operations further comprise determining the action to take to address the inconsistency based on at least one of (1) a number of the plurality of attributes, (2) a type of each of the plurality of attributes, or (3) one or more past responses to at least one of the first question/answer pairing being flagged or similar question/answering pairings being flagged that are mapped to attributes similar to the plurality of attributes.


In addition, in accordance with various aspects, a non-transitory computer-readable medium having program code stored thereon is provided. In particular aspects, the program code is executable by one or more processing devices to perform operations comprising: providing a first question found in an electronic assessment for display on a user interface, wherein the user interface solicits a first answer to the first question, and the first question relates to computer-implemented functionality; receiving, via the user interface, the first answer to the first question to provide a first question/answer pairing; mapping the first question/answer pairing to an attribute related to the computing-implemented functionality; mapping the attribute to a second question/answer pairing, wherein the second question/answer pairing comprises a second question, and a second answer provided to the second question; comparing the first answer to the second answer to identify an inconsistency in the first answer with respect to the second answer;


determining to address the inconsistency; and responsive to determining to address the inconsistency, performing an action to address the inconsistency, wherein the action comprises at least one of: (1) prompting, via the user interface, to provide at least one of supporting information or supporting documentation to address the inconsistency, (2) providing, via the user interface, a follow up question related to the inconsistency, or (3) requesting, via the user interface, the inconsistency in the first answer to be redressed.


In some aspects, determining to address the inconsistency comprises processing the inconsistency using a rules-based model configured to use a set of rules in determining a level of the inconsistency as a measure of a relevance of the inconsistency. In some aspects, the operations further comprise determining the action to perform by: processing at least one of the first question/answer pairing or the second question/answer pairing using a machine-learning model to generate a data representation having a set of predictions in which each prediction is associated with a particular action to take to address the inconsistency; and selecting, based on the set of predictions, the action to address the inconsistency.


In some aspects, mapping the first question/answer pairing to the attribute related to the computing-implemented functionality and mapping the attribute to the second question/answer pairing is performed via a data structure that maps the first question/answer pairing and the second question/answer pairing to the attribute. In some aspects, the first answer and the second answer are in a freeform text format and comparing the first answer to the second answer to identify the inconsistency in the first answer with respect to the second answer involves: performing a natural language processing technique on the first answer to generate a first embedded representation of the first answer, performing the natural language processing technique on the second answer to generate a second embedded representation of the second answer, and comprising the first embedded representation to the second embedded representation to identify the inconsistency. In some aspects, the operations further comprise determining the action to take to address the inconsistency based on at least one of a type of the attribute or a past response to a past inconsistency related to the attribute.





BRIEF DESCRIPTION OF THE DRAWINGS

In the course of this description, reference will be made to the accompanying drawings, which are not necessarily drawn to scale, and wherein:



FIG. 1 depicts an example of a computing environment that can be used for recognizing, managing, and mitigating risks associated with an entity integrating computer-implemented functionality provided by vendors with computing systems of the entity in accordance with various aspects of the present disclosure;



FIG. 2 depicts an example of a process for modifying a risk rating for a vendor in accordance with various aspects of the present disclosure;



FIGS. 3A-3D depict an example of a mapping of assessment questions to standards, controls, and/or frameworks that can be used in accordance with various aspects of the present disclosure;



FIG. 4 depicts an example of a process for generating a dynamic assessment completed by a vendor in accordance with various aspects of the present disclosure;



FIG. 5 depicts an example of a process for placing vendors in tiers in accordance with various aspects of the present disclosure;



FIG. 6 depicts an example of a process for processing vendors for various tiers in accordance with various aspects of the present disclosure;



FIG. 7 depicts an example of a process for generating a customized risk rating of a vendor for an entity in accordance with various aspects of the present disclosure;



FIG. 8 depicts an example of a listing of assessment questions related to an entity's use of a particular vendor that can be used in accordance with various aspects of the present disclosure;



FIG. 9 depicts an example of a process for modifying a risk rating of a vendor for an entity in accordance with various aspects of the present disclosure;



FIG. 10 provides an example of a graphical user interface that can be used in accordance with various aspects of the present disclosure;



FIG. 11 depicts an example of a system architecture that may be used in accordance with various aspects of the present disclosure; and



FIG. 12 depicts an example of a computing entity that may be used in accordance with various aspects of the present disclosure.





DETAILED DESCRIPTION

Overview


As noted above, significant technical challenges are often encountered by entities (e.g., organizations, companies, institutes, and/or the like) with respect to integrating computing systems of the entities with computer-implemented functionality (e.g., services, software applications, computing system capacity, and/or the like) provided by independent third party entities, also referred to as vendors. For example, integrating computer-implemented functionality provided through a vendor with a computing system of an entity can introduce the computing system to vulnerabilities such as experiencing a data breach, being compromised by having malware installed on the computing system, losing functionality due to a hacker breaking into the computing system and taking control, and/or the like.


As a specific example, an entity may subscribe to computer-implemented functionality in the form of a service (e.g., software-as-a-service) for providing human resource management functionality. Here, the service may be integrated with a computing system of the entity to provide the entity with human resource management functionality within the computing system. The service may need to gain access to personal data of employees stored within the computing system (e.g., data repository thereof) in performing certain functionality. Therefore, the service may need to have credentials to gain access to the personal data. The service may store such credentials in a cloud computing environment that is used in supporting the service. In addition, the computing system and service may communicate over a network such as the Internet. Accordingly, the integration of the service with the computing system may involve installing an application programming interface (API) within the computing system to facilitate communication between the cloud computing environment supporting the service and the computing system.


However, the cloud computing environment supporting the service is normally under the control of the vendor. Therefore, the entity does not generally have any say as to how the vendor goes about storing the credentials in the cloud environment such as, for example, the security controls that are put into place by the vendor in ensuring the credentials are properly protected from being involved in a data-related incident such as a data breach. As a result, the entity's use of the service can expose the computing system of the entity to significant risk if the vendor is handling the credentials in a poorly secure manner. For example, the vendor may experience a data-related incident involving the cloud computing environment in which the credentials are stolen. This can happen without the vendor's knowledge. The third-party who has stolen the credentials may then be able to use the credentials to gain access to the computing system of the entity. Therefore, any entity that is interested in integrating computer-implemented functionality provided by vendors within a computing system of the entity must be able to successfully recognize, manage, and mitigate risks associated with such integrations.


To combat this problem, many entities will perform an assessment of a vendor when considering integrating computer-implemented functionality provided by the vendor with a computing system of the entity. For example, an entity may have the vendor complete a questionnaire that includes questions on various attributes of the computer-implemented functionality that may influence an amount of risk that may be involved in using the functionality. The entity may then evaluate the vendor's answers to the questions to determine a risk (e.g., risk rating) associated with integrating the computer-implemented functionality with the entity's computing system.


However, a first drawback of performing such an assessment is that the entity's assessment may be lacking in some area that may not necessarily identify a particular risk (and/or level thereof) that is associated with the entity's integration of the vendor's computer-implemented functionality. For example, the questionnaire provided to the vendor may not include the proper questions to identify the particular risk. In addition, the vendor may not always be accurate and/or truthful in answering the questions provided in the questionnaire.


In addition, a second drawback of performing such an assessment is that the assessment may only be performed at a time when the vendor is being considered for providing the computer-implemented functionality, or performed only occasionally once the vendor has been onboarded and the vendor's computer-implemented functionality has been integrated with the entity's computing system. Therefore, any changes instituted by the vendor that may affect the risk (and/or level thereof) associated with providing the computer-implemented functionality may not be recognized and/or appreciated by the entity. For example, the vendor may change the identity verification process used for controlling access to a data repository used in storing credentials used by the vendor in accessing the entity's computing system. As a result, the entity's computing system may be exposed to a risk and/or an increased level of risk due to the change in the identity verification process that the entity is unaware of and/or does not fully appreciate.


Various aspects of the present disclosure overcome many of the technical challenges associated with integrating computing systems of an entity with computer-implemented functionality (e.g., services, software applications, computing system capacity, and/or the like) provided by vendors, such as those discussed above. Specifically, various aspects of the disclosure are directed to a computer-implemented process that facilitates and assists an entity in successfully recognizing, managing, and mitigating risks associated with integrating computing systems of the entity with computer-implemented functionality (e.g., services, software applications, computing system capacity, and/or the like) provided by vendors. In various aspects, a vendor risk management computing system is used in executing the computer-implemented process.


In some aspects, the vendor risk management computing system receives a first assessment dataset for computer-implemented functionality provided by a vendor that is to be integrated with a computing system of an entity. For example, the first assessment dataset may involve question/answer pairings. As a specific example, the entity, or some other entity, may provide the vendor with a questionnaire that includes questions on the computer-implemented functionality. Personnel for the vendor may then provide answers to the questions which in turn become the question/answer pairings found in the first assessment dataset.


The vendor risk management computing system may access a second assessment dataset for the computer-implemented functionality from a data repository that stores risk assessment data on a plurality of computer-implemented functionality provided by different vendors. In various aspects, the data repository serves as a centralized data source for storing assessment datasets collected on various computer-implemented functionality provided by different vendors. For example, the different assessment datasets may be collected through multiple questionnaires that have been provided to the vendors during times when entities are evaluating the vendors with respect to integrating the various computer-implemented functionality with computing systems of the entities.


As a specific example, a first entity may be evaluating a vendor with respect to integrating computer-implemented functionality that involves a service provided by the entity with a computing system of the first entity. For example, integrating the computer-implemented functionality with the computing system may involve installing an application programming interface (API) in the computing system to call the service.


Here, the first entity may provide the vendor with a questionnaire that includes questions on the vendor's computer-implemented functionality. For example, the questionnaire may include one or more questions on the access controls that the vendor has put in place for accessing the service. In addition, the questionnaire may include one or more questions on security controls that the vendor has put into place with respect to sensitive data that the service may use that is collected through the first entity's computing system. In turn, personnel for the vendor may then complete the questionnaire by providing answers to the questions. Multiple personnel may complete the questionnaire so that the first entity may receive multiple sets of answers to the questions that results in multiple assessment datasets. The first entity may then submit the assessment datasets to be stored in the data repository.


Besides the first entity, other entities that are evaluating the vendor with respect to integrating the computer-implemented functionality with computing systems for the entities may do the same in submitting assessment datasets to store in the data repository. Therefore, the data repository can be viewed as a crowdsourcing resource in that the data repository can store assessment datasets that have been collected by multiple entities in evaluating the vendor and corresponding computer-implemented functionality. Accordingly, the data repository can be used in storing assessment datasets for other computer-implemented functionality provided by the vendor, as well as computer-implemented functionality provided by other vendors. Therefore, the data repository can serve as a centralized data source for assessment datasets collected by various entities in evaluating different vendors and different computer-implemented functionality provided by the different vendors.


In various aspects, the vendor risk management computing system detects an inconsistency between a value of an attribute for the computer-implemented functionality that is specified in the first assessment dataset and a corresponding value of the attribute that is specified in the second assessment dataset. For example, the attribute may involve a particular process, control, procedure, function, and/or the like that the vendor has implemented in providing the computer-implemented functionality to various entities. Here, the vendor risk management computing system may detect a different value has been provided for the attribute in the first assessment dataset and the second assessment dataset.


In some aspects, the vendor risk management computing system may identify the value for the attribute based on a mapping of a first question/answer pairing provided in the first assessment dataset. For example, the first question/answer pairing can include a first question provided in a first questionnaire filled out by the vendor and a first answer provided by the vendor to the first question where the value is the first answer. Likewise, the vendor risk management computing system may identify the corresponding value for the attribute based on a mapping of a second question/answer pairing provided in the second assessment dataset. For example, the second question/answer pairing can include a second question provided in a second questionnaire filled out by the vendor and a second answer provided by the vendor to the second question where the value is the second answer.


In some aspects, the vendor risk management computing system modifies a risk rating for the vendor to generate a modified risk rating for the vendor based on the inconsistency. For example, the modified risk rating identifies a risk to the entity of having the computer-implemented functionality integrated with the computing system. Therefore, the entity can use the modified risk rating in determining whether to use the vendor in providing the computer-implemented functionality to integrate with the entity's computing system. In some instances, the vendor risk management computing system may identify the inconsistency and generate the modified risk rating after the entity has already onboarded the vendor and has already integrated the computer-implemented functionality with the computing system. Therefore, the vendor risk management computing system may assist the entity in identifying a change in risk in using the computer-implemented functionality provided by the vendor after the entity has already started using the computer-implemented functionality. Furthermore, the vendor risk management computing system may identify the inconsistency and generate the modified risk rating for the entity based on assessment datasets that did not originate from the entity. Therefore, the vendor risk management computing system may provide the entity with the benefit of recognizing a change in risk in using the computer-implemented functionality based on other entities evaluation of the computer-implemented functionality.


The entity may have multiple computer-implemented functionality provided by various vendors with one or more computing systems of the entity. In some aspects, the vendor risk management computing system may assist the entity in identifying, monitoring, managing, and/or the like the risk related to using of the multiple computer-implement functionality by placing vendors into different risk tiers based on the risk rating assigned to the vendors. For example, the risk tiers may include “Low,” “Medium,” “High,” and “Very High.” The risk tiers can allow personnel for the entity to quickly recognize the risk involved in using computer-implemented functionality for various vendors.


Accordingly, the modified risk rating can move the vendor from a first risk tier for the entity to a second risk tier for the entity. As a result, the vendor risk management computing system may cause performance of one or more actions with respect to the computing system of the entity to address the modified risk rating. For example, the one or more actions may involve sending an electronic notification, such as an email, to personnel of the entity that identifies the inconsistency and the attribute for the computer-implemented functionality. Similarly, the one or more actions may involve sending, in addition or instead, an electronic notification to personnel of the vendor that identifies the inconsistency and the attribute for the computer-implemented functionality. In another example, the one or more actions may involve directly affecting the use of the computer-implemented functionality within the computing system such as causing the computer-implemented functionality to be disabled in the computing system (e.g., disabling the API from calling the service). In some aspects, the one or more actions are defined for the risk tier for the entity. Therefore, the vendor risk management computing system may cause the one or more actions to be performed based on the vendor being moved from a first risk tier to a second risk tier.


As noted, the data repository can serve as a centralized resource for various assessment datasets collected by different entities on different computer-implemented functionality provided by different vendors. Therefore, the vendor risk management computing system may assist multiple entities with identifying, monitoring, managing, and/or the like risk related to the use of multiple computer-implement functionality from different vendors. For example, the computer-implemented functionality being used by the first entity may also be integrated with a second computing system of a second entity that is different from the entity. Accordingly, the modified risk rating may also identify a risk to the second entity of having the computer-implemented functionality integrated with the second computing system and again, the modified risk rating may move the vendor from a first risk tier for the second entity to a second risk tier for the second entity. Therefore, like the first entity, the vendor risk management computing system may cause performance of one or more actions with respect to the second computing system of the second entity to address the modified risk rating.


In some aspects, the vendor risk management computing system may allow for each entity to generate a customized risk rating for a particular vendor if desired. For example, the vendor risk management computing system may provide the first and second entities with a questionnaire that includes questions on each entity's specific integration of computer-implemented functionality with the first and second computing systems. Accordingly, the customized risk rating can be fine-tuned to the entity's particular use of computer-implemented functionality provided by a vendor. Therefore, the vendor risk management computing system may also modify a second risk rating that is unique to the second entity, in addition to the risk rating that is unique to the first entity, to generate a second modified risk rating for the vendor based on the inconsistency that is unique for the second entity.


Accordingly, various aspects of the disclosure provided herein are effective, efficient, reliable, and accurate in assisting various entities with identifying, monitoring, managing, and/or the like risk associated with integrating computer-implemented functionality provided by different vendors with computing systems of the entities. In addition, various aspects of the disclosure provided herein facilitate a centralized resource on assessment datasets provided through various entities that are collected with respect to integrating computer-implemented functionality provided by vendors with computing systems of the entities. This can be a significant advantage in that the centralized resource can serve as a crowdsourcing data source that can allow for an entity to obtain a risk rating for a vendor that may be better representative of the risk of integrating computer-implemented functionality provided by the vendor with a computing system of the entity. Thus, various aspects of the present disclosure make major technical contributions to improving the computational efficiency, security, and reliability of various computing systems in using computer-implemented functionality provided through various vendors. Further detail is now provided for various aspects of the disclosure.


Example Computing Environment



FIG. 1 depicts an example of a computing environment that can assist entities in identifying, monitoring, managing, and/or the like risk associated with integrating computer-implemented functionality provided by different vendors with computing systems of the entities in accordance with various aspects of the present disclosure. Accordingly, FIG. 1 depicts examples of hardware components of a vendor risk management computing system 100 according to some aspects. The vendor risk management computing system 100 is a specialized computing system that can be used for performing risk analysis related to the integration of computer-implemented functionality provided through various vendor computing systems 195 to various entity computing systems 190 of entities. In addition, the vendor risk management computing system 100 can assist entities in identifying, monitoring, managing, and/or the like risk associated with the entities integrating computer-implemented functionality with the various entity computing systems 190.


In various aspects, the vendor risk management computing system 100 may be configured to host a vendor risk management service (e.g., software as a service) used by the different entities that is accessible over one or more networks 175. Here, the vendor risk management computing system 100 includes software components and/or hardware components for facilitating the vendor risk management service. For example, the vendor risk management computing system 100 may be hosting the vendor risk management service as one or more microservices within the vendor risk management computing system 100. The vendor risk management computing system 100 may provide access to the vendor risk management service over the one or more networks 175 (e.g., the Internet) to an entity (e.g., an entity computing system 190 associated with the entity) that has subscribed to the service and is considered a “tenant” of the vendor risk management computing system 100. Personnel of the entity may access the vendor risk management service over the one or more networks 175 through one or more graphical user interfaces (e.g., webpages) 180 and use the vendor risk management service. In addition to the graphical user interfaces 180, the vendor risk management computing system 100 may include one or more interfaces (e.g., application programming interfaces (APIs)) and/or components for communicating and/or accessing the entity computing systems 190 and/or vendor computing systems 195 over the network(s) 175.


Here, an entity computing system 190 for an entity may include computing hardware and/or software that may involve the integration of various computer-implemented functionality provided through a vendor computing system 195. For example, the entity computing system 190 may integrate computer-implemented functionality provided through the vendor computing system 195 by installing an API within the entity computing system 190 that is used to communicate with a service provided through the vendor computing system 195. In another example, the entity computing system 190 may integrate computer-implemented functionality provide through the vendor computing system 195 by utilizing data storage found within the vendor computing system 195.


Accordingly, the vendor computing system 195 is operated by a vendor other than the particular entity. Thus, the vendor computing system 195 generally includes computing hardware and software that the particular entity has no control over or access to, but which provides the computer-implemented functionality that is integrated with the entity computing system 190 for the particular entity. Therefore, the entity computing system 190 can be exposed to risk introduced by integrating the computer-implemented functionality provided through the vendor computing system 195.


For example, the entity computing system 190 may be exposed to risk of experiencing a data-related incident such as a data breach as a result of integrating the computer-implemented functionality provided through the vendor computing system 195. Therefore, the entity may be interested in using the vendor risk management service in performing a risk analysis on integrating the computer-implemented functionality provided through the vendor computing system 195 with the entity computing system 190. In addition, the entity may be interested in using the vendor risk management service in monitoring and managing the risk involved with using the computer-implemented functionality once the computer-implemented functionality has been integrated with the entity computing system 190.


In various aspects, the vendor risk management computing system 100 includes a data repository 170 that can be used as a centralized resource for assessment datasets gathered on computer-implemented functionality provided by different vendors. For example, the data repository 170 may comprise one or more databases used in storing the assessment datasets. In addition, the data repository 170 may be used in storing other data utilized within the vendor risk management computing system such as questionnaires that may be completed by vendors on the different computer-implemented functionality they may provide, as well as questionnaires that may be completed by entities on different computer-implemented functionality provided by vendors that the entities have (or plan to) integrate with entity computing systems 190.


In various aspects, the vendor risk management computing system 100 can receive the assessment datasets from entities (e.g., entity computing systems 190) and/or vendors (e.g., vendor computing system 195). Accordingly, the vendor risk management computing system 100 can use the assessment datasets in performing certain functionality associated with evaluating risk associated with the integration of computer-implemented functionality provided by the vendors with entity computing systems 195, as well as assist entities in identifying, monitoring, and managing the risk.


The vendor risk management computing system 100 may include computing hardware performing a number of different processes in providing functionality associated with the vendor risk management service. Specifically, in various aspects, the vendor risk management computing system 100 executes: (1) a modification module 110 to modify a risk rating for a vendor based on an inconsistency detected between assessment datasets; (2) a dynamic assessment module 120 to generate a dynamic assessment completed by a vendor; (3) a tier module 130 to place vendors in tiers; (4) a risk mitigation module 140 to process vendors for various tiers; (5) a custom module 150 to generate a customized risk rating of a vendor for an entity; and/or (6) a custom modification module 160 to modify a risk rating of a vendor for an entity. Further detail is provided below regarding the configuration and functionality of the modification module 110, the dynamic assessment module 120, the tier module 130, the risk mitigation module 140, the custom module 150, and the custom modification module 160 according to various aspects of the disclosure.


Modification Module


Turning now to FIG. 2, additional details are provided regarding a modification module 110 for modifying a risk rating for a vendor based on an inconsistency detected between assessment datasets in accordance with various aspects of the disclosure. For instance, the flow diagram shown in FIG. 2 may correspond to operations carried out, for example, by computing hardware found in the vendor risk management computing system 100 as described herein, as the computing hardware executes the modification module 110.


As previously noted, a vendor may receive risk assessments from various entities that may be interested in integrating computer-implemented functionality provided by the vendor with entity computing systems 190 for the entities. For example, the risk assessments may be in the form of a questionnaire that asks the vendor certain questions with respect to the computer-implemented functionality. The risk assessments are generally used in evaluating the risk of integrating the computer-implemented functionality with the entity computing systems 190. For example, a questionnaire may ask the vendor to indication whether the vendor is using certain access controls such as two-factor authentication for the computer-implemented functionality. Accordingly, the use or lack of use of the access controls can indicate to an entity a level (e.g., amount) of risk that is involved with integrating the computer-implemented functionality with an entity computing system 190.


Therefore, the vendor risk management computing system 100 may receive and store completed risk assessments in the form of assessment datasets for the particular vendor from different entities, as well as different sources within the particular vendor (e.g., from personnel in different departments within the particular vendor, from different personnel within the same department within the particular vendor, from different subsidiaries of the particular vendor, etc.). In turn, the assessment datasets may be stored in a data repository 170 within the vendor risk management computing system 100 as previously discussed. Therefore, the data repository 170 can serve as a centralized resource of assessment datasets that may have been collected by a number of different entities to facilitate crowdsourcing of assessments on the vendor.


In various aspects, each of the assessment datasets may include respective answers (e.g., values) to each question within the completed risk assessment to form question/answer pairings. In some aspects, each question/answer pairing may correspond to one or more attributes associated with the particular computer-implemented functionality being provided by the vendor. Therefore, the assessment datasets collected on the particular computer-implemented functionality can be compared to identify whether the vendor has provided consistent information in the assessments. If not, then a risk rating for the vendor may be modified to reflect the inconsistency. For example, such a comparison may be performed when a new completed assessment dataset is uploaded to the vendor risk management computing system 100 by an entity or the vendor for the particular computer-implemented functionality.


Accordingly, the process 200 involves the modification module 110 receiving the newly completed assessment dataset at Operation 210. At Operation 215, the modification module 110 parses the newly completed assessment dataset into question/answer pairings. For example, the newly completed assessment dataset may be based on a questionnaire provided as an electronic form. The electronic form may have been viewed by personnel for the vendor on a computing device. The electronic form may have presented the personnel with questions along with fields to provide answers to the questions. Therefore, the modification module 110 parses the questions and corresponding answers provided in the electronic form into the question/answer pairings.


At Operation 220, the modification module 110 maps the question/answer pairings to attributes for the computer-implemented functionality. In some aspects, the modification module 110 may access a data structure that provides a mapping of the question/answer pairings to the attributes. For example, the attributes may be particular controls that are to be implemented by the vendor for the computer-implemented functionality according to one or more standards and/or frameworks (e.g., FFIEC Cat Tool, PCI 3.2, FFIEC IT Mgmt Handbook, NIST SP 800-53, NIST Cybersecurity Framework, HIPPA Simplification, EU GDPR, SOC 1, SOC 2, etc.). In some aspects, multiple questions within the assessment may map to a same control associated with the one or more standards and/or frameworks.


Turning briefly to FIGS. 3A-3D, an example of a mapping 300 is provided of particular question/answer pairings to one or more standards and/or frameworks (e.g., in addition to particular controls related to each of the standards and frameworks). As may be understood from FIGS. 3A-3D, the mapping 300 may correspond to one or more fields in a data structure that indicates a particular question/answer pairing and a mapping of each particular question/answer pairing to one or more attributes (e.g., controls) as defined by various standards/frameworks.


Once the modification module 110 has mapped each of the question/answer pairings, the modification module 110 retrieves one or more assessment datasets for the vendor that are related to the computer-implemented functionality at Operation 225. For example, the modification module 110 may query the one or more assessment datasets from the data repository 170 used within the vendor risk management computing system 100 for storing the assessment datasets. Here, the modification module 110 may retrieve one or more assessment datasets that are associated with a particular entity (e.g., the entity that has provided the completed assessment dataset) or multiple entities. For example, personnel for the entity that has provided the completed assessment dataset may also provide criteria along with the assessment dataset for querying the one or more assessment datasets to use in detecting inconsistencies in the newly completed assessment dataset.


At Operation 230, the modification module 110 selects one of the retrieved assessment datasets. The modification module 110 then maps the attributes for the question/answer pairings to the attributes found in the selected assessment dataset in Operation 235. Again, the modification module 110 may use some type of data structure that provides a mapping of the values provided in the selected assessment dataset to attributes. Once mapped, the modification module 110 determines whether any inconsistencies are found in the question/answer pairings for the newly completed assessment dataset by comparing the answers (e.g. values) provided for the question/answer pairings to the values provided for the matching attributes found in the selected assessment dataset at Operation 240.


In various aspects, the modification module 110 detects inconsistencies in question/answer pairings based on detecting conflicting values from the newly completed assessment dataset and the selected assessment dataset that relate to the same particular attribute. For example, the modification module 110 may detect inconsistencies that include (1) opposing binary (e.g., yes/no) values for a particular attribute that are specified in the newly completed assessment dataset and the select assessment dataset; (2) inconsistent response values for a particular attribute between the newly completed assessment dataset and the select assessment dataset (e.g., such as when the responses specified in the newly completed assessment dataset and the select assessment dataset to the same multiple-choice question are different); (3) inconsistent selection values for a particular attribute between the newly completed assessment dataset and the select assessment dataset (e.g., such as when the responses specified in the newly completed assessment dataset and the select assessment dataset to the same question requesting the assessment taker to select all responses that apply are inconsistent); (4) inconsistent point values for a particular attribute between the newly completed assessment dataset and the select assessment dataset (e.g., such as when a question corresponding to the particular attribute calls for a point value response); and/or (5) any other suitable inconsistency between the value of any attribute for the particular vendor that is specified in the newly completed assessment dataset and the corresponding value for the attribute for the particular vendor that is specified in the selected assessment dataset (e.g., different numeric responses, different text responses, responses in the selected assessment dataset for which there is no corresponding response in the newly completed assessment dataset as a result of a blank response, etc.). If the modification module 110 identifies any inconsistencies, then the modification module records the inconsistencies in Operation 245. This can allow for personnel of the entity that has provided the newly completed assessment dataset, personnel for another entity, and/or the vendor to review the inconsistencies.


The modification module 110 then determines whether another assessment dataset has been retrieved to compare with the newly completed assessment dataset in Operation 250. If so, then the modification module 110 returns to Operation 230, selects the next assessment dataset, and performs a comparison using the newly selected assessment dataset to identify any inconsistencies between the newly completed assessment dataset and the newly selected assessment dataset.


Once the modification module 110 has conducted a comparison of the newly completed assessment dataset to the retrieved assessment datasets, the modification module 110 modifies a risk rating for the vendor to generate a modified risk rating based on any inconsistences that have been identified for the newly completed assessment dataset in Operation 255. Accordingly, the risk rating can be in the form of a score, a level, a grade, and/or the like. In some aspects, the modification module 110 may modify a predefined risk rating (e.g., baseline risk rating) for the particular vendor in generating the modified risk rating. In other aspects, the modification module 110 may modify a prior generated risk rating for the particular vendor (e.g., which the system may have determined based on a single assessment, or any other suitable factor).


In various aspects, the modification module 110 may use a rules-based model in modifying the risk rating to generate the modified risk rating. Accordingly, the rules-based model may use a set of rules that defines how to modify the risk rating based on various factors involved in the identified inconsistencies. For example, the set of rules may provide rules for modifying the risk rating based on the attribute or type of attribute related to an inconsistency. The set of rules may provide rules for modifying the risk rating based on the type of inconsistency. The set of rules may provide rules for modifying the risk rating based on the level and/or severity of an inconsistency (e.g., the numerical values provided for a particular attribute being a certain amount apart). Different sets of rules may be defined for different computer-implemented functionality, different types of computer-implemented functionality, different vendors, different types of vendors, different entity computing systems for which the computer-implemented functionality is to be integrated with, and/or the like.


In various aspects, the modification module 110 modifies the risk rating to generate the modified risk rating by, for example: (1) increasing the risk rating based on the one or more identified inconsistencies; (2) decreasing the risk rating based on the one or more identified inconsistencies; (3) applying one or more multipliers to the risk rating based on the one or more identified inconsistencies; and/or (4) applying any other suitable modification to the risk rating for the particular vendor. In some aspects, the modification module 110 may modify an overall risk rating (e.g., crowdsourcing risk rating) for the vendor in response to detecting the one or more inconsistencies. In other aspects, the modification module 110 may modify a risk rating associated with particular computer-implemented functionality for the vendor and/or a particular attribute of the functionality associated with an identified inconsistency. In particular aspects, the modification module 110 may also output the modified risk rating by displaying the modified risk rating on a graphical user interface, storing the modified risk rating, sending an electronic communication such as an email with the modified risk rating to personnel of an entity, the vendor, and/or the like. The modification module 110 may also include information on the inconsistencies that resulted in the modified risk rating in the output.


Dynamic Assessment Module


Turning now to FIG. 4, additional details are provided regarding a dynamic assessment module 120 for generating a dynamic assessment completed by a vendor (e.g., personnel thereof) in accordance with various aspects of the disclosure. For instance, the flow diagram shown in FIG. 4 may correspond to operations carried out, for example, by computing hardware found in the vendor risk management computing system 100 or a vendor computing system 195 as described herein, as the computing hardware executes the dynamic assessment module 120.


For example, the dynamic assessment module 120 may provide the assessment in the form of one or more graphical user interfaces that present questions to personnel of the vendor who then provide answers to the questions via the graphical user interfaces. Here, the personnel may have accessed the vendor risk management service to complete the assessment and therefore, the dynamic assessment module 120 is executing on the vendor risk management computing system 100. In other instances, the dynamic assessment module 120 may have been sent to the vendor along with a particular assessment for the vendor to complete. Therefore, the personnel for the vendor may be executing the dynamic assessment module 120 on a vendor computing system 195 associated with the vendor. Accordingly, as the personnel provides answers to the questions presented for the assessment, the dynamic assessment module 120 detects inconsistencies in the assessment in real time and in response, flags one or more responses related to the inconsistencies for additional action.


Therefore, the process 400 involves the dynamic assessment module 120 displaying a question to the personnel in Operation 410. The personnel then enters an answer to the question. The answer to the question can be provided in various formats depending on the types of response requested for the question. For example, the question may be the form of a yes/no question, multiple choice question, freeform question, and/or the like. In addition, the question may request additional information to be provided (e.g., uploaded) along with the answer such as supporting documentation, documentation on certifications, documentation on past data-related incidents, and/or the like.


The dynamic assessment module 120 receives the answer to the question in Operation 415 and maps the question/answer pairing to one or more attributes in Operation 420. For example, the dynamic assessment module 120 may use some type of data structure that maps the question/answer pairing to one or more attributes related to computer-implemented functionality provided by the vendor. In addition, the dynamic assessment module 120 maps the one or more attributes to other question/answer pairings found in the assessment that are related to the one or more attributes in Operation 425.


In various aspects, the assessment can include multiple question/answer pairings that are related to any particular attribute. For example, the assessment may include a first question asking the personnel whether the vendor has implemented an encryption process for encrypting data that is transferred from an entity (e.g., transferred from an entity computing system 190) to the vendor (e.g., to a vendor computing system 195) to be used in a service provided by the vendor. The assessment may also include a second, different question asking the personnel whether the vendor has put any controls in place for ensuring secure data transfers. Therefore, both the first and second question/answer pairings touch on the same attribute as to whether the vendor encrypts data that is transfer from an entity to the vendor. Accordingly, the assessment is configured in this manner to require the personnel to provides multiple answers related to the same attribute to ensure the personnel is providing complete, consistent, and accurate answers (information) related to the attribute.


Therefore, in Operation 430, the dynamic assessment module 120 compares the answers for the question/answer pairings related to the one or more attributes. The dynamic assessment module 120 may perform this particular operation using various functionality depending on the form of the answers. For example, the answers may be a freeform text format. Therefore, the dynamic assessment module 120 can use one or more natural language processing techniques to compare the answers of the question/answer pairings.


For example, the dynamic assessment module 120 may compare a first answer string from a first question/answer pairing with a second answer string from a second question/answer pairing by first utilizing the natural language processing techniques to generate embedded vector representations (e.g., tokenized representations) of the first answer string and the second answer string. The dynamic assessment module 120 can then compare the embedded vector representations for the first and second answer strings to identify whether the first answer string contains an inconsistency.


In other instances, the answers may be in a structured format such as selected answers for multiple choice question, answer to a yes or no question, a numerical answer to a quantity question, and/or the like. Therefore, the dynamic assessment module 120 may compare the answers to the question/answer pairings to determine whether the answers match in identifying whether the answer to the question that was presented to the personnel contains an inconsistency.


At Operation 435, the dynamic assessment module 120 determines whether the answer to the question contains an inconsistency. If so, then the dynamic assessment module 120 determines whether to address the inconsistency in Operation 440. In various aspects, the dynamic assessment module 120 performs this particular operation by using a decision engine to determine a relevance of a particular identified inconsistency. In some aspects, the decision engine may entail a rules-based model that uses a set of rules in determining whether the inconsistency should be addressed. For example, the set of rules may include rules that apply to the level (degree) of inconsistency in determining whether the inconsistency should be address. As a specific example, the set of rules may include a rule that if the inconsistency involves numerically different answers that satisfy a threshold, then the inconsistency should be addressed. In addition, the set of rules may include rules that apply to certain attributes and/or certain types of attributes.


If the dynamic assessment module 120 determines the inconsistency should be addressed, then the dynamic assessment module 120 addresses the inconsistency in Operation 445. Accordingly, the dynamic assessment module 120 may determine one or more actions to take to address the inconsistency based on, for example: (1) a number of attributes that are mapped to the particular question/answer pairing; (2) a type of each of the one or more attributes that are mapped to the particular question/answer pairing; (3) one or more past responses by users to the question/answer paring being flagged or similar question/answer pairings being flagged (e.g., one or more past responses to a question/answer pairing with similar mapped attributes as the particular question/answer pairing); and/or (4) any other suitable factors. Accordingly, the dynamic assessment module may identify one or more actions such as, for example: (1) prompting the personnel to provide supporting information and/or documentation to address the inconsistency; (2) providing the personnel with a follow up question related to the inconsistency; (3) requesting the personnel to readdress the particular question/answer pairing involved in the inconsistency; and/or (4) taking any other suitable action related to the inconsistency (e.g., provide an indication that the inconsistency is acceptable, ignore the flagged response, etc.).


In some aspects, the dynamic assessment module 120 may use a machine-learning model to determine the one or more actions to take to address the inconsistency. For example, the machine-learning model may be a trained model such as a multi-label classification model that processes the particular question/answer pairing and/or the related question/answer pairings and generates a data representation having a set of predictions (e.g., values) in which each prediction is associated with a particular action to take to address the inconsistency. The machine-learning model may be trained, for example, using training data derived from users' responses to follow up requests previously provided for inconsistencies detected in one or more assessment question/answer pairings such as: (1) whether the user ignored the flagged question or related follow up action; (2) a particular type of action the user took in response to the flagged question and/or related follow up action (e.g., providing support for the response, implementing a remediating action, modifying one or more attributes, etc.); (3) one or more frameworks and/or standards that are mapped to the flagged question; and/or (4) any other suitable information.


At this point, the dynamic assessment module 120 determines whether the assessment includes another question to ask the personnel in Operation 450. If so, then the dynamic assessment module 120 returns to Operation 410, selects the next question, and performs the operations just discussed for the newly selected question. Once the dynamic assessment module 120 has processed all of the questions for the assessment, the dynamic assessment module 120 records the assessment in Operation 455. For example, the dynamic assessment module 120 may record the assessment by submitting the assessment as a newly completed assessment dataset to the vendor risk management computing system 100.


Tier Module


Turning now to FIG. 5, additional details are provided regarding a tier module 130 for placing vendors in tiers in accordance with various aspects of the disclosure. For instance, the flow diagram shown in FIG. 5 may correspond to operations carried out, for example, by computing hardware found in the vendor risk management computing system 100 as described herein, as the computing hardware executes the tier module 130.


As previously noted, an entity may be using the vendor risk management service in evaluating, identifying, monitoring, and managing risk associated with the entity integrating computer-implemented functionality provided by a variety of vendors. In some instances, the entity may be utilizing computer-implemented functionality provided by a large number of vendors. Therefore, the entity may wish to utilize the vendor risk management service in a manner that can allow personnel for the entity to quickly assess which vendors pose risks that the entity should be concerned with and/or should address.


Accordingly, the vendor risk management computing system 100 in various aspects is configured to place the vendors associated with a particular entity into risk tiers that can allow personnel for the entity to quick identify groups of vendors that are associated with a particular level of risk (e.g., risk rating). For example, the personnel for the entity may be viewing information on various vendors provided through the vendor risk management service. Here, the personal may be viewing a graphical user interface through the vendor risk management service that displays a listing of vendors with their respective risk ratings.


However, the personnel may be interested in identifying those vendors that the entity may be using for various computer-implemented functionality and/or may be planning to use for various computer-implemented functionality that have been identified as having a certain level of risk. Therefore, the personnel may select an option provided on the graphical user interface to place the interested vendors for the personnel into risk tiers so that the personnel can quickly identify those vendors associated with the certain level of risk. As a result of selecting the option, the tier module 130 may be executed to place the vendors into the appropriate tiers.


Therefore, the process 500 involves the tier module 130 receiving a list of vendors in Operation 510. For example, the personnel may have provided criteria for identifying the vendors of interest to have placed in the different tiers. As a specific example, the personnel may have identified all of the vendors that the entity is actively using to provide computer-implemented functionality that is integrated into entity computing systems 190 for the entity.


In Operation 515, the tier module 130 selects one of the vendors from the list of vendors. The tier module 130 then retrieves one or more risk ratings that have been generated and stored for the vendor in Operation 520. For example, the tier module 130 may retrieve: a risk rating for the vendor that has been specifically developed for the particular entity; may in addition, or instead, retrieve a risk rating for the vendor that has been developed for other entities (e.g., a baseline risk rating and/or a crowdsourcing risk rating); may in addition, or instead, retrieve a risk rating for the vendor that has been specifically developed for particular computer-implemented functionality; and/or the like.


The graphical user interface may allow the personnel to provide criteria used by the tier module 130 in retrieving the one or more risk ratings for the vendor. Accordingly, such functionality can allow for the personnel to fine tune what risk ratings are used in placing the vendors into the different risk tiers.


Once the tier module 130 has retrieved the one or more risk ratings, the tier module 130 places the vendor into a particular risk tier based on the risk rating(s) in Operation 525. For example, the risk tiers may include “Low,” “Medium,” “High,” and “Very High” and the risk ratings may be provided as scores ranging from 1-100. The tier module 130 may generate a composite risk score for the risk scores by, for example, averaging the risk scores, taking the median of the risk scores, and/or the like. The tier module 130 may then place the vendor into one of the risk tiers based on the vendor having a particular composite risk score. For example, the tier module 130 may place the vendor with a composite risk score ranging from 1 to 25 into the “Low” tier, a composite risk score ranging from 26-50 into the “Medium” tier, a composite risk score ranging from 51-75 into the “High” tier, or a composite risk score ranging from 76-100 into the “Very High” tier.


The tier module 130 then determines whether another vendor needs to be placed in one of the risk tiers in Operation 530. If so, then the tier module 130 returns to Operation 515, selects the next vendor, and places the next vendor into the appropriate risk tier as just discussed. Once the tier module 130 has placed all of the vendors into an appropriate risk tier, the tier module 130 may perform one or more actions related to the different risk tiers in Operation 535. For example, the tier module 130 may display the different risk tiers and their associated vendors to the personnel. In another example, the tier module 130 may send an electronic communication such as an email, text message, and/or the like to the personnel and/or some other personnel of the entity providing the vendors that have been placed in the different risk tiers or a particular risk tier of interest.


The tiering of vendors can be advantageous to the personnel of the entity, such as a privacy officer, because it may allow the personnel to quickly determine a general risk level associated with a group of vendors. This can be especially advantageous when the group of vendors includes a large number of vendors (e.g., 1000 or more). The personnel may then use the risk tiering to determine whether, and how, to further assess the risk associated with certain vendors. For example, the personnel may determine to take no action in regard to vendors that have been placed in the “Low” tier, have a third party conduct risk assessments for vendors placed in the “Medium” tier, and have vendors that have been placed in the “High” or “Very High” tiers complete risk impact assessments.


Risk Mitigation Module


Turning now to FIG. 6, additional details are provided regarding a risk mitigation module 140 for processing vendors for various risk tiers in accordance with various aspects of the disclosure. For instance, the flow diagram shown in FIG. 6 may correspond to operations carried out, for example, by computing hardware found in the vendor risk management computing system 100 as described herein, as the computing hardware executes the risk mitigation module 140.


An entity may employ the vendor risk management service to perform certain actions for vendors that have been placed in a particular risk tier. For example, the entity may wish to have risk impact assessments automatically generated and sent to vendors that have been placed in the “Very High” tier. In another example, the entity may wish to have actions performed in instances where a vendor's risk rating changes and causes the vendor to be moved from a first risk tier to a second, different risk tier.


As a specific example, an entity may currently have computer-implemented functionality provided by a first vendor integrated with an entity computing system 190 of the entity. The first vendor's risk rating may currently place the vendor into the “Medium” tier for the entity. However, the first vendor may implement a change that affects an attribute for the first vendor that causes the first vendor's risk rating to increase with respect to the entity's integration of the computer-implemented functionality. As a result, the increased risk rating may move the first vendor from the “Medium” tier to the “Very High” tier. Here, the entity may wish to have one or more actions performed as a result of the first vendor being moved from the “Medium” tier to the “Ver High” tier.


For example, the entity may wish to have one or more electronic notifications sent to personnel of the entity to notify them of the change in risk the entity is now experiencing in integrating computer-implemented functionality. In other instances, the entity may wish to have more direct actions taken in addition, or instead, to mitigate an increase in risk due to the first vendor moving from the “Medium” tier to the “Very High” tier such as, for example, having the integration of computer-implemented functionality with the entity computing system 190 (temporarily) disabled until the increase in risk can be addressed by the entity and/or the first vendor.


In various aspects, the vendor risk management computing system 100 may provide entities with functionality to define actions that are to be performed for vendors that have been placed into certain risk tiers. For example, the vendor risk management computing system 100 may provide one or more graphical user interfaces through the vendor risk management service that allows for personnel of entities to define actions to be performed for vendors placed into certain risk tiers. In addition, the one or more graphical user interfaces may allow for the personnel to provide information needed by the vendor risk management computing system 100 to perform the actions such as, for example, email addresses of personnel to receive electronic communications, credentials needed to access entity computing systems 190, and/or the like.


Accordingly, the risk mitigation module 140 may be invoked by personnel of an entity to have one or more actions performed for vendors placed into a certain risk tier. For example, the personnel may have a group of vendors placed into the different risk tiers as previously discussed. The personnel may then decide to have one or more actions performed for vendors placed in a particular risk tier such as the “Very High” tier. In other instances, the vendor risk management computing system 100 may automatically invoke the risk mitigation module 140. For example, personnel of an entity may set up to have the vendor risk management computing system 100 invoke the risk mitigation module 140 for a particular risk tier periodically and/or when a vendor's risk rating has changed and moves the vendor into a particular risk tier. In those instances, the vendor risk management computing system 100 may invoke the risk mitigation module 140 for the particular vendor and not necessarily for every vendor that has placed into the particular risk tier.


The process 600 involves the risk mitigation module 140 selecting the particular risk tier in Operation 610. Here, the risk mitigation module 140 may select the particular risk tier by querying the vendors that have been placed in the particular risk tier for the entity. For example, personnel for the entity may have previously had a group of vendors placed into the different risk tiers as previously discussed and the tiering of the group of vendors may have been stored in a data repository 170 found in the vendor risk management computing system 100 or other computing system such as an entity computing system 190 for the entity. Therefore, the risk mitigation module 140 may query the vendors that have been placed in the particular risk tier from the data repository 170.


In some aspects, the risk mitigation module 140 may use criteria in querying the vendors for the particular risk tier. For example, the risk mitigation module 140 may use criteria that indicates to only query those vendors that have been newly placed in the particular risk tier, which have a risk rating that has recently changed (e.g., increased), and/or the like. Personnel for the entity may define the criteria via a graphical user interface provided through the vendor risk management service. Accordingly, the criteria can facilitate carrying out actions for certain vendors found in the particular risk tier without necessarily having to carry out the actions for every vendor found in the particular risk tier.


In Operation 615, the risk mitigation module 140 identifies the one or more actions that are to be performed for the vendors. As previously discussed, personnel of the entity may define the one or more actions that are to be performed for vendors that are placed in the particular risk tier. For example, the personnel may define that an email is to be sent to certain risk management personnel of the entity that identifies the vendors placed in the particular risk tier. In addition, the personnel may define that an assessment is to be sent to each vendor that has been placed in the particular risk tier. Again, the defined actions to be performed may be stored in a data repository 170 found in the vendor risk management computing system 100 or other computing system such as an entity computing system 190 for the entity. Therefore, the risk mitigation module 140 may query the one or more actions from the data repository 170.


In Operation 620, the risk mitigation module 140 selects a vendor for the particular risk tier. The risk mitigation module 140 then performs the defined action(s) for the selected vendor in Operation 625. The risk mitigation module 140 then determines whether another vendor has been queried for the particular risk tier in Operation 630. If so, then the risk mitigation module 140 selects the next vendor and performs the one or more actions for the vendor accordingly.


Once the risk mitigation module 140 has processed all of the vendors for the particular risk tier, the risk mitigation module 140 determines whether one or more actions are to be carried out for vendors found in another risk tier in Operation 635. For example, the entity may wish to have a first set of actions carried out for vendors placed in the “High” tier and a second set of actions carried out for vendors placed in the “Very High” tier. If this is the case, then the risk mitigation module 140 returns to Operation 610 to select the next risk tier. The risk mitigation module 140 then performs the operations just discussed for the next risk tier. Once the risk mitigation module 140 has processed all the necessary risk tiers, the risk mitigation module 140 exits in Operation 640.


Custom Module


Turning now to FIG. 7, additional details are provided regarding a custom module 150 for generating a customized risk rating of a vendor for an entity in accordance with various aspects of the disclosure. For instance, the flow diagram shown in FIG. 7 may correspond to operations carried out, for example, by computing hardware found in the vendor risk management computing system 100 as described herein, as the computing hardware executes the custom module 150.


As previously noted, an advantage provided in various aspects is that the vendor risk management service can be utilized to collect information (e.g., assessment datasets) on various vendors through a multitude of sources (e.g., different entities) and generate a risk rating for the individual vendors that may be more representative of the risk involved with integrating computer-implemented functionality with an entity computing system 190 than had a particular entity carried out the risk analysis independently. That is to say, the vendor risk management computing system 100 can be utilized in various aspects to crowdsource respective risk ratings for a plurality of different vendors (e.g., a large number of vendors). For example, over time, a large number of entities may each submit a respective assessment dataset for a particular vendor. The vendor risk management computing system 100 may then use each of these assessment datasets to revise (e.g., modify) the respective risk rating for the particular vendor.


As a specific example, the vendor risk management computing system 100 in various aspects may generate and maintain a respective baseline risk rating for each of a plurality of vendors based on, for example, any suitable combination of factors for the vendors. The vendor risk management computing system 100 may then modify the baseline risk rating for a vendor based on crowdsourced assessment datasets to generate a crowdsourced risk rating for the vendor. In generating the crowdsourced risk rating for a particular vendor, the vendor risk management computing system 100 may, for example, average the respective ratings (e.g., scores) associated with each assessment dataset and use that average (e.g., in conjunction with the baseline risk rating) in determining the crowdsourced risk rating for the vendor. In still other aspects, the vendor risk management computing system 100 may use this averaged rating as the vendor's baseline risk score. It should be understood that the crowdsourced risk rating for a particular vendor may be calculated using any suitable method (e.g., other than averaging). Accordingly, this can allow for a risk rating to be developed and maintained for the vendor that may be more comprehensive of the risk involved with using computer-implemented functionality provided by the particular vendor.


However, with that said, any one entity's integration of computer-implemented functionality provided by a vendor may have specific risk associated with the integration that may be different than the risk experienced by other entities. Therefore, an entity may wish to generate a customized risk rating for a particular vendor that may be more representative of the risk involved with the entity integrating certain computer-implemented functionality with an entity computing system 190 for the entity.


In various aspects, the vendor risk management computing system 100 provides a questionnaire that personnel of an entity can completed for a particular vendor that provides information on the entity's utilization and/or planned utilization of computer-implemented functionality provided by the vendor. For example, the vendor risk management computing system 100 may provide the questionnaire through one or more graphical user interfaces that can be accessed by the personnel of the entity through the vendor risk management service. The questionnaire may include, for example, one or more of the questions 800 listed in FIG. 8. For instance, the questionnaire may ask the personnel whether the vendor performs a critical business function for the entity, whether the vendor connects to the entity's IT infrastructure, etc.


Therefore, the process 700 involves the custom module 150 receiving the answers to the questions (e.g., in a suitable dataset) in Operation 710. In Operation 715, the custom module 150 retrieves a risk rating for the vendor. For example, the custom module 150 may retrieve the baseline risk rating and/or crowdsourced risk rating for the vendor. The custom module 150 then uses the dataset of answers to modify the retrieved risk rating to generate a customized risk rating for the vendor in Operation 720. For example, the custom module 150 may generate the customized risk rating by averaging the retrieved risk rating for the vendor with a risk rating computed from the dataset of answers. Here, the custom module 150 may assign a numerical risk rating to a vendor based on the dataset of answers by assigning a particular value to each possible answer to each particular question within the questionnaire, and then totaling all of the respective values that correspond to the answers to those questions to determine the risk rating.


In particular aspects, the vendor risk management computing system 100 displays (e.g., at least initially display) a risk rating (e.g., a baseline risk rating and/or crowdsourced risk rating) for the vendor (e.g., Vendor X) to each entity of a set of entities accessing the vendor risk management service to view risk data for the particular vendor. In response to a first entity from the set of entities submitting a questionnaire for Vendor X, the custom module 150 may generate a first customized risk rating for Vendor X based on the completed questionnaire from the first entity. The custom module 150 may, for example, generate the first customized risk rating for Vendor X by averaging a baseline risk rating and/or crowdsourced risk rating with a risk rating computed from the completed questionnaire from the first entity. The vendor risk management computing system 100 may then display the first customized risk rating for Vendor X to the first entity, but continue to display the baseline risk rating and/or crowdsourced risk rating to the remaining entities in the set of entities. In various aspects, the vendor risk management computing system 100 maintains the customized risk rating for use only by the entity. In other aspects, the customized risk rating may be available for use by other entities in place of a previous version of a risk rating for the vendor.


Custom Modification Module


Turning now to FIG. 9, additional details are provided regarding a custom modification module 160 for modifying a risk rating of a vendor for an entity in accordance with various aspects of the disclosure. For instance, the flow diagram shown in FIG. 9 may correspond to operations carried out, for example, by computing hardware found in the vendor risk management computing system 100 as described herein, as the computing hardware executes the custom modification module 160.


In various aspects, the vendor risk management computing system 100 allows an entity to define how a risk rating (e.g., baseline risk rating, crowdsourced risk rating, and/or customized risk rating) for a particular vendor is to be modified for use by the entity. For instance, the entity may specify to modify the risk rating for each of the entity's vendors in accordance with one or more third-party risk ratings (e.g., the Vendor's ISS Cyber Risk Score, or other third-party risk rating such as those that may assess risks related to the vendor's labor or environmental practices).


The vendor risk management computing system 100 may provide one or more graphical user interfaces that are accessible by personnel for entities through the vendor risk management service to specify how certain risk ratings are to be modified. The personnel may use the one or more graphical user interfaces in defining certain conditions that are to be satisfied to have a particular vendor's risk rating modified. In addition, the personnel may define the manner in which a vendor's risk rating is be modified if the conditions are met. Therefore, once personnel for a particular entity has defined the conditions and manner for modifying vendor risk ratings for the entity, the vendor risk management computing system 100 may invoke the custom modification module 160 to modify the risk ratings accordingly.


The process 900 involves the custom modification module 160 receiving the vendors for the entity in Operation 910. In Operation 915, the custom modification module 160 selects one of the vendors. The custom modification module 160 then determines whether the risk rating for the selected vendor is to be modified in Operation 920. For example, the personnel for the entity may have defined a condition that for any particular vendor of the entity, if the vendor's respective ISS Cyber Risk Score falls within a particular range, such as 300 to 500, the vendor's risk rating is to be modified in a certain manner such as raise or lower the vendor's risk rating by a certain amount and/or percentage. Therefore, if the custom modification module 160 determines the condition is satisfied for the selected vendor, then the custom modification module 160 retrieves the vendor's risk rating in Operation 925 and modifies the risk rating accordingly in Operation 930.


The custom modification module 160 determines whether another vendor is to be processed for the entity in Operation 935. If so, then the custom modification module 160 returns to Operation 915, selects the next vendor, and processes the vendor to modify a risk rating for the vendor accordingly. Although the custom modification module 160 is described in the context of allowing a particular entity to modify a risk rating for the entity's purposes, the custom modification module 160 may be used in some aspects to modify a risk rating, such as a baseline risk rating and/or crowdsourcing risk rating, for one or more vendors that is available for use to a plurality of different entities.


In particular aspects, once the custom modification module 160 has processed all of the vendors for the entity, the custom modification module 160 performs one or more actions that may be associated with the modified risk ratings in Operation 940. For example, the custom modification module 160 may invoke the tier module 130 and/or risk mitigation module 140 as previously discussed. In another example, the custom modification module 160 may cause a modified risk rating to be displayed for a particular vendor adjacent one or more other risk ratings associated with the vendor and/or any other relevant risk-related information for the vendor.


For example, FIG. 10 provides an example of a graphical user interface 1000 that may be provided through the vendor risk management service that displays various risk information for a particular vendor (e.g., Zentoso 1010). Here, the graphical user interface 1000 displays a graphic 1015 indicating that the computer-implemented functionality provided by the vendor is considered a low risk to the entity. The graphic 1015 can be based on placing the vendor in a particular tier (e.g. “Low” tier) for the entity. The vendor may have been placed in the particular tier based on one or more of a baseline risk rating, crowdsourcing risk rating, customized risk rating, or modified customized risk rating. In addition, the graphical user interface 1000 provides a third party risk rating, in this instance the vendor's ISS Cyber Risk Score 1020. Accordingly, the graphical user interface 1000 can be useful in helping personnel for the entity assess the risks associated with integrating computer-implemented functionality provided by the vendor into an entity computing system 190 for the entity in greater detail.


Example Technical Platforms


Aspects of the present disclosure may be implemented in various ways, including as computer program products that comprise articles of manufacture. Such computer program products may include one or more software components including, for example, software objects, methods, data structures, and/or the like. A software component may be coded in any of a variety of programming languages. An illustrative programming language may be a lower-level programming language such as an assembly language associated with a particular hardware architecture and/or operating system platform. A software component comprising assembly language instructions may require conversion into executable machine code by an assembler prior to execution by the hardware architecture and/or platform. Another example programming language may be a higher-level programming language that may be portable across multiple architectures. A software component comprising higher-level programming language instructions may require conversion to an intermediate representation by an interpreter or a compiler prior to execution.


Other examples of programming languages include, but are not limited to, a macro language, a shell or command language, a job control language, a script language, a database query, or search language, and/or a report writing language. In one or more example aspects, a software component comprising instructions in one of the foregoing examples of programming languages may be executed directly by an operating system or other software component without having to be first transformed into another form. A software component may be stored as a file or other data storage construct. Software components of a similar type or functionally related may be stored together such as, for example, in a particular directory, folder, or library. Software components may be static (e.g., pre-established, or fixed) or dynamic (e.g., created or modified at the time of execution).


A computer program product may include a non-transitory computer-readable storage medium storing applications, programs, program modules, scripts, source code, program code, object code, byte code, compiled code, interpreted code, machine code, executable instructions, and/or the like (also referred to herein as executable instructions, instructions for execution, computer program products, program code, and/or similar terms used herein interchangeably). Such non-transitory computer-readable storage media include all computer-readable media (including volatile and non-volatile media).


According to various aspects, a non-volatile computer-readable storage medium may include a floppy disk, flexible disk, hard disk, solid-state storage (SSS) (e.g., a solid-state drive (SSD), solid state card (SSC), solid state module (SSM)), enterprise flash drive, magnetic tape, or any other non-transitory magnetic medium, and/or the like. A non-volatile computer-readable storage medium may also include a punch card, paper tape, optical mark sheet (or any other physical medium with patterns of holes or other optically recognizable indicia), compact disc read only memory (CD-ROM), compact disc-rewritable (CD-RW), digital versatile disc (DVD), Blu-ray disc (BD), any other non-transitory optical medium, and/or the like. Such a non-volatile computer-readable storage medium may also include read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), flash memory (e.g., Serial, NAND, NOR, and/or the like), multimedia memory cards (MMC), secure digital (SD) memory cards, SmartMedia cards, CompactFlash (CF) cards, Memory Sticks, and/or the like. Further, a non-volatile computer-readable storage medium may also include conductive-bridging random access memory (CBRAM), phase-change random access memory (PRAM), ferroelectric random-access memory (FeRAM), non-volatile random-access memory (NVRAM), magnetoresistive random-access memory (MRAM), resistive random-access memory (RRAM), Silicon-Oxide-Nitride-Oxide-Silicon memory (SONOS), floating junction gate random access memory (FJG RAM), Millipede memory, racetrack memory, and/or the like.


According to various aspects, a volatile computer-readable storage medium may include random access memory (RAM), dynamic random access memory (DRAM), static random access memory (SRAM), fast page mode dynamic random access memory (FPM DRAM), extended data-out dynamic random access memory (EDO DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), double data rate type two synchronous dynamic random access memory (DDR2 SDRAM), double data rate type three synchronous dynamic random access memory (DDR3 SDRAM), Rambus dynamic random access memory (RDRAM), Twin Transistor RAM (TTRAM), Thyristor RAM (T-RAM), Zero-capacitor (Z-RAM), Rambus in-line memory module (RIMM), dual in-line memory module (DIMM), single in-line memory module (SIMM), video random access memory (VRAM), cache memory (including various levels), flash memory, register memory, and/or the like. It will be appreciated that where various aspects are described to use a computer-readable storage medium, other types of computer-readable storage media may be substituted for or used in addition to the computer-readable storage media described above.


Various aspects of the present disclosure may also be implemented as methods, apparatuses, systems, computing devices, computing entities, and/or the like. As such, various aspects of the present disclosure may take the form of a data structure, apparatus, system, computing device, computing entity, and/or the like executing instructions stored on a computer-readable storage medium to perform certain steps or operations. Thus, various aspects of the present disclosure also may take the form of entirely hardware, entirely computer program product, and/or a combination of computer program product and hardware performing certain steps or operations.


Various aspects of the present disclosure are described below with reference to block diagrams and flowchart illustrations. Thus, each block of the block diagrams and flowchart illustrations may be implemented in the form of a computer program product, an entirely hardware aspect, a combination of hardware and computer program products, and/or apparatuses, systems, computing devices, computing entities, and/or the like carrying out instructions, operations, steps, and similar words used interchangeably (e.g., the executable instructions, instructions for execution, program code, and/or the like) on a computer-readable storage medium for execution.


For example, retrieval, loading, and execution of code may be performed sequentially such that one instruction is retrieved, loaded, and executed at a time. In some examples of aspects, retrieval, loading, and/or execution may be performed in parallel such that multiple instructions are retrieved, loaded, and/or executed together. Thus, such aspects can produce specially configured machines performing the steps or operations specified in the block diagrams and flowchart illustrations. Accordingly, the block diagrams and flowchart illustrations support various combinations of aspects for performing the specified instructions, operations, or steps.


Example System Architecture



FIG. 11 is a block diagram of a system architecture 1100 that can be used in providing the vendor risk management service and corresponding functionality according to various aspects of the disclosure as detailed herein. Components of the system architecture 1100 are configured according to various aspects to provide an entity with the vendor risk management service that facilitates and assists the entity in successfully recognizing, managing, and mitigating risks associated with integrating entity computing systems 190 of the entity with computer-implemented functionality (e.g., services, software applications, computing system capacity, and/or the like) provided through vendor computing systems 195. As may be understood from FIG. 11, the system architecture 1100 in various aspects may include a vendor risk management computing system 100 that comprises one or more management servers 1110 and one or more data repositories 170.


The one or more management servers 1110 are used in supporting the vendor risk management service (e.g., an instance thereof) for an entity within the vendor risk management computing system 100. The one or more data repositories 170 may include, for example, a data repository for storing assessment datasets received for various vendors. In addition, the one or more data repositories 170 may include a data repository for storing specific data for various entities such as customized risk ratings on vendors for the various entities, as well as conditions and manners defined by the various entities and used in modifying risk ratings for vendors as described herein. Further, the management server(s) 1110 may execute a modification module 110, a dynamic assessment module 120, a tier module 130, a risk mitigation module 140, a custom module 150, and/or a custom modification module 160 as described herein. Further, in some aspects, the management server(s) 1110 may provide one or more graphical user interfaces through which personnel of the entities can access the vendor risk management service.


The one or more management servers 1110 may be in communication with one or more entity computing systems 190 for the entities, as well as one or more vendor computing systems 195 for the vendors, over one or more networks 175. Accordingly, the management server(s) 1110 may be in communication over the network(s) 140 with components residing on the entity computing systems 190 and/or vendor computing systems 195 to facilitate various functionality as described herein. To do so, the management server(s) 1110 may interface with the entity computing systems 190 and/or vendor computing systems 195 via one or more suitable application programming interfaces (APIs), direct connections, and/or the like. Although the management server(s) 110 and data repository(ies) 170 are shown as separate components, it should be understood that according to other aspects, these components 1110, 170 may comprise a single server and/or repository, a plurality of servers and/or repositories, one or more cloud-based servers and/or repositories, or any other suitable configuration.


Example Computing Hardware



FIG. 12 illustrates a diagrammatic representation of a computing hardware device 1200 that may be used in accordance with various aspects of the disclosure. For example, the hardware device 1200 may be computing hardware such as a management server 1110 as described in FIG. 11. According to particular aspects, the hardware device 1200 may be connected (e.g., networked) to one or more other computing entities, storage devices, and/or the like via one or more networks such as, for example, a LAN, an intranet, an extranet, and/or the Internet. As noted above, the hardware device 1200 may operate in the capacity of a server and/or a client device in a client-server network environment, or as a peer computing device in a peer-to-peer (or distributed) network environment. According to various aspects, the hardware device 1200 may be a personal computer (PC), a tablet PC, a set-top box (STB), a Personal Digital Assistant (PDA), a mobile device (smartphone), a web appliance, a server, a network router, a switch or bridge, or any other device capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that device. Further, while only a single hardware device 1200 is illustrated, the term “hardware device,” “computing hardware,” and/or the like shall also be taken to include any collection of computing entities that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein.


A hardware device 1200 includes a processor 1202, a main memory 1204 (e.g., read-only memory (ROM), flash memory, dynamic random-access memory (DRAM) such as synchronous DRAM (SDRAM), Rambus DRAM (RDRAM), and/or the like), a static memory 1206 (e.g., flash memory, static random-access memory (SRAM), and/or the like), and a data storage device 1218, that communicate with each other via a bus 1232.


The processor 1202 may represent one or more general-purpose processing devices such as a microprocessor, a central processing unit, and/or the like. According to some aspects, the processor 1202 may be a complex instruction set computing (CISC) microprocessor, reduced instruction set computing (RISC) microprocessor, very long instruction word (VLIW) microprocessor, a processor implementing other instruction sets, processors implementing a combination of instruction sets, and/or the like. According to some aspects, the processor 1202 may be one or more special-purpose processing devices such as an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a digital signal processor (DSP), network processor, and/or the like. The processor 1202 can execute processing logic 1226 for performing various operations and/or steps described herein.


The hardware device 1200 may further include a network interface device 1208, as well as a video display unit 1210 (e.g., a liquid crystal display (LCD), a cathode ray tube (CRT), and/or the like), an alphanumeric input device 1212 (e.g., a keyboard), a cursor control device 1214 (e.g., a mouse, a trackpad), and/or a signal generation device 1216 (e.g., a speaker). The hardware device 1200 may further include a data storage device 1218. The data storage device 1218 may include a non-transitory computer-readable storage medium 1230 (also known as a non-transitory computer-readable storage medium or a non-transitory computer-readable medium) on which is stored one or more modules 1222 (e.g., sets of software instructions) embodying any one or more of the methodologies or functions described herein. For instance, according to particular aspects, the modules 1222 may include a modification module 110, a dynamic assessment module 120, a tier module 130, a risk mitigation module 140, a custom module 150, and/or a custom modification module 160 as described herein. The one or more modules 1222 may also reside, completely or at least partially, within main memory 1204 and/or within the processor 1202 during execution thereof by the hardware device 1200—main memory 1204 and processor 1202 also constituting computer-accessible storage media. The one or more modules 1222 may further be transmitted or received over a network 175 via the network interface device 1208.


While the computer-readable storage medium 1230 is shown to be a single medium, the terms “computer-readable storage medium” and “machine-accessible storage medium” should be understood to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more sets of instructions. The term “computer-readable storage medium” should also be understood to include any medium that is capable of storing, encoding, and/or carrying a set of instructions for execution by the hardware device 1200 and that causes the hardware device 1200 to perform any one or more of the methodologies of the present disclosure. The term “computer-readable storage medium” should accordingly be understood to include, but not be limited to, solid-state memories, optical and magnetic media, and/or the like.


System Operation


The logical operations described herein may be implemented (1) as a sequence of computer implemented acts or one or more program modules running on a computing system and/or (2) as interconnected machine logic circuits or circuit modules within the computing system. The implementation is a matter of choice dependent on the performance and other requirements of the computing system. Accordingly, the logical operations described herein are referred to variously as states, operations, steps, structural devices, acts, or modules. These states, operations, steps, structural devices, acts, and modules may be implemented in software, in firmware, in special purpose digital logic, and any combination thereof. Greater or fewer operations may be performed than shown in the figures and described herein. These operations also may be performed in a different order than those described herein.


CONCLUSION

The disclosure provided herein entails detecting and addressing changes made to regulatory frameworks that affect (may affect) computing systems of various entities. However, those of ordinary skill in the art should appreciate that aspects of the disclosure may be used in detecting and addressing changes made to other regulatory instruments such as regulatory laws, regulations, standards, and/or the like that may also affect computing systems of various entities in handling certain types of data (e.g., target data).


While this specification contains many specific aspect details, these should not be construed as limitations on the scope of any invention or of what may be claimed, but as descriptions of features that may be specific to particular aspects of particular inventions. Certain features that are described in this specification in the context of separate aspects also may be implemented in combination in a single aspect. Conversely, various features that are described in the context of a single aspect also may be implemented in multiple aspects separately or in any suitable sub-combination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination may in some cases be excised from the combination, and the claimed combination may be a sub-combination or variation of a sub-combination.


Similarly, while operations are described in a particular order, this should not be understood as requiring that such operations be performed in the particular order described or in sequential order, or that all described operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various components in the various aspects described above should not be understood as requiring such separation in all aspects, and the described program components (e.g., modules) and systems may be integrated together in a single software product or packaged into multiple software products.


Many modifications and other aspects of the disclosure will come to mind to one skilled in the art to which this disclosure pertains having the benefit of the teachings presented in the foregoing descriptions and the associated drawings. Therefore, it is to be understood that the disclosure is not to be limited to the specific aspects disclosed and that modifications and other aspects are intended to be included within the scope of the appended claims. Although specific terms are employed herein, they are used in a generic and descriptive sense only and not for the purposes of limitation.

Claims
  • 1. A method comprising: providing, by computing hardware, a first question from a set of questions found in an electronic assessment for display on a user interface, wherein the user interface solicits a first answer to the first question, and the set of questions relates to computer-implemented functionality provided by a vendor;receiving, by the computing hardware and via the user interface, the first answer to the first question to provide a first question/answer pairing;mapping, by the computing hardware, the first question/answer pairing to an attribute related to the computer-implemented functionality;mapping, by the computing hardware, the attribute to a second question/answer pairing, wherein the second question/answer pairing: is related to the attribute,comprises a second question of the set of questions, andcomprises a second answer provided to the second question;comparing, by the computing hardware, the first answer to the second answer to identify an inconsistency in the first answer with respect to the second answer;determining, by the computing hardware, to address the inconsistency; andresponsive to determining to address the inconsistency, performing, by the computing hardware, an action to address the inconsistency, wherein the action comprises at least one of:(1) prompting, via the user interface, to provide at least one of supporting information or supporting documentation to address the inconsistency, (2) providing, via the user interface, a follow up question related to the inconsistency, or (3) requesting, via the user interface, the inconsistency in the first answer to be redressed.
  • 2. The method of claim 1, wherein determining to address the inconsistency comprises processing the inconsistency via a decision engine to generate a relevance of the inconsistency, the decision engine comprising a rules-based model configured to use a set of rules in determining a level of the inconsistency as a measure of the relevance of the inconsistency.
  • 3. The method of claim 1 further comprising determining, by the computing hardware, the action to perform by: processing at least one of the first question/answer pairing or the second question/answer pairing using a machine-learning model to generate a data representation having a set of predictions in which each prediction is associated with a particular action to take to address the inconsistency; andselecting, based on the set of predictions, the action to address the inconsistency.
  • 4. The method of claim 3, wherein the machine-learning model is trained using training data derived from responses to follow up requests previously provided for inconsistencies detected in past assessment question/answer pairings that comprises at least one of (1) whether the inconsistencies detected in the past assessment question/answer pairings were ignored, (2) whether related follow up actions for the inconsistencies detected in the past assessment question/answer pairings were ignored, (3) particular types of actions taken in response to the inconsistencies detected in the past assessment question/answer pairings, or (4) at least one of a framework or standard that is mapped to the past assessment question/answer pairings.
  • 5. The method of claim 1, wherein mapping the first question/answer pairing to the attribute related to the computingcomputer-implemented functionality and mapping the attribute to the second question/answer pairing is performed via a data structure that maps the first question/answer pairing and the second question/answer pairing to the attribute.
  • 6. The method of claim 1, wherein the first answer and the second answer are in a freeform text format and comparing the first answer to the second answer to identify the inconsistency in the first answer with respect to the second answer involves: performing a natural language processing technique on the first answer to generate a first embedded representation of the first answer,performing the natural language processing technique on the second answer to generate a second embedded representation of the second answer, andcomparing the first embedded representation to the second embedded representation to identify the inconsistency.
  • 7. The method of claim 1 further comprising determining, by the computing hardware, the action to take to address the inconsistency based on at least one of a type of the attribute or a past response to a past inconsistency related to the attribute.
  • 8. A system comprising: a non-transitory computer-readable medium storing instructions; anda processing device communicatively coupled to the non-transitory computer-readable medium,wherein, the processing device is configured to execute the instructions and thereby perform operations comprising: providing a first question found in an electronic assessment for display on a user interface, wherein the user interface solicits a first answer to the first question, and the first question relates to computer-implemented functionality;receiving, via the user interface, the first answer to the first question to provide a first question/answer pairing;mapping the first question/answer pairing to a plurality of attributes related to the computer-implemented functionality;mapping the plurality of attributes to a second question/answer pairing, wherein the second question/answer pairing comprises a second question, and a second answer provided to the second question;comparing the first answer to the second answer to identify an inconsistency in the first answer with respect to the second answer;determining to address the inconsistency; andresponsive to determining to address the inconsistency, performing an action to address the inconsistency, wherein the action comprises at least one of: (1) prompting, via the user interface, to provide at least one of supporting information or supporting documentation to address the inconsistency, (2) providing, via the user interface, a follow up question related to the inconsistency, or (3) requesting, via the user interface, the inconsistency in the first answer to be redressed.
  • 9. The system of claim 8, wherein determining to address the inconsistency comprises processing the inconsistency using a rules-based model configured to use a set of rules in determining a level of the inconsistency as a measure of a relevance of the inconsistency.
  • 10. The system of claim 8, wherein the operations further comprise determining the action to perform by: processing at least one of the first question/answer pairing or the second question/answer pairing using a machine-learning model to generate a data representation having a set of predictions in which each prediction is associated with a particular action to take to address the inconsistency; andselecting, based on the set of predictions, the action to address the inconsistency.
  • 11. The system of claim 10, wherein the machine-learning model is trained using training data derived from responses to follow up requests previously provided for inconsistencies detected in past assessment question/answer pairings that comprises at least one of (1) whether the inconsistencies detected in the past assessment question/answer pairings were ignored, (2) whether related follow up actions for the inconsistencies detected in the past assessment question/answer pairings were ignored, (3) particular types of actions taken in response to the inconsistencies detected in the past assessment question/answer pairings, or (4) at least one of a framework or standard that is mapped to the past assessment question/answer pairings.
  • 12. The system of claim 8, wherein mapping the first question/answer pairing to the plurality of attributes related to the computer-implemented functionality and mapping the plurality of attributes to the second question/answer pairing is performed via a data structure that maps the first question/answer pairing and the second question/answer pairing to the plurality of attributes.
  • 13. The system of claim 8, wherein the first answer and the second answer are in a freeform text format and comparing the first answer to the second answer to identify the inconsistency in the first answer with respect to the second answer involves: performing a natural language processing technique on the first answer to generate a first embedded representation of the first answer,performing the natural language processing technique on the second answer to generate a second embedded representation of the second answer, andcomparing the first embedded representation to the second embedded representation to identify the inconsistency.
  • 14. The system of claim 8, wherein the operations further comprise determining the action to take to address the inconsistency based on at least one of (1) a number of the plurality of attributes, (2) a type of each of the plurality of attributes, or (3) one or more past responses to one or more past inconsistencies related to the plurality of attributes.
  • 15. A non-transitory computer-readable medium having program code that is stored thereon, the program code executable by one or more processing devices for performing operations comprising: providing a first question found in an electronic assessment for display on a user interface, wherein the user interface solicits a first answer to the first question, and the first question relates to computer-implemented functionality;receiving, via the user interface, the first answer to the first question to provide a first question/answer pairing;mapping the first question/answer pairing to an attribute related to the computer-implemented functionality;mapping the attribute to a second question/answer pairing, wherein the second question/answer pairing comprises a second question, and a second answer provided to the second question;comparing the first answer to the second answer to identify an inconsistency in the first answer with respect to the second answer;determining to address the inconsistency; andresponsive to determining to address the inconsistency, performing an action to address the inconsistency, wherein the action comprises at least one of: (1) prompting, via the user interface, to provide at least one of supporting information or supporting documentation to address the inconsistency, (2) providing, via the user interface, a follow up question related to the inconsistency, or (3) requesting, via the user interface, the inconsistency in the first answer to be redressed.
  • 16. The non-transitory computer-readable medium of claim 15, wherein determining to address the inconsistency comprises processing the inconsistency using a rules-based model configured to use a set of rules in determining a level of the inconsistency as a measure of a relevance of the inconsistency.
  • 17. The non-transitory computer-readable medium of claim 15, wherein the operations further comprise determining the action to perform by: processing at least one of the first question/answer pairing or the second question/answer pairing using a machine-learning model to generate a data representation having a set of predictions in which each prediction is associated with a particular action to take to address the inconsistency; andselecting, based on the set of predictions, the action to address the inconsistency.
  • 18. The non-transitory computer-readable medium of claim 15, wherein mapping the first question/answer pairing to the attribute related to the computer-implemented functionality and mapping the attribute to the second question/answer pairing is performed via a data structure that maps the first question/answer pairing and the second question/answer pairing to the attribute.
  • 19. The non-transitory computer-readable medium of claim 15, wherein the first answer and the second answer are in a freeform text format and comparing the first answer to the second answer to identify the inconsistency in the first answer with respect to the second answer involves: performing a natural language processing technique on the first answer to generate a first embedded representation of the first answer,performing the natural language processing technique on the second answer to generate a second embedded representation of the second answer, andcomparing the first embedded representation to the second embedded representation to identify the inconsistency.
  • 20. The non-transitory computer-readable medium of claim 15, wherein the operations further comprise determining the action to take to address the inconsistency based on at least one of a type of the attribute or a past response to a past inconsistency related to the attribute.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 17/722,551, filed Apr. 18, 2022, which claims the benefit of U.S. Provisional Patent Application Ser. No. 63/176,185, filed Apr. 16, 2021, which is hereby incorporated herein by reference in its entirety.

US Referenced Citations (1587)
Number Name Date Kind
4536866 Jerome et al. Aug 1985 A
4574350 Starr Mar 1986 A
5193162 Bordsen et al. Mar 1993 A
5276735 Boebert et al. Jan 1994 A
5329447 Leedom, Jr. Jul 1994 A
5404299 Tsurubayashi et al. Apr 1995 A
5535393 Reeve et al. Jul 1996 A
5560005 Hoover et al. Sep 1996 A
5668986 Nilsen et al. Sep 1997 A
5710917 Musa et al. Jan 1998 A
5761529 Raji Jun 1998 A
5764906 Edelstein et al. Jun 1998 A
5872973 Mitchell et al. Feb 1999 A
5913041 Ramanathan et al. Jun 1999 A
5913214 Madnick et al. Jun 1999 A
6009429 Greer et al. Dec 1999 A
6016394 Walker Jan 2000 A
6122627 Carey et al. Sep 2000 A
6148297 Swor et al. Nov 2000 A
6148342 Ho Nov 2000 A
6240416 Immon et al. May 2001 B1
6240422 Atkins et al. May 2001 B1
6243816 Fang et al. Jun 2001 B1
6253203 OFlaherty et al. Jun 2001 B1
6263335 Paik et al. Jul 2001 B1
6272631 Thomlinson et al. Aug 2001 B1
6275824 OFlaherty et al. Aug 2001 B1
6282548 Burner et al. Aug 2001 B1
6330562 Boden et al. Dec 2001 B1
6363488 Ginter et al. Mar 2002 B1
6374237 Reese Apr 2002 B1
6374252 Althoff et al. Apr 2002 B1
6408336 Schneider et al. Jun 2002 B1
6427230 Goiffon et al. Jul 2002 B1
6442688 Moses et al. Aug 2002 B1
6446120 Dantressangle Sep 2002 B1
6463488 San Juan Oct 2002 B1
6484149 Jammes et al. Nov 2002 B1
6484180 Lyons et al. Nov 2002 B1
6516314 Birkler et al. Feb 2003 B1
6516337 Tripp et al. Feb 2003 B1
6519571 Guheen et al. Feb 2003 B1
6574631 Subramanian et al. Jun 2003 B1
6591272 Williams Jul 2003 B1
6601233 Underwood Jul 2003 B1
6606744 Mikurak Aug 2003 B1
6611812 Hurtado et al. Aug 2003 B2
6625602 Meredith et al. Sep 2003 B1
6629081 Cornelius et al. Sep 2003 B1
6633878 Underwood Oct 2003 B1
6662192 Rebane Dec 2003 B1
6662357 Bowman-Amuah Dec 2003 B1
6697824 Bowman-Amuah Feb 2004 B1
6699042 Smith et al. Mar 2004 B2
6701314 Conover et al. Mar 2004 B1
6721713 Guheen et al. Apr 2004 B1
6725200 Rost Apr 2004 B1
6732109 Lindberg et al. May 2004 B2
6754665 Futagami et al. Jun 2004 B1
6755344 Mollett et al. Jun 2004 B1
6757685 Raffaele et al. Jun 2004 B2
6757888 Knutson et al. Jun 2004 B1
6779095 Selkirk et al. Aug 2004 B2
6816944 Peng Nov 2004 B2
6826693 Yoshida et al. Nov 2004 B1
6850252 Hoffberg Feb 2005 B1
6886101 Glazer et al. Apr 2005 B2
6901346 Tracy et al. May 2005 B2
6904417 Clayton et al. Jun 2005 B2
6909897 Kikuchi Jun 2005 B2
6912676 Gusler et al. Jun 2005 B1
6925443 Baggett, Jr. et al. Aug 2005 B1
6938041 Brandow et al. Aug 2005 B1
6956845 Baker et al. Oct 2005 B2
6978270 Carty et al. Dec 2005 B1
6980927 Tracy et al. Dec 2005 B2
6980987 Kaminer Dec 2005 B2
6983221 Tracy et al. Jan 2006 B2
6985887 Sunstein et al. Jan 2006 B1
6990454 McIntosh Jan 2006 B2
6993448 Tracy et al. Jan 2006 B2
6993495 Smith, Jr. et al. Jan 2006 B2
6996807 Vardi et al. Feb 2006 B1
7003560 Mullen et al. Feb 2006 B1
7003662 Genty et al. Feb 2006 B2
7013290 Ananian Mar 2006 B2
7017105 Flanagin et al. Mar 2006 B2
7023979 Wu et al. Apr 2006 B1
7039594 Gersting May 2006 B1
7039654 Eder May 2006 B1
7047517 Brown et al. May 2006 B1
7051036 Rosnow et al. May 2006 B2
7051038 Yeh et al. May 2006 B1
7058970 Shaw Jun 2006 B2
7069427 Adler et al. Jun 2006 B2
7076558 Dunn Jul 2006 B1
7093200 Schreiber et al. Aug 2006 B2
7095854 Ginter et al. Aug 2006 B1
7100195 Underwood Aug 2006 B1
7120800 Ginter et al. Oct 2006 B2
7124101 Mikurak Oct 2006 B1
7124107 Pishevar et al. Oct 2006 B1
7127705 Christfort et al. Oct 2006 B2
7127741 Bandini et al. Oct 2006 B2
7133845 Ginter et al. Nov 2006 B1
7139999 Bowman-Amuah Nov 2006 B2
7143091 Charnock et al. Nov 2006 B2
7149698 Guheen et al. Dec 2006 B2
7165041 Guheen et al. Jan 2007 B1
7167842 Josephson, II et al. Jan 2007 B1
7167844 Leong et al. Jan 2007 B1
7171379 Menninger et al. Jan 2007 B2
7181438 Szabo Feb 2007 B1
7203929 Vinodkrishnan et al. Apr 2007 B1
7213233 Vinodkrish May 2007 B1
7216155 Stuckman et al. May 2007 B2
7216340 Vinodkrishnan et al. May 2007 B1
7219066 Parks et al. May 2007 B2
7223234 Stupp et al. May 2007 B2
7225460 Barzilai et al. May 2007 B2
7234065 Breslin et al. Jun 2007 B2
7247625 Zhang et al. Jul 2007 B2
7251624 Lee et al. Jul 2007 B1
7260830 Sugimoto Aug 2007 B2
7266566 Kennaley et al. Sep 2007 B1
7272818 Ishimitsu et al. Sep 2007 B2
7275063 Horn Sep 2007 B2
7281020 Fine Oct 2007 B2
7284232 Bates et al. Oct 2007 B1
7284271 Lucovsky et al. Oct 2007 B2
7287280 Young Oct 2007 B2
7290275 Baudoin et al. Oct 2007 B2
7293119 Beale Nov 2007 B2
7299299 Hollenbeck et al. Nov 2007 B2
7302569 Betz et al. Nov 2007 B2
7313575 Carr et al. Dec 2007 B2
7313699 Koga Dec 2007 B2
7313825 Redlich et al. Dec 2007 B2
7315826 Guheen et al. Jan 2008 B1
7315849 Bakalash et al. Jan 2008 B2
7322047 Redlich et al. Jan 2008 B2
7330805 Iimori Feb 2008 B2
7340447 Ghatare Mar 2008 B2
7340776 Zobel et al. Mar 2008 B2
7343434 Kapoor et al. Mar 2008 B2
7346518 Frank et al. Mar 2008 B1
7353204 Liu Apr 2008 B2
7353283 Henaff et al. Apr 2008 B2
7356559 Jacobs et al. Apr 2008 B1
7367014 Griffin Apr 2008 B2
7370025 Pandit May 2008 B1
7376835 Olkin et al. May 2008 B2
7380120 Garcia May 2008 B1
7382903 Ray Jun 2008 B2
7383570 Pinkas et al. Jun 2008 B2
7391854 Salonen et al. Jun 2008 B2
7398393 Mont et al. Jul 2008 B2
7401235 Mowers et al. Jul 2008 B2
7403942 Bayliss Jul 2008 B1
7409354 Putnam et al. Aug 2008 B2
7412402 Cooper Aug 2008 B2
7424680 Carpenter Sep 2008 B2
7428546 Nori et al. Sep 2008 B2
7428707 Quimby Sep 2008 B2
7430585 Sibert Sep 2008 B2
7454457 Lowery et al. Nov 2008 B1
7454508 Mathew et al. Nov 2008 B2
7478157 Bohrer et al. Jan 2009 B2
7480694 Blennerhassett et al. Jan 2009 B2
7480755 Herrell et al. Jan 2009 B2
7487170 Stevens Feb 2009 B2
7493282 Manly et al. Feb 2009 B2
7500607 Williams Mar 2009 B2
7512987 Williams Mar 2009 B2
7516882 Cucinotta Apr 2009 B2
7523053 Pudhukottai et al. Apr 2009 B2
7529836 Bolen May 2009 B1
7533113 Haddad May 2009 B1
7548968 Bura et al. Jun 2009 B1
7552480 Voss Jun 2009 B1
7562339 Racca et al. Jul 2009 B2
7565685 Ross et al. Jul 2009 B2
7567541 Karimi et al. Jul 2009 B2
7584505 Mondri et al. Sep 2009 B2
7584508 Kashchenko et al. Sep 2009 B1
7587749 Leser et al. Sep 2009 B2
7590705 Mathew et al. Sep 2009 B2
7590972 Axelrod et al. Sep 2009 B2
7603356 Schran et al. Oct 2009 B2
7606783 Carter Oct 2009 B1
7606790 Levy Oct 2009 B2
7607120 Sanyal et al. Oct 2009 B2
7613700 Lobo et al. Nov 2009 B1
7617136 Lessing et al. Nov 2009 B1
7617167 Griffis et al. Nov 2009 B2
7620644 Cote et al. Nov 2009 B2
7627666 DeGiulio et al. Dec 2009 B1
7630874 Fables et al. Dec 2009 B2
7630998 Zhou et al. Dec 2009 B2
7636742 Olavarrieta et al. Dec 2009 B1
7640322 Wendkos et al. Dec 2009 B2
7650497 Thornton et al. Jan 2010 B2
7653592 Flaxman et al. Jan 2010 B1
7657476 Barney Feb 2010 B2
7657694 Mansell et al. Feb 2010 B2
7665073 Meijer et al. Feb 2010 B2
7665125 Heard et al. Feb 2010 B2
7668947 Hutchinson et al. Feb 2010 B2
7673282 Amaru et al. Mar 2010 B2
7676034 Wu et al. Mar 2010 B1
7681034 Lee et al. Mar 2010 B1
7681140 Ebert Mar 2010 B2
7685561 Deem et al. Mar 2010 B2
7685577 Pace et al. Mar 2010 B2
7693593 Ishibashi et al. Apr 2010 B2
7698398 Lai Apr 2010 B1
7702639 Stanley et al. Apr 2010 B2
7707224 Chastagnol et al. Apr 2010 B2
7711995 Morris May 2010 B1
7712029 Ferreira et al. May 2010 B2
7716242 Pae et al. May 2010 B2
7725474 Tamai et al. May 2010 B2
7725875 Waldrep May 2010 B2
7729940 Harvey et al. Jun 2010 B2
7730142 LeVasseur et al. Jun 2010 B2
7752124 Green et al. Jul 2010 B2
7756826 Bots et al. Jul 2010 B2
7756987 Wang et al. Jul 2010 B2
7761586 Olenick et al. Jul 2010 B2
7774745 Fildebrandt et al. Aug 2010 B2
7788212 Beckmann et al. Aug 2010 B2
7788222 Shah et al. Aug 2010 B2
7788632 Kuester et al. Aug 2010 B2
7788726 Teixeira Aug 2010 B2
7797726 Ashley et al. Sep 2010 B2
7801758 Gracie et al. Sep 2010 B2
7801826 Labrou et al. Sep 2010 B2
7801912 Ransil et al. Sep 2010 B2
7802305 Leeds Sep 2010 B1
7805349 Yu et al. Sep 2010 B2
7805451 Hosokawa Sep 2010 B2
7813947 DeAngelis et al. Oct 2010 B2
7822620 Dixon et al. Oct 2010 B2
7827523 Ahmed et al. Nov 2010 B2
7836078 Dettinger et al. Nov 2010 B2
7844640 Bender et al. Nov 2010 B2
7849143 Vuong Dec 2010 B2
7853468 Callahan et al. Dec 2010 B2
7853470 Sonnleithner et al. Dec 2010 B2
7853925 Kemmler Dec 2010 B2
7860816 Fokoue-Nkoutche et al. Dec 2010 B2
7870540 Zare et al. Jan 2011 B2
7870608 Shraim et al. Jan 2011 B2
7873541 Klar et al. Jan 2011 B1
7877327 Gwiazda et al. Jan 2011 B2
7877812 Koved et al. Jan 2011 B2
7885841 King Feb 2011 B2
7890461 Oeda et al. Feb 2011 B2
7895260 Archer et al. Feb 2011 B2
7904360 Evans Mar 2011 B2
7904478 Yu et al. Mar 2011 B2
7904487 Ghatare Mar 2011 B2
7917888 Chong et al. Mar 2011 B2
7917963 Goyal et al. Mar 2011 B2
7921152 Ashley et al. Apr 2011 B2
7930197 Ozzie et al. Apr 2011 B2
7930753 Mellinger et al. Apr 2011 B2
7953725 Burris et al. May 2011 B2
7954150 Croft et al. May 2011 B2
7958087 Blumenau Jun 2011 B2
7958494 Chaar et al. Jun 2011 B2
7962900 Barraclough et al. Jun 2011 B2
7966310 Sullivan et al. Jun 2011 B2
7966599 Malasky et al. Jun 2011 B1
7966663 Strickland et al. Jun 2011 B2
7974992 Fastabend et al. Jul 2011 B2
7975000 Dixon et al. Jul 2011 B2
7991559 Dzekunov et al. Aug 2011 B2
7991747 Upadhyay et al. Aug 2011 B1
7996372 Rubel, Jr. Aug 2011 B2
8005891 Knowles et al. Aug 2011 B2
8010612 Costea et al. Aug 2011 B2
8010720 Iwaoka et al. Aug 2011 B2
8019881 Sandhu et al. Sep 2011 B2
8020206 Hubbard et al. Sep 2011 B2
8024384 Prabhakar et al. Sep 2011 B2
8032721 Murai Oct 2011 B2
8036374 Noble, Jr. Oct 2011 B2
8037409 Jacob et al. Oct 2011 B2
8041749 Beck Oct 2011 B2
8041763 Kordun et al. Oct 2011 B2
8041913 Wang Oct 2011 B2
8069161 Bugir et al. Nov 2011 B2
8069471 Boren Nov 2011 B2
8082539 Schelkogonov Dec 2011 B1
8090754 Schmidt et al. Jan 2012 B2
8095923 Harvey et al. Jan 2012 B2
8099709 Baikov et al. Jan 2012 B2
8103962 Embley et al. Jan 2012 B2
8117441 Kurien et al. Feb 2012 B2
8135815 Mayer Mar 2012 B2
8146054 Baker et al. Mar 2012 B2
8146074 Ito et al. Mar 2012 B2
8150717 Whitmore Apr 2012 B2
8156105 Altounian et al. Apr 2012 B2
8156158 Rolls et al. Apr 2012 B2
8156159 Ebrahimi et al. Apr 2012 B2
8166406 Goldfeder et al. Apr 2012 B1
8176061 Swanbeck et al. May 2012 B2
8176177 Sussman et al. May 2012 B2
8176334 Vainstein May 2012 B2
8176470 Klumpp et al. May 2012 B2
8180759 Joseph May 2012 B2
8181151 Sedukhin et al. May 2012 B2
8185409 Putnam et al. May 2012 B2
8185497 Vermeulen et al. May 2012 B2
8196176 Berteau et al. Jun 2012 B2
8205093 Argott Jun 2012 B2
8205140 Hafeez et al. Jun 2012 B2
8214362 Djabarov Jul 2012 B1
8214803 Horii et al. Jul 2012 B2
8234377 Cohn Jul 2012 B2
8239244 Ginsberg et al. Aug 2012 B2
8250051 Bugir et al. Aug 2012 B2
8255468 Vitaldevara et al. Aug 2012 B2
8260262 Ben Ayed Sep 2012 B2
8261362 Goodwin et al. Sep 2012 B2
8266231 Golovin et al. Sep 2012 B1
8275632 Awaraji et al. Sep 2012 B2
8275793 Ahmad et al. Sep 2012 B2
8286239 Sutton Oct 2012 B1
8312549 Goldberg et al. Nov 2012 B2
8316237 Felsher et al. Nov 2012 B1
8332908 Hatakeyama et al. Dec 2012 B2
8340999 Kumaran et al. Dec 2012 B2
8341405 Meijer et al. Dec 2012 B2
8346929 Lai Jan 2013 B1
8364713 Pollard Jan 2013 B2
8370224 Grewal Feb 2013 B2
8370794 Moosmann et al. Feb 2013 B2
8380630 Felsher Feb 2013 B2
8380743 Convertino et al. Feb 2013 B2
8381180 Rostoker Feb 2013 B2
8381297 Touboul Feb 2013 B2
8386314 Kirkby et al. Feb 2013 B2
8392982 Harris et al. Mar 2013 B2
8418226 Gardner Apr 2013 B2
8423954 Ronen et al. Apr 2013 B2
8429179 Mirhaji Apr 2013 B1
8429597 Prigge Apr 2013 B2
8429630 Nickolov et al. Apr 2013 B2
8429758 Chen et al. Apr 2013 B2
8438644 Watters et al. May 2013 B2
8448252 King et al. May 2013 B1
8452693 Shah et al. May 2013 B2
8463247 Misiag Jun 2013 B2
8464311 Ashley et al. Jun 2013 B2
8468244 Redlich et al. Jun 2013 B2
8473324 Alvarez et al. Jun 2013 B2
8474012 Ahmed et al. Jun 2013 B2
8494894 Jaster et al. Jul 2013 B2
8504481 Motahari et al. Aug 2013 B2
8510199 Erlanger Aug 2013 B1
8515988 Jones et al. Aug 2013 B2
8516076 Thomas Aug 2013 B2
8527337 Lim et al. Sep 2013 B1
8533746 Nolan et al. Sep 2013 B2
8533844 Mahaffey et al. Sep 2013 B2
8538817 Wilson Sep 2013 B2
8539359 Rapaport et al. Sep 2013 B2
8539437 Finlayson et al. Sep 2013 B2
8560645 Linden et al. Oct 2013 B2
8560841 Chin et al. Oct 2013 B2
8560956 Curtis et al. Oct 2013 B2
8561100 Hu et al. Oct 2013 B2
8561153 Grason et al. Oct 2013 B2
8565729 Moseler et al. Oct 2013 B2
8566726 Dixon et al. Oct 2013 B2
8566938 Prakash et al. Oct 2013 B1
8571909 Miller et al. Oct 2013 B2
8572717 Narayanaswamy Oct 2013 B2
8578036 Holfelder et al. Nov 2013 B1
8578166 De Monseignat et al. Nov 2013 B2
8578481 Rowley Nov 2013 B2
8578501 Ogilvie Nov 2013 B1
8583694 Siegel et al. Nov 2013 B2
8583766 Dixon et al. Nov 2013 B2
8589183 Awaraji et al. Nov 2013 B2
8589372 Krislov Nov 2013 B2
8601467 Hofhansl et al. Dec 2013 B2
8601591 Krishnamurthy et al. Dec 2013 B2
8606746 Yeap et al. Dec 2013 B2
8612420 Sun et al. Dec 2013 B2
8612993 Grant et al. Dec 2013 B2
8615549 Knowles et al. Dec 2013 B2
8615731 Doshi Dec 2013 B2
8620952 Bennett et al. Dec 2013 B2
8621637 Al-Harbi et al. Dec 2013 B2
8626671 Federgreen Jan 2014 B2
8627114 Resch et al. Jan 2014 B2
8630961 Beilby et al. Jan 2014 B2
8631048 Davis et al. Jan 2014 B1
8640110 Kopp et al. Jan 2014 B2
8646072 Savant Feb 2014 B1
8650399 Le Bihan et al. Feb 2014 B2
8655939 Redlich et al. Feb 2014 B2
8656265 Paulin et al. Feb 2014 B1
8656456 Maxson et al. Feb 2014 B2
8661036 Turski et al. Feb 2014 B2
8667074 Farkas Mar 2014 B1
8667487 Boodman et al. Mar 2014 B1
8677472 Dotan et al. Mar 2014 B1
8681984 Lee et al. Mar 2014 B2
8682698 Cashman et al. Mar 2014 B2
8683201 Shaty Mar 2014 B2
8683502 Shkedi et al. Mar 2014 B2
8688601 Jaiswal Apr 2014 B2
8689292 Williams et al. Apr 2014 B2
8693689 Belenkiy et al. Apr 2014 B2
8700524 Williams et al. Apr 2014 B2
8700699 Shen et al. Apr 2014 B2
8706742 Ravid et al. Apr 2014 B1
8707451 Ture et al. Apr 2014 B2
8712813 King Apr 2014 B2
8713098 Adya et al. Apr 2014 B1
8713638 Hu et al. Apr 2014 B2
8719366 Mathew et al. May 2014 B2
8732839 Hohl May 2014 B2
8744894 Christiansen et al. Jun 2014 B2
8751285 Deb et al. Jun 2014 B2
8762406 Ho et al. Jun 2014 B2
8762413 Graham, Jr. et al. Jun 2014 B2
8763071 Sinha et al. Jun 2014 B2
8763082 Huber et al. Jun 2014 B2
8763131 Archer et al. Jun 2014 B2
8767947 Ristock et al. Jul 2014 B1
8769242 Tkac et al. Jul 2014 B2
8769412 Gill et al. Jul 2014 B2
8769671 Shraim et al. Jul 2014 B2
8776241 Zaitsev Jul 2014 B2
8788935 Hirsch et al. Jul 2014 B1
8793614 Wilson et al. Jul 2014 B2
8793650 Hilerio et al. Jul 2014 B2
8793781 Grossi et al. Jul 2014 B2
8793809 Falkenburg et al. Jul 2014 B2
8799984 Ahn Aug 2014 B2
8805707 Schumann, Jr. et al. Aug 2014 B2
8805806 Amarendran et al. Aug 2014 B2
8805925 Price et al. Aug 2014 B2
8812342 Barcelo et al. Aug 2014 B2
8812752 Shih et al. Aug 2014 B1
8812766 Kranendonk et al. Aug 2014 B2
8813028 Farooqi Aug 2014 B2
8813214 McNair et al. Aug 2014 B1
8819253 Simeloff et al. Aug 2014 B2
8819617 Koenig et al. Aug 2014 B1
8819800 Gao et al. Aug 2014 B2
8826446 Liu et al. Sep 2014 B1
8832649 Bishop et al. Sep 2014 B2
8832854 Staddon et al. Sep 2014 B1
8839232 Taylor et al. Sep 2014 B2
8839346 Murgia et al. Sep 2014 B2
8843487 McGraw et al. Sep 2014 B2
8843745 Roberts, Jr. Sep 2014 B2
8849757 Kruglick Sep 2014 B2
8856534 Khosravi et al. Oct 2014 B2
8856936 Datta Ray et al. Oct 2014 B2
8862507 Sandhu et al. Oct 2014 B2
8863261 Yang Oct 2014 B2
8875232 Blom et al. Oct 2014 B2
8887047 Digiantomasso et al. Nov 2014 B2
8893078 Schaude et al. Nov 2014 B2
8893286 Oliver Nov 2014 B1
8893297 Eversoll et al. Nov 2014 B2
8904494 Kindler et al. Dec 2014 B2
8914263 Shimada et al. Dec 2014 B2
8914299 Pesci-Anderson et al. Dec 2014 B2
8914342 Kalaboukis et al. Dec 2014 B2
8914902 Moritz et al. Dec 2014 B2
8918306 Cashman et al. Dec 2014 B2
8918392 Brooker et al. Dec 2014 B1
8918632 Sartor Dec 2014 B1
8924388 Elliot et al. Dec 2014 B2
8930364 Brooker et al. Jan 2015 B1
8930896 Wiggins Jan 2015 B1
8930897 Nassar Jan 2015 B2
8935198 Phillips et al. Jan 2015 B1
8935266 Wu Jan 2015 B2
8935342 Patel Jan 2015 B2
8935804 Clark et al. Jan 2015 B1
8938221 Brazier et al. Jan 2015 B2
8943076 Stewart et al. Jan 2015 B2
8943548 Drokov et al. Jan 2015 B2
8943602 Roy et al. Jan 2015 B2
8949137 Crapo et al. Feb 2015 B2
8955038 Nicodemus et al. Feb 2015 B2
8959568 Hudis et al. Feb 2015 B2
8959584 Piliouras Feb 2015 B2
8966575 McQuay et al. Feb 2015 B2
8966597 Saylor et al. Feb 2015 B1
8973108 Roth et al. Mar 2015 B1
8977234 Chava Mar 2015 B2
8977643 Schindlauer et al. Mar 2015 B2
8978158 Rajkumar et al. Mar 2015 B2
8983972 Kriebel et al. Mar 2015 B2
8984031 Todd Mar 2015 B1
8990933 Magdalin Mar 2015 B1
8996417 Channakeshava Mar 2015 B1
8996480 Agarwala et al. Mar 2015 B2
8997213 Papakipos et al. Mar 2015 B2
9001673 Birdsall et al. Apr 2015 B2
9002939 Laden et al. Apr 2015 B2
9003295 Baschy Apr 2015 B2
9003552 Goodwin et al. Apr 2015 B2
9009851 Droste et al. Apr 2015 B2
9014661 Decharms Apr 2015 B2
9015796 Fujioka Apr 2015 B1
9021469 Hilerio et al. Apr 2015 B2
9026526 Bau et al. May 2015 B1
9030987 Bianchetti et al. May 2015 B2
9032067 Prasad et al. May 2015 B2
9043217 Cashman et al. May 2015 B2
9043480 Barton et al. May 2015 B2
9047463 Porras Jun 2015 B2
9047582 Hutchinson et al. Jun 2015 B2
9047583 Patton et al. Jun 2015 B2
9047639 Quintiliani et al. Jun 2015 B1
9049244 Prince et al. Jun 2015 B2
9049314 Pugh et al. Jun 2015 B2
9055071 Gates et al. Jun 2015 B1
9058590 Criddle et al. Jun 2015 B2
9064033 Jin et al. Jun 2015 B2
9069940 Hars Jun 2015 B2
9076231 Hill et al. Jul 2015 B1
9077736 Werth et al. Jul 2015 B2
9081952 Sagi et al. Jul 2015 B2
9087090 Cormier et al. Jul 2015 B1
9092796 Eversoll et al. Jul 2015 B2
9094434 Williams et al. Jul 2015 B2
9098515 Richter et al. Aug 2015 B2
9100337 Battré et al. Aug 2015 B1
9100778 Stogaitis et al. Aug 2015 B2
9106691 Burger et al. Aug 2015 B1
9106710 Feimster Aug 2015 B1
9110918 Rajaa et al. Aug 2015 B1
9111105 Barton et al. Aug 2015 B2
9111295 Tietzen et al. Aug 2015 B2
9123330 Sharifi et al. Sep 2015 B1
9123339 Shaw et al. Sep 2015 B1
9129311 Schoen et al. Sep 2015 B2
9135261 Maunder et al. Sep 2015 B2
9135444 Carter et al. Sep 2015 B2
9141823 Dawson Sep 2015 B2
9141911 Zhao et al. Sep 2015 B2
9152818 Hathaway et al. Oct 2015 B1
9152820 Pauley, Jr. et al. Oct 2015 B1
9154514 Prakash Oct 2015 B1
9154556 Dotan et al. Oct 2015 B1
9158655 Wadhwani et al. Oct 2015 B2
9165036 Mehra Oct 2015 B2
9170996 Lovric et al. Oct 2015 B2
9172706 Krishnamurthy et al. Oct 2015 B2
9177293 Gagnon et al. Nov 2015 B1
9178901 Xue et al. Nov 2015 B2
9183100 Gventer et al. Nov 2015 B2
9189642 Perlman Nov 2015 B2
9201572 Lyon et al. Dec 2015 B2
9201770 Duerk Dec 2015 B1
9202026 Reeves Dec 2015 B1
9202085 Mawdsley et al. Dec 2015 B2
9215076 Roth et al. Dec 2015 B1
9215252 Smith et al. Dec 2015 B2
9218596 Ronca et al. Dec 2015 B2
9224009 Liu et al. Dec 2015 B1
9230036 Davis Jan 2016 B2
9231935 Bridge et al. Jan 2016 B1
9232040 Barash et al. Jan 2016 B2
9235476 Mchugh et al. Jan 2016 B2
9240987 Barrett-Bowen et al. Jan 2016 B2
9241259 Daniela et al. Jan 2016 B2
9245126 Christodorescu et al. Jan 2016 B2
9245266 Hardt Jan 2016 B2
9253609 Hosier, Jr. Feb 2016 B2
9258116 Moskowitz et al. Feb 2016 B2
9264443 Weisman Feb 2016 B2
9274858 Milliron et al. Mar 2016 B2
9280581 Grimes et al. Mar 2016 B1
9286149 Sampson et al. Mar 2016 B2
9286282 Ling, III et al. Mar 2016 B2
9288118 Pattan Mar 2016 B1
9288556 Kim et al. Mar 2016 B2
9294498 Yampolskiy et al. Mar 2016 B1
9299050 Stiffler et al. Mar 2016 B2
9306939 Chan et al. Apr 2016 B2
9317697 Maier et al. Apr 2016 B2
9317715 Schuette et al. Apr 2016 B2
9325731 Mcgeehan Apr 2016 B2
9336184 Mital et al. May 2016 B2
9336220 Li et al. May 2016 B2
9336324 Lomme et al. May 2016 B2
9336332 Davis et al. May 2016 B2
9336400 Milman et al. May 2016 B2
9338188 Ahn May 2016 B1
9342706 Chawla et al. May 2016 B2
9344297 Shah et al. May 2016 B2
9344424 Tenenboym et al. May 2016 B2
9344484 Ferris May 2016 B2
9348802 Massand May 2016 B2
9348862 Kawecki, III May 2016 B2
9348929 Eberlein May 2016 B2
9349016 Brisebois et al. May 2016 B1
9350718 Sondhi et al. May 2016 B2
9355157 Mohammed et al. May 2016 B2
9356961 Todd et al. May 2016 B1
9361446 Demirjian et al. Jun 2016 B1
9369488 Woods et al. Jun 2016 B2
9372869 Joseph et al. Jun 2016 B2
9374693 Olincy et al. Jun 2016 B1
9384199 Thereska et al. Jul 2016 B2
9384357 Patil et al. Jul 2016 B2
9386078 Reno et al. Jul 2016 B2
9386104 Adams et al. Jul 2016 B2
9395959 Hatfield et al. Jul 2016 B2
9396332 Abrams et al. Jul 2016 B2
9401900 Levasseur et al. Jul 2016 B2
9411967 Parecki et al. Aug 2016 B2
9411982 Dippenaar et al. Aug 2016 B1
9417859 Gounares et al. Aug 2016 B2
9418221 Turgeman Aug 2016 B2
9424021 Zamir Aug 2016 B2
9424414 Demirjian et al. Aug 2016 B1
9426177 Wang et al. Aug 2016 B2
9450940 Belov et al. Sep 2016 B2
9460136 Todd et al. Oct 2016 B1
9460171 Marrelli et al. Oct 2016 B2
9460307 Breslau et al. Oct 2016 B2
9461876 Van Dusen et al. Oct 2016 B2
9462009 Kolman et al. Oct 2016 B1
9465702 Gventer et al. Oct 2016 B2
9465800 Lacey Oct 2016 B2
9473446 Vijay et al. Oct 2016 B2
9473505 Asano et al. Oct 2016 B1
9473535 Sartor Oct 2016 B2
9477523 Warman et al. Oct 2016 B1
9477660 Scott et al. Oct 2016 B2
9477685 Leung et al. Oct 2016 B1
9477942 Adachi et al. Oct 2016 B2
9483659 Bao et al. Nov 2016 B2
9489366 Scott et al. Nov 2016 B2
9495547 Schepis et al. Nov 2016 B1
9501523 Hyatt et al. Nov 2016 B2
9507960 Bell et al. Nov 2016 B2
9509674 Nasserbakht et al. Nov 2016 B1
9509702 Grigg et al. Nov 2016 B2
9514231 Eden Dec 2016 B2
9516012 Chochois et al. Dec 2016 B2
9521166 Wilson Dec 2016 B2
9524500 Dave et al. Dec 2016 B2
9529989 Kling et al. Dec 2016 B2
9536108 Powell et al. Jan 2017 B2
9537546 Cordeiro et al. Jan 2017 B2
9542568 Francis et al. Jan 2017 B2
9549047 Fredinburg et al. Jan 2017 B1
9552395 Bayer et al. Jan 2017 B2
9552470 Turgeman et al. Jan 2017 B2
9553918 Manion et al. Jan 2017 B1
9558497 Carvalho Jan 2017 B2
9569752 Deering et al. Feb 2017 B2
9571506 Boss et al. Feb 2017 B2
9571509 Satish et al. Feb 2017 B1
9571526 Sartor Feb 2017 B2
9571559 Raleigh et al. Feb 2017 B2
9571991 Brizendine et al. Feb 2017 B1
9576289 Henderson et al. Feb 2017 B2
9578060 Brisebois et al. Feb 2017 B1
9578173 Sanghavi et al. Feb 2017 B2
9582681 Mishra Feb 2017 B2
9584964 Pelkey Feb 2017 B2
9589110 Carey et al. Mar 2017 B2
9600181 Patel et al. Mar 2017 B2
9602529 Jones et al. Mar 2017 B2
9606971 Seolas et al. Mar 2017 B2
9607041 Himmelstein Mar 2017 B2
9619652 Slater Apr 2017 B2
9619661 Finkelstein Apr 2017 B1
9621357 Williams et al. Apr 2017 B2
9621566 Gupta et al. Apr 2017 B2
9626124 Lipinski et al. Apr 2017 B2
9626680 Ryan et al. Apr 2017 B1
9629064 Graves et al. Apr 2017 B2
9642008 Wyatt et al. May 2017 B2
9646095 Gottlieb et al. May 2017 B1
9647949 Varki et al. May 2017 B2
9648036 Seiver et al. May 2017 B2
9652314 Mahiddini May 2017 B2
9654506 Barrett May 2017 B2
9654541 Kapczynski et al. May 2017 B1
9665722 Nagasundaram et al. May 2017 B2
9665733 Sills et al. May 2017 B1
9665883 Roullier et al. May 2017 B2
9672053 Tang et al. Jun 2017 B2
9672355 Titonis et al. Jun 2017 B2
9678794 Barrett et al. Jun 2017 B1
9691090 Barday Jun 2017 B1
9697368 Dharawat Jul 2017 B2
9699209 Ng et al. Jul 2017 B2
9703549 Dufresne Jul 2017 B2
9704103 Suskind et al. Jul 2017 B2
9705840 Pujare et al. Jul 2017 B2
9705880 Siris Jul 2017 B2
9721078 Cornick et al. Aug 2017 B2
9721108 Krishnamurthy et al. Aug 2017 B2
9727751 Oliver et al. Aug 2017 B2
9729583 Barday Aug 2017 B1
9734148 Bendersky et al. Aug 2017 B2
9734255 Jiang Aug 2017 B2
9736004 Jung et al. Aug 2017 B2
9740985 Byron et al. Aug 2017 B2
9740987 Dolan Aug 2017 B2
9749408 Subramani et al. Aug 2017 B2
9753703 Jemiolo Sep 2017 B2
9754091 Kode et al. Sep 2017 B2
9756059 Demirjian et al. Sep 2017 B2
9760620 Nachnani et al. Sep 2017 B2
9760635 Bliss et al. Sep 2017 B2
9760697 Walker Sep 2017 B1
9760849 Vinnakota et al. Sep 2017 B2
9762553 Ford et al. Sep 2017 B2
9767202 Darby et al. Sep 2017 B2
9767309 Patel et al. Sep 2017 B1
9769124 Yan Sep 2017 B2
9773269 Lazarus Sep 2017 B1
9785795 Grondin et al. Oct 2017 B2
9787671 Bogrett Oct 2017 B1
9798749 Saner Oct 2017 B2
9798826 Wilson et al. Oct 2017 B2
9798896 Jakobsson Oct 2017 B2
9800605 Baikalov et al. Oct 2017 B2
9800606 Yumer Oct 2017 B1
9804649 Cohen et al. Oct 2017 B2
9804928 Davis et al. Oct 2017 B2
9805381 Frank et al. Oct 2017 B2
9811532 Parkison et al. Nov 2017 B2
9817850 Dubbels et al. Nov 2017 B2
9817978 Marsh et al. Nov 2017 B2
9819684 Cernoch et al. Nov 2017 B2
9825928 Lelcuk et al. Nov 2017 B2
9830563 Paknad Nov 2017 B2
9832633 Gerber, Jr. et al. Nov 2017 B2
9836598 Iyer et al. Dec 2017 B2
9838407 Oprea et al. Dec 2017 B1
9838839 Vudali et al. Dec 2017 B2
9841969 Seibert, Jr. et al. Dec 2017 B2
9842042 Chhatwal et al. Dec 2017 B2
9842349 Sawczuk et al. Dec 2017 B2
9848005 Ardeli et al. Dec 2017 B2
9848061 Jain et al. Dec 2017 B1
9852150 Sharpe et al. Dec 2017 B2
9853959 Kapczynski et al. Dec 2017 B1
9860226 Thormaehlen Jan 2018 B2
9864735 Lamprecht Jan 2018 B1
9876825 Amar et al. Jan 2018 B2
9877138 Franklin Jan 2018 B1
9880157 Levak et al. Jan 2018 B2
9882935 Barday Jan 2018 B2
9887965 Kay et al. Feb 2018 B2
9888377 Mccorkendale et al. Feb 2018 B1
9892441 Barday Feb 2018 B2
9892442 Barday Feb 2018 B2
9892443 Barday Feb 2018 B2
9892444 Barday Feb 2018 B2
9894076 Li et al. Feb 2018 B2
9898613 Swerdlow et al. Feb 2018 B1
9898739 Monastyrsky et al. Feb 2018 B2
9898769 Barday Feb 2018 B2
9912625 Mutha et al. Mar 2018 B2
9912677 Chien Mar 2018 B2
9912810 Segre et al. Mar 2018 B2
9916703 Levinson et al. Mar 2018 B2
9922124 Rathod Mar 2018 B2
9923927 Mcclintock et al. Mar 2018 B1
9928379 Hoffer Mar 2018 B1
9934493 Castinado et al. Apr 2018 B2
9934544 Whitfield et al. Apr 2018 B1
9936127 Todasco Apr 2018 B2
9942214 Burciu et al. Apr 2018 B1
9942244 Lahoz et al. Apr 2018 B2
9942276 Sartor Apr 2018 B2
9946897 Lovin Apr 2018 B2
9948652 Yu et al. Apr 2018 B2
9948663 Wang et al. Apr 2018 B1
9953189 Cook et al. Apr 2018 B2
9954879 Sadaghiani et al. Apr 2018 B1
9954883 Ahuja et al. Apr 2018 B2
9959551 Schermerhorn et al. May 2018 B1
9959582 Sukman et al. May 2018 B2
9961070 Tang May 2018 B2
9973518 Lee et al. May 2018 B2
9973585 Ruback et al. May 2018 B2
9977904 Khan et al. May 2018 B2
9977920 Danielson et al. May 2018 B2
9983936 Dornemann et al. May 2018 B2
9984252 Pollard May 2018 B2
9990499 Chan et al. Jun 2018 B2
9992213 Sinnema Jun 2018 B2
10001975 Bharthulwar Jun 2018 B2
10002064 Muske Jun 2018 B2
10007895 Vanasco Jun 2018 B2
10013577 Beaumont et al. Jul 2018 B1
10015164 Hamburg et al. Jul 2018 B2
10019339 Von Hanxleden et al. Jul 2018 B2
10019588 Garcia et al. Jul 2018 B2
10019591 Beguin Jul 2018 B1
10019741 Hesselink Jul 2018 B2
10021143 Cabrera et al. Jul 2018 B2
10025804 Vranyes et al. Jul 2018 B2
10025836 Batchu et al. Jul 2018 B2
10028226 Ayyagari et al. Jul 2018 B2
10032172 Barday Jul 2018 B2
10044761 Ducatel et al. Aug 2018 B2
10055426 Arasan et al. Aug 2018 B2
10055869 Borrelli et al. Aug 2018 B2
10061847 Mohammed et al. Aug 2018 B2
10069858 Robinson et al. Sep 2018 B2
10069914 Smith Sep 2018 B1
10073924 Karp et al. Sep 2018 B2
10075437 Costigan et al. Sep 2018 B1
10075451 Hall et al. Sep 2018 B1
10084817 Saher et al. Sep 2018 B2
10091214 Godlewski et al. Oct 2018 B2
10091312 Khanwalkar et al. Oct 2018 B1
10097551 Chan et al. Oct 2018 B2
10102533 Barday Oct 2018 B2
10108409 Pirzadeh et al. Oct 2018 B2
10122663 Hu et al. Nov 2018 B2
10122760 Terrill et al. Nov 2018 B2
10127403 Kong et al. Nov 2018 B2
10129211 Heath Nov 2018 B2
10140666 Wang et al. Nov 2018 B1
10142113 Zaidi et al. Nov 2018 B2
10152560 Potiagalov et al. Dec 2018 B2
10158676 Barday Dec 2018 B2
10165011 Barday Dec 2018 B2
10169762 Ogawa Jan 2019 B2
10176503 Barday et al. Jan 2019 B2
10181043 Pauley, Jr. et al. Jan 2019 B1
10181051 Barday et al. Jan 2019 B2
10187363 Smirnoff et al. Jan 2019 B2
10187394 Bar et al. Jan 2019 B2
10188950 Biswas et al. Jan 2019 B2
10204154 Barday et al. Feb 2019 B2
10205994 Splaine et al. Feb 2019 B2
10212134 Rai Feb 2019 B2
10212175 Seul et al. Feb 2019 B2
10223533 Dawson Mar 2019 B2
10230571 Rangasamy et al. Mar 2019 B2
10242228 Barday et al. Mar 2019 B2
10250594 Chathoth et al. Apr 2019 B2
10255602 Wang Apr 2019 B2
10257127 Dotan-Cohen et al. Apr 2019 B2
10257181 Sherif et al. Apr 2019 B1
10268838 Yadgiri et al. Apr 2019 B2
10275221 Thattai et al. Apr 2019 B2
10275614 Barday et al. Apr 2019 B2
10282370 Barday et al. May 2019 B1
10282559 Barday et al. May 2019 B2
10284604 Barday et al. May 2019 B2
10289584 Chiba May 2019 B2
10289857 Brinskelle May 2019 B1
10289866 Barday et al. May 2019 B2
10289867 Barday et al. May 2019 B2
10289870 Barday et al. May 2019 B2
10291731 Huang May 2019 B2
10296504 Hock et al. May 2019 B2
10304442 Rudden et al. May 2019 B1
10310723 Rathod Jun 2019 B2
10311042 Kumar Jun 2019 B1
10311475 Yuasa Jun 2019 B2
10311492 Gelfenbeyn et al. Jun 2019 B2
10318761 Barday et al. Jun 2019 B2
10320940 Brennan et al. Jun 2019 B1
10324960 Skvortsov et al. Jun 2019 B1
10326768 Verweyst et al. Jun 2019 B2
10326798 Lambert Jun 2019 B2
10326841 Bradley et al. Jun 2019 B2
10327100 Davis et al. Jun 2019 B1
10331689 Sorrentino et al. Jun 2019 B2
10331904 Sher-Jan et al. Jun 2019 B2
10333975 Soman et al. Jun 2019 B2
10339470 Dutta et al. Jul 2019 B1
10346186 Kalyanpur Jul 2019 B2
10346635 Kumar et al. Jul 2019 B2
10346637 Barday et al. Jul 2019 B2
10346638 Barday et al. Jul 2019 B2
10346849 Ionescu et al. Jul 2019 B2
10348726 Caluwaert Jul 2019 B2
10348775 Barday Jul 2019 B2
10353673 Barday et al. Jul 2019 B2
10361857 Woo Jul 2019 B2
10366241 Sartor Jul 2019 B2
10373119 Driscoll et al. Aug 2019 B2
10373409 White et al. Aug 2019 B2
10375115 Mallya Aug 2019 B2
10387559 Wendt et al. Aug 2019 B1
10387577 Hill et al. Aug 2019 B2
10387657 Belfiore, Jr. et al. Aug 2019 B2
10387952 Sandhu et al. Aug 2019 B1
10395201 Vescio Aug 2019 B2
10402545 Gorfein et al. Sep 2019 B2
10404729 Turgeman Sep 2019 B2
10417401 Votaw et al. Sep 2019 B2
10417445 Wouhaybi et al. Sep 2019 B2
10417621 Cassel et al. Sep 2019 B2
10419476 Parekh Sep 2019 B2
10423985 Dutta et al. Sep 2019 B1
10425492 Comstock et al. Sep 2019 B2
10430608 Peri et al. Oct 2019 B2
10435350 Ito et al. Oct 2019 B2
10437412 Barday et al. Oct 2019 B2
10437860 Barday et al. Oct 2019 B2
10438016 Barday et al. Oct 2019 B2
10438273 Burns et al. Oct 2019 B2
10440062 Barday et al. Oct 2019 B2
10445508 Sher-Jan et al. Oct 2019 B2
10445526 Barday et al. Oct 2019 B2
10452864 Barday et al. Oct 2019 B2
10452866 Barday et al. Oct 2019 B2
10453076 Parekh et al. Oct 2019 B2
10453092 Wang et al. Oct 2019 B1
10454934 Parimi et al. Oct 2019 B2
10481763 Bartkiewicz et al. Nov 2019 B2
10489454 Chen Nov 2019 B1
10503926 Barday et al. Dec 2019 B2
10510031 Barday et al. Dec 2019 B2
10521623 Rodriguez et al. Dec 2019 B2
10534851 Chan et al. Jan 2020 B1
10535081 Ferreira et al. Jan 2020 B2
10536475 Mccorkle, Jr. et al. Jan 2020 B1
10536478 Kirti et al. Jan 2020 B2
10540212 Feng et al. Jan 2020 B2
10541938 Timmerman et al. Jan 2020 B1
10546135 Kassoumeh et al. Jan 2020 B1
10552462 Hart Feb 2020 B1
10558809 Joyce et al. Feb 2020 B1
10558821 Barday et al. Feb 2020 B2
10564815 Soon-Shiong Feb 2020 B2
10564935 Barday et al. Feb 2020 B2
10564936 Barday et al. Feb 2020 B2
10565161 Barday et al. Feb 2020 B2
10565236 Barday et al. Feb 2020 B1
10567439 Barday Feb 2020 B2
10567517 Weinig et al. Feb 2020 B2
10572684 Lafever et al. Feb 2020 B2
10572686 Barday et al. Feb 2020 B2
10572778 Robinson Feb 2020 B1
10574705 Barday et al. Feb 2020 B2
10581825 Poschel et al. Mar 2020 B2
10592648 Barday et al. Mar 2020 B2
10592692 Brannon et al. Mar 2020 B2
10599456 Lissack Mar 2020 B2
10606916 Brannon et al. Mar 2020 B2
10613971 Vasikarla Apr 2020 B1
10614365 Sathish et al. Apr 2020 B2
10628553 Murrish et al. Apr 2020 B1
10645102 Hamdi May 2020 B2
10645548 Reynolds et al. May 2020 B2
10649630 Vora et al. May 2020 B1
10650408 Andersen et al. May 2020 B1
10657469 Bade et al. May 2020 B2
10657504 Zimmerman et al. May 2020 B1
10659566 Luah et al. May 2020 B1
10671749 Felice-Steele et al. Jun 2020 B2
10671760 Esmailzadeh et al. Jun 2020 B2
10678945 Barday et al. Jun 2020 B2
10685140 Barday et al. Jun 2020 B2
10706176 Brannon et al. Jul 2020 B2
10706226 Byun et al. Jul 2020 B2
10708305 Barday et al. Jul 2020 B2
10713387 Brannon et al. Jul 2020 B2
10726145 Duminy et al. Jul 2020 B2
10726153 Nerurkar et al. Jul 2020 B2
10726158 Brannon et al. Jul 2020 B2
10732865 Jain et al. Aug 2020 B2
10735388 Rose et al. Aug 2020 B2
10740487 Barday et al. Aug 2020 B2
10747893 Kiriyama et al. Aug 2020 B2
10747897 Cook Aug 2020 B2
10749870 Brouillette et al. Aug 2020 B2
10762213 Rudek et al. Sep 2020 B2
10762230 Ancin et al. Sep 2020 B2
10762236 Brannon et al. Sep 2020 B2
10769302 Barday et al. Sep 2020 B2
10769303 Brannon et al. Sep 2020 B2
10776510 Antonelli et al. Sep 2020 B2
10776518 Barday et al. Sep 2020 B2
10778792 Handy Bosma et al. Sep 2020 B1
10783256 Brannon et al. Sep 2020 B2
10785173 Willett et al. Sep 2020 B2
10785299 Gupta et al. Sep 2020 B2
10791150 Barday et al. Sep 2020 B2
10795527 Legge et al. Oct 2020 B1
10796020 Barday et al. Oct 2020 B2
10796260 Brannon et al. Oct 2020 B2
10798133 Barday et al. Oct 2020 B2
10803196 Bodegas Martinez et al. Oct 2020 B2
10805331 Boyer et al. Oct 2020 B2
10831831 Greene Nov 2020 B2
10834590 Turgeman et al. Nov 2020 B2
10839100 Hollinger et al. Nov 2020 B2
10846433 Brannon et al. Nov 2020 B2
10853356 Mcpherson et al. Dec 2020 B1
10853501 Brannon Dec 2020 B2
10860721 Gentile Dec 2020 B1
10860742 Joseph et al. Dec 2020 B2
10860979 Geffen et al. Dec 2020 B2
10878127 Brannon et al. Dec 2020 B2
10885485 Brannon et al. Jan 2021 B2
10891393 Currier et al. Jan 2021 B2
10893074 Sartor Jan 2021 B2
10896394 Brannon et al. Jan 2021 B2
10902490 He et al. Jan 2021 B2
10909488 Hecht et al. Feb 2021 B2
10924514 Altman et al. Feb 2021 B1
10929557 Chavez Feb 2021 B2
10949555 Rattan et al. Mar 2021 B2
10949565 Barday et al. Mar 2021 B2
10956213 Chambers et al. Mar 2021 B1
10957326 Bhaya et al. Mar 2021 B2
10963571 Bar Joseph et al. Mar 2021 B2
10963572 Belfiore, Jr. et al. Mar 2021 B2
10965547 Esposito et al. Mar 2021 B1
10970418 Durvasula et al. Apr 2021 B2
10972509 Barday et al. Apr 2021 B2
10976950 Trezzo et al. Apr 2021 B1
10983963 Venkatasubramanian et al. Apr 2021 B1
10984458 Gutierrez Apr 2021 B1
10997318 Barday et al. May 2021 B2
11003748 Oliker et al. May 2021 B2
11012475 Patnala et al. May 2021 B2
11023528 Lee et al. Jun 2021 B1
11023921 Wang et al. Jun 2021 B2
11037168 Lee et al. Jun 2021 B1
11057356 Malhotra et al. Jul 2021 B2
11057427 Wright et al. Jul 2021 B2
11062051 Barday et al. Jul 2021 B2
11068318 Kuesel et al. Jul 2021 B2
11068584 Burriesci et al. Jul 2021 B2
11068618 Brannon et al. Jul 2021 B2
11068797 Bhide et al. Jul 2021 B2
11068847 Boutros et al. Jul 2021 B2
11093950 Hersh et al. Aug 2021 B2
11138299 Brannon et al. Oct 2021 B2
11144622 Brannon et al. Oct 2021 B2
11144678 Dondini et al. Oct 2021 B2
11144862 Jackson et al. Oct 2021 B1
11195134 Brannon et al. Dec 2021 B2
11201929 Dudmesh et al. Dec 2021 B2
11210420 Brannon et al. Dec 2021 B2
11238390 Brannon et al. Feb 2022 B2
11240273 Barday et al. Feb 2022 B2
11245951 Lim et al. Feb 2022 B2
11246520 Clifford et al. Feb 2022 B2
11252159 Kannan et al. Feb 2022 B2
11256777 Brannon et al. Feb 2022 B2
11263262 Chen Mar 2022 B2
11327996 Reynolds et al. May 2022 B2
11562078 Sabourin Jan 2023 B2
11682399 Paulraj Jun 2023 B2
20020004736 Roundtree et al. Jan 2002 A1
20020049907 Woods et al. Apr 2002 A1
20020055932 Wheeler et al. May 2002 A1
20020077941 Halligan et al. Jun 2002 A1
20020103854 Okita Aug 2002 A1
20020129216 Collins Sep 2002 A1
20020161594 Bryan et al. Oct 2002 A1
20020161733 Grainger Oct 2002 A1
20030041250 Proudler Feb 2003 A1
20030065641 Chaloux Apr 2003 A1
20030093680 Astley et al. May 2003 A1
20030097451 Bjorksten et al. May 2003 A1
20030097661 Li et al. May 2003 A1
20030115142 Brickell et al. Jun 2003 A1
20030130893 Farmer Jul 2003 A1
20030131001 Matsuo Jul 2003 A1
20030131093 Aschen et al. Jul 2003 A1
20030140150 Kemp et al. Jul 2003 A1
20030167216 Brown et al. Sep 2003 A1
20030212604 Cullen, III Nov 2003 A1
20040002818 Kulp et al. Jan 2004 A1
20040025053 Hayward Feb 2004 A1
20040088235 Ziekle et al. May 2004 A1
20040098366 Sinclair et al. May 2004 A1
20040098493 Rees May 2004 A1
20040111359 Hudock Jun 2004 A1
20040186912 Harlow et al. Sep 2004 A1
20040193907 Patanella Sep 2004 A1
20050022198 Olapurath et al. Jan 2005 A1
20050033616 Vavul et al. Feb 2005 A1
20050076294 DeHamer et al. Apr 2005 A1
20050114343 Wesinger et al. May 2005 A1
20050144066 Cope et al. Jun 2005 A1
20050197884 Mullen, Jr. Sep 2005 A1
20050198177 Black Sep 2005 A1
20050198646 Kortela Sep 2005 A1
20050246292 Sarcanin Nov 2005 A1
20050278538 Fowler Dec 2005 A1
20060031078 Pizzinger et al. Feb 2006 A1
20060035204 LaMarche et al. Feb 2006 A1
20060075122 Lindskog et al. Apr 2006 A1
20060149730 Curtis Jul 2006 A1
20060156052 Bodnar et al. Jul 2006 A1
20060190280 Hoebel et al. Aug 2006 A1
20060206375 Scott et al. Sep 2006 A1
20060224422 Cohen Oct 2006 A1
20060253597 Mujica Nov 2006 A1
20060259416 Johnson Nov 2006 A1
20070011058 Dev Jan 2007 A1
20070027715 Gropper et al. Feb 2007 A1
20070061125 Bhatt et al. Mar 2007 A1
20070061393 Moore Mar 2007 A1
20070130101 Anderson et al. Jun 2007 A1
20070130323 Landsman et al. Jun 2007 A1
20070157311 Meier et al. Jul 2007 A1
20070173355 Klein Jul 2007 A1
20070179793 Bagchi et al. Aug 2007 A1
20070180490 Renzi et al. Aug 2007 A1
20070192438 Goei Aug 2007 A1
20070266420 Hawkins et al. Nov 2007 A1
20070283171 Breslin et al. Dec 2007 A1
20080005194 Smolen et al. Jan 2008 A1
20080015927 Ramirez Jan 2008 A1
20080028065 Caso et al. Jan 2008 A1
20080028435 Strickland et al. Jan 2008 A1
20080047016 Spoonamore Feb 2008 A1
20080120699 Spear May 2008 A1
20080140696 Mathuria Jun 2008 A1
20080189306 Hewett et al. Aug 2008 A1
20080195436 Whyte Aug 2008 A1
20080222271 Spires Sep 2008 A1
20080235177 Kim et al. Sep 2008 A1
20080270203 Holmes et al. Oct 2008 A1
20080270351 Thomsen Oct 2008 A1
20080270381 Thomsen Oct 2008 A1
20080270382 Thomsen et al. Oct 2008 A1
20080270451 Thomsen et al. Oct 2008 A1
20080270462 Thomsen Oct 2008 A1
20080281649 Morris Nov 2008 A1
20080282320 DeNovo et al. Nov 2008 A1
20080288271 Faust Nov 2008 A1
20080288299 Schultz Nov 2008 A1
20090012896 Arnold Jan 2009 A1
20090022301 Mudaliar Jan 2009 A1
20090037975 Ishikawa et al. Feb 2009 A1
20090119500 Roth et al. May 2009 A1
20090132419 Grammer et al. May 2009 A1
20090138276 Hayashida et al. May 2009 A1
20090140035 Miller Jun 2009 A1
20090144702 Atkin et al. Jun 2009 A1
20090158249 Tomkins et al. Jun 2009 A1
20090172705 Cheong Jul 2009 A1
20090182818 Krywaniuk Jul 2009 A1
20090187764 Astakhov et al. Jul 2009 A1
20090204452 Iskandar et al. Aug 2009 A1
20090204820 Brandenburg et al. Aug 2009 A1
20090210347 Sarcanin Aug 2009 A1
20090216610 Chorny Aug 2009 A1
20090249076 Reed et al. Oct 2009 A1
20090303237 Liu et al. Dec 2009 A1
20100010912 Jones et al. Jan 2010 A1
20100010968 Redlich et al. Jan 2010 A1
20100077484 Paretti et al. Mar 2010 A1
20100082533 Nakamura et al. Apr 2010 A1
20100094650 Tran et al. Apr 2010 A1
20100100398 Auker et al. Apr 2010 A1
20100121773 Currier et al. May 2010 A1
20100192201 Shimoni et al. Jul 2010 A1
20100205057 Hook et al. Aug 2010 A1
20100223349 Thorson Sep 2010 A1
20100228786 Török Sep 2010 A1
20100234987 Benschop et al. Sep 2010 A1
20100235297 Mamorsky Sep 2010 A1
20100235915 Memon et al. Sep 2010 A1
20100262624 Pullikottil Oct 2010 A1
20100268628 Pitkow et al. Oct 2010 A1
20100268932 Bhattacharjee Oct 2010 A1
20100281313 White et al. Nov 2010 A1
20100287114 Bartko et al. Nov 2010 A1
20100333012 Adachi et al. Dec 2010 A1
20110006996 Smith et al. Jan 2011 A1
20110010202 Neale Jan 2011 A1
20110082794 Blechman Apr 2011 A1
20110137696 Meyer et al. Jun 2011 A1
20110145154 Rivers et al. Jun 2011 A1
20110153396 Marcuvitz et al. Jun 2011 A1
20110191664 Sheleheda et al. Aug 2011 A1
20110208850 Sheleheda et al. Aug 2011 A1
20110209067 Bogess et al. Aug 2011 A1
20110231896 Tovar Sep 2011 A1
20110238573 Varadarajan Sep 2011 A1
20110252456 Hatakeyama Oct 2011 A1
20110302643 Pichna et al. Dec 2011 A1
20120041939 Amsterdamski Feb 2012 A1
20120084151 Kozak et al. Apr 2012 A1
20120084349 Lee et al. Apr 2012 A1
20120102411 Sathish Apr 2012 A1
20120102543 Kohli et al. Apr 2012 A1
20120109830 Vogel May 2012 A1
20120110674 Belani et al. May 2012 A1
20120116923 Irving et al. May 2012 A1
20120131438 Li et al. May 2012 A1
20120143650 Crowley et al. Jun 2012 A1
20120144499 Tan et al. Jun 2012 A1
20120191596 Kremen et al. Jul 2012 A1
20120226621 Petran et al. Sep 2012 A1
20120239557 Weinflash et al. Sep 2012 A1
20120254320 Dove et al. Oct 2012 A1
20120259752 Agee Oct 2012 A1
20120323700 Aleksandrovich et al. Dec 2012 A1
20120330769 Arceo Dec 2012 A1
20120330869 Durham Dec 2012 A1
20130004933 Bhaskaran Jan 2013 A1
20130018954 Cheng Jan 2013 A1
20130085801 Sharpe et al. Apr 2013 A1
20130091156 Raiche et al. Apr 2013 A1
20130103485 Postrel Apr 2013 A1
20130111323 Taghaddos et al. May 2013 A1
20130124257 Schubert May 2013 A1
20130159351 Hamann et al. Jun 2013 A1
20130171968 Wang Jul 2013 A1
20130179982 Bridges et al. Jul 2013 A1
20130179988 Bekker et al. Jul 2013 A1
20130185806 Hatakeyama Jul 2013 A1
20130211872 Cherry Aug 2013 A1
20130218829 Martinez Aug 2013 A1
20130219459 Bradley Aug 2013 A1
20130254139 Lei Sep 2013 A1
20130254649 ONeill Sep 2013 A1
20130254699 Bashir et al. Sep 2013 A1
20130262328 Federgreen Oct 2013 A1
20130282438 Hunter et al. Oct 2013 A1
20130282466 Hampton Oct 2013 A1
20130290169 Bathula et al. Oct 2013 A1
20130298071 Wine Nov 2013 A1
20130311224 Heroux et al. Nov 2013 A1
20130318207 Dotter Nov 2013 A1
20130326112 Park et al. Dec 2013 A1
20130332362 Ciurea Dec 2013 A1
20130340086 Blom Dec 2013 A1
20140006355 Kirihata Jan 2014 A1
20140006616 Aad et al. Jan 2014 A1
20140012833 Humprecht Jan 2014 A1
20140019561 Belity et al. Jan 2014 A1
20140032259 Lafever et al. Jan 2014 A1
20140032265 Paprocki Jan 2014 A1
20140040134 Ciurea Feb 2014 A1
20140040161 Berlin Feb 2014 A1
20140040979 Barton et al. Feb 2014 A1
20140041048 Goodwin et al. Feb 2014 A1
20140047551 Nagasundaram et al. Feb 2014 A1
20140052463 Cashman et al. Feb 2014 A1
20140067973 Eden Mar 2014 A1
20140074550 Chourey Mar 2014 A1
20140074645 Ingram Mar 2014 A1
20140075493 Krishnan et al. Mar 2014 A1
20140089027 Brown Mar 2014 A1
20140089039 Mcclellan Mar 2014 A1
20140108173 Cooper et al. Apr 2014 A1
20140108968 Vishria Apr 2014 A1
20140137257 Martinez et al. May 2014 A1
20140142988 Grosso et al. May 2014 A1
20140143011 Mudugu et al. May 2014 A1
20140143844 Goertzen May 2014 A1
20140164476 Thomson Jun 2014 A1
20140188956 Subba et al. Jul 2014 A1
20140196143 Fliderman et al. Jul 2014 A1
20140208418 Libin Jul 2014 A1
20140222468 Araya et al. Aug 2014 A1
20140244309 Francois Aug 2014 A1
20140244325 Cartwright Aug 2014 A1
20140244375 Kim Aug 2014 A1
20140244399 Orduna et al. Aug 2014 A1
20140257917 Spencer et al. Sep 2014 A1
20140258093 Gardiner et al. Sep 2014 A1
20140278539 Edwards Sep 2014 A1
20140278663 Samuel et al. Sep 2014 A1
20140278730 Muhart et al. Sep 2014 A1
20140278802 Macpherson Sep 2014 A1
20140283027 Orona et al. Sep 2014 A1
20140283106 Stahura et al. Sep 2014 A1
20140288971 Whibbs, Iii Sep 2014 A1
20140289681 Wielgosz Sep 2014 A1
20140289862 Gorfein et al. Sep 2014 A1
20140317171 Fox et al. Oct 2014 A1
20140324480 Dufel et al. Oct 2014 A1
20140337041 Madden et al. Nov 2014 A1
20140337466 Li et al. Nov 2014 A1
20140344015 Puértolas-Montañés et al. Nov 2014 A1
20150006514 Hung Jan 2015 A1
20150012363 Grant et al. Jan 2015 A1
20150019530 Felch Jan 2015 A1
20150026056 Calman et al. Jan 2015 A1
20150026260 Worthley Jan 2015 A1
20150033112 Norwood et al. Jan 2015 A1
20150066577 Christiansen et al. Mar 2015 A1
20150066865 Yara et al. Mar 2015 A1
20150088598 Acharyya et al. Mar 2015 A1
20150088635 Maycotte et al. Mar 2015 A1
20150106260 Andrews et al. Apr 2015 A1
20150106264 Johnson Apr 2015 A1
20150106867 Liang Apr 2015 A1
20150106948 Holman et al. Apr 2015 A1
20150106949 Holman et al. Apr 2015 A1
20150121462 Courage et al. Apr 2015 A1
20150143258 Carolan et al. May 2015 A1
20150149362 Baum et al. May 2015 A1
20150154520 Federgreen et al. Jun 2015 A1
20150169318 Nash Jun 2015 A1
20150172296 Fujioka Jun 2015 A1
20150178740 Borawski et al. Jun 2015 A1
20150199534 Francis et al. Jul 2015 A1
20150199541 Koch et al. Jul 2015 A1
20150199702 Singh Jul 2015 A1
20150229664 Hawthorn et al. Aug 2015 A1
20150235049 Cohen et al. Aug 2015 A1
20150235050 Wouhaybi et al. Aug 2015 A1
20150235283 Nishikawa Aug 2015 A1
20150242638 Bitran et al. Aug 2015 A1
20150242773 Major Aug 2015 A1
20150242778 Wilcox et al. Aug 2015 A1
20150242858 Smith et al. Aug 2015 A1
20150248391 Watanabe Sep 2015 A1
20150254597 Jahagirdar Sep 2015 A1
20150261887 Joukov Sep 2015 A1
20150262189 Vergeer Sep 2015 A1
20150264417 Spitz et al. Sep 2015 A1
20150269384 Holman et al. Sep 2015 A1
20150271167 Kalai Sep 2015 A1
20150288715 Hotchkiss Oct 2015 A1
20150309813 Patel Oct 2015 A1
20150310227 Ishida et al. Oct 2015 A1
20150310575 Shelton Oct 2015 A1
20150348200 Fair et al. Dec 2015 A1
20150356362 Demos Dec 2015 A1
20150379430 Dirac et al. Dec 2015 A1
20160006760 Lala et al. Jan 2016 A1
20160012465 Sharp Jan 2016 A1
20160026394 Goto Jan 2016 A1
20160034918 Bjelajac et al. Feb 2016 A1
20160048700 Stransky-Heilkron Feb 2016 A1
20160050213 Storr Feb 2016 A1
20160063523 Nistor et al. Mar 2016 A1
20160063567 Srivastava Mar 2016 A1
20160071112 Unser Mar 2016 A1
20160080405 Schler et al. Mar 2016 A1
20160099963 Mahaffey et al. Apr 2016 A1
20160103963 Mishra Apr 2016 A1
20160104259 Menrad Apr 2016 A1
20160125550 Joao et al. May 2016 A1
20160125749 Delacroix et al. May 2016 A1
20160125751 Barker et al. May 2016 A1
20160140466 Sidebottom et al. May 2016 A1
20160143570 Valacich et al. May 2016 A1
20160148143 Anderson et al. May 2016 A1
20160148259 Baek et al. May 2016 A1
20160162269 Pogorelik et al. Jun 2016 A1
20160164915 Cook Jun 2016 A1
20160180386 Konig Jun 2016 A1
20160188450 Appusamy et al. Jun 2016 A1
20160189156 Kim et al. Jun 2016 A1
20160196189 Miyagi et al. Jul 2016 A1
20160225000 Glasgow Aug 2016 A1
20160232465 Kurtz et al. Aug 2016 A1
20160232534 Lacey et al. Aug 2016 A1
20160234319 Griffin Aug 2016 A1
20160253497 Christodorescu et al. Sep 2016 A1
20160255139 Rathod Sep 2016 A1
20160261631 Vissamsetty et al. Sep 2016 A1
20160262163 Gonzalez Garrido et al. Sep 2016 A1
20160292453 Patterson et al. Oct 2016 A1
20160292621 Ciccone et al. Oct 2016 A1
20160321582 Broudou et al. Nov 2016 A1
20160321748 Mahatma et al. Nov 2016 A1
20160330237 Edlabadkar Nov 2016 A1
20160335531 Mullen et al. Nov 2016 A1
20160342811 Whitcomb et al. Nov 2016 A1
20160359861 Manov et al. Dec 2016 A1
20160364736 Maugans, III Dec 2016 A1
20160370954 Burningham et al. Dec 2016 A1
20160378762 Rohter Dec 2016 A1
20160381064 Chan et al. Dec 2016 A1
20160381560 Margaliot Dec 2016 A1
20170004055 Horan et al. Jan 2017 A1
20170032395 Kaufman et al. Feb 2017 A1
20170032408 Kumar et al. Feb 2017 A1
20170034101 Kumar et al. Feb 2017 A1
20170041324 Ionutescu et al. Feb 2017 A1
20170046399 Sankaranarasimhan et al. Feb 2017 A1
20170046753 Deupree, IV Feb 2017 A1
20170061501 Horwich Mar 2017 A1
20170068785 Experton et al. Mar 2017 A1
20170070495 Cherry et al. Mar 2017 A1
20170075513 Watson et al. Mar 2017 A1
20170093917 Chandra et al. Mar 2017 A1
20170115864 Thomas et al. Apr 2017 A1
20170124570 Nidamanuri et al. May 2017 A1
20170140174 Lacey et al. May 2017 A1
20170140467 Neag et al. May 2017 A1
20170142158 Laoutaris et al. May 2017 A1
20170142177 Hu May 2017 A1
20170154188 Meier et al. Jun 2017 A1
20170161520 Lockhart, III et al. Jun 2017 A1
20170171235 Mulchandani et al. Jun 2017 A1
20170171325 Perez Jun 2017 A1
20170177324 Frank et al. Jun 2017 A1
20170180378 Tyler et al. Jun 2017 A1
20170180505 Shaw et al. Jun 2017 A1
20170193017 Migliori Jul 2017 A1
20170193624 Tsai Jul 2017 A1
20170201518 Holmqvist et al. Jul 2017 A1
20170206707 Guay et al. Jul 2017 A1
20170208084 Steelman et al. Jul 2017 A1
20170213206 Shearer Jul 2017 A1
20170220685 Yan et al. Aug 2017 A1
20170220964 Datta Ray Aug 2017 A1
20170249394 Loeb et al. Aug 2017 A1
20170249710 Guillama et al. Aug 2017 A1
20170269791 Meyerzon et al. Sep 2017 A1
20170270318 Ritchie Sep 2017 A1
20170278004 Mcelhinney et al. Sep 2017 A1
20170278117 Wallace et al. Sep 2017 A1
20170286719 Krishnamurthy et al. Oct 2017 A1
20170287031 Barday Oct 2017 A1
20170289199 Barday Oct 2017 A1
20170308875 O'Regan et al. Oct 2017 A1
20170316400 Venkatakrishnan et al. Nov 2017 A1
20170330197 DiMaggio et al. Nov 2017 A1
20170353404 Hodge Dec 2017 A1
20180032757 Michael Feb 2018 A1
20180039975 Hefetz Feb 2018 A1
20180041498 Kikuchi Feb 2018 A1
20180046753 Shelton Feb 2018 A1
20180046939 Meron et al. Feb 2018 A1
20180063174 Grill et al. Mar 2018 A1
20180063190 Wright et al. Mar 2018 A1
20180082368 Weinflash et al. Mar 2018 A1
20180083843 Sambandam Mar 2018 A1
20180091476 Jakobsson et al. Mar 2018 A1
20180131574 Jacobs et al. May 2018 A1
20180131658 Bhagwan et al. May 2018 A1
20180165637 Romero et al. Jun 2018 A1
20180198614 Neumann Jul 2018 A1
20180204281 Painter et al. Jul 2018 A1
20180219917 Chiang Aug 2018 A1
20180239500 Allen et al. Aug 2018 A1
20180248914 Sartor Aug 2018 A1
20180285887 Maung Oct 2018 A1
20180301222 Dew, Sr. et al. Oct 2018 A1
20180307859 Lafever et al. Oct 2018 A1
20180336509 Guttmann Nov 2018 A1
20180343215 Ganapathi et al. Nov 2018 A1
20180349583 Turgeman et al. Dec 2018 A1
20180351888 Howard Dec 2018 A1
20180352003 Winn et al. Dec 2018 A1
20180357243 Yoon Dec 2018 A1
20180365720 Goldman et al. Dec 2018 A1
20180374030 Barday et al. Dec 2018 A1
20180375814 Hart Dec 2018 A1
20190005210 Wiederspohn et al. Jan 2019 A1
20190012211 Selvaraj Jan 2019 A1
20190012672 Francesco Jan 2019 A1
20190019184 Lacey et al. Jan 2019 A1
20190050547 Welsh et al. Feb 2019 A1
20190087570 Sloane Mar 2019 A1
20190096020 Barday et al. Mar 2019 A1
20190108353 Sadeh et al. Apr 2019 A1
20190130132 Barbas et al. May 2019 A1
20190132350 Smith et al. May 2019 A1
20190138496 Yamaguchi May 2019 A1
20190139087 Dabbs et al. May 2019 A1
20190148003 Van Hoe May 2019 A1
20190156053 Vogel et al. May 2019 A1
20190156058 Van Dyne et al. May 2019 A1
20190171801 Barday et al. Jun 2019 A1
20190179652 Hesener et al. Jun 2019 A1
20190180051 Barday et al. Jun 2019 A1
20190182294 Rieke et al. Jun 2019 A1
20190188402 Wang et al. Jun 2019 A1
20190266200 Francolla Aug 2019 A1
20190266201 Barday et al. Aug 2019 A1
20190266350 Barday et al. Aug 2019 A1
20190268343 Barday et al. Aug 2019 A1
20190268344 Barday et al. Aug 2019 A1
20190272492 Elledge et al. Sep 2019 A1
20190294818 Barday et al. Sep 2019 A1
20190332802 Barday et al. Oct 2019 A1
20190332807 Lafever et al. Oct 2019 A1
20190333118 Crimmins et al. Oct 2019 A1
20190354709 Brinskelle Nov 2019 A1
20190356684 Sinha et al. Nov 2019 A1
20190362169 Lin et al. Nov 2019 A1
20190362268 Fogarty et al. Nov 2019 A1
20190377901 Balzer et al. Dec 2019 A1
20190378073 Lopez et al. Dec 2019 A1
20190384934 Kim Dec 2019 A1
20190392162 Stern et al. Dec 2019 A1
20190392170 Barday et al. Dec 2019 A1
20190392171 Barday et al. Dec 2019 A1
20200004938 Brannon et al. Jan 2020 A1
20200020454 McGarvey et al. Jan 2020 A1
20200050966 Enuka et al. Feb 2020 A1
20200051117 Mitchell Feb 2020 A1
20200057781 Mccormick Feb 2020 A1
20200074471 Adjaoute Mar 2020 A1
20200081865 Farrar et al. Mar 2020 A1
20200082270 Gu et al. Mar 2020 A1
20200090197 Rodriguez et al. Mar 2020 A1
20200092179 Chieu et al. Mar 2020 A1
20200110589 Bequet et al. Apr 2020 A1
20200110904 Shinde et al. Apr 2020 A1
20200117737 Gopalakrishnan et al. Apr 2020 A1
20200137097 Zimmermann et al. Apr 2020 A1
20200143301 Bowers May 2020 A1
20200143797 Manoharan et al. May 2020 A1
20200159952 Dain et al. May 2020 A1
20200159955 Barlik et al. May 2020 A1
20200167653 Manjunath et al. May 2020 A1
20200175424 Kursun Jun 2020 A1
20200183655 Barday et al. Jun 2020 A1
20200186355 Davies Jun 2020 A1
20200193018 Van Dyke Jun 2020 A1
20200193022 Lunsford et al. Jun 2020 A1
20200210558 Barday et al. Jul 2020 A1
20200210620 Haletky Jul 2020 A1
20200211002 Steinberg Jul 2020 A1
20200220901 Barday et al. Jul 2020 A1
20200226156 Borra et al. Jul 2020 A1
20200226196 Brannon et al. Jul 2020 A1
20200242259 Chirravuri et al. Jul 2020 A1
20200242719 Lee Jul 2020 A1
20200250342 Miller et al. Aug 2020 A1
20200252413 Buzbee et al. Aug 2020 A1
20200252817 Brouillette et al. Aug 2020 A1
20200272764 Brannon et al. Aug 2020 A1
20200285755 Kassoumeh Sep 2020 A1
20200293679 Handy Bosma et al. Sep 2020 A1
20200296171 Mocanu et al. Sep 2020 A1
20200302089 Barday et al. Sep 2020 A1
20200310917 Tkachev et al. Oct 2020 A1
20200311310 Barday et al. Oct 2020 A1
20200344243 Brannon et al. Oct 2020 A1
20200356695 Brannon et al. Nov 2020 A1
20200364369 Brannon et al. Nov 2020 A1
20200372178 Barday et al. Nov 2020 A1
20200394327 Childress et al. Dec 2020 A1
20200401380 Jacobs et al. Dec 2020 A1
20200401962 Gottemukkala et al. Dec 2020 A1
20200410117 Barday et al. Dec 2020 A1
20200410131 Barday et al. Dec 2020 A1
20200410132 Brannon et al. Dec 2020 A1
20210012341 Garg et al. Jan 2021 A1
20210056569 Silberman et al. Feb 2021 A1
20210075775 Cheng et al. Mar 2021 A1
20210081567 Park et al. Mar 2021 A1
20210099449 Frederick et al. Apr 2021 A1
20210110047 Chunsheng Apr 2021 A1
20210125089 Nickl et al. Apr 2021 A1
20210152496 Kim et al. May 2021 A1
20210182940 Gupta et al. Jun 2021 A1
20210224402 Sher-Jan et al. Jul 2021 A1
20210233157 Crutchfield, Jr. Jul 2021 A1
20210243595 Buck et al. Aug 2021 A1
20210248247 Poothokaran et al. Aug 2021 A1
20210256163 Fleming et al. Aug 2021 A1
20210279360 Gimenez Palop et al. Sep 2021 A1
20210288995 Attar et al. Sep 2021 A1
20210297441 Olalere Sep 2021 A1
20210303828 Lafreniere et al. Sep 2021 A1
20210312061 Schroeder et al. Oct 2021 A1
20210326786 Sun et al. Oct 2021 A1
20210328969 Gaddam et al. Oct 2021 A1
20210382949 Yastrebenetsky et al. Dec 2021 A1
20210397735 Samatov et al. Dec 2021 A1
20210400018 Vettaikaran et al. Dec 2021 A1
20210406712 Bhide et al. Dec 2021 A1
20220137850 Boddu et al. May 2022 A1
20220171759 Jindal et al. Jun 2022 A1
20220217045 Blau et al. Jul 2022 A1
Foreign Referenced Citations (15)
Number Date Country
111496802 Aug 2020 CN
112115859 Dec 2020 CN
1394698 Mar 2004 EP
2031540 Mar 2009 EP
20130062500 Jun 2013 KR
2001033430 May 2001 WO
20020067158 Aug 2002 WO
20030050773 Jun 2003 WO
20080084111 Jan 2005 WO
2007002412 Jan 2007 WO
2008134203 Nov 2008 WO
2012174659 Dec 2012 WO
2015116905 Aug 2015 WO
2020146028 Jul 2020 WO
2022006421 Jan 2022 WO
Non-Patent Literature Citations (931)
Entry
Tuomas Aura et al., Scanning Electronic Documents for Personally Identifiable Information, ACM, Oct. 30, 2006, retrieved online on Jun. 13, 2019, pp. 41-49. Retrieved from the Internet: URL: http://delivery.acm.org/10.1145/1180000/1179608/p41-aura.pdf? (Year: 2006).
Van Eijk et al., “The Impact of User Location on Cookie Notices (Inside and Outside of the European Union,” IEEE Security & Privacy Workshop on Technology and Consumer Protection (CONPRO '19), Jan. 1, 2019 (Year: 2019).
Vukovic et al., “Managing Enterprise IT Systems Using Online Communities,” Jul. 9, 2011, IEEE, pp. 552-559. (Year: 2011).
Wang et al., “Revealing Key Non-Financial Factors for Online Credit-Scoring in E-Financing,” 2013, IEEE, pp. 1-6 (Year: 2013).
Wang et al., “Secure and Efficient Access to Outsourced Data,” ACM, pp. 55-65 (Year: 2009).
Weaver et al., “Understanding Information Preview in Mobile Email Processing”, ACM, pp. 303-312, 2011 (Year: 2011).
Wong et al., “Ontology Mapping for the Interoperability Problem in Network Management,” IEEE, pp. 2058-2068 (Year: 2005).
Wu et al., “Data Mining with Big Data,” IEEE, Jan. 2014, pp. 97-107, vol. 26, No. 1, (Year: 2014).
www.truste.com (1), 200150207, Internet Archive Wayback Machine, www.archive.org,2_7_2015.
Xu, et al., “GatorShare: A File System Framework for High-Throughput Data Management,” ACM, pp. 776-786 (Year: 2010).
Yang et al., “DAC-MACS: Effective Data Access Control for Multiauthority Cloud Storage Systems,” IEEE, pp. 1790-1801 (Year: 2013).
Yang et al., “Mining Web Access Sequence with Improved Apriori Algorithm,” IEEE, 2017, pp. 780-784 (Year: 2017).
Ye et al., “An Evolution-Based Cache Scheme for Scalable Mobile Data Access,” ACM, pp. 1-7 (Year: 2007).
Yin et al., “Multibank Memory Optimization for Parallel Data Access in Multiple Data Arrays”, ACM, pp. 1-8 (Year: 2016).
Yiu et al., “Outsourced Similarity Search on Metric Data Assets”, IEEE, pp. 338-352 (Year: 2012).
Yu, “Using Data from Social Media Websites to Inspire the Design of Assistive Technology”, ACM, pp. 1-2 (Year: 2016).
Yu, et al., “Performance and Fairness Issues in Big Data Transfers,” ACM, pp. 9-11 (Year: 2014).
Yue et al., “An Automatic HTTP Cookie Management System,” Computer Networks, Elsevier, Amsterdam, NL, vol. 54, No. 13, Sep. 15, 2010, pp. 2182-2198 (Year: 2010).
Zannone, et al., “Maintaining Privacy on Derived Objects,” ACM, pp. 10-19 (Year: 2005).
Zeldovich, Nickolai, et al., Making Information Flow Explicit in HiStar, OSDI '06: 7th USENIX Symposium on Operating Systems Design and Implementation, USENIX Association, p. 263-278.
Zhang et al., “Data Transfer Performance Issues for a Web Services Interface to Synchrotron Experiments”, ACM, pp. 59-65 (Year: 2007).
Zhang et al., “Dynamic Topic Modeling for Monitoring Market Competition from Online Text and Image Data”, ACM, pp. 1425-1434 (Year: 2015).
Zheng, et al., “Methodologies for Cross-Domain Data Fusion: An Overview,” IEEE, pp. 16-34 (Year: 2015).
Zheng, et al., “Toward Assured Data Deletion in Cloud Storage,” IEEE, vol. 34, No. 3, pp. 101-107 May/Jun. 2020 (Year: 2020).
Zhu, et al., “Dynamic Data Integration Using Web Services,” IEEE, pp. 1-8 (Year: 2004).
Final Office Action, dated Oct. 26, 2021, from corresponding U.S. Appl. No. 17/306,496.
Final Office Action, dated Oct. 27, 2022, from corresponding U.S. Appl. No. 17/346,586.
Final Office Action, dated Oct. 28, 2021, from corresponding U.S. Appl. No. 17/234,205.
Final Office Action, dated Oct. 29, 2021, from corresponding U.S. Appl. No. 17/020,275.
Final Office Action, dated Sep. 17, 2021, from corresponding U.S. Appl. No. 17/200,698.
Final Office Action, dated Sep. 19, 2022, from corresponding U.S. Appl. No. 17/306,496.
Final Office Action, dated Sep. 21, 2020, from corresponding U.S. Appl. No. 16/808,493.
Final Office Action, dated Sep. 21, 2020, from corresponding U.S. Appl. No. 16/862,944.
Final Office Action, dated Sep. 22, 2020, from corresponding U.S. Appl. No. 16/808,497.
Final Office Action, dated Sep. 23, 2020, from corresponding U.S. Appl. No. 16/862,948.
Final Office Action, dated Sep. 24, 2020, from corresponding U.S. Appl. No. 16/862,952.
Final Office Action, dated Sep. 25, 2019, from corresponding U.S. Appl. No. 16/278,119.
Final Office Action, dated Sep. 28, 2020, from corresponding U.S. Appl. No. 16/565,395.
Final Office Action, dated Sep. 8, 2020, from corresponding U.S. Appl. No. 16/410,866.
Office Action, dated Apr. 1, 2021, from corresponding U.S. Appl. No. 17/119,080.
Office Action, dated Apr. 12, 2022, from corresponding U.S. Appl. No. 17/670,341.
Office Action, dated Apr. 15, 2021, from corresponding U.S. Appl. No. 17/161,159.
Office Action, dated Apr. 18, 2018, from corresponding U.S. Appl. No. 15/894,819.
Office Action, dated Apr. 18, 2022, from corresponding U.S. Appl. No. 17/670,349.
Office Action, dated Apr. 2, 2021, from corresponding U.S. Appl. No. 17/151,334.
Office Action, dated Apr. 20, 2020, from corresponding U.S. Appl. No. 16/812,795.
Office Action, dated Apr. 22, 2019, from corresponding U.S. Appl. No. 16/241,710.
Office Action, dated Apr. 22, 2020, from corresponding U.S. Appl. No. 16/811,793.
Office Action, dated Apr. 25, 2022, from corresponding U.S. Appl. No. 17/588,645.
Office Action, dated Apr. 26, 2022, from corresponding U.S. Appl. No. 17/151,334.
Office Action, dated Apr. 28, 2020, from corresponding U.S. Appl. No. 16/798,818.
Office Action, dated Apr. 28, 2020, from corresponding U.S. Appl. No. 16/808,500.
Office Action, dated Apr. 28, 2021, from corresponding U.S. Appl. No. 16/808,497.
Office Action, dated Apr. 29, 2020, from corresponding U.S. Appl. No. 16/791,337.
Office Action, dated Apr. 5, 2019, from corresponding U.S. Appl. No. 16/278,119.
Office Action, dated Apr. 7, 2020, from corresponding U.S. Appl. No. 16/788,633.
Office Action, dated Apr. 7, 2020, from corresponding U.S. Appl. No. 16/791,589.
Office Action, dated Apr. 8, 2022, from corresponding U.S. Appl. No. 16/938,509.
Office Action, dated Aug. 12, 2022, from corresponding U.S. Appl. No. 17/679,734.
Office Action, dated Aug. 13, 2019, from corresponding U.S. Appl. No. 16/505,430.
Office Action, dated Aug. 13, 2019, from corresponding U.S. Appl. No. 16/512,033.
Office Action, dated Aug. 15, 2019, from corresponding U.S. Appl. No. 16/505,461.
Office Action, dated Aug. 17, 2022, from corresponding U.S. Appl. No. 17/373,444.
Office Action, dated Aug. 17, 2022, from corresponding U.S. Appl. No. 17/836,430.
Office Action, dated Aug. 18, 2021, from corresponding U.S. Appl. No. 17/222,725.
Office Action, dated Aug. 19, 2019, from corresponding U.S. Appl. No. 16/278,122.
Office Action, dated Aug. 19, 2022, from corresponding U.S. Appl. No. 17/584,187.
Office Action, dated Aug. 2, 2022, from corresponding U.S. Appl. No. 17/670,354.
Office Action, dated Aug. 20, 2020, from corresponding U.S. Appl. No. 16/817,136.
Office Action, dated Aug. 23, 2017, from corresponding U.S. Appl. No. 15/626,052.
Office Action, dated Aug. 24, 2017, from corresponding U.S. Appl. No. 15/169,643.
Office Action, dated Aug. 24, 2017, from corresponding U.S. Appl. No. 15/619,451.
Office Action, dated Aug. 24, 2020, from corresponding U.S. Appl. No. 16/595,327.
Office Action, dated Aug. 27, 2019, from corresponding U.S. Appl. No. 16/410,296.
Office Action, dated Aug. 27, 2021, from corresponding U.S. Appl. No. 17/187,329.
Office Action, dated Aug. 27, 2021, from corresponding U.S. Appl. No. 17/334,948.
Office Action, dated Aug. 29, 2017, from corresponding U.S. Appl. No. 15/619,237.
Office Action, dated Aug. 30, 2017, from corresponding U.S. Appl. No. 15/619,212.
Office Action, dated Aug. 30, 2017, from corresponding U.S. Appl. No. 15/619,382.
Office Action, dated Aug. 30, 2021, from corresponding U.S. Appl. No. 16/938,520.
Office Action, dated Aug. 4, 2022, from corresponding U.S. Appl. No. 17/828,953.
Office Action, dated Aug. 6, 2019, from corresponding U.S. Appl. No. 16/404,491.
Office Action, dated Aug. 6, 2020, from corresponding U.S. Appl. No. 16/862,956.
Office Action, dated Dec. 11, 2019, from corresponding U.S. Appl. No. 16/578,712.
Office Action, dated Dec. 13, 2021, from corresponding U.S. Appl. No. 17/476,209.
Office Action, dated Dec. 14, 2018, from corresponding U.S. Appl. No. 16/104,393.
Office Action, dated Dec. 15, 2016, from corresponding U.S. Appl. No. 15/256,419.
Office Action, dated Dec. 16, 2019, from corresponding U.S. Appl. No. 16/563,754.
Office Action, dated Dec. 16, 2019, from corresponding U.S. Appl. No. 16/565,265.
Office Action, dated Dec. 16, 2020, from corresponding U.S. Appl. No. 17/020,275.
Office Action, dated Dec. 17, 2021, from corresponding U.S. Appl. No. 17/395,759.
Office Action, dated Dec. 17, 2021, from corresponding U.S. Appl. No. 17/499,582.
Office Action, dated Dec. 18, 2020, from corresponding U.S. Appl. No. 17/030,714.
Office Action, dated Dec. 19, 2019, from corresponding U.S. Appl. No. 16/410,866.
Office Action, dated Dec. 2, 2019, from corresponding U.S. Appl. No. 16/560,963.
Office Action, dated Dec. 2, 2021, from corresponding U.S. Appl. No. 17/504,102.
Office Action, dated Dec. 23, 2019, from corresponding U.S. Appl. No. 16/593,639.
Office Action, dated Dec. 24, 2020, from corresponding U.S. Appl. No. 17/068,454.
Office Action, dated Dec. 27, 2021, from corresponding U.S. Appl. No. 17/493,332.
Office Action, dated Dec. 29, 2021, from corresponding U.S. Appl. No. 17/479,807.
Office Action, dated Dec. 3, 2018, from corresponding U.S. Appl. No. 16/055,998.
Office Action, dated Dec. 30, 2021, from corresponding U.S. Appl. No. 17/149,421.
Office Action, dated Dec. 31, 2018, from corresponding U.S. Appl. No. 16/160,577.
Office Action, dated Dec. 7, 2021, from corresponding U.S. Appl. No. 17/499,609.
Office Action, dated Dec. 8, 2020, from corresponding U.S. Appl. No. 17/013,758.
Office Action, dated Dec. 8, 2020, from corresponding U.S. Appl. No. 17/068,198.
Office Action, dated Feb. 10, 2021, from corresponding U.S. Appl. No. 16/862,944.
Office Action, dated Feb. 10, 2021, from corresponding U.S. Appl. No. 17/106,469.
Office Action, dated Feb. 15, 2019, from corresponding U.S. Appl. No. 16/220,899.
Office Action, dated Feb. 16, 2022, from corresponding U.S. Appl. No. 16/872,031.
Office Action, dated Feb. 17, 2021, from corresponding U.S. Appl. No. 16/862,948.
Office Action, dated Feb. 18, 2021, from corresponding U.S. Appl. No. 16/862,952.
Office Action, dated Feb. 2, 2021, from corresponding U.S. Appl. No. 17/101,915.
Office Action, dated Feb. 26, 2019, from corresponding U.S. Appl. No. 16/228,250.
Office Action, dated Feb. 3, 2021, from corresponding U.S. Appl. No. 17/013,757.
Office Action, dated Feb. 5, 2020, from corresponding U.S. Appl. No. 16/586,202.
Office Action, dated Feb. 6, 2020, from corresponding U.S. Appl. No. 16/707,762.
Office Action, dated Feb. 8, 2021, from corresponding U.S. Appl. No. 17/139,650.
Office Action, dated Feb. 9, 2021, from corresponding U.S. Appl. No. 16/808,493.
Office Action, dated Feb. 9, 2022, from corresponding U.S. Appl. No. 17/543,546.
Office Action, dated Jan. 14, 2022, from corresponding U.S. Appl. No. 17/499,595.
Office Action, dated Jan. 18, 2019, from corresponding U.S. Appl. No. 16/055,984.
Office Action, dated Jan. 21, 2022, from corresponding U.S. Appl. No. 17/499,624.
Office Action, dated Jan. 22, 2021, from corresponding U.S. Appl. No. 17/099,270.
Office Action, dated Jan. 24, 2020, from corresponding U.S. Appl. No. 16/505,426.
Office Action, dated Jan. 24, 2020, from corresponding U.S. Appl. No. 16/700,049.
Office Action, dated Jan. 25, 2022, from corresponding U.S. Appl. No. 17/494,220.
Office Action, dated Jan. 27, 2020, from corresponding U.S. Appl. No. 16/656,895.
Office Action, dated Jan. 28, 2020, from corresponding U.S. Appl. No. 16/712,104.
Office Action, dated Jan. 29, 2021, from corresponding U.S. Appl. No. 17/101,106.
Office Action, dated Jan. 31, 2022, from corresponding U.S. Appl. No. 17/493,290.
Office Action, dated Jan. 4, 2019, from corresponding U.S. Appl. No. 16/159,566.
Office Action, dated Jan. 4, 2019, from corresponding U.S. Appl. No. 16/159,628.
Office Action, dated Jan. 4, 2021, from corresponding U.S. Appl. No. 17/013,756.
Office Action, dated Jan. 4, 2022, from corresponding U.S. Appl. No. 17/480,377.
Office Action, dated Jan. 7, 2020, from corresponding U.S. Appl. No. 16/572,182.
Office Action, dated Jan. 7, 2022, from corresponding U.S. Appl. No. 17/387,421.
Office Action, dated Jul. 13, 2021, from corresponding U.S. Appl. No. 17/306,496.
Office Action, dated Jul. 15, 2021, from corresponding U.S. Appl. No. 17/020,275.
Office Action, dated Jul. 18, 2019, from corresponding U.S. Appl. No. 16/410,762.
Office Action, dated Jul. 19, 2021, from corresponding U.S. Appl. No. 17/316,179.
Office Action, dated Jul. 21, 2017, from corresponding U.S. Appl. No. 15/256,430.
Office Action, dated Jul. 21, 2021, from corresponding U.S. Appl. No. 16/901,654.
Office Action, dated Jul. 23, 2019, from corresponding U.S. Appl. No. 16/436,616.
Office Action, dated Jul. 24, 2020, from corresponding U.S. Appl. No. 16/404,491.
Office Action, dated Jul. 27, 2020, from corresponding U.S. Appl. No. 16/595,342.
Office Action, dated Jul. 27, 2022, from corresponding U.S. Appl. No. 17/831,713.
Office Action, dated Jul. 28, 2022, from corresponding U.S. Appl. No. 16/925,550.
Office Action, dated Jul. 7, 2022, from corresponding U.S. Appl. No. 17/370,650.
Office Action, dated Jun. 1, 2020, from corresponding U.S. Appl. No. 16/862,952.
Office Action, dated Jun. 1, 2022, from corresponding U.S. Appl. No. 17/306,496.
Office Action, dated Jun. 14, 2022, from corresponding U.S. Appl. No. 17/346,586.
Office Action, dated Jun. 16, 2022, from corresponding U.S. Appl. No. 17/689,683.
Office Action, dated Jun. 24, 2019, from corresponding U.S. Appl. No. 16/410,336.
Office Action, dated Jun. 24, 2021, from corresponding U.S. Appl. No. 17/234,205.
Office Action, dated Jun. 27, 2019, from corresponding U.S. Appl. No. 16/404,405.
Office Action, dated Jun. 7, 2021, from corresponding U.S. Appl. No. 17/200,698.
Office Action, dated Jun. 9, 2021, from corresponding U.S. Appl. No. 17/222,523.
Office Action, dated Mar. 1, 2022, from corresponding U.S. Appl. No. 17/119,080.
Office Action, dated Mar. 11, 2019, from corresponding U.S. Appl. No. 16/220,978.
Office Action, dated Mar. 12, 2019, from corresponding U.S. Appl. No. 16/221,153.
Office Action, dated Mar. 15, 2021, from corresponding U.S. Appl. No. 17/149,421.
Office Action, dated Mar. 16, 2020, from corresponding U.S. Appl. No. 16/719,488.
Office Action, dated Mar. 17, 2020, from corresponding U.S. Appl. No. 16/565,395.
Office Action, dated Mar. 17, 2020, from corresponding U.S. Appl. No. 16/719,071.
Office Action, dated Mar. 2, 2022, from corresponding U.S. Appl. No. 17/020,275.
Office Action, dated Mar. 2, 2022, from corresponding U.S. Appl. No. 17/161,159.
Office Action, dated Mar. 2, 2022, from corresponding U.S. Appl. No. 17/200,698.
Office Action, dated Mar. 20, 2020, from corresponding U.S. Appl. No. 16/778,709.
Office Action, dated Mar. 21, 2022, from corresponding U.S. Appl. No. 17/571,871.
Office Action, dated Mar. 22, 2022, from corresponding U.S. Appl. No. 17/187,329.
Office Action, dated Mar. 23, 2020, from corresponding U.S. Appl. No. 16/671,444.
Office Action, dated Mar. 25, 2019, from corresponding U.S. Appl. No. 16/278,121.
Office Action, dated Mar. 25, 2020, from corresponding U.S. Appl. No. 16/701,043.
Office Action, dated Mar. 25, 2020, from corresponding U.S. Appl. No. 16/791,006.
Hodge, et al., “Managing Virtual Data Marts with Metapointer Tables,” pp. 1-7 (Year: 2002).
Horrall et al., “Evaluating Risk: IBM's Country Financial Risk and Treasury Risk Scorecards,” Jul. 21, 2014, IBM, vol. 58, issue 4, pp. 2:1-2:9 (Year: 2014).
Hu, et al., “Attribute Considerations for Access Control Systems,” NIST Special Publication 800-205, Jun. 2019, pp. 1-42 (Year: 2019).
Hu, et al., “Guide to Attribute Based Access Control (ABAC) Definition and Considerations (Draft),” NIST Special Publication 800-162, pp. 1-54 (Year: 2013).
Huang, et al., “A Study on Information Security Management with Personal Data Protection,” IEEE, Dec. 9, 2011, pp. 624-630 (Year: 2011).
Huettner, “Digital Risk Management: Protecting Your Privacy, Improving Security, and Preparing for Emergencies,” EEE, pp. 136-138 (Year: 2006).
Huner et al., “Towards a Maturity Model for Corporate Data Quality Management”, ACM, pp. 231-238, 2009 (Year: 2009).
Hunton & Williams LLP, The Role of Risk Management in Data Protection, Privacy Risk Framework and the Risk-based Approach to Privacy, Centre for Information Policy Leadership, Workshop II, Nov. 23, 2014.
Huo et al., “A Cloud Storage Architecture Model for Data-Intensive Applications,” IEEE, pp. 1-4 (Year: 2011).
Imran et al., “Searching in Cloud Object Storage by Using a Metadata Model”, IEEE, 2014, retrieved online on Apr. 1, 2020, pp. 121-128. Retrieved from the Internet: URL: https://ieeeexplore.ieee.org/stamp/stamp.jsp? (Year: 2014).
Iordanou et al., “Tracing Cross Border Web Tracking,” Oct. 31, 2018, pp. 329-342, ACM (Year: 2018).
Islam, et al., “Mixture Model Based Label Association Techniques for Web Accessibility,” ACM, pp. 67-76 (Year: (2010).
Jayasinghe et al., “Matching Facial Images Using Age Related Morphing Changes,” ISSRI, 2009, pp. 2901-2907 (Year: 2009).
Jensen, et al., “Temporal Data Management,” IEEE Transactions on Knowledge and Data Engineering, vol. 11, No. 1, Jan./Feb. 1999, pp. 36-44 (Year: 1999).
Jiahao Chen et al. “Fairness Under Unawareness: Assessing Disparity when Protected Class is Unobserved,” arxiv.org, Cornell University Library, 201 Olin Library Cornell University, Ithaca, NY 14853, Nov. 27, 2018 (Nov. 27, 2018), Section 2, Figure 2. (Year 2018).
Joel Reardon et al., Secure Data Deletion from Persistent Media, ACM, Nov. 4, 2013, retrieved online on Jun. 13, 2019, pp. 271-283. Retrieved from the Internet: URL: http://delivery.acm.org/10.1145/2520000/2516699/p271-reardon.pdf? (Year: 2013).
Jones et al., “AI and the Ethics of Automating Consent,” IEEE, pp. 64-72, May 2018 (Year: 2018).
Joonbakhsh et al., “Mining and Extraction of Personal Software Process measures through IDE Interaction logs,” ACM/IEEE, 2018, retrieved online on Dec. 2, 2019, pp. 78-81. Retrieved from the Internet: URL: http://delivery.acm.org/10.1145/3200000/3196462/p78-joonbakhsh.pdf? (Year: 2018).
Jun et al., “Scalable Multi-Access Flash Store for Big Data Analytics,” ACM, pp. 55-64 (Year: 2014).
Khan et al., “Wrinkles Energy Based Age Estimation Using Discrete Cosine Transform,” IEEE, 2015, pp. 1-4 (Year: (2015).
Kirkham, et al., “A Personal Data Store for an Internet of Subjects,” IEEE, pp. 92-97 (Year: 2011).
Korba, Larry et al.; “Private Data Discovery for Privacy Compliance in Collaborative Environments”; Cooperative Design, Visualization, and Engineering; Springer Berlin Heidelberg; Sep. 21, 2008; pp. 142-150.
Kristian et al., “Human Facial Age Classification Using Active Shape Module, Geometrical Feature, and Support Vendor Machine on Early Growth Stage,” ISICO, 2015, pp. 1-8 (Year: 2015).
Krol, Kat, et al., Control versus Effort in Privacy Warnings for Webforms, ACM, Oct. 24, 2016, pp. 13-23.
Lamb et al., “Role-Based Access Control for Data Service Integration”, ACM, pp. 3-11 (Year: 2006).
Lasierra et al., “Data Management in Home Scenarios Using an Autonomic Ontology-Based Approach,” IEEE, pp. 94-99 (Year: 2012).
Leadbetter, et al., “Where Big Data Meets Linked Data: Applying Standard Data Models to Environmental Data Streams,” IEEE, pp. 2929-2937 (Year: 2016).
Lenzerini et al., “Ontology-based Data Management,” ACM, pp. 5-6 (Year: 2011).
Lewis, James et al., “Microservices,” Mar. 25, 2014 (Mar. 25, 2014),XP055907494, Retrieved from the Internet: https://martinfowler.com/articles/micr oservices.html. [retrieved on Mar. 31, 2022].
Li, Ninghui, et al., t-Closeness: Privacy Beyond k-Anonymity and I-Diversity, IEEE, 2014, p. 106-115.
Liu et al., “A Novel Approach for Detecting Browser-based Silent Miner,” IEEE, pp. 490-497 (Year: 2018).
Liu et al., “Cross-Geography Scientific Data Transferring Trends and Behavior,” ACM, pp. 267-278 (Year: 2018).
Liu et al., “Overview on Ontology Mapping and Approach,” IEEE, pp. 592-595 (Year: 2011).
Liu, Kun, et al., A Framework for Computing the Privacy Scores of Users in Online Social Networks, ACM Transactions on Knowledge Discovery from Data, vol. 5, No. 1, Article 6, Dec. 2010, 30 pages.
Lu et al., “An HTTP Flooding Detection Method Based on Browser Behavior,” IEEE, pp. 1151-1154 (Year: 2006).
Lu, “How Machine Learning Mitigates Racial Bias in the US Housing Market,” Available as SSRN 3489519, pp. 1-73, Nov. 2019 (Year: 2019).
Luu, et al., “Combined Local and Holistic Facial Features for Age-Determination,” 2010 11th Int. Conf. Control, Automation, Robotics and Vision, Singapore, Dec. 7, 2010, IEEE, pp. 900-904 (Year: 2010).
Maret et al., “Multimedia Information Interchange: Web Forms Meet Data Servers”, IEEE, pp. 499-505 (Year: 1999).
Martin, et al., “Hidden Surveillance by Web Sites: Web Bugs in Contemporary Use,” Communications of the ACM, vol. 46, No. 12, Dec. 2003, pp. 258-264. Internet source https://doi.org/10.1145/953460.953509. (Year: 2003).
Matte et al., “Do Cookie Banners Respect my Choice ?: Measuring Legal Compliance of Banners from IAB Europe's Transparency and Consent Framework,” 2020 IEEE Symposium on Security and Privacy (SP), 2020, pp. 791-809 (Year: 2020).
McGarth et al., “Digital Library Technology for Locating and Accessing Scientific Data”, ACM, pp. 188-194 (Year: 1999).
Mesbah et al., “Crawling Ajax-Based Web Applications Through Dynamic Analysis of User Interface State Changes,” ACM Transactions on the Web (TWEB) vol. 6, No. 1, Article 3, Mar. 2012, pp. 1-30 (Year: 2012).
Milic et al., “Comparative Analysis of Metadata Models on e-Government Open Data Platforms,” IEEE, pp. 119-130 (Year: 2021).
Moscoso-Zea et al., “Datawarehouse Design for Educational Data Mining,” IEEE, pp. 1-6 (Year: 2016).
Mudepalli et al., “An efficient data retrieval approach using blowfish encryption on cloud CipherText Retrieval in Cloud Computing” IEEE, pp. 267-271 (Year: 2017).
Mundada et al., “Half-Baked Cookies: Hardening Cookie-Based Authentication for the Modern Web,” Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, 2016, pp. 675-685 (Year: 2016).
Nemec et al., “Assessment of Query Execution Performance Using Selected Business Intelligence Tools and Experimental Agile Oriented Data Modeling Approach,” Sep. 16, 2015, IEEE, pp. 1327-1333. (Year: 2015).
Newman et al., “High Speed Scientific Data Transfers using Software Defined Networking,” ACM, pp. 1-9 (Year: 2015).
Newman, “Email Archive Overviews using Subject Indexes”, ACM, pp. 652-653, 2002 (Year: 2002).
Nishikawa, Taiji, English Translation of JP 2019154505, Aug. 27, 2019 (Year: 2019).
Advisory Action, dated Jan. 13, 2021, from corresponding U.S. Appl. No. 16/808,493.
Advisory Action, dated Jan. 13, 2021, from corresponding U.S. Appl. No. 16/862,944.
Advisory Action, dated Jan. 13, 2021, from corresponding U.S. Appl. No. 16/862,948.
Advisory Action, dated Jan. 13, 2021, from corresponding U.S. Appl. No. 16/862,952.
Advisory Action, dated Jan. 6, 2021, from corresponding U.S. Appl. No. 16/808,497.
Advisory Action, dated Jun. 19, 2020, from corresponding U.S. Appl. No. 16/595,342.
Advisory Action, dated Jun. 2, 2020, from corresponding U.S. Appl. No. 16/404,491.
Advisory Action, dated May 21, 2020, from corresponding U.S. Appl. No. 16/557,392.
Final Office Action, dated Apr. 1, 2022, from corresponding U.S. Appl. No. 17/370,650.
Final Office Action, dated Apr. 23, 2020, from corresponding U.S. Appl. No. 16/572,347.
Final Office Action, dated Apr. 25, 2022, from corresponding U.S. Appl. No. 17/149,421.
Final Office Action, dated Apr. 27, 2021, from corresponding U.S. Appl. No. 17/068,454.
Final Office Action, dated Apr. 28, 2022, from corresponding U.S. Appl. No. 16/925,550.
Final Office Action, dated Apr. 5, 2022, from corresponding U.S. Appl. No. 17/013,756.
Final Office Action, dated Apr. 7, 2020, from corresponding U.S. Appl. No. 16/595,327.
Final Office Action, dated Aug. 10, 2020, from corresponding U.S. Appl. No. 16/791,589.
Final Office Action, dated Aug. 27, 2021, from corresponding U.S. Appl. No. 17/161,159.
Final Office Action, dated Aug. 28, 2020, from corresponding U.S. Appl. No. 16/410,336.
Final Office Action, dated Aug. 5, 2020, from corresponding U.S. Appl. No. 16/719,071.
Final Office Action, dated Aug. 9, 2021, from corresponding U.S. Appl. No. 17/119,080.
Final Office Action, dated Dec. 10, 2021, from corresponding U.S. Appl. No. 17/187,329.
Final Office Action, dated Dec. 7, 2020, from corresponding U.S. Appl. No. 16/862,956.
Final Office Action, dated Dec. 9, 2019, from corresponding U.S. Appl. No. 16/410,336.
Final Office Action, dated Feb. 19, 2020, from corresponding U.S. Appl. No. 16/404,491.
Final Office Action, dated Feb. 25, 2022, from corresponding U.S. Appl. No. 17/346,586.
Final Office Action, dated Feb. 3, 2020, from corresponding U.S. Appl. No. 16/557,392.
Final Office Action, dated Feb. 8, 2021, from corresponding U.S. Appl. No. 16/927,658.
Final Office Action, dated Jan. 17, 2018, from corresponding U.S. Appl. No. 15/619,278.
Final Office Action, dated Jan. 21, 2020, from corresponding U.S. Appl. No. 16/410,762.
Final Office Action, dated Jan. 23, 2018, from corresponding U.S. Appl. No. 15/619,479.
Final Office Action, dated Jan. 23, 2020, from corresponding U.S. Appl. No. 16/505,430.
Final Office Action, dated Jul. 1, 2022, from corresponding U.S. Appl. No. 17/187,329.
Final Office Action, dated Jul. 21, 2021, from corresponding U.S. Appl. No. 17/151,334.
Final Office Action, dated Jul. 6, 2022, from corresponding U.S. Appl. No. 17/200,698.
Final Office Action, dated Jul. 7, 2021, from corresponding U.S. Appl. No. 17/149,421.
Final Office Action, dated Jun. 10, 2022, from corresponding U.S. Appl. No. 17/161,159.
Final Office Action, dated Jun. 29, 2022, from corresponding U.S. Appl. No. 17/020,275.
Final Office Action, dated Jun. 9, 2022, from corresponding U.S. Appl. No. 17/494,220.
Final Office Action, dated Mar. 21, 2022, from corresponding U.S. Appl. No. 17/373,444.
Final Office Action, dated Mar. 22, 2022, from corresponding U.S. Appl. No. 17/380,485.
Final Office Action, dated Mar. 26, 2021, from corresponding U.S. Appl. No. 17/020,275.
Final Office Action, dated Mar. 5, 2019, from corresponding U.S. Appl. No. 16/055,961.
Final Office Action, dated Mar. 6, 2020, from corresponding U.S. Appl. No. 16/595,342.
Final Office Action, dated May 12, 2022, from corresponding U.S. Appl. No. 17/499,624.
Final Office Action, dated May 14, 2021, from corresponding U.S. Appl. No. 17/013,756.
Final Office Action, dated May 16, 2022, from corresponding U.S. Appl. No. 17/480,377.
Final Office Action, dated May 2, 2022, from corresponding U.S. Appl. No. 17/499,595.
Final Office Action, dated May 24, 2022, from corresponding U.S. Appl. No. 17/499,582.
Final Office Action, dated Nov. 29, 2017, from corresponding U.S. Appl. No. 15/619,237.
Final Office Action, dated Nov. 8, 2022, from corresponding U.S. Appl. No. 17/151,334.
Restriction Requirement, dated Sep. 15, 2020, from corresponding U.S. Appl. No. 16/925,628.
Restriction Requirement, dated Sep. 9, 2019, from corresponding U.S. Appl. No. 16/505,426.
Notice of Allowance, dated Apr. 12, 2017, from corresponding U.S. Appl. No. 15/256,419.
Notice of Allowance, dated Apr. 12, 2022, from corresponding U.S. Appl. No. 17/479,807.
Notice of Allowance, dated Apr. 14, 2022, from corresponding U.S. Appl. No. 17/572,276.
Notice of Allowance, dated Apr. 17, 2020, from corresponding U.S. Appl. No. 16/593,639.
Notice of Allowance, dated Apr. 19, 2021, from corresponding U.S. Appl. No. 17/164,029.
Notice of Allowance, dated Apr. 2, 2019, from corresponding U.S. Appl. No. 16/160,577.
Notice of Allowance, dated Apr. 2, 2021, from corresponding U.S. Appl. No. 17/162,006.
Notice of Allowance, dated Apr. 20, 2022, from corresponding U.S. Appl. No. 17/573,808.
Notice of Allowance, dated Apr. 22, 2021, from corresponding U.S. Appl. No. 17/163,701.
Notice of Allowance, dated Apr. 25, 2018, from corresponding U.S. Appl. No. 15/883,041.
Notice of Allowance, dated Apr. 27, 2022, from corresponding U.S. Appl. No. 17/573,999.
Notice of Allowance, dated Apr. 28, 2021, from corresponding U.S. Appl. No. 17/135,445.
Notice of Allowance, dated Apr. 28, 2021, from corresponding U.S. Appl. No. 17/181,828.
Notice of Allowance, dated Apr. 28, 2022, from corresponding U.S. Appl. No. 17/592,922.
Notice of Allowance, dated Apr. 28, 2022, from corresponding U.S. Appl. No. 17/670,352.
Notice of Allowance, dated Apr. 29, 2020, from corresponding U.S. Appl. No. 16/700,049.
Notice of Allowance, dated Apr. 29, 2022, from corresponding U.S. Appl. No. 17/387,421.
Notice of Allowance, dated Apr. 30, 2020, from corresponding U.S. Appl. No. 16/565,265.
Notice of Allowance, dated Apr. 30, 2020, from corresponding U.S. Appl. No. 16/820,346.
Notice of Allowance, dated Apr. 30, 2021, from corresponding U.S. Appl. No. 16/410,762.
Notice of Allowance, dated Apr. 4, 2022, from corresponding U.S. Appl. No. 17/493,332.
Notice of Allowance, dated Apr. 4, 2022, from corresponding U.S. Appl. No. 17/572,298.
Notice of Allowance, dated Apr. 8, 2019, from corresponding U.S. Appl. No. 16/228,250.
Notice of Allowance, dated Apr. 8, 2020, from corresponding U.S. Appl. No. 16/791,348.
Notice of Allowance, dated Apr. 9, 2020, from corresponding U.S. Appl. No. 16/791,075.
Notice of Allowance, dated Aug. 10, 2020, from corresponding U.S. Appl. No. 16/671,444.
Notice of Allowance, dated Aug. 10, 2020, from corresponding U.S. Appl. No. 16/788,633.
Notice of Allowance, dated Aug. 12, 2020, from corresponding U.S. Appl. No. 16/719,488.
Notice of Allowance, dated Aug. 12, 2021, from corresponding U.S. Appl. No. 16/881,832.
Notice of Allowance, dated Aug. 14, 2018, from corresponding U.S. Appl. No. 15/989,416.
Notice of Allowance, dated Aug. 18, 2017, from corresponding U.S. Appl. No. 15/619,455.
Notice of Allowance, dated Aug. 20, 2019, from corresponding U.S. Appl. No. 16/241,710.
Notice of Allowance, dated Aug. 22, 2022, from corresponding U.S. Appl. No. 17/499,595.
Notice of Allowance, dated Aug. 24, 2018, from corresponding U.S. Appl. No. 15/619,479.
Notice of Allowance, dated Aug. 26, 2019, from corresponding U.S. Appl. No. 16/443,374.
Notice of Allowance, dated Aug. 26, 2020, from corresponding U.S. Appl. No. 16/808,503.
Notice of Allowance, dated Aug. 28, 2019, from corresponding U.S. Appl. No. 16/278,120.
Notice of Allowance, dated Aug. 3, 2022, from corresponding U.S. Appl. No. 17/668,714.
Notice of Allowance, dated Aug. 30, 2018, from corresponding U.S. Appl. No. 15/996,208.
Notice of Allowance, dated Aug. 31, 2021, from corresponding U.S. Appl. No. 17/326,901.
Notice of Allowance, dated Aug. 4, 2021, from corresponding U.S. Appl. No. 16/895,278.
Notice of Allowance, dated Aug. 4, 2022, from corresponding U.S. Appl. No. 17/670,349.
Notice of Allowance, dated Aug. 7, 2020, from corresponding U.S. Appl. No. 16/901,973.
Notice of Allowance, dated Aug. 9, 2018, from corresponding U.S. Appl. No. 15/882,989.
Notice of Allowance, dated Aug. 9, 2021, from corresponding U.S. Appl. No. 16/881,699.
Notice of Allowance, dated Aug. 9, 2022, from corresponding U.S. Appl. No. 17/832,313.
Notice of Allowance, dated Dec. 10, 2018, from corresponding U.S. Appl. No. 16/105,602.
Notice of Allowance, dated Dec. 11, 2019, from corresponding U.S. Appl. No. 16/278,122.
Notice of Allowance, dated Dec. 11, 2019, from corresponding U.S. Appl. No. 16/593,634.
Notice of Allowance, dated Dec. 12, 2017, from corresponding U.S. Appl. No. 15/169,643.
Notice of Allowance, dated Dec. 12, 2017, from corresponding U.S. Appl. No. 15/619,212.
Notice of Allowance, dated Dec. 12, 2017, from corresponding U.S. Appl. No. 15/619,382.
Notice of Allowance, dated Dec. 13, 2019, from corresponding U.S. Appl. No. 16/512,033.
Notice of Allowance, dated Dec. 13, 2021, from corresponding U.S. Appl. No. 16/908,081.
Notice of Allowance, dated Dec. 13, 2021, from corresponding U.S. Appl. No. 17/347,853.
Notice of Allowance, dated Dec. 15, 2020, from corresponding U.S. Appl. No. 16/989,086.
Notice of Allowance, dated Dec. 16, 2019, from corresponding U.S. Appl. No. 16/505,461.
Notice of Allowance, dated Dec. 17, 2020, from corresponding U.S. Appl. No. 17/034,772.
Notice of Allowance, dated Dec. 18, 2019, from corresponding U.S. Appl. No. 16/659,437.
Notice of Allowance, dated Dec. 2, 2021, from corresponding U.S. Appl. No. 16/901,654.
Notice of Allowance, dated Dec. 23, 2019, from corresponding U.S. Appl. No. 16/656,835.
Notice of Allowance, dated Dec. 23, 2020, from corresponding U.S. Appl. No. 17/068,557.
Notice of Allowance, dated Dec. 3, 2019, from corresponding U.S. Appl. No. 16/563,749.
Notice of Allowance, dated Dec. 30, 2021, from corresponding U.S. Appl. No. 16/938,520.
Notice of Allowance, dated Dec. 31, 2018, from corresponding U.S. Appl. No. 16/159,634.
Notice of Allowance, dated Dec. 31, 2019, from corresponding U.S. Appl. No. 16/404,399.
Notice of Allowance, dated Dec. 4, 2019, from corresponding U.S. Appl. No. 16/594,670.
Notice of Allowance, dated Dec. 5, 2017, from corresponding U.S. Appl. No. 15/633,703.
Notice of Allowance, dated Dec. 6, 2017, from corresponding U.S. Appl. No. 15/619,451.
Notice of Allowance, dated Dec. 6, 2017, from corresponding U.S. Appl. No. 15/619,459.
Notice of Allowance, dated Dec. 7, 2020, from corresponding U.S. Appl. No. 16/817,136.
Notice of Allowance, dated Dec. 8, 2021, from corresponding U.S. Appl. No. 17/397,472.
Notice of Allowance, dated Dec. 9, 2019, from corresponding U.S. Appl. No. 16/565,261.
Notice of Allowance, dated Dec. 9, 2020, from corresponding U.S. Appl. No. 16/404,491.
Notice of Allowance, dated Feb. 1, 2022, from corresponding U.S. Appl. No. 17/346,509.
Notice of Allowance, dated Feb. 10, 2020, from corresponding U.S. Appl. No. 16/552,765.
Notice of Allowance, dated Feb. 11, 2021, from corresponding U.S. Appl. No. 17/086,732.
Notice of Allowance, dated Feb. 12, 2020, from corresponding U.S. Appl. No. 16/572,182.
Notice of Allowance, dated Feb. 13, 2019, from corresponding U.S. Appl. No. 16/041,563.
Notice of Allowance, dated Feb. 14, 2019, from corresponding U.S. Appl. No. 16/226,272.
Notice of Allowance, dated Feb. 14, 2022, from corresponding U.S. Appl. No. 16/623,157.
Notice of Allowance, dated Feb. 19, 2019, from corresponding U.S. Appl. No. 16/159,632.
Notice of Allowance, dated Feb. 19, 2021, from corresponding U.S. Appl. No. 16/832,451.
Notice of Allowance, dated Feb. 22, 2022, from corresponding U.S. Appl. No. 17/535,065.
Notice of Allowance, dated Feb. 24, 2021, from corresponding U.S. Appl. No. 17/034,355.
Notice of Allowance, dated Feb. 24, 2021, from corresponding U.S. Appl. No. 17/068,198.
Notice of Allowance, dated Feb. 24, 2021, from corresponding U.S. Appl. No. 17/101,106.
Notice of Allowance, dated Feb. 24, 2021, from corresponding U.S. Appl. No. 17/101,253.
Notice of Allowance, dated Feb. 24, 2022, from corresponding U.S. Appl. No. 17/234,205.
Notice of Allowance, dated Feb. 24, 2022, from corresponding U.S. Appl. No. 17/549,170.
Notice of Allowance, dated Feb. 25, 2020, from corresponding U.S. Appl. No. 16/714,355.
Notice of Allowance, dated Feb. 25, 2021, from corresponding U.S. Appl. No. 17/106,469.
Notice of Allowance, dated Feb. 26, 2021, from corresponding U.S. Appl. No. 17/139,650.
Notice of Allowance, dated Feb. 27, 2019, from corresponding U.S. Appl. No. 16/041,468.
Notice of Allowance, dated Feb. 27, 2019, from corresponding U.S. Appl. No. 16/226,290.
Notice of Allowance, dated Feb. 3, 2021, from corresponding U.S. Appl. No. 16/827,039.
Notice of Allowance, dated Feb. 3, 2021, from corresponding U.S. Appl. No. 17/068,558.
Notice of Allowance, dated Feb. 4, 2022, from corresponding U.S. Appl. No. 17/520,272.
Final Office Action, dated Mar. 16, 2022, from corresponding U.S. Appl. No. 17/838,939.
Final Office Action, dated Mar. 16, 2023, from corresponding U.S. Appl. No. 17/670,341.
Final Office Action, dated Mar. 16, 2023, from corresponding U.S. Appl. No. 17/836,454.
Final Office Action, dated Mar. 2, 2023, from corresponding U.S. Appl. No. 17/836,865.
Final Office Action, dated Mar. 3, 2023, from corresponding U.S. Appl. No. 17/670,354.
Final Office Action, dated Mar. 9, 2023, from corresponding U.S. Appl. No. 17/679,734.
Notice of Allowance, dated Mar. 6, 2023, from corresponding U.S. Appl. No. 17/836,430.
Office Action, dated Feb. 2, 2023, from corresponding U.S. Appl. No. 17/510,001.
Office Action, dated Jan. 19, 2023, from corresponding U.S. Appl. No. 17/205,165.
Office Action, dated Jan. 31, 2023, from corresponding U.S. Appl. No. 17/836,872.
Office Action, dated Mar. 27, 2019, from corresponding U.S. Appl. No. 16/278,120.
Office Action, dated Mar. 30, 2018, from corresponding U.S. Appl. No. 15/894,890.
Office Action, dated Mar. 30, 2018, from corresponding U.S. Appl. No. 15/896,790.
Office Action, dated Mar. 30, 2021, from corresponding U.S. Appl. No. 17/151,399.
Office Action, dated Mar. 4, 2019, from corresponding U.S. Appl. No. 16/237,083.
Office Action, dated May 12, 2022, from corresponding U.S. Appl. No. 17/509,974.
Office Action, dated May 14, 2020, from corresponding U.S. Appl. No. 16/808,497.
Office Action, dated May 14, 2020, from corresponding U.S. Appl. No. 16/808,503.
Office Action, dated May 15, 2020, from corresponding U.S. Appl. No. 16/808,493.
Office Action, dated May 16, 2018, from corresponding U.S. Appl. No. 15/882,989.
Office Action, dated May 16, 2022, from corresponding U.S. Appl. No. 17/679,750.
Office Action, dated May 17, 2019, from corresponding U.S. Appl. No. 16/277,539.
Office Action, dated May 18, 2021, from corresponding U.S. Appl. No. 17/196,570.
Office Action, dated May 2, 2018, from corresponding U.S. Appl. No. 15/894,809.
Office Action, dated May 2, 2019, from corresponding U.S. Appl. No. 16/104,628.
Office Action, dated May 24, 2022, from corresponding U.S. Appl. No. 17/674,187.
Office Action, dated May 29, 2020, from corresponding U.S. Appl. No. 16/862,944.
Office Action, dated May 29, 2020, from corresponding U.S. Appl. No. 16/862,948.
Office Action, dated May 29, 2020, from corresponding U.S. Appl. No. 16/863,226.
Office Action, dated May 5, 2020, from corresponding U.S. Appl. No. 16/410,336.
Office Action, dated May 9, 2022, from corresponding U.S. Appl. No. 16/840,943.
Office Action, dated Nov. 1, 2017, from corresponding U.S. Appl. No. 15/169,658.
Office Action, dated Nov. 10, 2021, from corresponding U.S. Appl. No. 17/380,485.
Office Action, dated Nov. 10, 2021, from corresponding U.S. Appl. No. 17/409,999.
Office Action, dated Nov. 10, 2022, from corresponding U.S. Appl. No. 17/670,341.
Office Action, dated Nov. 12, 2020, from corresponding U.S. Appl. No. 17/034,355.
Office Action, dated Nov. 12, 2020, from corresponding U.S. Appl. No. 17/034,772.
Office Action, dated Nov. 12, 2021, from corresponding U.S. Appl. No. 17/346,586.
Office Action, dated Nov. 12, 2021, from corresponding U.S. Appl. No. 17/373,444.
Office Action, dated Nov. 15, 2018, from corresponding U.S. Appl. No. 16/059,911.
Office Action, dated Nov. 15, 2019, from corresponding U.S. Appl. No. 16/552,758.
Office Action, dated Nov. 15, 2022, from corresponding U.S. Appl. No. 17/200,698.
Office Action, dated Nov. 16, 2021, from corresponding U.S. Appl. No. 17/370,650.
Office Action, dated Nov. 16, 2021, from corresponding U.S. Appl. No. 17/486,350.
Office Action, dated Nov. 18, 2019, from corresponding U.S. Appl. No. 16/560,885.
Office Action, dated Nov. 18, 2019, from corresponding U.S. Appl. No. 16/560,889.
Office Action, dated Nov. 18, 2019, from corresponding U.S. Appl. No. 16/572,347.
Office Action, dated Nov. 18, 2022, from corresponding U.S. Appl. No. 17/836,454.
Office Action, dated Nov. 19, 2019, from corresponding U.S. Appl. No. 16/595,342.
Office Action, dated Nov. 20, 2019, from corresponding U.S. Appl. No. 16/595,327.
Office Action, dated Nov. 23, 2018, from corresponding U.S. Appl. No. 16/042,673.
Office Action, dated Nov. 23, 2021, from corresponding U.S. Appl. No. 17/013,756.
Office Action, dated Nov. 24, 2020, from corresponding U.S. Appl. No. 16/925,628.
Office Action, dated Nov. 26, 2021, from corresponding U.S. Appl. No. 16/925,550.
Office Action, dated Nov. 29, 2022, from corresponding U.S. Appl. No. 17/838,939.
Office Action, dated Nov. 4, 2021, from corresponding U.S. Appl. No. 17/491,906.
Office Action, dated Nov. 8, 2021, from corresponding U.S. Appl. No. 16/872,130.
Office Action, dated Oct. 10, 2018, from corresponding U.S. Appl. No. 16/041,563.
Office Action, dated Oct. 10, 2018, from corresponding U.S. Appl. No. 16/055,083.
Office Action, dated Oct. 10, 2018, from corresponding U.S. Appl. No. 16/055,944.
Notice of Allowance, dated Oct. 17, 2019, from corresponding U.S. Appl. No. 16/563,741.
Notice of Allowance, dated Oct. 18, 2022, from corresponding U.S. Appl. No. 16/840,943.
Notice of Allowance, dated Oct. 21, 2019, from corresponding U.S. Appl. No. 16/404,405.
Notice of Allowance, dated Oct. 21, 2020, from corresponding U.S. Appl. No. 16/834,812.
Notice of Allowance, dated Oct. 22, 2021, from corresponding U.S. Appl. No. 17/346,847.
Notice of Allowance, dated Oct. 25, 2022, from corresponding U.S. Appl. No. 17/711,331.
Notice of Allowance, dated Oct. 3, 2019, from corresponding U.S. Appl. No. 16/511,700.
Notice of Allowance, dated Sep. 1, 2021, from corresponding U.S. Appl. No. 17/196,570.
Notice of Allowance, dated Sep. 1, 2021, from corresponding U.S. Appl. No. 17/222,556.
Notice of Allowance, dated Sep. 1, 2022, from corresponding U.S. Appl. No. 17/480,377.
Notice of Allowance, dated Sep. 12, 2019, from corresponding U.S. Appl. No. 16/512,011.
Notice of Allowance, dated Sep. 12, 2022, from corresponding U.S. Appl. No. 17/674,187.
Notice of Allowance, dated Sep. 13, 2018, from corresponding U.S. Appl. No. 15/894,809.
Notice of Allowance, dated Sep. 13, 2018, from corresponding U.S. Appl. No. 15/894,890.
Notice of Allowance, dated Sep. 14, 2021, from corresponding U.S. Appl. No. 16/808,497.
Notice of Allowance, dated Sep. 16, 2020, from corresponding U.S. Appl. No. 16/915,097.
Notice of Allowance, dated Sep. 17, 2020, from corresponding U.S. Appl. No. 16/863,226.
Notice of Allowance, dated Sep. 18, 2018, from corresponding U.S. Appl. 15/,894,819.
Notice of Allowance, dated Sep. 18, 2018, from corresponding U.S. Appl. No. 16/041,545.
Notice of Allowance, dated Sep. 18, 2020, from corresponding U.S. Appl. No. 16/812,795.
Notice of Allowance, dated Sep. 2, 2022, from corresponding U.S. Appl. No. 17/380,485.
Notice of Allowance, dated Sep. 23, 2020, from corresponding U.S. Appl. No. 16/811,793.
Notice of Allowance, dated Sep. 23, 2021, from corresponding U.S. Appl. No. 17/068,454.
Notice of Allowance, dated Sep. 24, 2021, from corresponding U.S. Appl. No. 17/334,939.
Notice of Allowance, dated Sep. 25, 2020, from corresponding U.S. Appl. No. 16/983,536.
Notice of Allowance, dated Sep. 27, 2017, from corresponding U.S. Appl. No. 15/626,052.
Notice of Allowance, dated Sep. 27, 2021, from corresponding U.S. Appl. No. 17/222,523.
Notice of Allowance, dated Sep. 28, 2018, from corresponding U.S. Appl. No. 16/041,520.
Notice of Allowance, dated Sep. 28, 2022, from corresponding U.S. Appl. No. 17/509,974.
Notice of Allowance, dated Sep. 28, 2022, from corresponding U.S. Appl. No. 17/689,683.
Notice of Allowance, dated Sep. 29, 2021, from corresponding U.S. Appl. No. 17/316,179.
Notice of Allowance, dated Sep. 30, 2022, from corresponding U.S. Appl. No. 17/867,068.
Notice of Allowance, dated Sep. 4, 2018, from corresponding U.S. Appl. No. 15/883,041.
Notice of Allowance, dated Sep. 4, 2020, from corresponding U.S. Appl. No. 16/808,500.
Notice of Allowance, dated Sep. 4, 2020, from corresponding U.S. Appl. No. 16/901,662.
Notice of Allowance, dated Sep. 9, 2021, from corresponding U.S. Appl. No. 17/334,909.
Agrawal et al., “Securing Electronic Health Records Without Impeding the Flow of Information,” International Journal of Medical Informatics 76, 2007, pp. 471-479 (Year: 2007).
Bang et al., “Building an Effective and Efficient Continuous Web Application Security Program,” 2016 International Conference on Cyber Security Situational Awareness, Data Analytics and Assessment (CyberSA), London, 2016, pp. 1-4 (Year: 2016).
Binns, et al., “Data Havens, or Privacy Sans Frontières? A Study of International Personal Data Transfers,” ACM, pp. 273-274 (Year: 2002).
Czeskis et al., “Lightweight Server Support for Browser-based CSRF Protection,” Proceedings of the 22nd International Conference on World Wide Web, 2013, pp. 273-284 (Year: 2013).
Falahrastegar, Marjan, et al., Tracking Personal Identifiers Across the Web, Medical Image Computing and Computer-Assisted Intervention—Miccai 2015, 18th International Conference, Oct. 5, 2015, Munich, Germany.
Friedman et al., “Informed Consent in the Mozilla Browser: Implementing Value-Sensitive Design,” Proceedings of the 35th Annual Hawaii International Conference on System Sciences, 2002, IEEE, pp. 1-10 (Year: 2002).
Ghiglieri, Marco et al. .; Personal DLP for Facebook, 2014 IEEE International Conference on Pervasive Computing and Communication Workshops (Percom Workshops); IEEE; Mar. 24, 2014; pp. 629-634.
Gilda, et al., “Blockchain for Student Data Privacy and Consent,” 2018 International Conference on Computer Communication and Informatics, Jan. 4-6, 2018, IEEE, pp. 1-5 (Year: 2018).
Halevy, et al., “Schema Mediation in Peer Data Management Systems,” IEEE, Proceedings of the 19th International Conference on Data Engineering, 2003, pp. 505-516 (Year: 2003).
IAPP, Daily Dashboard, PIA Tool Stocked With New Templates for DPI, Infosec, International Association of Privacy Professionals, Apr. 22, 2014.
International Search Report, dated Apr. 12, 2022, from corresponding International Application No. PCT/US2022/016735.
International Search Report, dated Aug. 15, 2017, from corresponding International Application No. PCT/US2017/036919.
Notice of Allowance, dated Jun. 16, 2022, from corresponding U.S. Appl. No. 17/119,080.
Notice of Allowance, dated Jun. 17, 2020, from corresponding U.S. Appl. No. 16/656,895.
Notice of Allowance, dated Jun. 18, 2019, from corresponding U.S. Appl. No. 16/410,566.
Notice of Allowance, dated Jun. 19, 2018, from corresponding U.S. Appl. No. 15/894,890.
Notice of Allowance, dated Jun. 19, 2019, from corresponding U.S. Appl. No. 16/042,673.
Notice of Allowance, dated Jun. 19, 2019, from corresponding U.S. Appl. No. 16/055,984.
Notice of Allowance, dated Jun. 2, 2021, from corresponding U.S. Appl. No. 17/198,581.
Notice of Allowance, dated Jun. 2, 2022, from corresponding U.S. Appl. No. 17/493,290.
Notice of Allowance, dated Jun. 21, 2019, from corresponding U.S. Appl. No. 16/404,439.
Notice of Allowance, dated Jun. 22, 2020, from corresponding U.S. Appl. No. 16/791,337.
Notice of Allowance, dated Jun. 23, 2022, from corresponding U.S. Appl. No. 17/588,645.
Notice of Allowance, dated Jun. 27, 2018, from corresponding U.S. Appl. No. 15/882,989.
Notice of Allowance, dated Jun. 29, 2022, from corresponding U.S. Appl. No. 17/675,118.
Notice of Allowance, dated Jun. 4, 2019, from corresponding U.S. Appl. No. 16/159,566.
Notice of Allowance, dated Jun. 5, 2019, from corresponding U.S. Appl. No. 16/220,899.
Notice of Allowance, dated Jun. 5, 2019, from corresponding U.S. Appl. No. 16/357,260.
Notice of Allowance, dated Jun. 6, 2018, from corresponding U.S. Appl. No. 15/875,570.
Notice of Allowance, dated Jun. 6, 2019, from corresponding U.S. Appl. No. 16/159,628.
Notice of Allowance, dated Jun. 7, 2021, from corresponding U.S. Appl. No. 17/099,270.
Notice of Allowance, dated Jun. 8, 2020, from corresponding U.S. Appl. No. 16/712,104.
Notice of Allowance, dated Jun. 8, 2022, from corresponding U.S. Appl. No. 17/722,551.
Notice of Allowance, dated Mar. 1, 2018, from corresponding U.S. Appl. No. 15/853,674.
Notice of Allowance, dated Mar. 1, 2019, from corresponding U.S. Appl. No. 16/059,911.
Notice of Allowance, dated Mar. 10, 2021, from corresponding U.S. Appl. No. 16/925,628.
Notice of Allowance, dated Mar. 10, 2021, from corresponding U.S. Appl. No. 17/128,666.
Notice of Allowance, dated Mar. 13, 2019, from corresponding U.S. Appl. No. 16/055,083.
Notice of Allowance, dated Mar. 14, 2019, from corresponding U.S. Appl. No. 16/055,944.
Notice of Allowance, dated Mar. 16, 2020, from corresponding U.S. Appl. No. 16/778,704.
Notice of Allowance, dated Mar. 16, 2021, from corresponding U.S. Appl. No. 17/149,380.
Notice of Allowance, dated Mar. 16, 2022, from corresponding U.S. Appl. No. 17/486,350.
Notice of Allowance, dated Mar. 17, 2020, from corresponding U.S. Appl. No. 16/560,885.
Notice of Allowance, dated Mar. 18, 2020, from corresponding U.S. Appl. No. 16/560,963.
Notice of Allowance, dated Mar. 19, 2021, from corresponding U.S. Appl. No. 17/013,757.
Notice of Allowance, dated Mar. 2, 2018, from corresponding U.S. Appl. No. 15/858,802.
Notice of Allowance, dated Mar. 2, 2022, from corresponding U.S. Appl. No. 16/872,130.
Notice of Allowance, dated Mar. 2, 2022, from corresponding U.S. Appl. No. 17/535,098.
Notice of Allowance, dated Mar. 21, 2022, from corresponding U.S. Appl. No. 17/366,754.
Notice of Allowance, dated Mar. 22, 2022, from corresponding U.S. Appl. No. 17/475,244.
Notice of Allowance, dated Mar. 22, 2022, from corresponding U.S. Appl. No. 17/504,102.
Notice of Allowance, dated Mar. 24, 2020, from corresponding U.S. Appl. No. 16/552,758.
Notice of Allowance, dated Mar. 25, 2019, from corresponding U.S. Appl. No. 16/054,780.
Notice of Allowance, dated Mar. 26, 2020, from corresponding U.S. Appl. No. 16/560,889.
Notice of Allowance, dated Mar. 26, 2020, from corresponding U.S. Appl. No. 16/578,712.
Notice of Allowance, dated Mar. 27, 2019, from corresponding U.S. Appl. No. 16/226,280.
Notice of Allowance, dated Mar. 28, 2022, from corresponding U.S. Appl. No. 17/499,609.
Notice of Allowance, dated Mar. 29, 2019, from corresponding U.S. Appl. No. 16/055,998.
Notice of Allowance, dated Mar. 31, 2020, from corresponding U.S. Appl. No. 16/563,744.
Notice of Allowance, dated Mar. 31, 2021, from corresponding U.S. Appl. No. 17/013,758.
Notice of Allowance, dated Mar. 31, 2021, from corresponding U.S. Appl. No. 17/162,205.
Notice of Allowance, dated Mar. 31, 2022, from corresponding U.S. Appl. No. 17/476,209.
Notice of Allowance, dated Mar. 4, 2022, from corresponding U.S. Appl. No. 17/409,999.
Notice of Allowance, dated May 1, 2020, from corresponding U.S. Appl. No. 16/586,202.
Notice of Allowance, dated May 11, 2020, from corresponding U.S. Appl. No. 16/786,196.
Notice of Allowance, dated May 11, 2022, from corresponding U.S. Appl. No. 17/395,759.
Notice of Allowance, dated May 13, 2021, from corresponding U.S. Appl. No. 17/101,915.
Notice of Allowance, dated May 18, 2022, from corresponding U.S. Appl. No. 17/670,354.
Notice of Allowance, dated May 19, 2020, from corresponding U.S. Appl. No. 16/505,430.
Notice of Allowance, dated May 19, 2020, from corresponding U.S. Appl. No. 16/808,496.
Notice of Allowance, dated May 20, 2020, from corresponding U.S. Appl. No. 16/707,762.
Notice of Allowance, dated May 21, 2018, from corresponding U.S. Appl. No. 15/896,790.
Notice of Allowance, dated May 25, 2022, from corresponding U.S. Appl. No. 16/872,031.
Notice of Allowance, dated May 26, 2021, from corresponding U.S. Appl. No. 16/808,493.
Notice of Allowance, dated May 26, 2021, from corresponding U.S. Appl. No. 16/865,874.
Notice of Allowance, dated May 26, 2021, from corresponding U.S. Appl. No. 17/199,514.
Notice of Allowance, dated May 27, 2020, from corresponding U.S. Appl. No. 16/820,208.
Notice of Allowance, dated May 27, 2021, from corresponding U.S. Appl. No. 16/927,658.
Notice of Allowance, dated May 27, 2021, from corresponding U.S. Appl. No. 17/198,757.
Notice of Allowance, dated May 27, 2022, from corresponding U.S. Appl. No. 17/543,546.
Notice of Allowance, dated May 28, 2019, from corresponding U.S. Appl. No. 16/277,568.
Notice of Allowance, dated May 28, 2020, from corresponding U.S. Appl. No. 16/799,279.
Notice of Allowance, dated May 28, 2021, from corresponding U.S. Appl. No. 16/862,944.
Notice of Allowance, dated May 31, 2022, from corresponding U.S. Appl. No. 17/679,715.
Notice of Allowance, dated May 5, 2017, from corresponding U.S. Appl. No. 15/254,901.
Notice of Allowance, dated May 5, 2020, from corresponding U.S. Appl. No. 16/563,754.
Notice of Allowance, dated May 6, 2022, from corresponding U.S. Appl. No. 17/666,886.
Notice of Allowance, dated May 7, 2020, from corresponding U.S. Appl. No. 16/505,426.
Notice of Allowance, dated May 7, 2021, from corresponding U.S. Appl. No. 17/194,662.
Notice of Allowance, dated Nov. 14, 2019, from corresponding U.S. Appl. No. 16/436,616.
Notice of Allowance, dated Nov. 16, 2021, from corresponding U.S. Appl. No. 17/491,871.
Notice of Allowance, dated Nov. 16, 2022, from corresponding U.S. Appl. No. 17/860,255.
Notice of Allowance, dated Nov. 2, 2018, from corresponding U.S. Appl. No. 16/054,762.
Notice of Allowance, dated Nov. 21, 2022, from corresponding U.S. Appl. No. 17/831,713.
Notice of Allowance, dated Nov. 22, 2021, from corresponding U.S. Appl. No. 17/383,889.
Notice of Allowance, dated Nov. 22, 2022, from corresponding U.S. Appl. No. 17/828,953.
Notice of Allowance, dated Nov. 23, 2020, from corresponding U.S. Appl. No. 16/791,589.
Notice of Allowance, dated Nov. 24, 2020, from corresponding U.S. Appl. No. 17/027,019.
Notice of Allowance, dated Nov. 25, 2020, from corresponding U.S. Appl. No. 17/019,771.
Notice of Allowance, dated Nov. 26, 2019, from corresponding U.S. Appl. No. 16/563,735.
Notice of Allowance, dated Nov. 27, 2019, from corresponding U.S. Appl. No. 16/570,712.
Notice of Allowance, dated Nov. 27, 2019, from corresponding U.S. Appl. No. 16/577,634.
Notice of Allowance, dated Nov. 3, 2020, from corresponding U.S. Appl. No. 16/719,071.
Notice of Allowance, dated Nov. 5, 2019, from corresponding U.S. Appl. No. 16/560,965.
Notice of Allowance, dated Nov. 7, 2017, from corresponding U.S. Appl. No. 15/671,073.
Notice of Allowance, dated Nov. 8, 2018, from corresponding U.S. Appl. No. 16/042,642.
Notice of Allowance, dated Nov. 9, 2020, from corresponding U.S. Appl. No. 16/595,342.
Notice of Allowance, dated Nov. 9, 2022, from corresponding U.S. Appl. No. 17/187,329.
Notice of Allowance, dated Oct. 1, 2021, from corresponding U.S. Appl. No. 17/340,395.
Notice of Allowance, dated Oct. 10, 2019, from corresponding U.S. Appl. No. 16/277,539.
Notice of Allowance, dated Oct. 17, 2018, from corresponding U.S. Appl. No. 15/896,790.
Notice of Allowance, dated Oct. 17, 2018, from corresponding U.S. Appl. No. 16/054,672.
Niu, et al., “Achieving Data Truthfulness and Privacy Preservation in Data Markets”, IEEE Transactions on Knowledge and Data Engineering, IEEE Service Centre, Los Alamitos, CA, US, vol. 31, No. 1, Jan. 1, 2019, pp. 105-119 (Year 2019).
Notice of Filing Date for Petition for Post-Grant Review of related U.S. Pat. No. 9,691,090 dated Apr. 12, 2018.
Nouwens et al., “Dark Patterns after the GDPR: Scraping Consent Pop-ups and Demonstrating their Influence,” ACM, pp. 1-13, Apr. 25, 2020 (Year: 2020).
O'Keefe et al., “Privacy-Preserving Data Linkage Protocols,” Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, 2004, pp. 94-102 (Year: 2004).
Olenski, Steve, For Consumers, Data is s Matter of Trust, CMO Network, Apr. 18, 2016, https://www.forbes.com/sites/steveolenski/2016/04/18/for-consumers-data-is-a-matter-of-trust/#2e48496278b3.
Ozdikis et al., “Tool Support for Transformation from an OWL Ontology to an HLA Object Model,” ACM, pp. 1-6 (Year: 2010).
Paes, “Student Research Abstract: Automatic Detection of Cross-Browser Incompatibilities using Machine Learning and Screenshot Similarity,” ACM, pp. 697-698, Apr. 3, 2017 (Year: 2017).
Pearson, et al., “A Model-Based Privacy Compliance Checker,” IJEBR, vol. 5, No. 2, pp. 63-83, 2009, Nov. 21, 2008. [Online]. Available: http://dx.doi.org/10.4018/jebr.2009040104 (Year: 2008).
Pechenizkiy et al., “Process Mining Online Assessment Data,” Educational Data Mining, pp. 279-288 (Year: 2009).
Petition for Post-Grant Review of related U.S. Pat. No. 9,691,090 dated Mar. 27, 2018.
Petrie et al., “The Relationship between Accessibility and Usability of Websites”, ACM, pp. 397-406 (Year: 2007).
Ping et al., “Wide Area Placement of Data Replicas for Fast and Highly Available Data Access,” ACM, pp. 1-8 (Year: 2011).
Popescu-Zeletin, “The Data Access and Transfer Support in a Local Heterogeneous Network (HMINET)”, IEEE, pp. 147-152 (Year: 1979).
Porter, “De-Identified Data and Third Party Data Mining: The Risk of Re-Identification of Personal Information,” Shidler JL Com. & Tech. 5, 2008, pp. 1-9 (Year: 2008).
Pretorius, et al., “Attributing Users Based on Web Browser History,” 2017 IEEE Conference on Application, Information and Network Security (AINS), 2017, pp. 69-74 (Year: 2017).
Preuveneers et al., “Access Control with Delegated Authorization Policy Evaluation for Data-Driven Microservice Workflows,” Future Internet 2017, MDPI, pp. 1-21 (Year: 2017).
Qiu, et al., “Design and Application of Data Integration Platform Based on Web Services and XML,” IEEE, pp. 253-256 (Year: 2016).
Qu et al., “Metadata Type System: Integrate Presentation, Data Models and Extraction to Enable Exploratory Browsing Interfaces,” ACM, pp. 107-116 (Year: 2014).
Radu, et al., “Analyzing Risk Evaluation Frameworks and Risk Assessment Methods,” IEEE, Dec. 12, 2020, pp. 1-6 (Year 2020).
Rakers, “Managing Professional and Personal Sensitive Information,” ACM, pp. 9-13, Oct. 24-27, 2010 (Year: 2010).
Reardon et al., User-Level Secure Deletion on Log-Structured File Systems, ACM, 2012, retrieved online on Apr. 22, 2021, pp. 1-11. Retrieved from the Internet: URL: http://citeseerx.ist.psu.edu/viewdoc/download; sessionid=450713515DC7F19F8ED09AE961D4B60E. (Year: 2012).
Regulation (Eu) 2016/679, “On the protection of natural persons with regard to the processing of personal data and on the free movement of such data, and repealing Directive 95/46/EC (General Data Protection Regulation),” Official Journal of the European Union, May 4, 2016, pp. L 119/1-L 119/88 (Year: 2016).
Roesner et al., “Detecting and Defending Against Third-Party Tracking on the Web,” 9th USENIX Symposium on Networked Systems Design and Implementation, Apr. 11, 2013, pp. 1-14, ACM (Year: 2013).
Rozepz, “What is Google Privacy Checkup? Everything You Need to Know,” Tom's Guide web post, Apr. 26, 2018, pp. 1-11 (Year: 2018).
Sachinopoulou et al., “Ontology-Based Approach for Managing Personal Health and Wellness Information,” IEEE, pp. 1802-1805 (Year: 2007).
Salim et al., “Data Retrieval and Security using Lightweight Directory Access Protocol”, IEEE, pp. 685-688 (Year: 2009).
Sanchez-Rola et al., “Can I Opt Out Yet ?: GDPR and the Global Illusion of Cookie Control,” Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, 2019, pp. 340-351 (Year: 2019).
Santhisree, et al., “Web Usage Data Clustering Using Dbscan Algorithm and Set Similarities,” IEEE, pp. 220-224 (Year: 2010).
Sanzo et al., “Analytical Modeling of Lock-Based Concurrency Control with Arbitrary Transaction Data Access Patterns,” ACM, pp. 69-78 (Year: 2010).
Sarkar et al., “Towards Enforcement of the EU GDPR: Enabling Data Erasure,” 2018 IEEE Confs on Internet of Things, Green Computing and Communications, Cyber, Physical and Social Computing, Smart Data, Blockchain, Computer and Information Technology, Congress on Cybermatics, 2018, pp. 222-229, IEEE (Year: 2018).
Schwartz, Edward J., et al., 2010 IEEE Symposium on Security and Privacy: All You Ever Wanted to Know About Dynamic Analysis and forward Symbolic Execution (but might have been afraid to ask), Carnegie Mellon University, IEEE Computer Society, 2010, p. 317-331.
Sedinic et al., “Security Risk Management in Complex Organization,” May 29, 2015, IEEE, pp. 1331-1337 (Year: (2015).
Shahriar et al., “A Model-Based Detection of Vulnerable and Malicious Browser Extensions,” IEEE, pp. 198-207 (Year: 2013).
Shankar et al., “Doppleganger: Better Browser Privacy Without the Bother,” Proceedings of the 13th ACM Conference on Computer and Communications Security; [ACM Conference on Computer and Communications Security], New York, NY : ACM, US, Oct. 30, 2006, pp. 154-167 (Year: 2006).
Shulz et al., “Generative Data Models for Validation and Evaluation of Visualization Techniques,” ACM, pp. 1-13 (Year: 2016).
Singh, et al., “A Metadata Catalog Service for Data Intensive Applications,” ACM, pp. 1-17 (Year: 2003).
Sjosten et al., “Discovering Browser Extensions via Web Accessible Resources,” ACM, pp. 329-336, Mar. 22, 2017 (Year: 2017).
Slezak, et al., “Brighthouse: An Analytic Data Warehouse for Ad-hoc Queries,” ACM, pp. 1337-1345 (Year: 2008).
Soceanu, et al., “Managing the Privacy and Security of eHealth Data,” May 29, 2015, IEEE, pp. 1-8 (Year: 2015).
Srinivasan et al., “Descriptive Data Analysis of File Transfer Data,” ACM, pp. 1-8 (Year: 2014).
Stack Overflow, “Is there a way to force a user to scroll to the bottom of a div?,” Stack Overflow, pp. 1-11, Nov. 2013. [Online]. Available: https://stackoverflow.com/questions/2745935/is-there-a-way-to-force-a-user-to-scroll-to-the-bottom-of-a-div (Year: 2013).
Stern, Joanna, “iPhone Privacy Is Broken . . . and Apps Are to Blame”, The Wall Street Journal, wsj.com, May 31, 2019.
Strodl, et al., “Personal & SOHO Archiving,” Vienna University of Technology, Vienna, Austria, JCDL '08, Jun. 16-20, 2008, Pittsburgh, Pennsylvania, USA, pp. 115-123 (Year: 2008).
Sukumar et al., “Review on Modern Data Preprocessing Techniques in Web Usage Mining (WUM),” IEEE, 2016, pp. 64-69 (Year: 2016).
Symantec, Symantex Data Loss Prevention—Discover, monitor, and protect confidential data; 2008; Symantec Corporation; http://www.mssuk.com/images/Symantec%2014552315_IRC_BR_DLP_03.09_sngl.pdf.
Tanasa et al., “Advanced Data Preprocessing for Intersites Web Usage Mining,” IEEE, Mar. 2004, pp. 59-65 (Year: 2004).
The Cookie Collective, Optanon Cookie Policy Generator, The Cookie Collective, Year 2016, http://web.archive.org/web/20160324062743/https:/optanon.com/.
Thomas et al., “MooM—A Prototype Framework for Management of Ontology Mappings,” IEEE, pp. 548-555 (Year: 2011).
TRUSTe Announces General Availability of Assessment Manager for Enterprises to Streamline Data Privacy Management with Automation, PRNewswire, Mar. 4, 2015.
Tsai et al., “Determinants of Intangible Assets Value: The Data Mining Approach,” Knowledge Based System, pp. 67-77 http://www.elsevier.com/locate/knosys (Year: 2012).
International Search Report, dated Aug. 21, 2017, from corresponding International Application No. PCT/US2017/036914.
International Search Report, dated Aug. 29, 2017, from corresponding International Application No. PCT/US2017/036898.
International Search Report, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036889.
International Search Report, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036890.
International Search Report, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036893.
International Search Report, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036901.
International Search Report, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036913.
International Search Report, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036920.
International Search Report, dated Dec. 14, 2018, from corresponding International Application No. PCT/US2018/045296.
International Search Report, dated Dec. 22, 2021, from corresponding International Application No. PCT/US2021/051217.
International Search Report, dated Feb. 11, 2022, from corresponding International Application No. PCT/US2021/053518.
International Search Report, dated Feb. 14, 2022, from corresponding International Application No. PCT/US2021/058274.
International Search Report, dated Jan. 14, 2019, from corresponding International Application No. PCT/US2018/046949.
International Search Report, dated Jan. 5, 2022, from corresponding International Application No. PCT/US2021/050497.
International Search Report, dated Jan. 7, 2019, from corresponding International Application No. PCT/US2018/055772.
International Search Report, dated Jun. 1, 2022, from corresponding International Application No. PCT/US2022/016930.
International Search Report, dated Jun. 21, 2017, from corresponding International Application No. PCT/US2017/025600.
International Search Report, dated Jun. 22, 2022, from corresponding International Application No. PCT/US2022/019358.
International Search Report, dated Jun. 24, 2022, from corresponding International Application No. PCT/US2022/019882.
International Search Report, dated Jun. 6, 2017, from corresponding International Application No. PCT/US2017/025605.
International Search Report, dated Jun. 6, 2017, from corresponding International Application No. PCT/US2017/025611.
International Search Report, dated Mar. 14, 2019, from corresponding International Application No. PCT/US2018/055736.
International Search Report, dated Mar. 18, 2022, from corresponding International Application No. PCT/US2022/013733.
International Search Report, dated Mar. 4, 2019, from corresponding International Application No. PCT/US2018/055773.
International Search Report, dated Mar. 4, 2019, from corresponding International Application No. PCT/US2018/055774.
International Search Report, dated May 12, 2022, from corresponding International Application No. PCT/US2022/015929.
International Search Report, dated May 17, 2022, from corresponding International Application No. PCT/US2022/015241.
International Search Report, dated May 19, 2022, from corresponding International Application No. PCT/US2022/015637.
International Search Report, dated Nov. 12, 2021, from corresponding International Application No. PCT/US2021/043481.
International Search Report, dated Nov. 19, 2018, from corresponding International Application No. PCT/US2018/046939.
International Search Report, dated Nov. 3, 2021, from corresponding International Application No. PCT/US2021/040893.
International Search Report, dated Nov. 3, 2021, from corresponding International Application No. PCT/US2021/044910.
International Search Report, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/043975.
International Search Report, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/043976.
International Search Report, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/043977.
International Search Report, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/044026.
International Search Report, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/045240.
International Search Report, dated Oct. 12, 2017, from corresponding International Application No. PCT/US2017/036888.
International Search Report, dated Oct. 12, 2018, from corresponding International Application No. PCT/US2018/044046.
International Search Report, dated Oct. 16, 2018, from corresponding International Application No. PCT/US2018/045243.
International Search Report, dated Oct. 18, 2018, from corresponding International Application No. PCT/US2018/045249.
International Search Report, dated Oct. 20, 2017, from corresponding International Application No. PCT/US2017/036917.
International Search Report, dated Oct. 3, 2017, from corresponding International Application No. PCT/US2017/036912.
International Search Report, dated Sep. 1, 2017, from corresponding International Application No. PCT/US2017/036896.
International Search Report, dated Sep. 12, 2018, from corresponding International Application No. PCT/US2018/037504.
International Search Report, dated Sep. 15, 2021, from corresponding International Application No. PCT/US2021/033631.
Invitation to Pay Additional Search Fees, dated Aug. 10, 2017, from corresponding International Application No. PCT/US2017/036912.
Invitation to Pay Additional Search Fees, dated Aug. 10, 2017, from corresponding International Application No. PCT/US2017/036917.
Invitation to Pay Additional Search Fees, dated Aug. 24, 2017, from corresponding International Application No. PCT/US2017/036888.
Invitation to Pay Additional Search Fees, dated Jan. 18, 2019, from corresponding International Application No. PCT/US2018/055736.
Notice of Allowance, dated Feb. 8, 2022, from corresponding U.S. Appl. No. 17/342,153.
Notice of Allowance, dated Jan. 1, 2021, from corresponding U.S. Appl. No. 17/026,727.
Notice of Allowance, dated Jan. 11, 2022, from corresponding U.S. Appl. No. 17/371,350.
Notice of Allowance, dated Jan. 12, 2022, from corresponding U.S. Appl. No. 17/334,948.
Notice of Allowance, dated Jan. 12, 2022, from corresponding U.S. Appl. No. 17/463,775.
Notice of Allowance, dated Jan. 14, 2020, from corresponding U.S. Appl. No. 16/277,715.
Notice of Allowance, dated Jan. 15, 2021, from corresponding U.S. Appl. No. 17/030,714.
Notice of Allowance, dated Jan. 18, 2018, from corresponding U.S. Appl. No. 15/619,478.
Notice of Allowance, dated Jan. 18, 2019 from corresponding U.S. Appl. No. 16/159,635.
Notice of Allowance, dated Jan. 2, 2020, from corresponding U.S. Appl. No. 16/410,296.
Notice of Allowance, dated Jan. 23, 2018, from corresponding U.S. Appl. No. 15/619,251.
Notice of Allowance, dated Jan. 24, 2022, from corresponding U.S. Appl. No. 17/340,699.
Notice of Allowance, dated Jan. 25, 2021, from corresponding U.S. Appl. No. 16/410,336.
Notice of Allowance, dated Jan. 26, 2018, from corresponding U.S. Appl. No. 15/619,469.
Notice of Allowance, dated Jan. 26, 2022, from corresponding U.S. Appl. No. 17/491,906.
Notice of Allowance, dated Jan. 29, 2020, from corresponding U.S. Appl. No. 16/278,119.
Notice of Allowance, dated Jan. 31, 2022, from corresponding U.S. Appl. No. 17/472,948.
Notice of Allowance, dated Jan. 5, 2022, from corresponding U.S. Appl. No. 17/475,241.
Notice of Allowance, dated Jan. 6, 2021, from corresponding U.S. Appl. No. 16/595,327.
Notice of Allowance, dated Jan. 6, 2022, from corresponding U.S. Appl. No. 17/407,765.
Notice of Allowance, dated Jan. 7, 2022, from corresponding U.S. Appl. No. 17/222,725.
Notice of Allowance, dated Jan. 8, 2020, from corresponding U.S. Appl. No. 16/600,879.
Notice of Allowance, dated Jul. 10, 2019, from corresponding U.S. Appl. No. 16/237,083.
Notice of Allowance, dated Jul. 10, 2019, from corresponding U.S. Appl. No. 16/403,358.
Notice of Allowance, dated Jul. 12, 2019, from corresponding U.S. Appl. No. 16/278,121.
Notice of Allowance, dated Jul. 14, 2020, from corresponding U.S. Appl. No. 16/701,043.
Notice of Allowance, dated Jul. 15, 2020, from corresponding U.S. Appl. No. 16/791,006.
Notice of Allowance, dated Jul. 16, 2020, from corresponding U.S. Appl. No. 16/901,979.
Notice of Allowance, dated Jul. 17, 2019, from corresponding U.S. Appl. No. 16/055,961.
Notice of Allowance, dated Jul. 17, 2020, from corresponding U.S. Appl. No. 16/778,709.
Notice of Allowance, dated Jul. 19, 2021, from corresponding U.S. Appl. No. 17/306,252.
Notice of Allowance, dated Jul. 20, 2022, from corresponding U.S. Appl. No. 16/938,509.
Notice of Allowance, dated Jul. 21, 2020, from corresponding U.S. Appl. No. 16/557,392.
Notice of Allowance, dated Jul. 23, 2019, from corresponding U.S. Appl. No. 16/220,978.
Notice of Allowance, dated Jul. 26, 2019, from corresponding U.S. Appl. No. 16/409,673.
Notice of Allowance, dated Jul. 26, 2021, from corresponding U.S. Appl. No. 17/151,399.
Notice of Allowance, dated Jul. 26, 2021, from corresponding U.S. Appl. No. 17/207,316.
Notice of Allowance, dated Jul. 27, 2022, from corresponding U.S. Appl. No. 17/679,750.
Notice of Allowance, dated Jul. 29, 2022, from corresponding U.S. Appl. No. 17/670,341.
Notice of Allowance, dated Jul. 31, 2019, from corresponding U.S. Appl. No. 16/221,153.
Notice of Allowance, dated Jul. 7, 2022, from corresponding U.S. Appl. No. 17/571,871.
Notice of Allowance, dated Jul. 8, 2021, from corresponding U.S. Appl. No. 17/201,040.
Notice of Allowance, dated Jun. 1, 2020, from corresponding U.S. Appl. No. 16/813,321.
Notice of Allowance, dated Jun. 11, 2021, from corresponding U.S. Appl. No. 16/862,948.
Notice of Allowance, dated Jun. 11, 2021, from corresponding U.S. Appl. No. 16/862,952.
Notice of Allowance, dated Jun. 11, 2021, from corresponding U.S. Appl. No. 17/216,436.
Notice of Allowance, dated Jun. 12, 2019, from corresponding U.S. Appl. No. 16/278,123.
Notice of Allowance, dated Jun. 12, 2019, from corresponding U.S. Appl. No. 16/363,454.
Notice of Allowance, dated Jun. 14, 2022, from corresponding U.S. Appl. No. 17/679,734.
Notice of Allowance, dated Jun. 16, 2020, from corresponding U.S. Appl. No. 16/798,818.
Castro et al., “Creating Lightweight Ontologies for Dataset Description,” IEEE, pp. 1-4 (Year: 2014).
Cerpzone, “How to Access Data on Data Archival Storage and Recovery System”, https://www.saj.usace.army.mil/Portals/44/docs/Environmental/Lake%20O%20Watershed/15February2017/How%20To%20Access%20Model%20Data%20on%20DASR.pdf?ver=2017-02-16-095535-633, Feb. 16, 2017.
Cha et al., “A Data-Driven Security Risk Assessment Scheme for Personal Data Protection,” IEEE, pp. 50510-50517 (Year: 2018).
Cha, et al., “Process-Oriented Approach for Validating Asset Value for Evaluating Information Security Risk,” IEEE, Aug. 31, 2009, pp. 379-385 (Year: 2009).
Chang et al., “A Ranking Approach for Human Age Estimation Based on Face Images,” IEEE, 2010, pp. 3396-3399 (Year: 2010).
Chapados et al., “Scoring Models for Insurance Risk Sharing Pool Optimization,” 2008, IEEE, pp. 97-105 (Year: 2008).
Cheng, Raymond, et al., “Radiatus: A Shared-Nothing Server-Side Web Architecture,” Proceedings of the Seventh ACM Symposium on Cloud Computing, Oct. 5, 2016, pp. 237-250 (Year: 2016).
Choi et al., “A Survey on Ontology Mapping,” ACM, pp. 34-41 (Year: 2006).
Choi et al., “Retrieval Effectiveness of Table of Contents and Subject Headings,” ACM, pp. 103-104 (Year: 2007).
Chowdhury et al., “A System Architecture for Subject-Centric Data Sharing”, ACM, pp. 1-10 (Year: 2018).
Chowdhury et al., “Managing Data Transfers in Computer Clusters with Orchestra,” ACM, pp. 98-109 (Year: 2011).
Civili et al., “Mastro Studio: Managing Ontology-Based Data Access Applications,” ACM, pp. 1314-1317, Aug. 26-30, 2013 (Year: 2013).
Cruz et al., “Interactive User Feedback in Ontology Matching Using Signature Vectors,” IEEE, pp. 1321-1324 (Year: (2012).
Cudre-Mauroux, “ESWC 2008 Ph.D. Symposium,” The ESWC 2008 Ph. D. Symposium is sponsored by the Okkam project (http://fp7.okkam.org/), MIT, pp. 1-92 (Year: 2008).
Cui et al., “Domain Ontology Management Environment,” IEEE, pp. 1-9 (Year: 2000).
Decision Regarding Institution of Post-Grant Review in Case PGR2018-00056 for U.S. Pat. No. 9,691,090 B1, Oct. 11, 2018.
Degeling et al., “We Value Your Privacy . . . Now Take Some Cookies: Measuring the GDPRs Impact on Web Privacy,” arxiv.org, Cornell University Library, 201 Olin Library Cornell University, Ithaca, NY 14853, Aug. 15, 2018, pp. 1-15 (Year: 2019).
Dimou et al., “Machine-Interpretable Dataset and Service Descriptions for Heterogeneous Data Access and Retrieval”, ACM, pp. 145-152 (Year: 2015).
Dokholyan et al., “Regulatory and Ethical Considerations for Linking Clinical and Administrative Databases,” American Heart Journal 157.6 (2009), pp. 971-982 (Year: 2009).
Dowling, “Auditing Global HR Compliance,” published May 23, 2014, retrieved from https://www.shrm.org/resourcesandtools/hr-topics/ global-hr/pages/auditing-global-hr-compliance.aspx Jul. 2, 2022 (Year: 2014).
Dunkel et al., “Data Organization and Access for Efficient Data Mining”, IEEE, pp. 522-529 (Year: 1999).
Edinger et al., “Age and Gender Estimation of Unfiltered Faces,” IEEE, 2014, pp. 2170-2179 (Year: 2014).
Emerson, et al., “A Data Mining Driven Risk Profiling Method for Road Asset Management,” ACM, pp. 1267-1275 (Year: 2013).
Enck, William, et al., TaintDroid: An Information-Flow Tracking System for Realtime Privacy Monitoring on Smartphones, ACM Transactions on Computer Systems, vol. 32, No. 2, Article 5, Jun. 2014, p. 5:1-5:29.
Everypixel Team, “A New Age Recognition API Detects the Age of People on Photos,” May 20, 2019, pp. 1-5 (Year: 2019).
Falbo et al., “An Ontological Approach to Domain Engineering,” ACM, pp. 351-358 (Year: 2002).
Fan et al., “Intrusion Investigations with Data-hiding for Computer Log-file Forensics,” IEEE, pp. 1-6 (Year: 2010).
Final Written Decision Regarding Post-Grant Review in Case PGR2018-00056 for U.S. Pat. No. 9,691,090 B1, Oct. 10, 2019.
Francis, Andre, Business Mathematics and Statistics, South-Western Cengage Learning, 2008, Sixth Edition.
Friedman et al., “Data Mining with Differential Privacy,” ACM, Jul. 2010, pp. 493-502 (Year: 2010).
Frikken, Keith B., et al., Yet Another Privacy Metric for Publishing Micro-data, Miami University, Oct. 27, 2008, p. 117-121.
Fung et al., “Discover Information and Knowledge from Websites using an Integrated Summarization and Visualization Framework”, IEEE, pp. 232-235 (Year: 2010).
Gajare et al., “Improved Automatic Feature Selection Approach for Health Risk Prediction,” Feb. 16, 2018, IEEE, pp. 816-819 (Year: 2018).
Geko et al., “An Ontology Capturing the Interdependence of the General Data Protection Regulation (GDPR) and Information Security,” ACM, pp. 1-6, Nov. 15-16, 2018 (Year: 2018).
Golab, et al., “Issues in Data Stream Management,” ACM, SIGMOD Record, vol. 32, No. 2, Jun. 2003, pp. 5-14 (Year: 2003).
Golfarelli et al., “Beyond Data Warehousing: What's Next in Business Intelligence?,” ACM, pp. 1-6 (Year: 2004).
Gonçalves et al., “The XML Log Standard for Digital Libraries: Analysis, Evolution, and Deployment,” IEEE, pp. 312-314 (Year: 2003).
Goni, Kyriaki, “Deletion Process_Only you can see my history: Investigating Digital Privacy, Digital Oblivion, and Control on Personal Data Through an Interactive Art Installation,” ACM, 2016, retrieved online on Oct. 3, 2019, pp. 324-333. Retrieved from the Internet URL: http://delivery.acm.org/10.1145/2920000/291.
Gowadia et al., “RDF Metadata for XML Access Control,” ACM, pp. 31-48 (Year: 2003).
Grolinger, et al., “Data Management in Cloud Environments: NoSQL and NewSQL Data Stores,” Journal of Cloud Computing: Advances, Systems and Applications, pp. 1-24 (Year: 2013).
Guo, et al., “OPAL: A Passe-partout for Web Forms,” ACM, pp. 353-356 (Year: 2012).
Gustarini, et al., “Evaluation of Challenges in Human Subject Studies “In-the-Wild” Using Subjects' Personal Smartphones,” ACM, pp. 1447-1456 (Year: 2013).
HacigümüS, Hakan, et al., Executing SQL over Encrypted Data in the Database-Service-Provider Model, ACM, Jun. 4, 2002, pp. 216-227.
Han et al., “Demographic Estimation from Face Images: Human vs. Machine Performance,” IEEE, 2015, pp. 1148-1161 (Year: 2015).
Hauch, et al., “Information Intelligence: Metadata for Information Discovery, Access, and Integration,” ACM, pp. 793-798 (Year: 2005).
He et al., “A Crowdsourcing Framework for Detecting of Cross-Browser Issues in Web Application,” ACM, pp. 1-4, Nov. 6, 2015 (Year: 2015).
Heil et al., “Downsizing and Rightsizing,” https://web.archive.org/web/20130523153311/https://www.referenceforbusiness.com/management/De-Ele/Downsizing-and-Rightsizing.html (Year: 2013).
Hernandez, et al., “Data Exchange with Data-Metadata Translations,” ACM, pp. 260-273 (Year: 2008).
Hinde, “A Model to Assess Organisational Information Privacy Maturity Against the Protection of Personal Information Act” Dissertation University of Cape Town 2014, pp. 1-121 (Year: 2014).
Invitation to Pay Additional Search Fees, dated Jan. 7, 2019, from corresponding International Application No. PCT/US2018/055773.
Invitation to Pay Additional Search Fees, dated Jan. 8, 2019, from corresponding International Application No. PCT/US2018/055774.
Invitation to Pay Additional Search Fees, dated Oct. 23, 2018, from corresponding International Application No. PCT/US2018/045296.
Lebeau, Franck, et al., “Model-Based Vulnerability Testing for Web Applications,” 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops, pp. 445-452, IEEE, 2013 (Year: 2013).
Liu, Yandong, et al., “Finding the Right Consumer: Optimizing for Conversion in Display Advertising Campaigns,” Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, Feb. 2, 2012, pp. 473-428 (Year: 2012).
Lizar et al., “Usable Consents: Tracking and Managing Use of Personal Data with a Consent Transaction Receipt,” Proceedings of the 2014 ACM International Joint Conference on Pervasive and Ubiquitous Computing: Adjunct Publication, 2014, pp. 647-652 (Year: 2014).
Ma Ziang, et al., “LibRadar: Fast and Accurate Detection of Third-Party Libraries in Android Apps,” 2016 IEEE/ACM 38th IEEE International Conference on Software Engineering Companion (ICSE-C), ACM, May 14, 2016, pp. 653-656, DOI: http://dx.doi.org/10.1145/2889160.2889178, p. 653, r.col, par. 1-3; figure 3 (Year: 2016).
Mandal, et al., “Automated Age Prediction Using Wrinkles Features of Facial Images and Neural Network,” International Journal of Emerging Engineering Research and Technology, vol. 5, Issue 2, Feb. 2017, pp. 12-20 (Year: 2017).
Moiso et al., “Towards a User-Centric Personal Data Ecosystem The Role of the Bank of Individual's Data,” 2012 16th International Conference on Intelligence in Next Generation Networks, Berlin, 2012, pp. 202-209 (Year: 2012).
Pfeifle, Sam, The Privacy Advisor, IAPP and AvePoint Launch New Free PIA Tool, International Association of Privacy Professionals, Mar. 5, 2014.
Pfeifle, Sam, The Privacy Advisor, IAPP Heads to Singapore with APIA Template in Tow, International Association of Privacy Professionals, https://iapp.org/news/a/iapp-heads-to-singapore-with-apia-template_in_tow/, Mar. 28, 2014, p. 1-3.
Qing-Jiang et al., “The (P, a, K) Anonymity Model for Privacy Protection of Personal Information in the Social Networks,” 2011 6th IEEE Joint International Information Technology and Artificial Intelligence Conference, vol. 2 IEEE, 2011, pp. 420-423 (Year: 2011).
Srivastava, Agrima, et al., Measuring Privacy Leaks in Online Social Networks, International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2013.
Tanwar, et al., “Live Forensics Analysis: Violations of Business Security Policy,” 2014 International Conference on Contemporary Computing and Informatics (IC31), 2014, pp. 971-976 (Year: 2014).
Thuraisingham, “Security Issues for the Semantic Web,” Proceedings 27th Annual International Computer Software and Applications Conference, COMPSAC 2003, Dallas, TX, USA, 2003, pp. 633-638 (Year: 2003).
Written Opinion of the International Searching Authority, dated Jun. 6, 2017, from corresponding International Application No. PCT/US2017/025611.
Written Opinion of the International Searching Authority, dated Apr. 12, 2022, from corresponding International Application No. PCT/US2022/016735.
Written Opinion of the International Searching Authority, dated Aug. 15, 2017, from corresponding International Application No. PCT/US2017/036919.
Written Opinion of the International Searching Authority, dated Aug. 21, 2017, from corresponding International Application No. PCT/US2017/036914.
Written Opinion of the International Searching Authority, dated Aug. 29, 2017, from corresponding International Application No. PCT/US2017/036898.
Written Opinion of the International Searching Authority, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036889.
Written Opinion of the International Searching Authority, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036890.
Written Opinion of the International Searching Authority, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036893.
Written Opinion of the International Searching Authority, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036901.
Written Opinion of the International Searching Authority, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036913.
Written Opinion of the International Searching Authority, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036920.
Written Opinion of the International Searching Authority, dated Dec. 14, 2018, from corresponding International Application No. PCT/US2018/045296.
Written Opinion of the International Searching Authority, dated Dec. 22, 2021, from corresponding International Application No. PCT/US2021/051217.
Written Opinion of the International Searching Authority, dated Feb. 11, 2022, from corresponding International Application No. PCT/US2021/053518.
Written Opinion of the International Searching Authority, dated Feb. 14, 2022, from corresponding International Application No. PCT/US2021/058274.
Written Opinion of the International Searching Authority, dated Jan. 14, 2019, from corresponding International Application No. PCT/US2018/046949.
Written Opinion of the International Searching Authority, dated Jan. 5, 2022, from corresponding International Application No. PCT/US2021/050497.
Written Opinion of the International Searching Authority, dated Jan. 7, 2019, from corresponding International Application No. PCT/US2018/055772.
Written Opinion of the International Searching Authority, dated Jun. 1, 2022, from corresponding International Application No. PCT/US2022/016930.
Written Opinion of the International Searching Authority, dated Jun. 21, 2017, from corresponding International Application No. PCT/US2017/025600.
Written Opinion of the International Searching Authority, dated Jun. 22, 2022, from corresponding International Application No. PCT/US2022/019358.
Written Opinion of the International Searching Authority, dated Jun. 24, 2022, from corresponding International Application No. PCT/US2022/019882.
Written Opinion of the International Searching Authority, dated Jun. 6, 2017, from corresponding International Application No. PCT/US2017/025605.
Written Opinion of the International Searching Authority, dated Mar. 14, 2019, from corresponding International Application No. PCT/US2018/055736.
Written Opinion of the International Searching Authority, dated Mar. 18, 2022, from corresponding International Application No. PCT/US2022/013733.
Written Opinion of the International Searching Authority, dated Mar. 4, 2019, from corresponding International Application No. PCT/US2018/055773.
Written Opinion of the International Searching Authority, dated Mar. 4, 2019, from corresponding International Application No. PCT/US2018/055774.
Written Opinion of the International Searching Authority, dated May 12, 2022, from corresponding International Application No. PCT/US2022/015929.
Written Opinion of the International Searching Authority, dated May 17, 2022, from corresponding International Application No. PCT/US2022/015241.
Written Opinion of the International Searching Authority, dated May 19, 2022, from corresponding International Application No. PCT/US2022/015637.
Written Opinion of the International Searching Authority, dated Nov. 12, 2021, from corresponding International Application No. PCT/US2021/043481.
Written Opinion of the International Searching Authority, dated Nov. 19, 2018, from corresponding International Application No. PCT/US2018/046939.
Written Opinion of the International Searching Authority, dated Nov. 3, 2021, from corresponding International Application No. PCT/US2021/040893.
Written Opinion of the International Searching Authority, dated Nov. 3, 2021, from corresponding International Application No. PCT/US2021/044910.
Written Opinion of the International Searching Authority, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/043975.
Office Action, dated Oct. 12, 2021, from corresponding U.S. Appl. No. 17/346,509.
Office Action, dated Oct. 14, 2020, from corresponding U.S. Appl. No. 16/927,658.
Office Action, dated Oct. 15, 2018, from corresponding U.S. Appl. No. 16/054,780.
Office Action, dated Oct. 15, 2021, from corresponding U.S. Appl. No. 16/908,081.
Office Action, dated Oct. 16, 2019, from corresponding U.S. Appl. No. 16/557,392.
Office Action, dated Oct. 16, 2020, from corresponding U.S. Appl. No. 16/808,489.
Office Action, dated Oct. 23, 2018, from corresponding U.S. Appl. No. 16/055,961.
Office Action, dated Oct. 25, 2022, from corresponding U.S. Appl. No. 17/836,865.
Office Action, dated Oct. 26, 2018, from corresponding U.S. Appl. No. 16/041,468.
Office Action, dated Oct. 27, 2022, from corresponding U.S. Appl. No. 17/161,159.
Office Action, dated Oct. 8, 2019, from corresponding U.S. Appl. No. 16/552,765.
Office Action, dated Sep. 1, 2017, from corresponding U.S. Appl. No. 15/619,459.
Office Action, dated Sep. 11, 2017, from corresponding U.S. Appl. No. 15/619,375.
Office Action, dated Sep. 11, 2017, from corresponding U.S. Appl. No. 15/619,478.
Office Action, dated Sep. 15, 2021, from corresponding U.S. Appl. No. 16/623,157.
Office Action, dated Sep. 16, 2019, from corresponding U.S. Appl. No. 16/277,715.
Office Action, dated Sep. 16, 2022, from corresponding U.S. Appl. No. 17/306,438.
Office Action, dated Sep. 19, 2017, from corresponding U.S. Appl. No. 15/671,073.
Office Action, dated Sep. 2, 2022, from corresponding U.S. Appl. No. 17/499,624.
Office Action, dated Sep. 22, 2017, from corresponding U.S. Appl. No. 15/619,278.
Office Action, dated Sep. 24, 2021, from corresponding U.S. Appl. No. 17/342,153.
Office Action, dated Sep. 4, 2020, from corresponding U.S. Appl. No. 16/989,086.
Office Action, dated Sep. 5, 2017, from corresponding U.S. Appl. No. 15/619,469.
Office Action, dated Sep. 6, 2017, from corresponding U.S. Appl. No. 15/619,479.
Office Action, dated Sep. 7, 2017, from corresponding U.S. Appl. No. 15/633,703.
Office Action, dated Sep. 8, 2017, from corresponding U.S. Appl. No. 15/619,251.
Office Action, dated Sep. 8, 2022, from corresponding U.S. Appl. No. 17/850,244.
Ex Parte Quayle Action, dated May 10, 2022, from corresponding U.S. Appl. No. 17/668,714.
Restriction Requirement, dated Apr. 10, 2019, from corresponding U.S. Appl. No. 16/277,715.
Restriction Requirement, dated Apr. 12, 2022, from corresponding U.S. Appl. No. 17/584,187.
Restriction Requirement, dated Apr. 13, 2020, from corresponding U.S. Appl. No. 16/817,136.
Restriction Requirement, dated Apr. 24, 2019, from corresponding U.S. Appl. No. 16/278,122.
Restriction Requirement, dated Aug. 7, 2019, from corresponding U.S. Appl. No. 16/410,866.
Restriction Requirement, dated Aug. 9, 2019, from corresponding U.S. Appl. No. 16/404,399.
Restriction Requirement, dated Dec. 17, 2021, from corresponding U.S. Appl. No. 17/475,244.
Restriction Requirement, dated Dec. 31, 2018, from corresponding U.S. Appl. No. 15/169,668.
Restriction Requirement, dated Dec. 9, 2019, from corresponding U.S. Appl. No. 16/565,395.
Restriction Requirement, dated Jan. 18, 2017, from corresponding U.S. Appl. No. 15/256,430.
Restriction Requirement, dated Jul. 28, 2017, from corresponding U.S. Appl. No. 15/169,658.
Restriction Requirement, dated Jun. 15, 2021, from corresponding U.S. Appl. No. 17/187,329.
Restriction Requirement, dated Jun. 15, 2021, from corresponding U.S. Appl. No. 17/222,556.
Restriction Requirement, dated Jun. 9, 2021, from corresponding U.S. Appl. No. 17/222,725.
Restriction Requirement, dated May 5, 2020, from corresponding U.S. Appl. No. 16/808,489.
Restriction Requirement, dated Nov. 10, 2021, from corresponding U.S. Appl. No. 17/366,754.
Restriction Requirement, dated Nov. 14, 2022, from corresponding U.S. Appl. No. 17/836,872.
Restriction Requirement, dated Nov. 15, 2019, from corresponding U.S. Appl. No. 16/586,202.
Restriction Requirement, dated Nov. 21, 2016, from corresponding U.S. Appl. No. 15/254,901.
Restriction Requirement, dated Nov. 5, 2019, from corresponding U.S. Appl. No. 16/563,744.
Restriction Requirement, dated Oct. 17, 2018, from corresponding U.S. Appl. No. 16/055,984.
Restriction Requirement, dated Oct. 6, 2021, from corresponding U.S. Appl. No. 17/340,699.
Written Opinion of the International Searching Authority, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/043976.
Written Opinion of the International Searching Authority, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/043977.
Written Opinion of the International Searching Authority, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/044026.
Written Opinion of the International Searching Authority, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/045240.
Written Opinion of the International Searching Authority, dated Oct. 12, 2017, from corresponding International Application No. PCT/US2017/036888.
Written Opinion of the International Searching Authority, dated Oct. 12, 2018, from corresponding International Application No. PCT/US2018/044046.
Written Opinion of the International Searching Authority, dated Oct. 16, 2018, from corresponding International Application No. PCT/US2018/045243.
Written Opinion of the International Searching Authority, dated Oct. 18, 2018, from corresponding International Application No. PCT/US2018/045249.
Written Opinion of the International Searching Authority, dated Oct. 20, 2017, from corresponding International Application No. PCT/US2017/036917.
Written Opinion of the International Searching Authority, dated Oct. 3, 2017, from corresponding International Application No. PCT/US2017/036912.
Written Opinion of the International Searching Authority, dated Sep. 1, 2017, from corresponding International Application No. PCT/US2017/036896.
Written Opinion of the International Searching Authority, dated Sep. 12, 2018, from corresponding International Application No. PCT/US2018/037504.
Written Opinion of the International Searching Authority, dated Sep. 15, 2021, from corresponding International Application No. PCT/US2021/033631.
Abdullah et al, “The Mapping Process of Unstructured Data to the Structured Data”, ACM, pp. 151-155 (Year: 2013).
Acar, Gunes, et al., The Web Never Forgets, Computer and Communications Security, ACM, Nov. 3, 2014, pp. 674-689.
Aghasian, Erfan, et al., Scoring Users' Privacy Disclosure Across Multiple Online Social Networks,IEEE Access, Multidisciplinary Rapid Review Open Access Journal, Jul. 31, 2017, vol. 5, 2017.
Agosti et al., “Access and Exchange of Hierarchically Structured Resources on the Web with the NESTOR Framework”, IEEE, pp. 659-662 (Year: 2009).
Ahmad et al., “Task-Oriented Access Model for Secure Data Sharing Over Cloud,” ACM, pp. 1-7 (Year: 2015).
Ahmad, et al., “Performance of Resource Management Algorithms for Processable Bulk Data Transfer Tasks in Grid Environments,” ACM, pp. 177-188 (Year: 2008).
Alaa et al., “Personalized Risk Scoring for Critical Care Prognosis Using Mixtures of Gaussian Processes,” Apr. 27, 2017, IEEE, vol. 65, issue 1, pp. 207-217 (Year: 2017).
Ali et al., “Age Estimation from Facial Images Using Biometric Ratios and Wrinkle Analysis,” IEEE, 2015, pp. 1-5 (Year: 2015).
Alkalha et al., “Investigating the Effects of Human Resource Policies on Organizational Performance: An Empirical Study on Commercial Banks Operating in Jordan,” European Journal of Economics, Finance and Administrative Science, pp. 1-22 (Year: 2012).
Aman et al., “Detecting Data Tampering Attacks in Synchrophasor Networks using Time Hopping,” IEEE, pp. 1-6 (Year: 2016).
Amar et al., “Privacy-Aware Infrastructure for Managing Personal Data,” ACM, pp. 571-572, Aug. 22-26, 2016 (Year: 2016).
Antunes et al., “Preserving Digital Data in Heterogeneous Environments”, ACM, pp. 345-348, 2009 (Year: 2009).
Ardagna, et al., “A Privacy-Aware Access Control System,” Journal of Computer Security, 16:4, pp. 369-397 (Year: (2008).
Avepoint, AvePoint Privacy Impact Assessment 1: User Guide, Cumulative Update 2, Revision E, Feb. 2015, AvePoint, Inc.
Ball, et al., “Aspects of the Computer-Based Patient Record,” Computers in Healthcare, Springer-Verlag New York Inc., pp. 1-23 (Year: 1992).
Banerjee et al., “Link Before You Share: Managing Privacy Policies through Blockchain,” IEEE, pp. 4438-4447 (Year: 2017).
Bansal et al., “Integrating Big Data: A Semantic Extract-Transform-Load Framework,” IEEE, pp. 42-50 (Year: 2015).
Bao et al., “Performance Modeling and Workflow Scheduling of Microservice-Based Applications in Clouds,” IEEE Transactions on Parallel and Distributed Systems, vol. 30, No. 9, Sep. 2019, pp. 2101-2116 (Year: 2019).
Barker, “Personalizing Access Control by Generalizing Access Control,” ACM, pp. 149-158 (Year: 2010).
Barr, “Amazon Rekognition Update—Estimated Age Range for Faces,” AWS News Blog, Feb. 10, 2017, pp. 1-5 (Year: 2017).
Bayardo et al., “Technological Solutions for Protecting Privacy,” Computer 36.9 (2003), pp. 115-118, (Year: 2003).
Berezovskiy et al., “A framework for dynamic data source identification and orchestration on the Web”, ACM, pp. 1-8 (Year: 2010).
Bertino et al., “On Specifying Security Policies for Web Documents with an XML-based Language,” ACM, pp. 57-65 (Year: 2001).
Bertino et al., “Towards Mechanisms for Detection and Prevention of Data Exfiltration by Insiders,” Mar. 22, 2011, ACM, pp. 10-19 (Year: 2011).
Bhargav-Spantzel et al., Receipt Management-Transaction History based Trust Establishment, 2007, ACM, p. 82-91.
Bhuvaneswaran et al., “Redundant Parallel Data Transfer Schemes for the Grid Environment”, ACM, pp. 18 (Year: 2006).
Bieker, et al., “Privacy-Preserving Authentication Solutions—Best Practices for Implementation and EU Regulatory Perspectives,” Oct. 29, 2014, IEEE, pp. 1-10 (Year: 2014).
Bin, et al., “Research on Data Mining Models for the Internet of Things,” IEEE, pp. 1-6 (Year: 2010).
Bindschaedler et al., “Privacy Through Fake Yet Semantically Real Traces,” arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, May 27, 2015 (Year: 2015).
Bjorn Greif, “Cookie Pop-up Blocker: Cliqz Automatically Denies Consent Requests,” Cliqz.com, pp. 1-9, Aug. 11, 2019 (Year: 2019).
Borgida, “Description Logics in Data Management,” IEEE Transactions on Knowledge and Data Engineering, vol. 7, No. 5, Oct. 1995, pp. 671-682 (Year: 1995).
Brandt et al, “Efficient Metadata Management in Large Distributed Storage Systems,” IEEE, pp. 1-9 (Year: 2003).
Bujlow et al, “Web Tracking: Mechanisms, Implications, and Defenses,” Proceedings of the IEEE, Aug. 1, 2017, vol. 5, No. 8, pp. 1476-1510 (Year: 2017).
Byun, Ji-Won, Elisa Bertino, and Ninghui Li. “Purpose based access control of complex data for privacy protection.” Proceedings of the tenth ACM symposium on Access control models and technologies. ACM, 2005. (Year: 2005).
Carminati et al., “Enforcing Access Control Over Data Streams,” ACM, pp. 21-30 (Year: 2007).
Carpineto et al., “Automatic Assessment of Website Compliance to the European Cookie Law with CoolCheck,” Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society, 2016, pp. 135-138 (Year: 2016).
Related Publications (1)
Number Date Country
20230046469 A1 Feb 2023 US
Provisional Applications (1)
Number Date Country
63176185 Apr 2021 US
Continuations (1)
Number Date Country
Parent 17722551 Apr 2022 US
Child 17977285 US