• Journal of Korean Academy of Fundamentals of Nursing
• /
• v.9 no.1
• /
• pp.86-100
• /
• 2002

Purpose: The purpose of the study was done to identify the nursing care needs of patients in the recovery room. Method: The subjects in this study were 127 patients in a recovery room between 6/9/2001 and 24/9/2001. The instrument used for this study was the descriptive questionnaire developed by Shin Hyun-Jin (1999). The data was analysed by frequency, percentage, mean, standard deviation, t-test, ANOVA, and factor analysis using the SPSS program. Result: 1) Kaiser - Meyer -O1kin sample appropriateness was 799 and Bartlett's test of sphericity significant probability was .000. 2) The mean score for nursing care need of patients in the recovery room was $4.17{\pm}.51$ of a total possible score of 5. The score of nursing need for different parameters was as follows : Educational need ($4.31{\pm}.49$), physical need ($4.27{\pm}.47$), emotional need ($4.11{\pm}.52$), environmental need ($3.99{\pm}.56$). 3) Differences in the needs for nursing care according to the demographics were significant for gender, marital status, operation experience, and departments consulted. General characteristic variables significantly related to nursing need were as follows: Physical need significantly related to the departments consulted (F=2.23, p=.036). Educational need significantly related to the marital status (F=2.55. p=.012), departments consulted (F=2.30, p= 031). Emotional need significantly related to the marital status (F=2.22, p=.028). Environmental need significantly related to the gender (t=-2.44, p= .016), marital status (F=2.01, p= .046). operation experience (t=-1.99. p= .048). Conclusion: Nursing care needs of patients in the recovery room are significantly related to educational need, physical need, emotional need and environmental need. Intervention plans and program need to be developed to improve strategies to meet nursing needs of patients in the recovery room.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.2
• /
• pp.63-74
• /
• 2009

In 2005, Wang et al. discovered devastating collision attacks on the main hash functions from the MD4 family. After the discovery of Wang, many analysis results on the security of existing hash-based cryptographic schemes are presented. At CRYPTO'07, Fouque, Leurent and Nguyen presented full key-recovery attacks on HMAC/NMAC-MD4 and NMAC-MD5[4]. Such attacks are based on collision attacks on the underlying hash function, and the most expensive stage is the recovery of the outer key. At EUROCRYPT'08, Wang, Ohta and Kunihiro presented improved outer key recovery attack on HMAC/NMAC-MD4, by using a new near collision path with a high probability[2]. This improves the complexity of the full key-recovery attack on HMAC/NMAC-MD4 which proposed by Fouque, Leurent and Nguyen at CRYPTO'07: The MAC queries decreases from $2^{88}$ to $2^{72}$, and the number of MD4 computations decreases from $2^{95}$ to $2^{77}$. In this paper, we propose improved outer key-recovery attack on HMAC/NMAC-MD4 with $2^{77.1246}$ MAC queries and $2^{37}$ MD4 computations, by using divide and conquer paradigm.

• Proceedings of the KSPS conference
• /
• 2007.05a
• /
• pp.307-310
• /
• 2007

In this paper, a packet loss concealment (PLC) algorithm for CELP-type speech coders is proposed to improve the quality of decoded speech under a burst packet loss condition. The proposed algorithm is based on the recovery of voiced excitation using an estimate of the voicing probability and the generation of random excitation by permutating the previously decoded excitation. The voicing probability is estimated from the correlation using the previous correctly decoded excitation and pitch. The proposed algorithm is implemented as a PLC algorithm for G.729 and its performance is compared with PLC employed in G.729 by means of perceptual evaluation of speech quality (PESQ) and an A-B preference test under the random and burst packet losses with rates of 3% and 5%. It is shown that the proposed algorithm provides better speech quality than the PLC of G.729, especially under burst pack losses.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.2
• /
• pp.134-140
• /
• 2011

Recent work in compressed sensing theory shows that $M{\times}N$ independent and identically distributed sensing matrix whose entries are drawn independently from certain probability distributions guarantee exact recovery of a sparse signal with high probability even if $M{\ll}N$. In particular, it is well understood that the $L_1$-minimization algorithm is able to recover sparse signals from incomplete measurements. In this paper, we propose a novel sparse signal reconstruction method that is based on the reweighted $L_1$-minimization via support detection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3449-3467
• /
• 2015

A broadcast operation is the fundamental transmission technique in mobile ad-hoc networks (MANETs). Because a broadcast operation can cause a broadcast storm, only selected forwarding nodes have the right to rebroadcast a broadcast message among the one-hop and two-hop neighboring nodes of a sender. This paper proposes the maximum intersection self-pruning (MISP) algorithm to minimize broadcasting redundancy. Herein, an example is given to help describe the main concept of MISP and upper bounds of forward node have been derived based on induction. A simulation conducted demonstrated that when conventional blind flooding (BF), self-pruning (SP), an optimized link state routing (OLSR) multipoint relay (MPR) set, and dominant pruning (DP), are replaced with the MISP in executing Strong duplicate address detection (DAD), the performances in terms of the energy consumption, upper bounds of the number of forward nodes, and message complexity have been improved. In addition, to evaluate the performance in reference to the link error probability, P_e, an enhancement was achieved by computing a proposed retransmission limit, S, for error recovery based on this probability. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating with limited portable energy where Strong DAD reacts differently to link errors based on the operational procedures.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.827-838
• /
• 1999

