Evaluating the Degree of Trust Under Context Sensitive Relational Database Hierarchy Using Hybrid Intelligent Approach

2015 ◽  
Vol 2 (1) ◽  
pp. 1-21 ◽  
Author(s):  
Manash Sarkar ◽  
Soumya Banerjee ◽  
Aboul Ella Hassanien
Keyword(s):  
Fuzzy Logic ◽  
Relational Model ◽  
Adjacent Level ◽  
Trust Value ◽  
Agent Based ◽  
Real Application ◽  
Context Sensitive ◽  
Trust Relationships ◽  
Dynamic Attributes ◽  
Intelligent Approach

Trust is a binary value either 0 or 1which is not measurable in real application. An entity can either trust another entity completely or do not trust at all. Trust between different entities in generalization-specialization relational model in database varies with respect to adjacent level of hierarchy. Trust value among entities depends not only on hierarchy level but also the context in which entities belong. In this paper the authors propose a model that allows evaluating trust relationships between two entities in the same context. Basically the trust depends on parameters like knowledge, experience and recommendation. In real application it is not always possible to have prior knowledge about mentioned entities. Extending this theory, it is shown that how the trust relationships is evaluated between different entities in different contexts of specialization level. As the trust represents uncertainty therefore, fuzzy logic is used to overcome the concept of binary value for trust. Considering the dynamic attributes of an entity based system, an appropriate agent based methodology could be incorporated. This paper introduced a model called FACO based on Fuzzy logic and Ant colony to calculate both the trust and the updated trust value among entities.

A Context-Aware Model of Trust for Facilitating Secure Ad Hoc Collaborations

2010 ◽  
pp. 250-281 ◽  
Author(s):  
Indrajit Ray ◽  
Indrakshi Ray ◽  
Sudip Chakraborty
Keyword(s):  
Incomplete Information ◽  
Ad Hoc ◽  
Sensitive Information ◽  
Trust Value ◽  
Trust Relationships ◽  
The Face ◽  
Trust Models ◽  
Almost All ◽  
Ad Hoc Collaborations ◽  
The Given

Ad hoc collaborations often necessitate impromptu sharing of sensitive information or resources between member organizations. Each member of resulting collaboration needs to carefully assess and tradeoff the requirements of protecting its own sensitive information against the requirements of sharing some or all of them. The challenge is that no policies have been previously arrived at for such secure sharing (since the collaboration has been formed in an ad hoc manner). Thus, it needs to be done based on an evaluation of the trustworthiness of the recipient of the information or resources. In this chapter, the authors discuss some previously proposed trust models to determine if they can be effectively used to compute trustworthiness for such sharing purposes in ad hoc collaborations. Unfortunately, none of these models appear to be completely satisfactory. Almost all of them fail to satisfy one or more of the following requirements: (i) well defined techniques and procedures to evaluate and/or measure trust relationships, (ii) techniques to compare and compose trust values which are needed in the formation of collaborations, and (iii) techniques to evaluate trust in the face of incomplete information. This prompts the authors to propose a new vector (we use the term “vector” loosely; vector in this work means a tuple) model of trust that is suitable for reasoning about the trustworthiness of systems built from the integration of multiple subsystems, such as ad hoc collaborations. They identify three parameters on which trust depends and formulate how to evaluate trust relationships. The trust relationship between a truster and a trustee is associated with a context and depends on the experience, knowledge, and recommendation that the truster has with respect to the trustee in the given context. The authors show how their model can measure trust in a given context. Sometimes enough information is not available about a given context to calculate the trust value. Towards this end the authors show how the relationships between different contexts can be captured using a context graph. Formalizing the relationships between contexts allows us to extrapolate values from related contexts to approximate a trust value of an entity even when all the information needed to calculate the trust value is not available. Finally, the authors develop formalisms to compare two trust relationships and to compose two or more of the same – features that are invaluable in ad hoc collaborations.

Simulation of consumers decision-making process using agent-based model approach

2019 ◽  
Vol 10 (06) ◽  
pp. 1950037
Author(s):  
Daniel Soto Forero ◽  
Yony F. Ceballos ◽  
German Sànchez Torres
Keyword(s):  
Decision Making ◽  
Fuzzy Logic ◽  
Real Data ◽  
World Market ◽  
Decision Making Process ◽  
Agent Based ◽  
Dynamic Social Network ◽  
Proposed Model ◽  
The World ◽  
Model Approach

This paper describes a model to simulate the decision-making process of consumers that adopts technology within a dynamic social network. The proposed model use theories and tools from the psychology of consumer behavior, social networks and complex dynamical systems like the Consumat framework and fuzzy logic. The model has been adjusted using real data, tested with the automobile market and it can recreate trends like those described in the world market.

scholarly journals A Fuzzy Logic Based Network Congestion Control Using Active Queue Management Techniques

