• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.5
• /
• pp.401-406
• /
• 2012

This paper considers multi-agent systems with interval time-varying delays and switching interconnection topology. By construction of a suitable Lyapunov-Krasovskii's functional, new delay-dependent consensus control conditions for the systems are established in terms of LMIs (Linear Matrix Inequalities) which can be easily solved by various effective optimization algorithms. One numerical example is given to illustrate the effectiveness of the proposed methods.

• The KIPS Transactions:PartA
• /
• v.16A no.5
• /
• pp.347-356
• /
• 2009

Precise branch prediction is a critical factor in the IPC Improvement of modern microprocessor architectures. In addition to the branch prediction accuracy, branch prediction delay have a profound impact on overall system performance as well. However, it tends to be overlooked when the architects design the branch predictor. To tolerate branch prediction delay, this paper proposes Early Start Prediction (ESP) technique. The proposed solution dynamically identifies the start instruction of basic block, called as Basic Block Start Address (BB_SA), and the solution uses BB_SA when predicting the branch direction, instead of branch instruction address itself. The performance of the proposed scheme can be further improved by combining short interval hiding technique between BB_SA and branch instruction. The simulation result shows that the proposed solution hides prediction latency, with providing same level of prediction accuracy compared to the conventional predictors. Furthermore, the combination with short interval hiding technique provides a substantial IPC improvement of up to 10.1%, and the IPC is actually same with ideal branch predictor, regardless of branch predictor configurations, such as clock frequency, delay model, and PHT size.

• Journal of the Korean Society of Mineral and Energy Resources Engineers
• /
• v.55 no.6
• /
• pp.596-603
• /
• 2018

The traffic congestion is frequently occurring due to increasing demand for vehicles and development of subcenter in roads of domestic-downtown. The design of a Great depth underground double-deck tunnel planned for construction as a solution however it's mainly for a compact-car. Its low height and small section cause causalities when fire occurs. From this study, the delay system for fire smoke diffusion is developed to minimize the occurrence of casualties when fire occurs in the Great depth underground double-deck tunnel and the CFD(Computational Fluid Dynamics) is used to find the optimal installation interval and the blockage ratio to maximize the system effects. The study analyzed the shorter the installation interval of the system, the higher the smoke delay effect but the efficiency-change tends to be slight above a certain distance and the larger the blockage ratio, the higher the effect but the efficiency-difference is slight according to installation interval.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.4
• /
• pp.502-508
• /
• 2014

In this paper, a delay-dependent $H_{\infty}$ filtering problem is investigated for discrete-time delayed nonlinear systems which include a more general sector nonlinear function instead of employing the commonly used Lipschitz-type function. By using the Lyapunov-Krasovskii functional approach, a less conservative sufficient condition is established for the existence of the desired filter, and then, the corresponding solvability condition guarantee the stability of the filter with a prescribed $H_{\infty}$ performance level. Finally, two simulation examples are given to show the effectiveness of the proposed filtering scheme.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.38 no.6
• /
• pp.22-27
• /
• 2001

In this note, the asymptotic stability of interval time-delay systems with multiple delays is investigated. Sufficient conditions for the stability independent of delay and decaying rate for the system are derived in terms of the spectral radius. Numerical computations are performed to illustrate the result.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.137-143
• /
• 2015

A delay-line type time-to-digital converter (TDC) implemented in a field-programmable gate array (FPGA) is most widely owing due to its simple structure and high conversion rate. However, the delay-line type TDC suffers from nonlinearity error caused by the long delay-line because its time interval measurement range is determined by the length of the used delay line. In this study, a new TDC structure with a shorter delay line by taking a pulse train as an input is proposed for improved time accuracy and efficient use of resources. The proposed TDC utilizes a pulse-train with four transitions and a transition state detector that identifies the used transition among four transitions and prevents the meta-stable state without a synchronizer. With 72 delay cells, the measured resolution and maximum non-linearity were 20.53 ps, and 1.46 LSB, respectively, and the time interval measurement range was 5070 ps which was enhanced by approximately 343 % compared to the conventional delay-line type TDC.

