• Title/Summary/Keyword: 반복계산

Search Result 1,444, Processing Time 0.034 seconds

Effect of Highly Water Absorbing Polymer(K-sorb) on Soil Water Retention (토양의 수분보유(水分保有)에 미치는 초흡수성 고분자중합체(高分子重合體)(K-sorb)의 효과)

  • Yoo, Sun-Ho;Kwun, Sun-Kuk;Ro, Hee-Myeong
    • Korean Journal of Soil Science and Fertilizer
    • /
    • v.23 no.3
    • /
    • pp.173-179
    • /
    • 1990
  • The effect of a highly water absorbing polyacrylate polymer, commonly called K-sorb, at rates of 0.0, 0.05, 0.2, and 0.5% by weight on the water retention properties of three soils, and the longevities of these treatment effects were evaluated. Water retentions were measured for all the treatments by use of a pressure-plate extractor in the laboratory. Available water and three-phase distributions at moisture tensions of 0.01, 0.3, and 15b were calculated from water retentivity data. A randomized block experiment of Chinese cabbages was conducted to examine the effects and the longevities of the treatments(0.0, 0.05, 0.1, and 0.2%) on water retention of Jungdong sandy loam soil in the field. Water retentions for a loamy sand, sandy loam, and loam soil, treated with 0.2 and 0.5% K-sorb, were increased. K-sorb treatments were more effective in sandy soil than in loamy soils. Water contents for the 0.5% treatment were markedly greater than those for the 0.2% treatment at earth moisture tension. K-sorb only at a rate of 0.5% remained effective in water retention of each soil through repeated drying and wetting for 12 months. Duncan's multiple range showed 0.2% treatment was effective(at the level of 0.05) after 2 months but not after 10 months under field condition.

  • PDF

Preliminary Research on the Implementation of Information of Human Facial Part Required for the 3D Printing of Eye Shield (안구차폐체 제작에 필요한 안면부 3차원 정보 구현의 기초연구)

  • Choi, Seokyoon
    • Journal of the Korean Society of Radiology
    • /
    • v.13 no.7
    • /
    • pp.955-960
    • /
    • 2019
  • The Computed tomography (CT) scan can have high radiation in a few tests, and this risk is significant given that it is often repeated in one patient. In children, the incidence of radiation-induced cancer is reported because organs are growing, are more sensitive to radiation. 3D printing has recently been studied to be applied to various applications as a research field for 3D printing applications, research on fabrication of radiation shields and materials has been conducted. The purpose of the 3D printer is to replace the existing panel-type shields and to make customized designs according to the shape of the human body. Therefore, research on 3D information processing to be input to the 3D printer is also necessary. In this study, 3D data of the human body surface, which is the preliminary step of the manufacture of patient-specific eye shield using stereo vision depth map technology, was studied. This study aims to increase the possibility of three-dimensional output. As a result of experimenting with this method, which is relatively simple compared with other methods of 3D information processing, the minimum coordinates for 3D information are extracted. The results of this study provided the advantages and limitations of stereo images using natural light and will be the basic data for the manufacture of eye shields in the future.

A Computer Graphics Program for 2-Dimensional Strut-tie Model Design of Concrete Members (콘크리트 구조부재의 2차원 스트럿-타이 모델 설계를 위한 컴퓨터 그래픽 프로그램)

  • Yun, Young Mook
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.37 no.3
    • /
    • pp.531-539
    • /
    • 2017
  • The strut-tie model approach has been recognized as an efficient methodology for the design of all types of concrete members with D-regions, and the approach has been accepted in design codes globally. However, the design of concrete members with the approach requires many iterative numerical structural analyses, numerous graphical calculations, enormous times and efforts, and designer's subjective decisions in terms of the development of appropriate strut-tie model, determination of required areas of struts and ties, and verification of strength conditions of struts and nodal zones. In this study, a computer graphics program, that enables the design of concrete members efficiently and professionally by overcoming the forementioned limitations of the strut-tie model approach, is developed. In the computer graphics program, the numerical programs that are essential in the strut-tie model analysis and design of concrete members including finite element analysis programs for the plane truss and solid problems with all kinds of boundary conditions, a program for automatic determination of effective strengths of struts and nodal zones, and a program for graphical verification of developed strut-tie model's appropriateness by displaying various geometrical shapes of struts and nodal zones, are loaded. Great efficiency and convenience during the application of the strut-tie model approach may be provided by the various graphics environment-based functions of the proposed program.

