公开(公告)号：US20070050204A1

公开(公告)日：2007-03-01

申请号：US11589408

申请日：2006-10-30

申请人： Sanjay Ranka ,  Jason Lenderman ,  James Weisinger

发明人： Sanjay Ranka ,  Jason Lenderman ,  James Weisinger

IPC分类号： G06Q99/00

CPC分类号： G06Q30/02 ,  G06Q10/06315 ,  G06Q10/0639 ,  G06Q30/0201 ,  G06Q30/0204 ,  G06Q30/0205 ,  G06Q30/0241 ,  G06Q30/0242 ,  G06Q30/0244 ,  G06Q30/0256 ,  G06Q30/0277 ,  G06Q30/0631 ,  G06Q30/0633

摘要： Method, procedure, algorithm, system, and computer program for improving and attempting to optimize the performance of messaging campaigns, particularly to marketing campaigns in which advertisements or other messages are distributed over an interactive measurable medium such as the Internet. A goal is to allocate the message alternatives to the customer population to optimize business objectives. The includes reading prior stage message state data pertaining to a prior stage including a cumulative number of trials and a cumulative number of successes for a particular message. Message performance results representing message trials and message successes from the previous stage based on the prior-stage state are then read, and a current message state is computed. A current message allocation is generated based on the current message state. Desirably the cumulative number of trials and the cumulative number of successes are discounted based on the age of the information. This inventive procedure may be applied to various message types including, for example, web site banner advertisements, electronic advertisements generally, email messages and promotions, and the like. In one embodiment, the messages are internet web site banner ads, trials are impressions of the ads presented to the user, and successes are measured by clickthroughs from the banner ad to the web site associated with the banner ad. Computer system, computer program, and computer program product associated with the inventive method and procedures are also provided by the invention.

摘要翻译： 方法，程序，算法，系统和计算机程序，用于改进和尝试优化消息传播活动的性能，特别是在诸如因特网的交互式可测量介质上分发广告或其他消息的营销活动。 目标是为客户群体分配消息替代品，以优化业务目标。 这包括读取与前一阶段相关的前级消息状态数据，其包括累积的试验次数和针对特定消息的累积成功次数。 然后读取表示基于前一级状态的前一级的消息试验和消息成功的消息性能结果，并且计算当前消息状态。 基于当前消息状态生成当前消息分配。 理想的是，根据信息的年龄，累积的试验次数和累积的成功次数将被打折扣。 本发明的过程可以应用于各种消息类型，包括例如网站横幅广告，通常的电子广告，电子邮件消息和促销等。 在一个实施例中，消息是互联网网站横幅广告，试验是向用户呈现的广告的印象，成功通过从横幅广告到与横幅广告相关联的网站的点击来衡量。 本发明还提供了与本发明方法和程序相关联的计算机系统，计算机程序和计算机程序产品。

公开(公告)号：US20080306810A1

公开(公告)日：2008-12-11

申请号：US12193163

申请日：2008-08-18

申请人： Sanjay Ranka ,  Jason S. Lenderman ,  James Weisinger

发明人： Sanjay Ranka ,  Jason S. Lenderman ,  James Weisinger

IPC分类号： G06Q30/00 ,  G06Q10/00

CPC分类号： G06Q30/02 ,  G06Q10/06315 ,  G06Q10/0639 ,  G06Q30/0201 ,  G06Q30/0204 ,  G06Q30/0205 ,  G06Q30/0241 ,  G06Q30/0242 ,  G06Q30/0244 ,  G06Q30/0256 ,  G06Q30/0277 ,  G06Q30/0631 ,  G06Q30/0633

