• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.12
• /
• pp.2156-2164
• /
• 1997

A new formulation for the dynamic analysis of constrained multibody systems is presented in this paper. The formulation employs Kane's method along with the null space method. Kane's method reduces the dimension of equations of motion by using partial velocity matrix introduced in this study : it can improve the efficiency of the formulation. Three numerical examples are given to demonstrate the accuracy and efficiency of the formulation.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.541-547
• /
• 2000

This paper presents the closed-form forward kinematics of the 6-6 Stewart platform of planar base and moving platform. Based on algebraic elimination method and with one extra linear sensor, it first derives an 8th-degree univariate equation and then finds tentative solution sets out of which the actual solution is to be selected. In order to provide more exact solution despite the error between measured sensor value and the theoretical one, a correction method is also used. The overall procedure requires so little computation time that it can be efficiently used for realtime applications. In addition, unlike the iterative schemes e.g. Newton-Raphson, the algorithm does not require initial estimates of solution and is free of the problems that it does not converge to actual solution within limited time. The presented method has been implemented in C language and a numerical example is given to confirm the effectiveness and accuracy of the developed algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.149-159
• /
• 2005

In this study, we consider characteristics of stationary waiting times in single-server 2-node tandem queues with a finite buffer, a Poisson arrival process and deterministic service times. The system has two buffers: one at the first node is infinite and the other one at the second node is finite. We show that the sojourn time or departure process does not depend on the capacity of the finite buffer and on the order of nodes (service times), which are the same as the previous results. Furthermore, the explicit expressions of waiting times at the first node are given as a function of the capacity of the finite buffer and we are able to disclose a relationship of waiting times between under communication blocking and under manufacturing blocking. Some numerical examples are also given.

• Communications of Mathematical Education
• /
• v.8
• /
• pp.287-301
• /
• 1999

방과후 수학수업이나 현행 수학능력시험 후 고3학생의 수학지도는 그 방법과 목적이 기존의 수학교과의 내용과 운영방식과는 차별화 되야 한다. 특히 교사는 이에 대한 인식과 필요한 지식이 증대 되야 하며, 교내 방과후 영재반 또는 수학관련 동아리에서 사용할 주제의 선정과 교수법이 개발되어야한다. 주제선정은 대수, 해석영역에서 연계성이 강하게 나타나는 것이 바람직하며, 수학교육의 목표에 실질적으로 부합되어야한다. 본 논문에서 우리는 일${\cdot}$이차 다항식을 예로 제시하고자 한다. 다항식은 중학교 수학교과에서 인수분해와 전개의 대상이고 고교과정에선 접선이나 정적분의 대상이다. 우리는 일${\cdot}$이차다항식을 미분, 적분, 행렬, 그리고 벡터의 입장에서 근사(approximation)의 주체로 다루었다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.3
• /
• pp.155-162
• /
• 2012

This study proposes an integrated approach that uses both a fuzzy service FMEA (failure mode and effect analysis) and HOQ (house of quality) matrix algebra in designing and improving a service system. The fuzzy service FMEA methodology applies the customer satisfaction to the fuzzy RPN model. We fuzzify only the service satisfaction that consist in two failure factors, intangible service and tangible service, to more effectively assess the customer satisfactions on service encounters. Proposed fuzzy service satisfactions with triangle membership function are defuzzified by using the Fuzzy Inference System, and these are eventually identified the ranks on the potential fail points. HOQ matrices are constructed from cause-effect relationships. It is possible for these relationship matrix to find a linear approximation solution on the engineering attributes. Thus, in order to demonstrate how the proposed methods work, practical sample of the A/S part in S Electronic Co. provides for the ranking of the engineering attributes which has been successfully implemented.

• Korean Management Science Review
• /
• v.24 no.1
• /
• pp.25-34
• /
• 2007

