-
21.发明授权
公开(公告)号：US5351291A
公开(公告)日：1994-09-27
申请号：US927690
申请日：1992-08-07
申请人： Jean Menez , Michele Rosso , Paolo Scotton
发明人： Jean Menez , Michele Rosso , Paolo Scotton
CPC分类号： H04B3/237
摘要： The echo cancellation method includes starting with an arbitrary set of echo filter coefficients. The coefficients are first sequentially re-estimated using a fast converging method.These operations are repeated a predefined number of times, and then the coefficients estimation is switched to a low converging but more precise method. In addition, an adaptive threshold is being defined and readjusted and all filter coefficients lower than said threshold are being discarded.Finally, sampling time boundaries are adaptively defined based on non-discarded filter coefficients with reference to said threshold, and in such a way the final echo cancellation algorithm is adaptive to echo variations (backtracking algorithm).
摘要翻译： 回波消除方法包括以任意的一组回波滤波器系数开始。 首先使用快速收敛方法连续重新估计系数。 这些操作重复预定次数，然后将系数估计切换到低收敛但更精确的方法。 此外，正在定义和重新调整自适应阈值，并且正在丢弃低于所述阈值的所有滤波器系数。 最后，参考所述阈值，基于非丢弃的滤波器系数自适应地定义采样时间边界，并且以这种方式，最终回波消除算法适应于回波变化（回溯算法）。
-
公开(公告)号：US20130151805A1
公开(公告)日：2013-06-13
申请号：US13620398
申请日：2012-09-14
IPC分类号： G06F12/02
CPC分类号： G06F3/0683 , G06F3/0611 , G06F3/064
摘要： A solution for managing a software image being stored in a plurality of physical blocks of a storage system comprises monitoring each access to the physical blocks, calculating a predicted sequence of access to the physical blocks according to the monitored accesses, and reorganizing the physical blocks according to the predicted sequence. The monitoring may be performed as the physical blocks are accessed during the booting of virtual images on the software image.
摘要翻译： 用于管理存储在存储系统的多个物理块中的软件映像的解决方案包括监视对物理块的每个访问，根据所监视的访问来计算对物理块的访问的预测序列，以及根据所监视的访问重新组织物理块 到预测序列。 可以在软件映像引导虚拟映像期间访问物理块来执行监视。
-
公开(公告)号：US07120681B2
公开(公告)日：2006-10-10
申请号：US10059638
申请日：2002-01-29
IPC分类号： G06F15/177 , H04Q7/00
摘要： Methods and apparatus are provided for controlling the clustering of nodes which implement a cluster-based routing protocol in a data communications network system where the system comprises a plurality of such nodes which are interconnectable to form a plurality of ad hoc networks. For each node which is a member of a cluster, cluster control information (CCMs) is maintained, this cluster control information being dependent on the size of at least the cluster of which that node is a member. On connection of two nodes which are members of two respective clusters, each of the two nodes transmits its cluster control information to the other node, and then determines whether a clustering condition is satisfied. In each node, the clustering condition is dependent on the cluster control information maintained for that node and the cluster control information received from the other node. In each node, if the clustering condition is satisfied, the node then communicates a clustering agreement to the other node. If the clustering conditions of both nodes are satisfied for the two clusters, the two nodes exchange routing information to merge the two clusters.
-
公开(公告)号：US09086892B2
公开(公告)日：2015-07-21
申请号：US13882247
申请日：2011-11-03
CPC分类号： G06F9/4401 , G06F8/63
摘要： A mechanism is provided for migrating a software image installed on a source data-processing entity to a target data-processing entity. The target data-processing entity is booted from a preliminary bootstrap program. The software image is mounted as a remote mass memory on the target data-processing entity. A primary bootstrap program of the software image is copied onto a local mass memory of the target data-processing entity. The target data-processing entity is re-booted from the primary bootstrap program thereby loading a streaming function, and serving each request of accessing a memory block on the target data-processing entity by the streaming function. In response to the memory block missing from the local mass storage, the streaming function downloads the memory block from the software image and stores the memory block into the local mass memory. Otherwise, the streaming function retrieves the memory block from the local mass memory otherwise.
摘要翻译： 提供了一种用于将安装在源数据处理实体上的软件映像迁移到目标数据处理实体的机制。 目标数据处理实体从初步引导程序启动。 该软件映像作为远程大容量存储器安装在目标数据处理实体上。 将软件映像的主引导程序复制到目标数据处理实体的本地大容量存储器中。 目标数据处理实体从主引导程序重新启动，从而加载流传输功能，并通过流传输功能为目标数据处理实体提供访问存储块的每个请求。 响应于本地大容量存储器丢失的存储器块，流式传输功能从软件映像下载存储器块，并将存储器块存储到本地大容量存储器中。 否则，流功能从本地批量存储器中检索内存块。
-
25.发明授权Method for generating the optimal PNNI complex node representations for restrictive costs 有权用于生成用于限制性成本的最优PNNI复数节点表示的方法公开(公告)号：US06744734B1
公开(公告)日：2004-06-01
申请号：US09385951
申请日：1999-08-30
申请人： Ilias Iliadis , Paolo Scotton
发明人： Ilias Iliadis , Paolo Scotton
IPC分类号： H04J314
CPC分类号： H04L45/10 , H04L2012/562 , H04L2012/5621 , H04Q11/0478
摘要： A method for constructing the set of optimal complex node representations of a PNNI peer group based on a restrictive cost database (e.g. a cost matrix) associated with the border nodes. The resulting set of complex node representations is the optimal in that it contains all the possible complex node representations that use the minimum possible number of exception bypasses.
摘要翻译： 一种用于基于与边界节点相关联的限制性成本数据库（例如，成本矩阵）来构造PNNI对等体组的最优复合节点集合的方法。 所得到的复杂节点表示集是最优的，因为它包含使用最小可能数量的异常绕过的所有可能的复杂节点表示。
-
公开(公告)号：US06614762B1
公开(公告)日：2003-09-02
申请号：US09364443
申请日：1999-07-30
申请人： Ilias Illiadis , Paolo Scotton
发明人： Ilias Illiadis , Paolo Scotton
IPC分类号： G01R3108
CPC分类号： H04Q11/0478 , H04L2012/5621
摘要： Scheme for the computation of a restrictive cost between pairs of border nodes of a PNNI peer group. A list of said links sorted according to their restrictive cost C is maintained. Logical sets of nodes are formed by taking one link after the other from said list starting with the cheapest cost C and assigning an identifier to the two nodes connected by the respective link, whereby the nodes of a set of nodes carry a dominant unique identifier if a border node is a member of the respective set, or a unique identifier if there is no border node being a member of the respective set. Sets are united if a link connects a node of a first set and a node of a second set, by assigning a dominant unique identifier to all nodes of both sets if either nodes of the first or the nodes of the second set carry a dominant unique identifier, or by assigning a unique identifier to all nodes of both sets if neither the nodes of the first nor the nodes of the second set carry a dominant unique identifier. A Matrix update algorithm is applied if the link connects a node of a first set and a node of a second set that both already carry dominant unique identifiers.
摘要翻译： 计算PNNI对等组的边界节点对之间的限制性成本的方案。 维护根据其限制成本C分类的所述链接的列表。 通过以最便宜的成本C开始，从所述列表中以一个接一个地从所述列表中取出一个链路来形成逻辑的节点集合，并且向由相应链路连接的两个节点分配一个标识符，由此一组节点的节点携带一个主要的唯一标识符，如果 边界节点是相应集合的成员，或者如果没有边界节点是相应集合的成员，则是唯一标识符。 如果链路连接第一集合的节点和第二集合的节点，则通过将主要唯一标识符分配给两个集合的所有节点，如果第二集合的第一节点或第二集合的节点中的任一个节点携带主导唯一标识符 标识符，或者通过为两个集合的所有节点分配唯一标识符，如果第二集合的第一个节点和第二个节点的节点都不具有主导的唯一标识符。 如果链路连接第二组的节点和第二组的节点，它们都已经携带显着的唯一标识符，则应用矩阵更新算法。
-
公开(公告)号：US06487204B1
公开(公告)日：2002-11-26
申请号：US09310273
申请日：1999-05-12
申请人： Marc Dacier , Paolo Scotton
发明人： Marc Dacier , Paolo Scotton
IPC分类号： H04L1256
CPC分类号： H04L63/1408 , H04L2012/5621 , H04Q11/0478
摘要： In an ATM network operating in accordance with PNNI standards, the operation of a switch is divided into two phases, a learning mode phase and an active mode phase. During learning mode phase, each time a reachability is received from a sending switch, the reachability is recorded in the database of the receiving switch and the received reachability is sent to other switches in the same peer group. At the end of the learning mode phase, the database of each of the switches contains the reachabilities advertised by all the switches of the peer group during the learning mode group phase. On a termination of the learning mode, the switches enter the active mode phase. During the active mode, each time a reachability is received from a sending switch, the receiving switch checks to see if the reachability has been advertised in the past by that sending switch. If it has, the reachability is considered to be valid and the receiving switch waits for the next reachability. On the other hand, if the particular reachability has never been announced before the sending node, it is compared to the reachability in the database for all other nodes of the peer group. If the reachability causes the reachability from other node to be overlapped and the overlapping is suspicious, then an alarm is raised.
摘要翻译： 在根据PNNI标准操作的ATM网络中，开关的操作被分为两个阶段：学习模式阶段和活动模式阶段。 在学习模式阶段，每当从发送交换机接收到可达性时，可达性被记录在接收交换机的数据库中，并且接收到的可达性被发送到同一对等体组中的其他交换机。 在学习模式阶段结束时，每个交换机的数据库包含在学习模式组阶段期间对等体组的所有交换机发布的可达性。 在学习模式终止时，开关进入活动模式阶段。 在活动模式期间，每当从发送交换机接收到可达性时，接收交换机检查是否由该发送交换机过去通告了可达性。 如果有的话，可达性被认为是有效的，并且接收交换机等待下一个可达性。 另一方面，如果在发送节点之前从未公布特定可达性，则将其与对等组的所有其他节点的数据库的可达性进行比较。 如果可达性导致来自其他节点的可达性重叠，重叠可疑，则会发出警报。
-
公开(公告)号：US08943291B2
公开(公告)日：2015-01-27
申请号：US13620398
申请日：2012-09-14
CPC分类号： G06F3/0683 , G06F3/0611 , G06F3/064
摘要： A solution for managing a software image being stored in a plurality of physical blocks of a storage system comprises monitoring each access to the physical blocks, calculating a predicted sequence of access to the physical blocks according to the monitored accesses, and reorganizing the physical blocks according to the predicted sequence. The monitoring may be performed as the physical blocks are accessed during the booting of virtual images on the software image.
摘要翻译： 用于管理存储在存储系统的多个物理块中的软件映像的解决方案包括监视对物理块的每个访问，根据所监视的访问来计算对物理块的访问的预测序列，以及根据所监视的访问重新组织物理块 到预测序列。 可以在软件映像引导虚拟映像期间访问物理块来执行监视。
-
公开(公告)号：US08325628B2
公开(公告)日：2012-12-04
申请号：US12500397
申请日：2009-07-09
申请人： Paolo Scotton , John N. Rooney
发明人： Paolo Scotton , John N. Rooney
IPC分类号： H04L12/16
CPC分类号： H04L45/00 , H04L45/128 , H04W40/246
摘要： A system of nodes including processors within a wireless sensor network includes an arrangement of the nodes with data connections therebetween within the wireless sensor network, wherein the data connections are limited to a set of distinct, non-intersecting paths, wherein each source node of the nodes is connected with a root nodes of the nodes by at least a predetermined number of the paths.
摘要翻译： 包括无线传感器网络内的处理器的节点系统包括在无线传感器网络内具有数据连接的节点的布置，其中数据连接限于一组不同的不相交路径，其中， 节点通过至少预定数量的路径与节点的根节点连接。
-
公开(公告)号：US07177951B1
公开(公告)日：2007-02-13
申请号：US09625624
申请日：2000-07-26
申请人： Douglas Dykeman , Michael Osbourne , Paolo Scotton , Olen Stokes , Claude Basso , Marianne Aubry , Minh-Tri Do Khac
发明人： Douglas Dykeman , Michael Osbourne , Paolo Scotton , Olen Stokes , Claude Basso , Marianne Aubry , Minh-Tri Do Khac
IPC分类号： G06F15/16
CPC分类号： H04L29/12254 , H04L29/12009 , H04L29/12783 , H04L29/12801 , H04L41/0893 , H04L41/12 , H04L45/02 , H04L45/04 , H04L49/3081 , H04L61/2038 , H04L61/35 , H04L61/6004 , H04L2012/5621 , H04L2012/5627 , H04L2012/5685 , H04Q11/0478
摘要： Address management methods and apparatus are provided for a node serving as peer group leader for a peer group of nodes in one level of the hierarchy of a PNNI hierarchical network, whereby the peer group leader represents the peer group to one or more neighboring nodes in the next level up of the hierarchy. The peer group leader has a memory (2) for storing peer group topology data (4), comprising address data which is supplied to the peer group leader from nodes in the peer group and represents addresses for access by the network, and peer group leader topology data (5), comprising address data which is supplied to said neighboring nodes by the peer group leader and represents addresses accessible via the peer group. The address management method comprises: checking whether addresses represented by said address data are accessible via the peer group; notifying said neighboring nodes of changes in the accessibility of addresses so identified; and updating said peer group leader topology data (5) in accordance with said changes.
摘要翻译： 为PNNI分级网络的层级的一个级别中的对等组节点作为对等组组长的节点提供地址管理方法和装置，由此对等组组长表示对等体组到一个或多个相邻节点 下一级别的层次结构。 对等组组长具有用于存储对等组群拓扑数据（4）的存储器（2），包括从对等组中的节点提供给对等组组长的地址数据，表示网络接入的地址和对等组组长 拓扑数据（5），包括由对等组组长提供给所述相邻节点并且表示经由对等组可访问的地址的地址数据。 地址管理方法包括：检查由所述地址数据表示的地址是否可通过对等体组访问; 通知所述相邻节点对所识别的地址的可访问性的变化; 以及根据所述改变更新所述对等群组领导拓扑数据（5）。
-
-
-
-
-
-
-
-
-
搜索结果
33 条记录 (耗时 0.023 秒)
