Abstract: This is a computer-implemented method for accessing and updating data in a database that preserves relationships among data, including derived data. Data need not be stored in a tabular form. The method incorporates and integrates membership abstractions, relation predicates, and logical predicates of data with relationships among data so as too avoid update and other errors and to translate among logical representations, symbolic abstractions, and physical representations.

Abstract: This is a computer-implemented method for managing translating among, and understanding multiple representations and storage structures of data by accessing and updating physical storage through a relational representation. The present invention supports both data independence and automatic derivation of descriptions of data representations by manipulating membership abstractions in the logical representation, while the prior art is restricted to user-supplied denotations and catalog entries.

Abstract: This is a method for accessing and updating views and other relations of a relational database that: (1) does not require any distinction between base and derived expressions of the data elements; (2) provides data independence; (3) ensures predictable behavior of all updates; and, (4) provides uniformity for all updates independent of data source or type. The method further permits updating of all relations (both base and derived) without unnecessary duplication, overlap, or the creation of null elements, and without using unnecessary physical memory for the resulting data elements.

Abstract: This is a method for managing and optimizing transaction processing that: (1) significantly expands the robustness of systems with respect to consistency, reliability, and recoverability; (2) provides multiple performance improvements over traditional methods; (3) enables transactions in a distributed business process to recover from errors without the cost of two-phase commit; (4) enables enhancements to resource management; and, (5) provides improved scheduling. The method further enables a high degree of collaborative and adaptive transaction management over traditional transaction managers.

Abstract: This is a computer software architecture and method for managing data transformation, normalization, profiling, cleansing, and validation. In the preferred embodiment, the architecture and method includes seven integrated functional elements: Dispatcher to route data and metadata among system elements; Semantic Modeler to build semantic models; Model Mapper to associate related concepts between semantic models; Transformation Manager to capture transformation rules and apply them to data driven by maps between semantic models; Validation Manager to capture data constraints and apply them to data; Interactive Guides to assist the processes of semantic modeling and semantic model mapping; and Adapters to convert data to and from specialized formats and protocols.

Abstract: This is a method for managing and optimizing transaction processing that: (1) significantly expands the robustness of systems with respect to consistency, reliability, and recoverability; (2) provides multiple performance improvements over traditional methods; (3) enables transactions in a distributed business process to recover from errors without the cost of two-phase commit; (4) enables enhancements to resource management; and, (5) provides improved scheduling. The method further enables a high degree of collaborative and adaptive transaction management over traditional transaction managers.

Abstract: This is a method for accessing and updating views and other relations of a relational database that: (1) does not require any distinction between base and derived expressions of the data elements; (2) provides data independence; (3) ensures predictable behavior of all updates; and, (4) provides uniformity for all updates independent of data source or type. The method further permits updating of all relations (both base and derived) without unnecessary duplication, overlap, or the creation of null elements, and without using unnecessary physical memory for the resulting data elements.

Abstract: A puzzle using Moebius topology and three-dimensional construction to make solution more challenging by preventing the player from seeing all possible layouts at any one time. The preferred embodiment of the puzzle challenges players to solve a maze when part of the maze will always be concealed by the current viewing surface, as the internal and external surface are both contiguous and identical.

Abstract: A method for creating one or more footwear soles that will print out with each step on a malleable surface (such as sand) or an imprintable surface (such as a sidewalk) a pattern (which may include therein an image, text, and their combination), wherein the pattern to be printed is personalized to each sole's individual owner according to the owner's specification of the pattern.

Abstract: A cable connector crimping apparatus is disclosed for use in combination with a standard vise or the like including means for positioning the apparatus on the front surface of one of the jaws of the vise, stop means for preventing the closure of the vise beyond a certain point so as to protect the connector from damage once the crimping of the connector has been completed, and including secondary spacing means for insuring that pins extending from the connector are also not damaged during the crimping of the cable onto the connector.