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

1. 发明申请

WO2010039833A3 APPARATUS AND METHODS OF PROVIDING AND RECEIVING VENUE LEVEL TRANSMISSIONS AND SERVICES 审中-公开
标题翻译：提供和接收场地层面传输和服务的装置和方法
公开(公告)号：WO2010039833A3
公开(公告)日：2010-07-01
申请号：PCT/US2009059029
申请日：2009-09-30
申请人： QUALCOMM INC , KRISHNAMOORTHI RAGHURAMAN , RAHATE PANKAJ V , JAIN PANKAJ , SHAH DEVARSHI P , SELIVERSTOV PAVEL A , ROTHROCK GEORGE A , KHARE NILABH , WADHWANI ANIL K , GUO JIMING , NANDA SANJIV , LING FUYUN , CHARI MURALI R , AGRAWAL AVNEESH , BURDO RINAT , KANNAN PRASANNA , MUKKAVILLI KRISHNA K , NEWMAN REYNALDO W , FAN MICHAEL M , DESHPANDE MANOJ M , JAYARAM RANJITH S
发明人： KRISHNAMOORTHI RAGHURAMAN , RAHATE PANKAJ V , JAIN PANKAJ , SHAH DEVARSHI P , SELIVERSTOV PAVEL A , ROTHROCK GEORGE A , KHARE NILABH , WADHWANI ANIL K , GUO JIMING , NANDA SANJIV , LING FUYUN , CHARI MURALI R , AGRAWAL AVNEESH , BURDO RINAT , KANNAN PRASANNA , MUKKAVILLI KRISHNA K , NEWMAN REYNALDO W , FAN MICHAEL M , DESHPANDE MANOJ M , JAYARAM RANJITH S
IPC分类号： H04W4/06 , H04L12/18 , H04L29/06 , H04L29/08 , H04N7/173 , H04W4/02
CPC分类号： H04N21/2385 , H04L12/189 , H04L67/16 , H04L67/18 , H04N21/482 , H04W4/02 , H04W4/04 , H04W48/16 , H04W72/005
摘要： A venue-cast system and method for providing and receiving venue level transmissions and services, including discovery of a venue specific transmission by receiving an overhead signal from a non-venue network, extracting information for receiving the venue specific transmission from the overhead signal, and tuning to receive the venue specific transmission based on the extracted information. The venue level transmission may be provided and received in a manner that does not prevent an access terminal from receiving a local area or wide area transmission.
摘要翻译：一种用于提供和接收场地级传输和服务的场地播放系统和方法，包括通过从非场地网络接收开销信号来发现场地特定传输，从开销信号中提取用于接收场地特定传输的信息，以及基于所提取的信息进行调谐以接收特定于场地的传输。可以以不阻止接入终端接收局域或广域传输的方式提供和接收场地级传输。

2. 发明专利

ES2408127T3 Procedimiento y sistema para seleccionar un intervalo de reposo 未知
公开(公告)号：ES2408127T3
公开(公告)日：2013-06-18
申请号：ES11163044
申请日：2007-04-27
申请人： QUALCOMM INC , DESHPANDE MANOJ M
发明人： DESHPANDE MANOJ M , MEYLAN ARNAUD , JAYARAM RANJITH S , NANDA SANJIV
IPC分类号： H04L12/12 , H04W52/02
摘要： Un procedimiento para el almacenamiento temporal de datos a entregar a un dispositivo móvil decomunicaciones (102, 234), que comprende: negociar, en un servidor (120), un intervalo de reposo con el dispositivo móvil de comunicaciones (102, 234)que está aguas abajo desde un punto de acceso (116, 232), en donde tanto el dispositivo decomunicaciones móvil (102, 234) como el punto de acceso (116, 232) están aguas abajo desde el servidor(120); almacenar temporalmente datos destinados para el dispositivo móvil de comunicaciones (102, 234) en unservidor (120); y transmitir al menos una parte de los datos almacenados en la memoria temporal al dispositivo móvil decomunicaciones (102, 234).

3. 发明申请

