• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.221-227
• /
• 2019

It has long been known that weapon target assignment (WTA) problem is NP-hard. Nonetheless, an exact solution can be found using Brute-Force or branch-and bound method which utilize approximation. Many heuristic algorithms, genetic algorithm particle swarm optimization, etc., have been proposed which provide near-optimal solutions in polynomial time. This paper suggests polynomial time algorithm that can be obtain the optimal solution of WTA problem for the number of total weapons k, the number of weapon types m, and the number of targets n. This algorithm performs k times for O(mn) so the algorithm complexity is O(kmn). The proposed algorithm can be minimize the number of trials than brute-force method and can be obtain the optimal solution.

• Korean Journal of Remote Sensing
• /
• v.29 no.6
• /
• pp.601-610
• /
• 2013

As a standard water clarity variable, the vertical underwater visibility, called Secchi depth, is estimated with ocean color satellite data. In the present study, Moderate Resolvtion Imaging Spectradiometer (MODIS) data are used to measure the Secchi depth which is a useful indicator of ocean transparency for estimating the water quality and productivity. To estimate the Secchi depth $Z_v$, the empirical regression model is developed based on the satellite optical data and in-situ data. In the previous study, a semi-analytical algorithm for estimating $Z_v$ was developed and validated for Case 1 and 2 waters in both coastal and oceanic waters using extensive sets of satellite and in-situ data. The algorithm uses the vertical diffuse attenuation coefficient, $K_d$($m^{-1}$) and the beam attenuation coefficient, c($m^{-1}$) obtained from satellite ocean color data to estimate $Z_v$. In this study, the semi-analytical algorithm is validated using temporal MODIS data and in-situ data over the Yellow, Southern and East Seas including Case 1 and 2 waters. Using total 156 matching data, MODIS $Z_v$ data showed about 3.6m RMSE value and 1.7m bias value. The $Z_v$ values of the East Sea and Southern Sea showed higher RMSE than the Yellow Sea. Although the semi-analytical algorithm used the fixed coupling constant (= 6.0) transformed from Inherent Optical Properties (IOP) and Apparent Optical Properties (AOP) to Secchi depth, various coupling constants are needed for different sea types and water depth for the optimum estimation of $Z_v$.

• Atmosphere
• /
• v.22 no.2
• /
• pp.163-174
• /
• 2012

Brightness temperature (BT) difference between sea fog and sea surface is small, because the top height of fog is low. Therefore, it is very difficult to detect sea fog with infrared (IR) channels in the nighttime. To overcome this difficulty, we have developed a new algorithm for detection of sea fog that consists in three tests. Firstly, both stratus and sea fog were discriminated from the other clouds by using the difference between BTs $3.7{\mu}m$ and $11{\mu}m$. Secondly, stratus occurring at a level higher than sea fog was removed when the difference between cloud top temperature and sea surface temperature (SST) is smaller than 3 K. In this process, we used daily SST data from AMSR-E microwave measurements that is available even in the presence of cloud. Then, the SST was converted to $11{\mu}m$ BT based on the regressed relationship between AMSR-E SST and MTSAT-1R $11{\mu}m$ BT at 1733 UTC over clear sky regions. Finally, stratus was further removed by using the homogeneity test based on the difference in cloud top texture between sea fog and stratus. Comparison between the retrievals from our algorithm and that from Korea Meteorological Administration (KMA) algorithm, shows that the KMA algorithm often misconceived sea fog as stratus, resulting in underestimating the occurrence of sea fog. Monthly distribution of sea fog over northeast Asia in 2008 was derived from the proposed algorithm. The frequency of sea fog is lowest in winter, and highest in summer especially in June. The seasonality of the sea fog occurrence between East and West Sea was comparable, while it is not clearly identified over South Sea. These results would serve to prevent the possible occurrence of marine accidents associated with sea fog.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.12
• /
• pp.171-175
• /
• 2014

Gu$\acute{e}$ret et al. tries to obtain the solution using linear programming with $O(m^4)$ time complexity for cane sugar production problem a kind of bin packing problem that is classified as NP-complete problem. On the other hand, this paper suggests the maximum loss of lot first production greedy rule algorithm with O(mlogm) polynomial time complexity underlying assumption of the polynomial time rule to find the solution is exist. The proposed algorithm sorts the lots of sugar loss slope into descending order. Then, we select the lots for each slot production capacity only, and swap the exhausted life span of lots for lastly selected lots. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(mlogm) time complexity. Also, this algorithm better result than linear programming.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10A
• /
• pp.943-951
• /
• 2006

