专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

21. 发明申请

US20090192842A1 Computer Programs, Methods, Apparatus and Systems Providing Improved Evaluation of Business Processes 有权
标题翻译：提供改进的业务流程评估的计算机程序，方法，设备和系统
公开(公告)号：US20090192842A1
公开(公告)日：2009-07-30
申请号：US12021820
申请日：2008-01-29
申请人： Genady Grabarnik , Dimitri Kanevsky , Heiko Ludwig , Larisa Shwartz
发明人： Genady Grabarnik , Dimitri Kanevsky , Heiko Ludwig , Larisa Shwartz
IPC分类号： G06Q10/00
CPC分类号： G06Q10/06 , G06Q10/06313 , G06Q10/0633 , G06Q10/0637 , G06Q10/0639 , G06Q30/0206
摘要： The exemplary embodiments of the invention provide computer programs, methods, apparatus and systems that describe techniques providing improved evaluation of business processes based on considerations such as throughput and/or parallelization. As a non-limiting example, such techniques may be useful for evaluating agreements between entities, such as SLAs between a service provider and another entity (e.g., a supplier or customer of the service provider), for example. In one exemplary embodiment of the invention, a method includes: obtaining a workflow model having a plurality of atomic processes, each atomic process having a distribution of throughput; determining an overall distribution of throughput for the workflow model using the distributions of throughput of the atomic processes; and outputting a determination of whether an agreement relating to the workflow model is fit based on the determined overall distribution of throughput.
摘要翻译：本发明的示例性实施例提供了描述基于诸如吞吐量和/或并行化之类的考虑来提供业务流程改进评估的技术的计算机程序，方法，装置和系统。作为非限制性示例，这样的技术可用于评估实体之间的协议，例如服务提供商和另一实体（例如，服务提供商的供应商或客户）之间的SLA。在本发明的一个示例性实施例中，一种方法包括：获得具有多个原子过程的工作流模型，每个原子过程具有吞吐量分布; 使用原子过程的吞吐量分布确定工作流模型的吞吐量的总体分布; 并且基于所确定的吞吐量的总体分布，输出关于所述工作流模型的协议是否适合的确定。

22. 发明申请

US20070294309A1 ORCHESTRATED PEER-TO-PEER SERVER PROVISIONING 有权
标题翻译： ORCHESTRATED对等服务器提供
公开(公告)号：US20070294309A1
公开(公告)日：2007-12-20
申请号：US11424901
申请日：2006-06-19
申请人： Larisa Shwartz , Maheswaran Surendra , Naga A. Ayachitula , Genady Grabarnik , James S. Lipscomb
发明人： Larisa Shwartz , Maheswaran Surendra , Naga A. Ayachitula , Genady Grabarnik , James S. Lipscomb
IPC分类号： G06F17/30
CPC分类号： H04L47/78 , G06F9/5061 , G06F17/30091 , G06F2209/5011 , H04L41/0893 , H04L67/104 , H04L67/1055 , H04L67/34
摘要： Embodiments of the present invention address deficiencies of the art in respect to server provisioning in a heterogeneous computing environment and provide a method, system and computer program product for secure and verified distributed orchestration and provisioning. In one embodiment of the invention, a server provisioning method can be provided. The server provisioning method can include establishing grouping criteria, grouping different target computing nodes into different groups of target computing nodes according to the established grouping criteria, server provisioning a root node in each of the different groups of target computing nodes, and relying upon the root node in each of the different groups to peer-to-peer server provision remaining nodes in each of the different groups.
摘要翻译：本发明的实施例解决了在异构计算环境中关于服务器提供的本领域的缺点，并提供了用于安全和验证的分布式编排和供应的方法，系统和计算机程序产品。在本发明的一个实施例中，可以提供服务器配置方法。服务器配置方法可以包括建立分组标准，根据建立的分组标准将不同目标计算节点分组到不同的目标计算节点组，服务器在目标计算节点的不同组中的每一个中提供根节点，并依赖于根节点在每个不同的组中，以对等服务器提供每个不同组中的剩余节点。

