IP Library Granted Patent US 11,940,980
Granted Patent B2
US 11,940,980 · App. 17/062,774 · Granted Mar 26, 2024

Methods and systems for predictive clinical planning and design

Inventors: Donald R. Harder (Fishers, IN); Daniel D. Siders (Westfield, IN); Leslie Thomas (Indianapolis, IN); Sara L. Zembrodt (Indianapolis, IN)
Assignee: IQVIA Inc.
G06F16/2365G06F16/248G06F17/10G06F40/14G06F40/166G06T11/206G06T2200/24G16H10/20G16H10/60G16H40/63
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,940,980
App. No.
17/062,774
Granted
Mar 26, 2024
Kind
B2
Abstract

One example method for predictive clinical planning and design includes instantiating a plurality of data objects, each data object of the plurality of data objects comprising clinical trial information; displaying a graphical user interface on one or more display screens, the graphical user interface providing a graphical representation of at least a portion of a clinical trial and comprising a plurality of graphical nodes; receiving a selection of the second graphical node; receiving, via an editor associated with the second graphical node, a modification of the second data object; propagating an indication of the modification to the first data object, the propagation modifying a clinical trial data item of the first data object; and displaying, within the first graphical node, the modified clinical trial data item of the first data object.

Claims (63)

1. A computer-implemented method, the method comprising:

defining, on a computer, a graphical connection between, a source node selected from a hierarchically connected plurality of nodes and a destination node selected from the hierarchically connected plurality of nodes, each representing data objects of a plurality of data objects that include one or more data items;

presenting, on the computer, at least a portion of a clinical trial using a context map comprising one or more of the hierarchically connected plurality of nodes connected to each other and forming a plurality of preceding nodes and one or more sub-nodes, wherein the data objects represented by each of the plurality of preceding nodes reference or are referenced by the data objects represented by the one or more sub-nodes, and the one or more data items are modifiable within the plurality of nodes;

determining whether one of the one or more data items represents a patient population that satisfies a threshold;

propagating, based on the determination that the one of the one or more data items represents the patient population with the satisfied threshold and on a selected propagation direction through the graphical connection of the source node and the destination node, the one or more data items of the source node to the destination node within the context map through the graphical connection of the source node and the destination node, wherein an error is generated at the destination node when a precondition associated with the one or more propagated data items is not met;

selecting a first node of the plurality of nodes;

modifying the one or more data items of the respective data object of the selected first node;

propagating the modification to the one or more data items of at least one of the plurality of preceding nodes and at least one of the one or more sub-nodes of the first node such that the propagation modifies the one or more data items;

defining an action to be executed on the one or more propagated data items at the destination node, wherein the action comprises a comparison between the one or more propagated data items and the one or more data items of the destination node; and

updating the context map based on a change in the data items of the first node.

2. The computer-implemented method of claim 1 , further comprising a step of creating the graphical connection between the source node and the destination node by selecting:

the source node from the plurality of nodes; and

the destination node from the plurality of nodes, wherein the graphical connection is created by selecting a create option.

3. The computer-implemented method of claim 1 , further comprising a step of deleting the graphical connection between the source node and the destination node by selecting:

the source node from the plurality of nodes; and

the destination node from the plurality of nodes, wherein the graphical connection is deleted by selecting a delete option.

4. The computer-implemented method of claim 1 , wherein the action further comprises an addition of the one or more propagated data items and the one or more data items of the destination node.

5. The computer-implemented method of claim 1 , further comprising a step of integrating the one or more propagated data items within the destination node, wherein the one or more propagated data items are integrated as one of, a constraint on a functionality provided in the destination node, a sub-component of a higher-level data item, or a combination thereof.

6. The computer-implemented method of claim 1 , further comprising a step of dynamically updating the one or more data items associated with the one or more sub-nodes of the first node based on a change made in the one or more sub-nodes of a second node selected from the plurality of nodes.

7. The computer-implemented method of claim 6 , further comprising a step of dynamically updating the second node based on the change in the data items of the one or more sub-nodes of the first node.

