• Title/Summary/Keyword: Minimum-time

검색결과 4,133건 처리시간 0.033초

THE MINIMUM VARIANCE UNBIASED ESTIMATION OF SYSTEM RELIABILITY

  • Park, C.J.;Kim, Jae-Joo
    • 대한산업공학회지
    • /
    • 제4권1호
    • /
    • pp.29-32
    • /
    • 1978
  • We obtain the minimum variance unbiased estimate of system reliability when a system consists of n components whose life times are assumed to be independent and identically distributed either negative exponential or geometric random variables. For the case of a negative exponential life time, we obtain the minimum variance unbiased estimate of the probability density function of the i-th order statistic.

  • PDF

PERIOD VARIATIONS OF RT PERSEI

  • Kim, Chun-Hwey
    • Journal of Astronomy and Space Sciences
    • /
    • 제12권2호
    • /
    • pp.179-195
    • /
    • 1995
  • RT Per has been known as a close binary of which the orbital period has unpredictably varied so far. Although there are no agreements with the working mechanism for the changes of the period, two interpretations have been suggested and waiting for to be tested: 1) light-time effects due to the unseen 3rd and 4rd bodies (Panchatsaram 1981), 2) Abrupt period-changes, due to internal variations of the system (e.g. mass transfer or mass loss) superimposing to the light-time effect by a 3rd body (Frieboes-Conde & Herczeg 1973). In the point of view that the former interprepation models could predict the behavior of the changes of the orbital period theoretically, we checked whether the recent observed times of minimum lights follow the perdictions by the first model or not. We confirmed that the observed times of minimum lights have followed the variations calculated by the light-times effects due to the 3rd and 4rd bodies suggested by Panchatsatam. In this paper a total of 626 times of minimum lights were reanalyzed in terms of the light-time effects by the 3rd and 4rd bodies. We concluded that the eclipsing pair in SVCam system moves in an elliptic orbit about center of mass of the triple system with a period of about $42.^y2$, while the mass center of the triplet is in light-time orbit about the center of mass of the quadruple system with a period of $120^y$. The mean masses deduced for the 3rd and 4rd bodies were $0.89m_\odot$ and $0.82m_\odot$, respectively.

  • PDF

노말프로판올과 아세틱에씨드 계의 최소자연발화온도(AIT) 측정 및 예측 (Measurement and Prediction of Autoignition Temperature(AIT) of n-Propanol and Acetic acid System)

  • 하동명
    • 한국안전학회지
    • /
    • 제32권2호
    • /
    • pp.66-71
    • /
    • 2017
  • The autoignition temperature (AIT) is crucial combustible characteristics which need attention in chemical process that handle hazardous materials. The AIT, also to as minimum spontaneous ignition temperature(MSIT), is the lowest temperature of a hot surface at which the substance will spontaneously ignite without any obvious sources of ignition such as a spark or flame. The AIT may be used as combustion property to specify operating, storage, and materials handling procedures for process safety. This study measured the AITs of n-propanol+acetic acid system from ignition delay time(time lag) by using ASTM E659 apparatus. The AITs of n-propanol and acetic acid which constituted binary system were $435^{\circ}C$ and $212^{\circ}C$, respectively. The experimental AITs of n-propanol+acetic acid system were a good agreement with the calculated AITs by the proposed equations with a few A.A.D.(average absolute deviation). In the case of n-propanol and acetic acid system, the minimum autoignition temperature behavior (MAITB), which is lower than the lower AIT, is shown among the two pure substances constituting the mixture.

A Heuristic Polynomial Time Algorithm for Crew Scheduling Problem

  • Lee, Sang-Un
    • 한국컴퓨터정보학회논문지
    • /
    • 제20권11호
    • /
    • pp.69-75
    • /
    • 2015
  • This paper suggests heuristic polynomial time algorithm for crew scheduling problem that is a kind of optimization problems. This problem has been solved by linear programming, set cover problem, set partition problem, column generation, etc. But the optimal solution has not been obtained by these methods. This paper sorts transit costs $c_{ij}$ to ascending order, and the task i and j crew paths are merged in case of the sum of operation time ${\Sigma}o$ is less than day working time T. As a result, we can be obtain the minimum number of crews $_{min}K$ and minimum transit cost $z=_{min}c_{ij}$. For the transit cost of specific number of crews $K(K>_{min}K)$, we delete the maximum $c_{ij}$ as much as the number of $K-_{min}K$, and to partition a crew path. For the 5 benchmark data, this algorithm can be gets less transit cost than state-of-the-art algorithms, and gets the minimum number of crews.

Minimum detectable activity of plastic scintillator for in-situ beta measurement system in ground water

  • Choi, Woo Nyun;Lee, UkJae;Bae, Jun Woo;Kim, Hee Reyoung
    • Nuclear Engineering and Technology
    • /
    • 제51권4호
    • /
    • pp.1169-1175
    • /
    • 2019
  • The minimum detectable activity (MDA) value was derived according to the flow rate of the sample and degree of amplification of the device by sending the sample directly from the collection site to the detection part through a pump. This method can lead to reduction in time and cost compared to the existing measurement method that uses a pre-treatment process. In this study, experiments were conducted on $^3H$ and $^{90}Sr$, which are the major pure beta-emitting radionuclides, by setting the sample flow rate and the amplification gain as factors. The MDA values were derived according to the flow rates, considering that the flow rate can affect the MDA values. There were no change in the MDA under different flow rates of 0, 600, 800, and 1000 mL/min. Therefore, it was confirmed that the flow rate may not be considered when collecting samples for monitoring in actual field. As the degree of amplification of the amplifier increased, the time required to reach the target MDA decreased. When the amplification was quadrupled, the detection efficiency increased by approximately 23.4 times, and the time to reach the MDA decreased to approximately 1/550 times. This method offers the advantage of real-time on-site monitoring.

