• Title/Summary/Keyword: technology tree

Search Result 2,187, Processing Time 0.03 seconds

Visual Characteristic Assessment of Sidewalk According to Street Planting Types - Focus on Sidewalk in Daejeon Metropolitan City - (가로수 식재 유형에 따른 보도의 시각적 특성평가 - 대전광역시를 대상으로 -)

  • Jeong, Dae-Young
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.11 no.6
    • /
    • pp.49-60
    • /
    • 2008
  • In this study, the green zone patterns of sidewalks are classified 'one street-tree row + building,' 'one street-tree row + green zone,' 'two street-tree rows + building,' and 'two street-tree rows + green zone' and assessed their visual characteristic in order to provide desirable measures for scenery design. As a result of the analysis of visual images of sidewalk, the scenery in which street trees are planted in one row was generally assessed to be negative, while roads where green zones rather than buildings are adjacent were revealed to seem stable and pleasant. The scenery in which street trees are planted in two rows was assessed highly in an image of 'extensionality' indicating street circumstances, and especially the pattern 'two street-tree rows + green zone' was shown to be the most beautiful scenery. According to the results of factor analysis of sidewalks, three factors were identified : 'extensionality' showing sidewalk circumstances; 'peculiarity' including unique personality, and 'pliability' showing the organic flow of the scenery. The results of the analysis of visual preference of the scenery according to green zone patterns showed that the 'two street-tree rows + green zone' was measured to be highest. When buildings are adjacent to a sidewalk, two street-tree rows rather than one street-tree row were assessed to increase preference. As for the correlation between visual factors and preference analyzed through multiple regression analysis, all 'extensionality,' 'peculiarity,' and 'pliability' were revealed to show positive correlation for visual preference.

Factors Affecting on Sap Flows of Birch Trees, Betula platyphylla as a Healthy Beverages (건강음료로서의 자작나무 수액의 유출량에 미치는 영향인자)

  • Cho, Nam-Seok;Kim, Hong-Eun;Min, Du-Sik;Park, Cheol-Ha
    • Journal of the Korean Wood Science and Technology
    • /
    • v.26 no.3
    • /
    • pp.93-99
    • /
    • 1998
  • Lately public interest in tree saps of maple and birch trees stimulated to increase demands for sap drink as a natural medical beverage. In order to understand factors affecting tree sap flows, birch species, particularly Betula platyphylla in Mt.Sobaek area, were monitored for daily sap flows according to factors, such as DBH, tapping hole sizes and direction of hole drilling on the trunks. The chemical constituents of saps were also analyzed. The sap flow initiated from the end of March and finished at the end of April. The flow maxima appeared from April 14th to April 26th. Total amounts of the sap flow obtained from birch tree were over 1,800 ml per day per one tree. Sap flows were increased with increasing DBH and tree age. Six milimeter drilled hole resulted in the highest sap flows. Sap flows increased with increases of diameter and height of the trees. Hole drilling to downward side(south-facing) of tree produced almost doubled sap flows than that of upward one(north-facing), while rightside drilling produced same amounts of saps to that of leftside one. Six mm drilling gave the best results not only in maximum flows but also effective hole occluding rates. The saps have in the range of 4.5 to 5.6 pH and l.0 - 2.0% of saccharinity. Sucrose, glucose, fructose and high mineral contents were found in the saps of birch tree. The tree saps could be utilized not only medicinal drink, but also one of the healthy beverages.

  • PDF

Scheduling Computational Loads in Single Level Tree Network

  • Cui, Run;Sundaram, Suresh;Kim, Hyoung-Joong
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2009.08a
    • /
    • pp.131-135
    • /
    • 2009
  • This paper is the introduction of our work on distributed load scheduling in single-level tree network. In this paper, we derive a new calculation model in single-level tree network and show a closed-form formulation of the time for computation system. There are so many examples of the application of this technology such as distributed database, biology computation on genus, grid computing, numerical computing, video and audio signal processing, etc.

  • PDF

A New Mathematical Formulation for Generating a Multicast Routing Tree

  • Kang, Jang-Ha;Kang, Dong-Han;Park, Sung-Soo
    • Management Science and Financial Engineering
    • /
    • v.12 no.2
    • /
    • pp.63-69
    • /
    • 2006
  • To generate a multicast routing tree guaranteeing the quality of service (QoS), we consider the hop constrained Steiner tree problem and propose a new mathematical formulation for it, which contains fewer constraints than a known formulation. An efficient procedure is also proposed to solve the problem. Preliminary tests show that the procedure reduces the computing time significantly.

Analysis of Growth Condition and Some Suggestions for Its Maintenance of Legally Protected Trees Grown in Pyungtack City, Kunggi Province, Korea (경기도 평택시 보호수의 생육실태와 관리방안 연구)

  • Lee, Jong-Bum;Doo, Chul-Eon;Lee, Jae-Keun
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.15 no.3
    • /
    • pp.45-54
    • /
    • 2012
  • This study intended to analyze growth condition of each object by protected tree's ground for 45 places registered to Pyeongtaek protected tree list in locational characteristics, conduct exchange analysis for impediment extent rate in crown area and tree type to the result and suggest the measures to manage artificial impediment which is an effect on protected tree condition. In this study, the tree whose area of impediment for crown area is less than 21% is tree condition of grade 1~2, less than 21~50% is grade 2~3 and more than 50% is grade 3~5. The more impediment is, the more inconvenience causes on growth and development. So, it verified that the area rate must maintain less than 21% for the root system management of protected tree. For the standard of managing artificial impediment which is an effect on the tree condition of protected trees, the below matters intend to be suggested. The first, the impediment in crown area should be less than 21%. But, if there is not artificial impediment out of crown area, the rate of impediment area is considered to increase somewhat. The second, growth space of protected tree should be maintained by crown area at least and impediment should be established out of the crown area. The third, during the national project and land development, surroundings of protected tree must be applied as park, resting place, etc. and the establishment area of impediment (artificial impediment and natural impediment) in crown area must be limited. The forth, publicity for regional people (especially, land owner) is necessary for the protection of natural inheritance and the value of dependence on local government and village which are the subject of management must be announced widely through the internet media, etc, so its importance must be recognized. The fifth, the matters related to protected tree management must be able to limit artificial damage which is for surroundings of protected tree through the mutual connection among the local governments; construction, civil engineering, architecture, water and sewage, agriculture and forest and others. Also, following studies on the effects of kinds, thickness, etc. of impediment around the protected tree on trees should be continued.

