专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08520842B2 Maintaining privacy during user profiling 有权
标题翻译：在用户分析期间维护隐私
公开(公告)号：US08520842B2
公开(公告)日：2013-08-27
申请号：US12683586
申请日：2010-01-07
申请人： Nir Nice , Ehud Wieder , Boaz Feldbaum , Sefy Ophir , Eran Shamir , Yacov Yacobi , Arie Friedman
发明人： Nir Nice , Ehud Wieder , Boaz Feldbaum , Sefy Ophir , Eran Shamir , Yacov Yacobi , Arie Friedman
IPC分类号： H04L29/06
CPC分类号： H04L67/306 , G06F21/6263 , H04L9/30 , H04L63/0442 , H04L63/102 , H04L67/20 , H04L67/22 , H04L2209/84
摘要： Systems, methods, and computer storage media having computer-executable instructions embodied thereon that maintain privacy during user profiling are provided. A profiling service receives, from a first device, rules for profiling a user. The rules were encrypted using a private key. The profiling service also receives, from a second device, user data. The user data was encrypted using a public key communicated to the second device by the first device. The profiling service then matches the encrypted rules with the encrypted user data, and based on the matching, generates a profile for the user. In embodiments, such a user profile can be utilized to deliver personalized digital content to a user.
摘要翻译：提供了具有在其上体现的具有在用户分析期间保持隐私的计算机可执行指令的系统，方法和计算机存储介质。分析服务从第一设备接收用于分析用户的规则。这些规则是使用私钥加密的。分析服务还从第二设备接收用户数据。使用由第一设备传送到第二设备的公共密钥对用户数据进行加密。然后，分析服务将加密的规则与加密的用户数据相匹配，并且基于匹配，为用户生成简档。在实施例中，可以利用这样的用户简档来向用户传送个性化数字内容。

2. 发明授权

US10284679B2 Maintaining privacy during personalized content delivery 有权
公开(公告)号：US10284679B2
公开(公告)日：2019-05-07
申请号：US12683618
申请日：2010-01-07
申请人： Nir Nice , Ehud Wieder , Arie Friedman
发明人： Nir Nice , Ehud Wieder , Arie Friedman
IPC分类号： G06F9/44 , H04L29/08 , G06Q30/02 , H04L29/06 , H04N21/81 , H04L9/08 , H04L9/32
摘要： Embodiments of the present invention relate to systems, methods, and computer-storage media for maintaining privacy while delivering advertisements based on encrypted user profile identifiers. In embodiments, a Public key Encryption with Keyword Search (PEKS) is used to generate a public key and a private key. In embodiments, a public key and a private key are used to encrypt user profile identifiers and generate trapdoors associated with defined profile identifiers, respectively. A portion of the encrypted user profile identifiers are compared to a portion of the trapdoors. If a match is present between at least one encrypted user profile identifier and an associated trapdoor, a delivery engine is provided with an identification of content to be delivered to the user. The provided description is then used to determine an advertisement to present to a user. The advertisement is then presented to the user.

3. 发明申请

US20100262964A1 Virtual Machine Packing Method Using Scarcity 有权
标题翻译：虚拟机包装方法使用稀缺
公开(公告)号：US20100262964A1
公开(公告)日：2010-10-14
申请号：US12422123
申请日：2009-04-10
申请人： Lincoln K. Uyeda , Rina Panigrahy , Ehud Wieder , Kunal Talwar
发明人： Lincoln K. Uyeda , Rina Panigrahy , Ehud Wieder , Kunal Talwar
IPC分类号： G06F9/455
CPC分类号： G06F9/45533 , G06F9/455 , G06F9/45558 , G06F9/5044 , G06F9/5077 , G06F9/5088 , G06F2009/4557 , Y02D10/22 , Y02D10/32 , Y02D10/36
摘要： A method for packing virtual machines onto host devices may calculate scarcity values for several different parameters. A host's scarcity for a parameter may be determined by multiplying the host's capacity for a parameter with the overall scarcity of that parameter. The sum of a host's scarcity for all the parameters determines the host's overall scarcity. Hosts having the highest scarcity are attempted to be populated with a group of virtual machines selected for compatibility with the host. In many cases, several different scenarios may be evaluated and an optimal scenario implemented. The method gives a high priority to those virtual machines that consume scarce resources, with the scarcity being a function of the available hardware and the virtual machines that may be placed on them.
摘要翻译：将虚拟机打包到主机设备上的方法可以计算几个不同参数的稀缺值。主机对参数的稀缺性可以通过将主机的参数容量与该参数的总体稀缺度相乘来确定。主机对所有参数的稀缺性的总和决定了主机的总体稀缺性。尝试使用选择与主机兼容的一组虚拟机来填充具有最高稀缺度的主机。在许多情况下，可以评估几种不同的场景，并实现最佳方案。该方法给那些消耗稀少资源的虚拟机提供了高度的优先权，其中稀缺性是可用硬件和可能放置在其上的虚拟机的功能。

