• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.03a
• /
• pp.99-102
• /
• 1998

본 논문에서는 복잡하고 비선형적인 시스템의 최적 모델링을 우해서 지능형 퍼지-뉴럴네트워크의 최적 모델 구축을 위한 방법을 제안한다. 기본 모델은 퍼지 추론 시스템의 언어적인 규칙생성의 장점과 뉴럴 네트워크의 학습기능을 결합한 FNNs 모델을 사용한다. FNNs 모델의 퍼지 추론부는 간략추론이 사용되고, 학습은 요류 역전파 알고리즘을 사용하여 다른 모델들에 비해 학습속도가 빠르고 수렴능력이 우수하다. 그러나 기본 모델은 주어진 시스템에 대하여 퍼지 공간을 균등하게 분할하여 퍼지 소속을 정의한다. 이것은 비선형 시스템의 모델링에 있어어서 성능을 저하시켜 최적의 모델을 얻기가 어렵다. 논문에서는 주어진 데이터의 특성을 부여한 공간을 설정하기 위하여 클러스터링 알고리즘을 사용한다. 클러스터링 알고리즘은 주어진 시스템에 대하여 상호 연관성이 있는 데이터들끼리 특성을 나누어 몇 개의 클래스를 이룬다. 클러스터링 알고리즘을 사용하여 초기 FNNs 모델의 퍼지 공간을 나누고 소속함수를 정의한다. 또한, 최적화 기법중의 하나로 자연선택과 자연계의 유전자 메카니즘에 바탕을 둔 탐색 알고리즘인 유전자 알고리즘을 사용하여 주\ulcorner 진 모델에 대하여 최적화를 수행한다. 또한 본 연구에서는 학습 및 테스트 데이터의 성능 결과의 상호 균형을 얻기 위한 하중값을 가긴 성능지수가 제시된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.469-471
• /
• 2001

내장형시스템의 복잡도의 증가, 하드웨어-소프트웨어 통합설계방법의 대두 등으로 인하여 시스템수준의 명세, 설계방법론에 관한 관심이 더욱 고조 되고 있다. 본 논문에서는 시스템기술언어로 ITU-T에 의해 표준으로 권고되어 널리 사용되고 있는 SDL (Specification and Description Language)로부터 실시간 운영체제에서 수행 C코드를 자동으로 생성하는 방법론을 제시한다. C코드는 SDL 프로세스의 내부 행위 (behavior)를 묘사하는 운영체제 비의존적인 코드와 다중프로세스수행, 프로세스간 커뮤니케이션과 같은 운영체제 의존적인 부분으로 다중프로세스수행, 프로세스간 커뮤니케이션과 같은 운영체제 의존적인 부분으로 나뉘어지며, 운영체제 서비tm함수를 이용하여 생성된 C코드가 운영체제와 더욱 밀접하게 통합되어 수행된다.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.38 no.2
• /
• pp.110-118
• /
• 2002

The element free Galerkin method has been suggested by Belyschko, etc. it is applied for linear elastic analysis of solid problems and its convergence characteristics and stability are shown according to the weight function, influence domain and scattered points. The various numerical examples are performed to check the efficiency of 1D EFG and 2D EFG program by changing factors. As a result it have the best results when it used the cubic spline weight function and the scaling parameter d$_{max}$=2. These programs were developed by mixed language programming method using Visual Basic and the C language. so it is fast and efficient. and visually shown the result.t.

• Journal of Digital Contents Society
• /
• v.10 no.4
• /
• pp.493-499
• /
• 2009

Three methods frequently used for Hangul display in computer systems are Standard Johab Code in which each of Hangul consonants and vowels is given a 5-bit code and each syllable created by combining them forms a 2-byte code, Standard Wansung Code in which each of all the syllables generally used for Hangul presentation forms a 2-byte code, and Unicode in which each syllable in most of the world's language systems is given a unique code so that it allows computers to consistently represent and manipulate them in a unified manner. An embedded system in general has a lower processing power and a limited amount of storage space, compared to a personal compute(PC) system. According to its usage, however, the former may have a processing power equal to that of the latter. Hence, when Hangul display needs to be adopted, an embedded system must choose a display method suitable for its own resource environment. This paper introduces a TFT LCD initialization method and pixel display functions of an LN2440SBC embedded board on which an LP35, a 3.5" TFT LCD kit, is attached. Using the initialization and pixel display functions, in addition, we compare three aforementioned Hangul display methods, in terms of their processing speeds and amounts of memory space required. According to experiments, Standard Johab Code requires less amount of memory space but more processing time than Standard Wansung Code, and Unicode requires the largest amount of memory space but the least processing time.

