• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2002.05a
• /
• pp.201-204
• /
• 2002

Kansei design knowledge acquisition stage is a crucial stage in kansei designing process and kansei engineering (KE) methodology. In kansei engineering methodology, it is essential to extract design knowledge or rules on relationships between customer's kansei and product design element. We attempt to construct a more powerful melted for extracting the design rules from kansei expremental data. We constucted a kansei experiment concerning color kansei evaluation, and analyzed the sane data by both conventional quantification theory type I and rough set theory. Finally, we compared the effectiveness of both methods for extracting rules and examined the extensions of rough set theory in kansei engineering.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.101-106
• /
• 2015

This paper suggests heuristic algorithm with polynomial time complexity for rigging elections problem that can be obtain the optimal solution using linear programming. The proposed algorithm transforms the given problem into adjacency graph. Then, we divide vertices V into two set W and D. The set W contains majority distinct and the set D contains minority area. This algorithm applies divide-and-conquer method that the minority area D is include into majority distinct W. While this algorithm using simple rule, that can be obtains the optimal solution equal to linear programing for experimental data. This paper shows polynomial time solution finding rule potential in rigging elections problem.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.3
• /
• pp.324-328
• /
• 2007

An analytical framework for fuzzy modeling and control of nonlinear systems using a set of linear models is presented. Fuzzy clustering is applied on the aerodynamic coefficients of a missile to obtain an optimal number of rules in a Tagaki-Sugeno fuzzy rule-set. Next, the obtained membership functions and rule-sets are applied to a set of linear optimal controllers towards extraction of a global controller. Reported simulations demonstrate the performance, stability, and robustness of the controller.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.49-57
• /
• 1999

The fusion of fuzzy set theory and neural networks technologies have concentrated on applying neural networks to obtain the optimal rule bases of fuzzy logic system. Unfortunately, this is very hard to achieve due to limited learning capabilities of neural networks. To overcome this difficulty, we propose a new approach in which rough set theory and neuro-fuzzy fusion are combined to obtain the optimal rule base from input/output data. Compared with conventional FNN, the proposed algorithm is considerably more realistic because it reduces overlapped data when construction a rule base. This results are applied to the construction of inference rules for controlling the temperature at specified points in a refrigerator.

• Journal of Arbitration Studies
• /
• v.29 no.4
• /
• pp.57-75
• /
• 2019

In investigating how set-off defenses matter in arbitration, one should take into account that it is not permitted against the parties' will for arbitrators to rule on the disputes that are not the subject of an arbitration agreement, unless otherwise agreed upon by the parties involved, because it is considered that the parties intend to solve only the disputes which are the subject of the agreement by arbitration. Also, one should keep in mind that the parties must settle the disputes that are the subject of an arbitration agreement by arbitration when they conclude the agreement, and it is not allowed against the parties' will to resolve the disputes in other ways. The parties may agree whether the respondent can request for arbitration on the counterclaim, which is his/her claim against the claimant, and whether the respondent can raise a plea for a set-off that his/her claim against the claimant is a counter obligation. Failing on such agreement, the respondent may submit a counterclaim when his/her claim and the claimant's claim are the subject of the same arbitration agreement. The arbitral tribunal may rule on the counter obligation when the arbitration agreement, which becomes the basis for the claimant' claim, has an effect on the counter obligation. Where the claimant fails to raise an objection even after he/she becomes aware that the respondent has requested for arbitration or has raised a plea for set-off by providing his/her claim which is not the subject of the arbitration agreement as a counterclaim or a counter obligation, the arbitral tribunal may rule on the respondent's claim against the claimant. On these occasions, the arbitral tribunal has to guarantee the parties an opportunity to defend themselves by pointing out those situations. It will meet the purposes of arbitration systems to rule out the jurisdiction of the courts when the plaintiff alleges the existence of the arbitration agreement, in case the respondent raises a plea for set-off based on his/her claim which is not the subject of the arbitration agreement in the litigation procedures. However, where the plaintiff fails to allege the existence and conducts pleading in the court with regard to the counter obligation, the court must not reject the respondent's set-off defense because of the existence of the agreement.

• Korean Management Science Review
• /
• v.13 no.2
• /
• pp.25-48
• /
• 1996

