• Phonetics and Speech Sciences
• /
• v.15 no.4
• /
• pp.109-118
• /
• 2023

Cardiac arrest is a critical medical emergency where immediate response is essential for patient survival. This is especially true for Out-of-Hospital Cardiac Arrest (OHCA), for which the actions of emergency medical services in the early stages significantly impact outcomes. However, in Korea, a challenge arises due to a shortage of dispatcher who handle a large volume of emergency calls. In such situations, the implementation of a machine learning-based OHCA detection program can assist responders and improve patient survival rates. In this study, we address this challenge by developing a machine learning-based OHCA detection program. This program analyzes transcripts of conversations between responders and callers to identify instances of cardiac arrest. The proposed model includes an automatic transcription module for these conversations, a text-based cardiac arrest detection model, and the necessary server and client components for program deployment. Importantly, The experimental results demonstrate the model's effectiveness, achieving a performance score of 79.49% based on the F1 metric and reducing the time needed for cardiac arrest detection by 15 seconds compared to dispatcher. Despite working with a limited dataset, this research highlights the potential of a cardiac arrest detection program as a valuable tool for responders, ultimately enhancing cardiac arrest survival rates.

• Journal of KIISE:Software and Applications
• /
• v.31 no.9
• /
• pp.1226-1232
• /
• 2004

Biometric authentication is rising technology for the security market of the next generation. But most of biometric systems are developed using only one of various biological features. Recently, there is a vigorous research for the standardization of various biometric systems. In this paper, we propose a web-based authentication system using three other verifiers based on functional, parametric, and structural approaches for one biometrics of handwritten signature, which is conformable to a specification of BioAPI introduced by BioAPI Consortium for a standardization of biometric technology. This system is developed with a client-server structure, and clients and servers consist of three layers according to the BioAPI structure. The proposed neb-based multiple authentication system of one biometrics can be used to highly increase confidence degree of authentication without additional several biological measurements, although rejection rate is a little increased. That is, the false accept rate(FAR) decreases on the scale of about 1:40,000, although false reject rate(FRR) increases about 2.7 times in the case of combining above three signature verifiers. So the proposed approach can be used as an effective identification method on the internet of an open network. Also, it can be easily extended to a security system using multimodal biometrics.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.272-285
• /
• 2008

In this paper, we concentrate on data allocation methods for multiple broadcast channels. When the server broadcasts data, the important issue is to let mobile clients access requested data rapidly. Previous works first sorted data by their access probabilities and allocate the sorted data to the multiple channels by partitioning them into multiple channels. However, they do not reflect the difference of access probabilities among data allocated in the same channel. This paper proposes ZGMD allocation method. ZGMD allocates data item on multiple channels so that the difference of access probability in the same channel is maximized. ZGMD allocates sorted data to each channels and applies Broadcast Disk in each channel. ZGMD requires a proper indexing scheme for the performance improvement. This is because in ZGMD method each channel got allocated both hot and cold data. As a result, the sequential search heuristic does not allow the mobile client to access hot data items quickly. The proposed index scheme is based on using dedicated index channels in order to search the data channel where the requested data is. We show that our method achieve the near-optimal performance in terms of the average access time and significantly outperforms the existing methods.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.466-474
• /
• 2007

Asymmetric networks that the downlink bandwidth is larger than the uplink bandwidth may cause the degradation of the TCP performance due to the uplink congestion. In order to solve this problem, this paper designs and implements the Dynamic Segment Size Control mechanism which offers a suitable segment size for current networks. The proposed mechanism does not require any changes in customer premises but suppress the number of ACKs using segment reassembly technique to avoid the uplink congestion. The gateway which adapted the Dynamic Segment Size Control mechanism, detects the uplink congestion condition and dynamically measures the bandwidth asymmetric ratio and the packet loss ratio. The gateway reassembles some of segments received from the server into a large segment and transmits it to the client. This reduces the number of corresponding ACKs. In this mechanism, the SACK option is used when occurs the bit error during the transmission. Based on the simulation in the GEO satellite network environment, we analyzed the performance of the Dynamic Segment Size Control mechanism.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.773-780
• /
• 2005

Recently, the telecommunication network is in a transition toward the BcN (Broadband convergence Networks) that integrates the Internet, the telecommunication and the broadcasting. The BcN makes it possible to provide of 4he third-party application by using the Open API The Parlay X API is an example of the Open API and the Parlay X API is grafted in the Web Service and is abstracted from the Parlay API. So, the Parlay X API does not only have advantages of a Web Service, but also disadvantages of the Web Service. The main disadvantage of the Web Service is that it does not support the any QoS mechanism. In this paper, we propose the architecture that solves the reliability among the QoS issues for the Web Service. The proposed mechanism adopts the Asynchronous architecture for the reliable Web Service and improves the performance of the retransmission between the client and the server using the expected response time. We perform the performance evaluation through the simulation in older to compare with the existing mechanism. Consequently, we can confirm that the performance of the proposed mechanism performs better than the existing mechanism.

