• Title/Summary/Keyword: real-world problem

Search Result 729, Processing Time 0.031 seconds

Exploration of Teaching Method through Analysis of Cases of Mathematical Modeling in Elementary Mathematics (수학적 모델링 사례 분석을 통한 초등 수학에서의 지도 방안 연구)

  • Kim, Min-Kyeong;Hong, Jee-Yun;Kim, Eun-Kyung
    • The Mathematical Education
    • /
    • v.48 no.4
    • /
    • pp.365-385
    • /
    • 2009
  • Recently, mathematical modeling has been attractive in that it could be one of many efforts to improve students' thinking and problem solving in mathematics education. Mathematical modeling is a non-linear process that involves elements of both a treated-as-real world and a mathematics world and also requires the application of mathematics to unstructured problem situations in real-life situation. This study provides analysis of literature review about modeling perspectives, case studies about mathematical modeling, and textbooks from the United States and Korea with perspective which mathematical modeling could be potential and meaningful to students even in elementary school. Further, teaching method with mathematical modeling was investigated to see the possibility of application to elementary mathematics classroom.

  • PDF

Cost Relaxation Method to Escape from a Local Optimum of the Traveling Salesman Problem (외판원문제에서 국지해를 탈출하기 위한 비용완화법)

  • Kwon, Sang-Ho;Kim, Sung-Min;Kang, Maing-Kyu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.30 no.2
    • /
    • pp.120-129
    • /
    • 2004
  • This paper provides a simple but effective method, cost relaxation to escape from a local optimum of the traveling salesman problem. We would find a better solution if we repeat a local search heuristic at a different initial solution. To find a different initial solution, we use the cost relaxation method relaxing the cost of arcs. We used the Lin-Kernighan algorithm as a local search heuristic. In experimental result, we tested large instances, 30 random instances and 34 real world instances. In real-world instances, we found average 0.17% better above the optimum solution than the Concorde known as the chained Lin-Kernighan. In clustered random instances, we found average 0.9% better above the optimum solution than the Concorde.

Overlapped Subband-Based Independent Vector Analysis

  • Jang, Gil-Jin;Lee, Te-Won
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.1E
    • /
    • pp.30-34
    • /
    • 2008
  • An improvement to the existing blind signal separation (BSS) method has been made in this paper. The proposed method models the inherent signal dependency observed in acoustic object to separate the real-world convolutive sound mixtures. The frequency domain approach requires solving the well known permutation problem, and the problem had been successfully solved by a vector representation of the sources whose multidimensional joint densities have a certain amount of dependency expressed by non-spherical distributions. Especially for speech signals, we observe strong dependencies across neighboring frequency bins and the decrease of those dependencies as the bins become far apart. The non-spherical joint density model proposed in this paper reflects this property of real-world speech signals. Experimental results show the improved performances over the spherical joint density representations.

Efficient Genetic Algorithm for Resource Constrained Project Scheduling Problem (자원 제약이 있는 프로젝트 스케줄링을 위한 효율적인 유전알고리즘)

  • Lee, Sang-Wook
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.6
    • /
    • pp.59-66
    • /
    • 2011
  • Resource constrained project scheduling problem with multiple resource constraints as well as precedence constraints is well-known as one of the NP-hard problem. Since these problems can't be solved by the deterministic method during reasonable time, the heuristics are generally used for getting a sub-optimal during reasonable time. In this paper, we introduce an efficient genetic algorithm for resource constrained project scheduling problem using crossover which is applying schema theory and real world tournament selection strategy. Experimental results showed that the proposed algorithm is superior to conventional algorithm.

Pre-service Teachers' Noticing in Peer Evaluation of Mathematical Problem Posing: Focusing on permutation and combination (동료의 문제 만들기 과제를 평가하는 과정에서 나타난 예비교사의 주목하기: 순열과 조합을 중심으로)

  • Shin, Dongjo
    • Journal of the Korean School Mathematics Society
    • /
    • v.24 no.1
    • /
    • pp.19-38
    • /
    • 2021
  • The purpose of this study is to examine pre-service teachers' noticing when evaluating peers' mathematical problem posing tasks. To this end, 46 secondary pre-service teachers were asked to create real-world problems related to permutation and combination and randomly assigned to evaluate peers' problems. As a result, the pre-service teachers were most likely to notice the difficulty of their peers' mathematics problems. In particular, the pre-service teachers tended to notice particular conditions in order to increase the difficulty of a problem. In addition, the pre-service teachers noticed the clarity of a question and its solution, novelty of the problem, the natural connection between real-world contexts and mathematical concepts, and the convergence between mathematical concepts.

Univector Field Method based Multi-Agent Navigation for Pursuit Problem

  • Viet, Hoang Huu;An, Sang-Hyeok;Chung, Tae-Choong
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.12 no.1
    • /
    • pp.86-93
    • /
    • 2012
  • This paper presents a new approach to solve the pursuit problem based on a univector field method. In our proposed method, a set of eight agents works together instantaneously to find suitable moving directions and follow the univector field to pursue and capture a prey agent by surrounding it from eight directions in an infinite grid-world. In addition, a set of strategies is proposed to make the pursuit problem more realistic in the real world environment. This is a general approach, and it can be extended for an environment that contains static or moving obstacles. Experimental results show that our proposed algorithm is effective for the pursuit problem.

