• Title/Summary/Keyword: 1-point method

Search Result 5,770, Processing Time 0.039 seconds

Rapid Consolidation Test Using Inflection Point Method (변곡점법에 의한 신속 압밀시험)

  • 민덕기;황광모;최규환
    • Journal of the Korean Geotechnical Society
    • /
    • v.18 no.4
    • /
    • pp.85-93
    • /
    • 2002
  • This study presented a new method for evaluating the coefficient of consolidation by using inflection point method which was based on the fact that time factor, T corresponding to the inflection point of a semi-logarithmic plot of a time curve is fixed and equals to T = 0.405 at 70.03% consolidation. In the proposed method, as the next load increment is applied as soon as the inflection point is confirmed, the time required to identify the inflection point can be shortened. Thus, the coefficient of consolidation may be easily evaluated. The time required to complete the testing using this rapid consolidation method could be as low as 0.5~9 hours compared with 1 or 2 weeks in the case of the conventional consolidation test. For this study, we designed settlement equipment for normalization of test samples. In test results, the factors of consolidation agreed with undisturbed samples results.

Measurement and Computing Method of the Average Illuminance in Residential Areas (공동주택의 조도측정 및 평균조도 산출방법)

  • Joo, Keun-Tak;Choi, An-Seop
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.20 no.5
    • /
    • pp.1-8
    • /
    • 2006
  • The Five Point Method of KS and Four Point Method of IES are generally used to measure and compute the average illuminance in residential areas. Such methods of measurement should be used exactly according to the characteristics of the space and activities. Therefore, this study evaluated computation methods of the average illuminance in terms of comparing the measured values with simulated ones. The Five Point Method of KS is very closed to evaluate task illuminancefor appreciating activities at the center while the Four Point Method of IES is very closed to a concept of the average illuminance over the space excluding the possible maximum and minimum illuminance values.

A study on diagnosis method by chonguinyoung pulse(寸口人迎脈診) based on 《Youngchu·Kyoungmaek 靈樞·經脈》 (《영추(靈樞)·경맥(經脈)》의 촌구인영맥진(寸口人迎脈診)에 관(關)한 연구(硏究))

  • Sin, Kwang-Sun;Jang, Jun-Hyuk;Yoon, Jong-Hwa
    • Journal of Acupuncture Research
    • /
    • v.19 no.1
    • /
    • pp.203-209
    • /
    • 2002
  • Objective : The chonguinyoung pulse diagnosis method is convenient than twelve meridian pulse diagnosis method The $\ll$Maek-bup(脉法)$\gg$ are founded at Mawangtweo(馬王堆) of the han dynasty tomb in 1973, but it could diagnosis the exsitance of illness of twelve meridian also . Methods : In accordance to $\ll$Naekuoung(內經)$\gg$ inyoungmaek(人迎脈) in could be taken at the which is the pulse point of carotid artery on the line of foot yangmyoung stomach meridian (足陽明胃經) and chongumaek (寸口脈) at the taeyoun acu-point (太淵穴) pulse point on the line of hand taeyeun lung meridian (手太陰肺經). Results : Chonguinyoung pulse diagnosis method could be emphased on the point of diagnosing sick person and healthy person by the balance of yin (陰) yan (陽) composition in the body. Conclusion : Chonguinyoung pulse diagnosis method could be the indication of improvement and progress of disease also it could be adapt to diagnosis of twelve meridian and it is impossible to making choice of acupuncture, medication, moxibustion, vene-section and strengthing-eleminating treatment method (補瀉方法).

  • PDF

Dippy Time Dependence of Transmittance Edge and Half Point in the UV cut lens' manufacture (UV 차단렌즈의 제작에서 광 투과율 Edge 및 Half Point의 Dippy 시간의존성)

  • Kim, Yong-Geun
    • Journal of Korean Ophthalmic Optics Society
    • /
    • v.6 no.1
    • /
    • pp.101-105
    • /
    • 2001
  • It was measured the transmittance and the reflectance by tie dip method using the UV cut lens' UV solution. The half point and the edge wavelength of the transmittance were wry well applied to the eqution of a dip time dependence. $$W=W_0+A_1{e}{x}{p}[-(x-x_1)/t_1]$$ The half point wavelength of the transmittance shifted from 358 nm to 408 nm and the edge wavelength moved from 340 nm to 398 nm. The more dip time had long the less intensity of main reflectance peak-380 nm was small and shifted to long wavelength regions. And the component peak of UV solution began to show in dip time-10 min.

  • PDF

