-
公开(公告)号：US4843567A
公开(公告)日：1989-06-27
申请号：US79721
申请日：1987-07-30
CPC分类号： G06N5/003 , Y10S706/908
摘要： A system for the adaptive reordering of sequential decisions in the search of a data base is provided with a device that simplifies and speeds up a heuristic search method by implementing in hardware the computation required for the adaptive reordering. The system includes an arithmetic unit for computing for each decision the ratio p/c where p is the probability of a successful outcome of the decision and c is the cost of computation to make that decision. The arithmetic unit includes a device for estimating the logarithms of the prabability p and the cost c for each decision. Logarithms of ratios p/c are calculated for each decision by subtracting the log c from the log p, and then the logarithms of the ratios for the decisions are compared to produce a priority value for each decision. The decisions are reordered based on the priority value assigned to each decision to obtain the optimal ordering of the decisions.
-
公开(公告)号：US4752890A
公开(公告)日：1988-06-21
申请号：US885101
申请日：1986-07-14
IPC分类号： G06F9/44 , G06F15/18 , G06F17/30 , G06N3/00 , G06N5/00 , G06N5/04 , G06N99/00 , G06F15/46 , G06K9/62
CPC分类号： G06N5/04 , G06N5/003 , Y10S706/908 , Y10S706/922
摘要： An adaptive mechanism is presented in the context of optimization of expert system applications. Both single and multiple processor implementations are disclosed. The mechanism is used to maintain a near-optimal sequence for scanning rule lists in expert systems. For a program containing a sequential-decision chain with many independent or mutually exclusive outcomes with each decision having associated with it some fixed cost and probability, the adaptive mechanism tends to produce the optimal ordering automatically from repeated observations of the execution of the decision chain.
摘要翻译： 在专家系统应用优化的背景下提出了一种适应机制。 公开了单处理器和多处理器实现。 该机制用于维护专家系统中扫描规则列表的近似最佳顺序。 对于包含具有许多独立或互斥结果的顺序决策链的程序，每个决定与其相关联具有固定的成本和概率，所以自适应机制倾向于从对决策链的执行的反复观察中自动产生最佳排序。
-
3.发明授权公开(公告)号：US08509788B2
公开(公告)日：2013-08-13
申请号：US11683719
申请日：2007-03-08
摘要： Various embodiments are described to enable multiple, independent communication networks to share in an autonomous and dynamic manner unlicensed wireless resources. Generally, this involves determining that a first network node (122) is using at least a portion of a wireless resource to provide network service to at least one remote unit (102). A second network node (123), under the control of a different network operator than the first node and desiring to use the wireless resource, sends the first network node, a request to relinquish use of at least a portion of the wireless resource. The second network node sends this request wirelessly, perhaps using the wireless resource itself. If the first network node grants the request, the second node may then begin using at least a portion of the relinquished resource to provide network service.
摘要翻译： 描述了各种实施例以使得多个独立的通信网络以自主和动态方式共享非授权无线资源。 通常，这涉及确定第一网络节点（122）正在使用无线资源的至少一部分来向至少一个远程单元（102）提供网络服务。 第二网络节点（123）在与第一节点不同的网络运营商的控制下并且希望使用无线资源的情况下，发送第一网络节点，放弃使用无线资源的至少一部分的请求。 第二个网络节点可以无线地发送此请求，也许使用无线资源本身。 如果第一网络节点授权请求，则第二节点可以开始使用放弃资源的至少一部分来提供网络服务。
-
4.发明授权Low complexity protocol method device and system robust in the presence of bursted 失效低复杂度的协议方法设备和系统在存在突发干扰的情况下鲁棒
公开(公告)号：US6157632A
公开(公告)日：2000-12-05
申请号：US893332
申请日：1997-07-16
CPC分类号： H04W28/06 , H04L1/1809 , H04L1/1887 , H04W16/14
摘要： The present invention provides a method/protocol (400, 800) and device (600; 700) for transmitting a synchronous stream of information, in a wireless, centrally controlled communication system. The method includes the steps of parsing the synchronous stream of information into a plurality of predetermined fixed sized blocks and transmitting/retransmitting each fixed size block in a predetermined window of time until one of: reception of each fixed size block is positively acknowledged and each corresponding predetermined window of time has elapsed.
摘要翻译： 本发明提供了一种用于在无线中央控制的通信系统中发送同步信息流的方法/协议（400,800）和设备（600; 700）。 该方法包括以下步骤：将信息的同步流解析成多个预定的固定大小的块，并在预定的时间窗口中发送/重传每个固定大小的块，直到每个固定大小块的接收被肯定地确认，并且每个对应 预定的时间窗已经过去了。
-
公开(公告)号：US5608721A
公开(公告)日：1997-03-04
申请号：US415800
申请日：1995-04-03
CPC分类号： H04Q3/66
摘要： A communications network (20) includes any number of moving switching nodes (30) and a route-determining node (28). The route-determining node (28) performs an off-line procedure (58) to define a-priori routing for the entire network. This procedure (58) is performed repetitively to track switching node (30) movement and to define routing for numerous epochs included in a planning period. The procedure (58) includes a process (86) for determining all shortest path routes between all possible origination and destination switching nodes (30). Another process (84) matches predicted call traffic for a subject epoch with the shortest path routes. Another process (88) generates routing code tables (54) in response to the predicted call traffic matched to shortest path routes. This process (88) assigns logical routing IDs (52) to physically distinct, shortest path routes in proportion to the predicted call traffic allocated to the distinct routes.
摘要翻译： 通信网络（20）包括任何数量的移动交换节点（30）和路线确定节点（28）。 路由确定节点（28）执行离线过程（58）以定义整个网络的先验路由。 重复地执行该过程（58）以跟踪切换节点（30）移动，并且定义包括在规划周期中的多个历元的路由。 过程（58）包括用于确定所有可能的发起和目的地交换节点（30）之间的所有最短路径路由的过程（86）。 另一个过程（84）将主体时期的预测呼叫业务与最短路径路由进行匹配。 响应于与最短路径路由匹配的预测呼叫业务，另一进程（88）生成路由代码表（54）。 该过程（88）将逻辑路由ID（52）分配给与分配给不同路由的预测呼叫流量成比例的物理上不同的最短路径路由。
-
6.发明授权Hybrid backtrack/lookahead search technique for constraint-satisfaction problems 失效用于约束满足问题的混合回溯/前瞻搜索技术
公开(公告)号：US5228115A
公开(公告)日：1993-07-13
申请号：US835010
申请日：1992-02-12
IPC分类号： G06Q10/04
CPC分类号： G06Q10/04
摘要： A method of solving a constraint-satisfaction problem with a data processor includes the steps of (a) providing a search tree structure (10) representing a plurality (N) of variables (X), the search tree structure having a plurality of levels; (b) searching (L) shallow levels of the search tree structure by employing a backtrack search method wherein (L) is less than or equal to a specified value H; and (c) searching (M) remaining, deeper, levels of the search tree structure by employing a lookahead search method. The step of searching (L) shallow levels of the search tree structure includes a step of binding a set of X.sub.1 through X.sub.H variables each to an element from its domain such that no constraints are violated. The step of searching (M) remaining, deeper, levels of the search tree structure includes the steps of, given the bindings for the set of variables X.sub.1 through X.sub.H, determining for each variable X.sub.i, H
摘要翻译： 一种解决数据处理器的约束满足问题的方法包括以下步骤：（a）提供表示多个（N）个变量（X）的搜索树结构（10），所述搜索树结构具有多个级别; （b）通过采用其中（L）小于或等于指定值H的回溯搜索方法来搜索（L）搜索树结构的浅层级; 和（c）通过采用前瞻搜索方法搜索（M）搜索树结构的剩余，更深层次。 搜索（L）搜索树结构的浅层级的步骤包括将一组X1到XH变量各自绑定到来自其域的元素的步骤，使得不会违反约束。 搜索（M）搜索树结构的剩余，更深层次的步骤包括以下步骤：给定该组变量X1至XH的绑定，确定每个变量Xi，H
-
7.发明申请METHOD AND APPARATUS FOR DISTRIBUTED BANDWIDTH ASSIGNMENT IN MESH BACKHAUL NETWORKS 审中-公开网格反向网络中分布式带宽分配的方法与装置公开(公告)号：US20080151833A1
公开(公告)日：2008-06-26
申请号：US11613457
申请日：2006-12-20
IPC分类号： H04Q7/00
摘要： A system for distributing bandwidth in a mesh network includes a first access point (AP1) that determines an amount of data to be sent from the first access point to the second access point (AP2) and receives a value indicating an amount of data to be received from the second access point. The first access point (AP1) then determines a percentage of a frame (I) to be used to send the data from the first access point to the second access point by multiplying the total data-carrying portion (206, 210) of the frame (I) by the amount of data to be sent from the first access point to the second access point divided by the sum of the amount of data to be sent from the first access point to the second access point and the amount of data to be received from the second access point.
摘要翻译： 用于在网状网络中分配带宽的系统包括：第一接入点（AP 1），其确定要从第一接入点发送到第二接入点（AP 2）的数据量，并接收指示数据量的值 从第二接入点接收。 第一接入点（AP1）然后通过将总数据携带部分（206,210）乘以第一接入点（AP1）来确定要用于将数据从第一接入点发送到第二接入点的帧（I）的百分比， 帧（I）通过从第一接入点发送到第二接入点的数据量除以将从第一接入点发送到第二接入点的数据量之和和数据量到 从第二个接入点接收。
-
8.发明申请METHOD AND APPARATUS FOR TRANSMITTING A SUPERFRAME ACROSS A COMMUNICATION NETWORK 有权用于在通信网络之间传输超级帧的方法和装置公开(公告)号：US20080144567A1
公开(公告)日：2008-06-19
申请号：US11612617
申请日：2006-12-19
IPC分类号： H04Q7/00
CPC分类号： H04W72/005 , H04W4/08
摘要： A method and apparatus includes a scheduling entity (308) for scheduling and transmitting the superframe (402) across a communication network (200). The controller (310) coupled with scheduling entity (308) groups the subscriber unit (304) into one of the plurality of groups. The scheduler entity (308) assigns a coding scheme for each group and encodes each frame of the superframe (402) based upon the assigned coding scheme for the group, to which the frame is to be transmitted. The transceiver (316) coupled with controller (310) via hardware interface (314) receives the encoded superframe and transmits the superframe to the plurality of subscriber units in the communication network (200).
摘要翻译： 一种方法和装置包括：调度实体（308），用于跨越通信网络（200）调度和发送超帧（402）。 与调度实体（308）耦合的控制器（310）将用户单元（304）分组成多个组中的一个组。 调度器实体（308）为每个组分配编码方案，并根据为该帧要发送的组的分配的编码方案对超帧（402）的每个帧进行编码。 经由硬件接口（314）与控制器（310）耦合的收发器（316）接收经编码的超帧，并将该超帧发送到通信网络（200）中的多个用户单元。
-
公开(公告)号：US6072774A
公开(公告)日：2000-06-06
申请号：US841877
申请日：1997-05-05
CPC分类号： H04B7/1856
摘要： A communication network (20) includes a multiplicity of switching nodes (18), many of which are located in orbiting satellites (16). Communication links (30) interconnect the switching nodes (18). A control center (32) performs a request for connection process (40) which routes a new call request over a current internodal topology of links (35) if possible. If the new call request cannot be routed over the current internodal topology of links (35), the process (40) determines how to augment the network with the creation of new links (45) so that the new call can be routed. As calls terminate, unused links are taken out of service.
摘要翻译： 通信网络（20）包括多个交换节点（18），其中许多交换节点（18）位于轨道卫星（16）中。 通信链路（30）互连交换节点（18）。 如果可能，控制中心（32）执行对连接过程（40）的请求，该请求路由新的呼叫请求超过当前节点的节点拓扑（35）。 如果新的呼叫请求不能通过链路（35）的当前节点间拓扑路由，则过程（40）确定如何通过创建新链路（45）来增加网络，使得可以路由新的呼叫。 随着呼叫终止，未使用的链路被取消服务。
-
10.发明授权Admission control system and method in space-based mobile telecommunication system 失效天基移动通信系统中的接入控制系统和方法
公开(公告)号：US5826169A
公开(公告)日：1998-10-20
申请号：US533125
申请日：1995-09-25
IPC分类号： H04B7/185
CPC分类号： H04B7/18558
摘要： The call admission control method provides guaranteed bandwidth connections in a mobile telecommunication networks (10) that have varying topology and dynamic capacities. Method (100) provides a systematic way to decide when to admit connection requests in a low-earth or medium-earth orbit based satellite telecommunication system (10). A call admission controller, located in a ground control station (40) receives a connection request from an earth station (50) that may be forwarded from a satellite (21) in a constellation (20) of satellites. The call admission controller segments a call holding time into a sequence of time segments and determines whether a path exists through the network (10) that has the required minimum bandwidth for each of the time segments. If such a path exists, the connection request is admitted and the call goes through. Otherwise, the call is denied and communication is blocked.
摘要翻译： 呼叫接纳控制方法在具有变化的拓扑和动态容量的移动电信网络（10）中提供有保证的带宽连接。 方法（100）提供一种系统的方式来决定何时在低地球或中等地球轨道的卫星电信系统（10）中接纳连接请求。 位于地面控制站（40）中的呼叫许可控制器从卫星的星座（20）中的卫星（21）接收来自地球站（50）的连接请求。 呼叫接纳控制器将呼叫保持时间分成时间序列，并且确定是否存在通过网络（10）存在的每个时间段具有所需最小带宽的路径。 如果存在这样的路径，则连接请求被允许并且呼叫通过。 否则，呼叫被拒绝，通信被阻止。
-
-
-
-
-
-
-
-
-
搜索结果
38 条记录 (耗时 0.021 秒)
