This action might not be possible to undo. Are you sure you want to continue?

Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more

Download

Standard view

Full view

of .

Look up keyword

Like this

Share on social networks

1Activity

×

0 of .

Results for: No results containing your search query

P. 1

A STUDY OF PERIYAR PHILOSOPHY ON SELF- RESPECT USING
INDUCED FUZZY COGNITIVE MAPS (IFCMS)Ratings:

(0)|Views: 7|Likes: 0

Published by science2010

The world self-Respect (Suyamariyathai) used by Thanthai Periyar had a great impact over the

history of Tamilnadu. In this paper, we analyzed how the Periyar’s philosophies on self-Respect have

influenced the society using Induced Fuzzy Cognitive maps (IFCMs) and Neutrosophic Cognitive Maps (NCMs).

history of Tamilnadu. In this paper, we analyzed how the Periyar’s philosophies on self-Respect have

influenced the society using Induced Fuzzy Cognitive maps (IFCMs) and Neutrosophic Cognitive Maps (NCMs).

The world self-Respect (Suyamariyathai) used by Thanthai Periyar had a great impact over the

history of Tamilnadu. In this paper, we analyzed how the Periyar’s philosophies on self-Respect have

influenced the society using Induced Fuzzy Cognitive maps (IFCMs) and Neutrosophic Cognitive Maps (NCMs).

history of Tamilnadu. In this paper, we analyzed how the Periyar’s philosophies on self-Respect have

influenced the society using Induced Fuzzy Cognitive maps (IFCMs) and Neutrosophic Cognitive Maps (NCMs).

See more

See less

https://www.scribd.com/doc/173774363/A-STUDY-OF-PERIYAR-PHILOSOPHY-ON-SELF-RESPECT-USING-INDUCED-FUZZY-COGNITIVE-MAPS-IFCMS

11/18/2013

text

original

Volume: 02, October 2013, Pages: 152-155 International Journal of Computing AlgorithmIntegrated Intelligent Research (IIR) 152

A STUDY OF PERIYAR PHILOSOPHY ON SELF- RESPECT USINGINDUCED FUZZY COGNITIVE MAPS (IFCMS)

A. Victor Devadoss

1

, S. Christopher

21

Department of Mathematics, Loyola College, Chennai-34

2

School of Engineering and Technology - Surya Group of Institution, Vikkiravandi, Villupuram

2

christyjoan2003@yahoo.com

Abstract

The world self-Respect (Suyamariyathai) used by Thanthai Periyar had a great impact over thehistory of Tamilnadu. In this paper, we analyzed how the Periyar’s philosophies on self-Respect haveinfluenced the society using Induced Fuzzy Cognitive maps (IFCMs).

Key words

:

Thanthai Periyar, Self-Respect, FCM and IFCM.

Introduction

Thanthai Periyar E.V Ramasamy (1897-1973)was a unique social reformer and humanist of twentieth century. His Philosophy was all menand women should live with dignity and haveequal opportunity to develop their physical,mental and moral faculties. It was in thiscontext, he formed the self – respectmovement in 1925. It carried out on a vigorousand ceaseless propagation against ridiculousand harmful superstitions, traditions customsand habits [5, 8]The current study examines Periyar’s view onself- respect and how it influenced the societyusing Induced Fuzzy Cognitive maps(IFCMs). Political scientist R.Axelord [1] used cognitive maps (FCMs) for modeling decisionmaking process associated with political and social system. Then B.Kosko [2, 3] introduced Fuzzy Cognitive maps (FCM) by enhancingthe power of cognitive maps with fuzzy valuesfor the concept of the cognitive map and fuzzydegree of interrelationships between concepts.FCM can successfully represented knowledgeand human experience, it introduces theconcept to represent the essential elements and the cause and effect relationships among theconcepts to model the behavior of any system.T.Pathinathan et.al [4] introduced induced concept to bring out much stronger relationship among the attributes

.

In thecurrent study, section two gives the preliminaries of Fuzzy Cognitive Maps.Section three explains the method of findinghidden pattern in Induced FCM. Section four gives the adaptation of the problem to IFCMand section five gives the conclusion based onour study.

1.

Preliminaries

Fuzzy Cognitive Maps (FCMs) are moreapplicable when the data in the first Place isan unsupervised one. The FCMs work on theopinion of experts. FCMs model the world asa collection of classes and causal relations between classes [6,7].

1.1

Definition:

A FCMs is a directed graph with conceptslike policies, events etc, as nodes and causalities as edges. It represents causalrelationship between concepts.

1.2

Definition:

When the nodes of the FCM are fuzzy setsthen they are called as fuzzy nodes.

1.3

Definition:

FCMs with edge weights or causalities fromthe set {-1, 0, 1} are called simple FCMs

1.4

Definition:

Let C

i

and C

j

denote the two nodes of theFCM. The directed edge from C

i

to C

j

denotethe causality of C

i

on C

j

called connections.Every edge in the NCM is weighted with anumber in the set {-1, 0, 1}. Let e

