• The Korean Journal of Mycology
• /
• v.40 no.4
• /
• pp.288-291
• /
• 2012

Korean oak wilt disease caused by Raffaelea quercus-mongolicae is vectored by the ambrosia beetle Platypus koryoensis. To prevent the spread of the disease, the beetle infested oak tree had been cut into logs, covered with plastic vinyl, fumigated with a pesticide, and stored for three years on the site where the tree was cut. This study was carried out to get information on the fungi colonizing the fumigated oak wood. Wood disk samples collected from the fumigated oak logs at two locations in the Taejo Mountain, Cheonan city, were used for fungal isolation. A total of 99 filamentous fungal isolates were obtained from the wood disk samples. Hypocrea spp., Trichoderma spp. and Penicillium spp. were identified based on morphological characteristics and nucleotide sequence analysis of translation elongation factor 1-alpha gene and ITS rDNA region. Trichoderma was the major fungal group. R. quercus-mongolicae, and P. koryoensis were not detected from the fumigated oak wood. Our work provided evidence that after three years of storage, the fumigated oak wilt-diseased logs should be no longer harmful source of oak wilt disease transmission.

• Journal of Korean Society of Forest Science
• /
• v.77 no.2
• /
• pp.223-228
• /
• 1988

To select $SO_2$-resistant tree species, leaf disks of 6mm in diameter, cut from the leaves of 6 species (Wistaria floribunda, Magnolia obovata, Rosa multiflora, Liriodendron tulipifera, Robinia pseudo-acacia and Acer palmatum) were floated on 25ml of testing medium and placed on laboratory under fluorescent lamp (1,500 Lux) for 20 hours. Chlorophyll content and acidity of the testing medium were measured. Testing medium was prepared by diluting $H_2SO_4$, $H_2SO_3$ and $Na_2SO_4$ with distilled water for various stoichiometric $SO_2$ concentrations, 0, 25, 50, 100 and 250 ppm. Total chlorophyll content was more decreased after treatment than before treatment, and was decreased more severely in $H_2SO_3$ sources, followed by $H_2SO_4$ and $Na_2SO_4$, sources. Decreasing rate of total chlorophyll content was generally large in Acer palmatum. Magnolia obovata and Wistaria floribunda, and was relatively small in Rosa multiflora, Liriodendron tulipifera and Robinia pseudo-acacia. Decreasing rate of chlorophyll content may be useful index for judging susceptifility of the leaf to $SO_2$. The acidity of the testing medium was generally decreased after treatment, and it means that cell leakage was occurred during treatment. The differences in medium acidity between before and after treatment may be poot index for susceptibility of the leaf to $SO_2$ owing to the difference among tree species in development of leaf mesophyll, acidity maintaining mechanism and butter capacity of the leaf tissue.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.451-462
• /
• 2008

Recently, with the advent of applications using locations of moving objects, it becomes crucial to develop efficient index schemes for spatio-temporal databases. The $TPR^*$-tree is most popularly accepted as an index structure for processing future-time queries. In the $TPR^*$-tree, the future locations of moving objects are predicted based on the CBR(Conservative Bounding Rectangle). Since the areas predicted from CBRs tend to grow rapidly over time, CBRs thus enlarged lead to serious performance degradation in query processing. Against the problem, we propose a new method to adjust CBRs to be tight, thereby improving the performance of query processing. Our method examines whether the adjustment of a CBR is necessary when accessing a leaf node for processing a user query. Thus, it does not incur extra disk I/Os in this examination. Also, in order to make a correct decision, we devise a cost model that considers both the I/O overhead for the CBR adjustment and the performance gain in the future-time owing to the CBR adjustment. With the cost model, we can prevent unusual expansions of BRs even when updates on nodes are infrequent and also avoid unnecessary execution of the CBR adjustment. For performance evaluation, we conducted a variety of experiments. The results show that our method improves the performance of the original $TPR^*$-tree significantly.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1828-1834
• /
• 2004

With the rapid development of wireless communications and mobile technologies, requirements of various services based on moving objects like location-based services and mobile applications services have been increased. In this paper, we propose an index structure which can improve the performance on trajectory-based query especially, one of the various query types for moving objects in mobile applications. It maintains link table(L-Table) to obtain good efficiency on retrieval and insertion performance of the existing TB(Trajectory Bundle)-tree proposed for trajectory-based query of moving objects. The L-Table contains page number in disk and memory pointers pointing the leaf node with the first and last line segment of moving objects in order to directly access preceding node. In addition, we design to reside a part of whole index in main memory by preserving a fixed size of buffer in case of being restricted by available main memory. Finally, experimental results with various data sets show that the proposed technique is superior to the existing index structures with respect to insertion and trajectory-based query.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.1
• /
• pp.393-401
• /
• 2013

