• Journal of Sensor Science and Technology
• /
• v.25 no.5
• /
• pp.365-370
• /
• 2016

The study about VR (Virtual Reality) has been done from the 1960s, but technical limits and high cost made VR hard to commercialize. However, in recent, high resolution display, computing power and 3D sensing have developed and hardware has become affordable. Therefore, normal users can get high quality of immersion and interaction. However, HMD devices which offer VR environment have high latency, so it disrupts the VR environment. People are usually sensitive to relative latency over 20ms. In this paper, as adding the Electromyogram (EMG) sensors to typical IMU sensor only system, the latency reduction method is proposed. By changing software and hardware components, some cases the latency was reduced significantly. Hence, this study covers the possibility and the experimental verification about EMG sensors for reducing the latency.

• 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.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.199-204
• /
• 2008

Sensor nodes have various energy and computational constraints because of their inexpensive nature and ad-hoc method of deployment. Considerable research has been focused at overcoming these deficiencies through faster media accessing, more energy efficient routing, localization algorithms and system design. Our research attempts to provide a method of improvement MAC performance in these issues. We show that traditional carrier-sense multiple access(CSMA) protocols like IEEE 802.11 do not handle the first constraint adequately, and do not take advantage of the second property, leading to degraded latency and throughput as the network scales in size, We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is a randomized CSMA protocol, but unlike previous legacy protocols, does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, it carefully decides a fixed-size contention window, non-uniform probability distribution of transmitting in each slot within the window. We show that it can offer up to several times latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely used simulator ns-2. We, finally show that proposed MAC scheme comes close to meeting bounds on the best latency achievable by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to latency.

• Journal of Information Processing Systems
• /
• v.4 no.4
• /
• pp.133-144
• /
• 2008

Clusters have become a popular alternative for building high-performance parallel computing systems. Today's high-performance system area network (SAN) protocols such as VIA and IBA significantly reduce user-to-user communication latency by implementing protocol stacks outside of operating system kernel. However, emerging parallel applications require a significant improvement in communication latency. Since the time required for transferring data between host memory and network interface (NI) make up a large portion of overall communication latency, the reduction of data transfer time is crucial for achieving low-latency communication. In this paper, Eager Data Transfer (EDT) mechanism is proposed to reduce the time for data transfers between the host and network interface. The EDT employs cache coherence interface hardware to directly transfer data between the host and NI. An EDT-based network interface was modeled and simulated on the Linux-based, complete system simulation environment, Linux/SimOS. Our simulation results show that the EDT approach significantly reduces the data transfer time compared to DMA-based approaches. The EDTbased NI attains 17% to 38% reduction in user-to-user message time compared to the cache-coherent DMA-based NIs for a range of message sizes (64 bytes${\sim}$4 Kbytes) in a SAN environment.

• Journal of Broadcast Engineering
• /
• v.26 no.7
• /
• pp.855-861
• /
• 2021

Neural Architecture Search (NAS) is cutting-edge technology in the machine learning community. NAS Without Training (NASWOT) recently has been proposed to tackle the high demand of computational resources in NAS by leveraging some indicators to predict the performance of architectures before training. The advantage of these indicators is that they do not require any training. Thus, NASWOT reduces the searching time and computational cost significantly. However, NASWOT only considers high-performing networks which does not guarantee a fast inference speed on hardware devices. In this paper, we propose a multi objectives reward function, which considers the network's latency and the predicted performance, and incorporate it into the Reinforcement Learning approach to search for the best networks with low latency. Unlike other methods, which use FLOPs to measure the latency that does not reflect the actual latency, we obtain the network's latency from the hardware NAS bench. We conduct extensive experiments on NAS-Bench-201 using CIFAR-10, CIFAR-100, and ImageNet-16-120 datasets, and show that the proposed method is capable of generating the best network under latency constrained without training subnetworks.

• The Korean Journal of Pharmacology
• /
• v.29 no.1
• /
• pp.33-41
• /
• 1993

Central analgesic effect of capsaicin was assessed by the tail flick reflex (TFR) test, using male Sprague-Dawley rats under anesthesia with pentobarbital sodium (induction with 40 mg/kg and maintenance with $4{\sim}8\;mg/kg/hr$). Level of norepinephrine in the spinal cord was also measured. Capsaicin, $35{\sim}150\;{\mu}g$, was injected intrathecally, and the TFR latency was measured before, 10, 30, and 60 minutes after the drug administration. TFR latency was increased 100% or more immediately by intrathecal capsaicin, from 2.9 seconds to the maximum of 7.0 seconds at 10 minute after the drug; P<0.01. The increase in TFR latency was maintained during the course of experiment of 2 hours. Concomitant reduction of NE content in the spinal cord was observed; from 16 ng/mg protein to 7 ng/mg protein. On the other hand, subcutaneous injection of capsaicin of 50 mg/kg did not change the TFR latency although the NE content reduced similarly to the case of intrathecal injection. Pretreatment of the animal with 0.5 mg/kg of MK-801 reversed the increase of TFR latency and NE reduction induced by intrathecal capsaicin. These results suggest that capsaicin causes analgesia at the spinal cord level by activating the excitatory amino acid-NE-dorsal horn interneurons axis of the descending inhibitory pain modulation pathway.

