• Child Health Nursing Research
• /
• v.21 no.4
• /
• pp.293-301
• /
• 2015

Purpose: This study was done to analyze the effectiveness of simulation-based integrated practice program (maternal-child) on nursing knowledge, self-confidence, and clinical competence of nursing students. Methods: A nonequivalent control group pre-post experimental design was used to compare experimental and control group. The experimental group received the integrated simulation practice and the control group received a separate simulation for maternal care and for newborn care. Results: The experimental group who had the integrated simulation had significantly higher scores for self-efficacy on nursing handover (F=0.480 p=.012) and oxygen therapy in newborn care (F=3.262 p=.037), and for clinical competence (F=2.639, p<.001) and personal satisfaction with debriefing compared to the control group (F=2.179, p=.044). But the experimental group did not have significantly higher scores in nursing knowledge. Conclusions The results indicate that an integrated simulation practice is an effective practice method to improve self-confidence, clinical competence and satisfaction. Also this study had significance in providing a setting similar to the clinical situation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.603-606
• /
• 2013

Mobile and wireless communication technologies to the development of a variety of next-generation mobile networks such as smart phones, tablet PC and mobile terminals will coexist various access networks. In a variety of network service continuity and quality of service degradation due to network conditions, and the EPC network traffic overload phenomenon still remains a problem. In this paper, the EPC network traffic overload in distributed cloud servers is proposed to select. Our proposed scheme using an efficient network handover can provide optimal service according to the network condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4A
• /
• pp.271-281
• /
• 2005

This paper for establishing the reliability of the TPC command is introduced, where the soft symbol of the TPC command itself is directed used as a reliability indicator. In addition to the new reliability estimation, the concept of parallel use of TPC algorithms is presented. The results show that the soft symbol reliability estimation decrease the $P_{tx}$ levels with 0.3 dB, thus providing a useful capacity gain. The parallel use of 2 to 4 algorithms is also shown to decrease the sensitivity of the algorithms to the algorithm thresholds used, and thus increase the feasibility of the algorithms in a real world networks.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.59-68
• /
• 2013

Efficient resource management and hand-over schemes are necessary to maintain consistent QoS because it may be severely defected by some delay and information loss during hand-over in LTE-Advanced networks. This paper proposes a resource management scheme based on the load control to support consistent QoS for heterogeneous services during hand-over in OFDMA based systems. Various multimedia services with different requirements for resource are able to be serviced simultaneously because service continuity can be provided by our proposed scheme. Simulation results show that it provides better performances than the conventional one with the measure of hand-over failure rate and packet loss rate.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.5
• /
• pp.63-69
• /
• 2007

propose a mobile relay structure for vehicles with multiple antennas, which can increase performances of mobile communication systems and broadcasting systems significantly. Since cell searching and DoA estimation are required for the terminal in hard handover cellular system, joint techniques for cell searching and DoA estimation are proposed to apply beamforming technique for the mobile relay with multiple antennas located at the cell boundary. The proposed cell searching and DoA estimation techniques are evaluated by computer simulation under the environment similar to WiBro system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.872-875
• /
• 2005

Portable Internet extended from wireless LAN has a large cell size, similar to a wireless mobile communication, and can provides the seamless service which offers middle-low speed mobility. IEEE 802.16e, the international standard of Portable Internet, uses PKMv2(Privacy Key Management) protocol for authorization and key exchange between a MSS(Mobile Subscriber Station) and a BS(Base Station). This paper first reviews and studies overall security architecture of TTA HPi standard and IEEE 802.16e which supports mobility based on WMAN(Wireless Metropolitan Area Network) standard(IEEE 802.16)

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.379-383
• /
• 2000

