• 대한수학교육학회지:학교수학
• /
• 제13권3호
• /
• pp.469-484
• /
• 2011

본 연구는 수학 학습의 정의적 영역에서 메타-정의의 개념을 구체화하고 명확히 하기 위해 메타-정의의 유형을 구분하고, 실제 사례를 보여주었다. 메타-정의는 정의의 모니터링, 감정의 평가, 감정의 조절, 정의의 활용 4가지로 구분되었고, 모니터링 후 평가, 조절, 활용이 시간적 순서로 이루어지는 것을 볼 수 있었다. 감정을 평가하고 조절하는 데 수학과 수학 학습에 대한 신념이 중요한 잣대로 작용하였으며, 메타-정의는 정의를 조절하고 학습 전략을 선정하는 등 수학 학습에서 중요한 역할을 하였다.

• 품질경영학회지
• /
• 제34권1호
• /
• pp.13-19
• /
• 2006

Data mining is a useful tool for analyzing data from different perspectives and for summarizing them into useful information. Recently, the data mining methods are applied to solving quality problems of the manufacturing processes. This paper discusses the problems of construction of a quality mining system, which is based on the various data mining methods. The quality mining system includes recipe optimization, significant difference test, finding critical processes, forecasting the yield. The contents and system of this paper are focused on the TFT-LCD manufacturing process. We also provide some illustrative field examples of the quality mining system.

• International Journal of Control, Automation, and Systems
• /
• 제5권2호
• /
• pp.212-217
• /
• 2007

A new method of designing multi-loop PID controllers is presented in this paper. By using the generalized IMC-PID method for multi-loop systems, the optimization problem involved in finding the PID parameters is efficiently simplified to find the optimum closed-loop time constant in a reduced search space. A weighted sum Mp criterion is proposed as a performance cost function to cope with both the performance and robustness of a multi-loop control system. Several illustrative examples are included to demonstrate the improved performance of the multi-loop PID controllers obtained by the proposed design method.

• International Journal of Control, Automation, and Systems
• /
• 제6권3호
• /
• pp.401-412
• /
• 2008

This paper discusses a design methodology of cooperative path planning for dynamical multi-agent systems with spatial and temporal constraints. The cooperative behavior of the multi-agent systems is specified in terms of the objective function in an optimization formulation. The path of achieving cooperative tasks is then generated by the optimization formulation constructed based on a differential flatness approach. Three scenarios of multi-agent tasking are proposed at the cooperative task planning framework. Given agent dynamics, both spatial and temporal constraints are considered in the path planning. The path planning algorithm first finds trajectory curves in a lower-dimensional space and then parameterizes the curves by a set of B-spline representations. The coefficients of the B-spline curves are further solved by a sequential quadratic programming solver to achieve the optimization objective and satisfy these constraints. Finally, several illustrative examples of cooperative path/task planning are presented.

• 대한전자공학회논문지
• /
• 제11권1호
• /
• pp.47-51
• /
• 1974

목론문은 회로망해석의 첫 과정으로 필요로 하는 주어진 회로의 수본과 보목을 구체적으로 생성하는 위상수학적방법을 연구하려고 노력했고 또한 다른 방법들과의 효률을 비교한 예를 제시했다. 이 결과는 다른 어떤 방법들보다 더욱 효률적이고 전기회로망의 위상수학적 해석에 있어서 근본적인 역할를 할 것으로 믿는다.

• 전기학회논문지
• /
• 제61권3호
• /
• pp.466-471
• /
• 2012

In this paper, we consider the problem of a robust passive filtering with low-order for discrete-time singular systems with polytopic uncertainties. A BRL(bounded real lemma) for robust passivity with a dissipativity of discrete-time uncertain singular systems is derived. A low-order robust passive filter design method is proposed by new reduced-order method and LMI(linear matrix inequality) technique on the basis of the obtained BRL. Finally, illustrative examples are presented to show the applicability of the proposed method.

• Smart Structures and Systems
• /
• 제18권5호
• /
• pp.839-864
• /
• 2016

This paper presents an efficient method for updating the structural finite element model. Model updating is performed through minimizing the difference between the recorded acceleration of a real damaged structure and a hypothetical damaged one. This is performed by updating physical parameters (module of elasticity in this study) in each step using iterative process of modified nonlinear conjugate gradient (M-NCG) and modified Broyden-Fletcher-Goldfarb-Shanno algorithm (M-BFGS) separately. These algorithms are based on sensitivity analysis and provide a solution for nonlinear damage detection problem. Three illustrative test examples are considered to assess the performance of the proposed method. Finally, it is demonstrated that the proposed method is satisfactory for detecting the location and ratio of structural damage in presence of noise.

• Journal of applied mathematics & informatics
• /
• 제38권3_4호
• /
• pp.351-373
• /
• 2020

There is an extensive literature on retrial queueing models. While a majority of the literature on retrial queueing models focuses on the retrial times to be exponentially distributed (so as to keep the state space to be of a reasonable size), a few papers deal with nonexponential retrial times but with some additional restrictions such as constant retrial rate, only the customer at the head of the retrial queue will attempt to capture a free server, 2-state phase type distribution, and finite retrial orbit. Generally, the retrial queueing models are analyzed as level-dependent queues and hence one has to use some type of a truncation method in performing the analysis of the model. In this paper we study a retrial queueing model with threshold-type policy for orbiting customers in the context of nonexponential retrial times. Using matrix-analytic methods we analyze the model and compare with the classical retrial queueing model through a few illustrative numerical examples. We also compare numerically our threshold retrial queueing model with a previously published retrial queueing model that uses a truncation method.

• 대한수학회논문집
• /
• 제25권4호
• /
• pp.629-645
• /
• 2010

A metrical common fixed point theorem proved for a pair of self mappings due to Sastry and Murthy ([16]) is extended to symmetric spaces which in turn unifies certain fixed point theorems due to Pant ([13]) and Cho et al. ([4]) besides deriving some related results. Some illustrative examples to highlight the realized improvements are also furnished.

• 대한수학회보
• /
• 제57권3호
• /
• pp.763-780
• /
• 2020

Let R be a commutative ring. An R-module M is said to be w-flat if Tor ^R₁ (M, N) is GV -torsion for any R-module N. It is known that every flat module is w-flat, but the converse is not true in general. The w-flat dimension of a module is defined in terms of w-flat resolutions. In this paper, we study the w-flat dimension of an injective w-module. To do so, we introduce and study the so-called w-copure (resp., strongly w-copure) flat modules and the w-copure flat dimensions for modules and rings. The relations between the introduced dimensions and other (classical) homological dimensions are discussed. We also study change of rings theorems for the w-copure flat dimension in various contexts. Finally some illustrative examples regarding the introduced concepts are given.