• Journal of the Semiconductor & Display Technology
• /
• v.18 no.3
• /
• pp.127-132
• /
• 2019

This paper presents an overview of automotive communication technologies, including related technology developments. We describe the latency of Audio Video Bridge (AVB) network as well as purpose the optimized design of the Ethernet network system for automotive. Our design plays a significant role in reducing the delay between components. The proposed approach on realistic test cases showed that there was a delay reduction, approximately 49.4%. It is expected that the optimization method for the actual automotive environment can greatly shorten the time period in the design and development process. The results obtained from the experiments on the delay time present in each function are reliable because average values are obtained through repeated actual tests for several months. It will greatly benefit the industry since analyzing the latency between each function in a short period of time is very important.

• The Korean Journal of Physiology
• /
• v.23 no.1
• /
• pp.139-149
• /
• 1989

Although tail flick reflex (TFR) in rats has been used as a classic model of the nociceptive test to evaluate the action of analgesics, there have been few studies on the origin of the latent period of TFR. Present study was performed to elucidate the mechanism of increase in latency of TFR by morphine in anesthetized rats. Tail skin and dorsolateral tail nerve were stimulated electrically and EMG activities were recorded from abductor caudae dorsalis muscle participating in tail flick reflex. In the case of noxious radiant heat stimulation to tail, the tail flick tension was recorded before and after administration of morphine. Then changes in latency and conduction velocity of peripheral nerve were evaluated. The results obtained were as follows: 1) The latencies of TFR evoked by the electrical stimulation of tail skin and dorsolateral tail nerve were all within 40 ms and were elongated by several milliseconds from control after the administration of morphine. Peripheral conduction velocities of tail flick afferent nerve were within the range of 10-25 m/s. 2) The conduction velocity of peripheral nerve was significantly reduced after morphine administration, therefore the afferent time (utilization time+conduction time to spinal cord) was significantly increased. But the time for central delay and efferent time was not affected by morphine. 3) The conduction velocity under room temperature $(20-25^{\circ}C)$ was significantly reduced after morphine while that under vasodilation state $(40{\sim}42^{\circ}C)$ increased, 30 min and 45 min after morphine. The conduction velocity under vasodilation state without treatment of morphine increased continuously 4) The latency in tension response of TFR evoked by electrical stimulation was elongated by several milliseconds from control while the latency evoked by noxious radiant heat was elongated by several seconds compared with that of control. From the above results, it could be concluded that: 1) the increased latency of TFR evoked by electrical stimulation of the tail after morphine administration was due to the reducton in conduction velocity of peripheral nerve, which was the secondry effect of morphine on the peripheral vasomotion and 2) increased latency of TFR evoked by noxious radiant heat was also due to the same effect of morphine and the increase in cutaneous insulation to the noxious heat.

• Journal of the Korea Safety Management & Science
• /
• v.11 no.4
• /
• pp.213-220
• /
• 2009

The minimum latency problem, also known as the traveling repairman problem and the deliveryman problem is to minimize the overall waiting times of customers, not to minimize their routing times. In this research, a genetic algorithm, a clonal selection algorithm and a population management genetic algorithm are introduced. The computational experiment shows the objective value of the clonal selection algorithm is the best among the three algorithms and the calculating time of the population management genetic algorithm is the best among the three algorithms.

• The Bulletin of The Korean Astronomical Society
• /
• v.36 no.1
• /
• pp.70.1-70.1
• /
• 2011

During the summer of 2010, the first low-latency search for gravitational waves from compact binary coalescences was performed using the LIGO and Virgo instruments. The aim was to provide triggers for follow-up by electromagnetic telescopes. In this presentation we will describe the low-latency pipeline used to produce these triggers, including the time-delay-based procedure used to localize them on the sky.

• Proceedings of the KOSOMBE Conference
• /
• v.1994 no.12
• /
• pp.113-116
• /
• 1994

Estimation of the evoked potential using the iterated bispectrum and cross-correlation (IBC) has been tried for both simulation and real clinical data. Conventional time average (TA) method suffers from synchronization error when the latency time of the evoked potential is random, which results in poor SNR distortion in the estimation of EP waveform. Instead of EP signal average in time domain, bispectrum is used which is insensitive to time delay. The EP signal is recovered by the inverse transform of the Fourier amplitude and phase obtained from the bispectrum. The distribution of the latency time is calculated using cross-correlation between EP signal estimated by the bispectrum and the acquired signal. For the simulation. EEG noise was added to the known EP signal and the EP signal was estimated by both the conventional technique and bispectrum technique. The proposed bispectrum technique estimates EP signal more accurately than the conventional technique with respect to the maximum amplitude of a signal, full width at half maximum(FWHM). signal-to-noise-ratio, and the position of maximum peak. When applied to the real visual evoked potential(VEP) signal. bispectrum technique was able to estimate EP signal more distinctively. The distribution of the latency time may play an important role in medical diagonosis.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.5
• /
• pp.529-546
• /
• 2002

