• Korean Journal of Environmental Biology
• /
• v.23 no.4
• /
• pp.335-342
• /
• 2005

We cloned seven genes encoding chitin synthases (CHSs) by PCR amplification from genomic DNAs of four strains of the genus Sporobolomyces and of Bensingtonia subrosea using degenerated primers based on conserved regions of the CHS genes. Though amino acid sequences of these genes were shown similar as 176 to 189 amino acids except SgCHS2, DNA sequences were different in size, which was due to various introns present in seven fragments. Alignment and phylogenetic analysis of their deduced amino acid sequences together with the reported CHS genes of basidiomycetes separated the sequences into classes I, II and III. This analysis also permitted the classification of isolated CHSs; SgCHS1 belongs to class I, BsCHS1, SaCHS1, SgCHS2, SpgCHS1, and SsCHS1 belong to class II, and BsCHS2 belongs to class III. The deduced amino acid sequences involving in class II that were discovered from five strains were also compared with those of other basidiomycetes by CLUSTAL X program. The bootstrap analysis and phylogenetic tree by neighbor-joining method revealed the taxonomic and evolutionary position for four strains of the genus Sporobolomyces and for Bensingtonia subrosea which agreed with the previous classification. The results clearly showed that CHS fragments could be used as a valuable key for the molecular taxonomic and phylogenetic studies of basidiomycetes.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.20 no.1
• /
• pp.131-142
• /
• 2017

The function of urban parks as wildlife habitats is becoming increasingly important. The urban park serves as a key area for preserving urban biodiversity. The purpose of this study is to estimate the bird species diversity in 30 parks in Cheonan city and quantitatively analyze the influence of vegetation, park structure and landscape connectivity index. As the results, a total of 27 birds species and 1,509 individuals were found at the sites and the largest number of birds were found in the Cheongsa park with 17 species. The optimal regression model was selected as the explanatory variables for the logged park area (LPA), the tree cover ratio (Co_T) and the patch betweenness centrality (PB). LPA and Co_T mean the internal characteristics of the park, and PB was the external environmental variable meaning landscape connectivity. LPA was the most important factor (73.3%) as bird habitat, and the PB could be interpreted as a factor that should be considered as important (26.7%). It will be possible to consider these environmental variables in the park and green area construction and management.

• The Journal of Korean Medical History
• /
• v.23 no.2
• /
• pp.47-56
• /
• 2010

The objective of this article is to investigate and analyze the way how the suture surgery was operated in case of external wound or incision in past Korea. The method to do this study was to search the books on the website, Knowledge of Oriental Medicine Web Service, databased and serviced by Korean Institute of Oriental Medicine. The searching key word was '縫'. The results was as follows. According to the website search, ten subjects of suture surgery could be classified: sword wound(金瘡), horse bite(馬咬), intestine incision(腸肚傷), knife or ax wound(刀斧傷), larynx incision(割喉), intestine protrusion by cow collision(牛觸腸出), self-stabbing of neck(自刎), falling from tree(童稚上木墮下), lip injury(趺損唇皮) and face wound(顔面의 外傷). Furthermore, the kinds of suturing fiber, the way how to stitch, the kinds of medical care before and after the suture surgery could also be found

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.68-72
• /
• 2009

The suffix array is a data structure storing all suffixes of a string in lexicographical order. It is widely used in string problems instead of the suffix tree, which uses a large amount of memory space. Many researches have shown that not only the suffix array can be built in O(n), but also it can be constructed with a small time and space usage for real-world inputs. In this paper, we analyze a practical suffix sorting algorithm due to Maniscalco and Puglisi [1], and we propose an efficient algorithm which improves Maniscalco-Puglisi's running time.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.1-10
• /
• 2005

Multiple sequence alignment(MSA) is a fundamental technique of DNA and Protein sequence analysis. Biological sequences are aligned vertically in order to show the similarities and differences among them. In this Paper, we Propose an effcient group alignment method, which is based on clustering divergency, to Perform the alignment between two groups of sequences. The Proposed algorithm is a clustering divergence(CDMS)-based multiple sequence alignment and a top-down approach. The algorithm builds the tree topology for merging. It is so based on the concept that two sequences having the longest distance should be spilt into two clusters. We expect that our sequence alignment algorithm improves its qualify and speeds up better than traditional algorithm Clustal-W.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.2
• /
• pp.103-112
• /
• 2000

