• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.8
• /
• pp.445-455
• /
• 2002

In this paper, we present a new task scheduling scheme ior the efficient execution of the tasks of compound nodes of hierarchical task graph(HTG) on shared memory system. The proposed scheme for exploitation functional parallelism is autoscheduling that performs the role of scheduling by processor itself without any dedicated global scheduler. To adapt the proposed scheduling scheme for various platforms, Including a uni-processor systems, Java threads were used for implementation, and the performance is analyzed in comparison with a conventional bit vector method. The experimental results showed that the proposed method was found to be more efficient in its execution time and exhibited good load-balancing when using the experimental parameter values. Furthermore, the memory size could be reduced when using the proposed algorithm compared with a conventional scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.9
• /
• pp.1658-1667
• /
• 1994

In a cellular mobile communication control system, assignment channel for a call in a cell so as to achieve high spectral efficience is an important problem within limited frequence bandwidth. The spectral efficiency is related to the coloring problem of graph theory in a cellular mobile communication control system. In this paper, we propose channel offset scheme using a graph theory of cellular mobile communication control system and formulate chromatic bandwidth of channel offset system which is related graph coloring problem. From formulated channel assignment problem, we investgate an optimal channel offset scheme of more efficent frequence spectrum and cell design according to channel constitution and give and upper and lower bound for overall srectral bandwidth.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.393-398
• /
• 2005

In interconnection networks, a Hamiltonian path has been utilized in many applications such as the implementation of linear array and multicasting. In this paper, we consider the Hamiltonian properties of mesh networks which are used as the topology of parallel machines. If a network is strongly Hamiltonian laceable, the network has the longest path joining arbitrary two nodes. We show that a two-dimensional mesh M(m, n) is strongly Hamiltonian laceabie, if $m{\geq}4,\;n{\geq}4(m{\geq}3,\;n{\geq}3\;respectively)$, and the number of nodes is even(odd respectively). A mesh is a spanning subgraph of many interconnection networks such as tori, hypercubes, k-ary n-cubes, and recursive circulants. Thus, our result can be applied to discover the fault-hamiltonicity of such networks.

• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.279-292
• /
• 2011

Movie is a representative media that can transmit stories to audiences. Basically, a story is described by characters in the movie. Different from other simple videos, movies deploy narrative structures for explaining various conflicts or collaborations between characters. These narrative structures consist of 3 main acts, which are beginning, middle, and ending. The beginning act includes 1) introduction to main characters and backgrounds, and 2) conflicts implication and clues for incidents. The middle act describes the events developed by both inside and outside factors and the story dramatic tension heighten. Finally, in the end act, the events are developed are resolved, and the topic of story and message of writer are transmitted. When story information is extracted from movie, it is needed to consider that it has different weights by narrative structure. Namely, when some information is extracted, it has a different influence to story deployment depending on where it locates at the beginning, middle and end acts. The beginning act is the part that exposes to audiences for story set-up various information such as setting of characters and depiction of backgrounds. And thus, it is necessary to extract much kind information from the beginning act in order to abstract a movie or retrieve character information. Thereby, this paper proposes a novel method for extracting the beginning boundaries. It is the method that detects a boundary scene between the beginning act and middle using the accumulation graph of characters. The beginning act consists of the scenes that introduce important characters, imply the conflict relationship between them, and suggest clues to resolve troubles. First, a scene that the new important characters don't appear any more should be detected in order to extract a scene completed the introduction of them. The important characters mean the major and minor characters, which can be dealt as important characters since they lead story progression. Extra should be excluded in order to extract a scene completed the introduction of important characters in the accumulation graph of characters. Extra means the characters that appear only several scenes. Second, the inflection point is detected in the accumulation graph of characters. It is the point that the increasing line changes to horizontal line. Namely, when the slope of line keeps zero during long scenes, starting point of this line with zero slope becomes the inflection point. Inflection point will be detected in the accumulation graph of characters without extra. Third, several scenes are considered as additional story progression such as conflicts implication and clues suggestion. Actually, movie story can arrive at a scene located between beginning act and middle when additional several scenes are elapsed after the introduction of important characters. We will decide the ratio of additional scenes for total scenes by experiment in order to detect this scene. The ratio of additional scenes is gained as 7.67% by experiment. It is the story inflection point to change from beginning to middle act when this ratio is added to the inflection point of graph. Our proposed method consists of these three steps. We selected 10 movies for experiment and evaluation. These movies consisted of various genres. By measuring the accuracy of boundary detection experiment, we have shown that the proposed method is more efficient.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.3
• /
• pp.380-388
• /
• 1999

