초록 ▼

A health diagnostic system capable for monitoring the health condition of computing device on a network is disclosed. According to one aspect of the present invention, a computing device is installed a module that can provoke the monitoring process that periodically samples values representing the h

A health diagnostic system capable for monitoring the health condition of computing device on a network is disclosed. According to one aspect of the present invention, a computing device is installed a module that can provoke the monitoring process that periodically samples values representing the health condition of the computing device. The sampled values are then sent back to the monitoring server for analysis. Meanwhile a monitoring server receives the sampled values and performs data analysis to determine if the computing device is in a good/poor condition based on historic data that are further used to predicate what the remaining time is for the computing device to actually break down so that necessary measures may be taken to prevent an actual breakdown.

대표청구항 ▼

A health diagnostic system capable for monitoring the health condition of computing device on a network is disclosed. According to one aspect of the present invention, a computing device is installed a module that can provoke the monitoring process that periodically samples values representing the h

A health diagnostic system capable for monitoring the health condition of computing device on a network is disclosed. According to one aspect of the present invention, a computing device is installed a module that can provoke the monitoring process that periodically samples values representing the health condition of the computing device. The sampled values are then sent back to the monitoring server for analysis. Meanwhile a monitoring server receives the sampled values and performs data analysis to determine if the computing device is in a good/poor condition based on historic data that are further used to predicate what the remaining time is for the computing device to actually break down so that necessary measures may be taken to prevent an actual breakdown. y area, display the first child node of the first parent node in a second position of the display area, the second position being adjacent the first position, display the second child node of the first parent node in the display area, receive a first instruction to scroll at least the second child node in a direction toward the first position, display the second child node in the second position, display a second parent node in the display area; receive a second instruction to scroll at least the second parent node in the direction toward the first position; and display the second parent node in the first position, each parent node having a separate subordinate data descriptor displayed therewith, as well as a separate master scroll bar associated with the entire hierarchical data structure. 6. A computer readable medium storing a plurality of instructions adapted to be executed by a processor to scroll a displayed hierarchical data structure including a first parent node and a plurality of child nodes of the first parent node, the plurality of child nodes including a first child node and a second child node, and a second parent node and at least one child node of the second parent node, the plurality of instructions comprising instructions to: display the first parent node in a first position of a display area, display the first child node of the first parent node in a second position of the display area, the second position being adjacent the first position, display the second child node of the first parent node in the display area, receive a first instruction to scroll at least the second child node in a direction toward the first position, display the second child node in the second position, display a second parent node in the display area; receive a second instruction to scroll at least the second parent node in the direction toward the first position; and display the second parent node in the first position, each parent node having a separate subordinate data descriptor displayed therewith, as well as a separate master scroll bar associated with the entire hierarchical data structure. ninger et al.; US-5327543, 19940700, Miura et al.; US-5388233, 19950200, Hays et al.; US-5438668, 19950800, Coon et al.; US-5488710, 19960100, Sato et al.; US-5513330, 19960400, Stiles; US-5586276, 19961200, Grochowski et al.; US-5589991, 19961200, Bleier; US-5598546, 19970100, Blomgren; US-5608887, 19970300, Dinkjian et al.; US-5680564, 19971000, Divivier et al.; US-5729725, 19980300, Kato et al., 712/224; US-5748978, 19980500, Narayan et al.; US-5758114, 19980500, Johnson et al.; US-5781789, 19980700, Narayan; US-5826071, 19981000, Narayan; US-5935239, 19990800, Narayan; US-5995748, 19991100, Guttag et al., 712/221; US-6098087, 20000800, Lemay, 708/209; US-6098163, 20000800, Guttag et al., 712/020 is itself a parent node having at least one child node selected from the group consisting of interior nodes and leaf nodes; and the leaf node is a child node that has no children and the leaf node has a parent node selected from the group consisting of root nodes and interior nodes. 3. The method of claim 2 further comprising computing a parent node score by combining the data item scores for all its child nodes.4. The method of claim 3 further comprising assigning an identifier to each parent node.5. The method of claim 2 further comprising a schema having a hierarchy, wherein the schema defines a hierarchy of parent and child nodes within a set of hierarchical documents and an organization of the set of hierarchical documents.6. The method of claim 5 further comprising a node label assigned to each node in the schema.7. The method of claim 5 further comprising, converting at least one document into at least one hierarchical document having root, interior and leaf nodes, wherein said root, interior and leaf nodes correspond to the schema.8. The method of claim 7 wherein the converting comprises allowing a user to map between the schema and documents in a preexisting database to form the set of hierarchical documents.9. The method of claim 8 wherein the preexisting database is a relational database.10. The method of claim 5 further comprising, converting at least one document into at least one hierarchical document having at least one root node and at least one leaf node, wherein said root and leaf nodes correspond to the schema.11. The method of claim 5 wherein the schema is defined by a user.12. The method of claim 5 wherein the schema is retrieved from a database containing stored schemas.13. The method of claim 5 wherein the schema further comprises: a. a scoring method for calculating a leaf node score for each leaf node; b. a weighting algorithm for calculating a parent node score for each leaf node when the parent node contains more than one leaf node; c. a parent score computing algorithm for computing the similarity score of the parent node using the leaf node scores and the weighting algorithm. 14. The method of claim 2 further comprising computing an interior node score for all interior nodes by combining the scores for all the child nodes of the interior nodes.15. The method of claim 14 further comprising computing a root node score by combining the interior node scores for the children of the root node.16. The method of claim 1 wherein the context for a node is its position in the schema.17. The method of claim 1 wherein the context for a node is the set of node labels that comprise its position in the schema.18. The method of claim 1 further comprising: reserving space in a score buffer for each assigned unique identifier; and associating the score for the data item for each assigned unique identifier with its reserved space in the score buffer. 19. The method of claim 18 wherein the score buffer is indexed by the data item's assigned unique identifier.20. The method of claim 18 wherein the assigned unique identifier serves as an index to the data item.21. The method of claim 20 further comprising identifying the child nodes belonging to each parent node.22. The method of claim 21 wherein the identifying comprises associating the data item's assigned unique identifier for each leaf node with its parent's assigned identifier and saving a resulting association.23. The method of claim 22 wherein the resulting association is stored in a relation band.24. The method of claim 21 wherein the identifying comprises associating the child node with its parent node.25. A computer-readable data transmission medium containing an association between parent and child nodes as recited in claim 24.26. The method of claim 18 wherein the assigned unique identifier is the same for all identical data items for a selected context within the hierarchical database.27. The method of claim 26 wherein the context is selecte d from the group consisting of its position in the schema and the set of node labels.28. The method of claim 18 wherein the data item score is a number that represents how similar and dissimilar the data item is to the search criteria.29. The method of claim 28 wherein the number representing the data item score is assigned based on a method selected from the group consisting of an algorithmic scoring method and a non-algorithmic scoring method.30. The method of claim 29 wherein if the scoring method is a non-algorithmic scoring method and if the data item does not match the search criteria, assigning as the data item score a value that represents a neutral score.31. The method of claim 29 wherein if a non-algorithmic scoring method is chosen generates a set of data values along with data item scores.32. The method of claim 31 wherein if a data item occurs within this set, the data item's unique identifier is associated with its corresponding score.33. The method of claim 32 wherein the non-algorithmic scoring method uses a user-defined table of data items, their corresponding synonyms and their scores.34. The method of claim 31 wherein if the data items are not in this set, the data items are assigned a neutral score.35. The method of claim 1 further comprising: a. for all the data items in the set of hierarchical documents, organizing each data item in a data band according to its position in the schema and associating each data item's assigned unique identifier with the data item and storing the association in the data band; and b. for each child node in the set of hierarchical documents, linking each node with its parent node using a relation band according to its position in the schema, where the parent node is selected from the group consisting of interior nodes and root nodes. 36. The method of claim 35 wherein computing a data item score comprises calculating a leaf node score for each data item within each leaf node, combining all the data item scores within the leaf node into an overall leaf node score and saving the overall node score as the leaf node score.37. The method of claim 36 wherein the leaf node score is saved in a leaf score buffer.38. The method of claim 37 further comprising indexing the leaf score buffer by the data item's assigned unique identifier.39. The method of claim 36 further comprising using the assigned unique identifier as an index to the data item.40. The method of claim 36 further comprising: a. using the saved leaf node scores, selecting a parent node as the current parent node and calculating a current parent node score for all leaf nodes that have the same parent using a parent score computing algorithm and saving the current parent node score; b. if the current parent node is a root node, saving the parent node score as a final similarity search score and processing ends; and c. if the current parent node is an interior node: i. saving the current parent node score as an interior node score;ii. setting the current parent node to the parent of the interior node;iii. using the saved interior node scores, calculating the parent node score for all interior nodes that have the same parent using a parent score computing algorithm; andiv. repeating steps b and c until the current parent node is a root node.41. The method of claim 40 further comprising making the final similarity score available for display.42. The method of claim 40 further comprising associating the leaf and interior nodes with their parent nodes using the relation band.43. The method of claim 40 wherein the parent score computing algorithm comprises determining the weight to be given to each leaf node score in calculating the current parent node score.44. The method of claim 40 wherein the parent score computing algorithm is selected from the group consisting of single best, greedy sum, overall sum, greedy minimum, overall minimum and overall maximum.45. Computer-readable media having computer-executable instru