http://user.it.uu.se/~jarst116/slides/week4.pdf

Graph-Based Algorithms for Boolean Function Manipulation

Though research on the Semantic Web has progressed at a steady pace, its promise has yet to be realized. One major difficulty is that, by its very nature, the Semantic Web is a large, uncensored system to which anyone may contribute. This raises the question of how much credence to give each source. We cannot expect each user to know the trustworthiness of each source, nor would we want to assign top-down or global credibility values due to the subjective nature of trust. We tackle this problem by employing a web of trust, in which each user maintains trusts in a small number of other users. We then compose these trusts into trust values for all other users. The result of our computation is not an agglomerate "trustworthiness" of each user. Instead, each user receives a personalized set of trusts, which may vary widely from person to person. We define properties for combination functions which merge such trusts, and define a class of functions for which merging may be done locally while maintaining these properties. We give examples of specific functions and apply them to data from Epinions and our BibServ bibliography server. Experiments confirm that the methods are robust to noise, and do not put unreasonable expectations on users. We hope that these methods will help move the Semantic Web closer to fulfilling its promise.

Trust management for the Semantic Web

Novel Binary-Addition Tree Algorithm for Reliability Evaluation of Acyclic Multistate Information Networks

A quick BAT for evaluating the reliability of binary-state networks

Online social networking is expanding gradually in our professional as well as personal life in a variety of natures, beliefs, attitudes, and personalities. During communicating through the networks, the trust plays a very significant role while undertaking the communication process. This article proposes a secure trusted hypothetical mathematical model for ensuring secure communication among devices by computing the individual trust of each node. In addition, a decision making model is integrated with the hypothetical model for further speeding up the real time communication decision within the network. The proposed phenomenon is validated against variety of security threats by considering both ideal and adversarial models. Furthermore, the proposed framework is compared to a baseline approach against various security threats such as system accuracy, DDoS attack, data falsification threat,and number of processed requests. The proposed scheme is verified by simulating over synthesized data-set.

/pdf/a-trusted-social-network-using-hypothetical-mathematical-5dmkbzumoc.pdf

A Trusted Social Network Using Hypothetical Mathematical Model and Decision- Based Scheme

With the advancement of computer and network technologies, Internet-based social networks called social networking services have become popular. Trust is a crucial basis for interactions among parties in social networks. Based on trust scores of direct links between parties, a trust sensitivity analysis can help identify which direct link(s) in a social network contributes the most to a trust relationship between parties who are not directly connected in the network. This paper generalizes the research object from two-state social networks to multistate social networks since the trust grade for people in a real social connection may have multiple levels. We model asymmetric multitrust level and multiparty social network systems and propose a probabilistic method based on multivalued decision diagrams (MDDs) to perform trust sensitivity analysis of social networks. Numerical examples are provided to demonstrate the application of the proposed methodology.

/pdf/sensitivity-analysis-of-multi-state-social-network-system-4l2vw2obua.pdf

Xueying Song

Papers

Sensitivity Analysis of Multi-State Social Network System Based on MDD Method