Abstract: Embodiments of the present invention provide a method and system for processing microscopy images to enable localisation analysis of high density raw data, and thereby achieve higher spatial resolution than would otherwise be the case. This is achieved by exploiting temporal redundancies in the image data resulting from close-to emitters that would otherwise be resolved as a single emitter were they to emit or fluoresce at the same time, but which, by virtue of emitting or fluorescing at slightly different (yet potentially overlapping) times, can be subject to temporal filtering by different filters of different temporal bandwidth to resolve the two emitters. Effectively, the different temporal filters have different time constants which work together to effectively highlight the different emission or fluorescence times of the two emitters, to thereby allow the two close-to emitters to be separately resolved.

Abstract: Embodiments of the present invention provide a method and system for processing microscopy images to enable localisation analysis of high density raw data, and thereby achieve higher spatial resolution than would otherwise be the case. This is achieved by exploiting temporal redundancies in the image data resulting from close-to emitters that would otherwise be resolved as a single emitter were they to emit or fluoresce at the same time, but which, by virtue of emitting or fluorescing at slightly different (yet potentially overlapping) times, can be subject to temporal filtering by different filters of different temporal bandwidth to resolve the two emitters. Effectively, the different temporal filters have different time constants which work together to effectively highlight the different emission or fluorescence times of the two emitters, to thereby allow the two close-to emitters to be separately resolved.

Abstract: The present invention provides a method of treatment or prophylaxis of hepatitis B virus in a subject comprising administering an effective amount of a compound of formula (1) or a pharmaceutically acceptable derivative, salt or prodrug thereof. In addition, there is provided compounds of formula (1) and pharmaceutical compositions thereof. Further, methods of preparing compounds of formula (1) are disclosed.

Abstract: A data storage apparatus has a plurality p of storage spaces for storing sets of data. Each of the spaces has: available (unused) space x1 for storage; a number x2 of data sets already stored; a number x3 of channels available for transferring data to the space; and a number x4 of times the space is scheduled to be used for reading out sets of data therefrom. An allocation factor Qp=f(ai, xi) is calculated for each space where ai are weighting factors ranking xi in order of importance. A data set is allocated to the space having the “best” (e.g. lowest) value of Qp at the time the data is to be allocated. Once allocation factors determined, then data may be allocated according to usage indices representing the ability of a space to store the data at the time of allocation.

Abstract: A data storage apparatus has a plurality p of storage spaces for storing sets of data. Each of the spaces has: available (unused) space x.sub.1 for storage; a number x.sub.2 of data sets already stored; a number x.sub.3 of channels available for transferring data to the space; and a number x.sub.4 of times the space is scheduled to be used for reading out sets of data therefrom. An allocation factor Qp=f(ai, xi) is calculated for each space where ai are weighting factors ranking xi in order of importance. A data set is allocated to the space having the "best" (e.g. lowest) value of Qp at the time the data is to be allocated. Once allocation factors determined, then data may be allocated according to usage indices representing the ability of a space to store the data at the time of allocation.

Abstract: A data storage apparatus has a plurality of storage spaces p for storing sets of data. Each of the spaces has: available (unused) space x.sub.1 for storage; a number x.sub.2 of data sets already stored; a number x.sub.3 of channels available for transferring data to the space; and a number x.sub.4 of times the space is scheduled to be used for reading out sets of data therefrom. An allocation factor Qp=f(ai, xi) is calculated for each space where ai are weighting factors ranking xi in order of importance. A data set is allocated to the space having the "best " (e.g. lowest) value of Qp at the time the data is to be allocated. Once allocation factors determined, then data may be allocated according to usage indices representing the ability of a space to store the data at the time of allocation.