公开(公告)号：US20080005274A1

公开(公告)日：2008-01-03

申请号：US11754940

申请日：2007-05-29

Applicant: Kartik Subbanna ,  Nitin Gupta ,  Adityashankar Kini ,  Daniel O'Sullivan ,  Shashidhar Merugu ,  Steven Procter ,  Vivasvat Keswani

Inventor： Kartik Subbanna ,  Nitin Gupta ,  Adityashankar Kini ,  Daniel O'Sullivan ,  Shashidhar Merugu ,  Steven Procter ,  Vivasvat Keswani

IPC: G06F15/16

CPC classification number: H04L47/10 ,  H04L47/266 ,  H04L47/323 ,  H04L47/33 ,  H04L49/90

Abstract: In a system where transactions are accelerated with asynchronous writes that require acknowledgements, with pre-acknowledging writes at a source of the writes, a destination-side transaction accelerator includes a queue for queue writes to a destination, at least some of the writes being pre-acknowledged by a source-side transaction accelerator prior to the write completing at the destination, a memory for storing a status of a destination-side queue and possibly other determinants, and logic for signaling to the source-side transaction accelerator with instructions to alter pre-acknowledgement rules to hold off on and pursue pre-acknowledgements based on the destination-side queue status. The rules can take into account adjusting the flow of pre-acknowledged requests or pre-acknowledgements at the sender-side transaction accelerator based at least on the computed logical length.

Abstract translation: 在使用需要确认的异步写入来加速交易的系统中，通过在写入的源处进行预确认写入，目的地侧事务加速器包括用于向目的地的队列写入的队列，至少一些写入是预先 在目的地写入完成之前由源侧事务加速器确认，用于存储目的地侧队列和可能的其他决定因素的状态的存储器以及用于向源侧事务加速器发信号的逻辑，其具有改变的指令 基于目的地端队列状态的预先确认规则来阻止和追踪预认证。 该规则可以考虑到至少基于所计算的逻辑长度来调整在发送方事务加速器处的预先确认的请求或预确认的流。

公开(公告)号：US20070198516A1

公开(公告)日：2007-08-23

申请号：US11699797

申请日：2007-01-29

Applicant: Palamadai Ganapathy ,  Sandeep Shroff ,  Nitin Gupta ,  Ramesh Gopalan ,  Basab Pradhan

Inventor： Palamadai Ganapathy ,  Sandeep Shroff ,  Nitin Gupta ,  Ramesh Gopalan ,  Basab Pradhan

IPC: G06F7/00 ,  G06F3/048 ,  G06Q10/00 ,  G06F17/00

CPC classification number: G06Q10/10 ,  G06F16/345

Abstract: The present invention organizes unsorted information into structured information and presents the structured information so that users are able to perform research efficiently and effectively. The present invention includes developing a parameterized template which is used to organize the unstructured data. Editors, with the help of a data analysis application, search through the unstructured information and organize the information using the parameterized template. After the information is properly organized, it is presented to users in a user-friendly format that enables users to quickly and easily search for specific elements in the information. Furthermore, the information is also presented to allow other tasks to be performed on the organized data such as comparisons.

Abstract translation: 本发明将未排序的信息组织到结构化信息中并呈现结构化信息，使得用户能够有效且高效地进行研究。 本发明包括开发用于组织非结构化数据的参数化模板。 编辑者在数据分析应用程序的帮助下，通过非结构化信息搜索并使用参数化模板组织信息。 在信息正确组织之后，它以用户友好的格式呈现给用户，使用户能够快速轻松地搜索信息中的特定元素。 此外，还提供了信息以允许对有组织的数据执行其他任务，例如比较。

公开(公告)号：US20070086335A1

公开(公告)日：2007-04-19

申请号：US11494025

申请日：2006-07-26

Applicant: Steve McCanne ,  Nitin Gupta

Inventor： Steve McCanne ,  Nitin Gupta

IPC: H04L12/26