유전알고리즘을 이용한 이동로봇의 시간 및 에너지 최적제어 (Optimal Control of Time and Energy for Mobile Robots Using Genetic Algorithm)

  • 박현재;박진현;최영규
    • 한국정보통신학회논문지
    • /
    • 제21권4호
    • /
    • pp.688-697
    • /
    • 2017
  • 비선형 시스템의 이동 로봇을 원하는 목표점으로 속도, 가속도 그리고 각속도 관련 에너지를 최소한으로 사용하여 최단시간 안에 이동시키는 최적의 제어 문제를 수학적으로 푸는 것이 매우 어렵다. 본 논문에서는 유전알고리즘을 이용하여 이동 로봇의 속도, 각속도 관련 에너지를 최소화하면서 최단시간 안에 이동할 수 있는 최적제어이득을 구한다. 이동 로봇은 비선형시스템이므로 초기위치에 따라 최적제어이득이 다르게 결정된다. 따라서 초기위치 분할 점들을 설정하고 각 분할 점에서 유전알고리즘을 이용하여 최적제어이득을 구한다. 각 분할 점에서 구한 최적제어 이득으로 신경회로망을 학습시켜서 임의의 초기위치에 대한 제어이득을 구할 수 있다. 마지막으로 본 연구의 유용성을 컴퓨터 시뮬레이션 연구로 확인한다.

에너지와 대기시간을 고려한 우주비행체 랑데부 (Spacecraft Rendezvous Considering Orbital Energy and Wait Time)

  • 오승렬;이현재
    • 한국항공우주학회지
    • /
    • 제45권9호
    • /
    • pp.775-783
    • /
    • 2017
  • 본 논문에서는 서로 다른 궤도상에 있는 두 우주비행체의 랑데부를 위한 최소 에너지 순간추력을 구하는 문제를 다룬다. 두 우주비행체의 궤도는 공면 궤도나 원 궤도 같이 특정 지어진 궤도가 아닌 일반적인 궤도이다. 이러한 최적화 문제를 다루기 위해 범용변수를 사용한 케플러 방정식과 두 우주비행체의 최종 위치 및 속도를 구속조건으로 사용하며, 전이 궤도의 정보를 얻기 위해 라그랑지 계수를 이용한다. 이 방법은 최소 에너지를 고려한 예시와 대기시간까지 고려한 예시를 통해 보여 지며, 최소 에너지 궤도로 알려진 호만 궤도와 비교함으로써 검증된다. 비록 닫힌 형태의 해를 얻을 수는 없었지만, 수치해석적 방식을 적용함으로써 다양한 궤도 전이 문제의 해를 구할 수 있음을 보여준다.

화력발전용 로터강의 초기 변형률법에 의한 장시간 크리프 수명 및 강도 예측 (Long Time Creep Strength and Life Prediction of Steam Turbine Rotor Steel by Initial Strain Method)

  • 오세규;정순억
    • 대한기계학회논문집
    • /
    • 제17권6호
    • /
    • pp.1321-1329
    • /
    • 1993
  • 본 연구에서는 이들보다 매우 간단한 IS법, 즉 초기 변형률법(ISM: initial strain method)에 의한 크리프 수명예측식을 고안하여, 현재 화력발전용 고압 로터강 에 사용되고 있는 1%Cr-Mo-V강과 발전소 효율향상을 위해 최근 국내최초로 개발된 12% Cr강에 대하여 도출하였고, 이 도출식이 앞에서 언급한 여러 파라메트에 의한 결과와 비교 평가하여 장시간 강도 및 수명예측식으로 사용될 수 있음을 입증하였다.

A Minimum Degree Ordering Algorithm using the Lower and Upper Bounds of Degrees

  • Park, Chan-Kyoo;Doh, Seungyong;Park, Soondal;Kim, Woo-Je
    • Management Science and Financial Engineering
    • /
    • 제8권1호
    • /
    • pp.1-19
    • /
    • 2002
  • Ordering is used to reduce the amount of fill-ins in the Cholesky factor of a symmetric positive definite matrix. One of the most efficient ordering methods is the minimum degree ordering algorithm(MDO). In this paper, we provide a few techniques that improve the performance of MDO implemented with the clique storage scheme. First, the absorption of nodes in the cliques is developed which reduces the number of cliques and the amount of storage space required for MDO. Second, we present a modified minimum degree ordering algorithm of which the number of degree updates can be reduced by introducing the lower bounds of degrees. Third, using both the lower and upper bounds of degrees, we develop an approximate minimum degree ordering algorithm. Experimental results show that the proposed algorithm is competitive with the minimum degree ordering algorithm that uses quotient graphs from the points of the ordering time and the nonzeros in the Cholesky factor.

An Analog Maximum, Median, and Minimum Circuit in Current-mode

  • Sangjeen, Noawarat;Laikitmongkol, Sukum;Riewruja, Vanchai;Petchmaneelumka, Wandee;Julsereewong, Prasit
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.960-964
    • /
    • 2003
  • In this paper, the CMOS integrated circuit technique for implementing current-mode maximum and minimum operations scheme is described. The maximum and minimum operations are incorporated into the same scheme with parallel processing. Using this scheme as the basic unit, an analog three-input maximum, median, and minimum circuit is designed. The performance of the proposed circuit shows a very sharp transfer characteristic and high accuracy. The proposed circuit achieves a high-speed operation, which is suitable for real-time systems. The PSPICE simulation results demonstrating the characteristic of the proposed circuit are included.

  • PDF