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

1. 发明授权

US07685200B2 Ranking and suggesting candidate objects 有权
标题翻译：排名和建议候选对象
公开(公告)号：US07685200B2
公开(公告)日：2010-03-23
申请号：US11681031
申请日：2007-03-01
申请人： Dinan Gunawardena , Milan Vojnović , Richard James Cruise , Peter Marbach
发明人： Dinan Gunawardena , Milan Vojnović , Richard James Cruise , Peter Marbach
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： A method of ranking and suggesting objects, such as tags, is described in which a group of objects are suggested to a user in relation to a particular information object, such as a web page or file. A user either selects one of the suggestions or enters an alternative object and on receipt of data identifying the particular object selected by the user, the group of suggestions is updated based on whether the object selected by the user was one of the suggestions or not. The updating of the group may also be based on other factors, such as ranking parameters associated with each of the objects.
摘要翻译：描述了对诸如标签的对象进行排名和建议的方法，其中向特定信息对象（例如网页或文件）向用户建议一组对象。用户选择建议之一或输入替代对象，并且在接收到识别由用户选择的特定对象的数据时，基于用户选择的对象是否是建议之一来更新建议组。组的更新也可以基于其他因素，例如与每个对象相关联的排名参数。

2. 发明申请

US20080215583A1 Ranking and Suggesting Candidate Objects 有权
标题翻译：排名和建议候选对象
公开(公告)号：US20080215583A1
公开(公告)日：2008-09-04
申请号：US11681031
申请日：2007-03-01
申请人： Dinan Gunawardena , Milan Vojnovic , Richard James Cruise , Peter Marbach
发明人： Dinan Gunawardena , Milan Vojnovic , Richard James Cruise , Peter Marbach
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： A method of ranking and suggesting objects, such as tags, is described in which a group of objects are suggested to a user in relation to a particular information object, such as a web page or file. A user either selects one of the suggestions or enters an alternative object and on receipt of data identifying the particular object selected by the user, the group of suggestions is updated based on whether the object selected by the user was one of the suggestions or not. The updating of the group may also be based on other factors, such as ranking parameters associated with each of the objects.
摘要翻译：描述了对诸如标签的对象进行排名和建议的方法，其中向特定信息对象（例如网页或文件）向用户建议一组对象。用户选择建议之一或输入替代对象，并且在接收到识别由用户选择的特定对象的数据时，基于用户选择的对象是否是建议之一来更新建议组。组的更新也可以基于其他因素，例如与每个对象相关联的排名参数。

3. 发明授权

US08830792B2 Mobile device localization using audio signals 有权
标题翻译：移动设备本地化使用音频信号
公开(公告)号：US08830792B2
公开(公告)日：2014-09-09
申请号：US13089033
申请日：2011-04-18
申请人： Stuart Taylor , Timothy Regan , Philip Gosset , Dinan Gunawardena , Eno Thereska
发明人： Stuart Taylor , Timothy Regan , Philip Gosset , Dinan Gunawardena , Eno Thereska
IPC分类号： G01S3/80 , G01S5/18
CPC分类号： G01S3/8006 , G01S5/18 , H04W64/00
摘要： Mobile device localization using audio signals is described. In an example, a mobile device is localized by receiving a first audio signal captured by a microphone located at the mobile device and a second audio signal captured from a further microphone. A correlation value between the first audio signal and second audio signal is computed, and this is used to determine whether the mobile device is in proximity to the further microphone. In one example, the mobile device can receive the audio signals from the further microphone and calculate the correlation value. In another example, a server can receive the audio signals from the mobile device and the further microphone and calculate the correlation value. In examples, the further microphone can be a fixed microphone at a predetermined location, or the further microphone can be a microphone located in another mobile device.
摘要翻译：描述使用音频信号的移动设备定位。在一个示例中，通过接收由位于移动设备处的麦克风捕获的第一音频信号和从另一个麦克风捕获的第二音频信号来定位移动设备。计算第一音频信号和第二音频信号之间的相关值，并且这用于确定移动设备是否位于另外的麦克风附近。在一个示例中，移动设备可以从另外的麦克风接收音频信号并计算相关值。在另一示例中，服务器可以从移动设备和另外的麦克风接收音频信号，并计算相关值。在示例中，另外的麦克风可以是预定位置处的固定麦克风，或者另外的麦克风可以是位于另一移动设备中的麦克风。