멀티미디어 통신에서 통신 성능에 관련된 요구 사항들은 QoS 매개 변수들로서 서술된다. QoS매개 변수들에서 중요한 매개 변수 중의 하나가 전송 신뢰성이다. QoS 매개 변수로서의 신뢰성은 오류 감지, 보고 그리고 정정 기법으로 정의된다. 하지만 기존의 오류 제어 기법들은 멀티미디어 데이타의 통합된 관점을 고려하지 않았다. 그래서 우리는 MEC(multimedia-oriented error control)라고 명명된 오류 제어 기법을 제안하였다. 1 본 논문에서는 MEC기법의 성능을 조사 하였다. 성능평가 결과는 MEC기법이 기존의 오류 제어 기법보다도 낮은 전송지연(lower delay)과 호손율(blocking probability) 을 갖는다는 것을 볼 수 있었다. 결국 제안된 MEC기법은 수송 프로토콜에게 유연성과 높은 성능을 갖도록 해준다.Abstract Communication performance requirements are described as QoS parameters in multimedia communication. One of the important QoS parameters is the reliability of the transfer. As a QoS parameter, the reliability defines error detection, report and correction mechanisms. Conventional error control mechanisms, however, do not consider the integrated viewpoint of multimedia data. So we have proposed the MEC(multimedia-oriented error control). 1 In this paper, we have investigated the performance evaluation of the MEC. The results show that the MEC mechanism provides lower transfer delay and blocking probability than those of the conventional error recovery mechanism. Therefore, the proposed MEC mechanism makes the transport protocol have the flexibility and high performance.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.24 no.3
• /
• pp.443-449
• /
• 2000

The performance of 2-frame PTV(particle tracking velocimetry) system was improved using an adaptive hybrid scheme. The original 2-frame PTV method based on the match probability concept employs global match parameters for the entire flow field. Since this does not reflect fully the detailed local velocity change, it sometimes reduces the recovery rate of velocity vectors and increases the number of erroneous vectors in the region where an extraordinary flow structure exists. In this study, the preliminary FFT-based PIV results are used as an input parameter to determine the local match parameters needed for the 2-frame particle tracking algorithm. A computer simulation using synthetic particle images was carried out to study the performance of the adaptive 2-frame PTV technique. The adaptive hybrid method shows the better performance with increasing the velocity vector recovery rate and decreasing the computation time, compared to the original 2-frame PTV method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.17-22
• /
• 2011

The underwater environments are quite different from the terrestrial ones in terms of the communication channel and constrains. In underwater wireless sensor network, the probability of node failure is high because sensor nodes are deployed in more harsh environments than the ground based networks and moved by waves and currents. There are researches considering the communication environments of underwater to improve the data transmission throughput. In this paper, we present a checkpointing scheme of the cluster heads that recoveries from a cluster head failure quickly. Experimental results show that the proposed scheme enhances the reliability of the networks and more efficient in terms of the energy consumption and the recovery latency than without checkpointing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2087-2093
• /
• 2014

In this paper, an orthogonal matching pursuit (OMP) method combined with genetic algorithm (GA), named GAOMP, is proposed for sparse signal recovery. Some recent greedy algorithms such as SP, CoSaMP, and gOMP improved the reconstruction performance by deleting unsuitable atoms at each iteration. However they still often fail to converge to the solution because the support set could not avoid the local minimum during the iterations. Mutating the candidate support set chosen by the OMP algorithm, GAOMP is able to escape from the local minimum and hence recovers the sparse signal. Experimental results show that GAOMP outperforms several OMP based algorithms and the $l_1$ optimization method in terms of exact reconstruction probability.

• Journal of information and communication convergence engineering
• /
• v.2 no.1
• /
• pp.9-14
• /
• 2004

In this paper the modeling of the RLP layer in CDMA2000 is presented, which uses the NAK based ARQ scheme for Random Error Channels. The RLP performs a partial link recovery through limited number of RLP frame transmission in case of frame error. In case when the RLP fails due to excessive frame error, the control is passed on to the higher (TCP) layer. The TCP layer provides the complete end-to-end recovery. Thus the reliable performance at the TCP/RLP is essential to maintain the required Quality of Service in the DS-CDMA wireless links. The modeling is done for the performance analysis of the system in terms of the throughput and the mean extra delays, which are calculated analytically and are compared with the results generated by the simulations. This paper studies the effect of the random errors over different types of RLP frame formats and also the performance of the NAK based ARQ mechanism used under these conditions. The simulation provides with the over all characteristics of the throughput and the mean extra delay in terms of realistic environment parameters like Eb/No and probability of packet error (PE), based on the channel conditions.