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

1. 发明授权

US08522327B2 Multi-step captcha with serial time-consuming decryption of puzzles 有权
标题翻译：多步验证码具有串行耗时的解谜难题
公开(公告)号：US08522327B2
公开(公告)日：2013-08-27
申请号：US13206583
申请日：2011-08-10
申请人： Andrei Broder , Anirban Dasgupta , Shanmugasundaram Ravikumar , Kunal Punera
发明人： Andrei Broder , Anirban Dasgupta , Shanmugasundaram Ravikumar , Kunal Punera
IPC分类号： H04L29/06
CPC分类号： G06F21/31 , G06F21/36 , G06F2221/2107 , G06F2221/2133 , H04L9/3271
摘要： A system and method for implementing a multi-step challenge and response test includes steps or acts of: using an input/output subsystem for presenting a series of challenges to a user that require said user to correctly solve each challenge before a next challenge is revealed to the user; receiving the user's response to each challenge; and submitting a last response in the series of challenges to a server for validation. The method further includes: using a processor device configured to perform for each challenge in the series of challenges: internally validating the response by comparing the user's response to a correct response; and using the user's response, decrypting the next challenge to reveal the next challenge; wherein the next challenge remains obfuscated until a previous challenge is correctly solved.
摘要翻译：用于实现多步骤挑战和响应测试的系统和方法包括以下步骤或动作：使用输入/输出子系统向使用者呈现一系列挑战，要求所述用户在下一个挑战被揭露之前正确地解决每个挑战给用户; 接收用户对每个挑战的响应; 并将一系列挑战中的最后一个响应提交给服务器进行验证。该方法还包括：使用配置成针对一系列挑战中的每个挑战执行的处理器设备：通过将用户的响应与正确响应进行比较来内部验证响应; 并使用用户的响应，解密下一个挑战，揭示下一个挑战; 其中下一个挑战保持混淆，直到前一个挑战被正确地解决。

2. 发明申请

US20100205213A1 NON-EXACT CACHE MATCHING 审中-公开
标题翻译：非精确缓存匹配
公开(公告)号：US20100205213A1
公开(公告)日：2010-08-12
申请号：US12370306
申请日：2009-02-12
申请人： Andrei Broder , Vanja Josifovski , Shanmugasundaram Ravikumar , Sandeep Pandey , Serguei Vassilvitskii , Flavio Chierichetti
发明人： Andrei Broder , Vanja Josifovski , Shanmugasundaram Ravikumar , Sandeep Pandey , Serguei Vassilvitskii , Flavio Chierichetti
IPC分类号： G06F17/30 , G06F12/08
CPC分类号： G06Q30/0251 , G06F16/24539 , G06Q10/06
摘要： The subject matter disclosed herein relates to returning cached object results based at least in part on a non-exact comparison with a query key.
摘要翻译：本文公开的主题涉及至少部分地基于与查询密钥的非精确比较来返回缓存的对象结果。

3. 发明申请

US20130042311A1 MULTI-STEP CAPTCHA WITH SERIAL TIME-CONSUMING DECRYPTION OF PUZZLES 有权
标题翻译：多步骤人机界面，采用串行时间消耗方式进行解码
公开(公告)号：US20130042311A1
公开(公告)日：2013-02-14
申请号：US13206583
申请日：2011-08-10
申请人： Andrei Broder , Anirbran Dasgupta , Shanmugasundaram Ravikumar , Kunal Punera
发明人： Andrei Broder , Anirbran Dasgupta , Shanmugasundaram Ravikumar , Kunal Punera
IPC分类号： G06F7/04 , H04L9/32 , G06F21/00
CPC分类号： G06F21/31 , G06F21/36 , G06F2221/2107 , G06F2221/2133 , H04L9/3271
摘要： A system and method for implementing a multi-step challenge and response test includes steps or acts of: using an input/output subsystem for presenting a series of challenges to a user that require said user to correctly solve each challenge before a next challenge is revealed to the user; receiving the user's response to each challenge; and submitting a last response in the series of challenges to a server for validation. The method further includes: using a processor device configured to perform for each challenge in the series of challenges: internally validating the response by comparing the user's response to a correct response; and using the user's response, decrypting the next challenge to reveal the next challenge; wherein the next challenge remains obfuscated until a previous challenge is correctly solved.
摘要翻译：用于实现多步骤挑战和响应测试的系统和方法包括以下步骤或动作：使用输入/输出子系统向使用者呈现一系列挑战，要求所述用户在下一个挑战被揭露之前正确地解决每个挑战给用户; 接收用户对每个挑战的响应; 并将一系列挑战中的最后一个响应提交给服务器进行验证。该方法还包括：使用配置成针对一系列挑战中的每个挑战执行的处理器设备：通过将用户的响应与正确响应进行比较来内部验证响应; 并使用用户的响应，解密下一个挑战，揭示下一个挑战; 其中下一个挑战保持混淆，直到前一个挑战被正确地解决。