摘要： Method, procedure, algorithm, system, and computer program for improving and attempting to optimize the performance of messaging campaigns, particularly to marketing campaigns in which advertisements or other messages are distributed over an interactive measurable medium such as the Internet. A goal is to allocate the message alternatives to the customer population to optimize business objectives. The includes reading prior stage message state data pertaining to a prior stage including a cumulative number of trials and a cumulative number of successes for a particular message. Message performance results representing message trials and message successes from the previous stage based on the prior-stage state are then read, and a current message state is computed. A current message allocation is generated based on the current message state. Desirably the cumulative number of trials and the cumulative number of successes are discounted based on the age of the information. This inventive procedure may be applied to various message types including, for example, web site banner advertisements, electronic advertisements generally, email messages and promotions, and the like. In one embodiment, the messages are internet web site banner ads, trials are impressions of the ads presented to the user, and successes are measured by clickthroughs from the banner ad to the web site associated with the banner ad. Computer system, computer program, and computer program product associated with the inventive method and procedures are also provided.

摘要翻译： 方法，程序，算法，系统和计算机程序，用于改进和尝试优化消息传播活动的性能，特别是在诸如因特网的交互式可测量介质上分发广告或其他消息的营销活动。 目标是为客户群体分配消息替代品，以优化业务目标。 这包括读取与前一阶段相关的前级消息状态数据，其包括累积的试验次数和针对特定消息的累积成功次数。 然后读取表示基于前一级状态的前一级的消息试验和消息成功的消息性能结果，并且计算当前消息状态。 基于当前消息状态生成当前消息分配。 理想的是，根据信息的年龄，累积的试验次数和累积的成功次数将被打折扣。 本发明的过程可以应用于各种消息类型，包括例如网站横幅广告，通常的电子广告，电子邮件消息和促销等。 在一个实施例中，消息是互联网网站横幅广告，试验是向用户呈现的广告的印象，成功通过从横幅广告到与横幅广告相关联的网站的点击来衡量。 还提供了与本发明的方法和程序相关联的计算机系统，计算机程序和计算机程序产品。

公开(公告)号：US20050148841A1

公开(公告)日：2005-07-07

申请号：US10736023

申请日：2003-12-15

申请人： Srijit Kamath ,  Sartaj Sahni ,  Jatinder Palta ,  Sanjay Ranka ,  Jonathan Li

发明人： Srijit Kamath ,  Sartaj Sahni ,  Jatinder Palta ,  Sanjay Ranka ,  Jonathan Li

IPC分类号： A61B5/05 ,  A61N5/10

CPC分类号： A61N5/103 ,  A61N5/1036 ,  A61N5/1042

摘要： A method of delivering radiation treatment using multi-leaf collimation includes the step of providing a radiation fluence map which includes an intensity profile. The fluence map is converted into a preliminary leaf sequence, wherein the preliminary leaf sequence minimizes machine on-time and is generated without leaf movement constraints. The leaf movement constraint is imposed on the preliminary leaf sequence. At least one constraint elimination algorithm is then applied, the algorithm adjusting the preliminary leaf sequence to minimize violations of the constraint while providing the desired fluence map and minimized radiation on-time. The method can be applied to SMLC and DLMC systems, and can include adjustment for the tongue-and-groove effect.

摘要翻译： 使用多叶准直进行放射治疗的方法包括提供包括强度分布的辐射注量图的步骤。 注量图被转换成初步的叶子序列，其中初步叶子序列使机器准时最小化，并且不产生叶片运动限制。 叶片运动约束对初步叶序列施加。 然后应用至少一个约束消除算法，该算法调整初步叶序列以最小化对约束的违反，同时提供期望的通量图和最小化的辐射on-time。 该方法可以应用于SMLC和DLMC系统，并且可以包括对榫槽效应的调整。

公开(公告)号：US5987468A

公开(公告)日：1999-11-16

申请号：US989847

申请日：1997-12-12

申请人： Vineet Singh ,  Khaled Alsabti ,  Sanjay Ranka

发明人： Vineet Singh ,  Khaled Alsabti ,  Sanjay Ranka

IPC分类号： G06F15/173 ,  G06F12/00 ,  G06F17/30

CPC分类号： G06F17/30327 ,  G06F17/30333 ,  Y10S707/99936 ,  Y10S707/99937

