• Title/Summary/Keyword: Repeat time

Search Result 344, Processing Time 0.037 seconds

GPS Satellite Repeat Time Determination and Orbit Prediction Based on Ultra-rapid Orbits (초신속궤도력 기반 GPS 위성 repeat time 산출 및 궤도 예측)

  • Lee, Chang-Moon;Park, Kwan-Dong;Kim, Hye-In;Park, Jae-Min
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.27 no.4
    • /
    • pp.411-420
    • /
    • 2009
  • To plan a GPS survey, they have to decide if a survey can be conducted at a specific point and time based on the predicted GPS ephemeris. In this study, to predict ephemeris, we used the repeat time of a GPS satellite. The GPS satellite repeat time was determined by analysing correlation among three-dimensional satellite coordinates provided by the 48-hour GPS ephemeris in the ultra-rapid orbits. By using the calculated repeat time and Lagrange interpolation polynomials, we predicted GPS orbits f3r seven days. As a result, the RMS of the maximum errors in the X, Y, and Z coordinates were 39.8 km 39.7 km and 19.6 km, respectively. And the maximum and average three-dimensional positional errors were 119.5 km and 48.9 km, respectively. When the maximum 3-D positioning error of 119.5 km was translated into the view angle error, the azimuth and elevation angle errors were 9.7'and 14.9', respectively.

STABILITY CONDITION OF DISCRETE-TIME $GEO^x$/G/1 QUEUE WITH PREEMPTIVE REPEAT PRIORITY

  • Lee, Yutae
    • Journal of applied mathematics & informatics
    • /
    • v.12 no.1_2
    • /
    • pp.291-297
    • /
    • 2003
  • This paper considers discrete-time two-class Ge $o^{X/}$G/1 queues with preemptive repeat priority. Service times of messages of each priority class are i.i.d. according to a general discrete distribution function that may differ between two classes. Completion times are derived for the preemptive repeat identical and different priority disciplines. By using the completion time, the stability condition for our system is investigated.d.

Effect of Gonadotropin-releasing Hormone Administration in Repeat-breeder Hanwoo (저수태 한우에 대한 성선자극 호르몬 방출호르몬 투여 효과)

  • 임석기;우재석;윤상보;전기준
    • Journal of Embryo Transfer
    • /
    • v.12 no.1
    • /
    • pp.117-122
    • /
    • 1997
  • The objective of this study was to enhance the pregnancy rate of repeat-breeder Hanwoo with gonadotropin-releasing hormone(Gn-RH) at the time, dose and site of administration.The results obtained were summaried as fallows:1.Ovulation time and pregnancy rate following GnRH administration time was 46.0, 27.4, 42.0 and 43.2hr and 33.3, 57.1, 37.5 and 40.0% at non-treatment, estus, 1st A' and 2nd Al treatment, respectively.2. Ovulation in repeat-breeder was induced 100% within 24hr with GnRH administration at the time of estrus.3. Ovulation time and pregnancy rate following GnRH adminstration dose and site was 25.2, 32.6, 17.6 and 27.6hr, and 28.6, 42.9, 75.0 and 66.7% at 50$\mu$g+IU, 50$\mu$g+IM, 100$\mu$g+IU and 100$\mu$g+IM treatments, respectively. It is concluded that GnRH administration for repeat-breeder was enhanced the pregnancy rate when treated with 100$\mu$g intrauterine at the time of estrus.

  • PDF

Delay Analysis of Selective Repeat ARQ for a Markovian Source Over a Wireless Channel (무선 채널에서의 Selective Repeat ARQ 프로토콜의 Delay 성능 분석)

  • Kim Jeong Geun;Kim Young Soo;Lee Kyesan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.930-937
    • /
    • 2004
  • In this paper, we analyze the delay performance for a Markovian source transported over a wireless channel with time-varying error characteristics. To improve the reliability of the channel, the end points of the wireless link implement a selective-repeat (SR) ARQ error control protocol. We provide an approximate discrete-time analysis of the end-to-end mean packet delay, which consists of transport and resequencing delays. Numerical results and simulations indicate that our approximate analysis is sufficiently accurate for a wide range of parameter values.

