公开(公告)号：US20060285914A1

公开(公告)日：2006-12-21

申请号：US11407628

申请日：2006-04-20

Applicant: Andrew Bassford ,  Nitin Gupta ,  Katie Hatsushi

Inventor： Andrew Bassford ,  Nitin Gupta ,  Katie Hatsushi

IPC: B42F13/00

CPC classification number: B42D5/006

Abstract: An accessory stationery product is provided that includes at least one dry erase board surface that is adapted to be detachably mounted within or with respect to a spiral bound notebook. The accessory product includes structural feature(s) that allow a user to insert the dry erase surface into engagement with wire binder of a spiral bound notebook. The inserts are compatible with a range of standard/conventional spiral bound notebooks, i.e., spiral bound notebooks manufactured by various manufacturers and offered under various brand names. The accessory device addresses fundamental shortcomings associated with conventional spiral bound notebook design/use by giving users a cleanly erasable and reusable work space for notes and scratch work within the spiral bound notebook, thereby permitting the user to save paper and stay organized. Thus, the accessory device allows the user to have two spaces within a notebook: a versatile, dry erase space for temporary notes and scratch work and the rest of the notebook for more permanent work.

Abstract translation: 提供了一种附件文具产品，其包括至少一个干擦板表面，其适于可拆卸地安装在螺旋装订笔记本内或相对于螺旋装订的笔记本上。 附件产品包括允许用户将干擦拭表面插入与螺旋装订的笔记本的导线夹相接合的结构特征。 插入件与一系列标准/常规螺旋装订笔记本兼容，即由各种制造商制造并以各种品牌名称提供的螺旋装订笔记本。 附件设备解决了与传统螺旋装订笔记本电脑设计/使用相关的基本缺点，为用户提供干净可擦除和可重复使用的工作空间，用于螺旋装订笔记本中的笔记和划痕工作，从而允许用户节省纸张并保持组织。 因此，附件设备允许用户在笔记本中具有两个空间：用于临时笔记和划痕工作的通用干擦除空间，并且笔记本的其余部分用于更加永久的工作。

公开(公告)号：US09058191B2

公开(公告)日：2015-06-16

申请号：US13310928

申请日：2011-12-05

Applicant: Nitin Gupta ,  Daniel H. Kim ,  Igor Malamant ,  Steve Haehnichen

Inventor： Nitin Gupta ,  Daniel H. Kim ,  Igor Malamant ,  Steve Haehnichen

IPC: G06F15/16 ,  G06F9/06 ,  G06F9/445 ,  G06F9/44

CPC classification number: G06F9/445 ,  G06F9/06 ,  G06F9/4405

Abstract: In a multiprocessor system, a primary processor may store an executable image for a secondary processor. A communication protocol assists the transfer of an image header and data segment(s) of the executable image from the primary processor to the secondary processor. Messages between the primary processor and secondary processor indicate successful receipt of transferred data, termination of a transfer process, and acknowledgement of same.

Abstract translation: 在多处理器系统中，主处理器可以存储辅助处理器的可执行映像。 通信协议有助于将图像头部和可执行图像的数据段从主处理器传送到次要处理器。 主处理器和辅助处理器之间的消息指示传输数据的成功接收，传送过程的终止以及确认。

公开(公告)号：US08825743B2

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

申请号：US12668697

申请日：2008-07-11

Applicant: Johannes E. Gehrke ,  Nitin Gupta ,  Philipp T. Unterbrunner ,  Alan J. Demers

Inventor： Johannes E. Gehrke ,  Nitin Gupta ,  Philipp T. Unterbrunner ,  Alan J. Demers

IPC: G06F15/16 ,  G06F17/30 ,  G06F9/46

CPC classification number: G06F9/466 ,  G06F17/30351 ,  G06F17/30371

Abstract: A system and method for enabling distributed transaction processing by moving all application logic away from the server and into the client by using an optimistic concurrency control framework with client-side transaction validation including virtual full replication under a transactional programming model with full Atomicity, Consistency, Isolation, and Durability (ACID) properties.

