• Journal of Information Processing Systems
• /
• v.7 no.3
• /
• pp.519-530
• /
• 2011

A Snake is an active contour for representing object contours. Traditional snake algorithms are often used to represent the contour of a single object. However, if there is more than one object in the image, the snake model must be adaptive to determine the corresponding contour of each object. Also, the previous initialized snake contours risk getting the wrong results when tracking multiple objects in successive frames due to the weak topology changes. To overcome this problem, in this paper, we present a new snake method for efficiently tracking contours of multiple objects. Our proposed algorithm can provide a straightforward approach for snake contour rapid splitting and connection, which usually cannot be gracefully handled by traditional snakes. Experimental results of various test sequence images with multiple objects have shown good performance, which proves that the proposed method is both effective and accurate.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.8 no.1
• /
• pp.38-52
• /
• 2016

This paper describes the nonlinear dynamic motion behavior of a ship equipped with a portable dynamic positioning (DP) control system, under external forces. The waves, current, wind, and drifting forces were considered in the calculations. A self-tuning controller based on a neuro-fuzzy algorithm was used to control the rotation speed of the outboard thrusters for the optimal adjustment of the ship position and heading and for path tracking. Time-domain simulations for ship motion with six degrees of freedom with the DP system were performed using the fourth-order RungeeKutta method. The results showed that the path and heading deviations were within acceptable ranges for the control method used. The portable DP system is a practical alternative for ships lacking professional DP facilities.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.412-417
• /
• 2008

In a traditional topology optimization method, material properties are usually distributed by finite element density and visualized by a gray level image. The distribution method based on element density is adequate for a great mass of 2-D topology optimization problems. However, when it is used for 3-D topology optimization, it is always difficult to obtain a smooth model representation, and easily appears a virtualconnect phenomenon especially in a low-density domain. The 3-D structural topology optimization method has been developed using the node density instead of the element density that is based on SIMP (solid isotropic microstructure with penalization) algorithm. A computer code based on Matlab was written to validate the proposed method. When it was compared to the element density as design variable, this method could get a more uniform density distribution. To show the usefulness of this method, several typical examples of structure topology optimization are presented.

• Fibers and Polymers
• /
• v.7 no.4
• /
• pp.344-351
• /
• 2006

This paper is intended to determine the optimal processing parameters applied to the dyeing procedure so that the desired color strength of a raw fabric can be achieved. Moreover, the processing parameters are also used for constructing a system to predict the fabric quality. The fabric selected is the nylon and Lycra blend. The dyestuff used for dyeing is acid dyestuff and the dyeing method is one-bath-two-section. The Taguchi quality method is applied for parameter design. The analysis of variance (ANOVA) is applied to arrange the optimal condition, significant factors and the percentage contributions. In the experiment, according to the target value, a confirmation experiment is conducted to evaluate the reliability. Furthermore, the genetic algorithm (GA) is combined with the back propagation neural network (BPNN) in order to establish the forecasting system for searching the best connecting weights of BPNN. It can be shown that this combination not only enhances the efficiency of the learning algorithm, but also decreases the dependency of the initial condition during the network training. Most of all, the robustness of the learning algorithm will be increased and the quality characteristic of fabric will be precisely predicted.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4823-4843
• /
• 2017

In this paper, an improved utility-based cross-layer dynamic subcarrier allocation (DSA) algorithm is proposed for single carrier frequency division multiple access (SC-FDMA) system, which adopts adaptive service rate control (ASRC) to eliminate the service rate waste and improve the spectral efficiency in heterogeneous network including non-real-time traffic and real-time traffic. In this algorithm, furthermore, a first in first out (FIFO) queuing model with finite space is established on the cross-layer scheduling framework. Simulation results indicate that by taking the service rate constraint as the necessary condition for optimality, the ASRC algorithm can effectively eliminate the service rate waste without compromising the scheduling performance. Moreover, the ASRC algorithm is able to further improve the quality of service (QoS) performance and transmission throughput by contributing an attractive performance trade-off between real-time and non-real-time applications.

• Journal of Power Electronics
• /
• v.17 no.1
• /
• pp.253-261
• /
• 2017

