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

1. 发明授权

US07986636B2 Efficient detection of relay node 有权
标题翻译：中继节点的有效检测
公开(公告)号：US07986636B2
公开(公告)日：2011-07-26
申请号：US12268395
申请日：2008-11-10
申请人： Baris Coskun , Nasir Memon
发明人： Baris Coskun , Nasir Memon
IPC分类号： H04L12/28
CPC分类号： H04L41/12 , H04L43/12
摘要： Whether or not a node is a relay node may be determined by, for each of a plurality of active flows, assigning a random number to the flow, wherein each of the random numbers is drawn from a distribution. Then, for each of a plurality of time slots, any incoming flows to the node and any outgoing flows from the node may be determined, random numbers assigned to any active flow of the incoming flows may be summed to generate a first sum, random numbers assigned to any active outgoing flows may be summed to generating a second sum, and the first sum may be multiplied with the second sum to generate a product associated with the time slot. The products over the plurality of time slots may then be summed to obtain a summed product. This may be repeated, reassigning random values to each of the plurality of flows, thereby obtaining a plurality of summed products. A variance of the plurality of summed products may be determined and compared with a threshold to obtain a comparison result. Whether or not the node is a relay node may then be determined using the comparison result. Execution of a relay node protection policy may be controlled using the determination of whether or not the node is a relay node.
摘要翻译：对于多个活动流中的每一个，可以通过为流分配随机数来确定节点是否是中继节点，其中每个随机数字从分布中抽出。然后，对于多个时隙中的每个时隙，可以确定到节点的任何进入流和来自节点的任何输出流，可以将分配给输入流的任何活动流的随机数相加以生成第一和，随机数分配给任何活动输出流的信号可以被相加以产生第二和，并且第一和可以与第二和相乘以生成与时隙相关联的乘积。然后可以将多个时隙中的产品相加以获得相加的乘积。这可以重复，将随机值重新分配给多个流中的每一个，从而获得多个相加的乘积。可以确定多个相加产物的方差，并将其与阈值进行比较以获得比较结果。然后可以使用比较结果来确定节点是否是中继节点。可以使用确定节点是否是中继节点来控制中继节点保护策略的执行。

2. 发明授权

US09009299B2 Method and apparatus for identifying members of a peer-to-peer botnet 有权
标题翻译：用于识别对等僵尸网络成员的方法和装置
公开(公告)号：US09009299B2
公开(公告)日：2015-04-14
申请号：US12986573
申请日：2011-01-07
申请人： Nasir Memon , Baris Coskun
发明人： Nasir Memon , Baris Coskun
IPC分类号： G06F15/173 , H04L29/06 , H04L29/08
CPC分类号： H04L63/1441 , H04L63/1433 , H04L67/104 , H04L67/1057
摘要： A peer-to-peer (P2P) bot(s) in a network is identified using an already identified P2P bot. More specifically, such embodiments may facilitate determining a candidate set of computers, which may be potential P2P bots, by identifying computers in a network that have a private mutual contact with a seed bot, which is a computer identified as a P2P bot, and identifying additional computers that have private mutual contacts with the identified computers. Further, a confidence level indicative of a certainty of a membership of each of the candidate computers in the P2P botnet is determined and responsive to a determination that the confidence level of the candidate computer exceeds a determined threshold confidence level, the candidate computer is identified as a P2P bot.
摘要翻译：使用已经识别的P2P bot来识别网络中的对等（P2P）机器人。更具体地，这样的实施例可以通过识别网络中具有与被识别为P2P机器人的计算机的种子机器人的私有相互接触的计算机来识别可能是潜在的P2P机器人的候选的计算机集合，并且识别与所识别的计算机具有私人相互联系的其他计算机。此外，确定表示P2P僵尸网络中每个候选计算机的成员资格的确定性的置信水平，并且响应于候选计算机的置信水平超过确定的阈值置信水平的确定，候选计算机被识别为一个P2P机器人

3. 发明申请