Abstract translation: 通过使用具有客户端事务验证的乐观并发控制框架，将所有应用程序逻辑远离服务器并进入客户端来实现分布式事务处理的系统和方法，包括具有完整原子性，一致性的事务编程模型下的虚拟完全复制， 隔离和耐久性（ACID）属性。

公开(公告)号：US20140214840A1

公开(公告)日：2014-07-31

申请号：US12955253

申请日：2010-11-29

Applicant: Nitin Gupta ,  Abhinandan S. Das

Inventor： Nitin Gupta ,  Abhinandan S. Das

IPC: G06F17/30

CPC classification number: G06F17/3064

Abstract: Methods, systems and apparatus, including computer programs encoded on a computer storage medium, for disambiguating names in a document corpus. In an aspect, a method includes generating context term lists for a person name, each context term list being a list of context terms from a resource for the person name; clustering the context term lists into a plurality of clusters, each of the clusters of context term lists including context term lists that are most similar to the cluster relative to other clusters; for each of the clusters, selecting a representative term for the cluster; receiving the person name as a search query; and generating a plurality of query suggestions from the search query and the representative terms for the clusters, each query suggesting being a combination of the person name and one representative term.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于消除文档语料库中的名称。 一方面，一种方法包括为个人名称生成上下文词列表，每个上下文词列表是来自人名的资源的上下文术语列表; 将上下文术语列表聚类成多个集群，每个上下文术语表的集群包括与集群相对于其他集群最相似的上下文术语列表; 对于每个集群，选择集群的代表性术语; 接收人名作为搜索查询; 以及从所述搜索查询和所述群集的代表性条件生成多个查询建议，每个查询建议是所述人名和一个代表词的组合。

公开(公告)号：US08792493B2

公开(公告)日：2014-07-29

申请号：US13491501

申请日：2012-06-07

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

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

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

公开(公告)号：US20140073779A9

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

申请号：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/4823 ,  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）。

公开(公告)号：US08547832B2

公开(公告)日：2013-10-01

申请号：US12728460

申请日：2010-03-22

Applicant: Nitin Gupta ,  Sonal Shah ,  Aravindan Ramalingam ,  Norman William Finn

Inventor： Nitin Gupta ,  Sonal Shah ,  Aravindan Ramalingam ,  Norman William Finn

IPC: G01R31/08

CPC classification number: H04L41/06 ,  H04L12/465 ,  H04L12/467 ,  H04L43/0811

Abstract: Ethernet Alarm Indication Signal (ETH-AIS) information for multiple Virtual Local Area Networks (VLANs) is consolidated and distributed to the multiple VLANs in a single Ethernet frame. Note, as used herein, “Alarm Indication Signal (ETH-AIS)” refers to an IEEE 802.x or ITU-T Y.1731 Ethernet Alarm Indication Signal. A device receiving the Ethernet frame with the consolidated ETH-AIS information typically forwards the frame out each port that communicates traffic for one of the VLANs included in the consolidated ETH-AIS information.

Abstract translation: 多个虚拟局域网（VLAN）的以太网报警指示信号（ETH-AIS）信息被合并并分发到单个以太网帧中的多个VLAN。 注意，如本文所使用的，“报警指示信号（ETH-AIS）”是指IEEE 802.x或ITU-T Y.1731以太网报警指示信号。 接收具有综合ETH-AIS信息的以太网帧的设备通常将每个端口转发出帧，该端口传送合并的ETH-AIS信息中包含的一个VLAN的流量。

公开(公告)号：US20130232215A1

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

申请号：US13471956

申请日：2012-05-15

Applicant: Nitin Gupta ,  Nagendra Subramanya ,  Oleg Smolsky

Inventor： Nitin Gupta ,  Nagendra Subramanya ,  Oleg Smolsky

IPC: G06F15/167

CPC classification number: G06F3/061 ,  G06F3/0656 ,  G06F3/0662 ,  G06F3/067 ,  G06F12/0862 ,  G06F12/0868 ,  H04L67/1097