• The Journal of Korean Physical Therapy
• /
• v.9 no.1
• /
• pp.89-96
• /
• 1997

The purpose of this study was to determine the effect of Ga-Al-As (Gallium-Aluminum-Arsenid) laser radiation on the tail-flick latency in rat. Thirty Sprague-Dawley male and female rats Were divided into five groups : that is control, laser 15sec radiation, laser 30sec radiation, laser 60sec radiation, and Tramadol Hcl injection groups. The continuous Ga-Al-As laser with, wave length 780-830nm and diameter of probe in the 3mm, averse output of 100mw radiation was applied to the meridian point(Gv 1 : Governing vessel) of the rats. Tail-flick latency were measured with hot plate at $55^{\circ}C$ : before treatment and immediately, 30 minutes, 1 hour, 2 hours, 24 hours, 24 hours and 48 hours after treatment. The result were as follows ; 1. The tail-flick latency according to time varition, control group was not significance. 2. The tail-flick latency according to time varition, laser 15 sec irradiate rats in post-treared was significance(P<0.05). 3. The tail-flick latency according to time varition, laser 30 sec irradiate rats group was not significance. 4. The tail-flick latency according to time varition, laser 60 sec irradiate rats in post 30 minute was significance(P<0.05). 5. The tail-flick latency according to time varition, Tramadol Hcl injection rats in post-treated (P<0.05), post 30 minute(P<0.05), post 60 minute (P<0.01) and 2 hour(P<0.05) was significance. This study suggest that Ga-Al-As (Gallium-Aluminum-Arsenid) laser applied to meridian point of the rat with 15 sec, 30 sec, and 60 set radiation could induc no analgesic effect, but Tramadol Hcl injection rat is good analgesic effect.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8A
• /
• pp.600-609
• /
• 2009

The traditional carrier sense multiple access (CSMA) protocol like IEEE 802.11 Distributed Coordination Function (DCF) does not handle the constraints adequately, leading to degraded delay latency and throughput as the network scales are enlarged. We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is like the randomized CSMA protocol, but unlike previous legacy protocols, it does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, we carefully decide to select a fixed-size contention window with non-uniform probability distribution of transmitting in each slot. We show that the proposed method can offer up to severaansimes latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely using network simulation package,caS-2. We finally show that proposed MAC scheme comes close to meet bounds on the best latency being achieved by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to delay latency.

• Journal of Internet Computing and Services
• /
• v.5 no.3
• /
• pp.25-33
• /
• 2004

Mobile IP Low Latency Handoffs(l) allow greater support for real-time services on a Mobile IP network by minimizing the period of time when a mobile node is unable to send or receive IP packets due to the delay in the Mobile IP Registration process. However, on Mobile IP network with AAA servers that are capable of performing Authentication, Authorization, and Accounting(AAA) services, every Registration has to be traversed to the home network to achieve new session keys, that are distributed by home AAA server, for a new Mobile IP session. This communication delay is the time taken to re-authentication the mobile node and to traverse between foreign and home network even if the mobile node has been previously authorized to old foreign agent. In order to reduce these extra time overheads, we present a method that performs Low Latency Handoffs without requiring further involvement by home AAA server. The method re-uses the previously assigned session keys. To provide confidentiality and integrity of session keys in the phase of key exchange between agents, it uses a key sharing method by gateway foreign agent that performs a trusted thirty party. The proposed method allows the mobile node to perform Low Latency Handoffs with fast as well as secure operation.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1322-1331
• /
• 2015

According to the hypervisor scheduler, the vCPU (virtual CPU) operates under two states: the running state and the stop state. When the vCPU is in the stop state, incoming events are delayed until that vCPU's state changes to the running state. The latency in handling such events that are sent to the vCPU is regarded as the I/O latency. Since a SMP (symmetric multiprocessing) VM (virtual machine) incorporates multiple vCPUs, the event latency on a SMP VM can vary according to specific vCPU that receives the event. In this paper, we propose a new scheme named event routing that sends events according to the operation state of each vCPU to reduce the event latency on an SMP VM. We implemented the proposed event routing scheme in Xen ARM hypervisor and confirmed the reduction of I/O latency from measuring the network RTT (round trip time) and the TCP bandwidth under a variety of testing conditions. The network RTT decreases by up to 94% and the TCP bandwidth increases up to 35% when compare to native Xen ARM.