公开(公告)号：US20100272978A1

公开(公告)日：2010-10-28

申请号：US12682588

申请日：2008-10-10

申请人： Satish Kumar ,  Han Gi Chae ,  Young Ho Choi

发明人： Satish Kumar ,  Han Gi Chae ,  Young Ho Choi

IPC分类号： D01F9/10 ,  D01F9/22 ,  B29C55/00 ,  D01F9/12

CPC分类号： H01B1/24 ,  D01F1/10 ,  D01F8/08 ,  D01F9/225 ,  Y10T428/2918

摘要： The various embodiments of the present invention provide improved carbon fibers and films, as well as methods of making the carbon fibers and films. The carbon fibers and films disclosed herein are generally formed from an acrylonitrile-containing polymer. The carbon fibers and/or films can also be formed from a composite that includes the acrylonitrile-containing polymer as well as carbon nanotubes, graphite sheets, or both. The fibers and films described herein can be tailored to exhibit one or more of high strength, high modulus, high electrical conductivity, high thermal conductivity, or optical transparency, depending on the desired application for the fibers or films.

摘要翻译： 本发明的各种实施方案提供了改进的碳纤维和薄膜，以及制备碳纤维和薄膜的方法。 本文公开的碳纤维和膜通常由含丙烯腈的聚合物形成。 碳纤维和/或膜也可以由包含含丙烯腈的聚合物以及碳纳米管，石墨片或两者的复合材料形成。 根据所需的纤维或薄膜的应用，本文所述的纤维和薄膜可以被定制以显示高强度，高模量，高导电性，高热导率或光学透明度中的一种或多种。

公开(公告)号：US20100169592A1

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

申请号：US12344364

申请日：2008-12-26

申请人： Rajeev Atluri ,  Sudhakar Pannnerselvam ,  Jayesh Shah ,  Satish Kumar ,  Srin Kumar

发明人： Rajeev Atluri ,  Sudhakar Pannnerselvam ,  Jayesh Shah ,  Satish Kumar ,  Srin Kumar

IPC分类号： G06F12/16 ,  G06F12/00

CPC分类号： G06F11/1471 ,  G06F11/2071 ,  G06F2201/84

摘要： Methods, software suites, and systems of generating a recovery snapshot and creating a virtual view of the recovery snapshot are disclosed. In an embodiment, a method includes generating a recovery snapshot at a predetermined interval to retain an ability to position forward and backward when a delayed roll back algorithm is applied and creating a virtual view of the recovery snapshot using an algorithm tied to an original data, a change log data, and a consistency data related to an event. The method may include redirecting an access request to the original data based on a meta-data information provided in the virtual view. The method may further include substantially retaining a timestamp data, a location of a change, and a time offset of the change as compared with the original data.

摘要翻译： 公开了生成恢复快照和创建恢复快照的虚拟视图的方法，软件套件以及系统。 在一个实施例中，一种方法包括以预定间隔生成恢复快照，以便在应用延迟回退算法时保持向前和向后定位的能力，并且使用与原始数据相关联的算法创建恢复快照的虚拟视图， 更改日志数据以及与事件相关的一致性数据。 该方法可以包括基于虚拟视图中提供的元数据信息将访问请求重定向到原始数据。 该方法还可以包括与原始数据相比基本上保留时间戳数据，变化的位置和变化的时间偏移。

公开(公告)号：US20060039601A1

公开(公告)日：2006-02-23

申请号：US11032423

申请日：2005-01-10

申请人： Dinesh Nair ,  Matthew Fisher ,  Satish Kumar ,  Bruce Smyth ,  Subramanian Ramamoorthy

发明人： Dinesh Nair ,  Matthew Fisher ,  Satish Kumar ,  Bruce Smyth ,  Subramanian Ramamoorthy

IPC分类号： G06K9/62 ,  G06K9/00

CPC分类号： G06K9/6292 ,  G06K9/6282

摘要： A geometric pattern matching method to locate instances of a template image in a target image using a plurality of models with different feature combinations. A learning phase involves learning geometric information about the template image and creating a model for each of a plurality of different respective parent features. Each model comprises a relationship tree from the respective parent feature to one or more other child features, and hence each model may have different feature combinations. In a matching phase, the method may examine a plurality of different models to determine matches in the target image being analyzed. The matching phase may select different models dynamically based on prior matching results.

摘要翻译： 一种几何图案匹配方法，用于使用具有不同特征组合的多个模型来定位目标图像中的模板图像的实例。 学习阶段涉及学习关于模板图像的几何信息并为多个不同的相应父特征中的每一个创建模型。 每个模型包括从相应的父特征到一个或多个其他子特征的关系树，因此每个模型可以具有不同的特征组合。 在匹配阶段，该方法可以检查多个不同模型以确定正在分析的目标图像中的匹配。 匹配阶段可以基于先前的匹配结果动态地选择不同的模型。

公开(公告)号：USD468255S1

公开(公告)日：2003-01-07

申请号：US29134367

申请日：2000-12-21

