• The Korean Journal of Emergency Medical Services
• /
• v.28 no.1
• /
• pp.63-76
• /
• 2024

Purpose: To analyze trends related to demography and EMS and to provide supporting data for the appropriate deployment of EMS providers. Methods: In this cross-sectional study, data on patients transported by 119 EMS, demographics, and EMS factors were collected using the Korean Statistical Information Service (KOSIS) and the National Fire Agency annual report from 2017 to 2021. Results: During the study period, the total number of patients and those with severe disorders transported via 119 EMS showed an increasing trend. The total fertility rate and population during the same period tended to decrease, and the population density and number of households increased; however, there was a disparity between regions. The main demographic factors affecting the number of patients transported were population density and total fertility rate, while the main EMS factors were the number of ambulances and provision of emergency medical information services(hospital guidance, pharmacy information, and first aid guidance). Conclusion: From the perspective of EMS providers' force deployment, it is necessary to consider population density, population, number of households, total fertility rate, and number of emergency medical institutions and to strengthen the role of diverting the use of 119 EMS by minor patients by providing emergency medical information.

• Proceedings of the KSR Conference
• /
• 2006.11b
• /
• pp.1562-1566
• /
• 2006

The intelligent railway operation information architecture is to provide the railway passengers with the intermodal transportation information service. The purpose of the information architecture is to suggest the information service architecture of the intermodal transportation structurally. First, the architect procedure is to analysis the user requirements and according to these requirements, is to make the description of service requirements. Then secondly, it decides the service items and based of these items, it is to construction of service architecture. Finally, service package provide an accessible, deployment oriented perspective to intelligent railway operation information architecture

• Journal of Korean Academy of Nursing
• /
• v.44 no.1
• /
• pp.64-74
• /
• 2014

Purpose: This study was done to develop and implement the Nursing KMS (knowledge management system) in order to improve knowledge sharing and creation among clinical nurses in outpatient departments. Methods: This study was a methodological research using the 'System Development Life Cycle': consisting of planning, analyzing, design, implementation, and evaluation. Quality Function Deployment (QFD) was applied to establish nurse requirements and to identify important design requirements. Participants were 32 nurses and for evaluation data were collected pre and post intervention at K Hospital in Seoul, a tertiary hospital with over 1,000 beds. Results: The Nursing KMS was built using a Linux-based operating system, Oracle DBMS, and Java 1.6 web programming tools. The system was implemented as a sub-system of the hospital information system. There was statistically significant differences in the sharing of knowledge but creating of knowledge was no statistically meaningful difference observed. In terms of satisfaction with the system, system efficiency ranked first followed by system convenience, information suitability and information usefulness. Conclusion: The results indicate that the use of Nursing KMS increases nurses' knowledge sharing and can contribute to increased quality of nursing knowledge and provide more opportunities for nurses to gain expertise from knowledge shared among nurses.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.5
• /
• pp.1084-1090
• /
• 2015

In this paper, we propose a Tabu search algorithm to efficiently deploy the sensor nodes for maximizing the network sensing coverage in wireless sensor networks. As the number of the sensor nodes in wireless sensor networks increases, the amount of calculation for searching the solution would be too much increased. To obtain the best solution within a reasonable execution time in a high-density network, we propose a Tabu search algorithm to maximize the network sensing coverage. In order to search effectively, we propose some efficient neighborhood generating operations of the Tabu search algorithm. We evaluate those performances through some experiments in terms of the maximum network sensing coverage and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2914-2935
• /
• 2016

With the increasing popularization of cloud computing, how to reduce physical energy consumption and increase resource utilization while maintaining system performance has become a research hotspot of virtual machine deployment in cloud platform. Although some related researches have been reported to solve this problem, most of them used the traditional heuristic algorithm based on greedy algorithm and only considered effect of single-dimensional resource (CPU or Memory) on energy consumption. With considerations to multi-dimensional resource utilization, this paper analyzed impact of multi-dimensional resources on energy consumption of cloud computation. A multi-dimensional resource constraint that could maintain normal system operation was proposed. Later, a novel virtual machine deployment method (NVMDM) based on improved particle swarm optimization (IPSO) and Euclidean distance was put forward. It deals with problems like how to generate the initial particle swarm through the improved first-fit algorithm based on resource constraint (IFFABRC), how to define measure standard of credibility of individual and global optimal solutions of particles by combining with Bayesian transform, and how to define fitness function of particle swarm according to the multi-dimensional resource constraint relationship. The proposed NVMDM was proved superior to existing heuristic algorithm in developing performances of physical machines. It could improve utilization of CPU, memory, disk and bandwidth effectively and control task execution time of users within the range of resource constraint.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.2
• /
• pp.11-20
• /
• 2016

