Steven A Fisher

US Patent:

20040046126, Mar 11, 2004

Filed:

Aug 13, 2003

Appl. No.:

10/640151

Inventors:

Steven Fisher - Hayward CA, US
Darrell Gourley - San Francisco CA, US
Patricia Cormia - San Jose CA, US
James Bertsch - Palo Alto CA, US

International Classification:

H01J049/10

US Classification:

250/42300P

Abstract:

An atmospheric pressure ion source, e.g. for a mass spectrometer, that produces ions by atmospheric pressure photoionization (APPI). It includes a vaporizer, a photon source for photoionizing vapor molecules upon exit from the vaporizer, a passageway for transporting ions to, for example, a mass spectrometer system, and a means for directing the ions into the passageway. The center axis of the vaporizer and the center axis of the passageway form an angle that may be about 90 degrees. Included in the invention is a method for creating ions by atmospheric pressure photoionization along an axis and directing them into a passageway oriented at an angle to that axis.

US Patent:

46726098, Jun 9, 1987

Filed:

Mar 28, 1986

Appl. No.:

6/846463

Inventors:

Richard A. Humphrey - Sunnyvale CA
Steven D. Fisher - San Mateo CA
Steven W. Wierenga - Sunnyvale CA
Jon Sjostedt - San Francisco CA

Assignee:

Tandem Computers Incorporated - Cupertino CA

International Classification:

G11C 2900
G06F 1130

US Classification:

371 21

Abstract:

A memory system for a computer detects data errors, address errors and operation errors to increase the reliability of data stored in the memory system. Address errors are detected by encoding address parity information into the data check field of each memory location. A signal is generated in each memory module indicating the status of operations of that memory module and is transmitted to the processor subsystem of the computer for comparison with a signal indicating the status of operations of the processor subsystem to insure that all memory modules and the memory control in the processor are receiving the same commands.

US Patent:

46672877, May 19, 1987

Filed:

Oct 28, 1982

Appl. No.:

6/437399

Inventors:

James C. Allen - San Jose CA
Wendy B. Bartlett - Los Altos CA
Hoke S. Johnson - San Jose CA
Steven D. Fisher - San Mateo CA
Richard O. Larson - Fremont CA
John C. Peck - Mountain View CA

Assignee:

Tandem Computers Incorporated - Cupertino CA

International Classification:

G06F 1338
G06F 1516

US Classification:

364200

Abstract:

A plurality of multiprocessor systems is arranged in a high speed network to allow any processor in one system to communicate with any processor in another system. The network is configured as a multi-node dual bidirectional ring having a multiprocessor system at each node. Packets of information may be passed around the ring in either of two directions and are temporarily stored in buffer memory locations dedicated to a selected destination processor in a selected direction between each successive transfer between neighboring nodes. The buffer locations are managed so that they can request an adjacent node to stop transmitting packets if the buffer is becoming full from that direction and request resumption of transmission of packets as the buffer empties.

US Patent:

46637060, May 5, 1987

Filed:

Oct 14, 1983

Appl. No.:

6/542187

Inventors:

James C. Allen - San Jose CA
Wendy B. Bartlett - Los Altos CA
Hoke S. Johnson - San Jose CA
Steven D. Fisher - Belmont MA
Richard O. Larson - Fremont CA
John C. Peck - Mountain View CA

Assignee:

Tandem Computers Incorporated - Cupertino CA

International Classification:

G06F 1338
G06F 1516

US Classification:

364200

Abstract:

A plurality of multiprocessor systems is arranged in a high speed network to allow any processor in one system to communicate with any processor in another system. The network may be configured as a multi-node dual bidirectional ring having a multiprocessor system at each node. Packets of information may be passed around the ring in either of two directions and are temporarily stored in buffer memory locations dedicated to a selected destination processor in a selected direction between each successive transfer between neighboring nodes. The buffer locations are managed so that a node can request an adjacent node to stop transmitting packets if the buffer is becoming full from that direction and request resumption of transmission of packets as the buffer empties.