• 한국임상수의학회지
• /
• 제13권2호
• /
• pp.114-122
• /
• 1996

The aim of this study was to assess the precision of the estimates of the time of estrous cycle, optimal breeding and ovulation derived by vaginal cytology. The thirteen Korea Jin-do dogs were examined the vaginal cytology, plasma estradiol-17$$\beta $ and progesterone assay during the estrous cycle. Day 0 was the day of the first male acceptance. The main change of vaginal cytology during the estrous cycle was the high proportion of anuclear cell and erythrocyte in proestrus, superficial cell, anuclear cell and erythrocyte in estrus, parabasal cell, large intermediate cell and leukocytes in diestrus, and parabasal cell and small intermediate cell in anestrus, respectively. These data indicated that vaginal cytology was reliable method for estimating estrous cycle in Korea Jin-do dogs. In the cell indices during estrus the maximum eosinoghilic index was $92.0{\pm}$2.6 (Mean{\pm} SEM$)% at Day 2 and the maximum cornification indez was $96.0{\pm}1.3%$ at Day 2, respectively. The eosinothilic indez and cornification indez of up to 70% were found at Day -1 to Day 5 and Day -6 to Day 8, and up to 80% at Day 1 to Day 4 and Day -4 to Day 6, respectively. From these data it was presumed that eosinophilic index was more reliable index for monitoring optimal breeding time than cornification indexm because eosinophilic index peak period was shorter than cornification indeX peak period and Day 2 was the day of ovulation. Therefore, optimal breeding time was the eosinophilic index peak period, more than 80% of eosinoghilic index. The $estradiol-17{\beta}$ peak, with 3 days delayed when progesterone concentration was $4.5{\pm}0.5 ng/ml$. These data estimated that the ovulation time was the day of eosinophilic index peak, Day 2. breeding time and pvulation time in Korea Jin-do dogs.

• 한국정밀공학회지
• /
• 제12권12호
• /
• pp.165-172
• /
• 1995

Many algorithms to enhance a speed performance of a robot have been studied, but it's rare to consider disign aspect of a robot arm for time optimal problem. In this paper, section demensions of a robot arm and a velocity profile of an end-effector were optimally designed to minimize the cycle time. Capacity of actuators, deflections of end-effector, and a fundamental natural frequency of the robot arm were constrained in optimal design. For a given path with a trapezoidal velocity profile, torques of each joint were calculated using the inverse kinematics and dynamics. For the SCARA type robot which is mainly used for assembly tasks, the time optimal design of each robot arm id presented with the above constraints.

• 대한교통학회지
• /
• 제10권3호
• /
• pp.7-20
• /
• 1992

The common cycle time for the linded signals is usually determined for the critical intersecion, just because the cpacity of a signalized intersection depends on the cycle time. This may not be optimal since the interactions between the flow and the spatial structure of the route or the area are disregarded in this case. It is common to separate the total delay incurred at signals into two parts, a deterministic or uniform delay and a stochastic or random delay. The deterministic delays and the stochastic delays on the artery particularly related to signal cycle time. For this purpose a microscopic simulation technique is used to evaluate deterministic delays, and a macroscopic simulation technique based on the principles of Markov chains is used to evaluate stochastic delays with over flow queue. As a result of investigating the relations between deterministic delays and cycle time in the various circumstances of spacing of signals and traffic volume. As for stochastic delays the resalts of comparisons of the macroscopic simulation and Newell's approximation with the microscopic simulation indicate that the former is valid for the degree of saturation less than 0.95 and the latter is for that above 0.95. Newell's argument that the total stochastic delay on an arterial is dominated by that at or caused by critical intersection is certified by the simulation experiments. The comprehensive analyses of the values of optimal cycle time with various conditions lead to a model. The cycle time determined by this model shows to be approximately 70% of that calculated by Webster's.

• 산업경영시스템학회지
• /
• 제5권6호
• /
• pp.63-68
• /
• 1982

We can reduce delays and number of stops in the traffic area by means of optimal design of traffic signal system. A computer simulation model to simulate and predict the traffic signal system of Jong-Ro 4-th street was developed for determination of optimal cycle time. This simulation model was developed in relation to Jong-Ro 4-th street, but this model can be applied for other places with small modification.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2005년도 춘계학술대회 학술발표 논문집 제15권 제1호
• /
• pp.161-165
• /
• 2005

최적 교통 주기를 산출하기 위해서는 하위교차로에 대기차량이 얼마나 있는지를 점검해야 한다. 왜냐하면 대기차량이 상위교차로의 길이보다 크면 출발 지연 시간 및 승용차 대기시간이 발생하기 때문이다. 승용차 대기시간을 단축시키기 위해서 본 논문에서는 퍼지 신경망을 이용한 최적 연동 녹색시간 알고리즘을 제안한다. 컴퓨터 모의실험을 통해서, 서로 다른 교차로 조건을 고려하지 않은 고정 교통신호등 보다 평균 주행속도가 향상 된 것을 입증하였다.

