• Title/Summary/Keyword: transit network

Search Result 218, Processing Time 0.029 seconds

A Model for Analyzing Time-Varying Passengers' Crowdedness Degree of Subway Platforms Using Smart Card Data (스마트카드자료를 활용한 지하철 승강장 동적 혼잡도 분석모형)

  • Shin, Seongil;Lee, Sangjun;Lee, Changhun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.5
    • /
    • pp.49-63
    • /
    • 2019
  • Crowdedness management at subway platforms is essential to improve services, including the prevention of train delays and ensuring passenger safety. Establishing effective crowdedness mitigation measures for platforms requires accurate estimation of the congestion level. There are temporal and spatial constraints since crowdedness on subway platforms is assessed at certain locations every 1-2 years by hand counting. However, smart cards generate real-time big data 24 hours a day and could be used in estimating congestion. This study proposes a model based on data from transit cards to estimate crowdedness dynamically. Crowdedness was defined as demand, which can be translated into passengers dynamically moving along a subway network. The trajectory of an individual passenger can be identified through this model. Passenger flow that concentrates or disperses at a platform is also calculated every minute. Lastly, the platform congestion level is estimated based on effective waiting areas for each platform structure.

The progress of KMTNet microlensing

  • Chung, Sun-Ju;Gould, Andrew;Jung, Youn Kil;Hwang, Kyu-Ha;Ryu, Yoon-Hyun;Shin, In-Gu;Yee, Jennifer C.;Zhu, Wei;Kim, Hyun-Woo
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.44 no.1
    • /
    • pp.61.3-61.3
    • /
    • 2019
  • We report the status of KMTNet (Korea Microlensing Telescope Network) microlensing. From KMTNet event-finder, we are annually detecting over 2500 microlensing events. In 2018, we have carried out a real-time alert for only the Northern bulge fields. It was very helpful to select Spitzer targets. Thanks to the real-time alert, KMT-only events for which OGLE and MOA could not detect have been largely increased. The KMTNet event-finder and alert-finder algorithms are being upgraded every year. From these, we found 18 exoplanets and various interesting events, such as an exomoon-candidate, a free-floating candidate, and brown dwarfs, which are very difficult to be detected by other techniques including radial velocity and transit. In 2019, the KMTNet alert will be available in real-time for all bulge fields. As before, we will continue to collaborate with Spitzer team to measure the microlens parallaxes, which are required for estimating physical parameters of the lens. Thus, the KMTNet alert will be helpful to select Spitzer targets again. Also we plan to do follow-up observations for high-magnification events to study the planet multiplicity function. The KMTNet alert will play an important role to do follow-up observations for high-magnification events. Also, we will search for free-floating planets with short timescale (< 3 days) to study the planet frequency in our Galaxy.

  • PDF

Metro Station Clustering based on Travel-Time Distributions (통행시간 분포 기반의 전철역 클러스터링)

  • Gong, InTaek;Kim, DongYun;Min, Yunhong
    • The Journal of Society for e-Business Studies
    • /
    • v.27 no.2
    • /
    • pp.193-204
    • /
    • 2022
  • Smart card data is representative mobility data and can be used for policy development by analyzing public transportation usage behavior. This paper deals with the problem of classifying metro stations using metro usage patterns as one of these studies. Since the previous papers dealing with clustering of metro stations only considered traffic among usage behaviors, this paper proposes clustering considering traffic time as one of the complementary methods. Passengers at each station were classified into passengers arriving at work time, arriving at quitting time, leaving at work time, and leaving at quitting time, and then the estimated shape parameter was defined as the characteristic value of the station by modeling each transit time to Weibull distribution. And the characteristic vectors were clustered using the K-means clustering technique. As a result of the experiment, it was observed that station clustering considering pass time is not only similar to the clustering results of previous studies, but also enables more granular clustering.

An Analysis of the Effectiveness of Social Path Using the Space Syntax Technique (Space syntax 기법을 활용한 Social Path 효과분석)

  • Choi, Sung Taek;Lee, Hyang Sook;Choo, Sang Ho;Jang, Jin Young;Kim, Su Jae
    • Journal of Korean Society of Transportation
    • /
    • v.33 no.2
    • /
    • pp.192-203
    • /
    • 2015
  • Pedestrians not only walk along pedestrian pathways, but also choose unusual routes such as passing through buildings or crossing large scale open spaces. This study defines these unusual paths as social path, and includes them into one of the pedestrian road categories. Previous pedestrian accessibility and route choice studies could not evaluate correctly the space connectivity or optimal route because the social path was not considered properly. Therefore, this study analyzes the effectiveness of the social path in view of space connectivity focused on Coex and Seoul stations in Seoul, which are representative transit oriented development(TOD) areas. Global integration, which is widely used in network analysis, is selected (as performance index) to identify the space hierarchy and define new pedestrian links. The study results show that the network connectivity is improved especially in the main streets and social paths. This study demonstrated that the social path should be considered in finding the pedestrian optimal route from the practical perspective.

