Charles Cox

6496717, Dec 17, 2002

Oct 6, 1999

09/413293

Charles E. Cox - Tampa FL
Emilia L. Dauway - Tampa FL

University of South Florida - Tampa FL

A61B 600

600436, 600 8

A method of removing lesions by implanting a radioactive seed at the location of the lesion, locating the lesion with the radioactive seed, and removing the lesion with the radioactive seed.

6500407, Dec 31, 2002

Apr 29, 2002

10/134800

Charles F. Cox - Fenton MI

Jeffrey S. Cox - Fenton MI

A61K 602

424 49, 4332171, 4332281, 106 35

A method of forming a solution of oxalic acid potassium salt dihydrate, useful for desensitizing dentin, comprising the steps of admixing an effective amount of oxalic acid potassium salt dihydrate in water having a pH of 2. 0-4. 0, heating the solution at a temperature range from 85Â F. to 100Â F. until a suspension is formed, ultrasonically vibrating this suspension for an effective amount of time and frequency to reduce the oxalic acid potassium salt dihydrate to a particle size of 1 to 10 microns.

6345376, Feb 5, 2002

Jul 18, 2000

09/618414

Charles Edwin Cox - San Jose CA
Myron Dale Flickner - San Jose CA
James Lee Hafner - San Jose CA
Martin Aureliano Hassner - Palo Alto CA
Barry Marshall Trager - Yorktown Heights NY
Shmuel Winograd - Scarsdale NY

International Business Machines Corporation - Armonk NY

H03M 1300

714785, 714781

A computationally efficient, machine-implementable method and means for detecting and correcting errors in received codewords on-the-fly within the capacity of a linear cyclic code using ultra-fast error location processing. Each error locator polynomial of degree t over a finite Galois field derived from a codeword syndrome is mapped into a matrix representative of a system of linear simultaneous equations related to the polynomial coefficients. Roots indicative of error locations within the codeword are extracted from the matrix by a modified Gaussian Elimination process for all the roots where t5 and at least one root plus a subset of candidate roots from the finite field for iterative substitution where t 5. Corrected values are separately determined and correction is secured by logically combining the corrected values with the codeword values in error at the error locations represented by the roots.

6582680, Jun 24, 2003

Apr 29, 2002

10/134867

Charles F. Cox - Fenton MI

Jeffrey S. Cox - Fenton MI

A61K 716

424 49, 433215

A method of forming a solution of oxalic acid potassium salt dihydrate, useful for desensitizing dentin, comprising the steps of admixing an effective amount of oxalic acid potassium salt dihydrate in water having a pH of 2. 0-4. 0, heating the solution at a temperature range from 85Â F. to 100Â F. until a suspension is formed, ultrasonically vibrating this suspension for an effective amount of time and frequency to reduce the oxalic acid potassium salt dihydrate to a particle size of 1 to 10 microns.

6671850, Dec 30, 2003

May 1, 2000

09/562575

Charles Edwin Cox - San Jose CA
Martin Aureliano Hassner - Mountain View CA
Barry Marshall Trager - Yorktown Heights NY
Shmuel Winograd - Scarsdale NY

International Business Machines Corporation - Armonk NY

H03M 1300

714781, 714764, 360 48, 708492

An on-the-fly algebraic error correction system and corresponding method for reducing error location search are presented. The method transforms an error locator polynomial into two transformed polynomials whose roots are elements in a smaller subfield, in order to significantly simplify the complexity, and to reduce the latency of the error correcting system hardware implementation. More specifically, if the error locator polynomial is over a finite field of (2 ) elements, the transformed polynomial is over a finite subfield of (2 ) elements. Thus, the problem of locating the roots of the error locator polynomial is reduced to locating the roots of the transformed polynomials. Assuming the error locator polynomial is of degree m, the present method requires at most (m /2) evaluations of polynomials over the Galois field GF(2 ) and (2 ) evaluations over the subfield GF(2 ) or root finding of two polynomials of at most a degree m over the subfield GF(2 ).

6361319, Mar 26, 2002

Dec 20, 2000

09/742161

Charles E. Cox - Fenton MI

Jeffrey S. Cox - Fenton MI

A61K 600

433215, 4332281, 106 35, 424 49, 424679, 514817, 514818

A method of decreasing the permeabilty of dentin by the application of an effective amount of oxalic acid potassium salt, dihydrate in an aqueous solution at a pH of about 2. 0 to 4. 0 to the dentin.

6768582, Jul 27, 2004

Aug 9, 2002

10/216255

M. Roman Hachkowski - Ridgefield CT
Charles D. Cox - Sandy Hook CT

Goodrich Corporation - Charlotte NC

G02B 2300

359399, 244158 R

A system is disclosed for deploying the petals of a sectored mirror assembly of an optical space telescope, wherein the sectored mirror includes a central hub and a plurality of petals disposed about the periphery of the central hub, and each petal has a petal root independently hinged to the central hub. The system includes a first hinge assembly having a root mount secured to a petal root and a hub mount secured the central hub, whereby the first hinge assembly affords the petal associated therewith freedom of rotation about a petal hinge axis. The system further includes a second hinge assembly including a root mount secured to the petal root and a hub mount secured to the central hub, whereby the second hinge assembly affords the petal associated therewith freedom of rotation about the petal hinge axis and freedom to expand and contract thermally, and move rigidly along the petal hinge axis in a frictionless, unconstrained manner. The system also includes a latch assembly including a clevis secured to the petal root at a location spaced from the hinge axis and a pair of laterally opposed latch mechanism operatively associated with the central hub for engaging the clevis upon rotation of the petal about the hinge axis from a stowed position to a deployed position.

6792569, Sep 14, 2004

Apr 24, 2001

09/842244

Charles Edwin Cox - San Jose CA
Martin Aureliano Hassner - Palo Alto CA
Barry Marshall Trager - Yorktown Heights NY
Shmuel Winograd - Scarsdale NY

International Business Machines Corporation - Armonk NY

H03M 1300

714781

An error correction algebraic decoder uses a key equation solver for calculating the roots of finite field polynomial equations of degree up to six, and lends itself to efficient hardware implementation and low latency direction calculation. The decoder generally uses a two-step process. The first step is the conversion of quintic equations into sextic equations, and the second step is the adoption of an invertible Tschirnhausen transformation to reduce the sextic equations by eliminating the degree 5 term. The application of the Tschirnhausen transformation considerably decreases the complexity of the operations required in the transformation of the polynomial equation into a matrix. The second step defines a specific Gaussian elimination that separates the problem of solving quintic and sextic polynomial equations into a simpler problem of finding roots of a quadratic equation and a quartic equation.