• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.10a
• /
• pp.954-957
• /
• 2005

In order to implement Artificial Intelligence, various technologies have been widely used. Artificial Intelligence is applied for many industrial product and machine tools are the center of manufacturing devices in intelligent manufacturing system. The purpose of this paper is to present the construction of Rule Base for knowledge structure that is applicable to machine tools. This system is that decision whether to act in accordance with machine status is support system. It constructs Rule Base of knowledge used of machine toots. The constructed Rule Base facilitates the effective operation and control of machine tools and will provide a systematic way to integrate the expert's knowledge that will apply Intelligent Machine Tools.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2020.06a
• /
• pp.42-42
• /
• 2020

충남서부권은 기상이변으로 강수량이 적고 가뭄이 심화되고 있는 반면, 신규수원 개발 적지 부족 등 용수공급에 어려움을 겪고 있다. 2015년부터 2016년까지 가뭄시 비상용수공급을 위해 비상도수로를 건설하였다. 이 비상도수로는 보령댐의 가뭄단계 상황기준으로 운영중에 있다. 가뭄단계 상황이 경계단계에 진입하면 도수로를 가동시작하여 관심단계 회복시에 중단하게 된다. 동 연구는 현재 운영중인 보령댐도수로의 가동Rule을 수량(이수안전도), 수질(BOD), 전력비용을 고려하여 시나리오별로(상시도수, 총 도수량대비 25%, 50%, 75%, 100%) 도수할 때 어느 도수 Rule이 수량-수질-에너지 넥서스 측면에서 가장 유리한지를 밝혀 내고자 하였다. 연구에 사용된 기초자료는 보령댐도수로 준공이후 2016년~2019년 도수실적 자료를 이용하였다. 수량(이수안전도) 검토는 MODSIM을 활용하였고, 수질개선효과는 실측 BOD를 기준으로 도수조건별로 오염부하량으로 검토하였다. 전력비용은 금강원수 도수년도별로 산정하여 분석하였다. 추가 연구결과를 통해 가뭄단계 상황기준, 월별 물관리 여건을 고려하여 기준향후 비상도수로 운영에 있어서 수량절량, 수질개선, 전력비용 절감을 기대할 수 있을 것이다.

• Water for future
• /
• v.18 no.4
• /
• pp.347-359
• /
• 1985

This study aims at the development of DP-Model for the establishment of monthly optimal operation policy of single multi-puppose reservoir by which the water demand of downstream can be satisfied under the various physical constraints. Series, A. B. C. of inflow are selected out of future monthly inflow data which are simulated form the past monthly average inflow of Andong dam site. the neight possible alternatives in each inflow series are established in order that Andong dam can supply the water demand of Nagdong main stream of 30% to 100%. Nextly, the reservoir rule curves is derived for each alternative by the detailed seguential analysis of stroage, future inflow and water demand based on the reservoir continuite equation. Then, and alternative which can satisfy the objective function of system based on the rule curves in the exteream is determined as an optimal operation policy from the application of developed DP=Model.

• Journal of Digital Contents Society
• /
• v.2 no.2
• /
• pp.103-115
• /
• 2001

This paper proposes the two algorithms which generate a minimal decision rule and approximate inference operation, adapted the rough set and the factor space theory in fuzzy knowledge base. The generation of the minimal decision rule is executed by the data classification technique and reduct applying the correlation analysis and the Bayesian theorem related attribute factors. To retrieve the specific object, this paper proposes the approximate inference method defining the membership function and the combination operation of t-norm in the minimal knowledge base composed of decision rule. We compare the suggested algorithms with the other retrieval theories such as possibility theory, factor space theory, Max-Min, Max-product and Max-average composition operations through the simulation generating the object numbers and the attribute values randomly as the memory size grows. With the result of the comparison, we prove that the suggested algorithm technique is faster than the previous ones to retrieve the object in access time.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1393-1403
• /
• 1999

