Abstract: A shooting string apparatus used in playing the sport of lacrosse. The apparatus is located in the head of a lacrosse stick during the play of the game of lacrosse. During lacrosse play, a player may find it advantageous to use this invention in the making of easy and rapid adjustments to the tensions of the webbing in the area of shooting string apparatus. There may be one or several shooting string apparatus in use simultaneously. In this invention, the shooting string apparatus is constructed with a flat central piece called the shooting string section. Affixed to the shooting section are a series of flaps or opposed flaps that fold over and hold the shooting string in place within the stick head. A tension string may be encompassed by but does not attach to and does not extend internally through the shooting string section. The shooting string section does not itself exert tension on the webbing.

Abstract: An apparatus used in playing the sport of lacrosse. The apparatus is located in a lacrosse player's stick head. During lacrosse play, a player may find it advantageous to use this invention to finely adjust the lengths and tensions of the thongs or netting material of the lacrosse stick head. In addition, this invention relates to the shooting string apparatus located in the head of a lacrosse stick and its adjustment. In this invention, the shooting string apparatus is constructed with a flat central piece called the shooting string section and a tension adjustment device. Affixed to the shooting section are a series of opposed flaps that fold over and hold the shooting string in place within the stick head. A tension string is connected to or through the shooting string section. The tension on the shooting string section may be easily and rapidly adjusted by controlling the length of the tension string by operating a finely continuously adjustable locking mechanism.

Abstract: A computer system and method for storing and managing a database that has lambda-definable functions as its foundation. The database is a collection of nodes that are connected by a set of links, and further it is a directed acyclic graph constructed from the nodes and the links. There are two types of links. By ignoring one type of the links, the database can be viewed as a set of trees; and by ignoring another type of the links, the database can be viewed as another set of trees. The directed acyclic graph and the two sets of trees illustrate the dependent relationships among the data and provide means in manipulating the database. A node has a name for the purpose of identification; and a value that carries an unit of meanings of the database application. The value of a node is selected from a regular data type, user-defined data type, and lambda-definable functions. Managing lambda-definable functions allows a database to support infinite data with finite storage.