• Title/Summary/Keyword: teaching-learning based optimization

Search Result 45, Processing Time 0.018 seconds

The Analysis of Informatics Gifted Elementary Students' Computational Problem Solving Approaches in Puzzle-Based Learning (퍼즐 기반 학습에서 초등정보영재의 컴퓨팅적 문제 해결 접근법 분석)

  • Lee, Eunkyoung;Choi, JeongWon;Lee, Youngjun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.1
    • /
    • pp.191-201
    • /
    • 2014
  • The purpose of this study is to propose strategies of puzzle-based learning for Informatics gifted education through analyzing Informatics gifted elementary students' computational problem solving approaches in puzzle-based learning contexts. Six types of educational puzzles, which are constraints, optimization, probability, statistically speaking, pattern recognition, and strategy, were used in teaching 14 Informatics gifted students for 8 sessions. The results of pre and post test and each students' answers were analyzed to identify why students were not able to solve the puzzles. We also analysed what essential computational strategies are needed to solve each type of puzzles, and what students did not know in solving puzzle problems. We identified some problems caused by puzzle representation methods, and various students' intuitions that disturb puzzle solving. Also, we identified essential computational strategies to solve puzzles: backtracking, dynamic programming, abstraction, modeling, and reduction of big problem. However, students had difficulties in applying these strategies to solve their puzzle problems. We proposed the revised puzzle-based learning strategies, which is based on the improved problem representation, just-in-time cognitive feedbacks, and web-based learning system.

Comparison of Recurring Decimal Contents in Korean and Japanese Mathematics Textbooks (우리나라와 일본 수학 교과서의 순환소수 내용 비교)

  • Kim, Bumi
    • Journal of the Korean School Mathematics Society
    • /
    • v.25 no.4
    • /
    • pp.375-396
    • /
    • 2022
  • In this paper, to provide an idea for the 2022 revised mathematics curriculum by restructuring the content of the 2015 mathematics curriculum, the content elements of recurring decimals of textbooks, which showed differences in the curriculum of Korea and Japan, were analyzed. As a result of this study, in Korea, before the introduction of the concept of irrational numbers, repeating decimals were defined in the second year of middle school, and the relationship between repeating decimals and rational numbers was dealt with. In Japan, after studying irrational numbers in the third year of middle school, the terminology of repeating decimals is briefly dealt with. Then, when learning the concept of limit in the high school <Mathematics III> subject, the relationship between rational numbers and repeating decimals is dealt with. Based on the results of the study, in relation to the optimization of the amount of learning in the 2022 curriculum revision, implications for the introduction period of the circular decimal number, alternatives to the level of its content, and the teaching and learning methods were proposed.

Employing TLBO and SCE for optimal prediction of the compressive strength of concrete

  • Zhao, Yinghao;Moayedi, Hossein;Bahiraei, Mehdi;Foong, Loke Kok
    • Smart Structures and Systems
    • /
    • v.26 no.6
    • /
    • pp.753-763
    • /
    • 2020
  • The early prediction of Compressive Strength of Concrete (CSC) is a significant task in the civil engineering construction projects. This study, therefore, is dedicated to introducing two novel hybrids of neural computing, namely Shuffled Complex Evolution (SCE) and Teaching-Learning-Based Optimization (TLBO) for predicting the CSC. The algorithms are applied to a Multi-Layer Perceptron (MLP) network to create the SCE-MLP and TLBO-MLP ensembles. The results revealed that, first, intelligent models can properly handle analyzing and generalizing the non-linear relationship between the CSC and its influential parameters. For example, the smallest and largest values of the CSC were 17.19 and 58.53 MPa, and the outputs of the MLP, SCE-MLP, and TLBO-MLP range in [17.61, 54.36], [17.69, 55.55] and [18.07, 53.83], respectively. Second, applying the SCE and TLBO optimizers resulted in increasing the correlation of the MLP products from 93.58 to 97.32 and 97.22%, respectively. The prediction error was also reduced by around 34 and 31% which indicates the high efficiency of these algorithms. Moreover, regarding the computation time needed to implement the SCE-MLP and TLBO-MLP models, the SCE is a considerably more time-efficient optimizer. Nevertheless, both suggested models can be promising substitutes for laboratory and destructive CSC evaluative models.

