• 대한수학회지
• /
• 제53권5호
• /
• pp.1167-1182
• /
• 2016

Let M be an R-module, where R is a commutative ring with identity 1 and let G(V,E) be a graph. In this paper, we study the graphs associated with modules over commutative rings. We associate three simple graphs $ann_f({\Gamma}(M_R))$, $ann_s({\Gamma}(M_R))$ and $ann_t({\Gamma}(M_R))$ to M called full annihilating, semi-annihilating and star-annihilating graph. When M is finite over R, we investigate metric dimensions in $ann_f({\Gamma}(M_R))$, $ann_s({\Gamma}(M_R))$ and $ann_t({\Gamma}(M_R))$. We show that M over R is finite if and only if the metric dimension of the graph $ann_f({\Gamma}(M_R))$ is finite. We further show that the graphs $ann_f({\Gamma}(M_R))$, $ann_s({\Gamma}(M_R))$ and $ann_t({\Gamma}(M_R))$ are empty if and only if M is a prime-multiplication-like R-module. We investigate the case when M is a free R-module, where R is an integral domain and show that the graphs $ann_f({\Gamma}(M_R))$, $ann_s({\Gamma}(M_R))$ and $ann_t({\Gamma}(M_R))$ are empty if and only if $$M{\sim_=}R$$. Finally, we characterize all the non-simple weakly virtually divisible modules M for which Ann(M) is a prime ideal and Soc(M) = 0.

• 정보과학회 논문지
• /
• 제42권10호
• /
• pp.1222-1230
• /
• 2015

무릎 자기공명영상에서 전방십자인대의 분할은 밝기값의 불균일성 및 주변 조직들과의 유사 밝기값 특성으로 인해 기존 분할기법의 적용에 한계가 있다. 본 논문에서는 지역적 정렬을 통한 확률아틀라스 생성 및 반복적 그래프 컷을 통한 다중아틀라스 기반 전방십자인대 분할기법을 제안한다. 첫째, 전역 및 지역적 다중아틀라스 강체정합을 통해 전방십자인대의 확률아틀라스를 생성한다. 둘째, 생성된 확률아틀라스를 이용하여 최대사후추정 및 그래프 컷을 통하여 전방십자인대 초기 분할을 수행한다. 셋째, 마스크 기반 강체정합을 통한 형상정보 개선 및 반복적 그래프 컷을 통해 전방십자인대 분할 개선을 수행한다. 제안방법의 성능평가를 위하여 육안평가 및 정확성평가를 수행하였으며, 평가 결과 제안방법의 Dice 유사도는 75.0%, 평균표면거리는 1.7화소, 제곱근표면거리는 2.7화소로서 기존 그래프 컷 방법에 비하여 전방 십자인대의 분할정확도가 각각 12.8%, 22.7%, 및 22.9% 향상된 것으로 나타났다.

• Kyungpook Mathematical Journal
• /
• 제56권2호
• /
• pp.577-582
• /
• 2016

In this paper we consider all orientation-preserving ${\mathbb{Z}}_4$-actions on 3-dimensional handlebodies $V_g$ of genus g > 0. We study the graph of groups (${\Gamma}(v)$, G(v)), which determines a handlebody orbifold $V({\Gamma}(v),G(v)){\simeq}V_g/{\mathbb{Z}}_4$. This algebraic characterization is used to enumerate the total number of ${\mathbb{Z}}_4$ group actions on such handlebodies, up to equivalence.

• 대한수학회논문집
• /
• 제36권2호
• /
• pp.389-400
• /
• 2021

For a graph G, the variable sum exdeg index SEI_a(G) is defined as Σ_u∈V(G)d_G(u)a^d_G(u), where a ∈ (0, 1) ∪ (1, +∞). In this work, we determine the minimum and maximum variable sum exdeg indices (for a > 1) of n-vertex cactus graphs with k cycles or p pendant vertices. Furthermore, the corresponding extremal cactus graphs are characterized.

• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.173-183
• /
• 2015

A radio k-labeling f of a graph G is a function f from V (G) to $Z^+{\cup}\{0\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}k+1$ for every two distinct vertices x and y of G, where d(x, y) is the distance between any two vertices $x,y{\in}G$. The span of a radio k-labeling f is denoted by sp(f) and defined as max$\{{\mid}f(x)-f(y){\mid}:x,y{\in}V(G)\}$. The radio k-labeling is a radio labeling when k = diam(G). In other words, a radio labeling is an injective function $f:V(G){\rightarrow}Z^+{\cup}\{0\}$ such that $${\mid}f(x)=f(y){\mid}{\geq}diam(G)+1-d(x,y)$$ for any pair of vertices $x,y{\in}G$. The radio number of G denoted by rn(G), is the lowest span taken over all radio labelings of the graph. When k = diam(G) - 1, a radio k-labeling is called a radio antipodal labeling. An antipodal labeling for a graph G is a function $f:V(G){\rightarrow}\{0,1,2,{\ldots}\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}diam(G)$ holds for all $x,y{\in}G$. The radio antipodal number for G denoted by an(G), is the minimum span of an antipodal labeling admitted by G. In this paper, we investigate the exact value of the radio number and radio antipodal number for the circulant graphs G(4k + 2; {1, 2}).

