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

11. 发明申请

US20070255736A1 System and method using hierachical clustering for evolutionary clustering of sequential data sets 有权
标题翻译：使用层次聚类的序列数据集的进化聚类的系统和方法
公开(公告)号：US20070255736A1
公开(公告)日：2007-11-01
申请号：US11414442
申请日：2006-04-29
申请人： Deepayan Chakrabarti , Shanmugasundaram Ravikumar , Andrew Tomkins
发明人： Deepayan Chakrabarti , Shanmugasundaram Ravikumar , Andrew Tomkins
IPC分类号： G06F7/00
CPC分类号： G06F17/30705 , G06K9/6218
摘要： An improved system and method for evolutionary clustering of sequential data sets is provided. A snapshot cost may be determined for representing the data set for a particular clustering method used and may determine the cost of clustering the data set independently of a series of clusterings of the data sets in the sequence. A history cost may also be determined for measuring the distance between corresponding clusters of the data set and the previous data set in the sequence of data sets to determine a cost of clustering the data set as part of a series of clusterings of the data sets in the sequence. An overall cost may be determined for clustering the data set by minimizing the combination of the snapshot cost and the history cost. Any clustering method may be used, including flat clustering and hierarchical clustering.
摘要翻译：提供了一种用于顺序数据集进化聚类的改进的系统和方法。可以确定用于表示所使用的特定聚类方法的数据集的快照成本，并且可以独立于序列中的数据集的一系列聚类来确定数据集的聚类成本。还可以确定历史成本用于测量数据集的相应簇之间的距离和数据集序列中的先前数据集之间的距离，以确定数据集的聚类成本，作为数据集的一系列聚类的一部分序列。可以通过最小化快照成本和历史成本的组合来确定用于对数据集进行聚类的总体成本。可以使用任何聚类方法，包括平面聚类和层次聚类。

12. 发明授权

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.
摘要翻译：用于实现多步骤挑战和响应测试的系统和方法包括以下步骤或动作：使用输入/输出子系统向使用者呈现一系列挑战，要求所述用户在下一个挑战被揭露之前正确地解决每个挑战给用户; 接收用户对每个挑战的响应; 并将一系列挑战中的最后一个响应提交给服务器进行验证。该方法还包括：使用配置成针对一系列挑战中的每个挑战执行的处理器设备：通过将用户的响应与正确响应进行比较来内部验证响应; 并使用用户的响应，解密下一个挑战，揭示下一个挑战; 其中下一个挑战保持混淆，直到前一个挑战被正确地解决。

13. 发明申请

US20100228804A1 CONSTRUCTING IMAGE CAPTCHAS UTILIZING PRIVATE INFORMATION OF THE IMAGES 审中-公开
标题翻译：使用图像的私人信息构建图像CAPTCHAS
公开(公告)号：US20100228804A1
公开(公告)日：2010-09-09
申请号：US12397561
申请日：2009-03-04
申请人： Anirban Dasgupta , Shanmugasundaram Ravikumar , Kunal Punera
发明人： Anirban Dasgupta , Shanmugasundaram Ravikumar , Kunal Punera
IPC分类号： H04L9/32 , G06F17/30
CPC分类号： G06F16/951 , G06F21/36 , G06F2221/2103
摘要： An image CAPTCHA having one or more images, a challenge, and a correct answer to the challenge is constructed by selecting the one or more images from a plurality of candidate images based at least in part on each image's public information and private information. The private information of each of the images is accessible only to an entity responsible for constructing the CAPTCHA. Optionally, the one or more images are selected further based on the specific type of the CAPTCHA to be constructed.
摘要翻译：通过至少部分地基于每个图像的公共信息和私人信息，通过从多个候选图像中选择一个或多个图像来构建具有一个或多个图像，挑战和对挑战的正确答案的图像验证码。每个图像的私人信息只能由负责构建CAPTCHA的实体访问。可选地，基于要构建的CAPTCHA的具体类型进一步选择一个或多个图像。

14. 发明申请

