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

1. 发明申请

US20060195325A1 Data retrieval system 审中-公开
标题翻译：数据检索系统
公开(公告)号：US20060195325A1
公开(公告)日：2006-08-31
申请号：US10550203
申请日：2003-12-02
申请人： Richard Tateson , Erwin Bonsma , Cefn Hoile , Mark Shackleton
发明人： Richard Tateson , Erwin Bonsma , Cefn Hoile , Mark Shackleton
IPC分类号： G06Q99/00
CPC分类号： G06F16/3326 , G06F16/9032
摘要： A browsing process is driven by user interaction. The user is presented with a selection of items 511, 512, . . . etc from a range. The user can give inputs representing interest in one or other of the items displayed. The inputs represent rewards, which are distributed to attribute data items or “keywords” associated with the display items. These keywords are transparent to the user, but represent characteristics of the display items with which they are associated. The browsing system selects items for display according to a probabilistic function weighted to favour those having the keywords which have accrued the highest number of rewards, these being the display items having the most keywords in common with display items previously rewarded by the user during the browsing session. Partial or negative weightings may also be applied to the keyword associations, which are also taken into account in the selection process.
摘要翻译：浏览过程由用户交互驱动。向用户呈现项目511,512的选择。。。等等。用户可以给出表示在所显示的一个或另一个项目中的兴趣的输入。输入表示奖励，其被分配给与显示项目相关联的属性数据项或“关键字”。这些关键字对于用户是透明的，而是表示与它们相关联的显示项目的特征。浏览系统根据加权的概率函数来选择要显示的项目，以便有利于具有最高奖励数量的关键字的那些，这些是与浏览期间由用户预先奖励的显示项目有最多关键字的显示项目会话关键字关联也可以应用部分或负重权重，这也在选择过程中也被考虑在内。

2. 发明申请

US20060285543A1 Distributed computer system 有权
公开(公告)号：US20060285543A1
公开(公告)日：2006-12-21
申请号：US10583964
申请日：2004-12-10
申请人： Erwin Bonsma , Cefn Hoile
发明人： Erwin Bonsma , Cefn Hoile
IPC分类号： H04L12/56
CPC分类号： G06F17/30864 , H04L29/12047 , H04L61/15 , H04L67/104 , H04L67/1068 , H04L67/1078
摘要： A distributed computer system has computers storing data items each data item being assigned to one of a plurality of virtual directories. Each computer has at least one node of a virtual network (10) for directory look-up, with linking data comprising addresses of other nodes associated with the same virtual directory and software that, in response to an enquiry message either replies, identifying itself or forwards the message to another node of the network (10), according to whether the node is or is not associated with the directory specified in the enquiry message. Similarly, each computer has, for each item that it stores, a node of a virtual network for item look-up, with linking data comprising addresses of other such nodes associated with items assigned to the same virtual directory, so that these linking data together define a plurality of virtual networks for item look-up, each of which networks corresponds to a respective different virtual directory. The node also has software that, in response to an enquiry message either replies with the item sought (or identifying itself for later item retrieval) or forwards the message to another node of the network, according to whether the node is or is not associated with the item specified in the enquiry message. For use in this system, or separately, a retrieval mechanism for thereby the addresses (25) of multiple nodes matching the same directory name (or other label) is described. Each node matching a given label (21a) has associated with it a data storage area for containing the label and is responsive to enquiry messages to return a list of addresses of other nodes matching the same label. First retrieval means responds to input of a label to identify the address of a node matching that label, and second retrieval means then sends an enquiry message to the address identified by the first retrieval means and upon receipt of a response to iteratively sends further enquiry messages to the node having the addresses contained in the response to that enquiry message or as the case may be in a response to a subsequent enquiry message.

3. 发明申请

