Patents by Inventor Yuval Nir

Yuval Nir 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).

  • Replication cookie
    Patent number: 9563684
    Abstract: A system, computer program product, and computer implemented method for executing instructions at a replication site with a cookie manager, the method comprising receiving a cookie at the replication site, the cookie enabled to contain executable instructions, and executing the executable instructions contained in the cookie via a cookie manager on the replication site.
    Type: Grant
    Filed: December 31, 2013
    Date of Patent: February 7, 2017
    Assignee: EMC IP HOLDING COMPANY LLC
    Inventors: Assaf Natanzon, Jehuda Shemer, Saar Cohen, Yuval Nir, Lev Ayzenberg
  • Optical implementation of bounded non-deterministic Turing Machines
    Patent number: 7130093
    Abstract: Method and an optical computation device for obtaining an indication about the existence of a feasible solution for a bounded instance of a problem that belongs to the non-deterministic polynomial class of problems, using parallel optical computations employing a multitude of light rays simultaneously propagating along paths in an optical arrangement. An optical arrangement that can implement a universal non deterministic Turing Machine that can solve bounded instances of problems of the class is determined. An initial incoming ray is directed to a point in the optical arrangement, that represents the initial configuration of the universal non deterministic Turing Machine, such that the initial configuration corresponds to the bounded instance. Each incoming ray is split within the optical arrangement into two or more outgoing rays at pre-determined locations in the optical arrangement.
    Type: Grant
    Filed: May 18, 2004
    Date of Patent: October 31, 2006
    Inventors: Shlomo Dolev, Yuval Nir
  • Optical implementation of bounded non-deterministic turing machines
    Publication number: 20050013531
    Abstract: Method and an optical computation device for obtaining an indication about the existence of a feasible solution for a bounded instance of a problem that belongs to the non-deterministic polynomial class of problems, using parallel optical computations employing a multitude of light rays simultaneously propagating along paths in an optical arrangement. An optical arrangement that can implement a universal non deterministic Turing Machine that can solve bounded instances of problems of the class is determined. An initial incoming ray is directed to a point in the optical arrangement, that represents the initial configuration of the universal non deterministic Turing Machine, such that the initial configuration corresponds to the bounded instance. Each incoming ray is split within the optical arrangement into two or more outgoing rays at pre-determined locations in the optical arrangement.
    Type: Application
    Filed: May 18, 2004
    Publication date: January 20, 2005
    Inventors: Shlomo Dolev, Yuval Nir