4. 发明申请

US20110013516A1 Control of Background Data Transfers 有权
标题翻译：背景数据传输的控制
公开(公告)号：US20110013516A1
公开(公告)日：2011-01-20
申请号：US12503657
申请日：2009-07-15
申请人： Richard John Black , Dinan Gunawardena , Peter Key , Gregory O'Shea
发明人： Richard John Black , Dinan Gunawardena , Peter Key , Gregory O'Shea
IPC分类号： H04L12/26
CPC分类号： H04L43/0888 , H04L43/0864 , H04L67/32 , H04L69/16 , H04L69/163
摘要： Control of background data transfers is described. In an embodiment, a background data transfer is controlled at a receiver node by measuring a time period taken to receive from a sender node a data sequence of the same size as a receive window. The time period is used to evaluate available network capacity, and the network capacity used to calculate a new window size. The new window size is applied and communicated to the sender node. In another embodiment, a background data transfer is controlled at a receiver node by measuring a quantity of data received from a sender node during a first control interval. The measured quantity is used to evaluate available network capacity, and the network capacity used to calculate a new receive window size and a second control interval duration. The new window size is applied for the second control interval, and communicated to the sender node.
摘要翻译：描述背景数据传输的控制。在一个实施例中，通过测量从发送者节点接收与接收窗口相同大小的数据序列所需的时间间隔，在接收机节点处控制背景数据传输。该时间段用于评估可用网络容量，以及用于计算新窗口大小的网络容量。新窗口大小被应用并传送给发送者节点。在另一实施例中，通过在第一控制间隔期间测量从发送器节点接收的数据量，在接收器节点处控制背景数据传送。测量的数量用于评估可用的网络容量，以及用于计算新的接收窗口大小和第二个控制间隔持续时间的网络容量。新窗口大小应用于第二个控制间隔，并传送给发送者节点。

5. 发明授权

US08886731B2 Decentralized relaying algorithm for mobile devices 有权
标题翻译：移动设备的分散中继算法
公开(公告)号：US08886731B2
公开(公告)日：2014-11-11
申请号：US13150535
申请日：2011-06-01
申请人： Dinan Gunawardena , Thomas Karagiannis , Alexandre Proutiere , Milan Vojnovic
发明人： Dinan Gunawardena , Thomas Karagiannis , Alexandre Proutiere , Milan Vojnovic
IPC分类号： G06F15/16 , H04W88/04
CPC分类号： H04W88/04
摘要： A decentralized relaying algorithm for mobile devices is described. In an embodiment, a mobile device acts as a relay within a network of mobile devices and on contact with a source device downloads messages from the source according to a locally stored relaying probability for each channel of information within the network. These messages are subsequently downloaded to another device which is the end user of the message. Where the relay does not download the message from the source as a result of the decision made based on the relaying probability, a virtual message is downloaded which comprises metadata only and not the payload of the message. The relay updates the stored relaying probabilities for each channel based on locally observable information which includes feedback received from mobile devices to which the relay has downloaded messages. The feedback identifies unique paths for the payload of messages through the network.
摘要翻译：描述了用于移动设备的分散中继算法。在一个实施例中，移动设备充当移动设备的网络内的中继器，并且在与源设备接触的情况下，根据网络内的每个信道信道的本地存储的中继概率来从源下载消息。这些消息随后被下载到消息的最终用户的另一设备。由于作为基于中继概率的决定的结果，中继器不从源地下载消息，所以下载虚拟消息，其仅包含元数据而不是消息的有效载荷。继电器基于本地可观察到的信息更新每个信道的存储的中继概率，该信息包括从中继已下载消息的移动设备接收到的反馈。反馈通过网络识别消息有效载荷的唯一路径。

6. 发明申请