摘要： Multidimensional similarity join finds pairs of multi-dimensional points that are within some small distance of each other. Databases in domains such as multimedia and time-series can require a high number of dimensions. The .epsilon.-k-d-B tree has been proposed as a data structure that scales better as number of dimensions increases compared to previous data structures such as the R-tree (and variations), grid-file, and k-d-B tree. We present a cost model of the .epsilon.-k-d-B tree and use it to optimize the leaf size. This new leaf size is shown to be better in most situations compared to previous work that used a constant leaf size. We present novel parallel procedures for the .epsilon.-k-d-B tree. A load-balancing strategy based on equi-depth histograms is shown to work well for uniform or low-skew situations, whereas another based on weighted, equi-depth histograms works far better for high-skew datasets. The latter strategy is only slightly slower than the former strategy for low skew datasets. The weights for the latter strategy are based on the same cost model that is used to determine optimal leaf sizes.

摘要翻译： 多维相似联合找到彼此在一些小距离内的多维点对。 域中的数据库（如多媒体和时间序列）可能需要大量的维度。 已经提出了epsilon -k-d-B树作为数据结构，与先前的数据结构（如R-tree（和变体），网格文件和k-d-B树）相比，维度数量的增加更好。 我们提出了一个eps-k-d-B树的成本模型，并用它来优化叶尺寸。 与使用恒定叶尺寸的以前的工作相比，在大多数情况下，新叶尺寸显示出更好。 我们提出了epsilon -k-d-B树的新颖并行程序。 基于等深度直方图的负载平衡策略被显示为均匀或低偏移情况下工作良好，而基于加权的等深度直方图的另一个对于高偏斜数据集的工作更好。 后一种策略仅比低偏差数据集的前一种策略略慢。 后一种策略的权重基于用于确定最佳叶尺寸的相同成本模型。

公开(公告)号：US08386315B1

公开(公告)日：2013-02-26

申请号：US10024630

申请日：2001-12-17

申请人： Aravind Bala ,  Richard E. Chatwin ,  Brian B. Jones ,  Ismail Ahmet Nalcacioglu ,  Sanjay Ranka

发明人： Aravind Bala ,  Richard E. Chatwin ,  Brian B. Jones ,  Ismail Ahmet Nalcacioglu ,  Sanjay Ranka

IPC分类号： G06Q30/00

CPC分类号： G06Q30/0242 ,  G06Q30/0241

摘要： System, method, computer program and computer program product automate and optimize process of placing advertising campaigns on available inventory. When visitor loads one of publisher's web pages, system will be queried for advertisement that should be shown. System periodically analyzes performance data to determine optimal allocations. When queried, identifies advertiser campaign and advertisement to be shown. Results of that visitor encounter are logged or recorded for future analysis. Determination of campaign placements may advantageously be a two-phase process. First, campaign is efficiently tested on the inventory most likely to produce good results. The testing module dynamically adapts, adjusting the amount of testing on different channels until a sufficient determination of the creative performance on different channels can be made. The second phase is the resource allocation. Campaign performance data and contractual constraints are formulated as a network problem. Efficient methods for solving network problems are well known. These two phases may be further subdivided if necessary.

摘要翻译： 系统，方法，计算机程序和计算机程序产品自动化和优化在可用库存上放置广告活动的过程。 当访问者加载发布者的网页之一时，系统将被查询以显示应该显示的广告。 系统定期分析性能数据以确定最佳分配。 查询时，标识要显示的广告客户活动和广告。 记录或记录访客遇到的结果，以备将来分析。 活动安置的确定可以有利地是两阶段的过程。 首先，在最有可能产生良好效果的库存上有效地测试运动。 测试模块动态调整，调整不同渠道的测试量，直到可以对不同渠道的创意表现进行充分的确定。 第二阶段是资源分配。 运动绩效数据和合同约束被制定为网络问题。 解决网络问题的有效方法是众所周知的。 如有必要，这两个阶段可以进一步细分。

公开(公告)号：US07756741B2

公开(公告)日：2010-07-13

申请号：US12193163

申请日：2008-08-18

申请人： Sanjay Ranka ,  Jason S. Lenderman ,  James Weisinger

发明人： Sanjay Ranka ,  Jason S. Lenderman ,  James Weisinger

