会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • BUSINESS APPLICATIONS AND MONETIZATION MODELS OF RICH MEDIA BRAND INDEX MEASUREMENTS
    • 多媒体品牌指标测量的业务应用和制图模型
    • US20090030784A1
    • 2009-01-29
    • US11828509
    • 2007-07-26
    • Prabhakar GoyalJatin PatelSam P. Hamilton
    • Prabhakar GoyalJatin PatelSam P. Hamilton
    • G06Q30/00
    • G06Q30/02G06Q30/0244G06Q30/0251G06Q30/0277
    • A method for campaign optimization of interactive rich media advertising includes providing a plurality of creatives; assigning a weight to each creative; tracking user interaction with at least some of the plurality of creatives; continuously computing a brand index (BI) for each creative based on the tracked user interaction and the weight of each tracked creative; updating an optimization engine with a latest BI for each creative, wherein the optimization engine dynamically adjusts the weight of each creative based on the latest BI for each creative; and serving over a communication network the creatives based on the weight associated with each, such that the creatives with higher weight are served more frequently than the creatives with lower weight as an optimized ad campaign of the plurality of creatives.
    • 交互式富媒体广告的广告系列优化方法包括提供多个广告素材; 为每个广告素材分配权重; 跟踪与多个广告素材中的至少一些的用户交互; 基于跟踪的用户交互和每个跟踪的广告素材的重量,不断计算每个广告素材的品牌指数(BI); 更新针对每个广告素材的最新BI的优化引擎,其中优化引擎基于每个广告素材的最新BI来动态地调整每个广告素材的权重; 并且基于与每个相关联的权重,通过通信网络对广告素材进行服务,使得具有较高权重的广告素材比具有较低权重的作为多个广告素材的优化广告活动的广告素材的频率更高。
    • 3. 发明申请
    • MONETIZING RICH MEDIA ADVERTISING INTERACTION
    • 多媒体广告互动
    • US20090030785A1
    • 2009-01-29
    • US11828789
    • 2007-07-26
    • Prabhakar GoyalJatin Patel
    • Prabhakar GoyalJatin Patel
    • G06Q30/00
    • G06Q30/00G06Q30/0207G06Q30/0241
    • A method for calculating brand index (BI) for interactive rich media advertising produces a brand effectiveness model, and includes categorizing advertising exposure of a rich media ad into a type of bucket, and for each type of bucket: assigning a weight (Wj) to each of a plurality of data types collected in the bucket; assigning a score (Dj) to each of the data types collected in the bucket; tracking a frequency (Nj) of occurrence of each data type; and calculating a bucket brand index (BBIi)=ΣWj*Nj*Dj. A non-linear approach to calculating BBI may also be used. A bucket weight (Wi) is assigned to each type of bucket; the BI is calculated as a weighted sum of the plurality of bucket brand indexes (BBI)=ΣWi*BBIi, and the BI is communicated to an advertiser or publisher for an ad campaign that includes the BBIi to indicate monetization value of the rich media ad.
    • 用于计算交互式富媒体广告的品牌指数(BI)的方法产生品牌有效性模型,并且包括将富媒体广告的广告曝光分类为桶类型和对于每种类型的桶:将权重(Wj)分配给 在桶中收集的多个数据类型中的每一个; 将分数(Dj)分配给在桶中收集的每个数据类型; 跟踪每种数据类型的出现频率(Nj); 并计算桶品牌指数(BBIi)= SigmaWj * Nj * Dj。 还可以使用计算BBI的非线性方法。 铲斗重量(Wi)分配给每种类型的铲斗; BI被计算为多个桶品牌指数(BBI)= SigmaWi * BBIi的加权和,并且将BI传达给包括BBIi的广告活动的广告主或发布者,以指示富媒体广告的营利价值 。
    • 4. 发明申请
    • System and method for providing transaction support across a plurality of data structures
    • 用于跨多个数据结构提供事务支持的系统和方法
    • US20070214142A1
    • 2007-09-13
    • US11373041
    • 2006-03-10
    • Prabhakar GoyalPrashant RaoJatin PatelIlya Slain
    • Prabhakar GoyalPrashant RaoJatin PatelIlya Slain
    • G06F17/30
    • G06Q30/02
    • A system and method for providing transaction support across a plurality of data structures is disclosed. Generally, a transaction status directory indicating a transaction is in a prepare state is created. It is determined whether a first data structure is able to perform a first set of operations to complete the transaction. The first data structure is locked in response to determining the first data structure is able to perform the first set of instructions and instructions are sent to the first data structure to perform the set of operations. The first data structure is modified and a log of each modification of the first data structure is kept in case modification needs to be undone. It is then determined if a second data structure is able to perform a second set of operations to complete the transaction. In one embodiment, the second data structure is locked and instructions are sent to the second data structure to perform the set of operations. The second data structure is modified and a log of each modification of the second data structure is kept in case modification needs to be undone. The transaction status directory is then modified to indicate the transaction is in a commit phase, the log of modifications to the first and second data structures are deleted, and the locks of the first and second data structures are released.
    • 公开了一种用于跨多个数据结构提供事务支持的系统和方法。 通常,创建指示事务处于准备状态的事务状态目录。 确定第一数据结构是否能够执行第一组操作以完成交易。 响应于确定第一数据结构能够执行第一组指令而将第一数据结构锁定,并且指令被发送到第一数据结构以执行该组操作。 修改第一个数据结构,并保留第一个数据结构的每个修改的日志,以防修改需要撤消。 然后确定第二数据结构是否能够执行第二组操作以完成交易。 在一个实施例中,第二数据结构被锁定,并且指令被发送到第二数据结构以执行该组操作。 修改第二个数据结构,并保留第二个数据结构的每个修改的日志,以防修改需要撤消。 然后修改事务状态目录以指示事务处于提交阶段,删除对第一和第二数据结构的修改日志,并释放第一和第二数据结构的锁。
    • 6. 发明申请
    • System and method for resource lock acquisition and reclamation in a network file system environment
    • 网络文件系统环境下资源锁获取和回收的系统和方法
    • US20070214161A1
    • 2007-09-13
    • US11372878
    • 2006-03-10
    • Prabhakar GoyalPrashant RaoJatin PatelIlya Slain
    • Prabhakar GoyalPrashant RaoJatin PatelIlya Slain
    • G06F7/00
    • G06Q30/02G06F9/466G06F9/526G06F17/30171
    • A system and method for acquiring, releasing, and reclaiming a lock of a data structure in a network file system (“NFS”) is disclosed. Generally, a text file is created in a management library of the data structure. The name of the text file comprises an identifier of the lock, an identifier of a process attempting to acquire the lock, and an identifier of a machine on which the process attempting to acquire the lock is running. The identifier of the process attempting to acquire the lock and the identifier of the machine on which the process attempting to acquire the lock is running is saved in the contents of the text file and a hard line is created pointing to the text file. Finally, a number of links pointing to the text file is determined and a lock of the data structure is granted based on the number of links pointing to the text file.
    • 公开了一种用于获取,释放和回收网络文件系统(“NFS”)中的数据结构的锁的系统和方法。 通常,在数据结构的管理库中创建文本文件。 文本文件的名称包括锁的标识符,尝试获取锁的进程的标识符以及尝试获取锁的进程正在其上运行的机器的标识符。 尝试获取锁的进程的标识符和尝试获取锁的进程正在运行的机器的标识符被保存在文本文件的内容中,并且创建指向文本文件的硬线。 最后,确定指向文本文件的多个链接,并且基于指向文本文件的链接的数量来授予数据结构的锁定。