January 2016
·
14 Reads
This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.
January 2016
·
14 Reads
April 2012
·
39 Reads
·
3 Citations
In this paper we outline the design and implementation of the eDialogos Consensus process and platform to support wide-scale collaborative decision making. We present the design space and choices made and perform a conceptual alignement of the domains this space entails, based on the use of the eDialogos Consensus ontology as a crystallization point for platform design and implementation as well as interoperability with existing solutions. We also present a metric for calculating agreement on the issues under debate in the platform, incorporating argumentation structure and user feedback.
March 2010
·
147 Reads
·
9 Citations
Lecture Notes in Computer Science
In this paper we describe the application of various Semantic Web technologies and their combination with emerging Web 2.0 use patterns in the eParticipation domain and show how they are used in an operational system for the Regional Government of the Prefecture of Samos, Greece. We present parts of the system that are based on Semantic Web technology and how they are merged with a Web 2.0 philosophy and explain the benefits of this approach, as showcased by applications for annotating, searching, browsing and cross-referencing content in eParticipation communities.
December 2009
·
118 Reads
·
104 Citations
Journal of Web Semantics
Abstract Many Semantic Web problems are dicult,to solve through common divide-and-conquer strategies, since they are hard to partition. We present Marvin, a parallel and distributed platform for processing large amounts of RDF data, on a network of loosely-coupled peers. We present our divide-conquer-swap strategy and show that this model converges towards completeness. Within this strategy, we address the problem of making distributed reasoning scalable and load-balanced. We present SpeedDate, a routing strategy that combines data clustering with random exchanges. The ran- dom exchanges ensure load balancing, while the data clustering attempts to maximise eciency. SpeedDate is compared against random and deterministic (DHT-like) approaches, on performance and load-balancing. We simulate parameters such as system size, data distribution, churn rate, and network topology. The results indicate that SpeedDate is near-optimally balanced, performs in the same order of magnitude as a DHT-like approach, and has an average throughput per node that scales with p i for i items in the system. We evaluate our overall Marvin system for performance, scalability, load balancing and eciency.
January 2009
·
33 Reads
·
10 Citations
The increasing popularity of Web Services (WS) has ex- emplified the need for scalable and robust discovery mecha- nisms. Although decentralized solutions for discovering WS promise to fulfill these needs, most make limiting assump- tions concerning the number of nodes and the topology of the network and rely on having information on the data a- priori (e.g. categorizations or popularity distributions). In addition, most systems are tested via simulations using ar- tificial datasets. In this paper we introduce a lightweight, scalable and robust WSDL discovery mechanism based on real-time calculation of term popularity. In order to eval- uate this mechanism, we have collected and analyzed real data from deployed WS and performed a large-scale emula- tion on the DAS-3 distributed supercomputer. Results show that we can achieve web-scale service discovery based on term search and we also sketch an extension of this mecha- nism to support a fully-fledged WS query language.
January 2009
·
99 Reads
·
30 Citations
January 2009
·
17 Reads
January 2009
·
406 Reads
·
52 Citations
January 2009
·
21 Reads
January 2009
·
29 Reads
... It is this characteristic that allows such a public health information system to protect against identification of individuals and the approach taken also resolves the risk of re-identification based on quasiidentifiers in the form of information known about individuals that could potentially be used to match with and re-identify the submitted data. The platform"s anonymity preserving characteristics have been analyzed using the common construct of k-anonymity [7]. K-anonymity is assured for a data set, if any individual is indiscernible from k other records based on quasi-identifiers. ...
January 2009
... Models that are inaccurate or inconsistent with the dataset may be extracted, if we ignore auto-correlation during data analysis. A variety of spatiotemporal methods used for traditional data could be extended to handle agricultural big data (Shekhar et al., 2015;Li et al., 2016;Golmohammadi et al., 2018). ...
January 2009
... Data of this kind has no specific format or order, does not follow any rules or semantics, has no easily recognizable structure, cannot be stored in a spreadsheet-like format (i.e., based on rows and columns), and cannot be directly used or understood by a program. Unstructured data is estimated to account for 80% of the world's official data [51,52]. ...
January 2009
... To solve the scalability problem of semantic web reasoners, proposed solutions [5][6][7][8][9][10][11][12][13] suggest applying distributed computing techniques. Some of these studies guarantee reaching full closure [5][6][7][8][9][10], while some of them argue that they eventually reach full closure with an infinite loop [11][12][13]. ...
... Another important research topic in this domain is related to the insertion of human operators in a mixed teamwork. Some research effort has been devoted to provide human communities with automated support for discussion, agreement, and deliberation, such as for example the eDialogos Consensus Building platform [9], an initial implementation of the outlined Open Innovation structured deliberation process. In other words, the objective is to define a Semantic Web Collaborative Space with the ultimate goal of promoting collective decision making [5]. ...
April 2012
... Semantic analysis can also help deepen political participation. Anadiotis, et al. (2010) researched the application of semantic web technologies and their association with emerging Web 2.0 use patterns in e-participation, which enable citizens to connect with one another. Charalambous, et al. (2014) identified and evaluated opportunities and contributions offered by semantic technology to online collaboration platforms. ...
March 2010
Lecture Notes in Computer Science
... The available approaches for distributed reasoning can be classified in two main categories based on the underlying peer-to-peer network and the ability to control its overlay structure: the artificial intelligence area [6] and the database systems area [7,8]. Our approach leverages mechanisms from both areas and follows a hybrid solution similar to the one proposed in [8]. ...
January 2007
... The discovery of services that fulfil a certain task in the process of answering the user's request also brings in the need for selecting the most suitable of these candidates to actually execute the task needed. Since Web application platforms have shifted from classic RPC-oriented Web services [Anadiotis et al., 2009b] [Maamar et al., 2011a]. ...
January 2009
... Moreover, LarKC (Large Knowledge Collider) is another scalable platform for distributed reasoning [37]. Similarly, the Marvin framework is a scalable platform for parallel and distributing reasoning on RDF data [38]. Also, Schlicht et al. propose a peer-to-peer reasoning for interlinking ontologies [36]. ...
December 2009
Journal of Web Semantics