• Title/Summary/Keyword: 분산 시뮬레이션

Search Result 1,281, Processing Time 0.027 seconds

The Factors Influence of Clinical Competency of Core Basic Nursing Skills During the Clinical Practice in Nursing Students (간호대학생의 임상실습 중 핵심기본간호술 수행자신감에 영향을 미치는 요인)

  • Kim, Dong-Ok;Byun, Soung-Won;Lee, Haejin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.7
    • /
    • pp.85-92
    • /
    • 2019
  • This study was a descriptive study conducted to identify factors that had an influence on clinical competency of core basic nursing skills(CBNS) during the clinical practice in nursing students. Data were collected from 3rd and 4th grade 190 nursing students in G city using self-report questionnaire, and analyzed using descriptive statistics, the t-test, one way ANOVA, multiple regression with SPSS 23.0 program. This study found that the number of experience CBNS below 5 was 51.1%, and the number of observation CBNS over 11 was 78.4%. Clinical competency according to general characteristics, clinical practice satisfaction and the level of CBNS experience increased with male, increase age and grade, and major subject satisfaction and clinical practice satisfaction, especially, as the number of experience CBNS increased, clinical competency increased(p<0.001). But clinical competency did not differ according to the number of observation CBNS(p=0.463). The factors affecting the clinical competency of nursing students were age, grade, clinical practice satisfaction and the number of experience CBNS. Therefore, it is important to increase the opportunity to directly experience the various CBNS in clinical practice of nursing students in the nursing education curriculum, and it is necessary to find ways to actively use simulation education.

A study on the development of distribution simulator and simulation results for use in distribution automation system of IEC 61850 protocol (IEC 61850 프로토콜의 배전자동화시스템에 사용을 위한 배전시뮬레이터 개발과 시뮬레이션 결과에 관한 연구)

  • Kim, Jae-Hong;Oh, Jae-Gon
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.15 no.2
    • /
    • pp.95-102
    • /
    • 2022
  • It is a study for the evaluation of the stability of the distribution automation system for the expansion of renewable energy. Through the Renewable Energy 3020 Implementation Plan, the government plans to expand new renewable energy and convert it to participatory energy that improves the quality of life of the people by 2030. The government has set a target of 20% of domestic supply energy for renewable energy generation by 2030. It is planning to establish more than 95 percent of its new facilities with clean energy such as solar power and wind power. By expanding the supply of renewable energy, new energy businesses and distributed power industry were fostered, and short-distance, low-voltage, and small-scale power generation were rapidly expanded rather than large-scale power development in the past. Due to this demand, the importance of power distribution facility operation has emerged and the need for distribution automation system is increasing. This paper discusses the development of a power distribution simulator for the performance and function evaluation of power distribution automation systems and presents the results of an interlocking test with the power distribution automation system. In order to introduce an advanced system into the power distribution system, it is necessary to take advantage of the transmission and distribution system. The DNP3.0 protocol is used in the distribution system and the IEC61850 protocol is used in the transmission and distribution system. It was concluded that the functions and performance of operations were satisfied when these two protocols are mixed and used in the distribution automation system.

Analysis of Distributed Computational Loads in Large-scale AC/DC Power System using Real-Time EMT Simulation (대규모 AC/DC 전력 시스템 실시간 EMP 시뮬레이션의 부하 분산 연구)

  • In Kwon, Park;Yi, Zhong Hu;Yi, Zhang;Hyun Keun, Ku;Yong Han, Kwon
    • KEPCO Journal on Electric Power and Energy
    • /
    • v.8 no.2
    • /
    • pp.159-179
    • /
    • 2022
  • Often a network becomes complex, and multiple entities would get in charge of managing part of the whole network. An example is a utility grid. While the entire grid would go under a single utility company's responsibility, the network is often split into multiple subsections. Subsequently, each subsection would be given as the responsibility area to the corresponding sub-organization in the utility company. The issue of how to make subsystems of adequate size and minimum number of interconnections between subsystems becomes more critical, especially in real-time simulations. Because the computation capability limit of a single computation unit, regardless of whether it is a high-speed conventional CPU core or an FPGA computational engine, it comes with a maximum limit that can be completed within a given amount of execution time. The issue becomes worsened in real time simulation, in which the computation needs to be in precise synchronization with the real-world clock. When the subject of the computation allows for a longer execution time, i.e., a larger time step size, a larger portion of the network can be put on a computation unit. This translates into a larger margin of the difference between the worst and the best. In other words, even though the worst (or the largest) computational burden is orders of magnitude larger than the best (or the smallest) computational burden, all the necessary computation can still be completed within the given amount of time. However, the requirement of real-time makes the margin much smaller. In other words, the difference between the worst and the best should be as small as possible in order to ensure the even distribution of the computational load. Besides, data exchange/communication is essential in parallel computation, affecting the overall performance. However, the exchange of data takes time. Therefore, the corresponding consideration needs to be with the computational load distribution among multiple calculation units. If it turns out in a satisfactory way, such distribution will raise the possibility of completing the necessary computation in a given amount of time, which might come down in the level of microsecond order. This paper presents an effective way to split a given electrical network, according to multiple criteria, for the purpose of distributing the entire computational load into a set of even (or close to even) sized computational loads. Based on the proposed system splitting method, heavy computation burdens of large-scale electrical networks can be distributed to multiple calculation units, such as an RTDS real time simulator, achieving either more efficient usage of the calculation units, a reduction of the necessary size of the simulation time step, or both.

