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

61. 发明授权

US08478535B2 Systems and methods that utilize machine learning algorithms to facilitate assembly of aids vaccine cocktails 有权
标题翻译：利用机器学习算法方便装配疫苗鸡尾酒的系统和方法
公开(公告)号：US08478535B2
公开(公告)日：2013-07-02
申请号：US11324506
申请日：2005-12-30
申请人： Nebojsa Jojic , Vladimir Jojic , David E. Heckerman , Brendan John Frey , Christopher A. Meek
发明人： Nebojsa Jojic , Vladimir Jojic , David E. Heckerman , Brendan John Frey , Christopher A. Meek
IPC分类号： G01N33/50
CPC分类号： G06F19/22 , G06F19/14 , G06F19/18 , G06F19/24 , G06G7/48 , G06G7/58
摘要： The subject invention provides systems and methods that facilitate AIDS vaccine cocktail assembly via machine learning algorithms such as a cost function, a greedy algorithm, an expectation-maximization (EM) algorithm, etc. Such assembly can be utilized to generate vaccine cocktails for species of pathogens that evolve quickly under immune pressure of the host. For example, the systems and methods of the subject invention can be utilized to facilitate design of T cell vaccines for pathogens such HIV. In addition, the systems and methods of the subject invention can be utilized in connection with other applications, such as, for example, sequence alignment, motif discovery, classification, and recombination hot spot detection. The novel techniques described herein can provide for improvements over traditional approaches to designing vaccines by constructing vaccine cocktails with higher epitope coverage, for example, in comparison with cocktails of consensi, tree nodes and random strains from data.
摘要翻译：本发明提供了通过诸如成本函数，贪心算法，期望最大化（EM）算法等机器学习算法来促进艾滋病疫苗鸡尾酒组合的系统和方法。可以利用这种装配来产生疫苗鸡尾酒，在宿主免疫压力下快速发展的病原体。例如，本发明的系统和方法可以用于促进用于诸如HIV的病原体的T细胞疫苗的设计。此外，本发明的系统和方法可以与其他应用相结合使用，例如序列比对，基序发现，分类和重组热点检测。本文所述的新颖技术可以提供改进，以通过构建具有较高表位覆盖度的疫苗混合物来设计疫苗的传统方法，例如与来自数据的共同体，树节点和随机菌株的鸡尾酒相比。

62. 发明授权

US08214890B2 Login authentication using a trusted device 有权
标题翻译：使用可信设备进行登录验证
公开(公告)号：US08214890B2
公开(公告)日：2012-07-03
申请号：US12198914
申请日：2008-08-27
申请人： Darko Kirovski , Christopher A. Meek
发明人： Darko Kirovski , Christopher A. Meek
IPC分类号： G06F15/16
CPC分类号： H04L9/3073 , H04L9/3234 , H04L9/3263 , H04L9/3271 , H04L63/061 , H04L63/0823 , H04L63/0853 , H04L63/18 , H04L2209/56 , H04L2209/805 , H04L2463/062
摘要： A user working on a client computer is allowed to remotely login to a server over a computer network. A first secure connection is established between the client and the server. Communications with a trusted device which is in the user's control is established via a communication channel between the trusted device and the client, where this channel is not part of the network. A second secure connection is established between the trusted device and the server through the client, where this second secure connection is tunneled within the first secure connection. The user remotely logs into the server over the second secure connection using the trusted device.
摘要翻译：允许在客户端计算机上工作的用户通过计算机网络远程登录到服务器。在客户端和服务器之间建立第一个安全连接。通过信任设备和客户端之间的通信信道建立与用户控制中的信任设备的通信，其中该信道不是网络的一部分。通过客户端在可信设备和服务器之间建立第二安全连接，其中该第二安全连接在第一安全连接内被隧道传送。用户使用受信任的设备通过第二个安全连接远程登录到服务器。

63. 发明申请