WO2012162479A3 ADCACHE SPACE AUCTIONS BASED ON DIFFERENTIAL CONTEXT 审中-公开
标题翻译：基于差异性背景的ADCACHE空间拍卖
公开(公告)号：WO2012162479A3
公开(公告)日：2014-01-09
申请号：PCT/US2012039305
申请日：2012-05-24
申请人： QUALCOMM INC , STEPHENS ARTHUR , JAYARAM RANJITH S , TSIRTSIS GEORGIOS , PARK VINCENT D , WU ZHIBIN
发明人： STEPHENS ARTHUR , JAYARAM RANJITH S , TSIRTSIS GEORGIOS , PARK VINCENT D , WU ZHIBIN
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0241 , G06Q30/0251 , G06Q30/0275
摘要： In some embodiments, in an exemplary advertising system multiple bidders compete for ad cache space on devices which display ads. The bidders are, e.g., advertisers, ad networks, and/or loyalty program providers. The devices which store and display the ads are, e.g., mobile and/or stationary wireless communications devices. An individual bidder is provided with contextual information that is of relevance to the individual bidder. The contextual information is about the device onto which ads may be loaded. Different bidders may be, and sometimes are, supplied with different restricted information. Various embodiments are directed to a methods and apparatus for operating an ad broker system.
摘要翻译：在一些实施例中，在示例性广告系统中，多个投标者在显示广告的设备上竞争广告缓存空间。投标人例如是广告商，广告网络和/或忠诚度计划提供者。存储和显示广告的设备是例如移动和/或固定无线通信设备。向个体投标人提供与个体投标人相关的上下文信息。上下文信息是关于可以加载广告的设备。不同的投标人可能有时候会提供不同的限制信息。各种实施例涉及用于操作广告代理系统的方法和装置。

4. 发明申请

WO2013036659A2 METHODS AND APPARATUS FOR DEMOGRAPHICS INFORMATION COLLECTION 审中-公开
标题翻译：人口学信息收集的方法和设备
公开(公告)号：WO2013036659A2
公开(公告)日：2013-03-14
申请号：PCT/US2012053986
申请日：2012-09-06
申请人： QUALCOMM INC , CORSON MATHEW SCOTT , PARK VINCENT D , VANDERVEEN MICHAELA , WU ZHIBIN , JAYARAM RANJITH S , STEPHENS ARTHUR , CHILDRESS CHARLES CULLEN
发明人： CORSON MATHEW SCOTT , PARK VINCENT D , VANDERVEEN MICHAELA , WU ZHIBIN , JAYARAM RANJITH S , STEPHENS ARTHUR , CHILDRESS CHARLES CULLEN
CPC分类号： G06Q10/00 , G06Q30/00
摘要： Various embodiments are directed to methods and apparatus which can be used to implement a system for collecting demographic information of users and/or devices in real-time or near real-time. Methods and apparatus directed to communicating and collecting demographic information via wireless signals, e.g., discovery signals, transmitted by one or more wireless devices, e.g., wireless communications devices supporting a peer to peer signaling protocol, are described. In various embodiments, at least some of the demographic information is transmitted in a secure manner. An information collection device receives demographic information transmitted by wireless communications devices, at least some of said demographic information being transmitted in a secure manner, and forwards collected demographic information to a demographic information processing system. Forwarded demographic information may include decrypted information which has been decrypted by the information collection device and/or received encrypted information which could not be decrypted by the information collection device.
摘要翻译：各种实施例涉及可用于实现用于实时或接近实时地收集用户和/或设备的人口统计信息的系统的方法和装置。描述了通过由一个或多个无线设备（例如，支持对等信令协议的无线通信设备）发送的无线信号（例如，发现信号）来传送和收集人口统计信息的方法和装置。在各种实施例中，以安全的方式传送至少一些人口统计信息。信息收集设备接收由无线通信设备发送的人口统计信息，至少一些所述人口统计信息以安全的方式发送，并将收集的人口统计信息转发到人口信息处理系统。转发的人口统计信息可以包括由信息收集装置解密的解密信息和/或接收到的信息收集装置无法解密的加密信息。

5. 发明申请