Mixed Model Assembly Lines (MMALs) are increasingly used to produce differentiated products on a single assembly line without work-in-process storage, Usually, a typical MMAL consists of a number of (1) stations doing exactly the same operation on every job, (2) stations involving operations with different choices, and (3) stations offering operations that are not performed on every job, or that are performed on every job but with many options. For stations of the first type there is no sequencing problem at all. However, for the second type a set-up cost is incurred each time the operation switches from one choice to another. At the third type of stations, different models, requring different amounts and choices of assembly work, creates an uneven flow of work along the line and variations in the work load at these stations. When a subsequence of jobs requires more work load than the station can handle, it is necessary to help the operations at the station or to complete the work elsewhere. Therefore, a schedule which minimize the sum of set-up cost and utility work cost is desired. So this study has developed Fixed Random Ordering Rule (FROR), Fixed Ascending Ordering Rule (FAOR), Fixed Descending Ordering Rule, and Extended NHR (ENHR). ENHR is to choose optimal color ordering of each batch with NHR, and to decide job sequence of the batch with it, too. As the result of experiments, ENHR was the best heuristic algorithm. NHR is a new heuristic rule in which only the minimum addition of violations from both partial sequence and unassigned sequence at every branch could be considered. And this is a heuristic sequencing rule for the third type of stations at MMAL. This study developed one more heuristic algorithm to test the performance of NHR, which is named as Practical Heuristic Rule (PHR).

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.2
• /
• pp.59-68
• /
• 2016

Context-aware services recognize the context of situation environments of users and provide useful services according to the context for users. Usual rule-based systems can be used for context-aware services with the specified rules that express context information and operations. This paper proposes a light-weight rule engine that minimizes memory consumption for resource-constrained smart things. The rule engine manages rules at the minimum condition level, removes memories for intermediate rule matching results, and uses hash tables to store rules and context information efficiently. The implemented engine is verified using a rule set of a mouse training system and experiment results shows the engines consumes very little memory compared to the existing Rete algorithm with some sacrifice of execution time.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2308-2310
• /
• 2001

In the adaptive fuzzy sliding mode control, from a set of a fuzzy IF-THEN rules adaptive fuzzy sliding mode control whose parameters are adjusted on-line according to some adaptation laws is constructed for the purpose of controlling the plant to track a desired trajectory. Most of the research works in nonlinear controller design using fuzzy systems consider the affine system with fixed grid-rule structure based on system state availability. The fixed grid-rule structure makes the order of the controller big unnecessarily, hence the on-line fuzzy rule structure and fuzzy observer based adaptive fuzzy sliding mode controller is proposed to solve system state availability problems. Therefore, adaptive laws of fuzzy parameters for state observer and fuzzy rule structure are established implying whole system stability in the sense of Lyapunov.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.12
• /
• pp.41-49
• /
• 2022

Documents often contain relative time expressions, and it is important to define a schema of the relative time information and develop a system that extracts such information from corpus. In this study, to deal with the relative time expressions, we propose seven additional attributes of timex3: year, month, day, week, hour, minute, and second. We propose a way to represent normalized values of the relative time expressions such as before, after, and count, and also design a set of rules to extract the relative time information from texts. With a new corpus constructed using the new attributes that consists of dialog, news, and history documents, we observed that our rule-set generally achieved 70% accuracy on the 1,041 documents. Especially, with the most frequently appeared attributes such as year, day, and week, we got higher accuracies compared to other attributes. The results of this study, our proposed timex3 attributes and the rule-set, will be useful in the development of services such as question-answer systems and chatbots.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.11a
• /
• pp.362-366
• /
• 2007

최근 기업 경영활동의 의사결정시 사용되는 비즈니스 룰(Business Rule)을 정형화하고 하나의 시스템으로 구축하여 효과적으로 기업의 경쟁력을 제고하기 위한 노력이 다양하게 시도되고 있다. 비즈니스 룰 시스템 구축 작업의 경우 기업 내부에 비정형적으로 존재하는 비즈니스 룰을 체계적으로 관리하기 위해 BRMS(Business Rule Management System)와 같은 전문 관리 도구를 도입하나, 대부분의 경우 비즈니스 룰 리포지토리(Repository)를 단순히 기능별 혹은 업무별로 구성함으로 인해 동일한 내용의 룰이 서로 다른 룰 리포지토리에 중복 존재하게 되는 등 구조상의 문제점을 발생시킨다. 이로 인해 각 어플리케이션 간의 룰 또는 룰 세트(Rule Set) 공유 관계가 수동 관리되거나 중복 룰의 수정으로 인한 룰 세트별 버전 관리 문제 등 비즈니스 룰 리포지토리 운영의 어려움에 봉착하게 된다. 본 연구에서는 금융보험사의 룰웨어하우스 구축 사례를 통해 다양한 어플리케이션에서 참조되는 전사 수준의 비즈니스 룰 관리 아키텍처 구성 방법 및 각 방법이 지닌 장단점에 대해 분석한다. 본 연구의 결과를 토대로 다양한 어플리케이션에서 참조되고 수시로 변경되는 전사 수준의 통합 비즈니스 룰 관리 시스템 구축 방안에 대한 연구가 활성화되기를 기대한다.