会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method and apparatus for goal processing memory management
    • 用于目标处理内存管理的方法和装置
    • US5369732A
    • 1994-11-29
    • US38968
    • 1993-03-29
    • John LynchDavid Franke
    • John LynchDavid Franke
    • G06F9/44G06N5/00G06N5/04G06Q10/06G06F15/00
    • G06Q10/06G06N5/003
    • The present invention is a method and apparatus for managing memory in goal processing. The present invention creates search states that contain an alternative subgoal (i.e., subgoal with alternatives) and non-alternative subgoals. Problem state modifications associated with the goals contained in a search state are associated with a search state object. A search state object contains information about the search process and the goals included in the search state, and a pointer to previous search state objects. Processed goals are kept on a goal stack, and the search state object points to the first and last goal stack entry included in the search state object. A search state object includes a list of alternatives available in the search state. When a goal processing failure occurs, an alternative solution search begins with the latest search state object until an alternative is found, or a determination is made that no alternatives exist and the goal cannot be satisfied. When a goal processing failure occurs, an alternative subgoal is directly accessible without visiting each subgoal individually. Goals included in the failed processing may be collectively popped from the goal stack. Problem state modifications associated with the failed processing may be collectively undone from the problem state. Goal processing reverts to a state prior to the failed state without examining each goal within the failed state, individually removing the failed state's modifications, and individually releasing the memory used by the failed state.
    • 本发明是用于管理目标处理中的存储器的方法和装置。 本发明创建包含替代子目标(即,具有替代物的子目标)和非替代子目标的搜索状态。 与搜索状态中包含的目标相关联的问题状态修改与搜索状态对象相关联。 搜索状态对象包含关于包括在搜索状态中的搜索过程和目标的信息,以及指向之前的搜索状态对象的指针。 已处理的目标保存在目标堆栈上,搜索状态对象指向包含在搜索状态对象中的第一个和最后一个目标堆栈条目。 搜索状态对象包括在搜索状态中可用的替代方案的列表。 当发生目标处理失败时,替代解决方案搜索从最新的搜索状态对象开始,直到找到替代方案,或者确定没有替代方案存在,并且目标不能被满足。 当发生目标处理失败时,可以直接访问替代子目标,而不必单独访问每个子目标。 失败处理中包含的目标可能会从目标堆栈中集中弹出。 与故障处理相关联的问题状态修改可以从问题状态中集体撤销。 目标处理恢复到故障状态之前的状态,而不检查故障状态中的每个目标,单独地去除故障状态的修改,并单独释放由故障状态使用的存储器。
    • 4. 发明申请
    • Method and apparatus for configuring systems
    • 用于配置系统的方法和装置
    • US20060100829A1
    • 2006-05-11
    • US11315548
    • 2005-12-22
    • John LynchDavid Franke
    • John LynchDavid Franke
    • G06F17/50
    • G06F17/5095G06F2217/78
    • The present invention employs a generative approach for configuring systems such that a system may be configured based on component or resource requests, or input in the form of need. The present invention provides a constraint-based configuration system using a structural model hierarchy. The structural aspects of the model provide the ability to define a model element as being contained in, or by, another model element. In addition, the structural model provides the ability to identify logical datatype and physical interconnections between elements and establish connections between elements. To configure a system, the present invention accepts input in the form of requests (e.g., component or resource) or needs, such as an expression of a need for a desktop computer system to be used in a CAD (i.e., computer-aided design) environment. Using this information, the present invention configures a system by identifying the resource and component needs, constraints imposed on or by the resources or components identified, and the structural aspects of the system.
    • 本发明采用生成方法来配置系统,使得可以基于组件或资源请求或以需要的形式输入系统。 本发明提供一种使用结构模型层次结构的基于约束的配置系统。 模型的结构方面提供了将模型元素定义为包含在另一个模型元素中或由另一个模型元素定义的能力。 此外,结构模型提供了识别元素之间的逻辑数据类型和物理互连的能力,并建立元素之间的连接。 为了配置系统,本发明以请求(例如,组件或资源)或需求的形式接受输入,例如表示对在CAD中使用的台式计算机系统的需求(即,计算机辅助设计 ) 环境。 使用该信息,本发明通过识别资源和组件需求,由识别的资源或组件施加的约束,以及系统的结构方面来配置系统。
    • 5. 发明授权
    • Method and apparatus for configuring systems
    • US07043407B2
    • 2006-05-09
    • US09413963
    • 1999-10-07
    • John LynchDavid Franke
    • John LynchDavid Franke
    • G06F15/177
    • G06F17/5095G06F2217/78
    • The present invention employs a generative approach for configuring systems such that a system may be configured based on component or resource requests, or input in the form of need. The present invention provides a constraint-based configuration system using a structural model hierarchy. The structural aspects of the model provide the ability to define a model element as being contained in, or by, another model element. In addition, the structural model provides the ability to identify logical datatype and physical interconnections between elements and establish connections between elements. To configure a system, the present invention accepts input in the form of requests (e.g., component or resource) or needs, such as an expression of a need for a desktop computer system to be used in a CAD (i.e., computer-aided design) environment. Using this information, the present invention configures a system by identifying the resource and component needs, constraints imposed on or by the resources or components identified, and the structural aspects of the system.
    • 7. 发明授权
    • System and method for efficiently generating association rules
    • 有效地生成关联规则的系统和方法
    • US08401986B1
    • 2013-03-19
    • US10912699
    • 2004-08-05
    • David Franke
    • David Franke
    • G06F17/00G06N5/02
    • G06N5/02G06F17/30289G06N5/025G06Q30/02
    • A data processing system processes data sets (such as low-resolution transaction data) into high-resolution data sets by mapping generic information into attribute-based specific information that may be processed to identify frequent sets therein. When association rules are generated from such frequent sets, the complexity and/or quantity of such rules may be managed by removing redundancies from the rules, such as by removing rules providing only trivial associations, removing rules having only a part group as the consequent, modifying rules to remove redundant antecedent items and/or filtering subsumed rules from the generated rule set that do not provide sufficient lift to meet an adjustable specialization lift threshold requirement.
    • 数据处理系统通过将通用信息映射到基于属性的特定信息中来处理数据集(例如低分辨率事务数据)到高分辨率数据集中,该信息可以被处理以识别其中的频繁集合。 当从这样的频繁集合生成关联规则时,可以通过从规则中去除冗余来管理这些规则的复杂性和/或数量,例如通过移除仅提供微不足道的关联的规则,去除仅具有部分组的规则作为后果, 修改规则以从生成的规则集中删除冗余先行项目和/或过滤归约规则,该规则集不提供足够的电梯以满足可调整的专业化提升阈值要求。
    • 9. 发明授权
    • Attribute based association rule mining
    • 基于属性的关联规则挖掘
    • US07433879B1
    • 2008-10-07
    • US10870360
    • 2004-06-17
    • Nirad SharmaRohit NamjoshiDavid Franke
    • Nirad SharmaRohit NamjoshiDavid Franke
    • G06F17/30
    • G06F17/30274G06F2216/03Y10S707/99933Y10S707/99935Y10S707/99936Y10S707/99942
    • A data processing system processes data sets (such as low-resolution transaction data) into high-resolution data sets by mapping generic information into attribute-based specific information that is stored in a database. The extracting frequent pattern information from the database using frequent pattern growth techniques, a compact frequent pattern tree data structure efficiently holds frequent pattern information for multiple transactions having one or more items in each transaction. Frequent pattern data is transformed for ease of use with rule generation algorithms by removing redundant information (such as part group items) or by consolidating items corresponding to a part group and replacing those items with a proxy item for purposes of power set generation.
    • 数据处理系统通过将通用信息映射到存储在数据库中的基于属性的特定信息中来将数据集(诸如低分辨率事务数据)处理成高分辨率数据集。 使用频繁模式生成技术从数据库中提取频繁模式信息,紧凑的频繁模式树数据结构在每个事务中有效地保存具有一个或多个项目的多个事务的频繁模式信息。 通过删除冗余信息(例如部分组项目)或通过合并与部件组相对应的项目并将代替这些项目替换为代表功能集生成的目的,将频繁模式数据转换为便于使用规则生成算法。