Methods and nodes for enabling and producing input to an application
    3.
    发明授权
    Methods and nodes for enabling and producing input to an application 有权
    用于启用和生成应用程序输入的方法和节点

    公开(公告)号:US09576572B2

    公开(公告)日:2017-02-21

    申请号:US14408756

    申请日:2012-06-18

    摘要: Methods and nodes for enabling and producing input generated by speech of a user, to an application. When the application has been activated (2:1), an application node (200) detects (2:2) a current context of the user and selects (2:3), from a set of predefined contexts (204a), a predefined context that matches the detected current context. The application node (200) then provides (2:4) keywords associated with the selected predefined context to a speech recognition node (202). When receiving (2:5) speech from the user, the speech recognition node (202) is able to recognize (2:6) any of the keyword in the speech. The recognized keyword is then used (2:7) as input to the application.

    摘要翻译: 用于启用和生成用户的语音产生的输入到应用的方法和节点。 当应用程序被激活(2:1)时,应用节点(200)检测(2:2)当前用户的上下文,并从一组预定义的上下文(204a)中选择(2:3) 匹配检测到的当前上下文的上下文。 应用节点(200)然后将与所选择的预定上下文相关联的(2:4)关键词提供给语音识别节点(202)。 当从用户接收(2:5)语音时,语音识别节点(202)能够识别语音中的任何关键词(2:6)。 然后使用公认的关键字(2:7)作为应用程序的输入。

    METHODS AND NODES FOR ENABLING AND PRODUCING INPUT TO AN APPLICATION
    4.
    发明申请
    METHODS AND NODES FOR ENABLING AND PRODUCING INPUT TO AN APPLICATION 有权
    用于启动和生成输入到应用程序的方法和名称

    公开(公告)号:US20150199961A1

    公开(公告)日:2015-07-16

    申请号:US14408756

    申请日:2012-06-18

    IPC分类号: G10L15/08

    摘要: Methods and nodes for enabling and producing input generated by speech of a user, to an application. When the application has been activated (2:1), an application node (200) detects (2:2) a current context of the user and selects (2:3), from a set of predefined contexts (204a), a predefined context that matches the detected current context. The application node (200) then provides (2:4) keywords associated with the selected predefined context to a speech recognition node (202). When receiving (2:5) speech from the user, the speech recognition node (202) is able to recognize (2:6) any of the keyword in the speech. The recognized keyword is then used (2:7) as input to the application.

    摘要翻译: 用于启用和生成用户的语音产生的输入到应用的方法和节点。 当应用程序被激活(2:1)时,应用节点(200)检测(2:2)当前用户的上下文,并从一组预定义上下文(204a)中选择(2:3)预定义的 匹配检测到的当前上下文的上下文。 应用节点(200)然后将与所选择的预定上下文相关联的(2:4)关键词提供给语音识别节点(202)。 当从用户接收(2:5)语音时,语音识别节点(202)能够识别语音中的任何关键词(2:6)。 然后使用公认的关键字(2:7)作为应用程序的输入。

    METHOD AND ARRANGEMENT FOR LOCATING SERVICES IN A PEER-TO-PEER NETWORK
    5.
    发明申请
    METHOD AND ARRANGEMENT FOR LOCATING SERVICES IN A PEER-TO-PEER NETWORK 有权
    在对等网络中定位服务的方法和布置

    公开(公告)号:US20120197962A1

    公开(公告)日:2012-08-02

    申请号:US13498323

    申请日:2009-10-21

    IPC分类号: G06F15/16

    摘要: The present invention relates to methods and arrangements for locating services in a structured peer-to-peer distributed hash table, DHT, based, overlay communication network (310). The invention comprises two inter-related methods and nodes. The first method is used by a service node (321) to “advertise” to the overlay network (310) that it is providing a particular service (S1). This is done by distributing instances (351,352,353) of a service object (O1) that are stored in different nodes (331,332,333) in the overlay network (310) and where the instances (351,352,353) comprise an address to the service node (321). The other method is to locate at least one of these instances (351,352,353) with a predetermined probability and with a predetermined number of location request messages (390) from a user node (311) wishing to use the particular service (S1).

    摘要翻译: 本发明涉及在结构化对等分布式散列表(基于DHT)的覆盖通信网络(310)中定位业务的方法和装置。 本发明包括两个相互关联的方法和节点。 服务节点(321)使用第一种方法来向覆盖网络(310)“通告”它提供特定服务(S1)。 这通过分配存储在覆盖网络(310)中的不同节点(331,332,333)中的服务对象(O1)的实例(351,352,353),并且实例(351,352,353)包括到服务节点(321)的地址。 另一种方法是以希望使用特定服务(S1)的用户节点(311)以预定概率和预定数量的位置请求消息(390)定位这些实例中的至少一个(351,352,353)。

    Searching in Peer to Peer Networks
    6.
    发明申请
    Searching in Peer to Peer Networks 审中-公开
    搜索对等网络

    公开(公告)号:US20120158756A1

    公开(公告)日:2012-06-21

    申请号:US12976808

    申请日:2010-12-22

    IPC分类号: G06F17/30

    摘要: Embodiments herein include a method and apparatus for searching a structured peer-to-peer (P2P) network. A requesting node obtains a search term and generates a Bloom filter using the search term. The Bloom filter is sent to a searching node, which compares the received Bloom filter with at least one further Bloom filter stored at a database accessible by the searching node. The further Bloom filter is associated a further node in the P2P network. In the event that the Bloom filter and the further Bloom filter match, the searching node sends towards the requesting node an identity of the further node. This allows the requesting node to query the further node for the required data.

    摘要翻译: 本文的实施例包括用于搜索结构化对等(P2P)网络的方法和装置。 请求节点获得搜索项,并使用搜索项生成布隆过滤器。 Bloom过滤器被发送到搜索节点,该搜索节点将接收的Bloom过滤器与存储在可由搜索节点访问的数据库处的至少一个另外的Bloom过滤器进行比较。 进一步的Bloom过滤器与P2P网络中的另一个节点相关联。 在Bloom过滤器和进一步的Bloom过滤器匹配的情况下,搜索节点向请求节点发送另一个节点的标识。 这允许请求节点向另一个节点查询所需的数据。

    Maintaining Distributed Hash Tables In An Overlay Network
    8.
    发明申请
    Maintaining Distributed Hash Tables In An Overlay Network 有权
    在覆盖网络中维护分布式哈希表

    公开(公告)号:US20110110269A1

    公开(公告)日:2011-05-12

    申请号:US12993990

    申请日:2008-05-23

    申请人: Jouni Mäenpää

    发明人: Jouni Mäenpää

    IPC分类号: H04L12/28

    摘要: A method of maintaining routing tables at nodes of an overlay network, where a routing table of a given node contains, for each of a set of neighbouring successor and predecessor nodes, a mapping between an overlay network address of the node and a physical locator of the node. The method comprises, upon or immediately prior to departure of a node from the overlay network, sending a Leave request from the departing node (or one of the neighbouring nodes of the departing node aware of the departure) to each neighbouring node (or each other neighbouring node of the departing node), indicating the departure and containing one or more mappings for nodes not contained within the routing table of the recipient node. Each neighbouring node (or each other neighbouring node) receives the Leave request and uses said mapping(s) to update its routing table.

    摘要翻译: 在覆盖网络的节点处维护路由表的方法,其中给定节点的路由表针对一组相邻后继者和前导节点中的每一个包含所述节点的覆盖网络地址与所述节点的覆盖网络地址与物理定位符之间的映射 节点。 该方法包括:在节点离开覆盖网络之后或之前,从离开节点(或离开节点的相邻节点之一识别出发)向每个相邻节点(或彼此)发送离开请求 指示离开并且包含未包含在接收方节点的路由表中的节点的一个或多个映射。 每个相邻节点(或每个其他相邻节点)接收到Leave请求,并使用所述映射来更新其路由表。

    LOAD BALANCING MECHANISM FOR SERVICE DISCOVERY MECHANISM IN STRUCTURED PEER-TO-PEER OVERLAY NETWORKS AND METHOD
    9.
    发明申请
    LOAD BALANCING MECHANISM FOR SERVICE DISCOVERY MECHANISM IN STRUCTURED PEER-TO-PEER OVERLAY NETWORKS AND METHOD 有权
    结构化对等网络和方法中服务发现机制的负载平衡机制

    公开(公告)号:US20140016471A1

    公开(公告)日:2014-01-16

    申请号:US14004545

    申请日:2011-04-13

    IPC分类号: H04L12/803

    摘要: An overlay network, node and application for load balanced service discovery. The application includes the steps of implementing the service discovery mechanism in the DHT P2P overlay network for finding a peer (1100) that provides a desired service; a step of adding to a record structure (50) of the service discovery mechanism a maximum capacity parameter Cmax (54) and a currently used capacity parameter Ccurrent (56); and a step of removing from the tree (10) a record of the peer (1110) that provides the desired service when the currently used capacity reaches a predetermined capacity so that the peer is not contacted by other service clients.

    摘要翻译: 覆盖网络,负载均衡服务发现的节点和应用程序。 应用程序包括在DHT P2P覆盖网络中实现服务发现机制以找到提供所需服务的对等端(1100)的步骤; 向服务发现机构的记录结构(50)添加最大容量参数Cmax(54)和当前使用的容量参数Ccurrent(56)的步骤; 以及当当前使用的容量达到预定容量以使对等体未被其他服务客户端联系时,从树(10)中删除提供所需服务的对等体(1110)的记录的步骤。

    Maintaining distributed hash tables in an overlay network
    10.
    发明授权
    Maintaining distributed hash tables in an overlay network 有权
    在覆盖网络中维护分布式哈希表

    公开(公告)号:US08526331B2

    公开(公告)日:2013-09-03

    申请号:US12993990

    申请日:2008-05-23

    申请人: Jouni Mäenpää

    发明人: Jouni Mäenpää

    IPC分类号: H04L12/28

    摘要: A method of maintaining routing tables at nodes of an overlay network, where a routing table of a given node contains, for each of a set of neighboring successor and predecessor nodes, a mapping between an overlay network address of the node and a physical locator of the node. The method comprises, upon or immediately prior to departure of a node from the overlay network, sending a Leave request from the departing node (or one of the neighboring nodes of the departing node aware of the departure) to each neighboring node (or each other neighboring node of the departing node), indicating the departure and containing one or more mappings for nodes not contained within the routing table of the recipient node. Each neighboring node (or each other neighboring node) receives the Leave request and uses said mapping(s) to update its routing table.

    摘要翻译: 在覆盖网络的节点处维护路由表的方法,其中给定节点的路由表针对一组相邻后继者和前导节点中的每一个包含所述节点的覆盖网络地址与所述节点的覆盖网络地址与物理定位符之间的映射 节点。 该方法包括:在节点离开覆盖网络之后或之前,从离开节点(或离开节点的相邻节点之一识别出发)向每个相邻节点(或彼此)发送离开请求 指示离开并且包含未包含在接收方节点的路由表中的节点的一个或多个映射。 每个相邻节点(或每个其他相邻节点)接收到Leave请求,并使用所述映射来更新其路由表。