Abstract: The present invention relates generally to the field of tables. More specifically, the present invention relates to an attachable table device. The device is primarily comprised of a first half, a second half and at least one connection mechanism. Each half is further preferably semi-circular and is comprised of an inside surface with at least one partial opening. At least one connection mechanism can further be inserted into each opening, wherein both halves can be pressed together after being secured around a heater or other similar structure of the like. As a result, the device is secured at a constant height and can be used as a table, wherein users can then congregate around the heater.

Abstract: A computer-implemented method of providing unique identification information for an element in a tree data structure where the element does not have an independent, unique identifier associated therewith by which it can be identified without reference to any further element. The method comprises determining (130) identification information uniquely identifying an element in a structure model, by reference to another element in the structure having a unique identifier associated therewith by which the other element can be uniquely identified without reference to any further element in the structure. The unique identification information comprises a unique identifier of the other element by which said other element can be uniquely identified in the structure without reference to any further element in the structure, and path information uniquely identifying the element in the structure relative to the other element.

Abstract: A method comprises: sending at a server to one or more user devices first data and group of first hashes, the group comprising a subset of first hashes stored in a hash store. Each first hash is stored in association with a respective first data portion. The server subsequently receives from each user device one or more second hashes and second data. The first data has been modified at the user device and the second data comprises the modified first data excluding one or more second data portions from which each second hash can be hashed. For each second hash, an indication that the second hash has been received with the matching, is then associated with the stored first hash. Based on the indications, the group is updated to comprises first hashes that are more likely to be received than the first hashes not in the group.

Abstract: A computer-implemented method of providing unique identification information for an element in a tree data structure where the element does not have an independent, unique identifier associated therewith by which it can be identified without reference to any further element. The method comprises determining (130) identification information uniquely identifying an element in a structure model, by reference to another element in the structure having a unique identifier associated therewith by which the other element can be uniquely identified without reference to any further element in the structure. The unique identification information comprises a unique identifier of the other element by which said other element can be uniquely identified in the structure without reference to any further element in the structure, and path information uniquely identifying the element in the structure relative to the other element.

Abstract: A method comprising determining a value indicative of worth of a component. The component is configured for display in an online browsing window. The determining is in dependence at least on the occurrence of a predetermined at least one user interaction relating to the component and a predefined event following the predetermined at least one user interaction. The predetermined at least one user interaction may comprise a predetermined sequence of user interactions. The the component may occupy one of plurality of possible positions in the online browsing window. The value may be determined in dependence on the potential value or actual value of the event.

Abstract: Systems, methods, and other embodiments associated with aggregation of cryptography engines are described. One example method includes receiving an outbound data packet on an outbound side of a data connection. The example method may also include analyzing the outbound data packet to determine a distribution value. The example method may also include selectively distributing the outbound data packet to one of a plurality of outbound processors based, at least in part, on the distribution value. The example method may also include receiving an inbound data packet on an inbound side of the data connection. The example method may also include examining the inbound data packet for an identifier. The example method may also include selectively distributing the inbound data packet to one of a plurality of inbound processors based, at least in part, on the identifier.

Abstract: Systems, methods, and other embodiments associated with aggregation of cryptography engines are described. One example method includes receiving an outbound data packet on an outbound side of a data connection. The example method may also include analyzing the outbound data packet to determine a distribution value. The example method may also include selectively distributing the outbound data packet to one of a plurality of outbound processors based, at least in part, on the distribution value. The example method may also include receiving an inbound data packet on an inbound side of the data connection. The example method may also include examining the inbound data packet for an identifier. The example method may also include selectively distributing the inbound data packet to one of a plurality of inbound processors based, at least in part, on the identifier.