IPC分类号： G06F17/60

CPC分类号： G06Q30/02 ,  G06Q10/06315 ,  G06Q10/0639 ,  G06Q30/0201 ,  G06Q30/0204 ,  G06Q30/0205 ,  G06Q30/0241 ,  G06Q30/0242 ,  G06Q30/0244 ,  G06Q30/0256 ,  G06Q30/0277 ,  G06Q30/0631 ,  G06Q30/0633

摘要： Method, procedure, algorithm, system, and computer program for improving and attempting to optimize the performance of messaging campaigns, particularly to marketing campaigns in which advertisements or other messages are distributed over an interactive measurable medium such as the Internet. A goal is to allocate the message alternatives to the customer population to optimize business objectives. The includes reading prior stage message state data pertaining to a prior stage including a cumulative number of trials and a cumulative number of successes for a particular message. Message performance results representing message trials and message successes from the previous stage based on the prior-stage state are then read, and a current message state is computed. A current message allocation is generated based on the current message state. Desirably the cumulative number of trials and the cumulative number of successes are discounted based on the age of the information. This inventive procedure may be applied to various message types including, for example, web site banner advertisements, electronic advertisements generally, email messages and promotions, and the like. In one embodiment, the messages are internet web site banner ads, trials are impressions of the ads presented to the user, and successes are measured by clickthroughs from the banner ad to the web site associated with the banner ad. Computer system, computer program, and computer program product associated with the inventive method and procedures are also provided.

摘要翻译： 方法，程序，算法，系统和计算机程序，用于改进和尝试优化消息传播活动的性能，特别是在诸如因特网的交互式可测量介质上分发广告或其他消息的营销活动。 目标是为客户群体分配消息替代品，以优化业务目标。 这包括读取与前一阶段相关的前级消息状态数据，其包括累积的试验次数和针对特定消息的累积成功次数。 然后读取表示基于前一级状态的前一级的消息试验和消息成功的消息性能结果，并且计算当前消息状态。 基于当前消息状态生成当前消息分配。 理想的是，根据信息的年龄，累积的试验次数和累积的成功次数将被打折扣。 本发明的过程可以应用于各种消息类型，包括例如网站横幅广告，通常的电子广告，电子邮件消息和促销等。 在一个实施例中，消息是互联网网站横幅广告，试验是向用户呈现的广告的印象，成功通过从横幅广告到与横幅广告相关联的网站的点击来衡量。 还提供了与本发明的方法和程序相关联的计算机系统，计算机程序和计算机程序产品。

公开(公告)号：US20080240348A1

公开(公告)日：2008-10-02

申请号：US11995303

申请日：2006-07-11

申请人： Srijit Kamath ,  Sartaj Kumar Sahni ,  Jonathan Li ,  Jatinder Palta ,  Sanjay Ranka

发明人： Srijit Kamath ,  Sartaj Kumar Sahni ,  Jonathan Li ,  Jatinder Palta ,  Sanjay Ranka

IPC分类号： A61N5/10

CPC分类号： A61N5/1042 ,  A61N5/1036 ,  G21K1/04

摘要： A method and associated system 300 for delivering intensity-modulated radiation therapy (IMRT) uses variable feathering field splitting for intensity modulated fields of large size. Processor 112 controls a beam-shaping device 106 so that the beam-shaping device splits the radiation beam into a plurality of radiation fields delivered to the patient 102. Processor 112 in cooperation with beam-shaping device 106 implements a variable feathering method which includes the steps of providing an intensity matrix for the treatment of a patient, the intensity matrix having a plurality of rows and columns for spanning a prescribed radiation field including a prescribed field width. The prescribed width is compared to a maximum field width provided by the radiation treatment system. The intensity matrix is split into a plurality of spatially overlapping intensity submatrices when the prescribed width exceeds the maximum field width, wherein the splitting comprises variably feathering the intensity matrix. Radiotherapy is then provided to the patient 102 using a leaf sequencing method to generate the submatrices.

