• Korean Journal of Agricultural Science
• /
• v.49 no.3
• /
• pp.561-570
• /
• 2022

This study investigated the changes in planting environment and growing conditions of 'Arisoo' apple trees under shading net treatments. Apple tree canopies were fully covered with Blue (blue color net, mesh size: 4 mm × 5 mm), Black-A (black color net, mesh size: 4 mm × 5 mm), Black-B (black color net, mesh size: 5 mm × 6 mm), and uncovered trees were used as the control. Inside the tree canopies, the illuminance was observed as 100% (85.0 Klux) in the control, but it decreased to 75% (64.3 Klux) in the Blue, 73% (63.0 Klux) in the Black-A, and 77% (65.9 Klux) in the Black-B nets, respectively. The solar irradiance was observed as 755 w·m^-3 in the control, but it was decreased to 715 w·m^-3 in the Blue, 624 w·m^-3 in the Black-A, and 647 w·m^-3 in the Black-B nets, respectively. The average daily temperature was observed to be the highest in the Black-A net (31.8℃) while it was observed to be around 30.0℃ in the control, Blue, and Black-B nets. In addition, the average fruit surface temperature was observed to be the highest (39.4℃) in the control, but it was decreased to 38.1℃ in the Blue, 37.3℃ in the Black-A, and 39.0℃ in the Black-B nets. However, the average soil temperature, the shoot growth rate, and leaf SPAD values were not different in all the treatments. Fruit sunburn disorders were the highest in the control while it was observed to be lower in the fruits from trees covered with the shading nets. However, at harvest, the fruit quality parameters were not different in all the treatments. Overall, this study suggests that the apple trees covered with the shading nets reduced the illuminance, solar irradiance, fruit surface temperature, and fruit sunburn disorders. However, the shading nets did not affect tree growth and apple fruit quality.

• Journal of Forest and Environmental Science
• /
• v.35 no.3
• /
• pp.159-172
• /
• 2019

Madhupur National Park (MNP) is one of the last remaining patches of old-growth natural Sal forest left in Bangladesh where the forest is tropical moist deciduous type. A study was revealed to assess the tree species diversity and composition in this area. For determining tree species the study was conducted through extensive random quadrat survey methods with $20m{\times}20m$ sized plots. Results of the study indicated that there were 139 tree species belonging to 100 genera and 40 families. The quadrat survey assessed the basal area, stem density, diversity indices and importance value index of the tree species having ${\geq}5cm$ D.B.H (Diameter at Brest Height). The basal area and stem density of the tree species were $20.689{\pm}1.08m^2/ha$ and $1412.93{\pm}64.27stem\;ha^{-1}$ while, diversity indices, i.e. Shannon-Wiener's diversity, Simpson's evenness, Margalef's species richness and Pielou's dominance indices indicated poor diversity in comparison to that of other PAs (Protected Areas) in South-Eastern region of Bangladesh. The structural composition based on height and D.B.H through reverse-J shaped curve indicated higher regeneration and recruitment but removal of trees of large growth classes. Sal (Shorea robusta) was the most dominant tree species that accounts 75% of the total tree individuals in the natural forest patches. However, some associates of Sal, i.e. Bhutum (Hymenodictyon orixensis), Gadila (Careya arborea), and Kusum (Schleichera oleosa) etc. were seemed to be rare in MNP.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.801-812
• /
• 2002

On-line reorganization in a shared nothing database cluster is crucial to the performance of the database system in a dynamic environment like WWW where the number of users grows rapidly and changing access patterns may exhibit high skew. In the existing method of on-line reorganization have a drawback that needs excessive data migrations in case more than two nodes within a cluster have overload at the same time. In this paper, we propose an advanced B$^{+}$ tree based on-line reorganization method that solves data skew on multi-nodes. Our method facilitates fast and efficient data migration by including spare nodes that are added to cluster through on-line scaling. Also we apply CSB$^{+}$ tree (Cache Sensitive B$^{+}$ tree) to our method instead of B$^{+}$ tree for fast select and update queries. We conducted performance study and implemented the method on Ultra Fault-Tolerant Database Cluster developed for high scalability and availability. Empirical results demonstrate that our proposed method is indeed effective and fast than the existing method. method.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2615-2628
• /
• 1997

In this paper, a new codebook design algorithm is proposed. It uses a DCT map based on two-dimensional discrete cosine of transform (2D DCT) and finite state vector quantizer (FSVQ) when the vector quantizer is designed for image transmission. We make the map by dividing input image according to edge quantity, then by the map, the significant features of training image are extracted by using the 2D DCT. A master codebook of FSVQ is generated by partitioning the training set using binary tree based on tree-structure. The state codebook is constructed from the master codebook, and then the index of input image is searched at not master codebook but state codebook. And, because the coding of index is important part for high speed digital transmission, it converts fixed length codes to variable length codes in terms of entropy coding rule. The huffman coding assigns transmission codes to codes of codebook. This paper proposes single-side growing huffman tree to speed up huffman code generation process of huffman tree. Compared with the pairwise nearest neighbor (PNN) and classified VQ (CVQ) algorithm, about Einstein and Bridge image, the new algorithm shows better picture quality with 2.04 dB and 2.48 dB differences as to PNN, 1.75 dB and 0.99 dB differences as to CVQ respectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.561-563
• /
• 2000