We show feasibility of deployment of global wireless communications network with airliners, especially for disastrous vast areas by earthquakes or a tsunami as well as unwired regions of the global to extend Internet access. In this study, we collect flight information data related to civil aircraft passing through, especially South Korea, Japan, United States, and Europe. From the collected data, we obtain hourly available service area ratio and cumulative average service area when airliners are equipped with a long range wireless communication gadget. Then, we reveal that it is possible to deploy global wireless communications network using airliner ad hoc network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.3203-3215
• /
• 2015

Due to the high growth of SNS population, service scalability is one of the critical issues to be addressed. The cloud environment provides the flexible computing and storage resources for services deployment, which fits the characteristics of scalable SNS deployment. However, if the SNS related information is not properly placed, it will cause unbalance load and heavy transmission cost on the storage virtual machine (VM) and cloud data center (CDC) network. In this paper, we characterize the SNS into a graph model based on the users' associations and interest correlations. The node weight represents the degree of associations, which can be indexed by the number of friends or data sources, and the link weight denotes the correlation between users/data sources. Then, based on the SNS graph, the two-step algorithm is proposed in this paper to determine the placement of SNS related data among VMs. Two k-means based clustering schemes are proposed to allocate social data in proper VM and physical servers for pre-configured VM and dynamic VM environment, respectively. The experimental example was conducted and to illustrate and compare the performance of the proposed schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3034-3055
• /
• 2014

Wireless Sensor Networks have extensively been utilized for ambient data collection from simple linear structures to dense tiered deployments. Issues related to optimal resource allocation still persist for simplistic deployments including linear and hierarchical networks. In this work, we investigate the case of dimensioning parameters for linear and tiered wireless sensor network deployments with notion of providing extended lifetime and reliable data delivery over extensive infrastructures. We provide a single consolidated reference for selection of intrinsic sensor network parameters like number of required nodes for deployment over specified area, network operational lifetime, data aggregation requirements, energy dissipation concerns and communication channel related signal reliability. The dimensioning parameters have been analyzed in a pipeline monitoring scenario using ZigBee communication platform and subsequently referred with analytical models to ensure the dimensioning process is reflected in real world deployment with minimum resource consumption and best network connectivity. Concerns over data aggregation and routing delay minimization have been discussed with possible solutions. Finally, we propose a node placement strategy based on a dynamic programming model for achieving reliable received signals and consistent application in structural health monitoring with multi hop and long distance connectivity.

• Journal of KIISE:Information Networking
• /
• v.33 no.3
• /
• pp.193-200
• /
• 2006

The security feature is essential in wireless sensor network such as intrusion detection or obstacle observation. Sensor nodes must have shared secret between nodes to support security such as privacy. Many methods which provide key pre-distribution need too many keys or support poor security. To solve this problem, probabilistic key pre-distribution is proposed. This method needs a few keys and use probabilistic method to share keys. However, this method does not guarantee key sharing between nodes, and neighbor nodes nay not communicate each other. It leads to waste of network resource such as inefficient routing, extra routing protocol. In this paper, we propose new key distribution method using quorum system which needs a few keys and guarantee key sharing between nodes. We also propose extension of the method which needs fewer keys and guarantee key sharing when node deployment knowledge is well known.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3474-3497
• /
• 2016

Network Function Virtualization (NFV) and Software Defined Networking (SDN) are recently considered as very promising drivers of the evolution of existing middlebox services, which play intrinsic and fundamental roles in today's networks. To address the virtual service deployment issues that caused by introducing NFV or SDN to networks, this paper proposes an optimal solution by combining quantum genetic algorithm with cooperative game theory. Specifically, we first state the concrete content of the service deployment problem and describe the system framework based on the architecture of SDN. Second, for the service location placement sub-problem, an integer linear programming model is built, which aims at minimizing the network transport delay by selecting suitable service locations, and then a heuristic solution is designed based on the improved quantum genetic algorithm. Third, for the service amount placement sub-problem, we apply the rigorous cooperative game-theoretic approach to build the mathematical model, and implement a distributed algorithm corresponding to Nash bargaining solution. Finally, experimental results show that our proposed method can calculate automatically the optimized placement locations, which reduces 30% of the average traffic delay compared to that of the random placement scheme. Meanwhile, the service amount placement approach can achieve the performance that the average metric values of satisfaction degree and fairness index reach above 90%. And evaluation results demonstrate that our proposed mechanism has a comprehensive advantage for network application.