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

1. 发明授权

US10409892B2 Formatting data by example 有权
公开(公告)号：US10409892B2
公开(公告)日：2019-09-10
申请号：US13014520
申请日：2011-01-26
申请人： Chad Rothschiller , Daniel Battagin , Christopher Benedict , Rodrigo Moreira-Silveira , Dmitri O. Danilov , Eric Cohen , Sumit Gulwani , Dany Rouhana , Rishabh Singh , Benjamin Goth Zorn , Ramarathnam Venkatesan
发明人： Chad Rothschiller , Daniel Battagin , Christopher Benedict , Rodrigo Moreira-Silveira , Dmitri O. Danilov , Eric Cohen , Sumit Gulwani , Dany Rouhana , Rishabh Singh , Benjamin Goth Zorn , Ramarathnam Venkatesan
IPC分类号： G06F17/00 , G06F17/21
摘要： Data formatting rules to convert data from one form to another form are automatically determined based on a user's edits. A machine learning heuristic is applied to a user's edits to determine a data formatting rule that may be applied to data. For example, a user may make edits that add/remove characters from data, concatenate data, extract data, rename data, and the like. The machine learning heuristic may be automatically triggered in response to an event (e.g. after a predetermined number of edits are made to a same type of data) or manually triggered (e.g. selecting a user interface option). The data formatting rule may be applied to other data and the results of the formatting reviewable by the user. Based on further edits/reviews, the data formatting rule may be updated. The data formatting rules may be stored for later use.

2. 发明申请

US20120192051A1 FORMATTING DATA BY EXAMPLE 审中-公开
标题翻译：按实例格式数据
公开(公告)号：US20120192051A1
公开(公告)日：2012-07-26
申请号：US13014520
申请日：2011-01-26
申请人： Chad Rothschiller , Daniel Battagin , Christopher Benedict , Rodrigo Moreira-Silveira , Dmitri O. Danilov , Eric Cohen , Sumit Gulwani , Dany Rouhana , Rishabh Singh , Benjamin Goth Zorn , Ramarathnam Venkatesan
发明人： Chad Rothschiller , Daniel Battagin , Christopher Benedict , Rodrigo Moreira-Silveira , Dmitri O. Danilov , Eric Cohen , Sumit Gulwani , Dany Rouhana , Rishabh Singh , Benjamin Goth Zorn , Ramarathnam Venkatesan
IPC分类号： G06F17/00
CPC分类号： G06F17/211
摘要： Data formatting rules to convert data from one form to another form are automatically determined based on a user's edits. A machine learning heuristic is applied to a user's edits to determine a data formatting rule that may be applied to data. For example, a user may make edits that add/remove characters from data, concatenate data, extract data, rename data, and the like. The machine learning heuristic may be automatically triggered in response to an event (e.g. after a predetermined number of edits are made to a same type of data) or manually triggered (e.g. selecting a user interface option). The data formatting rule may be applied to other data and the results of the formatting reviewable by the user. Based on further edits/reviews, the data formatting rule may be updated. The data formatting rules may be stored for later use.
摘要翻译：根据用户的编辑自动确定将数据从一个表单转换为另一个表单的数据格式化规则。机器学习启发式应用于用户的编辑以确定可应用于数据的数据格式化规则。例如，用户可以进行从数据添加/移除字符，连接数据，提取数据，重命名数据等的编辑。可以响应于事件（例如在对相同类型的数据进行预定数量的编辑）或手动触发（例如，选择用户界面选项）之后，可以自动地触发机器学习启发式。数据格式规则可以应用于其他数据以及用户可评估的格式的结果。根据进一步的编辑/评论，可能会更新数据格式规则。可以存储数据格式化规则供以后使用。

3. 发明授权