본 논문은 멀티캐스트 패킷 스위치의 성능 향상에 관하여 언급한다. 네트워크에 요구된 복사본의 수가 네트워크의 크기보다 클 경우 발생되는 오버플로우 문제를 해결하기 위해 Lee의 브로드캐스트 반얀 네트워크(BBN)를 기반으로 하여 다중경로와 다중출력을 제공하는 기능이 추가된 구조를 제안하였으며, 여기에 입력에서 다음 처리해야할 패킷의 fanout 값이 남아있는 BBN의 출력포트 수보다 클 경우 패킷이 복사될 수 없게됨으로서 발생되어질 수 있는 네트워크의 성능이 저하되는 문제를 해결하기 위하여, 셀분할 알고리즘을 이용한 수정된 DAE(dummy address encoder) 방식을 제안하였다.

• Journal of the Korea Society for Simulation
• /
• v.4 no.2
• /
• pp.61-68
• /
• 1995

The performance of event-driven logic simulation frequently used for VLSI design verification depends on the data structures for event queues. This paper improves the existing Timing Wheel as a data structure for an event queue. In case of the use of B+ tree, an efficient node degree is also presented based on the experiment results. A new Timing Wheel index structure, which eliminates the insertion and deletion overhead of B+ tree, is proposed and analyzed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.169-172
• /
• 2010

최근 플래시 메모리뿐만 아니라 SSD 를 활용한 데이터베이스의 사용이 점차 늘어나고 있다. 대용량의 데이터를 처리하는 데이터베이스에서는 삽입, 삭제, 검색을 빠르게 하기 위해 다양한 색인기법을 사용하는데 그 중 B-트리 구조가 대표적인 기법이다. B-트리는 삽입, 삭제, 검색을 할 때 더 나은 성능을 갖도록 도와주지만 그 구조를 유지하기 위한 비용이 많이 들어간다는 단점이 있다. 그 중 하나로 삽입 시 키가 삽입된 단말노드뿐만 아니라 그 부모노드까지 수정이 되어 한 번의 삽입에 여러 노드가 여러 페이지에 씌어져서 삽입시간이 길어지는 단점이 있다. 본 논문에서는 이러한 단점을 개선하기 위하여 SSD 에서 데이터베이스를 사용할 때 SSD 의 병렬 접근(parallel access) 방식을 사용해서 수정된 단말노드부터 루트노드까지의 경로에 있는 모든 노드들을 연속한 논리 주소 공간에 쓰는 방식을 적용하였다.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.267-269
• /
• 2006

Recently, flash memories are one of best media to support portable computer's storages in mobile computing environment. The features of non-volatility, low power consumption, and fast access time for read operations are sufficient grounds to support flash memory as major database storage components of portable computers. However, we need to improve traditional Indexing scheme such as B-Tree due to the relatively slow characteristics of flash operation as compared to RAM memory. In order to achieve this goal, we devise a new indexing scheme called F-Tree. F-Tree improves tree operation performance by compressing pointers and keys in tree nodes and rewriting the nodes without a slow erase operation in node insert/delete processes.

• Korean Journal of Environment and Ecology
• /
• v.11 no.2
• /
• pp.149-159
• /
• 1997

Eleven plots(10m*10m) were established in Pinus densiflora forests and analized in with TWINSPAN and DCA techniques, to study the comparison of the structure of plant community by soil depth in Ulsan Grand Park. As a result of this analyusis, the communities were divided into two groups : Community B which have shallow one. Community A showed climatic climax which have proceeded from Pinus densiflora to Quercus variabilis, Castanea crenata, Platycarya strobilacea, and at last to Carpinus laxiflora. Community A showed climatic climax which have proceeded fro, Pimus densiflora to Quercus variabilis, Castanea crenata, Platycarya strobilacea, and at last to carpenus laxiflora. Community B showed edaphic climax in sere of Pinus desiflora. The diffrernce of the growth of tree height was showed significantly between two communities. The sample tree aged 30 in Community A was 8.50m high and the sample tree aged 35 in Community B was 3.80m high. Community A was better than Community B in soil characteristics and species diversity indicies.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.12-23
• /
• 2005

In the past decade, advances in speed of commodity CPUs have iu out-paced advances in memory latency Main-memory access is therefore increasingly a performance bottleneck for many computer applications, including database systems. To reduce memory access latency, cache memory incorporated in the memory subsystem. but cache memories can reduce the memory latency only when the requested data is found in the cache. This mainly depends on the memory access pattern of the application. At this point, previous research has shown that B+ trees perform much faster than T-trees because B+ trees are more cache conscious than T-trees, and also proposed 'Cache Sensitive B+trees' (CSB. trees) that are more cache conscious than B+trees. The goal of this paper is to make T-trees be cache conscious as CSB-trees. We propose a new index structure called a 'Cache Sensitive T-trees (CST-trees)'. We implemented CST-trees and compared performance of CST-trees with performance of other index structures.