Publications équipe SMIS - 2012

Articles

  1. Shaoyi Yin and Philippe Pucheral. PBFilter: a Flash-Based Indexing Scheme for Embedded Systems. Information Systems 37(7):634-653, 2012.
    Abstract NAND Flash has become the most widely used electronic stable storage technology for embedded systems. As on-board storage capacity increases, the need for efficient indexing techniques arises. Such techniques are very challenging to design due to a combination of NAND Flash constraints (e.g., block-erase-before-page-rewrite constraint and limited number of erase cycles) and embedded system constraints (e.g., tiny RAM and resource consumption predictability). Previous work adapted traditional indexing methods to cope with Flash constraints by deferring index updates using a log and batching them to decrease the number of rewrite operations in Flash memory. However, these methods were not designed with embedded system constraints in mind and do not address them properly. In this paper, we propose a different alternative for indexing Flash-resident data that specifically addresses the embedded context. This approach, called PBFilter, organizes the index structure in a purely sequential way. Key lookups are sped up thanks to two principles called Summarization and Partitioning. We instantiate these principles with data structures and algorithms based on Bloom Filters and show the effectiveness of this approach through a comprehensive analytical performance study. Extensions of PBFilter on range queries and multi-criteria queries are also discussed. The proposed technique is integrated into a full-fledged embedded DBMS engine. We describe the complete design of the DBMS engine to illustrate the feasibility of adopting PBFilter technique in a real system. Finally, we show some performance measurements of the prototype on top of a real hardware platform, in order to validate the new technique in a practical manner. URL BibTeX

    @article{YiPu12,
    	author = "Yin, Shaoyi and Pucheral, Philippe",
    	title = "{PBFilter: a Flash-Based Indexing Scheme for Embedded Systems}",
    	journal = "Information Systems",
    	year = 2012,
    	volume = 37,
    	pages = "634-653",
    	number = 7,
    	abstract = "{NAND Flash has become the most widely used electronic stable storage technology for embedded systems. As on-board storage capacity increases, the need for efficient indexing techniques arises. Such techniques are very challenging to design due to a combination of NAND Flash constraints (e.g., block-erase-before-page-rewrite constraint and limited number of erase cycles) and embedded system constraints (e.g., tiny RAM and resource consumption predictability). Previous work adapted traditional indexing methods to cope with Flash constraints by deferring index updates using a log and batching them to decrease the number of rewrite operations in Flash memory. However, these methods were not designed with embedded system constraints in mind and do not address them properly. In this paper, we propose a different alternative for indexing Flash-resident data that specifically addresses the embedded context. This approach, called PBFilter, organizes the index structure in a purely sequential way. Key lookups are sped up thanks to two principles called Summarization and Partitioning. We instantiate these principles with data structures and algorithms based on Bloom Filters and show the effectiveness of this approach through a comprehensive analytical performance study. Extensions of PBFilter on range queries and multi-criteria queries are also discussed. The proposed technique is integrated into a full-fledged embedded DBMS engine. We describe the complete design of the DBMS engine to illustrate the feasibility of adopting PBFilter technique in a real system. Finally, we show some performance measurements of the prototype on top of a real hardware platform, in order to validate the new technique in a practical manner.}",
    	affiliation = "Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM , SMIS - INRIA Rocquencourt",
    	annote = "revint",
    	audience = "internationale",
    	hal_id = "hal-00768380",
    	language = "Anglais",
    	url = "http://hal.archives-ouvertes.fr/hal-00768380"
    }
    
  2. Nicolas Anciaux, Jean-Marc Petit, Philippe Pucheral and Karine Zeitouni. Personal Data Server: Keeping Sensitive Data under the Indiviual's Control. ERCIM NEWS 90:39-40, 2012. BibTeX

    @article{APPZ12,
    	author = "{Anciaux, Nicolas and Petit, Jean-Marc and Pucheral, Philippe and Zeitouni, Karine}",
    	title = "{Personal Data Server: Keeping Sensitive Data under the Indiviual's Control}",
    	journal = "{ERCIM NEWS}",
    	year = "{2012}",
    	volume = "{90}",
    	pages = "{39-40}",
    	annote = "revint",
    	owner = "MOIS",
    	timestamp = "2012.10.31"
    }
    
  3. Nicolas Anciaux, Benjamin Nguyen and Michalis Vazirgiannis. The Minimum Exposure Project: Limiting Data Collection in Online Forms. ERCIM NEWS 90:41, 2012. BibTeX

    @article{ANVa12a,
    	author = "Anciaux, Nicolas and Nguyen, Benjamin and Vazirgiannis, Michalis",
    	title = "{The Minimum Exposure Project: Limiting Data Collection in Online Forms}",
    	journal = "{ERCIM NEWS}",
    	year = "{2012}",
    	volume = "{90}",
    	pages = "{41}",
    	annote = "revint",
    	owner = "MOIS",
    	timestamp = "2012.10.31"
    }
    

