• Proceedings of the Korea Water Resources Association Conference
• /
• 2022.05a
• /
• pp.236-236
• /
• 2022

연속적인 하천의 유량을 추정하기 위해서는 관측된 수위값을 유량으로 변환하기 위해 일반적으로 수위-유량 관계 곡선을 사용하며 수위구간 별로 일대일 관계로 제시된다. 그러나 유량을 추정함에 있어서 수위 외에도 하상경사, 조도계수와 같은 지형인자, 시간에 따른 유량의 변화와 같은 흐름요소를 모두 고려하여야 정확한 유량을 산정할 수 있다. 즉, 평상시에는 적합한 수준의 유량을 추정할 수 있다고 하더라도 조석의 영향이 있는 구간이나 홍수와 같이 시간에 따른 수위와 유량이 급변하는 경우에는 관측값과 수위-유량관계곡선을 이용한 추정값의 차이가 상당히 증가하여 유량 추정값의 활용이 부적합할 수 있다. 따라서 본 연구에서는 수위-유량관계곡선식의 적용이 어려운 조건에서 보다 정확한 유량을 추정하기 위해 1차원 유동해석모델을 이용한 계산 값과 관측 값과의 비교를 통해 정확도를 검토하고, 지점에 따라 차이가 발생되는 원인을 정성적으로 분석하고자 한다. 대상지점은 강우, 식생 등의 영향으로 수위와 유량의 관계를 단일 관계로 표현하기 어려워 구간분리가 발생된 지점으로 선정하였다. 흐름해석은 기지의 기점수위 조건으로부터 시작하며, 모델링을 통해 유량과 조도계수를 동시에 추정하였다. 분석 결과, 모델 내에서도 수위와 유량 관계의 루프형 특성, 조도계수의 변화를 대체적으로 잘 반영하는 것으로 나타났으며, 국내하천에서 유량추정의 정확도를 저하시키는 주된 원인에 대해 추정할 수 있었다. 향후 이 같은 방법을 통해 도출된 결과를 기반으로 수위-유량관계곡선의 불확실성을 평가하고, 유량 추정방식의 보완이 필요한 지점을 선별하는 기준에 대한 가이드라인을 제시할 수 있을 것으로 기대된다.

• Journal of Korea Water Resources Association
• /
• v.45 no.4
• /
• pp.419-430
• /
• 2012

Due to the calculation difficulty on the hydraulic and hydrologic analysis for road drainage facilities design, these analysis techniques are not applicable. This study's result are development of minutely rainfall-intensity equation suitable for road drainage area, verification of rainfall-runoff model joining kinematic wave theory for road drainage area, computational model based GUI for road surface drainage facilities spacing and culvert's size decision and various road drainage channel design. Applicable test on the developed model is proceed, result that in case of road surface dranage facilities spacing is narrower 6~65% than present spacing calculation method, in other case of road cross dranage facilities size is bigger 6~140% than present size decision method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.2
• /
• pp.1010-1019
• /
• 2014

This study applied an original survey of an objective National Health Nutriment Research. It picked the youth up from 14 years old to 19 years old and examined an influence relationship of four heads such as DT, DI, DMFT, DMFI which investigated in heads of dental inspections based on an intake frequency questionnaire by food group. It was proved that Korean dietary culture which eats rice and kimchi as staple food had an great effect on DT, DI, DMFT, DMFI And rice and cereals, fruits and vegetables like a cabbage turned out to be factors that can lower dental caries. The dental caries can be reduced by the more intake frequency of rice. And also, intake of fish like anchovy and meats like pork and beef can reduce development of dental caries too. Especially, the larger intake frequency of carbonated drinks and fast food such as hamburger and pizza can make a growth of dental caries.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.288-288
• /
• 2023

