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

1. 发明授权

US5557720A Method of determining whether a document tree is weakly valid 失效
标题翻译：确定文档树是否弱有效的方法
公开(公告)号：US5557720A
公开(公告)日：1996-09-17
申请号：US303286
申请日：1994-09-08
申请人： Allen L. Brown, Jr. , Sidney W. Marshall
发明人： Allen L. Brown, Jr. , Sidney W. Marshall
IPC分类号： G06F17/21 , G06F17/22 , G06F17/24 , G06F17/27 , G06F7/28
CPC分类号： G06F17/27 , G06F17/218 , G06F17/2247 , G06F17/24 , G06F17/2725
摘要： Some document languages such as the Standard Generalized Markup Language (SGML) represent documents as trees with each node of the tree labelled with a tag and each node's immediate descendants taken in order having tags that satisfy a production corresponding to the parent's tag. Thus, a document is represented as a complete parse tree satisfying the production rules of a grammar. To simplify maintaining a valid document/parse tree at all stages, an efficient check is made whether a document is valid or can be extended to a valid document and furthermore to show how a document could be changed to be valid. A document can be extended to a valid document if is equal to a valid document with possibly some nodes deleted. External (leaf) nodes can just be deleted. Internal nodes are deleted by replacing the arc from the parent with multiple arcs (in the same order) from the parent to each of the children of the deleted node. A grammar is constructed from the given grammar that includes those documents that can be completed to a valid document and is called a gapped grammar. A method is provided to teach how a gapped grammar can be constructed from a grammar, a parser/checker is efficiently implemented.
摘要翻译：标准通用标记语言（SGML）等标准通用标记语言（SGML）中的一些文档语言将文档作为树，将树的每个节点标记为标签，并且每个节点的直接后代按照满足与父标签相对应的生产的标签。因此，文档被表示为满足语法生产规则的完整解析树。为了简化在所有阶段维护有效的文档/解析树，可以有效地检查文档是有效的还是可以扩展到有效的文档，还可以显示文档如何被更改为有效。如果文档等于有效的文档，可能会删除某些节点，则文档可以扩展到有效的文档。外部（叶）节点可以被删除。通过从父对象到已删除节点的每个子节点的多个弧（以相同的顺序）替换父元素的弧来删除内部节点。语法是从给定的语法构建的，其中包括可以完成有效文档的文档，并称之为空格语法。提供了一种方法来教导如何从语法构建空格语法，有效地实现解析器/检查器。

2. 发明授权

US08751433B2 Efficient probabilistic reasoning over semantic data 有权
标题翻译：对语义数据的有效概率推理
公开(公告)号：US08751433B2
公开(公告)日：2014-06-10
申请号：US12968289
申请日：2010-12-15
申请人： Stuart M. Bowers , Thomas E. Jackson , Silvia C. Vega , Chris D. Karkanias , Allen L. Brown, Jr. , David G. Campbell , Brian S. Aust
发明人： Stuart M. Bowers , Thomas E. Jackson , Silvia C. Vega , Chris D. Karkanias , Allen L. Brown, Jr. , David G. Campbell , Brian S. Aust
IPC分类号： G06N5/02
CPC分类号： G06N5/02 , G06N7/005
摘要： A semantic reasoning engine is described for performing probabilistic reasoning over a semantic graph in a time-efficient and viable manner. The semantic reasoning engine includes a data store that provides the semantic graph, where the semantic graph is formed by a plurality of concepts connected together via probabilistic assertions. The semantic reasoning engine operates by providing an answer to a query by recursively collapsing the semantic graph based on at least one collapsing rule.
摘要翻译：描述了一种语义推理引擎，用于以时间有效且可行的方式在语义图上执行概率推理。语义推理引擎包括提供语义图的数据存储，其中语义图由通过概率断言连接在一起的多个概念形成。语义推理引擎通过基于至少一个折叠规则递归地折叠语义图来提供对查询的答案来操作。

3. 发明授权

