会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • HYBRID TERM AND DOCUMENT-BASED INDEXING FOR SEARCH QUERY RESOLUTION
    • 用于搜索查询分析的混合基于文档和文档的索引
    • US20090254523A1
    • 2009-10-08
    • US12098376
    • 2008-04-04
    • Kevin LangSwee LimChoongsoon Chang
    • Kevin LangSwee LimChoongsoon Chang
    • G06F17/30G06F7/10
    • G06F16/951G06F16/316
    • Methods and apparatuses relate to hosting an inverted index for term-based document searching. According to disclosed aspects, each bank of a plurality of banks receives a plurality of Document IDentifiers (DocIDs) in the inverted index, and within each bank, posting lists for each term are determined large or small. DocIDs for large posting lists are distributed among computers in a bank while responsibility for producing DocIDs identifiers in a small posting list are distributed by term to one or fewer computers in the bank. During operation, each term of a query is distributed to each bank, and then for small terms, only those computers assigned responsibility for a given term need to search for responsive DocIDs. DocIDs can be redistributed among computers in a bank such that results are presented from the computers that would have produced those results in a cluster having a pure DocIDs distribution scheme.
    • 方法和装置涉及托管用于基于术语的文档搜索的反向索引。 根据公开的方面,多个银行的每个银行在反向索引中接收多个文档标识符(DocID),并且在每个银行内,确定每个期限的发布列表大小。 大型发布列表的DocID分布在银行中的计算机之间,而在小型发布列表中生成DocIDs标识符的责任按照期限分发到银行中的一个或多个计算机。 在操作期间,查询的每个术语被分发到每个银行,然后对于小的术语,只有分配给给定术语的计算机的那些计算机需要搜索响应的DocID。 可以在银行的计算机之间重新分发DocID,以便从具有纯DocID分发方案的集群中产生这些结果的计算机呈现结果。
    • 2. 发明申请
    • EFFICIENT AD SELECTION IN AD EXCHANGE WITH INTERMEDIARIES
    • 高效的广告选择与中间人交流
    • US20110238493A1
    • 2011-09-29
    • US12749151
    • 2010-03-29
    • Bhaskar GhoshKevin LangDongming JiangSwaroop JagadishJoaquin Arturo Delgado Rodriguez
    • Bhaskar GhoshKevin LangDongming JiangSwaroop JagadishJoaquin Arturo Delgado Rodriguez
    • G06Q30/00
    • G06Q30/0247G06Q30/02G06Q30/0269
    • A method is disclosed for optimizing ad selection in an exchange having intermediate ad-networks including: constructing an exchange graph having nodes representing publishers, advertisers, and intermediate ad-network entities, and including directed edges that represent bilateral business agreements connecting the nodes; receiving an opportunity for displaying an ad to a user that is associated with a publisher node and includes properties that are targetable by supply predicates, wherein a supply predicate is a function whose inputs include properties of the user; receiving ads that are available for display to the user associated with respective advertiser nodes and that include properties that are targetable by demand predicates, wherein a demand predicate is a function whose inputs include properties of one or more of the plurality of ads; computing a thinned graph by enforcing the supply predicates in the nodes and edges of the graph; and producing a list of ads and corresponding paths that exist through the thinned graph to the opportunity that satisfy the plurality of demand predicates.
    • 公开了一种用于在具有中间广告网络的交换机中优化广告选择的方法,包括:构建具有表示发布者,广告商和中间广告网络实体的节点的交换图,并且包括表示连接节点的双边业务协议的定向边; 接收向与发布者节点相关联的用户显示广告的机会,并且包括可由供应谓词定位的属性,其中供应谓词是其输入包括用户的属性的功能; 接收可以显示给与相应广告商节点相关联的用户的广告,并且包括可由需求谓词定位的属性,其中需求谓词是其输入包括所述多个广告中的一个或多个的属性的函数; 通过执行图形的节点和边缘中的供应谓词来计算稀疏图; 并且通过稀疏图形生成存在的广告列表和对应的路径,以满足多个需求谓词的机会。
    • 6. 发明申请
    • SYSTEM FOR HANDLING MULTIPLE PRIORITIES IN AD EXCHANGE AUCTION
    • 在交易所拍卖中处理多项优先权的制度
    • US20120005029A1
    • 2012-01-05
    • US12828474
    • 2010-07-01
    • Kevin LangArathi SeshanAmita GajewarDongming Jiang
    • Kevin LangArathi SeshanAmita GajewarDongming Jiang
    • G06Q30/00
    • G06Q30/0275
    • A method for handling priorities in an ad exchange auction includes: constructing an exchange graph including nodes representing publishers and advertisers and directed edges that represent bilateral business agreements connecting the nodes; receiving an opportunity for displaying an ad to a user from a publisher; receiving ads from which to choose to fill the opportunity, the ads including respective advertiser priorities (A) and bid amounts; receiving a publisher priority (P) the ads as assigned by the publisher; constructing a priority triple (P,A,M) for each of at least some of the plurality of ads, the triple including the publisher priority (P), the advertiser priority (A), and a money payable to the publisher (M); comparing the P, the A, and the M of respective priority triples for the ads according to at least one scoping rule and at least one precedence rule, to determine the ad with which to fill the opportunity; and delivering the ad determined to have the highest priority to a web page of the publisher.
    • 用于处理广告交易拍卖中的优先级的方法包括:构建包括表示发布者和广告商的节点的交换图和代表连接节点的双边业务协议的定向边; 从发布商接收向用户显示广告的机会; 接收从中选择填补机会的广告,广告包括各自的广告客户优先级(A)和出价金额; 接收发布商优先(P)发布商分配的广告; 为多个广告中的至少一些广告中的每一个构造优先级三重(P,A,M),包括发布者优先级(P),广告商优先级(A)和应付给发布者(M)的钱的三重 ; 根据至少一个范围规则和至少一个优先规则来比较广告的各个优先级三元组的P,A和M,以确定与其填充机会的广告; 并将确定具有最高优先级的广告投放到发布商的网页。
    • 9. 发明申请
    • LIMITING LATENCY DUE TO EXCESSIVE DEMAND IN AD EXCHANGE
    • 由于AD EXCHANGE中过度需求,限制了延期
    • US20110264516A1
    • 2011-10-27
    • US12767952
    • 2010-04-27
    • Kevin LangJoaquin Arturo Delgado RodriguezChavdar Botev
    • Kevin LangJoaquin Arturo Delgado RodriguezChavdar Botev
    • G06Q30/00
    • G06Q30/02G06Q30/0247G06Q30/0275G06Q30/0277
    • A method is disclosed for limiting latency in filling a display opportunity in an ad exchange including: constructing an exchange graph comprising nodes representing a plurality of publishers and advertisers, the exchange graph also including a plurality of directed edges that represent bilateral business agreements connecting the nodes; receiving an opportunity for displaying an ad to a user, wherein the opportunity is associated with a publisher node; receiving ads from the advertisers from which to choose to fill the opportunity; determining whether a threshold total number of ads (T) is surpassed by the received ads; and randomly downsampling the number of ads from each of at least some of the advertisers when the threshold total number of ads (T) is surpassed by the received ads to reduce the total number of ads to a target number of ads (S) that reduces overall latency in determining which of sampled ads will fill the opportunity.
    • 公开了一种用于限制填补广告交换中的显示机会的延迟的方法,包括:构建包括表示多个发布者和广告商的节点的交换图,交换图还包括代表连接节点的双边业务协议的多个定向边 ; 接收向用户显示广告的机会,其中所述机会与发布者节点相关联; 从广告商接收广告,从中选择填补机会; 确定所接收的广告是否超过阈值总数(T); 并且当所接收到的广告超过所述阈值总广告数(T)以将广告总数减少到减少的目标广告数量(S)时,随机地对至少一些广告商中的每一个的广告数量进行抽样。 确定哪些采样广告将填补机会的总延迟。