• 대한수학교육학회지:학교수학
• /
• 제6권2호
• /
• pp.135-151
• /
• 2004

수학교과서의 대부분을 차지하고 있는 문장제가 실생활 상황을 반영하여 제시되기보다는 문제에서 주어진 숫자와 연산의 기계적인 조합을 통해 문제를 해결하게 하는 경향으로 나타나는 문제점은 계속해서 지적되어 왔다. 이는 수학교육이 지향하고 추구하고 있는 실제적 상황에서의 문제 해결력 함양을 위해서 간과할 수 없는 지적이라고 보여진다. 이에 본 연구에서는 초등학생을 대상으로 이전에 보아왔던 정형화되어 있는 문제들보다는 현실적인 상황을 고려한 문장제에 대해 그들이 얼마나 현실적인 측면을 고려하여 반응하는지 파악하고자 하였다. 이를 위한 문항들은 덧셈, 뺄셈, 곱셈, 나눗셈을 포함한 연산과 올림의 개념을 내포하는 문제들로 이루어졌다. 그 결과, 대부분의 초등학생들이 현실적인 문장제에 대해 현실성을 고려하여 문제를 해결하지 못하는 것으로 나타났다.

• 대한산업공학회지
• /
• 제18권2호
• /
• pp.123-130
• /
• 1992

The group formation problem of the machine and part in Flexible Manufacturing System (FMS) is a very important issue in planning stage of FMS. This paper discusses the problem of machine-part group formation. The purpose of the study is to develop a heuristic algorithm, which can handle more realistic machine-part group formation problem by considering manufacturing factors. A new similarity coeffecient has been developed to solve more realistic machine-part group formation problem. For the purpose of illustations, a numerical example is presented.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제60권4호
• /
• pp.509-527
• /
• 2021

이 연구는 예비교사들을 대상으로 1) 실생활 문장제의 해결 과정에서 현실맥락을 예민하게 고려하는지, 2) 교사 입장에서 문제의 현실맥락을 예민하게 고려한/고려하지 않은 학생 응답을 어떻게 평가하는지를 조사하였다. 예비교사들 역시 학생들과 마찬가지로 일부 실생활 문장제에 대하여 현실맥락을 예민하게 고려하지 않았으며, 현실맥락을 예민하게 생각하지 않은 채 전형적인 풀이를 적용한 학생 응답을 현실맥락에 예민하게 반응한 답보다 높이 평가하였다. 예비교사 자신이 문제 해결 과정에서 현실맥락을 예민하게 고려했던 경우와 아니었던 경우 모두 학생의 현실맥락 고려를 문제 의도에 부합하지 않는다는 점에서 혹은 문제 오류의 증거로 긍정적으로 수용하지 않았다. 예비교사들의 학생 응답에 대한 평가의견에 내포된 전제로부터 예비교사들이 수용했으며 실생활 문장제의 교수 학습 상황과 학생들에게 기대한 암묵적인 교수학적 계약을 구체적으로 관찰할 수 있었다. 실생활 문장제에 대한 예비교사들의 인식을 탐색한 본 연구의 결과는 예비교사들이 실생활 문장제에 대해 가지고 있는 통상 교수학에 도전하고 수정할 수 있는 교사 교육 프로그램의 개발에 기여할 수 있을 것이다.

• Management Science and Financial Engineering
• /
• 제4권2호
• /
• pp.1-13
• /
• 1998

The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
• /
• pp.28-33
• /
• 1994

An optimal controller, e.g. LQG controller, may not be realistic in the sense that the required control power may not be achieved by existing actuators, and the measured output is not satisfactory. To be realistic, the controller should meet such constraints as sensor or actuator limitation, performance limit, etc. In this paper, the lnput/Output Variance Constrained (IOVC) control problem will be considered from the viewpoint of mathematical programming. A dual version shall be developed to solve the IOVC control problem, whose objective is to find a stabilizing control law attaining a minimum value of a quadratic cost function subject to the inequality constraint on each input and output variance for a stabilizable and detectable plant. One approach to the constrained optimization problem is to use the Kuhn-Tucker necessary conditions for the optimality and to seek an optimal point by an iterative algorithm. However, since the algorithm uses only the necessary conditions, the convergent point may not be optimal solution. Our algorithm will guarantee a sufficiency.

