公开(公告)号：US6064953A

公开(公告)日：2000-05-16

申请号：US100269

申请日：1998-06-18

申请人： John T. Maxwell, III ,  Ronald M. Kaplan

发明人： John T. Maxwell, III ,  Ronald M. Kaplan

IPC分类号： G06F9/44 ,  G06F17/27 ,  G06F17/30 ,  G06F17/21

CPC分类号： G06F17/27 ,  G06F8/3135 ,  Y10S707/99936 ,  Y10S707/99942

摘要： A method of unifying edge data structures using a processor. The method begins with creation of a first edge data structure and unifying it with a second edge data structure. If during unification any of the contexted lazy copy links associated with the second graph data structure are activated, then second graph data structure is expanded. Expansion involves first selecting a contexted lazy copy link from among the contexted lazy copy links associated with the second graph data, selecting a selected attribute from the subtree feature structure pointed to by the selected contexted lazy copy link, making a copy of the selected attribute and storing the copy of the selected attribute in the second graph data structure as a second attribute, and adding a contexted lazy copy link from the second attribute to the selected attribute value.

摘要翻译： 使用处理器统一边缘数据结构的方法。 该方法开始于创建第一边缘数据结构并将其与第二边缘数据结构进行统一。 如果在统一期间激活与第二图形数据结构相关联的任何有争议的懒惰复制链接，则扩展第二图形数据结构。 扩展涉及首先从与第二图形数据相关联的有争议的惰性复制链接中选择一个有争议的懒惰复制链接，从所选择的有约束的懒惰复制链接指向的子树特征结构中选择所选择的属性，制作所选属性的副本，以及 将所选择的属性的副本存储在第二图形数据结构中作为第二属性，并且将来自第二属性的有争议的延迟复制链接添加到所选择的属性值。

公开(公告)号：US5819210A

公开(公告)日：1998-10-06

申请号：US668988

申请日：1996-06-21

申请人： John T. Maxwell, III ,  Ronald M. Kaplan

发明人： John T. Maxwell, III ,  Ronald M. Kaplan

IPC分类号： G06F9/44 ,  G06F17/27 ,  G06F17/30 ,  G06F17/20

CPC分类号： G06F17/27 ,  G06F8/3135 ,  Y10S707/99936 ,  Y10S707/99942

摘要： A method of unifying edge data structures using a processor. The method begins with creation of a first edge data structure and unifying it with a second edge data structure. If during unification any of the contexted lazy copy links associated with the second graph data structure are activated, then second graph data structure is expanded. Expansion involves first selecting a contexted lazy copy link from among the contexted lazy copy links associated with the second graph data, selecting a selected attribute from the subtree feature structure pointed to by the selected contexted lazy copy link, making a copy of the selected attribute and storing the copy of the selected attribute in the second graph data structure as a second attribute, and adding a contexted lazy copy link from the second attribute to the selected attribute value.

摘要翻译： 使用处理器统一边缘数据结构的方法。 该方法开始于创建第一边缘数据结构并将其与第二边缘数据结构进行统一。 如果在统一期间激活与第二图形数据结构相关联的任何有争议的懒惰复制链接，则扩展第二图形数据结构。 扩展涉及首先从与第二图形数据相关联的有争议的惰性复制链接中选择一个有争议的懒惰复制链接，从所选择的有约束的懒惰复制链接指向的子树特征结构中选择所选择的属性，制作所选属性的副本，以及 将所选择的属性的副本存储在第二图形数据结构中作为第二属性，并且将来自第二属性的有争议的延迟复制链接添加到所选择的属性值。

公开(公告)号：US5438511A

公开(公告)日：1995-08-01

申请号：US260205

申请日：1988-10-19

申请人： John T. Maxwell, III ,  Ronald M. Kaplan

发明人： John T. Maxwell, III ,  Ronald M. Kaplan

IPC分类号： G06F9/44 ,  G06F17/27 ,  G06F17/28 ,  G06F17/20

CPC分类号： G06F8/3135

摘要： Unification of a disjunctive system is performed based on context identifiers within data structures that correspond to disjunctions. Each context identifier is a logical combination of choices, with each choice identifying one of the disjuncts of a disjunction in the system. Each choice can include a disjunction identifier and a choice identifier identifying one of the disjuncts of the identified disjunction. The logical combination of choices in a context identifier thus corresponds to a combination of disjuncts, all of which could be from different disjunctions. If two data units have context identifiers identifying contexts that are genuine alternatives, those data units are not unified. Data units that have context identifiers that are not genuine alternatives are unified. A set of context-value pairs, referred to as a disjunctive value, can be unified with another disjunctive value by considering all combinations of pairs of context identifiers that include one context identifier from each disjunctive value. The number of combinations of context identifiers in each disjunctive value is reduced by combining context-value pairs: Pairs with equal value tokens are combined by merging their context identifiers and unifying the value tokens. Pairs with f-structures as values are combined by merging context identifiers and unifying the f-structures. If it is necessary to insert a pointer, the pointer is inserted so that it initially leads to a disjunctive value, with the source of the pointer indicating which of the context-value pairs in the disjunctive value is to be accessed.

