会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 13. 发明授权
    • Methods and apparatus for creation of parsing rules
    • 用于创建解析规则的方法和设备
    • US07343604B2
    • 2008-03-11
    • US10627824
    • 2003-07-25
    • Genady GrabarnikSheng MaChang-shing PerngAbdolreza SalahshourDavid H. Thoenen
    • Genady GrabarnikSheng MaChang-shing PerngAbdolreza SalahshourDavid H. Thoenen
    • G06F9/54G06F15/177
    • G06F8/427
    • Techniques for parsing rule creation are provided. A technique for constructing one or more message parsing rules may comprise the following steps. First, message data representing past messages, for example, associated with a network, an application and/or a system being analyzed, is obtained. For example, this may involve reading the past or historical message data from messages logs or having a system point to the message data in existing data storage. Parsing rules are then generated by a process from one or more existing rule templates and/or based on user selection and classification of at least a portion of a message. For example, the user may choose a message part and demonstratively classify the part, for example, as a positive or negative example. The generated rules may then be stored for access by a rule-based parsing system such as a message adaptation system. Prior to generation of the one or more parsing rules, a message structure may be established upon which generation of the rules may be based.
    • 提供了解析规则创建的技术。 用于构建一个或多个消息解析规则的技术可以包括以下步骤。 首先,获得表示与网络相关联的过去消息的消息数据,正在分析的应用和/或系统。 例如,这可能涉及从消息日志中读取过去或历史消息数据或者将系统指向现有数据存储器中的消息数据。 解析规则然后由来自一个或多个现有规则模板的过程和/或基于消息的至少一部分的用户选择和分类生成。 例如,用户可以选择一个消息部分并且将该部分示范地分类,例如,作为肯定或否定的示例。 然后,所生成的规则可以被存储以用于基于规则的解析系统(例如消息适配系统)的访问。 在生成一个或多个解析规则之前,可以建立基于规则的生成的消息结构。
    • 14. 发明授权
    • System and method for systematic construction of correlation rules for event management
    • 系统建立事件管理相关规则的系统和方法
    • US06697791B2
    • 2004-02-24
    • US09849565
    • 2001-05-04
    • Joseph L. HellersteinSheng MaLuanne M. BurnsChang-shing PerngDavid A. Rabenhorst
    • Joseph L. HellersteinSheng MaLuanne M. BurnsChang-shing PerngDavid A. Rabenhorst
    • G06F1700
    • G06N5/025
    • A technique is provided for systematically constructing one or more correlation rules for use by an event management system for managing a network with one or more computing devices. The technique comprises the following steps. First, in association with an event cache, event data representing past or historical events associated with the network of computing devices being managed by the event management system is obtained. Next, a first pattern is found or detected in the obtained event data associated with the event cache. The pattern is then classified. Then, at least one correlation rule is constructed based on the classified pattern. Lastly, in association with the event cache, the one or more events included in the pattern are replaced with a composite or cumulative event such that hierarchical patterns may be subsequently found for use in constructing further correlation rules.
    • 提供了一种用于系统地构建一个或多个相关规则以供事件管理系统用于使用一个或多个计算设备管理网络的技术。 该技术包括以下步骤。 首先,与事件缓存相关联,获得表示由事件管理系统管理的与计算设备的网络相关联的过去或历史事件的事件数据。 接下来,在与事件高速缓存相关联的所获得的事件数据中找到或检测到第一模式。 然后将模式分类。 然后,基于分类模式构建至少一个相关规则。 最后,与事件缓存相关联,包含在模式中的一个或多个事件被替换为复合或累积事件,使得随后可以发现分级模式用于构建进一步的相关规则。
    • 17. 发明授权
    • Peer based event conversion
    • 基于对等的事件转换
    • US07827132B2
    • 2010-11-02
    • US11531901
    • 2006-09-14
    • Genady GrabarnikChang-Shing PerngAbdolreza SalahshourBalan Subramanian
    • Genady GrabarnikChang-Shing PerngAbdolreza SalahshourBalan Subramanian
    • G06E1/00G06E3/00
    • G06F17/2247
    • A rule set to convert an event into a standardized format can be established based on cooperation among peer processing nodes. A processing node that receives the event takes the initial responsibility to convert the event. The responsible processing node initially attempts to convert the event using locally available rules. If the initial attempt fails, the responsible processing node will communicate the event to peer processing nodes and request them to provide conversion rules. Upon receipt of the rules provided by the peer processing nodes, the responsible processing node combines the received rules with the locally available rules to generate a rule set to convert the event. The responsible processing node may also transfer the event to another processing node for the other processing node to take the responsibility to convert the event.
    • 可以基于对等处理节点之间的协作来建立将事件转换成标准格式的规则集。 接收事件的处理节点负责转换事件。 负责的处理节点最初尝试使用本地可用规则转换事件。 如果初始尝试失败,负责的处理节点会将事件传达给对等处理节点,并请求它们提供转换规则。 在接收到对等处理节点提供的规则时,负责处理节点将接收到的规则与本地可用的规则组合以生成用于转换事件的规则集。 负责处理节点还可以将事件传送到另一个处理节点,以便另一个处理节点负责转换事件。
    • 19. 发明授权
    • Method for fast relevance discovery in time series
    • 时间序列快速相关性发现的方法
    • US07447723B2
    • 2008-11-04
    • US11563900
    • 2006-11-28
    • Chang-Shing PerngHaixun Wang
    • Chang-Shing PerngHaixun Wang
    • G06F17/15
    • G06K9/00536
    • A method for measuring time series relevance using state transition points, including inputting time series data and relevance threshold data. Then convert all time series values to ranks within [0,1] interval. Calculate the valid range of the transition point in [0,1]. Afterwards, a verification occurs that a time series Z exists for each pair of time series Z and Y, such that the relevances between X and Z, and between Y and Z are known. Then deduce the relevance of X and Y. The relevance of X and Y must be at least one of, (i) higher, and (ii) lower than, the given threshold. Provided Z is found terminate all remaining calculations for X and Y. Otherwise, segment the time series if no Z time series exists, use the segmented time series to estimate the relevance. Apply a hill climbing algorithm in the valid range to find the true relevance.
    • 一种使用状态转换点来测量时间序列相关性的方法,包括输入时间序列数据和相关阈值数据。 然后将所有时间序列值转换为[0,1]间隔内的等级。 计算[0,1]中转换点的有效范围。 之后,对于每对时间序列Z和Y存在时间序列Z的验证,使得X和Z之间,以及Y和Z之间的相关性是已知的。 然后推导X和Y的相关性.X和Y的相关性必须至少为(i)较高和(ii)低于给定阈值中的一个。 如果Z被找到终止X和Y的所有剩余计算。否则,如果没有Z时间序列,则分段时间序列,使用分段时间序列来估计相关性。 在有效范围内应用爬山算法来找到真正的相关性。
    • 20. 发明授权
    • System and method for indexing weighted-sequences in large databases
    • 用于索引大数据库中加权序列的系统和方法
    • US07418455B2
    • 2008-08-26
    • US10723229
    • 2003-11-26
    • Wei FanChang-Shing PerngHaixun WangPhilip Shi-Lung Yu
    • Wei FanChang-Shing PerngHaixun WangPhilip Shi-Lung Yu
    • G06F7/00G06F17/00
    • G06F17/30327G06F17/30548Y10S707/99943
    • The present invention provides an index structure for managing weighted-sequences in large databases. A weighted-sequence is defined as a two-dimensional structure in which each element in the sequence is associated with a weight. A series of network events, for instance, is a weighted-sequence because each event is associated with a timestamp. Querying a large sequence database by events' occurrence patterns is a first step towards understanding the temporal causal relationships among the events. The index structure proposed herein enables the efficient retrieval from the database of all subsequences (contiguous and non-contiguous) that match a given query sequence both by events and by weights. The index structure also takes into consideration the nonuniform frequency distribution of events in the sequence data.
    • 本发明提供了一种用于在大数据库中管理加权序列的索引结构。 加权序列被定义为二维结构,其中序列中的每个元素与权重相关联。 例如,一系列网络事件是加权序列,因为每个事件都与时间戳相关联。 通过事件发生模式查询大序列数据库是了解事件之间的时间因果关系的第一步。 这里提出的索引结构使得能够通过事件和权重从数据库有效地检索与给定查询序列匹配的所有子序列(连续的和不连续的)。 索引结构还考虑了序列数据中事件的不均匀频率分布。