会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 33. 发明申请
    • INTERVAL DISAGGREGATE
    • 间隔异常
    • US20160063378A1
    • 2016-03-03
    • US14471450
    • 2014-08-28
    • Kunsoo ParkSang Kyun ChaChang Bin SongKi Hong KimSunho LeeCheol Yoo
    • Kunsoo ParkSang Kyun ChaChang Bin SongKi Hong KimSunho LeeCheol Yoo
    • G06N5/04G06N7/00
    • G06N7/005
    • A system includes determination of a total target value associated with N dimension members, determination of a set of historical values for each of the N dimension members, for each of the N dimension members, determination of a prediction interval based on the set of historical values of the dimension member, determination of an N-polytope in N-dimensional space based on the N determined prediction intervals, determination of an (N−1)-polytope of the N-dimensional space in which the sum of the N values of each coordinate of the (N−1)-polytope equals the total desired value, determination of an (N−1)-dimensional intersection of the N-polytope and the (N−1) polytope, and determination of a disaggregation of the total target value among the N dimension members based on the coordinates of the (N−1)-dimensional intersection.
    • 系统包括确定与N维成员相关联的总目标值,确定N维成员中的每一个的N个维度成员中的每一个的一组历史值,基于历史值集合来确定预测间隔 根据N个确定的预测间隔确定N维空间中的N-多面体,确定N维空间的(N-1) - 多面体,其中每个 (N-1) - 多面体的坐标等于总需要值,确定N-多孔体和(N-1)多面体的(N-1)维交叉点,以及确定总目标的解聚 基于(N-1)维交点的坐标,N维成员之间的值。
    • 36. 发明申请
    • Interactive Query Plan Visualization and Optimization
    • 交互式查询计划可视化和优化
    • US20130151505A1
    • 2013-06-13
    • US13323563
    • 2011-12-12
    • Yongsik YoonChanho JeongSang Kyun Cha
    • Yongsik YoonChanho JeongSang Kyun Cha
    • G06F17/30
    • G06F17/30442
    • A computer system affords a user the ability to interactively formulate, visualize, and modify query plans that are to be posed to a database. The computer system provides query visualization in the form of decision trees having nodes selectable/deselectable to search for alternative query plans with lower or minimum execution time. The estimated cost and/or the execution time of a subtree of a query plan may be mapped according to a rectangle area metaphore, with the area of a rectangle enclosed by a larger rectangle representing a parent node in the plan tree. Query plans may be saved by the system in order to facilitate their visualization, optimization, and/or modification at a later date.
    • 计算机系统为用户提供交互式制定,可视化和修改要呈现给数据库的查询计划的能力。 计算机系统以具有可选择/可选择的节点的决策树的形式提供查询可视化,以搜索具有较低或最小执行时间的替代查询计划。 可以根据矩形区域元标记来映射查询计划的子树的估计成本和/或执行时间,其中矩形的面积由表示方案树中的父节点的较大矩形所包围。 系统可以保存查询计划,以便以后方便他们的可视化,优化和/或修改。