会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • FORWARDING TABLE MANAGEMENT IN COMPUTER NETWORKS
    • 计算机网络中的前台管理
    • WO2017011278A1
    • 2017-01-19
    • PCT/US2016/041417
    • 2016-07-08
    • MICROSOFT TECHNOLOGY LICENSING, LLC
    • LOHER, DarrenRATTERREE, GaryLIU, Chen
    • H04L12/707H04L12/703H04L12/741
    • H04L45/54H04L43/0823H04L45/22H04L45/28H04L45/74
    • Various techniques for managing forwarding tables in computer networks are disclosed herein. A computer network 100 includes multiple network nodes 102a-102d interconnecting multiple endpoints 108, a route resolver 104, and a network controller 106. A method includes receiving, by the network controller 106, an indication of a network condition 122 in the computer network 100 having a network node 102b, and determining, by the network controller 106 a routing table key 124 based on the received indication of the network condition in the computing network. The routing table key corresponds to a routing table for the network node 102b that is pre- computed under the indicated network condition in the computer network. The method then includes transmitting the determined routing table key 124 to the network node 102b for routing data in the computer network, for example by retrieving a corresponding routing table from a corresponding storage device 112b to replace an existing routing table for directing traffic. The route resolver 104 can be configured to compute a set of routing tables for the network nodes 102 under various network conditions or scenarios in the computer network 100, for example, when one of the network links 114 fails; when two or more of the network links 114 fail; when one of the network nodes 102 fails; when two or more of the network nodes 102 fail; when one network node 102 fails and a network link 114 unrelated to the network node 102 also fails; or when one or more network links 114 have throughput restrictions. Thus, the pre- computed routing table corresponds to a desired pattern of network traffic in the computer network under the indicated network condition and time-consuming ad hoc computation of the routing table for the indicated network condition can be avoided. As such, network traffic in the computer network 100 can converge more quickly to the desired pattern than conventional networks.
    • 本文公开了用于管理计算机网络中的转发表的各种技术。 计算机网络100包括互连多个端点108的多个网络节点102a-102d,路由解析器104和网络控制器106.一种方法包括由网络控制器106接收计算机网络100中的网络条件122的指示 具有网络节点102b,并且由网络控制器106基于接收到的计算网络中的网络条件的指示来确定路由表密钥124。 路由表密钥对应于在计算机网络中指示的网络条件下预先计算的网络节点102b的路由表。 该方法然后包括将所确定的路由表密钥124发送到网络节点102b以用于在计算机网络中路由数据,例如通过从对应的存储设备112b检索相应的路由表来替换用于引导业务的现有路由表。 路由解析器104可以被配置为在计算机网络100中的各种网络条件或场景下计算网络节点102的一组路由表,例如当网络链路114之一失败时; 当两个或多个网络链路114失败时; 当网络节点102中的一个失败时; 当两个或多个网络节点102失败时; 当一个网络节点102发生故障并且与网络节点102不相关的网络链路114也失败时; 或者当一个或多个网络链路114具有吞吐量限制时。 因此,预先计算的路由表在所指示的网络条件下对应于计算机网络中期望的网络业务模式,并且可以避免所指示的网络状况的路由表的耗时特设计算。 因此,计算机网络100中的网络业务可以比常规网络更快地收敛到期望的模式。
    • 8. 发明申请
    • ASSIGNING AN INDEXING WEIGHT TO A SEARCH TERM
    • 将索引权重指定为搜索条件
    • WO2010075015A2
    • 2010-07-01
    • PCT/US2009/067815
    • 2009-12-14
    • MOTOROLA, INC.LIU, Chen
    • LIU, Chen
    • G06F17/30G06F17/00
    • G06F17/30616
    • Disclosed is an indexing weight (320) assigned (206) to a potential search term in a document (300), the indexing weight (320) is based on both textual and acoustic aspects of the term. In one embodiment, a traditional text-based weight (302, 304) is assigned (200) to a potential search term. This weight (302, 304) can be TF-IDF ("term frequency-inverse document frequency"), TF-DV ("term frequency discrimination value"), or any other text-based weight (302, 304). Then, a pronunciation prominence weight (318) is calculated (202) for the same term. The text-based weight (302, 304) and the pronunciation prominence weight (318) are mathematically combined (204) into the final indexing weight (320) for that term. When a speech-based search string is entered, the combined indexing weight (320) is used (206) to determine the importance of each search term in each document (300). Several possibilities for calculating the pronunciation prominence (318) are contemplated. In some embodiments, for pairs of terms in a document (300), an inter-term pronunciation distance (306) is calculated based on inter-phoneme distances (316).
    • 公开了分配(206)给文档(300)中的潜在搜索词的索引加权(320),索引加权(320)基于该词的文本和声学两个方面。 在一个实施例中,传统的基于文本的权重(302,304)被分配(200)到潜在的搜索项。 该权重(302,304)可以是TF-IDF(“词频 - 逆文档频率”),TF-DV(“词频鉴别值”)或任何其他基于文本的权重(302,304)。 然后,针对相同的词计算(202)发音突出权重(318)。 基于文本的权重(302,304)和发音权重(318)在数学上组合(204)为该项的最终索引权重(320)。 当输入基于语音的搜索字符串时,使用组合索引权重(320)(206)来确定每个文档(300)中每个搜索项的重要性。 预期计算发音突出(318)的几种可能性。 在一些实施例中,对于文档(300)中的词项对,基于音素间距离(316)计算词间发音距离(306)。