• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2015년도 추계 학술논문 발표대회
• /
• 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.

• 한국시뮬레이션학회논문지
• /
• 제9권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
• /
• 제16권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년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• 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.

• 경영과학
• /
• 제16권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.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제24권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.

• 한국초등수학교육학회지
• /
• 제14권2호
• /
• pp.287-314
• /
• 2010

알고리즘을 지도하는 전통적인 방법은 우선 '표준 알고리즘'을 완성된 형태로 제시하고 이어서 간단한 사례를 통하여 이해한 다음, 보다 일반적인 문제에 적용함으로써 표준 알고리즘을 연습하는 형태이다. 그러나 이 방법은 표준 알고리즘에 지나치게 집중되어 있다는 문제점과 함께, 학생 스스로 문제에 적합한 알고리즘을 선택하거나 알고리즘 자체를 개발하는 경험을 제공하지 못한다는 제한점을 갖고 있다. 이 논문에서는 자연수 곱셈 알고리즘의 다양성을 활용하여 학생 스스로 알고리즘을 개발하고 발명할 수 있도록 지도하는 방안을 상세하게 구안하였고, 그에 따른 교수실험을 통하여 초등학교 3학년 학생의 곱셈 알고리즘에 대한 이해 과정을 분석하였다. 그 결과는 첫째, 실험적인 지도안으로 학습한 실험반은 자리값의 원리와 분배법칙의 이해에 있어서 비교반보다 높은 성취를 보였으나, 계산 능력에 있어서는 그렇지 못했다. 둘째, 비교반은 물론 실험반에서도 표준 알고리즘의 선호도가 가장 높았으며, 실험반에서는 표준 알고리즘 다음으로 격자곱셈의 선호도가 높은 것으로 나타났다. 격자 곱셈을 교육 소재로 활용하는 것을 적극 고려할 필요가 있다. 셋째, 비례표는 그것이 가지는 이론적인 장점에도 불구하고 우리나라 초등학교 3학년 학생이 배우기에는 다소 무리가 따르는 것으로 나타났다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• 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.

• 한국학교수학회논문집
• /
• 제25권2호
• /
• pp.105-124
• /
• 2022

분수 나눗셈은 교육과정에 따른 교과서마다 문제 상황이나 해결 방법에서 변화가 있었고, 교과서 내용은 학생들의 학습에 직접 영향을 주기 때문에 중요하다. 본 연구에서는 우리나라의 최근 3개 교육과정과 그에 따른 교과서에 제시된 분수 나눗셈의 교육과정 성취기준, 수식 유형 및 문제 상황, 비표준 및 표준 알고리즘의 도입 과정을 분석하였다. 분석 결과, 교육과정 성취기준의 차이는 거의 없었으나, 교과서의 학년별 내용 제시에 변화가 있었다. 수식 유형에서는 교육과정별 교과서마다 차이가 있었고, 문제 상황은 다양해지는 변화가 나타났다. 해결 방법은 표준 알고리즘을 강조한 것에서 최근 교과서에서 비표준 알고리즘과 표준 알고리즘을 병행하는 방향으로 변화하였다. 제언으로 나눗셈 유형별로 내용을 세분화하기보다는 문제 상황별로 유목화할 수 있는 방안과 비표준 알고리즘과 표준 알고리즘의 연계 및 표준 알고리즘 도입 과정의 공통적 속성에 따라 일반화와 정당화를 추구하는 방안 마련이 필요함을 제시하였다.