• The Journal of the Korea Contents Association
• /
• v.14 no.9
• /
• pp.14-23
• /
• 2014

Existing attending management systems require a high cost and are lack of convenience. In this paper, we propose a convenient and practical attending management system as follows: First, our system allows us to construct an attendance book in an easy and simple way. A professor does not have to provide the information of students using the small screen of his smartphone. Instead, each student manages his own information via the app designed for a student in our system. Then the professor can construct the attendance book using another app designed for the professor by confirming the requests from the app designed for a student. Second, our system enables a professor to utilize the pictures of students as well as other information of students to have a good relationship with students. Third, our system provides a functionality of checking attendance automatically by calling the names of students via the app designed for the professor. Then the professor has only to match the name with the face of each student. Fourth, our system provides a functionality of checking attendance in a very fast manner. Our system can complete this behavior within a short time since all students can join the attendance simultaneously by using the app designed for the student. Fifth, our system can prevent an illegal attendance easily by utilizing the distance information.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.137-148
• /
• 2011

Different from the traditional client-server model, it is possible for participants in a cooperative distributed system to get quality services regardless of the number of participants in the system since they voluntarily pool or share their resources in order to achieve their common goal. However, some selfish participants try to avoid providing their resources while still enjoying the benefits offered by the system, which is termed free-riding. The results of free-riding in cooperative distributed systems lead to system collapse because the system capacity (per participant) decreases as the number of free-riders increases, widely known as the tragedy of commons. As a consequence, designing an efficient incentive mechanism to prevent free-riding is mandatory for a successful cooperative distributed system. Because of the importance of incentive mechanisms in cooperative distributed system, a myriad of incentives mechanisms have been proposed without a standard for performance evaluation. This paper draws general incentive design considerations which can be used as performance metrics through an extensive survey on this literature, providing future researchers with guidelines for the effective incentive design in cooperative distributed systems.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.2
• /
• pp.81-90
• /
• 2013

During the past decade, many changes and attempts have been tried and are continued developing new technologies in the computing area. The brick wall in computing area, especially power wall, changes computing paradigm from computing hardwares including processor and system architecture to programming environment and application usage. The high performance computing (HPC) area, especially, has been experienced catastrophic changes, and it is now considered as a key to the national competitiveness. In the late 2000's, many leading countries rushed to develop Exascale supercomputing systems, and as a results tens of PetaFLOPS system are prevalent now. In Korea, ICT is well developed and Korea is considered as a one of leading countries in the world, but not for supercomputing area. In this paper, we describe architecture design of MAHA supercomputing system which is aimed to develop 300 TeraFLOPS system for bio-informatics applications like human genome analysis and protein-protein docking. MAHA supercomputing system is consists of four major parts - computing hardware, file system, system software and bio-applications. MAHA supercomputing system is designed to utilize heterogeneous computing accelerators (co-processors like GPGPUs and MICs) to get more performance/$, performance/area, and performance/power. To provide high speed data movement and large capacity, MAHA file system is designed to have asymmetric cluster architecture, and consists of metadata server, data server, and client file system on top of SSD and MAID storage servers. MAHA system softwares are designed to provide user-friendliness and easy-to-use based on integrated system management component - like Bio Workflow management, Integrated Cluster management and Heterogeneous Resource management. MAHA supercomputing system was first installed in Dec., 2011. The theoretical performance of MAHA system was 50 TeraFLOPS and measured performance of 30.3 TeraFLOPS with 32 computing nodes. MAHA system will be upgraded to have 100 TeraFLOPS performance at Jan., 2013.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04b
• /
• pp.727-730
• /
• 2001

