• 제목/요약/키워드: k number of least time

검색결과 300건 처리시간 0.018초

중극(中極) 관원(關元) 혈입(穴位)를 이용한 전침 치료 야뇨 환아 3례 (Three cases report about enuritic children treated with electro-acupuncture on Zhongji(CV3), Guanyuan(CV4))

  • 장규태;김장현;오주영
    • 대한한방소아과학회지
    • /
    • 제19권1호
    • /
    • pp.103-115
    • /
    • 2005
  • Objectives : Nocturnal enuresis is common disorder in children and has important negative effects on the self-image and performance of children. Thus Successful treatment needed to increase self-esteem. Many studies of this symptoms were reported. But electro-acupuncture treatment not reported in Korea. Methods : We treated three cases enuretic children with different types. Their diagnosis were non-monosymptomatic primary, monosymptomatic primary, monosymptomatic secondary nocturnal enuresis. We used electro-acupuncture on Zhongji(CV3), Guanyuan(CV4) for 20 min. To investigate relapse. at least for 4 months after the end of the therapy we followed-up by telephone. Results : After treatment, diurnal urinary symptoms, such as increased frequency of urination, urgency, incontinence were dramatically improved. And the number of wet night decreased with nocturia and delayed wetting time. Compared to pre-treatment, findings, the number of wet nights decreased 80% or more. Conclusion : All of them tolerated electro-acupuncture well and kept reduction at least for 4 months follow-up. Further study is needed with more cases.

  • PDF

Simultaneous Kinetic Spectrophotometric Determination of Sulfite and Sulfide Using Partial Least Squares (PLS) Regression

  • Afkhami, Abbas;Sarlak, Nahid;Zarei, Ali Reza;Madrakian, Tayyebeh
    • Bulletin of the Korean Chemical Society
    • /
    • 제27권6호
    • /
    • pp.863-868
    • /
    • 2006
  • The partial least squares (PLS-1) calibration model based on spectrophotometric measurement, for the simultaneous determination of sulfite and sulfide is described. This method is based on the difference between the rate of the reaction of sulfide and sulfite with Malachite Green in pH 7.0 buffer solution and at 25 ${^{\circ}C}$. The absorption kinetic profiles of the solutions were monitored by measuring the decrease in the absorbance of Malachite Green at 617 nm in the time range 10-180 s after initiation of the reactions with 2 s intervals. The experimental calibration matrix for partial least squares (PLS-1) calibration was designed with 24 samples. The cross-validation method was used for selecting the number of factors. The results showed that simultaneous determination could be performed in the range 0.030-1.5 and 0.030-1.2 $\mu$g m$L ^{-1}$ for sulfite and sulfide, respectively. The proposed method was successfully applied to simultaneous determination of sulfite and sulfide in water samples and whole human blood.

A MARKOV DECISION PROCESSES FORMULATION FOR THE LINEAR SEARCH PROBLEM

  • Balkhi, Z.T.;Benkherouf, L.
    • 한국경영과학회지
    • /
    • 제19권1호
    • /
    • pp.201-206
    • /
    • 1994
  • The linear search problem is concerned with finding a hiden target on the real line R. The position of the target governed by some probability distribution. It is desired to find the target in the least expected search time. This problem has been formulated as an optimization problem by a number of authors without making use of Markov Decision Process (MDP) theory. It is the aim of the paper to give a (MDP) formulation to the search problem which we feel is both natural and easy to follow.

  • PDF

NEW LM TESTS FOR UNIT ROOTS IN SEASONAL AR PROCESSES

  • Oh, Yu-Jin;So, Beong-Soo
    • Journal of the Korean Statistical Society
    • /
    • 제36권4호
    • /
    • pp.447-456
    • /
    • 2007
  • On the basis of marginal likelihood of the residual vector which is free of nuisance mean parameters, we propose new Lagrange Multiplier seasonal unit root tests in seasonal autoregressive process. The limiting null distribution of the tests is the standardized ${\chi}^2-distribution$. A Monte-Carlo simulation shows the new tests are more powerful than the tests based on the ordinary least squares (OLS) estimator, especially for large number of seasons and short time spans.

Atmospheric Extinction for Sing1e band astronomical survey

  • Bak, Jih-Yong;Byun, Yong-Ik
    • 한국우주과학회:학술대회논문집(한국우주과학회보)
    • /
    • 한국우주과학회 2004년도 한국우주과학회보 제13권1호
    • /
    • pp.27-27
    • /
    • 2004
  • There are increasing number of optical sky surveys for time-series observations, aiming to discover either photometric variations(variable stars, microlensing, or transients) or astrometric variations(near-earth objects, trans-neptunian objects). Some surveys, including YSTAR, use a single filter in order to increase the survey efficiency. However, the traditional method of atmospheric extinction and standardization requires the measurement of source color in at least two passbands. (omitted)

  • PDF