Inbook

  1. Ivan Bedini, Benjamin Nguyen, Christopher Matheus, F Patel-Schneider Peter and Aidan Boran. Mining XML Schemas to Extract Conceptual Knowledge. pages 79-105, IGI Global, 2012.
    Abstract One of the promises of the Semantic Web is to support applications that easily and seamlessly deal with heterogeneous data. Most data in the Web, however, is in the Extensible Markup Language (XML) format, but using XML requires applications to understand the format of each data source that they access. Achieving the benefits of the Semantic Web involves transforming XML into the Semantic Web languages, OWL (the Web Ontology Language) and RDF (the Resource Description Framework), a process that generally has manual or only semi-automatic components. In this chapter, the authors present a set of patterns that enable the automatic transformation from XML Schema into RDF and OWL, enabling the direct use of much XML data in the Semantic Web. They focus on a possible logical representation of the first language and present an implementation, including a comparison with related works. URL BibTeX

    @inbook{BNM+12,
    	pages = "79-105",
    	title = "{Mining XML Schemas to Extract Conceptual Knowledge}",
    	publisher = "IGI Global",
    	year = 2012,
    	author = "Bedini, Ivan and Nguyen, Benjamin and Matheus, Christopher and Patel-Schneider, Peter, F. and Boran, Aidan",
    	abstract = "{One of the promises of the Semantic Web is to support applications that easily and seamlessly deal with heterogeneous data. Most data in the Web, however, is in the Extensible Markup Language (XML) format, but using XML requires applications to understand the format of each data source that they access. Achieving the benefits of the Semantic Web involves transforming XML into the Semantic Web languages, OWL (the Web Ontology Language) and RDF (the Resource Description Framework), a process that generally has manual or only semi-automatic components. In this chapter, the authors present a set of patterns that enable the automatic transformation from XML Schema into RDF and OWL, enabling the direct use of much XML data in the Semantic Web. They focus on a possible logical representation of the first language and present an implementation, including a comparison with related works.}",
    	affiliation = "Alcatel Lucent Bell Labs , Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM , SMIS - INRIA Rocquencourt",
    	annote = "chapitre",
    	audience = "internationale",
    	booktitle = "{Semi-Automatic Ontology Development: Processes and Resources}",
    	hal_id = "hal-00768346",
    	isbn = 9781466601888,
    	language = "Anglais",
    	url = "http://hal.archives-ouvertes.fr/hal-00768346"
    }
    

