• Title/Summary/Keyword: Design tree

Search Result 1,049, Processing Time 0.025 seconds

The Research of the 2-Edge Labeling Methods on Binomial Trees (이항트리에서 2-에지번호매김 방법에 대한 연구)

  • Kim, Yong Seok
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.2
    • /
    • pp.37-40
    • /
    • 2015
  • In this paper, we present linear, varied and mixed edge labeling methods using 2-edge labeling on binomial trees. As a result of this paper, we can design the variable topologies to enable optimal broadcasting with binomial tree as spanning tree, if we use these edge labels as the jump sequence of a sort of interconnection networks, circulant graph, with maximum connectivity and high reliability.

Optimal Terminal Interconnection Reconstruction along with Terminal Transition in Randomly Divided Planes

  • Youn, Jiwon;Hwang, Byungyeon
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.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.

Generation of AI Agent in Imperfect Information Card Games Using MCTS Algorithm: Focused on Hearthstone (MCTS 기법을 활용한 불완전 정보 카드 게임에서의 인공지능 에이전트 생성 : 하스스톤을 중심으로)

  • Oh, Pyeong;Kim, Ji-Min;Kim, Sun-Jeong;Hong, Seokmin
    • Journal of Korea Game Society
    • /
    • v.16 no.6
    • /
    • pp.79-90
    • /
    • 2016
  • Recently, many researchers have paid attention to the improved generation of AI agent in the area of game industry. Monte-Carlo Tree Search(MCTS) is one of the algorithms to search an optimal solution through random search with perfect information, and it is suitable for the purpose of calculating an approximate value to the solution of an equation which cannot be expressed explicitly. Games in Trading Card Game(TCG) genre such as the heartstone has imperfect information because the cards and play of an opponent are not predictable. In this study, MCTS is suggested in imperfect information card games so as to generate AI agents. In addition, the practicality of MCTS algorithm is verified by applying to heartstone game which is currently used.

The Dyeing Properties of Cellulose and Protein Fabrics by Yellow Natural Dyes (황색계 천연염료에 의한 셀룰로스, 단백질계 섬유의 염색)

  • Shin, Young-Joon
    • Journal of the Korea Fashion and Costume Design Association
    • /
    • v.19 no.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.

  • PDF

Vector Quantization Codebook Design Using Unbalanced Binary Tree and DCT Coefficients (불균형 이진트리와 DCT 계수를 이용한 벡터양자화 코드북)

  • 이경환;최정현;이법기;정원식;김경규;김덕규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12B
    • /
    • pp.2342-2348
    • /
    • 1999
  • DCT-based codebook design using binary tree was proposed to reduce computation time and to solve the initial codebook problem. In this method, DCT coefficient of training vectors that has maximum variance is to be a split key and the mean of coefficients at the location is used as split threshold, then balanced binary tree for final codebook is formed. However edge degradation appears in the reconstructed image, since the blocks of shade region are frequently selected for codevector. In this paper, we propose DCT-based vector quantization codebook design using unbalanced binary tree. Above all, the node that has the largest split key is splited. So the number of edge codevector can be increased. From the simulation results, this method reconstructs the edge region sincerely and shows higher PSNR than previous methods.

  • PDF

Level 1 probabilistic safety assessment of supercritical-CO2-cooled micro modular reactor in conceptual design phase

  • So, Eunseo;Kim, Man Cheol
    • Nuclear Engineering and Technology
    • /
    • v.53 no.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-CO2-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.

Two Phase Heuristic Algorithm for Mean Delay constrained Capacitated Minimum Spanning Tree Problem (평균 지연 시간과 트래픽 용량이 제한되는 스패닝 트리 문제의 2단계 휴리스틱 알고리즘)

  • Lee, Yong-Jin
    • The KIPS Transactions:PartC
    • /
    • v.10C no.3
    • /
    • pp.367-376
    • /
    • 2003
  • This study deals with the DCMST (Delay constrained Capacitated Minimum Spanning Tree) problem applied in the topological design of local networks or finding several communication paths from root node. While the traditional CMST problem has only the traffic capacity constraint served by a port of root node, the DCMST problem has the additional mean delay constraint of network. The DCMST problem consists of finding a set of spanning trees to link end-nodes to the root node satisfying the traffic requirements at end-nodes and the required mean delay of network. The objective function of problem is to minimize the total link cost. This paper presents two-phased heuristic algorithm, which consists of node exchange, and node shift algorithm based on the trade-off criterions, and mean delay algorithm. Actual computational experience and performance analysis show that the proposed algorithm can produce better solution than the existing algorithm for the CMST problem to consider the mean delay constraint in terms of cost.

Landscape Design for the Rural Village - A Case Study of Naegokri, Yeohang-myeon, Haman-gun - (조경식재를 통한 농촌마을 경관조성에 관한 연구 - 함안군 여항면 내곡리를 사례로 -)

  • Kim, Sang-Bum;Lee, Seung-Joo;Rhee, Sang-Young
    • Journal of Korean Society of Rural Planning
    • /
    • v.14 no.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.

On Solving the Tree-Topology Design Problem for Wireless Cellular Networks

  • Pomerleau Yanick;Chamberland Steven;Pesant Gilles
    • Journal of Communications and Networks
    • /
    • v.8 no.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.

Design of A Special Facility using Systematic Layout Planning(SLP) (체계적 배치계획을 이용한 특수 건축물의 설계사례)

  • Park, Se-Jin
    • The Journal of Sustainable Design and Educational Environment Research
    • /
    • v.2 no.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.

  • PDF