US20110314537A1 AUTOMATIC CONSTRUCTION OF HUMAN INTERACTION PROOF ENGINES 有权
标题翻译：人类交互防护机器人的自动化建设
公开(公告)号：US20110314537A1
公开(公告)日：2011-12-22
申请号：US12821124
申请日：2010-06-22
申请人： Geoffrey J. Hulten , Patrice Y. Simard , Darko Kirovski , Jesper B. Lind , Christopher A. Meek
发明人： Geoffrey J. Hulten , Patrice Y. Simard , Darko Kirovski , Jesper B. Lind , Christopher A. Meek
IPC分类号： G06F21/00
CPC分类号： G06F21/30 , G06F9/44 , G06F21/31 , G06F21/577 , G06F2221/2133 , H04L9/32
摘要： Human Interaction Proofs (“HIPs”, sometimes referred to as “captchas”), may be generated automatically. An captcha specification language may be defined, which allows a captcha scheme to be defined in terms of how symbols are to be chosen and drawn, and how those symbols are obscured. The language may provide mechanisms to specify the various ways in which to obscure symbols. New captcha schemes may be generated from existing specifications, by using genetic algorithms that combine features from existing captcha schemes that have been successful. Moreover, the likelihood that a captcha scheme has been broken by attackers may be estimated by collecting data on the time that it takes existing captcha schemes to be broken, and using regression to estimate the time to breakage as a function of either the captcha's features or its measured quality.
摘要翻译：人工交互证明（“HIP”，有时也称为“验证码”）可能会自动生成。可以定义验证码规范语言，这允许根据如何选择和绘制符号以及这些符号如何被遮蔽来定义验证码方案。该语言可以提供机制来指定模糊符号的各种方式。可以通过使用遗传算法从现有规范中生成新的验证码方案，该遗传算法将已经获得成功的现有验证码方案的功能相结合。此外，验证码计划已被攻击者破坏的可能性可以通过在现有验证码计划被破坏的时间收集数据来估计，并且使用回归来估计作为验证码的特征或函数的破坏时间其测量质量。

64. 发明申请

US20110214006A1 AUTOMATED LEARNING OF FAILURE RECOVERY POLICIES 有权
标题翻译：自动学习失败恢复政策
公开(公告)号：US20110214006A1
公开(公告)日：2011-09-01
申请号：US12713195
申请日：2010-02-26
申请人： Christopher A. Meek , Guy Shani
发明人： Christopher A. Meek , Guy Shani
IPC分类号： G06F15/18 , G06F11/07
CPC分类号： G06F11/079 , G06F11/0709
摘要： Described is automated learning of failure recovery policies based upon existing information regarding previous policies and actions. A learning mechanism automatically constructs a new policy for controlling a recovery process, based upon collected observable interactions of an existing policy with the process. In one aspect, the learning mechanism builds a partially observable Markov decision process (POMDP) model, and computes the new policy base upon the learned model. The new policy may perform automatic fault recovery, e.g., on a machine in a datacenter corresponding to the controlled process.
摘要翻译：描述了基于关于先前的策略和动作的现有信息来自动学习故障恢复策略。学习机制根据现有策略与流程的可观察的交互作用，自动构建一个控制恢复过程的新策略。在一方面，学习机制构建了部分可观察的马尔可夫决策过程（POMDP）模型，并根据学习模型计算出新的策略基础。新策略可以执行自动故障恢复，例如在对应于受控进程的数据中心的机器上。

65. 发明申请

US20110107242A1 TASK PREDICTION 有权
标题翻译：任务预测
公开(公告)号：US20110107242A1
公开(公告)日：2011-05-05
申请号：US12610392
申请日：2009-11-02
申请人： Timothy S. Paek , Christopher A. Meek
发明人： Timothy S. Paek , Christopher A. Meek
IPC分类号： G06F3/00
CPC分类号： G06Q10/10
摘要： This patent application pertains to computing scenarios that allow users to more readily accomplish desired tasks. One implementation includes at least one dictionary of potential auto-suggestions that can be generated in relation to user-input. The implementation also includes a text framework configured to weight at least some of the potential auto-suggestions based upon one or more parameters. This implementation further includes a task engine configured to associate tasks with at least some of the potential auto-suggestions.
摘要翻译：该专利申请涉及允许用户更容易地完成所需任务的计算场景。一个实现包括可以相对于用户输入生成的潜在的自动建议的至少一个字典。该实现还包括被配置为基于一个或多个参数来加权至少一些潜在的自动建议的文本框架。该实现还包括被配置为将任务与至少一些潜在的自动建议相关联的任务引擎。

66. 发明申请