摘要翻译： 用于递送强度调制辐射治疗（IMRT）的方法和相关系统300使用大尺寸强度调制场的可变羽化场分割。 处理器112控制光束整形装置106，使得光束整形装置将辐射束分成传送到患者102的多个辐射场。 与光束整形装置106协作的处理器112实现可变羽化方法，其包括提供用于治疗患者的强度矩阵的步骤，所述强度矩阵具有多个行和列，用于跨越规定的辐射场，包括规定的 字段宽度。 将规定的宽度与辐射处理系统提供的最大场宽进行比较。 当规定的宽度超过最大场宽时，强度矩阵被分割成多个空间上重叠的强度子矩阵，其中分割包括可变地羽化强度矩阵。 然后使用叶片测序方法向患者102提供放射疗法以产生子矩阵。

公开(公告)号：US07415423B2

公开(公告)日：2008-08-19

申请号：US11589408

申请日：2006-10-30

申请人： Sanjay Ranka ,  Jason S. Lenderman ,  James Weisinger

发明人： Sanjay Ranka ,  Jason S. Lenderman ,  James Weisinger

IPC分类号： G06Q99/00

CPC分类号： G06Q30/02 ,  G06Q10/06315 ,  G06Q10/0639 ,  G06Q30/0201 ,  G06Q30/0204 ,  G06Q30/0205 ,  G06Q30/0241 ,  G06Q30/0242 ,  G06Q30/0244 ,  G06Q30/0256 ,  G06Q30/0277 ,  G06Q30/0631 ,  G06Q30/0633

摘要： Method, procedure, algorithm, system, and computer program for improving and attempting to optimize the performance of messaging campaigns, particularly to marketing campaigns in which advertisements or other messages are distributed over an interactive measurable medium such as the Internet. A goal is to allocate the message alternatives to the customer population to optimize business objectives. The includes reading prior stage message state data pertaining to a prior stage including a cumulative number of trials and a cumulative number of successes for a particular message. Message performance results representing message trials and message successes from the previous stage based on the prior-stage state are then read, and a current message state is computed. A current message allocation is generated based on the current message state. Desirably the cumulative number of trials and the cumulative number of successes are discounted based on the age of the information. This inventive procedure may be applied to various message types including, for example, web site banner advertisements, electronic advertisements generally, email messages and promotions, and the like. In one embodiment, the messages are internet web site banner ads, trials are impressions of the ads presented to the user, and successes are measured by clickthroughs from the banner ad to the web site associated with the banner ad. Computer system, computer program, and computer program product associated with the inventive method and procedures are also provided by the invention.

摘要翻译： 方法，程序，算法，系统和计算机程序，用于改进和尝试优化消息传播活动的性能，特别是在诸如因特网的交互式可测量介质上分发广告或其他消息的营销活动。 目标是为客户群体分配消息替代品，以优化业务目标。 这包括读取与前一阶段相关的前级消息状态数据，其包括累积的试验次数和针对特定消息的累积成功次数。 然后读取表示基于前一级状态的前一级的消息试验和消息成功的消息性能结果，并且计算当前消息状态。 基于当前消息状态生成当前消息分配。 理想的是，根据信息的年龄，累积的试验次数和累积的成功次数将被打折扣。 本发明的过程可以应用于各种消息类型，包括例如网站横幅广告，通常的电子广告，电子邮件消息和促销等。 在一个实施例中，消息是互联网网站横幅广告，试验是向用户呈现的广告的印象，成功通过从横幅广告到与横幅广告相关联的网站的点击来衡量。 本发明还提供了与本发明方法和程序相关联的计算机系统，计算机程序和计算机程序产品。

公开(公告)号：US08805715B1

公开(公告)日：2014-08-12

申请号：US10017499

申请日：2001-12-07

申请人： Brian B. Jones ,  Sanjay Ranka

发明人： Brian B. Jones ,  Sanjay Ranka

IPC分类号： G06Q30/02

CPC分类号： G06Q30/02