WO2010056936A3 NETWORK NODES AND METHODS FOR DATA AUTHORIZATION IN DISTRIBUTED STORAGE NETWORKS 审中-公开
标题翻译：用于分布式存储网络中的数据授权的网络编号和方法
公开(公告)号：WO2010056936A3
公开(公告)日：2010-11-11
申请号：PCT/US2009064301
申请日：2009-11-13
申请人： QUALCOMM INC , DONDETI LAKSHMINATH R , JAYARAM RANJITH S , NARAYANAN VIDYA
发明人： DONDETI LAKSHMINATH R , JAYARAM RANJITH S , NARAYANAN VIDYA
IPC分类号： H04L29/06
CPC分类号： H04L67/104 , H04L63/0823 , H04L67/1065 , H04L67/1076
摘要： Storage authorization and access control of data stored on a peer-to-peer overlay network is provided. A publishing node (502) stores data on a storage node (506) in the overlay network. The publishing node (502) is adapted to facilitate data storage authorization by generating a resource identifier (516) as a function of a usage string associated with a data type' to be stored. A storage request (504) is generated that includes the resource identifier (516) and data to be stored (518). The storage request may be sent to the storage node (506). The storage device (506) receives the storage request (504) sent by a publishing node (502), including a resource identifier (516) and data to be stored (518). Independent storage authorization is performed by the storage node (506) at an overlay level by verifying (510, 512) the resource identifier. The data in the storage request is stored at the storage node if the resource identifier is successfully verified.
摘要翻译：提供存储在对等覆盖网络上的数据的存储授权和访问控制。发布节点（502）将数据存储在覆盖网络中的存储节点（506）上。出版节点（502）适于通过根据与要存储的数据类型相关联的使用字符串的生成资源标识符（516）来促进数据存储授权。生成包括资源标识符（516）和要存储的数据（518）的存储请求（504）。存储请求可以被发送到存储节点（506）。存储装置（506）接收由发布节点（502）发送的包括资源标识符（516）和要存储的数据（518）的存储请求（504）。通过验证（510,512）资源标识符，由存储节点（506）在覆盖级别执行独立存储授权。如果资源标识符被成功验证，则存储请求中的数据被存储在存储节点处。

6. 发明申请

WO2010099492A3 METHOD AND APPARATUS FOR DETERMINING A SIZE OF A PEER TO PEER OVERLAY WORK 审中-公开
标题翻译：用于确定同型号重叠尺寸的方法和装置
公开(公告)号：WO2010099492A3
公开(公告)日：2010-10-21
申请号：PCT/US2010025665
申请日：2010-02-26
申请人： QUALCOMM INC , DAS SAUMITRA M , NARAYANAN VIDYA , DONDETI LARKSHMINATH R , JAYARAM RANJITH S
发明人： DAS SAUMITRA M , NARAYANAN VIDYA , DONDETI LARKSHMINATH R , JAYARAM RANJITH S
IPC分类号： H04L29/06 , H04L12/24 , H04L29/08
CPC分类号： H04L41/12 , H04L67/104 , H04L67/1044
摘要： Methods and apparatus for enhanced overlay state maintenance in a peer-to- peer overlay network. A first method includes inferring that a first node is leaving the overlay network, and transmitting a decrement message to decrement a size counter value. A second method includes identifying a set of nodes associated with a first node of an overlay network, obtaining a segment length associated with each node of the set of nodes, and determining a size of the overlay network by dividing the total number of nodes in the set of nodes by the sum of the segment lengths. A third method includes identifying a set of nodes associated with a first node of an overlay network, obtaining a size estimate associated with the first node and with each node of the set of nodes, and determining a size of the overlay network by averaging the size estimates.
摘要翻译：在对等覆盖网络中增强覆盖状态维护的方法和装置。第一种方法包括推断第一个节点正在离开覆盖网络，并发送递减消息来减小大小计数器值。第二种方法包括标识与覆盖网络的第一节点相关联的一组节点，获得与节点集合中的每个节点相关联的分段长度，以及通过划分覆盖网络中的节点总数来确定覆盖网络的大小节点集合的段长度之和。第三种方法包括识别与覆盖网络的第一节点相关联的一组节点，获得与该第一节点和该节点集合中的每个节点相关联的大小估计，以及通过对该覆盖网络的大小进行平均来确定覆盖网络的大小估计。

7. 发明申请

