公开(公告)号：US20140033091A1

公开(公告)日：2014-01-30

申请号：US14009580

申请日：2011-05-06

Applicant: Sagi Schein ,  Omer Barkol ,  Ruth Bergman ,  David Lehavi ,  Ayelel Pnueli ,  Yonathan Livny

Inventor： Sagi Schein ,  Omer Barkol ,  Ruth Bergman ,  David Lehavi ,  Ayelel Pnueli ,  Yonathan Livny

IPC: G06F3/0481

CPC classification number: G06F3/0481 ,  G06F9/451 ,  G06F9/45512 ,  G06F11/3688

Abstract: In one implementation, an image-based automation process includes identifying a graphical object of a graphical user interface and performing an action relative to the graphical object at the graphical user interface. The identifying is based on an image including the graphical object.

Abstract translation: 在一个实现中，基于图像的自动化过程包括识别图形用户界面的图形对象并且在图形用户界面处执行相对于图形对象的动作。 识别基于包括图形对象的图像。

公开(公告)号：US20150127694A1

公开(公告)日：2015-05-07

申请号：US14397717

申请日：2012-07-30

Applicant: David Lehavi ,  Sagi Schein

Inventor： David Lehavi ,  Sagi Schein

IPC: G06F17/10

CPC classification number: G06F17/10 ,  G06F17/16 ,  G06K9/6247 ,  G06K9/6287

Abstract: A non-transitory storage device containing software than, when executed by a processor, causes the processor to generate a projection set of polynomials based on a projection of a space linear combination of candidate polynomials of degree d on polynomials of degree less than d that do not evaluate to less than a threshold on a set of points. The software also causes the processor to compute the singular value decomposition of a matrix containing the difference between candidate polynomials evaluated on the points and the projection set of polynomials evaluated on the points, and to partition the polynomials resulting from the singular value decomposition based on a threshold.

Abstract translation: 包含软件的非瞬时存储设备，当由处理器执行时，使得处理器基于d度多项式的候选多项式的空间线性组合的投影来生成多项式的投影集，该多项式小于d的多项式 在一组点上不评估小于阈值。 软件还使得处理器计算包含在点上评估的候选多项式与在点上评估的多项式的投影集之间的差异的矩阵的奇异值分解，并且根据单数值分解得到的多项式进行分割 阈。

公开(公告)号：US20120296996A1

公开(公告)日：2012-11-22

申请号：US13521802

申请日：2011-01-12

Applicant: David Lehavi ,  Ariel Shaqed

Inventor： David Lehavi ,  Ariel Shaqed

IPC: G06F15/16

CPC classification number: H04L41/0681 ,  H04L43/16 ,  H04L43/18

Abstract: The invention provides a method and system for fusing message paths that occurred in a first domain in a communication network, with message paths that occurred in a second domain in the communication network a communication channel exists between the two domains. A first message path that occurred in the first domain and included a message sent to the second domain along the communication channel is fused to a second path that occurred in the second domain that included the message received from the first domain. Each message that is transmitted in the communication channel between the two domains is assigned a message unique identifier that allows each domain to associate a message sent from one domain to the other with a response message sent in the opposite direction.

Abstract translation: 本发明提供了一种用于融合在通信网络中的第一域中发生的消息路径的方法和系统，其中在通信网络中的第二域中发生消息路径，在两个域之间存在通信信道。 发生在第一域中并且包括沿着通信信道发送到第二域的消息的第一消息路径被融合到在包括从第一域接收的消息的第二域中发生的第二路径。 在两个域之间的通信信道中发送的每个消息被分配消息唯一标识符，其允许每个域将从一个域发送的消息与另一个域发送的消息与相反方向发送的响应消息相关联。

公开(公告)号：US20140035954A1

公开(公告)日：2014-02-06

申请号：US13563690

申请日：2012-07-31

Applicant: David LEHAVI ,  Hila NACHLIELI ,  Sagi SCHEIN

Inventor： David LEHAVI ,  Hila NACHLIELI ,  Sagi SCHEIN

