• Bulletin of the Korean Mathematical Society
• /
• v.47 no.2
• /
• pp.221-229
• /
• 2010

Some new $\check{C}$eby$\check{s}$ev type inequalities have been developed by working on functions whose first derivatives are absolutely continuous and the second derivatives belong to the usual Lebesgue space $L_{\infty}[a,\;b]$. A unified treatment of the special cases is also given.

• Journal of KIBIM
• /
• v.12 no.3
• /
• pp.30-38
• /
• 2022

Railway is compsed in various components, such as subgrade, track bed, sleeper, rail, and overhead line, on a linear space. Therefore, comprehensive work for various design standards and guidelines is required when designing a railway facility. For this reason, much time and effort are required to review the relevant design standards and guidelines. While, automatic legal check system for BIM models has been developed in the architectural engineering, it has not been developed in the railway engineering. This study reviews the korean design standard and the korean code for railway engineering, and suggests some rule items of logical information. Comparing the suggested rule items to the railway BIM library, items of logical information and additional attribute information are obtained. The analysis results of railway design standards and BIM library presented in this study would be utilized for defining rule-set items that is essential for development of the automatic legal check system for railway BIM models.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.1
• /
• pp.18-25
• /
• 1992

In this paper, a rule checker which aids in composing a consistent knowledge base by checking redundancies and inconsistencies in a knowledge base is proposed. The proposed algorithm checks the rules by representing the rule connections as a network . The standard model of the rules adapted in this algorithm is in the Conjunctive Normal Form which includes NOT's, and rules of conventional expert system can be checked by converting them into the standard form by a rule form at converter. When compared with Ginsberg's KB-reducer which is conceptually most similar to the proposed algorithm among existing methods,it is shown by a computer simulation that with 360 rules, the checking time is three times faster and the rate increased as the number of rules increased, but the total memory requirement of the proposed agorithm is 1.2 times larger. The proposed algorithm has further advantages in that it can check circular rule chains and can find the paths of the redundant and inconsistent rules.

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.172-175
• /
• 2000

In this paper, we address the requirement of VHDL parser for design rule checker, and the structure and implementing method of design rule checker which checks if IP design is valuable to reuse. This checker builds the grammar trees from the design rules, and the internal graphs representation from IP design data. It maps the nodes of the grammar trees and the internal graphs to check if it violates the design rules. The design rule checker can do the cross reference between source codes and error messages to find error position easy.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.430-440
• /
• 1997

The knowledge repressenatation technique by production rule has been popular method to represent to represent the experts'dxpertise in expert systems.In this paper,we propose a method to verify the integrity of rule base.Proposcd method models rule base as a Petri net and utilizes the systematic strucutural properties of the petri net for berifi-cation.We describe the pricesure to check rule base at both local and global level intermal verification.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.11
• /
• pp.625-631
• /
• 2000

In designing fuzzy model, we encounter a major difficulty in the identification of an optimized fuzzy rule base, which is traditionally achieved by a tedious-and-error process. This paper presents an approach to automatic design of optimal fuzzy rule bases for modeling using evolutionary programming. Evolutionary programming evolves simultaneously the structure and the parameter of fuzzy rule base a given task. To check the effectiveness of the suggested approach, 3 examples for modeling are examined, and the performance of the identified models are demonstrated.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.77-86
• /
• 1996

In managing a certain database, the integrity of data is very important. The important. The integrity constrains thus should be considered carefully when a database is designed and, after the database is created, it is required for a database manager to check continuously if some data contained in the database violate the integrity constraints considered. It is however not easy to check the violateion of integrity constraints when the size and the complexity of database are increased. This paper suggests a rule-based database verification system to relax the difficulty of checking the integrity violation, in which a database is coupled with a rule-based system including the knowledge about the integrity constraints. The rule-database verification system suggested accepts the model descriptions of an application domain, generates the knowledge base consisting of rules and facts by analyzing the model description and proceeds the verification process to check the integrity of the database.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.416-425
• /
• 1999

복잡한 무결성 제약 조건을 효율적으로 확인하기 위해 제약 조건들을 룰 베이스(rule base)에 저장하고 별도의 룰 관리 시스템과 제약 조건 관리 시스템을 통해 제약 조건을 확인하는 기법이 많은 연구자들에 의해 연구되고 발표되었다. 그러나 제약 조건 관리 시스템이 실행시간에 응용 프로그램을 항상 모니터링하고 있다가 데이타의 수정이 요청될 때마다 개입하여 프로세스를 중단시키고 관련 제약 조건을 확인하는 기존의 방법들은 처리 시간의 지연을 피할 수 없다. 본 논문은 컴파일 시간에 제약 조건 확인 코드를 응용 프로그램에 미리 삽입할 것을 제안한다. 응용 프로그램 자체 내에 제약 조건 확인 코드가 삽입되기 때문에 실행 시간에 다른 시스템의 제어를 받지 않고 직접 제약 조건의 확인 및 데이타베이스의 접근이 가능해져서 처리 시간의 지연을 피할 수 있을 것이다. 이를 위해 어떤 구문이 제약 조건의 확인을 유발하는 지를 추적하였고, 컴파일러가 그러한 구문을 어떻게 전처리 과정에서 검색하는지 그리고 그러한 구문마다 어떻게 해당 제약 조건 확인 코드를 삽입할 수 있는 지를 객체지향1) 데이타베이스 언어인 Objectivity/C++에 대해 gcc의 YACC 코드를 변경함으로써 보여 주었다.Abstract To cope with the complexity of handling integrity constraints, numerous researchers have suggested to use a rule-based system, where integrity constraints are expressed as rules and stored in a rule base. A rule manager and an integrity constraint manager cooperate to check the integrity constraints efficiently. In this approach, however, the integrity constraint manager has to monitor the activity of an application program constantly to catch any database operation. For each database operation, it has to check relevant rules with the help of the rule manager, resulting in considerable delays in database access. We propose to insert the constraints checking code in the application program directly at compile time. With constraints checking code inserted, the application program can check integrity constraints by itself without the intervention of the integrity constraint manager. We investigate what kind of statements require the checking of constraints, show how the compiler can detect those statements, and show how constraints checking code can be inserted into the program, by modifying the GCC YACC file for Objectivity/C++, an object-oriented database programming language.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.12
• /
• pp.566-574
• /
• 2001

In designing fuzzy models and controllers, we encounter a major difficulty in the identification f an optimized fuzzy rule base, which is traditionally achieved by a tedious trial-and-error process. This paper presents an approach to the evolutionary design of an optimal fuzzy rule base for modeling and control. Evolutionary programming is used to simultaneously evolve the structure and the parameter of fuzzy rule base for a given task. To check the effectiveness of the suggested approach, four numerical examples are examined. The performance of the identified fuzzy rule bases is demonstrated.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.333-336
• /
• 2002

In many cases, fuzzy modeling has a defect that the design procedure cannot be theoretically justified. To overcome this difficulty, we suggest a new design method for fuzzy model by combining genetic algorithm(GA) and mush set theory. GA, which has the advantages is optimization, and rule base. However, it is some what time consuming, so are introduce rough set theory to the rule reduction procedure. As a result, the decrease of learning time and the considerable rate of rule reduction is achieved without loss of useful information. The preposed algorithm is composed of three stages; First stage is quasi-optimization of fuzzy model using GA(coarse tuning). Next the obtained rule base is reduced by rough set concept(rule reduction). Finally we perform re-optimization of the membership functions by GA(fine tuning). To check the effectiveness of the suggested algorithm, examples for time series prediction are examined.