• Animal cells and systems
• /
• v.5 no.1
• /
• pp.31-35
• /
• 2001

Temperate-resident bats exhibit a circadian cycle of torpor and arousal In summer. The physiological role and selective advantage of torpor as an energy saving mechanism have been received much attention by hibernation biologists. However, despite the significance of the recovering euthermic function, the arousal process and mechanism in these animals have been poorly addressed. In this study, we investigated thermogenic and motor activities of a local bat species Murina leucogaster during arousal by simultaneously examining oxygen consumption rate, body temperature ($T_b$) and pectoral electromyography (EMG). We found that Tb of the torpid bats (12-14$^{\circ}C$) was augmented slowly by nonshivering mechanism during the initial awakening phase. The pectoral shivering, gauged by EMG activity, occurred between 17$^{\circ}C$ and 38$^{\circ}C$. Over this Tb range of shivering, heat was produced at a rate of 0.145 kcal $kg^{-1}\;min^{-1}$ to raise 1$^{\circ}C$ $T_b$ per min. Shivering was most intensive at 30-35$^{\circ}C$ where both EMG amplitude and spike frequency were the highest. Activation of the pectoral myofibers seemed to be controlled in a manner that motor units were recruited from smaller to larger sizes, with greater synchronization, as muscle shivering became intensive with increasing $T_b$.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.465-472
• /
• 2005

IEEE 802.11 wireless LAN technology is essential for wireless internet, next generation converged network and home network. But, it is certain that user's privacy must be provided to expand the applicable area in IEEE 802.11 WLAN. Recently, WEP and 802.11i security scheme can be used in MAC Layer. But with VPN technology which is applied to WLAN user, it means that suity mechanism is used redundantly. One bit authentication mechanism was already proposed to solve this redundancy. In this paper, we analyze problems of 1-bit Authentication mechanism which are failure of synchronization and waste of packet. And we propose new algorithm which synchronizes sender with receiver, at once, using duplicated-packet-count information. We show that our algorithm improves success probability of packet authentication up to $98\%$ and efficiency of authentication bit stream up to $97\%$.

• The Journal of Korea Robotics Society
• /
• v.7 no.4
• /
• pp.292-298
• /
• 2012

It is a real-time system that the system correctness depends not only on the correctness of the logical result of the computation but also on the result delivery time. Real-time Operating System (RTOS) is a software that manages the time of a microprocessor to ensure that the most important code runs first so that it is a good building block to design the real-time system. The real-time performance is achieved by using real-time mechanisms through data communication and synchronization of inter-task communication (ITC) between tasks. Therefore, test on the response time of real-time mechanisms is a good measure to predict the performance of real-time systems. This paper aims to analysis the response characteristics of real-time mechanisms in kernel space for real-time embedded Linux: RTAI and Xenomai. The performance evaluations of real-time mechanism depending on the changes of task periods are conducted. Test metrics are jitter of periodic tasks and response time of real-time mechanisms including semaphore, real-time FIFO, Mailbox and Message queue. The periodicity of tasks is relatively consistent for Xenomai but RTAI reveals smaller jitter as an average result. As for real-time mechanisms, semaphore and message transfer mechanism of Xenomai has a superior response to estimate deterministic real-time task execution. But real-time FIFO in RTAI shows faster response. The results are promising to estimate deterministic real-time task execution in implementing real-time systems using real-time embedded Linux.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.135-142
• /
• 2010

