公开(公告)号：US20090253878A1

公开(公告)日：2009-10-08

申请号：US12394540

申请日：2009-02-27

Applicant: Zhibin Ye ,  Jianli Wang ,  Kejian Zhang

Inventor： Zhibin Ye ,  Jianli Wang ,  Kejian Zhang

IPC: C08F22/10 ,  C08F2/00

CPC classification number: C08F210/02 ,  C08F110/02 ,  C08F4/80 ,  C08F2500/09 ,  C08F220/26

Abstract: A polyolefin polymer comprising one or more terminal polymerizable methacryloyl groups (i.e. tethered to the main body of the polymer) and a novel process for preparing same are herein disclosed. A hyperbranched polyethylene polymer and a process for preparing same are also disclosed. The polymer is prepared by a novel one-pot copolymerization reaction of an olefin, such as ethylene, and a heterobifunctional comonomer comprising a methacryloyl group, catalyzed by a late transition metal α-diimine catalyst which is selectively non-reactive towards methacryloyl groups. The process allows for preparation of polymers with various chain topologies, including linear, branched, and hyperbranched topologies. The terminal methacryloyl groups within the polymer are reactive in further polymerization reactions. Thus, the polymer may be used in materials and applications which require cross-linking or further polymerization, for example, UV/thermal/radical curable crosslinkers for use in thermoset applications.

Abstract translation: 本文公开了包含一个或多个末端可聚合甲基丙烯酰基（即与聚合物的主体连接的聚烯烃）的聚烯烃聚合物及其制备方法。 还公开了一种超支化聚乙烯聚合物及其制备方法。 聚合物通过烯烃如乙烯的新型单罐共聚反应和包含甲基丙烯酰基的异双官能共聚单体制备，由对过甲基丙烯酰基的选择性不反应的后过渡金属α-二亚胺催化剂催化。 该方法允许制备具有各种链拓扑的聚合物，包括线性，支化和超支化拓扑。 聚合物内的末端甲基丙烯酰基在进一步的聚合反应中具有反应性。 因此，聚合物可以用于需要交联或进一步聚合的材料和应用中，例如用于热固性应用的UV /热可固化交联剂。

公开(公告)号：US06301244B1

公开(公告)日：2001-10-09

申请号：US09208980

申请日：1998-12-11

Applicant: Kaiyuan Huang ,  Gang Luo ,  Jianli Wang

Inventor： Kaiyuan Huang ,  Gang Luo ,  Jianli Wang

IPC: H04L1228

CPC classification number: H04L45/12 ,  H04L45/124

Abstract: A method is described for one-to-all route selection in Communications Networks with multiple QoS metrics. This method takes a first metric (say, delay) as a constraint and a second metric (say, cost) as an optimization target. A potential objective is to find a path between a source node and each node in a communications network such that the delay of the path does not exceed a path delay constraint and the cost of the path is minimized. The method selects a first path which is a shortest path from a source node to each node in terms of the first metric using Dijkstra's algorithm. A reachability graph is then constructed based on the first metric path constraint. Within the reachability graph, another path is found, which is a shortest path from a source node to each node in terms of the second metric, using Dijkstra's algorithm. Any path to a particular node selected within the reachability graph replaces the first path to said particular node. This method can guarantee to find a nearly optimal path with the given constraint satisfied as long as there exists such a path.

Abstract translation: 描述了具有多个QoS度量的通信网络中的一对一路由选择的方法。 该方法将第一个度量（例如延迟）作为约束和第二个度量（例如，成本）作为优化目标。 潜在的目标是在通信网络中找到源节点和每个节点之间的路径，使得路径的延迟不超过路径延迟约束并且路径的成本被最小化。 该方法使用Dijkstra算法从第一个度量中选择一个从源节点到每个节点的最短路径。 然后基于第一度量路径约束构建可达性图。 在可达性图中，使用Dijkstra算法，找到另一个路径，该路径是从源节点到第二个度量的每个节点的最短路径。 到达可达性图中选择的特定节点的任何路径将替换到所述特定节点的第一路径。 只要存在这样的路径，该方法可以保证找到具有给定约束的几乎最优路径。

公开(公告)号：US06377551B1

公开(公告)日：2002-04-23

申请号：US09134924

申请日：1998-08-17

Applicant: Gang Luo ,  Kaiyuan Huang ,  Jianli Wang

Inventor： Gang Luo ,  Kaiyuan Huang ,  Jianli Wang

IPC: H04L1228

CPC classification number: H04L45/12 ,  H04L45/124 ,  H04L45/306

Abstract: A method is described for route computation in Communications Networks with multiple QoS metrics. This method takes a metric (say, cost) as an optimization target and the other metric (say, delay) as a constraint. A communication network with multiple QoS metrics associated to its links is modelled as a graph with multiple QoS metrics as weights associated to its links. The method associates constraints with nodes in the graph after generating a minimum spanning tree based at a destination node using Dijkstra's algorithm with the constraint metric as link weight. A set is populated with nodes whose path to the destination node satisfies given constraints while endeavouring to optimize another QoS metric. A path may be computed by selecting, from the set, the destination node and associated predecessor nodes through to the start node. The algorithm of the method is very efficient and its computational complexity is O(n2). This method can guarantee to find a nearly optimal path with the given constraint satisfied as long as there exists such a path.