• Journal of KIISE
• /
• v.42 no.7
• /
• pp.852-859
• /
• 2015

As the amount of knowledge information significantly increases, a lot of progress has been made in the studies focusing on how to reason large scale ontology effectively at the level of RDFS or OWL. These reasoning methods are divided into TBox classifications and ABox realizations. A TBox classification mainly deals with integrity and dependencies in schema, whereas an ABox realization mainly handles a variety of issues in instances. Therefore, the ABox realization is very important in practical applications. In this paper, we propose a realization method for analyzing the constraint of the specified class, so that the reasoning system automatically infers the classes to which instances belong. Unlike conventional methods that take advantage of the object oriented language based distributed file system, we propose a large scale ontology reasoning method using spark, which is a functional programming-based in-memory system. To verify the effectiveness of the proposed method, we used instances created from the Wine ontology by W3C(120 to 600 million triples). The proposed system processed the largest 600 million triples and generated 951 million triples in 51 minutes (696 K triple / sec) in our largest experiment.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.2
• /
• pp.201-206
• /
• 2010

PLCs are special purpose microcontrollers used in most automatic control systems such as plants, embedded systems, and intelligent buildings. LD is one of the most popular languages among PLC languages. For now LD programs are mainly verified by simulation and testing which has a lot of limitation. This paper describes how to translate a given LD program into an input of a model checker so that LD program is verified by model checking. We define formal semantics of LD programs and SMV models and specify a formal definition of the translation function which preserves semantics between LD programs and SMV models.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.4
• /
• pp.370-378
• /
• 2002

Fuzzy inference which combines numerical data and linguistic data has been used to design adaptive filter algorithms. In adaptive IIR filter design, the fuzzy prefilter is taken account, and applied to both direct and lattice structure. As for the fuzzy inference of the fuzzy filter, the Sugeno's method is employed. As membership functions and inference rules are recursively generated through neural network, the accuracy can be improved. The proposed adaptive algorithm, adaptive IIR filter with fuzzy prefilter, has been applied to adaptive system identification for the purposed of performance test. The evaluations have been carried out with viewpoints of convergence property and tracking properties of the parameter estimation. As a result, the faster convergence and the better coefficients tracking performance than those of the conventional algorithm are shown in case of direct structures.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.5
• /
• pp.653-660
• /
• 2002

This paper proposes a method for storing graphs and defining graph algorithms based on the well-developed relational database. In this method, graphs are represented in the form of relations. Each vertex and edge of a graph is represented as tuples of the table and saved in a database. We developed a library of graph operations for the storage and management of graphs and the development of graph applications. Furthermore, we defined graph algorithms in terms of relational algebraic operations such as projection, selection, and join. They can be implemented with the database language such as SQL. This database approach provides an efficient methodology to deal with very large-scale graphs and to support the development of graph applications.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.668-681
• /
• 2006

Due to its diverse advantages, XML has secured its position as a standard for data representation and exchange in the Internet. As a consequence, there has been much research on efficient storing and query processing of in data. Storing XML data in a relational database system warrants much benefit in data management and query processing; the system provides a strong query processing and data management function and can be applicable to XML data, its function being extended. In this paper, we design and implement a query translator that translates XQuery, a representative XML query language, into SQL:2003 query. SQL:2003, the latest SQL standard used as a substitute for SQL:1999, defines SQL/XML that supports XML. The main contribution of this paper is as follows: First, we look into the supporting features of XML, defined in the SQL:2003 standard, and propose a user-defined function for shortcoming sections. Second, we propose a way to translate XQuery into SQL that observes the latest SQL standard. Third, we describe in detail the design and the implementation of the translator to show its feasibility as a translator.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.2
• /
• pp.123-130
• /
• 2001

As the growth of database volume, it has required a need and an opportunity of data analysis and extracting knowledge from database. Data mining method is the representative example. The size of most minable data set is huge, and stored in a database. To implement effective mining function, we must extract minable data set to be analyzed from existing relational database, and it must be managed with its generalized information. In this paper, the new mining operator is defined in a similar manner to the existing SQL operators and SQL is extended to extract data subset from relations and to generalize it using domain-oriented method. The background knowledge includes attribute values, which will be mind and generalized information, and it is managed as the same structure with a relation in relational database. These functions are implemented by defining some SQL - like operators and aggregated functions, and we describe the expressive powers of these new operators and functions through examples.