摘要： System, method, computer program and computer program improve performance of messaging campaigns particularly of Internet web splash pages. Executing, improving, and desirably optimizing performance of marketing campaigns in which splash pages or other splash pages are shown to visitors on a web site. System and method provide an automated splash page targeting and allocation scheme that is dynamic and adaptive. System for autonomously selecting attributes of a splash page to improve splash page performance in an interactive measurable medium such as the Internet if such attributes are available, includes means for receiving splash page attribute configuration information and splash page performance information, an optimization engine receiving the splash page performance information and making decisions based on received splash page performance information and predetermined rules to generate future splash page attribute configuration information, and a splash page server to deliver splash pages based on future splash page attribute configuration information.

摘要翻译： 系统，方法，计算机程序和计算机程序提高消息传播的功能，特别是Internet网页的页面。 执行，改进和期望优化营销活动的性能，其中在网站上向访问者显示启动页面或其他启动页面。 系统和方法提供动态和自适应的自动启动页面定位和分配方案。 用于自主选择启动页面的属性的系统，以提高诸如因特网的交互式可测量介质（如果这样的属性可用）中的页面性能，包括用于接收启动页面属性配置信息和启动页面性能信息的装置，优化引擎接收飞溅 页面性能信息和基于接收到的启动页面性能信息和预定规则做出决定以生成未来的启动页面属性配置信息，以及启动页面服务器，以根据未来的启动页面属性配置信息来传送初始页面。

公开(公告)号：US07130808B1

公开(公告)日：2006-10-31

申请号：US09586387

申请日：2000-06-02

申请人： Sanjay Ranka ,  Jason S. Lenderman ,  James Weisinger

发明人： Sanjay Ranka ,  Jason S. Lenderman ,  James Weisinger

IPC分类号： G06F17/00

CPC分类号： G06Q30/02 ,  G06Q10/06315 ,  G06Q10/0639 ,  G06Q30/0201 ,  G06Q30/0204 ,  G06Q30/0205 ,  G06Q30/0241 ,  G06Q30/0242 ,  G06Q30/0244 ,  G06Q30/0256 ,  G06Q30/0277 ,  G06Q30/0631 ,  G06Q30/0633

摘要： Method, procedure, algorithm, system, and computer program for improving and attempting to optimize the performance of messaging campaigns, particularly to marketing campaigns in which advertisements or other messages are distributed over an interactive measurable medium such as the Internet. A goal is to allocate the message alternatives to the customer population to optimize business objectives. The includes reading prior stage message state data pertaining to a prior stage including a cumulative number of trials and a cumulative number of successes for a particular message. Message performance results representing message trials and message successes from the previous stage based on the prior-stage state are then read, and a current message state is computed. A current message allocation is generated based on the current message state. Desirably the cumulative number of trials and the cumulative number of successes are discounted based on the age of the information. This inventive procedure may be applied to various message types including, for example, web site banner advertisements, electronic advertisements generally, email messages and promotions, and the like. In one embodiment, the messages are internet web site banner ads, trials are impressions of the ads presented to the user, and successes are measured by clickthroughs from the banner ad to the web site associated with the banner ad. Computer system, computer program, and computer program product associated with the inventive method and procedures are also provided by the invention.

摘要翻译： 方法，程序，算法，系统和计算机程序，用于改进和尝试优化消息传播活动的性能，特别是在诸如因特网的交互式可测量介质上分发广告或其他消息的营销活动。 目标是为客户群体分配消息替代品，以优化业务目标。 这包括读取与前一阶段相关的前级消息状态数据，其包括累积的试验次数和针对特定消息的累积成功次数。 然后读取表示基于前一级状态的前一级的消息试验和消息成功的消息性能结果，并且计算当前消息状态。 基于当前消息状态生成当前消息分配。 理想的是，根据信息的年龄，累积的试验次数和累积的成功次数将被打折扣。 本发明的过程可以应用于各种消息类型，包括例如网站横幅广告，通常的电子广告，电子邮件消息和促销等。 在一个实施例中，消息是互联网网站横幅广告，试验是向用户呈现的广告的印象，成功通过从横幅广告到与横幅广告相关联的网站的点击来衡量。 本发明还提供了与本发明方法和程序相关联的计算机系统，计算机程序和计算机程序产品。