A VOD server, which is the central component for constructing VOD systems, requires to provide high bandwidth and continuous real-time delivery. It is also necessary to the sophisticated disk scheduling and data placement schemes in VOD sewers. One of the most common problem facing in such a system is the high initial latency time to service multiple users concurrently. In this paper, we propose a dynamic stream merging scheme for reducing the initial latency time in VOD servers. The proposed scheme allows clients to merge streams on a request as long as their requests fall within the reasonable time interval. The basic idea behind the dynamic stream merging is to merge multiple streams into one by increasing the frame rate of each stream. In the performance study, the proposed scheme can reduce the initial latency time under the minimum buffer use and also can enhance the performance of the VOD server with respect to the capacity of user admission.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1207-1214
• /
• 2002

A scheduling scheme for high speed networks requires a low time complexity to schedule packets in a packet transmission time. High speed networks support a number of connections, different rates for each connection and variable packet length. Conventional round robin algorithms have a time complexity of O(1), but their short time fairness, latency and burstiness depend on the quantum of a connection due to serving several packets for a backlogged connection once a round. To improve these properties, we propose in this paper an efficient packet scheduling scheme which is based on the credits of a connection and has a time complexity of O(1). We also analyzed its performance in terms of short time fairness, latency and burstiness. The analysis results show that the proposed scheme can improve the performance compared with traditional round robin schemes. The proposed scheme can be easily utilized in high speed packet networks.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.10
• /
• pp.105-113
• /
• 2022

In this paper, we present and analyze 5G system and IEEE time-sensitive networking(TSN) and propose a novel mobility management scheme for time sensitive communications in 5G-TSN to support ultra-low latency networks. Time-sensitive networking(TSN) has a promising future in the Industrial Automation and Industrial Internet of Things(IIoT), as a key technology that is able to provide low-latency, high-reliable and deterministic communications over the Ethernet. When a TSN capable UE moves the TSN service coverage from the non-TSN service coverage, the UE cannot get the TSN service promptly because the related mobility management is not performed appropriately. For the mobility situation with the TSN service coverage, the proposed scheme reports TSN capability to the network and triggers the initial registration in order to be provided the TSN service immediately and ultra-low latency communications compared to existing schemes in 5G mobile networks.

• The Journal of the Acoustical Society of Korea
• /
• v.42 no.2
• /
• pp.102-111
• /
• 2023

Automatic Music Transcription (AMT) is a task that detects and recognizes musical note events from a given audio recording. In this paper, we focus on reducing the latency of real-time AMT systems on piano music. Although neural AMT models have been adapted for real-time piano transcription, they suffer from high latency, which hinders their usefulness in interactive scenarios. To tackle this issue, we explore several techniques for reducing the intrinsic latency of a neural network for piano transcription, including reducing window and hop sizes of Fast Fourier Transformation (FFT), modifying convolutional layer's kernel size, and shifting the label in the time-axis to train the model to predict onset earlier. Our experiments demonstrate that combining these approaches can lower latency while maintaining high transcription accuracy. Specifically, our modified model achieved note F1 scores of 92.67 % and 90.51 % with latencies of 96 ms and 64 ms, respectively, compared to the baseline model's note F1 score of 93.43 % with a latency of 160 ms. This methodology has potential for training AMT models for various interactive scenarios, including providing real-time feedback for piano education.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.3
• /
• pp.266-284
• /
• 2009

The challenges of rapidly growing numbers of mobile nodes in IPv6-based networks are being faced by mobile computing researchers worldwide. Recently, IETF has standardized Mobile IPv6 and Fast Handover for Mobile IPv6(FMIPv6) for supporting IPv6 mobility. Even though existing literatures have asserted that FMIPv6 generally improves MIPv6 in terms of handover speed, they did not carefully consider the details of the whole handover procedures. Therefore, in conventional protocols, the handover process reveals numerous problems manifested by a time-consuming network layer based movement detection and latency in configuring a new care of address with confirmation. In this article, we study the impact of the address configuration and confirmation procedure on the IP handover latency. To mitigate such effects, we propose a new scheme which can reduce the latency taken by the movement detection, address configuration and confirmation from the whole handover latency. Furthermore, a mathematical analysis is provided to show the benefits of our scheme. In the analysis, various parameters are used to compare our scheme with the current procedures, while our approach is focused on the reduction of handover latency. Finally, we demonstrate total handover scenarios for the proposed techniques and discussed the major factors which contribute to the handover latency.