Risk factors for repeat breeder dairy cows and their impacts on reproductive performance

  • Jeong, Jae-Kwan;Kim, Ill-Hwa
    • Korean Journal of Veterinary Research
    • /
    • v.62 no.2
    • /
    • pp.15.1-15.8
    • /
    • 2022
  • The objective of this study was to identify risk factors for repeat breeder dairy cows and their impact on reproductive performance. The characteristics of 1,504 cows, including their peripartum health, nutrition, production, and reproduction, were collected. Cows with metabolic disorder were significantly more likely (odds ratio [OR], 2.47; p < 0.001) and cows with clinical endometritis tended to be more likely (OR, 1.35; p < 0.1) to become repeat breeders than cows without metabolic disorder and clinical endometritis, respectively. Cows initially inseminated > 80 days after calving were less likely (OR, 0.78; p < 0.05) to become repeat breeders than cows initially inseminated ≤ 80 days after calving. As a result, repeat breeding in dairy cows resulted in a 90 day longer (p < 0.0001) mean interval from calving to pregnancy. In conclusion, postpartum metabolic disorder, clinical endometritis, and a short interval from calving to initial insemination were risk factors for repeat breeder dairy cows, resulting in a severely impaired reproductive performance.

Repeat analysis of intraoral digital imaging performed by undergraduate students using a complementary metal oxide semiconductor sensor: An institutional case study

  • Yusof, Mohd Yusmiaidil Putera Mohd;Rahman, Nur Liyana Abdul;Asri, Amiza Aqiela Ahmad;Othman, Noor Ilyani;Mokhtar, Ilham Wan
    • Imaging Science in Dentistry
    • /
    • v.47 no.4
    • /
    • pp.233-239
    • /
    • 2017
  • Purpose: This study was performed to quantify the repeat rate of imaging acquisitions based on different clinical examinations, and to assess the prevalence of error types in intraoral bitewing and periapical imaging using a digital complementary metal-oxide-semiconductor(CMOS) intraoral sensor. Materials and Methods: A total of 8,030 intraoral images were retrospectively collected from 3 groups of undergraduate clinical dental students. The type of examination, stage of the procedure, and reasons for repetition were analysed and recorded. The repeat rate was calculated as the total number of repeated images divided by the total number of examinations. The weighted Cohen's kappa for inter- and intra-observer agreement was used after calibration and prior to image analysis. Results: The overall repeat rate on intraoral periapical images was 34.4%. A total of 1,978 repeated periapical images were from endodontic assessment, which included working length estimation (WLE), trial gutta-percha (tGP), obturation, and removal of gutta-percha (rGP). In the endodontic imaging, the highest repeat rate was from WLE (51.9%) followed by tGP (48.5%), obturation (42.2%), and rGP (35.6%). In bitewing images, the repeat rate was 15.1% and poor angulation was identified as the most common cause of error. A substantial level of intra- and inter-observer agreement was achieved. Conclusion: The repeat rates in this study were relatively high, especially for certain clinical procedures, warranting training in optimization techniques and radiation protection. Repeat analysis should be performed from time to time to enhance quality assurance and hence deliver high-quality health services to patients

(N, n)-Preemptive Repeat-Different Priority Queues ((N, n)-선점 재샘플링-반복 우선순위 대기행렬)

  • Kim, Kilhwan
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.3
    • /
    • pp.66-75
    • /
    • 2017
  • Priority disciplines are an important scheme for service systems to differentiate their services for different classes of customers. (N, n)-preemptive priority disciplines enable system engineers to fine-tune the performances of different classes of customers arriving to the system. Due to this virtue of controllability, (N, n)-preemptive priority queueing models can be applied to various types of systems in which the service performances of different classes of customers need to be adjusted for a complex objective. In this paper, we extend the existing (N, n)-preemptive resume and (N, n)-preemptive repeat-identical priority queueing models to the (N, n)-preemptive repeat-different priority queueing model. We derive the queue-length distributions in the M/G/1 queueing model with two classes of customers, under the (N, n)-preemptive repeat-different priority discipline. In order to derive the queue-length distributions, we employ an analysis of the effective service time of a low-priority customer, a delay cycle analysis, and a joint transformation method. We then derive the first and second moments of the queue lengths of high- and low-priority customers. We also present a numerical example for the first and second moments of the queue length of high- and low-priority customers. Through doing this, we show that, under the (N, n)-preemptive repeat-different priority discipline, the first and second moments of customers with high priority are bounded by some upper bounds, regardless of the service characteristics of customers with low priority. This property may help system engineers design such service systems that guarantee the mean and variance of delay for primary users under a certain bounds, when preempted services have to be restarted with another service time resampled from the same service time distribution.