공간 데이타베이스 시스템을 통하여 공유되는 공간 데이타는 무결성이 적절하게 유지되지 않는 한 전체 응용 시스템의 행위를 예측할 수 없게 되므로 데이타의 무결성 확인 및 유지는 필수적이다. 특히 공공 GIS에 저장된 공간 데이타는 토지 이용도 평가, 도시 계획, 자원 관리, 시설물 관리, 안전 관리, 국방 등 국가 전체 및 지역의 중요한 정책 결정을 위한 다양한 응용 시스템들에 의해 이용되므로 적절한 공간 객체의 무결성 확인이 더욱 더 필요하다. 본 논문에서는 능동(active) DBMS의 능동 규칙(active rule) 기법을 이용하여 공간 객체의 무결성 확인을 지원하기 위한 규칙 관리 시스템을 제시한다. 능동 규칙을 이용한 공간 객체의 무결성 확인은 응용 프로그래머를 무결성 확인에 대한 부담으로부터 자유롭게 할 수 있다. 본 시스템은 특정 DBMS에 종속되지 않는 독립적인 외부 시스템으로 존재하며, 능동 규칙 관리기, 규칙 베이스, 그리고 활성규칙 생성기의 3 부분으로 구성된다. 사용자가 공간 데이타베이스 응용 프로그램을 통해 공간 객체를 조작하고자 할 때, 본 시스템은 데이타베이스 트랜잭션을 단위로 조작되는 모든 공간 객체의 무결성 확인을 위해 응용 프로그램에 삽입될 무결성 제약조건 규칙들을 효율적으로 관리하는 역할을 한다.Abstract It is necessary that the integrity of spatial data shared through the spatial database system is validated and appropriately maintained, otherwise the activity of whole application system is unpredictable. Specially, the integrity of spatial data stored in public GIS has to be validated, because those data are used by various applications which make a decision on an important policy of the region and/or whole nation such as evaluation of land use, city planning, resource management, facility management, risk management/safety supervision, national defense. In this paper, we propose rule management system to support validating the integrity of spatial object, using the technique of active rule technique from active DBMS. Validating data integrity using active rules allows database application programmer to be free from a burden on validation of the data integrity. This system is an independent, external system that is not subject to specific DBMS and consists of three parts, which are the active rule manager, the rule base, and the triggered rule generator. When an user tries to manipulate spatial objects through a spatial database application program, this system serves to efficiently manage integrity rules to be inserted into the application program to validate the integrity constraints of all the spatial objects manipulated by database transactions.

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

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.1
• /
• pp.84-92
• /
• 1994

In this paper, we present a novel scheduling algorithm using the weighted interval graph. An interval graph is constructed, where an interval is a time frame of each operation. And for each operation type, we look for the maximum clique of the interval graph: the number of nodes of the maximum clique represents the number of operation that are executed concurrently. In order to minimize resource cost. we select the operation type to reduce the number of nodes of a maximum clique. For the selected operation type, an operation selected by selection rule is moved to decrease the number of nodes of a maximum clique. A selected operation among unscheduled operations is moved repeatly and assigned to a control step consequently. The proposed algorithm is applied to the pipeline and the nonpipeline data path synthesis. The experiment for examples shows the efficiency of the proposed scheduling algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.767-772
• /
• 2005

The Internet is a packet switched network which offers best-effort service, but current IP network provide enhanced services such Quality of Services, Virtual Private Network (VPN) services, Distribute Firewall and IP Security Gateways. All such services need packet classification for determining the flow. The problem is performing scalable packet classification at wire speeds even as rule databases increase in size. Therefore, this research offer packet classification algorithm that increase classifier performance when working with enlarge rules database by rearrange rule structure into Bitmap Intersection Lookup (BIL) tables. It will use packet's header field for looking up BIL tables and take the result with intersection operation by logical AND. This approach will use simple algorithm and rule structure, it make classifier have high search speed and fast updates.

• Journal of The Korean Association of Information Education
• /
• v.3 no.1
• /
• pp.116-124
• /
• 1999

Cyber education and teacher training is the distance training program which is operating in the Korea National University of Education for teachers and citizen. In this paper, we suggest a model for establishing legal basis of cyber teacher training, by analyzing laws and processing-laws in the parliament and cyber teacher training institutes. The model contain 'The Rule for Operating CTTI(Cyber Teacher Training Institute)', 'The Rule for Using CIT Systems', 'The Rule for Operation CIT'.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1858-1860
• /
• 2016

In this paper, a modified YARA software architecture that can perform pattern matching for multi-rule files is proposed. Based on a improved scanning thread algorithm, the new design reduces memory loading time of rule files for pattern matching. Therefore, the proposed architecture can reduce operation time for pattern matching while it requires an increased memory in proportion to the number of rule files.