ij

be theweight of the directed edge

ij

CC

, e

ij

{.1, 0,1}. e

ij

= 0 if C

i

does not have any effect on

j

C

Volume: 02, October 2013, Pages: 152-155 International Journal of Computing AlgorithmIntegrated Intelligent Research (IIR) 153, e

ij

= 1 if increase (or decrease) in C

i

causesincrease (or decreases) in C

j

. e

ij

=1 if increase(or decrease) in C

i

causes decrease (or increase) in C

j.

1.5

Definition:

Let

C

1,

C

2

,...,C

n

be nodes of a FCM. Let theadjacency matrix E be defined as E=(e

ij

)where e

ij

is the weight of the directed edgeC

i

C

j

, where e

ij

{.1, 0, }.

1.6

Definition:

Let

C

1,

C

2

,...,C

n

be the nodes of the FCM. Let, where {0, 1, }. A iscalled the instantaneous state vector and itdenotes the on-off state position of the nodeat an instant= 0 if is off (no effect)= 1 if is on (has effect) for

i=1,2..n

1.7

Definition:

Let

C

1,

C

2

,...,C

n

be the nodes of the FCM. Let be the edges of the FCM.Then the edges form a directed cycle. AnFCM is said to be cyclic if it possesses adirected cyclic. An FCM is said to be acyclicif it does not possess any directed cycle.

1.8

Definition:

An FCM with cycles is said to have afeedback. When there is a feedback in theFCM i.e. when the causal relations flowthrough a cycle in a revolutionary manner theFCM is called a dynamical system.

1.9

Definition:

Let be cycle, when isswitched on and if the causality flow throughthe edges of a cycle and if it again causes,we say that the dynamical system goes round and round. This is true for any node, for the equilibrium state for thisdynamical system is called the hidden pattern.

1.10

Definition:

If the equilibrium state of a dynamical systemis a unique state vector, then it is called afixed point. Consider the FCM withC

1,

C

2

,...,C

9

as nodes. For example let us startthe dynamical system by switching on C

1

Letus assume that the NCM settles down with C

1

and C

n

on, i.e. the state vector remain as (1, 0,., 1) this state vector (1,0,., 0, 1) is called thefixed point.

1.11

Definition:

If the FCM settles with a state vector repeating in the form A

1

A

2

…A

i

A

1

then this equilibrium is called a limit cycle of the FCM.

2.

Method of Determining HiddenPattern

Let {

C

1,,

C

2

,...,C

n

}be the nodes of an FCM,with feedback. Let E be the associated adjacency matrix. Let us find the hidden pattern when C

1

is switched on when an inputis given as the vector A

1

= (1, 0, 0,., 0), thedata should pass through the matrix E, this isdone by multiplying A1 by the matrix E. LetA

1

E={a

1

,a

2

…,a

3

} with the threshold operation that is by replacing ai by 1 if and by 0 if ( suitable positive integer). We update the resultingconcept, the concept C

1

is included in theupdated vector by making the first coordinateas 1 in the resulting vector. Suppose A

2

E

A

2

then consider A

2

E and repeat the same procedure. This procedure is repeated till weget a limit cycle or a fixed point.

2.1

Method of finding the hidden patternin Induced FCM

Let C

1,

C

2

,...,C

n

be the nodes of a FCM withfeedback. Let M be the adjacency matrix. Letus a hidden pattern when C

1

is switched on.We pass the state vector C1 through theConnection matrix M. A particular attribute,say, C

1

is kept in ON state and all other components are kept in OFF state. Let ONstate and other values to OFF state with 1 and 0 respectively. We make C

1

M yields, C

1

’. Toconvert to signal function, choose the firsttwo highest values to each component of C

1

’vector pass through M repeatedly for each positive entry 1 and we use the symbol (

≈).

Then choose that vector which contains the

12

{,...}

n

Aaaa

i

a

i

a

i

a

i

a

i

a

1223

,...

ij

CCCCCC

12231

,...

nn

CCCCCC

i

C

i

C

i

C

1,2...

in

i

ak

i

a

i

ak

ka

Volume: 02, October 2013, Pages: 152-155 International Journal of Computing AlgorithmIntegrated Intelligent Research (IIR) 154maximum number of 1’s. That which causesmaximum attributes to ON state and call it,say, C

2

. Supposing that there are two vectorswith maximum number of 1‘s are in ONstate, we choose the first vector. Repeat thesame procedure for C

2

until we get a fixed point or a limit cycle. We do this process togive due importance to each vector separatelyas one vector induces another or many morevectors into ON state. We get the hidden pattern either from the limit cycle or from thefixed point. We observe a pattern that leadsone cause to another and may end up in onevector or a cycle. Next we choose the vector by keeping the second Component in ONstate and repeat the same to get another cycleand it is done for all the vectors separately.We observe the hidden pattern of somevectors found in all or in many cases.Inference from this hidden patternsummarizes or highlights the causes.

3.

Adaptation of the Problem

