Suchergebnisse

National audience ; L'archivage du Web est un processus de collecte, de sélection, d'enrichissement, de stockage, de préservation et de mise à disposition des informations du Web actuel, afin qu'elles restent accessibles aux utilisateurs dans l'avenir. L'objectif de cette démarche est de permettre, par exemple, à un historien dans trente ans de pouvoir étudier la manière dont un événement politique a été commenté par les parties prenantes, les médias et les simples utilisateurs du Web ; à un juge de pouvoir décider dans cinq ans si telle action était en violation des termes d'utilisation d'un service Web tels qu'ils étaient formulés à l'époque des faits ; ou encore, à un sociologue de réaliser dans vingt ans une étude diachronique d'une communauté à travers les traces que cette communauté a laissées sur le Web.

National audience ; L'archivage du Web est un processus de collecte, de sélection, d'enrichissement, de stockage, de préservation et de mise à disposition des informations du Web actuel, afin qu'elles restent accessibles aux utilisateurs dans l'avenir. L'objectif de cette démarche est de permettre, par exemple, à un historien dans trente ans de pouvoir étudier la manière dont un événement politique a été commenté par les parties prenantes, les médias et les simples utilisateurs du Web ; à un juge de pouvoir décider dans cinq ans si telle action était en violation des termes d'utilisation d'un service Web tels qu'ils étaient formulés à l'époque des faits ; ou encore, à un sociologue de réaliser dans vingt ans une étude diachronique d'une communauté à travers les traces que cette communauté a laissées sur le Web.

Internet supports public IP communications. It is composed of over 20 000 smaller networks called Autonomous Systems (AS). ASs belong to various administrative entities : network operators, universities, companies. Each of them has global connectivity to any other, thanks to interdomain routing handled by BGP (Border Gateway Protocol). Bilateral connections between ASs support business agreements to guarrantee Internet connectivity. During the negociation of an economical relationship between two ASs, the two administrative entities agree on network availability, price, bandwith, and ratio of the amount of trafic they send to each other. They may also restrict the set of reachable destinations they share. This economic market of network interconnections is not regulated. Typically, long-term actors take advantage of their market position to negociate their economic relationships, and large players such as content providers or access providers use providers in competition in multiple locations to minimize their cost and maximize their availability through redundancy. In interdomain topology, BGP routes are rather economical paths than shortest AS paths. Economic business agreements between ASs are private but they shape Internet routes as they define a great part of BGP route-redistribution filters. In this Ph. D. thesis, we solve several difficult problems dealing with reverse engineering of the Internet. We start by an introduction on Internet economy and interdomain routing with the BGP protocol. Then, we successively review several works respectively on : measuring the Internet topology, determining economic properties of Internet and infering Internet routing policies. We study three problems in this thesis : the measurement of a stable AS-level topology, the inference of AS business relationships and the modeling of interdomain routing at the AS-level. We propose a set of tools that bring insights on Internet economics for an operator like France Telecom. Knowledge produced by our algorithms is of great ...

Internet supports public IP communications. It is composed of over 20 000 smaller networks called Autonomous Systems (AS). ASs belong to various administrative entities : network operators, universities, companies. Each of them has global connectivity to any other, thanks to interdomain routing handled by BGP (Border Gateway Protocol). Bilateral connections between ASs support business agreements to guarrantee Internet connectivity. During the negociation of an economical relationship between two ASs, the two administrative entities agree on network availability, price, bandwith, and ratio of the amount of trafic they send to each other. They may also restrict the set of reachable destinations they share. This economic market of network interconnections is not regulated. Typically, long-term actors take advantage of their market position to negociate their economic relationships, and large players such as content providers or access providers use providers in competition in multiple locations to minimize their cost and maximize their availability through redundancy. In interdomain topology, BGP routes are rather economical paths than shortest AS paths. Economic business agreements between ASs are private but they shape Internet routes as they define a great part of BGP route-redistribution filters. In this Ph. D. thesis, we solve several difficult problems dealing with reverse engineering of the Internet. We start by an introduction on Internet economy and interdomain routing with the BGP protocol. Then, we successively review several works respectively on : measuring the Internet topology, determining economic properties of Internet and infering Internet routing policies. We study three problems in this thesis : the measurement of a stable AS-level topology, the inference of AS business relationships and the modeling of interdomain routing at the AS-level. We propose a set of tools that bring insights on Internet economics for an operator like France Telecom. Knowledge produced by our algorithms is of great ...

