A metrology-based approach for measuring the social dimension of cognitive trust in collaborative networks

This version of the article has been accepted for publication, after peer review and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s10111-018-0483-1[Abstract]: This paper addresses the measurement of the social dimension of cognitive trust in collaborative networks. Trust indicators are typically measured and combined in literature in order to calculate partners’ trustworthiness. When expressing the result of a measurement, some quantitative indication of the quality of the result—the uncertainty of measurement—should be given. However, currently this is not taken into account for the measurement of the social dimension of cognitive trust in collaborative networks. In view of this, an innovative metrology-based approach for the measurement of social cognitive trust indicators in collaborative networks is presented. Thus, a measurement result is always accompanied by its uncertainty of measurement, as well as by information traditionally used to properly interpret the results: the sample size, and the standard deviation of the sample

State-of-the-art on evolution and reactivity

This report starts by, in Chapter 1, outlining aspects of querying and updating resources on the Web and on the Semantic Web, including the development of query and update languages to be carried out within the Rewerse project. From this outline, it becomes clear that several existing research areas and topics are of interest for this work in Rewerse. In the remainder of this report we further present state of the art surveys in a selection of such areas and topics. More precisely: in Chapter 2 we give an overview of logics for reasoning about state change and updates; Chapter 3 is devoted to briefly describing existing update languages for the Web, and also for updating logic programs; in Chapter 4 event-condition-action rules, both in the context of active database systems and in the context of semistructured data, are surveyed; in Chapter 5 we give an overview of some relevant rule-based agents frameworks

Resource optimization and dynamic state management in a collaborative virtual environment.

Yim-Pan Chui.Thesis (M.Phil.)--Chinese University of Hong Kong, 2001.Includes bibliographical references (leaves 126-132).Abstracts in English and Chinese.Abstract --- p.iiAcknowledgments --- p.vChapter 1 --- Introduction --- p.1Chapter 1.1 --- Introduction to Collaborative Virtual Environments --- p.1Chapter 1.2 --- Barriers to Resource Management and Optimization --- p.3Chapter 1.3 --- Thesis Contributions --- p.5Chapter 1.4 --- Application of this Research Work --- p.6Chapter 1.5 --- Thesis Organization --- p.6Chapter 2 --- Resource Optimization - Intelligent Server Partitioning --- p.9Chapter 2.1 --- Introduction --- p.9Chapter 2.2 --- Server Partitioning --- p.13Chapter 2.2.1 --- Related Works --- p.15Chapter 2.2.2 --- Global Optimization Approaches --- p.17Chapter 2.3 --- Hybrid Genetic Algorithm Paradigm --- p.17Chapter 2.3.1 --- Drawbacks of traditional GA --- p.18Chapter 2.3.2 --- Problem Modeling --- p.19Chapter 2.3.3 --- Discussion --- p.24Chapter 2.4 --- Results --- p.25Chapter 2.5 --- Concluding Remarks --- p.28Chapter 3 --- Dynamic State Management - Dead Reckoning of Attitude --- p.32Chapter 3.1 --- Introduction to Dynamic State Management --- p.32Chapter 3.2 --- The Dead Reckoning Approach --- p.35Chapter 3.3 --- Attitude Dead Reckoning by Quaternion --- p.37Chapter 3.3.1 --- Modeling of the Paradigm --- p.38Chapter 3.3.2 --- Prediction Step --- p.39Chapter 3.3.3 --- Convergence Step --- p.40Chapter 3.3.4 --- Overall Algorithm --- p.46Chapter 3.4 --- Results --- p.47Chapter 3.5 --- Conclusion --- p.51Chapter 4 --- Polynomial Attitude Extrapolation --- p.52Chapter 4.1 --- Introduction --- p.52Chapter 4.2 --- Related Works on Kalman Filtering --- p.53Chapter 4.3 --- Historical Propagation of Quaternion --- p.54Chapter 4.3.1 --- Cumulative Extrapolation --- p.54Chapter 4.3.2 --- Method I. Vandemonde Approach --- p.55Chapter 4.3.3 --- Method II. Lagrangian Approach --- p.58Chapter 4.4 --- History-Based Attitude Management --- p.60Chapter 4.4.1 --- Multi-order Prediction --- p.60Chapter 4.4.2 --- Adaptive Attitude Convergence --- p.63Chapter 4.4.3 --- Overall Algorithm --- p.67Chapter 4.5 --- Results --- p.69Chapter 4.6 --- Conclusion --- p.77Chapter 5 --- Forward Difference Approach on State Estimation --- p.78Chapter 5.1 --- Introduction --- p.78Chapter 5.2 --- Positional Forward Differencing --- p.79Chapter 5.3 --- Forward Difference on Quaternion Space --- p.80Chapter 5.3.1 --- Attitude Forward Differencing --- p.83Chapter 5.3.2 --- Trajectory Blending --- p.84Chapter 5.4 --- State Estimation --- p.86Chapter 5.5 --- Computational Efficiency --- p.87Chapter 5.6 --- Results --- p.88Chapter 5.7 --- Conclusion --- p.96Chapter 6 --- Predictive Multibody Kinematics --- p.98Chapter 6.1 --- Introduction --- p.98Chapter 6.2 --- Dynamic Management of Multibody System --- p.100Chapter 6.2.1 --- Multibody Representation --- p.100Chapter 6.2.2 --- Paradigm Overview --- p.101Chapter 6.3 --- Motion Estimation by Joint Extrapolation --- p.102Chapter 6.3.1 --- Individual Joint Extrapolation --- p.102Chapter 6.3.2 --- Forward Propagation of Joint State --- p.104Chapter 6.3.3 --- Pose Correction --- p.107Chapter 6.4 --- Limitations on Predictive Articulated State Management --- p.108Chapter 6.5 --- Implementation and Results --- p.109Chapter 6.6 --- Conclusion --- p.112Chapter 7 --- Complete System Architecture --- p.113Chapter 7.1 --- Server Cluster Model --- p.113Chapter 7.1.1 --- Peer-Server Systems --- p.114Chapter 7.1.2 --- Server Hierarchies --- p.114Chapter 7.2 --- Multi-Level Resource Management --- p.115Chapter 7.3 --- Aggregation of State Updates --- p.116Chapter 7.4 --- Implementation Issues --- p.117Chapter 7.4.1 --- Medical Visualization --- p.117Chapter 7.4.2 --- Virtual Walkthrough Application --- p.118Chapter 7.5 --- Conclusion --- p.119Chapter 8 --- Conclusions and Future directions --- p.121Chapter 8.1 --- Conclusion --- p.121Chapter 8.2 --- Future Research Directions --- p.122Chapter A --- Quaternion Basis --- p.124Chapter A.1 --- Basic Quaternion Mathematics --- p.124Chapter A.2 --- The Exponential and Logarithmic Maps --- p.125Bibliography --- p.12

