Abstract: A method for monitoring browsers (B) for a communications network (N), wherein a monitoring server contains a set of monitoring elements, and implements: ?—a step (E1) of receiving a monitoring element request from a browser (B), ?—a step (E2) of determining whether the request is a first request from the browser, ?—if so, a step (E3) of calculating an identifier for the browser, then a step (4) of determining a cache duration value associated with each monitoring element of the set, and a step (E5) of transmitting the set of monitoring elements and associated values to the browser; ?—if not, a step (E6) of determining the browser's identifier based on the monitoring elements requested in the request.

Abstract: A method for monitoring browsers (B) for a communications network (N), wherein a monitoring server contains a set of monitoring elements, and implements:—a step (E1) of receiving a monitoring element request from a browser (B),—a step (E2) of determining whether the request is a first request from the browser,—if so, a step (E3) of calculating an identifier for the browser, then a step (E4) of determining a cache duration value associated with each monitoring element of the set, and a step (E5) of transmitting the set of monitoring elements and associated values to the browser;—if not, a step (E6) of determining the browser's identifier based on the monitoring elements requested in the request.

Abstract: A method, system, and devices for online inserting messages in at least one social network content application of a plurality of social network content applications of at least one social network platform is described. The method includes collecting a plurality of social network messages originating from the plurality of social network content applications, determining a set of messages having a certain degree of similarity from the plurality of social network messages, by comparing each message with each further message of the plurality of message, extracting a topic from the plurality of social network messages included in the set of messages having at least the certain degree of similarity, and determining a second certain degree of similarity between the topic and an second message of a plurality of second messages based on the degree of similarity between respective suffix trees corresponding to each message of the messages.

Abstract: The present invention relates to a method, system and related devices for online inserting messages in at least one social network content application of a plurality of social network content applications of at least one social network platform, said method comprising the steps of collecting a plurality of social network messages originating from said plurality of social network applications, wherein said method further comprises the steps of determining a set of messages having a certain degree of similarity from said plurality of said social network messages, by comparing each message with each further message of said plurality of messages and extracting a topic from said plurality of social network messages originating from said plurality of social network applications included in said set of messages having at least a certain degree of similarity and determining a second certain degree of similarity between said topic and an second message of a plurality of second messages based on said degree of similari

Abstract: A Computer implemented method of ranking information objects within a collection of information objects linked by a collection of links, the collection of information objects comprising information objects of a first nature and of a second nature, the links being associated to a link type selected among a plurality of link types, the method comprising: allocating a qualification weight to each link, selecting a plurality of paths comprising a sequence of information objects linked by a sequence of the links, for each information object, computing a score as a function of the respective contributions of the links that point to the information object, the contribution of a link being a function of the number of times the link has been selected in the path selection step and the qualification weight of the link, ranking the information objects as a function of the respective scores.

Abstract: A method for monitoring browsers (B) for a communications network (N), wherein a monitoring server contains a set of monitoring elements, and implements: —a step (E1) of receiving a monitoring element request from a browser (B), —a step (E2) of determining whether the request is a first request from the browser, —if so, a step (E3) of calculating an identifier for the browser, then a step (E4) of determining a cache duration value associated with each monitoring element of the set, and a step (E5) of transmitting the set of monitoring elements and associated values to the browser; —if not, a step (E6) of determining the browser's identifier based on the monitoring elements requested in the request.

Abstract: A Computer implemented method of ranking information objects within a collection of information objects linked by a collection of links, the collection of information objects comprising information objects of a first nature and of a second nature, the links being associated to a link type selected among a plurality of link types, the method comprising: allocating a qualification weight to each link, selecting a plurality of paths comprising a sequence of information objects linked by a sequence of the links, for each information object, computing a score as a function of the respective contributions of the links that point to the information object, the contribution of a link being a function of the number of times the link has been selected in the path selection step and the qualification weight of the link, ranking the information objects as a function of the respective scores.

Abstract: When aggregating syndicated Web content, updated content is retrieved from predetermined Web feeds. The updated content is compared with stored content previously retrieved. If the updated content is determined to be different from the stored content, the updated content is stored. If the updated content is determined to be identical to the stored content, the updated content is delete.

Abstract: A method for dynamically monitoring a group of wirelessly communicating mobile entities, characterized in that it comprises: assigning each entity a unique identifier; saving within a referring entity the list of the identifiers of all of the entities in the group; determining, for each entity, a vicinity with a predetermined radius; repeatedly, for each entity in the group: detecting the other entities located in its vicinity; transmitting a message to the detecting entities, said message containing at least the identifier of the entity, to be relayed to the referring entity; collecting, within the referring entity, the messages relayed to it; creating a list of identifiers contained within the messages; comparing this list to the saved list; if the lists are identical, determining the cohesive group; otherwise, determining the non-cohesive group.

Abstract: Method for aggregating syndicated Web content, comprising the steps of: Retrieving (100) updated content from predetermined Web feeds; Comparing (120) said updated content with stored content previously retrieved; Storing (160) the updated content if it is considered different from the stored content; Deleting (170) the updated content if it is considered identical to the stored content.

Abstract: A method for dynamically monitoring a group of wirelessly communicating mobile entities, characterized in that it comprises: assigning each entity a unique identifier; saving within a referring entity the list of the identifiers of all of the entities in the group; determining, for each entity, a vicinity with a predetermined radius; repeatedly, for each entity in the group: detecting the other entities located in its vicinity; transmitting a message to the detecting entities, said message containing at least the identifier of the entity, to be relayed to the referring entity; collecting, within the referring entity, the messages relayed to it; creating a list of identifiers contained within the messages; comparing this list to the saved list; if the lists are identical, determining the cohesive group; otherwise, determining the non-cohesive group.