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

1. 发明申请

WO2012126535A1 REPLICATING DATA 审中-公开
标题翻译：更换数据
公开(公告)号：WO2012126535A1
公开(公告)日：2012-09-27
申请号：PCT/EP2011/063230
申请日：2011-08-01
申请人： THOMSON LICENSING , MASSOULIE, Laurent , IOANNIDIS, Efstratios , ZHOU, Xia
发明人： MASSOULIE, Laurent , IOANNIDIS, Efstratios , ZHOU, Xia
IPC分类号： H04L29/08
CPC分类号： H04L67/02 , G06F17/30206 , G06F17/30209 , H04L67/104 , H04L67/1095 , H04W4/80 , H04W8/005 , H04W84/18
摘要： The present invention concerns the replication of data, in particular the replication of data in a peer-to-peer network of mobile devices. Each device stores a plurality of data items. When two devices come into range, a decision as to whether to replicate a data item is made in dependence the extent to which that data item has been requested by other devices, and (b) the extent to which that data item is replicated on other devices. In this way, both the demand and supply of a data item are taken into account.
摘要翻译：本发明涉及数据的复制，特别是数据在移动设备的对等网络中的复制。每个设备存储多个数据项。当两个设备进入范围时，根据数据项是否被其他设备请求的程度决定是否复制数据项，以及（b）该数据项被复制在其他设备上的程度设备。这样就可以考虑数据项的需求和供应。

2. 发明申请

WO2012116763A1 SEARCHING 审中-公开
标题翻译：正在搜索
公开(公告)号：WO2012116763A1
公开(公告)日：2012-09-07
申请号：PCT/EP2011/063213
申请日：2011-08-01
申请人： THOMSON LICENSING , MASSOULIE, Laurent , IOANNIDIS, Efstratios , KARBASI, Amin
发明人： MASSOULIE, Laurent , IOANNIDIS, Efstratios , KARBASI, Amin
IPC分类号： G06F17/30
CPC分类号： G06F17/30967 , G06F17/30244
摘要： The present invention relates to searching, in particular guided searching through a database of stored objects. A user is presented with proposals of objects and is invited to select the objects she considers closest to the intended objective of her search. One of the presented objects that is not selected is then replaced with a different object and the user is invited to make a fresh selection. The procedure is repeated iteratively until the user is satisfied with the result. The choice of replacement object is made taking into account the users previous choices, thereby improving the efficacy of the search.
摘要翻译：本发明涉及搜索特别是通过存储对象的数据库进行引导搜索。用户被呈现给对象的提案，并且被邀请选择她认为与她搜索的预期目标最接近的对象。其中一个被选择的对象然后被替换为不同的对象，并且邀请用户做出新的选择。该过程重复地重复，直到用户对结果满意为止。替换对象的选择是考虑到用户以前的选择，从而提高搜索的功效。

3. 发明申请

WO2013169968A1 COMPARISON-BASED ACTIVE SEARCHING/LEARNING 审中-公开
标题翻译：基于比较的主动搜索/学习
公开(公告)号：WO2013169968A1
公开(公告)日：2013-11-14
申请号：PCT/US2013/040248
申请日：2013-05-09
申请人： THOMSON LICENSING , IOANNIDIS, Efstratios , MASSOULIE, Laurent
发明人： IOANNIDIS, Efstratios , MASSOULIE, Laurent
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , G06F17/3002 , G06F17/30023 , G06N99/005
摘要： A method is provided for performing a content search through comparisons, where a user is presented with two candidate objects and reveals which is closer to the user's intended target object. The disclosed principles provide active strategies for finding the user's target with few comparisons. The so-called rank-net strategy for noiseless user feedback is described. For target distributions with a bounded doubling constant, rank-net finds the target in a number of steps close to the entropy of the target distribution and hence of the optimum. The case of noisy user feedback is also considered. In that context a variant of rank-nets is also described, for which performance bounds within a slowly growing function (doubly logarithmic) of the optimum are found. Nu-merical evaluations on movie datasets show that rank-net matches the search efficiency of generalized binary search while incurring a smaller computational cost.
摘要翻译：提供了一种用于通过比较来执行内容搜索的方法，其中向用户呈现两个候选对象，并且揭示哪个更靠近用户的预期目标对象。所公开的原则提供了用于通过少量比较来查找用户的目标的主动策略。描述了所谓的无噪声用户反馈的排序策略。对于具有有限倍增常数的目标分布，等级网在接近目标分布熵的几个步骤中找到目标，因此找到目标。还会考虑用户反馈异常的情况。在这种情况下，还描述了排序网格的变体，其中找到了最优的缓慢增长函数（双对数）的性能界限。电影数据集的动词评估表明，排序网匹配广义二叉搜索的搜索效率，同时导致较小的计算成本。

