@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}

}

@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}

}

@inproceedings{murtaza_trace_2015,

title = {A trace abstraction approach for host-based anomaly detection},

author = {S. S. Murtaza and W. Khreich and A. Hamou-Lhadj and S. Gagnon},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84953310135&doi=10.1109%2fCISDA.2015.7208644&partnerID=40&md5=30e47f711b04bc6c44be9f6daea5ebf1},

doi = {10.1109/CISDA.2015.7208644},

isbn = {978-146737557-3 (ISBN)},

year  = {2015},

date = {2015-01-01},

booktitle = {2015 IEEE Symposium on Computational Intelligence for Security and Defense Applications, CISDA 2015 - Proceedings},

pages = {170–177},

publisher = {Institute of Electrical and Electronics Engineers Inc.},

abstract = {High false alarm rates and execution times are among the key issues in host-based anomaly detection systems. In this paper, we investigate the use of trace abstraction techniques for reducing the execution time of anomaly detectors while keeping the same accuracy. The key idea is to represent system call traces as traces of kernel module interactions and use the resulting abstract traces as input to known anomaly detection techniques, such as STIDE (the Sequence Time-Delay Embedding) and HMM (Hidden Markov Models). We performed experiments on three datasets, namely, the traditional UNM dataset as well as two modern datasets, Firefox and ADFA-LD. The results show that kernel module traces can lead to similar or fewer false alarms and considerably smaller execution times compared to raw system call traces for host-based anomaly detection systems. © 2015 IEEE.},

note = {Journal Abbreviation: IEEE Symp. Comput. Intell. Secur. Def. Appl., CISDA - Proc.},

keywords = {Abstracting, Abstraction techniques, Alarm systems, Anomaly detection, Anomaly detection systems, Anomaly detector, Artificial intelligence, Chemical detection, Computer programming languages, Distributed computer systems, Errors, Hidden Markov models, Host-based Anomaly Detection System, Markov processes, Signal detection, Software dependability, Software security, System call traces, Time delay, Time delay embedding, Trace analysis, Trace Analysis and Abstraction},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{davoust_devs_2012,

title = {DEVS simulation of peer-to-peer file-sharing},

author = {A. Davoust and G. Wainer and B. Esfandiari},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84866984789&doi=10.1109%2fHPCSim.2012.6266937&partnerID=40&md5=0a024e6c84c3befb05bb063b538ee71a},

doi = {10.1109/HPCSim.2012.6266937},

isbn = {978-146732359-8 (ISBN)},

year  = {2012},

date = {2012-01-01},

booktitle = {Proceedings of the 2012 International Conference on High Performance Computing and Simulation, HPCS 2012},

pages = {357–364},

address = {Madrid},

abstract = {We present a framework to simulate a peer-to-peer (P2P) file-sharing network, based on the Discrete Event Systems Specification (DEVS) formalism. Our framework models a file-sharing network as a coupled model, comprising a network model and a large number of peer models. While most available network simulation tools focus on transportlevel dynamics, we provide extensible and reusable models for the file-sharing protocol and for the behavior of peers. These models, implemented using the CD++ toolkit, can readily be used on existing simulators, including parallel and real-time simulators. As a case study, we apply our framework to simulate a P2P web, and show the emergence of an interesting page distribution. © 2012 IEEE.},

note = {Journal Abbreviation: Proc. Int. Conf. High Perform. Comput. Simul., HPCS},

keywords = {Coupled models, DEVS, DEVS simulation, Discrete event systems Specifications, Distributed computer systems, File Sharing, File sharing networks, Framework models, Internet protocols, Network models, Network simulation tools, Peer model, Peer to peer, Peer to peer networks, Peer-To-Peer, Real-time simulator, simulation},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{craig_distributed_2011,

title = {A distributed wiki system based on peer-to-peer file sharing principles},

author = {A. Craig and A. Davoust and B. Esfandiari},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-80155122622&doi=10.1109%2fWI-IAT.2011.231&partnerID=40&md5=ff6031acbb6d96f836879e6f2c378db3},

doi = {10.1109/WI-IAT.2011.231},

isbn = {978-076954513-4 (ISBN)},

year  = {2011},

date = {2011-01-01},

booktitle = {Proceedings - 2011 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2011},

volume = {1},

pages = {364–371},

address = {Lyon},

abstract = {In peer-to-peer (P2P) file-sharing networks, each peer maintains its own repository, publishing files, downloading files from others, and making its own files available for download. We present P2Pedia, a distributed wiki system applying these principles to collaborative editing of documents: contributors may maintain their own version of each document, while accessing and reusing the contributions of others. This collaboration model, by allowing for multiple versions of a document, generates a different type of versioning hierarchy, and changes the semantics of wikilinks. We show how the versioning hierarchy of documents and the wikilinks create a graph of documents, that can be searched using an existing file-sharing infrastructure, and we propose some trust indicators to help users choose between available search results. Finally, we present the design and implementation of P2Pedia, and propose some scenarios where our proposed collaboration model is most appropriate. © 2011 IEEE.},

note = {Journal Abbreviation: Proc. - IEEE/WIC/ACM Int. Conf. Web Intell., WI},

keywords = {Collaboration models, Collaborative Editing, Distributed computer systems, Electronic document exchange, File Sharing, File sharing networks, Graph queries, Peer to peer, Peer to peer networks, Peer-To-Peer, Peer-to-peer file sharing, Search results, Semantics, System-based, Trust, User interfaces, Versioning, Wiki},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{davoust_linking_2009,

title = {Linking and navigating data in a P2P file-sharing network},

author = {A. Davoust and B. Esfandiari},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84888109555&partnerID=40&md5=15b8071da5a8a44f3c719a82075fdc07},

year  = {2009},

date = {2009-01-01},

booktitle = {CEUR Workshop Proceedings},

volume = {538},

address = {Madrid},

abstract = {We demonstrate a tool for publishing and navigating linked data over the highly dynamic infrastructure of a P2P file- sharing network. Our links are based on a URI scheme which allows unambiguous designation of replicated data items, regardless of their location in the network. In a true decentralized P2P spirit, users publish and distribute the links just like other data items.},

note = {ISSN: 16130073},

keywords = {Data handling, Demo, Distributed computer systems, Dynamic infrastructure, File sharing networks, Linked datum, Peer to peer, Peer to peer networks, Replicated data, Sharing network, URI},

pubstate = {published},

tppubtype = {inproceedings}

}