• Journal of Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.18-24
• /
• 1990

The location of inspection stations is a significant component of production systems. In this paper, a prototype expert system is designed for deciding the optimal location of inspection stations. The production system is defined as a single channel of n serial operation stations. The potential inspection station can be located after any of the operation stations. Nonconforming units are generated from a compound binomial distribution with known parameters at any given operation station. Traditionally Dynamic programming, Zero-one integer programming, or Non-linear programming techniques are used to solve this problem. However a problem with these techniques is that the computation time becomes prohibitively large when t be number of potential inspection stations are fifteen or more. An expert system has the potential to solve this problem using a rule-based system to determine the near optimal location of inspection stations. This prototype expert system is divided into a static database, a dynamic database and a knowledge base. Based on defined production systems, the sophisticated rules are generated by the simulator as a part of the knowledge base. A generate-and-test inference mechanism is utilized to search the solution space by applying appropriate symbolic and quantitative rules based on input data. The goal of the system is to determine the location of inspection stations while minimizing total cost.

• Industrial Engineering and Management Systems
• /
• v.4 no.1
• /
• pp.23-35
• /
• 2005

This paper aims to develop a practical finite capacity MRP (FCMRP) system based on the needs of an automotive parts manufacturing company in Thailand. The approach includes a linear goal programming model to determine the optimal start time of each operation to minimize the sum of penalty points incurred by exceeding the goals of total earliness, total tardiness, and average flow-time considering the finite capacity of all work centers and precedence of operations. Important factors of the proposed FCMRP system are penalty weights and dispatching rules. Effects of these factors on the performance measures are statistically analyzed based on a real situation of an auto-part factory. Statistical results show that the dispatching rules and penalty weights have significant effects on the performance measures. The proposed FCMRP system offers a good tradeoff between conflicting performance measures and results in the best weighted average performance measures when compared to conventional forward and forward-backward finite capacity scheduling systems.

• Korean Journal of Cognitive Science
• /
• v.4 no.2
• /
• pp.145-180
• /
• 1994

In this paper,we present an efficient morphological analysis model for Korean which produces from an input word all the feasible sequences of morphemes in the word.This model is deterministic in applying spelling rules,and has few redundant computations in processing complex and ambiguous words.This is the effect of three types of new techniques:first,a new method for interpreting speilling rules;second,predictive rule applications which restrict to the spelling rules suitable for the input word;third,the use of dynamic programming which enables the analyzer to avoid recomputing analyzed substring in case the input word is morphologically ambiguous.our model has been experimented with 413,975 word randomly selected from the corpus of Korean elementary textbooks.Experimental results show that our model guarantees fast and reliable processing.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.477-488
• /
• 2007

In recent years, numerous studies have identified and explored issues related to web-service-oriented business process specifications, such as business process execution language (BPEL). In particular, business rules are an important cross-cutting concern that should be distinguished from business process instances. In this paper, we present a rule-based aspect oriented programming (AOP) framework where business rule aspects contained in business processes can be effectively separated and executed. This is achieved by using a mechanism of the business rule itself at the business rule engine instead of using existing programming language-based AOP technologies. Through some illustrative examples, this work also introduces a method by which business rule aspects, separated through an external rule engine, can be represented and evaluated. We also demonstrate how they can be dynamically woven and executed by providing an implementation example which uses two open-source-based products, the Mandarax rules engine and Bexee BPEL engine.

• Journal of Korea Game Society
• /
• v.16 no.6
• /
• pp.143-150
• /
• 2016

Programming is a difficult meat for novices. Educatees nowadays start to play games before they first attend formal education. Serious games offer tools that may have potential to support programming trainers to become more engaged on their learning through a learn while having fun approach. This paper aims to design and implement serious game for programming education. Our serious game substitutes game rules and objects for elements of programming language. We will begin by describing the game mechanics, followed by the general system architecture, finalizing with a small conclusion. We also discuss the implications of our work for the development of the serious game that support the identified features and teach programming concepts.

• Journal of Computing Science and Engineering
• /
• v.1 no.1
• /
• pp.56-73
• /
• 2007