CPC classification number: H04L47/10 ,  H04L1/0002 ,  H04L1/004 ,  H04L1/0057 ,  H04L1/1809 ,  H04L1/187 ,  H04L1/188 ,  H04L43/0835 ,  H04L43/0847 ,  H04L47/11 ,  H04L47/25 ,  H04L47/27

Abstract: A network stack includes a packet loss analyzer that distinguishes between packet losses due to congestion and due to lossyness of network connections. The loss analyzer observes the packet loss patterns for comparison with a packet loss model. The packet loss model may be based on a Forward Error Correction (FEC) system. The loss analyzer determines if lost packets could have been recovered by a receiving network device, if FEC had been used. If the lost packets could have been corrected by FEC, the loss analyzer assumes that no network congestion exists and that the packet loss comes from the lossy aspects of the network, such as radio interference for wireless networks. If the loss analyzer determines that some of the lost packet could not have been recovered by the receiving network device, the loss analyzer assumes that network congestion causes these packet losses and reduces the data rate.

Abstract translation: 网络堆栈包括分组丢失分析器，其区分由于拥塞引起的分组丢失以及由于网络连接的有损性。 损耗分析仪观察丢包模式，以便与丢包模型进行比较。 分组丢失模型可以基于前向纠错（FEC）系统。 如果使用了FEC，丢失分析器将确定丢失的数据包是否已被接收网络设备恢复。 如果丢失的分组可能被FEC纠正，则丢失分析器假设没有网络拥塞，并且分组丢失来自网络的有损方面，例如无线网络的无线电干扰。 如果丢失分析器确定某些丢失的分组不能被接收网络设备恢复，则丢失分析器假设网络拥塞导致这些分组丢失并降低数据速率。

公开(公告)号：US20070053297A1

公开(公告)日：2007-03-08

申请号：US11494352

申请日：2006-07-26

Applicant: David Wu ,  Nitin Gupta ,  Kand Ly

Inventor： David Wu ,  Nitin Gupta ,  Kand Ly

IPC: H04J1/16

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.

Abstract translation: 当网络流量超过单个网络设备的处理能力时，串行集群使用通过本地和/或广域网络串联连接的两个或多个网络设备来提供额外的容量。 当第一个网络设备达到其容量限制时，超出该限制的任何超量网络流量不变地通过第一个网络设备。 与第一网络设备串联连接的网络设备将拦截并处理多余的网络流量，前提是它具有足够的处理能力。 额外的网络设备可以以类似的方式处理剩余的网络流量，直到已经处理了所有超量的网络流量，或者直到没有更多的额外的网络设备。 网络设备可能会使用规则来确定如何处理网络流量。 规则可以基于接收的网络分组的属性，网络设备的属性或网络的属性。

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

公开(公告)号：US10831721B2

公开(公告)日：2020-11-10

申请号：US12730185

申请日：2010-03-23

Applicant: David Tze-Si Wu ,  Steven McCanne ,  Michael J. Demmer ,  Nitin Gupta

Inventor： David Tze-Si Wu ,  Steven McCanne ,  Michael J. Demmer ,  Nitin Gupta

IPC: G06F16/188 ,  G06F16/172 ,  G06F12/0862 ,  G06F3/06

Abstract: Virtual storage arrays consolidate branch data storage at data centers connected via wide area networks. Virtual storage arrays appear to storage clients as local data storage; however, virtual storage arrays actually store data at the data center. The virtual storage arrays overcomes bandwidth and latency limitations of the wide area network by predicting and prefetching storage blocks, which are then cached at the branch location. Virtual storage arrays leverage an understanding of the semantics and structure of high-level data structures associated with storage blocks to predict which storage blocks are likely to be requested by a storage client in the near future. Virtual storage arrays determine the association between requested storage blocks and corresponding high-level data structure entities to predict additional high-level data structure entities that are likely to be accessed. From this, the virtual storage array identifies the additional storage blocks for prefetching.

公开(公告)号：US09830379B2

公开(公告)日：2017-11-28

