• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3516-3541
• /
• 2018

Task scheduling is one of the most challenging aspects of cloud computing nowadays, and it plays an important role in improving overall performance in, and services from, the cloud, such as response time, cost, makespan, and throughput. A recent cloud task-scheduling algorithm based on the symbiotic organisms search (SOS) algorithm not only has fewer specific parameters, but also incurs time complexity. SOS is a newly developed metaheuristic optimization technique for solving numerical optimization problems. In this paper, the basic SOS algorithm is reduced, and chaotic local search (CLS) is integrated into the reduced SOS to improve the convergence rate. Simulated annealing (SA) is also added to help the SOS algorithm avoid being trapped in a local minimum. The performance of the proposed SA-CLS-SOS algorithm is evaluated by extensive simulation using the Matlab framework, and is compared with SOS, SA-SOS, and CLS-SOS algorithms. Simulation results show that the improved hybrid SOS performs better than SOS, SA-SOS, and CLS-SOS in terms of convergence speed and makespan.

• Structural Engineering and Mechanics
• /
• v.23 no.1
• /
• pp.15-27
• /
• 2006

A locally varying temperature field or a mixture of two or more different materials can cause local variation of elasticity properties of a beam. In this paper, a new Euler-Bernoulli beam element with varying Young's modulus along its longitudinal axis is presented. The influence of axial forces according to the linearized 2nd order beam theory is considered, as well. The stiffness matrix of this element contains the transfer constants which depend on Young's modulus variation and on axial forces. Occurrence of the polynomial variation of Young's modulus has been assumed. Such approach can be also used for smooth local variation of Young's modulus. The critical loads of the straight slender columns were studied using the new beam element. The influence of position of the local Young's modulus variation and its type (such as linear, quadratic, etc.) on the critical load value and rate of convergence was investigated. The obtained results based on the new beam element were compared with ANSYS solutions, where the number of elements gradually increased. Our results show significant influence of the locally varying Young's modulus on the critical load value and the convergence rate.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.1
• /
• pp.38-43
• /
• 2001

This Paper suggests a new feature for shot detection, using the proposed robust feature from the DC image constructed by DCT DC coefficients in the MPEG video stream, and proposes the characterizing value that reflects the characteristic of kind of video (movie, drama, news, music video etc.). The key frames are pulled out from many frames by using the local minima and maxima of differential of the value. After original frame(not do image) are reconstructed for key frame, indexing process is performed through computing parameters. Key frames that are similar to user's query image are retrieved through computing parameters. It is proved that the proposed methods are better than conventional method from experiments. The retrieval accuracy rate is so high in experiments.

• Journal of Computing Science and Engineering
• /
• v.8 no.4
• /
• pp.199-206
• /
• 2014

The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness and searching ability. With in-depth exploration, the ACO algorithm exhibits slow convergence speed, and yields local optimization solutions. Based on analysis of the ACO algorithm and the genetic algorithm, we propose a novel hybrid genetic ant colony optimization (NHGAO) algorithm that integrates multi-population strategy, collaborative strategy, genetic strategy, and ant colony strategy, to avoid the premature phenomenon, dynamically balance the global search ability and local search ability, and accelerate the convergence speed. We select the traveling salesman problem to demonstrate the validity and feasibility of the NHGAO algorithm for solving complex optimization problems. The simulation experiment results show that the proposed NHGAO algorithm can obtain the global optimal solution, achieve self-adaptive control parameters, and avoid the phenomena of stagnation and prematurity.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.14-17
• /
• 1995

Various methods and techniques have been proposed for solving optimization problems; the methods have been applied to various practical problems. However the methods have demerits. The demerits which should be covered are, for example, falling into local minima, or, a slow convergence speed to optimal points. In this paper, Likelihood Search Method (L.S.M.) is proposed for searching for a global optimum systematically and effectively in a single framework, which is not a combination of different methods. The L.S.M. is a sort of a random search method (R.S.M.) and thus can get out of local minima. However exploitation of gradient information makes the L.S.M. superior in convergence speed to the commonly used R.S.M..

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.1
• /
• pp.9-14
• /
• 2008

This paper presents an observer design methodology for a special class of multi input multi output(MIMO) nonlinear systems. First, we characterize the class of MIMO nonlinear systems with a triangular structure. Also, the observability matrices that plays an important role in proving the convergence of the proposed observer are generalized to MIMO systems. By using the generalized observability matrices, it is shown that under the boundedness conditions of system state and input, the proposed observer guarantees the local exponential convergence to zero of the estimation error.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.123-136
• /
• 2004

In this paper, a combining trust region and line search algorithm for equality constrained optimization is proposed. At each iteration, we only need to solve the trust region subproblem once, when the trust region trial step can not be accepted, we switch to line search to obtain the next iteration. Hence, the difficulty of repeated solving trust region subproblem in an iterate is avoided. In order to allow the direction of negative curvature, we add second correction step in trust region step and employ nonmonotone technique in line search. The global convergence and local superlinearly rate are established under certain assumptions. Some numerical examples are given to illustrate the efficiency of the proposed algorithm.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.944-946
• /
• 2004

In this paper, a new technique for electromagnetic topology optimization is proposed. The proposed technique is based on the large-step Markov chain (LSMC) method with novel local optimization algorithm. Because the proposed algorithm keeps a good convergence characteristic of LSMC, fast convergence is assured. The proposed LSMC is verified by an application to an inverse reconstruction problem.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2003.06a
• /
• pp.62-65
• /
• 2003

We propose an algorithm for almost unsupervised detection of linear structures, in particular, axes in road network and river, as seen in synthetics aperture radar (SAR) images. The first is local step and used to extract linear features from the speckle radar image, which are treated as road segment candidates. We present two local line detectors as well as a method for fusing information from these detectors. The second is global step, we identify the real roads among the segment candidates by defining a Markov random field (MRF) on a set of segments, which introduces contextual knowledge about the shape of road objects.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.12a
• /
• pp.121-124
• /
• 2000

We propose an algorithm for almost unsupervised detection of linear structures, in particular, axes in road network and river, as seen in synthetics aperture radar (SAR) images. The first is local step and used to extract linear features from the speckle radar image, which are treated as road segment candidates. We present two local line detectors as well as a method for fusing Information from these detectors. The second is hybrid step, we Identify the real roads among the segment candidates by defining a Markov random field (MRF) on a set of segments, which introduces contextual knowledge about the shape of road objects.