• Journal of Korean Society of Forest Science
• /
• v.109 no.4
• /
• pp.421-428
• /
• 2020

Tamarind (Tamarindus indica L.) is one of the multipurpose tree species distributed in the tropical and sub-tropical climates. It is an important fruit yielding tree that supports the livelihood and has high social and cultural values for rural communities. The vegetative, reproductive, qualitative, and quantitative traits of tamarind vary widely. Characterization of phenotypic and genetic structure is essential for the selection of suitable accessions for sustainable cultivation and conservation. This study aimedto examine the genetic relationship among the collected accessions of sweet, red, and sour tamarind by using Random Amplified Polymorphic DNA (RAPD) primers. Nine accessions were collected from germplasm gene banks and subjected to marker analysis. Fifteen highly polymorphic primers generated a total of 169 fragments, out of which 138 bands were polymorphic. The polymorphic information content of RAPD markers varied from 0.10 to 0.44, and the Jaccard's similarity coefficient values ranged from 0.37 to 0.70. The genetic clustering showed a sizable genetic variation in the tamarind accessions at the molecular level. The molecular and biochemical variations in the selected accessions are very important for developing varieties with high sugar, anthocyanin, and acidity traits in the ongoing tamarind improvement program.

• Asian-Australasian Journal of Animal Sciences
• /
• v.17 no.10
• /
• pp.1355-1359
• /
• 2004

Japanese Black cattle of Hyogo prefecture (Tajima strain) are famous for its ability to produce high-quality meat and have been maintained as a closed system for more than 80 years. In order to assess the usefulness of microsatellite markers in closed cattle populations, and evaluate the genetic structure of the Tajima strain, we analyzed representative dams of the Tajima strain comprised of the substrains Nakadoi and Kinosaki. Genetic variability analyses indicated low genetic diversity in the Tajima strain. In addition, a recent genetic bottleneck, which could be accounted for by the high level of inbreeding, was detected in both substrains. In phylogenetic analyses, relationship coefficients and genetic distances between individuals were calculated using pedigree and microsatellite information. Two phylogenetic trees were constructed from microsatellite and pedigree information using the UPGMA method. Both trees illustrated that most individuals were distinguished clearly on the basis of the two substrains, although in the microsatellite tree some individuals appeared in clusters of different substrains. Comparing the two phylogenetic trees revealed good consistency between the microsatellite analysis tree and the pedigree information. The correlation coefficient between genetic distances derived from microsatellite and pedigree information was 0.686 with a high significance level (p<0.001). These results indicated that microsatellite information may provide data substantially equivalent to pedigree information even in unusually inbred herds of cattle, and suggested that microsatellite markers may be useful in revealing genetic structure without accurate or complete pedigree nformation. Japanese Black cattle of Hyogo prefecture (Tajima strain) are famous for its ability to produce high-quality meat and have been maintained as a closed system for more than 80 years. In order to assess the usefulness of microsatellite markers in closed cattle populations, and evaluate the genetic structure of the Tajima strain, we analyzed representative dams of the Tajima strain comprised of the substrains Nakadoi and Kinosaki. Genetic variability analyses indicated low genetic diversity in the Tajima strain. In addition, a recent genetic bottleneck, which could be accounted for by the high level of inbreeding, was detected in both substrains. In phylogenetic analyses, relationship coefficients and genetic distances between individuals were calculated using pedigree and microsatellite information. Two phylogenetic trees were constructed from microsatellite and pedigree information using the UPGMA method. Both trees illustrated that most individuals were distinguished clearly on the basis of the two substrains, although in the microsatellite tree some individuals appeared in clusters of different substrains. Comparing the two phylogenetic trees revealed good consistency between the microsatellite analysis tree and the pedigree information. The correlation coefficient between genetic distances derived from microsatellite and pedigree information was 0.686 with a high significance level (p<0.001). These results indicated that microsatellite information may provide data substantially equivalent to pedigree information even in unusually inbred herds of cattle, and suggested that microsatellite markers may be useful in revealing genetic structure without accurate or complete pedigree information.

• Journal of Digital Convergence
• /
• v.10 no.10
• /
• pp.215-220
• /
• 2012

This paper proposes a ontology of tree structure approach for adaptive object recognition in a situation-variant environment. In this paper, we introduce a new concept, ontology of tree structure ontology, for context sensitivity, as we found that many developed systems work in a context-invariant environment. Due to the effects of illumination on a supreme obstinate designing context-sensitive recognition system, we have focused on designing such a context-variant system using ontology of tree structure. Ontology can be defined as an explicit specification of conceptualization of a domain typically captured in an abstract model of how people think about things in the domain. People produce ontologies to understand and explain underlying principles and environmental factors. In this research, we have proposed context ontology, context modeling, context adaptation, and context categorization to design ontology of tree structure based on illumination criteria. After selecting the proper light-ontology domain, we benefit from selecting a set of actions that produces better performance on that domain. We have carried out extensive experiments on these concepts in the area of object recognition in a dynamic changing environment, and we have achieved enormous success, which will enable us to proceed on our basic concepts.

• Korean Journal of Environment and Ecology
• /
• v.12 no.1
• /
• pp.30-41
• /
• 1998

