专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

91. 发明授权

US07406082B2 Sequence number schemes for acceptance/rejection of duplicated packets in a packet-based data network 有权
标题翻译：用于在基于分组的数据网络中接受/拒绝重复分组的序列号方案
公开(公告)号：US07406082B2
公开(公告)日：2008-07-29
申请号：US10261090
申请日：2002-09-30
申请人： Ramesh Nagarajan , Vinay D. Purohit , Muhammad A. Qureshi , Yung-Terng Wang
发明人： Ramesh Nagarajan , Vinay D. Purohit , Muhammad A. Qureshi , Yung-Terng Wang
IPC分类号： H04L12/28
CPC分类号： H04L47/34 , H04L45/00 , H04L45/24 , H04L47/10 , H04L47/27
摘要： In a packet-based data network, packets are duplicated and a sequence number is inserted into each duplicate packet, where the duplicate packets are transmitted along two different paths from a source node to a destination node in the network. Depending on the implementation, the source node inserts different types of sequence numbers into the duplicate packets, and the destination node processes those sequence numbers accordingly to determine whether to accept or reject each received packet. In certain implementations, the number of sequence bits allocated to each packet is smaller than the size of the effective sequence number for the packet as interpreted by the destination node.
摘要翻译：在基于分组的数据网络中，分组被复制，并且将序列号插入到每个重复分组中，其中重复分组沿着从源节点到网络中的目的地节点的两个不同路径传输。根据实现，源节点将不同类型的序列号插入到重复分组中，并且目的节点相应地处理这些序列号，以确定是接受还是拒绝每个接收到的分组。在某些实现中，分配给每个分组的序列比特数小于由目的地节点解释的分组的有效序列号的大小。

92. 发明授权

US07406074B2 Bundling messages in communication networks 有权
标题翻译：在通信网络中捆绑消息
公开(公告)号：US07406074B2
公开(公告)日：2008-07-29
申请号：US10193932
申请日：2002-07-12
申请人： Bharat T. Doshi , Ramesh Nagarajan
发明人： Bharat T. Doshi , Ramesh Nagarajan
IPC分类号： H04L12/50 , G06F15/173
CPC分类号： H04L45/22 , H04L69/40
摘要： Multiple requests to set up and/or tear down connections in a node of a communication network (or multiple failure notifications) are bundled together for transmission within the network. In an “inter-nodal” embodiment, multiple connection requests/failure notifications are bundled together as a single message for transmission between pairs of nodes in the network. In an “intra-nodal” embodiment, multiple connection requests/failure notifications received at one component of a node in the network are bundled together as a single group for forwarding to another component within the same node for implementation. In either case, the bundling of multiple connection requests/failure notifications can reduce the total amount of time required to communicate and implement the desired connection requests/restoration processing. This reduction in time can be critical to the ability of a network to satisfy requirements associated with restoration processing following a network fault.
摘要翻译：在通信网络的节点（或多个故障通知）中建立和/或拆除连接的多个请求被捆绑在一起以在网络内传输。在“节点间”实施例中，将多个连接请求/故障通知捆绑在一起作为单个消息以在网络中的节点对之间进行传输。在“节点内”实施例中，在网络中的节点的一个组件处接收的多个连接请求/故障通知被捆绑在一起作为单个组，用于转发到同一节点内的另一个组件以用于实现。在任一情况下，多个连接请求/故障通知的捆绑可以减少通信和实现所需的连接请求/恢复处理所需的总时间量。网络故障后，网络能够满足与恢复处理相关的要求，这种时间的减少对于能力至关重要。

93. 发明申请

US20080159143A1 LINK SIGNAL-TO-NOISE AWARE ROUTING OVER MOBILE AD HOC NETWORKS (MANETS) 审中-公开
标题翻译：链接信号通知移动通信网络（MANETS）
公开(公告)号：US20080159143A1
公开(公告)日：2008-07-03
申请号：US11617858
申请日：2006-12-29
申请人： Ramesh Nagarajan , Shyam P. Parekh , Kiran M. Rege
发明人： Ramesh Nagarajan , Shyam P. Parekh , Kiran M. Rege
IPC分类号： G08C15/00
CPC分类号： H04W40/30 , H04W40/12
摘要： 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 a quantitative value for each link at an individual node in the MANET, where the value represents the current quality level of each of the links. Next, the present invention broadcasts an advertisement for each of the links in the MANET by each of the nodes, the advertisement including the value determined above. After broadcasting the advertisement, routing tables are composed at each of the nodes based upon the advertisements. Each routing table includes the value determined above. After composing the routing tables, a route based upon the routing table (and the link values contained therein) is selecting by the source node to direct the data flow to the destination node.
摘要翻译：本发明提供一种用于将数据流从源节点路由到移动自组织网络（MANET）中的目的地节点的方法和装置。本发明通过首先确定MANET中各个节点上的每个链路的定量值来执行该功能，其中该值表示每个链路的当前质量等级。接下来，本发明通过每个节点广播MANET中的每个链路的广告，广告包括上面确定的值。在广播广告之后，基于广告在每个节点上组成路由表。每个路由表包括上面确定的值。在组合路由表之后，基于路由表（及其中包含的链路值）的路由是由源节点选择以将数据流引导到目的地节点。

