• Title/Summary/Keyword: shortest run

Search Result 17, Processing Time 0.024 seconds

Distribution of Runs and Patterns in Four State Trials

  • Jungtaek Oh
    • Kyungpook Mathematical Journal
    • /
    • v.64 no.2
    • /
    • pp.287-301
    • /
    • 2024
  • From the mathematical and statistical point of view, a segment of a DNA strand can be viewed as a sequence of four-state (A, C, G, T) trials. Herein, we consider the distributions of runs and patterns related to the run lengths of multi-state sequences, especially for four states (A, B, C, D). Let X1, X2, . . . be a sequence of four state independent and identically distributed trials taking values in the set 𝒢 = {A, B, C, D}. In this study, we obtain exact formulas for the probability distribution function for the discrete distribution of runs of B's of order k. We obtain longest run statistics, shortest run statistics, and determine the distributions of waiting times and run lengths.

A study on shortest problem between specified nodes with multiple travel time (다수개의 여행시간이 주어진 경우의 지정된 마디간의 최단경로 문제)

  • 이명석;박순달
    • Korean Management Science Review
    • /
    • v.7 no.2
    • /
    • pp.51-57
    • /
    • 1990
  • The purpose of this thesis is to find the shortest path between two nodes on an acyclic network where the arc costs are determined by the starting time at the starting node of the arc. A branch and bound method for optimal solutions and a heuristic method is developed. In heuristic method Dijkstra algorithm is modified to maintain the minimum arrival times of maximum informations in the each time period at each node and is updated by the result with the insertion technique. Expermetal results among two methods are presented with regard to run time and solution qualities.

  • PDF

Efficient Route Determination Technique in LBS System

  • Kim, Sung-Soo;Kim, Kwang-Soo;Kim, Jae-Chul;Lee, Jong-Hun
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.843-845
    • /
    • 2003
  • Shortest Path Problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is the route determination service, where various kinds of shortest path problems need to be solved in location-based service. Our research aim is to propose a route technique in real-time locationbased service (LBS) environments according to user’s route preferences such as shortest, fastest, easiest and so on. Turn costs modeling and computation are important procedures in route planning. There are major two kinds of cost parameters in route planning. One is static cost parameter which can be pre-computed such as distance and number of traffic-lane. The other is dynamic cost parameter which can be computed in run-time such as number of turns and risk of congestion. In this paper, we propose a new cost modeling method for turn costs which are traditionally attached to edges in a graph. Our proposed route determination technique also has an advantage that can provide service interoperability by implementing XML web service for the OpenLS route determination service specification. In addition to, describing the details of our shortest path algorithms, we present a location-based service system by using proposed routing algorithms.

  • PDF

Fast Algorithms for Computing the Shortest Path between Two Points inside a Simple Polygon (다각형 내부에 있는 두 점 사이의 최단 경로를 구하는 빠른 알고리즘)

  • Kim, Soo-Hwan;Lim, Intaek;Choi, Jinoh;Choi, Jinho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.807-810
    • /
    • 2009
  • In this paper, we consider the shortest path problems in a simple polygon. The shortest path between two points inside a polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in cases without very large input size. In this paper, we present the customized shortest path algorithms for specific polygon classes such as star-shaped polygons, edge-visible polygons, and monotone polygons. These algorithms need not triangulating as preprocessing, so they are simple and run very fast in linear time.

  • PDF

Shifting Algorithm and Response Characteristics of CVT (CVT의 변속 알고리듬과 응답특성)

  • Sung, D.H.;Kim, H.S.
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.2 no.6
    • /
    • pp.9-17
    • /
    • 1994
  • In this study, a shifting algorithm of CVT was suggested for the two(2) driving modes : (1) power mode and (2) economy mode. Shifting algorithm must be obtained to make the engine run on the optimum operating line for the desired performance of the vehicle. Optimum operating lines of the engine were obtained by connecting the shortest way of the iso-power lines for the power mode and by connecting the shortest way of the BSFC curves for the economy mode. Also dynamic model of CVT vehicle was derived considering the throttle and the brake operation. By using the shifting algorithm and the CVT vehicle model, numerical simulations were performed to estimate the performance of CVT. Simulation results showed that comparing the performance of the conventional 4-speed automatic transmission, acceleration performance of the CVT vehicle was almost same with the AT vehicle for the power mode and the fuel economy of CVT was 14% superior than that of AT for the economy mode.

  • PDF

