• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.4
• /
• pp.392-401
• /
• 2000

In this work, a deadlock avoidance strategy is proposed in order to effectively handle conflicts and deadlocks occurring in zone-control AGV (Automated Guided Vehicle) systems. The basic idea is based on Capacity-designated Directed Graph (CDG) theory that was developed to avoid from deadlocks in manufacturing systems. However, to enforce the effectiveness of detecting impending and restricted deadlocks, AGV routings are explicitly described in Extended Directed Graph (EDG). From EDG, a non-conservative deadlock-avoidance strategy is derived. The superiority of the proposed strategy lies on the applicability to diverse AGV path configurations using zone control. Also, because of its insensibility and robustness, it can be effectively used when the system has randomness and stochastic nature.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.1
• /
• pp.107-116
• /
• 1999

대칭성(symmetry)은 그래프의 구조와 특성을 시각적으로 표현할 때 중요한 미적 기준 중의 하나이다. 또한 대칭성을 보여주는 드로잉은 전체 그래프가 크기가 작은 부그래트들로부터 반복적으로 구성됨을 보여줌으로써 전체 그래프에 대한 이해를 쉽게 푸는 해주는 장점이 있다. 하지만 일반적인 그래프에서 기하하적 대칭성(geometric symmetry)을 탐지하는 문제는 이미 NP-complete 임이 증명되었으므로 이에 대한 연구는 평면 그래프(planar graph)의 극히 제한적인 부분집합인 트리, 외부 평면 그래프, 임베딩된 (embedded) 평면 그래프 등에 초점이 맞추어져 왔다. 본 논문에서는 평면 그래프에서의 기하학적 대칭성 문제를 연구하였다. 평면 그래프를 이중 연결 성분들로 분할한 다음 이를 각각 다시 삼중 연결 성분들로 분할하여 트리를 구성하고 축소(reduction)개념을 도입함으로써 기하학적 대칭성을 탐지하는 O(n2)시간 알고리즘을 제시하였다. 여기서 n은 그래프의 정점의 개수이다. 이 알고리즘은 평면 그래프를 최대한 대칭적으로 드로잉하는 알고리즘 개발에 이용될 수 있다.

• Kyungpook Mathematical Journal
• /
• v.62 no.1
• /
• pp.193-204
• /
• 2022

A subset S of V(G), where G is a simple undirected graph, is a hop dominating set if for each v ∈ V(G)＼S, there exists w ∈ S such that d_G(v, w) = 2 and it is a locating-hop set if N_G(v, 2) ∩ S ≠ N_G(v, 2) ∩ S for any two distinct vertices u, v ∈ V(G)＼S. A set S ⊆ V(G) is a locating-hop dominating set if it is both a locating-hop and a hop dominating set of G. The minimum cardinality of a locating-hop dominating set of G, denoted by 𝛄_lh(G), is called the locating-hop domination number of G. In this paper, we investigate some properties of this newly defined parameter. In particular, we characterize the locating-hop dominating sets in graphs under some binary operations.

• Communications for Statistical Applications and Methods
• /
• v.30 no.6
• /
• pp.561-575
• /
• 2023

Brain network analysis has attracted the interest of neuroscience researchers in studying brain diseases. Magnetoencephalography (MEG) is especially proper for analyzing functional connectivity due to high temporal and spatial resolution. The application of graph theory for functional connectivity analysis has been studied widely, but research on network modeling for MEG still needs more. Temporal exponential random graph model (TERGM) considers temporal dependencies of networks. We performed the brain network analysis, including static/temporal network statistics, on two groups of epilepsy patients who removed the left (LT) or right (RT) part of the brain and healthy controls. We investigate network differences using Multiset canonical correlation analysis (MCCA) and TERGM between epilepsy patients and healthy controls (HC). The brain network of healthy controls had fewer temporal changes than patient groups. As a result of TERGM, on the simulation networks, LT and RT had less stable state than HC in the network connectivity structure. HC had a stable state of the brain network.

• Journal of Elementary Mathematics Education in Korea
• /
• v.7 no.1
• /
• pp.65-86
• /
• 2003

