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

During the two-years(1979 to 1980) fertilization trial on 4-year-old chestnut tree plantations, total insolation was diminished in 1980 because of unseasonable weather. In every fertilization treatment plot, especially in the NPK-fertilized plot with magnesium, growth of trees and yield of chestnuts have been increased significantly. The results obtained are as follows: 1) The growth in the NPK-fertilized plot with boron and magnesium was 20 percent higher than in plots fertilized with NPK alone. 2) Although there was some frost damage to trees on November 14, 1979, the 1979 weather was otherwise normal and daily insolation averaged 7 hours from June through september, The 1979 fertilization indices for chesnut yield were 167 for NPK with boron and 207 for NPK with magnesium, as compared with the base index of 100 for NPK alone. 3) In 1980, the second year of the fertilization trial, unseasonable weather decreased the average daily insolation from June through September to 3.8 hours. Under such conditions, the fertilization indices for chestnut yield were 620 for NPK with boron and 741 for NPK with magnesium, and Boron, as compared to the base index of 100 for NPK alone; i.e. the yields of plots treated with NPK and magnesium were 21 percent higher than for plots with NPK and boron and 7 times the yields for plots with NPK alone, But in the trial plot of NPK, yield of chestnut in 1980 decreased compared with 1979, 4) All test plots had natural magnesium levels lower than 0.8me/100gr., and the treatments with NPK and magnesium would have been less apparent on soils with higher magnesium level. The spectacular effects of treatment with NPK and magnesium during periods of low insolation may result from increased chlorophyll production and corresponding increases in active carbon assimilation, which should play an important role in carbohydrate formation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.691-700
• /
• 2006

Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.