Effects of D-ribose Supplementation on Run-to-exhaustion Time and Antioxidative Capacity under Sea Level or High Altitude Condition (D-라이보스 섭취가 해수면환경과 고지대환경에서의 운동지속능력 및 항산화능력에 미치는 영향)

  • Yoon, Jungwon;Lee, Shineon;Park, Hyon
    • Korean Journal of Exercise Nutrition
    • /
    • v.13 no.1
    • /
    • pp.45-50
    • /
    • 2009
  • This study evaluated the effects of D-ribose supplementation on exercise time in a hypoxic chamber. Eight healthy young males participated in experiments under all four different conditions; placebo+normoxic, placebo+hypoxic, ribose+normoxic, and ribose+hypoxic. Subjects took 1 g per 10 kg body weight of ribose dissolved in drinking water 30 minutes before and immediately before running. We observed the run-to-exhaustion time, the maximum heart rate, and the changing pattern of the heart rate during exercise. The longest running time was achieved when subjects ran under normoxic condition with ribose supplementation. The shortest running time occurred when subjects ran under hypoxic conditions without ribose supplementation. We measured MDA and GPx to determine any changes in oxidative stresses or antioxidative systems. MDA was affected by the environmental conditions and the running time. The activity of GPx showed a significant difference only with the different environmental conditions of exercise. The results of this study indicate that ribose can be considered a possible ergogenic during exercise in specific conditions, but more detailed and well-controlled studies are needed to make a definitive conclusion.

Comparison of Estimation Methods in NONMEM 7.2: Application to a Real Clinical Trial Dataset (실제 임상 데이터를 이용한 NONMEM 7.2에 도입된 추정법 비교 연구)

  • Yun, Hwi-Yeol;Chae, Jung-Woo;Kwon, Kwang-Il
    • Korean Journal of Clinical Pharmacy
    • /
    • v.23 no.2
    • /
    • pp.137-141
    • /
    • 2013
  • Purpose: This study compared the performance of new NONMEM estimation methods using a population analysis dataset collected from a clinical study that consisted of 40 individuals and 567 observations after a single oral dose of glimepiride. Method: The NONMEM 7.2 estimation methods tested were first-order conditional estimation with interaction (FOCEI), importance sampling (IMP), importance sampling assisted by mode a posteriori (IMPMAP), iterative two stage (ITS), stochastic approximation expectation-maximization (SAEM), and Markov chain Monte Carlo Bayesian (BAYES) using a two-compartment open model. Results: The parameters estimated by IMP, IMPMAP, ITS, SAEM, and BAYES were similar to those estimated using FOCEI, and the objective function value (OFV) for diagnosing the model criteria was significantly decreased in FOCEI, IMPMAP, SAEM, and BAYES in comparison with IMP. Parameter precision in terms of the estimated standard error was estimated precisely with FOCEI, IMP, IMPMAP, and BAYES. The run time for the model analysis was shortest with BAYES. Conclusion: In conclusion, the new estimation methods in NONMEM 7.2 performed similarly in terms of parameter estimation, but the results in terms of parameter precision and model run times using BAYES were most suitable for analyzing this dataset.

