Abstract: Apparatus and method for imaging fundus of eye. The apparatus (100) includes an optical system (116), an image sensor (114) to capture a still image or a video through the optical system (116), a user interface (102) including a display (104) to display data to a user of the apparatus, and one or more processors (106). The one or more processors (106) cause performance of at least the following: setting the image sensor (114) to capture an aiming video; detecting a retina of the eye in the aiming video; setting the display (104) to display the aiming video with a highlight of the detected retina; and setting the image sensor (114) to capture one or more final still images of the fundus or a final video of the fundus.

Abstract: Methods and apparatuses for processing information of data streams in a data network are provided. In accordance with a method comprising at least one first stream of data is determined in accordance with a first protocol. A second stream of data is then generated in accordance with a second protocol, wherein the second protocol is a lower layer protocol than the first protocol. The generating comprises including at least a portion of the determined at least one first stream of data in the second stream of data and encoding into a predefined control information field of the second stream of data information associated with the at least one first stream of data for use in processing the at least one first stream of data. The recipient can then use the encoding in processing the at least one data stream.

Abstract: The invention relates to methods for processing data packets according to a set of rules, and especially for preparing of decision trees for selecting the correct rule for processing of a data packet. In preparation of a decision tree, a splitting point within a dimension being studied is chosen as follows. The rules are sorted to allow monotonous iteration through all range end values specified in the rules in the dimension being studied. The range end values are then iterated through in a monotonous fashion, either increasing or decreasing. At each iteration, the number of range low end values and the number of range high end values being equal to the current iteration value is counted. From these counts and the accumulated results from the corresponding counts in previous iterations, the numbers of rules with ranges in different positions relative to the current iteration value are deduced, and from these values, the goodness of the iteration value is calculated.

Abstract: The invention relates to methods for processing data packets according to a set of rules, and especially for preparing of decision trees for selecting the correct rule for processing of a data packet. In preparation of a decision tree, a splitting point within a dimension being studied is chosen as follows. The rules are sorted to allow monotonous iteration through all range end values specified in the rules in the dimension being studied. The range end values are then iterated through in a monotonous fashion, either increasing or decreasing. At each iteration, the number of range low end values and the number of range high end values being equal to the current iteration value is counted. From these counts and the accumulated results from the corresponding counts in previous iterations, the numbers of rules with ranges in different positions relative to the current iteration value are deduced, and from these values, the goodness of the iteration value is calculated.

Abstract: The invention relates to a method for recovering a database provided with disk backup. A database comprising a first generation and at least one mature generation is maintained in a central memory. The generations contain memory cells in which data and additionally pointers constituting references between memory cells are stored. Generation-specific remembered sets are maintained in the area of mature generations in the central memory. Live memory cells in the area of the first generation are periodically collected as a new mature generation into the central memory into the area of mature generations. Garbage collection is performed generationally in the area of mature generations, in which live memory cells are copied in the order indicated by the remembered set into a temporally more recent mature generation.

Abstract: A method for copying cells in a database which are referred to by pointers comprises the steps of: probe if a cell identical to a cell to be copies is stored in a cache memory, and if such an identical cell is found in said cache, instead of copying the content of the cell, redirecting the pointer referring to said cell to be copied to said identical cell. Also an apparatus for storing and processing a database according to this method is described.

Abstract: A method for restarting a replica of a database comprises the steps of: sending the transient metadata of an active replica to the replica restarting and sending the contents of the cells which are collected in said active replica to the replica restarting. Further, a method for synchronization of a few replicas as well as an apparatus for processing said methods as described.

Abstract: The present invention relates to an indexing method and system for relational da-tabases, wherein a foreign key reference is routed by providing in a first table a reference to a second table referring to said first table. Thus, foreign key refer-ences to second tables are traversed via the index of the first table, such that a referential integrity can be implemented more easily and memory space can be saved. Furthermore, a key information is proposed to be removed from a row as it is inserted in a relation table, wherein the key information is obtained from an in-dex structure by a deduction operation. This leads to a further deduction of the required memory space.

Abstract: The present invention relates to a method and a system for performing concurrency control in a relational database. A checklist of read and/or write events served during a transaction is generated, and concurrent checklists are analyzed to determine whether they can be serialized. The transaction is then commited based on the result of said analyzing step. Thus, nothing is written to the database by the transactions when they obtain elements from the database, such that concurrency control is possible for system employing a copy-on-write policy.

Abstract: A method for implementing a double-ended queue (deque) in a memory (MEM), and a memory arrangement. To be able to reduce the amount of copying, particularly in functional environments, the double-ended queue is used in the memory as a hierarchic data structure where on the highest level of hierarchy, there is a three-element node of whose elements one points to the buffer forming the front end of the queue and another to the buffer forming the tail end of the queue. The middle of the queue inlcudes nodes on different levels of hierarchy so that pointing from each level of hierarchy to the next lower level of hierarchy is done by a pointer in the third element of a three-element node. The pointer points to a node on the next lower level of hierarchy which is a similar three-element node, with the exception of the lowest level of hierarchy where the node can also be a buffer, and with the exception of the highest level of hierarchy, where the said pointer can also be a NIL pointer.

Abstract: The invention relates to a method for implementing a double-ended queue (deque) in a memory (MEM), and to a memory arrangement. To be able to reduce the amount of copying, particularly in functional environments, the double-ended queue is used in the memory as a hierarchic data structure where on the highest level of hierarchy, there is a three-element node of whose elements one points to the buffer forming the front end of the queue and another to the buffer forming the tail end of the queue. The middle of the queue consists of nodes on different levels of hierarchy so that pointing from each level of hierarchy to the next lower level of hierarchy is done by a pointer in the third element of a three-element node.

Abstract: The invention relates to a method for recovering a database provided with disk back-up. A database comprising a first generation and at least one mature generation is maintained in a central memory. The generations contain memory cells in which data and additionally pointers constituting references between memory cells are stored. Generation-specific remembered sets are maintained in the area of mature generations in the central memory. Live memory cells in the area of the first generation are periodically collected as a new mature generation into the central memory into the area of mature generations. Garbage collection is performed generationally in the area of mature generations, in which live memory cells are copied in the order indicated by the remembered set into a temporally more recent mature generation. As the garbage collection proceeds, changes to the references between generations are made in the area of mature generations in a generation that has already been stored in disk memory.