会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Providing code list extensibility
    • 提供代码列表可扩展性
    • US08863097B2
    • 2014-10-14
    • US12981321
    • 2010-12-29
    • Bernhard ThimmelFriedhelm KrebsAndreas BoldDaniel ZochRalf DentzerUwe SchlarbDirk Richtsteiger
    • Bernhard ThimmelFriedhelm KrebsAndreas BoldDaniel ZochRalf DentzerUwe SchlarbDirk Richtsteiger
    • G06F9/45G06F9/54G06F9/30G06F9/44
    • G06F8/51G06F8/30G06F9/30181G06F9/541G06Q30/0609
    • A computer implemented method for providing code list extensibility includes providing a first code data type representation. The first code data type representation corresponding to a first code data type and having a first code value representation for at least one code value. The at least one code value associated with a corresponding code value issuing entity. The method may also include providing a second code data type representation. The second code data type representation corresponding to the first code data type and having a second code value representation for the at least one code value. The second code value representation including a unique identifier associated with the code value issuing entity. The method also may include mapping the first code data type representation and the second code data type representation based at least in part on the unique identifier associated with the code value issuing entity.
    • 用于提供代码列表可扩展性的计算机实现方法包括提供第一代码数据类型表示。 第一代码数据类型表示对应于第一代码数据类型并且具有用于至少一个代码值的第一代码值表示。 与对应的代码值发行实体相关联的至少一个代码值。 该方法还可以包括提供第二代码数据类型表示。 第二代码数据类型表示对应于第一代码数据类型并且具有用于至少一个代码值的第二代码值表示。 第二代码值表示包括与代码值发行实体相关联的唯一标识符。 该方法还可以包括至少部分地基于与代码值发行实体相关联的唯一标识符来映射第一代码数据类型表示和第二代码数据类型表示。
    • 3. 发明申请
    • PROVIDING CODE LIST EXTENSIBILITY
    • 提供代码列表可扩展性
    • US20120174081A1
    • 2012-07-05
    • US12981321
    • 2010-12-29
    • Bernhard ThimmelFriedhelm KrebsAndreas BoldDaniel ZochRalf DentzerUwe SchlarbDirk Richtsteiger
    • Bernhard ThimmelFriedhelm KrebsAndreas BoldDaniel ZochRalf DentzerUwe SchlarbDirk Richtsteiger
    • G06F9/45
    • G06F8/51G06F8/30G06F9/30181G06F9/541G06Q30/0609
    • A computer implemented method for providing code list extensibility includes providing a first code data type representation. The first code data type representation corresponding to a first code data type and having a first code value representation for at least one code value. The at least one code value associated with a corresponding code value issuing entity. The method may also include providing a second code data type representation. The second code data type representation corresponding to the first code data type and having a second code value representation for the at least one code value. The second code value representation including a unique identifier associated with the code value issuing entity. The method also may include mapping the first code data type representation and the second code data type representation based at least in part on the unique identifier associated with the code value issuing entity.
    • 用于提供代码列表可扩展性的计算机实现方法包括提供第一代码数据类型表示。 第一代码数据类型表示对应于第一代码数据类型并且具有用于至少一个代码值的第一代码值表示。 与对应的代码值发行实体相关联的至少一个代码值。 该方法还可以包括提供第二代码数据类型表示。 第二代码数据类型表示对应于第一代码数据类型并且具有用于至少一个代码值的第二代码值表示。 第二代码值表示包括与代码值发行实体相关联的唯一标识符。 该方法还可以包括至少部分地基于与代码值发行实体相关联的唯一标识符来映射第一代码数据类型表示和第二代码数据类型表示。
    • 8. 发明授权
    • Cross application time sheet for communicating with one or more enterprise management applications during time data entry
    • 交叉应用时间表,用于在时间数据输入期间与一个或多个企业管理应用程序通信
    • US06338097B1
    • 2002-01-08
    • US09100257
    • 1998-06-19
    • Ralf KrenzkeGeorg DopfStefan HirschenbergerRalf Dentzer
    • Ralf KrenzkeGeorg DopfStefan HirschenbergerRalf Dentzer
    • G07C110
    • G06Q10/06G06Q10/06312G06Q10/06313G06Q10/1091G07C1/10
    • A data model for a supply chain is provided whereby individual working steps in a production process are defined as activities, and organized groups of such activities are defined as orders. Activities are allocated to no more than one resource and contain information concerning the start and finish time for the activity, any resource on which the activity is currently scheduled, and a list of alternative resources, if any. Activities are linked to each other via auxiliary objects, which contain information concerning the minimum and maximum time between activities. Orders may contain input and/or output interface nodes, representing the materials consumed and produced by the offer. Each output interface node representing a quantity of material created from one order is linked via an auxiliary object to respective input interface node or nodes from other orders that are scheduled to receive that material. Order anchors are defined whereby a planning algorithm can easily reference an order by its order number in a database table. Planning object anchors allow the planning algorithm to access all the orders for a given material, and resource anchors permit access to all activities scheduled for that resource.
    • 提供供应链的数据模型,其中将生产过程中的各个工作步骤定义为活动,并且将这些活动的组织组织定义为订单。 活动分配给不超过一个资源,并包含有关活动的开始和结束时间,当前安排活动的任何资源以及替代资源列表(如果有的话)的信息。 活动通过辅助对象相互联系,辅助对象包含有关活动之间的最短和最长时间的信息。 订单可以包含输入和/或输出接口节点,表示由报价消耗和生成的材料。 表示从一个订单创建的材料数量的每个输出接口节点通过辅助对象链接到相应的输入接口节点或节点,以从被调度为接收该材料的其他订单。 定义订单定位,其中规划算法可以容易地通过其在数据库表中的订单号来引用订单。 规划对象锚点允许规划算法访问给定材料的所有订单,资源锚点允许访问为该资源安排的所有活动。