US20110179164A1 METHOD AND APPARATUS FOR IDENTIFYING MEMBERS OF A PEER-TO-PEER BOTNET 有权
标题翻译：用于识别对等网络的成员的方法和装置
公开(公告)号：US20110179164A1
公开(公告)日：2011-07-21
申请号：US12986573
申请日：2011-01-07
申请人： Nasir Memon , Baris Coskun
发明人： Nasir Memon , Baris Coskun
IPC分类号： G06F15/173
CPC分类号： H04L63/1441 , H04L63/1433 , H04L67/104 , H04L67/1057
摘要： A peer-to-peer (P2P) bot(s) in a network is identified using an already identified P2P bot. More specifically, such embodiments may facilitate determining a candidate set of computers, which may be potential P2P bots, by identifying computers in a network that have a private mutual contact with a seed bot, which is a computer identified as a P2P bot, and identifying additional computers that have private mutual contacts with the identified computers. Further, a confidence level indicative of a certainty of a membership of each of the candidate computers in the P2P botnet is determined and responsive to a determination that the confidence level of the candidate computer exceeds a determined threshold confidence level, the candidate computer is identified as a P2P bot.
摘要翻译：使用已经识别的P2P bot来识别网络中的对等（P2P）机器人。更具体地，这样的实施例可以通过识别网络中具有与被识别为P2P机器人的计算机的种子机器人的私有相互接触的计算机来识别可能是潜在的P2P机器人的候选的计算机集合，并且识别与所识别的计算机具有私人相互联系的其他计算机。此外，确定表示P2P僵尸网络中每个候选计算机的成员资格的确定性的置信水平，并且响应于候选计算机的置信水平超过确定的阈值置信水平的确定，候选计算机被识别为一个P2P机器人

4. 发明申请

US20090154375A1 EFFICIENT DETECTION OF RELAY NODE 有权
标题翻译：有效检测继电器NODE
公开(公告)号：US20090154375A1
公开(公告)日：2009-06-18
申请号：US12268395
申请日：2008-11-10
申请人： Baris Coskun , Nasir Memon
发明人： Baris Coskun , Nasir Memon
IPC分类号： H04L12/28 , G06F11/00
CPC分类号： H04L41/12 , H04L43/12
摘要： Whether or not a node is a relay node may be determined by, for each of a plurality of active flows, assigning a random number to the flow, wherein each of the random numbers is drawn from a distribution. Then, for each of a plurality of time slots, any incoming flows to the node and any outgoing flows from the node may be determined, random numbers assigned to any active flow of the incoming flows may be summed to generate a first sum, random numbers assigned to any active outgoing flows may be summed to generating a second sum, and the first sum may be multiplied with the second sum to generate a product associated with the time slot. The products over the plurality of time slots may then be summed to obtain a summed product. This may be repeated, reassigning random values to each of the plurality of flows, thereby obtaining a plurality of summed products. A variance of the plurality of summed products may be determined and compared with a threshold to obtain a comparison result. Whether or not the node is a relay node may then be determined using the comparison result. Execution of a relay node protection policy may be controlled using the determination of whether or not the node is a relay node.
摘要翻译：对于多个活动流中的每一个，可以通过为流分配随机数来确定节点是否是中继节点，其中每个随机数字从分布中抽出。然后，对于多个时隙中的每个时隙，可以确定到节点的任何进入流和来自节点的任何输出流，可以将分配给输入流的任何活动流的随机数相加以生成第一和，随机数分配给任何活动输出流的信号可以被相加以产生第二和，并且第一和可以与第二和相乘以生成与时隙相关联的乘积。然后可以将多个时隙中的产品相加以获得相加的乘积。这可以重复，将随机值重新分配给多个流中的每一个，从而获得多个相加的乘积。可以确定多个相加产物的方差，并将其与阈值进行比较以获得比较结果。然后可以使用比较结果来确定节点是否是中继节点。可以使用确定节点是否是中继节点来控制中继节点保护策略的执行。

5. 发明申请