Analysis of Factors Contributing to Repeat Surgery in Multi-Segments Cervical Ossification of Posterior Longitudinal Ligament

  • Jeon, Ikchan;Cho, Yong Eun
    • Journal of Korean Neurosurgical Society
    • /
    • v.61 no.2
    • /
    • pp.224-232
    • /
    • 2018
  • Objective : Cervical ossification of the posterior longitudinal ligament (OPLL) can be treated via anterior or posterior approach, or both. The optimal approach depends on the characteristics of OPLL and cervical curvature. Although most patients can be successfully treated by a single surgery with the proper approach, renewed or newly developed neurological deterioration often requires repeat surgery. Methods : Twenty-seven patients with renewed or newly developed neurological deterioration requiring salvage surgery for multi-segment cervical OPLL were enrolled. Ten patients (group AP) underwent anterior approach, and 17 patients (group PA) underwent posterior approach at the initial surgery. Clinical and radiological data from initial and repeat surgeries were obtained and analyzed retrospectively. Results : The intervals between the initial and repeat surgeries were $102.80{\pm}60.08months$ (group AP) and $61.00{\pm}8.16months$ (group PA) (p<0.05). In group AP, the main OPLL lesions were removed during the initial surgery. There was a tendency that the site of main OPLL lesions causing renewed or newly developed neurological deterioration were different from that of the initial surgery (8/10, p<0.05). Repeat surgery was performed for progressed OPLL lesions at another segment as the main pathology. In group PA, the main OPLL lesions at the initial surgery continued as the main pathology for repeat surgery. Progression of kyphosis in the cervical curvature (Cobb's angle on C2-7 and segmental angle on the main OPLL lesion) was noted between the initial and repeat surgeries. Group PA showed more kyphotic cervical curvature compared to group AP at the time of repeat surgery (p<0.05). Conclusion : The reasons for repeat surgery depend on the type of initial surgery. The main factors leading to repeat surgery are progression of remnant OPLL at a different segment in group AP and kyphotic change of the cervical curvature in group PA.

Comparison between Hiker and Non-hiker's Sense of place value at Namhansanseong Provincial Park (남한산성도립공원 등산객과 비등산객의 장소 가치인식 비교 연구)

  • Kim, Ye-Eun;Kim, Hyun;Paek, Nanyoung
    • Journal of Korean Society of Rural Planning
    • /
    • v.21 no.4
    • /
    • pp.127-137
    • /
    • 2015
  • This Study attempted to comprehend difference between hiker and non-hiker's sense of place value at Namhansanseong Provincial Park. Especially, it was analyzed after visitors, who were divided into local residents & tourists and first time visitors & repeat visitors. Out of 600 visitors, who were over 19 years old, participated in the survey, 587 responses were used for data analysis. Consequently, Sense of place value at Namhansanseong Provincial Park were classified into three factors: Health Culture, Ecology Environment, and Connectedness. Hikers feel higher value on promotion of health, relaxation, environment than non-hikers. Among hikers, local residents feel higher value on ecology environment and connectedness than tourists. Among non-hikers, however, they have no difference between local residents and tourists, only repeat visitors and first time visitors. On this result, possibility of resident participation management on natural environment and trail was considered, and when the program, which is for raising cultural and traditional value, would develop, increasing number of repeat visitor should be considered as a high priority.

Constant Time RMESH Algorithm for Computing Longest Common Substring and Maximal Repeat of String (문자열의 최장 공통 부분문자열과 최대 반복자를 구하기 위한 상수시간 RMESH 알고리즘)

  • Han, Seon-Mi;Woo, Jin-Woon
    • The KIPS Transactions:PartA
    • /
    • v.16A no.5
    • /
    • pp.319-326
    • /
    • 2009
  • Since string operations were applied to computational biology area, various data structures and algorithms for computing efficient string operations have been studied. The longest common substring problem is an operation to find the longest matching substring in more than two strings, and maximal repeat of string problem is an operation to find substrings repeated more than once in the given string. These operations are importantly used in the string processing area such as pattern matching and likelihood measurement. In this paper, we present algorithms to compute the longest common substring of two strings and to find the maximal repeat of string using three-dimensional $n{\times}n{\times}n$ processors on RMESH(Reconfigurable MESH). Our algorithms have O(1) time complexity.