Predicting the rock fragmentation in surface mines using optimized radial basis function and cascaded forward neural network models

  • Xiaohua Ding;Moein Bahadori;Mahdi Hasanipanah;Rini Asnida Abdullah
    • Geomechanics and Engineering
    • /
    • v.33 no.6
    • /
    • pp.567-581
    • /
    • 2023
  • The prediction and achievement of a proper rock fragmentation size is the main challenge of blasting operations in surface mines. This is because an optimum size distribution can optimize the overall mine/plant economics. To this end, this study attempts to develop four improved artificial intelligence models to predict rock fragmentation through cascaded forward neural network (CFNN) and radial basis function neural network (RBFNN) models. In this regards, the CFNN was trained by the Levenberg-Marquardt algorithm (LMA) and Conjugate gradient backpropagation (CGP). Further, the RBFNN was optimized by the Dragonfly Algorithm (DA) and teaching-learning-based optimization (TLBO). For developing the models, the database required was collected from the Midouk copper mine, Iran. After modeling, the statistical functions were computed to check the accuracy of the models, and the root mean square errors (RMSEs) of CFNN-LMA, CFNN-CGP, RBFNN-DA, and RBFNN-TLBO were obtained as 1.0656, 1.9698, 2.2235, and 1.6216, respectively. Accordingly, CFNN-LMA, with the lowest RMSE, was determined as the model with the best prediction results among the four examined in this study.

A hybrid algorithm for the synthesis of computer-generated holograms

  • Nguyen The Anh;An Jun Won;Choe Jae Gwang;Kim Nam
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2003.07a
    • /
    • pp.60-61
    • /
    • 2003
  • A new approach to reduce the computation time of genetic algorithm (GA) for making binary phase holograms is described. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are proven in computer simulation and experimentally demonstrated. Recently, computer-generated holograms (CGHs) having high diffraction efficiency and flexibility of design have been widely developed in many applications such as optical information processing, optical computing, optical interconnection, etc. Among proposed optimization methods, GA has become popular due to its capability of reaching nearly global. However, there exits a drawback to consider when we use the genetic algorithm. It is the large amount of computation time to construct desired holograms. One of the major reasons that the GA' s operation may be time intensive results from the expense of computing the cost function that must Fourier transform the parameters encoded on the hologram into the fitness value. In trying to remedy this drawback, Artificial Neural Network (ANN) has been put forward, allowing CGHs to be created easily and quickly (1), but the quality of reconstructed images is not high enough to use in applications of high preciseness. For that, we are in attempt to find a new approach of combiningthe good properties and performance of both the GA and ANN to make CGHs of high diffraction efficiency in a short time. The optimization of CGH using the genetic algorithm is merely a process of iteration, including selection, crossover, and mutation operators [2]. It is worth noting that the evaluation of the cost function with the aim of selecting better holograms plays an important role in the implementation of the GA. However, this evaluation process wastes much time for Fourier transforming the encoded parameters on the hologram into the value to be solved. Depending on the speed of computer, this process can even last up to ten minutes. It will be more effective if instead of merely generating random holograms in the initial process, a set of approximately desired holograms is employed. By doing so, the initial population will contain less trial holograms equivalent to the reduction of the computation time of GA's. Accordingly, a hybrid algorithm that utilizes a trained neural network to initiate the GA's procedure is proposed. Consequently, the initial population contains less random holograms and is compensated by approximately desired holograms. Figure 1 is the flowchart of the hybrid algorithm in comparison with the classical GA. The procedure of synthesizing a hologram on computer is divided into two steps. First the simulation of holograms based on ANN method [1] to acquire approximately desired holograms is carried. With a teaching data set of 9 characters obtained from the classical GA, the number of layer is 3, the number of hidden node is 100, learning rate is 0.3, and momentum is 0.5, the artificial neural network trained enables us to attain the approximately desired holograms, which are fairly good agreement with what we suggested in the theory. The second step, effect of several parameters on the operation of the hybrid algorithm is investigated. In principle, the operation of the hybrid algorithm and GA are the same except the modification of the initial step. Hence, the verified results in Ref [2] of the parameters such as the probability of crossover and mutation, the tournament size, and the crossover block size are remained unchanged, beside of the reduced population size. The reconstructed image of 76.4% diffraction efficiency and 5.4% uniformity is achieved when the population size is 30, the iteration number is 2000, the probability of crossover is 0.75, and the probability of mutation is 0.001. A comparison between the hybrid algorithm and GA in term of diffraction efficiency and computation time is also evaluated as shown in Fig. 2. With a 66.7% reduction in computation time and a 2% increase in diffraction efficiency compared to the GA method, the hybrid algorithm demonstrates its efficient performance. In the optical experiment, the phase holograms were displayed on a programmable phase modulator (model XGA). Figures 3 are pictures of diffracted patterns of the letter "0" from the holograms generated using the hybrid algorithm. Diffraction efficiency of 75.8% and uniformity of 5.8% are measured. We see that the simulation and experiment results are fairly good agreement with each other. In this paper, Genetic Algorithm and Neural Network have been successfully combined in designing CGHs. This method gives a significant reduction in computation time compared to the GA method while still allowing holograms of high diffraction efficiency and uniformity to be achieved. This work was supported by No.mOl-2001-000-00324-0 (2002)) from the Korea Science & Engineering Foundation.

  • PDF