-
31.发明申请Methods, systems, and computer program products for event decomposition using rule-based directives and computed keys 失效使用基于规则的指令和计算密钥进行事件分解的方法，系统和计算机程序产品公开(公告)号：US20060053477A1
公开(公告)日：2006-03-09
申请号：US10935035
申请日：2004-09-07
CPC分类号： G06F11/0769 , G06F11/0709 , G06F11/3006 , G06F11/3068 , H04L41/06 , H04L41/16
摘要： Methods, systems, and computer program products for generating a common event format representation of information from a plurality of messages include parsing a rule associated with a current message to determine if a property of a common event format representation for the current message is to be populated with a property value from a previous message. If the rule specifies to obtain the property value from the previous message, the property value is obtained from the previous message and the common event format representation for the current message is populated with the obtained property value from the previous message. The property value may be obtained by generating a computed key based on properties of the current message that are common to the previous message, and identifying the previous message based on the key of the current message. The rule associated with the current message may also be parsed to determine if the property of the common event format representation for the current message is to be populated with a property value determined by specified code. If the rule specifies to obtain the property value using the specified code, the property value is obtained using the specified code and the common event format representation for the current message is populated with the obtained property value obtained using the specified code.
摘要翻译： 用于生成来自多个消息的信息的公共事件格式表示的方法，系统和计算机程序产品包括解析与当前消息相关联的规则，以确定是否要填充当前消息的公共事件格式表示的属性 具有来自先前消息的属性值。 如果规则指定从先前消息获取属性值，则从先前的消息获得属性值，并且使用从先前消息获取的属性值填充当前消息的公共事件格式表示。 可以通过基于当前消息的属性生成与先前消息相同的计算密钥并且基于当前消息的密钥来识别先前消息来获得属性值。 还可以解析与当前消息相关联的规则，以确定当前消息的公共事件格式表示的属性是否由用指定代码确定的属性值填充。 如果规则指定使用指定的代码获取属性值，则使用指定的代码获取属性值，并使用获取的使用指定代码获取的属性值填充当前消息的公共事件格式表示。
-
公开(公告)号：US20050081082A1
公开(公告)日：2005-04-14
申请号：US10676244
申请日：2003-09-30
申请人： Mark Brodie , Sheng Ma , Irina Rish
发明人： Mark Brodie , Sheng Ma , Irina Rish
IPC分类号： G06F11/00
CPC分类号： H04L43/12 , H04L43/0805
摘要： The deployment of probing technology for the purpose of problem determination in a server or network element is disclosed. One can actively select which probes to send in order to be able to diagnose problems which one is particularly interested in, allowing for greater flexibility and efficiency. The extra load imposed on a network by the use of probes is small, especially if the algorithms described in this disclosure are used.
摘要翻译： 公开了在服务器或网络元件中部署用于问题确定的探测技术。 人们可以主动选择要发送的探针，以便能够诊断一个特别感兴趣的问题，从而允许更大的灵活性和效率。 通过使用探针对网络施加的额外负载很小，特别是如果使用本公开中描述的算法。
-
公开(公告)号：US06829608B2
公开(公告)日：2004-12-07
申请号：US09918253
申请日：2001-07-30
申请人： Sheng Ma , Joseph L. Hellerstein
发明人： Sheng Ma , Joseph L. Hellerstein
IPC分类号： G06F1730
CPC分类号： G06F7/02 , G06F2207/025 , Y10S707/99931 , Y10S707/99936 , Y10S707/99937 , Y10S707/99942
摘要： A new form of pattern is provided, referred to as a mutual dependence pattern or m-pattern. The m-pattern captures mutual dependence among a set of items. Intuitively, the m-pattern represents a set of items that often occur together. In our experience, such m-patterns often provide great values for certain tasks, such as event correlation in event management. Further, an efficient algorithm is provided for discovering all m-patterns in data for a given minimum mutual dependence threshold. Specifically, a linear algorithm is provided for testing whether a pattern is an m-pattern. Further, a pruning algorithm is provided that prunes the search space effectively. Still further, a level-wise algorithm for mining m-patterns is provided.
摘要翻译： 提供了一种新的图案形式，称为相互依赖模式或m模式。 m模式捕获一组项目之间的相互依赖。 直观地，m模式表示经常一起出现的一组项目。 在我们的经验中，这种m模式通常为某些任务提供很大的价值，例如事件管理中的事件相关性。 此外，提供了一种用于针对给定的最小相互依赖阈值发现数据中的所有m模式的有效算法。 具体地说，提供一种用于测试图案是否是m图案的线性算法。 此外，还提供了一种有效修剪搜索空间的修剪算法。 此外，提供了用于挖掘m图案的级别算法。
-
公开(公告)号：US09009301B2
公开(公告)日：2015-04-14
申请号：US13347860
申请日：2012-01-11
申请人： Mark A. Brodie , Genady Grabarnik , Sheng Ma , Natalia V. Odintsova , Irina Rish
发明人： Mark A. Brodie , Genady Grabarnik , Sheng Ma , Natalia V. Odintsova , Irina Rish
IPC分类号： G06F15/177 , H04L12/26
摘要： Improved problem diagnosis techniques for use in accordance with computing systems, e.g., distributed computing systems, are disclosed. In one aspect of the invention, a technique for diagnosing a problem associated with a computing system comprises the following steps/operations. One or more probes are executed in accordance with at least a portion of a previously selected probe schedule. When a result of one or more of the probes of the previously selected probe schedule indicates, at least, a potential problem associated with the computing system, one or more probes which optimize at least one criterion are selected in real-time. The one or more selected probes are executed so as to diagnose the potential problem.
摘要翻译： 公开了根据计算系统（例如分布式计算系统）使用的改进的问题诊断技术。 在本发明的一个方面，用于诊断与计算系统相关联的问题的技术包括以下步骤/操作。 根据先前选择的探针调度的至少一部分来执行一个或多个探针。 当先前选择的探针计划的一个或多个探针的结果至少指示与计算系统相关联的潜在问题时，实时选择优化至少一个标准的一个或多个探针。 执行一个或多个选择的探针以便诊断潜在的问题。
-
公开(公告)号：US07769899B2
公开(公告)日：2010-08-03
申请号：US12134940
申请日：2008-06-06
IPC分类号： G06F15/16 , G06F15/173 , G06F9/54
CPC分类号： G06F11/0769 , G06F11/0709 , G06F11/3006 , G06F11/3068 , H04L41/06 , H04L41/16
摘要： Methods, systems, and computer program products for generating a common event format representation of information from a plurality of messages include parsing a rule associated with a current message to determine if a property of a common event format representation for the current message is to be populated with a property value from a previous message. If the rule specifies to obtain the property value from the previous message, the property value is obtained from the previous message and the common event format representation for the current message is populated with the obtained property value from the previous message. The property value may be obtained by generating a computed key based on properties of the current message that are common to the previous message, and identifying the previous message based on the key of the current message. The rule associated with the current message may also be parsed to determine if the property of the common event format representation for the current message is to be populated with a property value determined by specified code. If the rule specifies to obtain the property value using the specified code, the property value is obtained using the specified code and the common event format representation for the current message is populated with the obtained property value obtained using the specified code.
摘要翻译： 用于生成来自多个消息的信息的公共事件格式表示的方法，系统和计算机程序产品包括解析与当前消息相关联的规则，以确定是否要填充当前消息的公共事件格式表示的属性 具有来自先前消息的属性值。 如果规则指定从先前消息获取属性值，则从先前的消息获得属性值，并且使用从先前消息获取的属性值填充当前消息的公共事件格式表示。 可以通过基于当前消息的属性生成与先前消息相同的计算密钥并且基于当前消息的密钥来识别先前消息来获得属性值。 还可以解析与当前消息相关联的规则，以确定当前消息的公共事件格式表示的属性是否由用指定代码确定的属性值填充。 如果规则指定使用指定的代码获取属性值，则使用指定的代码获取属性值，并使用获取的使用指定代码获取的属性值填充当前消息的公共事件格式表示。
-
36.发明申请公开(公告)号：US20080232262A1
公开(公告)日：2008-09-25
申请号：US11687750
申请日：2007-03-19
申请人： Alina Beygelzimer , Shang Q. Guo , Sheng Ma , Natalia Odintsova , Irina Rish
发明人： Alina Beygelzimer , Shang Q. Guo , Sheng Ma , Natalia Odintsova , Irina Rish
IPC分类号： H04L1/00
CPC分类号： H04L41/12 , H04L41/0213
摘要： Improved network topology discovery techniques are disclosed. For example, an automated method for discovering a topology of a network, having a plurality of nodes, includes the following steps. A first traceroute process is performed for a given source node and one or more destination nodes listed in a target list so as to discover one or more paths through one or more intermediate nodes between the given source node and the one or more destination nodes. The one or more intermediate nodes discovered during the first traceroute process are added to the target list. A second traceroute process is performed for the given source node and the one or more intermediate nodes discovered during the first traceroute process so as to discover one or more paths through one or more additional intermediate nodes between the given source node and the one or more intermediate nodes discovered during the first traceroute process. When one or more additional intermediate nodes are discovered as a result of performance of the second traceroute process, the one or more additional intermediate nodes are added to the target list and the traceroute process is repeated to determine the existence of any further intermediate nodes. When no new intermediate nodes are discovered as a result of performance of the second traceroute process or a subsequent traceroute process, the nodes in the target list are identified as a target closure set for the given source node.
摘要翻译： 公开了改进的网络拓扑发现技术。 例如，用于发现具有多个节点的网络拓扑的自动化方法包括以下步骤。 对给定源节点和目标列表中列出的一个或多个目的地节点执行第一跟踪路由进程，以便发现通过给定源节点和一个或多个目的地节点之间的一个或多个中间节点的一个或多个路径。 在第一个跟踪路由过程中发现的一个或多个中间节点被添加到目标列表中。 对于给定源节点和在第一跟踪路由过程期间发现的一个或多个中间节点执行第二跟踪路由进程，以便发现通过给定源节点与一个或多个中间体之间的一个或多个附加中间节点的一个或多个路径 在第一个跟踪路由过程中发现的节点。 当作为执行第二跟踪路由进程的结果发现一个或多个附加中间节点时，将一个或多个附加中间节点添加到目标列表中，并且重复跟踪路由进程以确定任何其他中间节点的存在。 由于执行第二个跟踪路由进程或后续的跟踪路由进程，没有新的中间节点被发现，目标列表中的节点被标识为给定源节点的目标封闭集。
-
37.发明申请Process of concentrating tea and/or herbal aroma and beverages or flavors using the resulting concentrated aroma 审中-公开使用所产生的浓缩香气浓缩茶和/或草药香料和饮料或调味剂的过程公开(公告)号：US20070077343A1
公开(公告)日：2007-04-05
申请号：US11241893
申请日：2005-09-30
申请人： Sheng Ma , Eric Wolff
发明人： Sheng Ma , Eric Wolff
IPC分类号： A23F3/00
摘要： The present invention relates to a process for preparing concentrated tea and herbal aromas by specific treatment using tea and herb materials as a starting material and to a process of preparing a perfumery composition or a beverage by adding the resulting concentrated tea and/or herbal aroma component that is stable at ambient storage conditions for at least one year.
摘要翻译： 本发明涉及通过使用茶和草本材料作为起始原料的特殊处理来制备浓缩茶和草药香料的方法，以及通过将所得浓缩茶和/或草药香味成分加入到制备香料组合物或饮料的方法中 在环境储存条件下至少一年是稳定的。
-
38.发明申请Method, system and program product for approximating resource consumption of a computer system 有权用于近似计算机系统资源消耗的方法，系统和程序产品公开(公告)号：US20060130067A1
公开(公告)日：2006-06-15
申请号：US11011344
申请日：2004-12-14
申请人： Genady Grabarnik , Moon Kim , Lev Kozakov , Sheng Ma
发明人： Genady Grabarnik , Moon Kim , Lev Kozakov , Sheng Ma
IPC分类号： G06F9/46
CPC分类号： G06F9/5083
摘要： Under the present invention, a computer work gradient matrix (hereinafter “matrix”) is developed by applying a set of background loading levels and a set of elemental work increments to a computer system, and then measuring the resource consumption of the computer system based thereon. Task work path(s) are also constructed by applying specific tasks to the computer system at a certain background loading level, and measuring the resource consumption of the computer system over time. Once the matrix and task work path(s) have been provided, they can be used to approximate the resource consumption of the computer system in response to a task applied at any background loading level.
摘要翻译： 在本发明中，通过将一组背景加载级别和一组基本工作增量应用于计算机系统来开发计算机工作梯度矩阵（以下称为“矩阵”），然后基于该方法测量计算机系统的资源消耗 。 任务工作路径也是通过在特定的后台加载级别将特定任务应用到计算机系统，并随时间测量计算机系统的资源消耗来构建的。 一旦提供了矩阵和任务工作路径，它们可用于响应于在任何后台加载级别应用的任务来近似计算机系统的资源消耗。
-
39.发明授权公开(公告)号：US06836894B1
公开(公告)日：2004-12-28
申请号：US09359874
申请日：1999-07-27
IPC分类号： G06F946
CPC分类号： G06F11/323
摘要： Systems and methods are provided for exploratory analysis of event messages. The invention includes a parsing engine to translate textual messages into structured event data, a selection and control engine (SCE) to provide data management and communication channels for a set of analysis methods, and viewers to support different kinds of analysis methods. The invention further includes a mechanism for viewers to exchange information, a mechanism for interactively and iteratively refining parsing rules, and a mechanism to visualize events through event graphs.
摘要翻译： 提供系统和方法用于对事件消息进行探索性分析。 本发明包括将文本消息翻译成结构化事件数据的解析引擎，选择和控制引擎（SCE），以提供用于一组分析方法的数据管理和通信信道，以及支持不同种类的分析方法的观看者。 本发明还包括用于交换信息的观看者的机制，用于交互地和迭代地提炼解析规则的机制，以及通过事件图形来可视化事件的机制。
-
公开(公告)号：US09135640B2
公开(公告)日：2015-09-15
申请号：US12464574
申请日：2009-05-12
CPC分类号： G06Q30/0255 , G06Q30/02 , G06Q30/0241 , G06Q30/0242 , G06Q30/0251 , G06Q30/0257 , G06Q30/0264 , G06Q30/0277
摘要： A framework for content delivery includes a content distribution manager operable to select content for distribution in response to a request for content. The selection of content may be made based in part on scheduling information associated with sources of available content and selected by content providers. The selection may further be based in part on a content selection policy selected by publishers who initiate requests for content.
摘要翻译： 用于内容传递的框架包括内容分发管理器，其可操作以响应于对内容的请求来选择用于分发的内容。 可以部分地基于与可用内容的源相关联并由内容提供者选择的调度信息来进行内容的选择。 该选择可以进一步部分地基于发起者对内容的请求所选择的内容选择策略。
-
-
-
-
-
-
-
-
-
搜索结果
51 条记录 (耗时 0.025 秒)
