• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.8
• /
• pp.325-333
• /
• 2020

This study compares the rapidity and subjective convenience of T-AED and SC-AED for health care providers and the general public. Subjects were randomly allocated to T-AED (n=77) and SC-AED (n=79) groups. Each group conducted defibrillation, with subsequent measurement of the rapidity of defibrillation in peri-shock pause, pre-shock pause, hesitation pause, and post-shock pause. Defibrillation and chest compression delay times for both equipment were analyzed by t-test. On conclusion of the experiment, subjects answered a questionnaire on the subjective convenience of defibrillation, as measured for confidence, convenience, and clear decision. Comparisons of subjective convenience analyzed by t-test revealed significantly shortened peri-shock pause (11.22s), pre-shock pause (11.04s), and hesitation pause (2.15s) in the SC-AED group, as compared to the T-AED group (p<0.001). However, no significant differences were observed for post-shock pause values. Comparing subjective convenience, confidence (T-AED: 7.62±1.25VAS vs. SC-AED: 7.80±0.98VAS, p=0.358) was not significant, whereas convenience (T-AED: 7.05±1.36VAS vs. SC-AED: 8.95±0.89VAS, p<0.001) and clear decision (T-AED: 6.58±1.73VAS vs. SC-AED: 9.08±0.98VAS, p=0.001) showed statistically significant differences. Our results indicate that compared to T-AED, SC-AED has significantly shortened pauses. Moreover, it is more convenient for the user, and significantly aids in clear decisions.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.620-632
• /
• 2004

IP is not suitable for mobile nodes by network-based routing because mobile nodes are dynamically change their network attachment point. Mobile-IP is an IETF standard providing continuous access to the Internet for mobile nodes, but it has the triangle routing problem. Also it has a performance degradation problem by massive packet loss during layer 3 handoff of mobile nodes. Especially, two IETF multicast support schemes for Mobile-IP do not guarantee the quality of realtime multimedia services because they have several problems such as long routing path, packet duplication(hi-directional tunneling) and massive packet loss(remote subscription). In this paper, we propose a lossless remote subscription scheme that guarantees the quality of realtime multimedia services over Mobile-IP. From the result of simulation, we verified that the proposed scheme in this paper can reduce the delay time of remote subscription by the effect of the low latency handoff scheme that is extended to apply to the multicast group management and it requires only 0.58% buffer spaces of the previously proposed lossless remote subscription scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2886-2896
• /
• 1996

The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.724-727
• /
• 2008

Studies on binary adder have been variously developed. According to those studies of critical worst delay and mean delay time of asynchronous binary adders, carry select adders (CSA) based on hybrid structure showed 17% better performance than ripple carry adders (RCA) in 32 bit asynchronous processors, and 23% better than in 64 bit microprocessor implemented. In the complicated signal processing systems such as RSA, it is essential to optimize the performance of binary adders which play fundamental roles. The researches which have been studied so far were subject mostly to addition algorithms or adder structures. In this study, we analyzed and designed adders in an asp;ect of synthesis method. We divided the ways of implementing adders into groups, each of which was synthesized with different synthesis options. Also, we analyzed the variously implemented adders to evaluate the performance and area so that we can propose a different approach of designing optimal binary adders.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.409-418
• /
• 2005

This paper presents an efficient multicast method based on a locality in mobile IPv6 networks. We exploit the repetitive movement pattern of mobile node to reduce the total number of experience of graft and join procedure. We defined the locality scope by a movement pattern. While the network is included in the locality scope, the network should maintain a multicast tree even when the mobile node moves to the other network. In this way, the mobile host can receive a multicast service without a delay when it moves to the network in the locality scope later. We compare our scheme with existing schemes under the total signaling cost and the service delay time by using a discrete analytical model for cost analysis. Analytical results demonstrated that the total signaling cost and service delay time was significantly reduced through our proposed scheme.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.226-235
• /
• 2007

Recently, the lETF NEMO working group on network mobility is standardizing a basic support for moving networks. We need a handover scheme for achieving the performance of transparency during the movement of mobile routers in nested mobile networks. But existing handover schemes for a mobile host are not suitable for network mobility because the packet transmission delay and traffic increase during mobile router's handover in nested mobile networks. Therefore, we propose a new seamless handover scheme using the bi-casting based on Mobile IPv6 for nested mobile networks in this paper. Compared with the handover schemes using bi-directional edge tunneling for host mobility support on simulation. And, the results show that the proposed handover scheme reduces the packet delay during a mobile router changes the point of attachment in nested mobile networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.11
• /
• pp.1976-1979
• /
• 2008

Studies on binary adder have been variously developed. According to those studies of critical worst delay and mean delay time of asynchronous binary adders, carry select adders (CSA) based on hybrid structure showed 17% better performance than ripple carry adders (RCA) in 32 bit asynchronous processors, and 23% better than in 64 bit microprocessor implemented. In the complicated signal processing systems such as RSA, it is essential to optimize the performance of binary adders which play fundamental roles. The researches which have been studied so far were subject mostly to addition algorithms or adder structures. In this study, we analyzed and designed adders in an asp;ect of synthesis method. We divided the ways of implementing adders into groups, each of which was synthesized with different synthesis options. Also, we analyzed the variously implemented adders to evaluate the performance and area so that we can propose a different approach of designing optimal binary adders.

• Journal of the Korea Computer Industry Society
• /
• v.8 no.3
• /
• pp.197-206
• /
• 2007

The waiting delays of internet VOD users are inevitable in this policy since the services are not taken immediately upon requests but upon every scheduling points. An inefficient management of such delays makes an unfair service to users and increases the possibility of higher reneging rates. This paper proposes an efficient service scheduling scheme which improves the average waiting time of users requests and reduces the starvation problem of users requesting less popular movies. Experimental results of simulations show that the proposed scheme improves about 20 percentage of average waiting time and reduces significantly the starving requesters comparing with those of conventional methods such as FCFS and MQL.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.173-178
• /
• 2004

A network of Asynchronous Transfer Mode (ATM) will be required to carry the traffics(CVR, VBR, UBR. ABR) generated by a wide range of services ATM services the Quality-of-Service (QoS) management of traffice sources and bandwidth. Besides efficiency and throughput, the security services are achieved in the traffic sent in ATM network. In this paper, the scheduler evaluate and the packets sent in ATM security group. The scheduler transmits the safty packet, drop the unsafty packet and evaluate mark packet as the requirement of the delay. In this paper, we propose the scheduling algorithm of mark packet which evaluates the packet. The suggested model performance of the firewall switch is estimate simulation in terms of the delay by computer.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.8
• /
• pp.989-998
• /
• 2002

The waiting delays of users are inevitable in this policy since the services are not taken immediately upon requests but upon every scheduling points. An inefficient management of such delays makes m unfair service to users and increases the possibility of higher reneging rates. This paper proposes an leagued batching scheduling scheme which improves the average waiting time of users requests and reduces the starvation problem of users requesting less popular movies. The proposed scheme given intervals based on the league which reflect the disk partitions service patterns and user requests. Experimental results of simulations show that the proposed scheme improves about 18 percentage of average waiting time comparing with those of conventional methods such as FCFS and MQL.