US08402439B2 Program analysis as constraint solving 有权
标题翻译：程序分析作为约束求解
公开(公告)号：US08402439B2
公开(公告)日：2013-03-19
申请号：US12147908
申请日：2008-06-27
申请人： Sumit Gulwani , Saurabh Srivastava , Ramarathnam Venkatesan
发明人： Sumit Gulwani , Saurabh Srivastava , Ramarathnam Venkatesan
IPC分类号： G06F9/44
CPC分类号： G06F8/49
摘要： Described is a technology by which program analysis uses rich invariant templates that may specify an arbitrary Boolean combination of linear inequalities for program verification. Also described is choosing a cut-set that identifies program locations, each of which is associated with an invariant template. The verification generates second-order constraints, converts second-order logic formula based on those constraints into first-order logic formula, then converts the first-order logic formula into a quantifier-free formula, which is then converted into a Boolean satisfiability formula. Off-the-shelf constraint solvers may then be applied to the Boolean satisfiability formula to generate program analysis results. Various templates may be used to convert the second-order logic formula into the first-order logic formula. Further described are interprocedural analysis and the determination of weakest precondition and strongest postcondition with applications to termination analysis, timing bounds analysis, and generation of most-general counterexamples for both termination and safety properties.
摘要翻译：描述了一种技术，程序分析使用丰富的不变模板，可以为程序验证指定线性不等式的任意布尔组合。还描述了选择一个标识程序位置的剪辑，每个程序位置与不变模板相关联。验证产生二阶约束，将基于这些约束的二阶逻辑公式转换为一阶逻辑公式，然后将一阶逻辑公式转换为无量词的公式，然后将其转换为布尔可满足公式。现在可以将现成的约束求解器应用于布尔可满足公式以生成程序分析结果。可以使用各种模板来将二阶逻辑公式转换成一阶逻辑公式。进一步描述的是过程间分析以及最弱前提条件和最强后置条件的确定，适用于终止分析，时序界限分析，以及针对终端和安全属性生成大多数一般的反例。

4. 发明申请

US20090326907A1 PROGRAM ANALYSIS AS CONSTRAINT SOLVING 有权
标题翻译：程序分析作为约束解
公开(公告)号：US20090326907A1
公开(公告)日：2009-12-31
申请号：US12147908
申请日：2008-06-27
申请人： Sumit Gulwani , Saurabh Srivastava , Ramarathnam Venkatesan
发明人： Sumit Gulwani , Saurabh Srivastava , Ramarathnam Venkatesan
IPC分类号： G06F9/45 , G06F7/60
CPC分类号： G06F8/49
摘要： Described is a technology by which program analysis uses rich invariant templates that may specify an arbitrary Boolean combination of linear inequalities for program verification. Also described is choosing a cut-set that identifies program locations, each of which is associated with an invariant template. The verification generates second-order constraints, converts second-order logic formula based on those constraints into first-order logic formula, then converts the first-order logic formula into a quantifier-free formula, which is then converted into a Boolean satisfiability formula. Off-the-shelf constraint solvers may then be applied to the Boolean satisfiability formula to generate program analysis results. Various templates may be used to convert the second-order logic formula into the first-order logic formula. Further described are interprocedural analysis and the determination of weakest precondition and strongest postcondition with applications to termination analysis, timing bounds analysis, and generation of most-general counterexamples for both termination and safety properties.
摘要翻译：描述了一种技术，程序分析使用丰富的不变模板，可以为程序验证指定线性不等式的任意布尔组合。还描述了选择一个标识程序位置的剪辑，每个程序位置与不变模板相关联。验证产生二阶约束，将基于这些约束的二阶逻辑公式转换为一阶逻辑公式，然后将一阶逻辑公式转换为无量词的公式，然后将其转换为布尔可满足公式。现在可以将现成的约束求解器应用于布尔可满足公式以生成程序分析结果。可以使用各种模板来将二阶逻辑公式转换成一阶逻辑公式。进一步描述的是过程间分析以及最弱前提条件和最强后置条件的确定，适用于终止分析，时序界限分析，以及针对终端和安全属性生成大多数一般的反例。

5. 发明授权

US08271404B2 Template based approach to discovering disjunctive and quantified invariants over predicate abstraction 有权
标题翻译：基于模板的方法来发现关于谓词抽象的分离和量化不变量
公开(公告)号：US08271404B2
公开(公告)日：2012-09-18
申请号：US12244674
申请日：2008-10-02
申请人： Sumit Gulwani , Ramarathnam Venkatesan , Saurabh Srivastava
发明人： Sumit Gulwani , Ramarathnam Venkatesan , Saurabh Srivastava
IPC分类号： G06F15/18
CPC分类号： G06F11/3608
摘要： Techniques are disclosed for generating complex invariants in a program using a Satisfiability Modulo Theories (SMT) solver. In one embodiment, the generated invariants may be used to validate assert statements in a program. Additionally or alternatively, a weakest pre-condition invariant may be generated such that parameters passed to the program that satisfy the weakest pre-condition are guaranteed to satisfy the program's assert statements. Additionally or alternatively, a strongest post-condition may be generated, determining what is guaranteed to be true about the state of the program upon completion of the program. In one embodiment, the SMT solver generates invariants by mapping predicates onto unknown variables in a template. The template may comprise unknown variables related by logical structures defined with disjunctions, universal quantifiers, and existential quantifiers. The predicates may comprise equalities and inequalities between program variables.
摘要翻译：公开了在使用可满足性模理论（SMT）求解器的程序中生成复杂不变量的技术。在一个实施例中，生成的不变量可用于验证程序中的断言声明。另外或替代地，可以生成最弱的前置条件不变量，使得传递到满足最弱前置条件的程序的参数被保证满足程序的断言语句。另外或替代地，可以产生最强的后置条件，确定在程序完成时对程序的状态有保证是真实的。在一个实施例中，SMT求解器通过将谓词映射到模板中的未知变量来生成不变量。模板可以包括通过用分离定义的逻辑结构相关的未知变量，通用量词和存在量词。谓词可能包含程序变量之间的均等和不等式。