건물의 배수 및 통기시스템: 배관 내부압력의 능동적인 제어

  • Gormly, Michael;Swaffield, John. A.
    • The Magazine of the Society of Air-Conditioning and Refrigerating Engineers of Korea
    • /
    • v.39 no.9
    • /
    • pp.41-51
    • /
    • 2010
  • 건물의 배수 및 통기시스템에서 나타나는 현상중에 확실한 내용이 아직 밝혀지지 않은 부분이 몇 가지 남아 있다. 이것은 19세기 말엽의 근대 위생공학의 시작 단계에서부터 잘 알려진 사실이다. 건물의 배수 및 통기시스템 운용에 대한 내용은 일반 공학과 특정 유체역학의 범위 내에서 가장 잘 이해할 수 있다. 건물의 배수 및 통기시스템의 운영에 종사했던 초기의 기술진들은 이러한 점을 잘 알고 있었으며 유체역학에 적합하게 응용한 많은 사례를 확인할 수 있었다. 제2차 세계대전이 끝나고 이에 대한 많은 연구가 진행되어 왔으며 특히 유럽에서 시작된 전후 재건 붐을 통해 배수 및 통기시스템의 설계에 좀 더 효율적인 접근이 진척되게 되었다. 이러한 배수시스템의 중심에는 배수관 내부의 오염된 공기가 배수구 또는 위생기구를 통하여 주거 공간으로 유입되는 것을 방지하는 트랩(Water Trap)이 있다. 배수트랩의 주요 기능인 봉수는 일반적으로 깊이가 40 mm에서 50 mm 정도로 위생기구의 종류에 따라 봉수의 깊이는 다소 차이가 있다. 배수관내 공기의 흐름이 중요한 것처럼 트랩의 봉수 메커니즘이 중요하기 때문에 이 메커니즘을 소홀히 여긴다면 안전한 배수시스템의 운영을 기대하기는 어렵다. 배수관 내의 공기의 흐름은 배수에 의해 유입되거나 또는 배출된다. 배수관에서 내부 압력의 불규칙한 변화로 인하여 야기되는 불안정한 배수의 흐름은 트랩의 봉수를 파괴하고 나아가 주거공간으로 오염된 공기가 새어 나갈 수 있는 통로를 제공하게 된다. 관내압력의 천이는 이로 인한 문제가 발생할 가능성이 있는 위치에 그 압력을 완화할 수 있는 장치를 설계단계에 반영하여 적용함으로써 제어할 수 있다. 건물 내부에 상당한 길이의 통기배관을 설치하는 것은 배관의 마찰손실로 인하여 천이 현상을 효과적으로 제어할 수 있는 확실한 방법이 되지는 못한다. 그렇지만 통기밸브를 설치하는 것과 같이 배수관 내로 공기를 공급해주는 유입구를 건물 내부에 분산 설치하는 것이 효율적인 통기방식이 될 수 있고, 정압 천이로 인한 위험을 줄여줄 수 있다. 통기밸브는 정압 발생의 원인이 되지 않으며 단지 정압에 반응하여 더욱 기밀하게 닫히며, 약화된 압력파를 반사할 뿐이다. 고층 건물에서 배수입상관과 평행하게 설치된 통기입상관(Parallel Vent Pipe)의 경우 극히 일부분의 정압 천이 현상을 완화할 수 있다. (통기 배관의 직경이 배수 입상배관과 동일한 경우 대략 1/3 정도임), 그러므로 정압의 천이로 인한 압력 파동은 배수 시스템의 나머지 부분을 통해 전파되어 배수 트랩에 영향을 미치게 된다. 정압의 천이가 예상되는 위치에 정압천이 완화 장치(Positive Air Pressure Transient Alleviation Device)를 사용하면 배관 내부압력의 급격한 상승을 방지하여 연결된 트랩의 봉수를 보호할 수 있다. 이렇게 되면 순간적으로 발생하는 배관내 압력의 급등 현상을 90% 정도까지 완화 시킬 수 있다. 경험적으로 배수시스템에서 배관이 완전하게 막혀 과도한 정압이 발생하는 경우는 거의 없다. 이러한 경우에는 가장 낮은 위치에 있는 배수 트랩의 봉수가 깨지면서 자연스럽게 배수시스템의 압력이 해소되게 된다. 이러한 사례는 통기 방식과 상관없이 발생할 수 있다. 실제와 유사한 시뮬레이션을 통하여 통기 밸브(Air Admittance Valves)는 전면 통기 시스템 (Fully Vented System)에서 최소한 트랩의 봉수 보호용으로 적합한 것이 확인 되었다. 어떤 경우 에는 고층 건물에 더욱 적합하다는 것을 확인할 수 있었다. 부압 해소용으로 통기밸브를 이용하고 정압완화용으로 정압 완화장치(PAPAs: Positive Air Pressure Transient Attenuators)를 사용하는 전면적 능동 제어시스템(Fully Engineered Designed Active Control System)이 사용자에게 육안으로는 확인하지 못하는 기능을 보장하면서 배수 시스템의 안전과 효율성에 대한 효과적인 방법을 제공하고 있다.

  • PDF

