Trees (epo) Patents (Class 707/E17.012)
  • Patent number: 10250396
    Abstract: The systems, methods and apparatuses described herein provide a computing environment that manages private key storage. An apparatus according to the present disclosure may comprise a first non-volatile storage for storing a private root key for signing digital certificates, an input device for receiving manual input from an operator, a communication interface consisting of a one-way transmitter for transmitting information from the apparatus, and a processor. The processor may be configured to retrieve the private root key from the first non-volatile storage, receive information for a new digital certificate through the input device, generate the new digital certificate according to the received information, sign the new digital certificate using the private root key and transmit the new digital certificate from the apparatus using the transmitter.
    Type: Grant
    Filed: July 14, 2016
    Date of Patent: April 2, 2019
    Assignee: OLogN Technologies AG
    Inventor: Sergey Ignatchenko
  • Patent number: 10152346
    Abstract: A computer located outside of an organizational computing environment is remotely prepared and configured to work in the organizational computing environment. A hypervisor operating system is installed and replaces the primary operating system of the computer, and the primary operating system, virtual software appliances (VSA) and virtual machines (VM) can execute as processes of the hypervisor. The hypervisor is configured to establish secure connection with organizational computing environment and to receive from it organization-configured image software for configuring the compute to work in the organizational computing environment. The secure connection can also be used for remote maintenance of the computer even when the computer operating system is faulty or inactive.
    Type: Grant
    Filed: January 20, 2017
    Date of Patent: December 11, 2018
    Assignee: INTEL CORPORATION
    Inventor: Etay Bogner
  • Patent number: 10102231
    Abstract: Computer implemented methods for concurrent processing of operations on a tree-based data structure include: receiving input at a storage system managing a storage device in which the tree-based data structure is stored, the input identifying a set of heterogeneous operations to be applied to the tree-based data structure; determining one or more nodes of the tree-based data structure to which one or more of the set of heterogeneous operations are to be applied; determining one or more groups of the set of heterogeneous operations according to the one or more nodes to which the set of heterogeneous operations are to be applied; and applying, for each of the one or more groups, the set of heterogeneous operations according to a predefined order. Systems and methods for accomplishing the same are also disclosed.
    Type: Grant
    Filed: October 20, 2015
    Date of Patent: October 16, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Lior Aronovich, Kien K. Huynh
  • Patent number: 10102014
    Abstract: Example embodiments of a user interface system employing nested data are described. In an example embodiment, first data items of a first data source available for selection is presented via a user interface, the first data items including an association with a second data source. A first user selection of the association with the second data source is received via the user interface. In response to the first user selection, second data items of the second data source available for selection are presented via the user interface. A second user selection of a data item of the second data items is received via the user interface. In response to the second user selection, an indication of the selected data item of the second data items is presented.
    Type: Grant
    Filed: August 26, 2016
    Date of Patent: October 16, 2018
    Assignee: SAP SE
    Inventors: Andreas Riehl, Sonja Barnet, Gibo Thomas Pulipara
  • Patent number: 9996512
    Abstract: The invention discloses a device for a browser to process a page element comprising: at least one DOM object processor disposed at the browser side, each DOM object processor being configured to store a customized processing of a specific DOM object; a page parser configured to load an obtained page at the browser side, parse page elements of the obtained page, and convert each page element into a DOM object; a DOM processor coupled to the page parser and the at least one DOM object processor, and configured to invoke the at least one DOM object processor to perform a customized processing on at least one of converted DOM objects. By employing the invention, a personalized customization can be performed to a page according to the user needs. The invention further discloses a corresponding method.
    Type: Grant
    Filed: September 18, 2013
    Date of Patent: June 12, 2018
    Assignee: Beijing Qihoo Technology Company Limited
    Inventors: Xi Tang, Zhi Chen, Ming Li, Huan Ren
  • Patent number: 9742867
    Abstract: An apparatus includes a processor and a storage storing instructions causing the processor to: receive a request for data concerning a target node and neighboring nodes; multiply an identifier of the target node with an index multiplier to determine a location of an index entry of the target node within an index data; access the index entry to retrieve an identifier of a window and an indication of a location within the window at which a node entry of the target node may be accessed, and to retrieve an indication of data size of the node entry; access the node entry within the identified window to retrieve an amount of the node entry up to the data size to retrieve at least one identifier of at least one neighboring node within a single degree of separation of the target node; and output the at least one identifier.
    Type: Grant
    Filed: March 23, 2017
    Date of Patent: August 22, 2017
    Assignee: SAS Institute Inc.
    Inventor: Charles Michael Cavalier
  • Patent number: 9644968
    Abstract: A system and method synthesizing images of a locale to generate a composite image that provide a panoramic view of the locale. A video camera moves along a street recording images of objects along the street. A GPS receiver and inertial navigation system provide the position of the camera as the images are being recorded. The images are indexed with the position data provided by the GPS receiver and inertial navigation system. The composite image is created on a column-by-column basis by determining which of the acquired images contains the desired pixel column, extracting the pixels associated with the column, and stacking the columns side by side. The composite images are stored in an image database and associated with a street name and number range of the street being depicted in the image. The image database covers a substantial amount of a geographic area allowing a user to visually navigate the area from a user terminal.
    Type: Grant
    Filed: August 11, 2014
    Date of Patent: May 9, 2017
    Assignee: VEDERI, LLC
    Inventors: Enrico Di Bernardo, Luis F. Goncalves
  • Patent number: 9584322
    Abstract: A computer located outside of an organizational computing environment is remotely prepared and configured to work in the organizational computing environment. A hypervisor operating system is installed and replaces the primary operating system of the computer, and the primary operating system, virtual software appliances (VSA) and virtual machines (VM) can execute as processes of the hypervisor. The hypervisor is configured to establish secure connection with organizational computing environment and to receive from it organization-configured image software for configuring the compute to work in the organizational computing environment. The secure connection can also be used for remote maintenance of the computer even when the computer operating system is faulty or inactive.
    Type: Grant
    Filed: March 8, 2011
    Date of Patent: February 28, 2017
    Assignee: Intel Corporation
    Inventor: Etay Bogner
  • Patent number: 9542393
    Abstract: A method and system for indexing, searching, and retrieving information from timed media files based upon relevance intervals. The method and system for indexing, searching, and retrieving this information is based upon relevance intervals so that a portion of a timed media file is returned, which is selected specifically to be relevant to the given information representations, thereby eliminating the need for a manual determination of the relevance and avoiding missing relevant portions. The timed media includes streaming audio, streaming video, timed HTML, animations such as vector-based graphics, slide shows, other timed media, and combinations thereof.
    Type: Grant
    Filed: September 2, 2015
    Date of Patent: January 10, 2017
    Assignee: Streamsage, Inc.
    Inventors: Michael Scott Morton, Sibley Verbeck Simon, Noam Carl Unger, Robert Rubinoff, Anthony Ruiz Davis, Kyle Aveni-Deforge
  • Patent number: 9280575
    Abstract: A system includes generation of an encoding for each of a hierarchy of nodes, each of the nodes associated with one or more attributes, and the encoding for each node including a first pointer and a second pointer, and generation of an order tree comprising a hierarchy of entries, where each pointer of the encoding points to a respective one of the entries, wherein the encoding and the order tree indicate a position of each node in the hierarchy of nodes.
    Type: Grant
    Filed: July 19, 2013
    Date of Patent: March 8, 2016
    Assignee: SAP SE
    Inventors: Jan Finis, Robert Brunel
  • Patent number: 9280611
    Abstract: The present disclosure provides a method and an apparatus for storing data classification structure. Based on an initial classification structure tree, a reorganized classification structure tree that stores data classifications structure differently from that of the initial classification structure is generated. As the reorganized classification structure tree is flexible, when maintaining data and searching data by using the search engine, the present techniques may quickly find the desired data, thereby reducing the heavy burden of the search engine under the conventional techniques to conduct data search and high pressure of conducting data maintenance and data search. Further, the present techniques may not only reduce the burden of the search engine, but also relieve the pressure for maintaining data and searching data.
    Type: Grant
    Filed: October 11, 2012
    Date of Patent: March 8, 2016
    Assignee: Alibaba Group Holding Limited
    Inventors: Baihan Kong, Mei He, Jie Zhou
  • Patent number: 8965911
    Abstract: Nodes in a tree data structure are associated with respective node keys. At least some of the nodes are associated with at least one respective node rank. The structure is searched to attempt to identify a preferred prefix-matching node on the basis of attempting to find a prefix-matching node that has a prefix match with a search key and which has a preferred node rank relative to a node rank associated with a node which may have a longer prefix match. If the prefix-matching node is identified, a dependent node rank identifier associated with the prefix-matching node is used to determine that the prefix-matching node has the preferred node rank. The dependent node rank identifier indicates at least a node rank of a node which may have a longer prefix match than the prefix-matching node. The prefix-matching node is selected, if identified, as a preferred prefix-matching node.
    Type: Grant
    Filed: September 28, 2012
    Date of Patent: February 24, 2015
    Assignee: Metaswitch Networks Ltd
    Inventor: Adam Dinwoodie
  • Patent number: 8745232
    Abstract: Systems and methods for balancing electronic mailboxes among databases communicatively coupled to an information handling system are disclosed. A method may include comparing an actual utilization values for a first database to a threshold utilization value for the first database and, depending upon the results, identifying the first database as over-utilized. The method may also include comparing an actual utilization values for a second database to a threshold utilization value for the second database and, depending upon the results, identifying the second database as under-utilized. The method may further include comparing a threshold usage value of a first electronic mailbox stored in the first database to an upper threshold usage value for the first electronic mailbox and, depending upon the results, identifying the first electronic mailbox as heavily-utilized. The method may also include moving the heavily-utilized electronic mailbox to the second database.
    Type: Grant
    Filed: August 18, 2010
    Date of Patent: June 3, 2014
    Assignee: Dell Products L.P.
    Inventors: Akshai Parthasarathy, Mahmoud B. Ahmadian, Rizwan Z. Ali
  • Publication number: 20140136543
    Abstract: A system that provides secure autocomplete searching receives an autocomplete query from a user, the autocomplete query including a prefix of a search phrase, and retrieves security information of the user. The system searches one or more prefix indexes to find a set of matching objects, where the matching objects each include associated object security information. The system excludes matching objects that the user is not authorized to access from the set of matching objects based on the object security information and the user security information. The system then returns the set of matching objects to the user.
    Type: Application
    Filed: November 13, 2012
    Publication date: May 15, 2014
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Kurt FRIEDEN, Don L. HAYLER, Michael RICHARDS, Vasif SHAIKH
  • Publication number: 20140115009
    Abstract: An approach is provided in which a sample point system allocates sample point identifiers to a root node included an index tree that includes multiple leaf nodes. The sample point system distributes the sample point identifiers to the root node's child nodes, and recursively traverses through the index tree's hierarchical index levels and distributes the sample point identifiers from the child nodes to a subset of the index tree's leaf nodes. In turn, the sample point system collects sample data from the subset of the plurality of leaf nodes corresponding to the distributed sample point identifiers.
    Type: Application
    Filed: October 19, 2012
    Publication date: April 24, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Scott D. Lashley, Bingjie Miao
  • Publication number: 20140095548
    Abstract: Visual data mining techniques for increasing data classification accuracy are disclosed. For example, a method comprises the following steps. At least two decision tree data structures from a high-dimensional data set are generated. A composite data structure comprising the at least two decision tree data structures is generated. The composite data structure is generated based on a correlation computed between the at least two decision tree data structures. The composite data structure is visualized on a display. Modification of the composite data structure is enabled via interaction with the visualization of the composite data structure on the display.
    Type: Application
    Filed: September 28, 2012
    Publication date: April 3, 2014
    Applicant: EMC Corporation
    Inventors: Tao Chen, Jidong Chen
  • Publication number: 20140040262
    Abstract: Techniques for facilitating a similarity search of digital assets (e.g., audio files, image files, video files, etc.) are described. Consistent with some embodiments, a cloud-based search service manages one or more search tree data structures for use in organizing digital assets to make the digital assets searchable. Each digital asset is associated with a feature vector based on the various attributes and/or characteristics of the digital asset. The digital assets are then assigned to leaf nodes in one or more search tree data structures based on a measure of the distance between the feature vector of the digital asset and a virtual feature vector associated with a leaf node. When a search for similar digital assets is invoked, a prioritized breadth first search of a search tree is performed to identify the digital assets having the feature vectors closest in distance to the reference digital asset.
    Type: Application
    Filed: August 3, 2012
    Publication date: February 6, 2014
    Applicant: Adobe Systems Incorporated
    Inventors: Sven Winter, Jonathan Brandt
  • Publication number: 20140032605
    Abstract: Systems, methods, and computer-readable and executable instructions are provided for selecting data paths. Selecting data paths can include creating a support data tree structure from a number of data trees within a data set. In addition, selecting data paths can include removing a number of paths from the support data tree based on a number of evaluations of each of a number of nodes within the support data tree. Furthermore, selecting data paths can include selecting a desired set of paths based on a desired number of removed paths and an associated number of evaluations of the support data tree.
    Type: Application
    Filed: July 27, 2012
    Publication date: January 30, 2014
    Inventors: Burcu Aydin, Kemal Guler, Carlos Alejandro Alfaro-Montufar, Carlos Enrique Valencia Oleta
  • Patent number: 8635098
    Abstract: Community ratings are determined for users of an electronic marketplace. In a typical configuration, the community rating of an individual reflect the individual's reputation in the electronic community (e.g. feedback rating) as well as the reputations of the users the individual sponsors and the reputations of each user they sponsor, and so on. Various methodologies are provided for determining a community rating, such as aggregating feedback ratings, or weighting or thresholding these feedback ratings.
    Type: Grant
    Filed: October 15, 2012
    Date of Patent: January 21, 2014
    Assignee: eBay, Inc.
    Inventors: Robert J Ratterman, Reed Maltzman, Joshua D Knepfle
  • Publication number: 20140006455
    Abstract: An embodiment for evaluating rules pertaining to an event includes providing a rule trie comprising multiple nodes, wherein match conditions must be met to trigger a given rule, and each match condition corresponds to a different node. An attribute trie is provided for a string attribute, which includes a node sequence having a value. The string attribute is extracted from the event and also has a value. The value of the extracted string attribute and the value of the node sequence are compared, by traversing a path extending along the node sequence. Responsive to determining that the values of the extracted string attribute and the node sequence are the same, notice is provided that the match condition of a particular node of the rule trie has been met by an attribute of the received event.
    Type: Application
    Filed: July 2, 2012
    Publication date: January 2, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Arun Ramakrishnan, Rohit Shetty
  • Publication number: 20130346451
    Abstract: Compressed Level-Ordered Edge Sequence (CLOES) encodings are described. These techniques enable more aggressive compression of a state-set representation.
    Type: Application
    Filed: June 22, 2012
    Publication date: December 26, 2013
    Applicant: PALO ALTO RESEARCH CENTER INCORPORATED
    Inventors: Rong Zhou, Tim C. Schmidt
  • Patent number: 8612717
    Abstract: A storage system includes: a data storing means configured to store storage target data and also store address data so as to be tree-structured, the address data being based on a content and storing position of data to be referred to, and the address data referring to the storage target data or other address data; an operation log generating means configured to generate an operation log that represents a content of an operation of storing the storage target data into the data storing means and a content of an operation of storing the tree-structured address data referring to the storage target data into the data storing means; and a file system committing means configured to store the storage target data and the tree-structured address data into the data storing means based on the operation log.
    Type: Grant
    Filed: August 20, 2009
    Date of Patent: December 17, 2013
    Assignee: NEC Corporation
    Inventor: Yoshiaki Noguchi
  • Publication number: 20130318126
    Abstract: A method of implementing a tree data structure comprises creating a parent and child relationship between a first node and a second node, in which the first node and second node are at the same hierarchical level of the tree data structure, and maintaining only one incoming pointer for each of the nodes in the tree data structure at all times. A tree data structure in which each node in the tree data structure has a single incoming pointer, and in which the tree data structure comprises a pointer directed to a local overflow node from a node at the same hierarchical level as the local overflow node.
    Type: Application
    Filed: May 22, 2012
    Publication date: November 28, 2013
    Inventors: Goetz Graefe, Harumi Kuno, Hideaki Kimura
  • Publication number: 20130297657
    Abstract: A method for loading information into a tree structured database includes receiving a document and forming a top-down tree characterizing the document. Leaf nodes in the top-down tree are identified. Bottom-up indices are formed for the leaf nodes, where the bottom-up indices characterizes paths from selected leaf nodes to a root node of the top-down tree. The top-down tree and bottom-up indices are stored as separately searchable entities in the tree structured database.
    Type: Application
    Filed: May 1, 2012
    Publication date: November 7, 2013
    Inventors: Gajanan Chinchwadkar, Christopher Lindblad, Mary Holstege
  • Publication number: 20130290375
    Abstract: A method for dynamically partitioning a B-tree data structure, includes: determining if the B-tree data structure requires a partition; establishing a midpoint of the B-tree data structure; migrating from a beginning of the B-tree data structure to the midpoint of the B-tree data structure to a first B-tree data structure; migrating from the midpoint of the B-tree data structure to an end of the B-tree data structure to a second B-tree data structure; and allowing normal operations on the B-tree data structure during, migration.
    Type: Application
    Filed: April 30, 2012
    Publication date: October 31, 2013
    Inventors: Eric A. Anderson, Joseph A. Tucek
  • Publication number: 20130290384
    Abstract: A method for inserting a file in a search tree (B-tree) implemented on a file system, includes: (a) in response to a current node being a root node or an internal node, determining a child node; (b) repeating (a) until a leaf node is detected; (c) in response to a number of leaf nodes at a level of the leaf node exceeding an upper limit of files or a number of child nodes of a current node exceeding an upper limit of sub-directories, balancing the level of the leaf node or child nodes; and (d) inserting the file at the level of the leaf node.
    Type: Application
    Filed: April 30, 2012
    Publication date: October 31, 2013
    Inventors: Eric A. Anderson, Joseph A. Tucek, Jain Nitin
  • Publication number: 20130262517
    Abstract: Methods, apparatuses, and computer program products are provided for an address system to identify a field and/or a row in a data structure. A method may include receiving a request to modify a field of data, wherein the field of data is identified by a received field key. A method may also include determining whether the field of data was rendered for display. A method may also include modifying the field in a tree structure in an instance in which the field of data was rendered for display, wherein the received field key is configured locate an address object that is related to the field. A method may also include modifying the field of data in a tree structure in an instance in which the field of data was not rendered for display by locating the received field key in a field key lookup map, wherein the field key lookup map is configured to locate the address object.
    Type: Application
    Filed: March 30, 2012
    Publication date: October 3, 2013
    Applicant: McKesson Financial Holdings Limited
    Inventors: Geoffrey Eugene Atkin, Charles Christopher Horne
  • Patent number: 8543613
    Abstract: Additional information is provided in a checkpoint image such that direct pointers can be included in the checkpoint image. Thus, an in-memory database management system can be restored from the checkpoint image in the event of a failure without causing any significant performance drawbacks to the database management system.
    Type: Grant
    Filed: March 6, 2012
    Date of Patent: September 24, 2013
    Assignee: International Business Machines Corporation
    Inventor: Vilho T. Raatikka
  • Publication number: 20130246480
    Abstract: Methods, systems, and computer-readable storage media for receiving a plurality of source hierarchical schemas, processing the source hierarchical schemas to generate a merged graph, which is comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, determining and resolving using conflicts in the merged graph to generate a conflict-free merged graph, wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes, defining and processing a constraints satisfaction problem (CSP) to generate a plurality of mediated hierarchical schemas (MHSs), each MHS being a solution to the CSP, identifying an MHS of the plurality of MHSs as an optimum MHS, wherein a canonical hierarchical schema (CHS) is provided as the optimum MHS, and storing the CHS as a computer-readable document in a computer-readable memory.
    Type: Application
    Filed: March 19, 2012
    Publication date: September 19, 2013
    Applicant: SAP AG
    Inventors: Jens Lemcke, Michael Dietrich, Gunther Stuhec
  • Publication number: 20130238664
    Abstract: A large-scale data processing system, a large-scale data processing method, and a non-transitory tangible machine-readable medium are provided. The large-scale data processing system comprises an interface and a processor. The interface accesses a multi-dimensional data model, wherein the multi-dimensional data model comprises a plurality of dimensions, the dimensions form a multi-dimensional space of measures, each dimension is a single space comprising a plurality of members with a common set of attributes, and each measure is a data element organized and accessible through the multi-dimensional space of the cross-product of all dimensions. The processor builds at least one Tree Object (TO), wherein the TO is derived by converting the multi-dimensional data model into an N-level tree data structure according to a level order of N attributes, each tree node in the TO meets all conditions of attributes for all ancestor nodes, and N is a positive integer.
    Type: Application
    Filed: March 8, 2012
    Publication date: September 12, 2013
    Applicant: EBIZPRISE INC.
    Inventors: Yi-Chen Hsu, Wenwey Hseush, Shih-Chang Hsu, Yi-Cheng Huang, Michael Chih Huong Fong
  • Publication number: 20130204861
    Abstract: A method and apparatus for facilitating finding a nearest neighbor in a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving information indicative of a query point and information indicative of a node in the database tree; determining, by use of a processor, a lower-bound estimate based on the node and the query point, wherein the lower-bound estimate corresponds to a distance from the query point to the node; determining, by use of the processor, a temporary result corresponding to a distance to a nearest neighbor based on at least one child node of the node, the query point, and the lower-bound estimate; pruning one or more of the plurality of nodes based on the lower-bound estimate and a pruning bound; and returning a result indicative of a nearest neighbor of the query point.
    Type: Application
    Filed: February 3, 2012
    Publication date: August 8, 2013
    Applicant: QUOVA, INC.
    Inventor: Armand Erik Prieditis
  • Publication number: 20130204897
    Abstract: An example method includes identifying instances of a search term in a source text, and identifying prefix strings and suffix strings comprising tokens preceding and subsequent to the search term in the source text. The method further includes displaying a visualization interface that includes the search term within a combined tree diagram that includes a prefix tree and a suffix tree extending to either side of the search term. The prefix tree displays the prefix strings and the suffix tree displays the suffix strings, and both have user-selectable branches. The method further includes providing, in response to a user input selecting a branch in the prefix tree or in the suffix tree, a visual indication of a prefix string and a suffix string in the visualization interface that form a matching sequence that originate together in the source text, for matching sequences that are connected through the selected branch.
    Type: Application
    Filed: February 3, 2012
    Publication date: August 8, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: Steven R. McDougall
  • Publication number: 20130204902
    Abstract: In some implementations, a B+tree (b plus tree) can provide concurrent access to data while modifying nodes of the B+tree. In some implementations, a top-down B+tree can be provided where nodes of the B+tree can be proactively merged, rebalanced and split to prevent recursive operations moving up the B+tree. In some implementations, node (or page) record data can be merged to consolidate record entries within nodes of the B+tree while only locking 1-3 nodes of the tree at the same time. In some implementations, record data can be merged across multiple nodes of the B+tree. In some implementations, ranges of data can be removed from the tree while only locking 1-3 nodes of the tree at the same time. In some implementations, range of data can be replaced with new data while only locking 1-3 nodes of the tree at the same time.
    Type: Application
    Filed: September 28, 2012
    Publication date: August 8, 2013
    Applicant: APPLE INC.
    Inventor: APPLE INC.
  • Publication number: 20130104107
    Abstract: Computation execution can be visualized and debugged. A computation such as a database query plan graph can be extracted from a database query expression. Trace points can be injected into the database query expression while preserving original behavior. Query graphs can be generated with automatic inserting of mechanisms to connect to trace points, enabling visualization of query execution lifecycle states, collection of data traces across operators, and historical debugging with replay of data sets.
    Type: Application
    Filed: October 19, 2011
    Publication date: April 25, 2013
    Applicant: Microsoft Corporation
    Inventors: Bart De Smet, Henricus Johannes Maria Meijer
  • Publication number: 20130086122
    Abstract: Health monitoring system comprising a patient side subsystem, a health care provider side subsystem, and a server station. The patient side subsystem is able to periodically receive and apply a monitoring profile comprising profile elements being connected to each other in a predetermined manner, the monitoring profile elements comprising patient related data, monitoring related data, evaluating process elements, wherein the monitoring profile elements are connected to each other to provide a multi-level tree structure consisting of at least two monitoring profile levels comprising a higher or top level and a lower or bottom level, wherein the monitoring profile elements are divided according to the tree structure of the multi level monitoring profile and a part of the monitoring profile elements is assigned to the top monitoring profile level and a part of the monitoring profile elements is assigned to the bottom monitoring profile level.
    Type: Application
    Filed: September 28, 2012
    Publication date: April 4, 2013
    Applicant: GENERAL ELECTRIC COMPANY
    Inventors: Csaba DEVENYI, Roland LOHNER
  • Publication number: 20130046794
    Abstract: A hybrid object tree that interconnects individual data objects of different data types from a group of different input data sources is provided. The instantiated data objects of the hybrid object tree include an internal dynamic data area that encapsulates at least one reference to an original input data source. At least one attribute is identified that is unavailable at the referenced original input data source of a first instantiated data object of the hybrid object tree. The at least one attribute is added to the first instantiated data object of the hybrid object tree within the internal dynamic data area of the first instantiated data object.
    Type: Application
    Filed: March 29, 2012
    Publication date: February 21, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: Arthur L. De Magalhaes
  • Publication number: 20130046793
    Abstract: A method for generating a descriptor tree data structure is provided. A plurality of descriptors are obtained for one or more images, each descriptor defined within a multi-dimensional descriptor space. The plurality of descriptors are partitioned into nodes of a tree data structure, where the number of nodes in such partitioning is a function of the number of descriptors in the plurality of descriptors. The nodes having more than two descriptors may be sub-partitioned into sub-nodes of the tree data structure until two or fewer descriptors remain per sub-node, where such sub-partitioning is a function of the number of descriptors remaining in each such node and/or a dimensionality of such descriptors.
    Type: Application
    Filed: August 19, 2011
    Publication date: February 21, 2013
    Applicant: QUALCOMM Incorporated
    Inventors: Yuriy Reznik, Sundeep Vaddadi
  • Publication number: 20130046779
    Abstract: Transaction-segregated metrics are obtained for component invocations of different transactions of an application. Corresponding tree data structures are maintained by an agent and a manager which describe sequences of invoked components of the different transactions. The start and end of each component are each represented by a node in each branch of the tree data structure. Each transaction is identified by matching a branch to a transaction trace. Gatherers are linked to one or more nodes to collect the transaction-segregated metrics. For example, metrics can be gathered separately for component invocations in different transactions. Metrics can also be gathered together for instances of different components in one or more transactions. A user interface includes a directed graph having vertices connected by edges. Edge portions are visually distinguished from one another based on the metrics of the gatherers. Each edge portion can be associated with one or more of the gatherers.
    Type: Application
    Filed: August 16, 2011
    Publication date: February 21, 2013
    Applicant: CA, INC.
    Inventors: Marco Gagliardi, Vladimir Umansky
  • Publication number: 20130041918
    Abstract: A method for managing computer files in a first device storing the files according to a first file tree, comprising the following steps: for a current level of the first file tree, receiving data representing a level of the same rank of a second data structure representing a second file tree of a second device communicating with the first device; comparing the current level with the level of the same rank of the second file tree, in order to determine the presence in the second file tree, at the rank level of the current level, of an element that is not found in the first file tree at the current level; and, in the event that an element of the second file tree is not found in the first file tree, adding a descriptor of said element to the first file tree at the current level, wherein the descriptor enables access to said element from the first file tree.
    Type: Application
    Filed: March 22, 2011
    Publication date: February 14, 2013
    Applicant: France Telecom
    Inventor: Gilbert Landais
  • Publication number: 20130031114
    Abstract: An information processing apparatus includes a first selection unit that selects at least one first element in tree-structured data, a second selection unit that selects a second element corresponding to the first element selected by the first selection unit, and an extracting unit that extracts tree-structured data representing a subtree defined by the first element selected by the first selection unit and the second element selected by the second selection unit in order to copy the tree-structured data into different tree-structured data.
    Type: Application
    Filed: February 7, 2012
    Publication date: January 31, 2013
    Applicant: FUJI XEROX Co., Ltd.
    Inventor: Saneyuki KOBAYASHI
  • Publication number: 20130018922
    Abstract: A method for encoding state sets which encodes a binary prefix tree representation as a level ordered edge sequence (LOES) where the inner tree nodes are ordered from left to right, and top to bottom order and coded as bit pairs which represent the presence of leaf nodes.
    Type: Application
    Filed: July 13, 2011
    Publication date: January 17, 2013
    Applicant: PALO ALTO RESEARCH CENTER INCORPORATED
    Inventors: Tim C. Schmidt, Rong Zhou
  • Publication number: 20120331007
    Abstract: A method and apparatus relate to recognizing anchored patterns from an input stream. Patterns from a plurality of given patterns are marked as anchored patterns. An anchored state tree for the anchored patterns of the plurality of given patterns is built, including nodes representing a state of the anchored state tree. For each node of the anchored state tree, a failure value equivalent to a node representing a state in an unanchored state tree representing unanchored patterns of the plurality of given patterns is determined.
    Type: Application
    Filed: June 24, 2011
    Publication date: December 27, 2012
    Inventors: Satyanarayana Lakshmipathi Billa, Rajan Goyal
  • Publication number: 20120323906
    Abstract: A system, method and computer program product for automatically estimating the confidence of a detected LAT to provide a more accurate overall score for an obtained candidate answer. A confidence “score” or value of each detected LAT is obtained, and the system and method performs combining the confidence score with a degree of match between a LAT and an AnswerType of the candidate answer to provide improved overall score for the candidate answer.
    Type: Application
    Filed: August 29, 2012
    Publication date: December 20, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: James J. Fan, David A. Ferrucci, David C. Gondek, Aditya A. Kalyanpur, Adam P. Lally, James W. Murdock, Wlodek W. Zadrozny
  • Publication number: 20120317148
    Abstract: The present invention relates to systems and methods for representing interrelated data objects in a database as a hierarchical rooted tree, and also involves a computer program for visualizing, creating, and modifying such trees.
    Type: Application
    Filed: June 4, 2012
    Publication date: December 13, 2012
    Applicant: EXXONMOBIL RESEARCH AND ENGINEERING COMPANY
    Inventors: LEONARD R. KOENIG, DAVID A. STACHELCZYK
  • Publication number: 20120303671
    Abstract: A numeric structure identifier (ID) that represents a tree structure of a document that includes data is received. The numeric structure ID is calculated as a product of factors, each of a form of P raised to a power of m, where p is a prime number corresponding to a node ID of a node represented by the node ID and m is a number of children of the node represented by the node ID. A first numeric node ID that represents a first node of the tree structure of the document is received. The tree structure of the document corresponding to the numeric structure ID is identified. The data of the document is stored as the tree structure identifiable by the numeric structure ID. The first node within the tree structure corresponding to the first numeric node ID is identified. A value of the identified first node is returned.
    Type: Application
    Filed: August 3, 2012
    Publication date: November 29, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: Sandeep Chowdhury
  • Publication number: 20120303670
    Abstract: A cloud computing platform includes first device having a graph or tree structure with a node which receives data. The data is processed by the node or communicated to a child node for processing. A first node in the graph or tree structure determines the reconfiguration of a portion of the graph or tree structure on a second device. The reconfiguration may include moving a second node and some or all of its descendant nodes. The second and descendant nodes may be copied to the second device.
    Type: Application
    Filed: May 24, 2012
    Publication date: November 29, 2012
    Inventors: Robert E. Gillen, Robert M. Patton, Thomas E. Potok, Carlos C. Rojas
  • Publication number: 20120303669
    Abstract: A method for changing data context in a business analytics report is described herein. In one embodiment, such a method includes providing a business analytics report, wherein the report contains data and current metadata categories describing the data. The method enables selection of a current metadata category directly on the business analytics report. The method displays a metadata hierarchy associated with the current metadata category. This metadata hierarchy may include the current metadata category as well as related metadata categories arranged in a tree-like structure. The method further enables selection of a related metadata category from the metadata hierarchy to apply to the business analytics report. The method automatically updates the business analytics report with the metadata category and populates the report with the associated data. A corresponding computer program product and apparatus are also disclosed.
    Type: Application
    Filed: May 24, 2011
    Publication date: November 29, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Matthew S. Chmiel, Jason Hiltz-Laforge, Alireza Pourshahid, Graham A. Watts
  • Publication number: 20120271859
    Abstract: A method includes defining a host capability; creating for a storage device a second directory tree from a first directory tree of the storage device that is included in a file system within the storage device; and, for a data file that is stored in the storage device and is selectable for consumption by a host through the first directory tree that is included in the storage device's file system, determining whether the data file requires for consumption a host having the defined host capability. If the data file requires a host having the defined host capability, an entry is created in the second directory tree in which the data file is not selectable for consumption by the host. Otherwise, an entry is created in the second directory tree in which the data file is selectable for consumption by the host.
    Type: Application
    Filed: July 3, 2012
    Publication date: October 25, 2012
    Applicant: SANDISK IL LTD.
    Inventors: ARI DANIEL FRUCHTER, JUDAH GAMLIEL HAHN, DONALD RAY BRYANT-RICH, DANIEL ISAAC GOODMAN
  • Publication number: 20120271858
    Abstract: A storage system includes a plurality of vdisks, with each vdisk containing a plurality of storage segments, and each segment providing a specific class of service (CoS) for storage. Each vdisk stores files with data and meta data distributed among its storage segments. A storage system includes a memory having multiple classes of service. The system includes an interface for storing a file as blocks of data associated with a class of service in the memory. The interface chooses the class of service for a block on a block by block basis for storage. A file system for storing a file. A file system for storing includes a plurality of vdisks. A method for storing a file.
    Type: Application
    Filed: June 11, 2012
    Publication date: October 25, 2012
    Inventor: Michael L. Kazar
  • Patent number: 8296296
    Abstract: Method and apparatus for formatting information within a directory tree structure into an encyclopedia-like entry. The method includes performing a search by utilizing a selective one or more search methodologies including keyword search, hierarchical search, dichotomous key search, and parametric search to correlate a search criteria to a searchable database for generating one or more matching items, wherein the searchable database is formatted in the directory tree structure. The directory tree structure includes nodes comprising a collection of related data and branches comprising links between the nodes. Each matching item represents a node from within the directory tree structure. The method further includes selecting one of the matching items, formatting the collection of related data corresponding to the node of the selected matching item into an encyclopedia-like entry, and displaying the encyclopedia-like entry corresponding to the node of the selected matching item.
    Type: Grant
    Filed: May 23, 2010
    Date of Patent: October 23, 2012
    Assignee: Gamroe Applications, LLC
    Inventor: Robert Olan Keith, Jr.