摘要翻译： 基于对应于分离的数据结构内的上下文标识符来执行分离系统的统一。 每个上下文标识符是选择的逻辑组合，每个选择标识系统中的一个分离的分离之一。 每个选择可以包括分离标识符和识别识别的分离的分离之一的选择标识符。 因此，上下文标识符中的选择的逻辑组合对应于分离的组合，所有这些都可以来自不同的分离。 如果两个数据单元具有识别作为真正替代品的上下文的上下文标识符，则这些数据单元不统一。 具有不是真正替代品的上下文标识符的数据单元是统一的。 称为分离值的一组上下文值对可以通过考虑从每个分离值包括一个上下文标识符的上下文标识符对的所有组合而与另一个分离值相统一。 通过组合上下文值对来减少每个分离值中的上下文标识符的组合数量：通过合并其上下文标识符并统一值令牌来组合具有相等值令牌的对。 具有f结构值的对通过合并上下文标识符和统一f结构来组合。 如果需要插入指针，则插入指针以使其最初导致分离值，指针的源指示要分离的值中的哪个上下文值对被访问。

公开(公告)号：US5903860A

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

申请号：US672515

申请日：1996-06-21

申请人： John T. Maxwell, III ,  Ronald M. Kaplan

发明人： John T. Maxwell, III ,  Ronald M. Kaplan

IPC分类号： G06F9/44 ,  G06F17/27 ,  G06F17/20

CPC分类号： G06F8/3135 ,  G06F17/27

摘要： A method of using a processor to conjoin a first clause and a second clause as part of a unification of a first graph. If the first clause is not associated with the first graph, then a third clause is created that is opaque and has a pointer to the first clause. Afterward, the third clause is conjoined with the second clause.

摘要翻译： 一种使用处理器结合第一个子句和第二个子句作为第一个图形的统一的一部分的方法。 如果第一个子句与第一个图形没有关联，则创建一个第三个子句是不透明的，并具有指向第一个子句的指针。 之后，第三个条款与第二个条款相结合。

公开(公告)号：US5325091A

公开(公告)日：1994-06-28

申请号：US942665

申请日：1992-09-09

申请人： Ronald M. Kaplan ,  John T. Maxwell, III

发明人： Ronald M. Kaplan ,  John T. Maxwell, III

IPC分类号： G06F5/00 ,  G06F17/21 ,  H03M7/42 ,  H03M7/30

CPC分类号： H03M7/42

摘要： A text-compression technique utilizes a plurality of word-number mappers ("WNMs") in a frequency-ordered hierarchical structure. The particular structure of the set of WNMs depends on the specific encoding regime, but can be summarized as follows. Each WNM in the set is characterized by an ordinal WNM number and a WNM size (maximum number of tokens) that is in general a non-decreasing function of the WNM number. A given token is assigned a number pair, the first being one of the WNM numbers, and the second being the token's position or number in that WNM. Typically, the most frequently occurring tokens are mapped with a smaller-numbered WNM. The set of WNMs is generated on a first pass through the database to be compressed. The database is parsed into tokens, and a rank-order list based on the frequency of occurrence is generated. This list is partitioned in a manner to define the set of WNMs. Actual compression of the data base occurs on a second pass, using the set of WNMs generated on the first pass. The database is parsed into tokens, and for each token, the set of WNMs is searched to find the token. Once the token is found, it is assigned the appropriate number pair and is encoded. This proceeds until the entire database has been compressed.

摘要翻译： 文本压缩技术在频率有序的层次结构中使用多个字数映射器（“WNM”）。 一组WNM的特定结构取决于具体的编码方式，但可以归纳如下。 集合中的每个WNM的特征在于通常是WNM号码的非递减函数的序数WNM号和WNM大小（令牌的最大数目）。 给定令牌分配一个数字对，第一个是WNM号码之一，第二个是该WNM中的令牌的位置或号码。 通常，使用较小编号的WNM映射最常发生的令牌。 该WNM集合是通过要压缩的数据库的第一次通过生成的。 将数据库解析为令牌，并生成基于发生频率的排序列表。 该列表以定义一组WNM的方式进行分区。 数据库的实际压缩发生在第二遍，使用第一遍生成的一组WNM。 数据库被解析为令牌，并且对于每个令牌，搜索一组WNM以找到令牌。 一旦找到令牌，它就被分配了适当的数字对并被编码。 直到整个数据库都被压缩为止。