본 논문에서는 완전삼트리를 재귀원형군에 임베딩하는 문제를 고려한다. 재귀원형군 G(N,d)는 N개의 노드와 N보다 작은 d의 거듭제곱에 의한 점프에지를 가지는 원형군그래프이다. 임베딩 문제를 해결하고자 본 논문에서는 노드수가 3k인 삼항트리 Tk새롭게 도입한다. 먼저 N개 이하의 정점을 가지는 삼항트리가 G(N, 2)와 G(N,3)의 부그래프임을 보인다. 또한 완전 삼진트리가 삼항트리에 연장률 2, 확장률2, 밀집률 2로 임베딩됨을 보인다. 이러한 결과들을 결합하면서 N개 이하의 정점을 가지는 완전삼진 트리가 재귀원형군G(2N, 2)과 G(2N, 3)에 연장률 2, 밀집률 2로 임베딩 가능하게 한다. 임베딩 과정에서 이용된 삼항트리는 2 -포트 방송모델에서 최소방송트리임을 보이고, 이를 이용하여 재귀원형군 G(2m, 2)가 2-포트 방송모델에서 최소방송시간을 가짐을 보인다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.1
• /
• pp.185-196
• /
• 1999

In this dissertation, a new off-line recognition system is proposed using a subgraph pattern, neural network. After thinning is applied to input characters, balance having a noise elimination function on location is performed. Then as the first step for recognition procedure, circular elements are extracted and recognized. From the subblock HT, space feature points such as endpoint, flex point, bridge point are extracted and a subgraph pattern is formed observing the relations among them. A region where vowel can exist is allocated and a candidate point of the vowel is extracted. Then, using the subgraph pattern dictionary, a vowel is recognized. A same method is applied to extract horizontal vowels and the vowel is recognized through a simple structural analysis. For verification of recognition subgraph in this paper, experiments are done with the most frequently used Myngjo font, Gothic font for printed characters and handwritten characters. In case of Gothic font, character recognition rate was 98.9%. For Myngjo font characters, the recognition rate was 98.2%. For handwritten characters, the recognition rate was 92.5%. The total recognition rate was 94.8% with mixed handwriting and printing characters for multi-font recognition.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1919-1928
• /
• 1999

There are no standard language for the specification of speed-independent circuits because existing specification methods are designed appropriately to each synthesis methodology. This paper suggests a method of using VHDL, a standard hardware description language, for the specification and synthesis of speed-independent circuits. Because VHDL is a multi-purpose language, we define a subset of VHDL which can be used for the synthesis. We transform the VHDL description into a signal transition graph and then synthesize speed-independent circuits by using a previous synthesis algorithm which uses a signal transition graph as the specification method. We suggest a systematic transformation method which transforms each VHDL statement into a partial signal transition graph and then merges them into a signal transition graph. This work is a step towards to the development of an integrated framework in which we can utilizes the existing CAD tools based on VHDL. Also, this work will enable a easier migration of the current circuit designers into asynchronous circuit design.

• Journal of the Korean Regional Science Association
• /
• v.37 no.1
• /
• pp.45-61
• /
• 2021