Mathematics textbooks are substitutive showing real characters of didactic transposition in pseudo-contextualization and pseudo-personalization. This study analyzed statistical graphs in elementary school mathematics textbooks according to the first to the 7th curriculum in Korea. It focused on the didactic principles used in those methods through those view of Didactic Transposition Theory. The features of the elementary school mathematics textbooks in Korea are investigated and described ethnomethodologically according to each curriculum periods in dividing bar graph, line graph, pictograph, graph of ratio, histogram. The teaching sequences and methods of the statistical graphs, order and methods of sub-learning activities, teaming data, matter of the learning activity indicator were summarized. Usually, the teaching sequences, excepting the graphs of ratio, statistical graphs are introduced in the second semester of each grade. The graph of ratio is introduced in the first semester of 6th grade. As a result of analysing sub-Loaming activities, using them increased from the first to the 7th curriculum and its form was fixed constructive and stable at the 4th curriculum textbooks. As a result of analysing the teaming data, the data of the social aspects are used more frequently and the data of the individual preferences trended more gradually. As a result of analysing the matter of the teaming activity indicators, concept-explanation question style were used more frequently. Statement-practice style and consideration style trended gradually. Concluding remarks are: First, the didactic transposition of the elementary school mathematics textbooks developed systematically according to the first to the 7th curriculum; Second, mathematics textbooks gradually introduced the positive learning style of activity and the learners' spontaneousness; Third, more concrete practice activities and reflective activities were variously introduced considering the level and interest of each elementary student.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.89-94
• /
• 2009

This paper proposes the algorithms that design the highly digital logic circuit and assign the code to each node of DCG(Directed Cyclic Graph) of length ${\zeta}$. The conventional algorithm have some problems, so this paper introduce the matrix equation from DCG of length ${\zeta}$ and proposes highly digital logic circuit design algorithms according to the DCG of length ${\zeta}$. Using the proposed circuit design algorithms in this paper, it become realized that was able to design from former algorithm. Also, making a comparison between the circuit using former algorithm and this paper's, we testify that proposed paper's algorithm is able to realize more optimized circuit design. According to proposed circuit design algorithm in this paper, it is possible to design current that DCG have natural number, so it have the following advantages, reduction of the circuit input/output digits, simplification of circuit composition, reduction of computation time and cost. And we show comparability and verification about this paper's algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.11
• /
• pp.634-639
• /
• 2002

A Shortest Path Algorithm is the method to find the most efficient route among many routes from a start node to an end node. It is based on Labeling methods. In Labeling methods, there are Label-Setting method and Label-Correcting method. Label-Setting method is known as the fastest one among One-to-One shortest path algorithms. But Benjamin[1,2] shows Label-Correcting method is faster than Label-Setting method by the experiments using large road data. Since Graph Growth algorithm which is based on Label-Correcting method is made to find One-to-All shortest path, it is not suitable to find One-to-One shortest path. In this paper, we propose a new One-to-One shortest path algorithm. We show that our algorithm is faster than Graph Growth algorithm by extensive experiments.

• Korean Chemical Engineering Research
• /
• v.55 no.5
• /
• pp.668-678
• /
• 2017

Intermolecular interactions were studied for binary mixtures of 2-propanol + cyclohexane, n-hexane, benzene, toluene, o-, m- and p-xylenes by measuring ultrasonic speeds (u) over the entire range of composition at 298.15 K and 308.15 K. From these results the deviation in ultrasonic speed was calculated. These results were fitted to the Redlich-Kister equation to derive the binary coefficients along with standard deviations between the experimental and calculated data. Acoustic parameters such as excess isentropic compressibility ($K_s^E$), intermolecular free length ($L_f$) and available volume ($V_a$) were also derived from ultrasonic speed data and Jacobson's free length theory. The ultrasonic speed data were correlated by Nomoto's relation, Van Dael's mixing relation, impedance dependence relation, and Schaaff's collision factor theory. Van Dael's relation gives the best prediction of u in the binary mixtures containing aliphatic hydrocarbons. The ultrasonic speed data and isentropic compressibility were further analyzed in terms of Jacobson's free length theory.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2020-2028
• /
• 2013

In this paper, we propose a novel analysis and design methodology based on complex network theory for wireless large-scale ad hoc networks. We also enhance the conventional analysis methods which does not sufficiently consider the effect of the wireless communication channels and extend the existing random graph theory by reflecting the wireless communication environments. As a main result, the effect of the network topology such as average degree of each communication node on the network capacity through extensive computer simulations.

• Honam Mathematical Journal
• /
• v.30 no.2
• /
• pp.343-358
• /
• 2008

The primitive orders in a quaternion algebra play a central role of the theory of Hecke operators. In this paper, we study theta series generated by Brandt matrices and its applications to almost Ramanujan graphs.