• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.467-469
• /
• 2003

This research aimed to develop forest type classification technique for the mixed forest with coniferous and broad-leaved species using the high resolution satellite data. QuickBird data was used as satellite data. The method of this research was to extract satellite data for every single tree crown using image segmentation technique, then to evaluate the accuracy of classification by changing grouping criteria such as tree species, families, coniferous or broad-leaved species, and timber prices. As a result, the classification of tree species and families level was inaccurate, on the other hand, coniferous or broad-leaved species and timber price level was high accurate.

• Animal cells and systems
• /
• v.10 no.1
• /
• pp.27-40
• /
• 2006

Tree of heaven (Ailanthus altissima Swingle) as an invasive alien plant, appeared usually in the disturbed locations such as road-side, incised slope, and trampling path-side. They appeared abundantly in the trampling pathside but they did not appear or were rare in the interior of forest. Density and importance value of tree of heaven were proportionate to the relative light intensity measured according to distance from the trampling path toward forest interior and closely related to the breadth of trampling path as well. They were associated with annual, other exotic species or ruderal plants well. Distributional pattern of mature trees of them in the study area and its surrounding environments implied that they were introduced intentionally. Size class distribution of them showed that they are in expansion and artificial interferences such as, installing physical training space and developing hiking course functioned as trigger factors in their invasion and expansion. The results support the facts known generally in relation to invasion and expansion of the invasive alien plants. In this viewpoint, we suggest a management plan that applies ecological restoration principles to address ecosystems infected with tree of heaven by restoring the integral feature of the degraded nature and conserving the remained nature more thoroughly.

• Korean Journal of Bronchoesophagology
• /
• v.7 no.1
• /
• pp.14-18
• /
• 2001

Background and Objectives： Vegetable Foreign bodies (VFB) in the bronchial tree may be complicated by fragmentation, slippage and impaction during the removal with forceps. This study is to evaluate the safety and efficacy for the technique of removing VFB from the bronchial tree in infants and early childhood using Fogarty balloon catheter. Materials and methods : The subjects consisted of 18 infants and early childhood (7-22 months old) with VFB in the bronchial tree from January 1991 through October 1998. The authors first attempted removal of VFB with forceps and if that failed, removed VFB with Fogarty arterial embolectomy catheter under the ventilating bronchoscopy and general anesthesia. Results: We removed 6 VFB with forceps. could not remove anymore, and so removed 12 VFB with Fogarty catheter. In 8 VFB of less than 24 hours, we could remove 6 VFB with forceps and 2 VFB which could not be removed with forceps were removed with Fogarty catheter. In 10 VFB of more than 24 hours, we could not remove with forceps and removed with Fogarty catheter. Conclusions : VFB in the bronchial tree of infants and early childhood can usually be removed with forceps. But we think that Fogarty balloon catheter technique is a easy, safe method for the removal of bronchial VFB of more than 24 hours, fragmentation, impaction, lower bronchus and too round or slippery to remove with forceps in infants and early childhood.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.4
• /
• pp.44-53
• /
• 2010

Program plagiarism is a significant factor to reduce the quality of education in computer programming. In this paper, we propose the technique of identifying similar or identical programs in order to prevent students from reckless copying their programming assignments. Existing approaches for identifying similar programs are mainly based on fingerprints or pattern matching for text documents. Different from those existing approaches, we propose an approach based on the program structur. Using paring progrmas, we first transform programs into XML documents by representing syntactic components in the programs with elements in XML document, then run X-tree Diff+, which is the change detection algorithm for XML documents, and produce an edit script as a change. The decision of similar or identical programs is made on the analysis of edit scripts in terms of program plagiarism. Analysis of edit scripts allows users to understand the process of conversion between two programs so that users can make qualitative judgement considering the characteristics of program assignment and the degree of plagiarism.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1993.04b
• /
• pp.305-309
• /
• 1993

The application of fault tree technique to the analysis of compressor failure is considered. The techniques involve the decomposition of the system into a logic diagram or fault tree in whichcertain basic or primary events lead to a specified top event which signifiss the total failure of the system. The fault trees are used to obtain miniumal cut sets from whichthe modes of system failure and, hence the reliability for the top event can be calculated. The method of constructing fault trees and the subsequent estimation of reliability of the system is illustrated through a compressor failure. FTA is roved to be efficient to investigate the compressor fault train.

• Animal cells and systems
• /
• v.4 no.1
• /
• pp.95-100
• /
• 2000

