Hrl Laboratories, LLC

Eric P Tressler

Karim El Defrawy

Joshua W Baron

Kirill Minkovich

Tsai-Ching Lu

Heiko Hoffmann

David L Allen

Hankyu Moon

Aleksey Nogin

Gavin D Holland

David A Jurgens

The present invention relates to a system for graph visualization. The system includes a display and one or more processors with a memory. The processors perform several operations, including receiving as an input a graph G=(V,E), where V is a set of vertices and E is a set of edges between the vertices. The vertices are then randomly distributed through a unit square. The vertices are then arranged to generate an aesthetically pleasing graph, which is displayed on the display.

Graph visualization system based on gravitational forces due to path distance and betweenness centrality

Described is a graph measure that generalizes average path length for measuring network efficiency. A reachability measure for a graph representing a network is determined. The reachability measure is a generalized measurement related to an average path length of the graph which provides a measure of a number of short paths in the graph. The reachability measure is applied to an existing network infrastructure to provide a metric for the efficiency of the existing network infrastructure. The existing network infrastructure can then be improved based on the reachability measure.

Measuring network efficiency

Described is a system for a cloud control operations plane. In operation, a job is broadcast to a plurality of physical hosts, one or more of the physical hosts having a control operations plane (COP) node and a service node associated with the COP node. The COP nodes jointly create a private job assignment. A set of job assignments is redundantly distributed to individual COP nodes pursuant to the private job assignments, such that each individual COP node is only aware of its own assignment and corresponding job. The service nodes then each complete a task associated with the job and generate an output. When a set of service nodes performing a redundant job complete their task, the corresponding COP nodes jointly perform a private result checking protocol to generate a final output. The final output is then sent to the user.

System and method for cloud control operations plane based on proactive security algorithms

Described is a protocol for multi-dimensional secure pattern matching. The protocol is to be evaluated between two parties, P(or Client) and P(or Server). Pholds a multi-dimensional pattern, p, and Pholds a multi-dimensional text T (where both p and T have the same number of dimensions, but where p may be of smaller length in each dimension compared to T). Pand Pwould then engage in a protocol that allows Pto find out whether p is present in T or not. The security and privacy requirements are that Pdoes not learn any information about the pattern p nor the result of the matching. Pshould also not learn any information about T other than whether p is present in it or not. Upon implementation of the protocol, p matches T if there exists an m&#xd7; . . . &#xd7;m sub-hypermatrix (or sub-array) of T that equals p.

Secure multi-dimensional pattern matching for secure search and recognition

Described is a system for detecting insider threats in a network. In detecting the insider threat, the system receives data from the network relevant to network activity and extracts observable actions from the data relevant to a mission. The observable actions are combined to provide contextual cues and reasoning results. Based on the observable actions and reasoning results, proposed security policy updates are proposed to force insiders into using more observable actions. Finally, the system detects potential insider threats through analyzing the observable actions and reasoning results.

System and method for insider threat detection

Described is a system for allowing sets of processors to engage in a secure pattern matching protocol. An input pattern is received from a first set of processors, while a text is received from a second set of processors. A matrix is constructed based on values computed for each character determined by each character's position in the pattern. The first set of processors sends an encrypted matrix to the second set of processors. The second set of processors processes each character in the text and creates a set of vectors. A final activation vector is created based on processing the set of vectors and an encrypted activation vector. The second set of processors sends the final activation vector to the first set of processors. The second set of processors decrypts the final activation vector. The system provides to the first set of processors where the pattern matches the text.

Growing community of inventors

Calabasas, CA, United States of America

Eric P Tressler