• Development and Reproduction
• /
• v.18 no.1
• /
• pp.43-49
• /
• 2014

Three species of Nortamea concinua (NC) and Haliotis discus hannai (HDH) from Tongyeong and Sulculus diversicolor supertexta (SDS) are widely distributed on the coast of the Yellow Sea, southern sea and Jeju Island in the Korean Peninsula under the innate ecosystem. There is a need to understand the genetic traits and composition of three mollusk species in order to evaluate exactly the patent genetic effect. PCR analysis was performed on DNA samples extracted from a total of 21 individuals using seven decamer oligonucleotides primers. Seven primers were shown to generate the unique shared loci to each species and shared loci by the three species which could be clearly scored. A hierarchical clustering tree was constructed using similarity matrices to generate a dendrogram, which was facilitated by the Systat version 10. 236 specific loci, with an average of 56.3 per primer, were identified in the NC species. 142 specific loci, with an average of 44.7 per primer, were identified in the HDH species. Especially, 126 numbers of shared loci by the three species, with an average of 18 per primer, were observed among the three species. Especially, the decamer primer BION-75 generated 7 unique loci to each species, which were identifying each species, in 700 bp NC species. Interestingly, the primer BION-50detected 42 shared loci by the three species, major and/or minor fragments of sizes 100 bp and 150 bp, respectively, which were identical in all samples. As regards average bandsharing value (BS) results, individuals from HDH species (0.772) exhibited higher bandsharing values than did individuals from NC species (0.655). In this study, the dendrogram obtained by the seven decamer primers indicates three genetic clusters: cluster 1 (CONCINNA 01~CONCINNA 07), cluster 2 (HANNAI 08~HANNAI 14), cluster 3 (SUPERTEXTA 15~SUPERTEXTA 21). Comparatively, individuals of HDH species were fairly closely related to that of SDS species, as shown in the hierarchical dendrogram of genetic distances.

• Horticultural Science & Technology
• /
• v.30 no.6
• /
• pp.617-625
• /
• 2012

Tree peony is a traditional famous flower of China, and plays an important role in Chinese traditional culture. But the floral scent of tree peony in vivo is little known. In this study, in order to explore the floral composition of tree peony, floral volatiles of six cultivars, including Paeonia suffruticosa 'Zhaofen' (ZF), P. suffruticosa 'Luoyanghong' (LYH), P. ostii 'Fengdanbai' (FDB), P. ${\times}$ lemonei 'High noon' (HN), P. ${\times}$ lemonei 'Renown' (R), and P. rockii 'Gaoyuanshenghuo' (GYSH) were collected by dynamic headspace and then identified by Automated Thermal Desorption-Gas Chromatography/Mass Spectometry. The results showed that floral fragrances of the six cultivars were qualitatively and quantitatively distinct. A total of 105 volatiles involving ten categories were detected. But not all volatile categories were emitted from these cultivars. The six peony cultivars emitted some shared compounds and peculiar compounds. The total released amounts of volatiles emitted from six cultivars were found significantly different, which was greatest for 'GYSH'. The most abundant volatile compounds detected from 'ZF', 'LYH', 'FDB', 'HN', 'R', and 'GYSH' were respectively ${\alpha}$-pinene, 2,3-dihydroxy propanal, 3-methyl-1-butanol, 2-ethyl-1-hexanol, acetic acid 1-methylethyl ester, and 5-ethyl-2,2,3-trimethyl heptane. This result may contribute to exploring the biosynthesis and emission mechanism of floral scent in tree peony.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.437-455
• /
• 2009

In the near future, various multicast based services will be provided over clustered wireless networks. To provide multicast services in secure manner, multicast messages are encrypted by using group key which is shared by group members. Therefore, various group key management schemes have been introduced until now. Among them, tree based approach is one of the most representative paradigms in group key management. Traditional tree based approaches effectively reduce rekeying message transmissions of the key distribution center. However, they do not consider the network bandwidth used for transmitting the rekeying messages. In this paper, we firstly present formulas that describe bandwidth consumption of tree based group key management scheme. Based on our formulations, we propose a bandwidth efficient key tree management scheme for clustered wireless networks where membership changes occur frequently. Simulation results show that our scheme effectively reduces the bandwidth consumption used for rekeying compared to existing key tree schemes.