초고속 인터넷 서비스의 확대에 따라 이를 교육에 직 간접적으로 응용하기 위한 노력이 지속적으로 진행되어 왔다. 특히 웹 기반의 가상강의 저작도구를 통한 웹 코스웨어는 원거리 학습자들의 학습 욕구를 자기 주도적인 학습을 통해 가능케 했고 기존의 텍스트, 사운드를 통한 가상강의에서 동영상이 가미된 주문형 교육 서비스(EOD: Education On Demand)가 가능해졌다. 그러나 이를 이용하는 학습자는 전체적인 모듈의 이해를 통해 수업이 진행됨에 따라 학습과정에서는 질의응답을 튜터를 통해 웹 캐스팅이 이루어졌다. 따라서, 질의응답은 텍스트 형식의 E-mail, 채팅, 게시판, 방명록을 통해 이루어지므로 학습자가 요구한 질의 내용을 잘못 이해하고 튜터가 학습 과정에서의 피드백을 제공하지 못함으로써 개인 학습의 동기부여가 감소됨에 따라 흥미를 잃게 되었다. 본 논문에서는 이러한 문제점을 개선하기 위해 멀티 캐스팅 기법을 통해 교육용 서버를 이용한 학습지원도구를 분석, 설계한다. 가상강의는 기본적인 컨텐츠를 제시하고 그를 통해 수업이 진행되는 과정에서의 질의응답을 일대다(One-To-Many)의 멀티 캐스팅 서비스를 튜터가 지정한 교육용 서버를 통해 텍스트 형식이 아닌 강의자료로 쓰인 문서 파일에 직접 작성하여 전송하게 된다. 따라서 튜터는 메일링 서비스를 통해 질문사항을 자신의 폴더 서비스로 확인하고 즉시 학습자에게 피드백을 제공함으로써 튜터와 학습자들간의 커뮤니케이션이 활발히 이루어지며, 상호작용의 증가를 통해 웹 기반의 컨퍼런싱(WBC: Web Based Conferencing)을 가질 수 있게 된다.rver는 Client가 요청한 Content(services)를 전달 해 주는 컨텐트 전달 모듈(Content Deliver Module)과 서버 Phonebook 엑세스 모들(Server Phonebook Access Module)로 구성되어 있다.외 보다 높았다(I/O ratio 2.5). BTEX의 상대적 함량도 실내가 실외보다 높아 실내에도 발생원이 있음을 암시하고 있다. 자료 분석결과 유치원 실내의 벤젠은 실외로부터 유입되고 있었고, 톨루엔, 에틸벤젠, 크실렌은 실외뿐 아니라 실내에서도 발생하고 있었다. 정량한 8개 화합물 각각과 총 휘발성 유기화합물의 스피어만 상관계수는 벤젠을 제외하고는 모두 유의하였다. 이중 톨루엔과 크실렌은 총 휘발성 유기화합물과 좋은 상관성 (톨루엔 0.76, 크실렌, 0.87)을 나타내었다. 이 연구는 톨루엔과 크실렌이 총 휘발성 유기화합물의 좋은 지표를 사용될 있고, 톨루엔, 에틸벤젠, 크실렌 등 많은 휘발성 유기화합물의 발생원은 실외뿐 아니라 실내에도 있음을 나타내고 있다.>10)의 $[^{18}F]F_2$를 얻었다. 결론: $^{18}O(p,n)^{18}F$ 핵반응을 이용하여 친전자성 방사성동위원소 $[^{18}F]F_2$를 생산하였다. 표적 챔버는 알루미늄으로 제작하였으며 본 연구에서 연구된 $[^{18}F]F_2$가스는 친핵성 치환반응으로 방사성동위원소를 도입하기 어려운 다양한 방사성의 약품개발에 유용하게 이용될 수 있을 것이다.었으나 움직임 보정 후 영상을 이용하여 비교한 경우, 결합능 변화

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.9
• /
• pp.595-602
• /
• 2013

WiFi fingerprinting is well known as an effective localization technique used for indoor environments. However, this technique requires a large amount of pre-built fingerprint maps over the entire space. Moreover, due to environmental changes, these maps have to be newly built or updated periodically by experts. As a way to avoid this problem, crowd-sourced fingerprint mapping attracts many interests from researchers. This approach supports many volunteer users to share their WiFi fingerprints collected at a specific environment. Therefore, crowd-sourced fingerprinting can automatically update fingerprint maps up-to-date. In most previous systems, however, individual users were asked to enter their positions manually to build their local fingerprint maps. Moreover, the systems do not have any principled mechanism to keep fingerprint maps clean by detecting and filtering out erroneous fingerprints collected from multiple users. In this paper, we present the design of a crowd-sourced fingerprint mapping and localization(CMAL) system. The proposed system can not only automatically build and/or update WiFi fingerprint maps from fingerprint collections provided by multiple smartphone users, but also simultaneously track their positions using the up-to-date maps. The CMAL system consists of multiple clients to work on individual smartphones to collect fingerprints and a central server to maintain a database of fingerprint maps. Each client contains a particle filter-based WiFi SLAM engine, tracking the smartphone user's position and building each local fingerprint map. The server of our system adopts a Gaussian interpolation-based error filtering algorithm to maintain the integrity of fingerprint maps. Through various experiments, we show the high performance of our system.