Abstract: An operating system for a computing device includes a scheduler incorporating an algorithm for ordering the running of threads of execution having different priorities. The operating system is also arranged to provide a list of threads which are scheduled to run on the device, ordered by priority. At least one locking mechanism for docking access to a resource of the device from all threads except for a thread that holds the locking mechanism is also provided, and the operating system arranges for a scheduled thread which is docked from running because the resource it requires is locked to cause the thread which holds the locking mechanism to run.

Abstract: A mobile telephone which can supply or post ‘pre-answer’ information which the device owner considers of relevance to a potential call recipient. This information enables a potential call recipient to be given useful information about a potential call before actually answering that call. The information is dynamic, unlike Caller ID information. Examples include: information about the subject of an intended voice call, a mood, a current activity, part or whole of a schedule of meetings or events, information about the urgency of an intended voice call, personal information, expected call duration, commercial inducements to a consumer to answer a call (special offers, loyalty points etc.), location information.

Abstract: A mobile telephone which can supply or post ‘pre-answer’ information which the device owner considers of relevance to a potential call recipient. This information enables a potential call recipient to be given useful information about a potential call before actually answering that call. The information is dynamic, unlike Caller ID information. Examples include: information about the subject of an intended voice call, a mood, a current activity, part or whole of a schedule of meetings or events, information about the urgency of an intended voice call, personal information, expected call duration, commercial inducements to a consumer to answer a call (special offers, loyalty points etc.), location information.

Abstract: When reading a directory on a computing device, the file server adds unique tags to the listing when passing the listing to a client application. The file server keeps a list of the unique tags together with the physical addresses of the files to which they correspond. When a client wishes to open a file, it can do so by passing the tag to the file server. This enables the file server to load the file directly without having to undertake a second directory search to discover the physical location of the file from its filename.

Abstract: A computing device is provided with a multiple process architecture for running plug-in code modules in their own dedicated processes for increasing both the security and reliability of software systems using plug-in design patterns.

Abstract: A computing device is provided with a key manager which provides a mechanism for distinguishing between authorised use and unauthorized use of a cryptographic key by identifying an owning application for each key, which is authorised by the key manager to freely use a particular key, and is also trusted to ask for explicit confirmation from the user when considered appropriate, such as when the key is used in a signing operation. To allow for sharing of keys between applications, the owning application may be enabled to designate a list of other applications which are also trusted to use the key.

Abstract: Data held in physical memory, such as random access memory, in a computing device is defragmented when a system operating code null thread, which is used for placing the computing device into a reduced power mode when no other thread in the system is ready to run, is scheduled to run.

Abstract: In operation of a computing device, a secure handle is allocated to a process to enable the process to use a resource allocated to another process. The secure handle ensures that the process is not able to identify the resource and that further access to the resource is inhibited after the process has terminated any use of the resource enabled by the allocation of the secure handle.

Abstract: In a computing device, when a user requests to carry out an operation, the device determines the type of operation requested and the time period since the user was last authenticated. The operation is enabled only if the determined time period does not exceed a threshold for the requested operation.

Abstract: An operating system for a computing device comprises a kernel portion having a punish and subscribe facility for retrieving a property published by a first process and notifying the retrieved property to one or more further processes requesting to subscribe to that property. By providing the publish and subscribe mechanism within the operating system kernel, changes to properties can be notified to subscribers in real time and without the need for dedicated client server mechanisms. The publish and subscribe mechanism may be provided with access control properties established when a property is defined. The mechanism may also be used for a message and message queue facility in the computing device.

Abstract: A plug-in for execution by an application on a computing device is selected by arranging for a server to iterate through available plug-ins, asking each plug-in in succession if it can better match the criteria required by the application than the previous plug-in. The plug-in having the closest match to the criteria is then executed by the application.

Abstract: To install software on a computing device, a decision phase is used to decide whether or not to install the software followed by an installation phase for installing the software. Information required by the decision phase is provided in the form of metadata having an integrity protected by a digital signature and including a respective hash for files to be installed so as to enable the integrity of the file data to be verified before commencing the installation phase.

Abstract: A first computing device in the form of a mobile phone is used to initiate a comparison of the entries stored in a contacts store associated with the first device with the entries stored in a contacts store associated with a second device. Mutual contacts are then advised to the second device. Digests of the contacts stores entries may be used to make the comparison. Communication may be directly between the devices, such as by using Bluetooth, or may be via a network operator. The respective contacts stores may be held on the devices or by the network operator. The network operator may be used to make the comparison of store entries.

Abstract: A portable computing device, in which an internal non-volatile memory drive that is used to boot to a functional device GUI is automatically swapped with a temporary RAM drive if the internal non-volatile memory drive is found to be corrupted. The non-volatile memory is typically Flash memory, but the principle of the present invention can be applied to any kind of non-volatile memory that could become corrupted. Default configuration files may be automatically copied to the RAM drive. These may, for example, allow at least emergency voice calls to be made.

Abstract: Symbian OS applications assume a directory structure that has been defined by Symbian and defines a standard set of directories starting from the root of a drive. This is not compatible with the Memory Stick standard. The method presented provides applications with a drive that appears to be a standard Symbian drive but actually transparently maps to a safe area on the Memory Stick. It is also possible to access special Memory Stick defined root directories (e.g. for pictures and audio) and to map these directories to standard Symbian-style directories.

Abstract: A method of operating a computing device having NAND flash memory for storage of program code and user data. At start up, only selected components of the computing device core operating system are shadowed into RAM. Other components, such as read only system files associated with the core operating system, are retained in the NAND flash memory and only shadowed into RAM upon demand. The program codes shadowed into RAM at start up and the program codes shadowed into RAM upon demand are presented to a file server of the computing device as a composite file system. The use of the composite file system reduces the amount of RAM permanently occupied by core operating system code during operation of the device and also enhances the use of the more power efficient NAND flash memory. Moreover, the boot up time of the device is also significantly reduced.

Abstract: A multitasking battery operated computing device preserves battery power by determining if an untrusted application is in the background or foreground and preventing an untrusted application that is in the background from running. A window server component may be used to determine if an untrusted application is in the background or foreground; for applications in the background, it can send a control signal to the scheduler or interrupt handler that in effect prevents the untrusted application from running, e.g. being given any services or consuming any resources.

Abstract: A method of communication of digital messages with improved efficiency through the use of the transfer of difference data between devices. In one aspect of the invention, the difference data communicated is between different generations of a derived message sequence such as an email thread. In another aspect of the invention, the messages are encoded by means of a codebook, and the difference data communicated is between different versions of the codebook. In this second aspect of the invention, the codebooks may automatically utilise the difference data to adapt their efficiency, and the codebooks may be automatically customised for specific individuals or groups.

Abstract: The invention automatically produces a structural analysis of a software system's executables, separated into levels based on ‘dependency depth’. Given a simple list of executables' dependencies, the tool automatically produces a dependency table sorted by level, with the least dependent executables listed at the bottom and with the most dependent at the top. This organises the executables in a rational and repeatable manner that clarifies the high-level view of the inter-dependencies between the many executables. It can also be used to decide the order in which executables need to be built where the least dependent executable is built first.