QoS in the proxy system are under heavy influence from interferences such as congestion, latency, and retransmission. Also, multi-level streaming services affects from temporal synchronization, which lead to degrade the service quality. This paper proposes a new segment-based buffer management mechanism which reduces performance degradation of streaming services and enhances throughput of streaming due to drawbacks of the proxy system. The proposed paper optimizes streaming services by: 1) Use of segment-based buffer management mechanism, 2) Minimization of overhead due to congestion and interference, and 3) Minimization of retransmission due to disconnection and delay. This paper utilizes fuzzy value $\mu$ and cost weight $\omega$ to process the result. The simulation result shows that the proposed mechanism has better performance in buffer cache control rate, average packet loss rate, and delay saving rate with stream relevance metric than the other existing methods of fixed segmentation method, pyramid segmentation method, and skyscraper segmentation method.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.513-522
• /
• 2002

Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization which TCP congestion window size is fluctuated during congestion occurred and if RTT (Round Trip Time) is increased, three duplicate ACK packets is not a correct congestion signal because congestion maybe already disappeared and the host may send more packets until receive the three duplicate ACK packets. Recently there is increasing interest in solving end-to-end congestion control using active network frameworks to improve the performance of TCP protocols. ACC (Active congestion control) is a variation of TCP-based congestion control with queue management In addition traffic modifications nay begin at the congested router (active router) so that ACC will respond more quickly to congestion than TCP variants. The advantage of this method is that the host uses the information provided by the active routers as well as the end points in order to relieve congestion and improve throughput. In this paper, we model enhanced ACC, provide its algorithm which control the congestion by using information in core networks and communications between active routers, and finally demonstrate enhanced performance by simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.867-875
• /
• 2003

Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization in which TCP congestion window size is fluctuated during congestion period. Furthermore, if RTT(Round Trip Time) is increased, three duplicate ACK packets are not correct congestion signals because congestion might already disappear and the host may send more packets until it receives three duplicate ACK packets. Recently there are increasing interests in solving end-to-end congestion control using AQM(Active Queue Management) to improve the performance of TCP protocols. AQM is a variation of RED-based congestion control. In this paper, we first evaluate the effectiveness of the current AQM schemes such as RED, CHOKe, ARED, FRED and SRED, over traffic with different rates and over traffic with mixed responsive and non-responsive flows, respectively. In particular, CHOKe mechanism shows greater unfairness, especially when more unresponsive flows exist in a shared link. We then propose a new AQM scheme using CHOKe mechanism, called DQC(Double Queue CHOKe), which uses two FIFO queues before applying CHOKe mechanism to adaptive congestion control. Simulation shows that it works well in protecting congestion-sensitive flows from congestion-causing flows and exhibits better performances than other AQM schemes. Also we use partial state information, proposed in LRURED, to improve our mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1104-1114
• /
• 2000

If the control system that works important job fails, economical loss occurred. Hence, to guarantee high reliability, it must be duplicated. In the case of traditional duplication mechanism, dedicated operating system with duplication functions were built. This required much development and maintenance cost. They can be saved, if we use commercial operating system and its development environment.This paper proposes a duplication mechanism for the system based on commercial 0S. The system that explained in this paper is BSC(Base Station Controller). The duplicated BSC system uses concurrent write memory for synchronization and VxWorks as an operating system. We propose how the task supporting duplication functions is executed without delay and preemption, how to synchronize standby's memory with active' s, and how to use concurrent-write memory easily with VxWorks' s partition. We also describe the takeover procedure when the active detects its hardware fault and when the standby recognizes the failure of the active.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1873-1882
• /
• 2009

In the ad-hoc mode of IEEE 802.11 standard, beacon is used for power control and network alarming between each node, and also it is for the synchronization in controlling network as PCF. However beacon is also used to inform the neighbor nodes of itself except for original purpose in the environment of IEEE 802.11s. For this, the existing beacon's transmission mechanism can't perform a function in full. In this paper, we suggest much faster neighbor discovery reducing network congestion caused by beacon through modification of beacon transmission mechanism. And we will show that suggesting algorithm more faster full neighbor discovery than traditional neighbor discovery using for IEEE 802.11 through simulation and test in real ad-hoc network.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.4
• /
• pp.150-157
• /
• 2008

This paper presents a design and implementation of realtime video player that operates on a tiled-display system consisting of multiple PCs to provide a very large and high resolution display. In the proposed system, the master process transmits a compressed video stream to multiple PCs using UDP multicast. All slaves(PC) receive the same video stream, decompress, clip their designated areas from the decompressed video frame, and display it to their displays while being synchronized with each other. A simple synchronization mechanism based on the H/W clock of each slave is proposed to avoid the skew between the tiles of the display, and a flow-control mechanism based on the bit-rate of the video stream and a pre-buffering scheme are proposed to prevent the jitter The proposed system is implemented with Microsoft DirectX filter technology in order to decouple the video/audio codec from the player.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.5
• /
• pp.467-474
• /
• 2001

When user wants to animate more than one character, some unexpected motion animation like a collision between characters may occur. Therefore, this problem must be resolved using a proper control mechanism. Therefore, this problem must be resolved using a proper control mechanism. This paper proposes an agent-based system that controls the motion animation of the character for representing animation scenario reflecting user\`s intention. This system provides a method that coordinates a type of motion and avoids collision between characters according to the moving path of a character in three-dimensional space. Agent communicates with others for motion synchronization. Agent is extended into several intelligent agents that coordinate character\`s motion. Agent system enables not only an intended motion animation, but also the scheduling of motion to an entire character animation. It designs automata model using Petri-net analysis tool for the agent\`s interaction as a method that passes the agent\`s information and infers the current state of agents. We implement this agent system to control the motion of character using agent technology and show an example of controlling the motion of human character model to prove the possiblity of motion control.