8. The computer-implemented method of claim 1 , further comprising a step of generating a burden score representing an overall burden of a trial candidate on a patient, wherein the generated burden score is displayed through a graphical representation when at least one of the one or more sub-nodes of one of the plurality of nodes is selected, wherein the sub-node is a schedule of events node.

9. The computer-implemented method of claim 1 , further comprising:

selecting a data item within the destination node.

10. The computer-implemented method of claim 9 , further comprising:

comparing one or more of the propagated data items to the selected data item within the destination node.

11. A computer program product on a computing device comprising a tangible storage medium encoded with processor-readable instructions that, when executed by one or more processors, enable the computer program product to:

define a graphical connection between, a source node of a hierarchically connected plurality of nodes and a destination node of the hierarchically connected plurality of nodes, each representing data objects of a plurality of data objects that include one or more data items;

present, on a computing device, at least a portion of a clinical trial using a context map comprising one or more of the hierarchically connected plurality of nodes connected to each other and forming a plurality of preceding nodes and one or more sub-nodes, wherein the data objects represented by each of the plurality of preceding nodes reference or are referenced by the data objects represented by the one or more sub-nodes, and the one or more data items are modifiable within the plurality of nodes;

determine whether one of the one or more data items represents a patient population that satisfies a threshold;

propagate, based on the determination that the one of the one or more data items represent the patient population with the satisfied threshold and on a selected propagation direction through the graphical connection of the source node and the destination node, the one or more data items of the source node to the destination node within the context map through the graphical connection of the source node and the destination node;

generate an error at the destination node when a precondition associated with the one or more propagated data items is not met;

selecting a first node of the plurality of nodes;

modify the one or more data items of the respective data object of the selected first node;

propagate the modification to the one or more data items of at least one of the plurality of preceding nodes and at least one of the one or more sub-nodes of the first node such that the propagation modifies the one or more data items;

define an action to be executed on the one or more propagated data items at the destination node, wherein the action comprises a comparison between the one or more propagated data items and the one or more data items of the destination node; and

update the context map based on a change in the data items of the first node.

12. The computer program product of claim 11 , further comprising a step to create the graphical connection between the source node and the destination node by selecting:

the source node from the plurality of nodes; and

the destination node from the plurality of nodes, wherein the graphical connection is created by selecting a create option.

13. The computer program product of claim 11 , further comprising a step to delete the graphical connection between the source node and the destination node by selecting:

the source node from the plurality of nodes; and

the destination node from the plurality of nodes, wherein the graphical connection is deleted by selecting a delete option.

14. The computer program product of claim 11 , further comprising a step to integrate the one or more propagated data items within the destination node, wherein the one or more propagated data items are integrated as one of, a constraint on a functionality provided in the destination node, a sub-component of a higher-level data item, or a combination thereof.

15. The computer program product of claim 11 , further comprising a step to dynamically update the one or more data items associated with the one or more sub-nodes of the first node based on a change made in the one or more sub-nodes of a second node selected from the plurality of nodes.

16. The computer program product of claim 15 , further comprising a step to dynamically update the second node based on the change in the data items of the one or more sub-nodes of the first node.

17. The computer program product of claim 11 , further comprising a step to generate a burden score representing an overall burden of a trial candidate on a patient, wherein the generated burden score is displayed through a graphical representation when at least one of the one or more sub-nodes of one of the plurality of nodes is selected, wherein the sub-node is a schedule of events node.

18. A system comprising:

a processor in communication with a memory, storing computer executable instructions, wherein the processor is configured to:

define a graphical connection between, a source node of a hierarchically connected plurality of nodes and a destination node of the hierarchically connected plurality of nodes, each representing data objects of a plurality of data objects that include one or more data items;

present, on a computing device, at least a portion of a clinical trial using a context map comprising one or more of the plurality of nodes of the hierarchically connected plurality of nodes to each other and forming a plurality of preceding nodes and one or more sub-nodes, wherein the data objects represented by each of the plurality of preceding nodes reference or are referenced by the data objects represented by the one or more sub-nodes, and the one or more data items are modifiable within the plurality of nodes;

determine whether one of the one or more data items represent a patient population with a satisfied threshold;

