John R Lazarus, Age 78Indian Wells, CA

6563494, May 13, 2003

Oct 8, 1998

09/168854

Matthias Eichstaedt - San Jose CA
John Pete Lazarus - San Jose CA
Qi Lu - San Jose CA

International Business Machines Corporation - Armonk NY

G09G 500

345179, 382313

A stylus includes a wireless transceiver, a processor controlling the transceiver, and a data storage device. Data can be selected on a first computer such as a first personal digital assistant (PDA) and then transmitted via wireless link to the stylus, when the user manipulates a button on the stylus to signal to the operating system of the first PDA that it is ready to receive data. The data is transmitted to the stylus and stored therein. Then, the stylus is aimed at a second PDA and the button is manipulated to cause the stylus to transmit the data to the second PDA via wireless link. With this invention, users of the PDAs can, e. g. , quickly and efficiently exchange business cards electronically, without excessive manual data entry and without resorting to connecting their PDAs to a network.

5412384, May 2, 1995

Aug 10, 1994

8/288675

Chung-Chia Chang - San Jose CA
Gregory L. Davoll - Los Gatos CA
Mohamed H. El-Ruby - San Jose CA
Craig A. Friske - San Jose CA
Balakrishna R. Iyer - San Jose CA
John P. Lazarus - San Jose CA
David Wilhite - Los Angeles CA
Kenneth E. Plambeck - Poughkeepsie NY

International Business Machines Corporation - Armonk NY

H03M 738

341 79

A system for creating a static data compression dictionary adapted to a hardware-based data compression architecture. A static Ziv-Lempel dictionary is created and stored in memory for use in compressing database records. No data compression occurs during dictionary construction. A fixed-size Ziv-Lempel parse-tree is adapted to database characteristics in one of two alternate ways. First, the parse-tree is overbuilt substantially and then pruned back to a static size by eliminating the least recently used (LRU) nodes having the lowest use count. Alternatively, the parse-tree is built to a static size and thereafter selected nodes are replaced with new nodes upon database sampling. This node recycling procedure chooses the least-useful nodes for replacement according to a use count and LRU strategy while exhausting the database sample. The pruned Ziv-Lempel parse-tree is then transformed to a static dictionary configuration and stored in memory for use in a hardware-based database compression procedure. Completion of the static dictionary before starting data compression eliminates the initial compression inefficiencies well-known for the Ziv-Lempel procedure.

5534861, Jul 9, 1996

Mar 8, 1995

8/400683

Chung-Chia Chang - San Jose CA
Gregory L. Davoll - Los Gatos CA
Mohamed H. El-Ruby - San Jose CA
Craig A. Friske - San Jose CA
Balakrishna R. Iyer - San Jose CA
John P. Lazarus - San Jose CA
David Wilhite - Los Angeles CA
Kenneth E. Plambeck - Poughkeepsie NY

International Business Machines Corporation - Armonk NY

H03M 738

341 79

A system for creating a static data compression dictionary adapted to a hardware-based data compression architecture. A static Ziv-Lempel dictionary is created and stored in memory for use in compressing database records. No data compression occurs during dictionary construction. A fixed-size Ziv-Lempel parse-tree is adapted to database characteristics in one of two alternate ways. First, the parse-tree is overbuilt substantially and then pruned back to a static size by eliminating the least recently used (LRU) nodes having the lowest use count. Alternatively, the parse-tree is built to a static size and thereafter selected nodes are replaced with new nodes upon database sampling. This node recycling procedure chooses the least-useful nodes for replacement according to a use count and LRU strategy while exhausting the database sample. The pruned Ziv-Lempel parse-tree is then transformed to a static dictionary configuration and stored in memory for use in a hardware-based database compression procedure. Completion of the static dictionary before starting data compression eliminates the initial compression inefficiencies well-known for the Ziv-Lempel procedure.