Inproceedings

  1. Cuong Quoc To, Benjamin Nguyen and Philippe Pucheral. Secure global protocol for computing aggregate functions. In First AVSE Doctoral Workshop. 2012, 29.
    Abstract Storing personal data in a remote database in outsourcing company often re-quires clients to inherently trust the provider with full access to the outsourced datasets. But placing sensitive data under the control of a third-party provider without guarantees of privacy and confidentiality can be a big problem because data can be easily leaked. Although recent researches have addressed this security aspect by using encryption, no state-of-the-art solves this problem completely. This work draws a radically different vision of the database outsourcing by using new hardware devices called Secure Portable Tokens (SPT for short). SPTs combine tamper resistant smart card microcontrollers with large storage capacity NAND Flash chips. This token aims at helping every individual to better protect her privacy. We propose a protocol composed of low cost secure tokens and a powerful but untrusted supporting server (SS), called asymmetric architecture. This protocol, with personal data scattered in distributed tokens, aims at answering any general query in an interactive setting. The objective is to provide the exact results for general query with acceptable performance to partly trusted queriers who can only obtain some authorized views of the dataset but not the raw data stored in PDSs. URL BibTeX

    @inproceedings{TNPu12,
    	author = "To, Cuong Quoc and Nguyen, Benjamin and Pucheral, Philippe",
    	title = "{Secure global protocol for computing aggregate functions}",
    	booktitle = "{First AVSE Doctoral Workshop}",
    	year = 2012,
    	pages = 29,
    	address = "Cachan, France",
    	abstract = "{Storing personal data in a remote database in outsourcing company often re-quires clients to inherently trust the provider with full access to the outsourced datasets. But placing sensitive data under the control of a third-party provider without guarantees of privacy and confidentiality can be a big problem because data can be easily leaked. Although recent researches have addressed this security aspect by using encryption, no state-of-the-art solves this problem completely. This work draws a radically different vision of the database outsourcing by using new hardware devices called Secure Portable Tokens (SPT for short). SPTs combine tamper resistant smart card microcontrollers with large storage capacity NAND Flash chips. This token aims at helping every individual to better protect her privacy. We propose a protocol composed of low cost secure tokens and a powerful but untrusted supporting server (SS), called asymmetric architecture. This protocol, with personal data scattered in distributed tokens, aims at answering any general query in an interactive setting. The objective is to provide the exact results for general query with acceptable performance to partly trusted queriers who can only obtain some authorized views of the dataset but not the raw data stored in PDSs.}",
    	affiliation = "SMIS - INRIA Rocquencourt , Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM",
    	annote = "confnat",
    	audience = "internationale",
    	hal_id = "hal-00768378",
    	language = "Anglais",
    	url = "http://hal.archives-ouvertes.fr/hal-00768378"
    }
    
  2. Iulian Sandu-Popa and Karine Zeitouni. Modeling and Querying Mobile Location Sensor Data. In The Fourth International Conference on Advanced Geographic Information Systems, Applications, and Services (GEOProcessing). 2012, 18pp.
    Abstract A lot of work in moving object databases area dealt with modeling, querying and indexing. However, a moving object - such as a vehicle - could be equipped with sensors that report some measures related to its state or to its environment. Managing such data is of major interest for some applications such as analyzing driving behavior in road safety, or analyzing pollution by mean of mobile (vehicles or persons) probes. However, existing approaches manage only the location. In this paper, we propose a new data model and a language that handle mobile location sensor data. At this end, we introduce the concept of measure profile to capture the measure variability in space, along with specific operations that permit to analyze the data. We also describe their implementation within an object-relational DBMS. URL BibTeX

    @inproceedings{SaZe12,
    	author = "Sandu-Popa, Iulian and Zeitouni, Karine",
    	title = "{Modeling and Querying Mobile Location Sensor Data}",
    	booktitle = "{The Fourth International Conference on Advanced Geographic Information Systems, Applications, and Services (GEOProcessing)}",
    	year = 2012,
    	pages = "18pp",
    	address = "Espagne",
    	abstract = "{A lot of work in moving object databases area dealt with modeling, querying and indexing. However, a moving object - such as a vehicle - could be equipped with sensors that report some measures related to its state or to its environment. Managing such data is of major interest for some applications such as analyzing driving behavior in road safety, or analyzing pollution by mean of mobile (vehicles or persons) probes. However, existing approaches manage only the location. In this paper, we propose a new data model and a language that handle mobile location sensor data. At this end, we introduce the concept of measure profile to capture the measure variability in space, along with specific operations that permit to analyze the data. We also describe their implementation within an object-relational DBMS.}",
    	affiliation = "Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM , SMIS - INRIA Rocquencourt",
    	annote = "confint",
    	audience = "internationale",
    	hal_id = "hal-00768335",
    	language = "Anglais",
    	url = "http://hal.archives-ouvertes.fr/hal-00768335"
    }
    
  3. Susan Juan Pan, M Khan, Iulian Sandu-Popa, Karine Zeitouni and C Borcea. Proactive vehicle re-routing strategies for congestion avoidance. In 8th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS). 2012, 265-272.
    Abstract Traffic congestion causes driver frustration and costs billions of dollars annually in lost time and fuel consumption. This paper presents three traffic re-routing strategies designed to be incorporated in a cost-effective and easily deployable vehicular traffic guidance system that reduces the effect of traffic congestions. This system collects real-time traffic data from vehicles and road-side sensors and computes proactive, individually-tailored re-routing guidance which is pushed to vehicles when signs of congestion are observed on their route. Extensive simulation results over two urban road networks show that all three strategies, namely multipath load balancing considering future vehicle positions (EBkSP), random multipath load balancing (RkSP), and dynamic shortest path (DSP), significantly decrease the average travel time. EBkSP is the best, with as much as 104% improvement compared to the "no re-routing" baseline. Additionally, it lowers with 34% the re-routing frequency compared to the other strategies. Finally, all strategies offer good improvements even when many drivers ignore the guidance or when the system adoption rate is relatively low. URL BibTeX

    @inproceedings{PKS+12,
    	author = "Pan, Susan Juan and Khan, M. and Sandu-Popa, Iulian and Zeitouni, Karine and Borcea, C.",
    	title = "{Proactive vehicle re-routing strategies for congestion avoidance}",
    	booktitle = "{8th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS)}",
    	year = 2012,
    	pages = "265-272",
    	address = "Chine",
    	abstract = {{Traffic congestion causes driver frustration and costs billions of dollars annually in lost time and fuel consumption. This paper presents three traffic re-routing strategies designed to be incorporated in a cost-effective and easily deployable vehicular traffic guidance system that reduces the effect of traffic congestions. This system collects real-time traffic data from vehicles and road-side sensors and computes proactive, individually-tailored re-routing guidance which is pushed to vehicles when signs of congestion are observed on their route. Extensive simulation results over two urban road networks show that all three strategies, namely multipath load balancing considering future vehicle positions (EBkSP), random multipath load balancing (RkSP), and dynamic shortest path (DSP), significantly decrease the average travel time. EBkSP is the best, with as much as 104\% improvement compared to the "no re-routing" baseline. Additionally, it lowers with 34\% the re-routing frequency compared to the other strategies. Finally, all strategies offer good improvements even when many drivers ignore the guidance or when the system adoption rate is relatively low.}},
    	affiliation = "Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM , SMIS - INRIA Rocquencourt",
    	annote = "confint",
    	audience = "internationale",
    	hal_id = "hal-00768334",
    	language = "Anglais",
    	url = "http://hal.archives-ouvertes.fr/hal-00768334"
    }
    
  4. Philippe Bonnet and Luc Bouganim. Flash Device Support for Database Management. In {28èmes journées Bases de Données Avancées (BDA)}. 2012. URL BibTeX

    @inproceedings{BoBo12,
    	author = "Bonnet, Philippe and Bouganim, Luc",
    	title = "{Flash Device Support for Database Management}",
    	booktitle = "{28{\`e}mes journ{\'e}es Bases de Donn{\'e}es Avanc{\'e}es (BDA)}",
    	year = 2012,
    	address = "Clermont-Ferrand, France",
    	affiliation = "IT University of Copenhagen - IT , Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM , SMIS - INRIA Rocquencourt",
    	annote = "confnat",
    	audience = "non sp{\'e}cifi{\'e}e",
    	hal_id = "hal-00768387",
    	language = "Anglais",
    	url = "http://hal.archives-ouvertes.fr/hal-00768387"
    }
    
  5. Jean-Pierre Archambault, Laurent Bloch, Laurent Chéno and Benjamin Nguyen. Logiciels libres, culture et enseignement de l'informatique. In 5th Open World Forum (OWF). 2012. URL BibTeX

    @inproceedings{ABCN12,
    	author = "Archambault, Jean-Pierre and Bloch, Laurent and Ch{\'e}no, Laurent and Nguyen, Benjamin",
    	title = "{Logiciels libres, culture et enseignement de l'informatique}",
    	booktitle = "{5th Open World Forum (OWF)}",
    	year = 2012,
    	address = "France",
    	affiliation = "Association Enseignement Public et Informatique - EPI , Universit{\'e} Paris 9, Dauphine - UP9 , Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM , SMIS - INRIA Rocquencourt",
    	annote = "confinv",
    	audience = "internationale",
    	hal_id = "hal-00768374",
    	language = "Fran{\c c}ais",
    	url = "http://hal.archives-ouvertes.fr/hal-00768374"
    }
    
  6. Nicolas Anciaux, Benjamin Nguyen and Michalis Vazirgiannis. Limiting Data Collection in Application Forms. In {Atelier Protection de la Vie Privée (APVP)}. 2012. URL BibTeX

    @inproceedings{ANVa12e,
    	author = "Anciaux, Nicolas and Nguyen, Benjamin and Vazirgiannis, Michalis",
    	title = "{Limiting Data Collection in Application Forms}",
    	booktitle = "{Atelier Protection de la Vie Priv{\'e}e (APVP)}",
    	year = 2012,
    	address = "Groix, France",
    	affiliation = "Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM , SMIS - INRIA Rocquencourt , Athens University of Economics and Business - AUEB , Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX",
    	annote = "confnat",
    	audience = "nationale",
    	collaboration = "AE INRIA CAPPRIS",
    	hal_id = "hal-00768365",
    	language = "Anglais",
    	url = "http://hal.archives-ouvertes.fr/hal-00768365"
    }
    
  7. Nicolas Anciaux, Benjamin Nguyen and Michalis Vazirgiannis. {Cas d'usage d'un principe fondamental de protection de la vie privée}. In {Bases de Données Avancées (BDA)}. 2012. URL BibTeX

    @inproceedings{ANVa12d,
    	author = "Anciaux, Nicolas and Nguyen, Benjamin and Vazirgiannis, Michalis",
    	title = "{Cas d'usage d'un principe fondamental de protection de la vie priv{\'e}e}",
    	booktitle = "{Bases de Donn{\'e}es Avanc{\'e}es (BDA)}",
    	year = 2012,
    	address = "Clermont-Ferrand, France",
    	affiliation = "Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM , SMIS - INRIA Rocquencourt , Athens University of Economics and Business - AUEB , Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX",
    	annote = "confnat",
    	audience = "non sp{\'e}cifi{\'e}e",
    	collaboration = "AE INRIA CAPPRIS",
    	hal_id = "hal-00768367",
    	language = "Fran{\c c}ais",
    	url = "http://hal.archives-ouvertes.fr/hal-00768367"
    }
    
  8. Nicolas Anciaux, Benjamin Nguyen and Michalis Vazirgiannis. Limiting Data Collection in Application Forms : A real-case application of a Founding Privacy Principle. In PST '12 Proceedings of the 2012 Tenth Annual International Conference on Privacy, Security and Trust (PST). 2012, 59-66.
    Abstract Application forms are often used by companies and administrations to collect personal data about applicants and tailor services to their specific situation. For example, taxes rates, social care, or personal loans, are usually calibrated based on a set of personal data collected through application forms. In the eyes of privacy laws and directives, the set of personal data collected to achieve a service must be restricted to the minimum necessary. This reduces the impact of data breaches both in the interest of service providers and applicants. In this article, we study the problem of limiting data collection in those application forms, used to collect data and subsequently feed decision making processes. In practice, the set of data collected is far excessive because application forms are filled in without any means to know what data will really impact the decision. To overcome this problem, we propose a reverse approach, where the set of strictly required data items to fill in the application form can be computed on the user's side. We formalize the underlying NP Hard optimization problem, propose algorithms to compute a solution, and validate them with experiments. Our proposal leads to a significant reduction of the quantity of personal data filled in application forms while still reaching the same decision. URL, DOI BibTeX

    @inproceedings{ANVa12c,
    	author = "Anciaux, Nicolas and Nguyen, Benjamin and Vazirgiannis, Michalis",
    	title = "{Limiting Data Collection in Application Forms : A real-case application of a Founding Privacy Principle}",
    	booktitle = "{PST '12 Proceedings of the 2012 Tenth Annual International Conference on Privacy, Security and Trust (PST)}",
    	year = 2012,
    	pages = "59-66",
    	address = "France",
    	abstract = "{Application forms are often used by companies and administrations to collect personal data about applicants and tailor services to their specific situation. For example, taxes rates, social care, or personal loans, are usually calibrated based on a set of personal data collected through application forms. In the eyes of privacy laws and directives, the set of personal data collected to achieve a service must be restricted to the minimum necessary. This reduces the impact of data breaches both in the interest of service providers and applicants. In this article, we study the problem of limiting data collection in those application forms, used to collect data and subsequently feed decision making processes. In practice, the set of data collected is far excessive because application forms are filled in without any means to know what data will really impact the decision. To overcome this problem, we propose a reverse approach, where the set of strictly required data items to fill in the application form can be computed on the user's side. We formalize the underlying NP Hard optimization problem, propose algorithms to compute a solution, and validate them with experiments. Our proposal leads to a significant reduction of the quantity of personal data filled in application forms while still reaching the same decision.}",
    	affiliation = "Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM , SMIS - INRIA Rocquencourt , Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX , Athens University of Economics and Business - AUEB",
    	annote = "confint",
    	audience = "internationale",
    	collaboration = "AE INRIA CAPPRIS",
    	doi = "10.1109/PST.2012.6297920",
    	hal_id = "hal-00768363",
    	language = "Anglais",
    	url = "http://hal.archives-ouvertes.fr/hal-00768363"
    }
    
  9. Nicolas Anciaux, Benjamin Nguyen and Michalis Vazirgiannis. Limiting Data Collection in Application Forms: A real-case Application of a Founding Privacy Principle. In PST 2012, Tenth Annual Conference on Privacy, Security and Trust. 2012, 59-66. BibTeX

    @inproceedings{ANVa12b,
    	author = "Anciaux, Nicolas and Nguyen, Benjamin and Vazirgiannis, Michalis",
    	title = "{Limiting Data Collection in Application Forms: A real-case Application of a Founding Privacy Principle}",
    	booktitle = "{PST 2012, Tenth Annual Conference on Privacy, Security and Trust}",
    	year = "{2012}",
    	pages = "{59-66}",
    	annote = "confint",
    	owner = "MOIS",
    	timestamp = "2012.10.31"
    }
    
  10. Nicolas Anciaux, Danae Boutara, Benjamin Nguyen and Michalis Vazirgiannis. Limiting Data Exposure in Multi-Label Classification Processes. In International Workshop on Privacy-AwaRe Intelligent Systems (PARIS2012). 2012.
    Abstract Administrative services such social care, tax reduction, and many others using complex decision processes, request individuals to provide large amounts of private data items, in order to calibrate their proposal to the specific situation of the applicant. This data is subsequently processed and stored by the organization. However, all the requested information is not needed to reach the same decision. We have recently proposed an approach, termed Minimum Exposure, to reduce the quantity of information provided by the users, in order to protect her privacy, reduce processing costs for the organization, and financial lost in the case of a data breach. In this paper, we address the case of decision making processes based on sets of classifiers, typically multi-label classifiers. We propose a practical implementation using state of the art multi-label classifiers, and analyze the effectiveness of our solution on several real multi-label data sets. URL BibTeX

    @inproceedings{ABNV12,
    	author = "Anciaux, Nicolas and Boutara, Danae and Nguyen, Benjamin and Vazirgiannis, Michalis",
    	title = "{Limiting Data Exposure in Multi-Label Classification Processes}",
    	booktitle = "{International Workshop on Privacy-AwaRe Intelligent Systems (PARIS2012)}",
    	year = 2012,
    	address = "Macao",
    	abstract = "{Administrative services such social care, tax reduction, and many others using complex decision processes, request individuals to provide large amounts of private data items, in order to calibrate their proposal to the specific situation of the applicant. This data is subsequently processed and stored by the organization. However, all the requested information is not needed to reach the same decision. We have recently proposed an approach, termed Minimum Exposure, to reduce the quantity of information provided by the users, in order to protect her privacy, reduce processing costs for the organization, and financial lost in the case of a data breach. In this paper, we address the case of decision making processes based on sets of classifiers, typically multi-label classifiers. We propose a practical implementation using state of the art multi-label classifiers, and analyze the effectiveness of our solution on several real multi-label data sets.}",
    	affiliation = "Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM , SMIS - INRIA Rocquencourt , Athens University of Economics and Business - AUEB , Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX",
    	annote = "confint",
    	audience = "internationale",
    	collaboration = "AE INRIA CAPPRIS",
    	hal_id = "hal-00768373",
    	language = "Anglais",
    	url = "http://hal.archives-ouvertes.fr/hal-00768373"
    }
    

