• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.233-236
• /
• 2000

A new time-to-digital converter is designed and the converter is based on a voltage-to-frequency converter and a counter. The converter output is obtained without delay time and the resolution improves with increasing input time interval because the output of voltage-to-frequency converter increases linearly. In the designed circuit the input time intervals range is from 100nsec to 3${\mu}$ sec.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.1013-1019
• /
• 2016

This paper describes a novel Context-awareness Markov Chain Prediction (CMCP) algorithm based on movement prediction using Markov chain in Delay Tolerant Network (DTN). The existing prediction models require additional information such as a node's schedule and delivery predictability. However, network reliability is lowered when additional information is unknown. To solve this problem, we propose a CMCP model based on node behaviour movement that can predict the mobility without requiring additional information such as a node's schedule or connectivity between nodes in periodic interval node behavior. The main contribution of this paper is the definition of approximate speed and direction for prediction scheme. The prediction of node movement forwarding path is made by manipulating the transition probability matrix based on Markov chain models including buffer availability and given interval time. We present simulation results indicating that such a scheme can be beneficial effects that increased the delivery ratio and decreased the transmission delay time of predicting movement path of the node in DTN.

• Tunnel and Underground Space
• /
• v.15 no.1 s.54
• /
• pp.61-70
• /
• 2005

The objective of this study was to analyze the smoke movement for the case of fire and to determine the interval between emergency exits in long tunnels. Based on Froude modeling, the 1/50 scaled model tunnel (20 m long) was constructed by acrylic tubes and tests were carried out systematically. From the strong relationship between CO propagation time and distance through the tunnel, it was found that the optimal escaping time was 6 minutes in case of 20MW fire. But, regarding passengers' psychological state under fire, another one minute of delay time should be considered. Therefore, the total escaping time should be estimated by 5 minutes. The interval between the emergency exits for vehicle passengers was calculated by 250 m with respect to the 5 minute of escaping time.

• Journal of IKEEE
• /
• v.26 no.4
• /
• pp.590-595
• /
• 2022

When a train is delayed because of a disturbance, the time interval deviation between successive trains increases, and high frequency metro lines can become unstable. Thus, it is necessary to control the traffic regularity to prevent any such instability. In this paper, we propose a simple but effective traffic regulation algorithm that gurantees system stability. In the proposed method, the control algorithm for running time is designed using a discrete traffic model where control input is determined from a linear combination of departure time deviations and control input of the preceding train to ensure an optimal time interval between successive trains. The results of the computer simulation are also given to demonstrate the validity of the proposed algorithm.

• Tunnel and Underground Space
• /
• v.16 no.4 s.63
• /
• pp.326-333
• /
• 2006

In this study, the vibration waveform of the single hole which is not interfered from the different blasting holes is separated, the each dominant frequency which is determinated through the Fast Fourier Transform(FFT) is measured. Also the separation waveform executed a superposition modeling which changes to delay time from 1ms to 80 ms in 1ms interval and controls the number of blasting holes from 2 holes to 15 holes in order to investigate the effect of PPV according to the duration time of the vibration and the number of blasting holes. As a result of analysis, the longer the duration time of the vibration, the longer the delay time which is not interfered from the different blasting holes and the effect regarding the number of blasting holes from inside identical delay time did not appear a lot.

• Journal of Advanced Navigation Technology
• /
• v.22 no.6
• /
• pp.630-635
• /
• 2018

In this paper, we consider the stability condition for the linear discrete systems with time-varying delay and unstructured uncertainty. The considered system has time invariant system matrices for non-delayed and delayed state variables, but its delay time is time-varying within certain interval and it is subjected to nonlinear unstructured uncertainty which only gives information on uncertainty magnitude. In the many previous literatures, the time-varying delay and unstructured uncertainty can not be dealt in simultaneously but separately. In the paper, new stability conditions are derived for the case to which two factors are subjected together and compared with the existing results considering only one factor. The new stability conditions improving many previous results are proposed as very effective inequality equations without complex numerical algorithms such as LMI(Linear Matrix Inequality) or Lyapunov equation. By numerical examples, it is shown that the proposed conditions are able to include the many existing results and have better performances in the aspects of expandability and effectiveness.

• Proceedings of the KSMRM Conference
• /
• 2003.10a
• /
• pp.44-44
• /
• 2003

To determine feasibility of contrast-enhanced MRI (co-MRI) at true end-diastole (ED) free from limitation of time for inversion-recovery and trigger window for quantifying transmural extent of infarction. 대상 및 방법： MRI was performed in 18 patients with myocardial infarction. Cine imaging and co-MRI with same registered slices in short axis were peformed. To allow true ED co-MRI, ECG synchronization should use two RR-intervals for one acquisition of a segment of k-space by setting the heart rate to half that of the true heart rate. Trigger delay time was adjusted to the RR-interval for imaging at ED and to the sum of RR-interval plus the time between R-wave and the end-systole (ES) determined in cine images for imaging at ES.

• Proceedings of the KSMRM Conference
• /
• 2003.10a
• /
• pp.91-91
• /
• 2003

To determine feasibility of contrast-enhanced MRI (co-MRI) at true end-diastole (ED) free from limitation of time for inversion-recovery and trigger window for quantifying transmural extent of infarction. 대상 및 방법： MRI was peformed in 18 patients with myocardial infarction. Cine imaging and co-MRI with same registered slices in short axis were performed. To allow true ED co-MRI, ECG synchronization should use two RR-intervals for one acquisition of a segment of k-space by setting the heart rate to half that of the true heart rate. Trigger delay time was adjusted to the RR-interval for imaging at ED and to the sum of RR-interval plus the time between R-wave and the end-systole (ES) determined in cine images for imaging at ES.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1174-1177
• /
• 1987

The design of flow control protocols for integrared networks with complete voice traffic on the data link level is investigated. The class of admissible flow control policies analyzed maximized the average data link throughput subject to an average system time delay constraints a finite intervals (O,s). In particular, it is shown that the optimum control law is bang-bang (window flow mechanism). The window size L can be analytically derived from maximum tolerated time delay T, the input arrival C of the queueing system, the duration of the time interval S, the initial number of packets in the queue.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.9
• /
• pp.1809-1814
• /
• 2009

In this paper, the problem of stability analysis for neural networks with discrete and distributed time-varying delays is considered. By constructing a new Lyapunov functional, a new delay-dependent stability criterion for the network is established in terms of LMIs (linear matrix inequalities) which can be easily solved by various convex optimization algorithms. Two numerical example are included to show the effectiveness of proposed criterion.