Patents Examined by Fatima P Mina
  • Patent number: 11182414
    Abstract: A computer-implemented method, cognitive intelligence system and computer program product adapt a relational database containing multiple data types. Non-text tokens in the relational database are converted to a textual form. Text is produced based on relations of tokens in the relational database. A set of word vectors is produced for the tokens based on the text. A cognitive intelligence query expressed as a structured query language (SQL) query may be applied to the relational database using the set of word vectors. The form of non-text tokens is one of a numeric value, an SQL type, an image, a video, a time series, latitude and longitude, or chemical structures. A single word embedding model may be applied over one or more tokens in the text. A plurality of sets of preliminary word vectors are computed by applying more than one embedding model over all tokens in the text. The preliminary word vector sets are merged to form the set of word vectors.
    Type: Grant
    Filed: March 20, 2017
    Date of Patent: November 23, 2021
    Assignee: International Business Machines Corporation
    Inventors: Bortik Bandyopadhyay, Rajesh Bordawekar, Tin Kam Ho
  • Patent number: 11157522
    Abstract: A method (1400) of and a system (222) for associating past activity indications (602) associated with past activities of a user (170) with items. The method comprises accessing (1402) the past activity indications (602); accessing (1404) item indications; determining (1406) a past activity feature vector (606); determining (1408) a text feature vector (706) corresponding to the text features; mapping (1410) the past activity feature vector (606) and the text feature vector (706) to generate a text feature space (904); determining (1412) an image feature vector (806); mapping (1414) the past activity feature vector (606) and the image feature vector (806) to generate an image feature space (1004); generating a user item space (1104); and storing (1418) the user item space (1104). A method (1500) of and a system (222) for associating a first item and a second item are also disclosed.
    Type: Grant
    Filed: October 8, 2015
    Date of Patent: October 26, 2021
    Assignee: YANDEX EUROPE AG
    Inventors: Andrey Borisovich Krasnikov, Gennady Gennadievich Kuzmin, Sergey Aleksandrovich Shiryaev, Dmitrii Petrovich Sopin, Sergei Olegovich Lisitcyn, Dmitrii Aleksandrovich Levanov, Dmitrii Andreyevich Kuksa, Sergey Victorovich Kotsur
  • Patent number: 11144512
    Abstract: Various techniques are disclosed herein for storing and managing master data in hierarchical data systems. Several related concepts, embodiments, and examples are disclosed, including techniques for incremental rationalization in a hierarchical data model, techniques for implementing governance pools in a hierarchical data model, techniques for application materialization in a hierarchical data model, techniques for data intersection mastering in a hierarchical data model, techniques for change request visualization in a hierarchical data model, and techniques for hierarchy preparation in a hierarchical data model.
    Type: Grant
    Filed: July 12, 2017
    Date of Patent: October 12, 2021
    Assignee: Oracle International Corporation
    Inventors: Matthew Lawrence Lontchar, Douglas R. Cosby, Anurag Garg, Rahul R. Kamath, Narayan Madhavan Nayar
  • Patent number: 11126652
    Abstract: According to one embodiment, a retrieval device includes one or more processors configured to retrieve a plurality of search image regions from an intended image through image search using a search query, extract a plurality of learning image regions from a learning image used in learning of the image search, through the image search using the search query, and display the search image regions and the learning image regions on a display.
    Type: Grant
    Filed: February 26, 2019
    Date of Patent: September 21, 2021
    Assignee: Kabushiki Kaisha Toshiba
    Inventors: Yuto Yamaji, Tomoyuki Shibata
  • Patent number: 11113272
    Abstract: A method of storing blockchain state data, including: after execution of a transaction in a target block is completed, based on a latest account state of a target account related to the transaction in the target block after update, generating updated data nodes corresponding to the current Merkle state tree of the target block and, based on generated historical data nodes and data nodes other than the reused data nodes corresponding to the target account on the historical Merkle state tree of the previous block of the target block, creating the historical Merkle state tree for the target block.
    Type: Grant
    Filed: January 28, 2020
    Date of Patent: September 7, 2021
    Assignee: Advanced New Technologies Co., Ltd.
    Inventors: Haizhen Zhuo, Zhonghao Lu, Benquan Yu
  • Patent number: 11100119
    Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program identifies a first data structure having a first type. The first data structure is configured to store a set of geometries. The program further identifies a second data structure associated with the first data structure. The second data structure is configured to store modifications to the set of geometries. The program also perform a merge operation on the first data structure and the second data structure to form a third data structure.
    Type: Grant
    Filed: May 4, 2018
    Date of Patent: August 24, 2021
    Assignee: SAP SE
    Inventors: Kai-Niklas Bastian, Michael Jung
  • Patent number: 11093635
    Abstract: Apparatuses and methods for private information retrieval are provided. One example method may include receiving a query state machine that is an encoding of a search pattern. The query state machine may include a plurality of states and a transition function that defines a plurality of transitions based on the search pattern. The example method may also include performing a private query against a target query string of a target query record by applying the query state machine to the target query string to develop a private encoding. The method may further include transmitting query results based on the private encoding.
    Type: Grant
    Filed: May 4, 2017
    Date of Patent: August 17, 2021
    Assignee: The Johns Hopkins University
    Inventors: Russell A. Fink, David R. Zaret, Rachel B. Stonehirsch, Robert M. Seng, Samantha M. Tyson
  • Patent number: 11086842
    Abstract: A plugin is provided to a service that includes a database for storing data corresponding to transactions received by the service and applied to the database. Upon receipt of a transaction to be performed by the service, the plugin receives a message generated by the service and associated with informing another service of the transaction. The message is stored in the database together with the transaction, the message and transaction thereby being in the same transactional context. Upon the transaction being committed, the message is also processed because the transaction and message are in the same single transactional context within the database.
    Type: Grant
    Filed: June 30, 2016
    Date of Patent: August 10, 2021
    Assignee: EMC IP Holding Company LLC
    Inventors: Amit Lieberman, Jehuda Shemer, Assaf Natanzon, Ron Bigman
  • Patent number: 11068440
    Abstract: A computing system has a central processing unit (CPU), a plurality of n digital data repositories R1-Rn, having a common sector size, a file system, and a digital bus connecting the CPU and the plurality of n digital data repositories R1-Rn. The file system receives an original file to be stored of FS bits in size, creates a new file of NFS bits, comprising all the data structure of the original file, NFS evenly divisible by n and by the common sector size, divides the NFS by n, creating n portions P1-Pn, and stores one portion to each disk in the plural array simultaneously.
    Type: Grant
    Filed: August 17, 2018
    Date of Patent: July 20, 2021
    Inventor: Jimmy C Lin
  • Patent number: 11036692
    Abstract: Various techniques are disclosed herein for storing and managing master data in hierarchical data systems. Several related concepts, embodiments, and examples are disclosed, including techniques for incremental rationalization in a hierarchical data model, techniques for implementing governance pools in a hierarchical data model, techniques for application materialization in a hierarchical data model, techniques for data intersection mastering in a hierarchical data model, techniques for change request visualization in a hierarchical data model, and techniques for hierarchy preparation in a hierarchical data model.
    Type: Grant
    Filed: July 12, 2017
    Date of Patent: June 15, 2021
    Assignee: Oracle International Corporation
    Inventors: Byron Kevin McKenzie, Douglas R. Cosby, Anurag Garg, Rahul R. Kamath
  • Patent number: 10853130
    Abstract: Embodiments in the disclosure are directed to the use of distributed computing to align reads against multiple portions of a reference dataset. Aligned portions of the reference dataset that correspond with an above-threshold alignment score can be assessed for the presence of sparse indicators that can be categorized and used to influence a determination of a state transition likelihood. Various tasks associated with the processing of reads (e.g., alignment, sparse indicator detection, and/or determination of a state transition likelihood) may be able to take advantage of parallel processing and can be distributed among the machines while considering the resource utilization of those machines. Different load-balancing mechanisms can be employed in order to achieve even resource utilization across the machines, and in some cases may involve assessing various processing characteristics that reflect a predicted resource expenditure and/or time profile for each task to be processed by a machine.
    Type: Grant
    Filed: September 19, 2017
    Date of Patent: December 1, 2020
    Assignee: Color Genomics, Inc.
    Inventors: Ryan Barrett, Taylor Sittler, Krishna Pant, Zhenghua Li, Katsuya Noguchi, Nishant Bhat, Othman Laraki, Jeroen Van den Akker, Kurt Smith
  • Patent number: 10831811
    Abstract: A system and method for facilitating machine interpretation of potentially ambiguous input, such as natural language. An example method includes constructing an ontology based on a database schema, wherein the ontology includes one or more indications of relationship strengths characterizing two or more entities of the ontology; collecting context information pertaining to a relevant domain; receiving the potentially ambiguous input; employing the input and the ontology to estimate a meaning of the input using the context information, the one or more indications of relationship strength, and an estimation of a probability that one or more portions of the natural language input refer to a particular entity.
    Type: Grant
    Filed: December 1, 2015
    Date of Patent: November 10, 2020
    Assignee: Oracle International Corporation
    Inventors: William Kraus, Jeremy Ashley, Jatin Thaker
  • Patent number: 10740374
    Abstract: Methods, systems, and computer program products for log-aided automatic query expansion based on model mapping are provided herein. A computer-implemented method includes generating a vector representation for each of multiple words derived from historical user queries, wherein each of said vector representations is based on one or more system logs; generating a vector representation for each of multiple documents in a corpus of documents related to solutions to one or more hardware problems and/or one or more software problems; generating a vector representation for a user query based on the generated vector representation for each of the multiple words derived from the historical user queries; comparing the vector representation for the user query to the vector representation for each of multiple documents in the corpus; and determining one or more documents from the corpus to output in response to the user query based on said comparing.
    Type: Grant
    Filed: June 30, 2016
    Date of Patent: August 11, 2020
    Assignee: International Business Machines Corporation
    Inventors: Yu Deng, Rahul D. Sharnagat, Srikanth G. Tamilselvam
  • Patent number: 10740327
    Abstract: A database system supporting persistent queries, comprising a persistent query service that receives connections and requests from client software applications; and a plurality of network-attached data sources; and a method for providing persistent queries using a persistent query service.
    Type: Grant
    Filed: June 12, 2018
    Date of Patent: August 11, 2020
    Assignee: ARIA SOLUTIONS, INC.
    Inventor: Paul Peloski
  • Patent number: 10733146
    Abstract: An encoding system may include a metadata manager, a key manager, and an encoder. The metadata manager may interface with one or more metadata sources to determine whether to include a metadata item from the one or more metadata sources. The key manager may determine whether the metadata item can be represented using one of already-allocated keys or an inline key must be used to represent the metadata item. The encoder may encode the metadata. If an inline key must be used to represent the metadata item, the encoder may associate the inline key and the type of the metadata item to the media file, and the encoder may encode the metadata item using the inline key in the media file.
    Type: Grant
    Filed: January 22, 2015
    Date of Patent: August 4, 2020
    Assignee: Apple Inc.
    Inventor: Christopher L. Flick
  • Patent number: 10725990
    Abstract: A hashing system can use a set of multiple numbers that are co-prime to the size of a hash table to select a probe offset when collisions occur. Selecting a probe offset that is co-prime to the hash table size ensures that each hash table slot is available for any insert operation. Utilizing different co-prime numbers for different keys helps avoid clustering of items inserted into the hash table. When a collision occurs, the hashing system can compute a next index to check by selecting a probe offset that is located at a computed index on a list of numbers that are each co-prime to the number of slots in the hash table. The hashing system can compute the index into the list of numbers by applying a hash function to the data item and calculating a modulus of the result with respect to a count of the co-prime numbers list.
    Type: Grant
    Filed: December 1, 2015
    Date of Patent: July 28, 2020
    Assignee: Facebook, Inc.
    Inventor: Alex Meyer
  • Patent number: 10552411
    Abstract: Accessing a database utilizing an email service adapter utilizing a computer is presented including: causing the computer to receive an email message from a user at an email server, the email server configured to respond to the email service adapter; processing the email message by the email service adapter, where the email message includes at least a database query; processing the database query with the database; and returning a result email message to the user via the email server, the result email message including at least a database response. In some embodiments, methods further include: when the email message is received by the email server, determining whether the email message is intended for accessing the database; if the email message is not intended for accessing the database, and processing the email message by the email server.
    Type: Grant
    Filed: June 24, 2016
    Date of Patent: February 4, 2020
    Assignee: International Business Machines Corporation
    Inventors: Khalid Albarrak, Ningning Wang, Paul F. Wilms
  • Patent number: 10545989
    Abstract: Computer implemented systems and methods for distributing replica chunks are disclosed. Computing nodes in the network are assigned to zones that correspond to functions performed by the nodes in the network. Replica chunks are likewise associated with the zones that are typically used in processing the replica chunks. When the owner of a replica chunk identifies a new node, it distributes to the new node those replica chunks that are associated with a zone that matches the zone associated with the new node. The owner of the replica chunk is further programmed to receive requests from nodes to subscribe to a data chunk. The node replicates the data chunk to those nodes in the network that have subscribed to the data chunk. When a node no longer requires access to a data chunk, the node unsubscribes from receiving the data chunk.
    Type: Grant
    Filed: November 30, 2015
    Date of Patent: January 28, 2020
    Assignee: Amazon Technologies, Inc.
    Inventors: Pablo Puo Hen Cheng, Rosen Ognyanov Baklov, Igor Gorelik, Jesse Aaron Van Beurden
  • Patent number: 10474630
    Abstract: Superseding a prior version of a document, to which prior version a retention policy or other requirement has been applied, is disclosed. In some embodiments, an attribute of a retention policy indicates whether a document to which the retention policy has been applied is to be superseded by a subsequently created and/or saved version of the document. In some embodiments, the attribute is set by a logic or process configured to apply the retention policy to the document. If the retention policy indicates that supersede is enabled, in various embodiments when a subsequent version is created and/or saved, the prior version is promoted to the final phase of the retention policy that has been applied to it and automatically “qualified” for disposition as indicated in the final phase of the retention policy, without regard to intervening requirements, processes, phases, approvals, retention, waiting, or other periods, etc.
    Type: Grant
    Filed: February 26, 2018
    Date of Patent: November 12, 2019
    Assignee: Open Text SA ULC
    Inventors: David Humby, Fiona Schrader, Steve Sauder, David Mennie, John-David Dorman
  • Patent number: 10474537
    Abstract: Utilizing an incremental backup in a decremental backup system. In one example embodiment, a method for utilizing an incremental backup in a decremental backup system includes creating a base backup that includes all original allocated blocks in a source storage at a first point in time. Next, an incremental backup is created that includes allocated blocks in the source storage that were newly allocated or were changed between the first point in time and a second point in time. The changed allocated blocks in the incremental backup are identified. During a third time period, a decremental backup is created and the incremental backup is ingested into the base backup by copying, into the decremental backup, original allocated blocks from the base backup that correspond to the changed allocated blocks in the incremental backup. Lastly, the newly-allocated blocks and the changed allocated blocks from the incremental backup are added to the base backup.
    Type: Grant
    Filed: February 19, 2016
    Date of Patent: November 12, 2019
    Assignee: STORAGECRAFT TECHNOLOGY CORPORATION
    Inventor: Nathan S. Bushman