Internet supports public IP communications. It is composed of over 20 000 smaller networks called Autonomous Systems (AS). ASs belong to various administrative entities : network operators, universities, companies. Each of them has global connectivity to any other, thanks to interdomain routing handled by BGP (Border Gateway Protocol). Bilateral connections between ASs support business agreements to guarrantee Internet connectivity. During the negociation of an economical relationship between two ASs, the two administrative entities agree on network availability, price, bandwith, and ratio of the amount of trafic they send to each other. They may also restrict the set of reachable destinations they share. This economic market of network interconnections is not regulated. Typically, long-term actors take advantage of their market position to negociate their economic relationships, and large players such as content providers or access providers use providers in competition in multiple locations to minimize their cost and maximize their availability through redundancy. In interdomain topology, BGP routes are rather economical paths than shortest AS paths. Economic business agreements between ASs are private but they shape Internet routes as they define a great part of BGP route-redistribution filters. In this Ph. D. thesis, we solve several difficult problems dealing with reverse engineering of the Internet. We start by an introduction on Internet economy and interdomain routing with the BGP protocol. Then, we successively review several works respectively on : measuring the Internet topology, determining economic properties of Internet and infering Internet routing policies. We study three problems in this thesis : the measurement of a stable AS-level topology, the inference of AS business relationships and the modeling of interdomain routing at the AS-level. We propose a set of tools that bring insights on Internet economics for an operator like France Telecom. Knowledge produced by our algorithms is of great ...

International audience ; —In this paper we present our system Faces of Politics (henceforth FoP), that is able to continuously learn multimedia knowledge of Web multimedia resources about the presence of person(s) in a pictures and to leverage this knowledge to the Linked Open Data cloud (LOD-cloud). FoP promotes both scalability of the data lift process for this domain and a structured knowledge representation for complex queries. The system was bootstraped using Freebase data about politicians and their pictures, and we show that the model provides a good generalization with an error rate below 7%. Meantime, FoP not only relates a person to a multimedia resource, but it also detects and publishes metadata on the position of the person in the picture. Moreover, it supports the presence of several persons in the picture. At this step, FoP is also giving data in return to the LoD cloud that fed him in the first place: it leverages Linked Data on people recognized in these pictures, and on which rectangle area. This allows fine-grained queries like creating a curation of documents in which a person is depicted relatively to another for instance. On a technical point-of-view, we also provide a Website for browsing FoP knowledge base as Web users, and we also offer a public SPARQL endpoint for robots or other Web applications.

International audience ; —In this paper we present our system Faces of Politics (henceforth FoP), that is able to continuously learn multimedia knowledge of Web multimedia resources about the presence of person(s) in a pictures and to leverage this knowledge to the Linked Open Data cloud (LOD-cloud). FoP promotes both scalability of the data lift process for this domain and a structured knowledge representation for complex queries. The system was bootstraped using Freebase data about politicians and their pictures, and we show that the model provides a good generalization with an error rate below 7%. Meantime, FoP not only relates a person to a multimedia resource, but it also detects and publishes metadata on the position of the person in the picture. Moreover, it supports the presence of several persons in the picture. At this step, FoP is also giving data in return to the LoD cloud that fed him in the first place: it leverages Linked Data on people recognized in these pictures, and on which rectangle area. This allows fine-grained queries like creating a curation of documents in which a person is depicted relatively to another for instance. On a technical point-of-view, we also provide a Website for browsing FoP knowledge base as Web users, and we also offer a public SPARQL endpoint for robots or other Web applications.

International audience ; —In this paper we present our system Faces of Politics (henceforth FoP), that is able to continuously learn multimedia knowledge of Web multimedia resources about the presence of person(s) in a pictures and to leverage this knowledge to the Linked Open Data cloud (LOD-cloud). FoP promotes both scalability of the data lift process for this domain and a structured knowledge representation for complex queries. The system was bootstraped using Freebase data about politicians and their pictures, and we show that the model provides a good generalization with an error rate below 7%. Meantime, FoP not only relates a person to a multimedia resource, but it also detects and publishes metadata on the position of the person in the picture. Moreover, it supports the presence of several persons in the picture. At this step, FoP is also giving data in return to the LoD cloud that fed him in the first place: it leverages Linked Data on people recognized in these pictures, and on which rectangle area. This allows fine-grained queries like creating a curation of documents in which a person is depicted relatively to another for instance. On a technical point-of-view, we also provide a Website for browsing FoP knowledge base as Web users, and we also offer a public SPARQL endpoint for robots or other Web applications.