2010 ◽  
Vol 2 (2) ◽  
pp. 273-284 ◽  
Author(s):  
I. K. Tabash ◽  
M. A. Mamun ◽  
A. Negi
Keyword(s):  
Fuzzy Logic ◽  
Fuzzy Logic Controller ◽  
Probability Function ◽  
Active Queue Management ◽  
Buffer Size ◽  
Queue Management ◽  
Passive Devices ◽  
Better Regulation ◽  
Ip Routers ◽  
Intelligent Approach

Conventional IP routers are passive devices that accept packets and perform the routing function on any input. Usually the tail-drop (TD) strategy is used where the input which exceeds the buffer capacity are simply dropped. In active queue management (AQM) methods routers manage their buffers by dropping packets selectively. We study one of the AQM methods called as random exponential marking (REM). We propose an intelligent approach to AQM based on fuzzy logic controller (FLC) to drop packets dynamically, keep the buffer size around desired level and also prevent buffer overflow. Our proposed approach is based on REM algorithm, which drops the packets by drop probability function. In our proposal we replace the drop probability function by a FLC to drop the packets, stabilize the buffer around the desired size and reduce delay. Simulation results show a better regulation of the buffer.  Keywords: Random exponential marking; Active queue management; Fuzzy logic controller; Pro-active queue management. © 2010 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved. DOI: 10.3329/jsr.v2i2.2786               J. Sci. Res. 2 (2), 273-284 (2010) 

Data Dependencies in Codd's Relational Model with Similarities

2011 ◽  
pp. 634-657
Author(s):  
Radim Belohlavek ◽  
Vilem Vychodil
Keyword(s):  
Fuzzy Logic ◽  
Classical Logic ◽  
Reference Model ◽  
Relational Model ◽  
Future Research ◽  
Functional Dependencies ◽  
Narrow Sense ◽  
Data Dependencies ◽  
Similarity Relations ◽  
Conceptual Clarity

This chapter deals with data dependencies in Codd’s relational model of data. In particular, we deal with fuzzy logic extensions of the relational model that consist of adding similarity relations to domains and consider functional dependencies in these extensions. We present a particular extension and functional dependencies in this extension that follow the principles of fuzzy logic in a narrow sense. We present selected features and results regarding this extension. Then, we use this extension as a reference model and compare it to several other extensions proposed in the literature. We argue that following the principles of fuzzy logic in a narrow sense, the same way we can follow the principles of classical logic in the case of the ordinary Codd relational model, helps achieve transparency, versatility, conceptual clarity, and theoretical and computational tractability of the extension. We outline several topics for future research.

Intelligent Agents in a Trust Environment

2002 ◽  
pp. 98-108
Author(s):  
Rahul Singh ◽  
Mark A. Gill
Keyword(s):  
Distributed System ◽  
Intelligent Agents ◽  
Single Agent ◽  
Intelligent Agent ◽  
The Internet ◽  
Commercial Activity ◽  
Agent Based ◽  
Trust Relationships ◽  
Multi Agent ◽  
Oriented Activity

Intelligent agents and multi-agent technologies are an emerging technology in computing and communications that hold much promise for a wide variety of applications in Information Technology. Agent-based systems range from the simple, single agent system performing tasks such as email filtering, to a very complex, distributed system of multiple agents each involved in individual and system wide goal-oriented activity. With the tremendous growth in the Internet and Internet-based computing and the explosion of commercial activity on the Internet in recent years, intelligent agent-based systems are being applied in a wide variety of electronic commerce applications. In order to be able to act autonomously in a market environment, agents must be able to establish and maintain trust relationships. Without trust, commerce will not take place. This research extends previous work in intelligent agents to include a mechanism for handling the trust relationship and shows how agents can be fully used as intermediaries in commerce.

A New Fuzzy-Based Approach for Anonymity Quantification in E-Services

2014 ◽  
Vol 8 (3) ◽  
pp. 13-38
Author(s):  
Wiem Hammami ◽  
Ilhem Souissi ◽  
Lamjed Ben Said
Keyword(s):  
Fuzzy Logic ◽  
User Privacy ◽  
Online Services ◽  
Agent Based ◽  
Set Size ◽  
Multi Agent

In online services, making anonymous transactions is a crucial need in order to ensure the user's trust towards a particular service. In this context, anonymity quantification is required to provide at which level the e-service respects the user privacy regarding the link between his/her identity and actions. Most of the existing researches are limited to the anonymity quantification in a static way and based, mainly, on the user's set size. In this paper, the authors propose a new multi-agent based approach for anonymity quantification in e-services considering dynamic and mobile environment's characteristics. The authors' quantification is based on the fuzzy logic. It is based not only on the anonymity set size, which is always known in advance, but also on a set of other criteria such as the number of users and the priori and posteriori knowledge about internal and external attackers of an e-service. The carried out experimentations show competitive and better results when compared to other recently proposed anonymity quantification.

Sign in / Sign up

Export Citation Format

Share Document