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

1. 发明申请

US20080240348A1 Variable Feathering Field Splitting For Intensity Modulated Fields of Large Size 有权
标题翻译：可变羽化场大分辨强度调制场
公开(公告)号：US20080240348A1
公开(公告)日：2008-10-02
申请号：US11995303
申请日：2006-07-11
申请人： Srijit Kamath , Sartaj Kumar Sahni , Jonathan Li , Jatinder Palta , Sanjay Ranka
发明人： Srijit Kamath , Sartaj Kumar Sahni , Jonathan Li , Jatinder Palta , Sanjay Ranka
IPC分类号： A61N5/10
CPC分类号： A61N5/1042 , A61N5/1036 , G21K1/04
摘要： A method and associated system 300 for delivering intensity-modulated radiation therapy (IMRT) uses variable feathering field splitting for intensity modulated fields of large size. Processor 112 controls a beam-shaping device 106 so that the beam-shaping device splits the radiation beam into a plurality of radiation fields delivered to the patient 102. Processor 112 in cooperation with beam-shaping device 106 implements a variable feathering method which includes the steps of providing an intensity matrix for the treatment of a patient, the intensity matrix having a plurality of rows and columns for spanning a prescribed radiation field including a prescribed field width. The prescribed width is compared to a maximum field width provided by the radiation treatment system. The intensity matrix is split into a plurality of spatially overlapping intensity submatrices when the prescribed width exceeds the maximum field width, wherein the splitting comprises variably feathering the intensity matrix. Radiotherapy is then provided to the patient 102 using a leaf sequencing method to generate the submatrices.
摘要翻译：用于递送强度调制辐射治疗（IMRT）的方法和相关系统300使用大尺寸强度调制场的可变羽化场分割。处理器112控制光束整形装置106，使得光束整形装置将辐射束分成传送到患者102的多个辐射场。与光束整形装置106协作的处理器112实现可变羽化方法，其包括提供用于治疗患者的强度矩阵的步骤，所述强度矩阵具有多个行和列，用于跨越规定的辐射场，包括规定的字段宽度。将规定的宽度与辐射处理系统提供的最大场宽进行比较。当规定的宽度超过最大场宽时，强度矩阵被分割成多个空间上重叠的强度子矩阵，其中分割包括可变地羽化强度矩阵。然后使用叶片测序方法向患者102提供放射疗法以产生子矩阵。

2. 发明申请

US20090327316A1 Dynamic Tree Bitmap for IP Lookup and Update 失效
标题翻译： IP查找和更新的动态树位图
公开(公告)号：US20090327316A1
公开(公告)日：2009-12-31
申请号：US12307064
申请日：2007-07-20
申请人： Sartaj Kumar Sahni , Haibin Lu
发明人： Sartaj Kumar Sahni , Haibin Lu
IPC分类号： G06F17/00
CPC分类号： H04L45/00 , H04L45/7457
摘要： The subject invention provides a data structure and method for IP lookups, insertions, and deletions using a dynamic tree bitmap structure (DTBM) that utilizes an array of child pointers for each node instead of the typical TBM approach using one pointer to an array of children.
摘要翻译：本发明提供了一种使用动态树位图结构（DTBM）的IP查找，插入和删除的数据结构和方法，该动态树位图结构（DTBM）利用针对每个节点的子指针阵列而不是典型的TBM方法，使用指向子数组的指针。

3. 发明申请

US20100199348A1 EFFICIENT INTRUSION DETECTION 失效
标题翻译：有效的入侵检测
公开(公告)号：US20100199348A1
公开(公告)日：2010-08-05
申请号：US12678169
申请日：2008-10-13
申请人： Sartaj Kumar Sahni , Xinyan Zha
发明人： Sartaj Kumar Sahni , Xinyan Zha
IPC分类号： G06F21/00
CPC分类号： H04L63/1416
摘要： A method to compress an unoptimized Aho-Corasick automaton is provided that can be used in network intrusion detection systems. Embodiments of the subject method use bitmaps with multiple levels of summaries as well as aggressive path compaction. By using multiple levels of summaries, a popcount can be determined with as few as 1 addition.
摘要翻译：提供了一种压缩未优化的Aho-Corasick自动机的方法，可用于网络入侵检测系统。本方法的实施例使用具有多级汇总的位图以及积极的路径压实。通过使用多个级别的摘要，可以使用少至1个加法来确定一个弹出窗口。