4. 发明申请

WO2011080138A1 RECOMMENDING CONTENT 审中-公开
标题翻译：推荐内容
公开(公告)号：WO2011080138A1
公开(公告)日：2011-07-07
申请号：PCT/EP2010/070232
申请日：2010-12-20
申请人： THOMSON LICENSING , MASSOULIE, Laurent , IOANNIDIS, Efstratios
发明人： MASSOULIE, Laurent , IOANNIDIS, Efstratios
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , G06F3/048
摘要： A method for recommending content items to a user is provided. It includes: (i) receiving one of at least an acceptance input and a rejection input from a user in relation to content presented to the user; (ii) in response to an acceptance input, rendering the presented content, or in response to a rejection input, selecting fresh content for presentation; and, (iii) repeating steps (i) and (ii) until a acceptance input is received. Content is selected in dependence on a associated probability associated with that content. The probability is increased in response to an acceptance input, the increase being determined in part on a measure of a predicted reduction in user satisfaction that would be associated with an additional rejection input.
摘要翻译：提供了一种向用户推荐内容的方法。它包括：（i）相对于呈现给用户的内容，从用户接收至少一个接受输入和拒绝输入; （ii）响应于接受输入，呈现呈现的内容，或响应于拒绝输入，选择新的内容进行呈现; 和（iii）重复步骤（i）和（ii），直到收到接受输入。根据与该内容相关联的相关概率来选择内容。响应于接受输入而增加概率，该增加部分地取决于与另外的拒绝输入相关联的预测的用户满意度降低的度量。

5. 发明申请

WO2013119626A1 INTERACTIVE CONTENT SEARCH USING COMPARISONS 审中-公开
标题翻译：使用比较搜索的互动内容
公开(公告)号：WO2013119626A1
公开(公告)日：2013-08-15
申请号：PCT/US2013/024881
申请日：2013-02-06
申请人： TECHNICOLOR USA, INC. , MASSOULIE, Laurent , IOANNIDIS, Efstratios
发明人： MASSOULIE, Laurent , IOANNIDIS, Efstratios
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , G06F17/30017 , G06F17/30244
摘要： In interactive content search through comparisons, a search for a target object in a database is performed by finding the object most similar to the target from a small list of objects. A new object list is then presented based on the earlier selections. This process is repeated until the target is included in the list presented, at which point the search terminates. A solution to the interactive content search problem is provided under the scenario of heterogeneous demand, where target objects are selected from a non-uniform probability distribution. It has been assumed that objects are embedded in a doubling metric space which is fully observable to the search algorithm. Based on these assumptions, an efficient comparison-based search method is provided whose cost in terms of the number of queries can be bounded by the doubling constant of the embedding c , and the entropy of demand distribution, H . More precisely, the present principles show that the average search costs scales C F = O(c 5 H) , which improves upon the previously best known bound and is order optimal for constant c .
摘要翻译：在通过比较的交互式内容搜索中，通过从小的对象列表中找到与目标最相似的对象来执行数据库中的目标对象的搜索。然后基于先前的选择来呈现新的对象列表。重复该过程直到目标被包括在所呈现的列表中，此时搜索终止。在异构需求的场景下提供了交互式内容搜索问题的解决方案，其中从不均匀的概率分布中选择目标对象。已经假设对象被嵌入在搜索算法中完全可观察到的加倍度量空间中。基于这些假设，提供了一种有效的基于比较的搜索方法，其查询数量的成本可以由嵌入c的倍增常数和需求分布熵H限制。更准确地说，本原理显示平均搜索成本缩放CF = O（c 5 H），其改善了先前最为已知的界限，并且对于常数c是顺序优化的。

6. 发明申请

WO2013165472A1 CONTROLLING PEER SOJOURN TIME IN FILE SHARING SYSTEMS 审中-公开
标题翻译：在文件共享系统中控制对等时间
公开(公告)号：WO2013165472A1
公开(公告)日：2013-11-07
申请号：PCT/US2012/071698
申请日：2012-12-27
申请人： THOMSON LICENSING , IOANNIDIS, Stratis , HEGDE, Nidhi , MASSOULIE, Laurent , ZHU, Ji
发明人： IOANNIDIS, Stratis , HEGDE, Nidhi , MASSOULIE, Laurent , ZHU, Ji
IPC分类号： H04L29/08 , H04L12/26
CPC分类号： H04L67/104 , H04L41/0893 , H04L41/0896 , H04L67/06 , H04L67/1063 , H04L67/108
摘要： A method for controlling the average time a peer spends in a swarm of peers in a file sharing system includes first establishing an autonomous mode of operation in the swarm of peers. In the autonomous mode, peers communicate only with other peers in their swarm in order to gain access to pieces of a desired file. If the swarm size meets a threshold size, then the file sharing system switches to a universal mode. In a universal mode, peers from one swarm are permitted to exchange desired file pieces with other peers in other swarms. If the desired files pieces held by peers within a swarm meets a threshold number, then the file sharing system transitions back to the autonomous mode of operation.
摘要翻译：用于控制对等体在文件共享系统中的一群对等体中花费的平均时间的方法包括首先在对等体群中建立自主的操作模式。在自主模式中，对等体仅与其群中的其他对等体进行通信，以便获得对所需文件的访问。如果群体大小满足阈值大小，则文件共享系统切换到通用模式。在通用模式中，允许来自一个群的对等体与其他群组中的其他对等体交换所需的文件。如果群集中的对等体保持的期望的文件片段满足阈值数目，则文件共享系统转换回自主操作模式。

