Slide
Centre Interdisciplinaire
de Recherche et d’Innovation
en Cybersécurité et Société
de Recherche et d’Innovation
en Cybersécurité et Société
1.
Damadi, M. S.; Davoust, A.
Fairness in Socio-Technical Systems: A Case Study of Wikipedia Article de journal
Dans: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14199 LNCS, p. 84–100, 2023, ISSN: 03029743, (ISBN: 9783031421402 Publisher: Springer Science and Business Media Deutschland GmbH).
Résumé | Liens | BibTeX | Étiquettes: Algorithmics, Bias, Case-studies, Causal relationships, Cultural bias, Fairness, Gender bias, Machine learning, Machine-learning, Parallel processing systems, Sociotechnical systems, Wikipedia
@article{damadi_fairness_2023,
title = {Fairness in Socio-Technical Systems: A Case Study of Wikipedia},
author = {M. S. Damadi and A. Davoust},
editor = {Alvarez C. Marutschke D.M. Takada H.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85172720004&doi=10.1007%2f978-3-031-42141-9_6&partnerID=40&md5=172c8c6ae5b09536efdf983e9be965e7},
doi = {10.1007/978-3-031-42141-9_6},
issn = {03029743},
year = {2023},
date = {2023-01-01},
journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
volume = {14199 LNCS},
pages = {84–100},
abstract = {Wikipedia content is produced by a complex socio-technical systems (STS), and exhibits numerous biases, such as gender and cultural biases. We investigate how these biases relate to the concepts of algorithmic bias and fairness defined in the context of algorithmic systems. We systematically review 75 papers describing different types of bias in Wikipedia, which we classify and relate to established notions of harm and normative expectations of fairness as defined for machine learning-driven algorithmic systems. In addition, by analysing causal relationships between the observed phenomena, we demonstrate the complexity of the socio-technical processes causing harm. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.},
note = {ISBN: 9783031421402
Publisher: Springer Science and Business Media Deutschland GmbH},
keywords = {Algorithmics, Bias, Case-studies, Causal relationships, Cultural bias, Fairness, Gender bias, Machine learning, Machine-learning, Parallel processing systems, Sociotechnical systems, Wikipedia},
pubstate = {published},
tppubtype = {article}
}
Wikipedia content is produced by a complex socio-technical systems (STS), and exhibits numerous biases, such as gender and cultural biases. We investigate how these biases relate to the concepts of algorithmic bias and fairness defined in the context of algorithmic systems. We systematically review 75 papers describing different types of bias in Wikipedia, which we classify and relate to established notions of harm and normative expectations of fairness as defined for machine learning-driven algorithmic systems. In addition, by analysing causal relationships between the observed phenomena, we demonstrate the complexity of the socio-technical processes causing harm. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.
2.
Davoust, A.; Gavigan, P.; Ruiz-Martin, C.; Trabes, G.; Esfandiari, B.; Wainer, G.; James, J.
An architecture for integrating BDI agents with a simulation environment Article de journal
Dans: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12058 LNAI, p. 67–84, 2020, ISSN: 03029743, (ISBN: 9783030514167 Publisher: Springer).
Résumé | Liens | BibTeX | Étiquettes: Antennas, Architecture, Autonomous agents, Belief-desire-intentions, Impedance mismatch, Modelling and simulations, Multi agent systems, Open source architecture, Real time simulations, Separation of concerns, Simulated environment, Simulation environment
@article{davoust_architecture_2020,
title = {An architecture for integrating BDI agents with a simulation environment},
author = {A. Davoust and P. Gavigan and C. Ruiz-Martin and G. Trabes and B. Esfandiari and G. Wainer and J. James},
editor = {Lesperance Y. Bordini R.H. Dennis L.A.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85088750329&doi=10.1007%2f978-3-030-51417-4_4&partnerID=40&md5=2f742500bcd9cac1bf054bbc8802e39c},
doi = {10.1007/978-3-030-51417-4_4},
issn = {03029743},
year = {2020},
date = {2020-01-01},
journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
volume = {12058 LNAI},
pages = {67–84},
abstract = {We present Simulated Autonomous Vehicle Infrastructure (SAVI), an open source architecture for integrating Belief-Desire-Intention (BDI) agents with a simulation platform. This allows for separation of concerns between the development of complex multi-agent behaviours and simulated environments to test them in. We identify and address the impedance mismatch between modelling and simulation, where time is explicitly modelled and differs from “wall clock” time, and BDI systems, where time is not explicitly managed. Our approach avoids linking the environment’s simulation time step to the agents’ reasoning cycles, relying instead on real time simulation where possible, and ensuring that the reasoning module does not get ahead of the simulation. This contributes to a realistic approximation of a real environment for the simulated BDI agents. This is accomplished by running the simulation cycles and the agent reasoning cycles each in their own threads of execution, and managing a single point of contact between these threads. Finally, we illustrate the use of our architecture with a case study involving the simulation of Unmanned Aerial Vehicles (UAVs) following birds. © Springer Nature Switzerland AG 2020.},
note = {ISBN: 9783030514167
Publisher: Springer},
keywords = {Antennas, Architecture, Autonomous agents, Belief-desire-intentions, Impedance mismatch, Modelling and simulations, Multi agent systems, Open source architecture, Real time simulations, Separation of concerns, Simulated environment, Simulation environment},
pubstate = {published},
tppubtype = {article}
}
We present Simulated Autonomous Vehicle Infrastructure (SAVI), an open source architecture for integrating Belief-Desire-Intention (BDI) agents with a simulation platform. This allows for separation of concerns between the development of complex multi-agent behaviours and simulated environments to test them in. We identify and address the impedance mismatch between modelling and simulation, where time is explicitly modelled and differs from “wall clock” time, and BDI systems, where time is not explicitly managed. Our approach avoids linking the environment’s simulation time step to the agents’ reasoning cycles, relying instead on real time simulation where possible, and ensuring that the reasoning module does not get ahead of the simulation. This contributes to a realistic approximation of a real environment for the simulated BDI agents. This is accomplished by running the simulation cycles and the agent reasoning cycles each in their own threads of execution, and managing a single point of contact between these threads. Finally, we illustrate the use of our architecture with a case study involving the simulation of Unmanned Aerial Vehicles (UAVs) following birds. © Springer Nature Switzerland AG 2020.
3.
Davoust, A.; Rovatsos, M.
Social contracts for non-cooperative games Proceedings Article
Dans: AIES 2020 - Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society, p. 43–49, Association for Computing Machinery, Inc, 2020, ISBN: 978-1-4503-7110-0.
Résumé | Liens | BibTeX | Étiquettes: Agent society, Agents, Behavioral research, Ethical aspects, Game theory, Game-theoretic, Moral philosophy, Noncooperative game, Selfish behaviours, Social benefits, Social contract, Social welfare
@inproceedings{davoust_social_2020,
title = {Social contracts for non-cooperative games},
author = {A. Davoust and M. Rovatsos},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85082175399&doi=10.1145%2f3375627.3375829&partnerID=40&md5=972ba2201a1c2450895935dc03ec39b9},
doi = {10.1145/3375627.3375829},
isbn = {978-1-4503-7110-0},
year = {2020},
date = {2020-01-01},
booktitle = {AIES 2020 - Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society},
pages = {43–49},
publisher = {Association for Computing Machinery, Inc},
abstract = {In future agent societies, we might see AI systems engaging in selfish, calculated behavior, furthering their owners' interests instead of socially desirable outcomes. How can we promote morally sound behaviour in such settings, in order to obtain more desirable outcomes? A solution from moral philosophy is the concept of a social contract, a set of rules that people would voluntarily commit to in order to obtain better outcomes than those brought by anarchy. We adapt this concept to a game-theoretic setting, to systematically modify the payoffs of a non-cooperative game, so that agents will rationally pursue socially desirable outcomes. We show that for any game, a suitable social contract can be designed to produce an optimal outcome in terms of social welfare. We then investigate the limitations of applying this approach to alternative moral objectives, and establish that, for any alternative moral objective that is significantly different from social welfare, there are games for which no such social contract will be feasible that produces non-negligible social benefit compared to collective selfish behaviour. © 2020 Copyright held by the owner/author(s).},
keywords = {Agent society, Agents, Behavioral research, Ethical aspects, Game theory, Game-theoretic, Moral philosophy, Noncooperative game, Selfish behaviours, Social benefits, Social contract, Social welfare},
pubstate = {published},
tppubtype = {inproceedings}
}
In future agent societies, we might see AI systems engaging in selfish, calculated behavior, furthering their owners' interests instead of socially desirable outcomes. How can we promote morally sound behaviour in such settings, in order to obtain more desirable outcomes? A solution from moral philosophy is the concept of a social contract, a set of rules that people would voluntarily commit to in order to obtain better outcomes than those brought by anarchy. We adapt this concept to a game-theoretic setting, to systematically modify the payoffs of a non-cooperative game, so that agents will rationally pursue socially desirable outcomes. We show that for any game, a suitable social contract can be designed to produce an optimal outcome in terms of social welfare. We then investigate the limitations of applying this approach to alternative moral objectives, and establish that, for any alternative moral objective that is significantly different from social welfare, there are games for which no such social contract will be feasible that produces non-negligible social benefit compared to collective selfish behaviour. © 2020 Copyright held by the owner/author(s).
4.
Webb, H.; Patel, M.; Rovatsos, M.; Davoust, A.; Ceppi, S.; Koene, A.; Dowthwaite, L.; Portillo, V.; Jirotka, M.; Cano, M.
“It would be pretty immoral to choose a random algorithm”: Opening up algorithmic interpretability and transparency Article de journal
Dans: Journal of Information, Communication and Ethics in Society, vol. 17, no. 2, p. 210–228, 2019, ISSN: 1477996X, (Publisher: Emerald Group Holdings Ltd.).
Résumé | Liens | BibTeX | Étiquettes:
@article{webb_it_2019,
title = {“It would be pretty immoral to choose a random algorithm”: Opening up algorithmic interpretability and transparency},
author = {H. Webb and M. Patel and M. Rovatsos and A. Davoust and S. Ceppi and A. Koene and L. Dowthwaite and V. Portillo and M. Jirotka and M. Cano},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85064059515&doi=10.1108%2fJICES-11-2018-0092&partnerID=40&md5=34ce2e453a8c57f7f80b38e6237052aa},
doi = {10.1108/JICES-11-2018-0092},
issn = {1477996X},
year = {2019},
date = {2019-01-01},
journal = {Journal of Information, Communication and Ethics in Society},
volume = {17},
number = {2},
pages = {210–228},
abstract = {Purpose: The purpose of this paper is to report on empirical work conducted to open up algorithmic interpretability and transparency. In recent years, significant concerns have arisen regarding the increasing pervasiveness of algorithms and the impact of automated decision-making in our lives. Particularly problematic is the lack of transparency surrounding the development of these algorithmic systems and their use. It is often suggested that to make algorithms more fair, they should be made more transparent, but exactly how this can be achieved remains unclear. Design/methodology/approach: An empirical study was conducted to begin unpacking issues around algorithmic interpretability and transparency. The study involved discussion-based experiments centred around a limited resource allocation scenario which required participants to select their most and least preferred algorithms in a particular context. In addition to collecting quantitative data about preferences, qualitative data captured participants’ expressed reasoning behind their selections. Findings: Even when provided with the same information about the scenario, participants made different algorithm preference selections and rationalised their selections differently. The study results revealed diversity in participant responses but consistency in the emphasis they placed on normative concerns and the importance of context when accounting for their selections. The issues raised by participants as important to their selections resonate closely with values that have come to the fore in current debates over algorithm prevalence. Originality/value: This work developed a novel empirical approach that demonstrates the value in pursuing algorithmic interpretability and transparency while also highlighting the complexities surrounding their accomplishment. © 2019, Emerald Publishing Limited.},
note = {Publisher: Emerald Group Holdings Ltd.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Purpose: The purpose of this paper is to report on empirical work conducted to open up algorithmic interpretability and transparency. In recent years, significant concerns have arisen regarding the increasing pervasiveness of algorithms and the impact of automated decision-making in our lives. Particularly problematic is the lack of transparency surrounding the development of these algorithmic systems and their use. It is often suggested that to make algorithms more fair, they should be made more transparent, but exactly how this can be achieved remains unclear. Design/methodology/approach: An empirical study was conducted to begin unpacking issues around algorithmic interpretability and transparency. The study involved discussion-based experiments centred around a limited resource allocation scenario which required participants to select their most and least preferred algorithms in a particular context. In addition to collecting quantitative data about preferences, qualitative data captured participants’ expressed reasoning behind their selections. Findings: Even when provided with the same information about the scenario, participants made different algorithm preference selections and rationalised their selections differently. The study results revealed diversity in participant responses but consistency in the emphasis they placed on normative concerns and the importance of context when accounting for their selections. The issues raised by participants as important to their selections resonate closely with values that have come to the fore in current debates over algorithm prevalence. Originality/value: This work developed a novel empirical approach that demonstrates the value in pursuing algorithmic interpretability and transparency while also highlighting the complexities surrounding their accomplishment. © 2019, Emerald Publishing Limited.
5.
Murray-Rust, D.; Davoust, A.; Papapanagiotou, P.; Manataki, A.; Kleek, M. Van; Shadbolt, N.; Robertson, D.
Towards executable representations of social machines Article de journal
Dans: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10871 LNAI, p. 765–769, 2018, ISSN: 03029743, (ISBN: 9783319913759 Publisher: Springer Verlag).
Résumé | Liens | BibTeX | Étiquettes: Calculations, Computation theory, Computational infrastructure, Executable architecture, Graphical formalisms, Inter-action protocols, Network architecture, Participatory design, Sociotechnical systems, Software prototyping, Technological system, Workshop participants
@article{murray-rust_towards_2018,
title = {Towards executable representations of social machines},
author = {D. Murray-Rust and A. Davoust and P. Papapanagiotou and A. Manataki and M. Van Kleek and N. Shadbolt and D. Robertson},
editor = {Moktefi A. Bellucci F. Stapleton G.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048637678&doi=10.1007%2f978-3-319-91376-6_77&partnerID=40&md5=09d785d483cad1b02b5767278b08836b},
doi = {10.1007/978-3-319-91376-6_77},
issn = {03029743},
year = {2018},
date = {2018-01-01},
journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
volume = {10871 LNAI},
pages = {765–769},
abstract = {Human interaction is increasingly mediated through technological systems, resulting in the emergence of a new class of socio-technical systems, often called Social Machines. However, many systems are designed and managed in a centralised way, limiting the participants’ autonomy and ability to shape the systems they are part of. In this paper we are concerned with creating a graphical formalism that allows novice users to simply draw the patterns of interaction that they desire, and have computational infrastructure assemble around the diagram. Our work includes a series of participatory design workshops, that help to understand the levels and types of abstraction that the general public are comfortable with when designing socio-technical systems. These design studies lead to a novel formalism that allows us to compose rich interaction protocols into functioning, executable architecture. We demonstrate this by translating one of the designs produced by workshop participants into an a running agent institution using the Lightweight Social Calculus (LSC). © Springer International Publishing AG, part of Springer Nature 2018.},
note = {ISBN: 9783319913759
Publisher: Springer Verlag},
keywords = {Calculations, Computation theory, Computational infrastructure, Executable architecture, Graphical formalisms, Inter-action protocols, Network architecture, Participatory design, Sociotechnical systems, Software prototyping, Technological system, Workshop participants},
pubstate = {published},
tppubtype = {article}
}
Human interaction is increasingly mediated through technological systems, resulting in the emergence of a new class of socio-technical systems, often called Social Machines. However, many systems are designed and managed in a centralised way, limiting the participants’ autonomy and ability to shape the systems they are part of. In this paper we are concerned with creating a graphical formalism that allows novice users to simply draw the patterns of interaction that they desire, and have computational infrastructure assemble around the diagram. Our work includes a series of participatory design workshops, that help to understand the levels and types of abstraction that the general public are comfortable with when designing socio-technical systems. These design studies lead to a novel formalism that allows us to compose rich interaction protocols into functioning, executable architecture. We demonstrate this by translating one of the designs produced by workshop participants into an a running agent institution using the Lightweight Social Calculus (LSC). © Springer International Publishing AG, part of Springer Nature 2018.
6.
Papapanagiotou, P.; Manataki, A.; Davoust, A.; Kleek, M. Van; Robertson, D.; Murray-Rust, D.; Shadbolt, N.
Social machines for all: Blue sky ideas track Proceedings Article
Dans: Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, p. 1208–1212, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2018, ISBN: 978-1-5108-6808-3, (ISSN: 15488403).
Résumé | Liens | BibTeX | Étiquettes: Agent based simulation, Analysis, Autonomous agents, Design, Development method, Distributed agents, Distributed computer systems, Easy-to-use systems, Economic and social effects, Electronic institutions, Intelligent agents, Model driven development, Model-driven Engineering, Models, Multi agent systems, Systems analysis
@inproceedings{papapanagiotou_social_2018,
title = {Social machines for all: Blue sky ideas track},
author = {P. Papapanagiotou and A. Manataki and A. Davoust and M. Van Kleek and D. Robertson and D. Murray-Rust and N. Shadbolt},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85054668594&partnerID=40&md5=77eba348dbafa30aef9d016186b46804},
isbn = {978-1-5108-6808-3},
year = {2018},
date = {2018-01-01},
booktitle = {Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS},
volume = {2},
pages = {1208–1212},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)},
abstract = {In today's interconnected world, people interact to a unprecedented degree through the use of digital platforms and services, forming complex 'social machines'. These are now homes to autonomous agents as well as people, providing an open space where human and computational intelligence can mingle-a new frontier for distributed agent systems. However, participants typically have limited autonomy to define and shape the machines they are part of. In this paper, we envision a future where individuals are able to develop their own Social Machines, enabling them to interact in a trustworthy, decentralized way. To make this possible, development methods and tools must see their barriers-to-entry dramatically lowered. People should be able to specify the agent roles and inte-raction patterns in an intuitive, visual way, analyse and test their designs and deploy them as easy to use systems. We argue that this is a challenging but realistic goal, which should be tackled by navigating the trade-off between the accessibility of the design methods -primarily the modelling formalisms- And their expressive power. We support our arguments by drawing ideas from different research areas including electronic institutions, agent-based simulation, process modelling, formal verification, and model-driven engineering. © 2018 International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.},
note = {ISSN: 15488403},
keywords = {Agent based simulation, Analysis, Autonomous agents, Design, Development method, Distributed agents, Distributed computer systems, Easy-to-use systems, Economic and social effects, Electronic institutions, Intelligent agents, Model driven development, Model-driven Engineering, Models, Multi agent systems, Systems analysis},
pubstate = {published},
tppubtype = {inproceedings}
}
In today's interconnected world, people interact to a unprecedented degree through the use of digital platforms and services, forming complex 'social machines'. These are now homes to autonomous agents as well as people, providing an open space where human and computational intelligence can mingle-a new frontier for distributed agent systems. However, participants typically have limited autonomy to define and shape the machines they are part of. In this paper, we envision a future where individuals are able to develop their own Social Machines, enabling them to interact in a trustworthy, decentralized way. To make this possible, development methods and tools must see their barriers-to-entry dramatically lowered. People should be able to specify the agent roles and inte-raction patterns in an intuitive, visual way, analyse and test their designs and deploy them as easy to use systems. We argue that this is a challenging but realistic goal, which should be tackled by navigating the trade-off between the accessibility of the design methods -primarily the modelling formalisms- And their expressive power. We support our arguments by drawing ideas from different research areas including electronic institutions, agent-based simulation, process modelling, formal verification, and model-driven engineering. © 2018 International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
7.
Davoust, A.; Gagnon, F.; Esfandiari, B.; Kunz, T.; Cormier, A.
Towards Securing Peer-to-Peer SIP in the MANET Context: Existing Work and Perspectives Proceedings Article
Dans: Y., Georgalas N. Min G. Wu (Ed.): Proceedings - 2017 IEEE International Conference on Internet of Things, IEEE Green Computing and Communications, IEEE Cyber, Physical and Social Computing, IEEE Smart Data, iThings-GreenCom-CPSCom-SmartData 2017, p. 223–229, Institute of Electrical and Electronics Engineers Inc., 2017, ISBN: 978-1-5386-3065-5.
Résumé | Liens | BibTeX | Étiquettes: Ad-hoc networks, Building blockes, Instant messaging, Internet protocols, Mobile ad-hoc networks, Mobile telecommunication systems, Network contexts, Network security, P2P, Peer to peer networks, Peer-to-peer session initiation protocols, Radio links, Security, Session Initiation Protocols, Social applications, Vehicular ad hoc networks
@inproceedings{davoust_towards_2017,
title = {Towards Securing Peer-to-Peer SIP in the MANET Context: Existing Work and Perspectives},
author = {A. Davoust and F. Gagnon and B. Esfandiari and T. Kunz and A. Cormier},
editor = {Georgalas N. Min G. Wu Y.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85047394150&doi=10.1109%2fiThings-GreenCom-CPSCom-SmartData.2017.38&partnerID=40&md5=738bee95270122e76104e7afc52fe946},
doi = {10.1109/iThings-GreenCom-CPSCom-SmartData.2017.38},
isbn = {978-1-5386-3065-5},
year = {2017},
date = {2017-01-01},
booktitle = {Proceedings - 2017 IEEE International Conference on Internet of Things, IEEE Green Computing and Communications, IEEE Cyber, Physical and Social Computing, IEEE Smart Data, iThings-GreenCom-CPSCom-SmartData 2017},
volume = {2018-January},
pages = {223–229},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
abstract = {The Session Initiation Protocol (SIP) is a key building block of many social applications, including VoIP communication and instant messaging. In its original architecture, SIP heavily relies on servers such as proxies and registrars. Mobile Ad hoc NETworks (MANETs) are networks comprised of mobile devices that communicate over wireless links, such as tactical radio networks or vehicular networks. In such networks, no fixed infrastructure exists and server-based solutions need to be redesigned to work in a peer-to-peer fashion. We survey existing proposals for the implementation of SIP over such MANETs and analyze their security issues. We then discuss potential solutions and their suitability in the MANET context. © 2017 IEEE.},
keywords = {Ad-hoc networks, Building blockes, Instant messaging, Internet protocols, Mobile ad-hoc networks, Mobile telecommunication systems, Network contexts, Network security, P2P, Peer to peer networks, Peer-to-peer session initiation protocols, Radio links, Security, Session Initiation Protocols, Social applications, Vehicular ad hoc networks},
pubstate = {published},
tppubtype = {inproceedings}
}
The Session Initiation Protocol (SIP) is a key building block of many social applications, including VoIP communication and instant messaging. In its original architecture, SIP heavily relies on servers such as proxies and registrars. Mobile Ad hoc NETworks (MANETs) are networks comprised of mobile devices that communicate over wireless links, such as tactical radio networks or vehicular networks. In such networks, no fixed infrastructure exists and server-based solutions need to be redesigned to work in a peer-to-peer fashion. We survey existing proposals for the implementation of SIP over such MANETs and analyze their security issues. We then discuss potential solutions and their suitability in the MANET context. © 2017 IEEE.
8.
Davoust, A.; Esfandiari, B.
Processing regular path queries on arbitrarily distributed data Article de journal
Dans: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10033 LNCS, p. 844–861, 2016, ISSN: 03029743, (ISBN: 9783319484716 Publisher: Springer Verlag).
Résumé | Liens | BibTeX | Étiquettes: Arbitrarily distributed datum, Biomedical data, Cost estimating, Distributed systems, Graph queries, Processing strategies, Query cost estimation, Query languages, Regular expressions, Regular path queries
@article{davoust_processing_2016,
title = {Processing regular path queries on arbitrarily distributed data},
author = {A. Davoust and B. Esfandiari},
editor = {Oa'Sullivan D. Debruyne C. Dillon T.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84995931482&doi=10.1007%2f978-3-319-48472-3_53&partnerID=40&md5=58ab4d499f8422130fc98507ba48e9b9},
doi = {10.1007/978-3-319-48472-3_53},
issn = {03029743},
year = {2016},
date = {2016-01-01},
journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
volume = {10033 LNCS},
pages = {844–861},
abstract = {Regular Path Queries (RPQs) are a type of graph query where answers are pairs of nodes connected by a sequence of edges matching a regular expression. We study the techniques to process such queries on a distributed graph of data. While many techniques assume the location of each data element (node or edge) is known, when the components of the distributed system are autonomous, the data will be arbitrarily distributed, or non-localized. We compare query processing strategies for this setting analytically and empirically, using biomedical data and meaningful queries. We isolate query-dependent cost factors and present a method to choose between strategies, using new query cost estimation techniques. © Springer International Publishing AG 2016.},
note = {ISBN: 9783319484716
Publisher: Springer Verlag},
keywords = {Arbitrarily distributed datum, Biomedical data, Cost estimating, Distributed systems, Graph queries, Processing strategies, Query cost estimation, Query languages, Regular expressions, Regular path queries},
pubstate = {published},
tppubtype = {article}
}
Regular Path Queries (RPQs) are a type of graph query where answers are pairs of nodes connected by a sequence of edges matching a regular expression. We study the techniques to process such queries on a distributed graph of data. While many techniques assume the location of each data element (node or edge) is known, when the components of the distributed system are autonomous, the data will be arbitrarily distributed, or non-localized. We compare query processing strategies for this setting analytically and empirically, using biomedical data and meaningful queries. We isolate query-dependent cost factors and present a method to choose between strategies, using new query cost estimation techniques. © Springer International Publishing AG 2016.
9.
Davoust, A.; Esfandiari, B.
User participation and honesty in online rating systems: What a social network can do Proceedings Article
Dans: AAAI Workshop - Technical Report, p. 477–483, AI Access Foundation, 2016, ISBN: 978-1-57735-759-9.
Résumé | Liens | BibTeX | Étiquettes: Aggregation techniques, Artificial intelligence, Behavioral research, Big data, Co-operative behaviors, Cognitive systems, Computer games, Computer programming, Computer systems programming, Data mining, Hybrid systems, Incentive structure, On-line communities, Online rating systems, Online systems, Population statistics, Prisoners' Dilemma, Rating, Social networking (online), User participation
@inproceedings{davoust_user_2016,
title = {User participation and honesty in online rating systems: What a social network can do},
author = {A. Davoust and B. Esfandiari},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021919921&partnerID=40&md5=6a33a1ab6d3b6ddd037240f4f664b6fe},
isbn = {978-1-57735-759-9},
year = {2016},
date = {2016-01-01},
booktitle = {AAAI Workshop - Technical Report},
volume = {WS-16-01 - WS-16-15},
pages = {477–483},
publisher = {AI Access Foundation},
abstract = {An important problem with online communities in general, and online rating systems in particular, is uncooperative behavior: lack of user participation, dishonest contributions. This may be due to an incentive structure akin to a Prisoners' Dilemma (PD). We show that introducing an explicit social network to PD games fosters cooperative behavior, and use this insight to design a new aggregation technique for online rating systems. Using a dataset of ratings from Yelp, we show that our aggregation technique outperforms Yelp's proprietary filter, as well as baseline techniques from recommender systems. Copyright © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org).},
keywords = {Aggregation techniques, Artificial intelligence, Behavioral research, Big data, Co-operative behaviors, Cognitive systems, Computer games, Computer programming, Computer systems programming, Data mining, Hybrid systems, Incentive structure, On-line communities, Online rating systems, Online systems, Population statistics, Prisoners' Dilemma, Rating, Social networking (online), User participation},
pubstate = {published},
tppubtype = {inproceedings}
}
An important problem with online communities in general, and online rating systems in particular, is uncooperative behavior: lack of user participation, dishonest contributions. This may be due to an incentive structure akin to a Prisoners' Dilemma (PD). We show that introducing an explicit social network to PD games fosters cooperative behavior, and use this insight to design a new aggregation technique for online rating systems. Using a dataset of ratings from Yelp, we show that our aggregation technique outperforms Yelp's proprietary filter, as well as baseline techniques from recommender systems. Copyright © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org).
10.
Esfandiari, B.; Davoust, A.
Distributed Wikis and Social Networks: a Good Fit Proceedings Article
Dans: WWW 2016 Companion - Proceedings of the 25th International Conference on World Wide Web, p. 937–938, Association for Computing Machinery, Inc, 2016, ISBN: 978-145034144-8 (ISBN), (Journal Abbreviation: WWW Companion - Proc. Int. Conf. World Wide Web).
Résumé | Liens | BibTeX | Étiquettes: Discussion forum, Distributed computer systems, distributed wiki, distributed wikis, Peer to peer, Peer to peer networks, Self-organize, Social network, Social networking (online), social networks, Subjective quality, World Wide Web
@inproceedings{esfandiari_distributed_2016,
title = {Distributed Wikis and Social Networks: a Good Fit},
author = {B. Esfandiari and A. Davoust},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85115132914&doi=10.1145%2f2872518.2890584&partnerID=40&md5=8887bea19553f8239bf60ebf694bac82},
doi = {10.1145/2872518.2890584},
isbn = {978-145034144-8 (ISBN)},
year = {2016},
date = {2016-01-01},
booktitle = {WWW 2016 Companion - Proceedings of the 25th International Conference on World Wide Web},
pages = {937–938},
publisher = {Association for Computing Machinery, Inc},
abstract = {Social networks can play an important role in the process of decentralizing authority in distributed systems. We will focus on distributed wiki systems, and we show how, in the special case of a peer-to-peer wiki, there is a rational incentive for users to self-organize and form a meaningful social network. We discuss to that effect the basic metrics that can be derived from the topology of the social network to help assess the subjective quality of wiki entries. Demos and experimental results will illustrate and support our discussion. We finally speculate as to how these results may also translate to discussion forums or recommender systems. © 2016 International World Wide Web Conference Committee (IW3C2).},
note = {Journal Abbreviation: WWW Companion - Proc. Int. Conf. World Wide Web},
keywords = {Discussion forum, Distributed computer systems, distributed wiki, distributed wikis, Peer to peer, Peer to peer networks, Self-organize, Social network, Social networking (online), social networks, Subjective quality, World Wide Web},
pubstate = {published},
tppubtype = {inproceedings}
}
Social networks can play an important role in the process of decentralizing authority in distributed systems. We will focus on distributed wiki systems, and we show how, in the special case of a peer-to-peer wiki, there is a rational incentive for users to self-organize and form a meaningful social network. We discuss to that effect the basic metrics that can be derived from the topology of the social network to help assess the subjective quality of wiki entries. Demos and experimental results will illustrate and support our discussion. We finally speculate as to how these results may also translate to discussion forums or recommender systems. © 2016 International World Wide Web Conference Committee (IW3C2).