Biomechanical Analysis of Take-Off Techniques of Women's High Jump Winners at IAAF World Championships, Daegu 2011 (세계일류여자높이뛰기선수의 발구름 기술에 대한 바이오메카닉스적 분석)

  • Bae, Young-Sang;Kim, Eui-Hwan;KIm, Ki-Man;Lee, Jeong-Min;Kim, Sung-Sup;Kwon, Moon-Seok;Wi, Ung-Ryang
    • Korean Journal of Applied Biomechanics
    • /
    • v.21 no.5
    • /
    • pp.585-593
    • /
    • 2011
  • The purpose of this study was to analyze, from a kinematical point of view, the high jump techniques of three women's high jump winners at the IAAF World Championships, Daegu 2011. The trends for the techniques of the world's top high jumpers were examined, with a view toward adapting these techniques to the physical characteristics of Korean women's high jumpers. It was valuable that Di Martino, who was the shortest in height, was able to win a medal by using a single arm swing take-off technique, along with a half flexed leading leg swing to attain a deep arch and clear the bar. This showed that the world's top athletes used jumping techniques with no decrease in the run-up velocity at the take-off. Furthermore, It appeared that the knee joint angle at take-off had a direct effect on the body position at take-off (H1).

Genetic Distances and Variations of Three Geographic Hairtail Populations Identified by PCR Analysis

  • Yoon, Jong-Man
    • Development and Reproduction
    • /
    • v.18 no.3
    • /
    • pp.167-172
    • /
    • 2014
  • In the present study, muscle tissues were obtained separately from individuals from Atlantic hairtail population (AHP), Gunsan hairtail population (GHP) and Chinese hairtail population (CHP), respectively. The seven decamer primers were used to generate the shared loci, specific, unique shared loci to each population and shared loci by the three hairtail populations. Here, averagely, a decamer primer generated 64.7 amplified products per primer in the AHP population, 55.7 in GHP population and 56.4 in CHP population. The number of unique shared loci to each population and number of shared loci by the three populations generated by genetic analysis using 7 decamer primers in AHP, GHP and CHP population. 119 unique shared loci to each population, with an average of 17 per primer, were observed in the AHP population, and 28 loci, with an average of 4 per primer, were observed in the CHP population. The hierarchical dendrogram point out three main branches: cluster 1 (ATLANTIC 01 ~ ATLANTIC 07), cluster 2 (GUNSAN 08 ~ GUNSAN 14) and cluster 3 (CHINESE 15 ~ CHINESE 21). The shortest genetic distance displaying significant molecular difference was between individuals' CHINESE no. 16 and CHINESE no. 18 (0.045). In the long run, individual no. 01 of the AHP population was most distantly related to CHINESE no. 19 (genetic distance = 0.430). Consequently, PCR analysis generated on the genetic data displayed that the geographic AHP population was widely separated from CHP population, while individuals of CHP population were fairly closely related to those of GHP population.

Treatment of Landfill Leachate by UV/TiO2/H2O2 System (UV/TiO2/H2O2 시스템을 이용한 매립지(埋立地) 침출수(浸出水) 처리(處理))

  • Kim, Sung-Joon;Moon, Jung-Uye
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.11 no.4
    • /
    • pp.133-141
    • /
    • 1997
  • In order to treat the landfill leachate, $UV/TiO_2/H_2O_2$ system connected with biological treatment was investigated, and proper pretreatment methods were examined to reduce the load on the system considering economical and technical efficiency. It was more profitable to put $H_2O_2$ into the system in the early stage for the sample which was treated with $H_2SO_4$ to decrease alkalinity and with $FeCl_3-6H_2O$ flocculation. Because the required reaction time run up by increasing $H_2O_2$ input amount, though the COD was reduced slightly, the optimal $H_2O_2$ input amount should be determined for the desired COD and the economical efficiency. The appropriate way to get the lowest COD in the shortest time was the method to treat the sample which was controlled to pH 3.5 after adjusting to pH 12 and put 500 ppm $H_2O_2$ into the system. In that case, to increase $H_2O_2$ input amount was not profitable for the system efficiency. The sufficient photocatalytic excited time was required to reduce the photocatalytic decomposition time for the sample which was gone through the alkali state.

  • PDF