• The Journal of Korean Medical History
• /
• v.35 no.2
• /
• pp.45-67
• /
• 2022

Currently, there are about 20,000 or so known ancient medical texts from the East Asian medical traditions. Although the most famous texts are widely known, many texts still exist only as original manuscripts. We are interested exploring these texts to uncover the potential benefits of their therapeutic knowledge. This study aims to develop a database program that automatically converts the treatment skills described in the text version into a more structured version. In the previous study, our team analyzed patterns in the way that treatment skills are described and then tried to design a database program algorithm that identified every meaningful keyword used to describe treatment skills and put that word in the right cell of a structured table. This study continues the development of this program. East Asian medical herbal treatment information is broken down into 4 elements: the first one is the name or title of treatment skills, and the second is the symptoms to which the treatment is applied, the third is ingredients used, the fourth is how information is processed and the indications taken. This study presents the algorithm's principles on how to analyze and structure the fourth element, the processing of information and taking of indications, which is described in a form of ancient natural language.

• Journal of Advanced Navigation Technology
• /
• v.28 no.1
• /
• pp.15-20
• /
• 2024

The utilization of small unmanned aerial vehicles (UAVs) has expanded into both military and civilian domains, increasing the necessity for research to ensure operational safety and the efficient utilization of airspace. In this study, the calculation of minimum separation distances for the safe operation of small UAVs at low altitudes was conducted. The determination of minimum separation distances requires a comprehensive analysis of the total system errors associated with small UAVs, necessitating sensitivity analysis to identify key factors contributing to flight technology errors. Flight data for small UAVs were acquired by integrating the control system of an actual small UAV with a flight simulation program. Based on this data, operational scenarios for small UAVs were established, and the minimum separation distances for each scenario were calculated. This research contributes to proposing methods for utilizing calculated minimum separation distances as crucial parameters for ensuring the safe operation of small unmanned aerial vehicles in real-world scenarios.

• Information Systems Review
• /
• v.19 no.2
• /
• pp.137-157
• /
• 2017

Social ties play an important role in today's competitive world. The primary objective of this study is to explore the impact of intra- and inter-social ties on team innovativeness and performance. Through an empirical model of 97 teams in six companies, this study attempts to (i) examine how intra- and inter-social ties affect team innovativeness and team performance; and (ii) investigate how the support for information technology facilitates social ties. Our team-based analysis reveals that strong intra-bonds among members improve team innovativeness and enhance team performance. Inter-linkages among teams also lead to team performance through innovativeness, but they are not directly associated with performance. IT support also considerably enhances social ties.

• The Journal of the Acoustical Society of Korea
• /
• v.43 no.4
• /
• pp.455-465
• /
• 2024

In shallow water, the array invariant, known as the effective range estimation method, is developed based on the broadband dispersion characteristics in an ideal waveguide, which can be summarized by the waveguide invariant. It is robust enough to estimate both the array tilt and range simultaneously, even in situations where array tilt exists. Recently, it has been extended to fully consider the angle dependence of the waveguide invariant. However, applying the array invariant in range-dependent environments instead of range-independent environments can lead to range estimation errors due to bathymetry mismatch. In this paper, we interpret such range estimation errors by introducing the concept of effective range. Through numerical simulations and experimental data in a weakly range-dependent environment, we demonstrate the relationship between range estimation errors and effective range.

• The Journal of the Acoustical Society of Korea
• /
• v.43 no.4
• /
• pp.466-475
• /
• 2024

Matched-Field Processing (MFP) is a model-based approach that requires accurate knowledge of the ocean environment and array geometry (e.g., array tilt) to localize underwater acoustic sources. Consequently, it is inherently sensitive to model mismatches. In contrast, the waveguide invariant-based approach (also known as array invariant) offers a simple and robust means for source-range estimation in shallow waters. This approach solely exploits the beam angles and travel times of multiple arrivals separated in the beam-time domain, requiring no modeling of the acoustic fields, unlike MFP. This paper extends the waveguide invariant-based approach to shallow water environments featuring a shallow pit, where the waveguide invariant is not defined due to the complex bathymetry. An in-depth performance analysis is conducted using experimental data and numerical simulations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.4
• /
• pp.89-97
• /
• 2024

