• Journal of Korean Society of Transportation
• /
• v.23 no.1
• /
• pp.103-114
• /
• 2005

The transit fare resulted from the renovation of public transit system in Seoul is basically determined based on the distance-based fare policy (DFP). In DFP, the total fare a passenger has to pay for is calculated by the basic-transfer-premium fare decision rule. The fixed amount of the basic fare is first imposed when a passenger get on a mode and it lasts within the basic travel distance. The transfer fare is additionally imposed when a passenger switches from one mode to another and the fare of the latter mode is higher than the former. The premium fare is also another and the fare of the latter begins to exceed the basic travel distance and increases at the proportion of the premium fare distance. The purpose of this study is to propose an algorithm for finding K number of paths, paths that are sequentially sorted based on total amount of transit fare, under DFP of the idstance-based fare policy. For this purpose, the link mode expansion technique is proposed in order to save notations associated with the travel modes. Thus the existing K shortest path algorithms adaptable for uni-modal network analysis are applicable to the analysis for inter-modal transportation networks. An optimality condition for finding the K shortest fare routes is derived and a corresponding algorithms is developed. The case studies demonstrate that the proposed algorithm may play an important role to provide diverse public transit information considering fare, travel distance, travel time, and number of transfer.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.101-108
• /
• 2004

The new transit fare in the Seoul Metropolitan is basically determined based on the distance-based fare system (DBFS). The total fare in DBFS consists of three parts- (1) basic fare, (2) transfer fare, and (3) extra fare. The fixed amount of basic fare for each mode is charged when a passenger gets on a mode, and it proceeds until traveling within basic travel distance. The transfer fare may be added when a passenger switches from the present mode to another. The extra fare is imposed if the total travel distance exceeds the basic travel distance, and after that, the longer distance the more extra fare based on the extra-fare-charging rule. This study proposes an algorithm for finding minimum fare route in DBFS. This study first exploits the link-label-based searching method to enable shortest path algorithms to implement without network expansion at junction nodes in inter-modal transit networks. Moreover, the link-expansion technique is adopted in order for each mode's travel to be treated like duplicated links, which have the same start and end nodes, but different link features. In this study, therefore, some notations associated with modes can be saved, thus the existing link-based shortest path algorithm is applicable without any loss of generality. For fare calculation as next steps, a mathematical formula is proposed to embrace fare-charging process using search process of two adjacent links illustrated from the origin. A shortest path algorithm for finding a minimum fare route is derived by converting the formula as a recursive form. The implementation process of the algorithm is evaluated through a simple network test.

• Railway Journal
• /
• v.18 no.4
• /
• pp.99-103
• /
• 2015

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.3029-3036
• /
• 2000

Image segmentation is one of the important processes in the image information extraction for computer vision systems. The fuzzy clustering methods have been extensively used in the image segmentation because it extracts feature information of the region. Most of fuzzy clustering methods have used the Fuzzy C-means(FCM) algorithm. This algorithm can be misclassified about the different size of cluster because the degree of membership depends on highly the distance between data and the centroids of the clusters. This paper proposes a fuzzy clustering algorithm using the Average Intracluster Distance that classifies data uniformly without regard to the size of data sets. The Average Intracluster Distance takes an average of the vector set belong to each cluster and increases in exact proportion to its size and density. The experimental results demonstrate that the proposed approach has the g

• Journal of Elementary Mathematics Education in Korea
• /
• v.21 no.4
• /
• pp.599-620
• /
• 2017

In this study, we analyzed how the speed concept has been handled in Korean elementary mathematics textbooks and suggested some didactical implications for revising the teaching of speed concept. To do this, we investigated the curriculum documents, textbooks and teacher's manuals from the first curriculum to the 2009 revision curriculum. The results show that the speed concept of the elementary mathematics in Korea has been based on the concept of average speed and that the approach of applying the value of ratio has been strengthening more than the aspect of proportional relation. So we suggested two didactical suggestions: 1) the teaching of the speed concept should start with uniform movements. 2) the reasoning of proportional relation should be more strengthened.

• 도로교통
• /
• s.97
• /
• pp.14-27
• /
• 2004

