-
公开(公告)号：US20110238490A1
公开(公告)日：2011-09-29
申请号：US12732031
申请日：2010-03-25
CPC分类号： G06Q30/08 , G06Q30/02 , G06Q30/0244 , G06Q30/0247 , G06Q30/0256 , G06Q30/0275
摘要： Various embodiments provide techniques for auction flighting. In one or more embodiments, a control group and a test group are designated for participants who compete one to another in online auctions. An inclusive model may then be employed for testing of new conditions for auctions using the groups. In particular, multiple auctions can be conducted and/or simulated, such that control conditions are applied in auctions that do not include at least one member of the test group, and test conditions are applied in auctions having members from both the test group and the control group. A response to the test conditions can then be measured by analyzing behaviors of the participants in the auctions conducted with the control conditions in comparison to behaviors of participants in the auctions conducted with the test conditions.
摘要翻译： 各种实施例提供拍卖飞行的技术。 在一个或多个实施例中，对照组和测试组被指定用于在线拍卖中彼此竞争的参与者。 然后可以使用包容性模型来测试使用这些组的拍卖的新条件。 特别地，可以进行和/或模拟多个拍卖，使得控制条件被应用于不包括测试组的至少一个成员的拍卖，并且测试条件被应用于具有来自测试组和 控制组。 然后可以通过分析与控制条件进行的拍卖的参与者的行为相比较，在与测试条件进行的拍卖中的参与者的行为相比较，来测量对测试条件的响应。
-
公开(公告)号：US08922559B2
公开(公告)日：2014-12-30
申请号：US12748014
申请日：2010-03-26
CPC分类号： G06K9/6224 , G06F17/30958 , G06Q30/02 , G06Q30/08
摘要： Various embodiments provide techniques for graph clustering. In one or more embodiments, a participation graph is obtained that represents relationships between entities. An auxiliary graph is constructed based on the participation graph. The auxiliary graph may be constructed such that the auxiliary graph is less dense than the participation graph and is therefore computationally less complex to analyze. Clusters in the auxiliary graph are determined by solving an objective function defined for the auxiliary graph. Clusters determined for the auxiliary graph may then be utilized to ascertain clusters in the participation graph that solve a related objective function defined for the participation graph.
摘要翻译： 各种实施例提供了用于图形聚类的技术。 在一个或多个实施例中，获得表示实体之间的关系的参与图。 基于参与图构建辅助图。 辅助图可以被构造成使得辅助图不如参与图密度小，因此在计算上不太分析复杂。 辅助图中的簇通过求解辅助图定义的目标函数来确定。 然后可以使用为辅助图确定的群集来确定参与图中的聚类，以解决为参与图定义的相关目标函数。
-
公开(公告)号：US20110251889A1
公开(公告)日：2011-10-13
申请号：US12757634
申请日：2010-04-09
CPC分类号： G06Q30/0244 , G06Q30/02 , G06Q30/0247
摘要： Various embodiments provide techniques for inventory clustering. In one or more embodiments, a set of inventory to be processed is placed into an initial cluster. The inventory can be related to impressions for advertising that are defined by values for a set of attributes. Recursive division of the initial cluster is performed by selecting an attribute and deriving child clusters that are constrained by one or more values of the attributes in accordance with one or more clustering algorithms. The clustering algorithms are configured to derive an optimum number of clusters by repetitively generating smaller child clusters and measuring a cost associated with adding additional clusters. Additional child clusters can be formed in this manner until the measured cost to add more clusters outweighs a benefit of adding more clusters.
摘要翻译： 各种实施例提供了用于库存聚类的技术。 在一个或多个实施例中，要处理的一组库存被放置到初始集群中。 广告资源可以与由一组属性的值定义的广告展示相关联。 通过选择属性并根据一个或多个聚类算法导出由一个或多个属性值约束的子簇来执行初始簇的递归分割。 聚类算法被配置为通过重复地生成较小的子簇并测量与添加附加簇相关联的成本来导出最佳数量的簇。 可以以这种方式形成额外的子群集，直到添加更多簇的测量成本超过添加更多簇的好处。
-
公开(公告)号：US20110234594A1
公开(公告)日：2011-09-29
申请号：US12748014
申请日：2010-03-26
IPC分类号： G06T11/20
CPC分类号： G06K9/6224 , G06F17/30958 , G06Q30/02 , G06Q30/08
摘要： Various embodiments provide techniques for graph clustering. In one or more embodiments, a participation graph is obtained that represents relationships between entities. An auxiliary graph is constructed based on the participation graph. The auxiliary graph may be constructed such that the auxiliary graph is less dense than the participation graph and is therefore computationally less complex to analyze. Clusters in the auxiliary graph are determined by solving an objective function defined for the auxiliary graph. Clusters determined for the auxiliary graph may then be utilized to ascertain clusters in the participation graph that solve a related objective function defined for the participation graph.
摘要翻译： 各种实施例提供了用于图形聚类的技术。 在一个或多个实施例中，获得表示实体之间的关系的参与图。 基于参与图构建辅助图。 辅助图可以被构造成使得辅助图不如参与图密度小，因此在计算上不太分析复杂。 辅助图中的簇通过求解辅助图定义的目标函数来确定。 然后可以使用为辅助图确定的群集来确定参与图中的聚类，以解决为参与图定义的相关目标函数。
-
公开(公告)号：US20110258045A1
公开(公告)日：2011-10-20
申请号：US12761961
申请日：2010-04-16
CPC分类号： G06Q10/00 , G06Q30/00 , G06Q30/0241 , G06Q30/0255 , G06Q30/0277
摘要： Various embodiments provide techniques for inventory management. In one or more embodiments, a probabilistic model is constructed to represent an inventory of ad impressions available from a service provider. The probabilistic model can be based on a traffic model that describes historic interaction of clients with the service provider using various attributes that define the ad impressions. The probabilistic model provides a distribution of the attributes and relates the attributes one to another based on dependencies. When an order from an advertiser for ad impressions is booked by the service provider, the probabilistic model is updated to reflect an expected probabilistic decrease in the inventory of ad impressions. The updated probabilistic model can then be employed to determine whether the inventory of ad impressions is sufficient to book subsequent orders for ad impressions.
摘要翻译： 各种实施例提供了用于库存管理的技术。 在一个或多个实施例中，构建概率模型以表示可从服务提供商获得的广告展示的库存。 概率模型可以基于描述客户端与服务提供商的历史交互使用定义广告展示的各种属性的流量模型。 概率模型提供属性的分布，并根据依赖关系将属性相互关联。 当广告客户对广告展示的订单由服务提供商预订时，概率模型将被更新，以反映广告展示广告资源的预期概率下降。 然后可以使用更新的概率模型来确定广告展示的广告资源是否足以预订广告展示的后续订单。
-
公开(公告)号：US20110246312A1
公开(公告)日：2011-10-06
申请号：US12751533
申请日：2010-03-31
申请人： Christopher A. Meek , Denis X. Charles , Nikhil Devanur Rangarajan , David M. Chickering , Manan Sanghi , Kamal Jain
发明人： Christopher A. Meek , Denis X. Charles , Nikhil Devanur Rangarajan , David M. Chickering , Manan Sanghi , Kamal Jain
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0241 , G06Q30/02 , G06Q30/0277
摘要： Various embodiments provide techniques for advertisement inventory. In at least some embodiments, a scaled number of impressions can be matched to orders that have scaled impression goals. Impressions can be randomly selected from an offline traffic model and allocated to orders according to a matching algorithm until a number of impression defined by a scale factor is reached. This can occur by sampling the traffic model directly using the scale factor and/or by creating a scaled data set to which the matching algorithm can be applied. The matching algorithm can be configured to identify an order that is farthest away from being complete and then match the randomly selected impression to the identified order. If the scaled orders in the data set can be fulfilled using the scaled number of impressions, a conclusion is made that the original set of orders can be fulfilled using the original impressions.
摘要翻译： 各种实施例提供广告库存的技术。 在至少一些实施例中，可以将缩放的展示次数与具有缩放的展示目标的订单相匹配。 可以从脱机流量模型中随机选择印象，并根据匹配算法分配给订单，直到达到由缩放因子定义的多个印象。 这可以通过使用比例因子直接采样流量模型和/或通过创建可应用匹配算法的缩放数据集来进行。 可以将匹配算法配置为识别最远离完成的顺序，然后将随机选择的印象与识别的顺序相匹配。 如果可以使用缩放的展示次数来满足数据集中的缩放顺序，则可以得出结论，可以使用原始展示次数来满足原始订单集。
-
公开(公告)号：US20090290714A1
公开(公告)日：2009-11-26
申请号：US12123688
申请日：2008-05-20
IPC分类号： H04L9/08
CPC分类号： H04L63/123 , G06F21/645 , H04L9/3242 , H04L9/3271 , H04L67/104
摘要： An exemplary method for verifying the integrity of remotely stored data includes providing a key; providing a fingerprint, the fingerprint generated using the key in a keyed cryptographic hash function as applied to data of known integrity; sending the key to a remote storage location that stores a copy of the data of known integrity; receiving a fingerprint from the remote storage location, the fingerprint generated using the key in a keyed cryptographic hash function as applied to the remotely stored copy of the data; and verifying the integrity of the remotely stored copy of the data based at least in part on comparing the provided fingerprint to the received fingerprint. Other exemplary methods, systems, etc., are also disclosed.
摘要翻译： 用于验证远程存储数据的完整性的示例性方法包括提供密钥; 提供指纹，使用密钥在密钥加密散列函数中生成的指纹，以应用于已知完整性的数据; 将密钥发送到存储已知完整性数据的副本的远程存储位置; 从所述远程存储位置接收指纹，使用所述密钥在密钥密码散列函数中生成的指纹应用于远程存储的数据副本; 以及至少部分地基于将所提供的指纹与所接收的指纹进行比较来验证远程存储的数据副本的完整性。 还公开了其它示例性方法，系统等。
-
公开(公告)号：US20080301448A1
公开(公告)日：2008-12-04
申请号：US11757282
申请日：2007-06-01
申请人： Denis X. Charles , Kamal Jain , Kristin E. Lauter , Jin Li , Dan Teodosiu
发明人： Denis X. Charles , Kamal Jain , Kristin E. Lauter , Jin Li , Dan Teodosiu
IPC分类号： H04L9/00
CPC分类号： H04L9/3066 , H04L9/008 , H04L9/3247 , H04L2209/60
摘要： Systems and methods for security against corruption for networked storage are described. In one aspect, a destination device receives a linear combination of packets. The linear combination of packets represents digitally signed blocks of content and public information used to digitally sign segmented blocks of content. The destination device recombines the linear combination of packets to compute new valid signatures as linear combinations of received homomorphic digital signatures. The new valid signatures are for verifying by a requesting computing device recovering data associated with at least a subset of the linear combination of packets, integrity of the at least a subset. This provides the requesting node with security against corruption of data in networked storage.
摘要翻译： 描述了用于联网存储的用于防止损坏的安全性的系统和方法。 在一个方面，目的地设备接收分组的线性组合。 分组的线性组合表示用于对分段内容块进行数字签名的数字签名的内容块和公共信息。 目的地设备将分组的线性组合重新组合以计算新的有效签名作为接收的同态数字签名的线性组合。 新的有效签名用于由请求的计算设备验证恢复与分组的线性组合的至少一个子集相关联的数据，至少一个子集的完整性。 这为请求节点提供了防止网络存储中的数据损坏的安全性。
-
公开(公告)号：US20080141330A1
公开(公告)日：2008-06-12
申请号：US11567707
申请日：2006-12-06
申请人： Denis X. Charles , Kamal Jain , Kristin E. Lauter
发明人： Denis X. Charles , Kamal Jain , Kristin E. Lauter
CPC分类号： G06F21/64 , G06F21/6272
摘要： Systems and methods for digitally certified stationery are described. In one aspect, a stationery granting authority (SGA) receives a request from a user to generate a document. If the user is authorized for the requested document, the SGA generates a certificate with credentialing information from data in the request. The SGA generates a first digital signature from some of the credentialing information. The SGA communicates the certificate to the user for editing and distribution as the document. A recipient of the document determines whether the document is “official” by contacting a specified service to provide certain information from the document. The verification service computes a second digital signature from the provided information for comparison to the first digital signature. If there is a match, the service notifies the recipient that the document is valid/official. Otherwise, the recipient is notified that the document is not valid.
摘要翻译： 描述了数字认证的文具的系统和方法。 一方面，文具授予机构（SGA）从用户接收生成文档的请求。 如果用户被授权请求的文档，则SGA将从请求中的数据生成具有凭据信息的证书。 SGA从一些凭证信息生成第一个数字签名。 SGA将证书通信给用户进行编辑和分发作为文档。 文档的收件人通过联系指定的服务来确定文档是否“正式”，以从文档中提供某些信息。 验证服务根据提供的信息计算第二数字签名，以便与第一数字签名进行比较。 如果有匹配，则该服务通知收件人该文档是有效/正式的。 否则，通知收件人该文档无效。
-
公开(公告)号：US07702098B2
公开(公告)日：2010-04-20
申请号：US11080303
申请日：2005-03-15
CPC分类号： G06F7/725
摘要： Systems and methods for elliptic curve octupling for weighted projective coordinates are described. In one aspect, a weighted projective point P on an elliptic curve is identified. 8P is computed from P independent of repeated doubling operations using fewer field multiplications.
摘要翻译： 描述用于加权投影坐标的椭圆曲线八倍体的系统和方法。 在一方面，识别椭圆曲线上的加权投影点P. 8P是从独立于使用较少的场乘法的重复加倍运算的P计算的。
-
-
-
-
-
-
-
-
-
搜索结果
23 条记录 (耗时 0.053 秒)
