会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • Combination dosing regimen for erythropoietin
    • 红细胞生成素联合给药方案
    • US20050267026A1
    • 2005-12-01
    • US11088284
    • 2005-03-24
    • Wing Cheung
    • Wing Cheung
    • A61K38/18
    • A61K38/1816
    • The present invention provides a combination dosing regimen for erythropoietin (EPO). More particularly, the present dosing regimen includes administration of at least a first dosing segment comprising a first exposure to EPO capable of stimulating the production of reticulocytes followed by a second exposure to EPO capable of sustaining the maturation of the reticulocytes into neocytes, and ultimately, red blood cells. Advantageously, the dosing segment may be cycled or repeated, any number of times and according to any desired time scheme, in order to provide or maintain any desired total red blood cell count and/or hemoglobin concentration. Methods of treatment employing the combination dosing regimen, as well as kits are also provided.
    • 本发明提供促红细胞生成素(EPO)的组合给药方案。 更具体地,本发明的给药方案包括施用至少第一给药段,其包含能够刺激网织红细胞生成的EPO的第一次暴露,然后第二次暴露于能够维持网织红细胞成熟为新细胞的EPO, 红细胞。 有利地,给药段可以循环或重复任意次数,并且根据任何期望的时间方案,以便提供或维持任何期望的总红细胞计数和/或血红蛋白浓度。 还提供了使用联合给药方案的治疗方法以及试剂盒。
    • 4. 发明授权
    • Apparatus and method for performing look-ahead scheduling of DMA
transfers of data from a host memory to a transmit buffer memory
    • 用于执行从主机存储器到发送缓冲存储器的数据DMA传输的预先调度的装置和方法
    • US5970229A
    • 1999-10-19
    • US707896
    • 1996-09-12
    • Robert E. ThomasPeter J. RomanWing Cheung
    • Robert E. ThomasPeter J. RomanWing Cheung
    • G06F13/38G06F13/00
    • G06F13/387
    • An apparatus and method for transferring data from a source memory (e.g. a host memory) to a peripheral interface via a bus utilizes a transmit buffer memory coupled to the peripheral interface, and a current time counter advancing at the rate at which data is to be transferred from the transmit buffer memory to the peripheral interface. A schedule table data structure stores entries in some or all of its locations, where each location corresponds to a point in time at which data is to be transferred from the transmit buffer memory to the peripheral interface. A schedule table pointer is used for pointing to successive locations in the schedule table. The schedule table pointer advances at a rate faster than the current time counter advances so that the schedule table pointer represents a point in time which is ahead of the point in time currently output by the current time counter. A data transfer is initiated from the source memory to the transmit buffer memory via the bus when a valid entry is stored at the location in the schedule table pointed to by the schedule table pointer. The data is then transferred out of the transmit buffer memory to the peripheral interface when the current time counter reaches the value representing at least the same point in time that was represented by the schedule table pointer when the data transfer was initiated. Data transfers from the transmit buffer memory are thereby synchronized in time with their corresponding entries in the schedule table.
    • 用于经由总线将数据从源存储器(例如,主机存储器)传送到外围接口的装置和方法利用耦合到外围接口的发送缓冲存储器和以数据的速率前进的当前时间计数器 从发送缓冲存储器传送到外设接口。 调度表数据结构存储其部分或全部位置中的条目,其中每个位置对应于将数据从发送缓冲存储器传送到外围接口的时间点。 调度表指针用于指向调度表中的连续位置。 调度表指针以比当前时间计数器更快的速率前进,使得调度表指针表示在当前时间计数器当前输出的时间点之前的时间点。 当有效条目存储在调度表指针指向的调度表中的位置时,通过总线从源存储器发送到发送缓冲存储器的数据传输。 然后,当当前时间计数器达到表示数据传输启动时由调度表指针表示的至少相同的时间点的值时,将数据传送到发送缓冲存储器中的外设接口。 因此,从发送缓冲存储器的数据传输在时间上与其在调度表中的相应条目同步。
    • 5. 发明授权
    • Apparatus and method for transferring data from a transmit buffer memory
