Edward Y Cheng

US Patent:

20130053814, Feb 28, 2013

Filed:

Jan 18, 2011

Appl. No.:

13/522481

Inventors:

Kevin Prosise - Benicia CA, US
Edward Cheng - San Francisco CA, US
Peter Kramer - Berkeley CA, US
Patrick Ryan - West Hollywood CA, US
Andrew Coats - Sommerville MA, US
Robert Dyer - Concord MA, US

Assignee:

Bayer HealthCare LLC - Tarrytown NY

International Classification:

A61J 1/20

US Classification:

604414

Abstract:

The present application is directed to devices. The device may used for connecting a closed receptacle and a container, such as a syringe.

US Patent:

60675489, May 23, 2000

Filed:

Jul 16, 1998

Appl. No.:

9/116521

Inventors:

Edward C. Cheng - South San Francisco CA

Assignee:

e Guanxi, Inc. - San Mateo CA

International Classification:

G06F 1730

US Classification:

707103

Abstract:

The present invention provides a dynamic organizational database as an underlying information system to support collaborative computing in a global enterprise. This information system is built based on the Organizational Modeling and Management model (OMM) and provides a system architecture and a graphical user interface for easy manipulation of organizational objects. Contrary to traditional approaches, the present invention separates the organization model from the process model, the application model and the data model. Thus, independent and flexible enterprise modeling and design is allowed to reflect more realistically a rapidly changing business environment.

US Patent:

52049582, Apr 20, 1993

Filed:

Jun 27, 1991

Appl. No.:

7/722007

Inventors:

Edward C. Cheng - South San Francisco CA
Dieter Gawlick - Palo Alto CA
Patrick E. O'Neil - Lexington MA

Assignee:

Digital Equipment Corporation - Maynard MA

International Classification:

G06F 15413

US Classification:

395600

Abstract:

A database index file is maintained by a computer system having primary random access memory and secondary memory. A record for each item added to the database is stored in a sequential file in secondary memory (disk storage) and an indexed pointer to the new record is stored in a small B-tree stored in primary random access memory. The full index file for the database is a second, large B-tree stored in secondary memory. Leaf-nodes of the full index file are stored in indexed order. Periodically, a portion of the memory resident small B-tree is merged with a corresponding portion of the large B-tree by selecting a range of index values and retrieving from secondary memory all indexed pointers in the selected range of index values. The indexed pointers in the first B-tree in the selected range of index values are merged into the retrieved records, the resulting merged set of indexed pointers are stored in secondary memory in indexed order in a contiguous area of secondary memory. As a result, the indexed pointers for newly added database records are written to secondary memory in batches, thereby accessing secondary memory very efficiently.