Patents by Inventor Eyal Goren

Eyal Goren 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).

  • Publication number: 20200296003
    Abstract: At each delegate device and each non-delegate device of a logical device hierarchy, a data cube is generated. The logical device hierarchy includes more than one level, and each level includes one or more groups, and each group includes one delegate device and one or more non-delegate devices. At each delegate device, data cubes are received from the one or more non-delegate devices associated with the same group. At each delegate device, data cubes are received from delegate devices of a different group, and that delegate device is the parent of the delegate devices associated with a different group. At each delegate device, the received data cubes are aggregated into a weighted data cube. From each delegate device, the weighted data cube are outputted to the parent of the delegate device.
    Type: Application
    Filed: June 2, 2020
    Publication date: September 17, 2020
    Inventors: Michal Keidar, Eyal Barlev, Ido Goren
  • Patent number: 10715394
    Abstract: At each delegate device and each non-delegate device of a logical device hierarchy, a data cube is generated. The logical device hierarchy includes more than one level, and each level includes one or more groups, and each group includes one delegate device and one or more non-delegate devices. At each delegate device, data cubes are received from the one or more non-delegate devices associated with the same group. At each delegate device, data cubes are received from delegate devices of a different group, and that delegate device is the parent of the delegate devices associated with a different group. At each delegate device, the received data cubes are aggregated into a weighted data cube. From each delegate device, the weighted data cube are outputted to the parent of the delegate device.
    Type: Grant
    Filed: October 29, 2018
    Date of Patent: July 14, 2020
    Assignee: SAP Portals Israel Ltd.
    Inventors: Michal Keidar, Eyal Barlev, Ido Goren
  • Publication number: 20200136915
    Abstract: At each delegate device and each non-delegate device of a logical device hierarchy, a data cube is generated. The logical device hierarchy includes more than one level, and each level includes one or more groups, and each group includes one delegate device and one or more non-delegate devices. At each delegate device, data cubes are received from the one or more non-delegate devices associated with the same group. At each delegate device, data cubes are received from delegate devices of a different group, and that delegate device is the parent of the delegate devices associated with a different group. At each delegate device, the received data cubes are aggregated into a weighted data cube. From each delegate device, the weighted data cube are outputted to the parent of the delegate device.
    Type: Application
    Filed: October 29, 2018
    Publication date: April 30, 2020
    Inventors: Michal Keidar, Eyal Barlev, Ido Goren
  • Publication number: 20200031577
    Abstract: An inventory handling system includes multiple shelving units for mounting over a horizontal floor. Each shelving unit contains a vertical array of shelves on which containers are placed. One or more floor robots travel among the shelving units along first paths on the floor. One or more lift robots move independently of the floor robots along second paths in a vertical plane over vertical faces of the shelving units, and transfer the containers between the shelves and the floor robots.
    Type: Application
    Filed: October 8, 2019
    Publication date: January 30, 2020
    Inventors: Elram Goren, Eyal Goren, Shay Cohen, Ori Avraham, Guy Blotnick, David Grosman
  • Publication number: 20190378232
    Abstract: A method, system and product for using multiple packing stations in delivery of goods. A packing scheme is determined for an order based on an optimality criteria, the scheme comprising a division of a set of items between packing stations, whereby defining one or more subsets of the set of items. The packing scheme further comprising an ordering of the one or more subsets and packing stations paired therewith, by which ordering the paired packing stations are to be utilized for packing the set of items and transporting thereof to the destination, wherein in each packing station, a respective portion of the set of items is to be packed and transported therefrom. Responsive to the optimality criteria being met, instructions for executing the order are issued, whereby the set of items are packed and transported according to the packing scheme.
    Type: Application
    Filed: February 11, 2018
    Publication date: December 12, 2019
    Inventors: Eyal Goren, Elram Goren, Shmuel Ur
  • Patent number: 10472172
    Abstract: An inventory handling system (20, 150) includes multiple shelving units (22) for mounting over a horizontal floor (24). Each shelving unit contains a vertical array of shelves (28) on which containers (30) are placed. One or more floor robots (36) travel among the shelving units along first paths on the floor. One or more lift robots (32, 80, 120, 152) move independently of the floor robots along second paths in a vertical plane over vertical faces of the shelving units, and transfer the containers between the shelves and the floor robots.
    Type: Grant
    Filed: June 8, 2016
    Date of Patent: November 12, 2019
    Assignee: COMMONSENSE ROBOTICS LTD.
    Inventors: Elram Goren, Eyal Goren, Shay Cohen, Ori Avraham, Guy Blotnick, David Grosman
  • Publication number: 20170267452
    Abstract: An inventory handling system (20, 150) includes multiple shelving units (22) for mounting over a horizontal floor (24). Each shelving unit contains a vertical array of shelves (28) on which containers (30) are placed. One or more floor robots (36) travel among the shelving units along first paths on the floor. One or more lift robots (32, 80, 120, 152) move independently of the floor robots along second paths in a vertical plane over vertical faces of the shelving units, and transfer the containers between the shelves and the floor robots.
    Type: Application
    Filed: June 8, 2016
    Publication date: September 21, 2017
    Inventors: Elram GOREN, Eyal GOREN, Shay COHEN, Ori AVRAHAM, Guy BLOTNICK, David GROSMAN
  • Publication number: 20070180012
    Abstract: Function properties may be approximated using an expander graph. For example, an approximate average of a function may be determined by randomly exploring an expander graph. Values of the function are associated with vertices of the expander graph. The expander graph is randomly explored by traversing edges and encountering vertices. The exploration may comprise a crawl, a walk, and so forth. An approximate average of the function is determined based on the function values that are associated with encountered vertices.
    Type: Application
    Filed: January 19, 2006
    Publication date: August 2, 2007
    Applicant: Microsoft Corporation
    Inventors: Kristin Lauter, Denis Charles, Eyal Goren
  • Publication number: 20070165846
    Abstract: Pscudorandom numbers may be generated from input seeds using expander graphs. Expander graphs are a collection of vertices that are interconnected via edges. Generally, a walk around an expander graph is determined responsive to an input seed, and a pseudorandom number is produced based on vertex names. Specifically, a next edge, which is one of multiple edges emanating from a current vertex, is selected responsive to an extracted seed chunk. The next edge is traversed to reach a next vertex. The name of the next vertex is ascertained and used as a portion of the pseudorandom number being produced by the walk around the expander graph.
    Type: Application
    Filed: January 19, 2006
    Publication date: July 19, 2007
    Applicant: Microsoft Corporation
    Inventors: Kristin Lauter, Denis Charles, Eyal Goren
  • Publication number: 20070098150
    Abstract: Hash function constructions from expander graphs are described. In one aspect, an expander graph is walked to compute a hash function. The expander graph is walked using respective subsets of an input message. A label of a last vertex walked is an output of the hash function.
    Type: Application
    Filed: November 1, 2005
    Publication date: May 3, 2007
    Applicant: Microsoft Corporation
    Inventors: Kristin Lauter, Denis Charles, Eyal Goren