Abstract: A method for merging information of high semantic level representing complex situations including several objects originating from several sensors ci, said information possibly being heterogeneous, said method including acquiring the various items of information arising from said sensors in raw form and transforming them so as to cast them into the form of conceptual graphs, a conceptual graph representing several concepts and the relations which exist between them, and being composed of entity nodes and relation nodes, with E the set of concept nodes defined on a support S, G1 and G2 two conceptual graphs defined on S, wherein the method determines a merging strategy denoted strategymerge as follows: strategymerge=fmerge?fcomp:E×E?E?{E×E} and said merging strategy is applied to the various items of information taking the form of graphs.

Abstract: The invention pertains to a method for configuring rules for distributing personal data of a social network user (U) with respect to a target contact (CC). The method consists of retrieving behavioral data of the target contact. Based on this retrieved behavioral data and a sensitivities profile defined by the user, an assessment grade is assigned to the target contact with respect to the danger that he or she represents of propagating the user's personal data. Based on the grade assigned to the target contact, a recommendation to configure the rules for distributing his or her personal data is issued to the user.

Abstract: A method for merging information of high semantic level representing complex situations including several objects originating from several sensors ci, said information possibly being heterogeneous, said method including acquiring the various items of information arising from said sensors in raw form and transforming them so as to cast them into the form of conceptual graphs, a conceptual graph representing several concepts and the relations which exist between them, and being composed of entity nodes and relation nodes, with E the set of concept nodes defined on a support S, G1 and G2 two conceptual graphs defined on S, wherein the method determines a merging strategy denoted strategymerge as follows: strategymerge=fmerge?fcomp:E×E?E?{E×E} and said merging strategy is applied to the various items of information taking the form of graphs.