23. 发明申请

US20070226348A1 Computer-implemented method, system and program product for approximating resource consumption of computer system 有权
标题翻译：计算机实现的方法，系统和程序产品，用于近似计算机系统的资源消耗
公开(公告)号：US20070226348A1
公开(公告)日：2007-09-27
申请号：US11390527
申请日：2006-03-27
申请人： Genady Grabarnik , Moon Ju Kim , Lev Kozakov , Volodimir Lemberg , Larisa Shwartz
发明人： Genady Grabarnik , Moon Ju Kim , Lev Kozakov , Volodimir Lemberg , Larisa Shwartz
IPC分类号： G06F15/16
CPC分类号： G06F9/5083 , G06F2209/5019
摘要： In general, the present invention provides a method, system and program product for approximating/estimating computer resource consumption of a computer system. Specifically, under the present invention, a more efficient or reduced computer work gradient matrix (hereinafter “matrix”) is first built. This occurs by creating load measurements for a set of computer resource metrics of the computer system to analyze dependencies between different computer resource metrics. Then, a correlation matrix between the set of computer resource metrics is created based on the dependencies. The set of computer system resource metrics in the correlation matrix is thereafter clustered into a set of clusters, and a reduced matrix is built based thereon. Once the reduced matrix is built, it can be restored to a “full” matrix using linear transformation or the like.
摘要翻译：通常，本发明提供了一种用于近似/估计计算机系统的计算机资源消耗的方法，系统和程序产品。具体地说，在本发明中，首先构建了更有效率或更低的计算机工作梯度矩阵（以下称为“矩阵”）。这通过为计算机系统的一组计算机资源指标创建负载测量来分析不同计算机资源度量之间的依赖关系。然后，基于依赖关系创建该组计算机资源度量之间的相关矩阵。然后将相关矩阵中的一组计算机系统资源度量聚集成一组聚类，并基于此构建简化矩阵。一旦构建了简化矩阵，就可以使用线性变换等将其恢复到“完整”矩阵。

24. 发明申请

US20070198449A1 Method and apparatus for safe ontology reasoning 审中-公开
标题翻译：用于安全本体推理的方法和装置
公开(公告)号：US20070198449A1
公开(公告)日：2007-08-23
申请号：US11361293
申请日：2006-02-23
申请人： Achille Fokoue-Nkoutche , Genady Grabarnik , Nagui Halim , Aaron Kershenbaum , Edith Schonberg , Larisa Shwartz , Kavitha Srinivas
发明人： Achille Fokoue-Nkoutche , Genady Grabarnik , Nagui Halim , Aaron Kershenbaum , Edith Schonberg , Larisa Shwartz , Kavitha Srinivas
IPC分类号： G06N5/02
CPC分类号： G06N5/04
摘要： The present invention is a method and apparatus for safe ontology reasoning. In one embodiment, a method for building safe sub-ontology that includes one or more elements of a given ontology includes designating at least one the elements as a sensitive element, where a sensitive element is an element not to be revealed. The method then designates a safe sub-ontology such that the safe sub-ontology does not include any elements that, alone or in combination, allow inference of a sensitive element, in accordance with one or more given inference rules. In another embodiment, a method for building a potential sub-ontology includes designating at least one of the elements as a sensitive element and including a maximal number of the elements in the potential sub-ontology, wherein the maximal number includes the greatest number of elements that can be revealed, cumulatively, without allowing inference of a sensitive element, in accordance with one or more given inference rules.
摘要翻译：本发明是一种安全本体推理的方法和装置。在一个实施例中，一种用于构建包括给定本体的一个或多个元素的安全子本体的方法包括将至少一个元素指定为敏感元件，其中敏感元件是不被揭示的元件。该方法然后指定安全子本体，使得安全子本体不包括根据一个或多个给定推理规则单独或组合地允许敏感元素的推断的任何元素。在另一实施例中，构建潜在子本体的方法包括将至少一个元素指定为敏感元件并且包括潜在子本体中的元素的最大数量，其中最大数量包括最大数量的元素可以根据一个或多个给定的推论规则累积地揭示，而不允许推断敏感元件。

