• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.11a
• /
• pp.298-299
• /
• 2022

Digital Transformation in the maritime transportation sector means "by utilizing digital technologies such as artificial intelligence, big data, Internet of Things, block chain, and cloud to create new business models, products, and services for maritime transportation-related companies. It can be defined as a continuous process that adapts to or drives disruptive changes in the market" (Chang, 2021). In a situation where various digital conversion technologies are applied and started to be used in the domestic port logistics field, active acceptance by members can bring about the success of digital conversion. Therefore, in this study, in order to investigate the acceptability of digital transformation in the domestic port logistics sector,

• The Journal of the Korea Contents Association
• /
• v.8 no.10
• /
• pp.259-267
• /
• 2008

This research will examine the probabilities of future global resource crisis and what significance and effect will come upon our economy through the rise of the cost of resources. From now on, the lack of the supply of global resources will dull the world economic growth. Not only that, but the direction of each country's economic development will be decided by the appropriate measure to the resource crisis. If we are to sustain this inefficient industrial structure, as a country with high dependancy on foreign resources, Korea might face macroeconomic shock and the loss of industrial competitiveness. Therefore, we must increase the efficiency of the resource usage in the manufacturing industry such as the chemical and steel industry, and now is a period when we must add high value to our products. Henceforth, the structural constraints of supply will be the root cause of resource crisis. Thus, we must lead the subject of the economic agencies, such as companies and consumers, so that they will be able to adapt to a new paradigm called the fundamental lack of resources, rather than temporal crisis management. The Korean economy must adjust the environment for industry transformation to be achieved.

• Nuclear Engineering and Technology
• /
• v.53 no.7
• /
• pp.2377-2386
• /
• 2021

To model the atmospheric dispersion of radionuclides released from nuclear accident is very important for nuclear emergency. But the uncertainty of model parameters, such as source term and meteorological data, may significantly affect the prediction accuracy. Data assimilation (DA) is usually used to improve the model prediction with the measurements. The paper proposed a parameter bias transformation method combined with Lagrangian puff model to perform DA. The method uses the transformation of coordinates to approximate the effect of parameters bias. The uncertainty of four model parameters is considered in the paper: release rate, wind speed, wind direction and plume height. And particle swarm optimization is used for searching the optimal parameters. Twin experiment and Kincaid experiment are used to evaluate the performance of the proposed method. The results show that the proposed method can effectively increase the reliability of model prediction and estimate the parameters. It has the advantage of clear concept and simple calculation. It will be useful for improving the result of atmospheric dispersion model at the early stage of nuclear emergency.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.671-674
• /
• 2000

In this paper, we present a robust global registration algorithm for multi-frame image mosaics. When we perform a pair-wise registration recovering a projective transformation between two consecutive frames, severe mis-registration among multiple frames, which are not consecutive, can be detected. It is because the concatenation of those pair-wise transformations leads to global alignment errors. To overcome those mis-registrations, we propose a new algorithm using multiple frames for constructing image mosaics. We use a graph to represent the temporal and spatial connectivity and show that global registration can be obtained through the search for an optimal path in the constructed graph. The definition of an adequate objective function characterizing the global registration provides a direct manipulation of the graph. In the presence of moving objects, especially large ones compared with low texture backgrounds, by using the likelihood ratio as the objective function, we can deal with some of the most challenging videos like basketball or soccer Moreover, the algorithm can be parallelized so it can be more efficiently implemented. Finally, we give some experimental results from real videos.

• Journal of Korea Multimedia Society
• /
• v.19 no.12
• /
• pp.1936-1942
• /
• 2016

This paper presents a mobile color-compensating application using a RGB color compensation algorithm. The proposed application enables color vision deficiencies to differentiate images which cannot be distinguished by them. The suggested mobile application has two functions: converting images taken by camera and converting contents in the device screen. The proposed application is computationally inexpensive, since it does not require color space transformation. Simulation results show that the proposed application enables color vision deficiencies to receive information expressed by colors such as subway line maps.

• The Journal of Korea Robotics Society
• /
• v.9 no.3
• /
• pp.170-177
• /
• 2014

This paper proposes a novel upward-looking camera-based global localization using a ceiling image map. The ceiling images obtained through the SLAM process are integrated into the ceiling image map using a particle filter. Global localization is performed by matching the ceiling image map with the current ceiling image using SURF keypoint correspondences. The robot pose is then estimated by the coordinate transformation from the ceiling image map to the global coordinate system. A series of experiments show that the proposed method is robust in real environments.

• Phonetics and Speech Sciences
• /
• v.1 no.1
• /
• pp.69-73
• /
• 2009