International audience ; —In this paper we present our system Faces of Politics (henceforth FoP), that is able to continuously learn multimedia knowledge of Web multimedia resources about the presence of person(s) in a pictures and to leverage this knowledge to the Linked Open Data cloud (LOD-cloud). FoP promotes both scalability of the data lift process for this domain and a structured knowledge representation for complex queries. The system was bootstraped using Freebase data about politicians and their pictures, and we show that the model provides a good generalization with an error rate below 7%. Meantime, FoP not only relates a person to a multimedia resource, but it also detects and publishes metadata on the position of the person in the picture. Moreover, it supports the presence of several persons in the picture. At this step, FoP is also giving data in return to the LoD cloud that fed him in the first place: it leverages Linked Data on people recognized in these pictures, and on which rectangle area. This allows fine-grained queries like creating a curation of documents in which a person is depicted relatively to another for instance. On a technical point-of-view, we also provide a Website for browsing FoP knowledge base as Web users, and we also offer a public SPARQL endpoint for robots or other Web applications.

International audience ; Several private Web search solutions have been proposed to preserve the user privacy while querying search engines. However, most of these solutions are costly in term of processing , network overhead and latency as they mostly rely on cryptographic techniques and/or the generation of fake requests. Furthermore, all these solutions protect all queries similarly, ignoring whether the original request contains sensitive content (e.g., religious, political or sexual orientation) or not. Based on an analysis of a real dataset of Web search requests, we show that queries related to sensitive matters are in practice a minority. As a consequence, protecting all queries similarly results in poor performance as a large number of queries get overprotected. In this paper, we propose a request sensitivity assessment module that we use for improving the practicability of existing private web search solutions. We assess the sensitivity of a request in two phases: a semantic sensitivity analysis (based on the topic of the query) and a request linkability analysis (based on the similarity between the current query and the query history of the requester). Finally, the sensitivity assessment is used to adapt the level of protection of a given query according to its identified degree of sensitivity: the more sensitive a query is, the more protected it will be. Experiments with a real dataset show that our approach can improve the performance of state-of-the-arts private Web search solutions by reducing the number of queries overpro-tected, while ensuring a similar level of privacy to the users, making them more likely to be used in practice.

International audience ; Several private Web search solutions have been proposed to preserve the user privacy while querying search engines. However, most of these solutions are costly in term of processing , network overhead and latency as they mostly rely on cryptographic techniques and/or the generation of fake requests. Furthermore, all these solutions protect all queries similarly, ignoring whether the original request contains sensitive content (e.g., religious, political or sexual orientation) or not. Based on an analysis of a real dataset of Web search requests, we show that queries related to sensitive matters are in practice a minority. As a consequence, protecting all queries similarly results in poor performance as a large number of queries get overprotected. In this paper, we propose a request sensitivity assessment module that we use for improving the practicability of existing private web search solutions. We assess the sensitivity of a request in two phases: a semantic sensitivity analysis (based on the topic of the query) and a request linkability analysis (based on the similarity between the current query and the query history of the requester). Finally, the sensitivity assessment is used to adapt the level of protection of a given query according to its identified degree of sensitivity: the more sensitive a query is, the more protected it will be. Experiments with a real dataset show that our approach can improve the performance of state-of-the-arts private Web search solutions by reducing the number of queries overpro-tected, while ensuring a similar level of privacy to the users, making them more likely to be used in practice.

International audience ; Several private Web search solutions have been proposed to preserve the user privacy while querying search engines. However, most of these solutions are costly in term of processing , network overhead and latency as they mostly rely on cryptographic techniques and/or the generation of fake requests. Furthermore, all these solutions protect all queries similarly, ignoring whether the original request contains sensitive content (e.g., religious, political or sexual orientation) or not. Based on an analysis of a real dataset of Web search requests, we show that queries related to sensitive matters are in practice a minority. As a consequence, protecting all queries similarly results in poor performance as a large number of queries get overprotected. In this paper, we propose a request sensitivity assessment module that we use for improving the practicability of existing private web search solutions. We assess the sensitivity of a request in two phases: a semantic sensitivity analysis (based on the topic of the query) and a request linkability analysis (based on the similarity between the current query and the query history of the requester). Finally, the sensitivity assessment is used to adapt the level of protection of a given query according to its identified degree of sensitivity: the more sensitive a query is, the more protected it will be. Experiments with a real dataset show that our approach can improve the performance of state-of-the-arts private Web search solutions by reducing the number of queries overpro-tected, while ensuring a similar level of privacy to the users, making them more likely to be used in practice.