4. 发明申请

US20100135305A1 Recursively Partitioned Static IP Router Tables 失效
标题翻译：递归分区静态IP路由器表
公开(公告)号：US20100135305A1
公开(公告)日：2010-06-03
申请号：US12377032
申请日：2007-08-24
申请人： Wencheng Lu , Sartaj Kumar Sahni
发明人： Wencheng Lu , Sartaj Kumar Sahni
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/54 , H04L45/745
摘要： A recursively partitioned static router-table, the data structure incorporating a first-level partition including subtries and an auxiliary trie. A node of the subtrie includes a path Q(N) from the root R of a trie T to a root N of the subtrie, a stride s for a next-level partition, a mask that characterizes a next-level perfect hash function, and a pointer to the hash table for the next-level partition. At least one of the trie T, the first-level partition, the auxiliary trie, and the next-level partition is represented by a base structure selected from the group consisting of MBT and HSST.
摘要翻译：递归分区的静态路由器表，数据结构包含一级分区，包括子句和辅助特里。子树的节点包括从特里T到根N的根R的路径Q（N），下一级分区的步幅s，表征下一级完美散列函数的掩码，以及指向下一级分区的哈希表的指针。特技T，第一级分区，辅助特里和下一级分区中的至少一个由从由MBT和HSST组成的组中选择的基本结构来表示。

5. 发明授权

US07509300B2 Dynamic IP router tables using highest-priority matching 失效
标题翻译：使用最高优先级匹配的动态IP路由器表
公开(公告)号：US07509300B2
公开(公告)日：2009-03-24
申请号：US10613963
申请日：2003-07-03
申请人： Sartaj Kumar Sahni , Haibin Lu
发明人： Sartaj Kumar Sahni , Haibin Lu
IPC分类号： G06F7/00
CPC分类号： H04L45/54 , H04L45/00 , H04L45/7457 , H04L49/3009 , Y10S707/99932 , Y10S707/99933 , Y10S707/99942 , Y10S707/99945
摘要： An improved system and method is provided for packet routing in dynamic router tables. Specifically, the invention relates to a method and system for using tree data structures to select the highest priority rule that matches a destination address in dynamic Internet packet routing tables. In an embodiment, a data structure called BOB (binary tree on binary tree) for dynamic router tables in which the rule filters are nonintersecting ranges and in which ties are broken by selecting the highest-priority rule that matches a destination address is disclosed. Prefix filters are a special case of nonintersecting ranges and the commonly used longest-prefix tie breaker is a special case of the highest-priority tie breaker. When an n-rule router table is represented using BOB, the highest-priority rule that matches a destination address may be found in O(log2n) time; a new rule maybe inserted and an old one deleted in O(log n) time. For the case when all rule filters are prefixes, the data structure PBOB (prefix BOB) permits highest-priority matching as well as rule insertion and deletion in O(W) time, where W is the length of the longest prefix, each. When all rule filters are prefixes and longest-prefix matching is to be done, the data structures LMPBOB (longest matching-prefix BOB) permits longest-prefix matching in O(W) time; rule insertion and deletion each take O(log n) time. On practical rule tables, BOB and PBOB perform each of the three dynamic-table operations in O(log n) time and with O(log n) cache misses. The number of cache misses incurred by LMPBOB is also O(log n).
摘要翻译：为动态路由表中的数据包路由提供了一种改进的系统和方法。具体地说，本发明涉及使用树形数据结构来选择与动态因特网分组路由表中的目的地地址匹配的最高优先级规则的方法和系统。在一个实施例中，公开了一种用于动态路由器表的称为BOB（二进制树的二叉树）的数据结构，其中规则过滤器是不间断范围，并且通过选择与目的地地址匹配的最高优先级规则来破坏关系。前缀滤波器是非接触范围的特殊情况，通常使用的最长前缀断路器是最高优先级断路器的特殊情况。当使用BOB表示n规则路由器表时，可以在O（log2n）时间中找到与目标地址匹配的最高优先级规则; 可能插入一个新规则，并在O（log n）时间中删除一个旧规则。对于所有规则过滤器是前缀的情况，数据结构PBOB（前缀BOB）允许在O（W）时间中的最高优先级匹配以及规则插入和删除，其中W是最长前缀的长度。当所有规则过滤器都是前缀并且要进行最长前缀匹配时，数据结构LMPBOB（最长匹配前缀BOB）允许O（W）时间中的最长前缀匹配; 规则插入和删除每个取O（log n）时间。在实际规则表中，BOB和PBOB在O（log n）时间和O（log n）高速缓存未命中执行三个动态表操作中的每一个。 LMPBOB引起的高速缓存未命中数也是O（log n）。