The problem of the spokes puzzle(SP), which connects the spokes(edges) required by the wheel axis (hub, vertex) without intersection to form a network in which all the hubs are connected, can be said to be a wasteland of research. For this problem, there is no algorithm that presents a brute-force search or branch-and-bound method that takes exponential time. This paper proposes an algorithm to plot a lattice graph with cross-diagonal lines of m×n for a given SP and to pruning(delete) the surplus edges(spokes). The proposed algorithm is a simple way to select an edge of a hub whose number of edges matches the hub requirement and delete the edge crossing it. If there is no hub with an edge that meets the hub requirement, a strategy was adopted to preferentially delete(pruning) the edge of the hub with the maximum amount of spare. As a result of applying the proposed algorithm to 20 benchmarking experimental data, it was shown that a solution that minimizes the number of trials and errors can be obtained for all problems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.4
• /
• pp.99-106
• /
• 2024

The problem of the bridges(Hasjiwokakero, Hasi) puzzle, which connects the bridge(edge) required by the island(vertex) without crossing the horizontal and vertical straight bridges except for the diagonal to form a connected network, is a barren ground for research without any related research. For this problem, there is no algorithm that presents a generalized exponential time brute-force or branch-and-bound method. This paper obtained the initial solution of the lattice graph by drawing a grid without diagonal lines for a given BP, removing unnecessary edges, and supplementing essential bridges. Next, through insufficient island pair path matching, the method of adding insufficient edges to the route and deleting the crossed surplus edges(bridges) was adopted. Applying the proposed algorithm to 24 benchmarking experimental data showed that accurate solutions can be obtained for all problems.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.34 no.4
• /
• pp.725-734
• /
• 2024

The rapidly growing metaverse environment has received widespread attention across various fields such as health and medicine, culture and gaming, as well as politics. However, the excessive collection of personal data by the diverse sensors and devices used in the metaverse environment poses a substantial threat to user privacy. In this paper, we investigate existing cases of secure Multi-Party Computation(MPC) applications, examine the services anticipated to be necessary for the expansion of the metaverse environment, and analyze the privacy issues present in the metaverse environment as well as the limitations of current real-world services. Based on these findings, we propose application scenarios that utilize MPC to preserve user privacy in the metaverse environment. These proposed MPC application scenarios present a new perspective in metaverse security research. In the future, they are expected to be utilized in the development of secure metaverse services.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.5
• /
• pp.83-88
• /
• 2024

In a grid board with 9 cells of 3×3, the sum clue Sujiko puzzle with 4 fixed sum clues(FSCs) and variable sum clues(VSCs) is an NP-complete problem with no known way to solve the puzzle in polynomial time. To solve this puzzle 9! in all possible cases, a brute-force method should be applied to substitute the number. This paper determined the unique combination number cell by reducing the number of candidates that can enter empty cells. If the only number combination cell no longer exists, this paper proposes a method for determining a common number network with numbers common to the intersection cell of FSC+VSC. Applying the proposed algorithm to 9 benchmarking experimental data showed that puzzles can be solved in polynomial time for all problems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.5
• /
• pp.159-168
• /
• 2024

In a grid board with 9 cells of 3X3, the Sujiko puzzle with 4 sum clues and C number clues as one block is an NP-complete problem with no known way to solve the puzzle in polynomial time. To solve this puzzle (9-C)! in all possible cases, a brute-force method should be applied to substitute the number. This paper confirmed the clue of the unique number cell by reducing the number of candidates that can enter empty cells. When the unique number cell no longer exists, a method of selecting the intersection combination numbers between the sum clue blocks has been proposed. Applying the proposed algorithm to 52 benchmarking experimental data showed that puzzles can be solved in polynomial time for all problems.