• Nuclear Engineering and Technology
• /
• 제34권3호
• /
• pp.250-258
• /
• 2002

This Paper is to apply the well-established coarse mesh finite difference(CMFD) method to the method of characteristics(MOC) transport calculation as an acceleration scheme. The CMFD problem is first formulated at the pin-cell level with the multi-group structure To solve the cell- based multi-group CMFD problem efficiently, a two-group CMFD formulation is also derived from the multi-group CMFD formulation. The performance of the CMFD acceleration is examined for three test problems with different sizes including a realistic quarter core PWR problem. The CMFD formulation provides a significant reduction in the number of ray tracings and thus only about 9 ray tracing iterations are enough for the realistic problem. In computing time, the CMFD accelerated case is about two or three times faster than the coarse-mesh rebalancing(CMR) accelerated case.

• 한국컴퓨터정보학회논문지
• /
• 제24권1호
• /
• pp.93-100
• /
• 2019

One of critical issues in dealing with 360-degree realistic contents is the performance degradation in searching and recognition process since they support up to 4K UHD quality and have all image angles including the front, back, left, right, top, and bottom parts of a screen. To solve this problem, in this paper, we propose an efficient search and comparison method for 360-degree realistic contents. The proposed method first corrects the distortion at the less distorted regions such as front, left and right parts of the image excluding severely distorted regions such as upper and lower parts, and then it extracts feature points at the corrected region and selects the representative images through sequence classification. When the query image is inputted, the search results are provided through feature points comparison. The experimental results of the proposed method shows that it can solve the problem of performance deterioration when 360-degree realistic contents are recognized comparing with traditional 2D contents.

• 산업공학
• /
• 제19권3호
• /
• pp.202-213
• /
• 2006

In this paper, we develop a planning system for the routing and scheduling of vehicles in pickup and delivery service such as door-to-door parcel service. Efficient routing and scheduling of vehicles is very important in pickup and delivery service. The routing and scheduling problem is a variation of vehicle routing problem which has various realistic constraints. We develop a heuristic algorithm based on tabu search to solve the routing and scheduling problem. We develop a routing and scheduling system installed the algorithm as a planning engine. The system manage the basic data and uses GIS data to make a realistic route plan.

• 한국멀티미디어학회논문지
• /
• 제22권1호
• /
• pp.99-109
• /
• 2019

Realistic rendering of natural phenomena is a difficult problem. Many environmental factors must be considered to simulate this phenomenon. At the same time, we need to think about their computational complexity to be simulated with computer algorithm One of the most difficult problems in creating weather conditions is the rain. To simulate realistic rainy scene, you have to consider the physical properties of rain and the environmental where the rain is falling down as well. In this paper, we survey the modeling and rendering techniques for realistic rainfall scenes from three different aspects. First, we list up techniques for modeling raindrop dynamics. Second, we survey the rendering techniques that render the raindrop in the environment. Third, we take a look at the hybrid methods that combines the rendering the modeling at the same time. For each aspect, we compare the algorithms in terms of implementation and their speciality.

• 한국컴퓨터정보학회논문지
• /
• 제24권1호
• /
• pp.85-92
• /
• 2019

In this paper, we propose a efficient feature point extraction method that can solve the problem of performance degradation by introducing a preprocessing process when extracting feature points by utilizing the characteristics of 360-degree realistic media. 360-degree realistic media is composed of images produced by two or more cameras and this image combining process is accomplished by extracting feature points at the edges of each image and combining them into one image if they cover the same area. In this production process, however, the stitching process where images are combined into one piece can lead to the distortion of non-seamlessness. Since the realistic media of 4K-class image has higher resolution than that of a general image, the feature point extraction and matching process takes much more time than general media cases.