6. 发明申请

US20100088548A1 Using Constraint Solving to Discovering Disjunctive and Quantified Invariants Over Predicate Abstraction 有权
标题翻译：使用约束求解在谓词抽象上发现分离和量化不变量
公开(公告)号：US20100088548A1
公开(公告)日：2010-04-08
申请号：US12244674
申请日：2008-10-02
申请人： Sumit Gulwani , Ramarathnam Venkatesan , Saurabh Srivastava
发明人： Sumit Gulwani , Ramarathnam Venkatesan , Saurabh Srivastava
IPC分类号： G06F11/00
CPC分类号： G06F11/3608
摘要： Techniques are disclosed for generating complex invariants in a program using a Satisfiability Modulo Theories (SMT) solver. In one embodiment, the generated invariants may be used to validate assert statements in a program. Additionally or alternatively, a weakest pre-condition invariant may be generated such that parameters passed to the program that satisfy the weakest pre-condition are guaranteed to satisfy the program's assert statements. Additionally or alternatively, a strongest post-condition may be generated, determining what is guaranteed to be true about the state of the program upon completion of the program. In one embodiment, the SMT solver generates invariants by mapping predicates onto unknown variables in a template. The template may comprise unknown variables related by logical structures defined with disjunctions, universal quantifiers, and existential quantifiers. The predicates may comprise equalities and inequalities between program variables.
摘要翻译：公开了在使用可满足性模理论（SMT）求解器的程序中生成复杂不变量的技术。在一个实施例中，生成的不变量可用于验证程序中的断言声明。另外或替代地，可以生成最弱的前置条件不变量，使得传递到满足最弱前置条件的程序的参数被保证满足程序的断言语句。另外或替代地，可以产生最强的后置条件，确定在程序完成时对程序的状态有保证是真实的。在一个实施例中，SMT求解器通过将谓词映射到模板中的未知变量来生成不变量。模板可以包括通过用分离定义的逻辑结构相关的未知变量，通用量词和存在量词。谓词可能包含程序变量之间的均等和不等式。

7. 发明授权

US08989706B2 Automated secure pairing for wireless devices 有权
标题翻译：无线设备的自动安全配对
公开(公告)号：US08989706B2
公开(公告)日：2015-03-24
申请号：US13335454
申请日：2011-12-22
申请人： Ganesh Ananthanarayanan , Ramarathnam Venkatesan , Sean Blagsvedt
发明人： Ganesh Ananthanarayanan , Ramarathnam Venkatesan , Sean Blagsvedt
IPC分类号： H04W12/00 , H04W12/06 , H04W12/04 , H04L29/06 , H04W84/18
CPC分类号： H04W12/06 , H04L63/18 , H04W12/04 , H04W84/18
摘要： Systems, methods, and/or techniques (“tools”) are described herein that relate to automated secure pairing for devices, and that relate to parallel downloads of content using devices. The tools for pairing the devices may perform authentication protocols that are based on addresses and on keys. The address-based authentication protocol may operate on address book entries maintained by the devices. The key-based authentication protocol may operate using a key exchange between the devices.
摘要翻译：这里描述了与设备的自动安全配对相关的系统，方法和/或技术（“工具”），并且涉及使用设备的内容的并行下载。用于配对设备的工具可以执行基于地址和密钥的认证协议。基于地址的认证协议可以对由设备维护的地址簿条目进行操作。基于密钥的认证协议可以使用设备之间的密钥交换来操作。

8. 发明授权

