公开(公告)号：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机器人

公开(公告)号：US07941464B2

公开(公告)日：2011-05-10

申请号：US11523729

申请日：2006-09-19

申请人： Nasir Memon ,  Anandabrata Pal ,  Kulesh Shanmugasundaram

发明人： Nasir Memon ,  Anandabrata Pal ,  Kulesh Shanmugasundaram

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

CPC分类号： G06F21/00

摘要： Files can be reassembled from fragments by (a) accepting (or determining) adjacency scores for each pair of fragments from a 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 two or more files from the fragments of the set of fragments such that the sum of the adjacency scores are optimized. Any of the fragments, other than the identified header fragments, are permitted to belong, at least provisionally, to more than one of the at least two files when reconstructing the file(s).

摘要翻译： 可以通过（a）从一组片段接受（或确定）每对片段的邻接得分，（b）从片段集合的片段中识别标题片段，并且（c）对于每个片段 识别的标题片段，从片段集合的片段中重构两个或更多个文件中的相应的一个，使得邻接度得分的总和被优化。 除了所识别的标题片段以外的任何片段在重建文件时被允许至少暂时属于至少两个文件中的一个以上。

公开(公告)号：US07895237B2

公开(公告)日：2011-02-22

申请号：US11523730

申请日：2006-09-19

申请人： Nasir Memon ,  Anandabrata Pal ,  Kulesh Shanmugasundaram

发明人： Nasir Memon ,  Anandabrata Pal ,  Kulesh Shanmugasundaram

IPC分类号： G06F7/00 ,  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）对于标题片段中的每一个，可以从片段重新组装文件 识别，从所述片段集合的片段中重建所述两个或更多个文件中的对应的一个，使得相邻分数的总和被优化，其中每个片段被允许仅属于所述至少两个文件中的一个， 并且其中重建至少两个文件，使得结果独立于文件被重建的顺序。

公开(公告)号：US20100257146A1

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

申请号：US12418578

申请日：2009-04-04

申请人： Nasir MEMON ,  Anandabrata Pal

发明人： Nasir MEMON ,  Anandabrata Pal

IPC分类号： G06F17/30

CPC分类号： G06F3/061 ,  G06F3/0647 ,  G06F3/0652 ,  G06F3/0671 ,  G06F3/0676 ,  G11B2020/1224 ,  G11B2220/2516 ,  G11B2220/61

摘要： File carving is a technique whereby data files are extracted from a digital device without the assistance of file tables or other disk meta-data, and can therefore be used to recover files that are fragmented. Sequential hypothesis testing procedures are used to detect a fragmentation point of a file by sequentially comparing adjacent pairs of blocks from the starting block of a file until the fragmentation point is reached. The detected fragmentation point can be used to help recover the fragmented file. Such a serial analysis helps to minimize errors and improve performance.

摘要翻译： 文件雕刻是一种技术，其中数据文件从数字设备中提取而无需文件表或其他磁盘元数据的帮助，因此可用于恢复分段的文件。 顺序假设测试程序用于通过从文件的起始块到达碎片点之间顺序比较相邻的块块来检测文件的碎片点。 检测到的碎片点可用于帮助恢复碎片文件。 这样的串行分析有助于最小化错误并提高性能。

公开(公告)号：US20100225443A1

公开(公告)日：2010-09-09

申请号：US12652654

申请日：2010-01-05

申请人： Sevinc Bayram ,  Ahmet Emir Dirik ,  Nasir MEMON ,  Umut Topkara

发明人： Sevinc Bayram ,  Ahmet Emir Dirik ,  Nasir MEMON ,  Umut Topkara

IPC分类号： G05B19/00

CPC分类号： G06F21/316 ,  G05B2219/36168 ,  G06F3/04883 ,  G06F21/32 ,  G06F21/36 ,  G06F21/83 ,  G06F2221/2101 ,  G06F2221/2111 ,  H04L2463/082 ,  H04W12/06 ,  H04W88/02

摘要： For user authentication, finger touch information from a user is accepted via a touch sensitive element, the finger touch information including at least a time series of finger touch samples that define a trace of the user's signature, and each of the finger touch samples including centroid coordinates and non-centroid information, the non-centroid information including at least one of (A) a shape of the finger touch sample, (B) a size of the finger touch sample, (C) an orientation of the finger touch sample, and (D) characteristics of a multi-touch finger touch sample. A similarity of such finger touch samples with previously entered and stored finger touch samples is determined and compared with a threshold for purposes of user authentication.

摘要翻译： 对于用户认证，通过触敏元件接受来自用户的手指触摸信息，手指触摸信息至少包括定义用户签名痕迹的手指触摸样本的时间序列，并且每个手指触摸样本包括质心 坐标和非重心信息，非质心信息包括（A）手指触摸样本的形状，（B）手指触摸样本的大小，（C）手指触摸样本的取向， 和（D）多点触摸手指触摸样本的特征。 确定这种手指触摸样本与先前输入和存储的手指触摸样本的相似性，并将其与用于用户认证的阈值进行比较。