Abstract: Virtual storage arrays consolidate data storage from branch locations at data centers. The virtual storage array appears to storage clients as a local data storage; however, the virtual storage array data is actually stored at a data center. To overcome the bandwidth and latency limitations of wide area networks between branch locations and the data center, systems and methods predict, prefetch, and cache at the branch location storage blocks that are likely to be requested in the future by storage clients. When this prediction is successful, storage block requests are fulfilled from branch locations' storage block caches. Predictions may leverage an understanding of the semantics and structure of the high-level data structures associated with the storage blocks. Prefetching agents on storage clients monitor storage requests to determine the associations between requested storage blocks and the corresponding high-level data structures as well as other attributes useful for prediction.

Abstract translation: 虚拟存储阵列整合数据中心分支机构的数据存储。 虚拟存储阵列对存储客户端显示为本地数据存储; 然而，虚拟存储阵列数据实际上存储在数据中心。 为了克服分支位置和数据中心之间的广域网络的带宽和延迟限制，系统和方法在存储客户端将来可能要求的分支位置存储块中预测，预取和高速缓存。 当该预测成功时，从分支位置的存储块高速缓存中实现存储块请求。 预测可以利用对与存储块相关联的高级数据结构的语义和结构的理解。 存储客户机上的预取代理程序监视存储请求，以确定所请求的存储块与相应的高级数据结构之间的关联以及对预测有用的其他属性。

公开(公告)号：US08411811B2

公开(公告)日：2013-04-02

申请号：US12841096

申请日：2010-07-21

Applicant: Nitin Gupta

Inventor： Nitin Gupta

IPC: H04L7/00

CPC classification number: H03L7/199 ,  H03L7/0807 ,  H03L7/0812 ,  H03L7/091 ,  H04L7/0337

Abstract: In a method for recovery of a clock from a received digital data stream and an apparatus for recovering a clock from a received digital data stream, phase-shifted clock signals are generated from a receiver's clock. After selecting one of the phase-shifted clock signals, two other phase-shifted clock signals are determined. Depending on sample values taken at rising/falling edges of the three selected phase-shifted clock signals, counter values are increased and compared. The selection of phase-shifted clock signals and the steps of sampling the input digital data stream, comparing the values and increasing counter values, if required, are repeatedly performed until the comparison result of the counter values indicates that one of the latter determined phase-shifted clock signals strobes the received digital data stream in the center of a bit period.

Abstract translation: 在从接收到的数字数据流中恢复时钟的方法和从接收的数字数据流中恢复时钟的装置中，从接收机的时钟产生相移的时钟信号。 在选择一个相移时钟信号之后，确定另外两个相移时钟信号。 根据在三个选定的相移时钟信号的上升沿/下降沿采集的采样值，增加和比较计数器值。 如果需要，相移时钟信号的选择和对输入数字数据流进行采样的步骤，比较值和增加计数器值，直到计数器值的比较结果指示后一个确定的相位时钟信号之一， 移位的时钟信号在接收到的位数周期的中心选通接收到的数字数据流。

公开(公告)号：US08411570B2

公开(公告)日：2013-04-02

申请号：US11494352

申请日：2006-07-26

Applicant: David Tze-Si Wu ,  Nitin Gupta ,  Kand Ly

Inventor： David Tze-Si Wu ,  Nitin Gupta ,  Kand Ly

IPC: H04L12/26

CPC classification number: H04L47/12 ,  H04L47/10 ,  H04L47/125 ,  H04L69/16 ,  H04L69/162 ,  H04L69/165 ,  H04L69/32

Abstract: Serial clustering uses two or more network devices connected in series via a local and/or wide-area network to provide additional capacity when network traffic exceeds the processing capabilities of a single network device. When a first network device reaches its capacity limit, any excess network traffic beyond that limit is passed through the first network device unchanged. A network device connected in series with the first network device intercepts and will process the excess network traffic provided that it has sufficient processing capacity. Additional network devices can process remaining network traffic in a similar manner until all of the excess network traffic has been processed or until there are no more additional network devices. Network devices may use rules to determine how to handle network traffic. Rules may be based on the attributes of received network packets, attributes of the network device, or attributes of the network.