Abstract: The invention relates to a computer system (1) including a system component (2) having at least one processor (5) and also at least one non-volatile memory chip (9) for storing at least one installed firmware component of the computer system (1). The computer system includes a system monitoring chip (17), at least one internal expansion interface (15) which is functionally coupled to the system monitoring chip (17), and a non-volatile storage medium (16) which is connected to the internal expansion interface (15). The system monitoring chip (17) is set up such that, when the computer system (1) is started, it compares the installed firmware component of the non-volatile memory chip (9) with a desired firmware component of the non-volatile storage medium (16) and, upon finding a discrepancy between the installed firmware component and the desired firmware component, it starts the computer system (1) using the desired firmware component.

Abstract: A computer system buys and sells virtual shares on behalf of investors, usually investing small sums, in order to reduce the dealing costs for small transactions. The system thus maintains a notional level of shares held on behalf of all the investors who participate in the system. A monitoring process runs continually checking exposure on individual shares, and the system buys and sells blocks of real shares in the market to keep the exposure to individual companies at an acceptable level. By buying and selling larger blocks of real shares on a more infrequent basis than the virtual share transactions, the smaller transactions are effectively consolidated together, with associated cost savings.

Abstract: A first node (client) (1) is in communication with one of a plurality of second nodes (5, 6, 7) connected to a local area network (LAN) (4) via a virtual private network including a link (3), such as the Internet, and a selected one of a plurality of third nodes (gateway servers) (21, 22, 23). Communication between the first node (1) and the third nodes (21, 22, 23) is encrypted, whereas communication between the third nodes and the second nodes (5, 6, 7) is unencrypted. Communication from the first node (1) to one of the second nodes (5, 6, 7) is initially set up via a selected one of the third nodes after suitable authentication. If that third node should subsequently fail, an alternative third node can be used. To detect the failure of a third node, the first node (1) sends a “heartbeat” packet (failure detection signal) to it. An operational third node responds with an answer, indicating that all is well.

Abstract: In a method for storing and accessing electronic content (e.g. for a Website), content objects are stored in a structured manner in a content store. Some of the content objects in the content store are identified as shortcuts, pointing to other objects in the content store. When a shortcut is accessed, the target object pointed to by that shortcut is automatically accessed from the content store and returned in place of the shortcut object. This provides a powerful way of structuring websites and other forms of content delivery.

Abstract: A method for modelling loans comprises allowing a user to enter parameters relevant to the loan, including the loan amount, loan term and interest rate, and then visually displaying information indicating the repayments due over the term of the loan. The user can also select one or more of the following options: low-start or fast-start loans; regularly increasing repayments; lump sum repayments at specified dates; reduced repayments for a specified period; and variable repayments over different months of the year. The information indicating the repayments due over the term of the loan is displayed in some easily-understandable visual representation, such as a graph, bar chart, or table.

Abstract: A method is described for generating code for loading and performing other processing operations on a multi-dimensional data warehouse. Databases are defined as entity-relationship data models, using a modelling tool. A source file is created, containing instructions for processing the database, and including one or more high-level directives. At system build time, the source file is pre-processed, by replacing the directives with code, using information pulled from the data model, to generate a destination file containing the code for processing the database. At run time, the generated code is processed to replace run-time macros, indicating physical storage schemes. The generated code is then run, to process the database.

Abstract: A method for authenticating a printed document is described. A document producer sends information to be included in a document to an authentication authority. The authentication authority cryptographically generates an authentication code from this information, and sends the authentication code back to the document producer. The document producer then prints the document, including both the information and the authentication code, and a bar code representing the authentication code. A document checker scans in the bar code, and cryptographically checks the authentication code against the information in the document.

Abstract: A data lookup method and apparatus enables a number of users with portable wireless devices, such as WAP phones, to conveniently access a sorted data list such as a telephone directory. The sorted list is divided into a number of sub-lists, and the user is sent information indicating the range of data in each of the sub-lists. The user then selects the sub-list that contains the required data item. The selected sub-list is then divided into a number of smaller sub-lists, allowing the user to make a further selection, and so on until the number of entries in the selected sub-list is less than or equal to the number of lines that can be conveniently displayed on the user device. The user can then select the required item. Thus, the user does not have to indicate what is being looked for, merely make selections.

