Trees Patents (Class 707/797)
  • Patent number: 10282059
    Abstract: In one implementation, a plurality of signature vectors from a multi-dimensional representation of a graphical object is generated. Each of the signature vectors comprises attributes that vary little in response to changes in shape, size, orientation, and visual layer appearance of the graphical object, and each of the signature vectors includes attributes based on operations of integration, differentiation, and transforms on the multi-dimensional representation of the graphical object. Each signature vector is composited into multiple portions from the plurality of signature vectors to define an appearance-invariant signature of the graphical object.
    Type: Grant
    Filed: October 23, 2015
    Date of Patent: May 7, 2019
    Assignee: ENTIT SOFTWARE LLC
    Inventors: Daniel Freedman, Pavel Kisilev, Anastasia Dubrovina, Sagi Schein, Ruth Bergman
  • Patent number: 10275501
    Abstract: Systems and method for multi-dimensional data representation of an object is provided. The multi-dimensional data representation method includes evaluating a similarity measure for a query corresponding to an object. The similarity measure between the objects are used to compute the similarity values corresponding to the object and based on at least one metadata dimension associated with the object. The similarity value are sorted to create a multi-dimensional array of similarity values. The similarity values are represented in a scalar form and a visualization interface displays a multi visual representation of the similarity values and data associated with the object.
    Type: Grant
    Filed: July 30, 2015
    Date of Patent: April 30, 2019
    Assignees: TATA Consultancy Services Limited, Purdue Research Foundation
    Inventors: Devarajan Ramanujan, William Z. Bernstein, Karthik Ramani, Devadatta Madhukar Kulkarni, Jeffery Tew
  • Patent number: 10262016
    Abstract: Techniques for tuning the key space of an instance of a tree data structure are provided. In one embodiment, a computer system can receive a request to create the instance, where the request includes an expected key space value indicating an expected range of key values to be addressed by the instance. The computer system can further calculate a number of bits to allocate to each key of each node of the instance based on the expected key space value. The computer system can then, at a time of instantiating each node of the instance, allocate the keys for the node in accordance with the calculated number of bits.
    Type: Grant
    Filed: September 29, 2015
    Date of Patent: April 16, 2019
    Assignee: VMWARE, INC.
    Inventors: Ritesh Shukla, Serge Pashenkov, Li Ding, Bret Needle, Mayank Rawat
  • Patent number: 10255311
    Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.
    Type: Grant
    Filed: September 30, 2015
    Date of Patent: April 9, 2019
    Inventor: Jack J. LeTourneau
  • Patent number: 10244053
    Abstract: The present disclosure provides methods and systems for multicast collaborative erasure encoding and methods and systems for distributed parity protection. One embodiment relates to a method of multicast collaborative erasure encoding of a chunk stored in a distributed object storage cluster. A roll-call request is multicast to every storage server in a negotiating group for the chunk. Roll-call inventory responses are generated and multicast by every storage server in the negotiating group. The roll-call inventory responses are collected by every storage server in the negotiating group from other storage servers in the negotiating group to form a set of roll-call inventory responses. A logical evaluation of the set of roll-call inventory responses may then be performed by every storage server in the negotiating group. Other embodiments, aspects and features are also disclosed.
    Type: Grant
    Filed: January 31, 2018
    Date of Patent: March 26, 2019
    Assignee: Nexenta Systems, Inc.
    Inventors: Caitlin Bestler, Alexander Aizman, Robert E. Novak
  • Patent number: 10216627
    Abstract: An improved persistent memory process is disclosed that persists a traversable data structure by converting the traversable data structure into one or more traversable array structures that are saved on a secondary memory. The traversable array structure could be rapidly traversed and maintained, and can be used to restore one or more portions of the traversable data structure.
    Type: Grant
    Filed: November 8, 2016
    Date of Patent: February 26, 2019
    Assignee: Levyx, Inc.
    Inventor: Tony Givargis
  • Patent number: 10168890
    Abstract: Embodiments of the present invention provide a method, system and computer program product for document content re-ordering for assistive technology processing. In an embodiment of the invention, a method for document content re-ordering for assistive technology processing is provided. The method includes sensing in a computer display a drawing of a path across different portions of displayed content in the computer display. Thereafter, a sequence of the different portions of the displayed content can be identified from the path. As such, meta-data indicative of the sequence can be generated in the memory of the computer and the content can be annotated with the generated meta-data. Finally, the portions of the content can be processed with assistive technology in an order dictated by the sequence.
    Type: Grant
    Filed: May 13, 2015
    Date of Patent: January 1, 2019
    Assignee: International Business Machines Corporation
    Inventors: Michal Broz, Steven D. Clay, Richard S. Schwerdtfeger, Shunguo Yan
  • Patent number: 10120902
    Abstract: A database system includes a query planner with instructions executed by a processor to generate a logical plan tree. Each node of the logical plan tree is a distributed relational algebra operator. Each child node of the logical plan tree produces results processed by a parent node. The logical plan tree includes a distributed relational operator that reparations tuples of results that are at least 1 GB on a dimension and regroups the tuples on the dimension to avoid broadcasting the tuples between machines and thereby avoid consumption of network bandwidth associated with broadcasting the tuples. The logical plan tree is modified according to algebraic transformation rules. The logical plan tree is mapped to distributed query execution primitives. The distributed query execution primitives are processed on machines storing partitions of a distributed database table.
    Type: Grant
    Filed: February 20, 2014
    Date of Patent: November 6, 2018
    Assignee: Citus Data Bilgi Islemleri Ticaret A.S.
    Inventors: Ozgun Erdogan, Sumedh Pathak, Hadi Moshayedi, Metin Doslu
  • Patent number: 10095721
    Abstract: In a method for managing a data index, one or more processors inserting one or more rows of data sequentially into a data table of a database. The method further includes inserting index entries that correspond to the inserted one or more rows of data sequentially into an index of the data table, wherein an index B-tree structure is not built initially during insertion. The method further includes determining whether one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met. The method further includes responsive to determining that one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met, building an index-B-tree structure that includes the index entries inserted into the index.
    Type: Grant
    Filed: March 27, 2015
    Date of Patent: October 9, 2018
    Assignee: International Business Machines Corporation
    Inventors: Ke Chen, Shuo Li, Ping Liang, Xin Ying Yang
  • Patent number: 10078570
    Abstract: A method for dynamically updating database statistics and a plurality of access paths associated with at least one database table is provided. The method may include identifying at least one dynamically changing column associated with the at least one database table. The method may further include determining at least one predicate pattern associated with the identified at least one dynamically changing column. Additionally, the method may include dynamically detecting at least one range change associated with the determined at least one predicate pattern based on at least one record insert. The method may also include updating the plurality of database statistics associated with the identified at least one dynamically changing column based on the dynamically detected at least one range change. The method may further include determining at least one filter factor based on the updated plurality of database statistics associated with the identified at least one dynamically changing column.
    Type: Grant
    Filed: May 26, 2016
    Date of Patent: September 18, 2018
    Assignee: International Business Machines Corporation
    Inventors: Xiao Di Deng, Shuo Li, Shu Hua Liu, Wei Liu, Meng Wan, Xiaobo Wang, Xin Ying Yang, Chen Xin Yu, Xiong Wei Zhao
  • Patent number: 10019845
    Abstract: A machine-implemented method includes establishing a virtual or augmented reality entity, and establishing a state for the entity having a state time and state properties including a state spatial arrangement. The data entity and state are stored, and are subsequently received and outputted at a time other than the state time so as to exhibit a “virtual time machine” functionality. An apparatus includes a processor, a data store, and an output. A data entity establisher, a state establisher, a storer, a data entity receiver, a state receiver, and an outputter are instantiated on the processor.
    Type: Grant
    Filed: January 19, 2017
    Date of Patent: July 10, 2018
    Assignee: Atheer, Inc.
    Inventors: Sina Fateh, Ron Butterworth, Mohamed Nabil Hajj Chehade, Allen Yang Yang, Sleiman Itani
  • Patent number: 10007879
    Abstract: Ranking of data and retrieval of data or relationships of the data responsive to the ranking. A data model is represented as a graph, with edges in the graph linking related concepts, and an assertion represented in the graph as a reified n-ary relation. The graph is ingested though traversal and storage of the node paths. The traversal includes concepts and categories. In addition, neighborhood of one or more adjacent concepts are followed and stored in relation to the node paths. The ingested graph is converted into a set of flat document structures supported by information ranking and a retrieval framework.
    Type: Grant
    Filed: May 27, 2015
    Date of Patent: June 26, 2018
    Assignee: International Business Machines Corporation
    Inventors: Deepika Kakrania, Tanveer F. Syeda-Mahmood, John T. Timm
  • Patent number: 10003946
    Abstract: An improved method is provided for determining whether a sample point is within a defined geographic area. Indexes for the geographic area of interest are generated in advance. Such indexes complement the traditional spatial indexing techniques such as quad tree and r-tree. The geographic area, as defined by an outer boundary, is subdivided into some regular geometric shape, preferably a rectangle, encoded into a suitable form, and indexed. Then, a simplified comparison of the sample point to the indexed regular shapes is made.
    Type: Grant
    Filed: April 15, 2016
    Date of Patent: June 19, 2018
    Assignee: Pitney Bowes Inc.
    Inventors: Anand Kannan, Andrew Kane
  • Patent number: 9984090
    Abstract: A computer-implemented method is implemented to compress a file system namespace. The method starts with determining that a first leaf page of a hierarchical data structure of a storage system is sparse. The hierarchical data structure contains root node layer, intermediate node layer, and leaf page layer, where each leaf page contains namespace entries corresponding to a file or a directory of a file system, and where being sparse means a first size of the entries of the first leaf page is less than a first percentage. The method continues with identifying a second immediate adjacent leaf page as a merging candidate. The method continues with merging the second leaf page into the first leaf page upon determining that a second size of combined entries of the first and second leaf pages is less than a second percentage larger than the first percentage.
    Type: Grant
    Filed: March 13, 2014
    Date of Patent: May 29, 2018
    Assignee: EMC IP Holding Company LLC
    Inventors: Pengju Shang, Pranay Singh, George Mathew
  • Patent number: 9965185
    Abstract: Embodiments of the invention provide systems and methods to implement an object memory fabric. Object memory modules may include object storage storing memory objects, memory object meta-data, and a memory module object directory. Each memory object and/or memory object portion may be created natively within the object memory module and may be a managed at a memory layer. The memory module object directory may index all memory objects and/or portions within the object memory module. A hierarchy of object routers may communicatively couple the object memory modules. Each object router may maintain an object cache state for the memory objects and/or portions contained in object memory modules below the object router in the hierarchy. The hierarchy, based on the object cache state, may behave in aggregate as a single object directory communicatively coupled to all object memory modules and to process requests based on the object cache state.
    Type: Grant
    Filed: January 20, 2016
    Date of Patent: May 8, 2018
    Assignee: ULTRATA, LLC
    Inventors: Steven J. Frank, Larry Reback
  • Patent number: 9961145
    Abstract: An apparatus in one embodiment comprises a multi-tier storage system having at least a front-end storage tier and a back-end storage tier. The storage system comprises a software-defined storage controller configured to implement the front-end storage tier as a unified memory cluster accessible to respective processors of a plurality of compute nodes. The software-defined storage controller is implemented using at least one processing device comprising a processor coupled to a memory. The unified memory cluster in some embodiments comprises portions of respective memories of at least a subset of the compute nodes. The portions of respective memories of at least a subset of the compute nodes may comprise, for example, respective flash memories of those compute nodes, or respective dynamic random access memories of those compute nodes. Other illustrative embodiments include systems, methods and processor-readable storage media.
    Type: Grant
    Filed: December 17, 2015
    Date of Patent: May 1, 2018
    Assignee: EMC IP Holding Company LLC
    Inventors: Sorin Faibish, Uday Gupta, John M. Bent, Dennis Ting, Jr.
  • Patent number: 9940348
    Abstract: Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted.
    Type: Grant
    Filed: December 10, 2015
    Date of Patent: April 10, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Dustin A. Helak, David C. Reed, Thomas C. Reed, Max D. Smith
  • Patent number: 9942326
    Abstract: An apparatus in one embodiment comprises a plurality of compute nodes each having a processor coupled to a memory. The apparatus further comprises a storage system configured for communication with the compute nodes over at least one network, with the storage system comprising a software-defined storage controller configured to implement an in-memory database accessible as a unified memory cluster to respective processors of the compute nodes. The in-memory database comprises portions of respective memories of the compute nodes. The in-memory database may be expanded, for example, using an additional portion of the memory of one of the compute nodes, responsive to an overflow event associated with the memory of another one of the compute nodes. The compute nodes may illustratively comprise respective analysis nodes that run respective applications configured to utilize analytics functionality of the in-memory database.
    Type: Grant
    Filed: December 17, 2015
    Date of Patent: April 10, 2018
    Assignee: EMC IP Holding Company LLC
    Inventors: Sorin Faibish, Sassan Teymouri, John M. Bent, James M. Pedone, Jr.
  • Patent number: 9922077
    Abstract: A first request may be received to update a first set of values. The first set of values may be stored at a first location within a first data page of a database. The first location may be read-only. In response to the receiving of the first request, a first set of records may be inserted into a second data page. The first set of records may include the update of the first set of values. In response to the inserting, a forward pointer may be stored in the first data page that points to the first set of records on the second data page. One or more committed values may be identified on the second data page. In response to the identifying, the one or more committed values may be merged from the second data page to a third data page.
    Type: Grant
    Filed: December 1, 2016
    Date of Patent: March 20, 2018
    Assignee: International Business Machines Corporation
    Inventors: Ronald J. Barber, Bishwaranjan Bhattacharjee, Guy M. Lohman, Chandrasekaran Mohan, Vijayshankar Raman, Mohammad Sadoghi Hamedani, Richard S. Sidle, Adam J. Storm, Xun Xue
  • Patent number: 9906599
    Abstract: Techniques are disclosed for integration, provisioning and management of entities and processes in a computing system such as, by way of example only, business entities and business processes. In particular, techniques are disclosed for ontology based resource provisioning and management for services. For example, such an ontology based approach can be utilized in conjunction with a business support system which may be employed in conjunction with a cloud computing environment.
    Type: Grant
    Filed: January 10, 2017
    Date of Patent: February 27, 2018
    Assignee: International Business Machines Corporation
    Inventors: Yu Deng, Murthy V. Devarakonda, Michael Reuben Head, Rafah A. Hosn, Andrzej Kochut, Jonathan Paul Munson, Hidayatullah Habeebullah Shaikh
  • Patent number: 9881049
    Abstract: A first request may be received to update a first set of values. The first set of values may be stored at a first location within a first data page of a database. The first location may be read-only. In response to the receiving of the first request, a first set of records may be inserted into a second data page. The first set of records may include the update of the first set of values. In response to the inserting, a forward pointer may be stored in the first data page that points to the first set of records on the second data page. One or more committed values may be identified on the second data page. In response to the identifying, the one or more committed values may be merged from the second data page to a third data page.
    Type: Grant
    Filed: December 1, 2016
    Date of Patent: January 30, 2018
    Assignee: International Business Machines Corporation
    Inventors: Ronald J. Barber, Bishwaranjan Bhattacharjee, Guy M. Lohman, Chandrasekaran Mohan, Vijayshankar Raman, Mohammad Sadoghi Hamedani, Richard S. Sidle, Adam J. Storm, Xun Xue
  • Patent number: 9864765
    Abstract: An entry insertion apparatus (2000) inserts an entry into a node (3000) having a plurality of partial areas (3020) in which W (W being a positive integer equal to or greater than 2) or less entries are stored. Each entry can be searched for using an SIMD instruction to execute the same processing for the W entries in parallel. The entry insertion apparatus (2000) includes an insertion unit (2020) that inserts a new entry into the partial area (3020) in which the number of stored entries is 1 or more and less than W among the plurality of partial areas (3020), and a sorting unit (2040) that sorts the entries stored in the partial area (3020) when the number of entries stored in the partial area (3020) into which the new entry has been inserted is W.
    Type: Grant
    Filed: June 10, 2013
    Date of Patent: January 9, 2018
    Assignee: NEC CORPORATION
    Inventor: Shigero Sasaki
  • Patent number: 9852379
    Abstract: Systems and methods described herein utilize supervised machine learning to generate a figure-of-speech prediction model for classify content words in a running text as either being figurative (e.g., as a metaphor, simile, etc.) or non-figurative (i.e., literal). The prediction model may extract and analyze any number of features in making its prediction, including a topic model feature, unigram feature, part-of-speech feature, concreteness feature, concreteness difference feature, literal context feature, non-literal context feature, and off-topic feature, each of which are described in detail herein. Since uses of figure of speech in writings may signal content sophistication, the figure-of-speech prediction model allows scoring engines to further take into consideration a text's use of figure of speech when generating a score.
    Type: Grant
    Filed: March 6, 2015
    Date of Patent: December 26, 2017
    Assignee: Educational Testing Service
    Inventors: Beata Beigman Klebanov, Chee Wee Leong, Michael Flor, Michael Heilman
  • Patent number: 9842132
    Abstract: Implementing a Bloom filter index as a hierarchical data structure. Bloom filters are received and their bit vectors are decomposed into successive bit sequences. For each bit sequence except the last one, memory for at least storing a pointer to a memory location on the next level is allocated on the level corresponding to the bit sequence. The pointer storage is labeled by the value of the next bit sequence. A pointer to the allocated memory is stored in the pointer storage on the previous level that was labeled by the binary value of the current bit sequence. For the last bit sequence, memory for storing Bloom filters is allocated on the last level. A pointer to the allocated memory is stored in the pointer storage on the second-to-last level that was labeled by the value of the last bit sequence. The Bloom filter is stored in the allocated memory.
    Type: Grant
    Filed: October 23, 2015
    Date of Patent: December 12, 2017
    Assignee: International Business Machines Corporation
    Inventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, Jr.
  • Patent number: 9832067
    Abstract: In one implementation, a system for network tool synchronization includes a methodology engine to receive a data methodology of an enterprise architecture tool from the enterprise architecture tool. In addition, the system includes a functionality engine to analyze deployment diagrams of an orchestration tool to determine a functionality of the orchestration tool. In addition, the system includes an architecture engine to select information from the enterprise architecture tool based on the functionality of the orchestration tool. In addition, the system includes an information engine to export the selected information to the orchestration tool.
    Type: Grant
    Filed: April 30, 2014
    Date of Patent: November 28, 2017
    Assignee: EntIT Software LLC
    Inventors: Vladimir Dubsky, Miroslav Malecha, Slavomir Opler
  • Patent number: 9823080
    Abstract: A map of a facility is provided. Dispatch instructions for dispatching a mobile device from a starting location to the facility at a destination within a geographical area are received, and a current location of the mobile device is detected as the mobile device moves from the starting location towards the destination. The map of the facility is received based on the dispatch instructions and the current location of the mobile device, and the map of the facility is provided.
    Type: Grant
    Filed: December 22, 2011
    Date of Patent: November 21, 2017
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Kevin Reese, Kevin Fears, Alfonso Jones, Steven McDonald, Marty Turner
  • Patent number: 9773033
    Abstract: A method, a system and a computer program product for storing one or more volume attributes in a database. The system receives one or more volume attributes which are associated with one or more volumes within a storage system. One or more search terms are assigned to the volume attributes. The one or more volumes and one or more volume attributes are dynamically associated with a location of the one or more volumes. The system assigns the one or more search terms, the one or more volume attributes, and the location of the one or more volumes to the database. The database is stored at a local database and/or an external database. When one or more of the volume attributes are identified during an inquisition for the one or more volumes, the volumes are dynamically retrieved from one or more of the local database and/or an external database.
    Type: Grant
    Filed: May 22, 2009
    Date of Patent: September 26, 2017
    Assignee: International Business Machines Corporation
    Inventors: Brian W. Hart, Frederick L. Moss, Ricardo S. Puig
  • Patent number: 9760345
    Abstract: The present disclosure proposes a new model engineering method and system that permits the creation of application systems without the need of program development. The system allows organizations to search for high performance development teams and methods, and develop high quality solutions. The present disclosure covers the three central areas of systems engineering: (1) a method for creating models which represent reality in a standardized way; (2) a procedure for transforming models into computable artifacts, that is, computer systems that behave as specified in the model; and (3) a collaborative method based in knowledge representations.
    Type: Grant
    Filed: July 24, 2015
    Date of Patent: September 12, 2017
    Inventor: Alfonso Diez
  • Patent number: 9690688
    Abstract: A method, apparatus, and computer program product are disclosed to generate elementary string sets for unit testing regular expressions. In the context of a method, a regular expression is received. The method also creates a deterministic finite automaton based on the regular expression. In addition, the method generates an elementary string set using the deterministic finite automaton. The elementary string is generated to test software that uses the regular expression.
    Type: Grant
    Filed: February 28, 2013
    Date of Patent: June 27, 2017
    Assignee: HERE Global B.V.
    Inventor: Bogdan Ciprian Pistol
  • Patent number: 9667510
    Abstract: Techniques are disclosed for integration, provisioning and management of entities and processes in a computing system such as, by way of example only, business entities and business processes. In particular, techniques are disclosed for implementing an extensible support system for multiple service offerings. For example, such a support system can be a business support system which may be employed in conjunction with a cloud computing environment.
    Type: Grant
    Filed: February 20, 2015
    Date of Patent: May 30, 2017
    Assignee: International Business Machines Corporation
    Inventors: Yu Deng, Murthy V. Devarakonda, Michael Reuben Head, Rafah A. Hosn, Andrzej Kochut, Jonathan Paul Munson, Hidayatullah Habeebullah Shaikh
  • Patent number: 9659045
    Abstract: Hierarchical data objects are indexed using an index referred to herein as a hierarchy-value index. A hierarchy-value index has, as index keys, tokens (tag name, a word in node string value) that are extracted from hierarchical data objects. Each token is mapped to the locations that correspond to the data for the token in hierarchical data objects. A token can represent a non-leaf node, such as an XML element or a JSON field. A location can be a region covering and subsuming child nodes. For a token that represents a non-leaf node, a location to which the token is mapped contains the location of any token corresponding to a descendant node of the non-leaf node. Thus, token containment based on the locations of tokens within a hierarchical data object may be used to determine containment relationships between nodes in a hierarchical data object.
    Type: Grant
    Filed: September 26, 2014
    Date of Patent: May 23, 2017
    Assignee: Oracle International Corporation
    Inventors: Zhen Hua Liu, Beda Hammerschmidt, Douglas McMahon
  • Patent number: 9658765
    Abstract: One embodiment of the invention includes a computer interface system. The system comprises a user interface screen configured to display visual content and an input system configured to detect a presence of an input object within a threshold distance along a normal axis of the user interface screen. The system further comprises a graphical controller configured to magnify a portion of the visual content that is located at an approximate location of a base of the normal axis on the user interface screen.
    Type: Grant
    Filed: July 31, 2008
    Date of Patent: May 23, 2017
    Assignee: Northrop Grumman Systems Corporation
    Inventors: H. Keith Nishihara, Shi-Ping Hsu, Adrian Kaehler, Eric Gradman, Kjerstin Williams
  • Patent number: 9641618
    Abstract: Techniques are disclosed for integration, provisioning and management of entities and processes in a computing system such as, by way of example only, business entities and business processes. In particular, techniques are disclosed for ontology based resource provisioning and management for services. For example, such an ontology based approach can be utilized in conjunction with a business support system which may be employed in conjunction with a cloud computing environment.
    Type: Grant
    Filed: September 14, 2015
    Date of Patent: May 2, 2017
    Assignee: International Business Machines Corporation
    Inventors: Yu Deng, Murthy V. Devarakonda, Michael Reuben Head, Rafah A. Hosn, Andrzej Kochut, Jonathan Paul Munson, Hidayatullah Habeebullah Shaikh
  • Patent number: 9582758
    Abstract: A data classification method which classifies a plurality of data into a plurality of classification items based on a feature quantity included in the data, the method includes calculating, by a processor, an appearance probabilities in which training data including the feature quantity appears in the classification items in a distribution of the data, generating, by the processor, a rule having the feature quantity and a weighting of the feature quantity based on a plurality of the training data having the feature quantity based on the appearance probabilities; and classifying, by the processor, the plurality of data according to the rule.
    Type: Grant
    Filed: July 6, 2015
    Date of Patent: February 28, 2017
    Assignee: FUJITSU LIMITED
    Inventor: Tetsuro Takahashi
  • Patent number: 9576051
    Abstract: Various embodiments relate to a system and related method for scanning active instances of an application within a system. Unique identifiers in the form of fingerprints, tags, or metadata can be associated with a target application. A manager can then scan the process tables and file system directories of the servers within the system to find active processes and stored files that include the unique identifier. In some embodiments, the manager scans the active processes while they are running to search for the unique ID within the process' command line structure. In some embodiments, the manager also finds processes or files that do not have the unique identifier, but were previously associated with the unique identifier. The manager can then report the server and application information to user. Such information can include which of the one or more servers has the target application as an active process.
    Type: Grant
    Filed: November 28, 2012
    Date of Patent: February 21, 2017
    Assignee: FMR LLC
    Inventors: Stephen A. Carr, Robert Benedetti, Dana George Schalk, John Edward O'Neil
  • Patent number: 9552243
    Abstract: A method for detecting abnormal subsequences in data sequence includes constructing a hierarchical data structure of a target subsequence, each node in a bottommost layer of the data structure storing corresponding data of the target subsequence, and each node in a layer above the bottommost layer storing values based on data stored in corresponding nodes in a lower layer next to the layer above the bottommost layer; determining a second number of neighbors of the target subsequence based on the data structure of the target subsequence and of the first number of reference subsequences constructed in advance, the second number of neighbors having minimum Euclidean distances from the target subsequence; determining a third number of neighbors of each reference subsequence in the second number of reference subsequences, which have minimum Euclidean distances from each reference subsequence and determining whether the target subsequence is an abnormal subsequence.
    Type: Grant
    Filed: January 16, 2015
    Date of Patent: January 24, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Xiao Yan Chen, Yao Liang Chen, Sheng Huang, Kai Liu, Chen Wang
  • Patent number: 9547543
    Abstract: A method for detecting abnormal subsequences in data sequence includes constructing a hierarchical data structure of a target subsequence, each node in a bottommost layer of the data structure storing corresponding data of the target subsequence, and each node in a layer above the bottommost layer storing values based on data stored in corresponding nodes in a lower layer next to the layer above the bottommost layer; determining a second number of neighbors of the target subsequence based on the data structure of the target subsequence and of the first number of reference subsequences constructed in advance, the second number of neighbors having minimum Euclidean distances from the target subsequence; determining a third number of neighbors of each reference subsequence in the second number of reference subsequences, which have minimum Euclidean distances from each reference subsequence and determining whether the target subsequence is an abnormal subsequence.
    Type: Grant
    Filed: June 17, 2015
    Date of Patent: January 17, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Xiao Yan Chen, Yao Liang Chen, Sheng Huang, Kai Liu, Chen Wang
  • Patent number: 9542478
    Abstract: Disclosed are methods and apparatuses for viewing hierarchical data. One disclosed approach provides a method and system for viewing and navigating through hierarchical data while maintaining a hierarchical context that allows for the user to traverse up and down the hierarchy.
    Type: Grant
    Filed: April 8, 2014
    Date of Patent: January 10, 2017
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventors: Michael Donald Eide, David Wayne Nowakowski, Jonathan Stirling, Scott Gene Buss, John David Bilthuis
  • Patent number: 9542445
    Abstract: The invention relates to a computer system and a corresponding method and a corresponding computer-readable medium. The computer system is suitable for determining the result of a join. Based on the access pattern of an application, the computer system infers that a particular subjoin is empty. The computer system then excludes the inferred-empty subjoin when performing the join, performing a more efficient and faster database join operation.
    Type: Grant
    Filed: May 30, 2014
    Date of Patent: January 10, 2017
    Assignee: Hasso-Plattner-Institut Fur Softwaresystemtechnik GmbH
    Inventors: Hasso Plattner, Stephan Mueller, Jens Krueger, Juergen Mueller, Anisoara Nica
  • Patent number: 9524310
    Abstract: Data processing includes accessing a product category tree, the product category tree comprising a plurality of hierarchical levels. A leaf category level of the plurality of hierarchical levels comprises a leaf category node. The leaf category node includes product information. The product information comprises a plurality of product attribute parameters. The plurality of product attribute parameters comprises standard product information. Data processing further includes selecting, among the plurality of product attribute parameters that correspond to the leaf category node, a representative product attribute parameter that is representative of the product information; and partitioning standard product information of the leaf category node to obtain a plurality of sets using the representative product attribute parameter, wherein each of the plurality of sets includes at least some of the standard product information.
    Type: Grant
    Filed: October 24, 2014
    Date of Patent: December 20, 2016
    Assignee: Alibaba Group Holding Limited
    Inventors: Haijie Gu, Ningjun Su, Qifeng Dai, Haiping Ma, Jinyin Zhang, Enhong Chen
  • Patent number: 9524354
    Abstract: A system to enable restoration of a tree structure based on serialized data, and extraction of partial data that includes information of the tree structure from original data. A searching part identifies sequence elements of serialized data using a searching process. An essential element string identifying part identifies a sequence element string (essential element string) that includes the searched sequence elements. A rear section identifying part identifies a sequence element string that includes sequence elements located after the essential element string and is required to form a subtree that includes nodes corresponding to all the sequence elements of the essential element string. A front section identifying part identifies a sequence element string that includes sequence elements located before the essential element string and is required to form a subtree that includes nodes corresponding to all the sequence elements of the essential element string.
    Type: Grant
    Filed: September 17, 2013
    Date of Patent: December 20, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Kansaku Nakakura, Koichi Nishitani, Lianzi Wen
  • Patent number: 9514246
    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: Grant
    Filed: February 26, 2015
    Date of Patent: December 6, 2016
    Assignee: Cavium, Inc.
    Inventors: Satyanarayana Lakshmipathi Billa, Rajan Goyal
  • Patent number: 9507767
    Abstract: A parsing method and system. The method includes generating an n-gram model of a domain and computing a tf-idf frequency associated with n-grams of the n-gram model. A list including a frequently occurring group of n-grams based on the tf-idf frequency is generated. The frequently occurring group of n-grams is transmitted to a deep parser component and a deep parse output from the deep parser component is generated. The deep parse output is stored within a cache and a processor verifies if a specified text word sequence of the deep parse output is available in the cache.
    Type: Grant
    Filed: January 11, 2016
    Date of Patent: November 29, 2016
    Assignee: International Business Machines Corporation
    Inventors: Michael Boudreau, Brad Moore, Ahmed Mousaad, Craig M. Trim
  • Patent number: 9426194
    Abstract: A method includes receiving streaming data to be processed by a plurality of processing elements comprising one or more stream operators. Time metadata may be added to a parent tuple at a first stream operator. A first time metric may be determined for a first child tuple of the parent tuple at a second stream operator. The first time metric may be determined, at least in part, from the time metadata. The second stream operator may receive the first child tuple from the first stream operator. The method may include transmitting a second child tuple of the parent tuple from the second stream operator to a third stream operator if the time metric is inside a time limit. In addition, the method may include ending processing of the first child tuple if the time metric is outside of the time limit.
    Type: Grant
    Filed: November 13, 2014
    Date of Patent: August 23, 2016
    Assignee: International Business Machines Corporation
    Inventors: Michael J. Branson, John M. Santosuosso
  • Patent number: 9390166
    Abstract: A method of automatically identifying and extracting distributed online resources may include locating in a website a candidate entry list page. The method may also include verifying the candidate entry list page as an entry list page using repeated pattern discovery. The method may also include segmenting the entry list page into a plurality of entry items. The method may also include extracting from the plurality of entry items a plurality of candidate target pages. The method may also include verifying at least some of the candidate target pages as target pages including analyzing a visual structure and presentation of the candidate target pages. The method may also include extracting metadata from the target pages. The method may also include organizing the target pages and/or the metadata in one or more databases.
    Type: Grant
    Filed: December 31, 2012
    Date of Patent: July 12, 2016
    Assignee: FUJITSU LIMITED
    Inventors: Jun Wang, Kanji Uchino
  • Patent number: 9330418
    Abstract: A tree building system that accesses data from a social networking site and, in some embodiments, other data sites having information that may pertain to the relationships between users of the social networking site. A rules engine within the system implements logic for analyzing the data from the social networking site. The system provides a candidate list of possible relatives for selection by a user and solicits information from the user through the use of guided questions.
    Type: Grant
    Filed: September 14, 2012
    Date of Patent: May 3, 2016
    Assignee: Ancestry.com Operations Inc.
    Inventors: Kendall Hulet, Christopher D. Bradford, Joshua Penrod
  • Patent number: 9330116
    Abstract: Methods, machines, and stored instructions are provided for determining hierarchical paths to nodes based on stored information about the nodes. A node analyzer analyzes a hierarchy to create mappings that represent the hierarchy. The mappings may include a “parent mapping” that maps selected-level nodes to parent nodes of the selected-level nodes, and a “path mapping” that maps a plurality of nodes other than the selected-level nodes to a plurality of paths, within the hierarchy, to the plurality of nodes. A path module then determines path(s) to specified node(s) at least in part by mapping the specified node(s) to particular parent node(s) of the specified node(s) using the parent mapping. The path module also maps the particular parent node(s) to particular path(s) using the path mapping. The information from the path and parent mappings may be assembled to form path(s) within the hierarchy to the specified node(s).
    Type: Grant
    Filed: March 15, 2013
    Date of Patent: May 3, 2016
    Assignee: Oracle International Corporation
    Inventors: Lijie Heng, Chi Ching Chui, Yi Ouyang
  • Patent number: 9317511
    Abstract: A system and method of operating a filesystem for managing filesystem objects is disclosed. The filesystem objects are characterized by metadata parameters included in a global directory object arranged in a plurality of global directory object (GDO) pages. Responsive to receiving a request for creating a new filesystem object, a parent key is obtained. The parent key is indicative of an identifier of a direct parent directory requested for hosting the new filesystem object. A target page that corresponds to the parent key is located within the plurality of GDO pages. The target page further includes a direct parent directory metadata record associated with the direct parent key and includes metadata parameters related to the direct parent directory. An object key is created as corresponding to the same target page, thereby enabling accommodation of an object metadata record, related to the new filesystem object, on the target page.
    Type: Grant
    Filed: June 19, 2012
    Date of Patent: April 19, 2016
    Assignee: INFINIDAT LTD.
    Inventor: Arnon Kanfi
  • Patent number: 9268853
    Abstract: Various embodiments relate to a system and related method for retrieving configuration information of a computer network. Unique identifiers in the form of fingerprints, tags, or metadata can be associated with a target application. A manager can scan process tables and file system directories of servers within the system to find processes and files that include the unique identifier. The manager can save the server and application information in a configuration database that can subsequently be searched. Such information can include which of the one or more servers has the target application as an active process.
    Type: Grant
    Filed: November 28, 2012
    Date of Patent: February 23, 2016
    Assignee: FMR LLC
    Inventors: Stephen A Carr, Robert Benedetti, Dana George Schalk, John Edward O'Neil
  • Patent number: 9262499
    Abstract: A context-based graphical database system for storing a data structure comprises an entity node that stores an identifier of an entity. A data node stores non-contextual entity data about the entity. At least one context node is linked to the data node. The at least one context node provides context to the non-contextual entity data in the data node to create contextual entity data. A pointer from the entity node to the data node returns a data node identifier to the entity node to link the contextual entity data to the entity.
    Type: Grant
    Filed: August 8, 2012
    Date of Patent: February 16, 2016
    Assignee: International Business Machines Corporation
    Inventors: Samuel S. Adams, Robert R. Friedlander, John K. Gerken, III, James R. Kraemer