• Journal of the Korea Society for Simulation
• /
• v.16 no.1
• /
• pp.1-9
• /
• 2007

The development of efficient Qualify of Service (QoS) routing algorithms in high speed networks is extremely difficult to achieve, because in order to operate, divergent services require various quality conditions. If the parameter of concern is to measure the delay on a specific link, the routing algorithm obtains the Least Delay (LD) path. Meanwhile, if the parameter is to measure the link cost, the Least Cost (LC) path is calculated. The Delay Constrained Least Cost (DCLC) path problem of the mixed issues on the LD and LC has been shown to be NP-hard. The path cost of LD path is relatively more expensive than that of the LC path, and the path delay of the LC path is relatively higher than that of the LD path in the DCLC problem. In this paper, we introduce the new factor for balancing cost and delay. The simulation result shows that our introduced factor is satisfied to solve the DCLC problem.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.94-99
• /
• 2001

Recently a lot of informations is interchanged among many users through the network such as Internet. In this situation. multimedia data transfer has some problems. that are jitter, the difference of delay in arriving packets, and loss of data due to the various delay between sender and receiver. The arriving data packets are not synchronized because of those problems. Especially, an efficient method is needed to revise the sudden large changes of the delay, called spike-like delay. which is occured in explosive growth of networking. We propose efficient synchronization algorithm which controls synchronization interval and adjusts to sudden changes in networks. The algorithm, a receiver-driven adaptive synchronization method, is to synchronize the arriving data packets against spike-like delay and decrease the loss of them. In addition, another method is proposed in this paper. The method uses the probabilistic features of delay distribution appearing in general network. It is evaluated for the loss of data packets and the delay times.

• Journal of Korean Society of Transportation
• /
• v.1 no.1
• /
• pp.56-63
• /
• 1983

Intersection control has dual-purposes; increasing capacity and reducing delay. The primary concern of efficient intersection control under oversaturated condition as in Korea is to increase capacity. Prevailing intersection operation technique permits thru traffic to utilize left turn lane, because the intersection without left turn pocket has left turn signal interval. In this situation, it seems not to be valid to calculate capacity, delay, and signal timings by conventional methods. By critical lane technique, capacity increases as cycle length increases. However, when thru traffic utilize LT lane, the capacity varies according to LT volume, LT interval as well as cycle length, which implies that specific cycle length and LT interval exist to maximize capacity for given LT volume. The study is designed is designed to calculate utilization factors of LT lane for thru traffic and capacities, and identify signal timings to yield maximum capacity. The experimental design involved has 3 variables; 1)LT volumes at each approach(20-300 vph), 2)cycle lengths (60-220 sec), and 3)LT intervals(2.6-42 sec) for one scenario of isolated intersection crossing two 6-lanes streets. For LT volume of 50-150 vph, capacity calculated by using the utilization factor is about 25% higher than that by critical lane method. The range of optimum cycle length to yield maximum capapcity for LT volume less than 120 vph is 140-180 sec, and increases as LT volume increases. The optimum LT interval to yield maximum capacity is longer than the intrval necessary to accommodate LT volume at saturation flow rate.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.8
• /
• pp.19-27
• /
• 2016

Nowadays the adaptive buffering techniques for burst stream packet configuration and its operation algorithm to save energy in IP core network have been studied. This paper explains the selection method of packet buffering interval for energy saving when configuring burst stream packet at the ingress router in IP core network. Especially the adaptive buffering interval and its implementation scheme are required to improve the energy saving efficiency at the input part of the ingress router. In this paper, we propose the best adaptive buffering scheme that a current buffering interval is adaptively buffering scheme based on the input traffic of the past buffering interval, and analyze its characteristics of energy saving and end-to-end delay by computer simulation. We show the improvement of energy saving effect and reduction of mean delay variation when using an appropriate inverse-function selecting the buffering interval for the configuration of burst stream packet in this paper. We confirm this method have superior properties compared to other method. The proposed method shows that it is less sensitive to the various input traffic type of ingress router and a practical method.