94. 发明申请

US20080062447A1 System and method for replacing binary level masks in a page description 有权
标题翻译：用于在页面描述中替换二进制级掩码的系统和方法
公开(公告)号：US20080062447A1
公开(公告)日：2008-03-13
申请号：US11518160
申请日：2006-09-11
申请人： Yingjun Bai , Ramesh Nagarajan
发明人： Yingjun Bai , Ramesh Nagarajan
IPC分类号： G06F3/12
CPC分类号： G06K15/02 , G06K15/1825 , G06K15/1849
摘要： A system and method for rendering an image file for outputting a copy of an image represented by the image file. In some embodiments, rendering the image includes generating an output file, such as an output bitmap based on a predetermined halftone. In one embodiment, the system comprises an input module, and a processor. The input module obtains a page description of the image to be output. In some instances, the page description includes one or more level masks designed to impart corresponding transparency levels to one or more objects in the page description. The processor (i) detects the one or more level masks in the page description, (ii) determines the one or more corresponding transparency levels of the one or more detected level masks, (iii) obtains one or more custom masks that correspond to the same one or more transparency levels as the one or more detected level masks, wherein the one or more custom masks are designed based on the predetermined halftone, and (iv) replaces the one or more level masks in the page description with the corresponding one or more custom masks.
摘要翻译：一种用于呈现用于输出由图像文件表示的图像的副本的图像文件的系统和方法。在一些实施例中，渲染图像包括基于预定的半色调生成诸如输出位图之类的输出文件。在一个实施例中，系统包括输入模块和处理器。输入模块获得要输出的图像的页面描述。在一些情况下，页面描述包括设计成将相应的透明度级别赋予页面描述中的一个或多个对象的一个或多个级别掩码。处理器（i）检测页面描述中的一个或多个级别掩码，（ii）确定一个或多个检测到的级别掩码的一个或多个相应的透明度级别，（iii）获得一个或多个对应于与一个或多个检测到的级别掩模相同的一个或多个透明度级别，其中基于预定的半色调设计一个或多个自定义掩码，以及（iv）用页面描述中的一个或多个级别掩码替换相应的一个或多个更多自定义面具。

95. 发明申请

US20080049238A1 METHOD AND SYSTEM FOR AUTOMATIC WINDOW CLASSIFICATION IN A DIGITAL REPROGRAPHIC SYSTEM 审中-公开
标题翻译：数字图像系统中自动窗口分类的方法与系统
公开(公告)号：US20080049238A1
公开(公告)日：2008-02-28
申请号：US11467584
申请日：2006-08-28
申请人： Ramesh Nagarajan , Xing Li , Peter D. McCandlish , Francis Kapo Tse
发明人： Ramesh Nagarajan , Xing Li , Peter D. McCandlish , Francis Kapo Tse
IPC分类号： G06F15/00
CPC分类号： G06K9/38
摘要： A method and system for processing an image in a digital reprographic system that performs a first segmentation process upon a contone digital image to identify one of a plurality of image data types for each pixel in the contone digital image, generating tags, binarizing the contone digital image and storing the binary image as an intermediate format. This binary image is later reconstructed to generate a reconstructed contone digital image; and performing a second segmentation process upon the reconstructed contone digital image to identify areas of the reconstructed contone digital image with common image data types.
摘要翻译：一种用于处理数字复制系统中的图像的方法和系统，其对连续数字图像执行第一分割处理，以识别连续数字图像中的每个像素的多个图像数据类型中的一个，生成标签，二进制化连续数字数字图像并将二进制图像存储为中间格式。该二进制图像随后被重建以产生重建的连续色数字图像; 以及对重建的连续色调数字图像执行第二分割处理以识别具有公共图像数据类型的重建连续数字图像的区域。

96. 发明申请

US20070253341A1 Method and apparatus for identifying network connectivity changes in dynamic networks 失效
标题翻译：用于识别动态网络中网络连接变化的方法和装置
公开(公告)号：US20070253341A1
公开(公告)日：2007-11-01
申请号：US11414126
申请日：2006-04-28
申请人： Gary Atkinson , Xiang Liu , Ramesh Nagarajan , Shyam Parekh
发明人： Gary Atkinson , Xiang Liu , Ramesh Nagarajan , Shyam Parekh
IPC分类号： H04J1/16
CPC分类号： H04W40/24 , H04L45/02 , H04W84/18
摘要： The invention comprises a method and apparatus for determining a network connectivity in a network having a plurality of nodes. In particular, one embodiment of the method includes generating a candidate link for each of a plurality of node pairs, predicting a performance of each candidate link by evaluating an expected impact of at least one condition on each candidate link, and determining the network topology using the predicted performances of the candidate links. The performance of each candidate link may be predicted by identifying at least one condition, determining the expected impact of the at least one condition on the candidate link, and predicting the performance of the candidate link by adjusting an expected performance of the candidate link using the expected impact of the at least one condition on the candidate link.
摘要翻译：本发明包括一种用于确定具有多个节点的网络中的网络连接性的方法和装置。特别地，该方法的一个实施例包括为多个节点对中的每一个生成候选链路，通过评估至少一个条件对每个候选链路的预期影响来预测每个候选链路的性能，以及使用候选人链接的预测表现。每个候选链路的性能可以通过识别至少一个条件，确定至少一个条件对候选链路的预期影响以及通过使用该候选链路调整候选链路的预期性能来预测候选链路的性能来预测至少一个条件对候选链接的预期影响。

