• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• pp.99-102
• /
• 1995

In this paper, we consider the stabilization problem of nonstandard singularly perturbed systems by using state feedback. Different fro the existing sequenetial designn procedures, we propose a parallel design method to construct the stabilizing controller. The method involves solving two completely independent algebraic Riccati equations.

• 한국실내디자인학회논문집
• /
• 제14권2호
• /
• pp.206-216
• /
• 2005

The purpose of this study is a development of $teaching{\cdot}learning$ program based on interior design WBI. WBI's meaning is Web Based Instruction. There can be several procedures that should be designed at the first step: Analyzing, Designing, Building, Testing, Recycling. These stages are constructed based on the theory of procedure about the computer and the $teaching{\cdot}learning$. Each stage is presented the contents of development, the contents of main, the method advantages and problem solving. These procedures and contents of development are the research method simultaneously with the result. Upon the completion of the system, it should undergo the same process continuously so that it can improve over a period of time, contribute to the interior design of students. In addition continuously repetitive requirements pop up in the phase. And it is necessary for this program try to map out a strategy developing and a policy support from university. It's very important that develop the contents of interior design from professor, students and field professor.

• 한국학교수학회논문집
• /
• 제9권1호
• /
• pp.105-120
• /
• 2006

제 7차 교육과정은 각 단계의 내용을 제대로 이해하지 못하는 학생들에게 특별보충과정을 이수하게 하고 있으나 체계적인 교육이 뒷받침이 되지 않아 수학부진아는 갈수록 증가하고 있는 추세이다. 특히 연립방정식의 경우는 실생활과 관련이 없이 단순한 문제풀이로만 배우고 있어 학생들의 문제해결력에 부정적인 영향을 미치고 있다. Schoenfeld는 Polya의 문제해결과정을 좀 더 세부적으로 분류 조사하여 문제해결에 필요한 주요 지식과 행동을 묘사하였다. 본 연구는 Schoenfeld의 주장을 바탕으로 문제해결 수행과정을 조사하기위해 2명의 학생을 대상으로 17차시로 단계별로 구성한 연구지도안을 중심으로 학생의 자원, 발견술, 통제, 신념체제를 조사하였다. 자원에서 학생은 정의에 의한 지식과 기초지식이 부족하거나 어려움에 부딪힐 때는 직관적인 지식의 활용비율이 높은 성향을 보였으나 연구가 진행됨에 따라 알고리즘 절차를 실행하기 위한 능력, 발전적이 형태인 일상적인 절차에 대한 사용비율이 높아졌고 발견술, 통제, 신념체계 영역에서도 급진적인 변화를 나타내었다.

• 대한공업교육학회지
• /
• 제31권1호
• /
• pp.86-109
• /
• 2006

이 연구의 목적은 특허청 발명교육센터의 학생 발명교육프로그램 심화과정의 고급과정을 개발하는 것이다. 기존 발명 교육의 가장 큰 문제는 문제해결 방법을 뚜렷하게 제시하지 못하는 것이었는데, 이 연구에서 개발한 발명 교육프로그램은 TRIZ를 활용하여 창의적 문제해결에 필요한 기본 개념과 문제해결 방법을 모듈화 하여 제시하고 있다. 연구의 결과를 요약 정리하면 다음과 같다. 첫째, 발명문제를 창의적 해결안으로 이끌기 위한 기본개념과 체계를 제시할 수 있었다. 둘째, 세계 우수 기업의 활용하는 TRIZ에 교육학적 관점을 적용시켜 발명 교육프로그램으로 체계화 하는 기회를 가질 수 있었다. 셋째, 학생 발명과정에서 필요로 하는 TRIZ적인 사고방법과 지식도구를 이해하고 집중적으로 활용할 수 있는 프로그램과 교재를 개발하였다. 넷째, 개발한 발명 교육프로그램을 ${\bigcirc}{\bigcirc}$공업고등학교 기능반 학생들에게 적용한 후에 설문한 결과는 다음과 같다. -학생들은 발명을 이해하는데 도움이 되었고 유익하였지만, TRIZ 기본 개념과 용어를 이해하는데 어려움을 느끼었던 것으로 나타났다. -친구에게 이 발명 교육프로그램을 권하고 싶고, 그 이유는 고정관념을 극복할 수 있었고, 창의력을 신장할 수 있었으며, 생각 폭의 확대할 수 있었기 때문이라고 답하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권7호
• /
• pp.1252-1273
• /
• 2011

