Abstract: The present invention is directed to methods of making nanofiber yarns. In some embodiments, the nanotube yarns comprise carbon nanotubes. Particularly, such carbon nanotube yarns of the present invention provide unique properties and property combinations such as extreme toughness, resistance to failure at knots, high electrical and thermal conductivities, high absorption of energy that occurs reversibly, up to 13% strain-to-failure compared with the few percent strain-to-failure of other fibers with similar toughness, very high resistance to creep, retention of strength even when heated in air at 450° C. for one hour, and very high radiation and UV resistance, even when irradiated in air.

Abstract: A digital camera docking system user interface provides, on the display of the digital camera, information regarding the operation of the digital camera docking system. The user interface may guide the user in the initiation of interactions between the digital camera and external devices such as television monitors, personal computers, and printers and may also provide feedback regarding the progress of these interactions.

Abstract: Methods identifying prostate cancer, methods for prognosing and diagnosing prostate cancer, methods for identifying a compound that modulates prostate cancer development, methods for determining the efficacy of a prostate cancer therapy, and oligonucleotide microarrays containing probes for genes involved in prostate cancer development are described.

Abstract: Methods identifying prostate cancer, methods for prognosing and diagnosing prostate cancer, methods for identifying a compound that modulates prostate cancer development, methods for determining the efficacy of a prostate cancer therapy, and oligonucleotide microarrays containing probes for genes involved in prostate cancer development are described.

Abstract: A textile machine segment including a first or main roller (12) adapted to support and convey a travelling fibre web, associated second (16) and third (14) rollers cooperable with each other and at respective nips (24, 25) with the first roller as the three rollers rotate, to open the web and detach a mat of fibre tufts at the nip (25) between the first and second rollers and to return the tufts to the first roller at the nip (24) between the first and third rollers, and drive means (100) for rotating the rollers, wherein the drive means is arranged to rotate the second roller in a rotational direction that is the same as that of the first roller and opposite that of the third roller.

Abstract: In a database, a database manager can generate a view, which, in concept, is a subset of the database, which is placed outside the database for use without disturbing the database, and without disturbance by others using the database. The subset, or view, can be understood as a collection of rows, or tuples, of data copied from the database. With views existing, multiple copies of data within the database now exist: the original in the database, and copies in the views. If one of these is changed, without corresponding changes made in the others, then inconsistencies occur, which cannot be tolerated. Under the invention, when a user seeks a lock on a view, indicating that a change may be imminent, the invention locks a superset of the tuples in the database from which the view is derived. A superset is a set which contains the set of tuples of the view, plus possibly others. Thus, more tuples are locked than strictly necessary. The excess locking is tolerated because other benefits are obtained.

Abstract: A game using one die, a dice cup, a point marker, and a game board is disclosed. The game is similar to Craps. There is a come-out roll. If a six is rolled the player is paid, if a one is rolled the player loses. Any other number becomes the point. Three chances are given to roll the point again. If the point is rolled on the first opportunity, the player is paid two-to-one. If the point is rolled on the second or third opportunity, the player is paid one-to-one. If the point is not rolled in three tries, the player loses. If a one is rolled while trying to roll the point, the player also loses.

Abstract: A system and method for employing associative memory for the storing the data of a relational database. The system and method of the present invention optionally include additional hardware components in order for the Associative memory to be usable for the relational database, as CAM (content associated memory).

Abstract: A textile machine segment including a first or main roller (12) adapted to support and convey a travelling fibre web, associated second (16) and third (14) rollers co-operable with each other and at respective nips (24, 25) with the first roller as the three rollers rotate, to open the web and detach a mat of fibre tufts at the nip (25) between the first and second rollers and to return the tufts to the first roller at the nip (24) between the first and third rollers, and drive means (100) for rotating the rollers, wherein the drive means is arranged to rotate the second roller in a rotational direction that is the same as that of the first roller and opposite that of the third roller.

Abstract: A digital camera docking system user interface provides, on the display of the digital camera, information regarding the operation of the digital camera docking system. The user interface may guide the user in the initiation of interactions between the digital camera and external devices such as television monitors, personal computers, and printers and may also provide feedback regarding the progress of these interactions.

