-
公开(公告)号：US20180152468A1
公开(公告)日：2018-05-31
申请号：US15568280
申请日：2015-05-28
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor： Igor Nor , Eyal Hayun , Omer Barkol
Abstract: Certain described examples are directed towards analyzing network data. The network data is processed to generate a graph data structure that has edges that are associated with communication times from the network data and nodes that are associated with computer devices. Representations of the graph data structure are generated over time. Given an indication of at least a computing device, for example as involved in anomalous activity or a security incident, the representations of the graph data structure may be used to determine further associated computer devices that are associated with the indicated device.
-
公开(公告)号：US20170147721A1
公开(公告)日：2017-05-25
申请号：US15309836
申请日：2014-05-12
Applicant: Hewlett Packard Enterprise Development LP
Inventor： Inbal Tadeski , Ron Banner , Omer Barkol
CPC classification number: G06F17/5009 , G06F16/337 , G06F16/9535 , G06F17/16 , G06Q10/067 , G06Q30/0201 , G06Q30/0282
Abstract: Described herein are techniques for generating a model based on input. In an example, a first model can be generated based on decomposing a rating matrix into a product of two matrices U and V, where U represents correlations between users and a plurality of factors and V represents correlations between items and the plurality of factors. At least some of the users and items can be grouped into groups according to the correlations. Input on one or more of the groups can be received. A second model can be generated based on the input on the one or more of the groups.
-
公开(公告)号：US20160275205A1
公开(公告)日：2016-09-22
申请号：US15032851
申请日：2013-12-05
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor： David Lehavi , Omer Barkol
CPC classification number: G06F17/30985 , G06F17/2775 , G06F17/30
Abstract: 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.
Abstract translation: 示例实施例涉及正则表达式匹配。 示例性方法可以包括基于表示正则表达式的非确定性有限自动机（NFA）生成数据结构。 数据结构可以包括一组段，其中每个段指示NFA的段起始状态。 每个段可以表示从段开始状态开始的NFA的零个或多个连续状态。 该组段的不同段可能能够指示NFA上不同段的起始状态。 每个段可以表示正则表达式与字符串的部分匹配。 该方法还可以包括分析与NFA相关的字符串。 该方法还可以包括在分析字符串时修改数据结构。 这种修改可以包括尝试扩展集合中的至少一个段以表示NFA的附加状态。
-
公开(公告)号：US10791131B2
公开(公告)日：2020-09-29
申请号：US15568280
申请日：2015-05-28
Applicant: Hewlett Packard Enterprise Development LP
Inventor： Igor Nor , Eyal Hayun , Omer Barkol
Abstract: Certain described examples are directed towards analyzing network data. The network data is processed to generate a graph data structure that has edges that are associated with communication times from the network data and nodes that are associated with computer devices. Representations of the graph data structure are generated over time. Given an indication of at least a computing device, for example as involved in anomalous activity or a security incident, the representations of the graph data structure may be used to determine further associated computer devices that are associated with the indicated device.
-
公开(公告)号：US10579752B2
公开(公告)日：2020-03-03
申请号：US15309836
申请日：2014-05-12
Applicant: Hewlett Packard Enterprise Development LP
Inventor： Inbal Tadeski , Ron Banner , Omer Barkol
IPC: G06F17/50 , G06F16/335 , G06F17/16 , G06Q30/02 , G06F16/9535 , G06Q10/06
Abstract: Described herein are techniques for generating a model based on input. In an example, a first model can be generated based on decomposing a rating matrix into a product of two matrices U and V, where U represents correlations between users and a plurality of factors and V represents correlations between items and the plurality of factors. At least some of the users and items can be grouped into groups according to the correlations. Input on one or more of the groups can be received. A second model can be generated based on the input on the one or more of the groups.
-
Patent Agency Ranking
公开(公告)号：US10540360B2
公开(公告)日：2020-01-21
申请号：US15223271
申请日：2016-07-29
Applicant: Hewlett Packard Enterprise Development LP
Inventor： Igor Nor , Sagi Schein , Omer Barkol , Eyal Hayun
IPC: G06F17/30 , G06F16/2458 , H04L12/24 , G06F16/248 , G06F16/901
Abstract: A method, a computing system, and a non-transitory machine readable storage medium containing instructions for identifying relationships between entities are provided. In an example, the method includes receiving a query. The query specifies a first computing entity, a second computing entity, and a window of time. A data structure is queried based on the query to identify a set of relationship instances each corresponding to a relationship between the first computing entity and the second computing entity during the window of time. A representation of the first computing entity, the second computing entity, and the set of relationship instances is provided at a user interface.
-
公开(公告)号：US20180032588A1
公开(公告)日：2018-02-01
申请号：US15223271
申请日：2016-07-29
Applicant: Hewlett Packard Enterprise Development LP
Inventor： Igor Nor , Sagi Schein , Omer Barkol , Eyal Hayun
Abstract: A method, a computing system, and a non-transitory machine readable storage medium containing instructions for identifying relationships between entities are provided. In an example, the method includes receiving a query. The query specifies a first computing entity, a second computing entity, and a window of time. A data structure is queried based on the query to identify a set of relationship instances each corresponding to a relationship between the first computing entity and the second computing entity during the window of time. A representation of the first computing entity, the second computing entity, and the set of relationship instances is provided at a user interface.
-
公开(公告)号：US20160259641A1
公开(公告)日：2016-09-08
申请号：US15033148
申请日：2013-12-16
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor： Guy Wiener , Omer Barkol
IPC: G06F9/44
Abstract: A data structure is based on examples that include respective program code portions associated with corresponding tags that indicate content of the respective program code portions. A tagger determines at least one tag to associate with a first program code portion based on the data structure. An updated version of the data structure is received, The tagger, which remains unmodified, determines at least one tag to associate with a second program code portion based on the updated version of the data structure.
Abstract translation: 数据结构基于包括与指示相应程序代码部分的内容的相应标签相关联的相应程序代码部分的示例。 标签器基于数据结构确定至少一个标签以与第一程序代码部分相关联。 接收到数据结构的更新版本。保持未修改的标记器基于数据结构的更新版本确定至少一个与第二程序代码部分相关联的标签。
-
公开(公告)号：US10341103B2
公开(公告)日：2019-07-02
申请号：US15325800
申请日：2015-01-29
Applicant: Hewlett Packard Enterprise Development LP
Inventor： Doron Shaked , Omer Barkol
Abstract: Data analytics on encrypted data elements is disclosed. One example is a system including a first data system, a second data system, and a data analytics system. The first data system includes a first data element and a first encryption module with a first private key. The second data system includes a plurality of second data elements and a second encryption module with a second private key. The first encryption module and the second encryption module are communicatively linked to one another, to apply, via the first and second private keys, an encryption protocol to the first data element and the plurality of second data elements to encrypt the data elements. The data analytics system maps the encrypted data elements to an analytics space, performs data analytics based on the mapped data elements, and distributes, via a computing device, results of the data analytics to an information retrieval system.
-
公开(公告)号：US10242125B2
公开(公告)日：2019-03-26
申请号：US15032851
申请日：2013-12-05
Applicant: Hewlett Packard Enterprise Development LP
Inventor： David Lehavi , Omer Barkol
Abstract: 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.
-
-
-
-
-
-
-
-
-
Search Results
10
records
(took 0.052 seconds)
