Abstract: A method of automatically distributing data messages to members of a user community involves selecting, from a list of distribution rules, a rule which meets certain criteria in terms of message distribution characteristics. The selected rule determines which members of the user community will receive the message and when. For example, in a first round, a first subset of the user community receive the message and each is prompted to provide feedback data in relation to the message, for example to say that the message is offensive, already answered or if there is someone else who can deal with the message. This feedback data is applied to the selected distribution rule to determine to whom the message is sent in the next round. The process continues over a number of rounds until a termination criterion is met.

Abstract: Automatic publishing and retrieval in a networked community of computers based on a Small World Adaptive Network (SWAN) type of network. Each computer installs a program which automatically scans data items in its computer's environment to find unique IDs in accordance with UID templates. For each data item found containing a UID, a data record is created comprising the UID associated with the network address of the data item. If permitted by a ruleset, that data record is published to the network by creating a node having the (hashed) UID as its identity or by adding the network address of that data item to common ID lists of existing nodes having that same UID identity. A search request in respect of a UID will find a node and obtain all the network addresses in its list, enabling the requester to send retrieval requests for each corresponding data item.

Abstract: Computers store data items, each data item being assigned to one of a plurality of virtual directories. Each computer has at least one node of a virtual network for directory look-up, with linking data including addresses of other nodes associated with the same virtual directory and software that, in response to an enquiry message either replies, identifying itself or forwards the message to another node of the network, according to whether the node is or is not associated with the directory specified in the enquiry message.

Abstract: A system for distributed process management uses a plurality of units of software installed on a computing platform. Further software controls operation of the plurality of units in use. Each unit of software communicates with other units of software, and at least some of the units of software further provides one or more elements of a software process.

Abstract: In a network of computers, e.g. the internet, each computer records the information sources it accesses, and these records are used to identify computers whose users share common interests, as indicated by the sources they access. A virtual network is created linking computers whose users have been identified as sharing similar interests data on what sources have been accessed by each user are shared with neighbouring computers, a defined by the virtual network. Computers can also pass on information on sources accessed received from one neighbour to other neighbours.

Abstract: A method of automatically distributing data messages to members of a user community involves selecting, from a list of distribution rules, a rule which meets certain criteria in terms of message distribution characteristics. The selected rule determines which members of the user community will receive the message and when. For example, in a first round, a first subset of the user community receive the message and each is prompted to provide feedback data in relation to the message, for example to say that the message is offensive, already answered or if there is someone else who can deal with the message. This feedback data is applied to the selected distribution rule to determine to whom the message is sent in the next round. The process continues over a number of rounds until a termination criterion is met.

Abstract: In a communications network environment, nodes, such as personal computers, are assigned co-ordinates in a co-ordinate space which is independent of network address and physical location. Each node maintains links to a limited set of other nodes by storing the network addresses for those selected nodes. Each stored network address represents a link in co-ordinate space. It becomes possible for any node to obtain the network address for a target node by initiating a query message to a node for which it has the network address, which query message is propagated through the network between nodes which have the network address for a next node across co-ordinate space. When a receiving node finds it is the target node, or is as close in co-ordinate space as it is possible to forward the query message, it returns its own network address to the initiating node. This technique can also be used to retrieve information other than network addresses—such as objects.

Abstract: In a network of computers, e.g. the internet, each computer records the information sources it accesses, and these records are used to identify computers whose users share common interests, as indicated by the sources they access. A virtual network is created linking computers whose users have been identified as sharing similar interests data on what sources have been accessed by each user are shared with neighbouring computers, a defined by the virtual network. Computers can also pass on information on sources accessed received from one neighbour to other neighbours.

Abstract: Automatic publishing and retrieval in a networked community of computers based on a Small World Adaptive Network (SWAN) type of network. Each computer installs a program which automatically scans data items in its computer's environment to find unique IDs in accordance with UID templates. For each data item found containing a UID, a data record is created comprising the UID associated with the network address of the data item. If permitted by a ruleset, that data record is published to the network by creating a node having the (hashed) UID as its identity or by adding the network address of that data item to common ID lists of existing nodes having that same UID identity. A search request in respect of a UID will find a node and obtain all the network addresses in its list, enabling the requester to send retrieval requests for each corresponding data item.

Abstract: Display location calculation means and methods for calculating a display location are disclosed. It has become common for users to indicate a point on a display in order to communicate with a machine. It is therefore necessary to be able to calculate the location on the display that is being indicated by the user. A display generator (123) is arranged in operation to generate a display in response to display data generated by a machine (111). A camera operable to generate image data representing at least part of the scene within the field of view of the camera (which part, includes at least a portion of the display) is carried in a pointer device (103). Computation means (111, 113, 115) are arranged in operation to receive the image data and the display data and to calculate from these data sets the position and/or orientation of the pointer device (103) relative to the display. A display location can then be calculated from the calculated position and/or orientation.

Abstract: In a communications network environment, nodes, such as personal computers, are assigned co-ordinates in a co-ordinate space (200) which is independent of network address and physical location. Each node (100) maintains links to a limited set of other nodes by storing the network addresses for those selected nodes. Each stored network address represents a link (205) in co-ordinate space (200). It becomes possible for any node to obtain the network address for a target node by initiating a query message to a node it has the network address for, which query message is propagated through the network between nodes which have the network address for a next node across co-ordinate space. When a receiving node finds it is the target node, or is as close in co-ordinate space as it is possible to forward the query message, it returns its own network address to the initiating node. Embodiments of the invention can also be used to retrieve information other than network addresses—such as objects.

Abstract: A system for distributed process management comprising a plurality of units of software for installation on computing platform, and further software for controlling the operation of the plurality of units in use of the system,