公开(公告)号：US07268788B2

公开(公告)日：2007-09-11

申请号：US10932087

申请日：2004-09-02

Applicant: Joseph Shain ,  Avidan Akerib ,  Michael Mordison ,  Adi Bar-Lev ,  Nitin Gupta ,  Nitish Arya

Inventor： Joseph Shain ,  Avidan Akerib ,  Michael Mordison ,  Adi Bar-Lev ,  Nitin Gupta ,  Nitish Arya

IPC: G09G5/00

CPC classification number: G06T15/00 ,  G09G5/36 ,  G09G2340/10

Abstract: Associative processing methods and apparatus are described for processing graphics data for three-dimensional graphic displays, e.g., in three-dimensional games. A texture, which comprises a bitmap image used to apply a design onto the surface of a 3D computer model for 3D graphics display, may be converted to APA (associative processor apparatus) instructions.

Abstract translation: 描述了用于处理例如三维游戏中的三维图形显示的图形数据的关联处理方法和装置。 包括用于将设计应用到用于3D图形显示的3D计算机模型的表面上的位图图像的纹理可以被转换为APA（关联处理器装置）指令。

公开(公告)号：US20070025355A1

公开(公告)日：2007-02-01

申请号：US11494441

申请日：2006-07-27

Applicant: Alain Cohen ,  Pradeep Singh ,  Vinod Jeyachandran ,  Nitin Gupta

Inventor： Alain Cohen ,  Pradeep Singh ,  Vinod Jeyachandran ,  Nitin Gupta

IPC: H04L12/56

CPC classification number: H04L45/28 ,  H04L41/0631 ,  H04L41/08 ,  H04L41/0866 ,  H04L41/14 ,  H04L41/145 ,  H04L45/02 ,  H04L45/124

Abstract: A simulator simulates routing system protocols to build routing tables corresponding to a modeled network, and a comparator compares the routing tables in the actual network to these simulator-created routing tables. Because the modeled system represents a fault-free version of the actual system, and assuming that the modeled routing system protocols are representative of the algorithms used in the actual routers, these simulator-produced routing tables will represent the ‘ideal’ routing tables that should be present in the routers of the actual network. By querying each router in the actual network for its routing table and comparing each routing table to the corresponding simulator-produced routing table, any differences from the ‘ideal’ can be identified.

Abstract translation: 模拟器模拟路由系统协议以构建与建模网络相对应的路由表，并且比较器将实际网络中的路由表与这些模拟器创建的路由表进行比较。 因为建模的系统代表了实际系统的无故障版本，并且假设建模的路由系统协议代表实际路由器中使用的算法，则这些模拟器生成的路由表将表示应该应用的“理想”路由表 存在于实际网络的路由器中。 通过查询实际网络中的每个路由器的路由表，并将每个路由表与相应的模拟器生成的路由表进行比较，可以识别与“ideal”的任何差异。

公开(公告)号：US20060087340A1

公开(公告)日：2006-04-27

申请号：US11143094

申请日：2005-06-02

Applicant: Nitin Gupta

Inventor： Nitin Gupta

IPC: H03K19/003

CPC classification number: H03K19/00315

Abstract: An improved voltage tolerant protection circuit for input buffer comprising a transmission gate circuit receiving input from the pad for passing the input signal to the input of the input buffer, a control signal generator electrically coupled between the transmission gate circuit and the pad to provide a control signal for operating the transmission gate circuit, and an N-Well generation circuit electrically coupled between the pad and the transmission gate circuit, and also electrically coupled to the control signal generator for generating a bias signal for the transmission gate circuit and the control signal generator. Thus, the present invention provides a voltage tolerant protection circuit that prevents electrical stress on transistors, minimizes power supply consumption and transfers signals without any change in amplitude.

