-
1.发明授权公开(公告)号：US06616704B1
公开(公告)日：2003-09-09
申请号：US09665897
申请日：2000-09-20
申请人： Alexander Birman , Harry R. Gail, Jr. , Sidney L. Hantler , George B. Leeman, Jr. , Daniel Milch
发明人： Alexander Birman , Harry R. Gail, Jr. , Sidney L. Hantler , George B. Leeman, Jr. , Daniel Milch
IPC分类号： G06F1721
CPC分类号： G06F17/273
摘要： A very fast method for correcting the spelling of a word or phrase in a document proceeds in two steps: first applying a very fast approximate method for eliminating most candidate words from consideration (without computing the exact edit distance between the given word whose spelling is to be corrected and any candidate word), followed by a “slow method” which computes the exact edit distance between the word whose spelling is to be corrected and each of the few remaining candidate words. The combination results in a method that is almost as fast as the fast approximate method and as exact as the slow method.
摘要翻译： 用于纠正文档中的单词或短语的拼写的非常快速的方法分为两个步骤：首先应用非常快速的近似方法来消除考虑中的大多数候选词（不计算给定单词的精确编辑距离，其拼写是 被修正和任何候选词），然后是“慢法”，其计算要修正其拼写的单词和几个剩余的候选词之间的精确编辑距离。 该组合产生的方法几乎与快速近似方法一样快，并且与慢速方法一样精确。
-
2.发明授权公开(公告)号：US07171585B2
公开(公告)日：2007-01-30
申请号：US10723751
申请日：2003-11-26
IPC分类号： G06F11/00
CPC分类号： G06F11/0709 , G06F11/079 , G06F11/2257
摘要： Faults and errors are diagnosed from a repository of directed graphs. Subsets of all the possible questions and answers in the fault diagnosis process are encoded as directed graphs. Downloading subsets from a repository to a remote user substantially reduces the number of transmissions between the user and the repository.
摘要翻译： 故障和错误从定向图库中诊断出来。 故障诊断过程中所有可能的问题和答案的子集编码为有向图。 从存储库下载子集到远程用户大大减少了用户和存储库之间的传输次数。
-
3.发明授权公开(公告)号：US08763003B2
公开(公告)日：2014-06-24
申请号：US13426102
申请日：2012-03-21
IPC分类号： G06F9/46
CPC分类号： G06F9/524
摘要： A method of detecting deadlock in a multithreading program is provided. An invocation graph is constructed having a single root and a plurality of nodes corresponding to one or more functions written in code of the multithreading program. A resource graph is computed in accordance with one or more resource sets in effect at each node of the invocation graph. It is determined whether cycles exist between two or more nodes of the resource graph. A cycle is an indication of deadlock in the multithreading program.
摘要翻译： 提供了一种检测多线程程序中的死锁的方法。 构造具有单个根和多个对应于多线程程序的代码中写入的一个或多个函数的节点的调用图。 根据调用图的每个节点处有效的一个或多个资源集来计算资源图。 确定资源图表的两个或多个节点之间是否存在循环。 一个循环是多线程程序中死锁的指示。
-
4.发明授权公开(公告)号：US08230437B2
公开(公告)日：2012-07-24
申请号：US12056646
申请日：2008-03-27
CPC分类号： G06F9/524
摘要： A method of detecting deadlock in a multithreading program is provided. An invocation graph is constructed having a single root and a plurality of nodes corresponding to one or more functions written in code of the multithreading program. A resource graph is computed in accordance with one or more resource sets in effect at each node of the invocation graph. It is determined whether cycles exist between two or more nodes of the resource graph. A cycle is an indication of deadlock in the multithreading program.
摘要翻译： 提供了一种检测多线程程序中的死锁的方法。 构造具有单个根和多个对应于多线程程序的代码中写入的一个或多个函数的节点的调用图。 根据调用图的每个节点处有效的一个或多个资源集来计算资源图。 确定资源图表的两个或多个节点之间是否存在循环。 一个循环是多线程程序中死锁的指示。
-
-
-
搜索结果
4 条记录 (耗时 0.025 秒)
