• Korean Journal of Remote Sensing
• /
• v.35 no.2
• /
• pp.289-298
• /
• 2019

In this present study, the effects of Signal to Noise Ratio (SNR), Full Width Half Maximum (FWHM), Aerosol Optical Depth (AOD), $O_3$ Vertical Column Density ($O_3$ VCD), and Solar Zenith Angle (SZA) on the accuracy of sulfur dioxide Vertical Column Density ($SO_2$ VCD) retrieval have been quantified using the Differential Optical Absorption Spectroscopy (DOAS) method with the ground-based direct-sun synthetic radiances. The synthetic radiances produced based on the Beer-Lambert-Bouguer law without consideration of the diffuse effect. In the SNR condition of 650 (1300) with FWHM = 0.6 nm, AOD = 0.2, $O_3$ VCD = 300 DU, and $SZA=30^{\circ}$, the Absolute Percentage Difference (APD) between the true $SO_2$ VCD values and those retrieved ranges from 80% (28%) to 16% (5%) for the $SO_2$ VCD of $8.1{\times}10^{15}$ and $2.7{\times}10^{16}molecules\;cm^{-2}$, respectively. For an FWHM of 0.2 nm (1.0 nm) with the $SO_2$ VCD values equal to or greater than $2.7{\times}10^{16}molecules\;cm^{-2}$, the APD ranges from 6.4% (29%) to 6.2% (10%). Additionally, when FWHM, SZA, AOD, and $O_3$ VCD values increase, APDs tend to be large. On the other hand, SNR values increase, APDs are found to decrease. Eventually, it is revealed that the effects of FWHM and SZA on $SO_2$ VCD retrieval accuracy are larger than those of $O_3$ VCD and AOD. The SZA effects on the reduction of $SO_2$ VCD retrieval accuracy is found to be dominant over the that of FWHM for the condition of $SO_2$ VCD larger than $2.7{\times}10^{16}molecules\;cm^{-2}$.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1026-1033
• /
• 2016

Path-finding on a grid map is a problem generally addressed in the fields of robotics, intelligent agents, and computer games. As technology advances, virtual game worlds tend to be represented more accurately and more realistically, resulting in an excessive increase in the number of grid tiles and in path-search time. In this study, we propose a path-finding algorithm that allows a prompt response to real-time queries by constructing a reduced state space and by precomputing all possible paths in an offline preprocessing stage. In the preprocessing stage, we vertically decompose free space on the grid map, construct a connectivity graph where nodes are the decomposed regions, and store paths between all pairs of nodes in matrix form. In the real-time query stage, we first find the nodes containing the query points and then retrieve the corresponding stored path. The proposed method is simulated for a set of maps that has been used as a benchmark for grid-based path finding. The simulation results show that the state space and the search time decrease significantly.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.5
• /
• pp.917-922
• /
• 2018

In the conventional interchannel interference self-cancellation (ICI-SC) schemes, the length of sampling window is the same as the symbol length of orthogonal frequency division multiplexing (OFDM). Thus, the number of complex operations to compute the interference coefficient of each subchannel is significantly increased. To solve this problem, we present an approximated mathematical model for the coefficients of ICI-SC schemes. Based on the proposed approximation, we analyze mean squared error (MSE) and computational complexity of the ICI-SC schemes with the length of sampling window. As a result, the presented approximation has an error of less than 0.01% on the MSE compared to the original equation. When the number of subchannels is 1024, the number of complex computations for the interference coefficients is reduced by 98% or more. Since the computational complexity can be remarkably reduced without sacrificing the self-cancellation capability, it is considered that the proposed approximation is very useful to develop an algorithm for the ICI-SC scheme.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.198-203
• /
• 2009

With the growing demand for multimedia services and advances in display technology, new applications for 3$\sim$D scene communication have emerged. While multi-view video of these emerging applications may provide users with more realistic scene experience, drastic increase in the bandwidth is a major problem to solve. In this paper, we propose a fast prediction mode decision algorithm which can significantly reduce complexity and time consumption of the encoding process. This is based on the object segmentation, which can effectively identify the fast moving foreground object. As the foreground object with fast motion is more likely to be encoded in the view directional prediction mode, we can properly limit the motion compensated coding for a case in point. As a result, time savings of the proposed algorithm was up to average 45% without much loss in the quality of the image sequence.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.345-354
• /
• 2008

