• Title/Summary/Keyword: Shortest distance

Search Result 342, Processing Time 0.029 seconds

A Design of Optimal Path Search Algorithm using Information of Orientation (방향성 정보를 이용한 최적 경로 탐색 알고리즘의 설계)

  • Kim Jin-Deog;Lee Hyun-Seop;Lee Sang-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.2
    • /
    • pp.454-461
    • /
    • 2005
  • Car navigation system which is killer application fuses map management techniques into CPS techniques. Even if the existing navigation systems are designed for the shortest path, they are not able to cope efficiently with the change of the traffic flow and the bottleneck point of road. Therefore, it is necessary to find out shortest path algorithm based on time instead of distance which takes traffic information into consideration. In this paper, we propose a optimal path search algorithm based on the traffic information. More precisely. we introduce the system architecture for finding out optimal paths, and the limitations of the existing shortest path search algorithm are also analyzed. And then, we propose a new algorithm for finding out optimal path to make good use of the orientation of the collected traffic information.

Safe Needling Depth of Pungbu(GV16) with MRI-a Retrospective Study (MRI를 통한 풍부혈(GV16)의 안전 자침 깊이에 대한 연구)

  • Yang, Hyun Jung;Park, Hae In;Lee, Kwang Ho
    • Journal of Acupuncture Research
    • /
    • v.32 no.4
    • /
    • pp.11-16
    • /
    • 2015
  • Objectives : The purpose of this study is to determine the safe needling depth of Pungbu($GV_{16}$) retrospectively by using magnetic resonance imaging (MRI). Methods : We chose 114 Brain or C-spine MRI images from the Sang-Ji hospital picture archiving communication system. We measured the shortest distance from skin to cerebral dura mater passing by posterior edge of the foramen magnum on the sagittal view for the depth of Pungbu. We analyzed the differences between male and female measured values by using a student t-test. Results : The average depth of male insertion was $49.71{\pm}6.32mm$ and the shortest depth of insertion was 36.29 mm. The average depth of female insertion was $39.84{\pm}5.25mm$ and the shortest depth of insertion was 30.02 mm. The results showed a significant difference according to gender (p=0.00). Conclusions : The depth of male insertion is deeper than that of female, and the safe needling depth in the case of males is 36.29-67.35 mm, while the safe needling depth in the of females is 30.02-52.18 mm.

Improved Free-air Gravity Anomalies by Satellite Altimetry

  • Kim, Jeong-Woo;Roman, Daniel-R.
    • Korean Journal of Remote Sensing
    • /
    • v.17 no.4
    • /
    • pp.297-305
    • /
    • 2001
  • Ocean satellite altimetry-implied free-air gravity anomalies have had the shortest wavelengths removed during the processing to generate the optimal solution between multiple radar altimeter missions. ERS-1 168day mission altimetry was residualized to a reference geoid surface generated by integrating Anderson & Knudsen’s free-air gravity anomalies for the Barents Sea. The altimetry tracks were reduced and filtered to extract the shortest wavelengths (between 4 and 111 km) from both ascending and descending tracks, respectively. These data were recombined using existing quadrant-swapping techniques in the wavenumber domain to generate a correlated, high frequency gravity field related to the local geologic sources. This added-value surface adjusted the reference free-air gravity anomalies to better reflect features in the gravity field at a wavelength related to the distance between altimetry ground tracks.

Time-distance Accessibility Computation of Seoul Bus System based on the T-card Transaction Big Databases (교통카드 빅데이터 기반의 서울 버스 교통망 시간거리 접근성 산출)

  • Park, Jong Soo;Lee, Keumsook
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.18 no.4
    • /
    • pp.539-555
    • /
    • 2015
  • This study proposes the methodology for measuring the time-distance accessibility on the Seoul bus system based on the T-card transaction databases and analyzes the results. T-card transaction databases contain the time/space information of each passenger's locations and times of the departure, transfers, and destination. We introduce the bus network graph and develop the algorithms for time-distance accessibility measurement. We account the average speed based on each passenger's get-in and getoff information in the T-card data as well as the average transfer time from the trip chain transactions. Employing the modified Floyd APSP algorithm, the shortest time distance between each pair of bus stops has been accounted. The graph-theoretic nodal accessibility has been given by the sum of the inverse time distance to all other nodes on the network. The results and spatial patterns are analyzed. This study is the first attempt to measure the time-distance accessibility for such a large transport network as the Seoul bus system consists of 34,934 bus stops on the 600 bus routes, and each bus route can have different properties in terms of speed limit, number of lanes, and traffic signal systems, and thus has great significance in the accessibility measurement studies.

  • PDF