This paper proposes an efficient global covariance-based principal component analysis (GCPCA) for speaker identification. Principal component analysis (PCA) is a feature extraction method which reduces the dimension of the feature vectors and the correlation among the feature vectors by projecting the original feature space into a small subspace through a transformation. However, it requires a larger amount of training data when performing PCA to find the eigenvalue and eigenvector matrix using the full covariance matrix by each speaker. The proposed method first calculates the global covariance matrix using training data of all speakers. It then finds the eigenvalue matrix and the corresponding eigenvector matrix from the global covariance matrix. Compared to conventional PCA and Gaussian mixture model (GMM) methods, the proposed method shows better performance while requiring less storage space and complexity in speaker identification.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.3
• /
• pp.212-217
• /
• 2007

The Alienor method is a powerful tool for solving global optimization problems. It allows the transformation of a multi-variable problem into a new one that depends on a single variable. Any one-dimensional global optimization method can then be used to solve the transformed problem. Several one-dimensional global optimization methods coupled with the Alienor method have been suggested by mathematicians and it is shown that the suggested methods are successful for test functions. However, there are problems with these methods in engineering practice. In this paper, Lipschitzian optimization without using the Lipschitz constant is coupled with the Alienor method and applied to the test functions. Using test functions, it is shown that the suggested method can be successfully applied to global optimization problems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1264-1274
• /
• 1999

본 논문에서는 분산된 클록들을 주기적으로 동기화 시키는 분산 실시간 시스템에서 시간적 제약을 만족시키기 위한 정적/동적 시간 제약(timing constraint) 변환 기법을 제안한다. 전형적인 이산클록동기화(discrete clock synchronization) 알고리즘은 클록의 값을 순간적으로 조정하여 클록의 시간이 불연속적으로 진행한다. 이러한 시간상의 불연속성은 시간적 이벤트를 잃어버리거나 다시 발생시키는 오류를 범하게 한다.클록 시간의 불연속성을 피하기 위해 일반적으로 연속클록동기화(continuous clock synchronization) 기법이 제안되고 있지만 소프트웨어적으로 구현되면 많은 오버헤드를 유발시키는 문제점이 있다. 본 논문에서는 시간적 제약을 동적으로 변환시키는 DCT (Dynamic Constraint Transformation) 기법을 제안하였으며, 이를 통해 기존의 이산클록동기화 알고리즘을 수정하지 않고서도 클록 시간의 불연속성에 의한 문제점들을 해결할 수 있도록 하였다. 아울러 DCT에 의해 이산클록동기화 하에서 생성된 태스크 스케쥴이 연속클록동기화에 의해 생성된 스케쥴과 동일함을 증명하여 DCT의 동작이 이론적으로 정확함을 증명하였다.또한 분산 실시간 시스템에서 지역 클록(local clock)이 기준 클록과 완벽하게 일치하지 않아서 발생하는 스케쥴링상의 문제점을 다루었다. 이를 위해 먼저 두 가지의 스케쥴링 가능성, 지역적 스케쥴링 가능성(local schedulability)과 전역적 스케쥴링 가능성(global schedulability)을 정의하고, 이를 위해 시간적 제약을 정적으로 변환시키는 SCT (Static Constraint Transformation) 기법을 제안하였다. SCT를 통해 지역적으로 스케쥴링 가능한 태스크는 전역적으로 스케쥴링이 가능하므로, 단지 지역적 스케쥴링 가능성만을 검사하면 스케쥴링 문제를 해결할 수 있도록 하였고 이를 수학적으로 증명하였다.Abstract In this paper, we present static and dynamic constraint transformation techniques for ensuring timing requirements in a distributed real-time system possessing periodically synchronized distributed local clocks. Traditional discrete clock synchronization algorithms that adjust local clocks instantaneously yield time discontinuities. Such time discontinuities lead to the loss or the gain of events, thus raising serious run-time faults.While continuous clock synchronization is generally suggested to avoid the time discontinuity problem, it incurs too much run-time overhead to be implemented in software. We propose a dynamic constraint transformation (DCT) technique which can solve the problem without modifying discrete clock synchronization algorithms. We formally prove the correctness of the DCT by showing that the DCT with discrete clock synchronization generates the same task schedule as the continuous clock synchronization.We also investigate schedulability problems that arise when imperfect local clocks are used in distributed real-time systems. We first define two notions of schedulability, global schedulability and local schedulability, and then present a static constraint transformation (SCT) technique. The SCT ensures that it is sufficient to check the schedulability of a task locally in a node with a local clock, since the global schedulability of the task is derived from its local schedulability through SCT. We formally prove the correctness of SCT.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.4
• /
• pp.237-243
• /
• 1997

A new method is introduced for the interpolation in NURBS Surface. This method uses the basis functions to assign the parameter values to the arbitrary set of geometric data and uses the iteration method to compute the control net. The advantages of this method are the feasible transformation of the data set to the matrix form and the effective surface generation as a result, especially to the design engineer.