Fault Location Estimation Algorithm in the Railway High Voltage Distribution Lines Using Flow Technique (반복계산법을 이용한 철도고압배전계통의 고장점표정 알고리즘)

  • Park, Kye-In;Chang, Sang-Hoon;Choi, Chang-Kyu
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.22 no.2
    • /
    • pp.71-79
    • /
    • 2008
  • High voltage distribution lines in the electric railway system placed according track with communication lines and signal equipments. Case of the over head lines is occurrence the many fault because lightning, rainstorm, damage from the sea wind and so on. According this fault caused protection device to wrong operation. One line ground fault that occurs most frequently in railway high voltage distribution lines and sort of faults is line short, three line ground breaking of a wire, and so on. For this reason we need precise maintenance for prevent of the faults. The most important is early detection and fast restoration in time of fault for a safety transit. In order to develop an advanced fault location device for 22.9[kV] distribution power network in electric railway system this paper deals with new fault locating algorithm using flow technique which enable to determine the location of the fault accurately. To demonstrate its superiorities, the case studies with the algorithm and the fault analysis using PSCAD/EMTDC (Power System Computer Aided Design/Electro Magnetic Transients DC Analysis Program) were carried out with the models of direct-grounded 22.9[kV] distribution network which is supposed to be the grounding method for electric railway system in Korea.

Targeting Analysis of Lumenal Proteins of Chloroplast of Wheat using Proteomic Techniques

  • Kamal, Abu Hena Mostafa;Kim, Da-Eun;Oh, Myoung-Won;Chung, Keun-Yook;Cho, Yong-Gu;Kim, Hong-Sig;Song, Beom-Heon;Lee, Chul-Won;Uozumi, Nobuyuki;Choi, Jong-Soon;Cho, Kun;Woo, Sun-Hee
    • Proceedings of the Plant Resources Society of Korea Conference
    • /
    • 2010.05a
    • /
    • pp.14-14
    • /
    • 2010
  • Plastid proteomics are essential organelles present in virtually all cells in plants and green algae. Plastids are responsible for the synthesis and storage of key molecules required for the basic architecture and functions of plant cells. The proteome of plastid, and in particular of chloroplast, have received significant amounts of attention in recent years. Various fractionation and mass spectrometry (MS) techniques have been applied to catalogue the chloroplast proteome and its sub-organelles compartments. To better understanding the function of the lumenal sub-organelles within the thylakoid network, we have carried out a systematical analysis and identification of the lumenal proteins in the thylakoid of wheat by using Tricine-SDS-PAGE, and LTQ-ESI-FTICR mass spectrometry followed by SWISS-PROT database searching. We isolation and fractionation these membrane from fully developed wheat leaves using a combination of differential and gradient centrifugation couple to high speed ultra-centrifuge. After collecting all proteins to eliminate possible same proteins, we estimated that there are 407 different proteins including chloroplast, chloroplast stroma, lumenal, and thylakoid membrane proteins excluding 20 proteins, which were identified in nucleus, cytoplasm and mitochondria. A combination of these three programs (PSORT, TargetP, TMHMM, and TOPPRED) was found to provide a useful tool for evaluating chloroplast localization, transit peptide, transmembranes, and also could reveal possible alternative processing sites and dual targeting. Finally, we report also sub-cellular location specific protein interaction network using Cytoscape software, which provides further insight into the biochemical pathways of photosynthesis. The present work helps understanding photosynthesis process in wheat at the molecular level and provides a new overview of the biochemical machinery of the thylakoid in wheat.

  • PDF

Adaptive Buffer and Burst Scheme and Its Characteristics for Energy Saving in Core IP Networks (에너지 절약을 위해 적응적 버퍼링 기법을 이용한 버스트 구성 방법 및 특성)

  • Han, Chimoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.10
    • /
    • pp.34-42
    • /
    • 2012
  • This paper analyses the energy saving basic power models in core IP networks, and proposes the adaptive buffer and burst scheme which is a possible energy saving method, and its implementation algorithm in core IP networks. Especially this paper describes the adaptive buffer and burst scheme dynamically varying the buffering interval B according to the input traffic volume of ingress router, and explains the operation principle of proposed scheme. This method is to adjust the buffering interval B according to input traffic volume of ingress router, that is increasing the interval B when input traffic volume is low, and decreasing the interval B when input traffic volume is high between some given interval regions. This method can gets the high energy saving effect as decreasing the transition number of idle/active in networks when input traffic volume is low, and decreasing the transition number of idle/active by the continuous of burst packets in transit router when input traffic volume is high. This paper shows the increasing of asleep rate for the energy saving of core IP networks and confirms the energy saving of core IP networks by the computer simulation. We confirmed that proposed method can be save the energy of IP networks by properly trade off network performances.