US5491628A Method and apparatus for document transformation based on attribute grammars and attribute couplings 失效
标题翻译：基于属性语法和属性耦合的文档转换方法和装置
公开(公告)号：US5491628A
公开(公告)日：1996-02-13
申请号：US165785
申请日：1993-12-10
申请人： Toshiro Wakayama , Allen L. Brown, Jr. , Suryanarayana M. Mantha , An Feng
发明人： Toshiro Wakayama , Allen L. Brown, Jr. , Suryanarayana M. Mantha , An Feng
IPC分类号： G06F17/21 , G06F17/22 , G06F17/27
CPC分类号： G06F17/2282 , G06F17/2247 , G06F17/2264 , G06F17/227 , G06F17/27
摘要： A method and apparatus are provided for converting a first document to a second document. The first document is in a first extended attribute grammar, while the second document is in a second extended attribute grammar. An extended attribute coupling grammar couples the first and second extended attribute grammars. The first document is converted to a first tree, which is partially copied to a first copy. The first copy is completed by evaluating it's attribute with respect to the extended attribute coupling grammar. The first copy is then a partially attributed tree of the second document. The partially attributed tree is completed to form a second tree based on the second extended attribute grammar. The second tree is then converted to the second document.
摘要翻译：提供了一种用于将第一文档转换为第二文档的方法和装置。第一个文档是第一个扩展属性语法，而第二个文档是第二个扩展属性语法。扩展属性耦合语法耦合第一和第二扩展属性语法。第一个文档被转换为第一个树，它被部分复制到第一个副本。通过对扩展属性耦合语法的属性进行评估来完成第一个副本。第一个副本是第二个文档的部分归属的树。基于第二个扩展属性语法完成部分归属的树的形成第二个树。然后将第二个树转换为第二个文档。

4. 发明授权

US07543266B2 Lock-free state merging in parallelized constraint satisfaction problem solvers 有权
标题翻译：并行约束满足问题解决者的无锁状态合并
公开(公告)号：US07543266B2
公开(公告)日：2009-06-02
申请号：US11602092
申请日：2006-11-20
申请人： Allen L. Brown, Jr.
发明人： Allen L. Brown, Jr.
IPC分类号： G06F17/50
CPC分类号： G06F8/314 , G06F8/3135 , G06F9/5061
摘要： Solver state merging in parallel constraint satisfaction problem (CSP) solvers. Solver state during processing of a computational thread of parallel CSP solvers is represented as a set of support graphs. The support graphs are merged in a pairwise fashion, yielding a new conflict-free graph. The merge process is free of cycles, conflicts are removed, and thread processing is lock-free. The architecture can be applied, generally, in any CSP solver (e.g., a Boolean SAT solver) having certain formal properties. A system is provided that facilitates solver processing, the system comprising a bookkeeping component for representing input solver state of a computational thread as a set of graphs, and a merge component for pairwise merging of at least two input graphs of the set of graphs into a merged graph that represents final state of the computational thread.
摘要翻译：并行约束满足问题（CSP）求解器的求解器状态合并。在处理并行CSP求解器的计算线程期间的解算器状态被表示为一组支持图。支持图以成对方式合并，产生新的无冲突图。合并过程没有循环，冲突被删除，并且线程处理是无锁的。通常，该架构可以应用于具有某些形式特性的任何CSP求解器（例如，布尔SAT求解器）中。提供了一种有助于解算器处理的系统，该系统包括用于将计算线程的输入解算器状态表示为一组图形的记帐组件，以及用于将该组图形的至少两个输入图形成对合并为表示计算线程的最终状态的合并图。

5. 发明授权

