Abstract: A bolt-covering cap which is self-threading and gives little resistance when being threaded onto a bolt but greater resistance when being unthreaded, providing for easy installation, a tight and secure fit resistant to inadvertent loosening, and intentional removal when needed. The bolt-covering cap provides a cover shell and three angled blades which slightly deflect in one direction, requiring less turning force, and which resist deflection in the opposite direction, requiring more turning force and resisting inadvertent loosening.

Abstract: A bolt-covering cap which is self-threading and gives little resistance when being threaded onto a bolt but greater resistance when being unthreaded, providing for easy installation, a tight and secure fit resistant to inadvertent loosening, and intentional removal when needed. The bolt-covering cap provides a cover shell and three angled blades which slightly deflect in one direction, requiring less turning force, and which resist deflection in the opposite direction, requiring more turning force and resisting inadvertent loosening.

Abstract: A data structure and its characteristics, and an associated process for searching the structure in a manner that ensures that each node or data location is traversed regardless of which node is the starting point of the traversal process. An embodiment of the invention may be used to locate a node of a data structure so that it may be processed or otherwise manipulated, such as by eliminating a node, moving a node, processing the data associated with a node, etc. In some embodiments, a combination of a “loosely associated” data structure and a specified method of traversing the data structure provide an efficient way to structure and administer a database, and provide a scalable and computationally efficient solution to the problems posed by conventional and more “tightly associated” structures.

Abstract: A data structure and its characteristics, and an associated process for searching the structure in a manner that ensures that each node or data location is traversed regardless of which node is the starting point of the traversal process. An embodiment of the invention may be used to locate a node of a data structure so that it may be processed or otherwise manipulated, such as by eliminating a node, moving a node, processing the data associated with a node, etc. In some embodiments, a combination of a “loosely associated” data structure and a specified method of traversing the data structure provide an efficient way to structure and administer a database, and provide a scalable and computationally efficient solution to the problems posed by conventional and more “tightly associated” structures.