도로에 있어 교통량이 일정한 수준을 초과하여 증가되는 경우 통행시간과 운행비용이 과도하게 증대되는 혼잡현상이 발생하게 된다. 이러한 혼잡은 경제적 관점에서 추가분의 통행자가 기존 이용자의 통행비용을 증가시키는 유형으로 해석되고 있고, 이에 대한 대응으로 많이 사용되어 왔던 방법이 개별 통행자에게 다른 이용자들의 통행비용 증가분에 상응하는 요금을 혼잡통행료로서 부과하는 방법이다. 이와 같은 혼잡통행료는 국내의 경우 도심부로 진입하는 특정 도로에 국한하여 시행되는 것을 일반적인 것으로 인식하고 시행해왔으나(서울시 남산1, 3호 터널) 국외의 경우에는 환경보호 및 수요조절 측면에서 고속도로까지 확대 시행하고 있는 사례를 찾아볼 수 있다. 이에 본 연구에서는 국내의 고속도로 요금체계 현황에서 혼잡 통행료의 도입방안 및 가능성을 검토하고자 한다. 고속도로의 현행 통행료 부과 방법 및 제도를 고려할 때 통행요금에 혼잡통행료를 도입할 경우 1)시간대별 차등요금제, 2)폐쇄식 및 개방식 구간에서의 차등요금제, 3)노선별, 구간별 차등요금제, 4)요일별, 계절별 차등요금제를 고려할 수 있다. 현재의 고속도로에서 혼잡통행료를 도입할 경우 현행 이부요금제의 주행요금에 혼잡통행료 개념을 도입하는 것이 타당할 것으로 검토된다. 시간대별 차등요금제는 그 시간대를 주간(06시~24시)과 야간(24시~06시)으로 구분함이 타당할 것으로 판단되고 폐쇄식 구간의 경우 혼잡도를 고려한 주행요금을 이용거리에 비례하여 부과하며 개방식 구간의 경우 최단 이용거리를 기준으로 혼잡도를 고려한 주행요금을 부과하는 것이 타당할 것으로 판단된다. 또한 혼잡도를 고려한 주행요금을 부과하는데 있어 노선별, 구간별 차등을 두는 것이 바람직할 것으로 기대된다. 그러나 요일별 차등요금제는 주 5일 근무제가 확산됨에 따라 증가하는 비업무 승용차의 통행에 의해 고속도로의 비효율적인 운영이 발생할 경우를 제외하고는 적용하지 않는 것이 타당할 것으로 검토된다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.755-758
• /
• 2001

본 논문에서는 서로 다른 크기의 클러스터에 대해서 효과적으로 데이터를 분류할 수 있는 내부클러스터를 이용한 개선된 FCM 알고리즘을 제안하였다. 내부클러스터는 평균내부거리 안쪽에 속하는 데이터 집합으로 클러스터의 크기와 밀도에 비례한다. 그러므로 이를 이용한 개선된 FCM 알고리즘은 기존의 FCM 알고리즘이 클러스터 크기가 다를 경우 퍼지분할과 중심탐색을 제대로 하지 못하는 문제점을 개선한 수 있다. 실험을 통하여 개선된 FCM 알고리즘이 분류 엔트로피에 의해 기존의 FCM 알고리즘 보다 더 좋은 결과를 나타냄을 알 수 있었다.

• Solar Energy
• /
• v.13 no.1
• /
• pp.1-10
• /
• 1993

The purpose of this research is to investigate the characteristics of heat transfer in the downward axisymmetric free water jet system impinged on a flat oblique plate which has the uniform heat flux. Experimental conditions considered were Reynolds number, distance between nozzle and Bat plate, inclination angle of heater surface and nozzle exit velocity. Local Nusselt number was subjected to the influence of Re number, Pr number, oblique angle of heating surface and local position of flat plate. In the wall region of downward surface, The secondary peak point of heat transfer appeared at the local point of X/D=-8 from the stagnation point. The stagnation heat transfer rate of this experimental study augments 2.4 times than that of laminar theorical solution. The stagnation nusselt number is function of Reynolds number, nozzle-plate spacing Prandtl number and oblique angle of impinging plate.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.22 no.2
• /
• pp.112-120
• /
• 1977

In Korea. the cultivating standard of stevia is not established yet. Because stevia is across-fertilizing plant. planting a cutting is its available propagation method. This study was made to know the effective propagation growth and adaptability of stevia in Jeju-do, according to the wintering effect and the planting density.

• Applied Biological Chemistry
• /
• v.44 no.1
• /
• pp.7-11
• /
• 2001

The distribution of procymidone in a small vinyl house containing cucumber plants or mimic plants was investigated after application of smoke generator. The deposition of procymidone on glass plate and filter paper was significantly similar to that on cucumber leaves, so that glass plate and filter paper could be substituted for cucumber leaves on deposition studies. The deposition of procymidone was proportional to the horizontally projected area of surface; the deposition on the horizontal surface was maximal, and the deposition was minimal for the perpendicular surface. The amount of deposition on the backside of leaf was less than 5% compared to that on the horizontal surface of leaf. The height of leaf from the floor was not a significant factor influencing on the deposition of procymidone whether leaves were overlapped or not. However, the deposition of procymidone on the overlapped leaves was relatively less than that on the unoverlapped leaves. And the deposition difference depending on the distance between leaves was not observable. Overall, the deposition of procymidone was proportionally increased with the application rate of smoke generator, but the deposition was inversely related to the sum of the total horizontal leaf area of mimic plants and the surface area of floor.