• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6B
• /
• pp.608-617
• /
• 2011

ubiquitous network management system (u-NMS) is the network management system based on smartphone which are recently of wide use. The purpose of the u-NMS is to provide convenience for network administrator utilizing the mobility of smartphone and to manage the network efficiently. This paper proposes the smart NMS agent and the mobility management server (MMS). The smart NMS agent enables to use the monitoring web server and remote control application on the smartphone in wireless network. The MMS is developed to reduce the problems such as handover latency and packet loss, which can be taken place in wireless network. The network manager can monitor traffic in real time through the smart NMS agent and remotely control the network efficiently when sudden failures happen in the u-NMS. In this paper, performance evaluation is carried out with our test-bed system implemented. We focus on the measurement of the MMS performance. When the MMS is compared to previous mobility management protocol, our mobility management server reduces the average latency up to 65% in initial access, handover latency and processing delay to the network management center.

• Journal of Internet Computing and Services
• /
• v.7 no.6
• /
• pp.143-155
• /
• 2006

In this paper, we suggest a network game system that can support video game based on multi-platform for multi-user video game, Latency occurring from the load fluctuation in realtime network game is overcomed by using an initial delay buffering scheme on client, when a real-fire game is played, and shows that stable play for a game is achieved as the result of the scheme. Also, We suggest a retransmission algorithm based on the history of game commands, and this Algorithm supplement shortcomings for packet loss and pocket error on UDP communication.

• Biomedical Science Letters
• /
• v.26 no.1
• /
• pp.14-21
• /
• 2020

Quantitative evaluation of the sense of smell is done by the olfactory event-related potential (OERP) test. OERP consists of N1, P1, N2, P2, and P3, of which N1 and P1 latency are known to be affected by the concentration of odor stimuli associated with the pre-sensory phase and P2 and P3 are the stages at which odors are perceived and are known to change by subjective evaluation of the stimulus. The purpose of this study was to clarify the correlation between the expression of OERP and the subjective evaluation of the object on the fragrance stimulus using various fragrances. Therefore, the study examined the relative waveform power ratio, preference for each scent stimulus, and finally the amplitude and latency change of the components of OERP, N1 and P2. In contrast, it was found that the late P2 response waveform was an effective aroma stimulus recognition waveform in OERP compared to the initial response waveforms.

• Journal of Venture Innovation
• /
• v.2 no.1
• /
• pp.13-21
• /
• 2019

In LTE environment, which is 4th generation mobile communication systems, there is concern about private information exposure by transmitting initial identifier in plain text. This paper suggest mutual authentication protocol, which uses one-time password utilizing challenge-response and AES-based Milenage key generation algorithm, as solution for safe initial identification communication, preventing unique identification information leaking. Milenage key generation algorithm has been used in LTE Security protocol for generating Cipher key, Integrity key, Message Authentication Code. Performance analysis evaluates the suitability of LTE Security protocol and LTE network by comparing LTE Security protocol with proposed protocol about algorithm operation count and Latency.Thus, this paper figures out initial identification communication's weak points of currently used LTE security protocol and complements in accordance with traditional protocol. So, it can be applied for traditional LTE communication on account of providing additional confidentiality to initial identifier.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1066-1077
• /
• 2004

Dramatic increase in the number of Internet users want highly qualified service of continuous media contents on the web. To solve these problems, we present two network caching schemes(PPC, PPCwP) which consider the characteristics of continuous media objects and user access pattern in this paper. While there are plenty of reasons to create rich media contents, delivering this high bandwidth contents over the internet presents problems such as server overload, network congestion and client-perceived latency. PPC scheme periodically calculates the popularity of objects based on the playback quantity and determines the optimal size of the initial fraction of a continuous media object to be cached in proportion to the calculated popularity. PPCwP scheme calculates the expected popularity using the series information and prefetches the expected initial fraction of newly created continuous media objects. Under the PPCwP scheme, the initial client-perceived latency and the data transferred from a remote server can be reduced and limited cache storage space can be utilized efficiently. Trace-driven simulation have been performed to evaluate the presented caching schemes using the log-files of iMBC. Through these simulations, PPC and PPCwP outperforms LRU and LFU in terms of BHR and DSR.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.4
• /
• pp.8-13
• /
• 1997