4. 发明申请

US20100077210A1 CAPTCHA IMAGE GENERATION 审中-公开
标题翻译：人机识别图像生成
公开(公告)号：US20100077210A1
公开(公告)日：2010-03-25
申请号：US12236920
申请日：2008-09-24
申请人： Andrei Broder , Shanmugasundaram Ravikumar
发明人： Andrei Broder , Shanmugasundaram Ravikumar
IPC分类号： H04L9/00 , G06F15/173 , G06K9/00
CPC分类号： G06K9/6255 , G06F21/46 , G06K2209/01
摘要： Methods and systems are described for generating captchas and enlarging a core of available captchas that are hard for an automated or robotic user to crack.
摘要翻译：描述了用于生成验证码并扩大可自动或机器人用户难以破解的可用验证码核心的方法和系统。

5. 发明申请

US20120173533A1 MINING GLOBAL EMAIL FOLDERS FOR IDENTIFYING AUTO-FOLDER TAGS 有权
标题翻译：采矿全球电子邮件文件夹，用于识别自动文件夹标签
公开(公告)号：US20120173533A1
公开(公告)日：2012-07-05
申请号：US12984539
申请日：2011-01-04
申请人： Vishwanath Tumkur Ramarao , Andrei Broder , Idan Szpektor , Edo Liberty , Yehuda Koren , Mark E. Risher , Yoelle Maarek Smadja
发明人： Vishwanath Tumkur Ramarao , Andrei Broder , Idan Szpektor , Edo Liberty , Yehuda Koren , Mark E. Risher , Yoelle Maarek Smadja
IPC分类号： G06F17/30
CPC分类号： G06Q10/00
摘要： Embodiments are directed towards identifying auto-folder tags for messages by using a combinational optimization approach of bi-clustering folder names and features of messages based on relationship strengths. The combinational optimization approach of bi-clustering, generally, groups a plurality of folder names and a plurality of features into one or more metafolders to optimize a cost. The cost is based on an aggregate of cut relationship strengths, where a cut results when a relationship folder name and feature are grouped in separate metafolders. Furthermore, the plurality of folder names and the plurality of features are obtained by monitoring actions of a plurality of users, where the folder names are user generated folder names and features are from a plurality of messages. The metafolders may be used to tag new user messages with an auto-folder tag.
摘要翻译：实施例旨在通过使用基于关系强度的消息的双重聚类文件夹名称和特征的组合优化方法来识别消息的自动文件夹标签。双组合的组合优化方法通常将多个文件夹名称和多个特征分组到一个或多个元文件夹中以优化成本。成本基于剪切关系强度的总和，当关系文件夹名称和要素分组在单独的元文件夹中时，会产生裁剪。此外，通过监视多个用户的动作来获得多个文件夹名称和多个特征，其中文件夹名称是用户生成的文件夹名称和特征来自多个消息。元文件夹可用于使用自动文件夹标签来标记新的用户消息。

6. 发明申请