US20100027424A1 Path Estimation in a Wireless Mesh Network 有权
标题翻译：无线网状网络中的路径估计
公开(公告)号：US20100027424A1
公开(公告)日：2010-02-04
申请号：US12182493
申请日：2008-07-30
申请人： Bozidar Radunovic , Christos Gkantsidis , Dinan Gunawardena , Peter B. Key
发明人： Bozidar Radunovic , Christos Gkantsidis , Dinan Gunawardena , Peter B. Key
IPC分类号： H04J3/14
CPC分类号： H04W40/04 , H04L45/127
摘要： Methods and algorithms for path estimation in a wireless mesh network are described. In an embodiment, each node calculates its cost for a packet flow based on the back-log at the node and the cost of downstream neighbor nodes for the flow. The cost is communicated to the upstream neighbor nodes for the flow. When a node has an opportunity to transmit a packet, a flow is selected by the node based on the back-log at the node and the costs received from each of the downstream neighbor nodes. These costs are then also used to select a downstream neighbor node is selected based on the costs received from each of the downstream neighbor nodes. A packet re-ordering algorithm is also described which intercepts packets received at a node and delays delivery of the packet to the IP layer if an earlier packet in the sequence of packets has not been received.
摘要翻译：描述了无线网状网络中路径估计的方法和算法。在一个实施例中，每个节点基于节点的反向日志和流的下游邻居节点的成本来计算分组流的成本。成本被传送到流的上游邻居节点。当节点有传送数据包的机会时，节点根据节点的反向日志和从每个下游邻居节点接收的成本选择一个流。这些成本然后也用于选择下游邻居节点，其基于从每个下游邻居节点接收的成本来选择。还描述了分组重新排序算法，其拦截在节点处接收的分组，并且如果尚未接收到分组序列中的较早分组，则将分组的传送延迟到IP层。

7. 发明授权

US07912003B2 Multipath forwarding algorithms using network coding 有权
标题翻译：多路径转发算法使用网络编码
公开(公告)号：US07912003B2
公开(公告)日：2011-03-22
申请号：US11769669
申请日：2007-06-27
申请人： Bozidar Radunovic , Christos Gkantsidis , Peter B. Key , Dinan Gunawardena , Wenjun Hu , Pablo Rodriguez
发明人： Bozidar Radunovic , Christos Gkantsidis , Peter B. Key , Dinan Gunawardena , Wenjun Hu , Pablo Rodriguez
IPC分类号： H04M4/00
CPC分类号： H04W40/02 , H04L45/123 , H04L45/24 , H04L45/38 , H04L47/10 , H04L47/12 , H04L47/125 , H04L47/14 , H04L47/15 , H04W84/18
摘要： A method of transmitting data across a wireless mesh network is described which uses network coding at each of the intermediate nodes between the source node and the destination node. Each intermediate node also controls the rate at which it broadcasts packets based on link congestion and the backlog of packets at each of the possible next-hop nodes for the data flow.
摘要翻译：描述了通过无线网状网络发送数据的方法，其在源节点和目的地节点之间的每个中间节点处使用网络编码。每个中间节点还控制其基于链路拥塞广播分组的速率以及用于数据流的每个可能的下一跳节点的分组积压。

8. 发明授权