25. 发明授权

US09250972B2 Orchestrated peer-to-peer server provisioning 有权
标题翻译：协调的对等服务器配置
公开(公告)号：US09250972B2
公开(公告)日：2016-02-02
申请号：US11424901
申请日：2006-06-19
申请人： Larisa Shwartz , Maheswaran Surendra , Naga A. Ayachitula , Genady Grabarnik , James S. Lipscomb
发明人： Larisa Shwartz , Maheswaran Surendra , Naga A. Ayachitula , Genady Grabarnik , James S. Lipscomb
IPC分类号： G06F17/30 , G06F9/50 , H04L12/24 , H04L29/08
CPC分类号： H04L47/78 , G06F9/5061 , G06F17/30091 , G06F2209/5011 , H04L41/0893 , H04L67/104 , H04L67/1055 , H04L67/34
摘要： Embodiments of the present invention address deficiencies of the art in respect to server provisioning in a heterogeneous computing environment and provide a method, system and computer program product for secure and verified distributed orchestration and provisioning. In one embodiment of the invention, a server provisioning method can be provided. The server provisioning method can include establishing grouping criteria, grouping different target computing nodes into different groups of target computing nodes according to the established grouping criteria, server provisioning a root node in each of the different groups of target computing nodes, and relying upon the root node in each of the different groups to peer-to-peer server provision remaining nodes in each of the different groups.
摘要翻译：本发明的实施例解决了在异构计算环境中关于服务器提供的本领域的缺点，并提供了用于安全和验证的分布式编排和供应的方法，系统和计算机程序产品。在本发明的一个实施例中，可以提供服务器配置方法。服务器配置方法可以包括建立分组标准，根据建立的分组标准将不同目标计算节点分组到不同的目标计算节点组，服务器在目标计算节点的不同组中的每一个中提供根节点，并依赖于根节点在每个不同的组中，以对等服务器提供每个不同组中的剩余节点。

26. 发明授权

US08374822B2 Experiment parameters for wald'S sequential tests based on continued fractions 失效
$Experiment parameters for wald'S sequential tests based on continued fractions$
标题翻译：基于持续分数的wald的连续测试的实验参数
公开(公告)号：US08374822B2
公开(公告)日：2013-02-12
申请号：US12619054
申请日：2009-11-16
申请人： Genady Grabarnik , Yefim H. Michlin , Larisa Shwartz
发明人： Genady Grabarnik , Yefim H. Michlin , Larisa Shwartz
IPC分类号： G06F17/18
CPC分类号： G06F11/008
摘要： Test characteristics are determined at vertices of a rectangle defined on a sequential probability ratio test plot of a number of failures of a new physical system versus a number of failures of a baseline physical system. Based on the test characteristics, errors of first and second order are approximated as planes. Based on the approximating, intercepts of accept and reject boundaries are estimated. Based on slopes of the planes and actual values of the errors of the first and second orders, a starting point is determined on a graph of values of an intercept of the reject boundary and values of an intercept of the accept boundary. A minimum of an operating characteristic function is determined by alternative advances, commencing at the starting point, parallel to an axis representing the accept boundary intercept and an axis representing the reject boundary intercept.
摘要翻译：测试特征是在新的物理系统的故障数量与基准物理系统的故障数量的顺序概率比测试图上定义的矩形的顶点确定的。基于测试特征，第一和第二阶的误差近似为平面。基于近似，估计接收和拒绝边界的截距。基于平面的斜率和第一和第二阶的误差的实际值，在拒绝边界的截距值和接受边界的截距的值的图形上确定起始点。运行特征函数的最小值由替代进位确定，从起始点开始，平行于表示接受边界截距的轴和表示拒绝边界截距的轴。