Abstract translation: 一种用于输入缓冲器的改进的耐压保护电路，包括传输门电路，其接收来自焊盘的输入，用于将输入信号传递到输入缓冲器的输入;电耦合在传输门电路和焊盘之间的控制信号发生器， 用于操作传输门电路的信号，以及电耦合在焊盘和传输门电路之间的N阱产生电路，并且还电耦合到控制信号发生器，以产生传输门电路和控制信号发生器的偏置信号 。 因此，本发明提供了一种耐电压保护电路，其防止晶体管上的电应力，使电源消耗最小化并且传输信号而没有任何幅度变化。

公开(公告)号：US09367619B2

公开(公告)日：2016-06-14

申请号：US13194084

申请日：2011-07-29

Applicant: Atul Katiyar ,  Purushottam Amradkar ,  Nitin Gupta

Inventor： Atul Katiyar ,  Purushottam Amradkar ,  Nitin Gupta

IPC: G06F17/30

CPC classification number: G06F17/30864 ,  G06F17/30846

Abstract: An analytic system may have a number of processing stages. One or more data sources may provide data to a first processing stage. The first processing stage may specify one or more data contracts having a schema describing a layout and types of data provided by the one or more data sources. Each of the processing stages may specify a respective data contract having a schema such that the processing stages may understand a layout and types of data provided as input to the processing stages. The data contracts me further specify a valid range of values for various items of data described by schemas. Data not conforming to a data contract may be automatically filtered out such that a corresponding processing stage may not be provided with the non-conforming data.

Abstract translation: 分析系统可能具有多个处理阶段。 一个或多个数据源可以向第一处理阶段提供数据。 第一处理阶段可以指定具有描述由一个或多个数据源提供的布局和数据类型的模式的一个或多个数据契约。 每个处理阶段可以指定具有模式的相应数据契约，使得处理阶段可以理解作为处理阶段的输入提供的数据的布局和类型。 数据约定我进一步指定了由模式描述的各种数据项的有效范围值。 可能会自动过滤掉不符合数据合约的数据，从而可能不会对不合格的数据提供相应的处理阶段。

公开(公告)号：US09014012B2

公开(公告)日：2015-04-21

申请号：US12900357

申请日：2010-10-07

Applicant: Vinod Jeyachandran ,  Pradeep Natarajan ,  James Mark Shaw ,  Raghavendra Uppalli ,  Pradeep Singh ,  Nitin Gupta ,  Jerrold Stiffler

Inventor： Vinod Jeyachandran ,  Pradeep Natarajan ,  James Mark Shaw ,  Raghavendra Uppalli ,  Pradeep Singh ,  Nitin Gupta ,  Jerrold Stiffler

IPC: H04L1/00 ,  H04L12/24

CPC classification number: H04L41/12 ,  H04L41/0213

Abstract: A network analysis system invokes an application specific, or source-destination specific, path discovery process. The application specific path discovery process determines the path(s) used by the application, collects performance data from the nodes along the path, and communicates this performance data to the network analysis system for subsequent performance analysis. The system may also maintain a database of prior network configurations to facilitate the identification of nodes that are off the path that may affect the current performance of the application. The system may also be specifically controlled so as to identify the path between any pair of specified nodes, and to optionally collect performance data associated with the path.

Abstract translation: 网络分析系统调用特定于应用程序或源特定路径的路径发现过程。 应用程序特定路径发现过程确定应用程序使用的路径，从沿着路径的节点收集性能数据，并将该性能数据传达到网络分析系统以进行后续性能分析。 系统还可以维护先前网络配置的数据库，以便于识别可能影响应用的当前性能的路径之外的节点。 还可以特别地控制系统，以便识别任何一对指定节点之间的路径，并且可选地收集与该路径相关联的性能数据。

公开(公告)号：US20140304302A1

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

申请号：US13816382

申请日：2011-08-15

Applicant: Johannes Gehrke ,  Christoph Koch ,  Lucja Kot ,  Nitin Gupta

Inventor： Johannes Gehrke ,  Christoph Koch ,  Lucja Kot ,  Nitin Gupta

IPC: G06F17/30

