• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.2
• /
• pp.1-12
• /
• 2017

The Seoul metropolitan transportation card's high value lies in its recording of total population movements of the public transit system. In case of recorded information on transit by bus, even though route information utilized by each passenger is accurate, the lack of passenger transfer information of the urban railway makes it difficult to estimate correct routes taken by each passenger. Therefore, pinpointing passenger path selection patterns arising in the metropolitan railway network and using this as part of a path movement estimation model is essential. This research seeks to determine that features of passenger movement routes in the urban railway system is comprised of M-similar routes with increasing number of transfer reflected as additional costs. In order to construct the path finding conditions, an M-similar route searching method is proposed, embedded with non additive path cost which appears through inclusion of the stepwise transportation parameter. As well, sensitivity of the M-similar route method based on transportation card records is evaluated and a stochastic trip assignment model using M-similar path finding is constructed. From these, link trip and transfer trip results between lines of the Seoul metropolitan railway are presented.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.5
• /
• pp.91-99
• /
• 2019

Existing node-to-node based optimal path searching is built on the assumption that all destination nodes can be arrived at from an origin node. However, the recent appearance of the adaptive path search algorithm has meant that the optimal path solution cannot be derived in node-to-node path search. In order to reflect transportation data at the links in real-time, the necessity of the node-to-link (or link-to-node; NL) problem is being recognized. This research assumes existence of a network with link-label and non-additive path costs as a solution to the node-to-link optimal path problem. At the intersections in which the link-label has a turn penalty, the network retains its shape. Non-additive path cost requires that M-similar paths be enumerated so that the ideal path can be ascertained. In this, the research proposes direction deletion and turn restriction so that regulation of the loop in the link-label entry-link-based network transformation method will ensure that an optimal solution is derived up until the final link. Using this method on a case study shows that the proposed method derives the optimal solution through learning. The research concludes by bringing to light the necessity of verification in large-scale networks.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.6
• /
• pp.36-46
• /
• 2016

Separate transportation card readers that record the amount of transfer volume occurring during movement in-between lines within the metropolitan railway transfer stations do not exist. This research proposes a model to estimate passenger transit movements in transfer stations that adequately reproduces characteristics arising during a transfer trip. The model used in this study assumes that passengers adopt transfer behaviors that minimize their generalized costs during transfer trips. Further, two measures are sought in order to reflect attributes of the metropolitan railway. The first is that similar paths connect origin and destination stations. For this, the M-Similar Paths method is applied to the model to identify the similar paths that arise. The second is that passengers perceive increasing number of transfers as additional transfer costs, which is reflected by means of the Stepwise Transfer Coefficient. Two case studies of metropolitan railway are used to propose measures for analysis of transfer trips. Twenty directional transit phenomena are reproduced for Sindorim railway station. Aggregate directional transit(A), aggregate inter-line transit(B), and B/A are calculated on a percentage basis for 33 metropolitan railway transfer stations, and using this, the functional role of transfers is explored.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1450-1456
• /
• 2015

The received signal strengths according to the propagation distance between a transmitting shore station with a 53 m antenna hight and a receiving ship station with about 6m antenna hight from 700 m upto about 20 km are measured at ship's moving velocity of $5{\pm}1m/s$ using a single carrier signal at 150.0625MHz. In this paper, the path loss exponents at the propagation distance from 700 m to 20km are estimated via minimum-mean-square-error method using the measurements of the received signal strength, and the mean of the estimated path loss exponent become 3.79. The estimated propagation path loss exponents is similar to that calculated based on the field-strength values from 2 km to 20 km in Annex 2 of ITU-R P.1546-4, which is measuring results at maritime VHF at 100 MHz carrier frequency. Therefore, the estimated propagation path loss exponent shall be used as the expected path loss exponents for summer in costal area of South Sea of Korea.

• Journal of Marine Life Science
• /
• v.6 no.2
• /
• pp.73-79
• /
• 2021

Bisphenol A is a representative endocrine disruptor and continuously detected in aquatic environment due to wide use, resulting in adverse effects on growth, development, and reproduction in diverse organisms as well as human. Structural analogs have been developed to substitute BPA are also suspected to have endocrine disrupting effects. In the present study, the time-dependent expression patterns of ecdysteroid synthesis (nvd, cyp314a1), receptors (EcRA, EcRB, USP, ERR), and downstream signaling pathway - related genes (HR3, E75, Vtg, VtgR) were investigated using quantitative real time reverse transcription polymerase chain reaction (qRT-PCR) in the brackish water flea Diaphanosoma celebensis exposed to Bisphenol analogs (BPs; BPA, BPF, and BPS) for 6, 12, and 24 h. As results, the expression of nvd, cyp314a1, EcRs, USP, ERR and E75 mRNA was upregulated at 6 h exposure to BPF, which is earlier than BPA and BPS (12 h). On the other hand, HR3, E75 and VtgR mRNA levels were elevated at 6 h earlier at BPS and BPF than at BPA (12 h), but Vtg mRNA level was slightly changed within 24 h. These findings suggest that like BPA, BPF and BPS can also modulate the transcription of ecdysteroid pathway - related genes with different mechanisms, and have a potential as endocrine disruptors. This study will provide a better understanding the molecular mode of action of bisphenols on ecdysteroid pathway in the brackish water flea.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.4 no.2
• /
• pp.4-10
• /
• 1993