Building a TDM Impact Analysis System for the Introduction of Short-term Congestion Management Program in Seoul (교통수요관리 방안의 단기적 효과 분석모형의 구축)

  • 황기연;김익기;엄진기
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.1
    • /
    • pp.173-185
    • /
    • 1999
  • The purpose of this study is to develope a forecasting model to implement short-term Congestion Management Program (CMP) based on TDM strategies in Seoul. The CMP is composed of three elements: 1) setting a goal of short-term traffic management. 2) developing a model to forecast the impacts of TDM alternatives, and 3) finding TDM measures to achieve the goal To Predict the impacts of TDM alternatives, a model called SECOMM (SEoul COngestion Management Model) is developed. The model assumes that trip generation and distribution are not changing in a short term, and that only mode split and traffic assignment are affected by TDM. The model includes the parameter values calibrated by a discrete mode choice model, and roadway and transit networks with 1,020 zones. As a TDM measure implement, it affects mode choice behavior first and then the speeds of roadway network. The chanced speed again affects the mode choice behavior and the roadway speeds. These steps continue until the network is equilibrated. The study recommends that CMP be introduced in Seoul, and that road way conditions be monitored regularly to secure the prediction accuracy of SECOMM. Also, TDM should be the major Policy tools in removing short-term congestion problems in a big city.

  • PDF

Acceleration sensor, and embedded system using location-aware (가속센서를 이용한 위치인식과 임베디드시스템)

  • Roh, Chang-Bae;Na, Won-Shik
    • Journal of Convergence Society for SMB
    • /
    • v.3 no.2
    • /
    • pp.51-56
    • /
    • 2013
  • Real-time processing of sensor data network, is one of the important factors. Each node in the detected data are required to be transmitted within a certain time since the accurate processing is possible. Thus, the data nodes are successfully delivered within a specified time, it is very important to check whether the. Recently more and more accurate real-time embedded systems are reliable and haejyeoseo been able to provide sophisticated services. Because of the inherent complexity of embedded systems in the physical world and the difficulty of predicting the difficulty of a safe design constraints on the runtime violation of system as to cause unexpected causes. Each node data in time detected by the time required to be passed in the appropriate processing is possible because the data transfer time in this paper, the monitoring of the sensor network through a node are allowed to exist within the time range and transmits data to the server Analysis of the data transfer time for checking whether the system was implemented. Implementation of the data transmission time to the process for analyzing and presenting, according to the procedure suggested by the transit time required for analysis a time difference analysis method, a data collection method and a data transmission time and transmission time calculating method presented.

  • PDF

Optimal Path Finding Considering Smart Card Terminal ID Chain OD - Focused on Seoul Metropolitan Railway Network - (교통카드 단말기ID Chain OD를 반영한 최적경로탐색 - 수도권 철도 네트워크를 중심으로 -)

  • Lee, Mee Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.6
    • /
    • pp.40-53
    • /
    • 2018
  • In smart card data, movement of railway passengers appears in order of smart card terminal ID. The initial terminal ID holds information on the entering station's tag-in railway line, the final terminal ID the exit station tag-out railway line, and the middle terminal ID the transfer station tag subway line. During the past, when the metropolitan city rail consisted of three public corporations (Seoul Metro, Incheon Transit Corporation, and Korail), OD data was expressed in two metrics of initial and final smart card terminal ID. Recently, with the entrance of private corporations like Shinbundang Railroad Corporation, and UI Corporation, inclusion of entering transfer line terminal ID and exiting transfer line terminal ID as part of Chain OD has become standard. Exact route construction using Chain OD has thus become integral as basic data for revenue allocation amongst metropolitan railway transport corporations. Accordingly, path detection in railway networks has evolved to an optimal path detection problem using Chain OD, hence calling for a renewed solution method. This research proposes an optimal path detection method between the initial terminal ID and final terminal ID of Chain OD terminal IDs within the railway network. Here, private line transfer TagIn/Out must be reflected in optimal path detection using Chain OD. To achieve this, three types of link-based optimum path detection methods are applied in order of 1. node-link, 2. link-link, 3. link-node. The method proposed based on additional path costs is shown to satisfy the optimal conditions.