WO2010105106A3 METHODS AND APPARATUS FOR MERGING PEER-TO-PEER OVERLAY NETWORKS 审中-公开
标题翻译：用于合并对等覆盖网络的方法和设备
公开(公告)号：WO2010105106A3
公开(公告)日：2010-11-04
申请号：PCT/US2010027051
申请日：2010-03-11
申请人： QUALCOMM INC , DAS SAUMITRA MOHAN , DONDETI LAKSHMINATH R , NARAYANAN VIDYA , JAYARAM RANJITH S
发明人： DAS SAUMITRA MOHAN , DONDETI LAKSHMINATH R , NARAYANAN VIDYA , JAYARAM RANJITH S
IPC分类号： H04L29/08
CPC分类号： H04L67/104 , H04L67/1042 , H04L67/1044 , H04L67/1046 , H04L67/1059
摘要： Methods and apparatus for merging peer-to-peer overlay networks. A method includes receiving an advertisement from a second overlay network, determining a size of the second overlay network, performing a self search on the second overlay network based on a persistent node identifier, if the size of the second overlay network is greater than the size of a first overlay network, and joining the second overlay network if the persistent node identifier is not part of the second overlay network. An apparatus includes a transceiver to receive an advertisement from a second overlay network, and a processor coupled to the transceiver to determine a size of the second overlay network, perform a self search on the second overlay network based on a persistent node identifier, and join the second overlay network if the persistent node identifier is not part of the second overlay network.
摘要翻译：用于合并对等覆盖网络的方法和设备。一种方法包括：从第二覆盖网络接收广告;确定第二覆盖网络的大小;如果第二覆盖网络的大小大于大小，则基于持久节点标识符在第二覆盖网络上执行自搜索如果所述永久节点标识符不是所述第二覆盖网络的一部分，则加入所述第二覆盖网络。一种装置包括：收发器，用于从第二覆盖网络接收广告;以及处理器，耦合到收发器以确定第二覆盖网络的大小，基于永久节点标识符在第二覆盖网络上执行自搜索，如果所述永久节点标识符不是所述第二覆盖网络的一部分，则所述第二覆盖网络。

8. 发明申请

WO2009155568A3 METHODS AND APPARATUS FOR REDUCING THE EFFECTIVENESS OF CHOSEN LOCATION ATTACKS IN A PEER-TO-PEER OVERLAY NETWORK 审中-公开
标题翻译：降低对等重叠网络中位置攻击有效性的方法和设备
公开(公告)号：WO2009155568A3
公开(公告)日：2010-03-11
申请号：PCT/US2009048046
申请日：2009-06-19
申请人： QUALCOMM INC , HARDIE EDWARD T L , DONDETI LAKSHMINATH R , JAYARAM RANJITH S , NARAYANAN VIDYA
发明人： HARDIE EDWARD T L , DONDETI LAKSHMINATH R , JAYARAM RANJITH S , NARAYANAN VIDYA
IPC分类号： H04L29/06 , H04L29/08
CPC分类号： H04L63/126 , H04L63/1416 , H04L67/104 , H04L67/1044
摘要： Methods and apparatus for reducing the effectiveness of chosen location attacks in a peer-to-peer overlay network. A method includes determining that new node identifiers are to be generated for a plurality of nodes in the network, inputting parameters to a hash function to generate a selected node identifier, and adopting a location in the network associated with the selected node identifier. Another method includes receiving a node identifier associated with a selected node, inputting parameters associated with the selected node to a hash function to generate a corresponding node identifier, comparing the node identifier with the corresponding node identifier, and determining that the selected node is a potential attacker if the node identifiers do not match. Another method includes detecting responsibility for initiating an update to one or more node identifiers, generating parameters to generate the node identifiers, and transmitting the parameters on the network.
摘要翻译：降低对等覆盖网络中选定位置攻击有效性的方法和装置。一种方法包括确定将为网络中的多个节点生成新的节点标识符，向哈希函数输入参数以生成所选择的节点标识符，以及采用与所选节点标识符相关联的网络中的位置。另一种方法包括接收与所选节点相关联的节点标识符，将与所选节点相关联的参数输入到散列函数以生成对应的节点标识符，将节点标识符与对应的节点标识符进行比较，以及确定所选择的节点是潜在的攻击者如果节点标识符不匹配。另一种方法包括检测发起对一个或多个节点标识符的更新的责任，生成参数以生成节点标识符，以及在网络上发送参数。

9. 发明申请

