Abstract: A shaped toy includes a kinetically resilient central core and an outer layer of varying thickness covering the central core. The outer layer may be a material which also exhibits kinetic resiliency, to a degree more or less than that of the core, or, alternatively, be substantially non-resilient, such as fabric or pile. In a preferred embodiment, the toy includes a substantially spherically shaped core, covered by an outer layer of fabric, the type used for fabrication of conventional plush stuffed toys, increasing its appeal, by virtue of appearance and feel, to user and animal alike. The fabric, when stitched together using conventional stuffed animal sewing techniques, encloses the resilient central core, and presents regions of varying thickness over an expanse thereof, such that when thrown against a surface, unpredictable direction and bounce response will result by virtue irregular surface curvature and damping due to increasing and decreasing fabric thickness.

Abstract: A computerized system and method for viewing a set of voxel data on a display device attached to a computer is disclosed. In one embodiment of the invention, the computerized system has a number of different components. A retrieve data set component retrieves the set of voxel data, the set of voxel data having already been acquired in accordance with acquisition parameters of a protocol. A protocol selector component selects the protocol in accordance with the set of voxel data retrieved, the protocol including preset adjustments for the volume-rendering of the data. An image gallery component displays one or more images of the set of voxel data in accordance with the preset adjustments of the protocol. An examination viewer component permits the changing of the preset adjustments of the protocol as to a particular image selected. within the image gallery component. A report generator and viewer component generates a report based on snap shots of images taken within the examination viewer component.

Abstract: Variable length data (e.g., for hospital patients) is embedded in a B-tree type index structure of a relational data base. A logically related inverted B-tree index is used to access the original index. Access time, and storage space for the inverted lists, are decreased by data compression techniques and by encoding certain inverted list parameters in sparse array bit maps.