Abstract translation: 描述了具有多个QoS度量的通信网络中的路由计算的方法。 该方法将度量（例如，成本）作为优化目标，另一个度量（例如，延迟）作为约束。 具有与其链接相关联的多个QoS度量的通信网络被建模为具有多个QoS度量作为与其链接相关联的权重的图。 该方法在使用Dijkstra算法，以约束度量为链路权重的目的地节点生成最小生成树后，将约束与图中的节点相关联。 一个集合中填充有到目的节点的路径满足给定约束的节点，同时努力优化另一个QoS度量。 可以通过从集合中选择目的地节点和相关联的前导节点到开始节点来计算路径。 该方法的算法非常有效，其计算复杂度为O（n2）。 只要存在这样的路径，该方法可以保证找到具有给定约束的几乎最优路径。

公开(公告)号：US06898278B1

公开(公告)日：2005-05-24

申请号：US09567136

申请日：2000-05-08

Applicant: Li Li ,  Edward Ndububa ,  Samuel Chen ,  Jianping Jiang ,  Jianli Wang ,  Chunsheng Xie ,  Tu Do ,  Frank Xu ,  Yi Oin ,  Zoran Milojevic ,  Anna Cheung ,  Andre Moskal

Inventor： Li Li ,  Edward Ndububa ,  Samuel Chen ,  Jianping Jiang ,  Jianli Wang ,  Chunsheng Xie ,  Tu Do ,  Frank Xu ,  Yi Oin ,  Zoran Milojevic ,  Anna Cheung ,  Andre Moskal

IPC: H04L29/06 ,  H04M7/00 ,  H04Q3/00 ,  H04M5/00

CPC classification number: H04L65/1069 ,  H04L29/06027 ,  H04L65/4007 ,  H04M7/006 ,  H04Q3/0025 ,  H04Q3/0045

Abstract: A signalling switch for use in information protocol telephony is provided, which can initiate, sustain, and terminate a plurality of discrete voice and data calls simultaneously. A plurality of cards are mounted on a computer bus, where the first card is a single board computer whose function is to act as the operations and maintenance control card for the switch. A non-system card functions as a message transport controller card; and there is at least one further non-system card which functions as a master application controller card. Local bus communication among the non-system cards is provided by a local bus found on the message transport controller card. Telephone routing information protocol software is resident in the switch, and the switch communicates externally via Ethernet interfaces. Thus, the signalling switch may be positioned in an information protocol telephony network environment to initiate, sustain, and terminate connections between a client and the network or the network and a client, under the control of the resident telephone routing information protocol software.

Abstract translation: 提供了用于信息协议电话的信令交换机，其可以同时发起，维持和终止多个离散语音和数据呼叫。 多个卡安装在计算机总线上，其中第一卡是单板计算机，其功能是充当开关的操作和维护控制卡。 非系统卡作为消息传输控制卡; 并且存在至少一个用作主应用控制器卡的非系统卡。 非系统卡之间的本地总线通信由在消息传输控制器卡上发现的本地总线提供。 电话路由信息协议软件驻留在交换机中，交换机通过以太网接口从外部通信。 因此，信令交换机可以位于信息协议电话网络环境中，以在驻留的电话路由信息协议软件的控制下发起，维持和终止客户端与网络或网络以及客户端之间的连接。

公开(公告)号：US06477582B1

公开(公告)日：2002-11-05

申请号：US09212429

申请日：1998-12-16

Applicant: Gang Luo ,  Jianli Wang ,  Glenn Sutherland

Inventor： Gang Luo ,  Jianli Wang ,  Glenn Sutherland

IPC: G06F1300

CPC classification number: H04L47/24 ,  H04L45/04 ,  H04L45/10 ,  H04L45/124 ,  H04L47/16 ,  H04L2012/5621 ,  H04L2012/5629 ,  H04L2012/5632

Abstract: A method is described for path selection in communications networks with multiple QoS metrics. This method takes an additive metric (say, cost) as a path minimization target and a concave metric (say, bandwidth) as a minimum requirement for each link. A potential objective is to find a path between a source node and a destination node in a communications network such that the bandwidth of each link in the path exceeds a bandwidth requirement and the cost of the path is minimized. The method eliminates from consideration those links whose available bandwidth does not exceed a required bandwidth. The method then reassigns the cost of those links whose available bandwidth does not exceed a function of the required bandwidth. A path from the source node to the destination node is then selected, using only links still under consideration, corresponding to a path wherein cost is minimized.

Abstract translation: 描述了具有多个QoS度量的通信网络中的路径选择的方法。 该方法作为路径最小化目标和凹度度量（例如，带宽）作为每个链路的最小要求，采用附加度量（例如，成本）。 潜在的目标是在通信网络中找到源节点和目的地节点之间的路径，使得路径中的每个链路的带宽超过带宽需求，并且路径的成本被最小化。 该方法不考虑可用带宽不超过所需带宽的链路。 然后，该方法重新分配可用带宽不超过所需带宽的功能的那些链路的成本。 然后，从源节点到目的地节点的路径，仅使用仍在考虑的链路，对应于成本最小化的路径。