IPC: G06T3/40

CPC classification number: G06T3/40 ,  G06K9/6287

Abstract: A method includes obtaining, by executing a module stored on a non-transitory computer-readable storage device, approximately-zero polynomials for each of multiple classes. The method further includes evaluating the approximately-zero polynomials for each class on a plurality of points to compute distances from each point to each of the classes. The method also includes scaling the approximately-zero polynomials based on the distances and classifying the points based on the scaled approximately-zero polynomials.

Abstract translation: 一种方法包括通过执行存储在非暂时计算机可读存储设备上的模块来获得针对多个类别中的每一个的近似零多项式。 该方法还包括评估多个点上的每个类的近似零多项式以计算从每个点到每个类的距离。 该方法还包括基于距离缩放近似零多项式并基于缩放的近似零多项式对点进行分类。

公开(公告)号：US20130132961A1

公开(公告)日：2013-05-23

申请号：US13301301

申请日：2011-11-21

Applicant: David Lehavi ,  Sagi Schein

Inventor： David Lehavi ,  Sagi Schein

IPC: G06F9/46

CPC classification number: G06F9/5027 ,  G06F2209/503

Abstract: Tasks are mapped to execution threads of a parallel processing device. Tasks are mapped from the list of tasks to execution threads of the parallel processing device that are free. The parallel processing device is allowed to perform the tasks mapped to the execution threads of the parallel processing device for a predetermined number of execution cycles. When the parallel processing device has performed the tasks mapped to the execution threads of the parallel processing device for the predetermined number of execution cycles, the parallel processing device is suspended from further performing the tasks to allow the parallel processing device to determine which execution threads have completed performance of mapped tasks and are therefore free.

Abstract translation: 任务映射到并行处理设备的执行线程。 任务从任务列表映射到并行处理设备的空闲执行线程。 允许并行处理设备执行映射到并行处理设备的执行线程的任务达预定数量的执行周期。 当并行处理装置在预定数量的执行周期中执行映射到并行处理装置的执行线程的任务时，暂停并行处理装置进一步执行任务以允许并行处理装置确定哪个执行线程具有 完成映射任务的性能，因此是免费的。

公开(公告)号：US20120179740A1

公开(公告)日：2012-07-12

申请号：US13496345

申请日：2010-09-21

Applicant: Ariel Shaqed ,  David Lehavi

Inventor： Ariel Shaqed ,  David Lehavi

IPC: G06F15/16

CPC classification number: H04L41/0681 ,  H04L41/142 ,  H04L43/16

Abstract: In a distributed information network, a method and system for assembling messages in an input set of messages into one or more message assemblies. The method involves constructing an initial directed graph of the set of messages, wherein the directed graph consists of pairs of a first vertex and a second vertex, wherein, for each message in the set of messages, a first vertex is an the out node of the message and the second vertex is the in node of the message. A connectivity matrix is defined on the initial directed graph that is modified in an iterative process. A final directed graph is produced that is partitioned into disjoint subgraphs, each subgraph being an assembly of messages from the input message set.

Abstract translation: 在分布式信息网络中，用于将输入消息集合中的消息组合成一个或多个消息组件的方法和系统。 该方法包括构建消息集合的初始有向图，其中有向图由第一顶点和第二顶点的对构成，其中，对于消息集合中的每个消息，第一顶点是 消息和第二个顶点是消息的in节点。 在迭代过程中修改的初始有向图上定义连接矩阵。 产生最终有向图，其被划分为不相交的子图，每个子图是来自输入消息集的消息的汇编。

公开(公告)号：US09703755B2

公开(公告)日：2017-07-11

申请号：US14397717

申请日：2012-07-30

Applicant: David Lehavi ,  Sagi Schein

Inventor： David Lehavi ,  Sagi Schein

IPC: G06F17/10 ,  G06F17/16 ,  G06K9/62

CPC classification number: G06F17/10 ,  G06F17/16 ,  G06K9/6247 ,  G06K9/6287

