• Journal of Korea Entertainment Industry Association
• /
• v.15 no.1
• /
• pp.131-142
• /
• 2021

Purpose: Clinical practicums via non-face-to-face methods were inevitable due to the COVID-19 pandemic. We developed an online program for emergency nursing care and identified the feasibility of the program and the learning achievements of students. Methods: This was a methodological study. The program was developed by three professors who taught theory and clinical practicum for adult nursing care and clinical experts. Students received four hours of video content and two task activities every week in four-week program. Real-time interactive video conferences were included. Qualitative and qualitative data were collected. Results: A total of 96 students participated in the program. The mean score for overall satisfaction with the online program was 4.72(±1.02) out of 6. Subjects that generally had high learning achievement scores were basic life support care, fall prevention, nursing documentation, infection control, and anaphylaxis care. As a result of a content analysis of 77 reflective logs on the advantages of this program, students reported that "experience in applying nursing process," "case-based learning and teaching method," and "No time and space constraints" were the program's best features. Conclusion: Collaboration between hospitals and universities for nursing is more important than ever to develop online content for effective clinical practicum.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.51 no.5
• /
• pp.386-395
• /
• 2006

The core questions for determining nitrogen topdress rate (Npi) at panicle initiation stage (PIS) are 'how much nitrogen accumulation during the reproductive stage (PNup) is required for the target rice yield or protein content depending on the growth and nitrogen nutrition status at PIS?' and 'how can we diagnose the growth and nitrogen nutrition status easily at real time basis?'. To address these questions, two years experiments from 2001 to 2002 were done under various rates of basal, tillering, and panicle nitrogen fertilizer by employing a rice cultivar, Hwaseongbyeo. The response of grain yield and milled-rice protein content was quantified in relation to RVIgreen (green ratio vegetation index) and SPAD reading measured around PIS as indirect estimators for growth and nitrogen nutrition status, the regression models were formulated to predict PNup based on the growth and nitrogen nutrition status and Npi at PIS. Grain yield showed quadratic response to PNup, RVIgreen around PIS, and SPAD reading around PIS. The regression models to predict grain yield had a high determination coefficient of above 0.95. PNup for the maximum grain yield was estimated to be 9 to 13.5 kgN/10a within the range of RVIgreen around PIS of this experiment. decreasing with increasing RVIgreen and also to be 10 to 11 kgN/10a regardless of SPAD readings around PIS. At these PNup's the protein content of milled rice was estimated to rise above 9% that might degrade eating quality seriously Milled-rice protein content showed curve-linear increase with the increase of PNup, RVIgreen around PIS, and SPAD reading around PIS. The regression models to predict protein content had a high determination coefficient of above 0.91. PNup to control the milled-rice protein content below 7% was estimated as 6 to 8 kgN/10a within the range of RVIgreen and SPAD reading of this experiment, showing much lower values than those for the maximum grain yield. The recovery of the Npi applied at PIS ranged from 53 to 83%, increasing with the increased growth amount while decreasing with the increasing Npi. The natural nitrogen supply from PIS to harvest ranged from 2.5 to 4 kg/10a, showing quadratic relationship with the shoot dry weight or shoot nitrogen content at PIS. The regression models to estimate PNup was formulated using Npi and anyone of RVIgreen, shoot dry weight, and shoot nitrogen content at PIS as predictor variables. These models showed good fitness with determination coefficients of 0.86 to 0.95 The prescription method based on the above models predicting grain yield, protein content and PNup and its constraints were discussed.

• Journal of Korean Society for Geospatial Information Science
• /
• v.8 no.1 s.15
• /
• pp.51-63
• /
• 2000

Dynamic traffic assignment(DTA) has been a topic of substantial research during the past decade. While DTA is gradually maturing, many aspects of DTA still need improvement, especially regarding its formulation and solution algerian Recently, with its promise for In(Intelligent Transportation System) and GIS(Geographic Information System) applications, DTA have received increasing attention. This potential also implies higher requirement for DTA modeling, especially regarding its solution efficiency for real-time implementation. But DTA have many mathematical difficulties in searching process due to the complexity of spatial and temporal variables. Although many solution algorithms have been studied, conventional methods cannot iud the solution in case that objective function or constraints is not convex. In this paper, the genetic algorithm to find the solution of DTA is applied and the Merchant-Nemhauser model is used as DTA model because it has a nonconvex constraint set. To handle the nonconvex constraint set the GENOCOP III system which is a kind of the genetic algorithm is used in this study. Results for the sample network have been compared with the results of conventional method.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.35 no.6
• /
• pp.109-120
• /
• 2023

