Abstract: The current invention concerns a computer-implemented method, a computer system and a tangible non-transitory computer-readable data carrier comprising a computer program product for aligning a query nucleic acid sequence against a reference nucleic acid sequence. An optimal alignment score of the query sequence against the reference sequence is determined by a dynamic programming algorithm. The algorithm is configured for locally optimizing a partial alignment score based on a nucleotide substitution cost, a gap insertion cost, an amino acid substitution cost, as well as a frameshift penalty.

Abstract: The present invention concerns methods, systems and devices that use indoor localization for assisting customers in retail stores. The customer is provided with a tag for localizing said customer while he or she moves through the store. The sales person is provided with a mobile device for localizing said sales person and for notification. The customer can request for assistance, in which case a sales person is allocated to the customer by the shopping assistance system. The sales person can start assisting the customer after an interaction between the mobile device and the tag, preferably on the basis of a proximity determination between the mobile device of the sales person and the tag of the customer.

Abstract: The current invention concerns a computer-implemented method, a computer system and a tangible non-transitory computer-readable data carrier comprising a computer program product for aligning a query nucleic acid sequence against a reference nucleic acid sequence. An optimal alignment score of the query sequence against the reference sequence is determined by a dynamic programming algorithm. The algorithm is configured for locally optimizing a partial alignment score based on a nucleotide substitution cost, a gap insertion cost, an amino acid substitution cost, as well as a frameshift penalty.

Abstract: A method and apparatus is provided for connecting a computer device to a communication network, the computer device being provided with an operating system using a kernel protocol stack to connect to a pool of first communication networks known to an administrator of the computer device. The method includes introducing a second protocol stack, aside from the kernel protocol stack, for connecting the computer device to a second communication network not belonging to the known pool of first communication networks.

Abstract: Method for connecting a host computer device to a wireless communication network, the host computer device being provided with an operating system with at least one pre-installed generic driver providing a generic communication protocol (7) for communication between the host computer device and a standard class of computer peripheral devices other than wireless modem devices, the method comprising the steps of: (a) connecting a wireless modem device to the host computer device; (b) setting up, by means of a pre-installed generic driver of the operating system on the computer device, a modem/host communication interface (6) for communication between the wireless modem device and the computer device; (c) connecting the host computer device to a wireless communication network via the wireless modem device; (d) routing data traffic (8-9) between the host computer device and the wireless communication network over the modem/host communication interface (6).

Abstract: Method for connecting a host computer device to a wireless communication network, the host computer device being provided with an operating system with at least one pre-installed generic driver providing a generic communication protocol (7) for communication between the host computer device and a standard class of computer peripheral devices other than wireless modem devices, the method comprising the steps of: (a) connecting a wireless modem device to the host computer device; (b) setting up, by means of a pre-installed generic driver of the operating system on the computer device, a modem/host communication interface (6) for communication between the wireless modem device and the computer device; (c) connecting the host computer device to a wireless communication network via the wireless modem device; (d) routing data traffic (8-9) between the host computer device and the wireless communication network over the modem/host communication interface (6).

Abstract: A method buffering packets in a packet switching network (FIG. 5) includes receiving a packet from the network; splitting the packet into a plurality of PDUs; stripping at least some of the PDUs over a plurality of memory banks; (18) retrieving the PDUs from the memory banks: and at least temporarily storing the retrieved PDUs in the sequence they are to be transmitted. An apparatus for implementing the method is also disclosed.

Abstract: The present invention provides a data-structure to store a search database and provides techniques to build this datastructure given a list of prefixes (P) and to search this database efficiently for a best matching prefix for an address D. The data-structure can be stored in standard memory (14), where values are stored associated with memory address locations. The data structure includes representations of addressable linked tables (FIG. 3b). The representations are related to a binary search trie (FIG. 1) and each linked table (T) has at least one entry. Entries in a table span more than one level of the binary search trie. The spanning feature relates to compression of a binary search trie into a finite number of levels (and hence tables). The finite number is less than the number of levels in the binary search trie. Hence the search algorithm is restricted to a finite, and predetermined number of search accesses to the tables to obtain a best-match result.

Abstract: A packet scheduling method and apparatus is described for enqueuing incoming data packets in sessions, and for storing the sessions in sequential order in service-groups. Each service-group is assigned a nominal service-interval in which time a data packet is to be transmitted, the nominal service-interval of one service-group being faster than the nominal service-interval of another service-group. Within one service-group, one session is serviced until the nominal service-interval of any of the service-groups where there is at least one data packet to be sent is exceeded.

Abstract: A packet processing apparatus for processing data packets for use in a packet switched network includes means for receiving a packet, means for adding administrative information to a first data portion of the packet, the administrative information including at least an indication of at least one process to be applied to the first data portion, and a plurality of parallel pipelines, each pipeline comprising at least one processing unit, wherein the processing unit carries out the process on the first data portion indicated by the administrative information to provide a modified first data portion. According to a method, the tasks performed by each processing unit are organized into a plurality of functions such that there are substantially only function calls and no interfunction calls and that at the termination of each function called by the function call for one processing unit, the only context is a first data portion.

Abstract: The present invention provides a data-structure to store a search database and provides techniques to build this datastructure given a list of prefixes (P) and to search this database efficiently for a best matching prefix for an address D. The data-structure can be stored in standard memory (14), where values are stored associated with memory address locations. The data structure includes representations of addressable linked tables (FIG. 3b). The representations are related to a binary search trie (FIG. 1) and each linked table (T) has at least one entry. Entries in a table span more than one level of the binary search trie. The spanning feature relates to compression of a binary search trie into a finite number of levels (and hence tables). The finite number is less than the number of levels in the binary search trie. Hence the search algorithm is restricted to a finite, and predetermined number of search accesses to the tables to obtain a best-match result.

Abstract: A method buffering packets in a packet switching network (FIG. 5) includes receiving a packet from the network; splitting the packet into a plurality of PDUs; stripping at least some of the PDUs over a plurality of memory banks; (18) retrieving the PDUs from the memory banks: and at least temporarily storing the retrieved PDUs in the sequence they are to be transmitted. An apparatus for implementing the method is also disclosed.

Abstract: A packet scheduling method and apparatus is described for enqueuing incoming data packets in sessions, and for storing the sessions in sequential order in service-groups. Each service-group is assigned a nominal service-interval in which time a data packet is to be transmitted, the nominal service-interval of one service-group being faster than the nominal service-interval of another service-group. Within one service-group, one session is serviced until the nominal service-interval of any of the service-groups where there is at least one data packet to be sent is exceeded.