• Title/Summary/Keyword: Realistic Problem

Search Result 546, Processing Time 0.024 seconds

Children's Realistic Response on Realistic Word Problems (현실적인 문장제에 관한 초등학생의 반응 분석)

  • 김민경
    • School Mathematics
    • /
    • v.6 no.2
    • /
    • pp.135-151
    • /
    • 2004
  • This study investigated children's realistic response on problematic word problems focused on number operations. Even though word problems and problem solving should be considered in terms of realistic context, results indicates that children's responses didn't show realistic consideration in solving problems. Also, children showed their tendency of mindless or mechanical operation in solving problems and modeling problems

  • PDF

An Algorithm for Grouping the Machines & Parts in FMS (유연생산 시스템에서의 셀 및 부품군 형성 알고리즘)

  • Moon, Chi-Ung;Lee, Sang-Yong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.18 no.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.

  • PDF

Pre-service teachers' conceptions about considering the realistic contexts in the word problems (실생활 문장제에서 현실맥락 고려에 관한 예비교사들의 인식 분석)

  • Lee, Jihyun;Yi, Gyuhee
    • The Mathematical Education
    • /
    • v.60 no.4
    • /
    • pp.509-527
    • /
    • 2021
  • We investigated whether and how pre-service teachers took the realistic contexts seriously in the course of solving word problems; additionally, we investigated how pre-service teachers evaluated students' realistic and non-realistic answers to word problems. Many pre-service teachers, similar to students, solved some of the realistic problems unrealistically without taking the realistic contexts seriously. Besides, they evaluated students' non-realistic answers higher than the realistic answers. Whether the pre-service teachers could solve problems realistically or not, they did not appreciate students' realistic considerations for the reasons that those were not fitted to the intentions of the word problems, or those were evidence of the flaws of the problem. Furthermore, the analysis of premises implied in the pre-service teachers' evaluation comments showed the implicit didactic contracts about realistic word problem solving that they accepted and also anticipated students to follow. Our analysis of the pre-service teachers' conceptions of realistic word problems can help teacher educators design the teacher program to challenge and revise pre-service teachers' folk pedagogy.

MODELS AND SOLUTION METHODS FOR SHORTEST PATHS IN A NETWORK WITH TIME-DEPENDENT FLOW SPEEDS

  • Sung, Ki-Seok;Bell, Michael G-H
    • Management Science and Financial Engineering
    • /
    • v.4 no.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.

  • PDF

A dual approach to input/output variance constrained control problem

  • Kim, Jac-Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • 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.

  • PDF

Cell Based CMFD Formulation for Acceleration of Whole-core Method of Characteristics Calculations

  • Cho, Jin-Young;Joo, Han-Gyu;Kim, Kang-Seog;Zee, Sung-Quun
    • Nuclear Engineering and Technology
    • /
    • v.34 no.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.

An Efficient Feature Point Extraction and Comparison Method through Distorted Region Correction in 360-degree Realistic Contents

  • Park, Byeong-Chan;Kim, Jin-Sung;Won, Yu-Hyeon;Kim, Young-Mo;Kim, Seok-Yoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.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.

Development of a Planning System for the Routing and Scheduling of Vehicles in Pickup and Delivery Services (수배송 서비스를 위한 운송계획 최적화 시스템 개발)

  • Choi, Ji-Young;Lee, Tae-Han;Lim, Jae-Min
    • IE interfaces
    • /
    • v.19 no.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.

Realistic Rainfall Effect Algorithm Comparison and Analysis (사실적인 비 내리는 효과 알고리즘 비교 및 분석)

  • Seo, Taeuk;Sung, Mankyu
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.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.

An Efficient Feature Point Extraction Method for 360˚ Realistic Media Utilizing High Resolution Characteristics

  • Won, Yu-Hyeon;Kim, Jin-Sung;Park, Byuong-Chan;Kim, Young-Mo;Kim, Seok-Yoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.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.