propagate, based on the determination that the one of the one or more data items represent the patient population with the satisfied threshold and on a selected propagation direction through the graphical connection of the source node and the destination node, the one or more data items of the source node to the destination node through the plurality of nodes connected through the graphical connection in the context map;

generate an error at the destination node when a precondition associated with the one or more propagated data items is not met;

select a first node of the plurality of nodes;

modify the one or more data items of the respective data object of the selected first node;

propagate the modification to the one or more data items of at least one of the plurality of preceding nodes and at least one of the one or more sub-nodes of the first node such that the propagation modifies the one or more data items;

define an action to be executed on the one or more propagated data items at the destination node, wherein the action comprises a comparison between the one or more propagated data items and the one or more data items of the destination node; and

update the context map based on a change in the data items of the first node.

19. The system of claim 18 , wherein the processor is further configured to integrate the one or more propagated data items within the destination node, wherein the one or more propagated data items are integrated as one of, a constraint on a functionality provided in the destination node, a sub-component of a higher-level data item, or a combination thereof.

20. The system of claim 18 , wherein the processor is further configured to generate a burden score representing an overall burden of a trial candidate on a patient, wherein the generated burden score is displayed through a graphical representation when at least one of the one or more sub-nodes of one of the plurality of nodes is selected, wherein the sub-node is a schedule of events node.

21. The system of claim 18 , further comprising a step of:

dynamically updating the one or more data items associated with the one or more sub-nodes of the first node based on a change made in the one or more sub-nodes of a second node selected from the plurality of nodes; and

dynamically updating the second node based on a change in the data items of the one or more sub-nodes of the first node.

Assignments (10)
SECURITY INTEREST Recorded Mar 12, 2026
From: IMS SOFTWARE SERVICES LTD.; IQVIA INC.; IQVIA RDS INC.; RULES-BASED MEDICINE, INC.
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 075047/0061 →
CORRECTIVE ASSIGNMENT TO CORRECT THE CONVEYING PARTIES INADVERTENTLY NOT INCLUDED IN FILING PREVIOUSLY RECORDED AT REEL: 065709 FRAME: 618. ASSIGNOR(S) HEREBY CONFIRMS THE SECURITY AGREEMENT. Recorded Dec 6, 2023
From: IQVIA INC.; IQVIA RDS INC.; IMS SOFTWARE SERVICES LTD.; Q SQUARED SOLUTIONS HOLDINGS LLC
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION
Reel/Frame 065790/0781 →
SECURITY INTEREST Recorded Nov 29, 2023
From: IQVIA INC.; IQVIA RDS INC.; IMS SOFTWARE SERVICES LTD.; Q SQUARED SOLUTIONS HOLDINGS LLC
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION
Reel/Frame 065710/0253 →
SECURITY INTEREST Recorded Nov 29, 2023
From: IQVIA INC.
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION
Reel/Frame 065709/0618 →
SECURITY INTEREST Recorded Jul 12, 2023
From: IQVIA INC.; IMS SOFTWARE SERVICES, LTD.
To: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 064258/0577 →
SECURITY INTEREST Recorded May 24, 2023
From: IQVIA INC.; IQVIA RDS INC.; IMS SOFTWARE SERVICES LTD.; Q SQUARED SOLUTIONS HOLDINGS LLC
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION
Reel/Frame 063745/0279 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 5, 2020
From: THOMAS, LESLIE; ZEMBRODT, SARA L.
To: QUINTILES IMS INCORPORATED
Reel/Frame 053971/0757 →
MERGER Recorded Oct 5, 2020
From: QUINTILES TRANSNATIONAL CORP.; IMS HEALTH INCORPORATED
To: QUINTILES IMS INCORPORATED
Reel/Frame 053993/0724 →
CHANGE OF NAME Recorded Oct 5, 2020
From: QUINTILES IMS INCORPORATED
To: IQVIA INC.
Reel/Frame 053979/0848 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 5, 2020
From: HARDER, DONALD R.; SIDERS, DANIEL D.
To: QUINTILES TRANSNATIONAL CORPORATION
Reel/Frame 053971/0800 →