US20100250743A1 EFFECTIVE POLICIES AND POLICY ENFORCEMENT USING CHARACTERIZATION OF FLOW CONTENT AND CONTENT-INDEPENDENT FLOW INFORMATION 有权
标题翻译：有效政策和政策执行使用流动内容和内容独立流量信息的表征
公开(公告)号：US20100250743A1
公开(公告)日：2010-09-30
申请号：US12795623
申请日：2010-06-07
申请人： Nasir Memon , Kulesh SHANMUGASUNDARAM
发明人： Nasir Memon , Kulesh SHANMUGASUNDARAM
IPC分类号： G06F15/16 , G06F15/173
CPC分类号： H04L47/10 , H04L47/20
摘要： Flexible network policies might be enforced by (a) obtaining a flow of network packets, (b) determining a content characteristic by characterizing content of the flow using bit-stream level statistics, (c) determining content-independent flow characteristics, port-independent flow characteristics, and/or application header-independent flow characteristics, and (d) enforcing a policy on the flow using both (1) the determined content characteristic and the (2) determined content-independent flow characteristics, port-independent flow characteristics, and/or application header-independent flow characteristics.
摘要翻译：灵活的网络策略可以通过（a）获得网络数据包流，（b）通过使用比特流级别统计来表征流的内容来确定内容特征，（c）确定与内容无关的流特性，端口独立流量特性和/或应用头独立流量特性，以及（d）使用（1）所确定的内容特征和（2）确定的独立于内容的流特性，与端口无关的流特性，和/或应用程序头独立的流程特性。

6. 发明申请

US20100030820A1 Reassembling fragmented files or documents in an order-independent manner that ensures each of the fragments belongs to only one reassembled file 失效
标题翻译：以独立于订单的方式重新组装碎片文件或文档，以确保每个片段仅属于一个重新组装的文件
公开(公告)号：US20100030820A1
公开(公告)日：2010-02-04
申请号：US11523730
申请日：2006-09-19
申请人： Nasir Memon , Anandabrata Pal , Kulesh Shanmugasundaram
发明人： Nasir Memon , Anandabrata Pal , Kulesh Shanmugasundaram
IPC分类号： G06F17/30
CPC分类号： G06F17/30067
摘要： Files can be reassembled from fragments by (a) accepting adjacency scores for each pair of fragments from the set of fragments, (b) identifying header fragments from among the fragments of the set of fragments, and (c) for each of the header fragments identified, reconstructing a corresponding one of the two or more files from the fragments of the set of fragments such that the sum of the adjacency scores are optimized, wherein each of the fragments is permitted to belong to only one of the at least two files, and wherein at least two files are reconstructed such that the results are independent of the order in which the files are reconstructed.
摘要翻译：通过（a）从片段集合中接收每对片段的邻接得分，（b）从片段集合的片段中识别标题片段，以及（c）对于标题片段中的每一个，可以从片段重新组装文件识别，从所述片段集合的片段中重建所述两个或更多个文件中的对应的一个，使得相邻分数的总和被优化，其中每个片段被允许仅属于所述至少两个文件中的一个，并且其中重建至少两个文件，使得结果独立于文件被重建的顺序。

7. 发明授权

US07027647B2 Coder matched layer separation for compression of compound documents 有权
公开(公告)号：US07027647B2
公开(公告)日：2006-04-11
申请号：US10036979
申请日：2001-12-31
申请人： Debargha Mukherjee , Nasir Memon , Amir Said
发明人： Debargha Mukherjee , Nasir Memon , Amir Said
IPC分类号： G06K9/34
CPC分类号： G06K9/00456 , G06T9/00 , H04N1/40062 , H04N1/41 , H04N1/415 , Y02E50/14
摘要： Methods for decomposing compound documents for mixed raster content representation are provided. A method for decomposing an image includes the step of decomposing the image into a plurality of stripes. Each stripe is decomposed into foreground, background, and mask layers. The layers are interpolated to modify values of irrelevant pixels in order to achieve more efficient compression. The layers may subsequently be compressed with a coder.

8. 发明授权

US09147059B2 Biometric-rich gestures for authentication on multi-touch devices 有权
标题翻译：生物特征丰富的手势用于多点触摸设备上的认证
公开(公告)号：US09147059B2
公开(公告)日：2015-09-29
申请号：US13739906
申请日：2013-01-11
申请人： Katherine Isbister , Nasir Memon , Napa Sae-Bae
发明人： Katherine Isbister , Nasir Memon , Napa Sae-Bae
IPC分类号： G06K9/00 , G06F21/32
CPC分类号： G06F21/32 , G06K9/00355
摘要： The problem of obtaining a multi-touch input sequence for use in user authentication is solved by determining, at a plurality of time instances, a mapping from an unordered set of at least four touch points to a an ordered set of at least four fingertips, wherein for at least one of the plurality of time instances, the mapping from the unordered set of at least four touch points to the ordered set of at least four fingertips is subject to a constraint that the ordered set of at least four touch points defines a simple polygon.
摘要翻译：获得用于用户认证的多点触摸输入序列的问题通过在多个时间实例上确定从至少四个触摸点的无序集合到至少四个指尖的有序集合的映射来解决，其中对于所述多个时间实例中的至少一个，从至少四个触摸点的无序集合到至少四个指尖的有序集合的映射受到约束，即至少四个触摸点的有序集合定义为简单多边形。