In mobile radio communication, propagation paths are time or spacial varying because of the motion of mobile unit. The propagation path loss not only involves frequency and distance but also the antenna height at both the base station and the mobile unit, terrain configuration, and the man made en- vironment. Thhese additional factors make the prediction of propagation path loss of mobile radio signals more difficult. In this paper, it is measured field strenght of mobile radio signals in Daejeon and Seoul area, also calculated local median, 500m sample mean, and stadard deviation. As the result of analysis, it can be seen that propagation path loss of measured data is similiar to predicted field strength, especially local median is dependent upon base antenna height, terrain configuration and the man-made environment. The standard deviation has been noted to lie between 2 and 10 dBuV.

• Annual Conference of KIPS
• /
• 2015.10a
• /
• pp.469-470
• /
• 2015

우리는 그룹핑 k-최근접 (Grouping k Nearest Neighbor; GkNN)질의를 지원하기 위하여 유연한 최근접객체(Flexible Nearest Neighbor; FNN)검색 방법을 제안한다. GkNN이란 기존에 제안된 kNN과 다르게 질의자가 요청한 k개의 객체를 모두 확인한 후에 이동 경로의 총합이 가장 작은 k개의 객체를 검색하는 방법이다. 기존 연구에서 제안된 최근접 객체들 (Nearest Neighborhood; NNH) 또한 이 문제를 해결하기 위하여 제안되었다. 그러나 NNH의 문제점은 객체 k와 p가 고정되어 있기 때문에 이동 환경에서 q에서 C까지의 거리가 증가하는 것이다. FNN의 환경은 NNH의 환경과 유사하다. 우리는 NNH의 q에서 집합 C 중 거리 중 가장 짧은 $c_i$ 선택한 후 q에서 $c_i$에 포함된 객체들 모두 검색하는 이동 경로의 총합과 FNN의 이동경로의 총 합을 비교하여 NNH의 문제점을 해결하였다.

• Annual Conference of KIPS
• /
• 2021.11a
• /
• pp.75-78
• /
• 2021

경로 탐색을 위해 RREQ 패킷을 절대적으로 플러딩하는 방식에 따라 높은 채널 경합 및 과도한 패킷 충돌이 발생하는 AODV 의 문제점을 해결하기 위해 제어 패킷을 감소시키려는 여러 방법들이 제안되었다. 이러한 기법들은 주 경로에 포함되는 노드 수를 제한함으로써 전반적인 제어 패킷의 발생을 감소시켰으나 경로가 유사한 경우 전송되는 중복된 제어 패킷에 의한 오버헤드 상승 문제는 고려하지 않았다. 이러한 문제를 해결하기 위해 본 논문에서는 목적지와의 거리에 따라 RREQ 의 전송 순서를 동적으로 조정하는 기법을 제안한다. 제안된 방법은 시뮬레이션을 통하여 성능을 평가하였다.

• Annual Conference of KIPS
• /
• 2003.11a
• /
• pp.169-172
• /
• 2003

최근에 대규모 병렬컴퓨터의 새로운 위상으로 HHN(m;n,h) 그래프가 제안되었다. HHN(m;n,h) 그래프는 하이퍼큐브에 기반한 계층적인 상호 연결망이며, 노드개수가 유사한 하이퍼큐브보다 작은 노드 분지수와 작은 링크의 수를 가지고 있기 때문에 대규모 병렬 컴퓨터를 구성하는 상호 연결망이지만, 심플 라우팅 알고리즘에 기반한 경로를 구성함으로써 불필요한 라우팅 경로를 갖는 단점이 있다. 따라서 본 논문에서는 심플 라우팅 알고리즘보다 평균거리가 개선된 새로운 라우팅 알고리즘을 제안하고, HHN(3;3,2)를 기준으로 비교하였을 때 대략 32%정도 향상됨을 보인다.

• Annual Conference of KIPS
• /
• 2008.05a
• /
• pp.812-815
• /
• 2008

이동 호스트의 이동에 따른 단절 또는 장애는 애드혹 네트워크에서 중요한 이슈중 하나이다. 응답 메시지를 전송하기 위해, DSR 이나 AODV 에서는 메시지 전송 요청을 위해 설정된 경로를 재사용한다. 즉, 설정된 경로를 이용해서 역방향으로 응답 메시지를 전송 하는 방식이다. 이러한 경우, 설정된 경로상에 있는 이동 호스트의 이동에 따른 장애는 매우 치명적이다. 이동 호스트에 의한 장애는 예측 가능성에 따라 예측 가능한 장애와 예측 불가능한 장애로 구분할 수 있다. 예측 가능한 장애는 이동 호스트가 스스로 장애의 발생 여부를 파악 할 수 있는 경우를 의미한다. 예를 들면, 이동호스트의 제한된 전원 또는 이동 호스트의 이동성에 의해 발생하는 장애가 대표적인 예이다. 반면에 예측 불가능한 장애는 이동 호스트가 스스로 장애를 예측 할 수 없는 경우를 의미하며, 이러한 장애의 대부분은 문제를 해결할 충분한 시간이 주어지지 않을 만큼 급작스럽게 발생한다. 본 논문에서는 예측 가능한 장애에 대해 능동적이고 지능적으로 대처할 수 있도록 하는 새로운 방법을 제안한다. 이는 회사 내에서 업무를 인수 인계하는 방식과 매우 유사하다. 또한 본 논문에서 제안하는 방법은 앞서 언급한 이동 호스트의 이동에 따른 장애 문제를 해결함에 있어서, DSR 또는 AODV 처럼 메시지 전송 요청 시 설정된 경로가 응답 메시지 전송을 위해 다시 사용되는 라우팅 알고리즘에 비해 경로 재설정 시간과 전송 되는 메시지의 총량 측면에서 매우 효과적이고, 이동 호스트들이 스스로 장애를 예측하고 이에 대해 능동적이고 지능적으로 대처 할 수 있도록 한다.