US20090112865A1 HIERARCHICAL STRUCTURE ENTROPY MEASUREMENT METHODS AND SYSTEMS 审中-公开
标题翻译：分层结构熵测量方法和系统
公开(公告)号：US20090112865A1
公开(公告)日：2009-04-30
申请号：US11925355
申请日：2007-10-26
申请人： Erik N. Vee , Deepayan Chakrabarti , Anirban Dasgupta , Arpita Ghosh , Shanmugasundaram Ravikumar , Andrew Tomkins
发明人： Erik N. Vee , Deepayan Chakrabarti , Anirban Dasgupta , Arpita Ghosh , Shanmugasundaram Ravikumar , Andrew Tomkins
IPC分类号： G06F7/00
CPC分类号： G06F16/35
摘要： Methods and apparatuses are provided for accessing taxonomic data associated with an item as classified into a taxonomy having a hierarchical structure, establishing dependency data associated with a distribution represented in the taxonomic data, and determining entropic data for the item based, at least in part, on the distribution and established dependency.
摘要翻译：提供了用于访问与分类为具有分级结构的分类法的项目相关联的分类学数据的方法和装置，建立与分类数据中表示的分布相关联的依赖性数据，以及至少部分地基于所述分类数据确定所述项目的熵数据，关于分配和建立依赖。

15. 发明授权

US08930365B2 System and method for evolutionary clustering of sequential data sets 有权
标题翻译：顺序数据集进化聚类的系统和方法
公开(公告)号：US08930365B2
公开(公告)日：2015-01-06
申请号：US11414448
申请日：2006-04-29
申请人： Deepayan Chakrabarti , Shanmugasundaram Ravikumar , Andrew Tomkins
发明人： Deepayan Chakrabarti , Shanmugasundaram Ravikumar , Andrew Tomkins
IPC分类号： G06F7/00 , G06F17/30 , G06K9/62
CPC分类号： G06F17/30705 , G06K9/6218
摘要： An improved system and method for evolutionary clustering of sequential data sets is provided. A snapshot cost may be determined for representing the data set for a particular clustering method used and may determine the cost of clustering the data set independently of a series of clusterings of the data sets in the sequence. A history cost may also be determined for measuring the distance between corresponding clusters of the data set and the previous data set in the sequence of data sets to determine a cost of clustering the data set as part of a series of clusterings of the data sets in the sequence. An overall cost may be determined for clustering the data set by minimizing the combination of the snapshot cost and the history cost. Any clustering method may be used, including flat clustering and hierarchical clustering.
摘要翻译：提供了一种用于顺序数据集进化聚类的改进的系统和方法。可以确定用于表示所使用的特定聚类方法的数据集的快照成本，并且可以独立于序列中的数据集的一系列聚类来确定数据集的聚类成本。还可以确定历史成本用于测量数据集的相应簇之间的距离和数据集序列中的先前数据集之间的距离，以确定数据集的聚类成本，作为数据集的一系列聚类的一部分序列。可以通过最小化快照成本和历史成本的组合来确定用于对数据集进行聚类的总体成本。可以使用任何聚类方法，包括平面聚类和层次聚类。

16. 发明申请

US20070255684A1 System and method using flat clustering for evolutionary clustering of sequential data sets 审中-公开
标题翻译：使用平面聚类的序列数据集的进化聚类的系统和方法
公开(公告)号：US20070255684A1
公开(公告)日：2007-11-01
申请号：US11414460
申请日：2006-04-29
申请人： Deepayan Chakrabarti , Shanmugasundaram Ravikumar , Andrew Tomkins
发明人： Deepayan Chakrabarti , Shanmugasundaram Ravikumar , Andrew Tomkins
IPC分类号： G06F17/30
CPC分类号： G06K9/6218 , G06F16/355
摘要： An improved system and method for evolutionary clustering of sequential data sets is provided. A snapshot cost may be determined for representing the data set for a particular clustering method used and may determine the cost of clustering the data set independently of a series of clusterings of the data sets in the sequence. A history cost may also be determined for measuring the distance between corresponding clusters of the data set and the previous data set in the sequence of data sets to determine a cost of clustering the data set as part of a series of clusterings of the data sets in the sequence. An overall cost may be determined for clustering the data set by minimizing the combination of the snapshot cost and the history cost. Any clustering method may be used, including flat clustering and hierarchical clustering.
摘要翻译：提供了一种用于顺序数据集进化聚类的改进的系统和方法。可以确定用于表示所使用的特定聚类方法的数据集的快照成本，并且可以独立于序列中的数据集的一系列聚类来确定数据集的聚类成本。还可以确定历史成本用于测量数据集的相应簇之间的距离和数据集序列中的先前数据集之间的距离，以确定数据集的聚类成本，作为数据集的一系列聚类的一部分序列。可以通过最小化快照成本和历史成本的组合来确定用于对数据集进行聚类的总体成本。可以使用任何聚类方法，包括平面聚类和层次聚类。