Demands have been growing in safety-critical application fields for producing networked real-time embedded computing (NREC) systems together with acceptable assurances of tight service time bounds (STBs). Here a service time can be defined as the amount of time that the NREC system could take in accepting a request, executing an appropriate service method, and returning a valid result. Enabling systematic composition of large-scale NREC systems with STB certifications has been recognized as a highly desirable goal by the research community for many years. An appealing approach for pursuing such a goal is to establish a hard-real-time (HRT) component model that contains its own STB as an integral part. The TMO (Time-Triggered Message-Triggered Object) programming scheme is one HRT distributed computing (DC) component model established by the first co-author and his collaborators over the past 15 years. The TMO programming scheme has been intended to be an advanced high-level RT DC programming scheme that enables development of NREC systems and validation of tight STBs of such systems with efforts far smaller than those required when any existing lower-level RT DC programming scheme is used. An additional goal is to enable maximum exploitation of concurrency without damaging any major structuring and execution approaches adopted for meeting the first two goals. A number of previously untried program structuring approaches and execution rules were adopted from the early development stage of the TMO scheme. This paper presents new concrete justifications for those approaches and rules, and also discusses new extensions of the TMO scheme intended to enable further exploitation of concurrency in NREC system design and programming.

• Journal of Korea Water Resources Association
• /
• v.30 no.3
• /
• pp.269-278
• /
• 1997

Operating rules, the basic principle of reservoir operation, are mostly developed from maximum or minimum, mean inflow series so that those rules cannot be used in practical operating situations to estimate the expected benefits or provide the operating policies for uncertainty conditions. Many operating rules based on the deterministic method that considers all operation variables including inflows as known variables can not reflect to uncertainties of inflow variations. Explicit operating rules can be developed for improving the weakness. In this method, stochastic trend of inflow series, one of the reservoir operation variables, can be directly method, the stochastic technique was applied to develop reservoir operating rule. In this study, stochastic dynamic programming using the concepts was applied to develop optimal operating rule for the Chungju reservoir system. The developed operating rules are regarded as a practical usage because the operating policy is following up the basic concept of Lag-1 Markov except for flood season. This method can provide reservoir operating rule using the previous stage's inflow and the current stage's beginning storage when the current stage's inflow cannot be predicted properly.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.3
• /
• pp.141-149
• /
• 2008

Most functional programming languages allows programmers to write ambiguous rules, under the strategy that pattern-matching will be performed in a direction of 'from top to bottom' way. While providing programmers with convenience and intuitive understanding of defining default rules, such ambiguous rules may make the semantics of functional languages unclear. More specifically, it may fail to apply the equational reasoning, one of most significant advantage of functional programming, and may cause to obscure finding a formal way of translating functional languages into the ${\lambda}$-calculus; as a result, we only get an ad hoc translation. In this paper, we associate with separability of term rewriting systems, holding purely-declarative property, pattern-matching semantics of lazy functional languages. Separability can serve a formalism for translating lazy functional languages into the ${\lambda}$-calculus.

• Management Science and Financial Engineering
• /
• v.12 no.1
• /
• pp.127-142
• /
• 2006

In this paper, we present a frequency reassignment problem (FRP) that arises when we add new base stations to resolve hot-spots or to expand the coverage of a code division multiple access (CDMA) network. For this problem, we develop an integer programming (IP) model along with some valid inequalities and preprocessing rules. Also, we develop an effective heuristic procedure that solves two sub-problems induced from the original problem in repetition. Computational results show that the proposed heuristic procedure finds a feasible solution of good quality within reasonable computation time. Also, the lower bound by-produced from the heuristic procedure is quite strong.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.5
• /
• pp.624-629
• /
• 1998

Evolutionary computation techniques can solve search problems using simulated evolution based on the ‘survival of the fittest’. Recently, the genetic programming (GP) which evolves computer programs using the genetic algorithm was introduced. In this paper, the genetic programming technique is used in order to design a rule based controller consisting of condition-action rules for an unknown system. No a priori knowledge about the structure of the controller is needed. Representation of a solution, functions and terminals in GP are analyzed, and a method of constructing a fuzzy logic controller using the obtained rule based controller is described. A simulation example using a nonlinear system shows the validity and efficiency of the proposed method.