利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

87 条记录 (耗时 0.036 秒)

    Process for the preparation of non-toxic anthrax vaccine
    74.
    发明授权
    Process for the preparation of non-toxic anthrax vaccine 失效
    无毒性炭疽疫苗的制备工艺

    公开(公告)号：US07888490B2

    公开(公告)日：2011-02-15

    申请号：US10497673

    申请日：2002-03-20

    申请人： Rakesh Bhatnagar ,  Pankaj Gupta ,  Smriti Batra ,  Vibha Chauhan ,  Aparna Singh ,  Nidhi Ahuja ,  Praveen Kumar

    发明人： Rakesh Bhatnagar ,  Pankaj Gupta ,  Smriti Batra ,  Vibha Chauhan ,  Aparna Singh ,  Nidhi Ahuja ,  Praveen Kumar

    IPC分类号： C07H21/04 ,  C07H21/02 ,  A61K39/07

    CPC分类号： C07K14/32 ,  A61K39/00

    摘要： Anthrax toxin, comprising of protective antigen (PA), lethal factor (LF) and edema factor (EF) is a major virulent factor of B. anthracis. Protective antigen, PA is the main component of all the vaccines against anthrax. The protective efficacy of PA is greatly increased if small quantities of LF of EF are incorporated into the vaccines. An ideal vaccine against anthrax should contain PA, LF and EF together, but this combination would be toxic. Therefore, the biologically inactive mutant preparations of PA, LF and EF may be used together for better immunoprotection. The present invention describes the method for generation of recombinant vaccine against anthrax, comprising of non-toxic, mutant anthrax toxin proteins. The procedure involves site-directed mutagenesis of the native genes of the toxin proteins, the expression and purification of the mutant proteins and finally characterization of these proteins.

    摘要翻译： 包含保护性抗原（PA），致死因子（LF）和水肿因子（EF）的炭疽毒素是炭疽杆菌的主要毒性因子。 保护性抗原，PA是所有针对炭疽疫苗的主要成分。 如果将小量的EF融入疫苗中，则PA的保护作用大大增加。 针对炭疽的理想疫苗应包含PA，LF和EF，但这种组合是有毒的。 因此，PA，LF和EF的生物活性突变体制剂可以一起用于更好的免疫保护。 本发明描述了用于产生针对炭疽的重组疫苗的方法，其包含无毒的突变体炭疽毒素蛋白质。 该方法涉及毒素蛋白质的天然基因的定点突变，突变蛋白的表达和纯化以及这些蛋白质的最终表征。

    MOBILE TELEVISION CONTROL LOGIC AND METHOD FOR IMPROVED CHANNEL SWITCHING TIME
    76.
    发明申请
    MOBILE TELEVISION CONTROL LOGIC AND METHOD FOR IMPROVED CHANNEL SWITCHING TIME 审中-公开
    移动电视控制逻辑和改进的频道切换时间的方法

    公开(公告)号：US20100066918A1

    公开(公告)日：2010-03-18

    申请号：US12246838

    申请日：2008-10-07

    申请人： Pankaj Gupta ,  Apoorva Kakkeri ,  Ajay Kumar

    发明人： Pankaj Gupta ,  Apoorva Kakkeri ,  Ajay Kumar

    IPC分类号： H04N5/445 ,  H04N5/44

    CPC分类号： H04N5/50 ,  H04H20/426 ,  H04N21/41407 ,  H04N21/4384 ,  H04N21/44004 ,  H04N21/4436

    摘要： A method, control logic, and executable instructions stored in memory enable faster switching between mobile television channels displayed on handheld devices. In one example, a tuner is controlled to receive a first wireless digital burst, such as a wireless digital burst of a digital video broadcasting-handheld (“DVB-H”) signal, including first channel information. The first channel information corresponds to a first mobile television channel to be displayed, and video based on the first channel information is provided. If desired, battery power consumption by the handheld device is then reduced by turning off the tuner. The tuner is then turned on to receive a second wireless digital burst including second channel information. The second channel information corresponds to the second mobile television channel to be displayed. The second channel information is buffered in a buffer while the video based on the first channel information is provided. If desired, battery power consumption is then reduced by again turning off the tuner. The tuner is again turned on to receive another burst.

    摘要翻译： 存储在存储器中的方法，控制逻辑和可执行指令使得能够更快地在手持设备上显示的移动电视频道之间进行切换。 在一个示例中，控制调谐器以接收第一无线数字脉冲串，例如包括第一信道信息的数字视频广播手持（“DVB-H”）信号的无线数字突发。 第一频道信息对应于要显示的第一移动电视频道，并且提供基于第一频道信息的视频。 如果需要，则通过关闭调谐器来减少手持设备的电池电量消耗。 然后，调谐器被接通以接收包括第二信道信息的第二无线数字脉冲串。 第二频道信息对应于要显示的第二移动电视频道。 在提供基于第一频道信息的视频的情况下，第二频道信息被缓冲在缓冲器中。 如果需要，再次关闭调谐器，可以降低电池电量消耗。 调谐器再次打开以接收另一个突发。

    Controlling a searchable range within a network search engine
    77.
    发明授权
    Controlling a searchable range within a network search engine 有权
    控制网络搜索引擎中的可搜索范围

    公开(公告)号：US07581059B2

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

    申请号：US11460615

    申请日：2006-07-27

    申请人： Pankaj Gupta ,  Srinivasan Venkalachary

    发明人： Pankaj Gupta ,  Srinivasan Venkalachary

    IPC分类号： G06F12/00

    CPC分类号： G11C15/00

    摘要： Controlling a searchable range within a network search engine. A CAM array is provided within the network search engine to store data values in entries having respective addresses and to compare the data values with a search key. First address and a second addresses that define a range of the addresses are received at an interface of the network search engine, and range-control circuitry is provided within the network search engine to generate a hit signal having either a first state or a second state according to whether any of the entries having addresses within the range of addresses match the search key.

    摘要翻译： 控制网络搜索引擎中的可搜索范围。 在网络搜索引擎内提供CAM阵列，以将数据值存储在具有相应地址的条目中，并将数据值与搜索关键字进行比较。 在网络搜索引擎的接口处接收定义地址范围的第一地址和第二地址，并且在网络搜索引擎内提供范围控制电路以产生具有第一状态或第二状态的命中信号 根据具有地址范围内的地址的任何条目是否匹配搜索关键字。

    Network device, storage medium and methods for incrementally updating a forwarding database
    78.
    发明授权
    Network device, storage medium and methods for incrementally updating a forwarding database 失效
    网络设备，存储介质和用于递增更新转发数据库的方法

    公开(公告)号：US07571156B1

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

    申请号：US10809244

    申请日：2004-03-25

    申请人： Pankaj Gupta ,  Srinivasan Venkatachary

    发明人： Pankaj Gupta ,  Srinivasan Venkatachary

    IPC分类号： G06F7/00 ,  G06F17/30

    CPC分类号： H04L45/00 ,  H04L45/02 ,  H04L45/7457 ,  Y10S707/99933 ,  Y10S707/99942 ,  Y10S707/99943

    摘要： Network devices, storage mediums and methods for updating a memory structure in a data plane of the network device when route updates are received in the control plane of the network device. The methods described herein can be used to perform one of the following algorithms: a Basic Incremental Split-Merge (BISM) algorithm, a Lazy Incremental Split-Merge (LISM) algorithm, and a Down-support Split-Merge (DSM) algorithm. Each of the algorithms described herein may be used to incrementally update portions of a forwarding database stored within the memory structure, where the updated portions correspond to only those portions affected by the route updates.

    摘要翻译： 网络设备，存储介质和用于在网络设备的控制平面中接收到路由更新时更新网络设备的数据平面中的存储器结构的方法。 本文描述的方法可用于执行以下算法之一：基本增量分割合并（BISM）算法，延迟增量分割合并（LISM）算法和向下支持分割合并（DSM）算法。 本文描述的每个算法可以用于递增地更新存储在存储器结构内的转发数据库的部分，其中更新部分仅对应于受路由更新影响的那些部分。

    SYSTEM AND METHOD FOR EFFICIENTLY SEARCHING A FORWARDING DATABASE THAT IS SPLIT INTO A BOUNDED NUMBER OF SUB-DATABASES HAVING A BOUNDED SIZE
    79.
    发明申请
    SYSTEM AND METHOD FOR EFFICIENTLY SEARCHING A FORWARDING DATABASE THAT IS SPLIT INTO A BOUNDED NUMBER OF SUB-DATABASES HAVING A BOUNDED SIZE 失效
    用于有效搜索前向数据库的系统和方法，该数据库分割成具有边界大小的数据库的数量

    公开(公告)号：US20080275872A1

    公开(公告)日：2008-11-06

    申请号：US12171099

    申请日：2008-07-10

    申请人： Srinivasan Venkatachary ,  Pankaj Gupta

    发明人： Srinivasan Venkatachary ,  Pankaj Gupta

    IPC分类号： G06F17/30

    CPC分类号： H04L45/00 ,  G06F17/30625 ,  H04L45/7457 ,  Y02D10/45 ,  Y10S707/99942 ,  Y10S707/99943

    摘要： A method, apparatus, and storage medium product are provided for forming a forwarding database, and for using the formed database to more efficiently and quickly route packets of data across a computer network. The forwarding database is arranged into multiple sub-databases. Each sub-database is pointed to by a pointer within a pointer table. When performing a longest-match search of incoming addresses, a longest prefix matching algorithm can be used to find the longest match among specialized “spear prefixes” stored in the pointer table. After the longest spear prefixes are found, the pointer table will direct the next search within a sub-database pointed to by that spear prefix. Another longest-match search can be performed for database prefixes (or simply “prefixes”) within the sub-database selected by the pointer. Only the sub-database of interest will, therefore, be searched and all other sub-databases are not accessed. Using a precursor pointer and a sub-database of optimally bounded size and number ensures power consumption be confined only to the sub-database being accessed, and that higher speed lookup operations can be achieved since only the sub-database of interest is being searched.

    摘要翻译： 提供了一种形成转发数据库的方法，装置和存储介质产品，并且用于使用形成的数据库更有效地并且快速地通过计算机网络路由数据包。 转发数据库被安排成多个子数据库。 每个子数据库由指针表中的指针指向。 当对输入地址执行最长匹配搜索时，可以使用最长的前缀匹配算法来找到存储在指针表中的专用“矛前置”之间的最长匹配。 在找到最长的矛前缀之后，指针表将指示由该矛前缀指向的子数据库中的下一个搜索。 可以在由指针选择的子数据库中的数据库前缀（或简称“前缀”）执行另一最长匹配搜索。 因此，仅搜索感兴趣的子数据库，并且不会访问所有其他子数据库。 使用前导指针和具有最大有界大小和数量的子数据库，确保功耗仅限于正在访问的子数据库，并且可以实现更高速度的查找操作，因为仅搜索感兴趣的子数据库。

    System and method for efficiently searching a forwarding database that is split into a bounded number of sub-databases having a bounded size
    80.
    发明授权
    System and method for efficiently searching a forwarding database that is split into a bounded number of sub-databases having a bounded size 失效
    用于有效搜索转发数据库的系统和方法，该转发数据库被拆分为有界数量的具有有界大小的子数据库

    公开(公告)号：US07426518B2

    公开(公告)日：2008-09-16

    申请号：US10402887

    申请日：2003-03-28

    申请人： Srinivasan Venkatachary ,  Pankaj Gupta

    发明人： Srinivasan Venkatachary ,  Pankaj Gupta

    IPC分类号： G06F17/30

    CPC分类号： H04L45/00 ,  G06F17/30625 ,  H04L45/7457 ,  Y02D10/45 ,  Y10S707/99942 ,  Y10S707/99943

    摘要： A method, apparatus, and storage medium product are provided for forming a forwarding database, and for using the formed database to more efficiently and quickly route packets of data across a computer network. The forwarding database is arranged into multiple sub-databases. Each sub-database is pointed to by a pointer within a pointer table. When performing a longest-match search of incoming addresses, a longest prefix matching algorithm can be used to find the longest match among specialized “spear prefixes” stored in the pointer table. After the longest spear prefixes are found, the pointer table will direct the next search within a sub-database pointed to by that spear prefix. Another longest-match search can be performed for database prefixes (or simply “prefixes”) within the sub-database selected by the pointer. Only the sub-database of interest will, therefore, be searched and all other sub-databases are not accessed. Using a precursor pointer and a sub-database of optimally bounded size and number ensures power consumption be confined only to the sub-database being accessed, and that higher speed lookup operations can be achieved since only the sub-database of interest is being searched.

    摘要翻译： 提供了一种形成转发数据库的方法，装置和存储介质产品，并且用于使用形成的数据库更有效地并且快速地通过计算机网络路由数据包。 转发数据库被安排成多个子数据库。 每个子数据库由指针表中的指针指向。 当对输入地址执行最长匹配搜索时，可以使用最长的前缀匹配算法来找到存储在指针表中的专用“矛前置”之间的最长匹配。 在找到最长的矛前缀之后，指针表将指示由该矛前缀指向的子数据库中的下一个搜索。 可以在由指针选择的子数据库中的数据库前缀（或简称“前缀”）执行另一最长匹配搜索。 因此，仅搜索感兴趣的子数据库，并且不会访问所有其他子数据库。 使用前导指针和具有最大有界大小和数量的子数据库，确保功耗仅限于正在访问的子数据库，并且可以实现更高速度的查找操作，因为仅搜索感兴趣的子数据库。