• Kyungpook Mathematical Journal
• /
• v.55 no.2
• /
• pp.373-382
• /
• 2015

In this paper, we introduce and study a new multivalued mapping in $\mathbb{R}$-trees, called k-strictly pseudononspreading. We also introduce a new two-step iterative process for two k-strictly pseudononspreading multivalued mappings in $\mathbb{R}$-trees. Strong convergence theorems of the proposed iteration to a common fixed point of two k-strictly pseudononspreading multivalued mappings in $\mathbb{R}$-trees are established. Our results improve and extend the corresponding results existing in the literature.

• Plant Resources
• /
• v.7 no.1
• /
• pp.77-86
• /
• 2004

The reduced ratio of red:far-red (R:FR) light acts as a measure of the proximity of competitors and plants can detect the potentially competing neighbor plants by perceiving reflected R:FR signals and initiate the response of “shade avoidance” before actual shading occurs. The phytochrome system is responsible for monitoring the changes in the R:FR and initiating the shade avoidance response. The response to low R:FR ratio was studied in a white aspen Populus alba clone ‘Bolleana’ using two filter systems: a clear plastic filter system that allows a R:FR ratio less than 1.0 to pass from adjacent border plant reflection; and a special commercial plastic that blocks FR light and creates a R:FR ratio above 3.0. The reduced R:FR signals enhanced the stem elongation in response to competition at the expense of relative stem diameter growth. Trees grown inside clear chambers were 27 ％ taller than trees grown inside the FR-blocking filter chambers. Stem taper of clear chamber trees was 16％ less than the FR-blocking filter trees. Low R:FR also induced 22％ more stem dry weight and 13％ greater petiole length per leaf compared to the FR-blocking filter trees. There were no statistically significant differences in leaf area, leaf number increment, and total dry weight between the two light filter treatments.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.20 no.3
• /
• pp.19-31
• /
• 2017

Plants are the basis for sustainable green growth, and the value of existence and importance of trees including landscape Plants can't be emphasized enough. Therefore, they are precious living things thriving in all sorts of public services, and continuous civil complaints for justifiable compensation of landscape Plants are filed. First, the standard formula of planting intervals according to production target specifications is calculated using root-collar caliper and diameter at breast height, and apply (1) standard medium sized trees which have not yet reached commercialization [deciduous tree production goal (R(B) less than 6cm]= (target standard)= [target standard $R(cm){\times}15{\times}0.7$]. (2) In case of commercialization(R6~R10)= [target standard $R(cm){\times}15{\pm}5%$], (3) In case of more than R12= [target standard $R(cm){\times}15{\times}130%$] shall be applied. In case of using diameter at breast height (4) In case of commercialization(B6~B10)= [target standard $B(cm){\times}20{\times}15{\pm}5%$], (5) In case of more than B12= [target standard $B(cm){\times}20{\times}130%$] shall be applied. Second, appraisal methods based on tree classification of compensation for loss are classified according to planted locations. (1) landscape trees within a house=[price of arrival at the site+planting cost], (2) landscape trees in places such as arboretum=[management technology of tress + relocation expenses considering scarcity of the trees (3) landscape trees in a place of loads= [landscape tree production cost + work out added price. In case of producted landscape threes (4) landscape trees ready to be commercialized as sales loss.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.23-37
• /
• 2004

Location Based Services(LBSs) in mobile environments become very popular recently. For efficient LBSs, spatial database management systems must need a spatial indexing scheme such as R-trees in order to manage the huge spatial database. However, it may need unnecessary disk accesses since it needs to access objects which are not actually concerned to user's location-based queries. In this paper, to support the location-based queries efficiently, we propose a CLR-tree(Cell Leveling R-tree) in which a dynamic cell is built up within the minimum bounding rectangle of R-trees' node. The cell level of nodes is compared with the query's cell level in location-based query processing and determines the minimum search space. Also, we propose the insertion, split, deletion, and search algorithms for CRL-trees. From the experimental results, we see that a CLR-tree is able to decrease $5{\sim}20%$ of disk accesses from those of R-trees. So, a CLR-tree can be used for fast accessing spatial objects to user's location-based queries in LBSs.

• Journal of the Korean Mathematical Society
• /
• v.53 no.1
• /
• pp.187-199
• /
• 2016

The r-ary number sequences given by $$(b^{(r)}_n)_{n{\geq}0}=\Large{\frac{1}{(r-1)n+1}}(^{rn}_n)$$ are analogs of the sequence of the Catalan numbers ${\frac{1}{n+1}}(^{2n}_n)$. Their history goes back at least to Lambert [8] in 1758 and they are of considerable interest in sequential testing. Usually, the sequences are considered separately and the generalizations can go in several directions. Here we link the various r first by introducing a new combinatorial structure related to GR trees and then algebraically as well. This GR transition generalizes to give r-ary analogs of many sequences of combinatorial interest. It also lets us find infinite numbers of combinatorially defined sequences that lie between the Catalan numbers and the Ternary numbers, or more generally, between $b^{(r)}_n$ and $b^{(r+1)}_n$.

• Journal of Korean Society of Forest Science
• /
• v.96 no.5
• /
• pp.585-590
• /
• 2007