The following attributes related to Periyar and self-respect was given by an expert whois a Periyarist.

1

c

- Racial Consciousness

2

c

- Rationalism

3

c

- Humanism

4

c

- Scientific thinking

5

c

- castesim / religion

6

c

- Women’s rightWe formed a directed graph based on expertopinion.Fig-1The related connection matrix M is as follows

C

1

C

2

C

3

C

4

C

5

C

6

M= Let

1

c

= (1 0 0 0 0 0 )

1

c

M = (0 1 1 1 1 1)(0 1 1 1 1 1)

T

M

= ( 5 4 4 3 0 1)

↪

( 1 1 1 1 01)=

'

1

c

'

1

c

M(1 0 0 0 0 0 )M = ( 0 1 1 1 1 1) (0 1 1 1 1 1)

T

M

= (5 4 4 4 0 1)

↪

(1 1 1 1 0 1)(0 1 0 0 0 0)M = (1 0 1 1 1 1)(1 0 1 1 1 1)

T

M

= (4 5 4 3 1 1)

↪

(1 1 1 1 1 1)=

'

2

c

(0 0 1 0 0 0)M = ( 1 1 0 1 1 1)(1 1 0 1 1 1)

T

M

= (4 4 5 4 1 0)

↪

(1 1 1 1 1 0)(0 0 0 1 0 0)M = ( 1 1 0 0 1 1)(1 1 0 0 1 1)

T

M

= (3 3 4 4 1 0)

↪

(1 1 1 1 1 0)(0 0 0 0 0 1 )M = ( 0 0 1 0 0 0)( 0 0 1 0 0 0)

T

M

= ( 1 1 0 0 0 1) Now let

1

c

= (0 1 0 0 0 0 )

1

c

M = (1 0 1 1 1 1)(1 0 1 1 1 1)

T

M

= (4 5 4 3 1 1)

↪

( 1 1 1 1 1 1)=

'

1

c

'

1

c

M( 1 0 0 0 0 0 )M = ( 0 1 1 1 1 1) (0 1 1 1 1 1)

T

M

= (5 4 4 4 0 1)

↪

(1 1 1 1 0 1)( 0 1 0 0 0 0 )M = (1 0 1 1 1 1)(1 0 1 1 1 1)

T

M

= (4 5 4 3 1 1)

↪

( 1 1 1 1 1 1)=

'

2

c

( 0 0 1 0 0 0)M = ( 1 1 0 1 1 1)(1 1 0 1 1 1)

T

M

= (4 4 5 4 1 0)

↪

( 1 1 1 1 10)(0 0 0 1 0 0)M = ( 1 1 0 0 1 1)(1 1 0 0 1 1)

T

M

= (3 3 4 4 1 0)

↪

(1 1 1 1 1 0)( 0 0 0 0 1 0 )M = ( 1 0 0 0 0 0)( 1 0 0 0 0 0)

T

M

= (0 1 1 1 1 0)( 0 0 0 0 0 1 )M = ( 0 0 1 0 0 0( 0 0 1 0 0 0)

T

M

= ( 1 1 0 0 0 1)

123456

011111101111110111110011100000001000

C C C C C C

Neutrosophic Graphs

Euclid Squares on Infinite Planes

Uncertainty Communication Solution in Neutrosophic Key

Am ajuns in Rai!

Okeanos (A photolog)

Neutrosophic Sets and Systems, Vol. 9, 2015

Neutrosophic Precalculus and Neutrosophic Calculus

Methods of Solving Calculus Problems

To be and Not to be – An introduction to Neutrosophy

THE NAVIGATION MOBILE ROBOT SYSTEMS USING BAYESIAN APPROACH THROUGH THE VIRTUAL PROJECTION METHOD

Threat assessment of a possible Vehicle-Born Improvised Explosive Device using DSmT

Thesis-Antithesis-Neutrothesis, and Neutrosynthesis

THE NAVIGATION OF MOBILE ROBOTS IN NON-STATIONARY AND NONSTRUCTURED ENVIRONMENTS

THE HYPERBOLIC MENELAUS THEOREM IN THE POINCARE´ DISC MODEL OF HYPERBOLIC GEOMETRY

The Effective Use of the DSmT for Multi-Class Classification

The Characteristic Function of a Neutrosophic Set

SUPERMATEMATICA PROFESORULUI ŞELARIU FLORENTIN SMARANDACHE

Some Types of Neutrosophic Crisp Sets and Neutrosophic Crisp Relations

SOME PROPERTIES OF THE HARMONIC QUADRILATERAL

Soft Nuetrosophic Ring and Soft Neutrosophic Field

Soft neutrosophic semigroups and their generalization

Soft Neutrosophic Loops and Their Generalization

Soft Neutrosophic Loop, Soft Neutrosophic Biloop and Soft Neutrosophic N-Loop

Soft Neutrosophic Left Almost Semigroup

- Read and print without ads
- Download to keep your version
- Edit, email or read offline

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

CANCEL

OK

You've been reading!

NO, THANKS

OK

scribd