7. 发明申请

WO2012126855A2 GESTION CENTRALISEE DE L'ALIMENTATION EN ENERGIE D'UNE PLURALITE DE RESEAUX LOCAUX D'ENERGIE 审中-公开
标题翻译：将电力供应集中管理到多个地方电力网络
公开(公告)号：WO2012126855A2
公开(公告)日：2012-09-27
申请号：PCT/EP2012/054722
申请日：2012-03-16
申请人： THOMSON LICENSING , MASSOULIE, Laurent , KESHAV, Srinivasan , HEGDE, Nidhi , SALONIDIS, Theodoros
发明人： MASSOULIE, Laurent , KESHAV, Srinivasan , HEGDE, Nidhi , SALONIDIS, Theodoros
IPC分类号： H02J3/00
CPC分类号： H02J9/00 , H02J3/008 , H02J3/28 , H02J3/32 , H02J7/34 , H02J2003/146 , Y02E60/721 , Y04S10/126 , Y04S50/10 , Y10T307/344
摘要： L'invention concerne un système de gestion de l'alimentation en énergie d'un nombre n de réseaux (DEN i ) locaux d'énergie où n≥2 et 1≤ i ≤n, chaque réseau (DEN i ) local d'énergie comportant au moins un dispositif client (DCL DENi ). Ledit système comporte un dispositif (COM DENi ) de commutation connecté à chaque réseau (DEN i ), un moyen (PSD DENi ) de stockage d'énergie, et une station (SUB) pour alimenter en énergie les n réseaux (DEN i ) au travers des dispositifs (COM DENi ) de commutation, la station (SUB) recevant l'énergie d'un système d'alimentation (PSO), et la station (SUB) est configurée pour déterminer et assigner à chaque dispositif (COM DENi ) de commutation : un premier mode dans lequel le moyen (PSD DENi ) de stockage d'énergie fournit de l'énergie audit réseau (DEN i ); ou un second mode dans lequel la station (SUB) fournit de l'énergie simultanément audit réseau (DEN i ) et audit moyen (PSD DENi ) de stockage d'énergie.
摘要翻译：本发明涉及一种用于管理向n个本地电力网络（DENi）供电的系统，其中n = 2和1 = i = n，每个本地电力网络（DENi）包括至少一个客户端设备（DCLDENi ）。所述系统包括连接到每个网络（DENi）的交换设备（COMDENi），电力存储装置（PSDDENi）和用于通过交换设备（COMDENi）向n个网络（DENi）供电的站（SUB）（SUB）从电源系统（PSO）接收电力，并且所述站（SUB）被配置为确定并分配给每个开关装置（COMDENi）：第一模式，其中所述蓄电装置（PSDDENi）供电到网络（DENi）; 或第二模式，其中站（SUB）同时向所述网络（DENi）和所述蓄电装置（PSDDENi）供电。

8. 发明申请

WO2011029936A1 DISTRIBUTED FLOW MECHANISM FOR PEER-TO-PEER STREAMING 审中-公开
标题翻译：分布式流动机制，用于同行流
公开(公告)号：WO2011029936A1
公开(公告)日：2011-03-17
申请号：PCT/EP2010/063402
申请日：2010-09-13
申请人： THOMSON LICENSING , MASSOULIE, Laurent , TOMOZEI, Dan-Cristian
发明人： MASSOULIE, Laurent , TOMOZEI, Dan-Cristian
IPC分类号： H04L12/56
CPC分类号： H04L47/10 , H04L45/64 , H04L47/12 , H04L47/17 , H04L47/25 , H04L47/263 , H04L47/30 , H04L67/104 , H04L67/1085 , Y02D50/10
摘要： The invention concerns a method for flow control in a peer-to-peer live streaming communication network comprising a plurality of nodes (i, j,..., N), characterized in that the rate at which a node (i) sends information to another node (j) increases proportionally to the quantity of information present at node (i) which has not yet reached node (j) and decreases proportionally to a value (V) attached to the link connecting node (i) to node (j).
摘要翻译：本发明涉及一种包括多个节点（i，j，...，N）的对等直播流传输通信网络中的流控制的方法，其特征在于，节点（i）发送信息的速率到另一节点（j）与尚未到达节点（j）的节点（i）处存在的信息量成比例地增加，并且与附接到链路连接节点（i）到节点（j）的值（V）成比例地减小）。