9. 发明申请

US20120195476A1 SENSOR FINGERPRINT MATCHING IN LARGE IMAGE AND VIDEO DATABASES 有权
标题翻译：大图像和视频数据库中的传感器指纹匹配
公开(公告)号：US20120195476A1
公开(公告)日：2012-08-02
申请号：US13015451
申请日：2011-01-27
申请人： Sevine Bayram , Husrev Taha Sencar , Nasir Memon
发明人： Sevine Bayram , Husrev Taha Sencar , Nasir Memon
IPC分类号： G06K9/00
CPC分类号： G06F17/30799 , G06K9/00577 , G06K9/46 , G06K2009/00583
摘要： Several promising techniques have been recently proposed to bind an image or video to its source acquisition device. These techniques have been intensively studied to address performance issues, but the computational efficiency aspect has not been given due consideration. Considering very large databases, the efficiency of the sensor fingerprint based source device identification technique is described. Novel schemes that improve search complexity as compared to a conventional approach are described.
摘要翻译：最近提出了几种有希望的技术来将图像或视频绑定到其源获取装置。这些技术已经被深入研究以解决性能问题，但是计算效率方面还没有得到适当的考虑。考虑到非常大的数据库，描述了基于传感器指纹的源设备识别技术的效率。描述了与常规方法相比提高搜索复杂性的新方案。

10. 发明申请

US20070198606A1 Reassembling fragmented files or documents in a fragment order-independent manner 有权
标题翻译：以片段顺序独立的方式重新组装碎片文件或文档
公开(公告)号：US20070198606A1
公开(公告)日：2007-08-23
申请号：US11523728
申请日：2006-09-19
申请人： Nasir Memon , Anandabrata Pal , Kulesh Shanmugasundaram
发明人： Nasir Memon , Anandabrata Pal , Kulesh Shanmugasundaram
IPC分类号： G06F17/30
CPC分类号： G06F21/00
摘要： Files can be reassembled from fragments by (a) accepting adjacency scores for each pair of fragments from the set of fragments, (b) identifying header fragments from among the fragments of the set of fragments, and (c) for each of the header fragments identified, (i) setting a current fragment to the identified header fragment, (ii) selecting, from among any one of the fragments of the set not identified as a header fragment, a fragment with a best adjacency score with the current fragment, (iii) checking to determine if the selected fragment has a better adjacency score with any of the other fragments not identified as a header than with the current fragment, (iv) if it is determined that the selected fragment has a better adjacency score with any of the other fragments not identified as a header than with the current fragment, then (A) selecting another fragment, from among any one of the fragments of the set not identified as a header fragment, a fragment with a next best adjacency score with the current fragment, and (B) repeating (iii) and (iv), and if it is determined that the selected fragment does not have a better adjacency score with any of the other fragments not identified as a header than with the current fragment, then (A) adding the selected fragment to a reassembly path started with the identified header fragment, and (B) setting the current fragment to the selected fragment, and (v) repeating (ii)-(iv) until the file is reconstructed.
摘要翻译：通过（a）从片段集合中接收每对片段的邻接得分，（b）从片段集合的片段中识别标题片段，以及（c）对于标题片段中的每一个，可以从片段重新组装文件识别，（i）将当前片段设置为所识别的标题片段，（ii）从未被标识为标题片段的片段中的任一片段中选择具有与当前片段的最佳邻接得分的片段（ iii）检查以确定所选择的片段是否与未被标识为与当前片段相比的标题的任何其他片段具有更好的邻接得分，（iv）如果确定所选择的片段具有更好的邻接得分，其他片段未被标识为与当前片段相比的标题，则（A）从未被标识为标题片段的片段中的任何一个片段中选择另一片段，具有下一最佳相邻片段以及（B）重复（iii）和（iv），并且如果确定所选择的片段与没有被标识为标题的任何其他片段没有比当前片段更好的相邻分数然后（A）将所选择的片段添加到由所识别的标题片段开始的重新组装路径中，以及（B）将当前片段设置为所选择的片段，以及（v）重复（ii） - （iv）直到文件为重建。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式