4. 发明授权

US08464267B2 Virtual machine packing method using scarcity 有权
标题翻译：虚拟机包装方法缺乏
公开(公告)号：US08464267B2
公开(公告)日：2013-06-11
申请号：US12422123
申请日：2009-04-10
申请人： Lincoln K. Uyeda , Rina Panigrahy , Ehud Wieder , Kunal Talwar
发明人： Lincoln K. Uyeda , Rina Panigrahy , Ehud Wieder , Kunal Talwar
IPC分类号： G06F9/50
CPC分类号： G06F9/45533 , G06F9/455 , G06F9/45558 , G06F9/5044 , G06F9/5077 , G06F9/5088 , G06F2009/4557 , Y02D10/22 , Y02D10/32 , Y02D10/36
摘要： A method for packing virtual machines onto host devices may calculate scarcity values for several different parameters. A host's scarcity for a parameter may be determined by multiplying the host's capacity for a parameter with the overall scarcity of that parameter. The sum of a host's scarcity for all the parameters determines the host's overall scarcity. Hosts having the highest scarcity are attempted to be populated with a group of virtual machines selected for compatibility with the host. In many cases, several different scenarios may be evaluated and an optimal scenario implemented. The method gives a high priority to those virtual machines that consume scarce resources, with the scarcity being a function of the available hardware and the virtual machines that may be placed on them.
摘要翻译：将虚拟机打包到主机设备上的方法可以计算几个不同参数的稀缺值。主机对参数的稀缺性可以通过将主机的参数容量与该参数的总体稀缺度相乘来确定。主机对所有参数的稀缺性的总和决定了主机的总体稀缺性。尝试使用选择与主机兼容的一组虚拟机来填充具有最高稀缺度的主机。在许多情况下，可以评估几种不同的场景，并实现最佳方案。该方法给那些消耗稀少资源的虚拟机提供了高度的优先权，其中稀缺性是可用硬件和可能放置在其上的虚拟机的功能。

5. 发明申请

US20110067030A1 FLOW BASED SCHEDULING 有权
标题翻译：流量调度
公开(公告)号：US20110067030A1
公开(公告)日：2011-03-17
申请号：US12560452
申请日：2009-09-16
申请人： Michael Isard , Vijayan Prabhakaran , Jonathan James Currey , Ehud Wieder , Kunal Talwar
发明人： Michael Isard , Vijayan Prabhakaran , Jonathan James Currey , Ehud Wieder , Kunal Talwar
IPC分类号： G06F9/46 , G06F15/173
CPC分类号： G06F9/5066 , G06F8/433 , G06F9/4881
摘要： A job scheduler may schedule concurrent distributed jobs in a computer cluster by assigning tasks from the running jobs to compute nodes while balancing fairness with efficiency. Determining which tasks to assign to the compute nodes may be performed using a network flow graph. The weights on at least some of the edges of the graph encode data locality, and the capacities provide constraints that ensure fairness. A min-cost flow technique may be used to perform an assignment of the tasks represented by the network flow graph. Thus, online task scheduling with locality may be mapped onto a network flow graph, which in turn may be used to determine a scheduling assignment using min-cost flow techniques. The costs may encode data locality, fairness, and starvation-freedom.
摘要翻译：作业调度器可以通过将运行作业中的任务分配给计算节点，同时平衡公平性和效率，来计划计算机集群中的并发分布式作业。确定分配给计算节点的任务可以使用网络流程图来执行。图的至少一些边缘上的权重编码数据位置，并且容量提供确保公平性的约束。最小成本流技术可用于执行由网络流程图表示的任务的分配。因此，具有局部性的在线任务调度可以映射到网络流程图上，网络流程图可以用于使用最小成本流技术来确定调度分配。成本可能会对数据的局部性，公平性和饥饿自由进行编码。

6. 发明授权

US08332862B2 Scheduling ready tasks by generating network flow graph using information receive from root task having affinities between ready task and computers for execution 有权
标题翻译：通过使用从准备任务和计算机之间具有执行关联性的根任务接收的信息生成网络流图来调度准备好的任务
公开(公告)号：US08332862B2
公开(公告)日：2012-12-11
申请号：US12560452
申请日：2009-09-16
申请人： Michael Isard , Vijayan Prabhakaran , Jonathan James Currey , Ehud Wieder , Kunal Talwar
发明人： Michael Isard , Vijayan Prabhakaran , Jonathan James Currey , Ehud Wieder , Kunal Talwar
IPC分类号： G06F9/46 , G06F15/16 , G06F15/173
CPC分类号： G06F9/5066 , G06F8/433 , G06F9/4881
摘要： A job scheduler may schedule concurrent distributed jobs in a computer cluster by assigning tasks from the running jobs to compute nodes while balancing fairness with efficiency. Determining which tasks to assign to the compute nodes may be performed using a network flow graph. The weights on at least some of the edges of the graph encode data locality, and the capacities provide constraints that ensure fairness. A min-cost flow technique may be used to perform an assignment of the tasks represented by the network flow graph. Thus, online task scheduling with locality may be mapped onto a network flow graph, which in turn may be used to determine a scheduling assignment using min-cost flow techniques. The costs may encode data locality, fairness, and starvation-freedom.
摘要翻译：作业调度器可以通过将运行作业中的任务分配给计算节点，同时平衡公平性和效率，来计划计算机集群中的并发分布式作业。确定分配给计算节点的任务可以使用网络流程图来执行。图的至少一些边缘上的权重编码数据位置，并且容量提供确保公平性的约束。最小成本流技术可用于执行由网络流程图表示的任务的分配。因此，具有局部性的在线任务调度可以映射到网络流程图上，网络流程图可以用于使用最小成本流技术来确定调度分配。成本可能会对数据的局部性，公平性和饥饿自由进行编码。

