Abstract: A system for automatically updating saved query results for a graph responsive to a graph update is disclosed. The system may identify a target constraint responsive to an update to the data graph. The system may use an index of constraints organized by edge. The target constraint specifies a path in a data graph that includes an edge specified in the update. The system may determine a state for the target constraint by traversing the graph via the path and determine based on the state, whether a member node represents a change to the saved query result. The system may then update a saved query result for the query using the member node identified during the traversal in accordance with the change.

Abstract: A system for automatically updating saved query results for a graph responsive to a graph update is disclosed. The system may identify a target constraint responsive to an update to the data graph. The system may use an index of constraints organized by edge. The target constraint specifies a path in a data graph that includes an edge specified in the update. The system may determine a state for the target constraint by traversing the graph via the path and determine based on the state, whether a member node represents a change to the saved query result. The system may then update a saved query result for the query using the member node identified during the traversal in accordance with the change.

Abstract: A system for automatically updating saved query results for a graph responsive to a graph update is disclosed. The system may identify a target constraint responsive to an update to the data graph. The target constraint specifies a path in a data graph that includes an edge specified in the update. The system may determine a state for the target constraint by traversing the graph via the path and determine based on the state, that a collapsed definition for a first query that includes the constraint indicates a member node is responsive to the first query. The system may then update a saved query result for the first query using the member node identified during the traversal in accordance with the collapsed definition.

Abstract: A system for automatically generating entity collections comprises a data graph including entities connected by edges and instructions that cause the computer system to determine a set of entities from the data graph and to determine a set of constraints that has a quantity of constraints. A constraint in the set represents a path in the data graph shared by at least two of the entities in the set of entities. The instructions also cause the computer system to generate candidate collection definitions from combinations of the constraints, where each candidate collection definition identifies at least one constraint and no more than the quantity of constraints. The instructions also cause the computer system to determine an information gain for at least some of the candidate collection definitions, and store at least one candidate collection definition that has an information gain that meets a threshold as a candidate collection.

Abstract: A system for automatically updating saved query results for a graph responsive to a graph update is disclosed. The system may identify a target constraint responsive to an update to the data graph. The target constraint specifies a path in a data graph that includes an edge specified in the update. The system may determine a state for the target constraint by traversing the graph via the path and determine based on the state, that a collapsed definition for a first query that includes the constraint indicates a member node is responsive to the first query. The system may then update a saved query result for the first query using the member node identified during the traversal in accordance with the collapsed definition.

Abstract: An efficient system for evaluating collection membership in a large data graph. The system includes a data graph of nodes connected by edges and an index of constraints from collection definitions, a definition specifying at least one condition with at least one constraint, where a constraint has a constraint type and a constraint expression. Multiple conditions in the definition may be conjunctive. The system may also include instructions that, when executed by the at least one processor, cause the system to: evaluate an edge for a node in the data graph against the index to determine conditions met by the edge and its associated neighborhood, repeat the evaluating for each edge associated with the node in the data graph, determine that conditions for a first collection are met, and generate an indication in the data graph that the node is a member of the first collection.

Abstract: A system for automatically generating entity collections comprises a data graph including entities connected by edges and instructions that cause the computer system to determine a set of entities from the data graph and to determine a set of constraints that has a quantity of constraints. A constraint in the set represents a path in the data graph shared by at least two of the entities in the set of entities. The instructions also cause the computer system to generate candidate collection definitions from combinations of the constraints, where each candidate collection definition identifies at least one constraint and no more than the quantity of constraints. The instructions also cause the computer system to determine an information gain for at least some of the candidate collection definitions, and store at least one candidate collection definition that has an information gain that meets a threshold as a candidate collection.

Abstract: A computer implemented method of processing a digitally encoded document having a text composed by an author by using a processor to analyse the segmentation, punctuation and linguistics of text and storing the results in a digitally accessible format. Author traits are then predicted using a machine learning system based on the results of the segmentation, punctuation and linguistics analysis of the text.

Abstract: A preferred example of the process flow of the inventive method (1) is depicted in FIG. 1). The first step (2) of the method (1) is to import an email document (3) to be parsed. In the preprocessing step (10) the email (3) is processed to determine the presence of any header text (5) (excluding any header text that may be within the embedded reply chain) or attachments 4, including attached email documents, if any. Once the header text (5), attachments (4) or other forwarded materials have been identified in the preprocessing step (10), these components of the email (3) are categorized by the computer (51) as non-author composed text. Next the process flow of the parsing computer (51) moves to the step of normalization (11). This entails processing the email document (3) to ascertain whether it is in a preferred format and, if the email document (3) is not in the preferred format, converting at least some of the information within the email document to the preferred format.

Abstract: A communication station for generating or receiving an angularly dispersed array of radiation beams, comprising an array of radiating elements (100) defining an array antenna (1); and a beam former (120), the beam former comprising a passive network having a first side (X) carrying a plurality of beam ports for electrical signals corresponding to the beams and a second side (Y) carrying a plurality of antenna ports corresponding to the radiating elements, each beam port being connected to a plurality of antenna ports via a network (50) of power divider (52) and phase shifter (53) components, the phase shifts of which are in integer multiples of a predetermined constant, so as to generate the array of beams; in which the array antenna (1) has triangular or hexagonal symmetry and the array of beams has triangular or hexagonal symmetry.

Abstract: An apparatus for the sterilization and secondary packaging into cartons of arrays of blister packages, each of which contains at least one hydrophilic contact lens immersed in a sterile aqueous solution. More specifically, disclosed is an apparatus adapted to provide for the assembly of paired arrays of blister packages which are suitably interleaved and transported in batches of predetermined quantities within one or more trays. These trays are transported to a sterilization chamber for sterilizing the arrays of blister packages, and from which the sterilized arrays of blister packages in which at least the contents thereof are maintained in a sterile condition, and which are then transported to a locale for implementing the secondary packaging thereof into sealable cartons.