• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2015.11a
• /
• pp.185-186
• /
• 2015

The Standard penetration test determines the type of soil according to soil bearing capacity, and this classifies the subsoil into many layers. Construction project managers are willing to know the depth of the present types of subsoil on site in order to make plans on earthwork stage during excavation. However the standard penetration test may not provide accurate information on subsoil type due to incorrect spacing. To solve this problem, this study propose a conceptual algorithm for determining the spacing of standard penetration test spots to essentially tests relevant locations on which to be applied the standard penetration test. This provides the acquirement of the accurate layered model volume of earthwork revised into geological columnar section. This algorithm will determine the appropriate standard penetration test spots spacing on a given size of site to optimize the accuracy of the earthwork volume, time and cost.

• Journal of the Korea Society for Simulation
• /
• v.9 no.2
• /
• pp.15-25
• /
• 2000

Since data security problems are very important in the information age, cryptographic algorithms for encryption and decryption have been studied for a long time. The GOST(Gosudarstvennyi Standard or Government Standard) algorithm as a data encryption algorithm with a 256-bit key is a 64-bit block algorithm developed in the former Soviet Union. In this paper, we describe how to design an encryption chip based on the GOST algorithm. In addition, the GOST algorithm is compared with the DES(Data Encryption Standard) algorithm, which has been used as a conventional data encryption algorithm, in modeling techniques and their performance. The GOST algorithm whose key size is relatively longer than that of the DES algorithm has been expanded to get better performance, modeled in VHDL, and simulated for implementation with an CPLD chip.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.4
• /
• pp.1079-1086
• /
• 2005

Most discussions of single imputation methods and the EM algorithm concern point estimation of population quantities with missing values. A second concern is how to get standard errors of the point estimates obtained from the filled-in data by single imputation methods and EM algorithm. Now we focus on how to estimate standard errors with incorporating the additional uncertainty due to nonresponse. There are some approaches to account for the additional uncertainty. The general two possible approaches are considered. One is the jackknife method of resampling methods. The other is multiple imputation(MI). These two approaches are reviewed and compared through simulation studies.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.486-490
• /
• 1993

This paper presents an improved algorithm which enables to find a suboptimal $H^{\infty}$ controller. In the $H^{\infty}$ control problem with output multiplicative uncertainty, the Glover-Doyle algorithm has sorne constraints for the standard plant. The proposed algorithm removes them by reformulating the standard plant. We show the validity of this algorithm by investigating the variation of norm-bound.d.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.376-378
• /
• 2004

Genetic algorithm was motivated by biological evaluation and has been applied to many industrial applications as a powerful tool for mathematical optimizations. In this paper, a new genetic optimization algorithm is proposed. The proposed method is based on Mendel's law, especially dominance and recessive property. Homologous chromosomes are introduced to implement dominance and recessive property compared with the standard genetic algorithm. Because of this property of suggested genetic algorithm, homologous chromosomes looks like the chromosomes for the standard genetic algorithm, so we can use most of existing genetic operations with little effort. This suggested method searches the larger solution area with the less probability of the premature convergence than the standard genetic algorithm.

• Korean Management Science Review
• /
• v.16 no.1
• /
• pp.89-99
• /
• 1999

Combat fatigues are issued to military personnel with ready made clothes. Ready made combat fatigues should be fitted to various bodies of military personnel within given standard size. This paper develops a standard sizes selection method in order to increase the coverage rate and fitness for combat fatigues. The method utilizes a generalized learning vector quantization(GLVQ) algorithm that is one of cluster algorithm in neural networks techniques. The GLVQ moves the standard sizes from initial arbitrary sizes to next sizes in order to increase more coverage rate and fitness. Finally, when it cannot increase those, algorithm is terminated. The results of this method show more coverage rate and fitness than those of the other methods.

• Research in Mathematical Education
• /
• v.24 no.1
• /
• pp.1-27
• /
• 2021

For elementary school children, learning the standard multiplication algorithm with accuracy, clarity, consistency, and efficiency is a daunting task. Nonetheless, what should be our expectation in procedural fluency, for example, in finding the product of 25 and 37 among fifth grade students? Collectively, has the mathematics education community emphasized the value of conceptual understanding to the detriment of procedural fluency? In addition to examining these questions, we survey multiplication algorithms throughout history and in textbooks and reconceptualize the standard multiplication algorithm by using a new tool called the Multiplication Aid Template.

• Journal of Elementary Mathematics Education in Korea
• /
• v.14 no.2
• /
• pp.287-314
• /
• 2010

The algorithm is a chain of mechanical procedures, capable of solving a problem. In modern mathematics educations, the teaching algorithm is performing an important role, even though contracted than in the past. The conspicuous characteristic of current elementary mathematics textbook's manner of manipulating multiplication algorithm is exceeding converge to 'standard algorithm.' But there are many algorithm other than standard algorithm in calculating multiplication, and this diversity is important with respect to didactical dimension. In this thesis, we have reconstructed the experimental learning and teaching plan of multiplication algorithm unit by making the best use of diversity of multiplication algorithm. It's core contents are as follows. Firstly, It handled various modified algorithms in addition to standard algorithm. Secondly, It did not order children to use standard algorithm exclusively, but encouraged children to select algorithm according to his interest. As stated above, we have performed teaching experiment which is ruled by new lesson design and analysed the effects of teaching experiment. Through this study, we obtained the following results and suggestions. Firstly, the experimental learning and teaching plan was effective on understanding of the place-value principle and the distributive law. The experimental group which was learned through various modified algorithm in addition to standard algorithm displayed higher degree of understanding than the control group. Secondly, as for computational ability, the experimental group did not show better achievement than the control group. It's cause is, in my guess, that we taught the children the various modified algorithm and allowed the children to select a algorithm by preference. The experimental group was more interested in diversity of algorithm and it's application itself than correct computation. Thirdly, the lattice method was not adopted in the majority of present mathematics school textbooks, but ranked high in the children's preference. I suggest that the mathematics school textbooks which will be developed henceforth should accept the lattice method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.392-394
• /
• 2003

There is a well-known simple, stable standard merge algorithm, which uses only linear time but for the price of double space. This extra space consumption has been often remarked as lack of the standard merge sort algorithm that covers a merge process as central operation. In-place merging is a way to overcome this lack and so is a topic with a long tradition of inspection in the area of theoretical computer science. We present an in-place merging algorithm that rear-ranges the elements to be merged by rotation, a special form of block interchanging. Our algorithm is novel, due to its technique of determination of the rotation-areas. Further it has a short and transparent definition. We will give a presentation of our algorithm and prove that it needs in the worst case not more than twice as much comparisons as the standard merge algorithm. Experimental work has shown that our algorithm is efficient and so might be of high practical interest.

• Journal of the Korean School Mathematics Society
• /
• v.25 no.2
• /
• pp.105-124
• /
• 2022

The contents of fraction division in textbooks are important because there were changes in situations and problem solving methods in textbooks according to the revision of the curriculum and the contents of textbooks affect students' learning directly. So, this study analyzed the achievement standards of the curriculum and formula types and situations, and the introduction process of non-standard and standard algorithms presented in Korean mathematics textbooks. The results are follows: there was little difference in the achievement standards of the curriculum, but there was a difference in the arrangement of contents by grades in textbooks. There was a difference in the types of formula according to textbooks. And the situation became more diverse; recent textbooks have changed to the direction of using the non-standard and the standard algorithm in parallel. In conclusion, I proposed categorizing rather than splitting the types of fraction division, the connection of non-standard and standard algorithm, and the need to prepare methods to pursue generalization and justification according to the common characteristics in the process of introducing standard algorithm.