Optimizing Sponsored Search Ad Placement for Online Advertising
    1.
    发明申请
    Optimizing Sponsored Search Ad Placement for Online Advertising 审中-公开
    优化在线广告的赞助搜索广告刊登位置

    公开(公告)号:US20110238486A1

    公开(公告)日:2011-09-29

    申请号:US12749372

    申请日:2010-03-29

    IPC分类号: G06Q30/00 G06Q10/00

    摘要: A method and a system are provided for optimizing sponsored search ad placement for online advertising. In one example, the system obtains advertiser bid amount information. The system obtains advertiser bid amount information. The bid amount information allows determination of amounts that advertisers will pay per user click on ads served in association with advertiser bids. The advertiser bid amounts are associated with advertising campaigns. The system obtains click-through-rate information associated with at least some of the ads. The system obtains budget information associated with the advertising campaign. The budget information specifies a maximum advertiser spending over a period of time in association with at least a portion of the advertising campaign. The system ranks a set of ads to be served based on the bid amount information, the click-through-rate information, and/or the budget information. The system optimizes ad placement of the set of ads by eliminating one or more keywords. The system then facilitates serving of the set of ads in accordance with at least one of the ranking of the set of ads and the optimizing of the ad placement.

    摘要翻译: 提供了一种方法和系统,用于优化在线广告的赞助搜索广告展示位置。 在一个示例中,系统获得广告商投标金额信息。 系统获取广告客户投标金额信息。 投标金额信息允许确定广告客户将按照广告客户出价关联广告投放的广告点击付费的金额。 广告客户出价金额与广告系列相关联。 该系统获得与至少一些广告相关联的点击率信息。 该系统获得与广告活动相关联的预算信息。 预算信息指定与至少一部分广告活动相关联的一段时间内的广告客户支出的最大值。 系统根据出价金额信息,点击率信息和/或预算信息对一组要投放的广告进行排序。 该系统通过删除一个或多个关键字来优化该组广告的广告展示位置。 该系统然后根据该组广告的排名和广告展示位置的优化中的至少一个来促进该组广告的投放。

    Optimizing Delivery of Online Advertisements
    2.
    发明申请
    Optimizing Delivery of Online Advertisements 审中-公开
    优化在线广告交付

    公开(公告)号:US20100217668A1

    公开(公告)日:2010-08-26

    申请号:US12393942

    申请日:2009-02-26

    IPC分类号: G06Q30/00 G06Q10/00 G06Q90/00

    摘要: Disclosed are methods and apparatus for delivering online advertisements. For one of a plurality of users, a probability is obtained for each of a plurality of ads that the one of the plurality of users will click on the one of the plurality of ads. In addition, a lower bound is obtained for each of the plurality of ads. For each of the plurality of ads, a delta between the probability that the one of the plurality of users will click on the one of the plurality of ads and the lower bound for the one of the plurality of ads is determined. One of the plurality of ads to provide to the one of the plurality of users is selected based at least in part on the delta for each of the plurality of ads.

    摘要翻译: 公开了用于传送在线广告的方法和装置。 对于多个用户中的一个,对于多个用户中的一个用户将点击多个广告中的一个广告的每个广告获得概率。 此外,为多个广告中的每一个获得下限。 对于多个广告中的每一个,确定多个用户中的一个将点击多个广告中的一个广告的几率与该多个广告中的一个广告的下限之间的差值。 至少部分地基于多个广告中的每一个的增量来选择要提供给多个用户之一的多个广告之一。

    BUDGET-INFLUENCED RANKING AND PRICING IN SPONSORED SEARCH
    3.
    发明申请
    BUDGET-INFLUENCED RANKING AND PRICING IN SPONSORED SEARCH 审中-公开
    预算影响的排名和定价在赞助的搜索

    公开(公告)号:US20110055003A1

    公开(公告)日:2011-03-03

    申请号:US12550904

    申请日:2009-08-31

    IPC分类号: G06Q30/00

    CPC分类号: G06Q30/02 G06Q30/0246

    摘要: Methods and systems are provided for ranking of sponsored search advertisements, and for auction pricing, based on revenue factors in addition to bid amounts and click through rates including budgets associated with advertising accounts, campaigns and portions thereof. Methods are provided in which linear programming or other techniques are used to optimize the search engine revenue, and the optimized solutions are used in ranking sponsored search advertisements based on factors including an advertiser bid amount associated with the advertisement, a historical, estimated or predicted click through rate associated with the advertisement, and a budget over a period of time, such as a daily budget, the budget including spend associated with the advertisement. Instead of one fixed position, the new ranking is a service distribution on multiple positions.

    摘要翻译: 提供方法和系统用于对赞助的搜索广告的排名以及针对拍卖定价,除基于收入因素以外的投标金额和点击率,包括与广告账户,活动及其部分相关联的预算。 提供了使用线性规划或其他技术来优化搜索引擎收入的方法,并且优化的解决方案用于基于包括与广告相关联的广告商投标金额,历史,估计或预测的点击的因素来排名赞助搜索广告 通过与广告相关联的费率,以及一段时间内的预算,例如每日预算,包括与广告相关联的支出的预算。 而不是一个固定的位置,新的排名是多个职位的服务分配。

    Finding Similar Campaigns for Internet Advertisement Targeting
    4.
    发明申请
    Finding Similar Campaigns for Internet Advertisement Targeting 审中-公开
    为互联网广告定位寻找类似的广告系列

    公开(公告)号:US20100257022A1

    公开(公告)日:2010-10-07

    申请号:US12419923

    申请日:2009-04-07

    IPC分类号: G06Q30/00 G06F17/30 G06F17/27

    摘要: Disclosed are methods and apparatus for analyzing campaigns in order to identify similar campaigns are disclosed. In one embodiment, an ad campaign associated with an advertiser is identified. Ad campaign information associated with ad campaigns previously booked by an online publisher is analyzed to identify one or more of the ad campaigns previously booked by the online publisher that are similar to the ad campaign. The ad campaign information for each of the ad campaigns identifies one or more products of the online publisher. The ad campaign information may be processed by applying natural language processing (NLP) to at least a portion of the ad campaign information associated with the ad campaigns previously booked by the online publisher. At least one of the products of the online publisher to recommend to the advertiser are ascertained from the ad campaign information for the one or more ad campaigns previously booked by the online publisher that are similar to the ad campaign.

    摘要翻译: 公开了为了识别类似的活动而分析运动的方法和装置。 在一个实施例中,识别与广告商相关联的广告活动。 与在线发布商先前预订的广告系列相关联的广告系列信息进行分析,以确定以前在线发布商预订的与广告系列相似的一个或多个广告系列。 每个广告系列的广告系列信息都标识了在线发布商的一个或多个产品。 可以通过将自然语言处理(NLP)应用于与在线发行商预先预定的广告活动相关联的至少一部分广告活动信息来处理广告活动信息。 根据与在线发布商预订的一个或多个类似于广告系列的一个或多个广告系列的广告系列信息,确定向广告客户推荐的至少一个在线发布商的产品。

    Method based on the combination of the UPnP and STUN for NAT traversal
    5.
    发明授权
    Method based on the combination of the UPnP and STUN for NAT traversal 有权
    基于UPnP和STUN组合的NAT穿越方法

    公开(公告)号:US08560607B2

    公开(公告)日:2013-10-15

    申请号:US12937337

    申请日:2009-05-03

    IPC分类号: G06F15/16 G06F15/177

    摘要: The present invention relates to a method based on the combination of UPnP and STUN for NAT traversal. The method of the present invention effectively takes the advantages of UPnP and STUN. In particularly, when UpnP fails to traverse NAT, STUN is applied to perform the NAT traversal for the second time, so that the efficiency of the successful traversal is effectively improved. For the symmetric NAT traversal, a Port-Adding Sample Estimation method based on NAT adding port mapping is provided for port estimation, to avoid the defects resulted from the third-party agent and the blindness of the speculation approach. And, where both of the communication peers in the P2P streaming media system are behind NAT, the method that the part of the ordinary outer peers with the sufficient bandwidth acts as the Auxiliary-Relay peers is provided to release the pressure of the relay server so that the bottle-neck of the communication is broken through.

    摘要翻译: 本发明涉及一种基于UPnP和STUN组合的NAT穿越方法。 本发明的方法有效地利用了UPnP和STUN的优点。 特别地,当UpnP无法遍历NAT时,应用STUN第二次执行NAT穿越,从而有效提高成功遍历的效率。 对于对称NAT穿越,提供了基于NAT添加端口映射的端口添加样本估计方法,用于端口估计,以避免第三方代理造成的缺陷和投机方法的盲目性。 而且,P2P流媒体系统中的两个通信对等体都在NAT之后,提供具有足够带宽的普通外部对等体部分作为辅助中继对等体的方法,以释放中继服务器的压力 沟通的瓶颈被打破了。

    SYSTEM AND METHOD FOR EFFICIENTLY PERFORMING MEMORY INTENSIVE COMPUTATIONS INCLUDING A BIDIRECTIONAL SYNCHRONIZATION MECHANISM FOR MAINTAINING CONSISTENCY OF DATA
    6.
    发明申请
    SYSTEM AND METHOD FOR EFFICIENTLY PERFORMING MEMORY INTENSIVE COMPUTATIONS INCLUDING A BIDIRECTIONAL SYNCHRONIZATION MECHANISM FOR MAINTAINING CONSISTENCY OF DATA 有权
    有效执行记忆强化计算的系统和方法,包括维持数据一致性的双向同步机制

    公开(公告)号:US20070143254A1

    公开(公告)日:2007-06-21

    申请号:US11679040

    申请日:2007-02-26

    IPC分类号: G06F17/30

    摘要: A system and method for efficiently performing memory intensive computations including a bidirectional synchronization mechanism for maintaining consistency of data on which computations will be performed. This can be used to solve various problems such as those in a business context. Synchronization occurs in a near-real-time fashion between data in a database and data stored in memory. The synchronization is accomplished by periodically scanning the database to see if any data has changed. If any data has changed, the changes are copied over to memory so that the data in memory is current. This update is accomplished without copying the entire database into memory each time data in the database changes.

    摘要翻译: 一种用于有效执行存储器密集型计算的系统和方法,包括用于维持将执行哪些计算的数据的一致性的双向同步机制。 这可以用于解决诸如业务环境中的各种问题。 同步在数据库中的数据和存储在存储器中的数据之间以几乎实时的方式发生。 通过定期扫描数据库以查看是否有任何数据已更改来实现同步。 如果任何数据已更改,则将更改复制到内存中,以使内存中的数据为最新。 每次数据库中的数据更改时,都不会将整个数据库复制到内存中进行此更新。

    System and method for efficiently performing memory intensive computations including a bidirectional synchronization mechanism for maintaining consistency of data
    9.
    发明授权
    System and method for efficiently performing memory intensive computations including a bidirectional synchronization mechanism for maintaining consistency of data 有权
    用于有效执行存储器密集计算的系统和方法,包括用于维持数据一致性的双向同步机制

    公开(公告)号:US07200720B1

    公开(公告)日:2007-04-03

    申请号:US10041033

    申请日:2001-12-28

    IPC分类号: G06F12/00 G06F17/30

    摘要: A system and method for efficiently performing memory intensive computations including a bidirectional synchronization mechanism for maintaining consistency of data on which computations will be performed. This can be used to solve various problems such as those in a business context. Synchronization occurs in a near-real-time fashion between data in a database and data stored in memory. The synchronization is accomplished by periodically scanning the database to see if any data has changed. If any data has changed, the changes are copied over to memory so that the data in memory is current. This update is accomplished without copying the entire database into memory each time data in the database changes.

    摘要翻译: 一种用于有效执行存储器密集型计算的系统和方法,包括用于维持将执行哪些计算的数据的一致性的双向同步机制。 这可以用于解决诸如业务环境中的各种问题。 同步在数据库中的数据和存储在存储器中的数据之间以几乎实时的方式发生。 通过定期扫描数据库以查看是否有任何数据已更改来实现同步。 如果任何数据已更改,则将更改复制到内存中,以使内存中的数据为最新。 每次数据库中的数据更改时,都不会将整个数据库复制到内存中进行此更新。

    Storage network structure based on the Peterson graph and data read-write method thereof
    10.
    发明授权
    Storage network structure based on the Peterson graph and data read-write method thereof 有权
    基于彼得森图的存储网络结构及其数据读写方法

    公开(公告)号:US08219707B2

    公开(公告)日:2012-07-10

    申请号:US12584790

    申请日:2009-09-11

    IPC分类号: G06F15/173

    摘要: A storage network structure comprises a primary distributed storage network (a cluster distributed storage network or a DHT (Distributed Hash Table)-based peer-to-peer storage network) and a Peterson graph-based storage network. The storage network structure provides different reliability classes for applications and combines the advantages of a peer-to-peer based distributed network storage with Peterson graph-based network storage, solve the problem of a large quantity of data migrating by utilizing the better media data migrating non-movable property from the Peterson graph-based network storage, and screen the single failure of the cluster storage structure and avoid performance degradation of peer-to-peer wide area storage by combining with the availability and robustness of Distributed Hash Table.

    摘要翻译: 存储网络结构包括主分布式存储网络(集群分布式存储网络或基于DHT(分布式散列表)的对等存储网络)和基于彼得森图的存储网络。 存储网络结构为应用提供不同的可靠性等级,将基于点对点的分布式网络存储的优点与基于Peterson图形的网络存储相结合,通过利用更好的媒体数据迁移解决大量数据迁移的问题 从Peterson图形网络存储中获取不可移动的属性,并筛选出群集存储结构的单一故障,并通过结合分布式哈希表的可用性和鲁棒性来避免对等广域存储的性能下降。