International audience ; Several private Web search solutions have been proposed to preserve the user privacy while querying search engines. However, most of these solutions are costly in term of processing , network overhead and latency as they mostly rely on cryptographic techniques and/or the generation of fake requests. Furthermore, all these solutions protect all queries similarly, ignoring whether the original request contains sensitive content (e.g., religious, political or sexual orientation) or not. Based on an analysis of a real dataset of Web search requests, we show that queries related to sensitive matters are in practice a minority. As a consequence, protecting all queries similarly results in poor performance as a large number of queries get overprotected. In this paper, we propose a request sensitivity assessment module that we use for improving the practicability of existing private web search solutions. We assess the sensitivity of a request in two phases: a semantic sensitivity analysis (based on the topic of the query) and a request linkability analysis (based on the similarity between the current query and the query history of the requester). Finally, the sensitivity assessment is used to adapt the level of protection of a given query according to its identified degree of sensitivity: the more sensitive a query is, the more protected it will be. Experiments with a real dataset show that our approach can improve the performance of state-of-the-arts private Web search solutions by reducing the number of queries overpro-tected, while ensuring a similar level of privacy to the users, making them more likely to be used in practice.

Lorsque le numérique saisit le territoire, il ne le fait jamais de façon univoque. Une « politique numérique » qui se projette sur un territoire ne peut que renforcer la définition classique du territoire, qui se résume à la projection d'un pouvoir sur un espace défini par des frontières et approprié comme idéologie (Lussault, 2007). Cette définition produit déjà des dimensions qui ne seront pas nécessairement présentes de la même façon selon les choix stratégiques effectués : un pouvoir, des frontières, une idéologie. La seule présence de l'idéologie ouvre la dimension double des territoires référés aux états-nations : non seulement des états mais aussi des nations, c'est-à-dire encore des « communautés imaginées » (Anderson, 1991). Apparait ainsi un effet d'agencement particulier : si les agencements étatiques sont massivement topographiques, cela ne résume pas le travail des états qui peuvent et doivent avoir des dimensions topologiques dans les relations de pouvoir et d'influence qu'ils mobilisent (Levy, 2002). Nous chercherons ici à ouvrir encore la possibilité des combinaisons pour montrer que l'émergence des réseaux numériques et la traçabilité généralisée qu'ils instaurent nous obligent à penser un agencement chronologique des territoires, ce qui, au bout du compte, pourrait même remettre en cause la pertinence du concept de territoire pour penser ces processus.

Lorsque le numérique saisit le territoire, il ne le fait jamais de façon univoque. Une « politique numérique » qui se projette sur un territoire ne peut que renforcer la définition classique du territoire, qui se résume à la projection d'un pouvoir sur un espace défini par des frontières et approprié comme idéologie (Lussault, 2007). Cette définition produit déjà des dimensions qui ne seront pas nécessairement présentes de la même façon selon les choix stratégiques effectués : un pouvoir, des frontières, une idéologie. La seule présence de l'idéologie ouvre la dimension double des territoires référés aux états-nations : non seulement des états mais aussi des nations, c'est-à-dire encore des « communautés imaginées » (Anderson, 1991). Apparait ainsi un effet d'agencement particulier : si les agencements étatiques sont massivement topographiques, cela ne résume pas le travail des états qui peuvent et doivent avoir des dimensions topologiques dans les relations de pouvoir et d'influence qu'ils mobilisent (Levy, 2002). Nous chercherons ici à ouvrir encore la possibilité des combinaisons pour montrer que l'émergence des réseaux numériques et la traçabilité généralisée qu'ils instaurent nous obligent à penser un agencement chronologique des territoires, ce qui, au bout du compte, pourrait même remettre en cause la pertinence du concept de territoire pour penser ces processus.