6. 发明授权

US07444318B2 Prefix partitioning methods for dynamic router tables 失效
标题翻译：动态路由器表的前缀分区方法
公开(公告)号：US07444318B2
公开(公告)日：2008-10-28
申请号：US10719914
申请日：2003-11-21
申请人： Sartaj Kumar Sahni , Haibin Lu
发明人： Sartaj Kumar Sahni , Haibin Lu
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： H04L45/7457 , H04L45/00 , H04L45/54 , H04L49/3009 , Y10S707/99932 , Y10S707/99942 , Y10S707/99943
摘要： A method is provided to improve the performance of dynamic router-table designs. Specifically, the invention relates to a method and system for partitioning prefixes at each node of a partitioning tree into 2s+1 partitions using the next s bits of the prefixes. Prefixes that have a length less than s are placed into partition −1, with the remaining prefixes falling into the remaining partitions that correspond to the value of their first s bits. Prefix partitioning may be controlled using either static rule tables or by dynamic rule tables. In one embodiment, binary tree on binary tree (BOB) data structures are applied to a partition of the present invention. In another embodiment, prefix binary tree on binary tree (PBOB) data structures are applied to a partition of the present invention. In a further embodiment, a dynamic longest-matching prefix binary tree on binary tree-table (LMPBOB) is applied to a partition of the present invention.
摘要翻译：提供了一种提高动态路由器表设计性能的方法。具体地，本发明涉及一种用于使用前缀的下一个s位将分区树的每个节点处的前缀划分为2个/ 1个分区的方法和系统。长度小于s的前缀被放置在分区-1中，剩余的前缀落入与其第一个位相对应的剩余分区。可以使用静态规则表或动态规则表来控制前缀分区。在一个实施例中，将二叉树（BOB）数据结构上的二叉树应用于本发明的分区。在另一个实施例中，将二进制树（PBOB）数据结构上的前缀二进制树应用于本发明的分区。在另一实施例中，将二进制树表（LMPBOB）上的动态最长匹配前缀二进制树应用于本发明的分区。

7. 发明授权

US07573978B2 Variable feathering field splitting for intensity modulated fields of large size 有权
标题翻译：用于大尺寸强度调制场的可变羽化场分割
公开(公告)号：US07573978B2
公开(公告)日：2009-08-11
申请号：US11995303
申请日：2006-07-11
申请人： Srijit Kamath , Sartaj Kumar Sahni , Jonathan Li , Jatinder Palta , Sanjay Ranka
发明人： Srijit Kamath , Sartaj Kumar Sahni , Jonathan Li , Jatinder Palta , Sanjay Ranka
IPC分类号： A61N5/10
CPC分类号： A61N5/1042 , A61N5/1036 , G21K1/04
摘要： A method and associated system 300 for delivering intensity-modulated radiation therapy (IMRT) uses variable feathering field splitting for intensity modulated fields of large size. A processor controls a beam-shaping device that splits the radiation beam into a plurality of radiation fields delivered to a patient. The processor in cooperation with the beam-shaping device implements a variable feathering method which includes providing an intensity matrix for the treatment of a patient, the intensity matrix having a plurality of rows and columns for spanning a prescribed radiation field including a prescribed field width. The prescribed width is compared to a maximum field width provided by the radiation treatment system. The intensity matrix is split into a plurality of spatially overlapping intensity submatrices by variably feathering the intensity matrix when the prescribed width exceeds the maximum field width, Radiotherapy is then provided to the patient using a leaf sequencing method to generate the submatrices.
摘要翻译：用于递送强度调制辐射治疗（IMRT）的方法和相关系统300使用大尺寸强度调制场的可变羽化场分割。处理器控制将辐射束分成传递给患者的多个辐射场的光束整形装置。与光束成形装置协作的处理器实现了一种可变羽化方法，其包括提供用于治疗患者的强度矩阵，所述强度矩阵具有多个行和列，用于跨越包括规定场宽的规定辐射场。将规定的宽度与辐射处理系统提供的最大场宽进行比较。当规定的宽度超过最大场宽度时，强度矩阵通过可变地羽化强度矩阵而被分割成多个空间上重叠的强度子矩阵，然后使用叶子排序方法向患者提供放射疗法以产生子矩阵。