Feature-Based Image Retrieval using SOM-Based R*-Tree

  • Shin, Min-Hwa;Kwon, Chang-Hee;Bae, Sang-Hyun
    • Proceedings of the KAIS Fall Conference
    • /
    • 2003.11a
    • /
    • pp.223-230
    • /
    • 2003
  • Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R*-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R*-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R*-tree combines SOM and R*-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R*-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R*-tree with that of an SOM and an R*-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R*-tree outperforms both the SOM and R*-tree due to the reduction of the number of nodes required to build R*-tree and retrieval time cost.

  • PDF

Reliability analysis of nuclear safety-class DCS based on T-S fuzzy fault tree and Bayesian network

  • Xu Zhang;Zhiguang Deng;Yifan Jian;Qichang Huang;Hao Peng;Quan Ma
    • Nuclear Engineering and Technology
    • /
    • v.55 no.5
    • /
    • pp.1901-1910
    • /
    • 2023
  • The safety-class (1E) digital control system (DCS) of nuclear power plant characterized structural multiple redundancies, therefore, it is important to quantitatively evaluate the reliability of DCS in different degree of backup loss. In this paper, a reliability evaluation model based on T-S fuzzy fault tree (FT) is proposed for 1E DCS of nuclear power plant, in which the connection relationship between components is described by T-S fuzzy gates. Specifically, an output rejection control system is chosen as an example, based on the T-S fuzzy FT model, the key indicators such as probabilistic importance are calculated, and for a further discussion, the T-S fuzzy FT model is transformed into Bayesian Network(BN) equivalently, and the fault diagnosis based on probabilistic analysis is accomplished. Combined with the analysis of actual objects, the effectiveness of proposed method is proved.

Color Image Encryption Technique Using Quad-tree Decomposition Method (쿼드트리 분할 기술을 이용한 컬러 영상 암호화 기술)

  • Choi, Hyunjun
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.6
    • /
    • pp.625-630
    • /
    • 2016
  • Recently, various types of image contents are being produced, and interest in copyright protection technology is increasing. In this paper, we propose an image encryption technology for color images. This technique divides the image into RGB color components and then performs quad-tree decomposition based on the edge of image. After the quad-tree partitioning, encryption is performed on the selected blocks. Encryption is performed on color components to measure encryption efficiency, and encryption efficiency is measured even after reconstitution into a color image. The encryption efficiency uses a visual measurement method and an objective image quality evaluation method. The PSNR values were measured as 7~10 dB for color difference components and 16~19 dB for color images. The proposed image encryption technology will be used to protect copyright of various digital image contents in the future.

FAULT TREE ANALYSIS OF KNICS RPS SOFTWARE

  • Park, Gee-Yong;Koh, Kwang-Yong;Jee, Eunk-Young;Seong, Poong-Hyun;Kwon, Kee-Choon;Lee, Dae-Hyung
    • Nuclear Engineering and Technology
    • /
    • v.40 no.5
    • /
    • pp.397-408
    • /
    • 2008
  • This paper describes the application of a software fault tree analysis (FTA) as one of the analysis techniques for a software safety analysis (SSA) at the design phase and its analysis results for the safety-critical software of a digital reactor protection system, which is called the KNICS RPS, being developed in the KNICS (Korea Nuclear Instrumentation & Control Systems) project. The software modules in the design description were represented by function blocks (FBs), and the software FTA was performed based on the well-defined fault tree templates for the FBs. The SSA, which is part of the verification and validation (V&V) activities, was activated at each phase of the software lifecycle for the KNICS RPS. At the design phase, the software HAZOP (Hazard and Operability) and the software FTA were employed in the SSA in such a way that the software HAZOP was performed first and then the software FTA was applied. The software FTA was applied to some critical modules selected from the software HAZOP analysis.

Configuration of ACK Trees for Multicast Transport Protocols

  • Koh, Seok-Joo;Kim, Eun-Sook;Park, Ju-Young;Kang, Shin-Gak;Park, Ki-Shik;Park, Chee-Hang
    • ETRI Journal
    • /
    • v.23 no.3
    • /
    • pp.111-120
    • /
    • 2001
  • For scalable multicast transport, one of the promising approaches is to employ a control tree known as acknowledgement (ACK) tree which can be used to convey information on reliability and session status from receivers to a root sender. The existing tree configuration has focused on a 'bottom-up' scheme in which ACK trees grow from leaf receivers toward a root sender. This paper proposes an alternative 'top-down' configuration where an ACK tree begins at the root sender and gradually expands by including non-tree nodes into the tree in a stepwise manner. The proposed scheme is simple and practical to implement along with multicast transport protocols. It is also employed as a tree configuration in the Enhanced Communications Transport Protocol, which has been standardized in the ITU-T and ISO/IEC JTC1. From experimental simulations, we see that the top-down scheme provides advantages over the existing bottom-up one in terms of the number of control messages required for tree configuration and the number of tree levels.

  • PDF