会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 51. 发明授权
    • Storage API for a common data platform
    • Storage API用于通用数据平台
    • US07685561B2
    • 2010-03-23
    • US11195320
    • 2005-08-02
    • Michael E. DeemBenjamin AlbahariRamesh NagarajanMichael J. PizzoArthur T. WhittenEdward G. Sheppard
    • Michael E. DeemBenjamin AlbahariRamesh NagarajanMichael J. PizzoArthur T. WhittenEdward G. Sheppard
    • G06F9/44
    • G06F17/3056
    • An application program interface (API) for a data platform. The API includes a generic data access component that exposes at least one of stores, sessions, transactions, and query services of the data platform, which data platform is associated with a data store. A data classes component of the API provides canonical, application-independent classes that expose types and relationships of a data model of the data platform. The API includes a domain data classes component of application-specific and framework-specific classes that expose domain-specific properties and behaviors of the data platform. The data platform can be a common data platform that interfaces to the data store to provide data services accessible by a plurality of disparate application frameworks, which data services allow a corresponding application of the different frameworks to access the data store.
    • 用于数据平台的应用程序接口(API)。 API包括通用数据访问组件,其暴露数据平台的至少一个存储,会话,事务和查询服务,该数据平台与数据存储相关联。 API的数据类组件提供了规范的,独立于应用程序的类,用于暴露数据平台数据模型的类型和关系。 该API包括专门针对特定于应用程序和特定于框架的类的域数据类组件,以暴露数据平台的特定于域的属性和行为。 数据平台可以是与数据存储器接口以提供可由多个不同应用框架访问的数据服务的通用数据平台,该数据服务允许不同框架的相应应用访问数据存储。
    • 52. 发明申请
    • AUTOMATICALLY CONFIGURING MESH GROUPS IN DATA NETWORKS
    • 在数据网络中自动配置MESH组
    • US20100020726A1
    • 2010-01-28
    • US12179855
    • 2008-07-25
    • Thomas P. ChuRamesh NagarajanYung-Terng Wang
    • Thomas P. ChuRamesh NagarajanYung-Terng Wang
    • H04L12/28H04L12/56
    • H04L12/462H04L45/02H04L45/122H04L45/48
    • In one embodiment, a method for setting up a flow-through mesh group (FTMG) for transmitting link-state packets (LSPs) in a network having a plurality of nodes interconnected by links. The FTMG is a combination of multiple spanning trees for the network through which LSPs are forwarded. FTMG set-up messages are received at ports of each node of the network from peer ports of linked nodes. FTMG set-up messages identify root nodes of the multiple spanning trees and the transmission modes of the peer ports. The FTMG set-up messages are used to determine (1) a root node for each spanning tree, (2) a root port on each node for each spanning tree, and (3) directionality of ports of the nodes. FTMG set-up messages are then used to determine the transmission mode of ports of the nodes and, subsequently, to update the spanning trees and transmission modes, as needed.
    • 在一个实施例中,一种用于建立用于在具有通过链路互连的多个节点的网络中发送链路状态分组(LSP)的流通网状组(FTMG)的方法。 FTMG是通过LSP转发的网络的多个生成树的组合。 FTMG建立消息从链接节点的对端口接收到网络的每个节点的端口。 FTMG建立消息标识了多个生成树的根节点和对端口的传输模式。 FTMG建立消息用于确定(1)每个生成树的根节点,(2)每个生成树的每个节点上的根端口,以及(3)节点端口的方向性。 然后,FTMG建立消息用于确定节点的端口的传输模式,并且随后根据需要更新生成树和传输模式。
    • 53. 发明授权
    • Restoration time in networks
    • 网络恢复时间
    • US07643408B2
    • 2010-01-05
    • US10815123
    • 2004-03-31
    • Gary W. AtkinsonMichael L. CranerRamesh Nagarajan
    • Gary W. AtkinsonMichael L. CranerRamesh Nagarajan
    • H04L1/22
    • H04L41/0668H04L41/0896H04L43/0811
    • A restoration path planner minimizes cost while meeting restoration-time constraints of a network by reducing the worst-case number of cross-connections that must be performed in a network in the event of a single element failure. The planner involves optimization that identifies primary and restoration path plans for demands within the network such that the worst-case number of cross-connections at any node within the network is minimal and/or bounded. Embodiments further constrain the cost of the path plan. In one embodiment, restoration time is bounded and cost is relaxed until a solution is found. In another embodiment, the restoration time bound is relaxed to a limit while path plans and their costs are stored. These plans can later be chosen amongst for the desired balance of cost and restoration time. At least one approach to minimization of network cost involves maximizing sharing within restoration path plans.
    • 恢复路径规划器通过减少在单个元件发生故障时必须在网络中执行的最坏情况的交叉连接数来满足网络的恢复时间限制,从而最大限度地降低成本。 计划员涉及到优化,其识别网络内的需求的主要和恢复路径计划,使得网络内任何节点处的最坏情况数量的交叉连接最小和/或限制。 实施例进一步限制路径规划的成本。 在一个实施例中,恢复时间是有限的并且成本被放宽直到找到解决方案。 在另一个实施例中,将恢复时间限制放宽到极限,同时存储路径计划及其成本。 这些计划可以随后在所需的成本和恢复时间之间进行选择。 使网络成本最小化的至少一种方法涉及最大化恢复路径规划中的共享。
    • 54. 发明授权
    • Method and system for generating contone encoded binary print data streams
    • 用于生成连续编码的二进制打印数据流的方法和系统
    • US07580569B2
    • 2009-08-25
    • US11268147
    • 2005-11-07
    • Francis K. TseRamesh Nagarajan
    • Francis K. TseRamesh Nagarajan
    • G06K9/34
    • H04N1/4092
    • A method and system to convert an image described in a page description language to a contone image. The contone image is halftoned and encoded to generate image data including edge tag data and image data. A tagged state value of each pixel of image data within a predefined neighborhood of pixels is determined. The image data is filtered using a predetermined set of filter weighting values wherein each pixel of image data within the predefined neighborhood of pixels has an associated filter weighting value. A predetermined filtered image value is assigned to each pixel having a tagged state indicating an edge pixel. A summation of all filtered image values for the predefined neighborhood of pixels is assigned when the tagged state of the pixel is a non-edge pixel.
    • 将页面描述语言中描述的图像转换为连字图像的方法和系统。 连续色调图像被半色调编码以产生包括边缘标签数据和图像数据的图像数据。 确定预定义像素邻域内的图像数据的每个像素的标记状态值。 使用预定的一组过滤器加权值来过滤图像数据,其中预定的像素邻域内的图像数据的每个像素具有相关联的滤波器权重值。 将预定的滤波图像值分配给具有指示边缘像素的带状态的每个像素。 当像素的标记状态是非边缘像素时,分配用于预定义像素邻域的所有滤波图像值的求和。
    • 56. 发明申请
    • AUTOMATED METHOD AND SYSTEM FOR NAMING DOCUMENTS FROM A SCANNED SOURCE BASED ON MANUALLY MARKED TEXT
    • 自动化方法和系统,用于根据手动标记的文本从扫描的源中归档文件
    • US20090092317A1
    • 2009-04-09
    • US11866913
    • 2007-10-03
    • Ramesh NagarajanMatthew John Nolepa
    • Ramesh NagarajanMatthew John Nolepa
    • G06K9/34
    • G06K9/2063G06K2209/01
    • A method for associating text with image data of documents is herein described. The method includes receiving image data of a document with manually marked text and recognizing the manually marked text. The image data is then annotated (e.g., tagged) using the manually marked text and the image data of the document is stored. When manually marked text is recognized, recognized text may be generated for annotating the image data of the document and used to populate a field associated with the image data. The field may be a name of the document or a subject line of an e-mail message, for example. A method including identifying the location of manually marked text in a first scanned document to automatically identify and annotate text in a corresponding location in a second scanned document is also disclosed.
    • 这里描述用于将文本与文档的图像数据相关联的方法。 该方法包括用手动标记的文本接收文档的图像数据并识别手动标记的文本。 然后使用手动标记的文本对图像数据进行注释(例如,标记),并存储文档的图像数据。 当识别到手动标记的文本时,可以生成识别的文本以注释文档的图像数据并用于填充与图像数据相关联的字段。 例如,该字段可以是电子邮件消息的文档的名称或主题行。 还公开了一种方法,其包括在第一扫描文档中识别手动标记的文本的位置以自动识别和注释第二扫描文档中相应位置中的文本。
    • 58. 发明申请
    • QUALITY OF SERVICE AWARE ROUTING OVER MOBILE AD HOC NETWORKS (MANETS)
    • 服务质量通过移动广告网络(MANETS)
    • US20080159144A1
    • 2008-07-03
    • US11617876
    • 2006-12-29
    • Ramesh NagarajanShyam P. ParekhKiran M. Rege
    • Ramesh NagarajanShyam P. ParekhKiran M. Rege
    • G08C15/00
    • H04W40/30H04L45/124H04L45/3065H04W40/24
    • The present invention provides a method and apparatus for routing a data flow from a source node to a destination node in a mobile ad-hoc network (MANET). The present invention performs this function by first determining desired service requirements for an individual data flow to be forwarded to a destination node. Next, the present invention broadcasts an advertisement for each of the links in the MANET by the corresponding origination nodes, the advertisement including a value indicating the current performance level of the link. After broadcasting the advertisements, routing tables are composed at each of the nodes based upon the advertisements. Each routing table is constructed taking into account the advertised links and their corresponding values. After composing the routing tables, packets are forwarded toward their respective destinations by utilizing the routing tables in such a manner that the desired service requirements are satisfied.
    • 本发明提供一种用于将数据流从源节点路由到移动自组织网络(MANET)中的目的地节点的方法和装置。 本发明通过首先确定要转发到目的地节点的单个数据流的期望业务需求来执行该功能。 接下来,本发明通过相应的发起节点广播MANET中的每个链路的广告,该广告包括指示链接的当前性能水平的值。 在广播广告之后,基于广告在每个节点上组成路由表。 每个路由表的构建考虑到所通告的链接及其对应的值。 在组合路由表之后,通过利用路由表将分组转发到它们各自的目的地,使得满足期望的业务需求。
    • 59. 发明授权
    • Efficient architectures for protection against network failures
    • 高效架构,防止网络故障
    • US07342873B1
    • 2008-03-11
    • US09587892
    • 2000-06-06
    • Ramesh Nagarajan
    • Ramesh Nagarajan
    • H04L12/26
    • H04Q11/0062H04J3/085H04J2203/0032H04J2203/0053H04J2203/006H04J2203/0098H04Q11/0478H04Q2011/0073H04Q2011/0083H04Q2011/0092
    • Traffic demands are routed between network elements so as to provide improved protection against network failures. A given traffic demand is routed from a first network element to a second network element, where the second network element is preferably either one of a set of dual-homed elements, or coupled to a dual-homed element, and may also be an element of a ring-type transport or a mesh-type transport. The second network element processes the traffic demand such that a copy of a signal associated with the demand is (i) retained at the second network element, while the signal is routed to at least one additional network element, or (ii) routed to at least one additional network element, while the signal is routed to at least one network element other than the additional network element. For example, in a multidrop connection implemented in accordance with the invention, a copy of the signal is “dropped” at the second network element and one or more additional network elements. In a multicast connection implemented in accordance with the invention, one or more copies of the signal are multicast from the second network element to multiple additional network elements.
    • 业务需求在网元之间进行路由,以提供改进的网络故障保护。 给定的业务需求从第一网络元件路由到第二网络元件,其中第二网络元件优选地是一组双归属元件中的一个或耦合到双归属元件,并且还可以是元件 的环型运输或网状运输。 第二网络元件处理业务需求,使得与该需求相关联的信号的副本(i)保留在第二网络元件处,同时信号被路由到至少一个附加网元,或者(ii)被路由到 至少一个额外的网络元件,而信号被路由到除了附加网络元件之外的至少一个网络元件。 例如,在根据本发明实现的多点连接中,信号的副本在第二网络元件和一个或多个附加网络元件被“丢弃”。 在根据本发明实现的多播连接中,信号的一个或多个副本从第二网络元件多播到多个附加网络元件。
    • 60. 发明授权
    • Systems and methods for obtaining image shear and skew
    • 用于获得图像剪切和偏斜的系统和方法
    • US07120314B2
    • 2006-10-10
    • US10342357
    • 2003-01-15
    • Stuart A. SchweidRamesh NagarajanRoger L. Triplett
    • Stuart A. SchweidRamesh NagarajanRoger L. Triplett
    • G06K9/36H04N1/04G06K9/20
    • G06T3/608H04N1/3878
    • In a machine-fed scanner, orientation angles of edges of an image bearing substrate are obtained and used to calculate image shear and/or skew. A running weighted average of the image skew may be kept in a memory. When a skew value is obtained for a given image, it may be determined whether the skew value is within a predetermined range. If the skew value is within the predetermined range, the skew value is used to determine an image revision to compensate for the skew, and the skew value is incorporated into the running weighted average skew. If the skew value is not within the predetermined range, it is discarded and the running weighted average skew is used to determine an appropriate image skew revision. The running weighted average of the shear may also be kept in a memory. A shear value is obtained for each image, and incorporated into the running weighted average shear. Shear revision is performed based on the running weighted average shear. A determination may be made whether the shear value for a current image is within a predetermined range, and the running weighted average shear may be updated based on the shear value for the current image if the shear value for the current image is within the predetermined range.
    • 在机器馈送的扫描仪中,获得图像承载基底的边缘的取向角并用于计算图像剪切和/或偏斜。 图像偏移的运行加权平均值可以保存在存储器中。 当给定图像获得偏斜值时,可以确定偏斜值是否在预定范围内。 如果偏斜值在预定范围内,则偏斜值用于确定图像修正以补偿偏斜,并且偏斜值被合并到运行加权平均偏差中。 如果偏斜值不在预定范围内,则将其丢弃,并使用运行加权平均偏差来确定适当的图像偏斜修正。 剪切的运行加权平均值也可以保存在存储器中。 对于每个图像获得剪切值,并将其并入运行加权平均剪切。 基于运行的加权平均剪切力来进行剪切修正。 可以确定当前图像的剪切值是否在预定范围内,并且如果当前图像的剪切值在预定范围内,则可以基于当前图像的剪切值更新运行加权平均剪切 。