Log Collection Method for Efficient Management of Systems using Heterogeneous Network Devices (이기종 네트워크 장치를 사용하는 시스템의 효율적인 관리를 위한 로그 수집 방법)

  • Jea-Ho Yang;Younggon Kim
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.3
    • /
    • pp.119-125
    • /
    • 2023
  • IT infrastructure operation has advanced, and the methods for managing systems have become widely adopted. Recently, research has focused on improving system management using Syslog. However, utilizing log data collected through these methods presents challenges, as logs are extracted in various formats that require expert analysis. This paper proposes a system that utilizes edge computing to distribute the collection of Syslog data and preprocesses duplicate data before storing it in a central database. Additionally, the system constructs a data dictionary to classify and count data in real-time, with restrictions on transmitting registered data to the central database. This approach ensures the maintenance of predefined patterns in the data dictionary, controls duplicate data and temporal duplicates, and enables the storage of refined data in the central database, thereby securing fundamental data for big data analysis. The proposed algorithms and procedures are demonstrated through simulations and examples. Real syslog data, including extracted examples, is used to accurately extract necessary information from log data and verify the successful execution of the classification and storage processes. This system can serve as an efficient solution for collecting and managing log data in edge environments, offering potential benefits in terms of technology diffusion.

A simulation study for various propensity score weighting methods in clinical problematic situations (임상에서 발생할 수 있는 문제 상황에서의 성향 점수 가중치 방법에 대한 비교 모의실험 연구)

  • Siseong Jeong;Eun Jeong Min
    • The Korean Journal of Applied Statistics
    • /
    • v.36 no.5
    • /
    • pp.381-397
    • /
    • 2023
  • The most representative design used in clinical trials is randomization, which is used to accurately estimate the treatment effect. However, comparison between the treatment group and the control group in an observational study without randomization is biased due to various unadjusted differences, such as characteristics between patients. Propensity score weighting is a widely used method to address these problems and to minimize bias by adjusting those confounding and assess treatment effects. Inverse probability weighting, the most popular method, assigns weights that are proportional to the inverse of the conditional probability of receiving a specific treatment assignment, given observed covariates. However, this method is often suffered by extreme propensity scores, resulting in biased estimates and excessive variance. Several alternative methods including trimming, overlap weights, and matching weights have been proposed to mitigate these issues. In this paper, we conduct a simulation study to compare performance of various propensity score weighting methods under diverse situation, such as limited overlap, misspecified propensity score, and treatment contrary to prediction. From the simulation results overlap weights and matching weights consistently outperform inverse probability weighting and trimming in terms of bias, root mean squared error and coverage probability.