申请人： Raghaven Gopalaswami ,  Prahlada ,  Yachareni Gyaneshwar ,  Satyanarayana Gollakota ,  Puthenmadhom Venugopalan ,  Subramanian Panneerselvam ,  Satish Kumar ,  Pulinbehari Manna ,  Satyanarayana Yedidi

设计人： Raghaven Gopalaswami ,  Prahlada ,  Yachareni Gyaneshwar ,  Satyanarayana Gollakota ,  Puthenmadhom Venugopalan ,  Subramanian Panneerselvam ,  Satish Kumar ,  Pulinbehari Manna ,  Satyanarayana Yedidi

公开(公告)号：US09106591B2

公开(公告)日：2015-08-11

申请号：US12647337

申请日：2009-12-24

申请人： Boris Klots ,  Subhadeep Sinha ,  Satish Kumar

发明人： Boris Klots ,  Subhadeep Sinha ,  Satish Kumar

IPC分类号： H04L12/911 ,  G06F17/30 ,  H04M15/00 ,  H04L29/08 ,  H04L12/24 ,  H04L12/801 ,  H04L12/26 ,  H04L12/927

CPC分类号： H04L47/822 ,  G06F17/30566 ,  H04L41/0816 ,  H04L41/5009 ,  H04L41/5022 ,  H04L43/08 ,  H04L43/0888 ,  H04L47/10 ,  H04L47/805 ,  H04L47/828 ,  H04L67/10 ,  H04L67/325 ,  H04M15/00

摘要： Allocation of resources across multiple consumers allows efficient utilization of shared resources. Observed usages of resources by consumers over time intervals are used to determine a total throughput of resources by the consumers. The total throughput of resources is used to determine allocation of resources for a subsequent time interval. The consumers are associated with priorities used to determine their allocations. Minimum and maximum resource guarantees may be associated with consumers. The resource allocation aims to allocate resources based on the priorities of the consumers while aiming to avoid starvation by any consumer. The resource allocation allows efficient usage of network resources in a database storage system storing multiple virtual databases.

摘要翻译： 跨多个消费者分配资源可以有效利用共享资源。 消费者随时间间隔观察资源的用途，用于确定消费者的资源总量。 资源的总吞吐量用于确定后续时间间隔内资源的分配。 消费者与确定其分配的优先级相关联。 最低和最高的资源保证可能与消费者有关。 资源分配旨在根据消费者的优先事项分配资源，同时旨在避免任何消费者的饥饿。 资源分配允许在存储多个虚拟数据库的数据库存储系统中有效地使用网络资源。

公开(公告)号：US08780973B2

公开(公告)日：2014-07-15

申请号：US13206718

申请日：2011-08-10

申请人： Naveen Srinivasamurthy ,  Girish Srinivasa Murthy ,  Satish Kumar ,  Soyeb Nagori

发明人： Naveen Srinivasamurthy ,  Girish Srinivasa Murthy ,  Satish Kumar ,  Soyeb Nagori

IPC分类号： H04N7/50 ,  H04N7/26

CPC分类号： H04N19/00096 ,  H04N19/115 ,  H04N19/126 ,  H04N19/15 ,  H04N19/176

摘要： A method for encoding a picture in a video sequence is provided that includes determining the current encoded size of the picture after coding a plurality of macroblocks in the picture, determining that encoding remaining macroblocks in the picture may cause the encoded size of the picture to exceed a maximum encoded picture size, computing a quantization scale responsive to the determining, wherein the quantization scale is computed such that the estimated encoded size of the remaining macroblocks if the remaining macroblocks are quantized with the quantization scale does not exceed the difference between the maximum encoded picture size and the current encoded picture size, and quantizing at least one of the remaining macroblocks with the new quantization scale.

摘要翻译： 提供了一种用于对视频序列中的图像进行编码的方法，包括：在编码图像中的多个宏块之后确定图像的当前编码大小，确定图像中的剩余宏块编码可能导致图像的编码大小超过 最大编码图像大小，响应于该确定来计算量化尺度，其中计算量化比例，使得如果剩余宏块用量化比例量化的剩余宏块的估计编码大小不超过最大编码图像大小之间的差 图像尺寸和当前编码图像尺寸，并用新的量化尺度量化剩余宏块中的至少一个。

公开(公告)号：US08732136B2

公开(公告)日：2014-05-20

申请号：US12691745

申请日：2010-01-22

申请人： Rajeev Atluri ,  Sudhakar Pannerselvam ,  Jayesh Shah ,  Satish Kumar ,  Srin Kumar ,  Kishor Paygude

发明人： Rajeev Atluri ,  Sudhakar Pannerselvam ,  Jayesh Shah ,  Satish Kumar ,  Srin Kumar ,  Kishor Paygude

IPC分类号： G06F17/00

CPC分类号： G06F17/30368

摘要： A method and system of recovery point data view shift through a direction-agnostic roll algorithm is disclosed. The method includes forming a data view around a recovery point, and shifting the data view around the recovery point through a direction-agnostic roll algorithm that uses at least one of a roll-forward algorithm to shift the data view to a time after the recovery point and a roll-backward algorithm to shift the data view to a time before the recovery point. A data integrity is determined to be consistent at the recovery point by examining data and meta-data associated with the recovery point. The recovery point is associated with one of an automatically generated event, a user definable event, and/or a prepackaged event. A marker data is generated at the recovery point to enable the direction-agnostic roll algorithm to reduce a recovery time objective when an algorithm is applied.