This paper describes a scalable systolic synchronous memory for digital signal processing and packet switching. The systolic synchronous memory consists of the 2-D array of small memory blocks which are fully pipelined and communicated in three directions with adjacent blocks. The maximum delay of a small memory block becomes the operation speed of the chip. The array configuration is scalable for the entire memory size requested by an application. it has the initial latency of N+3 cycles with NxN array configuration. We designed an experimental 200 MHz 4Kb static RAM chip with the 4x4 array configuration of 256 SRAM blocks. It was fabricated is 0.8$\mu\textrm{m}$ twin-well single-poly double-metal CMOS technology.

• Journal of information and communication convergence engineering
• /
• v.11 no.3
• /
• pp.190-198
• /
• 2013

Recently, one of the most vital advancement in the field of finance is high-performance trading using field-programmable gate array (FPGA). The objective of this paper is to design high-performance Black Scholes option trading system on an FPGA. We implemented an efficient Black Scholes Call Option System IP on an FPGA. The IP may perform 180 million transactions per second after initial latency of 208 clock cycles. The implementation requires the 64-bit IEEE double-precision floatingpoint adder, multiplier, exponent, logarithm, division, and square root IPs. Our experimental results show that the design is highly efficient in terms of frequency and resource utilization, with the maximum frequency of 179 MHz on Altera Stratix V.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.34-40
• /
• 2018

In this study, the optimal buffer size is calculated for seamless video playback on a mobile device. Buffer means the memory space for multimedia packet which arrives in mobile device for video play such as VOD service. If the buffer size is too large, latency time before video playback can be longer. However, if it is too short, playback service can be paused because of shortage of packets arrived. Hence, the optimal buffer size insures QoS of video playback on mobile devices. We model the process of buffering into a discret-time queueing model. Mean busy period length and mean waiting time of Geo/G/1 queue with N-policy is analyzed. After then, we uses the main performance measures to present numerical examples to decide the optimal buffer size on mobile devices. Our results enhance the user satisfaction by insuring the seamless playback and minimizing the initial delay time in VOD streaming process.

• Journal of IKEEE
• /
• v.24 no.3
• /
• pp.838-844
• /
• 2020

In this paper, we propose an efficient Viterbi processor using Joint Viterbi detection and decoding (JVDD) algorithm for a for bluetooth low energy (BLE) system. Since the convolutional coded Gaussian minimum-shift keying (GMSK) signal is specified in the BLE 5.0 standard, two Viterbi processors are needed for detection and decoding. However, the proposed JVDD scheme uses only one Viterbi processor by modifying the branch metric with inter-symbol interference information from GMSK modulation; therefore, the hardware complexity can be significantly reduced without performance degradation. Low-latency and low-complexity hardware architecture for the proposed JVDD algorithm was proposed, which makes Viterbi decoding completed within one clock cycle. Viterbi Processor RTL synthesis results on a GF55nm process show that the gate count is 12K and the memory unit and the initial latency is reduced by 33% compared to the modified state exchange (MSE).

• The Journal of Korean Physical Therapy
• /
• v.19 no.1
• /
• pp.79-90
• /
• 2007

Purpose: We investigated how nerve mobilization influence ankle plantar flexor muscles of the affected lower extremity on the spasticity in stroke patients. Method: Total 12 patients were recruited, who had spasticity on ankle of the affected lower extremity, and applied nerve mobilization on the sciatic and tibial nerves in supine position. H-reflex was measured using EMG equipment, detected the ratio of maximum H/M and H-reflex latency, and compared the changes before, during, right after, 5 minutes after and 10 minutes after the application of nerve mobilization. The data were analyzed using repeated measure ANOVA to compare the changes in length of time. Results: In comparison with the ratio before nerve mobilization, the ratio of maximum H/M was significantly decreased during nerve mobilization(p<0.05), and it tended toward recovery right after, 5 minutes after and 10 minutes after applying nerve mobilization, there was no statistically significant difference(p>0.05). In comparison with the ratio before nerve mobilization, the ratio of maximum H/M was most significantly decreased during the first 10 seconds after nerve mobilization and it tended toward recovery gradually(p<0.05). In comparison with the H-reflex latency before nerve mobilization, it was significantly increased during nerve mobilization(p<0.05) and it was decreased right after nerve mobilization, After 5 and 10 minutes, it had a tendency toward recovery but it revealed no statistically significant difference (p>0.05). Conclusion: It is considered that nerve mobilization could contribute to initial rehabilitation with stroke patients for relieving spasticity and nerve contracture.