Image Scale Prediction Using Key-point Clusters on Multi-scale Image Space (다중 스케일 영상 공간에서 특징점 클러스터를 이용한 영상스케일 예측)

  • Ryu, kwon-Yeal
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.19 no.1
    • /
    • pp.1-6
    • /
    • 2018
  • In this paper, we propose the method to eliminate repetitive processes for key-point detection on multi-scale image space. The proposed method detects key-points from the original image, and select a good key-points using the cluster filters, and create the key-point clusters. And it select reference objects by using direction angles of the key-point clusters, predict the scale of the original image by using the distributed distance ratio. It transform the scale of the reference image, and apply the detection of key-points to the transformed reference image. In the results of the experiment, the proposed method can be found to improve the key-points detection time by 75 % and 71 % compared to SIFT method and scaled ORB method using the multi-scale images.

Distinctive point extraction and recognition algorithm for counters for the various kinds of bank notes

  • Joe, Yong-won;An, Eung-seop;Lee, Jae-kang;Kim, Il-hwan
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.90.1-90
    • /
    • 2002
  • Counters for the various kinds of bank notes require high-speed distinctive point extraction and recognition for notes. In this paper we propose a new point extraction and recognition algorithm for bank notes. For distinctive point extraction we use a coordinate data extraction method from specific parts of a bank note representing the same color. The recognition algorithm uses a back-propagation neural network that has coordinate data input. The proposed algorithm is designed to minimize recognition time.

  • PDF

Errors in Potentiometric End-Point of Redox Titrations Determined by Zero Second Derivative Method (산화환원 전위차적정에 있어 수치미분법으로 얻은 영 2 차미분 종말점의 오차)

  • Q. Won Choi;Kyong Ryul Kim
    • Journal of the Korean Chemical Society
    • /
    • v.22 no.3
    • /
    • pp.128-132
    • /
    • 1978
  • The potentiometric end-point of redox titrations determined by nulling the second derivative of the titration curve by numerical differentiation method is analyzed by using an electronic digital computer. The error involved in the method is shown to be dependent on the location of the equivalence point in the titrant addition increment that encompasses the latter. The error increases as the equivalence point moves away from the mid-point of the increment toward a maximum value that is as great as a half of the increment. Therefore, when the numerical differentiation method is used to null the second derivative, the end-point should be compared with the steepest point of the titration curve or diluted titrant should be used in the vicinity of the end-point.

  • PDF

A Study on Change-Points in System Reliability

  • Kwang Mo Jeong
    • Communications for Statistical Applications and Methods
    • /
    • v.1 no.1
    • /
    • pp.10-19
    • /
    • 1994
  • We study the change-point problem in the context of system reliability models. The maximum likelihood estimators are obtained based on the Jelinski and Moranda model. To find the approximate distribution of the change-point estimator, we suggest of parametric bootstrap method in which the estimators are substituted in the assumed model. Through an example we illustrate the proposed method.

  • PDF

A primal-dual log barrier algorithm of interior point methods for linear programming (선형계획을 위한 내부점법의 원문제-쌍대문제 로그장벽법)

  • 정호원
    • Korean Management Science Review
    • /
    • v.11 no.3
    • /
    • pp.1-11
    • /
    • 1994
  • Recent advances in linear programming solution methodology have focused on interior point methods. This powerful new class of methods achieves significant reductions in computer time for large linear programs and solves problems significantly larger than previously possible. These methods can be examined from points of Fiacco and McCormick's barrier method, Lagrangian duality, Newton's method, and others. This study presents a primal-dual log barrier algorithm of interior point methods for linear programming. The primal-dual log barrier method is currently the most efficient and successful variant of interior point methods. This paper also addresses a Cholesky factorization method of symmetric positive definite matrices arising in interior point methods. A special structure of the matrices, called supernode, is exploited to use computational techniques such as direct addressing and loop-unrolling. Two dense matrix handling techniques are also presented to handle dense columns of the original matrix A. The two techniques may minimize storage requirement for factor matrix L and a smaller number of arithmetic operations in the matrix L computation.

  • PDF