公开(公告)号：US20110320613A1

公开(公告)日：2011-12-29

申请号：US13172205

申请日：2011-06-29

Applicant: Jay Mandal ,  Nitin Gupta ,  Steven Chee-Man Kam

Inventor： Jay Mandal ,  Nitin Gupta ,  Steven Chee-Man Kam

IPC: G06F15/16

CPC classification number: G06Q10/107

Abstract: The invention relates to a method of establishing communication between one or more users and one or more professional service providers. The professional service provides include, but are not limited to legal professionals, medical professionals, doctors, taxation professionals, accounting professionals, and financial professionals. Information corresponding to one or more professional service requirements of the user is obtained. The information includes basic information and confidential information. The basic information is transmitted to the one or more professional service providers based on the one or more professional service requirements of the user. Thereafter, communication is established between the user and the one or more professional service providers based on conflict of interest and an affirmative confirmation from the one or more professional service providers.

Abstract translation: 本发明涉及一种建立一个或多个用户与一个或多个专业服务提供商之间的通信的方法。 专业服务包括但不限于法律专业人员，医疗专业人员，医生，税务专业人士，会计专业人员和财务人员。 获得与用户的一个或多个专业服务要求相对应的信息。 信息包括基本信息和机密信息。 基于用户的一个或多个专业服务要求将基本信息传送给一个或多个专业服务提供商。 此后，基于利益冲突和来自一个或多个专业服务提供商的肯定确认，在用户与一个或多个专业服务提供商之间建立通信。

公开(公告)号：US08010889B2

公开(公告)日：2011-08-30

申请号：US11743563

申请日：2007-05-02

Applicant: Nitin Gupta ,  Sivasankaran Chandrasekar ,  Ravi Murthy ,  Nipun Agarwal

Inventor： Nitin Gupta ,  Sivasankaran Chandrasekar ,  Ravi Murthy ,  Nipun Agarwal

IPC: G06N3/00

CPC classification number: G06F17/30569 ,  G06F17/30908 ,  H03M7/30

Abstract: Various techniques are described hereafter for improving the efficiency of binary XML encoding and loading operations. In particular, techniques are described for incrementally encoding XML in response to amount-based requests. After encoding enough binary XML to satisfy an amount-based request, the encoder stops encoding the XML until a subsequent request is received. The incremental encoding may take place on the client-side or the server-side. Techniques are also described for reducing the character set conversion operations by having a parser convert tokens in text XML into one character set while converting non-token text in the text XML into another character set. Techniques are also described for generating self-contained binary XML documents, and for improving remap operations by providing a binary XML document on a chunk-by-chunk basis.

Abstract translation: 以下描述了用于提高二进制XML编码和加载操作的效率的各种技术。 特别地，描述了用于响应于基于量的请求逐渐编码XML的技术。 在编码足够的二进制XML以满足基于数量的请求之后，编码器停止对XML的编码，直到接收到后续请求。 增量编码可能发生在客户端或服务器端。 还描述了通过使解析器将文本XML中的令牌转换为一个字符集同时将文本XML中的非令牌文本转换为另一个字符集来减少字符集转换操作的技术。 还描述了用于生成自包含二进制XML文档以及通过以块为单位提供二进制XML文档来改进重映射操作的技术。

公开(公告)号：US20110085450A1

公开(公告)日：2011-04-14

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

公开(公告)号：US20100241807A1

公开(公告)日：2010-09-23

申请号：US12730192

申请日：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: G06F12/08 ,  G06F12/00

CPC classification number: G06F16/188 ,  G06F3/0643 ,  G06F3/0653 ,  G06F3/067 ,  G06F12/0862 ,  G06F16/172 ,  G06F2212/6024

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.

Abstract translation: 虚拟存储阵列将通过广域网连接的数据中心的分支数据存储整合。 虚拟存储阵列对存储客户端显示为本地数据存储; 然而，虚拟存储阵列实际上将数据存储在数据中心。 虚拟存储阵列通过预测和预取存储块来克服广域网的带宽和延迟限制，然后将存储块缓存在分支位置。 虚拟存储阵列利用对与存储块相关联的高级数据结构的语义和结构的理解，以预测存储客户端在不久的将来可能要求哪些存储块。 虚拟存储阵列确定所请求的存储块和相应的高级数据结构实体之间的关联，以预测可能被访问的附加高级数据结构实体。 从此，虚拟存储阵列识别用于预取的附加存储块。

公开(公告)号：US20100010212A1

公开(公告)日：2010-01-14

申请号：US12583305

申请日：2009-08-17

Applicant: Vinod Kumar Kansal ,  Suhail Ahmad ,  Bhupendra Tyagi ,  Nitin Gupta

Inventor： Vinod Kumar Kansal ,  Suhail Ahmad ,  Bhupendra Tyagi ,  Nitin Gupta

IPC: C07D205/08 ,  A61K31/397

CPC classification number: C07D205/08 ,  Y02P20/55

Abstract: The invention encompasses (3R,4S)-4-((4-benzyloxy)phenyl)-1-(4-fluorophenyl)-3-(3-(4-fluorophenyl)-3-oxopropyl)-2-azetidinone (Compound 2a) having an enantiomeric purity of at least about 97.5%. The invention also encompasses Compound 2a having a chemical purity of at least about 97%. The invention further encompasses processes for preparing Compound 2a from Compound 1 having the following formula: The invention also encompasses processes for preparing a compound having the following formula: from a compound having the following formula: wherein R is selected from the group consisting of: H or a hydroxyl protecting group. The invention also encompasses processes for preparing Compound 2a, preferably to form Compound 2a-Form 01. Also included are processes for preparing ezetimibe from Compound 2a-Form 01 or Compound 2a prepared according to the invention, compositions containing such ezetimibe, and methods for reducing cholesterol using such compositions

Abstract translation: 本发明包括（3R，4S）-4 - （（4-苄氧基）苯基）-1-（4-氟苯基）-3-（3-（4-氟苯基）-3-氧代丙基）-2-氮杂环丁酮（化合物2a ）具有至少约97.5％的对映体纯度。 本发明还包括具有至少约97％的化学纯度的化合物2a。 本发明还包括从具有下式的化合物1制备化合物2a的方法：本发明还包括由具有下式的化合物制备具有下式的化合物的方法：其中R选自：H 或羟基保护基。 本发明还包括制备化合物2a，优选形成化合物2a-形式01的方法。还包括用于制备根据本发明制备的化合物2a-形式01或化合物2a的依泽替米贝的方法，含有这种依泽替米贝的组合物，以及还原方法 使用这种组合物的胆固醇

公开(公告)号：US20090132556A1

公开(公告)日：2009-05-21

申请号：US11941746

申请日：2007-11-16

Applicant: Nitin Gupta ,  Jayavel Shanmugasundaram ,  Fan Yang

Inventor： Nitin Gupta ,  Jayavel Shanmugasundaram ,  Fan Yang

IPC: G06F7/00 ,  G06F17/00

CPC classification number: G06F8/65 ,  G06F8/35

Abstract: Subject matter disclosed herein may relate to enabling offline operations for online applications.

Abstract translation: 本文中公开的主题可能涉及启用在线应用程序的脱机操作。

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