会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Automated Method for Structured Artifact Matching
    • 自动化结构工件匹配方法
    • US20080256038A1
    • 2008-10-16
    • US11735427
    • 2007-04-13
    • Douglas Neil KimelmanMarsha KimelmanDavid Peter MandelinDaniel M. Yellin
    • Douglas Neil KimelmanMarsha KimelmanDavid Peter MandelinDaniel M. Yellin
    • G06F7/00
    • G06K9/00476G06K9/6892
    • A method for determining a mapping between a first artifact and a second artifact, each artifact comprising at least one constituent, each at least one constituent comprising at least one feature, wherein each at least one feature is selected from a feature group consisting of: a relationship feature and a characteristic feature, the mapping comprising at least one constituent match comprising a correspondence between the at least one constituent of the first artifact and the at least one constituent of the second artifact, the method includes acts or steps of: a) receiving as input the first and second artifacts, and a description of the artifacts, constituents, and the features of the constituents; b) performing advanced inexact matching, comprising a step of selecting the mapping, the mapping comprising the at least one constituent match; and c) producing as output the mapping determined from the step of performing advanced inexact matching.
    • 一种用于确定第一伪像和第二神器之间的映射的方法,每个伪像包括至少一个成分,每个至少一个成分包括至少一个特征,其中每个至少一个特征选自以下特征组: 关系特征和特征特征,所述映射包括至少一个组成匹配,其包括所述第一伪像的所述至少一个成分与所述第二神器的所述至少一个成分之间的对应关系,所述方法包括以下动作或步骤:a)接收 作为输入第一和第二伪影,以及对构件的构件,构件和特征的描述; b)执行高级不精确匹配,包括选择映射的步骤,包括所述至少一个组成匹配的映射; 以及c)从执行高级不精确匹配的步骤确定的映射产生输出。
    • 4. 发明授权
    • Method and apparatus for linking data in a distributed data processing system
    • 用于在分布式数据处理系统中链接数据的方法和装置
    • US06973656B1
    • 2005-12-06
    • US08515778
    • 1995-08-16
    • Tien HuynhRobert Evan StromMichal Z. UkelsonDaniel M. Yellin
    • Tien HuynhRobert Evan StromMichal Z. UkelsonDaniel M. Yellin
    • G06F9/44
    • G06F17/3056G06F17/30575
    • An apparatus for implementing “links” between objects or content items in applications or documents in a distributed system such that changes to the source objects or items are reflected in changes to the target objects or content items. The apparatus includes mechanisms for allowing users to establish links, to break individual links, to copy documents or content including links, and to determine locations and/or descriptions of the source of a given target or any or all of the multiple targets of a given source.Advantageously, the apparatus of this invention uses remote message passing for communication, thereby permitting links to be established even when the source and target applications execute on different platforms and even when they share no common file system.The apparatus includes an availability server which can serve as a surrogate for applications which are currently not running. This permits targets of links to query the state of a link source, to register/unregister with the link source in order to receive notification of updates, create new links linked to the same link source, and to break their link to the link source, even though the application containing the link source is unavailable.The apparatus of the availability server can be generalized to support the ability to support transparent access from one application to objects of a second application in the face of unavailability of the second application.
    • 一种用于在分布式系统中的应用程序或文档中实现对象或内容项目之间的“链接”的装置,使得对源对象或项目的改变反映在目标对象或内容项目的改变中。 该装置包括用于允许用户建立链接,破坏各个链接,复制文档或包括链接的内容的机制,以及确定给定目标的源的位置和/或描述,或给定目标的多个目标的任何或全部 资源。 有利地,本发明的装置使用远程消息传递进行通信,从而即使在源和目标应用程序在不同的平台上执行并且甚至当它们不共享公共文件系统时也允许建立链接。 该设备包括可用作服务器,该服务器可以用作当前未运行的应用的代理。 这允许链接的目标查询链接源的状态,用链接源注册/注销,以便接收更新的通知,创建链接到相同链接源的新链接,并且断开链接到链接源的链接, 即使包含链接源的应用程序不可用。 可用性服务器的装置可以被概括为支持在面对第二应用的不可用性的情况下支持从一个应用到第二应用的对象的透明访问的能力。
    • 6. 发明授权
    • Adaptive computing using probabilistic measurements
    • 使用概率测量的自适应计算
    • US08131843B2
    • 2012-03-06
    • US12415818
    • 2009-03-31
    • Daniel M. YellinJorge Buenabad-Chavez
    • Daniel M. YellinJorge Buenabad-Chavez
    • G06F15/177
    • G06F11/3409G06F11/3433G06F2201/88
    • Determining a configuration of a computer system for performing an operation, by determining an expected performance of a computer system based on at least one possible usage scenario given a current configuration of the computer system according to a current set of system parameters, determining an expected performance of the computer system based on at least one possible usage scenario given at least one candidate configuration of the computer system according to at least one candidate set of system parameters, and configuring the computer system according to whichever of the sets of system parameters that has a more favorable expected performance as determined in accordance with predefined criteria.
    • 确定用于执行操作的计算机系统的配置,通过根据当前的系统参数集合给出计算机系统的当前配置的至少一个可能的使用场景来确定计算机系统的预期性能,确定预期的性能 基于至少一个可能的使用场景,所述至少一个可能的使用场景根据至少一个候选系统参数集给出所述计算机系统的至少一个候选配置,并且根据所述系统参数集中的哪一个来配置所述计算机系统 根据预定义的标准确定的更有利的预期性能。
    • 10. 发明授权
    • Adaptive mechanism for optimally accessing data based upon data access characteristics
    • 基于数据访问特性优化访问数据的自适应机制
    • US07185314B2
    • 2007-02-27
    • US10448597
    • 2003-05-30
    • Daniel M. Yellin
    • Daniel M. Yellin
    • G06F9/45
    • G06F11/3452
    • A runtime system, program product and method for determining a mode of operation for a software component, comprises steps of a) running in a first implementation mode; b) determining a first cost associated with running in the first implementation mode; c) determining a second cost associated with switching to a second implementation and running in the second implementation mode; and d) comparing the first cost with the second cost; and e) providing a recommendation to switch to the second mode based on the comparison of the first cost with the second cost. According to another embodiment a deterministic 3-competitive algorithm is used to solve this problem. We also show that this matches the lower bound, as any deterministic algorithm cannot be better than 3-competitive. According to another embodiment a probabilistic algorithm is also used to solve this problem as well.
    • 一种用于确定软件组件的操作模式的运行时系统,程序产品和方法,包括以下步骤:a)以第一实现模式运行; b)确定与在第一实施模式中运行相关联的第一成本; c)确定与切换到第二实现并在第二实现模式中运行相关联的第二成本; 和d)将第一个成本与第二个成本进行比较; 以及e)基于第一成本与第二成本的比较来提供切换到第二模式的建议。 根据另一个实施例,使用确定性的3竞争算法来解决这个问题。 我们还表明,这匹配下限,因为任何确定性算法不能比3竞争优势。 根据另一实施例,概率算法也用于解决该问题。