会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 72. 发明授权
    • Experiment parameters for wald'S sequential tests based on continued fractions
    • 基于持续分数的wald的连续测试的实验参数
    • US08374822B2
    • 2013-02-12
    • US12619054
    • 2009-11-16
    • Genady GrabarnikYefim H. MichlinLarisa Shwartz
    • Genady GrabarnikYefim H. MichlinLarisa Shwartz
    • G06F17/18
    • 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.
    • 测试特征是在新的物理系统的故障数量与基准物理系统的故障数量的顺序概率比测试图上定义的矩形的顶点确定的。 基于测试特征,第一和第二阶的误差近似为平面。 基于近似,估计接收和拒绝边界的截距。 基于平面的斜率和第一和第二阶的误差的实际值,在拒绝边界的截距值和接受边界的截距的值的图形上确定起始点。 运行特征函数的最小值由替代进位确定,从起始点开始,平行于表示接受边界截距的轴和表示拒绝边界截距的轴。
    • 74. 发明授权
    • Credibility of text analysis engine performance evaluation by rating reference content
    • 文本分析引擎性能评估的可信度通过评级参考内容
    • US08214734B2
    • 2012-07-03
    • US12248132
    • 2008-10-09
    • Genady GrabarnikLev KozakovLarisa Shwartz
    • Genady GrabarnikLev KozakovLarisa Shwartz
    • G06F17/00
    • G06F17/241G06F17/30598G06F17/30705G06F17/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.
    • 提供了文本分析引擎的性能评估。 接收多个预先注释的参考文档和与预注释的参考文档相关联的一组注释类型。 使用注释类型集来分析多个预先注释的参考文献中的引用注释的注释上下文。 在引用注释和注释类型集之间标识相似的注释上下文。 响应于识别类似的注释上下文,类似的注释上下文被聚集,从而形成多个参考注释簇。 基于在注释类型集合中的每个注释类型的引用注释集合的数量来计算一组参考内容异质性分数。 然后计算一组注释类型的整体参考内容速率并将其输出给用户。
    • 75. 发明授权
    • Evaluation of a process metric
    • 评估流程度量
    • US08126753B2
    • 2012-02-28
    • US11834328
    • 2007-08-06
    • Nikolaos AnerousisAbhijit BoseGenady GrabarnikDebanjan SahaLarisa ShwartzShu Tao
    • Nikolaos AnerousisAbhijit BoseGenady GrabarnikDebanjan SahaLarisa ShwartzShu Tao
    • G06F17/60
    • G06Q10/06G06Q10/04G06Q10/063G06Q10/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.
    • 响应对与至少一个过程相关联的至少一个度量的值的请求的示例性方法包括确定对该请求的响应是否需要更新该至少一个度量的值的步骤。 当响应于请求不需要更新至少一个度量的值时,至少部分地基于至少一个度量的至少一个存储的值来确定响应。 当响应于请求确实需要更新至少一个度量的值时,更新至少一个度量的值,并且至少部分地基于至少一个度量的至少一个更新值来确定响应 。 至少在响应于该请求需要更新至少一个度量的值时,更新该至少一个度量的值包括以下步骤:至少部分地基于以下内容来确定至少一个度量的至少一个新值: 所述至少一个度量的至少一个存储值并且存储所述至少一个度量的所述至少一个新值。 该方法还包括以确定的响应来响应请求的步骤。
    • 76. 发明授权
    • Systems, methods and computer program products for supervised dimensionality reduction with mixed-type features and labels
    • 用于混合型特征和标签的监督降维的系统,方法和计算机程序产品
    • US07996342B2
    • 2011-08-09
    • US12031775
    • 2008-02-15
    • Genady GrabarnikIrina Rish
    • Genady GrabarnikIrina Rish
    • G06F15/18
    • G06K9/6247
    • Systems, methods and computer program products for supervised dimensionality reduction. Exemplary embodiments include a method including receiving an input in the form of a data matrix X of size N×D, wherein N is a number of samples, D is a dimensionality, a vector Y of size N×1, hidden variables U of a number K, a data type of the matrix X and the vector Y, and a trade-off constant alpha; selecting loss functions in the form of Lx(X,UV) and Ly(Y,UW) appropriate for the type of data in the matrix X and the vector Y, where U, V and W are matrices, selecting corresponding sets of update rules RU, RV and RW for updating the matrices U,V and W, learning U, V and W that provide a minimum total loss L(U,V,W)=Lx(X,UV)+alpha*Ly(Y,UW), and returning matrices U, V and W.
    • 用于监督维度降低的系统,方法和计算机程序产品。 示例性实施例包括一种方法,包括以尺寸N×D的数据矩阵X的形式接收输入,其中N是样本数,D是维度,大小为N×1的向量Y, 数字K,矩阵X的数据类型和向量Y,以及权衡常数α; 选择适合矩阵X中的数据类型的Lx(X,UV)和Ly(Y,UW)的形式的损失函数,其中U,V和W是矩阵,选择相应的更新规则集 RU,RV和RW用于更新矩阵U,V和W,学习U,V和W,其提供最小总损耗L(U,V,W)= Lx(X,UV)+α* Ly(Y,UW )和返回矩阵U,V和W.
    • 77. 发明授权
    • 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 ShwartzGenady GrabarnikMaheswaran SurendraNaga A. Ayachitula
    • Larisa ShwartzGenady GrabarnikMaheswaran SurendraNaga A. Ayachitula
    • G06F17/00G06N5/00
    • 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.
    • 一种用于在分布式计算环境中的多个计算节点上配置软件的系统和方法。 接受与软件产品相关联的多个支持处理要求。 多项要求扩展到多套安装要求。 在多组安装要求中至少有一组安装要求最小化,以产生至少一组最小化的安装要求。 确定最小化安装要求中的任何一对要求是否包含一对冲突的要求。 还确定软件产品是否允许该对冲突要求中的每个需求位于单独的节点上。 为软件产品确定至少一个多节点安装拓扑。 多节点安装拓扑包括多节点安装拓扑中每个节点的多个安装要求集。
    • 79. 发明授权
    • Methods and apparatus for creation of parsing rules
    • 用于创建解析规则的方法和设备
    • US07895611B2
    • 2011-02-22
    • US11756278
    • 2007-05-31
    • Genady GrabarnikSheng MaChang-shing PerngAbdolreza SalahshourDavid H. Thoenen
    • Genady GrabarnikSheng MaChang-shing PerngAbdolreza SalahshourDavid H. Thoenen
    • G06F9/44G06F17/00
    • G06F8/427
    • Techniques for parsing rule creation are provided. A technique for constructing one or more message parsing rules may comprise the following steps. First, message data representing past messages, for example, associated with a network, an application and/or a system being analyzed, is obtained. For example, this may involve reading the past or historical message data from messages logs or having a system point to the message data in existing data storage. Parsing rules are then generated by a process from one or more existing rule templates and/or based on user selection and classification of at least a portion of a message. For example, the user may choose a message part and demonstratively classify the part, for example, as a positive or negative example. The generated rules may then be stored for access by a rule-based parsing system such as a message adaptation system. Prior to generation of the one or more parsing rules, a message structure may be established upon which generation of the rules may be based.
    • 提供了解析规则创建的技术。 用于构建一个或多个消息解析规则的技术可以包括以下步骤。 首先,获得表示与网络相关联的过去消息的消息数据,正在分析的应用和/或系统。 例如,这可能涉及从消息日志中读取过去或历史消息数据或者将系统指向现有数据存储器中的消息数据。 解析规则然后由来自一个或多个现有规则模板的过程和/或基于消息的至少一部分的用户选择和分类生成。 例如,用户可以选择一个消息部分并且将该部分示范地分类,例如,作为肯定或否定的示例。 然后,所生成的规则可以被存储以用于基于规则的解析系统(例如消息适配系统)的访问。 在生成一个或多个解析规则之前,可以建立基于规则的生成的消息结构。