利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

16 条记录 (耗时 0.042 秒)

    Visualization of states of a process
    5.
    发明授权
    Visualization of states of a process 有权
    过程状态的可视化

    公开(公告)号：US09141507B2

    公开(公告)日：2015-09-22

    申请号：US12646155

    申请日：2009-12-23

    申请人： Xinhua Ji ,  Alexander Dadiomov ,  Hazim Shafi ,  Eric Ledoux ,  William T. Colburn

    发明人： Xinhua Ji ,  Alexander Dadiomov ,  Hazim Shafi ,  Eric Ledoux ,  William T. Colburn

    IPC分类号： G06F3/00 ,  G06F11/32 ,  G06F3/01 ,  G06F11/36

    CPC分类号： G06F11/323 ,  G06F11/3664

    摘要： A method of providing a visualization of states of a process includes identifying a set of potential states that can occur during the process and a corresponding set of colors, with each color in the set of colors corresponding to one of the potential states. A fixed ordering is established for the set of colors. A timeline graph including a plurality of colored vertical bars is displayed. Each colored vertical bar corresponds to a time interval of the process and includes at least one color selected from the set of colors based on at least one state occurring during the time interval corresponding to the vertical bar. The plurality of colored vertical bars includes a set of multiple-color vertical bars that each include a plurality of colors appearing in a vertical order based on the fixed ordering.

    摘要翻译： 提供过程状态可视化的方法包括识别可在过程期间发生的一组潜在状态和相应的一组颜色，其中该组颜色中的每种颜色对应于潜在状态之一。 为该组颜色建立固定的顺序。 显示包括多个彩色垂直条的时间线图。 每个彩色垂直条对应于处理的时间间隔，并且基于在对应于垂直条的时间间隔期间发生的至少一个状态，包括从该组颜色中选择的至少一种颜色。 多个彩色垂直条包括一组多色垂直条，每一个垂直条都包含基于固定顺序以垂直顺序出现的多种颜色。

    VISUALIZATION OF STATES OF A PROCESS
    6.
    发明申请
    VISUALIZATION OF STATES OF A PROCESS 有权
    过程状态的可视化

    公开(公告)号：US20110154245A1

    公开(公告)日：2011-06-23

    申请号：US12646155

    申请日：2009-12-23

    申请人： Xinhua Ji ,  Alexander Dadiomov ,  Hazim Shafi ,  Eric Ledoux ,  William T. Colburn

    发明人： Xinhua Ji ,  Alexander Dadiomov ,  Hazim Shafi ,  Eric Ledoux ,  William T. Colburn

    IPC分类号： G06F3/048

    CPC分类号： G06F11/323 ,  G06F11/3664

    摘要： A method of providing a visualization of states of a process includes identifying a set of potential states that can occur during the process and a corresponding set of colors, with each color in the set of colors corresponding to one of the potential states. A fixed ordering is established for the set of colors. A timeline graph including a plurality of colored vertical bars is displayed. Each colored vertical bar corresponds to a time interval of the process and includes at least one color selected from the set of colors based on at least one state occurring during the time interval corresponding to the vertical bar. The plurality of colored vertical bars includes a set of multiple-color vertical bars that each include a plurality of colors appearing in a vertical order based on the fixed ordering.

    摘要翻译： 提供过程状态可视化的方法包括识别可在过程期间发生的一组潜在状态和相应的一组颜色，其中该组颜色中的每种颜色对应于潜在状态之一。 为该组颜色建立固定的顺序。 显示包括多个彩色垂直条的时间线图。 每个彩色垂直条对应于处理的时间间隔，并且基于在对应于垂直条的时间间隔期间发生的至少一个状态，包括从该组颜色中选择的至少一种颜色。 多个彩色垂直条包括一组多色垂直条，每一个垂直条都包含基于固定顺序以垂直顺序出现的多种颜色。

    Dynamic calculation of sample profile reports
    7.
    发明授权
    Dynamic calculation of sample profile reports 有权
    动态计算样本资料报告

    公开(公告)号：US08510721B2

    公开(公告)日：2013-08-13

    申请号：US12868495

    申请日：2010-08-25

    申请人： Alexander Dadiomov ,  Mayank Agarwal ,  Xinhua Ji

    发明人： Alexander Dadiomov ,  Mayank Agarwal ,  Xinhua Ji

    IPC分类号： G06F9/44

    CPC分类号： G06F11/3612 ,  G06F11/3419 ,  G06F11/3466 ,  G06F2201/865

    摘要： The construction or use of a hierarchical time tree that represents an execution time of a program. To construct the hierarchical time tree, the time frame corresponding to the root node is the execution time during which the plurality of call stack samples were gathered from the program. Beginning at the root node, and proceeding recursively, each node is then populated in a manner that all of the call stacks for a given time period need not be accessed in order to provide a report regarding the given time period.

    摘要翻译： 构建或使用代表程序执行时间的分层时间树。 为了构建分层时间树，与根节点对应的时间帧是从节目收集多个呼叫堆栈样本的执行时间。 从根节点开始，并递归进行，然后以不必访问给定时间段内的所有呼叫栈的方式填充每个节点，以便提供关于给定时间段的报告。

    ADAPTIVE TREE STRUCTURE FOR VISUALIZING DATA
    8.
    发明申请
    ADAPTIVE TREE STRUCTURE FOR VISUALIZING DATA 有权
    用于可视化数据的自适应树结构

    公开(公告)号：US20120137308A1

    公开(公告)日：2012-05-31

    申请号：US12956127

    申请日：2010-11-30

    申请人： Mayank Agarwal ,  Alexander Dadiomov ,  Xinhua Ji

    发明人： Mayank Agarwal ,  Alexander Dadiomov ,  Xinhua Ji

    IPC分类号： G06F9/46

    CPC分类号： G06F9/542 ,  G06F17/30994

    摘要： One or more systems and/or techniques for generating an adaptive tree structure for storing event data based upon data density of events are disclosed. In particular, the adaptive tree structure may comprise one or more levels of nodes, where a level may correspond to a resolution of events. Nodes may correspond to particular time spans over which event data was recorded. A node may be designated as a raw node comprising raw events or a summary node comprising summary events based upon the number of events occurring within a time span covered by the node.

    摘要翻译： 公开了一种或多种用于基于事件的数据密度生成用于存储事件数据的自适应树结构的系统和/或技术。 特别地，自适应树结构可以包括一个或多个节点级别，其中级别可以对应于事件的分辨率。 节点可以对应于记录事件数据的特定时间跨度。 可以将节点指定为包括原始事件的原始节点或基于在该节点覆盖的时间范围内发生的事件的数量的包含摘要事件的摘要节点。

    Adaptive tree structure for visualizing data
    9.
    发明授权
    Adaptive tree structure for visualizing data 有权
    用于可视化数据的自适应树结构

    公开(公告)号：US08595750B2

    公开(公告)日：2013-11-26

    申请号：US12956127

    申请日：2010-11-30

    申请人： Mayank Agarwal ,  Alexander Dadiomov ,  Xinhua Ji

    发明人： Mayank Agarwal ,  Alexander Dadiomov ,  Xinhua Ji

    IPC分类号： G06F9/46

    CPC分类号： G06F9/542 ,  G06F17/30994

    摘要： One or more systems and/or techniques for generating an adaptive tree structure for storing event data based upon data density of events are disclosed. In particular, the adaptive tree structure may comprise one or more levels of nodes, where a level may correspond to a resolution of events. Nodes may correspond to particular time spans over which event data was recorded. A node may be designated as a raw node comprising raw events or a summary node comprising summary events based upon the number of events occurring within a time span covered by the node.

    摘要翻译： 公开了一种或多种用于基于事件的数据密度生成用于存储事件数据的自适应树结构的系统和/或技术。 特别地，自适应树结构可以包括一个或多个节点级别，其中级别可以对应于事件的分辨率。 节点可以对应于记录事件数据的特定时间跨度。 可以将节点指定为包括原始事件的原始节点或基于在该节点覆盖的时间范围内发生的事件的数量的包含摘要事件的摘要节点。

    Calculating zoom level timeline data
    10.
    发明授权
    Calculating zoom level timeline data 有权
    计算缩放级别时间轴数据

    公开(公告)号：US08941657B2

    公开(公告)日：2015-01-27

    申请号：US13113422

    申请日：2011-05-23

    申请人： Mayank Agarwal ,  Xinhua Ji ,  Alexander Dadiomov

    发明人： Mayank Agarwal ,  Xinhua Ji ,  Alexander Dadiomov

    IPC分类号： G06T11/20 ,  G09G5/00 ,  G06F17/30

    CPC分类号： G06F17/30551 ,  G06F17/30572

    摘要： The present invention extends to methods, systems, and computer program products for calculating zoom level timeline data. Event aggregators are configured to read execution data from sequentially received input buffers and pre-calculate data chunks for a specified zoom level to create a zoom tree. The density of execution data can be used to determine when pre-calculation is beneficial. In response to a user request, pre-calculated data can be combined with responsively calculated data for presentation to a user. User requests can specify zoom levels and time ranges over which data is to be presented.

    摘要翻译： 本发明扩展到用于计算缩放级别时间轴数据的方法，系统和计算机程序产品。 事件聚合器被配置为从顺序接收的输入缓冲区读取执行数据，并预先计算指定缩放级别的数据块以创建缩放树。 执行数据的密度可用于确定何时预计算有益。 响应于用户请求，可以将预先计算的数据与响应计算的数据组合以呈现给用户。 用户请求可以指定要显示数据的缩放级别和时间范围。