US07649841B2 Competitive and considerate congestion control 有权
标题翻译：竞争和周到的拥塞控制
公开(公告)号：US07649841B2
公开(公告)日：2010-01-19
申请号：US11454203
申请日：2006-06-16
申请人： Dinan Gunawardena , Shao Liu , Laurent Massoulie , Milan Vojnovic , Peter B. Key
发明人： Dinan Gunawardena , Shao Liu , Laurent Massoulie , Milan Vojnovic , Peter B. Key
IPC分类号： H04L12/26
CPC分类号： H04L47/10 , H04L47/18 , H04L47/193 , H04L47/245 , H04L47/25 , H04L47/263 , H04L47/27 , Y02D50/10
摘要： An end-to-end congestion control is provided that emulates a different service differentiation than the common low-normal priority. This protocol is referred to as 4CP (Competitive, Considerate Congestion Control). The target service differentiation enables provisioning of per-flow average bandwidth guarantees to “normal” traffic, but not at the expense of potentially starving the “low” priority traffic (4CP). It thus features incentive compatibility to file-transfer applications that are throughput-greedy but want to be considerate to other traffic. 4CP is implemented and configured as a sender-only adaptation of standard TCP, and requires no special network feedback. Configuration of the bandwidth guarantee is either statically configured or automatically adjusted by 4CP. The automatic mode aims to be TCP-friendly over appropriately large timescale.
摘要翻译：提供端到端拥塞控制，其模拟与普通低正常优先级不同的服务区分。该协议被称为4CP（竞争性，有意思的拥塞控制）。目标服务差异使得能够将每流量平均带宽保证提供给“正常”流量，但不能以牺牲“低”优先流量（4CP）为代价。因此，它具有对吞吐量贪心但想要考虑其他流量的文件传输应用程序的激励兼容性。 4CP被实现和配置为标准TCP的仅发送者适配，并且不需要特殊的网络反馈。带宽保证的配置是静态配置的或由4CP自动调整。自动模式旨在在适当的大时间尺度上对TCP友好。

9. 发明申请

US20090003216A1 Multipath Forwarding Algorithms Using Network Coding 有权
标题翻译：使用网络编码的多路径转发算法
公开(公告)号：US20090003216A1
公开(公告)日：2009-01-01
申请号：US11769669
申请日：2007-06-27
申请人： Bozidar Radunovic , Christos Gkantsidis , Peter B. Key , Dinan Gunawardena , Wenjun Hu , Pablo Rodriguez
发明人： Bozidar Radunovic , Christos Gkantsidis , Peter B. Key , Dinan Gunawardena , Wenjun Hu , Pablo Rodriguez
IPC分类号： H04J3/14
CPC分类号： H04W40/02 , H04L45/123 , H04L45/24 , H04L45/38 , H04L47/10 , H04L47/12 , H04L47/125 , H04L47/14 , H04L47/15 , H04W84/18
摘要： A method of transmitting data across a wireless mesh network is described which uses network coding at each of the intermediate nodes between the source node and the destination node. Each intermediate node also controls the rate at which it broadcasts packets based on link congestion and the backlog of packets at each of the possible next-hop nodes for the data flow.
摘要翻译：描述了通过无线网状网络发送数据的方法，其在源节点和目的地节点之间的每个中间节点处使用网络编码。每个中间节点还控制其基于链路拥塞广播分组的速率以及用于数据流的每个可能的下一跳节点的分组积压。

10. 发明申请

US20050246774A1 Network Amplification attack mitigation 有权
标题翻译：网络放大攻击缓解
公开(公告)号：US20050246774A1
公开(公告)日：2005-11-03
申请号：US10837434
申请日：2004-04-29
申请人： Dinan Gunawardena
发明人： Dinan Gunawardena
IPC分类号： H04L12/24 , H04L12/56 , H04L29/06 , H04L9/00 , G06F11/30 , G06F12/14 , H04L9/32
CPC分类号： H04L47/10 , H04L47/50 , H04L47/527 , H04L63/1458
摘要： An improved network protocol for mitigating network amplification attacks is provided. The absolute network load that any transient distributed attack can cause is bounded based on a resource crediting scheme. The protocol accumulates “credit” upon reception and detection of candidate attack request packets, and draws against that credit when transmitting responsive packets. In some implementations, the time frame of such an attack is also bounded using time limits applied to a resource crediting scheme. Other resources may also be bounded by the resource crediting scheme, including without limitation CPU utilization, storage capacity, power, etc.
摘要翻译：提供了一种用于减轻网络放大攻击的改进的网络协议。任何瞬态分布式攻击可能导致的绝对网络负载是基于资源计费方案的。该协议在接收和检测候选攻击请求分组时累积“信用”，并在传送响应分组时对该信用量进行抽取。在一些实现中，这种攻击的时间间隔也是使用应用于资源计费方案的时间限制来限定的。其他资源也可能受到资源抵免方案的限制，包括但不限于CPU利用率，存储容量，功率等。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式