Error factors and uncertainty measurement for determinations of amino acid in beef bone extract (사골농축액 시료 중에 함유된 아미노산 정량분석에 대한 오차 요인 및 측정불확도 추정)

  • Kim, Young-Jun;Kim, Ji-Young;Jung, Min-Yu;Shin, Young-Jae
    • Analytical Science and Technology
    • /
    • v.26 no.2
    • /
    • pp.125-134
    • /
    • 2013
  • This study was demonstrated to estimate the measurement uncertainty of 23 multiple-component amino acids from beef bone extract by high performance liquid chromatography (HPLC). The sources of measurement uncertainty (i.e. sample weight, final volume, standard weight, purity, standard solution, calibration curve, recovery and repeatability) in associated with the analysis of amino acids were evaluated. The estimation of uncertainty obtained on the GUM (Guide to the expression of uncertainty in measurement) and EURACHEM document with mathematical calculation and statistical analysis. The content of total amino acids from beef bone extract was 36.18 g/100 g and the expanded uncertainty by multiplying coverage factor (k, 2.05~2.36) was 3.81 g/100 g at a 95% confidence level. The major contributors to the measurement uncertainty were identified in the order of recovery and repeatability (25.2%), sample pretreatment (24.5%), calibration-curve (24.0%) and weight of the reference material (10.4%). Therefore, more careful experiments are required in these steps to reduce uncertainties of amino acids analysis with a better personal proficiency improvement.

Multi-query Indexing Technique for Efficient Query Processing on Stream Data in Sensor Networks (센서 네트워크에서 스트림 데이터 질의의 효율적인 처리를 위한 다중 질의 색인 기법)

  • Lee, Min-Soo;Kim, Yearn-Jeong;Yoon, Hye-Jung
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.11
    • /
    • pp.1367-1383
    • /
    • 2007
  • A sensor network consists of a network of sensors that can perform computation and also communicate with each other through wireless communication. Some important characteristics of sensor networks are that the network should be self administered and the power efficiency should be greatly considered due to the fact that it uses battery power. In sensor networks, when large amounts of various stream data is produced and multiple queries need to be processed simultaneously, the power efficiency should be maximized. This work proposes a technique to create an index on multiple monitoring queries so that the multi-query processing performance could be increased and the memory and power could be efficiently used. The proposed SMILE tree modifies and combines the ideas of spatial indexing techniques such as k-d trees and R+-trees. The k-d tree can divide the dimensions at each level, while the R+-tree improves the R-tree by dividing the space into a hierarchical manner and reduces the overlapping areas. By applying the SMILE tree on multiple queries and using it on stream data in sensor networks, the response time for finding an indexed query takes in some cases 50% of the time taken for a linear search to find the query.

  • PDF

Online Multi-view Range Image Registration using Geometric and Photometric Feature Tracking (3차원 기하정보 및 특징점 추적을 이용한 다시점 거리영상의 온라인 정합)

  • Baek, Jae-Won;Moon, Jae-Kyoung;Park, Soon-Yong
    • The KIPS Transactions:PartB
    • /
    • v.14B no.7
    • /
    • pp.493-502
    • /
    • 2007
  • An on-line registration technique is presented to register multi-view range images for the 3D reconstruction of real objects. Using a range camera, we first acquire range images and photometric images continuously. In the range images, we divide object and background regions using a predefined threshold value. For the coarse registration of the range images, the centroid of the images are used. After refining the registration of range images using a projection-based technique, we use a modified KLT(Kanade-Lucas-Tomasi) tracker to match photometric features in the object images. Using the modified KLT tracker, we can track image features fast and accurately. If a range image fails to register, we acquire new range images and try to register them continuously until the registration process resumes. After enough range images are registered, they are integrated into a 3D model in offline step. Experimental results and error analysis show that the proposed method can be used to reconstruct 3D model very fast and accurately.

Improving Haskell GC-Tuning Time Using Divide-and-Conquer (분할 정복법을 이용한 Haskell GC 조정 시간 개선)

  • An, Hyungjun;Kim, Hwamok;Liu, Xiao;Kim, Yeoneo;Byun, Sugwoo;Woo, Gyun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.9
    • /
    • pp.377-384
    • /
    • 2017
  • The performance improvement of a single core processor has reached its limit since the circuit density cannot be increased any longer due to overheating. Therefore, the multicore and manycore architectures have emerged as viable approaches and parallel programming becomes more important. Haskell, a purely functional language, is getting popular in this situation since it naturally supports parallel programming owing to its beneficial features including the implicit parallelism in evaluating expressions and the monadic tools supporting parallel constructs. However, the performance of Haskell parallel programs is strongly influenced by the performance of the run-time system including the garbage collector. Though a memory profiling tool namely GC-tune has been suggested, we need a more systematic way to use this tool. Since GC-tune finds the optimal memory size by executing the target program with all the different possible GC options, the GC-tuning time takes too long. This paper suggests a basic divide-and-conquer method to reduce the number of GC-tune executions by reducing the search area by one-quarter for every searching step. Applying this method to two parallel programs, a maximally independent set and a K-means programs, the memory tuning time is reduced by 7.78 times with accuracy 98% on average.

