• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제4권2호
• /
• pp.37-40
• /
• 2015

본 논문에서는 이항트리의 2-에지번호매김에서 선형적 에지번호매김 방법, 변형된 에지번호매김 방법 그리고 혼합형 에지번호매김 방법들을 제안한다. 이러한 연구결과는 최대 연결도를 갖는 신뢰성이 높은 상호연결망의 일종인 원형군 그래프(circulant graph)의 점프열(jump sequence)로 에지번호들을 사용하면 이항트리를 스패닝 트리로 갖고 최적방송이 가능한 다양한 위상들을 설계할 수 있다.

• Journal of information and communication convergence engineering
• /
• 제20권3호
• /
• pp.160-165
• /
• 2022

This paper proposes an efficient method of reconstructing interconnections when the terminals of each plane change in real-time situations where randomly divided planes are interconnected. To connect all terminals when the terminals of each plane are changed, we usually reconstruct the interconnections between all terminals. This ensures a minimum connection length, but it takes considerable time to reconstruct the interconnection for the entire terminal. This paper proposes a solution to obtain an optimal tree close to the minimum spanning tree (MST) in a short time. The construction of interconnections has been used in various design-related areas, from networks to architecture. One of these areas is an ad hoc network that only consists of mobile hosts and communicates with each other without a fixed wired network. Each host of an ad hoc network may appear or disappear frequently. Therefore, the heuristic proposed in this paper may expect various cost savings through faster interconnection reconstruction using the given information in situations where the connection target is changing.

• 한국게임학회 논문지
• /
• 제16권6호
• /
• pp.79-90
• /
• 2016

최근 게임분야에서 수준 높은 인공지능 에이전트의 구현은 많은 주목을 받고 있다. 그 중 Monte-Carlo Tree Search(MCTS)는 완전 정보를 가진 게임에서 무작위 탐색을 통해 최적의 해를 구할 수 있는 알고리즘으로, 수식으로 표현되지 않는 경우에 근사치를 계산하는 용도로 적합하다. 하스스톤과 같은 Trading Card Game(TCG) 장르의 게임은 상대방의 카드와 플레이를 예측할 수 없기 때문에 불완전 정보를 가지고 있다. 본 논문에서는 불완전 정보 카드 게임에서 인공지능 에이전트를 생성하기 위해 MCTS 알고리즘을 응용하는 방법을 제안하고, 현재 서비스되는 하스스톤 게임에 적용하여 봄으로써 MCTS 알고리즘의 실용성을 검증한다.

• 한국의상디자인학회지
• /
• 제19권1호
• /
• pp.135-145
• /
• 2017

In order to analysis on color difference of yellow natural dyes, I have dyed cellulose and protein fabrics. The results of experiment have been analysed by wavelength of maximum absorption, amounts of dye uptake, color difference, Hunter's value and Munsell's value. The results from these analyses are as follows : Bud of pagoda tree, Amur cork, and Curcuma showed greenish yellow color, Gardenia Jasminoides showed reddish yellow color. Barberry root showed reddish yellow color with post-mordanting method on cellulose fabric. Moreover, Dupioni silk was dyed in reddish yellow color by Barberry root and Rhubarb. In addition to Chroma index, Gardenia Jasminoides and Curcuma showed clear color overall. However, dyeing rayon and silk by Barberry root, and dyeing silk by Rhubarb showed clear color. Comparing all the results to actual dyed materials, Bud of pagoda tree had small dye uptake, and both ${\Delta}a$ and ${\Delta}b$ value were short which can't recognized the yellow color easily. Dye uptake of Amur cork and Gardenia Jasminoides was small just like Bud of pagoda tree. However, ${\Delta}b$ value order was Gardenia Jasminoides>Amur cork>Bud of pagoda tree. Therefore, Gardenia Jasminoides recognized reddish yellow because of big value of red color and yellow color. In case of Barberry root and Rhubarb which have larger dye uptake, Baberry root recognized yellow color on rayon only, and couldn't recognized yellow color on bleached cotton fabric, ramie, silk, and dupioni silk. Rhubarb recognized yellow color on rayon with pre-mordanting method only, but recognized silk and dupioni silk as brown like color. Moreover, we could not analyze color by dye uptake, Lab, and H(v/c) for Barberry root and Rhubarb. As a result, I think we need to attach color table for the research paper which handled the color of dyeing materials.

• 한국통신학회논문지
• /
• 제24권12B호
• /
• pp.2342-2348
• /
• 1999

기존의 코드북 설계방법의 많은 계산량과 초기 코드북 문제를 해결하기 위해 영상에 대한 DCT-기반 벡터양자화 코드북 설계방식이 제안되었다. 이 방법은 훈련벡터들의 DCT 계수들에 대한 분산을 각각 구하여 그 중 최대값을 가지는 계수를 분할키로 하고 그 평균값을 분할경계값으로 하여 균형 이진트리를 만들어 종단노드들을 최종코드북으로 하는 방법인데, 에지부분의 열화가 생기는 단점이 있다. 본 논문에서는 중복된 벡터가 많은 평탄영역 벡터들의 노드 분할을 억제하고 다양한 에지영역의 코드벡터들을 포함하는 코드북을 만들기 위해, 각 노드들의 분할키들을 비교하여 값이 가장 큰 노드부터 분할하는 불균형 이진트리를 이용한 벡터양자화 코드북 설계 방법을 제안하였다. 모의실험 결과 에지부분의 복원성과 PSNR 측면에서 기존의 방법에 비해 좋은 결과를 얻을 수 있었다.

