会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • PLATFORM INDEPENDENT ECOSYSTEM FOR CREATION, CONSUMPTION AND TRADE OF USER-GENERATED DIGITAL CONTENT
    • 平台独立生态系统,用于创建,消费和贸易用户生成的数字内容
    • US20090327094A1
    • 2009-12-31
    • US12165399
    • 2008-06-30
    • Jean-Emile ElienLing Tony ChenRyan B. CooperShyam KrishnamoorthyGennady MedvinskyGregory D. HartrellRamesh Nagarajan
    • Jean-Emile ElienLing Tony ChenRyan B. CooperShyam KrishnamoorthyGennady MedvinskyGregory D. HartrellRamesh Nagarajan
    • G06Q30/00G06F21/00
    • G06Q30/0601G06F21/10G06F21/6218
    • A platform (e.g. game console) and application (e.g. game title) independent ecosystem for the creation, consumption and trade of user generated digital content permits any application operating on any platform to participate in a market driven economy for user generated digital objects (UGDOs). The trading system is independent of (i.e. external to) all participating applications. A metadata attribution method for UGDOs in combination with heterogeneous application support through well-defined interfaces facilitates unlimited participation. Attributed metadata may be understood and consumed across platforms and applications. Flexible UGDO rights enforcement techniques in combination with a flexible fair exchange service for those rights support all manner of UGDOs and commercial transactions therefore. Participating application may provide rights enforcement in some instances. The nature of enforcement may rest on the nature of UGDO content, rights in UGDOs or author preferences. The trading system assures that all transactions in the UGDO economy are secure, fault tolerant and atomic, providing integrity and confidence in the UGDO economy.
    • 用户生成的数字内容的创建,消费和交易的平台(如游戏控制台)和应用程序(例如游戏标题)独立生态系统允许在任何平台上运行的任何应用程序参与用户生成的数字对象(UGDO)的市场驱动型经济, 。 交易系统独立于(即外部)所有参与的应用程序。 UGDO的元数据归属方法与通过明确界面的异构应用程序支持相结合,有助于无限参与。 归属的元数据可以在平台和应用程序中被理解和使用。 灵活的UGDO权利执法技术结合灵活的公平交换服务,为这些权利提供支持,因此,UGDO的所有形式和商业交易都得到支持。 在某些情况下,参与的应用程序可能会提供权限执行。 执法的性质可能取决于UGDO内容的性质,UGDO的权利或作者偏好。 贸易体系保证,UGDO经济中的所有交易都是安全,容错和原子的,为UGDO经济提供诚信和信心。
    • 6. 发明授权
    • 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包括专门针对特定于应用程序和特定于框架的类的域数据类组件,以暴露数据平台的特定于域的属性和行为。 数据平台可以是与数据存储器接口以提供可由多个不同应用框架访问的数据服务的通用数据平台,该数据服务允许不同框架的相应应用访问数据存储。
    • 7. 发明申请
    • 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建立消息用于确定节点的端口的传输模式,并且随后根据需要更新生成树和传输模式。
    • 8. 发明授权
    • 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.
    • 恢复路径规划器通过减少在单个元件发生故障时必须在网络中执行的最坏情况的交叉连接数来满足网络的恢复时间限制,从而最大限度地降低成本。 计划员涉及到优化,其识别网络内的需求的主要和恢复路径计划,使得网络内任何节点处的最坏情况数量的交叉连接最小和/或限制。 实施例进一步限制路径规划的成本。 在一个实施例中,恢复时间是有限的并且成本被放宽直到找到解决方案。 在另一个实施例中,将恢复时间限制放宽到极限,同时存储路径计划及其成本。 这些计划可以随后在所需的成本和恢复时间之间进行选择。 使网络成本最小化的至少一种方法涉及最大化恢复路径规划中的共享。
    • 9. 发明授权
    • 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.
    • 将页面描述语言中描述的图像转换为连字图像的方法和系统。 连续色调图像被半色调编码以产生包括边缘标签数据和图像数据的图像数据。 确定预定义像素邻域内的图像数据的每个像素的标记状态值。 使用预定的一组过滤器加权值来过滤图像数据,其中预定的像素邻域内的图像数据的每个像素具有相关联的滤波器权重值。 将预定的滤波图像值分配给具有指示边缘像素的带状态的每个像素。 当像素的标记状态是非边缘像素时,分配用于预定义像素邻域的所有滤波图像值的求和。
    • 10. 发明申请
    • ESTIMATING AN AMOUNT OF COLOR CONTENT IN A DOCUMENT
    • 估计文件中的颜色内容数量
    • US20090195801A1
    • 2009-08-06
    • US12026018
    • 2008-02-05
    • Amal Zaka MALIKXing LiRamesh Nagarajan
    • Amal Zaka MALIKXing LiRamesh Nagarajan
    • H04N1/50
    • H04N1/6016H04N1/00002H04N1/00005H04N1/00068H04N1/00832H04N1/34H04N2201/0082
    • What is provided herein is a novel system and method for estimating the amount of color in a document. In one embodiment, a binary CMYK input image is received. Each of the CMYK plane is received at an offset from the previous plane, i.e., the 4 planes are not received simultaneously. Each plane is divided into M×N tiles. Pixel values of all four planes are examined separately and the number of on-pixels is counted for each plane. The number of on-pixel counts for each tile are aggregated for each plane. Total on-pixel counts are used to estimate the total number of white, black, color, and gray pixel counts. The total counts for all planes are used to estimate the amount of color. A document is determined to be color if the amount of color exceeds a predetermined threshold. A color billing strategy is determined based on the estimated color amount.
    • 这里提供的是用于估计文档中的颜色量的新颖的系统和方法。 在一个实施例中,接收二进制CMYK输入图像。 每个CMYK平面在与前一个平面的偏移处被接收,即,4个平面不被同时接收。 每个飞机分为MxN瓦。 分别检查所有四个平面的像素值,并对每个平面计数像素数。 为每个平面聚合每个图块的像素数量数。 总像素数量用于估计白色,黑色,彩色和灰色像素数的总数。 所有飞机的总计数用于估计颜色的数量。 如果颜色量超过预定阈值,文档被确定为颜色。 基于估计的颜色量来确定颜色计费策略。