A Simulation-Based Investigation of an Advanced Traveler Information System with V2V in Urban Network (시뮬레이션기법을 통한 차량 간 통신을 이용한 첨단교통정보시스템의 효과 분석 (도시 도로망을 중심으로))

  • Kim, Hoe-Kyoung
    • Journal of Korean Society of Transportation
    • /
    • v.29 no.5
    • /
    • pp.121-138
    • /
    • 2011
  • More affordable and available cutting-edge technologies (e.g., wireless vehicle communication) are regarded as a possible alternative to the fixed infrastructure-based traffic information system requiring the expensive infrastructure investments and mostly implemented in the uninterrupted freeway network with limited spatial system expansion. This paper develops an advanced decentralized traveler information System (ATIS) using vehicle-to-vehicle (V2V) communication system whose performance (drivers' travel time savings) are enhanced by three complementary functions (autonomous automatic incident detection algorithm, reliable sample size function, and driver behavior model) and evaluates it in the typical $6{\times}6$ urban grid network with non-recurrent traffic state (traffic incident) with the varying key parameters (traffic flow, communication radio range, and penetration ratio), employing the off-the-shelf microscopic simulation model (VISSIM) under the ideal vehicle communication environment. Simulation outputs indicate that as the three key parameters are increased more participating vehicles are involved for traffic data propagation in the less communication groups at the faster data dissemination speed. Also, participating vehicles saved their travel time by dynamically updating the up-to-date traffic states and searching for the new route. Focusing on the travel time difference of (instant) re-routing vehicles, lower traffic flow cases saved more time than higher traffic flow ones. This is because a relatively small number of vehicles in 300vph case re-route during the most system-efficient time period (the early time of the traffic incident) but more vehicles in 514vph case re-route during less system-efficient time period, even after the incident is resolved. Also, normally re-routings on the network-entering links saved more travel time than any other places inside the network except the case where the direct effect of traffic incident triggers vehicle re-routings during the effective incident time period and the location and direction of the incident link determines the spatial distribution of re-routing vehicles.

Fast Join Mechanism that considers the switching of the tree in Overlay Multicast (오버레이 멀티캐스팅에서 트리의 스위칭을 고려한 빠른 멤버 가입 방안에 관한 연구)

  • Cho, Sung-Yean;Rho, Kyung-Taeg;Park, Myong-Soon
    • The KIPS Transactions:PartC
    • /
    • v.10C no.5
    • /
    • pp.625-634
    • /
    • 2003
  • More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

Distinction and Tracking of Multiple Pingers Using a Single Frequency (단일 주파수에 의한 복수의 초음파 핑거의 식별 및 추적)

  • 신현옥
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.26 no.4
    • /
    • pp.360-364
    • /
    • 1990
  • To testy time division scheme, we performed some experiments in a circular water tank(13m in diameter and 1m deep). A result of that is shown in figure 4. The 2-dimensional position of the pinger was calculated by the method of hyperbolic line of position calculation. The resolution of the time difference on the base line is 2.5cm. In experiments, the multiple pingers of a single frequency were distinguished and tracked successfully. When the experiment is carried out in the water tank, some multi-path pulses always occur. To delete it, several 10 ms of time delay is inserted onto the program after a group of the normal signals are received. Some normal pulses are not received by the time delay, however there is no problem, practically, for the distinction and the tracking of the pulse. In 2-dimensional positioning, the pinger position can be calculated with three hydrophones. However, if four hydrophones are available, the positioning accuracy will be higher than three hydrophones only by some techniques. Another good feature of the use of four hydrophones is that the positioning of the pinger is capable if a hydrophone fails in receiving them. We also tested this distinguishing method in the field using another type pingers(APPENDIXA).

  • PDF

Performance Analysis of Slave-Side Arbitration Schemes for the Multi-Layer AHB BusMatrix (ML-AHB 버스 매트릭스를 위한 슬레이브 중심 중재 방식의 성능 분석)

  • Hwang, Soo-Yun;Park, Hyeong-Jun;Jhang, Kyoung-Son
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.5_6
    • /
    • pp.257-266
    • /
    • 2007
  • In On-Chip bus, the arbitration scheme is one of the critical factors that decide the overall system performance. The arbitration scheme used in traditional shared bus is the master-side arbitration based on the request and grant signals between multiple masters and single arbiter. In the case of the master-side arbitration, only one master and one slave can transfer the data at a time. Therefore the throughput of total bus system and the utilization of resources are decreased in the master-side arbitration. However in the slave-side arbitration, there is an arbiter at each slave port and the master just starts a transaction and waits for the slave response to proceed to the next transfer. Thus, the unit of arbitration can be a transaction or a transfer. Besides the throughput of total bus system and the utilization of resources are increased since the multiple masters can simultaneously perform transfers with independent slaves. In this paper, we implement and analyze the arbitration schemes for the Multi-Layer AHB BusMatrix based on the slave-side arbitration. We implement the slave-side arbitration schemes based on fixed priority, round robin and dynamic priority and accomplish the performance simulation to compare and analyze the performance of each arbitration scheme according to the characteristics of the master and slave. With the performance simulation, we observed that when there are few masters on critical path in a bus system, the arbitration scheme based on dynamic priority shows the maximum performance and in other cases, the arbitration scheme based on round robin shows the highest performance. In addition, the arbitration scheme with transaction based multiplexing shows higher performance than the same arbitration scheme with single transfer based switching in an application with frequent accesses to the long latency devices or memories such as SDRAM. The improvements of the arbitration scheme with transaction based multiplexing are 26%, 42% and 51%, respectively when the latency times of SDRAM are 1, 2 and 3 clock cycles.