会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Treemap visualizations of database time
    • 数据库时间的Treemap可视化
    • US08095514B2
    • 2012-01-10
    • US12365827
    • 2009-02-04
    • John BeresniewiczJonathan HelfmanHsiao-Te SuNancy ChenKarl DiasGraham Wood
    • John BeresniewiczJonathan HelfmanHsiao-Te SuNancy ChenKarl DiasGraham Wood
    • G06F17/30
    • G06F17/30554G06F17/30592G06F17/30961Y10S707/99945
    • Particular embodiments generally relate to displaying database time using a treemap. A set of database time values is determined for a set of dimensions. The database time values measure performance of one or more databases by the time the database takes to respond to a request. The set of database time values is correlated to a set of cells in the treemap. A size of the cell is determined based on the database time value associated with it. For example, the database time value is correlated to an area of the cell. A layout of the set of cells is determined and the treemap is displayed using the layout. For example, the largest values of database time may be shown with the largest sized cells. This makes it easier for an administrator to review and analyze the database performance across multiple dimensions and determine problem areas affecting the performance of the one or more databases.
    • 具体实施方案一般涉及使用树形图显示数据库时间。 为一组维度确定一组数据库时间值。 数据库时间值衡量数据库响应请求时所需的一个或多个数据库的性能。 数据库时间值集合与树形图中的一组单元格相关联。 基于与其相关联的数据库时间值来确定单元的大小。 例如,数据库时间值与单元的区域相关。 确定一组单元格的布局,并使用布局显示树状图。 例如,数据库时间的最大值可以用最大尺寸的单元显示。 这使管理员更容易查看和分析多个维度的数据库性能,并确定影响一个或多个数据库性能的问题区域。
    • 2. 发明申请
    • TREEMAP VISUALIZATIONS OF DATABASE TIME
    • 数据库时间的TREEMAP可视化
    • US20100198796A1
    • 2010-08-05
    • US12365827
    • 2009-02-04
    • John BeresniewiczJonathan HelfmanHsiao-Te SuNancy ChenKarl DiasGraham Wood
    • John BeresniewiczJonathan HelfmanHsiao-Te SuNancy ChenKarl DiasGraham Wood
    • G06F17/30
    • G06F17/30554G06F17/30592G06F17/30961Y10S707/99945
    • Particular embodiments generally relate to displaying database time using a treemap. A set of database time values is determined for a set of dimensions. The database time values measure performance of one or more databases by the time the database takes to respond to a request. The set of database time values is correlated to a set of cells in the treemap. A size of the cell is determined based on the database time value associated with it. For example, the database time value is correlated to an area of the cell. A layout of the set of cells is determined and the treemap is displayed using the layout. For example, the largest values of database time may be shown with the largest sized cells. This makes it easier for an administrator to review and analyze the database performance across multiple dimensions and determine problem areas affecting the performance of the one or more databases.
    • 具体实施方案一般涉及使用树形图显示数据库时间。 为一组维度确定一组数据库时间值。 数据库时间值衡量数据库响应请求时所需的一个或多个数据库的性能。 数据库时间值集合与树形图中的一组单元格相关联。 基于与其相关联的数据库时间值来确定单元的大小。 例如,数据库时间值与单元的区域相关。 确定一组单元格的布局,并使用布局显示树状图。 例如,数据库时间的最大值可以用最大尺寸的单元显示。 这使管理员更容易查看和分析多个维度的数据库性能,并确定影响一个或多个数据库性能的问题区域。
    • 4. 发明申请
    • SEQUENTIAL INFORMATION RETRIEVAL
    • 序列信息检索
    • US20110078194A1
    • 2011-03-31
    • US12831641
    • 2010-07-07
    • Jonathan HelfmanJosep H. Goldberg
    • Jonathan HelfmanJosep H. Goldberg
    • G06F17/30
    • G06F16/2474
    • Embodiments of the invention provide systems and methods for retrieving sequential information from a dataset. More specifically, retrieving sequential information from a dataset including one or more existing sequences can comprise receiving a query sequence representing a sequence against which the one or more existing sequences in the dataset is compared. The query sequence can be added to the dataset and a dotplot of the sequences in the dataset including the query sequence can be created. A determination can be made as to whether any of the one or more existing sequences match the query sequence based on the dotplot. For example, determining whether any of the one or more existing sequences match the query sequence based on the dotplot can comprise performing a line fitting process such as a regression-based line fitting process.
    • 本发明的实施例提供了用于从数据集检索顺序信息的系统和方法。 更具体地,从包括一个或多个现有序列的数据集中检索顺序信息可以包括接收表示与数据集中的一个或多个现有序列进行比较的序列的查询序列。 可以将查询序列添加到数据集中,并且可以创建数据集中包含查询序列的序列的点图。 可以确定一个或多个现有序列中的任一个是否基于点图匹配查询序列。 例如,确定一个或多个现有序列中的任一个是否基于点图匹配查询序列可以包括执行线拟合处理,例如基于回归的线拟合处理。
    • 5. 发明申请
    • HIERARCHICAL SEQUENTIAL CLUSTERING
    • 分层序列聚类
    • US20110078144A1
    • 2011-03-31
    • US12831615
    • 2010-07-07
    • Jonathan HelfmanJoseph H. Goldberg
    • Jonathan HelfmanJoseph H. Goldberg
    • G06F17/30
    • G06K9/6219
    • Embodiments of the invention provide systems and methods for analyzing sequential data. Analyzing the sequential data can include grouping or clustering data that are similar in some way, e.g., similar ranges of quantities, similar categories, etc. More specifically, a method for hierarchical clustering of sequential data can comprise creating a dotplot of the sequential data. The dotplot can represent a plurality of sequences within the sequential data. A number of clusters represented by the plurality of sequences can be initialized, e.g., one cluster per sequence. A pair of sequences of the plurality of sequences having a longest sequential match can be identified, e.g., based on a line fitting technique, and merged into a single cluster. Identifying a pair of sequences of the plurality of sequences having a longest sequential match and merging the identified pair of sequences into a single cluster can be repeated until a single cluster remains.
    • 本发明的实施例提供用于分析顺序数据的系统和方法。 分析顺序数据可以包括以某种方式对数据进行分组或聚类,例如类似的数量范围,类似的类别等。更具体地说,用于顺序数据的层次聚类的方法可以包括创建顺序数据的点图。 点图可以表示顺序数据内的多个序列。 由多个序列表示的多个簇可以被初始化,例如每个序列一个簇。 可以例如基于线拟合技术来识别具有最长顺序匹配的多个序列中的一对序列,并且合并成单个簇。 识别具有最长顺序匹配的多个序列中的一对序列,并将所识别的序列对合并到单个簇中,直到单个簇保留。
    • 6. 发明申请
    • SORTABLE HASH TABLE
    • 便携式桌子
    • US20090313208A1
    • 2009-12-17
    • US12138225
    • 2008-06-12
    • Jonathan Helfman
    • Jonathan Helfman
    • G06F17/30
    • G06F17/3033
    • A method for providing symbolic access to a plurality of objects stored in a data storage is provided. An associative array comprising a plurality of associative array keys and a plurality of associative array values may be generated. A data array comprising a plurality of data array elements may be generated, such that each object stores a sortable property value of the object and an original offset of the object. A mapping table to map original offsets to modified offsets is generated. The mapping table includes a plurality of mapping table elements, and each associative array value is used as an offset into the mapping table, and each mapping table element storing a modified offset, each modified offset is a numeric value used as an offset into the data array.
    • 提供了一种用于提供对存储在数据存储器中的多个对象的符号访问的方法。 可以生成包括多个关联数组键和多个关联数组值的关联数组。 可以生成包括多个数据阵列元素的数据阵列,使得每个对象存储对象的可排序属性值和对象的原始偏移。 生成将原始偏移映射到修改的偏移量的映射表。 映射表包括多个映射表元素,并且每个关联数组值用作映射表中的偏移量,并且每个映射表元素存储修改的偏移量,每个修改的偏移量是用作数据偏移量的数值 数组。
    • 7. 发明申请
    • Graph Selection Method
    • 图选择方法
    • US20080222562A1
    • 2008-09-11
    • US11682010
    • 2007-03-05
    • Jonathan HelfmanJoseph H. Goldberg
    • Jonathan HelfmanJoseph H. Goldberg
    • G06F3/048
    • G06N5/022G06F3/04817G06F3/0482G06F3/04842G06F17/246G06F17/30643G06F17/30716G06F17/30899
    • Embodiments of the present invention provide a decision framework for selecting graph types based on attributes such as task, end-user, data-bound, and representational attributes. According to one embodiment, a computer-implemented method for aiding a user in selecting a graph type for a graph comprises receiving a selection of a graph type subset from the user, the graph type subset selected from a plurality of graph type subsets, the selection responsive to at least one task attribute corresponding to an intended use for the graph. The method further comprises generating a user interface to be displayed to the user, the user interface including an indication of at least one graph type in the selected graph type subset, an indication of at least one attribute, and an indication of whether the at least one graph type is appropriate in view of the at least one attribute, thereby providing guidance to the user in selecting an appropriate graph type.
    • 本发明的实施例提供了一种用于基于诸如任务,最终用户,数据绑定和表示属性等属性来选择图形类型的决策框架。 根据一个实施例,用于帮助用户选择图形的图类型的计算机实现的方法包括从用户接收图形类型子集的选择,从多个图类型子集中选择的图类型子集,所述选择 响应于与图的预期用途相对应的至少一个任务属性。 所述方法还包括生成要向用户显示的用户界面,所述用户界面包括所选图形类型子集中的至少一个图形类型的指示,至少一个属性的指示,以及是否至少 考虑到至少一个属性,一个图形类型是适当的,从而在选择合适的图形类型时向用户提供指导。
    • 9. 发明授权
    • Generalized faceted browser decision support tool
    • 广泛的面浏览器决策支持工具
    • US09411903B2
    • 2016-08-09
    • US11681986
    • 2007-03-05
    • Jonathan HelfmanBrent-Kaan William White
    • Jonathan HelfmanBrent-Kaan William White
    • G06F17/30G06F3/0482
    • G06N5/022G06F3/04817G06F3/0482G06F3/04842G06F17/246G06F17/30643G06F17/30716G06F17/30899
    • Embodiments of the present invention provide a faceted browser for decision-making that enables interactive visualization of a decision space as choices are made. According to one embodiment, a computer-implemented method comprises receiving a selection of a first choice from a user. The first choice is displayed in a user interface that includes a plurality of facets, each facet including a plurality of choices. The method further comprises disabling at least one second choice in response to the selection of the first choice, and determining a first result set in response to the selection of the first choice. The user interface is then updated in real-time to display the selected status of the first choice, the disabled status of the second choice, and the first result set to the user.
    • 本发明的实施例提供了一种用于决策的分面浏览器,其使得能够在作出选择时进行决策空间的交互式可视化。 根据一个实施例,计算机实现的方法包括从用户接收对第一选择的选择。 第一选择显示在包括多个方面的用户界面中,每个小面包括多个选择。 该方法还包括响应于第一选择的选择而禁用至少一个第二选择,以及响应于第一选择的选择来确定第一结果集。 然后实时更新用户界面,以显示所选择的第一选择状态,第二选择的禁用状态以及第一结果集给用户。