For a single-phase active power filter (APF), designing a more efficient algorithm to guarantee accurate and fast harmonics extraction with a lower computing cost is still a meaningful topic. The common idea still employs a IRPT-based Park transform, which was originally designed for 3-phase applications. Therefore, an additional virtual signal generation (VSG) link is necessary when it is used in the single-phase condition. This method, with virtual signal generation and transform, is obviously not the most efficient one. Regarding this problem, this paper proposes a novel harmonics extraction algorithm to further improve efficiency. The new algorithm is based on the principle of trigonometric orthogonal functions (TOF), and its mathematical principle and physical meaning are introduced in detail. Its implementation and superiority in terms of computation efficiency are analyzed by comparing it with conventional methods. Finally, its effectiveness is well validated through detailed simulations and laboratory experiments.

• Industrial Engineering and Management Systems
• /
• v.8 no.3
• /
• pp.171-180
• /
• 2009

Population learning algorithm (PLA) is a population-based method that was inspired by the similarities to the phenomenon of social education process in which a diminishing number of individuals enter an increasing number of learning stages. The study aims to develop a framework that repeatedly applying the PLA to solve the discrete resource constrained project scheduling problem with two objectives: minimizing project makespan and renewable resource availability, which are two most common concerns of management when a project is being executed. The PLA looping framework will provide a number of near Pareto optimal schedules for the management to make a choice. Different improvement schemes and learning procedures are applied at different stages of the process. The process gradually becomes more and more sophisticated and time consuming as there are less and less individuals to be taught. An experiment with ProGen generated instances was conducted, and the results demonstrated that the looping framework using PLA outperforms those using genetic local search, particle swarm optimization with local search, scatter search, as well as biased sampling multi-pass algorithm, in terms of several performance measures of proximity. However, the diversity using spread metric does not reveal any significant difference between these five looping algorithms.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.2
• /
• pp.431-448
• /
• 2018

This paper is concerned with the positive definite solutions of the nonlinear matrix equation $X-A^*{\bar{X}}^{-1}A=Q$, where A, Q are given complex matrices with Q positive definite. We show that such a matrix equation always has a unique positive definite solution and if A is nonsingular, it also has a unique negative definite solution. Moreover, based on Sherman-Morrison-Woodbury formula, we derive elegant relationships between solutions of $X-A^*{\bar{X}}^{-1}A=I$ and the well-studied standard nonlinear matrix equation $Y+B^*Y^{-1}B=Q$, where B, Q are uniquely determined by A. Then several effective numerical algorithms for the unique positive definite solution of $X-A^*{\bar{X}}^{-1}A=Q$ with linear or quadratic convergence rate such as inverse-free fixed-point iteration, structure-preserving doubling algorithm, Newton algorithm are proposed. Numerical examples are presented to illustrate the effectiveness of all the theoretical results and the behavior of the considered algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5243-5263
• /
• 2017

Data center networks provide critical bandwidth for the continuous growth of cloud computing, multimedia storage, data analysis and other businesses. The problem of low link bandwidth utilization in data center network is gradually addressed in more hot fields. However, the current scheduling strategies applied in data center network do not adapt to the real-time dynamic change of the traffic in the network. Thus, they fail to distribute resources due to the lack of intelligent management. In this paper, we present an improved adaptive traffic scheduling strategy utilizing the simulated annealing genetic algorithm (SAGA). Inspired by the idea of software defined network, when a flow arrives, our strategy changes the bandwidth demand dynamically to filter out the flow. Then, SAGA distributes the path for the flow by considering the scheduling of the different pods as well as the same pod. It is implemented through software defined network technology. Simulation results show that the bisection bandwidth of our strategy is higher than state-of-the-art mechanisms.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.686-689
• /
• 2014

This paper studies energy-efficiency (EE) power allocation for cognitive radio MIMO-OFDM systems. Our aim is to minimize energy efficiency, measured by "Joule per bit" metric, while maintaining the minimal rate requirement of a secondary user under a total power constraint and mutual interference power constraints. However, since the formulated EE problem in this paper is non-convex, it is difficult to solve directly in general. To make it solvable, firstly we transform the original problem into an equivalent convex optimization problem via fractional programming. Then, the equivalent convex optimization problem is solved by a sequential quadratic programming algorithm. Finally, a new iterative energy-efficiency power allocation algorithm is presented. Numerical results show that the proposed method can obtain better EE performance than the maximizing capacity algorithm.