US08595276B2 Randomized signal transforms and their applications 失效
标题翻译：随机信号变换及其应用
公开(公告)号：US08595276B2
公开(公告)日：2013-11-26
申请号：US12782647
申请日：2010-05-18
申请人： Ramarathnam Venkatesan , Michael T. Malkin
发明人： Ramarathnam Venkatesan , Michael T. Malkin
IPC分类号： G06F1/02
CPC分类号： H04N7/167 , H04N21/8358
摘要： Techniques are disclosed to provide randomized signal transforms and/or their applications. More particularly, a signal (e.g., an audio signal, an image, or a video signal) is transformed by applying randomly-selected basis functions to the signal. The applications of the randomized signal transforms include, but are not limited to, compression, denoising, hashing, identification, authentication, and data embedding (e.g., watermarking).
摘要翻译：公开了提供随机信号变换和/或其应用的技术。更具体地，通过对信号应用随机选择的基函数来变换信号（例如，音频信号，图像或视频信号）。随机信号变换的应用包括但不限于压缩，去噪，散列，识别，认证和数据嵌入（例如，水印）。

9. 发明授权

US08364617B2 Resilient classification of data 有权
标题翻译：弹性数据分类
公开(公告)号：US08364617B2
公开(公告)日：2013-01-29
申请号：US11625249
申请日：2007-01-19
申请人： Srivatsan Laxman , Ramarathnam Venkatesan
发明人： Srivatsan Laxman , Ramarathnam Venkatesan
IPC分类号： G06E1/00 , G06F15/18
CPC分类号： G06N99/005 , G06K9/6256 , G06K9/6269 , G06K9/6292
摘要： A classification system is described for resilient classification of data. In various embodiments, the classification system divides a full set of the training data into a positive subset and a negative subset. The positive subset contains all training data with a positive classification value and the negative subset contains all training data with a negative classification value. The classification system constructs several subsets of the training data wherein each subset contains data randomly selected from both the positive subset and the negative subset. The classification system then creates at least two classifiers based on each of the randomly created subsets of the training data.
摘要翻译：描述了对数据进行弹性分类的分类系统。在各种实施例中，分类系统将整套训练数据划分为正子集和负子集。正子集包含具有正分类值的所有训练数据，负子集包含具有负分类值的所有训练数据。分类系统构建训练数据的几个子集，其中每个子集包含从正子集和负子集两者随机选择的数据。分类系统然后基于训练数据的随机创建的子集中的每一个创建至少两个分类器。

10. 发明授权

US08032754B2 Systems and methods for embedding media forensic identification markings 有权
标题翻译：用于嵌入媒体法医识别标记的系统和方法
公开(公告)号：US08032754B2
公开(公告)日：2011-10-04
申请号：US10754235
申请日：2004-01-09
申请人： Mehmet Kivanc Mihcak , Ramarathnam Venkatesan , Mehmet Kucukgoz
发明人： Mehmet Kivanc Mihcak , Ramarathnam Venkatesan , Mehmet Kucukgoz
IPC分类号： H04L9/32
CPC分类号： G06T1/005 , G06T2201/0052 , G06T2201/0063 , G06T2201/0065 , G06T2201/0083 , H04N1/32144 , H04N1/32187 , H04N1/32229 , H04N2201/3205 , H04N2201/323 , H04N2201/327
摘要： The present invention leverages a series of media watermark locations to provide information relating to media ownership and/or distribution source. This provides a forensic means to establish a source of media with a high degree of certainty despite malicious and/or non-malicious attacks. By providing embedded user unique identification, a source of copied media can be determined without the embedded information substantially interfering with the intended purpose of the media itself. In one instance of the present invention, digital media is transformed into an N-dimensional media signal. User unique keys are then utilized along with a master key to determine locations for embedding a watermark signal that possesses substantially similar quantized statistics as the transformed media signal. The watermark signal is then embedded into the media signal, fingerprinting the media.
摘要翻译：本发明利用一系列媒体水印位置来提供与媒体所有权和/或分发源相关的信息。这提供了一种法医手段，尽管恶意和/或非恶意攻击具有高度确定性的媒体来源。通过提供嵌入式用户唯一标识，可以确定复制媒体的来源，而不会使嵌入的信息基本上干扰媒体本身的预期目的。在本发明的一个实例中，数字媒体被转换为N维媒体信号。然后，用户唯一密钥与主密钥一起被使用以确定用于嵌入具有基本相似的量化统计量的水印信号作为变换的媒体信号的位置。然后将水印信号嵌入到媒体信号中，对媒体进行指纹识别。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式