US5438512A Method and apparatus for specifying layout processing of structured documents 失效
标题翻译：用于指定结构化文档的布局处理的方法和装置
公开(公告)号：US5438512A
公开(公告)日：1995-08-01
申请号：US139686
申请日：1993-10-22
申请人： Suryanarayana M. Mantha , Allen L. Brown, Jr. , Toshiro Wakayama
发明人： Suryanarayana M. Mantha , Allen L. Brown, Jr. , Toshiro Wakayama
IPC分类号： G06K9/20 , G06F17/21 , G06F17/22 , G06F17/27 , G06F17/28 , G06G7/60
CPC分类号： G06F17/22 , G06F17/211 , G06F17/2247 , G06F17/271 , G06F17/2775
摘要： A method and apparatus are provided for specifying layout processing of logically structured documents, that is, specific logical structures, in computer document handling systems. The method and apparatus allow the specification of the generic logical structure of the structured document in terms of relational attribute grammars. According to the invention, these relational attributes have a binary relationship. The generic layout structure for a class of structural documents is also represented in terms of relational attribute grammars. Coordination grammars, also represented in terms of relational attribute grammars, link the elements of the generic logical structure to the generic layout structure. By coordinating the generic layout and generic logical structures, many solutions are available. Preferential specifications are developed to resolve any potential ambiguities between the many solutions, and to select a preferred solution. The specific logical structure is then generated into a specific layout structure using the preferential specifications to resolve any ambiguities occurring as a result of the coordination.
摘要翻译：提供了一种用于指定逻辑结构化文档（即，计算机文档处理系统中的特定逻辑结构）的布局处理的方法和装置。该方法和装置允许根据关系属性语法来指定结构化文档的通用逻辑结构。根据本发明，这些关系属性具有二进制关系。一类结构性文档的通用布局结构也用关系属性语法表示。协调语法也用关系属性语法表示，将通用逻辑结构的元素链接到通用布局结构。通过协调通用布局和通用逻辑结构，可以使用许多解决方案。开发优先规范以解决许多解决方案之间的任何潜在歧义，并选择首选解决方案。然后，使用优选规范将特定逻辑结构生成为特定的布局结构，以解决由于协调而发生的任何歧义。

6. 发明授权

US08156472B2 Process language for microprocessors with finite resources 失效
标题翻译：具有有限资源的微处理器的处理语言
公开(公告)号：US08156472B2
公开(公告)日：2012-04-10
申请号：US10816558
申请日：2004-03-30
申请人： L. Gregory Meredith , Allen L. Brown, Jr. , David Richter , George Moore
发明人： L. Gregory Meredith , Allen L. Brown, Jr. , David Richter , George Moore
IPC分类号： G06F9/44 , G06F9/45 , G06F13/10
CPC分类号： G06F9/46 , G06F8/314
摘要： A reflective process algebra called the ρ-calculus facilitates the serialization of processes at the level of the reflective process algebra. The reflective process algebra because of its reflective properties, can be used on computing systems with finite resources. The reflective process calculus can be made to be sensitive to resources, such as memory and bandwidth, hence facilitating its use as a programming language at the machine level. The reflective process calculus causes the dual nature of a computation entity to be exposed. A name can be caused to become a process and a process can be caused to become a name.
摘要翻译：称为“积分”的反射过程代数有助于反射过程代数级别的过程的序列化。反射过程代数由于其反射特性，可用于具有有限资源的计算系统。可以使反射过程微积分对诸如存储器和带宽的资源敏感，因此有助于其在机器级上用作编程语言。反射过程演算导致计算实体的双重性质暴露出来。一个名字可能会成为一个过程，一个过程可能会成为一个名字。

7. 发明授权

US07685566B2 Structured message process calculus 有权
标题翻译：结构化消息处理演算
公开(公告)号：US07685566B2
公开(公告)日：2010-03-23
申请号：US10881142
申请日：2004-06-30
申请人： Allen L. Brown, Jr. , Lucius Gregory Meredith , Cosimo Laneve
发明人： Allen L. Brown, Jr. , Lucius Gregory Meredith , Cosimo Laneve
IPC分类号： G06F9/44 , G06F9/45
CPC分类号： G06F9/546
摘要： Trees are a common semantic denominator of XML data types and process calculi. This indicates a potential tight intertwining of the syntax and semantics of data and processes. The invention provides this intertwining via a process calculus wherein the data language syntax is a fragment of the programming language syntax.
摘要翻译：树是XML数据类型和处理结果的常见语义分母。这表明数据和过程的语法和语义之间可能存在紧密的交织。本发明通过过程演算提供了这种交织，其中数据语言语法是编程语言语法的一部分。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式