Abstract: A hitching arm for a graff harvester comprising a rigid elongated element having two opposite ends for connection, respectively, to the graff harvester and to a propulsion device, wherein the arm has upwardly extending sections extending from each opposite end towards a centre of the hitching arm, and an elevated centre section. The shape of the arm allows the arm to pull a harvesting unit having a cutter head at the front extend over the cutter head.

Abstract: Cache sensitive search tree (CSS-tree) index structures for providing improved search and lookup performance compared with conventional searching schemes. The CSS-tree index structures include a directory tree structure which is stored in an array (216) and serves as an index for a sorted array of elements. The nodes (215) in the directory tree structure may be of sizes selected to correspond to the cache line size in the computer system utilizing the CSS-tree index structures. Child nodes (213) within the directory tree structure are located by performing arithmetic operations on array offsets. Thus, it is not necessary to store internal child node pointers, thereby reducing memory storage requirements. In addition, the CSS-tree index structures are organized so that traversing each level in the tree yields good data reference locality, and therefore relatively few cache misses.

Abstract: Card clothing comprises a strip of profile wire having a plurality of longitudinally aligned teeth (110) with respective overhanging tips (111). The edge-face (112) of each tooth under the overhanging tip includes at least one undercut edge-segment (114) spaced along the edge-face from the tip. This undercut edge-segment increases the retention of fibres by the edge-face during carding.

Abstract: Improved polyurethane containing systems and articles, and process for making the same.

Abstract: Improved polyurethane containing systems and articles, and process for making the same.

Abstract: In a database, a database manager can generate a view, which can be considered as a subset of the database, and which is placed outside the database for use without disturbing the database. However, if the database changes, the views will not reflect those changes, because the views are separate from the database. To solve this problem, a process called “refreshing” keeps the views consistent with the data within the database. But different refreshing approaches are used: some views require immediate refreshing when the database changes, other types can be refreshed at later times, and still other types can be refreshed at different times and intervals. The invention presents a system which keeps data consistent among the views and the database, despite the different times of refreshing undertaken.

Abstract: A method of incrementally maintaining a first materialized view of data in a database, by means of an additional materialized view, first determines whether a cost in time of incrementally maintaining the first materialized view with the additional materialized view is less than the cost of incrementally maintaining the first materialized view without the additional materialized view. The method creates the additional materialized view only if the cost in time is less therewith. Determining whether the cost of employing an additional materialized view is less includes using an expression directed acyclic graph that corresponds to the first materialized view. Another method of determining whether the cost is less includes pruning an expression directed acyclic graph to produce a single expression tree, and using the single expression tree to determine whether the cost is less. Both the expression directed acyclic graph and the single expression tree contain equivalence nodes.

Abstract: The present boot rack assembly comprises a base member designed to extend along the bottom of a pickup truck bed, a boot receiving prong perpendicularly attached to the base member, a top member disposed parallel to the base member and designed to extend along the upper lip of a truck bed side wall, and a support member extending perpendicularly between and attached to the base member and the top member.

Abstract: A method and apparatus of calculating data cubes is shown in which a data set is partitioned into memory sized data fragments and cuboid tuples are calculated from the data fragments. A search lattice of the data cube is used as a basis for ordering calculations of lower dimensional cuboids in the data cube. Identification of a minimum number of paths through the lattice that is sufficient to traverse all nodes in the lattice is achieved by iteratively duplicating twice all paths in a lower dimensional space, distributing a new attribute to the first duplicate, moving end points from paths of the second duplicate to a corresponding path in the first duplicate and merging the first and second duplicates.

Abstract: A technique for efficiently joining multiple large tables in a database system which utilizes a join index. The technique uses a join index and minimizes the number of input/output operations while maximizing the use of the small main memory through a buffer allocation process based on the join index entries. The technique uses multi-dimensional partitioning and assigns partition identifiers to each buffer which are used to coordinate the resultant output files when the technique is complete. The output is vertically fragmented with one fragment for each input table which further allows the individual processing of each input table. The technique performs self-joins in a very efficient manner by requiring the records of the input table to be read only once.