Michael R Ott

US Patent:

6384279, May 7, 2002

Filed:

Aug 30, 2001

Appl. No.:

09/943536

Inventors:

James E. Deline - Livermore CA
Michael M. Ott - Oakland CA

Assignee:

The Clorox Company - Oakland CA

International Classification:

C07C23102

US Classification:

564142, 564143, 564155, 564159, 564160, 562408, 562409, 562418, 562538, 562565

Abstract:

A new composition of matter for a diamidodiol and a method for preparing the diamidodiol. The exemplary diamidodiol has the formula C H N O and is prepared by reacting a first quantity of 2-amino-2-methyl-1-propanol with a second quantity of a di-substituted malonyl dichloride (i. e. , diethylmalonyl dichloride), preferably in ethyl acetate as solvent. A tetraamido macrocycle is prepared from the diamidodiol in two steps by oxidizing the diamidodiol to form a diacid followed by coupling using a known procedure of the diacid with an aryl diamine (e. g. , 1,2-diaminobenzene) to yield the tetraamido macrocycle.

US Patent:

6598066, Jul 22, 2003

Filed:

May 23, 2000

Appl. No.:

09/577211

Inventors:

Michael L. Ott - Pleasanton CA

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06F 750

US Classification:

708710

Abstract:

A carry-out bit generator determines if a bit pattern from two positive numbers matches one of the patterns for which a carry-out bit would be generated in addition. These patterns include a T G pattern and a T pattern (with a carry-in). Superscript n represents a number between zero and m-1, superscript m represents the number of registers, T represents a 0/1 or 1/0 pair and G represents a 1/1 pair.

US Patent:

6654775, Nov 25, 2003

Filed:

Feb 23, 2000

Appl. No.:

09/511218

Inventors:

Michael L. Ott - Pleasanton CA

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06F 700

US Classification:

708211

Abstract:

An optimized system and method for a parallel leading zero anticipation which ascertains âend of runâ patterns in parallel. A string representing the operands of the floating-point addition is divided into nibbles of predetermined bit length (normally 4 bits). Each nibble is analyzed for the end of run patterns and the results from this analysis determine whether a run of leading zeros or ones has ended within the nibble, and if there has been an end of run, the location (bit) of the end of run. The highest order nibble that has an end of run provides the higher order bits in the LZA (leading zero anticipator output) value, while the lower two bits of the LZA value are correlated from the location end of run within the nibble, as previously determined.

US Patent:

6742105, May 25, 2004

Filed:

Dec 22, 2000

Appl. No.:

09/748052

Inventors:

Michael L. Ott - Pleasanton CA

Assignee:

Silicon Access Networks - San Jose CA

International Classification:

G06F 1200

US Classification:

711220, 711 5, 711173, 711216

Abstract:

A range match circuit is disclosed for fast compare of an incoming address by partitioning the incoming address into fields. In one embodiment, a 16-bit incoming address is divided into quarterly fields, or four segments of 4-bit addresses, for comparison with a 16-bit top end boundary that has been divided into quarterly fields and a 16-bit bottom end boundary that has been divided into quarterly fields. Consequently, the range match circuit is able to analyze the entire 16-bit address field in parallel and perform simple combinational logic to determine if the incoming address is within the boundaries described by the top edge and bottom edge of the range.

US Patent:

6769005, Jul 27, 2004

Filed:

Feb 13, 2001

Appl. No.:

09/782637

Inventors:

Michael Ott - Pleasanton CA

Assignee:

Silicon Access Networks - San Jose CA

International Classification:

G06F 1500

US Classification:

708207

Abstract:

A method and apparatus for resolving priority among a plurality of data values. The priority resolution method of the invention analyzes the data values one bit at a time, starting from the most significant bit. In one embodiment, at an initial analysis step, the method determines whether the most significant bits of the data values are asserted. If at least one of the most significant bits is asserted, the data values that have unasserted most significant bits are eliminated from consideration. If none of the most significant bits is asserted, none of the data values will be eliminated at the initial step. The same analysis steps are repeated for each successive bit until only the largest data values remain. The priority resolution method of the present invention may be used to determine the smallest data value. In that embodiment, the data values are first bit-wise inverted.

US Patent:

6957238, Oct 18, 2005

Filed:

Feb 23, 2001

Appl. No.:

09/792599

Inventors:

Michael L. Ott - Pleasanton CA, US

Assignee:

Altera Corporation - San Jose CA

International Classification:

G06F015/00

US Classification:

708211, 710 40

Abstract:

The present invention provides a method and system to select a valid entry in a deterministic pseudo-random approach. The method may randomly select one of numerous valid entries in order to ensure that no specific entry or set of entries is consistently ignored. Moreover, the method may be deterministic in order that the selection technique could be precisely controlled for purposes such as testing and predetermined selection. The method of the present invention may be carried out in five parts: first, the total range of entries is divided into regions, each of which is further divided into one or more sub-regions; pre-determined or constantly-changing weighting is assigned to each region in the second step; an OR operation is then performed on the entries of each sub-region to determine which of the sub-regions, if any, contains no valid entries and thus may be disregarded in the final step; the weightings assigned in step two are examined in order to select a sub-region from a region where more than one sub-region contains valid entries. Furthermore, the final step combines the original entry's signal with the appropriate collection of ignore signals, and effectively selects one entry as the final output.

US Patent:

7638474, Dec 29, 2009

Filed:

Aug 5, 2008

Appl. No.:

12/185975

Inventors:

Bryan Parrish - Pleasanton CA, US
Sumi Cate - Oakland CA, US
Sarah Coulter - Pleasanton CA, US
Aram Garabedian - Fremont CA, US
Michael Ott - Oakland CA, US
James Siacunco - Dublin CA, US
Alex Tipton - Pleasanton CA, US

Assignee:

The Clorox Company - Oakland CA

International Classification:

C11D 17/00
C11D 3/395
C01B 15/00
C01B 15/12

US Classification:

510276, 510302, 510309, 510376, 510375, 510378, 510495, 25218627, 2521863, 25218643, 25218628

Abstract:

A laundry detergent composition with a limited number of natural ingredients containing a hydrogen peroxide source, sodium carbonate and a surfactant selected from a fatty alcohol sulfate, alkyl polyglucoside and a lauryl sarcosinate. The laundry composition optionally has a fragrance, colored speckles, builder and enzymes. The laundry detergent composition can be used to clean tough stains on fabrics and cleans as well or better than commercial compositions containing synthetically derived cleaning agents.

US Patent:

62974009, Oct 2, 2001

Filed:

Jul 2, 1999

Appl. No.:

9/347435

Inventors:

James E. Deline - Livermore CA
Michael M. Ott - Oakland CA

Assignee:

The Clorox Company - Oakland CA

International Classification:

C07C23303

US Classification:

564160

Abstract:

A new composition of matter for a diamidodiol and a method for preparing the diamidodiol. The exemplary diamidodiol has the formula C. sub. 15 H. sub. 30 N. sub. 2 O. sub. 4 and is prepared by reacting a first quantity of 2-amino-2-methyl-1-propanol with a second quantity of a di-substituted malonyl dichloride (i. e. , diethylmalonyl dichloride), preferably in ethyl acetate as solvent. A tetraamido macrocycle is prepared from the diamidodiol in two steps by oxidizing the diamidodiol to form a diacid followed by coupling using a known procedure of the diacid with an aryl diamine (e. g. , 1,2-diaminobenzene)to yield the tetraamido macrocycle.