• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2801-2811
• /
• 1997

This thesis Proposes a media synchronization mechanism for video conferencing system by analyzing a variation of the delay time of media. Using this mechanism, this thesis analyzes the media traffics and determines the values of external variables important on waiting time. This system uses some dummy streams to get the time. When two hosts are initially connected, they change the dummy streams by which a logical time of the sender may be extracted. The time presenting a media stream is a sum of base time, logical time and the waiting time. At this time, for the purpose of optimally adjusting the waiting time, this mechanism uses the rate of updating the waiting time and the sampling unit of media. These values are acquired by analyzing the waiting times, the delay rates and the delayed arrival times.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.367-376
• /
• 2003

This study deals with the DCMST (Delay constrained Capacitated Minimum Spanning Tree) problem applied in the topological design of local networks or finding several communication paths from root node. While the traditional CMST problem has only the traffic capacity constraint served by a port of root node, the DCMST problem has the additional mean delay constraint of network. The DCMST problem consists of finding a set of spanning trees to link end-nodes to the root node satisfying the traffic requirements at end-nodes and the required mean delay of network. The objective function of problem is to minimize the total link cost. This paper presents two-phased heuristic algorithm, which consists of node exchange, and node shift algorithm based on the trade-off criterions, and mean delay algorithm. Actual computational experience and performance analysis show that the proposed algorithm can produce better solution than the existing algorithm for the CMST problem to consider the mean delay constraint in terms of cost.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1259-1265
• /
• 2006

In this paper, we propose a combined synthetic algorithm of the logic level for high speed FPGA design. The algorithm divides critical path to reduce delay time and generates a circuit which the divided circuits execute simultaneously. This kernel selection algorithm is made by C-langage of SUN UNIX. We compare this with the existing FlowMap algorithm. This proposed algorithm shows result on 33.3% reduction of delay time by comparison with the existing algorithm.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2003.09a
• /
• pp.548-551
• /
• 2003

부산 금정산 지역의 지하수위와 강우량과의 관계를 알아보고자 시계열 분석을 통하여 자기상관함수와 상호상관함수를 구하였다. 이를 위하여 금정산 산성마을 주변의 19개 관측공 중 자동수위측정기가 설치된 4개 관측공(KJ2, KJ8, KJ15, KJ19)의 지하수위 자료와 부산지역의 강우량 자료를 이용하였다. 지하수위 및 강수량은 각각 1일 평균, 1일 누적 값을 이용하였다. 자기상관분석의 경우, KJ2와 KJ19의 경우 지연시간이 2일 이내, KJ8의 경우는 3일 이내에 0으로 수렴하며, KJ15의 경우는 지연시간이 8일째에 0으로 수렴한다. 강수량과 지하수위의 교차상관분석결과, KJ2, KJ15, KJ19호 공은 지연시간이 0일 때 교차상관함수가 각각 0.6572, 0.6303, 0.7857이교 KJ8호 공은 지연시간이 1일 때 0.7141이다. 또한 대부분 짧은 지연시간에 교차상관함수가 0으로 수렴한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.684-693
• /
• 2003

This paper analyzes transmissiondelays of a message and a packet in a time-varying and packet-based radio link. The paper assumes that thearrivals of messages have a Bernoulli process and the lengths of the messages a exponential distribution. To reflect the feature of the time-varying radio link, we use a two-state Markov model. From the model the mean transmission delay of and the mean queue length of the packet are analyzed in terms of the packet distribution function, the packet transmission service time, and the PER of the radio link. And the mean message transmission delay time and the mean queue length are derived using the performance indices of the packet. Numerical results show that the message arrival rate and the message length have some bounds to keep the transmission of the message steady and to improve the performance indices of the message. It can be known that the PER of the state influences on the performance indices more than the sojourn time of the state.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.14 no.4
• /
• pp.81-88
• /
• 2011

본 연구는 관리조방형 옥상녹화 시스템의 우수유출 저감 및 유출지연 효과를 규명하기 위하여 2007년~2010년의 4년간 연구를 진행하였다. 실험대상지는 서울여자대학교 행정관 옥상에 조성된 관리조방형 옥상녹화지로 2007년에 조성하였으며, 세덤류 및 다년생 초화류를 포함하여 총 18종의 식물을 식재하였다. 우수유출 저감 및 지연효과를 지속적으로 모니터링하기 위해 옥상녹화지를 통과한 우수를 저장할 수 있는 시스템을 설치하여 유출수의 유입량 및 시간을 측정였다. 조사기간 중 총 24번의 강우사례를 분석한 결과 단위면적당 평균 약 90.3%(78.8~99.3%)의 유출량이 저감되었으며, 지연시간은 평균 약 1.6시간으로 나타났다. 본 연구결과를 종합분석해본 바, 빗물이 거의 전량 유출되는 도심의 건축물 옥상을 녹화함으로써 옥상에 유입되는 우수의 유출을 지연 및 저감시켜 도심의 수순환체계 개선에 기여할 수 있을 것으로 생각된다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.180-187
• /
• 2002

Many real-time multimedia applications, such as video conferencing have stringent end-to-end delay constraints and consume large amount of network resources. In order to support these applications efficiently, multicast routing algorithms computing least cost multicast trees that satisfy a given end-to-end delay constraint are needed. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that reduces a “finding multicast tree”that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has much better average cost performance than other existing algorithms.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.3
• /
• pp.61-72
• /
• 2002

In this paper, we propose two timing-driven routing algorithms for single-source net and multi-source net as applications of 1-Steiner heuristic algorithm. Using the method of substituting the cost of 1-Steiner heuristic algorithms with interconnection delay, our routing algorithms can route both single-source net and multi-source net which have all critical source-terminal pairs or one critical pair efficiently Our single-source net routing algorithm reduced the average maximum interconnection delay by up to 2.1% as compared with previous single-source routing algorithm, SERT, and 10.6% as compared with SERT-C. and Our multi-source net routing algorithm increased the average maximum interconnection delay by up to 2.7% as compared with MCMD A-tree, but outperforms it by up to average 1.4% when the signal net has only subset of critical node pairs.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.5
• /
• pp.29-38
• /
• 2018

This study aims to propose a method for the estimation of operational delay cost using transportation card data in bus accidents. Average operational delay time from bus accidents was surveyed among 12 bus companies through an interview method. Then, the operational delay cost was estimated using actual traffic accident data and transportation card data. Results showed that average loss time per bus accident was found to be 45 minutes. In addition, total occupancy of 659 was estimated for the accidents investigated using transportation card data, resulting a total loss time of 494.25 hours. An estimated operational delay cost was 186.9 thousand won per accident, which was 6.37% of social agency cost. The magnitude of this number implied that operational delay cost may have a significant impact on traffic accident cost if included.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.12
• /
• pp.261-269
• /
• 2013

In this paper, the evoked potential(EP) was represented by additive delay model to comply with the variational noisy response of stimulus-event synchronization. The hybrid method of delay compensated-Wiener filtered-ensemble averaging(DWEA) was proposed to enhance the EP signal distortion occurred during averaging procedure due to synchronization timing mismatch. The performance of DWEA has been tested by surrogated simulation, which is composed of synthesized arbitrary delay and arbitrary level of added noise. The performance of DWEA is better than those of Wiener filtered-ensemble averaging and of conventional ensemble averaging. DWEA is endurable up to added noise gain of 7 for 10 % mean square error limit. Throughout the experimentation observation, it has been demonstrated that DWEA can be applied to enhance the evoked potential having the synchronization mismatch with added noise.