US20100332315A1 GENERATION OF IMPRESSION PLANS FOR PRESENTING AND SEQUENCING ADVERTISEMENT AND SALES OPPORTUNITIES ALONG POTENTIAL ROUTES 审中-公开
标题翻译：陈述和排序广告的印制计划的生成和潜在的路线上的机会
公开(公告)号：US20100332315A1
公开(公告)日：2010-12-30
申请号：US12492861
申请日：2009-06-26
申请人： Semiha Ece Kamar , Eric Horvitz , Christopher A. Meek , Stephen Lombardi
发明人： Semiha Ece Kamar , Eric Horvitz , Christopher A. Meek , Stephen Lombardi
IPC分类号： G06Q30/00 , G06F17/10
CPC分类号： G06Q30/0247 , G06Q30/02 , G06Q30/0254 , G06Q30/0261
摘要： A mobile device may present advertisements to users. However, advertisements may be ineffective or dangerous if presented when the attention of the user is unavailable (e.g., while operating a vehicle at a busy intersection.) It may also be desirable to select a sequence of advertisements that interrelate, or that relate the route of the user to an advertised product or service. Therefore, potential routes may be identified (e.g., based on user history or nearby locations of interest), and for potential routes, advertisement opportunities may be identified where the user may have an at least partial attention availability (e.g., traffic signals and fuel stops.) Advertisements may be selected for presentation at the advertisement opportunities of respective potential routes. Additionally, advertisement opportunities may be offered to advertisers in an auction model, and advertisers may specify conditions of advertisements (e.g., competitive placement exclusive of competitors' advertisements, or combinatorial placement of several advertisements.)
摘要翻译：移动设备可以向用户呈现广告。然而，如果在用户的注意不可用时（例如，在繁忙的十字路口操作车辆时），则在广告可能无效或危险的情况下可能是无效的或者危险的。还可能期望选择一系列的广告，这些广告相互关联或涉及路线用户到广告的产品或服务。因此，可以识别潜在路线（例如，基于用户历史或附近的兴趣位置），并且对于潜在的路线，可以识别广告机会，其中用户可能具有至少部分注意力可用性（例如，交通信号和燃料停止可以选择广告来呈现各自潜在路线的广告机会。此外，可以在拍卖模式中向广告商提供广告机会，并且广告商可以指定广告的条件（例如，排除竞争对手的广告的竞争性布置，或组合放置多个广告）。

67. 发明授权

US07822762B2 Entity-specific search model 有权
标题翻译：实体特定搜索模型
公开(公告)号：US07822762B2
公开(公告)日：2010-10-26
申请号：US11427311
申请日：2006-06-28
申请人： Christopher D. Payne , Eric J. Horvitz , Alexander G. Gounares , Susan T. Dumais , Kyle G. Peltonen , Gary W. Flake , Xuedong D. Huang , William H. Gates, III , John C. Platt , Oliver Hurst-Hiller , Joshua T. Goodman , Christopher A. Meek , Ramez Naam , Raymond E Ozzie , Eric D. Brill
发明人： Christopher D. Payne , Eric J. Horvitz , Alexander G. Gounares , Susan T. Dumais , Kyle G. Peltonen , Gary W. Flake , Xuedong D. Huang , William H. Gates, III , John C. Platt , Oliver Hurst-Hiller , Joshua T. Goodman , Christopher A. Meek , Ramez Naam , Raymond E Ozzie , Eric D. Brill
IPC分类号： G06F7/001
CPC分类号： G06F17/30967 , G06F17/30964
摘要： A system that employs an explicitly and/or implicitly trained model in order to return entity-specific computer-based search results is provided. The innovation can provide for a customized search model that focuses search in connection with achieving information that is meaningful with respect to goals of an entity. The model can be used to modify a search query in accordance with a goal of the entity or to generate the search query thereby returning meaningful and/or targeted results to the user. The system can automatically gather entity-related data thereafter determining or inferring a goal as well as training the model. Moreover, the system can selectively configure (e.g., order, rank, filter) and render results to a user based upon the model.
摘要翻译：提供了一种采用明确和/或隐含训练的模型以返回基于实体的基于计算机的搜索结果的系统。该创新可以提供定制的搜索模型，其将搜索重点与获得关于实体目标有意义的信息相关联。该模型可以用于根据实体的目标修改搜索查询，或者生成搜索查询，从而向用户返回有意义和/或有针对性的结果。系统可以自动收集与实体有关的数据，然后确定或推断目标以及训练模型。此外，系统可以基于模型选择性地配置（例如，排序，排序，过滤）并将结果呈现给用户。

68. 发明授权

US07689458B2 Systems and methods for determining bid value for content items to be placed on a rendered page 有权
标题翻译：确定要放置在呈现页面上的内容项目的出价值的系统和方法
公开(公告)号：US07689458B2
公开(公告)日：2010-03-30
申请号：US10977824
申请日：2004-10-29
申请人： David E. Heckerman , David M. Chickering , Christopher A. Meek , Brian Burdick , Li Li , Murali Vajjiravel , Ying Li , Rajeev Prasad , Raxit A. Kagalwala , Tarek Najm , Sachin Dhawan
发明人： David E. Heckerman , David M. Chickering , Christopher A. Meek , Brian Burdick , Li Li , Murali Vajjiravel , Ying Li , Rajeev Prasad , Raxit A. Kagalwala , Tarek Najm , Sachin Dhawan
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0241 , G06Q30/0247 , G06Q30/0256 , G06Q30/0601 , G06Q30/08 , G06Q40/04
摘要： Systems and methods for determining the value of bids placed by content providers for placement positions on a page, e.g., a web page, rendered according to a given context, for instance, the search results listing for a particular query initiated on a search engine web site, are provided. Additionally, systems and methods are provided for determining placement of content items, e.g., advertisements and/or images, on a rendered page relative to other content items on the page based upon bid value.
摘要翻译：用于确定由内容提供商针对在给定上下文呈现的页面（例如，网页）上的放置位置的出价的价值的系统和方法，例如在搜索引擎网络上发起的特定查询的搜索结果列表现场提供。此外，提供了系统和方法，用于基于出价值，在相对于页面上的其他内容项目的呈现页面上确定内容项目（例如广告和/或图像）的放置。

69. 发明授权

US07685296B2 Systems and methods for client-based web crawling 失效
标题翻译：用于基于客户端的网络爬网的系统和方法
公开(公告)号：US07685296B2
公开(公告)日：2010-03-23
申请号：US10670681
申请日：2003-09-25
申请人： Eric D. Brill , Christopher A. Meek
发明人： Eric D. Brill , Christopher A. Meek
IPC分类号： G06F17/00 , G06F9/00
CPC分类号： G06F17/30864
摘要： The present invention provides systems and methods for obtaining information from a networked system utilizing a distributed web crawler. The distributed nature of clients of a server is leveraged to provide fast and accurate web crawling data. Information gathered by a server's web crawler is compared to data retrieved by clients of the server to update the crawler's data. In one instance of the present invention, data comparison is achieved by utilizing information disseminated via a search engine results page. In another instance of the present invention, data validation is accomplished by client dictionaries, emanating from a server, that summarize web crawler data. The present invention also facilitates data analysis by providing a means to resist spoofing of a web crawler to increase data accuracy.
摘要翻译：本发明提供了利用分布式网络爬虫从网络系统获取信息的系统和方法。服务器的客户端的分布式性质被用来提供快速准确的网页爬网数据。将服务器的网页抓取工具收集的信息与服务器客户端检索的数据进行比较，以更新爬网程序的数据。在本发明的一个实例中，通过利用通过搜索引擎结果页面传播的信息来实现数据比较。在本发明的另一个实例中，数据验证是通过从服务器发出的客户词典来实现的，其总结了网络爬虫数据。本发明还通过提供抵抗网络爬虫的欺骗以提高数据准确性的手段来促进数据分析。

70. 发明授权

US07660705B1 Bayesian approach for learning regression decision graph models and regression models for time series analysis 有权
标题翻译：用于学习回归决策图模型的贝叶斯方法和时间序列分析的回归模型
公开(公告)号：US07660705B1
公开(公告)日：2010-02-09
申请号：US10102116
申请日：2002-03-19
申请人： Christopher A. Meek , David E. Heckerman , Robert L. Rounthwaite , David Maxwell Chickering , Bo Thiesson
发明人： Christopher A. Meek , David E. Heckerman , Robert L. Rounthwaite , David Maxwell Chickering , Bo Thiesson
IPC分类号： G06F17/10
CPC分类号： G06K9/6297
摘要： Methods and systems are disclosed for learning a regression decision graph model using a Bayesian model selection approach. In a disclosed aspect, the model structure and/or model parameters can be learned using a greedy search algorithm applied to grow the model so long as the model improves. This approach enables construction of a decision graph having a model structure that includes a plurality of leaves, at least one of which includes a non-trivial linear regression. The resulting model thus can be employed for forecasting, such as for time series data, which can include single or multi-step forecasting.
摘要翻译：公开了使用贝叶斯模型选择方法学习回归决策图模型的方法和系统。在公开的方面，只要模型改进，可以使用应用于增长模型的贪心搜索算法来学习模型结构和/或模型参数。该方法能够构建具有包括多个叶子的模型结构的决策图，其中至少一个包括非平凡的线性回归。因此，所得到的模型可以用于预测，例如用于时间序列数据，其可以包括单步或多步预测。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式