• Title/Summary/Keyword: 상한값

Search Result 251, Processing Time 0.028 seconds

Comparison of Characteristics and Dispersion of Fasting Blood Glucose Data by Administrative Districts and Gender Difference Using the 2017 'Korean Blood Glucose Reference Standard' (2017 '한국인 혈당 참조표준'을 이용한 행정구역별 남녀별 공복 혈당 데이터의 특성 및 산포성 비교)

  • Kwon, Young-Il
    • Korean Journal of Clinical Laboratory Science
    • /
    • v.52 no.1
    • /
    • pp.28-35
    • /
    • 2020
  • This study aimed to investigate the differences in the upper and lower limits of the 95% distribution of fasting blood glucose (FBG) by age groups. We also analyzed the changes in the mean values and dispersion of the data using the Korean Blood Glucose Reference Standard raw data published by the National Health Insurance Service (NHIS). Furthermore, the trends among 16 administrative districts were analyzed and any gender differences were determined. We also assessed whether the study results correlated with the relative standard uncertainty, as published by the NHIS. On the dispersion analysis using the differences between the upper and lower limits of the 95% distribution of FBG by age group, there were significant differences across gender and administrative districts (P<0.05). The gender differences in FBG measurements, as published by the NHIS, were significant across different administrative districts and age groups (P<0.001). This confirmed the need to recalculate the blood glucose reference standards for men and women. No significant correlation was observed between the relative standard uncertainty, as published by NHIS, and the dispersion and number of measurements analyzed in this study. However, it showed a high correlation with the measured mean value (R2=0.95). Therefore, further research on the reference standard and uncertainty is needed.

Provable Security for the Skipjack-like Structure (Skipjack 구조에 대한 DC 및 LC의 안정성 증명)

  • 성재철
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.10 no.1
    • /
    • pp.13-22
    • /
    • 2000
  • 본 논문에서는 Skipjack의 변환규칙 A와 같은 반복적인 구조에 대한 차분 특성 및 선형 근사식의 확률의 상한 값을 제시하고 이를 증명한다. 즉 라운드 함수에 대한 확률의 최대 값이 p이면 15라운드 후에 p4이 됨을 보인다. 따라서 본 논문에서 고려한 구조는 현재까지 DC 및 LC에 대한 안전성을 증명할 수 있는 구조인 Feistel 구조 및 MISTY 구조와 더불어 블록 암호의 설계 방법에 대한 다양성을 제공한다.

Preliminary Design of AC/DC Converter Control System for ITER Superconducting Magnet (ITER 초전도자석 전원공급장치 제어시스템의 예비설계)

  • Suh, J.H.;Oh, J.S.;Choi, J.;Hwang, K.C.;Kang, J.B.;Lee, W.S.;Seo, E.;Kim, H.G.;kim, M.K.
    • Proceedings of the KIPE Conference
    • /
    • 2012.11a
    • /
    • pp.251-252
    • /
    • 2012
  • ITER(국제핵융합실험로) 제어시스템은 중앙제어와 Plant System으로 구성되며 CODAC, Central Interlock, Central Safety System으로 구분된다. 초전도자석에 전류를 공급하는 AC/DC 컨버터 시스템은 2상한, 4상한 구조의 전원 장치, 초기 플라즈마 발생에 필요한 Switching Network Unit, 코일에 저장된 에너지의 급속 방전을 위한 Fast Discharge Unit 및 무효 전력 보상장치로 구성된다. 4상한 전원장치는 1, 2, 4, 6대의 전원 장치가 직렬 접속되어 무효전력 발생이 최소로 하도록 제어된다. 대용량의 무효전력이 급격히 변화는 환경에서 계통 전압을 유지하기위해 무효전력보상장치는 각 전원 장치가 예측한 무효전력 값을 이용하여 제어한다. 본 논문은 ITER 전원 장치를 운전하기 위한 제어시스템의 개요와 예비설계 결과이다.

  • PDF

An Algorithm for the Singly Linearly Constrained Concave Minimization Problem with Upper Convergent Bounded Variables (상한 융합 변수를 갖는 단선형제약 오목함수 최소화 문제의 해법)

  • Oh, Se-Ho
    • Journal of the Korea Convergence Society
    • /
    • v.7 no.5
    • /
    • pp.213-219
    • /
    • 2016
  • This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