at a particular rate
    • 用于以特定速率从发送缓冲存储器传送数据的装置和方法
    • US5941952A
    • 1999-08-24
    • US712687
    • 1996-09-12
    • Robert E. ThomasPeter J. RomanWing Cheung
    • Robert E. ThomasPeter J. RomanWing Cheung
    • H04L12/56H04Q11/04G06F13/38G06F15/17
    • H04Q11/0478H04L2012/5616H04L2012/5635H04L2012/5658H04L2012/5664H04L2012/5667H04L2012/5679H04L2012/5681
    • An apparatus and method for transferring data from a source memory to a transmit buffer memory and then from the transmit buffer memory at a particular rate. A current time counter advances at the rate at which data is to be transmitted from the transmit buffer memory to the interface. A schedule memory stores entries, each valid entry being associated with data that is to be transmitted from the transmit buffer memory to the interface. A timestamp is associated with each valid entry in the schedule memory. Circuitry is then operative on each valid entry read from the schedule table to generate a request for a data transfer between the source memory and the transmit buffer memory; perform a data transfer from the source memory to the transmit buffer memory in response to the request; and transfer the data from the transmit buffer memory when the current time circuitry output reaches a value representing at least the same point in time that is represented by the timestamp associated with the entry for which the request was generated.
    • 一种用于将数据从源存储器传送到发送缓冲存储器然后以特定速率从发送缓冲存储器传送的装置和方法。 当前时间计数器以数据从发送缓冲存储器发送到接口的速率前进。 调度存储器存储条目,每个有效条目与要从发送缓冲存储器发送到接口的数据相关联。 时间戳与调度存储器中的每个有效条目相关联。 然后对从调度表读取的每个有效条目进行电路以产生对源存储器和发送缓冲存储器之间的数据传输的请求; 响应于该请求,执行从源存储器到发送缓冲存储器的数据传输; 并且当当前时间电路输出达到表示与由生成请求的条目相关联的时间戳表示的至少相同的时间点的值时,传送来自发送缓冲存储器的数据。
    • 7. 发明申请
    • Longest Prefix Match Scheme
    • 最长前缀匹配方案
    • US20130031077A1
    • 2013-01-31
    • US13284829
    • 2011-10-28
    • Jian LiuPhilip Lynn LeichtyHow Tung LimJohn Michael TerryMahesh Srinivasa MadduryWing CheungKung Ling Ko
    • Jian LiuPhilip Lynn LeichtyHow Tung LimJohn Michael TerryMahesh Srinivasa MadduryWing CheungKung Ling Ko
    • G06F17/30
    • G06F7/02H04L45/7457H04L45/748
    • A LPM search engine includes a plurality of exact match (EXM) engines and a moderately sized TCAM. Each EXM engine uses a prefix bitmap scheme that allows the EXM engine to cover multiple consecutive prefix lengths. Thus, instead of covering one prefix length L per EXM engine, the prefix bitmap scheme enables each EXM engine to cover entries having prefix lengths of L, L+1, L+2 and L+3, for example. As a result, fewer EXM engines are potentially underutilized, which effectively reduces quantization loss. Each EXM engine provides a search result with a determined fixed latency when using the prefix bitmap scheme. The results of multiple EXM engines and the moderately sized TCAM are combined to provide a single search result, representative of the longest prefix match. In one embodiment, the LPM search engine supports 32-bit IPv4 (or 128-bit IPv6) search keys, each having associated 15-bit level 3 VPN identification values.
    • LPM搜索引擎包括多个精确匹配(EXM)引擎和中等大小的TCAM。 每个EXM引擎使用前缀位图方案,允许EXM引擎涵盖多个连续的前缀长度。 因此,代替覆盖每个EXM引擎的一个前缀长度L,例如,前缀位图方案使得每个EXM引擎能够覆盖具有前缀长度为L,L + 1,L + 2和L + 3的条目。 因此,较少的EXM引擎潜在地未充分利用,这有效地减少了量化损失。 当使用前缀位图方案时,每个EXM引擎提供具有确定的固定延迟的搜索结果。 多个EXM引擎和中等大小的TCAM的结果被组合以提供单个搜索结果,代表最长的前缀匹配。 在一个实施例中,LPM搜索引擎支持32位IPv4(或128位IPv6)搜索密钥,每个具有关联的15位3级VPN标识值。