Markov Chain Model for Synthetic Generation by Classification of Daily Precipitation Amount into Multi-State (강수계열의 상태분류에 의한 Markov 연쇄 모의발생 모형)

  • Kim, Ju-Hwan;Park, Chan-Yeong;Kang, Kwan-Won
    • Water for future
    • /
    • v.29 no.6
    • /
    • pp.179-188
    • /
    • 1996
  • The chronical sequences of daily precipitation are of great practical importance in the planning and operational processes of water resources system. A sequence of days with alternate dry day and wet day can be generated by two state Markov chain model that establish the subsequent daily state as wet or dry by previously calculated vconditional probabilities depending on the state of previous day. In this study, a synthetic generation model for obtaining the daily precipitation series is presented by classifying the precipitation amount in wet days into multi-states. To apply multi-state Markov chain model, the daily precipitation amounts for wet day are rearranged by grouping into thirty states with intervals for each state. Conditional probabilities as transition probability matrix are estimated from the computational scheme for stepping from the precipitation on one day to that on the following day. Statistical comparisons were made between the historical and synthesized chracteristics of daily precipitation series. From the results, it is shown that the proposed method is available to generate and simulate the daily precipitation series with fair accuracy and conserve the general statistical properties of historical precipitation series.

  • PDF

Operation analysis and application of modified slope-area method for the estimation of discharge in multi-function weir (다기능보의 방류량 산정 개선을 위한 운영 분석 및 수정 경사-면적법의 적용)

  • Oh, Ji-Hwan;Jang, Suk-Hwan;Oh, Kyoung-Doo
    • Journal of Korea Water Resources Association
    • /
    • v.51 no.8
    • /
    • pp.687-701
    • /
    • 2018
  • A multi-function weir is representative control structure in the stream flow. Estimation of accurate flood discharge according to gate operations and prediction of floodwave travel times at the downstream are very important in terms of water use and river management. This study analyzed the limitation and improvement through the current gate operation data on the Young-san river. in addition, flood discharge was calculated considering lower and upper water level condition and gate operating using the modified slope-area method in the Seoung-chon weir. As a result, the current state was required improvement because exceed the theoretical range and rapidly fluctuation of discharge coefficient, can not be considered difference between the upper and lower water level and the estimation by the regression equation. As a result of applying the proposed method in this study, the above mentioned limitations can be compensated, compared with the current discharge data. Also it was analyzed as more physically valid because using the evaluated hydraulic equation and estimate the slope and friction loss of natural stream by iteration and to reduce the error. In conclusion, the process carried out serves as a representative flow control point of the water system through reliable discharge estimation, it is expected that it will be possible to properly river management.

Analysis of Leaf Node Ranking Methods for Spatial Event Prediction (의사결정트리에서 공간사건 예측을 위한 리프노드 등급 결정 방법 분석)

  • Yeon, Young-Kwang
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.17 no.4
    • /
    • pp.101-111
    • /
    • 2014
  • Spatial events are predictable using data mining classification algorithms. Decision trees have been used as one of representative classification algorithms. And they were normally used in the classification tasks that have label class values. However since using rule ranking methods, spatial prediction have been applied in the spatial prediction problems. This paper compared rule ranking methods for the spatial prediction application using a decision tree. For the comparison experiment, C4.5 decision tree algorithm, and rule ranking methods such as Laplace, M-estimate and m-branch were implemented. As a spatial prediction case study, landslide which is one of representative spatial event occurs in the natural environment was applied. Among the rule ranking methods, in the results of accuracy evaluation, m-branch showed the better accuracy than other methods. However in case of m-brach and M-estimate required additional time-consuming procedure for searching optimal parameter values. Thus according to the application areas, the methods can be selectively used. The spatial prediction using a decision tree can be used not only for spatial predictions, but also for causal analysis in the specific event occurrence location.