Patents Examined by Jermaine Mincey
  • Patent number: 10296642
    Abstract: A system comprising a processor and a memory storing instructions that, when executed, cause the system to receive a record of data describing user engagement with content items in an online service; prepare the record of data for generating a model characterizing a network effect of a user interaction with a content item in the online service; generate the model characterizing the network effect of the user interaction with the content item in the online service; generate a predicted network effect score for a plurality of content items based on the model; organize the plurality of content items based on the predicted network effect score; and transmit the plurality of organized content items for presentation to a user. The disclosure also includes similar methods and computer program products.
    Type: Grant
    Filed: June 5, 2015
    Date of Patent: May 21, 2019
    Assignee: Google LLC
    Inventors: Harish Chandran, Junbin Teng, Alessandra Mazzia
  • Patent number: 10296528
    Abstract: The present inventor devised, among other things, an information retrieval system that determines whether a query is ambiguous or not and based on this determination either continues or aborts a search process. One query evaluation extracts word pairs from an input query and uses features of the extracted word pairs, for example the number of word pairs and their frequencies within a document collection, to determine if the query is ambiguous or not. Another evaluation measures topical convergence, using query related caselaw headnotes that are associated with topics in a legal taxonomy. And yet another checks topical convergence through the lens of full caselaw documents and secondary legal documents, such as law review articles, specifically the minimum number of case law and secondary legal documents that are necessary to span a set of top ranked topics identified using the query.
    Type: Grant
    Filed: December 31, 2008
    Date of Patent: May 21, 2019
    Assignee: Thomson Reuters Global Resources Unlimited Company
    Inventor: Qiang Lu
  • Patent number: 10242056
    Abstract: Computer implemented methods for database hierarchy-independent data drilling are presented including: a. selecting one of at least two database structures each having data, where the at least two database structures include, at least two distinct paths that lead from a first of the at least two database structures to a second of the at least two database structures, where a path logically relates at least two data structures which are otherwise directly unrelated using data structures and data structures' relations, and a database information schema that provides information about the at least two database structures including information regarding relations between data structures; b. setting the selected database structure as a current data drilling state; and c. finding at least one related data structure corresponding with the selected database structure for the current data drilling state utilizing the database information schema.
    Type: Grant
    Filed: June 26, 2014
    Date of Patent: March 26, 2019
    Assignee: DATAWALK SPOLKA AKCYJNA
    Inventor: Krystian Piecko
  • Patent number: 10242258
    Abstract: In an example embodiment, a fuzzy join operation is performed by, for each pair of records, evaluating a first plurality of features for both records in the pair of records by calculating term frequency-inverse term frequency (TF-IDF) for each token of each field relevant to each feature and based on the calculated TF-IDF for each token of each field relevant to each feature, computing a similarity score based on the similarity function by adding a weight assigned to the TF-IDF for any token that appears in both records. Then a graph data structure is created, having a node for each record in the plurality of records and edges between each of the nodes, except, for each record pair having a similarity score that does not transgress a first threshold, causing no edge between the nodes for the record pair to appear in the graph data structure.
    Type: Grant
    Filed: October 30, 2015
    Date of Patent: March 26, 2019
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Songtao Guo, Christopher Matthew Degiere, Aarti Kumar, Alex Ching Lai, Xian Li
  • Patent number: 10216761
    Abstract: A method of generating congruous metadata is provided. The method includes receiving a similarity measure between at least two multimedia objects. Each multimedia object has associated metadata. If the at least two multimedia objects are similar based on the similarity measure and a similarity threshold, the associated metadata of each of the multimedia objects are compared. Then, based on the comparison of the associated metadata of each of the at least two multimedia objects, the method further includes generating congruous metadata. Metadata may be tags, for example.
    Type: Grant
    Filed: March 4, 2008
    Date of Patent: February 26, 2019
    Assignee: OATH INC.
    Inventors: Malcolm Slaney, Kilian Weinberger
  • Patent number: 10163034
    Abstract: Systems, methods, and other embodiments associated with tripoint arbitration for data classification are described. In one embodiment, a method includes receiving a query data point for classification, an arbiter point, a first set of classified data points belonging to a first class and a second set of classified data points belonging to a second class. A class-aggregated similarity metric for the query data point and each set is determined based, at least in part, on tripoint arbitration coefficients for data point pairs that include the query data point and a classified data point in the set, as calculated using the arbiter point. The query data point is classified based on a comparison of the similarity metric determined for the first set and the similarity metric determined for the second set.
    Type: Grant
    Filed: August 19, 2013
    Date of Patent: December 25, 2018
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventors: Aleksey Urmanov, Anton Bougaev
  • Patent number: 10140387
    Abstract: A method and apparatus for managing variations in a product structure for a product. In one illustrative embodiment, a product management system for managing variations in a product structure for a product comprises a model. The model comprises a primary hierarchical organization and a number of optimized product variant structures. The primary hierarchical organization comprises a group of domain master objects. The number of optimized product variant structures comprises a group of domain configuration objects in which each domain configuration object in the group of domain configuration objects represents a configuration for a component represented by a corresponding domain master object in the group of domain master objects.
    Type: Grant
    Filed: August 14, 2012
    Date of Patent: November 27, 2018
    Assignee: The Boeing Company
    Inventor: Sean M. Callahan
  • Patent number: 10133806
    Abstract: Systems and methods for search result replication in a search head cluster of a data aggregation and analysis system. An example method may comprise maintaining a replication count corresponding to how many replicas of a result of a particular map-reduce search exist in a search head cluster comprising a plurality of search heads that are each configured to enable them to manage a reduce phase of a map-reduce search, determining that the replication count is less than a target replication count, selecting, based the determining, a target search head from the search head cluster to receive a replica of the search result, initiating a replication of the search result from a source search head in the search head cluster to the selected target search head, receiving an indication that the replication is complete, and based on receiving the indication, increasing the replication count corresponding to the search result.
    Type: Grant
    Filed: July 31, 2014
    Date of Patent: November 20, 2018
    Assignee: Splunk Inc.
    Inventors: Anirban Rahut, Sundar Vasan
  • Patent number: 10120880
    Abstract: Systems and methods are described that recommend images, items, and/or metadata based at least in part on a reference color palette or reference color name. A color name can be converted into a representation of the color name in a color space. The reference color can be used to identify images that contain the reference color. The identified images and associated metadata can be analyzed, sorted and provided as an ordered list of items. Systems and methods are also described that identify items that contain colors affiliated with the reference color. Systems and methods are also described that validate color identifier information in metadata associated with an image. Systems and methods are also described that identify non-color specific keywords associated with the reference color.
    Type: Grant
    Filed: June 26, 2014
    Date of Patent: November 6, 2018
    Assignee: Amazon Technologies, Inc.
    Inventors: Charles Shearer Dorner, Robert Yuji Haitani, Timothy Andrew Ong, Gonzalo Alberto Ramos, Paul Barnhart Sayre, III
  • Patent number: 10083182
    Abstract: Embodiments relate to scheduling operations to perform on objects. A method for scheduling operations to perform on objects is provided. The method identifies a plurality of operations to perform on a plurality of objects each having at least one attribute. At least one of the operations has scheduling dependency on another operation. The method generates a numeric value for each of the objects from the attribute of the object. The method schedules the operations to perform on the objects based on the numeric values of the objects and the scheduling dependency.
    Type: Grant
    Filed: June 26, 2014
    Date of Patent: September 25, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Marc A. Kaplan, Wayne A. Sawdon
  • Patent number: 10073926
    Abstract: A method for team analytics context graph generation and augmentation may include extracting a set of relevant features from a received message and predicting a context graph corresponding to the received message being sparse based on the extracted relevant features. A context of the received message is indeterminable from the context graph in response to the context graph being sparse. The method may also include generating an augmented context graph in response to the context graph being predicted to be sparse. The context of the received message is determinable from the augmented context graph. The method may additionally include presenting the augmented context graph.
    Type: Grant
    Filed: August 14, 2015
    Date of Patent: September 11, 2018
    Assignee: International Business Machines Corporation
    Inventors: Paul R. Bastide, Matthew E. Broomhall, Stephen Crawford, Andrew E. Davis, Eric S. Portner, Marco A. Vicente, Eric M. Wilcox
  • Patent number: 10049132
    Abstract: Systems and methods for rewriting queries based on data features are disclosed. A data source contains a history of queries and results associated with the queries. A source query is received and a subset of the data source is extracted that is related to the query. Costs are then associated with the associations of the queries and results, and an absorbed cost is determined for each query. The queries having the lowest absorbed cost are recommended for rewrites.
    Type: Grant
    Filed: June 26, 2014
    Date of Patent: August 14, 2018
    Assignee: Excalibur IP, LLC
    Inventor: Nagaraj Kota
  • Patent number: 10049122
    Abstract: A cluster file system comprises a parallel file system and a plurality of burst buffers, with the burst buffers collectively configured to provide an interface between the parallel file system and compute nodes of a computer system. Each of the burst buffers comprises a virtual file system component and a metadata server component. The virtual file system components of respective ones of the burst buffers collectively implement a virtual file system. Metadata relating portions of the virtual file system to portions of the parallel file system is stored in a distributed manner over the metadata server components of the respective burst buffers. Each burst buffer independently manages its own flash memory, but the burst buffers are configured such that data consistency is ensured across their flash memories. The virtual file system illustratively comprises a parallel log-structured file system (PLFS) and the metadata server components illustratively comprise respective TO forwarding servers.
    Type: Grant
    Filed: June 26, 2014
    Date of Patent: August 14, 2018
    Assignee: EMC IP Holding Company LLC
    Inventors: Sorin Faibish, John M. Bent, Jingwang Zhang, Haiyun Bao
  • Patent number: 10031830
    Abstract: An apparatus, system, and method are provided for evaluating database accesses. The apparatus may comprise a computer program that causes a computer system to exchange profiling data between a client application module and a database module; execute a database access; determine a database access policy violation at a detection point module; and selectively request context information from a context point module related to the database access.
    Type: Grant
    Filed: October 13, 2006
    Date of Patent: July 24, 2018
    Assignee: International Business Machines Corporation
    Inventors: Stephen Andrew Brodsky, Holger Karn, Kevin Michael McBride, Peter Wansch, Maryela Evelin Weihrauch
  • Patent number: 9996579
    Abstract: Systems and methods are described to quickly search a data store based on one or more n-dimensional colors. The n-dimensional colors in the data store may be converted to interleaved integers and indexed. An n-dimensional color search range may be converted to one or more integer search ranges. A fast color search query may be formulated based on the one or more integer search ranges, and transmitted to the data store for searching. The data store may use the interleaved integer index to quickly compare the integer search ranges to the interleaved integers, and send back one or more colors or object results that matched the desired color range.
    Type: Grant
    Filed: June 26, 2014
    Date of Patent: June 12, 2018
    Assignee: Amazon Technologies, Inc.
    Inventors: Charles Shearer Dorner, Paul Barnhart Sayre, III
  • Patent number: 9965512
    Abstract: In one embodiment, a method receives a query for analyzing data in a database. The method then determines a constant in the query and determines an operator applied to the constant in the query. The operator explicitly controls a behavior of the constant. The constant is represented as a scalar representation in the query instead of as a vectorial representation where the constant would have been used as the vectorial representation without the use of the operator due to a rule governing use of constants. Then, the method performs a calculation for the query to determine a query result using the constant as the scalar representation.
    Type: Grant
    Filed: June 25, 2013
    Date of Patent: May 8, 2018
    Assignee: SAP SE
    Inventors: Stefan Dipper, Sebastian Schroetel, Michael Wilking, Christof Mueller, Tim Kaiser
  • Patent number: 9946584
    Abstract: Systems and methods are provided for extracting application relevant data from messages. In one embodiment, a system can comprise a message parser that parses messages and builds a message tree having one or more objects, one or more data type templates that define a given data type based on one or more data elements and a comparison engine that matches data elements in the one or more objects with data elements in the one or more data type templates. The comparison engine groups data elements in the one or more objects that matches data elements in the one or more data templates as a specific data type corresponding to the associated data type template that is matched.
    Type: Grant
    Filed: September 30, 2008
    Date of Patent: April 17, 2018
    Assignee: Northrop Grumman Systems Corporation
    Inventors: Adrian Kaehler, Shi-Ping Hsu
  • Patent number: 9928285
    Abstract: A method of backing up data includes backing up, using a processor, multiple save sets of data to a first backup data storage; obtaining a first save set from the first backup data storage after the backup of the first save set has completed on the first backup data storage; determining that the first backup data storage is capable of concurrent read and write operations; and replicating, based at least in part on the determining, the first save set onto a second backup data storage while backing up of one or more other save sets of the multiple save sets to the first backup data storage is pending.
    Type: Grant
    Filed: June 25, 2013
    Date of Patent: March 27, 2018
    Assignee: EMC IP Holding Company LLC
    Inventor: Vladimir Mandic
  • Patent number: 9836538
    Abstract: In one example, documents that are examined by a search process may be scored in a manner that is specific to a domain. A domain may be a substantive area, such as medicine, sports, etc. Different scoring approaches that take aspects of the domain into account may be applied to the documents, thereby producing different scores than might have been produced by a simple comparison of the terms in the query with the terms in the documents. These domain-based approaches may take a query into account in scoring the documents, or may be query-independent. Each approach may be implemented by a scorer. The combined output of the scorers may be used to generate a score for each document. Documents then may be ranked based on the scores, and search results may be provided.
    Type: Grant
    Filed: March 3, 2009
    Date of Patent: December 5, 2017
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Alain Thierry Rappaport, Daniel Adamson
  • Patent number: 9836514
    Abstract: Technologies are generally described for cache based key-value store mapping and replication. In some examples, key-value stores may be mapped for data structure replication through extraction of file breaks in an existing key-value store by iterating through the store and examining changes in cache addresses to detect jumps in address values. Specially formulated queries may be executed to return the values within an address range that spans a physical storage volume in order to recover full key-value sets that are physically grouped at a current data center including record duplicates. Such sets may be used to replicate or inform the key-value sets at a new location or in a new key-value store allowing construction of a replicated database tree structure complete with record duplications that develop as tables are optimized over time.
    Type: Grant
    Filed: November 7, 2011
    Date of Patent: December 5, 2017
    Assignee: EMPIRE TECHNOLOGY DEVELOPMENT LLC
    Inventor: Ezekiel Kruglick