Genetic Distances between Two Cultured Penaeid Shrimp (Penaeus chinensis) Populations Determined by PCR Analysis

  • Yoon, Jong-Man
    • Development and Reproduction
    • /
    • v.23 no.2
    • /
    • pp.193-198
    • /
    • 2019
  • Genomic DNA samples were obtained from cultured penaeid shrimp (Penaeus chinensis) individuals such as fresh shrimp population (FSP) and deceased shrimp population (DSP) from Shinan regions in the Korean peninsula. In this study, 233 loci were identified in the FSP shrimp population and 162 in the DSP shrimp population: 33 specific loci (14.2%) in the FSP shrimp population and 42 (25.9%) in the DSP population. A total of 66 (an average of 9.4 per primer) were observed in DSP shrimp population, whereas 55 unique loci to each population (an average of 7.9 per primer) in the FSP shrimp population. The Hierarchical dendrogram extended by the seven oligonucleotides primers indicates three genetic clusters: cluster 1 (FRESH 01, 02, and DECEASED 12, 13, 15, 16, 17, 19, 20, 22) and cluster 2 (FRESH 03, 04, 05, 06, 07, 08, 09, 10, 11, and DECEASED 14, 18, 21). Among the twenty-two shrimp, the shortest genetic distance that exposed significant molecular differences was between individuals 20 and 16 from the DSP shrimp population (genetic distance=0.071), while the longest genetic distance among the twenty-two individuals that established significant molecular differences was between individuals FRESH no. 02 and FRESH no. 04 (genetic distance=0.477). In due course, PCR analysis has revealed the significant genetic distance among two penaeid shrimp populations.

A Study of the Changes in Physical and Chemical Properities of Oil Used in Gasoline and LPG Engine (가솔린 LPG 엔진오일의 사용에 따른 물리적, 화학적 성질의 변화에 관한 연구)

  • 강석춘;신성철;김동길;노장섭
    • Tribology and Lubricants
    • /
    • v.10 no.4
    • /
    • pp.59-68
    • /
    • 1994
  • This study is concerned with the change of physical and chemical properties of the used oil in gasoline and LPG engine. The used oils of engine were sampled from dynamometer and cars. The field tests of car were done in city and on highway. The properties of oil were TAN, TBN, visocity, oxidation, ZDTP depletion factor and etc. Also the relation between the chemical change and antiwear property was studied. From the study, it was shown that the decrease of antiwear property of used oil was depended on the changes of ZDTP depletion factor as well as TAN (total acid number). Also, it was found that the oil used by LPG car was deteriorated within the shortest distance among the other gasoline cars. The antiwear property of oil decreased as the running distance increased. The gasoline engine oil drove mainly on highway was the least deteriorate of properities for the same running distance.

A study of the Property Changes of Oil Used in Diesel Engine (디젤 엔진오일의 사용에 따른 물성 변화에 관한 연구)

  • 강석춘;호광일
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.4 no.1
    • /
    • pp.1-15
    • /
    • 1996
  • This study is concerned with the property changes(chemical and mechanical) of the used oil in diesel engine, which were sampled from a test engine with dynamometer and various cars. The properties of oil are TAN, viscosity, oxidation, ZDTP depletion factor and etc. Also the relation between the change of chemical and antiwear property of used oil was strongly related to ZDTP depletion factor as wall as the change of TAN(total acid number), sulfation and pentan unsoluble contents which were reated to the formation of protect film in sliding area. The oil used in pick-up(small) truck engine was deteriorated within the shortest distance than that of other cars. The antiwear property of used oil was decreased sharply as the running distance were over 5,000km. The oil used to mini bus was the least to deteriorate of properities for the funning distance.

  • PDF