Multi-input-multi-output (MIMO) systems are considered to improve the capacity and reliability of next generation mobile communication. However, the multiple RF chains associated with multiple antennas are costly in terms of size, power and hardware. Antenna selection is a low-cost low-complexity alternative to capture many of the advantages of MIMO systems. We proposed new joint Tx/Rx antenna selection algorithm with low complexity. The proposed algorithm is a method selects $L_R{\times}L_T$ channel matrix out of $L_R{\times}L_T$ entire channel gain matrix where $L_R{\times}L_T$ matrix selects alternate Tx antenna with Rx antenna which have the largest channel gain to maximize Frobenius norm. The feature of this algorithm is very low complexity compare with Exhaustive search which have optimum capacity. In case of $4{\times}4$ antennas selection out of $8{\times}8$ antennas, the capacity decreases $0.5{\sim}2dB$ but the complexity also decreases about 1/10,000 than optimum exhaustive search.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.143-150
• /
• 2014

In this paper, we propose the delivery problem on trees and two algorithms for the problem. The delivery problem on trees is that of minimizing the object delivery time from one node to another node using n various speed robots. Our first algorithm generates an optimal solution with some restrictions in handover places. In this algorithm, we assume that the handover can be made at a vertex of given tree. We try to find the handover places and the robots participate in handover from the start node to the destination node. The second algorithm extends the first one to remove the restriction about the handover places. The second algorithm still generates an optimal solution. The time complexities of both algorithms are $O((n+m)^2)$ where n is the number of robots and m is the number of nodes.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.45-58
• /
• 2004

This paper consists of two parts, One is the ECC( GF(2/sup m/)) algorithm to improve the security strength and the processing time of SSL VPN and the other is the WLCAPT algorithm instead of LSNAT for the security strength of virtual server. In general when corporates use SSL protocol in order to build VPN, they use RSA algorithm with the problem of security and processing time about authentication and confidentiality, In this paper, a shared public key is generated with ECSPK which uses ECC( GF(2/sup m/)) algorithm to improve the security and processing time instead of RSA In addition, WLCAPT algorithm proposed in this paper is applied to virtual server which resides in the server side and then after NAT translation, the actual server of headquarter is securely communicated with it.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2005.11a
• /
• pp.190-200
• /
• 2005

In this paper, the image modelling of road's lane markings is established using view frustum(VF) modeling. This algorithm also involve the real time processing of the 3D position coordinate and the distance data from the camera to the points on the 3D world coordinate by the camera calibration. In order to reduce their measurement error, an useful algorithm for which analyze the geometric variations clue to traveling vehicle's fluctuation using VF model is proposed. In experiments, without correction, for instance, the $0.4^{\circ}$ of pitching rotation gives the error of $0.4^{\sim}0.6m$ at the distance of 10m, but the more far distance cause exponentially the more error. We confirmed that this algorithm can be reduced less than 0.1m of error at the same condition.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.11
• /
• pp.2374-2380
• /
• 2011

Many people is preferred to mVoIP which offers call telephone-quality and convenient UI as well as free of charge. On the other hand, security of mVoIP is becoming an issue as it using Internet network may have danger about wiretapping. Although traditionally encryption algorithm of symmetric key for security of voice data has been used, ECC algorithm of public key type has been preferring for encryption because it is stronger in part the strength of encryption than others. However, the existing way is restricted by lots of operations in poor mobile environment. Thus this paper proposes the efficiency of resource consumption way by reducing cryptographic operations.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2005.04a
• /
• pp.209-216
• /
• 2005

The controller that can control the smart base isolation system consisting of M damper and friction pendulum systems(FPS) is developed in this study. A fuzzy logic controller (FLC) is used to modulate the M damper force because the FLC has an inherent robustness and ability to handle non-linearities and uncertainties. A genetic algorithm (GA) is used for optimization of the FLC. When earthquake excitations are applied to the structures equipped with smart base isolation system, the relative displacement at the isolation level as well as the acceleration of the structure should be regulated under appropriate level. Thus, NSGA-II(Non-dominated Sorting Genetic Algorithm) is employed in this study as a multi-objective genetic algorithm to meet more than two control objectives, simultaneously. NSGA-II is used to determine appropriate fuzzy control rules as well to adjust parameters of the membership functions. Effectiveness of the proposed method for optimal design of the FLC is judged based on computed responses to several historical earthquakes. It has been shown that the proposed method can efficiently find Pareto optimal sets that can reduce both structural acceleration and base drift from numerical studies.