• Journal of Korean Society for Quality Management
• /
• v.36 no.3
• /
• pp.34-44
• /
• 2008

This research proposes a design method based on the statistical characteristics of the Shewhart control chart incorporated with 2 of 2 and 2 of 3 runs rules respectively. A Markov chain approach is employed in order to calculate the in-control and out-of-control average run lengths(ARL). Two different control limit coefficients for the Shewhart scheme and the runs rule scheme are derived simultaneously to minimize the out-of-control average run length subject to the reasonable in-control average run length. Numerical examples show that the statistical performance of the hybrid control scheme are superior to that of the original Shewhart control chart.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.2875-2888
• /
• 1999

In this paper we present compiler-based active rule system to efficiently maintain spatial integrity constraints in a heterogeneous, distributed environment. Specially, the prototype active rule system presented has been developed as a component of a whole middleware system called SDBC(Spatile DataBase Connectivity). Due to this reason, our active rule system is provided for heterogeneous ODBMSs in a distributed environment and used to define spatial integrity constraints using the active rules in E-C-A(Event-Condition-Action) type. Using this active rule system, an application programmer can free himself from a heavier burden on the integrity maintenance of application objects. In the compiler-based approach, active rules applicable to events raised by a database program are directly inserted into the program in a function type by the preprocessor, and then they are compiled with the application program source codes. One advantage of this approach is that there is no run-time overhead accompanied by monitoring all the database transitions when preprocessed program is executed. This active rule system also provides facilities to manage changed rules and dynamically interpret those rules at run-tuime.

• International Journal of Quality Innovation
• /
• v.4 no.2
• /
• pp.65-72
• /
• 2003

This paper mainly studies to build control charts under different alarm rule. For different alarm rule, the control limit parameters of a control chart should be changed, then some kinds of control schemes under different alarm rule were compared and the methods of calculating ARL for different control schemes were given.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.6
• /
• pp.379-385
• /
• 2006

To improve reusability and adaptation of variable components, rule-based component development has been used. Rule engines usually need additional script languages for rule expression and have difficulty in expressing complex business rules. In this paper, we propose a compiler-based rule engine for rich rule expression and improving performance. This rule engine uses Java programming language to express conditions and action parts of rules and that it can easily express complex business rules. It creates and executes condition and action objects at run time. In view of Performance, the rule engine is better than a script based rule engine. According to our experiments, our compiler-based nile engine shows 2.5 times better performance that script-based JSR 94 rule engine.

• Journal of Korean Society for Quality Management
• /
• v.32 no.1
• /
• pp.144-154
• /
• 2004

The bounded adjustment is known to be more efficient than repeated adjustment when the cost is incurred for engineering process control. The procedure of the bounded adjustment is to adjust the process when the one-step predicted deviation exceeds the adjustment limit by the amount of the prediction. In this paper, two run rules are proposed and studied In order to improve the efficiency of the traditional bounded adjustment procedure. The efficiency is studied in terms of the standardized cost through Monte Carlo simulation when the procedure is operated with and without the run rules. The adjustment procedure operated with run rules turns out to be more robust for changes in the process and cost parameters.

• The Journal of Information Technology
• /
• v.8 no.1
• /
• pp.95-112
• /
• 2005

This paper will look into the Main Substance and Some Problems of 24 hours Advance Cargo Manifest Declaration Rule, focuses on the Policy implication of Korea's and counter measures of our parties concerned about 24-hour advance vessel manifest rule. The 24-hour rule requires cargo owners to submit cargo manifest information to U.S. Customs 24 hours before vessel sailing from the final foreign port to a U.S. port. Cargo manifest information must be complete, accurate, and timely. As of February 2, 2003 manifest information can be submitted by paper or electronically. Cargo descriptions must be at a level of detail consistent with Harmonized Tariff Schedule (HTS) codes used by U.S. Customs. HTS codes are 10 digits. Electronic submissions are made via the Automated Manifest System (AMS) run by U.S. Customs.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.11a
• /
• pp.51-57
• /
• 2003

In operating distributed systems, proactive management is one of the major concerns for better quality of service and future capacity planning. In order to handle this management problem effectively, it is necessary to analyze performances of the distributed system and events generated by components in the system. This paper provides a rule-based event parsing engine for proactive management. Our event parsing engine uses object hooking-based and event-token approaches. The object hooking-based approach prepares new conditions and actions in Java classes and allows dynamically exchange them as hook objects in run time. The event-token approach allows the event parsing engine consider a proper sequence and relationship among events as an event token to trigger an action. We analyze the performance of our event parsing engine with two different implementations of rule structure; one is table-based and the other is tree-based.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.7
• /
• pp.61-69
• /
• 1997

With the vigorous researches in the character recognition, the need to recognize run-on multilingual handwritten characters is increasing to provide uses with more comfortable PUI(pen user interface) environments. In general, many intermediate word candidates word candidates are generated in run-on multilingual recognition because there is no information of ending position and linguistic kind of character. To remove unnecessary word candidates which are generated in run-on multilingual recognition, we classify them into two groups and select the best candidate among the word candidates in the group where the final characater is completed using 5 attributes. In this research, we propose a method in order to select the best one candidate. It is called WRM (Weighted ranking method). The weights are adaptively trained by LMS(Least mean square) learning rule. Results show that the abilities of decision makin gusing weights are much better than those not using weights.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.71-74
• /
• 1995

In this paper, a new PID fuzzy controller(FC) based on parallel operation of PI and PD fuzzy control is presented. First, two fuzzy rule bases are constructed by separating the linguistic control rule for PID FC into two parts : one is e-.DELTA.e part, and the other is .DELTAL.$^{2}$e-.DELTA.e part. And then two FCs employing these rule bases indivisually are synthesized and run in parallel. The incremental control input is determined by taking weighted mean of the outputs of two FCs. The proposed PID FC improves the transient response of the system and gives better performance than the conventional PI FC.

• Asia-Pacific Journal of Business
• /
• v.8 no.2
• /
• pp.1-14
• /
• 2017

Initial public offering (IPO) has been well known to be underpriced initially and under-performed in the long run. However, whether an IPO is underpriced or not strongly depends on how to measure the fair value. This paper hand collects data of IPOs newly listed in Korea market when whether IPO is overpriced or not is clearly distinguishable. The overpriced IPO refers to as the one the underwriters buy back after the listing. With the data, the paper examines that IPOs are overpriced and that the characteristics are related to the underpricing at the aftermarket dates and the performance in the long run. The data of clearly overpriced IPOs are little available from other IPO markets like US IPO market. From the data of IPOs listed under the underwriting rule of market stabilization, the results obtainable are the followings. First of all, the average initial return 70% of the underpriced IPO at the aftermarket dates is greater than the one 40% of the overpriced one. The overpriced IPOs are priced highly over the mid prices of the price bands at the pricing dates and then supported by relatively higher subscription rates of individual investors. The probit analyses moreover report that individual investors do not distinguish the overpricing of IPOs from the underpricing. These imply that the overpricing is strongly affected by the underwriting rule on the initial pricing.