• Journal of Intelligence and Information Systems
• /
• v.15 no.1
• /
• pp.1-14
• /
• 2009

The Capacitated Vehicle Routing Problem (CVRP) is the problem that the vehicles stationed at central depot are to be optimally routed to supply customers with demands, satisfying vehicle capacity constraints. The CVRP is the NP-hard as it is a natural generalization of the Traveling Salesman Problem (TSP). In this article, we propose the heuristic algorithm, called the bisection seed detection method, to solve the CVRP. The algorithm is composed of 3-phases. In the first phase, we work out the initial cluster using the improved sweep algorithm. In the next phase, we choose a seed node in each initial cluster by using the bisection seed detection method, and we compose the rout with the nearest node from each seed. At this phase, we compute the regret value to decide the list of priorities for the node assignment. In the final phase, we improve the route result by using the tabu search and exchange algorithm. We compared our heuristic with different heuristics such as the Clark-Wright heuristic and the genetic algorithm. The result of proposed heuristic show that our algorithm can get the nearest optimal value within the shortest execution time comparatively.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.355-364
• /
• 2005

With fast advances in computing power and network technologies, online streaming services of continuous media (CM) have been popularly implemented on the Web. To implement such services, a variety of CM streams need to be processed efficiently, so that the Sweep scheme was proposed. This scheme has several advantages such as hiccup-free playbacks and seek-time optimization. In this scheme, however, the entire CM streams are scheduled with a single scheduling period, called a cycle. Since only one scheduling period is allowed in this scheme, a significant amount of disk time is usually wasted because of its inflexible disk schedules. To solve this, we propose a new dynamic Sweep scheme. For this, we devise an algorithm that is able to expand scheduling periods of serviced CM streams and propose a new admission control mechanism guaranteeing hiccup-free playbacks. To show performance gains, we execute various simulation experiments. From the experimental results, we can see that the proposed scheme outperforms the Sweep scheme in terms of disk utilization and scheduling flexibility.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.467-472
• /
• 2007

A modern MEMS resonator is a micro-scale structure operated over a high frequency range. In order to predict its resonant behavior in a design process, High-frequency response analysis (Hi-FRA) is demanded. Algebraic substructuring (AS) is known as a fast numerical technique to construct an eigenspace for FR and frequency sweep (FS) algorithm efficiently solves the frequency response system projected on the eigenspace. However, the existing FS algorithm using AS is developed for low-FRA, say over the range 1Hz-2KHz. In this work, we extend the FS algorithm using AS for FRA over an arbitrary frequency range. Therefore, it can be efficiently applied to systems operated at a high frequency, say over the range 230MHz-250MHz. The success of the proposed method is demonstrated by Hi-FRA of a checkerboard resonator.

• The Journal of Information Technology
• /
• v.5 no.2
• /
• pp.27-34
• /
• 2002

The KVM garbage collector implemented in CLDC was generally based on the simple mark-sweep algorithm, but it is difficult to handle objects of varying size without fragmentation of the available memory. In this paper, we have designed and implemented a memory allocator based on the mark-sweep algorithm that minimizes the fragmentation by the method that determines the allocation position of free-space list according to object size. The experimental result shows that our algorithm reduce the fragmentation and improve the execution time than the existing algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1087-1094
• /
• 1987

In this paper, we describe about polygon resizing porblem where the given polygons are expanded or shrunk in two dimensional plane. First, the definition of polygon resizing and it's problems are given, then the enhanced XY method is proposed: the polygon resizing can be completed in one directional sweep of plane only, usisng enhanced plane sweep method. The time complexity is 0(n log n), and space complexity 0(\ulcorner), where n is the number of verties of polygons. The applications of polygon resizing to the mask artwork processing and layout verification are discussed.

• Journal of the Korean Statistical Society
• /
• v.19 no.1
• /
• pp.54-70
• /
• 1990

Consider the extreme problem : min$(\mu-y)'(\mu-y)$ subject to $A\mu \geq 0$, where A is an $n \times p$ matrix, which often occurs in solving the maximum likelihood estimator with ordered restrictions in parameter space. In case the matrix AA' has all non-positive off-diagonal elements, some propositions in this paper guarantee that the above extreme solutions are achieved at most at n sweep out steps in Gaussian eliminations. Some typicla examples of Sweep-the-Negatives method are given.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.957-965
• /
• 2002

Garbage collection in the CLDC typically employs a stop-the-world GC algorithm which is performing a complete garbage collection when needed. This technique is unsuitable for the interactive Java embedded system because this can lead to long and unpredictable delays. In this paper, We present a garbage collection algorithm which reduces the average delay time and supports the interactive environment. Our garbage collector is composed of the allocator and the collector. The allocator determines the allocation position of free-list according to object size, and the collector uses an incremental mark-sweep algorithm. The garbage collector is called periodically by the thread scheduling policy and the allocator allocates the objects of marked state during collection cycle. Also, we introduce a color toggle mechanism that changes the meaning of the bit patterns at the end of the collection cycle. We compared the performance of our implementation with stop-the-world mark-sweep GC. The experimental results show that our algorithm reduces the average delay time and that it provides uniformly low response times.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.4
• /
• pp.11-16
• /
• 2010

We present an efficient algorithm for rendering sweep surfaces using programmable graphics hardware. A sweep surface can be represented by a cross-section curve undergoing a spline motion. This representation has a simple matrix-vector multiplication structure that can easily be adapted to programmable graphics hardware. The data for the motion and cross-section curves are stored in texture memory. The vertex processor considers a pair of surface parameters as a vertex and evaluates its coordinates and normal vector with a single matrix multiplication. Using the GPU in this way is between 10 and 40 times as fast as CPU-based rendering.

• Water for future
• /
• v.20 no.4
• /
• pp.285-294
• /
• 1987

The floodwave analysis for unsteady supercritical flow is performed. The numerical model. based on dynamic wave equation is presented by introducing the general Preissmann scheme and fore-sweep algorithm.The model is applied to Buffalo-Creek floods for proving its validity, and the simulation results have good agreements with those computed by DAMBRK and the observed data. It is also applied to Hyogi dam-break. The outflow hydrograph is derived based on the observed data and the analysis for the floodwave propagation is investigated.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.147-149
• /
• 2000

This paper describes a power flow method for distribution systems, applying the method of symmetrical component to back/forward sweep method. The proposed algorithm is effective for unbalanced radial distribution system, with process of distributed resource(PQ & PV node), AVR(Auto Voltage Regulator), shunt capacitor. This proposed method compared conventional back/forward sweep method with the using three phase unbalanced distribution systems with 34 nodes.