Nokia Corporation

Nokia Technologies Oy

Nokia Mobile Phones Limited

Thomson Reuters Enterprise Centre Gmbh

Thomson Reuters Global Resources Unlimited Company

Camelot UK Bidco Limited

Nikolai Nefedov

Debmalya Biswas

Mikko Aleksi Uusitalo

Ari T Hottinen

Guillaume Sebire

Valtteri Niemi

Olivier Dousse

Markku Anttoni Oksanen

Jan Waerniers

Juha Kalevi Laurila

Markku Pukkila

Ekaterina Suvorova

Brian Ulicny

James Pringle

Eftim Pop-Lazarov

Taneli Mielikainen

Manuel Enrique Ramirez Montalvo

The present invention relates to a computer-based system for supporting Product Customer Support Systems by means for parameter-free and fully unsupervised: clustering of a selected set documents (e.g., based on a query from some database) with unknown ontology (e.g., cases from Customer Support System); building a taxonomy for sets of documents with unknown ontology/taxonomy; enabling a semi-supervised tagging/navigation/recommendations for documents and cross-learning using auxiliary sources (e.g., linking other fields/metadata in Customer Support Systems such as Knowledge DataBase).

Clustering and tagging engine for use in product support systems

Exemplary embodiments of the present disclosure provide for cleansing data generated by one or more servers in response to database interactions resulting from an automated software robot interacting with the one or more servers via a telecommunications network. Log entries in usage logs corresponding to events during a session can be analyzed to determine relationships between events and the usage logs can be classified based on the relationships as either corresponding to human behavior or automated software robot behavior. Usage logs corresponding to automated software robot behavior can be removed from further analysis.

Systems and methods for cleansing automated robotic traffic

An approach is provided for policy adaption based on application policy compliance analysis. The compliance platform processes and/or facilitates a processing of one or more policy compliance logs associated with at least one application to determine one or more policy compliance profiles associated with the at least one application. The compliance platform determines one or more contexts under which the at least one application operates. The compliance platform causes, at least in part, an association of the one or more policy compliance profiles with the one or more contexts. The compliance platform then processes and/or facilitates a processing of user contextual information, user application use information, or a combination thereof against the association, the one or more policy compliance profiles, the one or more contexts, or a combination thereof to determine one or more adaptions to one or more policies associated with the at least one application.

Method and apparatus for policy adaption based on application policy compliance analysis

The present invention provides a method and system delivering graph-based metric to measure a similarity between weighted sets of classifications codes (presented as nodes) defined on hierarchical taxonomy trees. The suggested method is applied to find company peers in a particular domain, e.g., the IP domain based on a company patent portfolio. The suggested method may be applied to other domains that include hierarchical classifications such as trademarks, legal documents, scientific papers, lawsuits etc.

Method and system for peer detection

A sender and a receiver includes first and second arrays of coupled oscillators, respectively, that are substantially identically constructed so as to exhibit substantially the same dynamical response to excitation. A chaotic waveform generated at the sender is transmitted to the receiver, which generates a second chaotic waveform, and compares the received waveform with the generated second waveform. If the first and second waveforms match the sender is an authorized sender. An integrated circuit includes an array of coupled oscillators that in combination generate a waveform in response to at least one excitation signal. The array of coupled oscillators represents, in response to application of the excitation signals, a multi-dimensional security key that is shared between the sender of the waveform and the receiver of the waveform.

Encryption/identification using array of resonators at transmitter and receiver

An approach is provided for compressing location trajectories based on map structure. A compression platform causes, at least in part, a mapping of at least one location trajectory to at least one map to determine one or more intersections traveled along the at least one location trajectory. The compression platform further determines at least one compression key based, at least in part, on one or more outgoing roads of the one or more intersections. The compression platform also causes, at least in part, a compression of the at least one location trajectory based, at least in part, on the at least one compression key.

Method and apparatus for providing location trajectory compression based on map structure

Disclosed is an apparatus, method and computer program device which send a prediction request to a prediction service to construct a prediction result, receives a prediction result and an estimation of accuracy of the prediction result from the prediction service and configures an application to adapt to at least one of user preferences, behavior and habits based upon the prediction result and estimation of accuracy of the prediction result. The prediction service can include an over-the-air server which is coupled to a prediction server or a dedicated API residing on one or more user devices and configured to access a prediction server.

Predictive service for third party application developers

The exemplary embodiments of the invention enable self-organizing decentralized functionalities in wireless networks, such as ones having an arbitrary topology (e.g., cognitive radio networks), that utilize non-continuous communication, such as packet-based communication. In one exemplary embodiment of the invention, a method includes: making at least one locally available decision or measurement by a first apparatus; and performing a local exchange of information between the first apparatus and at least one second apparatus within a decentralized wireless communication network that at least partially utilizes packet-based communication, wherein the local exchange of information enables cooperation between the first apparatus and the at least one second apparatus in making a collective decision at least partially based on at least one local decision or measurement.