CAD databases are the core element to the management of product information. A key to the successful use of the databases is a rational method of query to and retrieval from the databases. Although it is parts geometry that users eager to retrieve from the CAD databases, no system yet supports geometry-based query. This paper aims at developing a new method of assessing geometric similarity which can serve as the basis of geometric query for CAD database. The proposed method uses ASVP (Alternating Sums of Volumes with Partitioning) decomposition that is a volumetric representation of a part obtained from its boundary representation. A measure of geometric similarity between two solid models is defined on their ASVP tree representations. The measure can take into account overall shapes of parte, shapes of features and their locations. Several properties that a similarity measure needs to satisfy are discussed. The geometric query developed in this paper can be used in a wide range of applications using CAD databases, which include similarity-based design retrieval, variant process planning, and components selection from part library. An experiment has been carried out to demonstrate the effectiveness of the method, and the results are presented.

• Journal of the Korean Society for Railway
• /
• v.9 no.6 s.37
• /
• pp.739-745
• /
• 2006

The role of maintenance in railway is going to be extended to improve the reliability of railway system in the aspect of Asset management gradually. In this paper, the meaning of reliability and safety in RCM which has been applied in order to improve the efficiency of maintenance is deduced. And the analysis task of reliability and safely which has been recommended in railway standards such as EN50126 and IEC62278 is reviewed in the aspect of RCM. Finally, the several ways are proposed to apply RCM to railway system through the comparison between the RCM procedure and the analysis procedure for the reliability and safety in railway standards. Hereafter, if the analysis of reliability and safety is performed with the concept of RCM in the beginning of railway business, it will be more efficient to improve the reliability and manage the railway asset.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.07a
• /
• pp.17-20
• /
• 2003

안전하고 안정적인 그룹통신은 최근 그룹 및 그룹 구성원간의 협조가 필요한 응용 분야가 발전하면서 점차 그 필요성이 대두되고 있다. 이 중 가장 중요한 문제는 그룹내의 키 관리 문제이다. 중앙에 의존하는 키 관리 방식의 경우 대용량의 멀티캐스트 그룹에 어울리는 반면 중앙 센터 없이 구성원간의 협조에 의하여 이루어지는 그룹의 경우 분산키 관리 방법, 즉 그룹키 합의 방법이 필요하다. 기존의 그룹 키 합의 방법들은 계산량의 효율성에 치중한 연구만을 해왔다. 한 가지 예외로 STR 프로토콜［4］은 디피-헬만 프로토콜을 키 트리에 응용하고 키 트리가 한쪽으로 치우친 구조를 가지고 있어 통신량을 최적화하고 있다. 하지만 계산량에 있어서 그룹 멤버의 변경 시 현재 그룹 구성원의 수에 비례한 계산량이 필요하다. 본 논문에서는 pairing을 응용하여 STR 키 합의 방식에 계산량에 있어서 효율성을 제공하고 통신 효율성을 유지하며 그룹키를 인증할 수 있는 방식을 제시한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.1
• /
• pp.12-23
• /
• 2001

Extended path expressions are used to denote multiple paths concisely by using '$\ast$' character. They are convenient for expressing OQL queries to retrieve XML data stored in OODBs. In this paper, we propose a multi-path index scheme as a new index scheme to efficiently process queries with extended path expressions. Our proposed index scheme allocates a unique path identifier for every possible single path in an extended path expression and provides functionalities of both a single path indexing and multiple path indexing through the composition of index key and path identifier while using only a index structure. The proposed index scheme provides better performance than single-path index schemes, and is practical since it can be implemented by little modification of leaf records of a B+-tree index.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.161-172
• /
• 2000

In this paper, we introduce the development of a LOTOS-based tool, supporting formal methods, called ForTIA (A Formalism for Telecommunication and Information Systems). By using LOTOS, an ISO standard formal specification language, the user requirements and system models can be abstracted and represented formally. Therefore, the system can be validated and verified on the specifications, before implementations. ForTIA supports light-weight formal methods based on validation to be used in real industry. Key functions of ForTIA are simulation and C++ code generation. In simulation, tree based visual validation mechanism is provided and in code generation, the full C++ source code is generated to be used for system implementations.