• 대한물리의학회지
• /
• 제9권2호
• /
• pp.161-170
• /
• 2014

PURPOSE: This study concerns the wheelchair-based rehabilitation of elderly people, investigating muscle activity and coordination of upper limbs during wheelchair-based new millennium health gymnastics with varying elbow exercise velocity. METHODS: Twelve elderly people participated in new millennium gymnastics twice per week during 12-weeks. The group was separated into 0.4, 1.0, and 1.6 Hz groups (controlled by the metronome speed). Range of motion was measured by electrogoniometer, electromyography signals used root mean square values. The data application was normalized using reference voluntary contraction (%RVC). Upper limb (wrist and elbow joint) data gathered while standing up after the "falling on hips" was investigated in terms of coordination of angle-angle plots. One-way ANOVA, paired t-test and Scheffe's post hoc comparisons, were used for statistical analyses. RESULTS: There were results taken before and after the experiments. The results demonstrated a significant improvement in the triceps brachii and flexor carpi radialis of the 0.4 Hz group (p<.05). There was significant difference in the triceps brachi of the 1 Hz group. No significant differences were found in all muscles of the 1.6 Hz group. Muscle co-activation indexes of the 0.4 Hz group were larger than the others. The 0.4 Hz graph was turning point synchronized clockwise. The 1 Hz graph was out of phase with the negative slope. The 1.6 Hz graph was turning point synchronized counterclockwise, and uncontrolled factor phase was offset on angle-angle plots. CONCLUSION: It is found that improvement of muscle activity and upper limbs coordination of elderly people using wheelchair-based new millennium gymnastics is optimal with elbow exercise velocity with a frequency of 0.4 Hz.

• 정보보호학회논문지
• /
• 제30권3호
• /
• pp.493-501
• /
• 2020

안드로이드 운영체제에서 Flow Analysis의 난독화를 위해서는 실행되지 않는 흐름의 코드를 생성하여 Flow Graph의 크기를 크게 만들어 분석이 어렵게 만들 수 있다. 이를 위해 논문에서는 aar 형태의 라이브러리를 구현하여 외부 라이브러리의 형태로 애플리케이션에 삽입이 가능하도록 하였다. 라이브러리는 더미 코드에서의 진입점에서 부터 최대 5개의 child node를 가질 수 있도록 설계되었으며, child node의 클래스는 각 node마다 100개부터 900개까지 2n+1개의 메서드를 가지고 있으므로 총 2,500개의 진입점으로 구성된다. 또한 진입점은 XML에서 총 150개의 뷰로 구성되며, 각각의 진입점은 비동기 인터페이스를 통해 연결된다. 따라서 Inter-Procedural 기반의 Control Flow Graph를 생성하는 과정에서는 최대 14,175E+11개의 추가적인 경우의 수를 가지게 된다. 이를 애플리케이션에 적용한 결과 Inter Procedural Control Flow Analysis 툴에서 평균 10,931개의 Edge와 3,015개의 Node가 추가 생성되었으며 평균 36.64%의 그래프 크기 증가율을 갖는다. 또한 APK를 분석 시에는 최대 평균 76.33MB의 오버헤드가 발생하였지만, 사용자의 ART 환경에서는 최대 평균 0.88MB의 실행 오버헤드만을 가지며 실행 가능한 것을 확인하였다.

• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.217-229
• /
• 2007

In this paper, Genetic Algorithm (GA) is used to find the Maximum Weight Independent Set (MWIS) of a graph. First, MWIS problem is formulated as a 0-1 integer programming optimization problem with linear objective function and a single quadratic constraint. Then GA is implemented with the help of this formulation. Since GA is a heuristic search method, exact solution is not reached in every run. Though the suboptimal solution obtained is very near to the exact one. Computational result comprising an average performance is also presented here.

• 대한수학회보
• /
• 제52권3호
• /
• pp.955-962
• /
• 2015

It has been established that the role played by complete graphs in graph theory is similar to the role Dowling group geometries and Projective geometries play in matroid theory. In this paper, we introduce a notion of H-tree, a class of representable matroids which play a similar role to trees in graph theory. Then we give some properties of H-trees such that when q = 0, then the results reduce to the known properties of trees in graph theory. Finally we give explicit expressions of the characteristic polynomials of H-trees, H-cycles, H-fans and H-wheels.

• 한국정보처리학회논문지
• /
• 제6권8호
• /
• pp.2124-2132
• /
• 1999

Given a graph G=(V,E), Ld(2,1)-labeling of G is a function f : V(G)$\longrightarrow$[0,$\infty$) such that, if v1,v2$\in$V are adjacent, $\mid$ f(x)-f(y) $\mid$$\geq$2d, and, if the distance between and is two, $\mid$ f(x)-f(y) $\mid$$\geq$d, where dG(,v2) is shortest distance between v1 and in G. The L(2,1)-labeling number (G) is the smallest number m such that G has an L(2,1)-labeling f with maximum m of f(v) for v$\in$V. This problem has been studied by Griggs, Yeh and Sakai for the various classes of graphs. In this paper, we discuss the upper-bound of ${\lambda}$ (G) for a chordal graph G and that of ${\lambda}$(G') for a permutation graph G'.