8. 发明授权

US07474657B2 Partitioning methods for dynamic router tables 失效
标题翻译：动态路由器表的分区方法
公开(公告)号：US07474657B2
公开(公告)日：2009-01-06
申请号：US10718842
申请日：2003-11-21
申请人： Sartaj Kumar Sahni , Haibin Lu , Kun Suk Kim
发明人： Sartaj Kumar Sahni , Haibin Lu , Kun Suk Kim
IPC分类号： G06F17/30
CPC分类号： H04L45/54 , H04L45/748
摘要： Systems and methods for improving the performance of dynamic router table data structures are provided. The invention relates to methods and systems for partitioning prefixes or prefix-based intervals. In one embodiment, priority search tree router data structures are applied to prefix partitions of the present invention. In another embodiment, basic-interval tree and prefix tree data structures are applied to interval partitions of the present invention.
摘要翻译：提供了用于提高动态路由器表数据结构性能的系统和方法。本发明涉及用于划分前缀或基于前缀的间隔的方法和系统。在一个实施例中，优先搜索树路由器数据结构被应用于本发明的前缀分区。在另一个实施例中，基本间隔树和前缀树数据结构被应用于本发明的间隔分区。

9. 发明授权

US08284787B2 Dynamic tree bitmap for IP lookup and update 失效
标题翻译：用于IP查找和更新的动态树位图
公开(公告)号：US08284787B2
公开(公告)日：2012-10-09
申请号：US12307064
申请日：2007-07-20
申请人： Sartaj Kumar Sahni , Haibin Lu
发明人： Sartaj Kumar Sahni , Haibin Lu
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/00 , H04L45/7457
摘要： The subject invention provides a data structure and method for IP lookups, insertions, and deletions using a dynamic tree bitmap structure (DTBM) that utilizes an array of child pointers for each node instead of the typical TBM approach using one pointer to an array of children.
摘要翻译：本发明提供了一种使用动态树位图结构（DTBM）的IP查找，插入和删除的数据结构和方法，该动态树位图结构（DTBM）利用针对每个节点的子指针阵列而不是典型的TBM方法，使用指向子数组的指针。

10. 发明授权

US08272056B2 Efficient intrusion detection 失效
标题翻译：有效的入侵检测
公开(公告)号：US08272056B2
公开(公告)日：2012-09-18
申请号：US12678169
申请日：2008-10-13
申请人： Sartaj Kumar Sahni , Xinyan Zha
发明人： Sartaj Kumar Sahni , Xinyan Zha
IPC分类号： G06F11/00
CPC分类号： H04L63/1416
摘要： A method to compress an unoptimized Aho-Corasick automaton is provided that can be used in network intrusion detection systems. Embodiments of the subject method use bitmaps with multiple levels of summaries as well as aggressive path compaction. By using multiple levels of summaries, a popcount can be determined with as few as 1 addition.
摘要翻译：提供了一种压缩未优化的Aho-Corasick自动机的方法，可用于网络入侵检测系统。本方法的实施例使用具有多级汇总的位图以及积极的路径压实。通过使用多个级别的摘要，可以使用少至1个加法来确定一个弹出窗口。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式