The regional distribution and relative frequencies of endocrine cells were studied immunogistochemically (PAP methods) in the alimentary tract of the tree frog, Hyla areorea japonica, using specific antisera against serotonin, somatostatin, bovine Sp-1/chromogranin (BCG), cholecystokinin (CCK)-8, vasoactive intestinal polypeptide (VIP), gastrin, bombesin, secretin and pancreatic polypeptide (PP). Six kinds of endocrine cells were identified in this study, These immunoreactive cells were located in the gastric glands of stomach regions and in the basal portion of the epithelium of the intestinal tract or esophagus with variable frequencies. They were spherical or spindle-shaped. Serotonin-immunoreactive cells were observed in the whole alimentary tract including the esophagus. Somatostatin-immunoreactive cells were also detected throughout the alimentary tract except the rectum. CCK-8-immunoreactive cells were observed from the pylorus to ileum. Vip-immunoreactive cells were restricted to the rectum. Bombesin-immunoreactive cells were restricted to the fundic gastric regions and gastrin-immunoreactive cells were restricted to the pylorus. However, no BCG-, secretin and PP-immunoreactive cells were demonstrated in this study. In conclusion, the regional distribution and relative frequency of the endocrine cells in the alimentary tract of the tree frog were similar to other anuran species, but some differences which may be caused by feeding habits and species specification were also observed.

• Journal of the Korean Institute of Educational Facilities
• /
• v.14 no.2
• /
• pp.5-15
• /
• 2007

In modern society, the role of university becomes diversified and the concerns on building construction or landscape architecture considering beautiful landscape and scene are increasing caused by increasing interest on external environment of campus. But relative importance of concerns for the context of landscape architecture in campus is neglected rather than other facilities. So the landscape architecture service could not be conducted well. Therefore the computerization of system or management program will be needed for effective landscape architecture tree management and sufficiency of concerns on continuously increasing landscape architecture in campus. The computerization of landscape architecture tree management will be important roles not only to raise the efficiency of landscape architecture management and the view of outdoor environment but also to increase the competitive power of rapidly changing university environment and the quality of education.

• Asian Pacific Journal of Cancer Prevention
• /
• v.15 no.14
• /
• pp.5593-5596
• /
• 2014

Background: The objective of this study was to determine a diagnostic classification scheme using a decision tree based model. Materials and Methods: The study was conducted as a retrospective case-control study in Imam Khomeini hospital in Tehran during 2001 to 2009. Data, including demographic and clinical-pathological characteristics, were uniformly collected from 624 females, 312 of them were referred with positive diagnosis of breast cancer (cases) and 312 healthy women (controls). The decision tree was implemented to develop a diagnostic classification scheme using CART 6.0 Software. The AUC (area under curve), was measured as the overall performance of diagnostic classification of the decision tree. Results: Five variables as main risk factors of breast cancer and six subgroups as high risk were identified. The results indicated that increasing age, low age at menarche, single and divorced statues, irregular menarche pattern and family history of breast cancer are the important diagnostic factors in Iranian breast cancer patients. The sensitivity and specificity of the analysis were 66% and 86.9% respectively. The high AUC (0.82) also showed an excellent classification and diagnostic performance of the model. Conclusions: Decision tree based model appears to be suitable for identifying risk factors and high or low risk subgroups. It can also assists clinicians in making a decision, since it can identify underlying prognostic relationships and understanding the model is very explicit.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.10
• /
• pp.1044-1049
• /
• 2006

Multiple sequence alignment is a method to compare two or more DNA or protein sequences. Most of multiple sequence alignment tools rely on pairwise alignment and Smith-Waterman algorithm to generate an alignment hierarchy. Therefore, in the existing multiple alignment method as the number of sequences increases, the runtime increases exponentially. In order to remedy this problem, we adopted a parallel processing suffix tree algorithm that is able to search for common subsequences at one time without pairwise alignment. Also, the cross-matching subsequences triggering inexact-matching among the searched common subsequences might be produced. So, the cross-matching masking process was suggested in this paper. To identify the function of the clusters generated by suffix tree clustering, BLAST and CDD (Conserved Domain Database)search were combined with a clustering tool. Our clustering and annotating tool consists of constructing suffix tree, overlapping common subsequences, clustering gene sequences and annotating gene clusters by BLAST and CDD search. The system was successfully evaluated with 36 gene sequences in the pentose phosphate pathway, clustering 10 clusters, finding out representative common subsequences, and finally identifying functional domains by searching CDD database.

• 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.