Recently, small-scale mobile network which is composed of many mobile devices in a man becomes popular. Also, Examples of large-scale mobile network can be thought access networks deployed on public transportation such as ships, trains and buses. To provide seamless mobility for mobile nodes in this mobile network, binding update messages must be exchanged frequently. However, it incurs network overhead increasingly and decreases energy efficiency of mobile router. If we try to reduce the number of the messages to cope with the problem, it may happen the security -related problems conversely Thus, mobile router needs a effective algorithm to update location information with low cost and to cover security problems. In this paper, mobility management scheme based on mobile router's mobility pattern is proposed. Whenever each mobile router leaves a visiting network, it records related information as moving log. And then it periodically computes mean resident time for all visited network, and saves them in the profile. If each mobile router moves into the visited network hereafter, the number of binding update messages can be reduced since current resident time may be expected based on the profile. At this time, of course, security problems can happen. The problems, however, are solved using key credit, which just sends some keys once. Through extensive experiments, bandwidth usages are measured to compare binding update messages in proposed scheme with that in existing scheme. From the results, we can reduce about 65% of mobility-management-related messages especially when mobile router stays more than 50 minutes in a network. Namely, the proposed scheme improves network usage and energy usage of mobile router by decreasing the number of messages and authorization procedure.

• Journal of Korean Society for Geospatial Information Science
• /
• v.1 no.1 s.1
• /
• pp.141-152
• /
• 1993

This study aims to generate digital elevation model from digital satellite imagery. Digital elevation model is being increasingly used for geo-spatial information system database development and for digital map production. Image matching technique was applied to acquire conjugate image coordinates and the algorithm for digital elevation model generation is presented in this study The exterior orientation parameters of the satellite imagery is determined by bundle adjustment and standard correlation was applied for image matching conjugate of image points. The window as well as the searching area have to be defined in image matching. Different sizes of searching area were tested to study the appropriate size of the searching area. Various coordinate transformation methods were applied to improve the computation speed as well as the geometric accuracy. The results were then statistically analysed after which the searching area is determined with the safety factor. To evaluate the accuracy of digital elevation model, 3-D coordinates were extracted from 1/5000 scale topographic map and this was compared to the digital elevation model generated from satellite imagery. The algorithm for generation of digital elevation model generated from satellite imagery is presented in this study which will prove effective in the database development of geo-spatial information system and in digital elevation modelling of large areas.

• Resources Recycling
• /
• v.31 no.1
• /
• pp.29-36
• /
• 2022

The hydrogen reduction behavior of molybdenum oxides was studied using a horizontal-tube reactor. Reduction was carried out in two stages: MoO₃ → MoO₂ and MoO₂ → Mo. In the first stage, a mixed gas composed of 30 vol% H₂ and 70 vol% Ar was selected for the MoO₃ reduction because of its highly exothermic reaction. The temperature ranged from 550 to 600 ℃, and the residence time ranged from 30 to 150 min. In the second step, pure H₂ gas was used for the MoO₂ reduction, and the temperature and residence time ranges were 700-750 ℃ and 30-150 min, respectively. The hydrogen reduction behavior of molybdenum oxides was found to be somewhat different between the two stages. For the first stage, a temperature dependence of the reaction rate was observed, and the best curve fittings were obtained with a surface reaction control mechanism, despite the presence of intermediate oxides under the conditions of this study. Based on this mechanism, the activation energy and pre-exponential were calculated as 85.0 kJ/mol and 9.18 × 10⁷, respectively. In addition, the pore size within a particle increases with the temperature and residence time. In the second stage, a temperature dependence of the reaction rate was also observed; however, the surface reaction control mechanism fit only the early part, which can be ascribed to the degradation of the oxide crystals by a volume change as the MoO₂ → Mo phase transformation proceeded in the later part.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.12
• /
• pp.167-175
• /
• 2019

Recently, health examination centers have been changing from auxiliary medical facilities to key and independent medical facilities. However, it is not easy to improve medical facilities, including health examination centers, due to the variable characteristics of the relationship between humans and space. Therefore, this study was done to develop a pedestrian-based discrete event simulation analysis program to examine the problems and develop methods for improvement. The program was developed to analyze five evaluation indices and the density of examinees. The problems were derived by analyzing the required time, capacity, and queue size for each examination through simulations. We reduced the examination time and moving distance, increased the capacity, and distributed the queues by adjusting the medical services and relocating the examination rooms. The results were then quantitatively verified by simulations.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.96-106
• /
• 2009

Extending the scale of the distributed processing in a single Ethernet cluster is physically restricted by maximum ports per switch. This paper presents an implementation of MPI-based multicluster consisting of multiple Ethernet switches for extending the scale of distributed processing, and a asymptotical analysis for communication overhead through execution-time analysis model. To determine an optimum task partitioning, we analyzed the processing time for various partitioning schemes, and AAP(accumulator array partitioning) scheme was finally chosen to minimize the overall communication overhead. The scope of data partitioned in AAP was modified to fit for incremented nodes, and suitable load balancing algorithm was implemented. We tried to alleviate the communication overhead through exploiting the pipelined broadcast and flat-tree based result gathering, and overlapping of the communication and the computation time. We used the linear pipeline broadcast to reduce the communication overhead in intercluster which is interconnected by a single link. Experimental results shows nearly linear speedup by the proposed parallel distributed GHT implemented on MPI-based Ethernet multicluster with four 100Mbps Ethernet switches and up to 128 nodes of Pentium PC.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.367-380
• /
• 2002

Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26～187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.