This study analyzed urban greenspace area and vegetation structure by land use types for Kangnam-gu and Junglang-gu in Seoul different in income and building construction date. The study districts had a similar areal distribution of land use types. Residential lands accounted for about 32~37% of total area, natural lands, 19~22%, commercial and industrial lands(including transportation), 13~18%, and institutional lands, 13~17%. Greenspace covered only 20~30% of urban residential and commercial area in which human activities of living concentrate. Canopy stocking level in urban lands (all land uses except natural and agrecultural lands) was about 39% for Kangnam-gu and 50% for Junglang-gu, showing tree planting potential slightly higher in Kangnam-gu than in Junglang-gu. Woody plant cover was approximately 13%, and tree density was 3 trees/100m$^{2}$ forurban lands in both districts. The tree-age structure was largely characterized by young, growing tree population, and species diversity within a diameter class decreases as the diameter classes get larger. Urban lands of both districts had quite a similar species composition of woody plants (similarity indez of 0.70). Income and bulding construction date did not result in significant diference between the two districts in vegetation structure for urban lands. Some strategies were ezplored to solve problems found in the present greenspace structures. They included increase of biomass and greenspace area through minimization of unnecessary impervious surfaces, creation of multilayered and multiaged vegetation structures, and avoidance of intensive tree pruning and relocation of above ground utility lines.

• Journal of Korea Multimedia Society
• /
• v.15 no.10
• /
• pp.1257-1263
• /
• 2012

An implementation of animation module using the 3D body data scanned by laser scanner is reported in this paper. Characteristic points of the skeleton in human body were picked up as pivot point for 3D rotation. The body data set wes reconstructed as objects built in hierarchical tree structure, which is based on skeleton model. In order to implement the 3D animation of the laser scanned body data, the vertexes of the objects were connected as skeleton structure and animated to follow dynamic patterns inputted by user.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.638-641
• /
• 2004

Returned laser pulse has certain relationship with vegetation canopy structure (canopy closure, height, LAI, biomass). This study attempts to analyze the characteristics of airborne laser scanner data over very dense forest canopy. Discrete pulse laser scanner data were obtained on April 25, 2004 along with digital aerial color imagery. Using forest stand maps, 14 sample stands of 7 species groups were selected and the elevations from the first and last laser return were compared. From the preliminary analysis, we found that the difference between the first and last return was higher with deciduous forest stand than in coniferous stand. Although difference between the first and the last laser returns often corresponds to tree height, it would not be the case for the forest site having very dense canopy structure.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.2
• /
• pp.59-65
• /
• 2012

Emergency medical information center performs role of medical direction about disease consult and pre-hospital emergency handling scheme work to people. Emergency medical information system plays a major role to be decreased mortality and disability of emergency patient by providing information of medical institution especially when emergency patient has appeared. But, various attacks as a hacking have been happened in Emergency medical information system recently. In this paper, we proposed security structure which can protect the system securely by detecting attacks from outside effectively. Intrusion detection was performed using rule based detection technique according to protocol for every packet to detect attack and intrusion was reported to control center if intrusion was detected also. Intrusion detection was performed again using decision tree for packet which intrusion detection was not done. We experimented effectiveness using attacks as TCP-SYN, UDP flooding and ICMP flooding for proposed security structure in this paper.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.04b
• /
• pp.457-462
• /
• 1995

This paper describes diagnosis strategy of the Flexible Multiple Fault Diagnosis Module for forecasting faults in system and deciding current machine state form sensor information. Most studydeal with diagnosis control stategy about single fault in a system, this studies deal with multiple fault diagnosis. This strategy is consist of diagnosis control module such as backward tracking expert system shell, various neural network, numerical model to predict machine state and communication module for information exchange and cooperate between each model. This models are used to describe structure, function and behavior of subsystem, complex component and total system. Hierarchical structure is very efficient to represent structural, functional and behavioral knowledge. FT(Fault Tree). ST(Symptom Tree), FCD(Fault Consequence Diagrapy), SGM(State Graph Model) and FFM(Functional Flow Model) are used to represent hierachical structure. In this study, IA(Intelligent Agent) concept is introduced to match FT component and event symbol in diagnosed system and to transfer message between each event process. Proposed diagnosis control module is made of IPC(Inter Process Communication) method under UNIX operating system.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.601-616
• /
• 2004

Information retrieval systems for structured documents provide multiple levels of retrieval capability by supporting structure-based queries. In order to process structure-based queries for structured documents, information for structural nesting relationship between elements and for element sequence must be maintained. This paper presents four index structures that can process various query types about structures such as structural relationships between elements or element occurrence order. The proposed algorithms are based on the concept of Global Document Instance Tree.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.261-273
• /
• 2004

Advances in information and communication technologies have been creating new classes of applications in the area of databases. For example, in moving object databases, which track positions of a lot of objects, or stream databases, which process data streams from a lot of sensors, data Processed in such database systems are usually changed very rapidly and continuously. However, traditional database systems have a problem in processing these rapidly and continuously changing data because they suppose that a data item stored in the database remains constant until It is explicitly modified. The problem becomes more serious in the R-tree, which is a typical index structure for multidimensional data, because modifying data in the R-tree can generate cascading node splits or merges. To process frequent updates more efficiently, we propose a novel update technique for the R-tree, which we call the leaf-update technique. If a new value of a data item lies within the leaf MBR that the data item belongs, the leaf-update technique changes the leaf node only, not whole of the tree. Using this leaf-update manner and the leaf-access hash table for direct access to leaf nodes, the proposed technique can reduce update cost greatly. In addition, the leaf-update technique can be adopted in diverse variants of the R-tree and various applications that use the R-tree since it is based on the R-tree and it guarantees the correctness of the R-tree. In this paper, we prove the effectiveness of the leaf-update techniques theoretically and present experimental results that show that our technique outperforms traditional one.