会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • COMPUTING MINIMAL POLYNOMIALS OF RADICAL EXPRESSIONS
    • 计算放射性表达的最小多边形
    • US20100198902A1
    • 2010-08-05
    • US12364533
    • 2009-02-03
    • Xu YangZhouchen LinSijun LiuTianjun Ye
    • Xu YangZhouchen LinSijun LiuTianjun Ye
    • G06F7/552
    • G06F17/10
    • Described is a technology, such as implemented in a computational software program, by which a minimal polynomial is efficiently determined for a radical expression based upon its structure of the radical expression. An annihilation polynomial is found based upon levels of the radical to obtain roots of the radical. A numerical method performs a zero test or multiple zero tests to find the minimal polynomial. In one implementation, the set of roots corresponding to a radical expression is found. The annihilation polynomial is computed by grouping roots of the set according to their conjugation relationship and multiplying factor polynomials level by level. A selection mechanism selects the minimal polynomial based upon the annihilation polynomial's factors.
    • 描述了一种技术,例如在计算软件程序中实现的技术,通过该技术,基于其基本表达式的结构,有效地确定基本表达式的最小多项式。 基于获得根的根的自由基的水平找到湮灭多项式。 数值方法执行零测试或多零测试以找到最小多项式。 在一个实现中,找到与激进表达相对应的一组根。 湮灭多项式通过根据它们的共轭关系和乘法因子多项式级别逐级分组的根来计算。 选择机制根据湮灭多项式的因素选择最小多项式。
    • 10. 发明申请
    • Data Relationship Visualizer
    • 数据关系可视化器
    • US20080313211A1
    • 2008-12-18
    • US11764354
    • 2007-06-18
    • Yingnong DangXu YangDongmei ZhangMin WangJian Wang
    • Yingnong DangXu YangDongmei ZhangMin WangJian Wang
    • G06F17/00
    • G06F17/30994G06F17/30014
    • Data having express or implied relationships may be displayed by selecting a starting entity in a data structure, building a relationship tree, and building and optimizing a relationship matrix based on the relationship tree. The optimized relationship matrix may be used to layout and render a graphical image that positions various elements with respect to the starting entity based on the relationships. The distance matrix may be optimized by creating a first distance matrix based on the relationship tree, developing a dissimilarity matrix based on expressed or implied relationships, and multiplying the dissimilarity matrix by a weighting factor to determine a distance matrix that may be optimized by multi-dimensional scaling. An optimized weighting factor may be determined and used to select an optimized distance matrix.
    • 可以通过选择数据结构中的起始实体,建立关系树,以及基于关系树建立和优化关系矩阵来显示具有明确或隐含关系的数据。 优化的关系矩阵可以用于基于关系来布局和渲染相对于起始实体定位各种元素的图形图像。 距离矩阵可以通过基于关系树创建第一距离矩阵,基于表示或隐含的关系开发不相似矩阵,以及将不相似矩阵乘以加权因子来确定可以通过多重关系树优化的距离矩阵来优化, 尺寸缩放。 可以确定优化的加权因子并用于选择优化的距离矩阵。