• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.105-111
• /
• 2024

This paper deals with the minimum linear arrangement(MinLA) of a lattice graph, to which an approximate algorithm of linear complexity O(n) remains as a viable solution, deriving the optimal MinLA of 31,680 for 33×33 lattice. This paper proposes a partitioning arrangement algorithm of complexity O(1) that delivers exact solution to the minimum linear arrangement. The proposed partitioning arrangement algorithm could be seen as loading boxes into a container. It firstly partitions m rows into r₁,r₂,r₃ and n columns into c₁,c₂,c₃, only to obtain 7 containers. Containers are partitioning with a rule. It finally assigns numbers to vertices in each of the partitioned boxes location-wise so as to obtain the MinLA. Given m,n≥11, the size of boxes C₂,C₄,C₆ is increased by 2 until an increase in the MinLA is detected. This process repeats itself 4 times at maximum given m,n≤100. When tested to lattice in the range of 2≤n≤100, the proposed algorithm has proved its universal applicability to lattices of both m=n and m≠n. It has also obtained optimal results for 33×33 and 100×100 lattices superior to those obtained by existing algorithms. The minimum linear arrangement algorithm proposed in this paper, with its simplicity and outstanding performance, could therefore be also applied to the field of Very Large Scale Integration circuit where m,n are infinitely large.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.1
• /
• pp.82-88
• /
• 2009

The output of the encoder is a digital pulse, which is also easy to be connected to a digital controller. There are various angular velocity detecting methods of M, T, and M/T. Each of them has its own properties. There is a common limitation that the angular velocity detection period is strongly dependent on the destination velocity magnitude in case of ultimate low range. They have ultimately long detection period or cannot even detect angular velocity at near zero velocity. This paper proposes a zero velocity detectable sensor algorithm with the dual encoder system. The sensor algorithm is able to keep detection period moderately at near zero velocity and even detect zero velocity within nominal period. It is useful for detecting velocity in case of changing rotational direction at which there occurs zero velocity. In this paper, various experimental results are shown for the algorithm validity.

• Journal of applied mathematics & informatics
• /
• v.35 no.1_2
• /
• pp.191-204
• /
• 2017

A new fifth-order weighted Runge-Kutta algorithm based on heronian mean for solving initial value problem in ordinary differential equations is considered in this paper. Comparisons in terms of numerical accuracy and size of the stability region between new proposed Runge-Kutta(5,5) algorithm, Runge-Kutta (5,5) based on Harmonic Mean, Runge-Kutta(5,5) based on Contra Harmonic Mean and Runge-Kutta(5,5) based on Geometric Mean are carried out as well. The problems, methods and comparison criteria are specified very carefully. Numerical experiments show that the new algorithm performs better than other three methods in solving variety of initial value problems. The error analysis is discussed and stability polynomials and regions have also been presented.

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

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.4
• /
• pp.749-780
• /
• 2021

In this paper, we give the notion of M(., .)-𝜂-proximal mapping for a nonconvex, proper, lower semicontinuous and subdifferentiable functional on Banach space and prove its existence and Lipschitz continuity. As an application, we introduce and investigate a new system of variational-like inclusions in Banach spaces. By means of M(., .)-𝜂-proximal mapping method, we give the existence of solution for the system of variational inclusions. Further, propose an iterative algorithm for finding the approximate solution of this class of variational inclusions. Furthermore, we discuss the convergence and stability analysis of the iterative algorithm. The results presented in this paper may be further expolited to solve some more important classes of problems in this direction.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.1
• /
• pp.9-17
• /
• 2006

This paper deals with a discrete simulation optimization method for designing a complex probabilistic discrete event simulation. The developed algorithm uses the configuration algorithm that can change decision variables and the stopping algorithm that can end simulation in order to satisfy the given objective value during single run. It tries to estimate an auto-regressive model for evaluating correctly the objective function obtained by a small amount of output data. We apply the proposed algorithm to M/M/s model, (s, S) inventory model, and known-function problem. The proposed algorithm can't always guarantee the optimal solution but the method gives an approximate feasible solution in a relatively short time period. We, therefore, show the proposed algorithm can be used as an initial feasible solution of existing optimization methods that need multiple simulation run to search an optimal solution.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.4
• /
• pp.749-759
• /
• 2012

A globally convergent algorithm for solving equilibrium problems is proposed. The algorithm is based on a proximal point algorithm (shortly (PPA)) with a positive definite matrix M which is not necessarily symmetric. The proximal function in existing (PPA) usually is the gradient of a quadratic function, namely, ${\nabla}({\parallel}x{\parallel}^2_M)$. This leads to a proximal point-type algorithm. We first solve pseudomonotone equilibrium problems without Lipschitzian assumption and prove the convergence of algorithms. Next, we couple this technique with the Banach contraction method for multivalued variational inequalities. Finally some computational results are given.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.190-199
• /
• 1999

Presented in this paper is an algorithm for finding all intersections among polygonal chains with an O((n+k)·log m) worst-case time complexity, where n is the number of lien segments in the polygonal chains, k is the number of intersections, and m is the number of monotone chains. The proposed algorithm is based on the sweep line algorithm. Unlike the previous polygonal-chain intersection algorithms that are designed to handle special only cases, such as convex polygons or C-oriented polygons, the proposed algorithm can handle arbitrarily shaped polygonal chains having self-intersections and singularities (tangential contact, multiple intersections). The algorithms has been implemented and applied to 1) testing simplicity of a polygon, 2) finding intersections among polygons and 3) offsetting planar point-sequence curves.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.383-389
• /
• 2003

In this paper, we propose a solution, called M_DQDMR, for generating delay-constrained boundwidth-appropriated multicast routing trees to reduce the delay and conserved boundwidth resources of nodes in mobile computing environment. At the current router installation, we according the routing table and the information of link which neighboring rude to guarantee QoS(Quality of Service). When we construct multicast tree, M_DQDMR algorithm dynamically adjusts its appropriate tree construction policy based on how far the destination node from the delay bound and boundwidth our QoS requirement. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that M_DQDMR can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve boundwidth resources.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.7
• /
• pp.63-74
• /
• 2017

Recently in the area of ICT, the M2M and IoT are in the spotlight as a cutting edge technology with the help of advancement of internet. Among those fields, the smart home is the closest area to our daily lives. Smart home has the purpose to lead a user more convenient living in the house with WLAN (Wireless Local Area Network) or other short-range communication environments using automated appliances. With an arrival of the age of IoT, this can be described as one axis of a variety of applications as for the M2H (Machine to Home) field in M2M. In this paper, we propose a novel technique for estimating the location of a terminal that freely move within a specified area using the RSSI (Received Signal Strength Indication) in the WLAN environment. In order to perform the location estimation, the Fingerprint and KNN methods are utilized and the LMS with the gradient descent method and the proposed algorithm are also used through the error correction functions for locating the real-time position of a moving user who is keeping a smart terminal. From the estimated location, the nearest fixed devices which are general electric appliances were supposed to work appropriately for self-operating of virtual smart home. Through the experiments, connection and operation success rate, and the performance results are analyzed, presenting the verification results.