17. 发明申请

US20070255737A1 System and method for evolutionary clustering of sequential data sets 有权
标题翻译：顺序数据集进化聚类的系统和方法
公开(公告)号：US20070255737A1
公开(公告)日：2007-11-01
申请号：US11414448
申请日：2006-04-29
申请人： Deepayan Chakrabarti , Shanmugasundaram Ravikumar , Andrew Tomkins
发明人： Deepayan Chakrabarti , Shanmugasundaram Ravikumar , Andrew Tomkins
IPC分类号： G06F7/00
CPC分类号： G06F17/30705 , G06K9/6218
摘要： An improved system and method for evolutionary clustering of sequential data sets is provided. A snapshot cost may be determined for representing the data set for a particular clustering method used and may determine the cost of clustering the data set independently of a series of clusterings of the data sets in the sequence. A history cost may also be determined for measuring the distance between corresponding clusters of the data set and the previous data set in the sequence of data sets to determine a cost of clustering the data set as part of a series of clusterings of the data sets in the sequence. An overall cost may be determined for clustering the data set by minimizing the combination of the snapshot cost and the history cost. Any clustering method may be used, including flat clustering and hierarchical clustering.
摘要翻译：提供了一种用于顺序数据集进化聚类的改进的系统和方法。可以确定用于表示所使用的特定聚类方法的数据集的快照成本，并且可以独立于序列中的数据集的一系列聚类来确定数据集的聚类成本。还可以确定历史成本用于测量数据集的相应簇之间的距离和数据集序列中的先前数据集之间的距离，以确定数据集的聚类成本，作为数据集的一系列聚类的一部分序列。可以通过最小化快照成本和历史成本的组合来确定用于对数据集进行聚类的总体成本。可以使用任何聚类方法，包括平面聚类和层次聚类。

18. 发明申请

US20100082607A1 SYSTEM AND METHOD FOR AGGREGATING A LIST OF TOP RANKED OBJECTS FROM RANKED COMBINATION ATTRIBUTE LISTS USING AN EARLY TERMINATION ALGORITHM 审中-公开
标题翻译：使用早期终止算法从排名合并属性列表中聚集顶级排名对象列表的系统和方法
公开(公告)号：US20100082607A1
公开(公告)日：2010-04-01
申请号：US12238401
申请日：2008-09-25
申请人： Kunal Punera , Shanmugasundaram Ravikumar , Torsten Suel , Serguei Vassilvitskii
发明人： Kunal Punera , Shanmugasundaram Ravikumar , Torsten Suel , Serguei Vassilvitskii
IPC分类号： G06F7/10 , G06F17/30
CPC分类号： G06F16/358 , G06F16/9535
摘要： An improved system and method for aggregating a list of top ranked objects from ranked combination lists using an early termination algorithm is provided. Ranked lists of individual object attributes may be aggregated into ranked lists of combination object attributes. The ranked lists of object attributes, including ranked lists of individual object attributes as well as ranked lists of combination object attributes, may be scanned in parallel. A fixed number of top scoring objects may be stored in a results list of top ranked objects. An upper bound of best possible aggregation scores of unseen object in the ranked lists of object attributes may be computed to incorporate the extra information given by the combination lists of attributes. If the upper bound computed is less than the score of top scoring objects in the results list, then the top scoring objects in the results list may be output.
摘要翻译：提供了一种改进的系统和方法，用于使用早期终止算法聚合来自排名组合列表的顶级对象的列表。单个对象属性的排名列表可以聚合成组合对象属性的排名列表。可以平行扫描对象属性的排名列表，包括单个对象属性的排名列表以及组合对象属性的排名列表。固定数量的顶级评分对象可以存储在排名最高的对象的结果列表中。可以计算排序的对象属性列表中未被看见的对象的最佳可能聚集分数的上限，以包含属性组合列表给出的额外信息。如果计算的上限小于结果列表中的最高评分对象的得分，则可以输出结果列表中的最高评分对象。

