GRAPHICALLY BASED HIERARCHICAL METHOD FOR DOCUMENTING ITEMS OF EVIDENCE GENEALOGY

• US 20120174001A1
• Filed: 12/31/2010
• Published: 07/05/2012
• Est. Priority Date: 12/31/2010
• Status: Abandoned Application

• Current Assignee: Abbott Informatics Corp. (Abbott Laboratories)
• Original Assignee: Abbott Informatics Corp. (Abbott Laboratories)
• Inventors: Friedman, Itschak, Gall, Robin
• Application Number:
  US12/983,171
• Publication Number:
  US 20120174001A1
• Time in Patent Office: Days
• US Class Current: 715/763
• CPC Class Codes: G06Q 10/08 Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
• CPC Class Codes: G06T 11/206 Drawing of charts or graphs

Abstract

A computer readable memory medium comprising program instructions for documenting an evidence packaging structure is provided. The program instructions are executable by a processor to generate a graphical diagram in response to user input. The graphical diagram includes a root node representing an outermost evidence storage unit, and a leaf node of the root node representing an item of evidence, wherein the item of evidence is located within the evidence storage unit.

Claims

1. A computer readable memory medium comprising program instructions for documenting an evidence packaging structure, wherein the program instructions are executable by a processor to:

generate a graphical diagram in response to user input, wherein the graphical diagram includes;

a root node representing an outermost evidence storage unit; and

a leaf node of the root node representing an item of evidence, wherein the item of evidence is located within the evidence storage unit.

2. The computer readable memory medium of claim 1 further comprising program instructions executable by a processor to display the graphical diagram, wherein each of the root node and the leaf node are represented by icons, and wherein each icon is either a representative image or an actual image of the evidence storage unit or the item of evidence.

3. The computer readable memory medium of claim 1 further comprising program instructions executable by a processor to:

ping a leaf node in response to user input, wherein upon pinging the leaf node, the leaf node displays a pinged icon; and

link a pinged leaf node to an exhibit grid, wherein the exhibit grid provides further information about the item of evidence represented by the pinged leaf node.

4. The computer readable memory medium of claim 3, wherein the exhibit grid is a tabular representation of every pinged leaf node.

5. The computer readable memory medium of claim 3, wherein the exhibit grid provides a description, repackaging information, and item routing information for the item of evidence represented by the pinged leaf node.

6. The computer readable memory medium of claim 1 further comprising program instructions executable by a processor to prompt a user to input a number of leaf nodes which are linked to a selected parent node or root node.

7. The computer readable memory medium of claim 1, wherein the graphical diagram includes a leaf node of the root node representing an additional storage unit located within the evidence storage unit.

8. A method for documenting an evidence packaging structure, comprising:

inputting structural information for an outermost evidence storage unit and each interior evidence storage unit and each item of evidence within the outermost evidence storage unit into a computer readable memory medium; and

accessing computer readable memory medium and generating, using a processor, a graphical diagram in response to the structural information, wherein the graphical diagram includes;

a root node representing the outermost evidence storage unit; and

a leaf node of the root node representing each item evidence within the outermost evidence storage.

9. The method of claim 8 further comprising displaying the graphical diagram, wherein each of the root node and the leaf node are represented by icons, and wherein each icon is either a representative image or an actual image of the evidence storage unit or the item of evidence.

10. The method of claim 8 further comprising:

pinging a leaf node in response to user input, wherein upon pinging the leaf node, the leaf node displays a pinged icon; and

link a pinged leaf node to an exhibit grid, wherein the exhibit grid provides further information about the item of evidence represented by the pinged leaf node.

11. The method of claim 10, wherein the exhibit grid is a tabular representation of every pinged leaf node.

12. The method of claim 10, wherein the exhibit grid provides a description, repackaging information, and item routing information for the item of evidence represented by the pinged leaf node.

13. The method of claim 8 further comprising prompting a user to input a number of leaf nodes which are linked to a selected parent node or root node.

14. A laboratory information management system for documenting an evidence packaging structure, comprising:

a computer readable memory medium; and

at least one processor operable to access from the computer readable memory medium program instructions executable by the processor to;

receive structural information input by a user into the computer readable memory medium, the structural information describing the relationship between an outermost evidence storage unit and each interior evidence storage unit and each item of evidence within the outermost evidence storage unit,

access the computer readable memory medium to retrieve the structural information, and

generate a graphical diagram in response to the structural information, wherein the graphical diagram includes a root node representing the outermost evidence storage unit and a leaf node of the root node representing each item evidence within the outermost evidence storage.

15. The system of claim 14, wherein the at least one processor is operable to access from the computer readable memory medium program instructions executable by the processor to display the graphical diagram, wherein each of the root node and the leaf node are represented by icons, and wherein each icon is either a representative image or an actual image of the evidence storage unit or the item of evidence.

16. The system of claim 14, wherein the at least one processor is operable to access from the computer readable memory medium program instructions executable by the processor to:

ping a leaf node in response to user input, wherein upon pinging the leaf node, the leaf node displays a pinged icon; and

link a pinged leaf node to an exhibit grid, wherein the exhibit grid provides further information about the item of evidence represented by the pinged leaf node.

17. The system of claim 16, wherein the exhibit grid is a tabular representation of every pinged leaf node.

18. The system of claim 16, wherein the exhibit grid provides a description, repackaging information, and item routing information for the item of evidence represented by the pinged leaf node.

19. The system of claim 14, wherein the at least one processor is operable to access from the computer readable memory medium program instructions executable by the processor to prompt a user to input a number of leaf nodes which are linked to a selected parent node or root node.

20. The system of claim 14, wherein the graphical diagram includes a leaf node of the root node representing an additional storage unit located within the evidence storage unit.