• Journal of Forest and Environmental Science
• /
• v.15 no.1
• /
• pp.1-9
• /
• 1999

Noticing the intrinsic growing habit variations of hardwood species which is indigenous to the natural deciduous forest, eighteen tree species in overstory were selected for comparative evaluating tree form so as to develop the tree form index (TFI). Selected six tree form attributes were arbitrarily divided four assessment criteria and given appropriate scores. Eighteen tree species were undergone corresponding scores, converted to percentage base, and estimated TFI by the summation of the six scoring values. Cluster analysis was carried out to review which attribute would have been shared among species based on dissimilarity of scores for each pair of species in $18{\times}6$ data matrix. The result showed that Populus davidiana had the highest TFI value of 80.8 and Carpinus cordata had the lowest TFI va1ue of 46.3. The species which received more than 70 of TFI are Populus davidiana, Betula costata, Fraxinus mandshurica, and Ulmus davidiana var. japonica, characterized by the advantage of straight and longer bole, the narrower crown, and the thinner branch. On the contrary, such species as Sorbus alnifolia. Prunus sargentii, Acer mandshuricum, Juglans mandshurica, and Carpinus cordata received less than 60 of TFI, characterized by the disadvantage of the crooked or forked stem. the wider or deeper crown. and the thicker branch. In the dendrogram produced by cluster analysis, arbitrary value of Euclidean distance 10 divided eighteen species into four distinctive groups. and the typical characteristics of each group were discussed.

• Development and Reproduction
• /
• v.24 no.4
• /
• pp.327-335
• /
• 2020

Genomic DNA (gDNA) extracted from two populations of natural and cultured river pufferfish (Takifugu obscurus) was amplified by polymerase chain reaction (PCR). The complexity of the fragments derived from the two locations varied dramatically. The genetic distances (GDs) between individuals numbered 15 and 12 in the cultured population was 0.053, which was the lowest acknowledged. The oligonucleotide primer OPC-11 identified 88 unique loci shared within each population reflecting the natural population. The OPC-05 primer identified 44 loci shared by the two populations. The average band-sharing (BS) values of individuals in the natural population (0.683±0.014) were lower than in those derived from the cultured population (0.759±0.009) (p<0.05). The shortest GD demonstrating a significant molecular difference was found between the cultured individuals # 15 and # 12 (GD=0.053). Individual # 02 of the natural population was most distantly related to cultured individual # 22 (GD=0.827). A cluster tree was built using the unweighted pair group method with arithmetic mean (UPGMA) Euclidean GD analysis based on a total of 578 various fragments derived from five primers in the two populations. Obvious markers identified in this study represent the genetic structure, species security, and proliferation of river pufferfish in the rivers of the Korean peninsula.

• Journal of Ecology and Environment
• /
• v.48 no.1
• /
• pp.96-109
• /
• 2024

