Nokia Corporation

Nokia Technologies Oy

Andreas Heiner

Sergey Balandin

Harry Boer

Nadarajah Asokan

Phillip Lindberg

Carl Eklund

Roberto Barnes

Johan Frossen

Paul Michael Dunphy

Desmond Sebastiaan Van Der Meer

John Anthony Evans

Jussi Penttinen

Josephine Gianni

An approach is provided for automatic loading of applications, including receiving user identification corresponding to a device. Data is also received, which indicates a set of one or more relevant applications that are a subset of multiple available applications. The set is automatically selected based on the user identification and an application favored by a contact associated with the user. Installation is initiated of an application of the selected set within the device. In some embodiments, access is provided to a social service via a network. The social service includes data that indicates multiple users, contacts among the users, and applications favored by the users. Access is also provided to receive at the social service a request message indicating user identification for a first user at a first network node. A message indicating a relevant application based on an application favored by a contact of the first user is transmitting to the first network node.

Method and apparatus for automatic loading of applications

An apparatus lets a user to determine a pool of images and then forms from the pool of images a set of images for user authentication and divides the set of images into two mutually exclusive subsets: a key image subset comprising images referred to as key images and a decoy image subset comprising images referred to as decoy images. The apparatus displays the key images to the user to teach the key images to the user. Then, to authenticate the user, the apparatus produces an assortment of decoy images and key images, and displays the assortment to the user. The apparatus receives from the user identification of images held as key images and verifies whether the identification of key images matched with the key images selected by the processor.

User authentication

A method and apparatus are presented for providing language translation assistance to a user of a mobile terminal. The terminal makes available a number of language translation services to the user, and the mobile terminal has a database for storing translation data. If the translation data is insufficient to cover a present or anticipated context of the mobile terminal, then the terminal sends a context change signal, and subsequently receives a data update signal that includes updates to the database. The terminal is then able to provide a changed language translation service to the user, utilizing the updates to the database.

Dynamic context-sensitive translation dictionary for mobile phones

A method, apparatus and computer program product are provided for secure software download or installation. In this regard, sensory notifications and cognitive activities are implemented prior to proceeding to a download or installation procedure. For example, a sensory notification can be provided if security attributes of software are noncompliant with security preferences. Additionally, performance of a task can be required if security attributes of software are noncompliant with the security preferences prior to installation of the software, wherein requiring performance of a task comprises selecting the task such that the task is variable from one installation of the software to another installation of the software.

Method, apparatus and computer program product for secure software installation

A method distributes connection admission control. Traffic flows are distributed locally at network nodes based on determined path weights and dynamic link costs. A traffic source node is sent a back-off signal if a distributing node becomes congested. A received request to admit a new traffic flow to the communications network is admitted if the node receiving the request has not received a back-off signal, and is rejected if the node receiving the request has received a back-off signal and fails to redistribute its traffic flows. Distributed connection admission control is allowed in which only local events need to be monitored to decide whether to admit a new traffic flow or not.

Distributed connection admission-control

A bandwidth estimation in a resource of a data communication system. After a data unit in a data flow has been received, a recent pulse density for the data flow over a period that includes the received data unit and starts from a time point that precedes the received data unit in the flow is computed. An overall pulse density is computed based on the computed recent pulse density and a previous overall pulse density computed earlier for the data flow. The computation of the overall pulse density is based on values of the computed recent pulse density and the previous overall pulse density. The values are weighted relative to each other. The used bandwidth is estimated based on the weighted overall pulse density.

Bandwidth estimation

The present invention concerns a dynamic load distributing method and system using local state information in a communication network comprising nodes connected by links. State information is transmitted from one or more nodes to one or more neighboring nodes. A traffic flow comprising packets is originated at a source node to be transmitted to a destination node via available paths. Weights are determined for the available paths as a decreasing function of cost of the corresponding path, state information of the present node and received state information of one or more nodes at the corresponding path. One of the paths is selected based on the determined weights. The traffic flow is dispatched to the next node of the selected path. Said determining weights, selecting paths and dispatching the traffic flow is repeated at one or more nodes via which the traffic flow is forwarded.

Dynamic load distribution using local state information

The present invention relates to a method and network element for classification of bit strings such as data packets on a per-flow basis, wherein a plurality of classification fields are searched for in respective search trees based on a matching procedure in which an index value is obtained in a leaf node of a search tree for each classification field. Index values obtained in said searching step are used to derive a policy to be applied to said data packet, wherein the number of index values is reduced by combining intermediate results of the searching step or the deriving step. Thereby, computational efficiency can be improved and memory requirements reduced.

Growing community of inventors

Espoo, Finland

Andreas Heiner