中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

38 records (took 0.028 seconds)

    9-amino-14-membered macrolides derived from leucomycins
    31.
    发明授权
    9-amino-14-membered macrolides derived from leucomycins 失效
    衍生自莱可霉素的9-氨基-14-元大环内酯类

    公开(公告)号：US06436906B1

    公开(公告)日：2002-08-20

    申请号：US09824318

    申请日：2001-04-02

    Applicant: Yat Sun Or ,  Nha Vo ,  Jianchao Wang ,  Ly Tam Phan

    Inventor： Yat Sun Or ,  Nha Vo ,  Jianchao Wang ,  Ly Tam Phan

    IPC: A61K3170

    CPC classification number: C07H17/08 ,  A61K31/70

    Abstract: Novel 9-amino-14-membered macrolides and pharmaceutically-acceptable compositions comprising a therapeutically effective amount of a compound of the invention in combination with a pharmaceutically acceptable carrier, a method for treating bacterial infections by administering to a mammal a pharmaceutical composition containing a therapeutically-effective amount of a compound of the invention and processes for the preparation of such compounds.

    Abstract translation: 新型9-氨基-14-元大环内酯和药学上可接受的组合物，其包含治疗有效量的本发明化合物与药学上可接受的载体的组合，通过向哺乳动物施用药物组合物来治疗细菌感染的方法， - 本发明化合物的有效量和制备这些化合物的方法。

    Self-routing multicast network architecture
    32.
    发明授权
    Self-routing multicast network architecture 失效
    自路由组播网络架构

    公开(公告)号：US06201808B1

    公开(公告)日：2001-03-13

    申请号：US09049101

    申请日：1998-03-27

    Applicant: Jianchao Wang ,  Yuanyuan Yang

    Inventor： Jianchao Wang ,  Yuanyuan Yang

    IPC: H04L1256

    CPC classification number: H04L12/18

    Abstract: A new self-routing multicast network that can realize arbitrary multicast (or one-to-many) communication without any blocking. Based on the binary radix sorting, all functional components of the network are recursively constructed reverse banyan networks using a self-routing procedure that provides for pipeline distribution of switch settings. The design allows a potential to greatly reduce the network cost by reusing part of the network. The new multicast network has O(n log2 n) cost (logic gates), O(log2 n) gate delay, and O(log2 n) set-up time, where the unit of time is a gate delay. Further, with feedback part of the network can be reused and the network cost is reduced to O(n log n).

    Abstract translation: 一种新的自路由组播网络，可以实现任意组播（或一对多）通信，无需任何阻塞。 基于二进制基数排序，网络的所有功能组件都使用提供开关设置的管道分配的自路由过程递归构造的反向榕树网络。 该设计允许通过重用部分网络来大大降低网络成本。 新的组播网络具有O（n log2 n）成本（逻辑门），O（log2 n）门延迟和O（log2 n）建立时间，其中时间单位是门延迟。 此外，由于网络的反馈部分可以重复使用，网络成本降低到O（n log n）。

    Generic approach to generating permutations for all-to-all personalized exchange for self-routing multistage interconnection networks
    37.
    发明授权
    Generic approach to generating permutations for all-to-all personalized exchange for self-routing multistage interconnection networks 有权
    用于自我路由多级互连网络的一对一个性化交换的一般方法

    公开(公告)号：US06456838B1

    公开(公告)日：2002-09-24

    申请号：US09251676

    申请日：1999-02-17

    Applicant: Jianchao Wang ,  Yuanyuan Yang

    Inventor： Jianchao Wang ,  Yuanyuan Yang

    IPC: H04Q720

    CPC classification number: H04Q3/68

    Abstract: Disclosed is a method for all-to-all personalized exchange for a class of multistage interconnecting networks (MINs). The method is based on a Latin square matrix corresponding to a set of admissible permutations of a multistage interconnecting network. Disclosed are first and second methods for constructing a Latin square matrix used in the personalized exchange technique. Also disclosed is a generic method for decomposing all-to-all personalized exchange patterns into admissible permutations to form the Latin square matrix for self-routing networks which are a subclass of the MINs.

    Abstract translation: 公开了一种用于一类多级互连网络（MIN）的全面个性化交换的方法。 该方法基于与多级互连网络的一组可接受排列相对应的拉丁方阵。 公开了用于构建在个性化交换技术中使用的拉丁方阵的第一和第二种方法。 还公开了一种用于将所有对所有个性化交换模式分解为可接受置换的通用方法，以形成作为MIN的子类的自路由网络的拉丁方阵。

Patent Agency Ranking