Patents by Inventor Shai Lubliner

Shai Lubliner has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • STORAGE, TRANSFER AND COMPRESSON OF NEXT GENERATION SEQUENCING DATA
    Publication number: 20180152535
    Abstract: A computer appliance including a front-end interface communicating with a client computer, a back-end interface communicating with a storage, a compressor receiving native next generation sequencing (NGS) data from an application running on the client computer via the front-end interface, the application being programmed to process native NGS data, adding a compressed form of the native NGS data into a portion of an encoded data file or data object, and storing the portion of the encoded data file or data object in the storage via the back-end interface, and a decompressor receiving a portion of an encoded data file or data object from the storage via the back-end interface, decompressing the portion of the encoded data file or data object to generate therefrom native NGS data, and transmitting the native NGS data to the client via the front-end interface, for use by the application running on the client.
    Type: Application
    Filed: May 2, 2016
    Publication date: May 31, 2018
    Inventors: Dan Sade, Shai Lubliner, Arie Keshet, Eran Segal, Itay Sela
  • Determining compliance rates for probabilistic requests
    Patent number: 8140457
    Abstract: Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.
    Type: Grant
    Filed: July 9, 2008
    Date of Patent: March 20, 2012
    Assignee: International Business Machines Corporation
    Inventors: Shady Copty, Roy Emek, Itai Jaeger, Yoav Katz, Shai Lubliner
  • DETERMINING COMPLIANCE RATES FOR PROBABILISTIC REQUESTS
    Publication number: 20100010950
    Abstract: Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.
    Type: Application
    Filed: July 9, 2008
    Publication date: January 14, 2010
    Inventors: SHADY COPTY, ROY EMEK, ITAI JAEGER, YOAV KATZ, SHAI LUBLINER
  • Determining compliance rates for probabilistic requests
    Patent number: 7415444
    Abstract: Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.
    Type: Grant
    Filed: May 18, 2006
    Date of Patent: August 19, 2008
    Assignee: International Business Machines Corporation
    Inventors: Shady Copty, Roy Emek, Itai Jaeger, Yoav Katz, Shai Lubliner
  • DETERMINING COMPLIANCE RATES FOR PROBABILISTIC REQUESTS
    Publication number: 20080189230
    Abstract: Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.
    Type: Application
    Filed: April 3, 2008
    Publication date: August 7, 2008
    Applicant: International Business Machines Corporation
    Inventors: Shady Copty, Roy Emek, Itai Jaeger, Yoav Katz, Shai Lubliner
  • Determining Compliance Rates for Probabilistic Requests
    Publication number: 20070271207
    Abstract: Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.
    Type: Application
    Filed: May 18, 2006
    Publication date: November 22, 2007
    Inventors: Shady Copty, Roy Emek, Itai Jaeger, Yoav Katz, Shai Lubliner