会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 82. 发明申请
    • System and method for measuring awareness of online advertising using captchas
    • 使用验证码测量在线广告意识的系统和方法
    • US20080133321A1
    • 2008-06-05
    • US11607579
    • 2006-12-01
    • David M. PennockShanmugasundaram RavikumarAndrew Tomkins
    • David M. PennockShanmugasundaram RavikumarAndrew Tomkins
    • G06Q30/00
    • G06Q30/02G06Q30/0242G06Q30/0256
    • An improved system and method for providing and using captchas for online advertising is provided. An advertisement may be received, embedded in a captcha and stored for use in online advertising. A question about the advertisement may also be stored along with a valid answer for use in verifying a user has received an impression of the advertisement. In response to a request received for sending a captcha with an embedded advertisement to a web browser operating on a client, a captcha with an embedded advertisement may be selected and sent to the web browser for display as part of a web page. Upon verifying the response to the question from the user is a valid answer, receipt of an impression of the advertisement may be recorded. Additionally, the awareness of an online advertisement may be measured for a target audience and reported to advertisers.
    • 提供了一种用于提供和使用用于在线广告的验证码的改进的系统和方法。 可以接收广告,嵌入在验证码中并存储以用于在线广告。 关于广告的问题也可以与用于验证用户已经接收到广告的印象的有效答案一起存储。 响应于向用户发送嵌入式广告的验证码的请求,可以选择具有嵌入式广告的验证码并发送到网络浏览器以作为网页的一部分进行显示。 在验证来自用户对问题的响应是有效答案时,可以记录广告的印象的接收。 此外,可以针对目标受众衡量在线广告的意识并向广告商报告。
    • 85. 发明申请
    • User-sensitive pagerank
    • 用户敏感的寻呼机
    • US20080010281A1
    • 2008-01-10
    • US11474195
    • 2006-06-22
    • Pavel BerkhinUsama M. FayyadPrabhakar RaghavanAndrew Tomkins
    • Pavel BerkhinUsama M. FayyadPrabhakar RaghavanAndrew Tomkins
    • G06F17/30
    • G06F17/30864Y10S707/99935Y10S707/99936
    • Techniques are described for generating an authority value of a first one of a plurality of documents. A first component of the authority value is generated with reference to outbound links associated with the first document. The outbound links enable access to a first subset of the plurality of documents. A second component of the authority value is generated with reference to a second subset of the plurality of documents. Each of the second subset of documents represents a potential starting point for a user session. A third component of the authority value is generated representing a likelihood that a user session initiated by any of a population of users will end with the first document. The first, second, and third components of the authority value are combined to generate the authority value. At least one of the first, second, and third components of the authority value is computed with reference to user data relating to at least some of the outbound links and the second subset of documents.
    • 描述了用于生成多个文档中的第一个的授权值的技术。 参考与第一个文档相关联的出站链接生成权限值的第一个组件。 出站链接使得能够访问多个文档的第一子集。 参考多个文档的第二子集来生成权限值的第二个组件。 文档的第二子集中的每一个代表用户会话的潜在起始点。 生成授权值的第三个组成部分,表示任何用户群体启动的用户会话将以第一个文档结束的可能性。 组合权限值的第一,第二和第三组件以生成权限值。 参考与至少一些出站链接和第二文档子集相关的用户数据来计算授权值的第一,第二和第三组件中的至少一个。
    • 87. 发明申请
    • System and method for selecting object metadata evolving over time
    • 随着时间的推移,用于选择对象元数据的系统和方法
    • US20070271270A1
    • 2007-11-22
    • US11437425
    • 2006-05-19
    • Micah Joel DubinkoShanmugasundaram RavikumarJoseph Andrew MagnaniJasmine NovakPrabhakar RaghavanAndrew Tomkins
    • Micah Joel DubinkoShanmugasundaram RavikumarJoseph Andrew MagnaniJasmine NovakPrabhakar RaghavanAndrew Tomkins
    • G06F7/00
    • G06F17/30864
    • An improved system and method for selecting and visualizing object metadata evolving over time is provided. An application may generate a visualization depicting the temporal evolution of metadata describing objects in an object store over a plurality of time intervals. The application may switch between a visualization of object metadata flowing like a river or cascading like a waterfall over time. A ranked list of metadata items may be determined for some pre-selected intervals during a pre-processing step. Then at runtime when a request may be received for providing a ranked list of metadata items for a query interval, a combination of time intervals from the pre-selected time intervals may be determined that cover the query time interval, and the ranked lists of metadata items for each time interval in the combination of time intervals that cover the query time interval may be aggregated and output for visualization.
    • 提供了一种改进的系统和方法,用于随着时间的推移来选择和可视化对象元数据。 应用可以生成描绘在多个时间间隔中描述对象存储中的对象的元数据的时间演变的可视化。 应用程序可以在像河流一样流动的对象元数据的可视化或瀑布之间随着时间的流逝而进行切换。 可以在预处理步骤期间为某些预选间隔确定元数据项目的排名列表。 然后在运行时,当可以接收到用于为查询间隔提供元数据项的排序列表的请求时,可以确定来自预先选择的时间间隔的时间间隔的组合,其覆盖查询时间间隔,并且排列的元数据列表 涵盖查询时间间隔的时间间隔组合的每个时间间隔的项目可以被聚合并输出以用于可视化。
    • 88. 发明申请
    • Microhubs and its applications
    • Microhubs及其应用
    • US20070078811A1
    • 2007-04-05
    • US11241469
    • 2005-09-30
    • Srinivasan BalasubramanianMichael ChingPiyoosh JalanSatish PenmetsaAndrew Tomkins
    • Srinivasan BalasubramanianMichael ChingPiyoosh JalanSatish PenmetsaAndrew Tomkins
    • G06F17/30
    • G06F17/30864Y10S707/99932Y10S707/99937
    • A system and method of crawling at least one website comprising at least one URL includes maintaining a lookup structure comprising all of the URLs known to be on a website; calculating a hub score for each webpage of the website to be recrawled, wherein the hub score measures how likely the to be recrawled webpage includes links to fresh content published on the website; sorting all the to be recrawled pages by their hub scores; and crawling the to be recrawled pages in order from highest hub scores to lowest hub scores. The calculating comprises computing a first value equaling a percentage of a number of new relative URLs on the to be recrawled page; computing a second value equaling a percentage of a previous hub score of the to be recrawled page; and computing the hub score as a sum of the first and the second values.
    • 一种爬行包括至少一个URL的至少一个网站的系统和方法包括维护包括已知在网站上的所有URL的查找结构; 计算要重新抓取的网站的每个网页的中心评分,其中中心评分测量重新获取的网页的可能性包括链接到在网站上发布的新鲜内容; 通过他们的中心分数排序所有要重新抓取的页面; 并从最高中心分数到最低中心分数的顺序爬行重新抓取的页面。 计算包括计算等于要重新获取的页面上的多个新的相对URL的百分比的第一值; 计算等于要重新抓取的页面的先前中心点的百分比的第二值; 以及将所述中心分数计算为所述第一和第二值的总和。