MORE RELATIONS BETWEEN λ-LABELING AND HAMILTONIAN PATHS WITH EMPHASIS ON LINE GRAPH OF BIPARTITE MULTIGRAPHS

  • Zaker, Manouchehr
    • 대한수학회보
    • /
    • 제59권1호
    • /
    • pp.119-139
    • /
    • 2022
  • This paper deals with the λ-labeling and L(2, 1)-coloring of simple graphs. A λ-labeling of a graph G is any labeling of the vertices of G with different labels such that any two adjacent vertices receive labels which differ at least two. Also an L(2, 1)-coloring of G is any labeling of the vertices of G such that any two adjacent vertices receive labels which differ at least two and any two vertices with distance two receive distinct labels. Assume that a partial λ-labeling f is given in a graph G. A general question is whether f can be extended to a λ-labeling of G. We show that the extension is feasible if and only if a Hamiltonian path consistent with some distance constraints exists in the complement of G. Then we consider line graph of bipartite multigraphs and determine the minimum number of labels in L(2, 1)-coloring and λ-labeling of these graphs. In fact we obtain easily computable formulas for the path covering number and the maximum path of the complement of these graphs. We obtain a polynomial time algorithm which generates all Hamiltonian paths in the related graphs. A special case is the Cartesian product graph Kn☐Kn and the generation of λ-squares.

Further Results on Piecewise Constant Hazard Functions in Aalen's Additive Risk Model

  • Uhm, Dai-Ho;Jun, Sung-Hae
    • 응용통계연구
    • /
    • 제25권3호
    • /
    • pp.403-413
    • /
    • 2012
  • The modifications suggested in Uhm et al. (2011) are studied using a partly parametric version of Aalen's additive risk model. A follow-up time period is partitioned into intervals, and hazard functions are estimated as a piecewise constant in each interval. A maximum likelihood estimator by iteratively reweighted least squares and variance estimates are suggested based on the model as well as evaluated by simulations using mean square error and a coverage probability, respectively. In conclusion the modifications are needed when there are a small number of uncensored deaths in an interval to estimate the piecewise constant hazard function.

국소 최소자승 잡음 감소 필터를 이용한 광자선 및 전자선 몬테칼로 선량 계산 시간 단축 (Monte Carlo Photon and Electron Dose Calculation Time Reduction Using Local Least Square Denoising Filters)

  • 정광호;서태석;조병철;진호상
    • 한국의학물리학회지:의학물리
    • /
    • 제16권3호
    • /
    • pp.138-147
    • /
    • 2005
  • 몬테칼로 선량계산 시 적절한 정확도를 얻기 위해서는 계산입자수를 늘려야 하고 그로 인해 계산 시간이 오래 걸리게되므로 일상적 치료계획의 선량계산 방법으로 이용되지 못했다. 본 연구에서는 몬테칼로 모의실험 시 계산입자 수를 줄여서 선량계산을 수행한 후 잡음 감소 필터를 적용하여 선량계산 결과를 개선하고자 하였다. 이를 위해 국소 최소자승 잡음 감소 필터를 제작하고 광자선 및 전자선 균질/비균질 팬텀 내 선량계산 결과에 대하여 적용하여 선택적 여과를 수행하였으며 그 유효성을 등선량 곡선 비교 및 감마시험을 통하여 검증하였다. 연구 결과 통계적 불확실도를 2$\%$ 이내로 유지하기 위해 필요한 계산입자수의 10$\%$ 이하의 계산입자 수를 이용하여 몬테칼로 선량계산 뒤 후처리한 결과가 기준계산 입자수를 이용하여 얻은 몬테칼로 선량계산 결과와 유사해질 수 있음을 확인하였다.

  • PDF

화물컨테이너 운송을 위한 시뮬레이티드 어닐링 기반의 차량경로계획 (Simulated Annealing Based Vehicle Routing Planning for Freight Container Transportation)

  • 이상헌;최해정
    • 산업공학
    • /
    • 제20권2호
    • /
    • pp.204-215
    • /
    • 2007
  • This paper addresses vehicle routing planning in freight container transportation systems where a number of loaded containers are to be delivered to their destination places. The system under consideration is static in that all transportation requirements are predetermined at the beginning of a planning horizon. A two-phased procedure is presented for freight container transportation. In the first phase, the optimal model is presented to determine optimal total time to perform given transportation requirements and the minimum of number of vehicles required. Based on the results from the optimal model, in the second phase, ASA(Accelerated Simulated Annealing) algorithm is presented to perform all transportation requirements with the least number of vehicles by improving initial vehicle routing planning constructed by greedy method. It is found that ASA algorithm has an excellent global searching ability through various experiments in comparison with existing methods.