var types = new Array(
"jour",
"jour",
"bc",
"conf"
);

var names = new Array(
"Fotis Loukos, Helen Karatza and Constandinos X. Mavromoustakis, \"AntP2PR: \
An ant intelligence inspired routing scheme for Peer-to-Peer networks \", \
Simulation Modelling Practice and Theory, Elsevier, Volume 19, \
Issue 2, Pages 649-661, February 2011",
"Fotis Loukos and Helen Karatza, \"Reputation based Friend-to-Friend \
networks\", Peer-to-Peer Networking and Applications, Springer, Volume 2, \
Issue 1, Pages 13-23, March 2009",
"Fotis Loukos and Helen Karatza, \"Enabling Cooperation in MANET-based \
Peer-to-Peer systems\", In Mobile Peer-to-Peer Computing for Next Generation \
Distributed Environments: Advancing, Conceptual and Algorithmic Applications, \
Boon-Chong Seet Editor, IGI Global, Pages 118-131, 2009",
"Fotis Loukos and Helen Karatza, \"SPECT: A System for Peer-to-Peer Economic \
Transactions\", to appear in the Proceedings of the 16th IEEE Symposium on \
Computers and Communications (IEEE ISCC 2011), June 28 - July 1, 2011, \
Corfu, Greece"
);

var abstracts = new Array(
"Unstructured Peer-to-Peer networks consist of an infrastructure-less overlay \
on top of another network. Most of them use distributed algorithms for all \
operations, such as resource discovery or connectivity control. Research \
has shown that a considerable amount of the generated traffic is due to \
signaling messages. Furthermore, another challenge when implementing a \
Peer-to-Peer network is avoiding free riders, i.e. users trying to profit from \
the network without sharing their resources. In this paper a new approach to \
routing packets in such networks is presented using ant intelligence. Success \
messages are used as agents and the biological procedure of pheromone trails \
is used for forwarding new packets used in resource discovery. These agents \
carry an amount of pheromone which will be added to a pheromone table \
representing routes to other peers. This approach enables the network to \
adjust to the dynamic nature of Peer-to-Peer networks where new nodes connect \
and disconnect continuously. Peers that are free riding will be ultimately \
isolated from the rest of the network by limiting the number of messages \
directed to them. The authors have simulated an unstructured Peer-to-Peer \
network, such as Gnutella, that uses this method and the results are very \
promising. The amount of traffic used solely for resource discovery is greatly \
reduced enabling the users to use their bandwidth for transferring content.",
"Friend-to-Friend networks are a form of Peer-to-Peer networks that provide \
anonymity of the users who share data. Turtle is an example of such a network, \
where a peer only connects to real life friends. In this paper we propose an \
extension of Turtle for connecting to other nodes based on their reputation. \
Furthermore,we use trust management to dynamically adjust this reputation \
based on the honest or malicious behaviour of all connected peers. Using these \
techniques, a node is able to create links to other nodes and identify \
possible misbehaving friends. Finally, we present simulation results of a \
reputation based Turtle Friend-to-Friend network.",
"Mobile Peer-to-Peer networks are an emerging topic in networking. One of the \
major usages is the cooperation between peers. The aim of this book chapter is \
to outline cooperation methods and architectures used in these networks. It \
will provide the necessary background on Peer-to-Peer technologies and Mobile \
Ad Hoc networks. A comparison will present the similarities and differences of \
these two types of networks. Additionally the major problems we face when \
implementing Mobile Peer-to-Peer networks will be presented together with \
proposed solutions. We will focus on the problem of cooperation in Mobile \
Peer-to-Peer networks. Furthermore, a number of examples together with \
experimental results from past work will be illustrated and a discussion \
will summarize. Finally, some of the future trends and problems to be solved \
will be presented",
"Network economics appear to be one of the best solutions when it comes to \
solving the tragedy of the digital commons problem in Peer-to-Peer \
networks. Various solutions have been proposed based on bartering or \
auctioning. This paper presents SPECT, a new system based on virtual \
currency. Its novelty lies in the usage of the supply and demand laws, a \
projection of the real market and the usage of microeconomic tools. \
Furthermore, using the CB, the basic authority in the SPECT market, a \
regulation of the prices and a protection from the misbehavior of other \
users is provided. \
\
An innovation of SPECT is the introduction of a financial instrument, the \
debt obligations, based on the real world bonds. Using debt obligations, \
peers are able to profit from being in the network even if they do not \
share resources with other peers. \
\
The authors outline the architecture of the SPECT market and the different \
portfolio management abilities. Furthermore, two different strategies based \
on a greedy and a non-greedy approach are displayed."
);