도로, 철도 등의 횡단통로, 오폐수관로, 지하배수관 등 연약지반에서 상재하중과 부등침하에 의한 파괴 위험을 줄이기 위해 구조적인 안전성과 내구성이 개선된 다양한 관로들이 활용되고 있다. 관은 매설특성에 따라 콘크리트관, 도관, 합성수지관, 덕타일 주철관, 파형강관, 유리섬유 강화 플라스틱과 폴리에스테르수지 콘크리트관 등의 종류로 구분된다(환경부, 2017). 수리설계 시 이러한 관의 단면 규모 결정 및 흐름 특성을 파악하기 위해 관수로 유량측정에 이용되는 Manning의 경험식을 이용하고 있으며, 관로의 주요 재질에 따른 다양한 조도계수가 제시되어 있다. 새로운 재질을 이용하여 제작된 관은 수리실험을 통해 조도계수를 결정하는 것이 바람직하지만, 조도계수 실험은 대규모의 실험시설과 유량공급이 요구되기 때문에 여러 한계가 있다. PE관의 경우, 미국의 ASTM 표준에 의해 저밀도 폴리에틸렌(LDPE), 선형 저밀도 폴리에틸렌(LLDPE), 고밀도 폴리에틸렌(HDPE) 등으로 분류되는데 본 연구에서는 HDPE 재질의 서로 직경이 다른 다중벽관 PE관을 대상으로 조도계수를 결정하기 위한 현장 실규모 수리실험을 수행하였다. 본 실험에서는 식생, 수로의 불규칙성, 수로노선, 침전과 세굴, 장애물, 계절적 변화, 부유물질과 소류사는 무시되며 표면조도, 관의 크기와 형상, 수위와 유량이 조도계수에 영향을 미치는 주요 인자라고 할 수 있다. 수리실험은 실물모형(Prototype)으로 한국농어촌공사 농어촌연구원의 대형수리모형실험장에서 수행되었으며. 길이 24 m, 직경 150 mm의 PE 관은 고정식 개수로, 직경 800 mm의 관은 대형유사순환수로에 각각 설치되었다. 관로의 전면에 차폐막을 설치하여 상류부 수위를 안정시킨 상태에서 실험을 수행하였고, 차폐막으로부터 하류방향으로 약 7 m(측정기준지점), 11 m, 13 m, 15 m, 17 m 떨어진 곳에서 각각 수위와 유속을 측정하였다. 실험 결과, φ150관은 직경대비 수심이 클수록 조도계수가 감소하는 경향이 나타났고, φ800관은 직경대비 수심의 변화에 따른 조도계수의 경향이 크게 드러나지 않았다. 결론적으로 PE관의 조도계수는 수심별로 변화하는 것으로 나타났으며, 특정 수심을 지나면 조도계수가 다시 감소할 것으로 판단된다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.117-128
• /
• 2001

In order to achieve optimal retrieval, i.e., to find the best match to a query according to a certain similarity measure, the exhaustive search should be performed literally for all the images in a database. However, the straightforward exhaustive search algorithm is computationally expensive in large image databases. To reduce its heavy computational cost, this paper presents a fast exhaustive multi-resolution search algorithm based on image database clustering. Firstly, the proposed algorithm partitions the whole image data set into a pre-defined number of clusters having similar feature contents. Next, for a given query, it checks the lower bound of distances in each cluster, eliminating disqualified clusters. Then, it only examines the candidates in the remaining clusters. To alleviate unnecessary feature matching operations in the search procedure, the distance inequality property is employed based on a multi-resolution data structure. The proposed algorithm realizes a fast exhaustive multi-resolution search for either the best match or multiple best matches to the query. Using luminance histograms as a feature, we prove that the proposed algorithm guarantees optimal retrieval with high searching speed.

• Journal of the Korean School Mathematics Society
• /
• v.3 no.1
• /
• pp.189-200
• /
• 2000

The purpose of this thesis is that the students understand the sentence stated math problems closely related to the real life and adapted the right solving strategies try to find the solution to a problem. The following research problem were proposed. 1. How repeated thinking lessons develop the understanding of problems and influence the usage of correct problem solving strategies and extensions of problem solving. 2. There are how much differences of achievement for each type of sentence stated problems by using comparative analysis of upper class, intermediate class, and lower class for each level between the experimental and comparative classes. In order to conduct this research the classes were divided into three different level - upper class, intermediate class and lower class. Each level include an experimental class and a comparative class. The two classes (experimental class and comparative class) of the same level were tested on the basis of class division record with the experimental class repeated learning papers for two weeks were used to guide the fixed thinking algorism for each sentence stated math problems. Eight common problems were chosen from a variety of textbooks : number calculation problems, velocity-distance-time problems, the density of a mixture, benefit problems, distribution problems, problems about working, ratio problems, the length of a figure problems. After conducting this research experiment The differences in achievement level between the experimental class and comparative class, were compared and analyzed through achievement tests made from the achievement test papers with seven problems, which were worth seventy points (total score). The conclusions of this thesis are as follows: Firstly, leaning activities through the usage of repeated learning papers for each level class produce an even development of achievement level especially in the case of the upper class learners, they have particular differences (between experimental class and comparative class) compared to the intermediate level and lower classes. Secondly, according to the analysis about achievement development each problems, learners easily accept the strategies of solution through the formula setting up to the problem of velocity -distance-time, and to the density of the mixture they adapted the picture drawing strategies interestingly, However each situation requires a variety of appropriate solution strategies. Teachers will have to employ other interesting solution strategies which relate to real life.

