• Proceedings of the KSRS Conference
• /
• v.1
• /
• pp.82-85
• /
• 2006

The Geostationary Ocean Color Imager (GOCI) will be loaded in Communication, Ocean and Meteorological Satellite (COMS). To efficiently apply the GOCI data in the variety of fields, it is essential to develop the standard algorithm for estimating the concentration of ocean environmental components (, , and ). For developing the empirical algorithm, about 300 water samples and in situ measurements were collected from sea water around the Korean peninsula from 1998 to 2006. Two kinds of chlorophyll algorithms are developed by using statistical regression and fluorescence technique considering the bio-optical properties in Case-II waters. The single band algorithm for is derived by relationship between Rrs (555) and in situ concentration. The CDOM is estimated by absorption coefficient and ratio of Rrs(412)/Rrs(555). These standard algorithms will be programmed as a module of GOCI Data Processing System (GDPS) until 2008.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.4
• /
• pp.412-424
• /
• 2022

Since traditional derivative-based optimization for noisy simulation shows bad performance, evolutionary algorithms are considered as substitutes. Especially in case when outputs are binary, more simulation trials are needed to get near-optimal solution since the outputs are discrete and have high and heterogeneous variance. In this paper, we propose a genetic algorithm called SARAGA which adopts dynamic resampling and fitness approximation using surrogate. SARAGA reduces unnecessary numbers of expensive simulations to estimate success probabilities estimated from binary simulation outputs. SARAGA allocates number of samples to each solution dynamically and sometimes approximates the fitness without additional expensive experiments. Experimental results show that this novel approach is effective and proper hyper parameter choice of surrogate and resampling can improve the performance of algorithm.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.109-113
• /
• 2007

The COMS provides the LRIT/HRIT services to users. The COMS LRIT/HRIT broadcast service should satisfy the 15 minutes timeliness requirement. The requirement is important and critical enough to impact overall performance of the LHGS. HRIT image data is acquired from INRSM output receiving but LRIT image data is generated by sub-sampling HRIT image data in the LHGS. Specially, since LRIT is acquired from sub-sampled HRIT image data, LRIT processing spent more time. Besides, some of data loss for LRIT occurs since LRIT is compressed by lossy JPEG. Therefore, algorithm with the fastest processing speed and simplicity to be implemented should be selected to satisfy the requirement. Investigated sub-sampling algorithm for the LHGS were nearest neighbour algorithm, bilinear algorithm and bicubic algorithm. Nearest neighbour algorithm is selected for COMS LHGS considering the speed, simplicity and anti-aliasing corresponding to the guideline of user (KMA: Korea Meteorological Administration) to maintain the most cloud itself information in a view of meteorology. But the nearest neighbour algorithm is known as the worst performance. Therefore, it is studied in this paper that the selection of nearest neighbour algorithm for the LHGS is reasonable. First of all, characteristic of 3 sub-sampling algorithms is studied and compared. Then, several sub-sampling algorithm were applied to MTSAT-1R image data corresponding to COMS HRIT. Also, resized image was acquired from sub-sampled image with the identical sub-sampling algorithms applied to sub-sampling from HRIT to LRIT. And the difference between original image and resized image is compared. Besides, PSNR and MSE are calculated for each algorithm. This paper shows that it is appropriate to select nearest neighbour algorithm for COMS LHGS since sub-sampled image by nearest neighbour algorithm is little difference with that of other algorithms in quality performance from PSNR.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.62 no.1
• /
• pp.36-44
• /
• 2013

This paper is written for the development and application of boiler fuel control algorithm and distributed control system of coal-fired power plant by the steps of design, coding, simulation test, site installation and site commissioning test. Fuel control algorithm has the upper algorithm and it is boiler master control algorithm that controls the fuel, feed water, air by generation output demand. Generation output demand by power load influences fuel control. Because fuel can not be supplied fast to the furnace of boiler, fuel control algorithm was designed adequately to control the steam temperature and to prevent the explosion of boiler. This control algorithms were coded to the control programs of distributed control systems which were developed domestically for the first time. Simulator for coal-fired power plant was used in the test step. After all of distributed control systems were connected to the simulator, the tests of the actual power plant were performed successfully. The reliability was obtained enough to be installed at the actual power plant and all of distributed control systems had been installed at power plant and all signals were connected mutually. Tests for reliability and safety of plant operation were completed successfully and power plant is being operated commercially. It is expected that the project result will contribute to the safe operation of domestic new and retrofit power plants, the self-reliance of coal-fired power plant control technique and overseas business for power plant.