Apparatus, methods, and computer program products providing improved communication in decentralized wireless networks

This invention provides an iterative PCZZ data decoder that includes circuitry for utilizing all extrinsic information during iterative decoding by updating likelihood information for parity bits L, i=1, . . . , M during iterations. The extrinsic information for the parity bits is included in iterations by re-calculating soft values for parity bits Lfor each iteration k. In one embodiment the parity bit soft values are re-calculated in a plurality of circuit blocks following Max-Log-APP (MLA) decoder blocks, based on soft values for data bits L. In another embodiment the parity bit soft values are re-calculated recursively within the plurality of MLA decoders. The decoder operates to control the convergence of the decoder by monitoring a soft value of one parity check symbol, e.g., L[p(IM)], where p(IM) represents the last parity check bit in an I&#xd7;M parity check array. A decoder iteration stopping rule may be implemented by testing a likelihood measure associated with a last parity check symbol in a parity check column. In one case the likelihood measure may be given by L[p(IM]&#x3e;threshold, and in another case the likelihood measure may be given by L[p(I)]&#x3e;threshold. The likelihood measure is given in general by: L[p(I)]&#x3e;threshold, L[p(2I)]&#x3e;threshold, . . . , L[p(IM)]&#x3e;threshold, where the value of the threshold is a function of data block size.

Low complexity decoding schemes for single-parity-check (SPC) based concatenated codes

A channel coding method, apparatus and computer program product that provides efficient hybrid automatic repeat request (HARQ) comprising low complexity rate compatible zigzag codes, and by further applying data reshaping in combination with rate matching rules to substantially avoid sub-optimality due to puncturing, in combination with irregular parallel concatenation of zigzag (PCZZ) codes. Presently preferred rate matching rules comprise: (1) maintaining a PCZZ parameter &#x394;J as small as possible; and (2) creating a code having the shortest rows; where a code with J=1 gives the lowest coding rate (mother code) with PCZZ parameters (K, 1, 3). Data reshaping shapes K information bits into a plurality of arrays by associating a parity bit with each row of an array. Each array of the plurality has a different number of rows as compared to each other array in order to match rates. Row length within an array may be allowed to vary &#x394;J within constraints in order to exactly match a data rate.

Low complexity hybrid ARQ scheme based on rate compatible zigzag codes

Method and apparatus for detecting a signal are disclosed, wherein first set of symbols represents a signal received in a receiver. A second set of symbols is estimated, representing the signal transmitted at a transmitter using a sphere decoding technique. The estimation may employ at least two modulation schemes. Reliability information relating to bits forming a symbol may be determined for at least one symbol of the second set. Furthermore, reliability information relating to the signal may be taken into account in estimating at least one symbol of the second set.

Signal detection using sphere decoding technique

A method and system are directed to enabling a detector to perform relatively accurate channel estimates on blocks of data that include relatively short training sequences in wireless communication signals. Channel re-estimation is performed by transferring the estimation calculations from the time domain into a channel state domain. In one embodiment, information obtained from known training sequences and unknown data may be combined to generate an initial channel estimate. An embodiment of a new recursive Expectation Maximization (EM) process generally i) initializes the EM process with the initial channel estimate; ii) determines updates for the channel estimates; iii) produces a reduced observation vector; iv) generates a special sequence of channel states; v) rearranges each channel state estimate in the reduced observation vector; vi) generates a low-dimensional channel model matrix inversion based on the generated special sequence of channel states; and vii) generates channel estimates based on the generated matrix inversion.

Method and system for channel estimation using iterative estimation and detection

A data coder includes a combined parallel concatenated convolution coder (PCCC) and a parallel concatenated zigzag (PCZZ) coder, where PCCC functional blocks are re-used in the PCZZ coder for coding at high coding rates. The PCZZ coding rate (R) may be changed by re-partitioning at least one interleaver pattern. A second interleaver for the PCZZ coder is obtained by a transform of an initial interleaving vector. Alternatively, the PCZZ coder re-uses a PCCC interleaver. The PCZZ coder may also use a multi-dimensional concatenation of zigzag codes, and it is shown one may add additional code dimensions (and relevant parity check symbols) by using properties of already specified interleaver(s), and without adding more interleaver(s).

Low decoding complexity concatenated codes for high rate coded transmission

A method is presented for conveying information over a wireless interface in the form of a digitally encoded message. A set of bits is provided as a first piece of information to be transmitted, and a certain baseband signal processing method is applied to process the bits to be transmitted. In addition, a second piece of information is provided to be transmitted and the baseband signal processing method is selected from a set of allowed baseband signal processing methods in accordance with the provided second piece of information.

Growing community of inventors

Espoo, Finland

Nikolai Nefedov