• The KIPS Transactions:PartA
• /
• v.15A no.4
• /
• pp.239-242
• /
• 2008

We study the problem of finding the maximum suffix of a string on the external memory model of computation with one disk. In this model, we are primarily interested in designing algorithms that reduce the number of I/Os between the disk and the internal memory. A string of length N has N suffixes and among these, the lexicographically largest one is called the maximum suffix of the string. Finding the maximum suffix of a string plays a crucial role in solving some string problems. In this paper, we present an external memory algorithm for computing the maximum suffix of a string of length N. The algorithm uses four blocks in the internal memory and performs at most 4(N/L) disk I/Os, where L is the size of a block.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.1096-1112
• /
• 2019

The cameras generating 360 VR image are too expensive to be used publically. To overcome this problem, we propose a way to use smart phones instead of VR camera, where more than 100 pictures are taken by smart phone and are stitched into a 360 VR image. In this scenario, when moving objects are in some of the pictures, the stitched 360 VR image has various degradations, for example, ghost effect and mis-aligning. In this paper, we proposed an algorithm to modify the seam finding algorithms, where the saliency map in ROI is generated to check whether the pixel belongs to visually salient objects or not. Various simulation results show that the proposed algorithm is effective to increase the quality of the generated 360 VR image.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.11
• /
• pp.4503-4508
• /
• 2010

A direction finding(DF) technology of a signal is very important for electronic warfare and has studied for a long time. The method of TDOA(time difference of arrival) is one of good DF methods in this time, and that is to receive an emitter signal with two antennas, to measure the time difference of a signal at two antennas, and converse the time difference to direction of the signal. For small DF error, high time resolution receiver and long baseline are needed. In this paper we suggest a good baseline with adaptive antenna arrangement into 10m*10m area.

• Journal of Korean Society of Archives and Records Management
• /
• v.2 no.2
• /
• pp.93-106
• /
• 2002

Finding aids are descriptive tools for archival materials in order to physically and intellectually understand and control archival collections. For electronic finding aids, encoded archival description has been developed as part of the Online Archive of California project for direct and comprehensive access to a variety of archival materials across the California state. The purpose of this article are: to understand a brief history of EAD development; to examine EAD encoding, format conversion, structure, and representation used in OAC; and to necessarily suggest that a customized EAD model should be developed for Korean contexts.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.7
• /
• pp.125-133
• /
• 2019

Because military weapons systems for special purposes are small and complex, they are not easy to maintain. Therefore, it is very important to maintain combat strength through quick maintenance in the event of a breakdown. In particular, naval ships are complex weapon systems equipped with various equipment, so other equipment must be considered for maintenance in the event of equipment failure, so that skilled maintenance personnel have a great influence on rapid maintenance. Therefore, in this paper, we analyzed maintenance data of defense equipment maintenance information system through text mining and social network analysis(SNA), and tried to identify the naval ship maintenance expertise. The defense equipment maintenance information system is a system that manages military equipment efficiently. In this study, the data(2,538cases) of some naval ship maintenance teams were analyzed. In detail, we examined the contents of main maintenance and maintenance personnel through text mining(word cloud, word network). Next, social network analysis(collaboration analysis, centrality analysis) was used to confirm the collaboration relationship between maintenance personnel and maintenance expertise. Finally, we compare the results of text mining and social network analysis(SNA) to find out appropriate methods for finding and finding naval ship maintenance expertise.

• The Journal of Asian Finance, Economics and Business
• /
• v.8 no.2
• /
• pp.685-695
• /
• 2021

This study explores the impact of stochastic volatility in option pricing. To be more specific, we compare the option pricing performance between stochastic volatility option pricing model, namely, Heston option pricing model and standard Black-Scholes option pricing. Our finding, based on the market price of SET50 index option between May 2011 and September 2020, demonstrates stochastic volatility of underlying asset return for all level of moneyness. We find that both deep in the money and deep out of the money option exhibit higher volatility comparing with out of the money, at the money, and in the money option. Hence, our finding confirms the existence of volatility smile in Thai option markets. Further, based on calibration technique, the Heston option pricing model generates smaller pricing error for all level of moneyness and time to expiration than standard Black-Scholes option pricing model, though both Heston and Black-Scholes generate large pricing error for deep-in-the-money option and option that is far from expiration. Moreover, Heston option pricing model demonstrates a better pricing accuracy for call option than put option for all level and time to expiration. In sum, our finding supports the outperformance of the Heston option pricing model over standard Black-Scholes option pricing model.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.12 no.1
• /
• pp.596-604
• /
• 2020