US20060280172A1 Virtual networks 有权
标题翻译：虚拟网络
公开(公告)号：US20060280172A1
公开(公告)日：2006-12-14
申请号：US10558882
申请日：2004-09-17
申请人： Erwin Bonsma
发明人： Erwin Bonsma
IPC分类号： H04L12/56
CPC分类号： H04L67/104 , H04L12/4641 , H04L45/02
摘要： A virtual network has a plurality of nodes, each node with a list for storing up to a predetermined number (L) of addresses representing links to other such nodes. These links are managed by: receiving (300) a message requesting a link between a first node and a second node; determining (301, 305) whether both the first node and second node has in each case a number of addresses in its list which is less than the predetermined number; in the event that this condition is satisfied, inserting (308) the address of the first node into the list of the second node and inserting (307) the address of the second node into the list of the first node; in the event that this condition is not satisfied, determining (309) whether the first node has a number of addresses in its list which is at least two less than the predetermined number, and if so—(a) selecting (310) from the list of the second node the address of a third node; (b) removing (313) the address of the third node from the list of the second node; (c) removing (314) the address of the second node from the list of the third node; and (d) inserting (311) the address of the second node into the list of the first node and inserting (312) the address of the third node into the list of the first node. (e) inserting (313) the address of the first node into the list of the second node and inserting (314) the address of the first node into the list of the third node.
摘要翻译：虚拟网络具有多个节点，每个节点具有用于存储多达预定数量（L）个地址的列表，表示到其他这样的节点的链接。这些链接由以下管理：接收（300）请求第一节点和第二节点之间的链接的消息; 确定（301,305）所述第一节点和所述第二节点在每个情况下是否在其列表中的数量小于所述预定数量的地址; 在满足该条件的情况下，将第一节点的地址插入（308）到第二节点的列表中，并将第二节点的地址插入（307）到第一节点的列表中; 在不满足该条件的情况下，确定（309）第一节点是否具有比其预定数小至少两个的列表中的地址数，如果是，则（a）从第二节点的列表，第三节点的地址; （b）从第二节点的列表中删除（313）第三节点的地址; （c）从第三节点的列表中删除（314）第二节点的地址; 和（d）将第二节点的地址插入（311）到第一节点的列表中，并将第三节点的地址插入（312）到第一节点的列表中。（e）将第一节点的地址插入（313）到第二节点的列表中，并将第一节点的地址插入（314）到第三节点的列表中。

4. 发明申请

US20060259640A1 Computer network for identifying multiple nodes matching the same label 有权
标题翻译：用于识别匹配相同标签的多个节点的计算机网络
公开(公告)号：US20060259640A1
公开(公告)日：2006-11-16
申请号：US10558883
申请日：2004-09-13
申请人： Erwin Bonsma
发明人： Erwin Bonsma
IPC分类号： G06F15/16
CPC分类号： H04L41/0893 , H04L29/12113 , H04L41/12 , H04L61/1541 , H04L67/02 , H04L67/104 , H04L67/1068
摘要： Nodes of a computer network are found by performing, in response to input of a label, a first retrieval operation (32) to identify the address of a node matching that label, and performing, in response to an address identified by the first retrieval means, a second retrieval operation (35) to identify the addresses of further nodes matching the same label. Each node matching a given label has a data storage area for containing the addresses of other nodes matching the same label and is responsive to enquiry messages to return a message containing the addresses of the list. The second retrieval operation includes sending an enquiry message to the address identified by the first retrieval means and upon receipt of a response iteratively sending further enquiry messages to addresses contained in the response to the previous enquiry message.
摘要翻译：通过响应于标签的输入执行第一检索操作（32）来识别与该标签相匹配的节点的地址，并且响应于由第一检索装置识别的地址执行计算机网络的节点，第二检索操作（35），用于识别与相同标签匹配的其他节点的地址。匹配给定标签的每个节点具有用于包含与相同标签相匹配的其他节点的地址的数据存储区域，并响应于查询消息返回包含列表地址的消息。第二检索操作包括将查询消息发送到由第一检索装置识别的地址，并且在接收到响应时迭代地向另外的询问消息发送包含在对先前查询消息的响应中的地址的响应。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式