• 한국콘텐츠학회논문지
• /
• 제13권12호
• /
• pp.680-689
• /
• 2013

최근 즐거움과 학습 효과를 동시에 제공하는 교육용 기능성 게임이 많은 주목을 받고 있다. 그러나 대부분의 교육용 게임들을 유아나 아동들을 대상으로 하고 있고, 고등 교육에서 이러한 게임을 활용하는 것은 여전히 어려운 실정이다. 반면, 본 논문은 대학생들에게 수리계획법을 가르치는데 활용할 수 있는 교육용 게임을 개발하고자 한다. 잘 알려져 있듯이, 대부분의 퍼즐 게임들은 연관된 최적화 문제로의 변형이 가능하며, 본 논문에서는 부분집합총합문제 기반 교육용 퍼즐 게임을 제안한다. 이 게임은 사용자가 퍼즐을 플레이하거나 이를 풀기 위한 수리계획모형을 작성할 수 있게 도와준다. 나아가, 사용자들은 모형 작성을 위한 적절한 안내를 제공받으며, 작성된 모형은 자동 생성된 데이터들에 의해 평가된다. 본 논문의 교육용 게임은 산업공학이나 경영과학 분야 대학생들에게 기본적인 수리계획모형을 가르치는데 특히 도움이 될 것으로 기대된다.

• Computers and Concrete
• /
• 제34권2호
• /
• pp.151-168
• /
• 2024

This research aimed to appraise the effectiveness of four optimization approaches - cuckoo optimization algorithm (COA), multi-verse optimization (MVO), particle swarm optimization (PSO), and teaching-learning-based optimization (TLBO) - that were enhanced with an artificial neural network (ANN) in predicting the bearing capacity of shallow foundations located on cohesionless soils. The study utilized a database of 97 laboratory experiments, with 68 experiments for training data sets and 29 for testing data sets. The ANN algorithms were optimized by adjusting various variables, such as population size and number of neurons in each hidden layer, through trial-and-error techniques. Input parameters used for analysis included width, depth, geometry, unit weight, and angle of shearing resistance. After performing sensitivity analysis, it was determined that the optimized architecture for the ANN structure was 5×5×1. The study found that all four models demonstrated exceptional prediction performance: COA-MLP, MVO-MLP, PSO-MLP, and TLBO-MLP. It is worth noting that the MVO-MLP model exhibited superior accuracy in generating network outputs for predicting measured values compared to the other models. The training data sets showed R² and RMSE values of (0.07184 and 0.9819), (0.04536 and 0.9928), (0.09194 and 0.9702), and (0.04714 and 0.9923) for COA-MLP, MVO-MLP, PSO-MLP, and TLBO-MLP methods respectively. Similarly, the testing data sets produced R² and RMSE values of (0.08126 and 0.07218), (0.07218 and 0.9814), (0.10827 and 0.95764), and (0.09886 and 0.96481) for COA-MLP, MVO-MLP, PSO-MLP, and TLBO-MLP methods respectively.

• Structural Engineering and Mechanics
• /
• 제75권2호
• /
• pp.175-191
• /
• 2020

In this study, multi-story structures are actively controlled using metaheuristic algorithms. The soil conditions such as dense, normal and soft soil are considered under near-fault ground motions consisting of two types of impulsive motions called directivity effect (fault normal component) and the flint step (fault parallel component). In the active tendon-controlled structure, Proportional-Integral-Derivative (PID) type controller optimized by the proposed algorithms was used to achieve a control signal and to produce a corresponding control force. As the novelty of the study, the parameters of PID controller were determined by different metaheuristic algorithms to find the best one for seismic structures. These algorithms are flower pollination algorithm (FPA), teaching learning based optimization (TLBO) and Jaya Algorithm (JA). Furthermore, since the influence of time delay on the structural responses is an important issue for active control systems, it should be considered in the optimization process and time domain analyses. The proposed method was applied for a 15-story structural model and the feasible results were found by limiting the maximum control force for the near-fault records defined in FEMA P-695. Finally, it was determined that the active control using metaheuristic algorithms optimally reduced the structural responses and can be applied for the buildings with the soil-structure interaction (SSI).

• 한국컴퓨터정보학회논문지
• /
• 제19권1호
• /
• pp.191-201
• /
• 2014

본 연구에서는 퍼즐 기반 학습에서 이루어지는 초등정보영재의 컴퓨팅적 문제 해결 접근법을 분석함으로써 퍼즐 기반 학습의 체계적 개선을 위한 시사점을 도출하고자 하였다. 이를 위해, 제약조건, 최적화, 확률, 통계, 패턴인식, 전략의 6가지 유형별 교육용 퍼즐을 구성하고 초등정보영재를 대상으로 퍼즐 기반 학습을 수행하였다. 또한 각 퍼즐 유형에 따른 학습자의 문제 해결 접근법을 확인하기 위해 사전 사후검사 결과의 정답률 및 정답자와 오답자의 문제 해결 접근법을 비교 분석하였다. 연구 결과, 각 퍼즐 유형별 빈번한 오류 발생의 원인인 몇 가지 양식 오류와 다양한 직관들을 확인하였으며, 오답자들은 '백트래킹', '동적 프로그래밍', '추상화', '모델링', '문제 축소'와 같은 컴퓨팅적 전략을 적용하지 못함으로 인해 완전한 해법에 도달하지 못한다는 것을 확인하였다. 이러한 분석 결과를 토대로 퍼즐 문제 표현 방식의 개선, 인지적 피드백의 적시 제공, 퍼즐 기반 학습 지원을 위한 웹 기반 시스템 개발 등 퍼즐 기반 학습 개선 방안을 제안하였다.

• 한국학교수학회논문집
• /
• 제25권4호
• /
• pp.375-396
• /
• 2022

본 연구에서는 2015 수학과 교육과정의 내용을 재구조화하여 새로운 교육과정을 다룰 때 학습량 적정화와 관련한 아이디어를 제공하기 위해 우리나라와 일본의 교육과정에서 차이가 있게 다루는 순환소수를 교육과정의 연계성 관점에서 살펴보고자 한다. 교육과정의 연계성은 수학 내적 연결성의 계통성과 공유성을 의미하며, 이를 바탕으로 우리나라 2015 개정 교육과정과 일본의 2017 개정 교육과정의 순환소수를 도입 시기, 내용, 다루는 방법 등을 비교하고, 두 나라의 중·고등학교 수학 교과서에서 이를 구체적으로 어떻게 다루는지 비교하였다. 연구결과, 우리나라는 무리수 개념 도입 전인 중학교 2학년에서 순환소수를 정의하고 순환소수와 유리수의 관계를 순환소수의 분수 표현으로 다루고 있었다. 반면 일본은 중학교 3학년에서 무리수를 학습한 후 순환소수의 용어를 간단히 다루고 고등학교 <수학I>에서 순환소수 개념을 다루고 <수학III> 교과목에서 극한 개념을 배울 때 유리수와 순환소수의 관계를 다루고 있었다. 이를 바탕으로 향후 교육과정 개정에서 학습량 적정화 등을 고려할 때 순환소수를 어떻게 다룰지 등에 대한 시사점을 제안하였다.

• Smart Structures and Systems
• /
• 제26권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.

• Geomechanics and Engineering
• /
• 재33권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.

• 한국광학회:학술대회논문집
• /
• 한국광학회 2003년도 하계학술발표회
• /
• 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.