97. 发明申请

US20070171475A1 System and method for high addressable binary image generation 有权
标题翻译：高可寻址二进制图像生成的系统和方法
公开(公告)号：US20070171475A1
公开(公告)日：2007-07-26
申请号：US11340380
申请日：2006-01-26
申请人： Clara Cuciurean-Zapan , Ramesh Nagarajan
发明人： Clara Cuciurean-Zapan , Ramesh Nagarajan
IPC分类号： G06K15/00
CPC分类号： H04N1/4052
摘要： The disclosed system and method provide a binary image generation method. Used, for example, in a digital reprographic system, the method is suitable for eliminating printing artifacts for high addressable binary digital output, such as digital copies, using an optimized ordered error diffusion method with dynamically computable quantization error and dynamic binary output calculation.
摘要翻译：所公开的系统和方法提供二进制图像生成方法。例如，在数字复制系统中，该方法适用于使用具有动态可计算的量化误差和动态二进制输出计算的优化有序误差扩散方法来消除用于高可寻址二进制数字输出的打印伪像，例如数字拷贝。

98. 发明申请

US20070140575A1 System and method for monochrome binary compression on legacy devices 有权
标题翻译：传统设备上单色二进制压缩的系统和方法
公开(公告)号：US20070140575A1
公开(公告)日：2007-06-21
申请号：US11304483
申请日：2005-12-15
申请人： Yingjun Bai , Ramesh Nagarajan
发明人： Yingjun Bai , Ramesh Nagarajan
IPC分类号： G06K9/36
CPC分类号： H04N1/413 , H04N1/3333 , H04N19/27 , H04N19/30 , H04N2201/33357
摘要： Disclosed is a system and method for monochrome or binary compression, and more particularly compression of binary images segmented in a binary domain into at least two regions of different image types, where the regions are compressed using different compression techniques.
摘要翻译：公开了一种用于单色或二进制压缩的系统和方法，更具体地，将二进制域中分段的二进制图像压缩成不同图像类型的至少两个区域，其中使用不同压缩技术来压缩区域。

99. 发明申请

US20070098262A1 Dynamic range detection and adjustment 失效
标题翻译：动态范围检测和调整
公开(公告)号：US20070098262A1
公开(公告)日：2007-05-03
申请号：US11263249
申请日：2005-10-31
申请人： Ammal Malik , Xing Li , Ramesh Nagarajan
发明人： Ammal Malik , Xing Li , Ramesh Nagarajan
IPC分类号： G06K9/00 , H04N1/40
CPC分类号： H04N1/38 , G06K9/38 , G06K2209/01 , H04N1/403
摘要： An original image is received. The original image is divided into tiles. A whitepoint value of each tile is determined. A blackpoint value of each tile is determined. A whitepoint value of each pixel in the image is determined by interpolating the determined whitepoint values of neighboring tiles. A blackpoint of each pixel in the image is determined by interpolating the determined blackpoint values of neighboring tiles.
摘要翻译：收到原始图像。原始图像分为瓷砖。确定每个瓦片的白色点值。确定每个瓦片的黑点值。图像中每个像素的白点值通过内插确定的相邻瓦片的白点值来确定。通过内插确定的相邻瓦片的黑点值来确定图像中每个像素的黑点。

100. 发明授权

US07190837B2 Compression of mixed raster content (MRC) image data 失效
标题翻译：压缩混合光栅内容（MRC）图像数据
公开(公告)号：US07190837B2
公开(公告)日：2007-03-13
申请号：US10639391
申请日：2003-08-12
申请人： Xing Li , Ramesh Nagarajan , Ammal Z. Malik
发明人： Xing Li , Ramesh Nagarajan , Ammal Z. Malik
IPC分类号： G06K9/36 , G06K9/34
CPC分类号： H04N1/58 , H04N1/3871
摘要： In a mixed raster content (MRC) image data format, where a separation plane is used to define portions of the image to compressed in a lossy or lossless manner, edge pixels are identified in the separation plane. Each edge pixel is modified to assume a maximum luminance and most neutral chrominance found among neighboring pixels. The modification of the edge pixel data minimizes artifacts such as fringe effects when the image data is compressed and subsequently decompressed.
摘要翻译：在混合光栅内容（MRC）图像数据格式中，使用分离平面来定义要以有损或无损的方式压缩的图像的部分，边缘像素在分离平面中被识别。修改每个边缘像素以呈现在相邻像素中发现的最大亮度和最中性色度。当图像数据被压缩并随后解压缩时，边缘像素数据的修改最小化诸如边缘效应之类的伪影。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式