• Communications for Statistical Applications and Methods
• /
• v.11 no.1
• /
• pp.21-30
• /
• 2004

Often the accuracy is not adequate as a performance measure of classifiers when costs are different for different prediction errors. ROC and cost graphs can be used in such case to compare and identify cost-sensitive classifiers. We extend ROC and cost graphs so that they can be used when more general cost matrix is given, where not only misclassifications but correct classifications also incur penalties.

• Journal of Korean Society for Quality Management
• /
• v.42 no.4
• /
• pp.633-646
• /
• 2014

Purpose: The conventional predicted MFTBF by military standard has a wide discrepancy to that of real-world operation, which leads to overstock and increase operation cost. This paper introduces a analyzing frame using operational reliability and cost data to overcome the discrepancy, and provides reliability improvement process employing the analyzing frame. Methods: This paper suggests Reliability-Cost Matrix (R-C Matrix) and Operational Reliability & Cost Index (ORCI) as a tool for reliability evaluation. Results: KOREIP(KAI's Operational Reliability Evaluation and Improvement Process) is developed employing Reliability-Cost Matrix and Operational Reliability & Cost Index. Conclusion: KOREIP provides a process and its activities based on Reliability-Cost Matrix frame. The process and activities leads reliability improvement of aerospace electronic equipments by means of categorizing and follow-up action based on the concept of frame.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.31-34
• /
• 2004

For solving multiresponse problems, a variety of loss function approaches have been proposed assuming that a cost matrix is known and fixed. However a cost matrix is also an important factor in loss function approaches, because the optimal solution is very sensitive to the cost matrix. In this paper. we propose a novel method for adjusting the cost matrix by considering the predictive ability of the estimated response models. Simulation results for the generated data set show that the proposed method is competitive with previously reported methods.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.571-579
• /
• 1999

A Macro-Star graph which has a star graph as a basic module has node symmetry, maximum fault tolerance, and hierarchical decomposition property. And, it is an interconnection network which improves a network cost against a star graph. A matrix star graph also has such good properties of a Macro-Star graph and is an interconnection network which has a lower network cost than a Maco-Star graph. In this paper, we propose a method to embed between a Macro-Star graph and a matrix star graph. We show that a Macro-Star graph MS(k, n) can be embedded into a matrix star graph MS\ulcorner with dilation 2. In addition, we show that a matrix star graph MS\ulcorner can be embedded into a Macro-Star graph MS(k,n+1) with dilation 4 and average dilation 3 or less as well. This result means that several algorithms developed in a star graph can be simulated in a matrix star graph with constant cost.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.3
• /
• pp.129-133
• /
• 2003

In this paper, we consider the robust guaranteed cost control problem for a class of uncertain neutral systems with given quadratic cost functions. The uncertainty is assumed to be norm-bounded and time-varying. The goal in this study is to design the memoryless state feedback controller such that the closed-loop system is asymptotically stable and the closed-loop cost function value is not more than a specified upper bound lot all admissible uncertainty. Some criteria for the existence of such controllers are derived based on the matrix inequality approach combined with the Lyapunov second method. A parameterized characterization of the robust guaranteed cost controllers is given in terms of the feasible solutions to the certain matrix inequalities. A numerical example is given to illustrate the proposed method.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.467-470
• /
• 1998

In this paper, we propose a matrix star graph which improves the network cost of the well-known star grah as an interconnection network. We analyze its characteristics in terms of the network parameters, such as degree, scalability, routing, and diameter. The proposed matrix star graph MS2,n has the half degrees of a star graph S2n with the same number of nodes and is an interconnection network with the properties of node symmetry, maximum fault tolerance, and recursive structure. In network cost, a matrix star graph MS2,n and a star graph S2n are about 3.5n2 and 6n2 respectively which means that the former has a better value by a certain constant than the latter has.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.1
• /
• pp.15-23
• /
• 2008

This paper considers the problem of delay-dependent guaranteed cost controller design for uncertain neutral systems with distributed delays. The system under consideration is subject to norm-bounded time-varying parametric uncertainty appearing in all the matrices of the state-space model. By constructing appropriate Lyapunov functionals and using matrix inequality techniques, a state feedback controller is designed such that the resulting closed-loop system is not only robustly stable but also guarantees an adequate level of performance for all admissible uncertainties. Furthermore, a convex optimization problem is introduced to minimize a specified cost bound. By matrix transformation techniques, the corresponding optimal guaranteed controller can be obtained by solving a linear matrix inequality. Finally, a simulation example is presented to demonstrate the effectiveness of the proposed approach.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.293-296
• /
• 1998

In this paper, we propose a matrix hypercube graph as a new topology for parallel computer and analyze its characteristics of the network parameters, such as degree, routing and diameter. N-dimensional matrix hypercube graph MH(2,n) contains 22n vertices and has relatively lower degree and smaller diameter than well-known hypercube graph. The matrix hypercube graph MH(2,n) and the hypercube graph Q2n have the same number of vertices. In terms of the network cost, defined as the product of the degree and diameter, the former has n2 while the latter has 4n2. In other words, it means that matrix hypercube graph MH(2,n) is better than hypercube graph Q2n with respect to the network cost.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.4
• /
• pp.524-532
• /
• 2005

This paper concerns delay-dependent guaranteed cost control (GCC) problem for a class of linear state-delayed systems with norm-bounded time-varying parametric uncertainties. By incorporating the free weighing matrix approach developed recently, new delay-dependent conditions for the existence of the guaranteed cost controller are presented in terms of matrix inequalities for both nominal state-delayed systems and uncertain state-delayed systems. An algorithm involving convex optimization is proposed to design a controller achieving a suboptimal guaranteed cost such that the system can be stabilized for all admissible uncertainties. Through numerical examples, it is shown that the proposed method can yield less guaranteed cost than the existing delay-dependent methods.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.11
• /
• pp.503-509
• /
• 2002

In this paper, the robust non-fragile guaranteed cost control problem is studied for a class of linear large-scale systems with uncertainties and a given quadratic cost functions. The uncertainty in the system is assumed to be norm-bounded and time-varying. Also, the state-feedback gains for subsystems of the large-scale system are assumed to have norm-bounded controller gain variations. The problem is to design a state feedback control laws such that the closed-loop system is asymptotically stable and the closed-loop cost function value is not more than a specified upper bound for all admissible uncertainties and controller gain variations. Sufficient conditions for the existence of such controllers are derived based on the linear matrix inequality (LMI) approach combined with the Lyapunov method. A parameterized characterization of the robust non-fragile guaranteed cost controllers is given in terms of the feasible solutions to a certain LMI. A numerical example is given to illustrate the proposed method.