55,454 research outputs found
Controllability of Social Networks and the Strategic Use of Random Information
This work is aimed at studying realistic social control strategies for social
networks based on the introduction of random information into the state of
selected driver agents. Deliberately exposing selected agents to random
information is a technique already experimented in recommender systems or
search engines, and represents one of the few options for influencing the
behavior of a social context that could be accepted as ethical, could be fully
disclosed to members, and does not involve the use of force or of deception.
Our research is based on a model of knowledge diffusion applied to a
time-varying adaptive network, and considers two well-known strategies for
influencing social contexts. One is the selection of few influencers for
manipulating their actions in order to drive the whole network to a certain
behavior; the other, instead, drives the network behavior acting on the state
of a large subset of ordinary, scarcely influencing users. The two approaches
have been studied in terms of network and diffusion effects. The network effect
is analyzed through the changes induced on network average degree and
clustering coefficient, while the diffusion effect is based on two ad-hoc
metrics defined to measure the degree of knowledge diffusion and skill level,
as well as the polarization of agent interests. The results, obtained through
simulations on synthetic networks, show a rich dynamics and strong effects on
the communication structure and on the distribution of knowledge and skills,
supporting our hypothesis that the strategic use of random information could
represent a realistic approach to social network controllability, and that with
both strategies, in principle, the control effect could be remarkable
Trust beyond reputation: A computational trust model based on stereotypes
Models of computational trust support users in taking decisions. They are
commonly used to guide users' judgements in online auction sites; or to
determine quality of contributions in Web 2.0 sites. However, most existing
systems require historical information about the past behavior of the specific
agent being judged. In contrast, in real life, to anticipate and to predict a
stranger's actions in absence of the knowledge of such behavioral history, we
often use our "instinct"- essentially stereotypes developed from our past
interactions with other "similar" persons. In this paper, we propose
StereoTrust, a computational trust model inspired by stereotypes as used in
real-life. A stereotype contains certain features of agents and an expected
outcome of the transaction. When facing a stranger, an agent derives its trust
by aggregating stereotypes matching the stranger's profile. Since stereotypes
are formed locally, recommendations stem from the trustor's own personal
experiences and perspective. Historical behavioral information, when available,
can be used to refine the analysis. According to our experiments using
Epinions.com dataset, StereoTrust compares favorably with existing trust models
that use different kinds of information and more complete historical
information
Data centric trust evaluation and prediction framework for IOT
© 2017 ITU. Application of trust principals in internet of things (IoT) has allowed to provide more trustworthy services among the corresponding stakeholders. The most common method of assessing trust in IoT applications is to estimate trust level of the end entities (entity-centric) relative to the trustor. In these systems, trust level of the data is assumed to be the same as the trust level of the data source. However, most of the IoT based systems are data centric and operate in dynamic environments, which need immediate actions without waiting for a trust report from end entities. We address this challenge by extending our previous proposals on trust establishment for entities based on their reputation, experience and knowledge, to trust estimation of data items [1-3]. First, we present a hybrid trust framework for evaluating both data trust and entity trust, which will be enhanced as a standardization for future data driven society. The modules including data trust metric extraction, data trust aggregation, evaluation and prediction are elaborated inside the proposed framework. Finally, a possible design model is described to implement the proposed ideas
A schema-based P2P network to enable publish-subscribe for multimedia content in open hypermedia systems
Open Hypermedia Systems (OHS) aim to provide efficient dissemination, adaptation and integration of hyperlinked multimedia resources. Content available in Peer-to-Peer (P2P) networks could add significant value to OHS provided that challenges for efficient discovery and prompt delivery of rich and up-to-date content are successfully addressed. This paper proposes an architecture that enables the operation of OHS over a P2P overlay network of OHS servers based on semantic annotation of (a) peer OHS servers and of (b) multimedia resources that can be obtained through the link services of the OHS. The architecture provides efficient resource discovery. Semantic query-based subscriptions over this P2P network can enable access to up-to-date content, while caching at certain peers enables prompt delivery of multimedia content. Advanced query resolution techniques are employed to match different parts of subscription queries (subqueries). These subscriptions can be shared among different interested peers, thus increasing the efficiency of multimedia content dissemination
The Reputation, Opinion, Credibility and Quality (ROCQ) Scheme
An implicit assumption of trust in the participants is at the basis of most Peer-to-Peer (P2P) networks. However, in practice, not all participants are benign or cooperative. Identifying such peers is critical to the smooth and effective functioning of a P2P network. In this paper, we present the ROCQ mechanism, a reputation-based trust management system that computes the trustworthiness of peers on the basis of transaction-based feedback. The ROCQ model combines four parameters: Reputation (R) or a peer's global trust rating, Opinion (O) formed by a peer's first-hand interactions, Credibility (C) of a reporting peer and Quality (Q) or the confidence a reporting peer puts on the judgement it provides. We then present a distributed implementation of our scheme over FreePastry, a structured P2P network. Experimental results considering different models for malicious behavior indicate the contexts in which the ROCQ scheme performs better than existing schemes
PROTECT: Proximity-based Trust-advisor using Encounters for Mobile Societies
Many interactions between network users rely on trust, which is becoming
particularly important given the security breaches in the Internet today. These
problems are further exacerbated by the dynamics in wireless mobile networks.
In this paper we address the issue of trust advisory and establishment in
mobile networks, with application to ad hoc networks, including DTNs. We
utilize encounters in mobile societies in novel ways, noticing that mobility
provides opportunities to build proximity, location and similarity based trust.
Four new trust advisor filters are introduced - including encounter frequency,
duration, behavior vectors and behavior matrices - and evaluated over an
extensive set of real-world traces collected from a major university. Two sets
of statistical analyses are performed; the first examines the underlying
encounter relationships in mobile societies, and the second evaluates DTN
routing in mobile peer-to-peer networks using trust and selfishness models. We
find that for the analyzed trace, trust filters are stable in terms of growth
with time (3 filters have close to 90% overlap of users over a period of 9
weeks) and the results produced by different filters are noticeably different.
In our analysis for trust and selfishness model, our trust filters largely undo
the effect of selfishness on the unreachability in a network. Thus improving
the connectivity in a network with selfish nodes.
We hope that our initial promising results open the door for further research
on proximity-based trust
- …