Abstract: A non-transitory storage device containing software than, when executed by a processor, causes the processor to generate a projection set of polynomials based on a projection of a space linear combination of candidate polynomials of degree d on polynomials of degree less than d that do not evaluate to less than a threshold on a set of points. The software also causes the processor to compute the singular value decomposition of a matrix containing the difference between candidate polynomials evaluated on the points and the projection set of polynomials evaluated on the points, and to partition the polynomials resulting from the singular value decomposition based on a threshold.

公开(公告)号：US09606897B2

公开(公告)日：2017-03-28

申请号：US13162063

申请日：2011-06-16

Applicant: David Lehavi ,  Omer Barkol

Inventor： David Lehavi ,  Omer Barkol

IPC: G06F17/27 ,  G06F11/36 ,  G06F11/34

CPC classification number: G06F11/3668 ,  G06F11/3438 ,  G06F11/3612 ,  G06F17/2705

Abstract: A method for automated semantic parsing of an image of a structured document includes acquiring the image of the structured document. The image of the structured document is lexed so as to associate each image element of a plurality of image elements of the image with a predefined token. A user defined template of expected semantically significant elements of the structured document is input into a parser, the expected elements being defined in a visibly pushdown language (VPL) format. The tokens are parsed into the expected elements. A computer readable medium containing executable instructions and a system are also described.

公开(公告)号：US08533279B2

公开(公告)日：2013-09-10

申请号：US13496345

申请日：2010-09-21

Applicant: Ariel Shaqed ,  David Lehavi

Inventor： Ariel Shaqed ,  David Lehavi

IPC: G06F15/16

CPC classification number: H04L41/0681 ,  H04L41/142 ,  H04L43/16

Abstract: In a distributed information network, a method and system for assembling messages in an input set of messages into one or more message assemblies. The method involves constructing an initial directed graph of the set of messages, wherein the directed graph consists of pairs of a first vertex and a second vertex, wherein, for each message in the set of messages, a first vertex is an the out node of the message and the second vertex is the in node of the message. A connectivity matrix is defined on the initial directed graph that is modified in an iterative process. A final directed graph is produced that is partitioned into disjoint subgraphs, each subgraph being an assembly of messages from the input message set.

Abstract translation: 在分布式信息网络中，用于将输入消息集合中的消息组合成一个或多个消息组件的方法和系统。 该方法包括构建消息集合的初始有向图，其中有向图由第一顶点和第二顶点的对构成，其中，对于消息集合中的每个消息，第一顶点是 消息和第二个顶点是消息的in节点。 在迭代过程中修改的初始有向图上定义连接矩阵。 产生最终有向图，其被划分为不相交的子图，每个子图是来自输入消息集的消息的汇编。

公开(公告)号：US08438262B2

公开(公告)日：2013-05-07

申请号：US13521802

申请日：2011-01-12

Applicant: David Lehavi ,  Ariel Shaqed

Inventor： David Lehavi ,  Ariel Shaqed

IPC: G06F15/173

CPC classification number: H04L41/0681 ,  H04L43/16 ,  H04L43/18

Abstract: The invention provides a method and system for fusing message paths that occurred in a first domain in a communication network, with message paths that occurred in a second domain in the communication network a communication channel exists between the two domains. A first message path that occurred in the first domain and included a message sent to the second domain along the communication channel is fused to a second path that occurred in the second domain that included the message received from the first domain. Each message that is transmitted in the communication channel between the two domains is assigned a message unique identifier that allows each domain to associate a message sent from one domain to the other with a response message sent in the opposite direction.

Abstract translation: 本发明提供了一种用于融合在通信网络中的第一域中发生的消息路径的方法和系统，其中在通信网络中的第二域中发生消息路径，在两个域之间存在通信信道。 发生在第一域中并且包括沿着通信信道发送到第二域的消息的第一消息路径被融合到在包括从第一域接收的消息的第二域中发生的第二路径。 在两个域之间的通信信道中发送的每个消息被分配消息唯一标识符，其允许每个域将从一个域发送的消息与另一个域发送的消息与相反方向发送的响应消息相关联。