The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Scientific collaboration increasingly involves data sharing between separate groups. We consider a scenario where data products of scientific workflows are published and then used by other researchers as inputs to their workflows. For proper interpretation, shared data must be complemented by descriptive metadata. We focus on provenance traces, a prime example of such metadata which describes the...
For the vague nature of trust and reputation, the traditional reputation modelings used the classic probability or fuzzy sets to describe and measure the degree of trust. The theoretic foundation of these models is subject logic or fuzzy logic. But in some practical applications, the usage of simple probability model led trust's subjectivity and uncertainty to randomness. For the fuzzy logic, the...
Node clustering has wide-ranging applications in decentralized P2P networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks, and so forth. This paper proposes an approach to construct clusters in unstructured P2P networks based on small-world theory. In contrast to centralized graph clustering algorithms, our scheme is completely decentralized and it only uses the knowledge...
Describing social positions and roles is an important topic within social network analysis. One approach is to compute a suitable equivalence relation on the nodes of the target network. One relation that is often used for this purpose is regular equivalence, or bisimulation, as it is known within the field of computer science. In this paper we consider a relation from computer science called simulation...
Concurrent signature was introduced as an alternative approach to solving the problem of fair exchange of signatures. It allows two entities to produce two signatures in such a way that, the signer of each signature is ambiguous from a third party's point of view until the release of a secret, known as the keystone. Once the keystone is released, both signatures become binding to their respective...
Matchmaking in e-marketplaces is challenging partially because of the multifaceted nature of participants' expectations and interests which makes the modelling of participants' profiles difficult. We formalize a profile as a set of constraints, each consisting of an attribute, a set of values, the constraint flexibility and its priority. We analysed several Knowledge Representation models (KRM) used...
The natural resources management area is substantial to the development of the all countries, because the resources are more scarce and the number of people bigger. For these reasons, they are more difficult to manage. In this way, find good techniques to learn how to treat with these resources in a sustainable way is an important activity of sciences. Specifically in computer science, several works...
Web has already become the richest information resource of the world. Web sources are open, dynamic, and autonomous. Evaluating and selecting high quality Web source is a key for the success of Web-based applications. Currently, most of the web source evaluation and selection are performed by Web experts. However, there are too many Web sources in any field, this process has proved to be very time...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.