Hewlett-packard Development Company, L.p.

Hewlett Packard Enterprise Development LP

Entit Software LLC

Yowza Ltd.

Trading Systems Associates (ts-a) (israel) Limited

Correlix Ltd.

David Lehavi

Sagi Schein

Omer Barkol

Hila Nachlieli

Ariel Shaqed

Ruth Bergman

Eyal Fink

Naomi Keren

Yonathan Livny

Shir Peled

Ayelel Pnueli

Example embodiments relate to regular expression matching. An example method may include generating a data structure based on a non-deterministic finite automaton (NFA) that represents a regular expression. The data structure may include a set of segments where each segment indicates a segment starting state of the NFA. Each segment may represent zero or more consecutive states of the NFA starting at the segment starting state. Different segments of the set of segments may be capable of indicating different segment starting states on the NFA. Each segment may represent a partial match of the regular expression to the string. The method may further include analyzing the string in relation to the NFA. The method may further include modifying the data structure as the string is analyzed. Such modification may include attempting to expand at least one of the segments in the set to represent additional states of the NFA.

Regular expression matching

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.

Image-based automation systems and methods

A method, comprising receiving or calculating first information about a representation of a first object; receiving or calculating second information about a representation of a second object; calculating, based on the first information, an orbit-responsive representation of the first object; calculating, based on the second information, multiple intermediate representations of the second object; wherein each intermediate representation is orbit responsive and transformation responsive; wherein different intermediate representations correspond to different transformations of the octahedral group; and determining a misalignment between a preliminary representation of the first object and a preliminary representation of the second object based on a relationship between the first information and each of the intermediate representations.

Highly accurate alignment between three dimensional objects

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.

Generating and partitioning polynomials

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.

Parsing an image of a visually structured document

A non-transitory computer readable medium that stores instructions that once executed by a computer cause the computer to execute the stages of: calculating first curvature attributes of first areas of a first representation of a first three dimensional object; calculating second curvature attributes of second areas of a second representation of a second three dimensional object; selecting first points of interest of the first representation in response to the first curvature attributes; selecting second points of interest of the second representation in response to the second curvature attributes; classifying the first points of interest to first classes; classifying the second points of interest to second classes; calculating multiple sets of first vectors that are indicative of spatial relationships between first points of interest, wherein different sets out of the multiple sets of the first vectors are associated with different first classes; calculating multiple sets of second vectors that are indicative of spatial relationships between second points of interest, wherein different sets out of the multiple sets of the second vectors are associated with different second classes; and determining a misalignment between the first and second representations of the first and second objects in response to relationships between the multiple sets of first vectors and the multiple sets of the second vectors.

Point of interest based alignment of representations of three dimensional objects

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.

Multiclass classification of points

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.

Mapping tasks to execution threads

A method for compressing a plurality of coordinates includes obtaining a plurality of approximately-zero polynomials of dimension dim for a plurality of coordinate parameters. The method further includes selecting dim+1 non-approximately-zero polynomials, and providing a compressed data set that includes the approximately-zero polynomials, the dim+1 non-approximately-zero polynomials, and evaluations of the selected dim+1 non-approximately-zero polynomials based on the coordinates.

Coordinate compression using polynomials

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.

Method and system for reconstructing transactions in a communication network

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.

Growing community of inventors

Haifa, Israel

David Lehavi