• Journal of Korean Ophthalmic Optics Society
• /
• v.8 no.2
• /
• pp.71-76
• /
• 2003

This study was performed to survey dioptric differences between the refractive states of both eyes from 1,100 patients who were given their prescriptions in spectacles. The differences were obtained by using dioptric power matrix. The prevalence of anisometropia was 96.9% for isoanisometropia, 2.9% for simple anisometropia, 0.2% for antimetropia. Spherical anisometropia was 22.1%, cylindrical anisometropia was 10.9%, spherocylindrical anisometropia was 46.5%, and no anisometropia was 20.5%. Anisometropia was more in thirties and forties than in other groups. In distribution of only spherical diopter differences, 76.1% were less than 0.50D, 91.7% were under 1.00D, only 2.5% were over 2.00D. In cylindrical diopter differences alone, 93.3% had under 0.50D, 1.7% had more than 1.00D. In spherocylindrical anisometropia, 52.8% were less than 0.50D, 78.6% were under 1.00D, 5.1% were more than 2.00D. In axis differences, with-the-rule type was 29.9%, against-the-rule type was 29.8%, oblique type was 40.3%.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.173-184
• /
• 2002

This paper discuss an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, Kim et al. suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multidimensional index using a feature vector as indexing attributes. For query processing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verify the superiority of our approach, we perform extensive experiments. The results reveal that our approach achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.1 s.307
• /
• pp.53-66
• /
• 2006

This paper proposes the combined image retrieval system that gives the same relevance as exhaustive search method while its performance can be considerably improved. This system is combined with two different retrieval methods and each gives the same results that full exhaustive search method does. Both of them are two-stage method. One uses condensation of feature vectors, and the other uses binary-tree clustering. These two methods extract the candidate images that always include correct answers at the first stage, and then filter out the incorrect images at the second stage. Inasmuch as these methods use equal algorithm, they can get the same result as full exhaustive search. The first method condenses the dimension of feature vectors, and it uses these condensed feature vectors to compute similarity of query and images in database. It can be found that there is an optimal condensation ratio which minimizes the overall retrieval time. The optimal ratio is applied to first stage of this method. Binary-tree clustering method, searching with recursive 2-means clustering, classifies each cluster dynamically with the same radius. For preserving relevance, its range of query has to be compensated at first stage. After candidate clusters were selected, final results are retrieved by computing similarities again at second stage. The proposed method is combined with above two methods. Because they are not dependent on each other, combined retrieval system can make a remarkable progress in performance.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.4
• /
• pp.591-598
• /
• 2021

The digital phase-locked loops(DPLL) is a circuit used for phase synchronization and has been generally used in various fields such as communication and circuit fields. State estimators are used to design digital phase-locked loops, and infinite impulse response state estimators such as the well-known Kalman filter have been used. In general, the performance of the infinite impulse response state estimator-based digital phase-locked loop is excellent, but a sudden performance degradation may occur in unexpected situations such as inaccuracy of initial value, model error, and disturbance. In this paper, we propose a minimum variance finite impulse response filter with optimal horizon for designing a new digital phase-locked loop. A numerical method is introduced to obtain the measured value interval length, which is an important parameter of the proposed finite impulse response filter, and to obtain a gain, the covariance matrix of the error is set as a cost function, and a linear matrix inequality is used to minimize it. In order to verify the superiority and robustness of the proposed digital phase-locked loop, a simulation was performed for comparison and analysis with the existing method in a situation where noise information was inaccurate.