Abstract: A locker system which permits secure delivery, or collection, of goods at a location and that can be associated with a single household or disposed centrally with respect to a plurality of households. A set of lockers, which may be of different sizes, capable of being in different states, e.g. ambient, chilled, frozen, and which are lockable separately, is disposed at the location. In-residence IT systems including computer means, such as servers, permit householders to place on-line orders with retailers/service providers, such as over the Internet. Prior to order placement, an appropriate locker for the size and state of the goods is reserved, such as by the household server contacting a management server via an Intranet. An access code required for unlocking the reserved locker is supplied to the household server, and forwarded to the retailer/service provider over the Internet together with the order and reserved locker location information.

Abstract: A system involving a central computer (2) and a remote computer (3), which can communicate over a link (1), is migrated from in-clear working to encrypted working automatically as the computers receive and install long term keys necessary for encrypted communication. When migration is required, the settings at both ends of the link need to be changed to “encrypt” simultaneously and, particularly, if there are numerous remote computers and the possibility of connection of a remote computer to different central computers, as is possible in virtual private network (VPN) scenarios, severe problems can ensue. Hence, as well as the normal two modes of working “in-clear” and “encrypt”, a third mode in which “initiate encryption” is set at one end of the link and “accept encryption” is set at the other end of the link is proposed.

Abstract: Business data flows from one computer system (1) to another (2) and its integrity can be protected by cryptographic means, such as digital signatures. In particular, a source system (1) may use a private key (DSPR) to sign outgoing data, and a destination system (2) may use a public key (DSPU) to verify incoming data. For security purposes all keys should be changed at scheduled times calculated using factors including key lifetime (from which is calculated the key expiry time) and key delivery time. If a key is compromised it needs to be changed at other than the scheduled time, and in general this will result in calculation of a new scheduled key change time. If a DSPR key is delivered to the source system (1) encrypted by a key encryption key (KEK), then change to the KEK key will in general also be needed upon compromise of the DSPR key.

Abstract: A computer system has at least two processing nodes and a shared data storage system comprising a number of storage units. Each storage unit has a logical unit number (LUN). A first of the processing nodes stores a maximum LUN value in non-volatile storage, and is arranged to perform, on boot-up, a device discovery procedure in which it scans the shared data storage system to find storage units with LUNs not greater than the maximum LUN value. A second of the processing nodes stores a start LUN value in non-volatile storage, and is arranged to perform, on boot-up, a device discovery procedure in which it scans the shared data storage system to find storage units with LUNs not less than the start LUN value. This allows LUN masking to be achieved relatively inexpensively with only minimal modification to the operating systems of the processing nodes, using existing device discovery features of the operating system.

Abstract: Secret material, such as a cryptographic key, that is needed for operation of a computer system (4a), can be stored under password protection on a storage medium for insertion into the computer system as required. If the password is forgotten, or the storage medium is faulty, the secret material will not be accessible. To permit secure recovery of the secret material in these or other circumstances, the secret material is encrypted using a recovery key and stored on the computer system, together with a value used in the generation of the recovery key from the secret material. The secret material is also stored on a remote secure system (5). When recovery of the secret material is required, the value for generating the recovery key is supplied to the remote system and used to generate the recovery key there. The generated recovery key is then supplied to the computer system, where it is used to decrypt the secret material.

Abstract: A computer-implemented method is described, for searching for items in an electronic catalog, e.g. an on-line catalog accessible over the Internet. A hierarchy of category names is defined, each item in the electronic catalog being associated with one of those category names. When a search page is accessed, the category names are scanned, to generate a list of words that appear in the category names at any level of the hierarchy. The list of words is displayed in the search page, allowing a user to select one. When the user selects a word from the list, a list of items whose category names contain the selected word is displayed.

Abstract: A data processor comprises a number of databases for storing records and a plurality of user systems capable of accessing the databases. The user systems each include a datastore/application environment instance with which users can interface. Host systems may include more than one instance. The datastores contain time-versioned views of records. The data processor is operable in at least two modes, a normal operation mode in which an evaluation in response to a user enquiry can be carried out using records relevant to a current viewpoint time and time span, and a recovery operation mode in which records relevant to a viewpoint time and time span for a previous evaluation are accessed and used to exactly reproduce the previous evaluation.

Abstract: In a method for storing and accessing objects in an electronic content store (e.g. for a Website), each object is assigned a version number, such that multiple instances of the same object with different version numbers may coexist. When accessing an object in the content store for reading or writing, a requested version number is specified. When reading an object, if an instance of that object with the requested version number exists in the content store, that instance of the object is returned, and otherwise the most recent older instance of that object is returned. When writing to an object, if an instance of that object with the requested version number exists in the content store, the write is performed to that instance of the object, and otherwise a copy is made of the most recent older instance of the object, the copy is assigned the requested version number, and the write is performed to the copy. This provides an efficient and convenient mechanism for managing versions of the content.