Abstract: A device, system and method for molecular computing which not only includes a suitable, renewable power source, but actually is able to receive power through the performance of the computations themselves. The molecular computing machine of the present invention actually employs the free-energy difference between its input and output to accomplish a computation, preferably by using its input DNA molecule as a partial source of energy, or alternatively by using the input DNA molecule as the sole source of energy. This molecular finite automaton preferably transforms an input DNA molecule into an output DNA molecule by digesting the input as it computes.

Abstract: An autonomous molecular computer that, when coupled to a molecular model of a disease, is capable of disease diagnosis. The computer preferably performs such diagnosis by detecting one or more disease markers. For example, optionally and preferably the molecular computer checks for the presence of over-expressed, under-expressed and mutated genes, applies programmed medical knowledge to this information to reach a diagnostic decision.

Abstract: A device, system and method for molecular computing which not only includes a suitable, renewable power source, but actually is able to receive power through the performance of the computations themselves. The molecular computing machine of the present invention actually employs the free-energy difference between its input and output to accomplish a computation, preferably by using its input DNA molecule as a partial source of energy, or alternatively by using the input DNA molecule as the sole source of energy. This molecular finite automaton preferably transforms an input DNA molecule into an output DNA molecule by digesting the input as it computes.

Abstract: A data retrieval system is described. The system includes a data server, at least one data retrieval client, a co-presence server and at elast one downloadable co-presence client. The data server retrieves at least one data object from among a plurality of data objects stored in a data repository. The data retrieval client requests at least one data object from the data server. The co-presence server includes a virtual place generator which generates one virtual place per data object retrieved from the data server and an associator which associates each virtual place with its data object once its data object is accessed. The downloadable co-presence client is operative with the data retrieval client and communicates with the co-presence server. Each co-presence client includes an object associator which associates a data object received from the co-presence server with one of the at least one virtual places in the co-presence server.

Abstract: A data retrieval system has a data server, a co-presence server and at least one awareness co-presence client. The data server retrieves at least one data object from among a plurality of data objects stored in a data repository. The co-presence server opens communication and observation channels associated with at least one of the data objects. The awareness co-presence clients communicate with the co-presence server and define an awareness state of the client. The co-presence server opens a communication channel or an observation channel with each client depending on the awareness state of each client per retrieved data object. For observation channels, the co-presence server indicates to each client which other clients have retrieved the same data object. The co-presence server opens a communication channel associated with a retrieved data object to those clients which retrieved the data object and which are in a communication type of awareness state.

Abstract: The present invention is a computer-implemented and/or assisted method for sharing, for example, bottles of wine. The computer system allows customers to request a glass or taste of wine, and when the requests reach a predetermined threshold for a given bottle of wine, the bottle of wine is uncorked and served. Requests can be made from within the establishment or from a remote location prior to entering the establishment. The invention allows customers to indulge in a glass or taste of wine not usually available in that amount at most establishments. Other itmes may alternatively be shared.

Abstract: A method of establishing communication with a community of users is described. The method includes the steps of receiving geographical location information of a first user belonging to the community of users and determining a geographical region in which the first user is located based on the geographical location information. The method also includes the step of finding other users from the community of users who are located within the geographical region. Corresponding system, medium and means are also described.

Abstract: A data retrieval system has a data server, a co-presence server and at least one awareness co-presence client. The data server retrieves at least one data object from among a plurality of data objects stored in a data repository. The co-presence server opens communication and observation channels associated with at least one of the data objects. The awareness co-presence clients communicate with the co-presence server and define an awareness state of the client. The co-presence server opens a communication channel or an observation channel with each client depending on the awareness state of each client per retrieved data object. For observation channels, the co-presence server indicates to each client which other clients have retrieved the same data object. The co-presence server opens a communication channel associated with a retrieved data object to those clients which retrieved the data object and which are in a communication type of awareness state.

Abstract: A data retrieval system is described. The system includes a data server, at least one data retrieval client, a co-presence server and at elast one downloadable co-presence client. The data server retrieves at least one data object from among a plurality of data objects stored in a data repository. The data retrieval client requests at least one data object from the data server. The co-presence server includes a virtual place generator which generates one virtual place per data object retrieved from the data server and an associator which associates each virtual place with its data object once its data object is accessed. The downloadable co-presence client is operative with the data retrieval client and communicates with the co-presence server. Each co-presence client includes an object associator which associates a data object received from the co-presence server with one of the at least one virtual places in the co-presence server.

Abstract: A Brownian Turing machine includes a multiplicity of alphabet elements, multiple state transition elements and a single enzymatic unit. The alphabet elements define a plurality of different types of information. The state transition elements define how the machine can change state. The enzymatic unit receives dimers one at a time, wherein each dimer is comprised of one state transition element combined to one alphabet element. The enzymatic unit determines if a dimer is an allowable next dimer and, if it is, connects the state transition element of the allowed dimer to a history tape of the history of at least one change of state. The enzymatic unit also modifies an alphabet tape, comprising at least two alphabet elements connected together, with the alphabet element of the allowed dimer in accordance with the state transition defined by the state transition element of the allowed dimer. The alphabet elements, state transition elements and enzymatic unit can be mechanical, chemical or biological elements.

Abstract: A data retrieval system is described. The system includes a data server, at least one data retrieval client, a co-presence server and at elast one downloadable co-presence client. The data server retrieves at least one data object from among a plurality of data objects stored in a data repository. The data retrieval client requests at least one data object from the data server. The co-presence server includes a virtual place generator which generates one virtual place per data object retrieved from the data server and an associator which associates each virtual place with its data object once its data object is accessed. The downloadable co-presence client is operative with the data retrieval client and communicates with the co-presence server. Each co-presence client includes an object associator which associates a data object received from the co-presence server with one of the at least one virtual places in the co-presence server.

Abstract: A data retrieval system includes a data server a co-presence server and at least two co-presence data retrieval clients. The data server retrieves at least one of a plurality of data objects from a data repository. The co-presence data-retrieval clients communicate at least with the data server and with the co-presence server. The co-presence server includes community means for at least maintaining a list of users associated with a community and at least one virtual place having a list of users from the community at the virtual place. Each of the co-presence data retrieval clients includes object association means and co-presence means. The object association means associate a data object received from the data server with one of the at least one virtual places in the co-presence server. The co-presence means is associated with the one virtual place and associates the client with the community and enables communication at least with other co-presence means also associated with the one virtual place.

Abstract: A data retrieval system includes a data server which retrieves a data object from a data repository and a system for associating a virtual place with a retrieved data object. The virtual place provides co-presence to users which access the retrieved data object. A method for upgrading a data retrieval system comprised of a data server capable of retrieving data objects from a data repository and a plurality of data-retrieval clients is aLso described.

Abstract: A flat concurrent Prolog (Fcp) computer comprises a memory in which all the data is stored, three sets of registers, several queues or lists and a computer program for controlling the computer. The memory is a single data area called the "heap" which also includes two small data areas called the "trail" and the suspension table as well as the queues. The queues include the resolvent which is also called the active queue or the process queue, the activation queue, the process free list and the suspension free list. The registers include a set of general registers, a set of procedure try registers and a set of clause try registers. The general registers include a heap backtrack register, a queue front register, a queue back register, a process free list register, and a suspension free list register.