• 복식문화연구
• /
• 제5권1호
• /
• pp.71-83
• /
• 1997

It is the important situation that the fashion industry is faced to enormous changes in the nation and worldwide market. To cope with this situations, it is necessary to clarify that the concept of fashion design and its process. This study was conducted as followings : 1. Fashion design is the process of problem solving including the steps of understanding problem, visualizing the image of a design concept. 2. The systematic and intuitive approach is harmonized to solve the process of fashion design. 3. The step of understanding problem is consist of the analysis of environments, the explanation of problem, the determination of purposes, the definition of problem and the visualizing the image of a design concept. 4. In the step of the visualizing the image of a design concept, the intuitive approaches can be clarifies as the importance of start, the step by step process, the determination of a design concept, the fixations of an image, the image realization through real objects, the diminution a difference between a concept and a visualizing the image and the necessity of exercises.

• 한국시뮬레이션학회논문지
• /
• 제9권3호
• /
• pp.91-102
• /
• 2000

The distribution routing problem is one of the important problems in distribution and supply center management. This research is concerned with an integrated distribution routing problem for multi-supply centers based on improved genetic algorithm and GUI-type programming. In this research, we used a three-step approach; in step 1 a sector clustering model is developed to transfer the multi-supply center problem to single supply center problems which are more easy to be solved, in step 2 we developed a vehicle routing model with time and vehicle capacity constraints and in step 3, we developed a GA-TSP model which can improve the vehicle routing schedules by simulation. For the computational purpose, we developed a GUI-type computer program according to the proposed methods and the sample outputs show that the proposed method is very effective on a set of standard test problems, and it could be potentially useful in solving the distribution routing problems in multi-supply center problem.

• 산업경영시스템학회지
• /
• 제37권3호
• /
• pp.43-50
• /
• 2014

In this paper, we deal with a single machine scheduling problems integrating with step deterioration effect and a rate-modifying activity (RMA). The scheduling problem assumes that the machine may have a single RMA and each job has the processing time of a job with deterioration is a step function of the gap between recent RMA and starting time of the job and a deteriorating date that is individual to all jobs. Based on the two scheduling phenomena, we simultaneously determine the schedule of step deteriorating jobs and the position of the RMA to minimize the makespan. To solve the problem, we propose a hybrid typed genetic algorithm compared with conventional GAs.

• 경영과학
• /
• 제26권1호
• /
• pp.65-76
• /
• 2009

The undirected Steiner tree problem in graphs is known to be NP-hard. The objective of this problem is to find a shortest tree containing a subset of nodes, called terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step. graph reduction rules eliminate useless nodes and edges which do not contribute to make an optimal solution. In the second step, a max-min ant colony optimization combined with Prim's algorithm is developed to solve the reduced problem. The proposed algorithm is tested in the sets of standard test problems. The results show that the algorithm efficiently presents very correct solutions to the benchmark problems.

• Journal of applied mathematics & informatics
• /
• 제19권1_2호
• /
• pp.33-55
• /
• 2005

The temporal discretisation of a moderate semilinear parabolic problem in an abstract setting by the two-step backward differentiation formula with variable step sizes is analysed. Stability as well as optimal smooth data error estimates are derived if the ratios of adjacent step sizes are bounded from above by 1.91.

• 한국경영과학회지
• /
• 제33권3호
• /
• pp.17-28
• /
• 2008

The Steiner arborescence problem is known to be NP-hard. The objective of this problem is to find a minimal Steiner tree which starts from a designated node and spans all given terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step, graph reduction rules eliminate useless nodes and arcs which do not contribute to make an optimal solution. In the second step. ant colony algorithm with use of Prim's algorithm is used to solve the Steiner arborescence problem in the reduced graph. The proposed method based on a two-step procedure is tested in the five test problems. The results show that this method finds the optimal solutions to the tested problems within 50 seconds. The algorithm can be applied to undirected Steiner tree problems with minor changes. 18 problems taken from Beasley are used to compare the performances of the proposed algorithm and Singh et al.'s algorithm. The results show that the proposed algorithm generates better solutions than the algorithm compared.

• 한국자동차공학회논문집
• /
• 제4권4호
• /
• pp.190-200
• /
• 1996

Step-by-step time integration methods are widely used for solving structural dynamics problem. One difficult yet critical choice an analyst must make is to decide an appropriate time step size. The choice of time step size has a significant effect on solution accuracy and computational expense. The objective of this research is to derive error estimate for newly developed time integration method and develop automatic time step size control algorithm for structural dynamics. A formula for computing error tolerance is derived based on desired period resolution. An automatic time step size control strategy is proposed based on a normalized local error estimate for the generalized-α method. Numerical examples demonstrate the developed strategy satisfies general design criteria for time step size control algorithm for dynamic problem.

• 컴퓨터교육학회논문지
• /
• 제11권2호
• /
• pp.1-12
• /
• 2008

학교의 교과 교육을 통한 창의적 문제해결능력 향상 교육은 중요하다. 특히 정보 교육은 일반적인 문제해결능력 뿐 아니라, 컴퓨터를 이용한 문제해결능력도 중요하다. 본 연구에서는 정보교육에서 요구되는 창의적 문제해결능력의 인지적 요소를 정의하고자 하였다. 정보교육에서 요구되는 창의적 문제해결능력의 인지적 요소는 문제해결능력과 창의력의 구성요소를 교차한 결과를 이용하고, 전문가 집단의 타당도를 이용해 조사하였다. '문제 이해 및 분석' 단계에 적합한 창의력 요소는 정교성, 민감성, 재구성력이 선정되었고, '문제 해결 방안 탐색' 단계에 적합한 창의력 요소는 유창성, 융통성, 독창성이 선정되었다. '문제 해결 방안 설계' 단계와 '구현' 단계에 적합한 창의력 요소는 정교성이 선정되었다. 마지막으로 '평가' 단계에 적합한 창의력 요소는 융통성, 정교성이 선정되었다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.81-84
• /
• 1997

This paper studies an active noise controller in a communication headset. The system is a two inputs(communication signal and noise signal) and single output(error signal) system. The problem is to reduce noise level sufficiently lower than communication signal to receive the communication signal clearly. The approach to this problem is in two steps. In the first step, we solve the noise rejection problem without communication signals. In this step, the problem is transformed to the robust H$_{\infty}$ regulating problem and solved using Linear Matrix Inequalities. In the second step, communication signal is introduced to the system, To verify the performance of the designed controller, a couple of experiments are performed..

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.307-321
• /
• 2004

In this paper, the unsteady Stokes problem is considered and also the pressure-correction method for the problem is described. At a fixed time level, we reduce the problem to two symmetric positive definite problems which depend on a time step parameter. Linear systems that arise from the problems are large, sparse, symmetric, positive definite and ill-conditioned as the time step tends to zero. Preconditioned problems based on an additive Schwarz method for solving the symmetric positive definite problems are derived and preconditioners are defined implicitly. It will be shown that the rate of convergence is independent of the mesh parameters as well as the time step size.