• Nuclear Engineering and Technology
• /
• 제53권2호
• /
• pp.498-508
• /
• 2021

Micro reactors are increasingly being considered for utilization as distributed power sources. Hence, the probabilistic safety assessment (PSA) of a direct supercritical-CO₂-cooled fast reactor, called micro modular reactor (MMR), was performed in this study; this reactor was developed using innovative design concepts. It adopted a modular design and passive safety systems to minimize site constraints. As the MMR is in its conceptual design phase, design weaknesses and valuable safety insights could be identified during PSA. Level 1 internal event PSA was carried out involving literature survey, system characterization, identification of initiating events, transient analyses, development of event trees and fault trees, and quantification. The initiating events and scenarios significantly contributing to core damage frequency (CDF) were determined to identify design weaknesses in MMR. The most significant initiating event category contributing to CDF was the transients with the power conversion system initially available category, owing to its relatively high occurrence frequency. Further, an importance analysis revealed that the safety of MMR can be significantly improved by improving the reliability of reactor trip and passive decay heat removal system operation. The findings presented in this paper are expected to contribute toward future applications of PSA for assessing unconventional nuclear reactors in their conceptual design phases.

• 정보처리학회논문지C
• /
• 제10C권3호
• /
• pp.367-376
• /
• 2003

본 연구는 로컬 네트워크의 토폴로지를 설계하거나 루트 노드로부터 여러 개의 통신 경로를 구하는 데 사용될 수 있는 DCMST(Delay constrained Capacitated Minimum Spanning Tree) 문제를 다룬다. 기존의 CMST 문제는 루트 노드의 한 포트가 담당하는 트래픽의 용량에만 제한이 있는 데 비해 DCMST 문제에는 네트워크 평균 지연 시간의 제약 조건이 추가된다. 이 문제는 종단 노드의 트래픽 요구량과 네트워크의 평균 지연 시간을 만족시키는 스패닝 트리의 집합을 구하는 것으로 목적 함수는 전체 링크 비용을 최소로 하는 것이다. 본 연구에서는 트레이드-오프에 기준한 노드 교환 알고리즘과 노드 이동 알고리즘 그리고 평균 지연 알고리즘으로 구성되는 2 단계 휴리스틱을 제시한다. 실제 계산 경험과 성능 분석을 통해 제안한 알고리즘이 평균 지연을 고려한 기존의 CMST 알고리즘보다 비용 측면에 있어 더 우수한 해를 생성할 수 있음을 보였다.

• 농촌계획
• /
• 제14권1호
• /
• pp.59-71
• /
• 2008

The landscape commonly refers to the appearance of the land, including its shape, texture, and colours. Among many factors contributing to the landscape, tree and plants factors playa significant role in rural landscape as a colours. Therefore the rural traditional theme village where had been designated under the rural traditional theme village since 2007 in Naegok-ri, Eohang-myeon, Haman-gun has planned to design the tree plant planning for creating a unique rural landscape. The landscape proposal for the new Rural Village in Naegokri, Yeohang-myeon, Haman-gun suggests three main strategies; 1) The riverside area and reservoir area adjoined forest was required to be prepared to offer organization waterside landscape and forest landscape through landscape planting and selecting trees i.e. able to reflect sense of the season that promote high quality values of landscape area in rural. 2) The area adjoined stable was required to strengthen the screen planting and buffer planting with multiple plant layer structure and trees of branches and leaves closeness, shrubs of beauty flowers in order to improve disamenity landscape and odours. 3) The rural traditional theme village adjoined entrance was required to open space such as multipurpose garden, specialized or themed garden which include Landmark factors and prepared to the space with the various theme and visual diversity in order to take charge of function as landmark characteristic in Naegok-ri, Eohang-myeon, Haman-gun, and so on. In conclusion, this winning principal purpose of this study is applied to basic tree plant model for sustainable rural landscape creation in rural areas by selecting beautiful landscape plants and the tree plant planning.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.85-92
• /
• 2006

In this paper, we study a wireless cellular network design problem. It consists of selecting the location of the base station controllers and mobile service switching centres, selecting their types, designing the network into a tree-topology, and selecting the link types, while considering the location and the demand of base transceiver stations. We propose a constraint programming model and develop a heuristic combining local search and constraint programming techniques to find very good solutions in a reasonable amount of time for this category of problem. Numerical results show that our approach, on average, improves the results from the literature.

• 교육녹색환경연구
• /
• 제2권1호
• /
• pp.69-79
• /
• 2002

This paper investigates the methodology to develop a layout of the simulator for measuring and evaluating human sensibility. Since the simulator layout is different from general building layouts in that it is organized in order to communicate systematically between facilities, laboratories to evaluate human sensibility and equipments to support experiments in simulator, two approaches based on eigenvector and cut tree are support to develop a simulator layout. Qualitative input data (relationship chart, space requirements for each laboratory and equipment) are obtained and transformed into quantitative data. The information obtained by two approaches provides several meaningful clues to generate the simulator layout. The simulator layout is presented based on the obtained information by two approaches. Extracted quantitative data by using eigenvector and cut tree are meaningful of generating the simulator layout.