Background: Khyber Pakhtunkhwa government initiated the Billion Tree Tsunami Afforestation Project including regeneration and afforestation approaches. An effort was made to assess the distribution characteristics of afforested species under present and future climatic scenarios using ecological niche modelling. For sustainable forest management, landscape ecology can play a significant role. A significant change in the potential distribution of tree species is expected globally with changing climate. Ecological niche modeling provides the valuable information about the current and future distribution of species that can play crucial role in deciding the potential sites for afforestation which can be used by government institutes for afforestation programs. In this context, the potential distribution of 8 tree species, Cedrus deodara, Dalbergia sissoo, Juglans regia, Pinus wallichiana, Eucalyptus camaldulensis, Senegalia modesta, Populus ciliata, and Vachellia nilotica was modeled. Results: Maxent species distribution model was used to predict current and future distribution of tree species using bioclimatic variables along with soil type and elevation. Future climate scenarios, shared socio-economic pathways (SSP)2-4.5 and SSP5-8.5 were considered for the years 2041-2060 and 2081-2100. The model predicted high risk of decreasing potential distribution under SSP2-4.5 and SSP5-8.5 climate change scenarios for years 2041-2060 and 2081-2100, respectively. Recent afforestation conservation sites of these 8 tree species do not fall within their predicted potential habitat for SSP2-4.5 and SSP5-8.5 climate scenarios. Conclusions: Each tree species responded independently in terms of its potential habitat to future climatic conditions. Cedrus deodara and P. ciliata are predicted to migrate to higher altitude towards north in present and future climate scenarios. Habitat of D. sissoo, P. wallichiana, J. regia, and V. nilotica is practiced to be declined in future climate scenarios. Eucalyptus camaldulensis is expected to be expanded its suitability area in future with eastward shift. Senegalia modesta habitat increased in the middle of the century but decreased afterwards in later half of the century. The changing and shifting forests create challenges for sustainable landscapes. Therefore, the study is an attempt to provide management tools for monitoring the climate change-driven shifting of forest landscapes.

• The KIPS Transactions:PartD
• /
• v.12D no.6 s.102
• /
• pp.915-920
• /
• 2005

In this paper we expanded a existing web based B2B system to support users in low speed network. To guarantee shared dat a consistency between clients and a server, we proposed a method of data change detection by using a time stamp tree and the performance analysis of the proposed method was proved by a simulation. Under the worst condition that leaf nodes of a times tamp tree were changed uniform distribution, the simulation result showed that the proposed method was more efficient than a sequential detection until the percentage of changed nodes were below $15\%$. According to our observation, the monthly average of data change was below $7\%$ on a web-based construction MRO B2B system or a company A from April 2004 to August 2004. Therefore the Proposed method improved performance of data change detection in practice. The proposed method also reduced storage consumption in a server because it didn't require a server to store replicated data for every client.

• Journal of KIISE:Databases
• /
• v.34 no.1
• /
• pp.59-69
• /
• 2007

The trajectory of a tag in RFID system is represented as a interval that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. Whole trajectories of a tag are represented as a set of unconnected interval because the location of the tag which left the vicinity of a reader is unknown until it enters the vicinity of another reader. The problems are that trajectories of a tag are not connected. It takes a long time to find trajectories of a tag because it leads to searching the whole index. To solve this problem, we propose a technique that links two intervals of the tag and an index scheme called SLR-tree. We also propose a sharing technique of link information between two intervals which enhances space utilization of nodes, and propose a split policy that preserves shared-link information. And finally, we evaluate the performance of the proposed index and prove that the index processes history queries efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2283-2291
• /
• 1999

Most of collaborative applications use the Server-Client paradigm where all requests of clients will be delivered first to server and that server distributes again the requests to the rest of clients. This server-oriented operation and data transmission mechanism always presents end-to-end communications between the server and clients that can notably decrease the overall performance of applications. In this paper, we propose a new design approach to inhibit the inefficiency of applications using active networking concepts. We propose the ASM service that offers an application-specific in-network multicast functions, the AMTC service and its tree algorithm that builds anon-core based shared tree for multicast. These proposed services locate in active nodes performing its services as part of the overall system to improve the performance of collaborative applications.

• Proceedings of the IEEK Conference
• /
• 2003.07c
• /
• pp.2561-2564
• /
• 2003

Data mining is an effective method of the discovery of useful information such as rules and previously unknown patterns existing in large databases. The discovery of association rules is an important data mining problem. We have developed a new parallel mining called Distributed Frequent Pattern Tree (abbreviated by DFPT) algorithm on a distributed shared nothing parallel system to detect association rules. DFPT algorithm is devised for parallel execution of the FP-growth algorithm. It needs only two full disk data scanning of the database by eliminating the need for generating the candidate items. We have achieved good workload balancing throughout the mining process by distributing the work equally to all processors. We implemented the algorithm on a PC cluster system, and observed that the algorithm outperformed the Improved Count Distribution scheme.