摘要翻译： 公开了一种通过方向无关的滚动算法转换的恢复点数据视图的方法和系统。 该方法包括围绕恢复点形成数据视图，并且通过方向不可知的滚动算法来绕恢复点移动数据视图，所述方法不可知的滚动算法使用前滚算法中的至少一个将数据视图移位到恢复之后的时间 点和滚动后退算法将数据视图移动到恢复点之前的一段时间。 通过检查与恢复点相关联的数据和元数据，在恢复点确定数据完整性是一致的。 恢复点与自动生成的事件，用户可定义事件和/或预包装事件之一相关联。 在恢复点产生标记数据，以使得方向不确定的滚动算法能够在应用算法时减少恢复时间目标。

公开(公告)号：US20100192122A1

公开(公告)日：2010-07-29

申请号：US12555338

申请日：2009-09-08

申请人： Hamid M. Esfahan ,  Satish Kumar ,  Shane M. Boehner

发明人： Hamid M. Esfahan ,  Satish Kumar ,  Shane M. Boehner

IPC分类号： G06F9/45 ,  G05B19/042

CPC分类号： G05B19/0426 ,  G05B2219/23389 ,  G06F8/34 ,  G06F8/35 ,  G06F8/41 ,  G06F8/60

摘要： An on-target rapid control prototyping (RCP) system includes a host control module that generates a first RCP model based on selected function blocks in a block library. A target language compiler converts the first RCP model into source code. A cross-compiler coverts the source code into object code. A download module performs an on-target download of the object code from a host that includes the host control module to a production control module of a production system that is separate from the host.

摘要翻译： 目标快速控制原型（RCP）系统包括主机控制模块，其基于块库中的所选功能块生成第一RCP模型。 目标语言编译器将第一个RCP模型转换为源代码。 交叉编译器将源代码覆盖为目标代码。 下载模块从包含主机控制模块的主机执行目标代码的目标下载到与主机分离的生产系统的生产控制模块。

公开(公告)号：US20100169281A1

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

申请号：US12344335

申请日：2008-12-26

申请人： Rajeev Atluri ,  Jayesh Shah ,  Satish Kumar

发明人： Rajeev Atluri ,  Jayesh Shah ,  Satish Kumar

IPC分类号： G06F17/30 ,  G06F7/00

CPC分类号： G06F17/30386 ,  G06F17/30286 ,  G06F17/30575 ,  G06Q10/10

摘要： Systems and methods of coalescing and capturing data between events prior to and after a temporal window are disclosed. In an embodiment, a method includes determining a temporal window based on one or more of a user data and an automatically generated data, coalescing data between events prior to the temporal window using a processor and a physical memory and capturing data between events after the temporal window. The coalescing data between events prior to the temporal window may be determined by a set of overlapping operations to a data set, wherein certain operations have non-overlapping sectors which are not coalesced. Shifting a data view around a recovery point through a direction-agnostic roll algorithm that may use a roll-forward algorithm to shift the data view to a time after the recovery point and/or a roll-backward algorithm to shift the data view to a time before the recovery point.

摘要翻译： 公开了在时间窗口之前和之后在事件之间聚合和捕获数据的系统和方法。 在一个实施例中，一种方法包括基于用户数据和自动生成的数据中的一个或多个来确定时间窗口，使用处理器和物理存储器在时间窗口之前的事件之间聚合数据，并且在时间之后的事件之间捕获数据 窗口。 在时间窗口之前的事件之间的合并数据可以通过对数据集合的一组重叠操作来确定，其中某些操作具有不重叠的扇区，它们不合并。 通过方向不确定的滚动算法来绕着恢复点移动数据视图，该算法可以使用前滚算法将数据视图移动到恢复点之后的时间和/或滚动后退算法以将数据视图移动到 恢复点前的时间。

公开(公告)号：US20100112322A1

公开(公告)日：2010-05-06

申请号：US12525293

申请日：2008-01-30

申请人： Satish Kumar ,  Han Gi Chae

发明人： Satish Kumar ,  Han Gi Chae

IPC分类号： B29C47/88 ,  D01F9/12 ,  B32B9/00 ,  B32B5/02

CPC分类号： D01F9/225 ,  B29C48/08 ,  B82Y30/00 ,  D01F1/10 ,  Y10T428/2918

摘要： The various embodiments of the present invention provide improved carbon fibers and films, as well as methods of making the carbon fibers and films. The carbon fibers and films disclosed herein are generally formed from an acrylonitrile-containing polymer. The carbon fibers and/or films can also be formed from a composite that includes the acrylonitrile-containing polymer as well as carbon nanotubes, graphite sheets, or both. The fibers and films described herein can be tailored to exhibit one or more of high strength, high modulus, high electrical conductivity, high thermal conductivity, or optical transparency, depending on the desired application for the fibers or films.