9. 发明申请

WO2010108886A2 DEVICE AND METHOD FOR CONTROLLING DISSEMINATION OF CONTENT DATA BETWEEN PEERS IN A P2P MODE, BY USING A TWO-LEVEL RANDOMIZED PEER OVERLAY AND A DYNAMIC UNCHOKE MECHANISM 审中-公开
标题翻译：通过使用两级随机对等体和动态消除机制来控制P2P模式中的对等体之间的内容数据的发送的装置和方法
公开(公告)号：WO2010108886A2
公开(公告)日：2010-09-30
申请号：PCT/EP2010/053697
申请日：2010-03-22
申请人： THOMSON LICENSING , PICCONI, Fabio , MASSOULIE, Laurent , VARVELLO, Matteo
发明人： PICCONI, Fabio , MASSOULIE, Laurent , VARVELLO, Matteo
IPC分类号： H04L29/08
CPC分类号： H04L67/104 , H04L67/1059
摘要： A method is intended for controlling dissemination of content data in a peer-to- peer mode between peers (P1-P16) connected to different communication networks (N1-N3). This method comprises the steps of: i) building, for each peer, a first peer set comprising active peers that are primary connected neighbours close to this peer in terms of network cost and a second peer set comprising active peers that are secondary connected neighbours of this peer, chosen at random irrespectively of network cost, and ii) dynamically determining into each peer a capacity of content data it is ready to receive from peers of the second peer set, taking into account its current capacity to receive content data from peers of the first peer set, in order to optimize the peer-to-peer dissemination of the content data.
摘要翻译：一种方法用于控制连接到不同通信网络（N1-N3）的对等体（P1-P16）之间的对等模式中的内容数据的传播。该方法包括以下步骤：i）针对每个对等体，构建包括主动对等体的第一对等体，所述主动对等体是网络成本方面的靠近该对等体的主要连接的邻居;以及包括主动对等体的第二对等体，所述主动对等体是次要连接的邻居该对等体随机选择，而不考虑网络成本，以及ii）动态地确定每个对等体具有准备从第二对等体的对等体接收的内容数据的容量，同时考虑其当前接收来自对等体的内容数据的容量第一个对等设置，以便优化内容数据的点对点传播。

10. 发明申请

WO2010020524A2 DEVICES, SYSTEM AND METHOD FOR COMPUTING AN OPTIMAL FAMILY OF K N-DIMENSIONAL VECTORS OF CONTENT INJECTION RATES FOR USER COMMUNICATION EQUIPMENTS 审中-公开
标题翻译：用于计算用户通信设备的内容注入率的K维N维度向量的最优系统的装置，系统和方法
公开(公告)号：WO2010020524A2
公开(公告)日：2010-02-25
申请号：PCT/EP2009/059684
申请日：2009-07-27
申请人： THOMSON LICENSING , CHAINTREAU, Augustin , IOANNIDIS, Stratis , MASSOULIE, Laurent , KWONG, Kin-wah
发明人： CHAINTREAU, Augustin , IOANNIDIS, Stratis , MASSOULIE, Laurent , KWONG, Kin-wah
IPC分类号： H04L29/06
CPC分类号： H04L67/104 , H04L67/1068 , H04L67/108
摘要： A method is intended for computing an optimal family of K n-dimensional vectors of injection rates (I) of K contents for n users comprising communication equipments (CE 1 -CE 3 ) coupled to a communication network (CN), with K ≥ 1. This method comprises the steps of: i) determining the gradients of K objective functions (f(I)) each representative of n expectations of a non-increasing utility function (h i (Y i )) depending on a value representative of the age (Y i ) of availability of one of the K contents into a user communication equipment (CE i ), and ii) applying a gradient descent algorithm to these objective function gradients to determine the optimal family of K n-dimensional vectors of injection rates (I) of K contents.
摘要翻译：一种方法用于计算包括与通信网络（CN）耦合的通信设备（CE1-CE3）的n个用户的K个内容的K个维度向量的最佳族，其中K = 1。方法包括以下步骤：i）根据代表年龄（Yi）的值，确定每个代表不增加效用函数（hi（Yi））的n个期望的K个目标函数（f（I））的梯度将K个内容之一的可用性提供到用户通信设备（CEi）中，以及ii）对这些目标函数梯度应用梯度下降算法，以确定K个内容的注入速率（I）的K个维度向量的最佳族。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式