公开(公告)号：US07657420B2

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

申请号：US10739349

申请日：2003-12-19

申请人： John T. Maxwell, III

发明人： John T. Maxwell, III

IPC分类号： G06F17/28

CPC分类号： G06F17/2881

摘要： Techniques are provided to generate alternate phrases from a packed meaning representation. The semantics of input items in a packed meaning representation are matched against a lexicon to determine initial entries in a phrasal information structure. Context, syntax and semantic information describing each phrasal entry are added to the phrasal information structure. Linear or other implications are used to determine a set of unordered rewrite rules. The unordered rewrite rules associate semantic information with pseudofacts such that a complete set of choices from the set of disjunctions in the packed meaning representation is selected. Semantic information associated with the unordered rewrite rules identifies entries in the phrasal information structure to be updated with the pseudofact of the unordered rewrite rule. Entries in the phrasal information structure not associated with false contexts are combined based on ordered rewrite rules. The ordered rewrite rules are based on the language of the packed meaning representation. Source information associated with each new entry in the phrasal information structure reflects the phrasal entry identifiers of the entries used to determine the new entry. For any set of entries in the phrasal information structure produced by an ordered rewrite rule, the context of a missing semantic fact is subtracted from the context of the entry lacking the semantic fact. Entries associated with a false context are discarded and entries sharing the same syntax and semantic information are merged. Any entries in the phrasal information structure associated with the “ALL” pseudofact are then determined. Alternate phrases are generated based on the source information for the entry in the phrasal information structure associated with the “ALL” pseudofact.

摘要翻译： 提供技术以从打包的意义表示生成替代短语。 打包意义表示中的输入项的语义与词典匹配以确定短语信息结构中的初始条目。 描述每个短语条目的上下文，语法和语义信息被添加到短语信息结构中。 线性或其他含义用于确定一组无序重写规则。 无序重写规则将语义信息与伪文本相关联，使得选择来自包装含义表示中的一组分离的完整的选择集合。 与无序重写规则相关联的语义信息识别要用无序重写规则的伪指令更新的短语信息结构中的条目。 基于有序重写规则组合了与虚假上下文无关的短语信息结构中的条目。 有序重写规则基于打包意义表示的语言。 与短语信息结构中的每个新条目相关联的源信息反映用于确定新条目的条目的短语条目标识符。 对于由有序重写规则产生的短语信息结构中的任何一组条目，从缺少语义事实的条目的上下文中减去缺失语义事实的上下文。 与false上下文关联的条目被丢弃，并且共享相同语法和语义信息的条目被合并。 然后确定与“ALL”pseudofact相关联的短语信息结构中的任何条目。 基于与“ALL”假结构相关联的短语信息结构中的条目的源信息生成替代短语。

公开(公告)号：US5233687A

公开(公告)日：1993-08-03

申请号：US805343

申请日：1991-12-09

申请人： D. Austin Henderson, Jr. ,  Stuart K. Card ,  John T. Maxwell, III

发明人： D. Austin Henderson, Jr. ,  Stuart K. Card ,  John T. Maxwell, III

IPC分类号： G06F3/033 ,  G06F3/048

CPC分类号： G06F9/4443 ,  G06F3/0481 ,  G06F3/0483

摘要： Workspaces provided by an object-based user interface appear to share windows and other display objects. Each workspace's data structure includes, for each window in that workspace, a linking data structure called a placement which links to the display system object which provides that window, which may be a display system object in a preexisting window system. The placement also contains display characteristics of the window when displayed in that workspace, such as position and size. Therefore, a display system object can be linked to several workspaces by a placement in each of the workspaces' data structures, and the window it provides to each of those workspaces can have unique display characteristics. The display system object can operate continuously despite switching between one workspace and another, and the windows it provides in successive workspaces can share features so that they appear to the user to be the same window or versions of the same window. As a result, the workspaces appear to be sharing a window. Workspaces can also appear to share a window if each workspace's data structure includes data linking to another workspace with a placement to the shared window. A special workspace is automatically included in each of the other workspaces, so that windows in that workspace go with the user into any other workspace. The user can invoke a switch between workspaces by selecting a display object called a door, and a back door to the previous workspace is created automatically so that the user is not trapped in a workspace.