Previous studies on pipe auto-routing algorithms generally used such algorithms as A*, Dijkstra, Genetic Algorithm, Particle Swarm Optimization, and Ant Colony Optimization, to satisfy the relevant constraints of its own field and improve the output quality. On the other hand, this study aimed to significantly improve path-finding speed by applying the Jump Point Search (JPS) algorithm, which requires lower search cost than the abovementioned algorithms, for pipe routing. The existing JPS, however, is limited to two-dimensional spaces and can only find the shortest path. Thus, it requires several improvements to be applied to pipe routing. Pipe routing is performed in a three-dimensional space, and the path of piping must be parallel to the axis to minimize its interference with other facilities. In addition, the number of elbows must be reduced to the maximum from an economic perspective, and preferred spaces in the path must also be included. The existing JPS was improved for the pipe routing problem such that it can consider the above-mentioned problem. The fast path-finding speed of the proposed algorithm was verified by comparing it with the conventional A* algorithm in terms of resolution.

• Imaging Science in Dentistry
• /
• v.52 no.3
• /
• pp.319-326
• /
• 2022

This report presents the case of a 5-year-old boy with a hard swelling on the right side of the mandible body. An important point of this case is that the primary imaging finding was fine spicules in the inferior border of the mandible on panoramic radiography without significant changes in bone density. Cone-beam computed tomography views revealed a lytic lesion on the lingual side of the right mandibular body with the destruction of the lingual cortex and periosteal reaction from the midline to the first molar area. Careful attention to this radiographic finding in the primary stage in the absence of other significant imaging findings, particularly in children, could result in the early diagnosis of desmoplastic fibroma. Therefore, a better prognosis can be expected following early surgical treatment.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.2
• /
• pp.42.1-42.1
• /
• 2021

Galaxy/Halo finding based on the friends-of-friend (FoF) algorithm has been widely adopted for its simplicity and expandability to the phase-space. However, cosmological simulations have been progressively bigger in size and more accurate in resolutions, resulting in that galaxy/halo finding gets computationally expensive more and more. In fact, we confirm this issue through our exercise of applying the 6-dimensional (6D) FoF galaxy finder code, VELOCIraptor (Elahi et al.2019) on the NewHorizon simulation (Dubois et al. 2021), in which typical galaxies with about 1e11 M_sun (10⁷ particles) are identified with very low speed (longer than a day). We have applied several improvements to the original VELOCIraptor code that solve the low-performance problem of galaxy finding on a simulation with high resolutions. Our modifications find the exact same FoF group and can be readily applied to any tree-based FoF code, achieving a 2700 (12) times speedup in the 3D (6D) FoF search compared to the original execution. We applied the updated version of VELOCIraptor on the entire NewHorizon simulation (834 snapshots) and identified its galaxies and halos. We present several quick comparisons of galaxy properties with those with GALAXYMaker data.

• Nuclear Engineering and Technology
• /
• v.56 no.1
• /
• pp.92-99
• /
• 2024

To minimize the cumulative radiation dose, various path-finding approaches for single agent have been proposed. However, for emergence situations such as nuclear power plant accident, these methods cannot be effectively utilized for evacuating a large number of workers because no multi-agent method is valid to conduct the mission. In this study, a novel algorithm for solving the multi-agent path-finding problem is proposed using the conflict-based search approach and the objective function redefined in terms of the cumulative radiation dose. The proposed method can find multi paths that all agents arrive at the destinations with reducing the overall radiation dose. To verify the proposed method, three problems were defined. In the single-agent problem, the objective function proposed in this study reduces the cumulative dose by 82% compared with that of the shortest distance algorithm in experiment environment of this study. It was also verified in the two multi-agent problems that multi paths with minimized the overall radiation dose, in which all agents can reach the destination without collision, can be found. The method proposed in this study will contribute to establishing evacuation plans for improving the safety of workers in radiation-related facilities.