PhdThesis

  1. Lionel Le Folgoc. Personal Data Server Engine: Design and Performance Considerations. Université de Versailles St-Quentin-en-Yvelines, 2012. BibTeX

    @phdthesis{LeFL12,
    	author = "Le Folgoc, Lionel",
    	title = "{Personal Data Server Engine: Design and Performance Considerations}",
    	school = "{Université de Versailles St-Quentin-en-Yvelines}",
    	year = 2012,
    	annote = "these"
    }
    

Proceedings

  1. Luc Bouganim (ed.). {Bases de Données Avancées - Modélisation, Interrogation et Optimisation} 17(5). Ingénierie des Systèmes d'Information (ISI), Lavoisier, 2012. URL BibTeX

    @proceedings{Boug12,
    	title = "{Bases de Donn{\'e}es Avanc{\'e}es - Mod{\'e}lisation, Interrogation et Optimisation}",
    	year = 2012,
    	editor = "Bouganim, Luc",
    	volume = 17,
    	number = 5,
    	publisher = "Ing{\'e}nierie des Syst{\`e}mes d'Information (ISI), Lavoisier",
    	affiliation = "Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM , SMIS - INRIA Rocquencourt",
    	annote = "proc",
    	audience = "nationale",
    	hal_id = "hal-00768383",
    	language = "Fran{\c c}ais",
    	pages = 138,
    	url = "http://hal.archives-ouvertes.fr/hal-00768383"
    }
    

 

 Imprimer 

DMC Firewall is developed by Dean Marshall Consultancy Ltd