• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.220-223
• /
• 2000

타입-2 퍼지집합을 이용하여 퍼지논리시스템(Fuzzy Logic System : FLS)을 구현하기 위한 연구들이 R. I John, N. Karnik, J. Mendel 등에 의해 현재 진행되고 있다. 타입-2 집합을 이용한 타입-2 FLS은 기존의 타입-1 FLS보다 제어규칙이나 소속함순가 가지고 있는 불확실성을 표현하는데 있어서 더 효과적이다. 그러나, 타입-2 FLS 역시 타입-1 FLS이 가지고 있는 문제점인 설계시 전문가에게 의존하여 시간과 비용이 많이 소요되고, 제어기의 구성요소들을 효율적으로 생성하기가 어렵다는 문제점을 더욱 심각하게 가지고 있다. 또한, 그 문제점을 해결하기 위한 연구들도 아직 미진한 상태이다. 본 논문에서는 타입-2 FLS의 설계를 위해 유전자 알고리즘을 사용하는 방법을 제안한다. 타입-2 FLS를 설계하기 위해서는 소속함수와 제어규칙을 생성하여야 한다. 본 논문에서는 유전자 알고리즘을 사용하여 타입-2 퍼지제어규칙과 소속함수를 설계하는 방법을 제안한다. 먼저, 유전자 알고리즘에서 사용할 수 있는 유전자의 형태로 타입-2 퍼지제어규칙과 소속함수를 표현하기 위한 인코딩방법을 제안하고, 각각의 염색체를 진화시키기 위한 교차 연산자와 돌연변이 연산자를 정의한다. 그리고, 제안된 방법을 함수근사문제에 적용하여 유효성과 성능을 평가, 검증한다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.4
• /
• pp.341-346
• /
• 2002

Type-1 fuzzy set is used to show the uncertainty in a given value. But there are many situations where it needs to be extended to type-2 fuzzy set because it can be also difficult to determine the crisp membership function itself. Type-2 fuzzy systems have the advantage that they are more expressive and powerful than type-1 fuzzy systems, but they require many operations defined for type-1 fuzzy sets need to be extended in the domain of type-2 fuzzy sets. In this paper, comparison and ranking methods for type-2 fuzzy sets are proposed. It is based on the satisfaction function that produces the comparison results considering the actual values of the given type-2 fuzzy sets with their possibilities. Some properties of the proposed method are also analyzed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.316-325
• /
• 2006

In diploid organisms like human, each chromosome consists of two copies. A haplotype is a SNP(single nucleotide polymorphism) sequence information from each copy. Finding the complete map of haplotypes in human population is one of the important issues in human genome. To obtain haplotypes via experimental methods is both time-consuming and expensive. Therefore, inference methods have been used to infer haplotyes from the genotype samples. In this paper, we propose a new approach using genetic algorithm to infer haplotypes, which is based on the model of finding the minimum number of haplotypes that explain the genotype samples. We show that by doing a computational experiment, our algorithm has the correctness similar to HAPAR[1] which is known to produce good results while the execution time of our algorithm is less than that of HAPAR as the input size is increased. The experimental result is also compared with the result by the recent method PTG[2].

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1093-1105
• /
• 2007

This paper presents a multidimensional type inheritance indexing technique (MD-TIX) for XML databases. We use a multidimensional file organization as the index structure. In conventional XML database indexing techniques using one-dimensional index structures, they do not efficiently handle complex queries involving both nested elements and type inheritance hierarchies. We extend a two-dimensional type hierarchy indexing technique(2D-THI) for indexing the nested elements of XML databases. 2D-THI is an indexing scheme that deals with the problem of clustering elements in a two-dimensional domain space consisting of the key value domain and the type identifier domain for indexing a simple element in a type hierarchy. In our extended scheme, we handle the clustering of the index entries in a multidimensional domain space consisting of a key value domain and multiple type identifier domains that include one type identifier domain per type hierarchy on a path expression. This scheme efficiently supports queries that involve search conditions on the nested element represented by an extended path expression. An extended path expression is a path expression in which every type hierarchy on a path can be substituted by an individual type or a subtype hierarchy.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.6
• /
• pp.528-531
• /
• 2001

Finding a shortest path on a graph is a fundamental problem in the area of graph theory. In an application where we cannot exactly determine the weights of edges fuzzy weights can be used instead of crisp weights. and Type-2 fuzzy weight will be more suitable of this uncertainty varies under some conditions. In this paper, shortest path problem in type-1 fuzzy weighted graphs is extended for type 2 fuzzy weighted graphes. A solution is also given based on possibility theory and extension principle.