A tree-scattering model for improved propagation prediction in urban microcells

This paper presents a model for the scattering of radiowaves from the canopy of a single tree. The canopy is modeled as a cylindrical volume containing randomly distributed and oriented cylinders, representing the branches, and thin disks, representing the leaves. A simple expression for the incoherent scattered field outside the canopy is obtained using Twersky's multiple scattering theory. This expression is shown to agree well with results of scattering measurements on a live tree typical of those found in urban environments. The scattering model can be readily incorporated in ray-based propagation prediction tools that assist the planning of microcellular radio networks. This involves the use of so-called tree-scattered rays, which interact at the tree centers. Path loss predictions generated with the aid of the new model are shown and compared with measured data to illustrate the considerable improvement in prediction accuracy that can be achieved in realistic urban microcellular scenarios by taking into account the scatter from trees

Choosing reputable resources in unstructured peer-to-peer networks using trust overlays

In recent years Peer-to-Peer Systems have gained popularity, and are best known as a convenient way of sharing content. However, even though they have existed for a considerable length of time, no method has yet been developed to measure the quality of the service they provide nor to identify cases of misbehaviour by individual peers. This thesis attempts to give to P2P systems some quality measures with the potential of giving querying peers criteria by which to judge and make predictions about the behaviour of their counterparts. The work includes the design of a reputation system from which querying peers can seek guidance before they commit to transaction with another peer. but usually as Reputation and Recommender systems have existed for years centralized services. Our innovation is the use of a distributed recommendation system which will be supported by the peers themselves. The system operates in the same manner as "word-of-mouth" in human societies does. In contrast to other reputation systems the word-of-mouth technique is itself decentralized since there is no need for central entities to exist as long as there are participants willing to be involved in the recommendation process. In order for a society to exist it is necessary that members have some way of knowing each other so that they can form relationships. The main element used to link members in an online community together is a virtual trust relationship that can be identified from the evidence that exists about their virtual partnerships. In our work we approximate the level of trust that could exist between any two parties by exploiting their similarity, constructing a network that is known as "web of trust". Using the transitivity property of trust, we make it possible for more peers to come in to contact through virtual trust relationships and thus get better results than in an ordinary system.EThOS - Electronic Theses Online ServiceGreek State Scholarships FoundationGBUnited Kingdo