Speedup in Measuring the Effective Bottleneck Bandwidth of an End-to-End Path in Internet (인터넷에서 종단간 경로의 유효 병목 대역폭 측정 속도 개선)

  • Yoo, Han-Seung;Jang, Ju-Wook
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.2
    • /
    • pp.236-241
    • /
    • 2001
  • A new scheme is proposed to speed up a known bandwidth measuring method which employs potential bandwidth for filtering out noiscs (in cstirna60nl from time compression caused by a packet queueing ahead of two probe packets. Instead of inerementing the potential bandwidth by a fixed amount as in the original method we increase the potential bandwidth exponentially for faster convergence. To retain its filtering capability as well as its agility to adapt to new bottleneck bandwidth, each trial potential bandwidth(PB) is adjusted using MAX and MIN as upper bound and lower bound. An experiment using known bandwidths shows 45~g9% improvement in conVergence time.

  • PDF

At-site Low Flow Frequency Analysis Using Bayesian MCMC: II. Application and Comparative Studies (Bayesian MCMC를 이용한 저수량 점 빈도분석: II. 빈도분석의 적용 및 결과의 평가)

  • Kim, Sang-Ug;Lee, Kil-Seong;Kim, Kyung-Tae
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2008.05a
    • /
    • pp.1125-1128
    • /
    • 2008
  • 본 연구에서는 Bayesian MCMC 방법과 2차 근사식을 이용한 최우추정(Maximum Likelihood Estimation, MLE)방법 방법을 이용하여 낙동강 유역의 본류지점인 낙동, 왜관, 고령교, 진동지점에 대한 점 빈도분석을 수행하고 그 결과로써 불확실성을 포함한 빈도곡선을 작성하였다. 통계적 실험을 통한 두 가지 추정방법의 분석을 위하여 먼저 자료의 길이가 100인 8개의 합성 유량자료 셋을 생성하여 비교 연구를 수행하였으며, 이를 자료길이 36인 실측 유량자료의 추정결과와 비교하였다. Bayesian MCMC 방법에 의한 평균값과 2차 근사식을 이용한 취우추정방법에 의한 모드에서의 2모수 Weibull 분포의 모수 추정값은 비슷한 결과를 보였으나, 불확실성을 나타내는 하한값과 상한값의 차이는 Bayesian MCMC 방법이 2차 근사식을 이용한 취우추정방법보다 불확실성을 감소시켜 나타내는 것을 알 수 있었다. 또한 실측 유량자료를 이용한 결과, 2차 근사식을 이용한 최우추정방법의 경우 자료의 길이가 감소됨에 따라 불확실성의 범위가 합성 유량자료를 사용한 경우에 비해 상대적으로 증가되지만, Bayesian MCMC 방법의 경우에는 자료의 길이에 대한 영향이 거의 없다는 결론을 얻을 수 있었다. 그러므로 저수량 빈도분석을 수행하기 위해 충분한 자료를 확보할 수 없는 국내의 상황을 감안할 때, 위와 같은 결론으로부터 Bayesian MCMC 방법이 불확실성을 표현하는데 있어서 2차 근사식을 이용한 최우추정방법에 비해 합리적일 수 있다는 결론을 얻을 수 있었다.

  • PDF

A VSMFC Controller Design of Robot Manipulators Using Computed Torque Method (CTM을 위한 로보트 매니퓰레이터의 VSMFC 제어기 설계)

  • Park, Sei-Seung;Park, Chong-Kug
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.10
    • /
    • pp.53-59
    • /
    • 1990
  • In the control of robot manipulators, this paper presents a design of a new variable structure model following controller(VSMFC) using computed torque method (CTM). A sufficient condition for the existence of a sliding mode is derived by Lyapunov function. The reference model is a double integrators and the acceleration input consists of a proportional-derivative controller for the purpose of the stabilization of system and the desired performance. The proposed control scheme which consists of upper bounded and estimated value of each term of the manipulator of matrix inversion. Therefore the simulation results show that this controller is improved to the convergence of desired trajectories.

  • PDF

A Study on Convergence Property of Iterative Learning Control (반복 학습 제어의 수렴 특성에 관한 연구)

  • Park, Kwang-Hyun;Bien, Z. Zenn
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.38 no.4
    • /
    • pp.11-19
    • /
    • 2001
  • In this paper, we study the convergence property of iterative learning control (ILC). First, we present a new method to prove the convergence of ILC using sup-norm. Then, we propose a new type of ILC algorithm adopting intervalized learning scheme and show that the monotone convergence of the output error can be obtained for a given time interval when the proposed ILC algorithm is applied to a class of linear dynamic systems. We also show that the divided time interval is affected from the learning gain and that convergence speed of the proposed learning scheme can be increased by choosing the appropriate learning gain. To show the effectiveness of the proposed algorithm, two numerical examples are given.

  • PDF

Efficient Sampling of Graph Signals with Reduced Complexity (저 복잡도를 갖는 효율적인 그래프 신호의 샘플링 알고리즘)

  • Kim, Yoon Hak
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.2
    • /
    • pp.367-374
    • /
    • 2022
  • A sampling set selection algorithm is proposed to reconstruct original graph signals from the sampled signals generated on the nodes in the sampling set. Instead of directly minimizing the reconstruction error, we focus on minimizing the upper bound on the reconstruction error to reduce the algorithm complexity. The metric is manipulated by using QR factorization to produce the upper triangular matrix and the analytic result is presented to enable a greedy selection of the next nodes at iterations by using the diagonal entries of the upper triangular matrix, leading to an efficient sampling process with reduced complexity. We run experiments for various graphs to demonstrate a competitive reconstruction performance of the proposed algorithm while offering the execution time about 3.5 times faster than one of the previous selection methods.

Analysis of Performance Improvement of Collaborative Filtering based on Neighbor Selection Criteria (이웃 선정 조건에 따른 협력 필터링의 성능 향상 분석)

  • Lee, Soojung
    • The Journal of Korean Association of Computer Education
    • /
    • v.18 no.4
    • /
    • pp.55-62
    • /
    • 2015
  • Recommender systems through collaborative filtering has been utilized successfully in various areas by providing with convenience in searching information. Measuring similarity is critical in determining performance of these systems, because it is the criteria for the range of recommenders. This study analyzes distributions of similarity from traditional measures and investigates relations between similarities and the number of co-rated items. With this, this study suggests a method for selecting reliable recommenders by restricting similarities, which compensates for the drawbacks of previous measures. Experimental results showed that restricting similarities of neighbors by upper and lower thresholds yield superior performance than previous methods, especially when consulting fewer nearest neighbors. Maximum improvement of 0.047 for cosine similarity and that of 0.03 for Pearson was achieved. This result tells that a collaborative filtering system using Pearson or cosine similarities should not consult neighbors with very high or low similarities.