Technology Trends in Digital Twins for Smart Cities (스마트 도시 실현을 위한 디지털 트윈 기술 동향)

  • Chang, Y.S.;Jang, I.S.
    • Electronics and Telecommunications Trends
    • /
    • v.36 no.1
    • /
    • pp.99-108
    • /
    • 2021
  • Digital twins are digital replicas of objects and systems in the real world. These digital replicas in a virtual environment can be connected with smart sensors and a variety of analyses, and simulations of real-time data from these sensors enable effective the operation, rapid feedback, and future predictions of real world phenomena. Until now, digital twins have been adopted and used mainly in the field of manufacturing, especially for smart factories. As digital twins are expected to be useful not only for productivity improvement but also for social problem solving, it is predicted that they will be extended to other fields such as those of transportation and cities. Digital twins will especially help realize smart cities through real-time monitoring, operation, and predictions using virtual digital twin cities. This paper summarizes the trends in digital twins for smart cities, the concept of digital twins, their application to smart cities, the strategies of various countries, and the development status of companies.

Reconstruction and application of reforming textbook problems for mathematical modeling process (수학적 모델링 과정을 반영한 교과서 문제 재구성 예시 및 적용)

  • Park, SunYoung;Han, SunYoung
    • The Mathematical Education
    • /
    • v.57 no.3
    • /
    • pp.289-309
    • /
    • 2018
  • There has been a gradually increasing focus on adopting mathematical modeling techniques into school curricula and classrooms as a method to promote students' mathematical problem solving abilities. However, this approach is not commonly realized in today's classrooms due to the difficulty in developing appropriate mathematical modeling problems. This research focuses on developing reformulation strategies for those problems with regard to mathematical modeling. As the result of analyzing existing textbooks across three grade levels, the majority of problems related to the real-world focused on the Operating and Interpreting stage of the mathematical modeling process, while no real-world problem dealt with the Identifying variables stage. These results imply that the textbook problems cannot provide students with any chance to decide which variables are relevant and most important to know in the problem situation. Following from these results, reformulation strategies and reformulated problem examples were developed that would include the Identifying variables stage. These reformulated problem examples were then applied to a 7th grade classroom as a case study. From this case study, it is shown that: (1) the reformulated problems that included authentic events and questions would encourage students to better engage in understanding the situation and solving the problem, (2) the reformulated problems that included the Identifying variables stage would better foster the students' understanding of the situation and their ability to solve the problem, and (3) the reformulated problems that included the mathematical modeling process could be applied to lessons where new mathematical concepts are introduced, and the cooperative learning environment is required. This research can contribute to school classroom's incorporation of the mathematical modeling process with specific reformulating strategies and examples.

A Study on the Real - time Search Algorithm based on Dynamic Time Control (동적 시간제어에 기반한 실시간 탐색 알고리즘에 관한 연구)

  • Ahn, Jong-Il;Chung, Tae-Choong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2470-2476
    • /
    • 1997
  • We propose a new real-time search algorithm and provide experimental evaluation and comparison of the new algorithm with mini-min lookahead algorithm. Many other real-time heuristic-search approached often divide the problem space to several sub-problems. In this paper, the proposed algorithm guarantees not only the sub-problem deadline but also total deadline. Several heuristic real-time search algorithms such as $RTA^{\ast}$, SARTS and DYNORA have been proposed. The performance of such algorithms depend on the quality of their heuristic functions, because such algorithms estimate the search time based on the heuristic function. In real-world problem, however, we often fail to get an effective heuristic function beforehand. Therefore, we propose a new real-time algorithm that determines the sub-problem deadline based on the status of search space during sub-problem search process. That uses the cut-off method that is a dynamic stopping-criterion-strategy to search the sub-problem.

  • PDF

Reinforcement Learning Control using Self-Organizing Map and Multi-layer Feed-Forward Neural Network

  • Lee, Jae-Kang;Kim, Il-Hwan
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.142-145
    • /
    • 2003
  • Many control applications using Neural Network need a priori information about the objective system. But it is impossible to get exact information about the objective system in real world. To solve this problem, several control methods were proposed. Reinforcement learning control using neural network is one of them. Basically reinforcement learning control doesn't need a priori information of objective system. This method uses reinforcement signal from interaction of objective system and environment and observable states of objective system as input data. But many methods take too much time to apply to real-world. So we focus on faster learning to apply reinforcement learning control to real-world. Two data types are used for reinforcement learning. One is reinforcement signal data. It has only two fixed scalar values that are assigned for each success and fail state. The other is observable state data. There are infinitive states in real-world system. So the number of observable state data is also infinitive. This requires too much learning time for applying to real-world. So we try to reduce the number of observable states by classification of states with Self-Organizing Map. We also use neural dynamic programming for controller design. An inverted pendulum on the cart system is simulated. Failure signal is used for reinforcement signal. The failure signal occurs when the pendulum angle or cart position deviate from the defined control range. The control objective is to maintain the balanced pole and centered cart. And four states that is, position and velocity of cart, angle and angular velocity of pole are used for state signal. Learning controller is composed of serial connection of Self-Organizing Map and two Multi-layer Feed-Forward Neural Networks.

  • PDF