Dynamic offset well analysis
US-2024419739-A1 · Dec 19, 2024 · US
US11727059B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11727059-B2 |
| Application number | US-201816980234-A |
| Country | US |
| Kind code | B2 |
| Filing date | Mar 14, 2018 |
| Priority date | Mar 14, 2018 |
| Publication date | Aug 15, 2023 |
| Grant date | Aug 15, 2023 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
To enable a user to easily recognize temporal order of elements included in a retrieval sentence, a retrieval sentence utilization device 10 includes: a retrieval sentence division unit 11 for dividing a retrieval sentence into a plurality of retrieval contents each of which includes an event; and a directed graph generation unit 12 for generating, from each of the retrieval contents, a subtree in which the event is an edge and a source of the event and an object of the event are nodes, and integrating a plurality of subtrees generated from the retrieval contents to generate a directed graph, wherein the directed graph generation unit 12 places the plurality of subtrees in the directed graph according to occurrence order of events corresponding to the plurality of subtrees.
Opening claim text (preview).
The invention claimed is: 1. A retrieval sentence utilization device comprising: a memory storing instructions; and one or more processors configured to execute the instructions to: divide a retrieval sentence into a plurality of retrieval contents each of which includes an event; and generate, from respective retrieval contents, subtrees each of which includes an edge as the event and includes nodes as a source of the event and an object of the event, and integrate the subtrees into a directed graph, wherein when generating the subtrees, the one or more processors place the subtrees in the directed graph according to occurrence order of events corresponding to the subtrees, wherein the one or more processors are further configured to execute the instructions to: unify a plurality of directed graphs; segment each of the plurality of directed graphs into subtrees; compare events corresponding to subtrees obtained by segmenting one of the plurality of directed graphs and events corresponding to subtrees obtained by segmenting an other one of the plurality of directed graphs; and generate a new directed graph by integrating at least common subtrees in corresponding event. 2. The retrieval sentence utilization device according to claim 1 , wherein the one or more processors place, in the directed graph, a node corresponding to an object of an event that occurs later relative to a node corresponding to an object of an event that occurs earlier in such a way that it is possible to identify the later occurring event occurs after the earlier occurring event occurs. 3. The retrieval sentence utilization device according to claim 1 , wherein the one or more processors are further configured to execute the instructions to: segment the directed graph into the subtrees, determine the occurrence order of the events corresponding to the subtrees from placement positions of the subtrees in the directed graph, and reconstruct the retrieval contents from the subtrees with reference to the occurrence order of the events. 4. The retrieval sentence utilization device according to claim 1 , further comprising: a storage for storing the generated directed graph; wherein the one or more processors are further configured to execute the instructions to display the directed graph stored in the directed graph storage means, on a display device so as to be selectable by a user. 5. The retrieval sentence utilization device according to claim 1 , wherein the one or more processors regard the directed graphs generated by unifying at least common subtrees in corresponding event as candidates for the new directed graph, and then designate the candidate which does not include a loop as the new directed graph. 6. The retrieval sentence utilization device according to claim 1 , wherein the one or more processors are further configured to execute the instructions to extract, from the directed graph, a parameter displayed on a display device together with a result of retrieval using the retrieval sentence corresponding to the directed graph, with reference to one or more parameters of the source of the event and one or more parameters of the object of the event. 7. The retrieval sentence utilization device according to claim 1 , wherein each node in the directed graph corresponds to any of a file, a process, and a communication destination, and wherein each edge in the directed graph corresponds to any of file access operation, start or end of a process, and communication operation. 8. A computer-implemented retrieval sentence utilization method comprising: dividing a retrieval sentence into a plurality of retrieval contents each of which includes an event; and generating, from each of the retrieval contents, a subtree in which the event is an edge and a source of the event and an object of the event are nodes, and integrating a plurality of subtrees generated from the retrieval contents to generate a directed graph, wherein, when generating the directed graph, the plurality of subtrees are placed in the directed graph according to occurrence order of events corresponding to the plurality of subtrees, wherein the method further comprises: unifying a plurality of directed graphs; segmenting each of the plurality of directed graphs into subtrees; comparing events corresponding to subtrees obtained by segmenting one of the plurality of directed graphs and events corresponding to subtrees obtained by segmenting an other one of the plurality of directed graphs; and generating a new directed graph by integrating at least common subtrees in corresponding event. 9. The computer-implemented retrieval sentence utilization method according to claim 8 , wherein, when generating the directed graph, a node corresponding to an object of an event that occurs later is placed in the directed graph relative to a node corresponding to an object of an event that occurs earlier in such a way that it is possible to identify the later occurring event occurs after the earlier occurring event occurs. 10. A non-transitory computer readable information recording medium storing retrieval sentence utilization program for causing a computer to execute: dividing a retrieval sentence into a plurality of retrieval contents each of which includes an event; and generating, from each of the retrieval contents, a subtree in which the event is an edge and a source of the event and an object of the event are nodes, and integrating a plurality of subtrees generated from the retrieval contents to generate a directed graph, wherein, when generating the directed graph, the computer is caused to execute placing the plurality of subtrees in the directed graph according to occurrence order of events corresponding to the plurality of subtrees, wherein the computer executes: unifying a plurality of directed graphs; segmenting each of the plurality of directed graphs into subtrees; comparing events corresponding to subtrees obtained by segmenting one of the plurality of directed graphs and events corresponding to subtrees obtained by segmenting an other one of the plurality of directed graphs; and generating a new directed graph by integrating at least common subtrees in corresponding event. 11. The computer readable information recording medium according to claim 9 , wherein the program causes the computer to, when generating the directed graph, execute placing, in the directed graph, a node corresponding to an object of an event that occurs later relative to a node corresponding to an object of an event that occurs earlier in such a way that it is possible to identify the later occurring event occurs after the earlier occurring event occurs. 12. The retrieval sentence utilization device according to claim 2 , wherein the one or more processors are further configured to execute the instructions to: segment the directed graph into the subtrees, determine the occurrence order of the events corresponding to the subtrees from placement positions of the subtrees in the directed graph, and reconstruct the retrieval contents from the subtrees with reference to the occurrence order of the events. 13. The retrieval sentence utilization device according to claim 2 , further comprising: a storage for storing the generated directed graph; wherein the one or more processors are further configured to execute the instructions to display the directed graph stored in the directed graph storage means, on a display device so as to be selectable by a user. 14. The retrieval sentence utilization device according to claim 3 , further comprising: a storage for storing the generated directed graph; w
Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title
Selection of displayed objects or displayed text elements (G06F3/0482 takes precedence) · CPC title
Entity relationship models · CPC title
Trees · CPC title
Selection or weighting of terms from queries, including natural language queries · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.