• Korean Journal of Construction Engineering and Management
• /
• v.24 no.5
• /
• pp.83-94
• /
• 2023

In order to devise a rebar usage optimization algorithm, it is necessary to calculate the exact rebar length and revise the arrangement of rebars into special lengths. However, the process of rearranging numerous rebars and manually calculating their quantities is time-consuming and requires significant human resources. To address this challenge, it is necessary to develop an algorithm that can automatically estimate the length of rebars and calculate their quantities. This study aims to create an automatic estimation algorithm that improves work efficiency while ensuring accurate and reliable calculations of rebar quantities. The algorithm considers various factors such as concrete cover, hook length, development length, and lapping length, mandated by the building codes, to calculate the quantity of rebars for wall structures. The effectiveness of the proposed method is validated by comparing the rebar quantities generated by the algorithm with manually calculated quantities, resulting in a difference rate of 1.14% for the hook case and 1.37% for the U-bar case. The implementation of this method enables fast and precise estimation of rebar quantities, adhering to relevant regulatory codes.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2008.10a
• /
• pp.143-146
• /
• 2008

Dynamic range of LCD panel can be dramatically improved by adaptive dimming technique. Adaptive control of LED backlight by input signal can reduce the light leakage of LCD panel and achieve high contrast ratio. An algorithm is proposed to distinguish the input signal and get proper luminance level. For lower cost of LCD panel, white light LED is used to accomplish 2D dimming and get better image performance of LCD.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.3
• /
• pp.190-201
• /
• 2002

Surfaces of many engineering structures, specially, those of ships and airplanes are commonly fabricated as doubly curved shapes as well as singly curved surfaces to fulfill functional requirements. Given a three dimensional design surface, the first step in the fabrication process is unfolding or planar development of this surfaces into a planar shape so that the manufacturer can determine the initial shape of the flat plate. Also a good planar development enables the manufacturer to estimate the strain distribution required to form the design shape. In this paper, an algorithm for optimal approximated development of a general curved surface, including both singly and doubly curved surface is developed in the sense that the strain energy from its planar development to the design surface is minimized, subjected to some constraints. The development process is formulated into a constrained nonlinear programming problem, which is on basis of deformation theory and finite element. Constraints are subjected to characteristics of the fabrication method. Some examples on typical surfaces and the practical ship surfaces show the effectiveness of this algorithm.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.2
• /
• pp.165-170
• /
• 2004

RAIM techniques based on TLS have rarely been addressed because TLS requires a great number of computations. In this paper, the particular form of the observation matrix H, is exploited so as to develop a new TLS-based sequential algorithm to identify an errant satellite. The algorithm allows us to enjoy the advantages of TLS with less computational burden. The proposed algorithm is verified through a numerical simulation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.2
• /
• pp.23-43
• /
• 1993

This paper employs fuzzy variables instead of deterministic variables for job times in a project network. A fuzzy variable has its value restricted by a possibility distribution. This paper utilizes the triangular possibility distribution which has three estimated times. That is normal, resonable, and crash job times. This paper develops a fuzzy k-longest path algorithm, by utilizing the k-longest path algorithm. This algorithm will be useful to control the project the project network by considering the project completion possibility.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.20-29
• /
• 1990

In this paper, we propose the \ulcorner/G algorithm that is an efficient distributed process coordination algorithm. It controls mutually exclusive access to a shared resource in a distributed system. We show that the \ulcorner/G algorithm satisfies the properties of distributed systems. In performnace, the algorithm is more efficient than existing algorithms because it sends only 3(K-1)/G meassages.