Most traditional databases exploit record-oriented storage model where the attributes of a record are placed contiguously in hard disk to achieve high performance writes. However, for search-mostly datawarehouse systems, column-oriented storage has become a proper model because of its superior read performance. Today, flash memory is largely recognized as the preferred storage media for high-speed database systems. In this paper, we introduce fast column-oriented database model and then propose a new column-aware index management scheme for the high-speed column-oriented datawarehouse system. Our index management scheme which is based on enhanced $B^+$-Tree achieves high search performance by embedded flash index and unused space compression in internal and leaf nodes. Based on the results of the performance evaluation, we conclude that our index management scheme outperforms the traditional scheme in the respect of the search throughput and response time.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.91-99
• /
• 2019

In this paper, we propose partial denoising boundary matching based on an index for faster matching in very large image databases. Attempts have recently been made to convert boundary images to time-series with the objective of solving the partial denoising problem in boundary matching. In this paper, we deal with the disk I/O overhead problem of boundary matching to support partial denoising in a large image database. Although the solution to the problem superficially appears trivial as it only applies indexing techniques to boundary matching, it is not trivial since multiple indexes are required for every possible denoising parameters. Our solution is an efficient index-based approach to partial denoising using $R^*-tree$ in boundary matching. The results of experiments conducted show that our index-based matching methods improve search performance by orders of magnitude.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.345-361
• /
• 2005

A transform-space index indexes objects represented as points in the transform space An advantage of a transform-space index is that optimization of join algorithms using these indexes becomes relatively simple. However, the disadvantage is that these algorithms cannot be applied to original-space indexes such as the R-tree. As a way of overcoming this disadvantages, the authors earlier proposed the transform-space view join algorithm that joins two original- space indexes in the transform space through the notion of the transform-space view. A transform-space view is a virtual transform-space index that allows us to perform join in the transform space using original-space indexes. In a transform-space view join algorithm, the order of accessing disk pages -for which various space filling curves could be used -makes a significant impact on the performance of joins. In this paper, we Propose a new space filling curve called the adaptive row major order (ARM order). The ARM order adaptively controls the order of accessing pages and significantly reduces the one-pass buffer size (the minimum buffer size required for guaranteeing one disk access per page) and the number of disk accesses for a given buffer size. Through analysis and experiments, we verify the excellence of the ARM order when used with the transform-space view join. The transform-space view join with the ARM order always outperforms existing ones in terms of both measures used: the one-pass buffer size and the number of disk accesses for a given buffer size. Compared to other conventional space filling curves used with the transform-space view join, it reduces the one-pass buffer size by up to 21.3 times and the number of disk accesses by up to $74.6\%$. In addition, compared to existing spatial join algorithms that use R-trees in the original space, it reduces the one-pass buffer size by up to 15.7 times and the number of disk accesses by up to $65.3\%$.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.443-448
• /
• 2003

Approximate k-nearest neighbor queries are frequently occurred for finding the k nearest neighbors to a given query point in spatial database systems. The number of searched nodes in an index must be minimized in order to increase the performance of approximate k nearest neighbor queries. In this paper. we suggest the technique of approximate k nearest neighbor queries on R-tree family by improving the existing algorithm and evaluate the performance of the proposed method in dynamic spatial database environments. The simulation results show that a proposed method always has a low number of disk access irrespective of object distribution, size of nearest neighbor queries and approximation rates as compared with an existing method.

• Journal of The Korean Astronomical Society
• /
• v.47 no.3
• /
• pp.87-98
• /
• 2014

We develop a parallel cosmological hydrodynamic simulation code designed for the study of formation and evolution of cosmological structures. The gravitational force is calculated using the TreePM method and the hydrodynamics is implemented based on the smoothed particle hydrodynamics. The initial displacement and velocity of simulation particles are calculated according to second-order Lagrangian perturbation theory using the power spectra of dark matter and baryonic matter. The initial background temperature is given by Recfast and the temperature uctuations at the initial particle position are assigned according to the adiabatic model. We use a time-limiter scheme over the individual time steps to capture shock-fronts and to ease the time-step tension between the shock and preshock particles. We also include the astrophysical gas processes of radiative heating/cooling, star formation, metal enrichment, and supernova feedback. We test the code in several standard cases such as one-dimensional Riemann problems, Kelvin-Helmholtz, and Sedov blast wave instability. Star formation on the galactic disk is investigated to check whether the Schmidt-Kennicutt relation is properly recovered. We also study global star formation history at different simulation resolutions and compare them with observations.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.21 no.5
• /
• pp.720-725
• /
• 2012

Sodium hypochlorite is used worldwide as a water disinfectant and in bleaching agent. Sodium hypochlorite applied to water initially undergoes hydrolysis to form free chlorine consisting of hypochlorous acid(HOCl) and hypochlorite ion($OCl^-$). For free chlorine determination, an electrochemical method is simple due to the electroactivity of free chlorine; it measures current and is free of most reagents. Amperometric free chlorine sensor has been developed with gold (Au)-based electrode. The 3-electrode free chlorine sensor whose working and counter electrodes were Pt exhibited excellent response to HClO at +400mV vs. Ag/AgCl/sat. KCl. In addition, the use of a pH error correction algorithm provided a reliable measurement of residual free chlorine in water sample without any pretreatment in the normal pH range(pH 6~8) of municipal water supply. The free chlorine sensor installed in on-line monitoring system could be used to continually monitor the level of residual free chlorine in real samples.