申请号：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.

公开(公告)号：US09092479B1

公开(公告)日：2015-07-28

申请号：US13620500

申请日：2012-09-14

Applicant: Steven D. Baker ,  Michael Flaster ,  Nitin Gupta ,  Paul G. Haahr ,  Srinivasan Venkatachary ,  Yonghui Wu

Inventor： Steven D. Baker ,  Michael Flaster ,  Nitin Gupta ,  Paul G. Haahr ,  Srinivasan Venkatachary ,  Yonghui Wu

IPC: G06F17/30

CPC classification number: G06F17/30563 ,  G06F17/248 ,  G06F17/30389 ,  G06F17/3064 ,  G06F17/30864

Abstract: Methods, systems, and apparatus, including computer program products, for generating synthetic queries using seed queries and structural similarity between documents are described. In one aspect, a method includes identifying embedded coding fragments (e.g., HTML tag) from a structured document and a seed query; generating one or more query templates, each query template corresponding to at least one coding fragment, the query template including a generative rule to be used in generating candidate synthetic queries; generating the candidate synthetic queries by applying the query templates to other documents that are hosted on the same web site as the document; identifying terms that match structure of the query templates as candidate synthetic queries; measuring a performance for each of the candidate synthetic queries; and designating as synthetic queries the candidate synthetic queries that have performance measurements exceeding a performance threshold.

Abstract translation: 描述了使用种子查询和文档之间的结构相似性来生成合成查询的方法，系统和装置，包括计算机程序产品。 一方面，一种方法包括从结构化文档和种子查询中识别嵌入的编码片段（例如HTML标签）; 生成一个或多个查询模板，每个查询模板对应于至少一个编码片段，所述查询模板包括要用于生成候选综合查询的生成规则; 通过将查询模板应用于与文档在同一网站上托管的其他文档来生成候选综合查询; 将与查询模板的结构匹配的条款识别为候选综合查询; 测量每个候选综合查询的性能; 并且将具有超过性能阈值的性能测量的候选综合查询指定为合成查询。

公开(公告)号：US08812826B2

公开(公告)日：2014-08-19

申请号：US12908370

申请日：2010-10-20

Applicant: Abhishek Bansal ,  Nitin Gupta ,  Brad L. Herold ,  Jayakumar N Sankarannair

Inventor： Abhishek Bansal ,  Nitin Gupta ,  Brad L. Herold ,  Jayakumar N Sankarannair

IPC: G06F9/32

CPC classification number: G06F9/30058 ,  G06F9/3005 ,  G06F9/3804 ,  G06F11/2236 ,  G06F11/28

Abstract: In one implementation, processor testing may include the ability to randomly generate a first plurality of branch instructions for a first portion of an instruction set, each branch instruction in the first portion branching to a respective instruction in a second portion of the instruction set, the branching of the branch instructions to the respective instructions being arranged in a sequential manner. Processor testing may also include the ability to randomly generate a second plurality of branch instructions for the second portion of the instruction set, each branch instruction in the second portion branching to a respective instruction in the first portion of the instruction set, the branching of the branch instructions to the respective instructions being arranged in a sequential manner. Processor testing may additionally include the ability to generate a plurality of instructions to increment a counter when each branch instruction is encountered during execution.

Abstract translation: 在一个实现中，处理器测试可以包括随机生成指令集的第一部分的第一多个分支指令的能力，第一部分中的每个分支指令分支到指令集的第二部分中的相应指令， 分支指令的分支到相应的指令以顺序的方式排列。 处理器测试还可以包括随机生成指令集的第二部分的第二多个分支指令的能力，第二部分中的每个分支指令分支到指令集的第一部分中的相应指令， 相应指令的分支指令按顺序排列。 处理器测试可以另外包括在执行期间遇到每个分支指令时产生多个指令来增加计数器的能力。

公开(公告)号：US08811193B2

公开(公告)日：2014-08-19

申请号：US12900348

申请日：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: H04L12/26

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