• International Journal of Computer Science & Network Security
• /
• 제22권1호
• /
• pp.121-128
• /
• 2022

There are much processing techniques of microwave circuits, whose dimensions are small compared to the wavelength, but the disadvantage is that they cannot be directly applied to circuits working at high and/or low frequencies. In this article, we will consider the bond graph approach as a tool for analyzing and understanding the behavior of microwave circuits, and to show how basic circuit and network concepts can be extended to handle many microwaves analysis and design problems of practical interest. This behavior revealed in the scattering matrix filter, and which will be operated from its reduced bond graph model. So, we propose in this paper, a new application of bond graph approach jointly with the scattering bond graph for a high frequency study.

• Journal of applied mathematics & informatics
• /
• 제34권3_4호
• /
• pp.227-237
• /
• 2016

In this paper we introduce a new graph labeling called k-prime cordial labeling. Let G be a (p, q) graph and 2 ≤ p ≤ k. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called a k-prime cordial labeling of G if |v_f (i) − v_f (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |e_f (0) − e_f (1)| ≤ 1 where v_f (x) denotes the number of vertices labeled with x, e_f (1) and e_f (0) respectively denote the number of edges labeled with 1 and not labeled with 1. A graph with a k-prime cordial labeling is called a k-prime cordial graph. In this paper we investigate the k-prime cordial labeling behavior of a star and we have proved that every graph is a subgraph of a k-prime cordial graph. Also we investigate the 3-prime cordial labeling behavior of path, cycle, complete graph, wheel, comb and some more standard graphs.

• Journal of Applied and Pure Mathematics
• /
• 제5권3_4호
• /
• pp.237-253
• /
• 2023

Let a graph G = (V, E) be a (p, q) graph. Define $${\rho}=\{\array{{\frac{p}{2}} & \;\;p\text{ is even} \\ {\frac{p-1}{2}} & \;\;p\text{ is odd,}$$ and M = {±1, ±2, … ± ρ} called the set of labels. Consider a mapping λ : V → M by assigning different labels in M to the different elements of V when p is even and different labels in M to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there exists a labeling ${\frac{{\lambda}(u)+{\lambda}(v)}{2}}$ if λ(u) + λ(v) is even and ${\frac{{\lambda}(u)+{\lambda}(v)+1}{2}}$ if λ(u) + λ(v) is odd such that ${\mid}{\bar{{\mathbb{S}}}}_{\lambda}{_1}-{\bar{{\mathbb{S}}}}_{{\lambda}^c_1}{\mid}{\leq}1$ where ${\bar{{\mathbb{S}}}}_{\lambda}{_1}$ and ${\bar{{\mathbb{S}}}}_{{\lambda}^c_1}$ respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G for which there exists a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling behavior of few graphs including the closed helm graph, web graph, jewel graph, sunflower graph, flower graph, tadpole graph, dumbbell graph, umbrella graph, butterfly graph, jelly fish, triangular book graph, quadrilateral book graph.

• 제어로봇시스템학회논문지
• /
• 제10권5호
• /
• pp.450-457
• /
• 2004

In this research, the automatic synthesis of knowledge models is proposed. which are the basis of the methods using qualitative models adapted widely in fault diagnosis and hazard evaluation of chemical processes. To provide an easy and fast way to construct accurate causal model of the target process, the Role-Behavior modeling method is developed to represent the knowledge of modularized process units. In this modeling method, Fault-Behavior model and Structure-Role model present the relationship of the internal behaviors and faults in the process units and the relationship between process units respectively. Through the multiple modeling techniques, the knowledge is separated into what is independent of process and dependent on process to provide the extensibility and portability in model building, and possibility in the automatic synthesis. By taking advantage of the Role-Behavior Model, an algorithm is proposed to synthesize the plant-wide causal model, Fault-Causality Graph (FCG) from specific Fault-Behavior models of the each unit process, which are derived from generic Fault-Behavior models and Structure-Role model. To validate the proposed modeling method and algorithm, a system for building FCG model is developed on G2, an expert system development tool. Case study such as CSTR with recycle using the developed system showed that the proposed method and algorithm were remarkably effective in synthesizing the causal knowledge models for diagnosis of chemical processes.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제23권3호
• /
• pp.545-562
• /
• 2009

PBG(Problem Behavior Graph; 문제해결 행동 그래프)는 인지 심리학자인 Newell과 Simon에 의해 제안된 것으로 연구 대상자가 문제를 해결할 때 인지 활동을 그래프 형식을 이용하여 그려놓은 것이다. 본 연구에서는 중학교에 재학 중인 수학 영재의 수학적 문제 해결에서 이루어지는 인지적인 과정을 추적하기 위하여, 사고구술법(Think-aloud method)으로 추출된 수학 영재 학생들의 사고 과정을 언어 프로토콜로 나타내고 분석한 것을 토대로 PBG를 구성하는 사례를 제시한다. 이를 통하여 수학 영재 학생들이 문제 해결 과정 중 인지 활동으로 거치게 되는 절차와 사고 과정 특성 지도를 살펴보고 대상 학생들이 여러 번의 시행착오 후 전체적인 과정을 수정하며 수행해 나가게 되는 방법과 문제의 최종적인 해결안을 도출해 내는 경로 탐색 과정을 종합적으로 살펴볼 수 있었다.

• Journal of applied mathematics & informatics
• /
• 제32권5_6호
• /
• pp.675-685
• /
• 2014

Suppose G is a simple graph. The irregularity of G, irr(G), is the summation of imb(e) over all edges $uv=e{\in}G$, where imb(e) = |deg(u)-deg(v)|. In this paper, we investigate the behavior of this graph parameter under some old and new graph operations.

• 융합정보논문지
• /
• 제11권6호
• /
• pp.24-32
• /
• 2021

최근 랜섬웨어(ransomware) 공격은 이메일, 피싱(phishing), 디바이스(Device) 해킹 등 다양한 경로를 통해 감염되어 피해 규모가 급증하는 추세이다. 그러나 기존 알려진 악성코드(정적/동적) 분석 엔진은 APT(Aadvanced Persistent Threat)공격처럼 발전된 신종 랜섬웨어에 대한 탐지/차단이 매우 어렵다. 본 연구는 그래프 데이터베이스를 기반으로 랜섬웨어 악성 행위를 모델링(Modeling)하고 랜섬웨어에 대한 새로운 다중 복합 악성 행위를 탐지하는 방법을 제안한다. 연구 결과 기존 관계형 데이터베이스와 다른 새로운 그래프 데이터 베이스 환경에서 랜섬웨어의 패턴 탐지가 가능함을 확인하였다. 또한, 그래프 이론의 연관 관계 분석 기법이 랜섬웨어 분석 성능에 크게 효율적임을 증명하였다.

• 경영과학
• /
• 제23권3호
• /
• pp.63-75
• /
• 2006

There are many kinds of research on web graph, most of them are focus on the hyperlinked structure of the web graph. Well known results on the web graph are rich-get-richer phenomenon, small-world phenomenon, scale-free network, etc. In this paper, we define 3 new directed web graph, so called the Web Usage Pattern Graph (WUPG), that nodes represent web sites arid arcs between nodes represent a movement between two sites by users' browsing behavior. The data to constructing the WUPG, approximately 56,000 records, are gathered from some users' PCs. The results analysing the data summarized as follows : (i) extremely rich-get-richer phenomenon (ii) average path length between sites is significantly less than the previous one (iii) less external hyperlinks, more internal hyperlinks.

• International Journal of Aerospace System Engineering
• /
• 제2권1호
• /
• pp.47-52
• /
• 2015

The transient phenomenon of self-powered energy-harvesting is assessed using a bond-graph method. The bond-graph is an energy-based approach to describing physical-dynamic systems. It shows power flow graphically, which helps us understand the behavior of complicated systems in simple terms. Because energy-harvesting involves conversion of power in mechanical form to the electrical one, the bond-graph is a good tool to analyze this power flow. Although the bond-graph method can be used to calculate the dynamics of combining mechanical and electrical systems simultaneously, it has not been used for harvesting analysis. We demonstrate the usability and versatility of bond-graph for not only steady analysis but also transient analysis of harvesting.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• pp.422-440
• /
• 2005

There are many kinds of research on web graph, most of them are focus on the hyperlinked structure of the web graph. Well known results on the web graph are rich-get-richer phenomenon, small-world phenomenon, scale-free network, etc. In this paper, we define a new directed web graph, so called the Web Usage Pattern Graph (WUPG), that nodes represent web sites and arcs between nodes represent a movement between two sites by users' browsing behavior. The data to constructing the WUPG, approximately 56,000 records, are gathered in the Kyungsung University. The results analysing the data summarized as follows: (i) extremely rich-get-richer phenomenon (ii) average path length between sites is significantly less than the previous one (iii) less external hyperlinks, more internal hyperlinks