This research purposes to design a methodological framework to suggest the optimal method to resolve the conflicts of stakeholders surrounding the water use charge of the Han River region, and to use the analysis results to provide the direction of policy. For this, it was preceded that the process of understanding the mechanisms of the multifaceted conflict between decision makers taking different positions over water use charge of the Han River region, and an optimal method to resolve the conflict of water use charge of the Han River region was derived by using a graph model for conflict resolution(GMCR). According to the analysis results, the optimal state to find a solution to the water use charge of the Han River is that the Seoul-Incheon-Gyeonggi region pays the charge according to the original rate while Seoul-Incheon requesting discount the water use rate. In addition, the Han River management committee should establish policies desired by Seoul-Incheon-Gyeonggi region including rationalization of the decision-making structure to determine the rate of water use charge, making the basis to support the Han River management fund system for the Seoul-Incheon region, and transparent management of the Han River management fund system considering the characteristics of beneficiary regions and residents. This study is expected to provide objective decision-making information in establishing environmental policy directions related to conflict resolution in the water use charge of the Han River region and to offer a methodological basis for similar follow-up studies related to conflicts derived from sharing nature environment.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.255-255
• /
• 2023

우리나라의 경우 집중호우와 돌발홍수로 인한 침수 발생에 대응하기 위해 유역 및 하천관리 사업, 각종 풍수해 예방사업 등을 추진하고 있으며, 관련 분야의 스마트기술 도입을 적극 추진하고 있다. 그러나, 2013년 노량진 상수도관 공사 현장 사고, 2019년 신월 빗물저류 배수시설 현장 사고 등과 같은 건설현장 침수 피해 사고가 지속적으로 발생하고 있다. 또한, 건설현장의 다양한 조건 및 시시각각 변화하는 상황에 따라 구조적 대책 및 대응방안을 수립하는 데 한계가 있으며 지금까지는 법, 제도에 기초한 대응 매뉴얼을 제작·배포하여 현장 근로자 교육을 실시하는 수준에서 진행되어 왔다. 본 연구에서는 건설현장의 자연재해, 특히 수재해에 대응하기 위해 보다 과학적인 방법을 통한 현장 침수 예경보 체계를 수립하였으며, 강우예측-침수예측-침수예경보 생산-현장 상황전파에 이르는 일련의 시스템을 개발하여 공사별, 규모별, 공정별 침수 대응 솔루션을 제공하고자 한다. 건설현장 침수예경보 시스템 개발의 주요 내용은 요소기술 개발이며, 간략하게 정리하면 다음과 같다. ① 강우 예측정보 생산: 현장에서 발생하는 집중호우를 고려하는 실시간 강우측정 자료와 연계한 초단기 강우예측 기술 개발, ② 침수 예측모델 개발: 현장의 시공간적 특성, 수재해 피해의 유형 등을 반영할 수 있는 침수피해 예측 모델 개발, ③ 침수예경보 의사결정 방법론 개발: 침수 피해 예경보를 위한 침수 위험단계 세분화 및 노모그래프 개발과 모델 적용(예측정확도 85% 이상), 이를 통합하여 건설현장 침수예경보 시스템 개발을 수행하게 된다. 연구에서 개발된 침수 예경보 통합 시스템은 향후 수재해로 인한 건설현장의 인명, 재산 피해 최소화에 기여할 것으로 기대된다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.37-42
• /
• 2024

This paper suggests polynomial time algorithm for cutwidth minimization problem that classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. To find the minimum cutwidth CW_f(G)=max_𝜈∈_VCW_f(𝜈)for given graph G=(V,E),m=｜V｜, n=｜E｜, the proposed algorithm divides neighborhood N_G[𝜈_i] of the maximum degree vertex 𝜈_i in graph G into left and right and decides the vertical cut plane with minimum number of edges pass through the vertex 𝜈_i firstly. Then, we split the left and right N_G[𝜈_i] into horizontal sections with minimum pass through edges. Secondly, the inner-section vertices are connected into line graph and the inter-section lines are connected by one line layout. Finally, we perform the optimization process in order to obtain the minimum cutwidth using vertex moving method. Though the proposed algorithm requires O(n²) time complexity, that can be obtains the optimal solutions for all of various experimental data