27. 发明授权

US08214734B2 Credibility of text analysis engine performance evaluation by rating reference content 有权
标题翻译：文本分析引擎性能评估的可信度通过评级参考内容
公开(公告)号：US08214734B2
公开(公告)日：2012-07-03
申请号：US12248132
申请日：2008-10-09
申请人： Genady Grabarnik , Lev Kozakov , Larisa Shwartz
发明人： Genady Grabarnik , Lev Kozakov , Larisa Shwartz
IPC分类号： G06F17/00
CPC分类号： G06F17/241 , G06F17/30598 , G06F17/30705 , G06F17/3071
摘要： Evaluating the performance of a text analysis engine is provided. A plurality of pre-annotated reference documents and a set of annotation types associated with the pre-annotated reference documents are received. Annotation contexts of reference annotations in the plurality of pre-annotated reference documents are analyzed using the set of annotation types. Similar annotation contexts are identified between the reference annotations and the set of annotation types. Responsive to identifying the similar annotation contexts, the similar annotation contexts are clustered thereby forming a plurality of reference annotation clusters. A set of reference content heterogeneity scores are computed based on the number of reference annotation clusters for each annotation type in the set of annotation types. An integral reference content rate for the set of annotation types is then computed and output to a user.
摘要翻译：提供了文本分析引擎的性能评估。接收多个预先注释的参考文档和与预注释的参考文档相关联的一组注释类型。使用注释类型集来分析多个预先注释的参考文献中的引用注释的注释上下文。在引用注释和注释类型集之间标识相似的注释上下文。响应于识别类似的注释上下文，类似的注释上下文被聚集，从而形成多个参考注释簇。基于在注释类型集合中的每个注释类型的引用注释集合的数量来计算一组参考内容异质性分数。然后计算一组注释类型的整体参考内容速率并将其输出给用户。

28. 发明授权

US08126753B2 Evaluation of a process metric 有权
标题翻译：评估流程度量
公开(公告)号：US08126753B2
公开(公告)日：2012-02-28
申请号：US11834328
申请日：2007-08-06
申请人： Nikolaos Anerousis , Abhijit Bose , Genady Grabarnik , Debanjan Saha , Larisa Shwartz , Shu Tao
发明人： Nikolaos Anerousis , Abhijit Bose , Genady Grabarnik , Debanjan Saha , Larisa Shwartz , Shu Tao
IPC分类号： G06F17/60
CPC分类号： G06Q10/06 , G06Q10/04 , G06Q10/063 , G06Q10/06395
摘要： An exemplary method of responding to a request for a value of at least one metric associated with at least one process includes a step of determining whether responding to the request requires updating the value of the at least one metric. When responding to the request does not require updating the value of the at least one metric, a response is determined based at least in part on at least one stored value of the at least one metric. When responding to the request does require updating the value of the at least one metric, the value of the at least one metric is updated and a response is determined based at least in part on the at least one updated value of the at least one metric. Updating the value of the at least one metric, at least when responding to the request requires updating the value of the at least one metric, includes steps of determining at least one new value of the at least one metric based at least in part on at least one stored value of the at least one metric and storing the at least one new value of the at least one metric. The method also includes a step of responding to the request with the determined response.
摘要翻译：响应对与至少一个过程相关联的至少一个度量的值的请求的示例性方法包括确定对该请求的响应是否需要更新该至少一个度量的值的步骤。当响应于请求不需要更新至少一个度量的值时，至少部分地基于至少一个度量的至少一个存储的值来确定响应。当响应于请求确实需要更新至少一个度量的值时，更新至少一个度量的值，并且至少部分地基于至少一个度量的至少一个更新值来确定响应。至少在响应于该请求需要更新至少一个度量的值时，更新该至少一个度量的值包括以下步骤：至少部分地基于以下内容来确定至少一个度量的至少一个新值：所述至少一个度量的至少一个存储值并且存储所述至少一个度量的所述至少一个新值。该方法还包括以确定的响应来响应请求的步骤。