인터넷에서 멀티캐스트 그룹 통신을 하고 있는 이동 호스트가 접속지점을 수시로 바꿈에 따라 지속적인 멀티캐스트 응용에 참여하기 위해서는 이웃하는 멀티캐스트 라우터를 찾아내어 연결을 유지시켜야 한다. 기존 연구들은 주로 멀티캐스트를 지원하는 환경에서만 고려된 것들이다. 그러나 오늘날 대부분 라우터들은 멀티캐스트 서비스를 지원하지 않으며, 기존 연구들에서는 이를 터널링으로 해결하였다. 그런데 터널링은 경로 최적화 문제를 안고 있으며, 호스트 이동성의 본질적인 특성인 투명한 라우팅과 최적의 경로설정에 위배되는 문제점을 안고 있다. 본 논문은 멀티캐스트 기능을 지원하지 않는 망에서도 이동 호스트에게 멀티캐스트 응용 서비스를 제공할 수 있는 MRM-IP 방법을 제안한다. 이 방법은 이동 호스트가 인터넷에서 멀티캐스트 라우터가 장착되지 않는 망으로 이동했을 때, 종단 호스트와의 최적 경로를 이루는 최하단 멀티캐스트 라우터를 찾아 그룹 멤버로 원격가입 함으로써, 유니캐스트 한다. 이는 IETF의 양방향 터널링과 원격가입의 장점만을 이용한 것으로, 경로 최적화 문제를 해결하여 망에서 트래픽 지연을 줄일 수 있다.

• Journal of Korean Medical classics
• /
• v.34 no.2
• /
• pp.127-168
• /
• 2021

Objectives : First, the time of publication of the writing Jinjeong(陳情), was identified with consideration of current affairs at the time in Hamgyeongdo. Second, the relevance between agricultural policies and military/defense policies were identified. Third, based on these findings, the phrase "洋醜之漁獵頻泊汊 港, 峩人之耕牧恒據沿䐉" was throughly examined within its historical context. Methods : First, the time of publication of the writing Jinjeong(陳情), was identified with consideration of current affairs at the time in Hamgyeongdo. Second, the relevance between agricultural policies and military/defense policies were identified. Third, based on these findings, the phrase "洋醜之漁獵頻泊汊 港, 峩人之耕牧恒據沿䐉" was throughly examined within its historical context. Results & Conclusions : 1. The Jinjeong(陳情) of the Dongmuyugo(東武遺稿) is a writing on crossing borders into the Maritime Province of Siberia, which was written between the end of September and December of 1870. 2. The phrase "洋醜之漁獵頻泊汊港" is related to the incident when a handover line was at anchor in the Unggi harbor three times in 1869. 3. "我人之耕牧恒據沿海" refers to the rumor spread in 1870 about Russia being an ideal country that practiced ideal politics, to the extent of cattle and horse being gifted to immigrants into the country.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.1
• /
• pp.11-24
• /
• 2012

Without a proper protection mechanism for the signaling messages to be used for the mobility support in the Proxy Mobile IPv6 (PMIPv6), it is also vulnerable to several security attacks such as redirect attack, MITM (Man-In-The-Middle) attack, replay attack and DoS (Denial of Service) attack as in Mobile IPv6. In this paper, we point out some problems of previous authentication mechanisms associated with PMIPv6, and also propose a new fast and secure authentication mechanism applicable to PMIPv6. In addition, it is also shown that the proposed one is more efficient and secure than the previous ones.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.3
• /
• pp.111-117
• /
• 2021

The delivery problem on a graph is that of minimizing the object delivery time from one vertex to another vertex on a graph with m vertices using n various speed robot agents. In this paper, we propose two optimal solution algorithms for the delivery problem on a graph with time complexity of O(㎥n) and O(㎥). After preprocessing to obtain the shortest path for all pairs of the graph, our algorithm processed by obtaining the shortest delivery path in the order of the vertices with the least delivery time. Assuming that the graph reflects the terrain on which to solve the problem, our O(㎥) algorithm actually has a time complexity of O(㎡n) as only one preprocessing is required for the various deployment of n robot agents.