19. 发明申请

US20120084832A1 Time Managed Challenge-Response Test 有权
标题翻译：时间管理挑战 - 响应测试
公开(公告)号：US20120084832A1
公开(公告)日：2012-04-05
申请号：US12897615
申请日：2010-10-04
申请人： Kunal Punera , Shanmugasundaram Ravikumar , Anirban Dasgupta , Belle Tseng , Hung-Kuo (James) Chu
发明人： Kunal Punera , Shanmugasundaram Ravikumar , Anirban Dasgupta , Belle Tseng , Hung-Kuo (James) Chu
IPC分类号： H04L9/32 , G06T15/00 , G06F3/048
CPC分类号： H04L9/3271
摘要： A method of generating a time managed challenge-response test is presented. The method identifies a geometric shape having a volume and generates an entry object of the time managed challenge-response test. The entry object is overlaid onto the geometric shape, such that the entry object is distributed over a surface of the geometric shape, and a portion of the entry object is hidden at any point in time. The geometric shape is rotated, which reveals the portion of the entry object that is hidden. A display region on a display is identified for rendering the geometric shape and the geometric shape is presented in the display region of the display.
摘要翻译：提出了一种生成时间管理的挑战 - 响应测试的方法。该方法识别具有卷的几何形状并生成时间管理的挑战 - 响应测试的条目对象。入口对象覆盖在几何形状上，使得入口对象分布在几何形状的表面上，并且入口对象的一部分在任何时间点被隐藏。几何形状被旋转，这显示了隐藏的条目对象的部分。识别显示器上的显示区域以呈现几何形状，并且在显示器的显示区域中呈现几何形状。

20. 发明申请

US20110197268A1 CAPTCHAS THAT INCLUDE OVERLAPPED CHARACTERS, PROJECTIONS ON VIRTUAL 3D SURFACES, AND/OR VIRTUAL 3D OBJECTS 审中-公开
标题翻译：包括重叠字符，虚拟3D表面投影和/或虚拟3D对象的CAPTCHAS
公开(公告)号：US20110197268A1
公开(公告)日：2011-08-11
申请号：US12701347
申请日：2010-02-05
申请人： Shanmugasundaram Ravikumar , Anirban Dasgupta , Kunal Punera , Achint Oommen Thomas
发明人： Shanmugasundaram Ravikumar , Anirban Dasgupta , Kunal Punera , Achint Oommen Thomas
IPC分类号： H04L9/32
CPC分类号： H04L9/3271 , G06F21/31 , G06F2221/2133 , H04L2209/60
摘要： Techniques are described herein for generating CAPTCHAs that include overlapped characters, projections on virtual three-dimensional (3D) surfaces, and/or virtual 3D objects. A CAPTCHA is a type of challenge-response test that a content provider may present to users for authorizing the users to access content that the content provider hosts. For example, when a user attempts to access content, a CAPTCHA may be generated in accordance with one or more of the techniques described herein and provided to the user. The user may be asked to identify characters that overlap in the CAPTCHA, characters that are projected on a virtual 3D surface, and/or a designated virtual 3D object, so that the user may be authorized to access the content. The user may enter the characters and/or select the designated virtual 3D object that is identified in the CAPTCHA using an input device, such as a keyboard, touch screen, pointing device, etc.
摘要翻译：本文描述了用于生成包括重叠字符，虚拟三维（3D）表面上的投影和/或虚拟3D对象）的CAPTCHA的技术。 CAPTCHA是内容提供者可以向用户呈现以授权用户访问内容提供商承载的内容的一种挑战 - 响应测试。例如，当用户尝试访问内容时，可以根据本文描述的一种或多种技术生成CAPTCHA并提供给用户。可能要求用户识别CAPTCHA中重叠的字符，投影在虚拟3D表面上的字符和/或指定的虚拟3D对象，以便用户可以被授权访问内容。用户可以使用诸如键盘，触摸屏，指点设备等的输入设备输入字符和/或选择在人机验证中识别的指定虚拟3D对象。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式