Rhizina undulata is the fungus, which causes Rhizina root rot on coniferous trees. Nested-PCR using ITS-specific primer was applied to detect R. undulata from the soils of Japanese black pine (Pinus thunbergil) forests infested with the disease in Seocheon, Chungnam Province, South Korea. Soil samples were collected from four different sites, both dead trees and fruit bodies of R. undulata were present, dead trees only present, fruit bodies only present, and both were absent. Nested-PCR products specific to R. undulata ITS-region were amplified. Positive reactions were found in some samples from the sites, where dead trees and fruit bodies of R. undulata were absent as well as where both of those were present. R. undulata was mainly detected in the soil samples from the depth of 5~20 cm under the soil surface. These results show that the nested-PCR could be used to diagnose the presence or potential infestation of R. undulata in the soils of pine forests.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.463-476
• /
• 2006

R-trees have been traditionally optimized for the I/O performance with the disk page as the tree node. Recently, researchers have proposed cache-conscious variations of R-trees optimized for the CPU cache performance in main memory environments, where the node size is several cache lines wide and more entries are packed in a node by compressing MBR keys. However, because there is a big difference between the node sizes of two types of R-trees, disk-optimized R-trees show poor cache performance while cache-optimized R-trees exhibit poor disk performance. In this paper, we propose a cache and disk optimized R-tree, called the PR-tree (Prefetching R-tree). For the cache performance, the node size of the PR-tree is wider than a cache line, and the prefetch instruction is used to reduce the number of cache misses. For the I/O performance, the nodes of the PR-tree are fitted into one disk page. We represent the detailed analysis of cache misses for range queries, and enumerate all the reasonable in-page leaf and nonleaf node sizes, and heights of in-page trees to figure out tree parameters for best cache and I/O performance. The PR-tree that we propose achieves better cache performance than the disk-optimized R-tree: a factor of 3.5-15.1 improvement for one-by-one insertions, 6.5-15.1 improvement for deletions, 1.3-1.9 improvement for range queries, and 2.7-9.7 improvement for k-nearest neighbor queries. All experimental results do not show notable declines of the I/O performance.

• Land and Housing Review
• /
• v.6 no.4
• /
• pp.221-229
• /
• 2015

Large trees in the apartment complex are playing an important role to decide the quality of external environment. They are planted with the object of utilizing themselves as a landmark of the complex and enhancing space symbolism. Since planting large trees would require high maintenance costs and generate defect, it would cause decline in quality of external environment. This study researches on large trees in artificial ground of the apartment complex. This study analyzes actual condition of planting and tries to provide improvement direction of planting. In order to conduct this research, three target areas (over R30) and 265 trees are selected. Based on the drawings and specifications this study researches on the plan of landscape design, changes of field design, actual condition of completion, present condition of planting, minimum soil depth of growth and development and types of extra action for soil depth. The result shows that 85% of drawings and specifications for large trees in the apartment complex are deep-rooted tree species. On average large trees with R 35 are planted in artificial ground and there is lack of on average 65cm minimum soil depth of growth and development. Reviewing changes of field design is conducted in such limited size as mainly R30 and R40 and there is no extra plan for lack of soil depth. The plan for securing additional soil depth is done by 85% of mounding. However, since there is only 10% of satisfaction, the inappropriateness in securing additional soil is pointed out. This research also points out that the size of large trees, root characteristics and location-allocation for planting are pivotal factors for securing minimum soil depth of growth and development. This research also provides improvement direction in case of planning planting.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.171-173
• /
• 1999

공간 데이터베이스에서 사용되는 데이터는 그 양이 방대하고 복잡하여 이를 효율적으로 저장, 관리하는 색인이 필요하다. 여러 공간 색인 방법들 중에서 R-tree는 삽입과 삭제가 빈번히 발생하는 동적인 환경에서 효율적인 질의 성능을 보이는 것으로 알려져 있다. R-tree는 삽입되는 데이터의 순서에 따라 트리의 구조가 달라질 수 있는데, 주어진 데이터가 수정이 자주 발생하지 않는다며 데이터 입력 순서를 결정하여 질의 성능이 가장 좋은 트리를 구성할 수 있다. 본 논문에서는 데이터가 자주 수정되지 않는 환경에서 노드간의 중첩을 가장 최소화 할 수 있는 데이터 입력 순서를 결정하기 위해 클러스터링을 이용한 새로운 방법인 CSR-tree를 제안하고자 한다. CSR-tree는 일반 R-tree와 hilbert packed R-tree 방법보다 향상된 질의 성능을 보인다.

• Journal of Korean Society of Forest Science
• /
• v.17 no.1
• /
• pp.17-22
• /
• 1973

A study on the wood quality from planted Pinus koraiensis Sieb. et Zucc. has been undertaken by the University Forest in order to gain results of the gross structural features of stem. For this study some groups of trees were felled and several characteristics such as the degree of stem, slenderness, eccentric growth, heartwood diameter, height of butt sweep and butt-swell were analyzed. The results of the study are as follows. 1) The relation between diameter of log and its height in sample trees are nearly parallel to each other. But their degrees of slenderness in logs cut from intermediate and codominant trees are some what gentle as compared with that of logs from dominant tree. 2) The eccentric growth at transverse section of sample trees is generally decreased with the increase of tree height on all sample trees. 3) On the eccentric growth at transverse section of tree, a rather distinct tendency was noticed that all of sample trees showed the direction of eccentric growth in $R_2$ side. 4) Heartwood diameter appeares to become larger as tree growth decrease under same diameter of logs and log diameter in which heartwood appeares is larger in rapid growth rate trees. 5) The maximum height of butt-sweep generally shows that the larger the breast height diameter of tree is, the smaller its height becomes. On the contrary it was noticed that the larger the breast height diameter of trees, the higher the maximum height of butt-swell became. The direction of butt-sweep and butt-swell were shown in $R_1$ side in all sample trees.