• Journal of applied mathematics & informatics
• /
• 제34권1_2호
• /
• pp.49-60
• /
• 2016

In this paper, two different approaches to chromatic number of a bipolar fuzzy graph are introduced. The first approach is based on the α-cuts of a bipolar fuzzy graph and the second approach is based on the definition of Eslahchi and Onagh for chromatic number of a fuzzy graph. Finally, the bipolar fuzzy vertex chromatic number and the edge chromatic number of a complete bipolar fuzzy graph, characterized.

• Journal of applied mathematics & informatics
• /
• 제42권3호
• /
• pp.625-634
• /
• 2024

The thrust of this paper is to extend the notion of Plithogenic vertex domination to the basic operations in Plithogenic product fuzzy graphs (PPFGs). When the graph is a complete PPFG, Plithogenic vertex domination numbers (PVDNs) of its Plithogenic complement and perfect Plithogenic complement are the same, since the connectivities are the same in both the graphs. Since extra edges are added to the graph in the case of perfect Plithogenic complement, the PVDN of perfect Plithogenic complement is always less than or equal to that of Plithogenic complement, when the graph under consideration is an incomplete PPFG. The maximum and minimum values of the PVDN of the intersection or the union of PPFGs depend upon the attribute values given to P-vertices, the number of attribute values and the connectivities in the corresponding PPFGs. The novelty in this study is the investigation of the variations and the relations between PVDNs in the operations of Plithogenic complement, perfect Plithogenic complement, union and intersection of PPFGs.

• East Asian mathematical journal
• /
• 제36권5호
• /
• pp.561-570
• /
• 2020

We compute the extended four operations of the 2-dimensional quadratic fuzzy numbers. Then we calculate the intersection between a plane perpendicular to the x-axis, which passes through each vertex, and the resulting 2-dimensional quadratic fuzzy number. We confirm that the equations of the two intersections acquired in this way and the graphs are actually identical, respectively.

• East Asian mathematical journal
• /
• 제22권2호
• /
• pp.163-170
• /
• 2006

In networking, it is essential to analyse the nodes along with their neighbours. The properties of fuzzy finite graphs are very much useful in obtaining solutions to many problems like traffic congestion problem. In this paper, free nodes and busy nodes are defined and the properties of nodes are examined at various levels of their degrees.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.314-318
• /
• 2001

Constructing a shortest path on a graph is a fundamental problem in the area of graph theory. In an application where we cannot exactly determine the weights of edges, fuzzy weights can be used instead of crisp weights, and Type-2 fuzzy weights will be more suitable if this uncertainty varies under some conditions. In this paper, shortest path problem in type-1 fuzzy weighted graphs is extended for type-2 fuzzy weighted graphes. A solution is also given based on possibility theory and extension principle.

• 한국지능시스템학회논문지
• /
• 제11권6호
• /
• pp.528-531
• /
• 2001

그래프에서 최단경로를 찾는 문제는 그래프 이론분야에서 고전적인 문제이다. 전통적인 최단경로 문제에서 간선의 가중치값을 정확히 결정하는것이 어려운 경우에는 퍼지 가중치를 이용하여 문제를 해결할수 있다. 그리고 이러한 퍼지 가중치값을 결정하는데 있어 또 다른 불확실성이 존재하는 경우에는, 타입 2-퍼지 가중치를 이용하여 간선이 가중치를 표현할수 있다. 본 논문에서는 타입-1 퍼지 가중치 그래프에서의 최단경로문제를 타입 2 퍼지 가중치 그래프의 경우로 확장하고, 확장된 그래프에서 최단경로를 찾기 위한 모델을 제시하였다.

• 한국지능시스템학회논문지
• /
• 제15권6호
• /
• pp.759-764
• /
• 2005

본 논문은 EBGM(Elastic Bunch Graph Matching)기법을 이용한 얼굴인식에 대해 다룬다. 대용량 영상 정보에 대해 차원 축소를 이용한 얼굴인식 기법인 주성분기법이나 선형판별기법에서는 얼굴 영상 전체의 정보를 이용하는 반면 본 연구에서는 얼굴의 눈 코 입 등과 같은 얼굴 특징점에 대해 주파수와 방향각이 다른 여러 개의 가버 커널과 영상 이미지의 컨볼루션(Convolution)의 계수의 집합(Jets)을 이용한 특징 데이터를 이용한다. 하나의 얼굴 영상에 대해서 모든 영상이 같은 크기의 특질 데이터로 표현되는 Face Graph가 생성되며, 얼굴인식 과정에서는 추출된 제트의 집합에 대해서 상호 유사도(Similarity)의 크기를 비교하여 얼굴인식을 수행한다. 본 논문에서는 기존의 EBGM 방법의 Face Graph 생성 과정을 보다간략화 한 방법을 이용하여 얼굴인식 과정에서 계산량을 줄여 속도를 개선하였으며, 퍼지 매칭법을 이용한 유사도 계산을 하였다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제10권3호
• /
• pp.170-177
• /
• 2010

Poker is a game of imperfect information where competing players must deal with multiple risk factors stemming from unknown information while making the best decision to win, and this makes it an interesting test-bed for artificial intelligence research. This paper introduces a new learning AI algorithm with embedded opponent modeling that can be used for these types of situations and we use this AI and apply it to a poker program. The new AI will be based on several graphs with each of its nodes representing inputs, and the algorithm will learn the optimal decision to make by updating the weight of the edges connecting these nodes and returning a probability for each action the graphs represent.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1993년도 하계학술대회 논문집 A
• /
• pp.430-432
• /
• 1993

In this paper, an algorithm for the fault diagnosis using simple FCM(Fuzzy Cognitive Map) is proposed FCMs which store uncertain causal knowledges are fuzzy signed graphs with feedback. The algorithm allows searching the origin of fault and the ways of propagating the abnormality throughout the process simply and has following characteristics. First, it can distinguish the cause of soft failure which can degenerate the process as well as hard failure. Second, it is proper for the processes which have difficulties to establish the exact quantative model. Finally, it has short amputation time in comparison with the fault tree or the other AI methods. The applicability of the proposed algorithm for the fault diagonosis to a tank or pipeline system is demonstrated

• Advances in nano research
• /
• 제13권2호
• /
• pp.121-134
• /
• 2022

Emerge of nanotechnology impacts all aspects of humans' life. One of important aspects of the nanotechnology and nanoparticles (NPs) is in the food production industry. The safety of such foods is not well recognized and producing safe foods using nanoparticles involves delicate experiments. In this study, we aim to incorporate intelligent computer simulation in predicting safety degree of nanofoods. In this regard, the safety concerns on the nano-foods are addressed considering cytotoxicity levels in metal oxides nanoparticles using adaptive neuro-fuzzy inference system (ANFIS) and response surface method (RSM). Three descriptors including chemical bond length, lattice energy and enthalpy of formation gaseous cation of 15 selected NPs are examined to find their influence on the cytotoxicity of NPs. The most effective descriptor is selected using RSM method and dependency of the toxicity of these NPs on the descriptors are presented in 2D and 3D graphs obtained using ANFIS technique. A comprehensive parameters study is conducted to observe effects of different descriptors on cytotoxicity of NPs. The results indicated that combinations of descriptors have the most effects on the cytotoxicity.