John D Maxwell

US Patent:

7027305, Apr 11, 2006

Filed:

Nov 18, 2003

Appl. No.:

10/715907

Inventors:

David Keating - Limerick, IL
Antoin Russell - Limercik, IL
Mysore P. Divakar - San Jose CA, US
Thomas H. Templeton - Fremont CA, US
John Alan Maxwell - Newbury Park CA, US

Assignee:

Power-One, Inc. - Camarillo CA

International Classification:

H05K 7/20

US Classification:

361719, 361803, 361736, 439 65, 439 79, 439637

Abstract:

The invention provides arrangements to facilitate surface mounting of subassembly boards on a motherboard with reliable, high conductivity interconnection. In accordance with the invention, the subassembly interconnection arrangement is composed of separate power and sense connector arms formed on one or more base headers. The arrangement interconnects and supports the subassembly board on the motherboard surface. Each power arm advantageously comprises a plurality of split-based mounting lugs secured to the arm in a coplanar configuration. Each sense connector arm preferably comprises a plurality of connector pins secured to the arm in a coplanar configuration. Embodiments are disclosed for vertical and horizontal surface mounting.

US Patent:

8577899, Nov 5, 2013

Filed:

Mar 5, 2010

Appl. No.:

12/718610

Inventors:

John T. Maxwell - Santa Clara CA, US

Assignee:

Palo Alto Research Center Incorporation - Palo Alto CA

International Classification:

G06F 7/00
G06F 17/00
G06F 17/30
G06N 5/02
G06F 15/16

US Classification:

707750, 707776, 706 50

Abstract:

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.

US Patent:

20030154209, Aug 14, 2003

Filed:

Feb 14, 2002

Appl. No.:

10/073934

Inventors:

John Maxwell - Cupertino CA, US

Assignee:

Xerox Corporation - Stamford CT

International Classification:

G06F007/00

US Classification:

707/101000

Abstract:

Systems and methods for solving nogood databases involve generating a representation comprising a plurality of contexted disjunctions, conjoining all of the contented disjunctions to form a conjunction of contexted disjunctions, and storing the representation as the conjunction of contexted disjunctions. Nogoods are eliminated by refining the representation until a result of the conjunction of contexted disjunctions is backtrack-free or the result of the conjunction of contexted disjunctions reduces to false. In various embodiments, the refining is carried out without reordering the disjunctions and/or without merging the disjunctions. In various embodiments, the systems and methods are used for various constraint satisfaction problems, such as syntactic processing of natural language sentences, map coloring, understanding line drawings, electronic circuit analysis, and truth maintenance systems.

US Patent:

20030163301, Aug 28, 2003

Filed:

Sep 27, 2002

Appl. No.:

10/260652

Inventors:

John Maxwell - Cupertino CA, US
Hadar Shemtov - Palo Alto CA, US

Assignee:

Xerox Corporation

International Classification:

G06F017/27

US Classification:

704/009000

Abstract:

A process for generating with unification based grammars such as Lexical Functional Grammars which uses construction and analysis of generation guides to determine internal facts and eliminate incomplete edges prior to constructing a generation chart. The generation guide can then be used in the construction of the generation chart to efficiently generate with unification-based grammars such as Lexical Functional Grammars. The generation guide is an instance of a grammar that has been specialized to the input and only contains those parts of the grammar that are relevant to the input. When the generation guide is analyzed to determine internal facts a smaller generation chart is produced.

US Patent:

20030171913, Sep 11, 2003

Filed:

Sep 27, 2002

Appl. No.:

10/256658

Inventors:

John Maxwell - Cupertino CA, US

Assignee:

Xerox Corporation

International Classification:

G06F017/28

US Classification:

704/004000

Abstract:

A process for generating with unification based grammars such as Lexical Functional Grammars which uses construction and analysis of generation guides to determine internal facts and eliminate incomplete edges prior to constructing a generation chart. The generation guide can then be used in the construction of the generation chart to efficiently generate with unification-based grammars such as Lexical Functional Grammars. The generation guide is an instance of a grammar that has been specialized to the input and only contains those parts of the grammar that are relevant to the input. When the generation guide is analyzed to determine internal facts a smaller generation chart is produced.

US Patent:

20040139060, Jul 15, 2004

Filed:

Jan 9, 2003

Appl. No.:

10/338846

Inventors:

John Maxwell - Cupertino CA, US

International Classification:

G06F007/00

US Classification:

707/003000

Abstract:

Techniques are provided for determining the efficient conjunction of Boolean variables drawn from an and-or forest of choices. The techniques determine two contexts to conjoin, where the contexts consist of choices drawn from an and-or forest of choices. The choices in the first context are marked with a first mark, along with all of their antecedent choices. The choices in the second context are marked with a second mark, along with all of their antecedent choices. The techniques determine and-nodes in the and-or forest having the first mark from a first dependent or-node and the second mark from a second dependent node. The dependent or-nodes are refined and then partitioned into classes based on the presence of the first mark and the second mark, the first mark only, the second mark only, and neither mark. A cross-product of the partitions for each node is determined and the resultant combinations are grouped based on the presence of both the first and second marks, the presence of the first mark only, the presence of the second mark only and presence of neither mark. A new or-node having choices reflecting the combinations having both marks, the first mark only, the second mark only and neither mark is determined. The new or-node represents a transformed and-or forest of choices that is in free-choice form. The first and second nodes in the forest of choices are replaced with an or-node having choices based on the first and second mark. The conjunction of contexts is then determined based on the choice having both the first and second marks.

US Patent:

20050137855, Jun 23, 2005

Filed:

Dec 19, 2003

Appl. No.:

10/739349

Inventors:

John Maxwell - Cupertino CA, US

International Classification:

G06F017/27

US Classification:

704009000

Abstract:

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.

US Patent:

20070250305, Oct 25, 2007

Filed:

Jun 22, 2007

Appl. No.:

11/767138

Inventors:

John Maxwell - Cupertino CA, US

International Classification:

G06F 17/28

US Classification:

704004000

Abstract:

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.