In Web Service Composition (WSC) area, services selection aims at selecting an appropriate candidate from a set of functionally-equivalent services to execute the function of each task in an abstract WSC according to their different QoS values. In despite of many related works, few of previous studies consider transactional constraints in QoS-aware WSC, which guarantee reliable execution of Composite Web Service (CWS) that is composed by a number of unpredictable web services. In this paper, we propose a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints. With this approach, we firstly identify building rules and the reduction method to build layer-based Directed Acyclic Graph (DAG) model which can model transactional relationships among candidate services. As such, the problem of solving global optimal QoS utility with transactional constraints in WSC can be regarded as a problem of solving single-source shortest path in DAG. After that, we present Graph-building algorithms and an optimal selection algorithm to explain the specific execution procedures. Finally, comprehensive experiments are conducted based on a real-world web service QoS dataset. The experimental results show that our approach has better performance over other competing selection approaches on success ratio and efficiency.

• Journal of applied mathematics & informatics
• /
• 제4권1호
• /
• pp.83-108
• /
• 1997

Chebysheff-Halley methods are probably the best known cubically convergent iterative procedures for solving nonlinear equa-tions. These methods however require an evaluation of the second Frechet-derivative at each step which means a number of function eval-uations proportional to the cube of the dimension of the space. To re-duce the computational cost we replace the second Frechet derivative with a fixed bounded bilinear operator. Using the majorant method and Newton-Kantorovich type hypotheses we provide sufficient condi-tions for the convergence of our method to a locally unique solution of a nonlinear equation in Banach space. Our method is shown to be faster than Newton's method under the same computational cost. Finally we apply our results to solve nonlinear integral equations appearing in radiative transfer in connection with the problem of determination of the angular distribution of the radiant-flux emerging from a plane radiation field.

• 산업경영시스템학회지
• /
• 제25권2호
• /
• pp.92-101
• /
• 2002

The Job Shop Scheduling Problem(JSSP) is concerned with schedule of m different machines and n jobs where each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. The purpose of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the large scale job shop scheduling. The proposed heuristic method is based on a Tabu Search(TS) and on a Constraint Satisfaction Technique(CST). In this paper, ILOG libraries is used to embody the job shop model, and a CST is developed for this model to generate the increased solution. Then, TS is employed to overcome the increased search time of CST on the increased problem size md to refine the next-current solution. Also, this paper presents the new way of finding neighbourhood solution using TS. On applying TS, a new way of finding neighbourhood solution is presented. Computational experiments on well known sets of MT and LA problem instances show that, in several cases, our approach yields better results than the other heuristic procedures discussed In literature.

• Structural Engineering and Mechanics
• /
• 제76권2호
• /
• pp.239-250
• /
• 2020

This paper deals with free vibration of plates with steps and internal line supports by using a modified matched interface and boundary (MMIB) method. Different kinds of interfaces caused by steps, rigid and elastic line supports and their combinations are taken into account. Detailed MMIB procedures for dealing with these different interfaces are presented. Various examples are chosen to illustrate the accuracy and convergence of MMIB method. Numerical results show that the proposed MMIB is a highly accurate and convergent approach for solving the title issue. This study will extend the application range of MMIB method.

• Structural Engineering and Mechanics
• /
• 제72권1호
• /
• pp.1-17
• /
• 2019

This paper proposes a modified matched interface and boundary (MMIB) method to analyze the free vibration of beams with various interfaces caused by steps, intermediate rigid and elastic supports, intermediate concentrated masses and spring-mass systems, etc. A new strategy is developed to determine the parameters in the iterative computation of MMIB. The MMIB procedures are established to deal with boundary conditions and various interface conditions, which overcomes the shortcoming of the traditional MIB. A number of examples are utilized to illustrate the performance of MMIB method. Numerical results indicate that the MMIB method is a highly accurate and convergent approach for solving interface problems.

• 한국경영과학회지
• /
• 제17권3호
• /
• pp.67-78
• /
• 1992

MODM (multiobjective decision-making) problem is very complex system for the analyst. The problem is more complex if the goals of each of the objective functions are expressed imprecisely. It requires suitable MODM method to deal with imprecisions. Therefore, we present a new interactive fuzzy decision making method for solving multiobjective nonlinear programming problems by assuming that the decision maker (DM) has imprecise goals that assume fuzzy linguistic variable for each of the objective functions. The imprecise goals of the DM are quantified by eliciting corresponding membership functions through the interactive with the DM out of six membership functions. After determining membership functions, in order to generate the compromise or satisficing solution which is .lambda.-pareto optimal, .lambda.-max problem is solved. The higher degree of membership is chosen to satisfy imprecise goals of all objective functions by combining the membership functions. Then, the values are the compromise or satisficing solution. On the basis of the proposed method, and interactive computer programming is written to implement man-machine interactive procedures. Our programming is a revised version of sequential unconstrained minimization technique. Finally, a numerical example illustrates various aspects of the results developed in this paper.