CPC classification number: G06F16/24554 ,  G06F16/2425

Abstract: A computer system and computer implemented method that obtains coordinated results from at least two queries by utilizing context data of each query. Specifically, the computer system and computer implemented method facilitates enhanced querying functionality by matching entangled queries to achieve coordinated results.

Abstract translation: 一种计算机系统和计算机实现的方法，其通过利用每个查询的上下文数据从至少两个查询获得协调的结果。 具体来说，计算机系统和计算机实现的方法通过匹配纠缠的查询来实现协调的结果来促进增强的查询功能。

公开(公告)号：US08745320B2

公开(公告)日：2014-06-03

申请号：US13464714

申请日：2012-05-04

Applicant: Nitin Gupta ,  Kiron Vijayasankar ,  Joshua Berry

Inventor： Nitin Gupta ,  Kiron Vijayasankar ,  Joshua Berry

IPC: G06F12/02 ,  G06F3/06

CPC classification number: G06F3/0656 ,  G06F3/0619 ,  G06F3/0685 ,  G06F11/1441 ,  G06F11/1471 ,  G06F2201/82

Abstract: Relatively small capacity solid-state storage devices (SSD) are combined with larger capacity magnetic disk storage devices for storing storage block write data to ensure data consistency. Write operations are stored in a sequential write buffer in an SSD to guarantee the storage of write data and then copied from the sequential write buffer to the destination address in a magnetic disk storage device. The sequential write buffer store write data in locations corresponding to the order of receipt of write operations. Write data from the sequential write buffer is transferred to the magnetic disk storage device in the same order and a checkpoint index is frequently updated to indicate the completion of some transfers. During system initialization, the most recent value of the checkpoint index is retrieved and used as a starting location for transferring write data from the sequential write buffer to the magnetic disk storage device.

Abstract translation: 相对较小容量的固态存储设备（SSD）与更大容量的磁盘存储设备相结合，用于存储存储块写数据，以确保数据一致性。 写入操作存储在SSD中的顺序写入缓冲器中，以保证写入数据的存储，然后从顺序写入缓冲器复制到磁盘存储设备中的目标地址。 顺序写入缓冲器将写入数据写入对应于写入操作的接收顺序的位置。 从顺序写入缓冲器写入的数据以相同的顺序被传送到磁盘存储设备，并且检查点索引被频繁更新以指示某些传输的完成。 在系统初始化期间，检索点索引的最新值被检索并用作将写入数据从顺序写入缓冲器传送到磁盘存储设备的起始位置。

公开(公告)号：US08524893B2

公开(公告)日：2013-09-03

申请号：US13016235

申请日：2011-01-28

Applicant: Nitin Gupta ,  Vishal Handa ,  Abir Kumar Pal ,  Hemant Kumar Singh ,  Saswata Lahiri ,  Sushil Kumar Dubey

Inventor： Nitin Gupta ,  Vishal Handa ,  Abir Kumar Pal ,  Hemant Kumar Singh ,  Saswata Lahiri ,  Sushil Kumar Dubey

IPC: C07D498/00

CPC classification number: C07D498/18 ,  C07D319/06

Abstract: Novel intermediates, process for their preparation and their use in the preparation of therapeutically effective antineoplastic agents, in particular Temsirolimus of formula (I).

Abstract translation: 新型中间体，其制备方法及其在制备治疗有效的抗肿瘤药物中的用途，特别是式（I）的替西罗莫司。

公开(公告)号：US20130184455A1

公开(公告)日：2013-07-18

申请号：US13809081

申请日：2011-07-11

Applicant: Helmut Knoller ,  Dominik Heckmann ,  Frank Hacket ,  Norbert Zander ,  Frank Nocken ,  Saswata Lahiri ,  Nitin Gupta ,  Sunil Sanghani ,  Azim Abul ,  Hemant Kumar Singh ,  Sandeep Grewal ,  Sandeep Kaur