US20120166291A1 BID GENERATION FOR SPONSORED SEARCH 审中-公开
标题翻译：赞助搜索的生成
公开(公告)号：US20120166291A1
公开(公告)日：2012-06-28
申请号：US12977313
申请日：2010-12-23
申请人： Andrei Broder , Evgeniy Gabrilovich , Vanja Josifovski , George Mavromatis , Benjamin Rey
发明人： Andrei Broder , Evgeniy Gabrilovich , Vanja Josifovski , George Mavromatis , Benjamin Rey
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0256 , G06Q30/0273 , G06Q30/0275
摘要： A system and method of generating bid values for sponsored search includes steps or acts of: receiving a bid phrase for an advertisement for an item, wherein the bid phrase specifies a search query for which the advertisement should be displayed; receiving first information at a first input/output interface, the first information related to a bidding behavior of the advertiser; receiving second information at a second input/output interface, the second information relating to a history of bids by other advertisers for the bid phrase; and generating a bid value for the bid phrase submitted for the advertisement for the search query, based on the information received.
摘要翻译：生成赞助搜索的投标价值的系统和方法包括以下步骤或动作：接收用于项目的广告的投标短语，其中所述投标短语指定应显示该广告的搜索查询; 在第一输入/输出界面处接收第一信息，所述第一信息与所述广告主的投标行为相关; 在第二输入/输出界面处接收第二信息，所述第二信息涉及其他广告商针对所述投标短语的出价历史; 以及基于所接收的信息，为针对搜索查询的广告提交的投标短语生成出价值。

7. 发明申请

US20080097988A1 Methods and Apparatus for Assessing Web Page Decay 有权
公开(公告)号：US20080097988A1
公开(公告)日：2008-04-24
申请号：US11955458
申请日：2007-12-13
申请人： Andrei Broder , Ziv Bar-Yossef , Shanmagasundaram Ravikumar , Andrew Tomkins
发明人： Andrei Broder , Ziv Bar-Yossef , Shanmagasundaram Ravikumar , Andrew Tomkins
IPC分类号： G06F17/30
CPC分类号： G06F17/3089
摘要： Systems and methods are herein disclosed for assessing the staleness of a web page. In particular, in one method of the present invention, the staleness of a web page is assessed by examining internal date references within the web page. In another method of the present invention, the staleness of a web page is assessed by examining the meta-data associated with the web page. In a further method of the present invention, the staleness of a hyperlinked web page is determined by examining the link status of the hyperlinks. If the web page has a relatively large number of dead links, it is assessed as being a stale web page. In a still further method of the present invention, the link status of web pages in the neighborhood of the web page being assessed is likewise examined.

8. 发明申请

US20050165757A1 Method and apparatus for ranking web page search results 审中-公开
标题翻译：网页搜索结果排名的方法和装置
公开(公告)号：US20050165757A1
公开(公告)日：2005-07-28
申请号：US10974483
申请日：2004-10-27
申请人： Andrei Broder
发明人： Andrei Broder
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F16/951 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99937 , Y10S707/99942
摘要： A method and apparatus for ranking a plurality of pages identified during a search of a linked database includes forming a linear combination of two or more matrices, and using the coefficients of the eigenvector of the resulting matrix to rank the quality of the pages. The matrices includes information about the pages and are generally normalized, stochastic matrices. The linear combination can include attractor matrices that indicate desirable or “high quality” sites, and/or non-attractor matrices that indicate sites that are undesirable. Attractor matrices and non-attractor matrices can be used alone or in combination with each other in the linear combination. Additional bias toward high quality sites, or away from undesirable sites, can be further introduced with probability weighting matrices for attractor and non-attractor matrices. Other known matrices, such as a co-citation matrix or a bibliographic coupling matrix, can also be used in the present invention.
摘要翻译：用于对在链接数据库的搜索期间识别的多个页面进行排序的方法和装置包括形成两个或更多个矩阵的线性组合，并且使用所得矩阵的特征向量的系数来对页面的质量进行排序。矩阵包括关于页面的信息，并且通常是归一化的随机矩阵。线性组合可以包括指示期望或“高质量”位点的吸引子矩阵，和/或指示不期望的位点的非吸引子矩阵。吸引子矩阵和非吸引子矩阵可以单独使用或者以线性组合彼此组合使用。可以通过吸引子和非吸引子矩阵的概率加权矩阵进一步引入对高质量位点或远离不期望位点的附加偏差。其它已知的基质，例如共引用基团或书目耦合基质，也可用于本发明。

9. 发明申请