var bibtexs = new Array(
"@Article{ LoukosKaratza10ANTP2P, \n \
        title = {AntP2PR: An ant intelligence inspired routing scheme for Peer-to-Peer networks}, \n \
        author = {Fotis Loukos and Helen Karatza and Constandinos X. Mavromoustakis}, \n \
        journal = {Simulation Modelling Practice and Theory}, \n \
        year = {2011}, \n \
        volume = {19}, \n \
        number = {2}, \n \
        pages = {649--661}, \n \
        issn = {1569-190X}, \n \
        doi = {10.1016/j.simpat.2010.10.004} \n \
}",
"@Article{ LoukosKaratza09ReputationF2F, \n \
        title = {Reputation based friend-to-friend networks}, \n \
        author = {Fotis Loukos and Helen Karatza}, \n \
        journal = {Peer-to-Peer Networking and Applications}, \n \
        year = {2009}, \n \
        volume = {2}, \n \
        number = {1}, \n \
        pages = {13--23}, \n \
        issn = {1936-6442}, \n \
        doi = {10.1007/s12083-008-0019-1} \n \
}",
"@InCollection{ LoukosKaratza09CoopMANETP2P, \n \
        title = {Enabling Cooperation in MANET-based Peer-to-Peer systems}, \n \
        booktitle = {Mobile Peer-to-Peer Computing for Next Generation Distributed Environments: Advancing, Conceptual and Algorithmic Applications}, \n \
        author = {Fotis Loukos and Helen Karatza}, \n \
        editor = {Boon-Chong Seet}, \n \
        publisher = {IGI Global}, \n \
        pages = {118--131}, \n \
        year = {2009} \n \
}",
"@InProceedings{ LoukosKaratza11SPECT, \n \
        title = {SPECT: A System for Peer-to-Peer Economic Transactions}, \n \
        booktitle = {16th IEEE Symposium on Computers and Communications (IEEE ISCC 2011)}, \n \
        author = {Fotis Loukos and Helen Karatza}, \n \
        pages = {1081--1084} \n \
        year = {2011} \n \
}"
);

var links = new Array(
"http://dx.doi.org/10.1016/j.simpat.2010.10.004",
"http://dx.doi.org/10.1007/s12083-008-0019-1",
"http://www.igi-global.com/Bookstore/Chapter.aspx?TitleId=26796",
"http://dx.doi.org/10.1109/ISCC.2011.5983986"
);

function unique(a)
{
   var r = new Array();
   o:for(var i = 0, n = a.length; i < n; i++)
   {
      for(var x = 0, y = r.length; x < y; x++)
      {
         if(r[x]==a[i]) continue o;
      }
      r[r.length] = a[i];
   }
   return r;
}

function clearinfo() {
    var paperinfo = document.getElementById("paperinfo");
    if(paperinfo) {
        while(paperinfo.firstChild)
            paperinfo.removeChild(paperinfo.firstChild);
    }
}

function showabstract(num) {
    if(num >= abstracts.length)
        return false;

    var paperinfo = document.getElementById("paperinfo");
    if(paperinfo) {
        clearinfo();
        var hide = document.createElement("a");
        hide.setAttribute("href", "#");
        hide.setAttribute("onclick", "clearinfo()");
        hide.appendChild(document.createTextNode("Hide"));
        paperinfo.appendChild(hide);

        paperinfo.appendChild(document.createElement("br"));

        var name = document.createElement("b");
        name.appendChild(document.createTextNode(names[num]));
        paperinfo.appendChild(name);

        paperinfo.appendChild(document.createElement("br"));

        paperinfo.appendChild(document.createTextNode(abstracts[num]));
    }
    return false;
}

function showbibtex(num) {
    if(num > bibtexs.length)
        return false;

    var paperinfo = document.getElementById("paperinfo");
    if(paperinfo) {
        clearinfo();
        var hide = document.createElement("a");
        hide.setAttribute("href", "#");
        hide.setAttribute("onclick", "clearinfo()");
        hide.appendChild(document.createTextNode("Hide"));
        paperinfo.appendChild(hide);

        paperinfo.appendChild(document.createElement("br"));

        var name = document.createElement("b");
        name.appendChild(document.createTextNode(names[num]));
        paperinfo.appendChild(name);

        var bibtex = document.createElement("pre");
        bibtex.appendChild(document.createTextNode(bibtexs[num]));
        paperinfo.appendChild(bibtex);
    }
    return false;
}

function fillpapers() {
    var utypes = unique(types);

    for(var idx in utypes) {
        var list = document.getElementById(utypes[idx]);
        while(list.childNodes[0])
            list.removeChild(list.childNodes[0]);
    }

    for(var idx in types) {
        var list = document.getElementById(types[idx]);

        var entry = document.createElement("li");

        entry.appendChild(document.createTextNode(names[idx] + " "));

        var span = document.createElement("span");
        span.style.fontSize = "80%";

        var abstr = document.createElement("a");
        abstr.setAttribute("href", "#");
        abstr.setAttribute("onclick", "return showabstract(" + idx + ")");
        abstr.appendChild(document.createTextNode("Abstract"));
        span.appendChild(abstr);

        span.appendChild(document.createTextNode(" - "));

        var bibtex = document.createElement("a");
        bibtex.setAttribute("href", "#");
        bibtex.setAttribute("onclick", "return showbibtex(" + idx + ")");
        bibtex.appendChild(document.createTextNode("Bibtex"));
        span.appendChild(bibtex);

        span.appendChild(document.createTextNode(" - "));

        var link = document.createElement("a");
        link.setAttribute("href", links[idx]);
        link.setAttribute("target", "_blank");
        link.appendChild(document.createTextNode("Link"));
        span.appendChild(link);

        entry.appendChild(span);

        list.appendChild(entry);
    }
}