会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Concurrent Collection of Cyclic Garbage in Reference Counting Systems
    • 参考计数系统中循环垃圾的并发收集
    • US20070185943A1
    • 2007-08-09
    • US11695323
    • 2007-04-02
    • David BaconVadakkedathu Rajan
    • David BaconVadakkedathu Rajan
    • G06F17/30
    • G06F12/0261Y10S707/99938Y10S707/99957
    • The present invention provides techniques that allow concurrent collection of cyclic garbage on reference counting systems. In general, candidate objects are found that may be part of cyclic garbage. Each candidate object has a reference count. Two tests are performed to determine if concurrent operations have affected the reference counts of the candidate objects. If concurrent operations have not affected the reference counts, the candidate objects are collected as garbage. Additionally, during garbage collection, the decrements to reference counts are delayed so that increments occur before decrements and so that decrements are held a predetermined time before being applied. This prevents decrementing a reference and collecting a cycle as garbage right before a reference is added to an object in the cycle.
    • 本发明提供允许在引用计数系统上并行收集循环垃圾的技术。 一般来说,候选对象被发现可能是循环垃圾的一部分。 每个候选对象都有引用计数。 执行两个测试以确定并发操作是否影响候选对象的引用计数。 如果并发操作没有影响引用计数,则将候选对象收集为垃圾。 此外,在垃圾收集期间,延迟到引用计数的减少,使得在递减之前发生增量,并且使得递减在施加之前保持预定时间。 这样可以避免在引用被添加到循环中的对象之前减少引用并收集循环作为垃圾。
    • 4. 发明申请
    • Detecting spam email using multiple spam classifiers
    • 使用多个垃圾邮件分类器检测垃圾邮件
    • US20060149821A1
    • 2006-07-06
    • US11029069
    • 2005-01-04
    • Vadakkedathu RajanMark WegmanRichard SegalJason CrawfordJeffrey KephartShlomo Hershkop
    • Vadakkedathu RajanMark WegmanRichard SegalJason CrawfordJeffrey KephartShlomo Hershkop
    • G06F15/16
    • H04L51/12G06Q10/107
    • A method for detecting undesirable emails is disclosed. The method combines input from two or more spam classifiers to provide improved classification effectiveness and robustness. The method's effectiveness is improved over that of any one constituent classifier in the sense that the detection rate is increased and/or the false positive rate is decreased. The method's robustness is improved in the sense that, if spammers temporarily elude any one constituent classifier, the other constituent classifiers will still be likely to catch the spam. The method includes obtaining a score from each of a plurality of constituent spam classifiers by applying them to a given input email. The method further includes obtaining a combined spam score from a combined spam classifier that takes as input the plurality of constituent spam classifier scores, the combined spam classifier being computed automatically in accordance with a specified false-positive vs. false-negative tradeoff. The method further includes identifying the given input email as an undesirable email if the combined spam score indicates that the input e-mail is undesirable.
    • 公开了一种用于检测不期望的电子邮件的方法。 该方法结合了两个或更多个垃圾邮件分类器的输入,以提供改进的分类有效性和鲁棒性。 在检测率提高和/或假阳性率降低的意义上,该方法的有效性比任何一个构成分类器的有效性得到改善。 该方法的鲁棒性得到改善,因为如果垃圾邮件发送者暂时排除任何一个构成分类器,则其他组成分类器仍然可能会捕获垃圾邮件。 该方法包括通过将其应用于给定的输入电子邮件来从多个组成垃圾邮件分类器中的每一个获得分数。 所述方法还包括从组合的垃圾邮件分类器获得组合的垃圾邮件分数,所述组合垃圾邮件分类器将所述多个组成垃圾邮件分类器分数作为输入,所述组合的垃圾邮件分类器根据指定的假阳性与假阴性权衡自动计算。 如果组合的垃圾邮件评分指示输入的电子邮件是不期望的,该方法还包括将给定的输入电子邮件识别为不期望的电子邮件。
    • 7. 发明申请
    • Detecting spam e-mail using similarity calculations
    • 使用相似度计算来检测垃圾邮件
    • US20060149820A1
    • 2006-07-06
    • US11028969
    • 2005-01-04
    • Vadakkedathu RajanMark WegmanRichard SegalJason CrawfordJoel OssherJeffrey Kephart
    • Vadakkedathu RajanMark WegmanRichard SegalJason CrawfordJoel OssherJeffrey Kephart
    • G06F15/16
    • G06Q10/107H04L51/12
    • A method for detecting undesirable e-mails is disclosed. The method includes collecting a plurality of undesirable e-mails, arranging the plurality of undesirable e-mails into a plurality of groups and generating, for each group, at least one token, thereby producing a plurality of tokens for the plurality of undesirable e-mails. The method further includes receiving a first e-mail and generating at least one token for the first e-mail. The method further includes causing a comparison of the at least one token for the first e-mail with at least one of the plurality of tokens for the plurality of undesirable e-mails and identifying the first e-mail as an undesirable e-mail if the at least one token for the first e-mail matches any of the plurality of tokens for the plurality of undesirable e-mails.
    • 公开了一种用于检测不期望的电子邮件的方法。 该方法包括收集多个不期望的电子邮件,将多个不期望的电子邮件排列成多个组,并为每个组生成至少一个令牌,从而为多个不期望的电子邮件产生多个令牌, 邮件 该方法还包括接收第一电子邮件并为第一电子邮件生成至少一个令牌。 该方法还包括:将用于第一电子邮件的至少一个令牌与用于多个不期望的电子邮件的多个令牌中的至少一个进行比较,并将第一电子邮件识别为不期望的电子邮件,如果 所述用于所述第一电子邮件的所述至少一个令牌与所述多个不期望的电子邮件的所述多个令牌中的任一个相匹配。
    • 8. 发明申请
    • Garbage collector with eager read barrier
    • 垃圾收集器与渴望读屏障
    • US20050149589A1
    • 2005-07-07
    • US10751793
    • 2004-01-05
    • David BaconPerry ChengVadakkedathu Rajan
    • David BaconPerry ChengVadakkedathu Rajan
    • G06F12/00G06F12/02
    • G06F12/0253
    • A garbage collection system that needs to meet real-time requirements uses an eager read barrier that performs a forwarding operation as soon as a quantity is loaded. The barrier maintains a to-space invariant by including a forwarding pointer in the header of objects to be moved or accessed that normally points to the object itself. However, if the object has been moved, the forwarding pointer points to the new object location. The eager read barrier maintains the registers and stack cells such that the registers and stack cells always point into to-space. Barrier-sinking and common sub-expression elimination are used to minimize the overhead associated with the read barrier.
    • 需要满足实时要求的垃圾收集系统使用一个急速读取障碍,一旦加载数量就执行转发操作。 屏障通过将转发指针包括在通常指向对象本身的要移动或访问的对象的标题中来维护空间不变量。 但是,如果对象已被移动,则转发指针指向新的对象位置。 急切的阅读障碍维护寄存器和堆栈单元,使得寄存器和堆栈单元总是指向空间。 使用阻塞沉没和公共子表达式消除来最小化与读取屏障相关联的开销。
    • 9. 发明申请
    • Method and apparatus for optimizing away a null-check
    • 优化空值检查的方法和装置
    • US20050149588A1
    • 2005-07-07
    • US10751775
    • 2004-01-05
    • David BaconPerry ChengVadakkedathu Rajan
    • David BaconPerry ChengVadakkedathu Rajan
    • G06F12/00G06F12/02
    • G06F12/0269
    • A garbage collection system that needs to meet real-time requirements combines a null-check required for an application with a null check required by its read barrier. The null-check for the application may be the null-check required for a Java object dereference and may be performed via explicit comparisons or implicit traps. To facilitate the combining of the null-checks, the read barrier is broken into portions and sunk to its point of use. Thus, any exception due to a null-pointer in the read barrier will occur at the same location as the exception occurs in the application. Combining the null-checks reduces the overhead costs associated with the read barrier and improves the performance of the real-time application.
    • 需要满足实时需求的垃圾收集系统将应用程序所需的空检与其读障碍所需的空检查相结合。 应用程序的空检查可能是Java对象取消引用所需的空检查,并且可以通过显式比较或隐式陷阱执行。 为了便于零检查的组合,读屏障被分成几部分并沉入其使用点。 因此,由于读取障碍中的空指针引起的异常将发生在与应用程序中发生异常相同的位置。 组合零检查可减少与读障碍相关的开销成本,并提高实时应用程序的性能。
    • 10. 发明申请
    • Method and apparatus for dynamic incremental defragmentation of memory
    • 用于动态增量碎片整理存储器的方法和装置
    • US20050149686A1
    • 2005-07-07
    • US10751789
    • 2004-01-05
    • David BaconPerry ChengVadakkedathu Rajan
    • David BaconPerry ChengVadakkedathu Rajan
    • G06F12/00G06F12/02
    • G06F12/0269Y10S707/99957
    • A garbage collection process for managing a memory includes a defragmentation cycle. The garbage collection process is interleaved with a running application on a time-based or work-based schedule. The memory is divided into pages which are further divided into blocks falling into one of a number of block size classes. Objects that were not used during the last garbage collection phase are marked. Objects that were used are moved from pages containing the least live objects to pages containing the most live objects. Objects of the largest block size classes are moved first and objects of the smallest block size class are moved last. The garbage collection interval can be selected to satisfy desired CPU utilization or memory overhead requirements.
    • 用于管理存储器的垃圾收集过程包括碎片整理周期。 垃圾收集过程与基于时间或基于工作的计划的正在运行的应用程序进行交织。 存储器被划分为进一步分成多个块大小类别之一的块的页面。 在最后垃圾收集阶段未被使用的对象被标记。 使用的对象从包含最少活动对象的页面移动到包含最多活动对象的页面。 首先移动最大块大小类的对象,最后移动最小块大小类的对象。 可以选择垃圾收集间隔以满足期望的CPU利用率或内存开销要求。