In this study, we consider stationary waiting times in finite-buffer 3-node single-server queues in series with a Poisson arrival process and with either constant or non-overlapping service times. We assume that each node has a finite buffer except for the first node. The explicit expressions of waiting times in all areas of the stochastic system were driven as functions of finite buffer capacities. These explicit forms show that a system sojourn time does not depend on the finite buffer sizes, and also allow one to compute and compare characteristics of stationary waiting times at all areas under two blocking rules communication and manufacturing blocking. The goal of this study is to apply these results to an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on stationary waiting times at all nodes. Numerical examples are also provided.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.12 no.1
• /
• pp.95-102
• /
• 1999

본 연구에서는 중복되지 않는 고유치를 갖는 비비례 감쇠계의 고유치와 고유벡터의 민감도를 계산하는 새로운 방법을 제시하였다. 제안 방법에서는 (n+1)차의 대칭 행렬로 이루어진 대수방정식을 해석함으로써 n개의 자유도를 갖는 감쇠계의 고유치와 고유벡터의 설계변수에 대한 미분을 구한다. 제안 방법은 매우 간단하면서도 수치적 안정성이 보장되고 정확한 해를 주는 방법이다. 제안 방법의 검증을 위해 7자유도를 갖는 차량모델의 민감도해석을 예제에서 다루고 있다. 예제에서의 설계변수는 콘테이너의 질량으로 하였다.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.12 no.1
• /
• pp.103-109
• /
• 1999

본 연구에서는 중복 고유치를 갖는 비비례 감쇠 진동계의 고유치와 고유벡터의 민감도를 계산하는 새로운 방법을 제시하였다. 제안 방법은 매우 간단하면서도 수치적 안정성이 보장되고 정확한 해를 주는 방법이다. 제안 방법에서는 (n+m)차의 대칭 행렬로 이루어진 대수방정식을 해석함으로써 n개의 자유도를 갖는 감쇠계에 있어서 m차의 중복도를 갖는 고유치와 고유벡터의 설계변수에 대한 미분을 구한다. 제안 방법의 검증을 위해 5자유도를 갖는 단순구조물의 민감도해석을 예제에서 다루고 있다. 예제에서의 설계변수는 모델의 부분강성으로 하였다.

• School Mathematics
• /
• v.17 no.3
• /
• pp.407-421
• /
• 2015

Linear system is a basic subject matter of school mathematics courses. Even though elimination is a useful method to solve linear systems, its fundamental principles were not discussed pedagogically. The purpose of this study is to help the development of mathematical content knowledge on linear systems conceptions. To do this, various representations and translations among them were considered, and in particular, the basic principles for elimination method are analyzed geometrically. Rectangular representation is used to solve word problem treated in numbers of things in elementary mathematics and it is useful as a pre-stage to introduce elimination. Slopes and intercepts of lines associated linear equations are used to obtain the Cramer's formula and this solving method was showing the connection between algebraic and geometric procedures. Strategy deleting variables of linear systems by elementary operations is explored and associated with the movements of lines in the family of lines passing through a fixed point. The development of mathematical content knowledge is expected to enhance pedagogical content knowledges.

• Journal of Advanced Navigation Technology
• /
• v.22 no.4
• /
• pp.325-335
• /
• 2018

Limited access to state information in the design of a feedback controller has brought out a significant amount of research on the design of an output feedback controller. Despite its long endeavor to find an optimal one, it is still an open problem. Thus, we focus on the comparison of existing states of arts in the design of a static output feedback controller in terms of stability and complexity so as to find further research direction in this field. To this end, we present eight design methods in a unified presentation. We also provide the complete description of algorithms which can be applicable to any system configuration. Stability performance and complexity in terms of processing time are evaluated through numerical simulations. Simulation results show that the algebraic controller (AC) algorithm [20] has the smallest complexity while the scaling linear matrix inequality (SLMI) algorithm [18] seems to achieve the best stability in most cases with much higher complexity.