• Journal of Korean Library and Information Science Society
• /
• v.49 no.2
• /
• pp.221-244
• /
• 2018

This study intends to implement an OPAC prototype based on FRBR(Functional Requirements for Bibliographic Records) model, which are reflected the users' information needs and search behavior. To the end, this study applies prototyping techniques that design, evaluate and improve an early sample model. Included in this study are as follows: (1) design a conceptual model of new OPACs based on the users' information needs about FRBR-based search services, (2) implement a FRBR-based prototype with WordPress 4.2 version, (3) evaluate the FRBR-based prototype from the viewpoint of users and experts(catalogers and professors). 50 college students and 6 experts participate in the final evaluation process.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.265-278
• /
• 2006

This paper presents a two-dimensional type inheritance hierarchy index(2D-THI) for XML databases. XML Schema is one of schema models for the XML documents supporting. The type inheritance. The conventional indexing techniques for XML databases can not support XML queries on type inheritance hierarchies. We construct a two-dimensional index structure using multidimensional file organizations for supporting type inheritance hierarchy in XML queries. This indexing technique deals with the problem of clustering index entries in the two-dimensional domain space that consists of a key element domain and a type identifier domain based on the user query pattern. This index enhances query performance by adjusting the degree of clustering between the two domains. For performance evaluation, we have compared our proposed 2D-THI with the conventional class hierarchy indexing techniques in object-oriented databases such as CH-index and CG-tree through the cost model. As the result of the performance evaluations, we have verified that our proposed two-dimensional type inheritance indexing technique can efficiently support the query Processing in XML databases according to the query types.

• Annual Conference on Human and Language Technology
• /
• 1990.11a
• /
• pp.172-179
• /
• 1990

본 논문에서는 한글(한국어) ascii 코드와 4가지 한글 표현 원리에 만들어지는 한글음절을 정의한다. Common Lisp(CL)의 확장된 버전으로 한글이 사용 가능한 한글 CL(HCL)의 소개하고 CL에 추가되는 새로운 한글 함수에 대하여 설명한다. HCL의 모든 함수는 한글을 다루는 방법에 따라 4가지 타입으로 나뉘어진다. 1) 타입 0 - 한글을 입출력 값으로 취하지 않는 전형적인 CL 함수, 2) 타입 1 - 원래 CL 함수정의의 변경없이 입력으로 한글을 받아들이는 함수, 3) 타입 2 - 한글을 사용하기 위하여 함수의 정의를 확장해야하는 CL 함수, 4) 타입 3 - 한글 처리를 하기 위하여 새로 설계한 새로운 함수. 위의 타입에 의해 분류되는 각 함수에 대한 정의를 제안하고 한글 편집기에 대하여 소개한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.478-481
• /
• 2011

이 논문에서는 정적으로 2단계 언어의 불필요한 식을 찾는 분석 방법을 제안한다. 불필요한 식이란 식의 실행의미가 프로그램의 결과에 영향을 미치지 않는 식을 말한다. 다단계 프로그램이 불필요한 식을 만들어내는 지 프로그램 실행전에 알 수 있다면 프로그램 실행에 드는 비용을 줄일 수 있다. 이 분석은 다형타입을 가지는 다단계 언어의 타입시스템과 타입시스템에 올라탄 분석에 기반하고 있다. 이 분석으로 프로그램 실행 시 불필요한 식이 프로그램 코드 형태로 전파되는 것을 알 수 있으며 다형타입을 이용한 정교한 분석이 가능하다.

• Economic and Environmental Geology
• /
• v.45 no.2
• /
• pp.181-188
• /
• 2012

The 1M and $2M_1$ stacking sequences are the most frequently encountered in the illite species among the possible 6 polytypes. The $1M_d$, derived from the 1M polytype which exhibits a variable degree of disorder in the stacking sequence, is also observed in illite samples. In this paper, the author introduces and reviews the theoretical background of the quantitative analysis method of illite polytypes, and considers the possibility to determine the fault age and its reactivation age using K/Ar age-dating based on the quantification of illite polytypes in the fault system. For the increase of the accuracy and precision of the illite age analysis method, the occurrence, identification, and mineralogical characterization of illite polytypes should be defined in detail. The broadening effect of (hkl) reflections, due to disordering of 1M polytype and the presence of I/S minerals with expandability, are also considered as the main parameters controlling the quantification of illite polytypes using the WILDFIRE(C)simulation.