7. 发明申请

US20100281478A1 MULTIPHASE VIRTUAL MACHINE HOST CAPACITY PLANNING 审中-公开
标题翻译：多功能虚拟机主机容量规划
公开(公告)号：US20100281478A1
公开(公告)日：2010-11-04
申请号：US12433919
申请日：2009-05-01
申请人： Larry Jay Sauls , Sanjay Gautam , Ehud Wieder , Rina Panigrahy , Kunal Talwar
发明人： Larry Jay Sauls , Sanjay Gautam , Ehud Wieder , Rina Panigrahy , Kunal Talwar
IPC分类号： G06F9/455
CPC分类号： G06F9/5077
摘要： A virtual machine distribution system is described herein that uses a multiphase approach that provides a fast layout of virtual machines on physical computers followed by at least one verification phase that verifies that the layout is correct. During the fast layout phase, the system uses a dimension-aware vector bin-packing algorithm to determine an initial fit of virtual machines to physical hardware based on rescaled resource utilizations calculated against hardware models. During the verification phase, the system uses a virtualization model to check the recommended fit of virtual machine guests to physical hosts created during the fast layout phase to ensure that the distribution will not over-utilize any host given the overhead associated with virtualization. The system modifies the layout to eliminate any identified overutilization. Thus, the virtual machine distribution system provides the advantages of a fast, automated layout planning process with the robustness of slower, exhaustive processes.
摘要翻译：本文描述了一种虚拟机分配系统，其使用多相方法，其在物理计算机上提供虚拟机的快速布局，之后是验证布局正确的至少一个验证阶段。在快速布局阶段，系统使用维度感知向量二进制包装算法，根据硬件模型计算的重新定义的资源利用率来确定虚拟机对物理硬件的初始拟合。在验证阶段，系统使用虚拟化模型来检查虚拟机guest虚拟机对于在快速布局阶段期间创建的物理主机的推荐配置，以确保分配不会过度利用任何与虚拟化相关的开销的主机。系统修改布局以消除任何确定的过度利用。因此，虚拟机分配系统提供了快速，自动化的布局规划过程的优点，具有较慢，详尽的过程的鲁棒性。

8. 发明申请

US20080065704A1 Data and replica placement using r-out-of-k hash functions 审中-公开
标题翻译：使用r-out-of-k哈希函数的数据和复本放置
公开(公告)号：US20080065704A1
公开(公告)日：2008-03-13
申请号：US11519538
申请日：2006-09-12
申请人： John Philip MacCormick , Nicholas Murphy , Venugopalan Ramasubramanian , Ehud Wieder , Lidong Zhou , Junfeng Yang
发明人： John Philip MacCormick , Nicholas Murphy , Venugopalan Ramasubramanian , Ehud Wieder , Lidong Zhou , Junfeng Yang
IPC分类号： G06F17/30
CPC分类号： G06F16/1844
摘要： A distributed data store employs replica placement techniques in which a number k hash functions are used to compute k potential locations for a data item. A number r of the k locations are chosen for storing replicas. These replica placement techniques provide a system designer with the freedom to choose r from k, are structured in that they are determined by a straightforward functional form, and are diffuse such that the replicas of the items on one server are scattered over many other servers. The resulting storage system exhibits excellent storage balance and request load balance in the presence of incremental system expansions, server failures, and load changes. Data items may be created, read, and updated or otherwise modified.
摘要翻译：分布式数据存储器使用复制放置技术，其中使用k个哈希函数来计算数据项的k个潜在位置。选择k个位置的数目r用于存储副本。这些复制放置技术为系统设计者提供了从k选择r的自由度，其结构是由直接的功能形式确定，并且是漫反射的，使得一个服务器上的项目的副本分散在许多其他服务器上。在存在增量系统扩展，服务器故障和负载变化的情况下，最终的存储系统显示出优异的存储平衡和请求负载平衡。数据项可能被创建，读取和更新或以其他方式修改。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式