Surface Type Detection and Parameter Estimation in Point Cloud by Using Orthogonal Distance Fitting (최단거리 최소제곱법을 이용한 측정점군으로부터의 곡면 자동탐색)

  • Ahn, Sung-Joon
    • Korean Journal of Computational Design and Engineering
    • /
    • v.14 no.1
    • /
    • pp.10-17
    • /
    • 2009
  • Surface detection and parameter estimation in point cloud is a relevant subject in CAD/CAM, reverse engineering, computer vision, coordinate metrology and digital factory. In this paper we present a software for a fully automatic surface detection and parameter estimation in unordered, incomplete and error-contaminated point cloud with a large number of data points. The software consists of three algorithmic modules each for object identification, point segmentation, and model fitting, which work interactively. Our newly developed algorithms for orthogonal distance fitting(ODF) play a fundamental role in each of the three modules. The ODF algorithms estimate the model parameters by minimizing the square sum of the shortest distances between the model feature and the measurement points. We demonstrate the performance of the software on a variety of point clouds generated by laser radar, computer tomography, and stripe-projection method.

Development of a Shortest Path Searching Algorithm Using Minimum Expected Weights (최소 기대 부하량을 이용한 최단경로 탐색 알고리즘 개발)

  • Ryu, Yeong-Geun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.12 no.5
    • /
    • pp.36-45
    • /
    • 2013
  • This paper developed a new shortest path searching algorithm based on Dijkstra's algorithm and $A^*$ algorithm, so it guarantees to find a shortest path in efficient manner. In this developed algorithm, minimum expected weights implies the value that straight line distance from a visiting node to the target node multiplied by minimum link unit, and this value can be the lowest weights between the two nodes. In behalf of the minimum expected weights, at each traversal step, developed algorithm in this paper is able to decide visiting a new node or retreating to the previously visited node, and results are guaranteed. Newly developed algorithm was tested in a real traffic network and found that the searching time of the algorithm was not as fast as other $A^*$ algorithms, however, it perfectly found a minimum path in any case. Therefore, this developed algorithm will be effective for the domain of searching in a large network such as RGV which operates in wide area.

A Study on Optimal Planning of Sustainable Rural Road Path based on Infrastructure for Green-Tourism and Public Service (그린투어리즘 및 공공서비스 기반의 지속가능한 농촌도로노선의 최적계획에 관한 연구)

  • Kim, Dae-Sik;Chung, Ha-Woo
    • Journal of Korean Society of Rural Planning
    • /
    • v.11 no.1 s.26
    • /
    • pp.1-8
    • /
    • 2005
  • The purpose of this study is to develop a simulation model of rural road path for infrastructure of green-tourism and public service in rural areas. This study makes an objective function for moving cost minimization considering car travel time according to road characteristics, which can route the optimal shortest road paths between the center places and all rear villages, based on GIS coverages of road-village network for connecting between center places and rural villages as input data of the model. In order to verify the model algorithm, a homogeneous hexagonal network, assuming distribution of villages with same population density and equal distance between neighborhood villages on a level plane area, was tested to simulate the optimal paths between the selected center nodes and the other rear nodes, so that the test showed reasonable shortest paths and road intensity defined in this study. The model was also applied to the actual rural area, Ucheon-myun, which is located on Hoengsung-gun, Kangwon-do, with 72 rural villages, a center village (Uhang, 1st center place) in the area, a county conte. (Hoengsung-eup, 2nd center place), and a city (Wonju, 3rd center place), as upper settlement system. The three kinds of conte. place, Uhang, Hoengsung-eup, and Wonju, were considered as center places of three scenarios to simulate the optimal shortest paths between the centers and rural villages, respectively. The simulation results on the road-village network with road information about pavement and width of road show that several spans having high intensity of road are more important that the others, while some road spans have low intensity of road.