Inventor： Helmut Knoller ,  Dominik Heckmann ,  Frank Hacket ,  Norbert Zander ,  Frank Nocken ,  Saswata Lahiri ,  Nitin Gupta ,  Sunil Sanghani ,  Azim Abul ,  Hemant Kumar Singh ,  Sandeep Grewal ,  Sandeep Kaur

IPC: C08B31/10

CPC classification number: A61K47/36 ,  A61K47/61 ,  C08B31/10

Abstract: The present invention relates to a hydroxyalkyl starch conjugate and a method for preparing the same, said hydroxyalkyl starch conjugate comprising a hydroxyalkyl starch derivative and a cytotoxic agent, the cytotoxic agent comprising at least one secondary hydroxyl group, wherein the hydroxyalkyl starch is linked via said secondary hydroxyl group to the cytotoxic agent. The conjugate according to the present invention has a structure according to the following formula HAS′(-L-M)n wherein M is a residue of the cytotoxic agent, L is a linking moiety, HAS′ is the residue of the hydroxyalkyl starch derivative, and n is greater than or equal to 1, and wherein the hydroxyalkyl starch derivative has a mean molecular weight (MW) above the renal threshold.

Abstract translation: 本发明涉及羟烷基淀粉缀合物及其制备方法，所述羟烷基淀粉缀合物包含羟烷基淀粉衍生物和细胞毒性剂，所述细胞毒性剂包含至少一个仲羟基，其中所述羟烷基淀粉通过所述 仲羟基对细胞毒性剂。 根据本发明的缀合物具有根据下式HAS'（ - LM）n的结构，其中M是细胞毒性剂的残基，L是连接部分，HAS'是羟烷基淀粉衍生物的残基，和 n大于或等于1，并且其中羟烷基淀粉衍生物具有高于肾阈值的平均分子量（MW）。

公开(公告)号：US20130114439A1

公开(公告)日：2013-05-09

申请号：US13491501

申请日：2012-06-07

Applicant: David Tze-Si Wu ,  Soren Lassen ,  Kartik Subbana ,  Nitin Gupta ,  Vivasvat Keswani

Inventor： David Tze-Si Wu ,  Soren Lassen ,  Kartik Subbana ,  Nitin Gupta ,  Vivasvat Keswani

IPC: H04L12/56

CPC classification number: H04L47/27 ,  H04L12/28 ,  H04L43/16 ,  H04L47/26 ,  H04L69/16 ,  H04L69/163

Abstract: Network traffic is monitored and an optimal framing heuristic is automatically determined and applied. Framing heuristics specify different rules for framing network traffic. While a framing heuristic is applied to the network traffic, alternative framing heuristics are speculatively evaluated for the network traffic. The results of these evaluations are used to rank the framing heuristics. The framing heuristic with the best rank is selected for framing subsequent network traffic. Each client/server traffic flow may have a separate framing heuristic. The framing heuristics may be deterministic based on byte count and/or time or based on traffic characteristics that indicate a plausible point for framing to occur. The choice of available framing heuristics may be determined partly by manual configuration, which specifies which framing heuristics are available, and partly by automatic processes, which determine the best framing heuristic to apply to the current network traffic from the set of available framing heuristics.

Abstract translation: 监控网络流量，并自动确定和应用最优的框架启发式。 成帧启发式规定了组网网络流量的不同规则。 虽然将框架启发式应用于网络流量，但是针对网络流量推测性地评估了替代成帧启发式算法。 这些评估的结果用于对框架启发式进行排序。 选择具有最佳排名的成帧启发式来构建后续网络流量。 每个客户端/服务器流量流可以具有单独的成帧启发式。 帧启发式可以是基于字节计数和/或时间的确定性的，或者基于指示发生框架的合理点的业务特性。 可选帧启发式可以部分地通过手动配置来确定，该手动配置指定哪些帧启发式是可用的，并且部分地由自动进程确定，自动进程决定了应用于可用成帧启发式组的当前网络业务的最佳成帧启发式。