• 전자공학회논문지CI
• /
• 제40권4호
• /
• pp.181-192
• /
• 2003

제한된 도로에 급증하는 자동차로 인해서, 기존의 교통신호등은 최적주기기능을 상실하였다 기존의 교통신호등은 승용차 환산계수, 옵셋, 교차로 길이 등을 고려하지 않았으므로 기존 신호등의 30∼45%가 교통현시와 일치하지 않는다. 본 논문에서는 기존 교통신호등의 단점을 알아보고, 퍼지 규칙을 이용하여 교차로에서의 평균주행속도와 평균대기시간을 개선한다. 뿐만 아니라, 인터넷을 이용해서 위험한 도로, 공사 중인 도로 및 최적의 교통상황을 예보하는 기능을 제공할 수 있도록 하였다.

• 산업경영시스템학회지
• /
• 제43권1호
• /
• pp.61-69
• /
• 2020

Systems such as database and socal network systems have been broadly used, and their unexpected failure, with great losses and sometimes a social confusion, has received attention in recent years. Therefore, it is an important issue to find optimal maintenance plans for such kind of systems from the points of system reliability and maintaining cost. However, it is difficult to maintain a system during its working cycle, since stopping works might incur users some troubles. From the above viewpoint, this paper discusses minimal repair maintenance policy with periodic replacement, while considering the random working cycles. The random working cycle and periodic replacement policies with minimal repair has been discussed in traditional literatures by usually analyzing cases for the nonstopping works. However, maintenance can be more conveniently done at discrete time and even during the working cycle in real applications. So, we propose that periodic replacement is planned at discrete times while considering the random working cycle, and moreover provide a model in which system, with a minimal repair at failures between replacements, is replaced at the minimum of discrete times KT and random cycles Y. The average cost rate model is used to determine the optimal number of periodic replacement.

• 한국인터넷방송통신학회논문지
• /
• 제10권6호
• /
• pp.47-53
• /
• 2010

본문은 단일 교차로의 주기시간을 결정하는 시간 간격을 계층분석방법(Analytic Hierachy Process)을 이용하여 도출하여 내었다. 주어진 불확실한 상황 가운데 결정적인 도출물을 얻기위해서는 비선형특성의 퍼지 적분이나 적응 계수를 사용하여 얻어내어야 하는데 이를 기반으로한 방법이 계층분석방법이다. 계층분석방법을 사용한 제어기와 고정시간 제어를 한 교통제어기와의 비교를 위하여 모의 실험을 통한 결과를 가지고서 비교 검토하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.1250-1255
• /
• 1990

This paper discusses an optimal cyclic scheduling problem for a FMC (Flexible Manufacturing Cell) modeled by a two-machine flowshop with two machining centers with APC's (Automated Pallet Changers), an AGV (Automated Guided Vehicle) and loading and unloading stations. Cyclic production in which similar patterns of production is repeated can significantly reduce the production lead-time and WIP (Work-In-Process) in such flexible, automated system. Thus we want to find an optimal cyclic schedule that minimizes the cycle time in each cycle. However, the existence of APC's as buffer storage for WIP makes the problem intractable (i.e., NP-complete). We propose an practical approximation algorithm that minimizes, instead of each cycle time, its upper bound. Performances of this algorithm are validated by the way of computer simulations.

• 한국물환경학회지
• /
• 제23권2호
• /
• pp.206-215
• /
• 2007

The objective of this study was to establish the optimal system operating strategies for nitrogen and phosphorus removal through model simulation system built for advanced wastewater treatment targeting on simultaneous temporal/special phase isolation BNR process. The simulation system was built with unit process modules using object modules in GPS-X code. The system was well verified by field experiment data. Simulation study was carried out to investigate performance response to design and operation parameters, i.e. hydraulic retention time (HRT), solids retention time (SRT), and cycle time. The process operated at HRTs of 10~15 hours, longer SRTs, and cycle time of 2 hours showed optimal removal of nitrogen. The HRTs of 10~15 hours, SRTs of 20~25 days, and longer cycle time was optimal for phosphorus removal. Both simulation and field studies showed that optimal operating strategies satisfying both the best nitrogen and phosphorus removals include HRTs ranged 10~15 hours, SRTs ranged 20~25 days, and cycle times of 4~8 hours. The simulation system with modularization of generalized components in BNR processes was, therefore, believed to be a powerful tool for establishing optimal strategies of advanced wastewater treatment.