会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • GENERATING A SEMANTIC GRAPH THAT ALLOWS A USER TO INTELLIGENTLY AND EFFICIENTLY CONNECT WITH PEOPLE AND ASSETS INVOLVED IN PROJECTS
    • 产生允许用户智能和有效连接项目涉及的人员和资产的语法图
    • US20130254736A1
    • 2013-09-26
    • US13426117
    • 2012-03-21
    • Feng-wei ChenWilliam T. PackPaul R. Sappie, IITintin S. Soemargono
    • Feng-wei ChenWilliam T. PackPaul R. Sappie, IITintin S. Soemargono
    • G06F9/44
    • G06F8/70G06Q10/067
    • A method, system and computer program product for intelligently and efficiently connecting with people and assets involved in projects. Semantic graphs for different projects or different versions of the same project are generated based on resources (e.g., templates, documents) within these projects or versions of the same project. Each semantic graph builds a relationship among the entities (e.g., development processes) of the particular project in question. The differences between these semantic graphs is illustrated in a single unified semantic graph. The single unified semantic graph highlights the different entities that were used in these projects as well as highlights the different personnel assigned to the same entities in these projects or versions of the same project. In this manner, a user is able to quickly identify the difference processes and personnel involved in the different projects or different versions of the same project.
    • 一种用于智能高效地连接项目涉及的人员和资产的方法,系统和计算机程序产品。 基于这些项目中的资源(例如,模板,文档)或同一项目的版本生成不同项目或同一项目的不同版本的语义图。 每个语义图构建了所讨论的特定项目的实体(例如,开发过程)之间的关系。 这些语义图之间的差异在单一的统一语义图中说明。 单一统一语义图强调了这些项目中使用的不同实体,并突出显示了在这些项目或同一项目的版本中分配给同一实体的不同人员。 以这种方式,用户能够快速识别参与不同项目或同一项目的不同版本的差异过程和人员。
    • 2. 发明授权
    • Generating a semantic graph that allows a user to intelligently and efficiently connect with people and assets involved in projects
    • 生成语义图,允许用户智能和有效地连接项目涉及的人员和资产
    • US08959475B2
    • 2015-02-17
    • US13426117
    • 2012-03-21
    • Feng-wei ChenWilliam T. PackPaul R. Sappie, IITintin S. Soemargono
    • Feng-wei ChenWilliam T. PackPaul R. Sappie, IITintin S. Soemargono
    • G06F9/44
    • G06F8/70G06Q10/067
    • A method, system and computer program product for intelligently and efficiently connecting with people and assets involved in projects. Semantic graphs for different projects or different versions of the same project are generated based on resources (e.g., templates, documents) within these projects or versions of the same project. Each semantic graph builds a relationship among the entities (e.g., development processes) of the particular project in question. The differences between these semantic graphs is illustrated in a single unified semantic graph. The single unified semantic graph highlights the different entities that were used in these projects as well as highlights the different personnel assigned to the same entities in these projects or versions of the same project. In this manner, a user is able to quickly identify the difference processes and personnel involved in the different projects or different versions of the same project.
    • 一种用于智能高效地连接项目涉及的人员和资产的方法,系统和计算机程序产品。 基于这些项目中的资源(例如,模板,文档)或同一项目的版本生成不同项目或同一项目的不同版本的语义图。 每个语义图构建了所讨论的特定项目的实体(例如,开发过程)之间的关系。 这些语义图之间的差异在单一的统一语义图中说明。 单一统一语义图强调了这些项目中使用的不同实体,并突出显示了在这些项目或同一项目的版本中分配给同一实体的不同人员。 以这种方式,用户能够快速识别参与不同项目或同一项目的不同版本的差异过程和人员。
    • 6. 发明授权
    • Programmatically calculating paths from a spatially-enabled database
    • 以编程方式从空间启用的数据库中计算路径
    • US06865479B2
    • 2005-03-08
    • US10077146
    • 2002-02-15
    • Feng-wei ChenRobert R. Cutlip
    • Feng-wei ChenRobert R. Cutlip
    • G01C21/32G01C21/34
    • G01C21/3446
    • Technics are disclosed for programmatically calculating directions (or other types of paths between points) without reliance on proprietary file formats or binary shape files, and without requiring application programmers to write code that performs complex manipulations of directed graphs. Preferred embodiments leverage built-in functions of a spatially-enabled object relational database system. Information about intersections between streets is used in a novel manner to compute paths between points. The intersection information is preferably obtained from precomputed information stored in a spatially-enabled relational database table.
    • 公开了技术来编程地计算方向(或点之间的其他类型的路径),而不依赖于专有文件格式或二进制形状文件,并且不需要应用程序员编写执行有向图的复杂操作的代码。 优选实施例利用空间有限的对象关系数据库系统的内置功能。 以新颖的方式使用关于街道之间的交叉点的信息来计算点之间的路径。 交叉信息优选地从存储在空间启用的关系数据库表中的预计算信息中获得。
    • 8. 发明授权
    • Programmatically deriving street geometry from address data
    • 从地址数据中编程派生街道几何
    • US06658356B2
    • 2003-12-02
    • US10077547
    • 2002-02-15
    • Feng-wei ChenRobert R. Cutlip
    • Feng-wei ChenRobert R. Cutlip
    • G06F1900
    • G06F17/30241
    • Techniques are disclosed for programmatically deriving street geometry data from address data which is presented in textual format. A collection of address information is used as input, and is processed in a novel manner to populate tables of a spatially-enabled database. Preferred embodiments use a data mart schema which is disclosed, and leverage built-in functions of a spatially-enabled object relational database system. In contrast to prior art techniques, the present invention does not require input data to be encoded in a “well-known” format (i.e. a format that adheres to particular predefined syntax conventions known as “WKT” or “WKB”); rather, textual information of the type which is readily available from government and/or commercial sources may be used as input. The derived street geometry supports retrievals which do not rely on proprietary file formats or binary files, thereby enabling faster retrievals and reduced resource consumption requirements
    • 公开了用于以文本格式呈现的地址数据来编程地导出街道几何数据的技术。 使用地址信息的集合作为输入,并以新颖的方式处理以填充空间启用的数据库的表。 优选实施例使用公开的数据集市模式,并利用空间有限的对象关系数据库系统的内置功能。 与现有技术相反,本发明不要求输入数据以“众所周知的”格式编码(即,遵守被称为“WKT”或“WKB”的特定预定义语法约定的格式); 相反,可以将来自政府和/或商业来源的类型的文本信息用作输入。 派生的街道几何支持不依赖专有文件格式或二进制文件的检索,从而实现更快的检索和减少的资源消耗需求