29. 发明授权

US07987146B2 System and method for matching multi-node software system provisioning requirements and capabilities using rough set theory 失效
标题翻译：使用粗糙集理论对多节点软件系统配置要求和能力进行匹配的系统和方法
公开(公告)号：US07987146B2
公开(公告)日：2011-07-26
申请号：US11669781
申请日：2007-01-31
申请人： Larisa Shwartz , Genady Grabarnik , Maheswaran Surendra , Naga A. Ayachitula
发明人： Larisa Shwartz , Genady Grabarnik , Maheswaran Surendra , Naga A. Ayachitula
IPC分类号： G06F17/00 , G06N5/00
CPC分类号： G06F8/61
摘要： A system and method for provisioning software on a plurality of computational nodes in a distributed computing environment. A plurality of support processing requirements associated with a software product is accepted. The plurality of requirements is expanded into multiple sets of installation requirements. At least one set of installation requirements in the multiple sets of installation requirements are minimized to produce at least one minimized set of installation requirements. A determination is made as to whether any pair of requirements in the minimized set of installation requirements includes a pair of conflicting requirements. A determination of whether the software product allows each requirement in the pair of conflicting requirements to be located on separate nodes is also made. At least one multi-node installation topology is determined for the software product. The multi-node installation topology includes a plurality of installation requirement sets for each node in the multi-node installation topology.
摘要翻译：一种用于在分布式计算环境中的多个计算节点上配置软件的系统和方法。接受与软件产品相关联的多个支持处理要求。多项要求扩展到多套安装要求。在多组安装要求中至少有一组安装要求最小化，以产生至少一组最小化的安装要求。确定最小化安装要求中的任何一对要求是否包含一对冲突的要求。还确定软件产品是否允许该对冲突要求中的每个需求位于单独的节点上。为软件产品确定至少一个多节点安装拓扑。多节点安装拓扑包括多节点安装拓扑中每个节点的多个安装要求集。

30. 发明申请

US20110173405A1 SYSTEM AND METHOD FOR REDUCING LATENCY TIME WITH CLOUD SERVICES 有权
标题翻译：用于降低云服务时间的系统和方法
公开(公告)号：US20110173405A1
公开(公告)日：2011-07-14
申请号：US12686760
申请日：2010-01-13
申请人： Genady Grabarnik , Markus Klems , Larisa Shwartz , Stefan Tai , Christopher Ward
发明人： Genady Grabarnik , Markus Klems , Larisa Shwartz , Stefan Tai , Christopher Ward
IPC分类号： G06F12/14
CPC分类号： H04L47/786 , G06F11/1464 , G06F17/30345 , G06F2201/815 , H04L41/0226 , H04L67/26
摘要： A system and method for reducing service latency includes dividing an information technology service for a customer into an infrastructure management service and a data management service. Data associated with the information technology service is stored in a backup memory. A set of infrastructure images related to the information technology service is stored at a cloud service provider. The infrastructure images are updated with software updates and hardware updates, as needed, and the data associated with the information technology service is updated through backup and restore mechanisms. The set of infrastructure images that have been updated with data with latest updates are started for recovery, continuity, testing, etc.
摘要翻译：用于减少服务延迟的系统和方法包括将用于客户的信息技术服务划分为基础设施管理服务和数据管理服务。与信息技术服务相关联的数据存储在备份存储器中。与信息技术服务相关的一组基础设施图像存储在云服务提供商处。基础设施图像根据需要通过软件更新和硬件更新进行更新，并通过备份和恢复机制更新与信息技术服务相关的数据。已经使用最新更新的数据更新的基础设施图像集合将开始进行恢复，连续性，测试等。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式