WO2013036653A2 AD CACHE MAINTENANCE METHODS AND APPARATUS 审中-公开
标题翻译： AD缓存维护方法和设备
公开(公告)号：WO2013036653A2
公开(公告)日：2013-03-14
申请号：PCT/US2012053979
申请日：2012-09-06
申请人： QUALCOMM INC , CORSON MATHEW SCOTT , PARK VINCENT D , STEPHENS ARTHUR , JAYARAM RANJITH S , TSIRTSIS GEORGIOS , VANDERVEEN MICHAELA , CHILDRESS CHARLES CULLEN
发明人： CORSON MATHEW SCOTT , PARK VINCENT D , STEPHENS ARTHUR , JAYARAM RANJITH S , TSIRTSIS GEORGIOS , VANDERVEEN MICHAELA , CHILDRESS CHARLES CULLEN
CPC分类号： G06Q30/0241
摘要： Methods and apparatus relating to ad cache maintenance, e.g., determining when ad cache replenishment should occur, replenishing ad cache content and/or updating the content of an ad cache, on a device which supports the presentation of advertisements (ads) are described. Signals are received by a first device including an ad cache. The signals are received from other devices, e.g., devices in the direct wireless communications range of the first device. Received signals are processed and provide context information, e.g., information about the surrounding, services available, stores in the region, etc., in which the first device receiving the signals is at a given point in time. Context information is stored. As new context information is generated from received signals the newly generated set of context information is compared to a previously generated set of context information. Changes in context information are detected and used in performing ad cache maintenance operations.
摘要翻译：描述了与支持广告（广告）呈现的设备相关的广告高速缓存维护的方法和装置，例如确定何时应该发生广告高速缓存补充，补充广告缓存内容和/或更新广告高速缓存的内容。信号由包括广告高速缓存的第一设备接收。信号从其他设备接收，例如在第一设备的直接无线通信范围内的设备。接收的信号被处理并且提供上下文信息，例如关于周围的信息，可用的服务，在区域中的存储等，其中接收信号的第一设备处于给定时间点。存储上下文信息。随着从接收信号生成新的上下文信息，将新生成的上下文信息集合与先前生成的上下文信息集进行比较。在执行广告缓存维护操作时检测并使用上下文信息的更改。

10. 发明申请

WO2010075338A3 SECURE NODE IDENTIFIER ASSIGNMENT IN A DISTRIBUTED HASH TABLE FOR PEER-TO-PEER NETWORKS 审中-公开
标题翻译：安全的节点标识符分配在对等网络的分布式散列表中
公开(公告)号：WO2010075338A3
公开(公告)日：2010-10-07
申请号：PCT/US2009069113
申请日：2009-12-22
申请人： QUALCOMM INC , XIAO LU , NARAYANAN VIDYA , HARDIE EDWARD THOMAS LINGHAM , JAYARAM RANJITH S , SUBRAMANIAN RAMACHANDRAN , DONDETI LAKSHMINATH REDDY
发明人： XIAO LU , NARAYANAN VIDYA , HARDIE EDWARD THOMAS LINGHAM , JAYARAM RANJITH S , SUBRAMANIAN RAMACHANDRAN , DONDETI LAKSHMINATH REDDY
IPC分类号： H04L29/06 , H04L29/12
CPC分类号： H04L63/126 , H04L63/1458 , H04L63/1466 , H04L67/104 , H04L67/1046 , H04L67/1057 , H04L2463/142
摘要： A multi-party commitment method is provided whereby a joining node uses contributions provided by contributor nodes in a peer-to-peer overlay network to generate a node identifier. The joining node generates a first contribution and sends a join request to an introducer node (or a plurality of contributor nodes), where the join request seeks to obtain one or more contributions for generating the node identifier within an identifier space of the overlay network. A hash of the first contribution may be included as part of the join request. In response, the joining node may receive a plurality of contributions, wherein the contributions are bound to each other and the first contribution by a prior external multi-node commitment operation. The joining node can then generate its node identifier as a function of the first contribution and the received contributions. Consequently, collusion between nodes and malicious manipulation during ID generation can be frustrated.
摘要翻译：提供多方承诺方法，由此加入节点使用由对等覆盖网络中的贡献者节点提供的贡献来生成节点标识符。加入节点生成第一贡献并向引导者节点（或多个贡献者节点）发送加入请求，其中加入请求试图获得用于在覆盖网络的标识符空间内生成节点标识符的一个或多个贡献。第一个贡献的散列可以作为加入请求的一部分包含在内。作为响应，加入节点可以接收多个贡献，其中贡献彼此相关并且第一贡献通过先前的外部多节点承诺操作。随后加入节点可以根据第一贡献和接收到的贡献生成其节点标识符。因此，ID生成期间节点之间的串通和恶意操作可能会受挫。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式