US20110208559A1 Automatic Management of Networked Publisher-Subscriber Relationships 审中-公开
标题翻译：网络发布者 - 用户关系的自动管理
公开(公告)号：US20110208559A1
公开(公告)日：2011-08-25
申请号：US12711873
申请日：2010-02-24
申请人： Marcus Fontoura , Sergei Vassilvitskii , Jayavel Shanmugasundaram , Andrei Broder , Shirshanka Das , Bhaskar Ghosh , Vanja Josifovski
发明人： Marcus Fontoura , Sergei Vassilvitskii , Jayavel Shanmugasundaram , Andrei Broder , Shirshanka Das , Bhaskar Ghosh , Vanja Josifovski
IPC分类号： G06Q10/00 , G06Q50/00 , G06T11/20
CPC分类号： G06Q30/02 , G06Q10/06316 , G06Q30/0201 , G06T11/206
摘要： Automatic management of networked publisher-subscriber relationships in an advertising server network. The method comprises steps for constructing a directed graph representation comprising at least one publisher node (e.g. an Internet property), at least one subscriber node (e.g. an Internet advertiser), at least one intermediary node (e.g. an Internet advertising agent), and at least one edge (e.g. an advertising target predicate) wherein any one of the edges is directly associated with at least one target predicate. The directed graph representation is used in conjunction with an inverted index for retrieving a valid node list comprising only nodes having at least one target predicate that matches at least one event predicate. The event predicate (as well as any target predicate) is any arbitrarily complex Boolean expression, and is used in producing a result node list comprising only nodes that concurrently match the event predicate with an advertising target predicate and are reachable.
摘要翻译：在广告服务器网络中自动管理网络发布者 - 订户关系。该方法包括用于构建包括至少一个发布者节点（例如，因特网属性），至少一个订户节点（例如，因特网广告商），至少一个中间节点（例如，因特网广告代理）以及在至少一个边缘（例如，广告目标谓词），其中边缘中的任何一个与至少一个目标谓词直接相关联。有向图表示与用于检索仅包括至少一个与至少一个事件谓词匹配的目标谓词的节点的有效节点列表结合使用。事件谓词（以及任何目标谓词）是任意复杂的布尔表达式，并且用于生成结果节点列表，其中仅包含与广告目标谓词并发匹配事件谓词并且可访问的节点。

10. 发明申请

US20090282016A1 Systems and Methods for Building a Prediction Model to Predict a Degree of Relevance Between Digital Ads and a Search Query or Webpage Content 审中-公开
标题翻译：用于构建预测模型以预测数字广告与搜索查询或网页内容之间的相关程度的系统和方法
公开(公告)号：US20090282016A1
公开(公告)日：2009-11-12
申请号：US12116747
申请日：2008-05-07
申请人： Evgeniy Gabrilovich , Vassilis Plachouras , Andrei Broder , Vanessa Murdock , Donald Metzler , Vanja Josifovski , Massimiliano Ciaramita , Marcus Fontoura
发明人： Evgeniy Gabrilovich , Vassilis Plachouras , Andrei Broder , Vanessa Murdock , Donald Metzler , Vanja Josifovski , Massimiliano Ciaramita , Marcus Fontoura
IPC分类号： G06F17/30
CPC分类号： G06Q30/02 , G06F16/951 , G06Q10/04
摘要： Systems and methods for building a prediction model to predict a degree of relevance between digital ads and a search query or webpage content are disclosed. Generally, an indication of relevance is received between a plurality of digital ads and one of a webpage content or a search query. A set of features is extracted from the plurality of digital ads and one of the webpage content or the search query. A prediction model is then built to predict a degree of relevance between the set of candidate digital ads and one of a second webpage content or a second search query, where the prediction model is built based at least one the received indication of relevance and the extracted set of features.
摘要翻译：公开了用于构建预测模型以预测数字广告与搜索查询或网页内容之间的相关程度的系统和方法。通常，在多个数字广告和网页内容之一或搜索查询之间接收到相关性的指示。从多个数字广告和网页内容或搜索查询之一提取一组特征。然后构建预测模型以预测候选数字广告集合与第二网页内容或第二搜索查询之一之间的相关程度，其中基于所接收到的相关性指示中的至少一个构建预测模型，并且提取一套功能。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式