摘要翻译： 由基于对象的用户界面提供的工作空间似乎共享窗口和其他显示对象。 每个工作空间的数据结构包括针对该工作空间中的每个窗口的链接数据结构，称为位置，该链接数据结构链接到提供该窗口的显示系统对象，该窗口可以是预先存在的窗口系统中的显示系统对象。 展示位置还包含显示在该工作空间中的窗口的显示特征，例如位置和大小。 因此，显示系统对象可以通过每个工作空间的数据结构中的位置链接到多个工作空间，并且它为每个工作空间提供的窗口可以具有独特的显示特征。 尽管在一个工作区和另一个工作空间之间进行切换，显示系统对象可以连续工作，而在连续的工作空间中提供的窗口可以共享特征，使得它们看起来与同一个窗口相同的窗口或版本。 因此，工作区似乎正在共享一个窗口。 如果每个工作区的数据结构包括链接到具有到共享窗口的位置的另一个工作区的数据，工作区也可以共享一个窗口。 每个其他工作区都会自动包含一个特殊的工作空间，以便该工作区中的窗口随着用户进入任何其他工作区。 用户可以通过选择一个称为门的显示对象来调用工作空间之间的切换，并自动创建前一个工作空间的后门，以使用户不被捕获在工作区中。

公开(公告)号：US08706660B2

公开(公告)日：2014-04-22

申请号：US13022952

申请日：2011-02-08

申请人： Evgeniy Bart ,  Prateek Sarkar ,  John T. Maxwell, III

发明人： Evgeniy Bart ,  Prateek Sarkar ,  John T. Maxwell, III

IPC分类号： G06N3/12

CPC分类号： G06F17/30011

摘要： Methods and system employing the same for optimizing an objective function are provided. The objective function assesses the quality of a candidate solution. One or more variables of an objective function are selected as pivot variables. Each of the variables include one or more candidate values. An upper bound function is generated from the objective function, where the pivot variables are held fixed. For each combination of the candidate values, one or more candidate solutions are searched using the upper bound function. One or more optimal solutions are selected from among the solutions to the searches.

摘要翻译： 提供了用于优化目标函数的方法和系统。 目标函数评估候选解决方案的质量。 选择目标函数的一个或多个变量作为枢轴变量。 每个变量包括一个或多个候选值。 从目标函数生成上限函数，其中枢轴变量保持固定。 对于候选值的每个组合，使用上限函数搜索一个或多个候选解。 从搜索的解决方案中选择一个或多个最优解。

公开(公告)号：US08402542B2

公开(公告)日：2013-03-19

申请号：US12546493

申请日：2009-08-24

申请人： Tracy H. King ,  Philippe J. P. Golle ,  John T. Maxwell, III ,  Jessica N. Staddon

发明人： Tracy H. King ,  Philippe J. P. Golle ,  John T. Maxwell, III ,  Jessica N. Staddon

IPC分类号： H04L29/06

CPC分类号： G06F21/6218

摘要： One embodiment provides a system that detects sensitive passages. During operation, the system receives a document and disassembles the document into a plurality of passages. For a respective passage, the system performs a search through a non-sensitive-passage database to determine whether the passage is a known non-sensitive passage. If so, the system marks the passage as non-sensitive, and if not, the system determines whether the passage triggers a cut-and-paste attack detection. If so, the system forwards the passage to an administrator and allows the administrator to determine whether the passage is non-sensitive and, further, to add the passage to the non-sensitive-passage database responsive to the administrator determining the passage to be non-sensitive.

摘要翻译： 一个实施例提供了一种检测敏感通道的系统。 在操作期间，系统接收文档并将文档分解成多个通道。 对于相应的段落，系统通过非敏感通道数据库执行搜索，以确定通道是否是已知的非敏感通道。 如果是这样，系统会将通道标记为非敏感的，如果不是，系统会确定通道是否触发切割和粘贴攻击检测。 如果是这样，系统将该段落转发给管理员，并允许管理员确定该段落是否不敏感，并且进一步将该段落添加到非敏感段数据库中，以响应管理员确定该段落为非敏感段 -敏感。

公开(公告)号：US20110219013A1

公开(公告)日：2011-09-08

申请号：US12718610

申请日：2010-03-05

申请人： John T. Maxwell, III

发明人： John T. Maxwell, III

IPC分类号： G06F17/30 ,  G06N5/02

CPC分类号： G06F17/30 ,  G06N5/02

摘要： Methods and systems supporting curation of items in a searchable knowledge base are provided. The methods and systems include mining one or more search queries of the searchable knowledge base, where each of the search queries includes a plurality of the items. The method further includes determining one or more pairs of items using a processor, where each of the pairs of items includes a correlation value exceeding a threshold. The correlation values for the pairs of items are based upon the frequency the items of the pairs of items co-occur within the search queries. The method further includes providing the pairs of items to a curator, where the curator reviews the pairs of items.

摘要翻译： 提供支持可搜索知识库中项目策划的方法和系统。 所述方法和系统包括挖掘可搜索知识库的一个或多个搜索查询，其中每个搜索查询包括多个项目。 该方法还包括使用处理器来确定一个或多个物品对，其中每对物品中的每一个都包括超过阈值的相关值。 项目对的相关值基于搜索查询中共同出现的项目对的频率。 该方法还包括将一对物品提供给策展人，策展人在那里审查物品对。