• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.2
• /
• pp.173-182
• /
• 2001

Ascent trajectory optimization and optimal explicit guidance problems for a satellite launch vehicle in a 2-dimensional pitch plane are studied. The trajectory optimization problem with boundary conditions is formulated as a nonlinear programming problem by parameterizing the pitch attitude control variable, and is solved by using the SQP algorithm. The flight constraints such as gravity-turn are imposed. An optimal explicit guidance algorithm in the exoatmospheric phase is also presented, the guidance algorithm provides steering command and time-to-go value directly using the current states of the vehicle and the desired orbit insertion conditions. To verify the optimality and accuracy of the algorithm simulations are performed.

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.1
• /
• pp.49-59
• /
• 2009

In this paper a watermarking algorithm is proposed to optimize the capacity of the digital watermark insertion in an experimental threshold using the characteristics of human visual system(HVS), adaptive scale factors, and weight functions based on discrete wavelet transform. After the original image is decomposed by a 3-level discrete wavelet transform, the watermarks for capacity optimization are inserted into all subbands except the baseband, by applying the important coefficients from the experimental threshold in the wavelet region. The adaptive scale factors and weight functions based on HVS are considered for the capacity optimization of the digital watermark insertion in order to enhance the robustness and invisibility. The watermarks are consisted of gaussian random sequences and detected by correlation. The experimental results showed that this algorithm can preserve a fine image quality against various attacks such as the JPEG lossy compression, noise addition, cropping, blurring, sharpening, linear and non-linear filtering, etc.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.377-386
• /
• 2005

Recently, to increase throughput per hour on real-time disk scheduling, a lot of algorithms that apply SCAN technique to EDF(Earliest Deadline First) that is representative real-time disk scheduling algorithm are studied. However, existing disk scheduling algorithms have several limitations because they consider continuous I/O requests when create SCAN group. Also, because SCAN technique was fixed direction, the existing algorithms have shortcoming that there are a lot of time damages. This paper proposes a new real-time disk scheduling algorithm based on the insertion technique and the two-way SCAN technique to solve the problems of the exiting real-time disk scheduling algorithms in hard real-time system. The simulation result shows that, when using our techniques, the disk throughput and the number of serviceable I/O requests are enhanced.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.4
• /
• pp.85-96
• /
• 2000

An Eggcrate assembly is an important part to hold and support 16,000 tubes containing hot and contaminated water in the steam generator of nuclear power plant. As a great number of tubes should be inserted into the eggcrate assembly, the dimensions of each eggcrate grid are one of the critical factors to determine the availability of tube insertion. in this paper. we propose a machine vision algorithm for measuring the inner-circle diameter of each eggcrate grid whose shape is not exact quadrangular. The overall procedure of the algorithm is composed of camera calibration, eggcrate image preprocessing, grid height adjustment, and inner-circle diameter estimation. The algorithm is tested on real specimens and the results show that the algorithm works fairly well.

• Journal of Information Processing Systems
• /
• v.5 no.4
• /
• pp.237-242
• /
• 2009

The classical vehicle routing problem (VRP) can be extended by including customers who want to send goods to the depot. This type of VRP is called the vehicle routing problem with pickups and deliveries (VRPPD). This study proposes a novel way to solve VRPPD by introducing a two-phase heuristic routing algorithm which consists of a clustering phase and uses the geometrical center of a cluster and route establishment phase by applying a two-way search of each route after applying the TSP algorithm on each route. Experimental results show that the suggested algorithm can generate better initial solutions for more computer-intensive meta-heuristics than other existing methods such as the giant-tour-based partitioning method or the insertion-based method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.8
• /
• pp.1057-1063
• /
• 1995

This paper describes an approach for constucting a Rectilinear Steiner Tree (RST) derivable from a Minimum Spanning Tree (MST), using Associative Processor (AP). We propose a fast parallel algorithm using AP's basic algorithms which can be realized by the processing capability of rudimentary logic and the selective matching capability of Content- Addressable Memory (CAM). The main idea behind the proposed algorithm is to maximize the overlaps between the consecutive edges in MST, thus minimizing the cost of a RST. An efficient parallel linear algorithm with O(n) complexity to construct a RST is proposed using an algorithm to find a MST, where n is the number of nodes. A node insertion method is introduced to allow the Z-type layout. The routing process which only depends on the neighbor edges and the no-rerouting strategy both help to speed up finding a RST.

• Journal of Industrial Technology
• /
• v.15
• /
• pp.235-244
• /
• 1995

In this paper, we propose a bulk-load algorithm for $B^+-trees$, the most widely used index structures in database systems. The main characteristic of our algorithm is to simultaneously process all the keys to be placed on each $B^+-trees$ page when accessing the page. This avoids the overhead for accessing the same page multiple times, which results from applying the $B^+-trees$ insertion algorithm repeatedly. For performance evaluation, we analyze our algorithm in terms of the number of disk accesses. The results show that the number of disk accesses excluding those in the redistribution process in identical to the number of $B^+-trees$ pages. Considering that the redistribution process is an unavoidable preprocessing step for bulk-loading, our algorithm requires just one disk access per $B^+-trees$ page, and therefore turns out to be optimal. We also present performance tendancy according to the changes of parameter values via simulation.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.2
• /
• pp.110-117
• /
• 2017

Delaunay refinement algorithm is a classical method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. It computes the Delaunay triangulation for given points and edges to obtain an initial solution, and update the triangulation by inserting steiner points one by one to get an improved quality triangulation. This process repeats until it satisfies given quality criteria. The efficiency of the algorithm depends on the criteria and point insertion method. In this paper, we propose a method to accelerate the Delaunay refinement algorithm by applying geometric hashing technique called bucketing when inserting a new steiner point so that it can localize necessary computation. We have tested the proposed method with a few types of data sets, and the experimental result shows strong linear time behavior.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.8
• /
• pp.1478-1483
• /
• 2008

In this paper, a digital watermarking method using the WPT (Wavelet Packet Transform) is proposed. The proposed algorithm transforms the input image by using the WPT and inserts the watermark by using the quad-tree algorithm and Cox's algorithm. The experiments for evaluating the performances of the proposed algorithm is carried out by inserting a watermark in each wavelet packet transform step and by inserting a watermark into the lowest frequency domain (LL). As a simulation result, the performance of the insertion of the watermark into the 6 levels of WPT is better than that of other cases. In addition, about $30{\sim}60%$ of all watermarks are inserted into the LL band, the correlation value is improved though the PSNR performance decreases $1{\sim}2dB$.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2777-2781
• /
• 2001

This paper presents an algorithm of the watermark insertion and extraction on the vector image. Most parts of the vector image consist of the array of the coordinate values. The vector watermarking method by Sakamoto et al [1] uses the mask within which all the coordinate values of all the vertices are changed depending on the value of the watermark. The proposed algorithm is the change of the vector image file instead of the change of the coordinate values on the vector image. We use the Drawing Exchange Format (DXF) files since the DXF file is one of the general files in the field of the vector image.