• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.6
• /
• pp.11-17
• /
• 1983

In this paper, the application of the explicit M.R.A.C. algorithms to the D.C. motor speed control using the microprocessor is studied. The adaptation algorithms are derived from the gradient method and the exponentially weighted least square [E.W.L.S.] method. In order to minimize the computational instability of the E.W.L.S. method, the adaptation algorithm of UDUt factorization method is developed, and because of the characteristics of the D.C. motor (dead-aone phenomenon) , the SM. gra-dient type algorithm is also improved from the gradient type algorithm. Computer simulations and experiments show that these algorithms adapt well to the rapid change of the reference input and the load.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12A
• /
• pp.959-965
• /
• 2011

As the usage of mobile stations increases thanks to various services, power saving mechanisms of mobile station operated by battery power have been gained much attention. This paper presents a power saving mechanism(PSM) of IEEE 802.16m, called Mobile WiMAX, for 4G mobile technology. This paper first presents different points of the PSM of IEEE 802.16m from IEEE 802.16e, which is a basis of IEEE 802.16m. This paper proposes a dynamic sleep cycle adjustment algorithm for improving the performance of IEEE 802.16m PSM by considering the arrival pattern of incoming packets from base station. Performance of the algorithm is analyzed in terms of energy consumption as well as waiting time of packets.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.169-173
• /
• 2014

Nobody has yet been able to determine the optimal solution conclusively whether NP-complete problems are in fact solvable in polynomial time. Gu$\acute{e}$ret et al. tries to obtain the optimal solution using linear programming with $O(m^4)$ time complexity for barge loading problem a kind of bin packing problem that is classified as nondeterministic polynomial time (NP)-complete problem. On the other hand, this paper suggests the loading rule of profit priority rank algorithm with O(m log m) time complexity. This paper decides the profit priority rank firstly. Then, we obtain the initial loading result using the rule of loading the good has profit priority order. Finally, we balance the loading and capability of barge swap the goods of unloading in previously loading in case of under loading. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(m log m) time complexity for NP-complete barge loading problem.

• Honam Mathematical Journal
• /
• v.38 no.4
• /
• pp.833-847
• /
• 2016

We are interested in the problem of finding the Hausdorff distance between two objects in ${\mathbb{R}}^2$, or in ${\mathbb{R}}^3$. In this paper, we develop an algorithm for computing the Hausdorff distance between two ellipses in ${\mathbb{R}}^3$. Our algorithm is mainly based on computing the distance between a point $u{\in}{\mathbb{R}}^3$ and a standard ellipse $E_s$, equipped with a pruning technique. This algorithm requires O(log M) operations, compared with O(M) operations for a direct method, to achieve a comparable accuracy. We give an example,and observe that the computational cost needed by our algorithm is only O(log M).

• Journal of the Korean Mathematical Society
• /
• v.41 no.3
• /
• pp.407-421
• /
• 2004

By using a recursive algorithm, we construct edge-coloured graphs representing products of spheres and consequently we give upper bounds for the regular genus of ${\mathbb{S}}^{m}\;\times\;{\mathbb{S}}^{n}$, for each m, n > 0.

• 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.

• Smart Structures and Systems
• /
• v.22 no.4
• /
• pp.413-424
• /
• 2018

The factors affecting the shear strength of the angle shear connectors in the steel-concrete composite beams can play an important role to estimate the efficacy of a composite beam. Therefore, the current study has aimed to verify the output of shear capacity of angle shear connector according to the input provided by Support Vector Machine (SVM) coupled with Firefly Algorithm (FFA). SVM parameters have been optimized through the use of FFA, while genetic programming (GP) and artificial neural networks (ANN) have been applied to estimate and predict the SVM-FFA models' results. Following these results, GP and ANN have been applied to develop the prediction accuracy and generalization capability of SVM-FFA. Therefore, SVM-FFA could be performed as a novel model with predictive strategy in the shear capacity estimation of angle shear connectors. According to the results, the Firefly algorithm has produced a generalized performance and be learnt faster than the conventional learning algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.143-152
• /
• 2013

Given weighted graph G=(V,E), n=|V|, m=|E|, the minimum cut problem is classified with source s and sink t or without s and t. Given undirected weighted graph without s and t, Stoer-Wagner algorithm is most popular. This algorithm fixes arbitrary vertex, and arranges maximum adjacency (MA)-ordering. In the last, the sum of weights of the incident edges for last ordered vertex is computed by cut value, and the last 2 vertices are merged. Therefore, this algorithm runs $\frac{n(n-1)}{2}$ times. Given graph with s and t, Ford-Fulkerson algorithm determines the bottleneck edges in the arbitrary augmenting path from s to t. If the augmenting path is no more exist, we determine the minimum cut value by combine the all of the bottleneck edges. This paper suggests minimum cut algorithm for undirected weighted graph with s and t. This algorithm suggests MA-merging and computes cut value simultaneously. This algorithm runs n-1 times and successfully divides V into disjoint S and V sets on the basis of minimum cut, but the Stoer-Wagner is fails sometimes. The proposed algorithm runs more than Ford-Fulkerson algorithm, but finds the minimum cut value within n-1 processing times.

• Smart Structures and Systems
• /
• v.11 no.2
• /
• pp.163-183
• /
• 2013

Control systems have been greatly studied in recent years and can be classified as: passive, active, semi-active or hybrid systems. Most forms of control systems have been applied in a centralized manner where all the information is sent to a central node where control the algorithm is then calculated. One of the possible problems of centralized control is the difficulty to scale its application. In this paper, a completely decentralized control algorithm is analytically implemented. The algorithm considers that each of the control systems makes the best decision based solely on the information collected at its location. Semi-active control is used in preference to active control because it has minimal energy consumption, little to no possibility of destabilization, a reduction in the possibility of data saturation, and a reduction in the response time in comparison to centralized control.