The High-Frequency Radar (HFR) is an equipment designed to measure real-time surface ocean currents in broad maritime areas.It emits radio waves at a specific frequency (HF) towards the sea surface and analyzes the backscattered waves to measure surface current vectors (Crombie, 1955; Barrick, 1972).The Seasonde HF Radar from Codar, utilized in this study, determines the speed and location of radial currents by analyzing the Bragg peak intensity of transmitted and received waves from an omnidirectional antenna and employing the Multiple Signal Classification (MUSIC) algorithm. The generated currents are initially considered ideal patterns without taking into account the characteristics of the observed electromagnetic wave propagation environment. To correct this, Antenna Pattern Measurement (APM) is performed, measuring the strength of signals at various positions received by the antenna and calculating the corrected measured vector to radial currents.The APM principle involves modifying the position and phase information of the currents based on the measured signal strength at each location. Typically, experiments are conducted by installing an antenna on a ship (Kim et al., 2022). However, using a ship introduces various environmental constraints, such as weather conditions and maritime situations. To reduce dependence on maritime conditions and enhance economic efficiency, this study explores the possibility of using unmanned aerial vehicles (drones) for APM. The research conducted APM experiments using a high-frequency radar installed at Dangsa Lighthouse in Dangsa-ri, Wando County, Jeollanam-do. The study compared and analyzed the results of APM experiments using ships and drones, utilizing the calculated radial currents and surface current fields obtained from each experiment.

• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.67-74
• /
• 2015

In recent years, frequent itemset mining for considering the importance of each item has been intensively studied as one of important issues in the data mining field. According to strategies utilizing the item importance, itemset mining approaches for discovering itemsets based on the item importance are classified as follows: weighted frequent itemset mining, frequent itemset mining using transactional weights, and utility itemset mining. In this paper, we perform empirical analysis with respect to frequent itemset mining algorithms based on transactional weights. The mining algorithms compute transactional weights by utilizing the weight for each item in large databases. In addition, these algorithms discover weighted frequent itemsets on the basis of the item frequency and weight of each transaction. Consequently, we can see the importance of a certain transaction through the database analysis because the weight for the transaction has higher value if it contains many items with high values. We not only analyze the advantages and disadvantages but also compare the performance of the most famous algorithms in the frequent itemset mining field based on the transactional weights. As a representative of the frequent itemset mining using transactional weights, WIS introduces the concept and strategies of transactional weights. In addition, there are various other state-of-the-art algorithms, WIT-FWIs, WIT-FWIs-MODIFY, and WIT-FWIs-DIFF, for extracting itemsets with the weight information. To efficiently conduct processes for mining weighted frequent itemsets, three algorithms use the special Lattice-like data structure, called WIT-tree. The algorithms do not need to an additional database scanning operation after the construction of WIT-tree is finished since each node of WIT-tree has item information such as item and transaction IDs. In particular, the traditional algorithms conduct a number of database scanning operations to mine weighted itemsets, whereas the algorithms based on WIT-tree solve the overhead problem that can occur in the mining processes by reading databases only one time. Additionally, the algorithms use the technique for generating each new itemset of length N+1 on the basis of two different itemsets of length N. To discover new weighted itemsets, WIT-FWIs performs the itemset combination processes by using the information of transactions that contain all the itemsets. WIT-FWIs-MODIFY has a unique feature decreasing operations for calculating the frequency of the new itemset. WIT-FWIs-DIFF utilizes a technique using the difference of two itemsets. To compare and analyze the performance of the algorithms in various environments, we use real datasets of two types (i.e., dense and sparse) in terms of the runtime and maximum memory usage. Moreover, a scalability test is conducted to evaluate the stability for each algorithm when the size of a database is changed. As a result, WIT-FWIs and WIT-FWIs-MODIFY show the best performance in the dense dataset, and in sparse dataset, WIT-FWI-DIFF has mining efficiency better than the other algorithms. Compared to the algorithms using WIT-tree, WIS based on the Apriori technique has the worst efficiency because it requires a large number of computations more than the others on average.