公开(公告)号：US5903676A

公开(公告)日：1999-05-11

申请号：US836438

申请日：1997-07-21

申请人： Xiaolin Wu ,  Nasir Memon

发明人： Xiaolin Wu ,  Nasir Memon

IPC分类号： G06T9/00 ,  H04N1/41 ,  G06K9/36

CPC分类号： H04N1/41 ,  G06T9/004

摘要： An encoding/decoding method is provided for lossless compression of digital pictures of all types, including continuous-tone images, graphics, multimedia images of mixed text, graphics and photographs, binary documents and drawings. Continuous-tone mode and binary mode are identified on a pixel-by-pixel basis. In continuous-tone mode, context modeling and prediction are employed involving mostly integer arithmetic and simple logic in a conceptually sophisticated scheme. Both the encoding and decoding techniques are suitable for sequential and progressive transmission, although different specific algorithms may be employed for the different specific cases.

摘要翻译： PCT No.PCT / CA95 / 00635 Sec。 371日期1997年7月21日 102（e）日期1997年7月21日PCT 1995年11月8日PCT PCT。 公开号WO96 / 15620 PCT 日期1996年5月23日提供了一种用于无损压缩所有类型的数字图像的编码/解码方法，包括连续色调图像，图形，混合文本的多媒体图像，图形和照片，二进制文件和图形。 逐像素地识别连续色调模式和二进制模式。 在连续色调模式中，在概念复杂的方案中使用上下文建模和预测，主要涉及整数运算和简单逻辑。 编码和解码技术都适用于顺序和逐行传输，尽管不同的具体算法可以用于不同的具体情况。

公开(公告)号：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.

摘要翻译： 获得用于用户认证的多点触摸输入序列的问题通过在多个时间实例上确定从至少四个触摸点的无序集合到至少四个指尖的有序集合的映射来解决， 其中对于所述多个时间实例中的至少一个，从至少四个触摸点的无序集合到至少四个指尖的有序集合的映射受到约束，即至少四个触摸点的有序集合定义为 简单多边形。

公开(公告)号：US20140173729A1

公开(公告)日：2014-06-19

申请号：US14021393

申请日：2013-09-09

申请人： Justin CAPPOS ,  Nasir MEMON ,  Sai Teja PEDDINTI ,  Keith ROSS

发明人： Justin CAPPOS ,  Nasir MEMON ,  Sai Teja PEDDINTI ,  Keith ROSS

IPC分类号： H04L29/06

CPC分类号： H04L63/1408 ,  G06F21/6209 ,  G06F21/6218 ,  H04L63/0428 ,  H04L63/08 ,  H04L63/168

摘要： A security system and service, which improves the performance of SECaaS services, is described. A security server system tracks the content that has successfully passed through its security modules and distributes this information to the end user client devices as hashlist information. The remote client devices can then safely bypass the cloud for a significant fraction of Web object requests by using information on a locally stored hashlist to validate Web objects.

摘要翻译： 描述了提高SECaaS服务性能的安全系统和服务。 安全服务器系统跟踪成功通过其安全模块的内容，并将该信息作为哈希表信息分发给最终用户客户端设备。 然后，通过使用本地存储的哈希表上的信息来验证Web对象，远程客户端设备可以安全地绕过云端大部分Web对象请求。

公开(公告)号：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.

摘要翻译： 最近提出了几种有希望的技术来将图像或视频绑定到其源获取装置。 这些技术已经被深入研究以解决性能问题，但是计算效率方面还没有得到适当的考虑。 考虑到非常大的数据库，描述了基于传感器指纹的源设备识别技术的效率。 描述了与常规方法相比提高搜索复杂性的新方案。

公开(公告)号：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.

摘要翻译： 对于多个活动流中的每一个，可以通过为流分配随机数来确定节点是否是中继节点，其中每个随机数字从分布中抽出。 然后，对于多个时隙中的每个时隙，可以确定到节点的任何进入流和来自节点的任何输出流，可以将分配给输入流的任何活动流的随机数相加以生成第一和，随机数 分配给任何活动输出流的信号可以被相加以产生第二和，并且第一和可以与第二和相乘以生成与时隙相关联的乘积。 然后可以将多个时隙中的产品相加以获得相加的乘积。 这可以重复，将随机值重新分配给多个流中的每一个，从而获得多个相加的乘积。 可以确定多个相加产物的方差，并将其与阈值进行比较以获得比较结果。 然后可以使用比较结果来确定节点是否是中继节点。 可以使用确定节点是否是中继节点来控制中继节点保护策略的执行。