• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.935-942
• /
• 2000

In this paper we introduce a fast simplification algorithm for terrain height fields to produce a triangulated irregular network, based on the greedy insertion algorithm in [1,4,5]. Our algorithm partitions a terrain height data into rectangular blocks with the same size ad simplifies blocks one by one with the greedy insertion algorithm. Our algorithm references only to the points and the triangles withing each current block for adding a point into the triangulation. Therefore, the algorithm runs faster than the greedy insertion algorithm, which references all input points and triangles in the terrain. Our experiment shows that partitioning method runs from 4 to more than 20 times faster, and it approximates test height fields as accurately as the greedy insertion algorithms. Most greedy insertion algorithms suffer from elongated triangles that usually appear near the boundaries. However, we insert the four corner points into each block to produce the base triangulation of the block before the point addition step begins so that elongated triangles could not appear in th simplified terrain.

• Convergence Security Journal
• /
• v.2 no.2
• /
• pp.155-164
• /
• 2002

A design implemented the $\delta$SAcc234bit Mask Data Insertion algorithm that can let the Mask which commercialized Wave Steganography had improved the problem that a filter ring was able to easily become and raised Capacity and extend the width that Cover-data was alternative. Also, it applied 3-Tier file encryption algorithm with a proposal in order to improve a security level of Mask. 3-Tier file encryption algorithm is the algorithm that a specific pattern improved the problem that appeared in Ciphertext according to a file. A design implemented the StegoWaveK model carried out Wave Steganography, using $\delta$SAcc234bit Mask Data Insertion algorithm and the 3-Tier file encryption algorithm that proposed in this paper.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.1
• /
• pp.86-98
• /
• 2007

This paper presents a heuristic algorithm for the traveling salesman problem with time windows (TSPTW). Aniterative insertion algorithm as a constructive search heuristic and a hybrid meta heuristic combining simulatedannealing and tabu search with the randomized selection of 2-interchange and a simple move operator as animproving search heuristic are proposed, Computational tests performed on 400 benchmark problem instancesshow that the proposed algorithm generates optimal or near-optimal solutions in most cases. New best knownheuristic values for many benchmark problem sets were obtained using the proposed approach.

• Korean Journal of Mathematics
• /
• v.14 no.1
• /
• pp.125-136
• /
• 2006

Using the Bumping algorithm for the shifted rim hook tableaux described in [5], we construct Schensted insertion and deletion algorithms for shifted rim hook tableaux. This may give us the combinatorial proof for the orthogonality of the second kind of the spin characters of $S_n$.

• Proceedings of the IEEK Conference
• /
• 2004.06b
• /
• pp.455-458
• /
• 2004

We present an efficient heuristic algorithm to reduce glitch power dissipation in combinational circuits. In this paper, the total number of glitches are reduced by replacing existing gates with functionally equivalent ones and by gate sizing which classified into three types and by buffer insertion which classified into two types. The proposed algorithm combines gate freezing, gate sizing. and buffer insertion into a single optimization process to maximize the glitch reduction. Our experimental results show an average of $67.8\%$ glitch reduction and $32.0\%$ power reduction by simultaneous gate freezing, gate sizing, and buffer insertion.

• Pediatric Gastroenterology, Hepatology & Nutrition
• /
• v.20 no.1
• /
• pp.34-40
• /
• 2017

Purpose: This study was performed to review the outcomes of gastrostomy insertion in children at our institute during 10 years. Methods: A retrospective chart review was performed on 236 patients who underwent gastrostomy insertion from October 2005 to March 2015. We used our algorithm to select the least invasive method for gastrostomy insertion for each patient. Long-term follow-up was performed to analyze complications related to the method of gastrostomy insertion. Results: Out of 236 patients, 120 underwent endoscopic gastrostomy, 79 had laparoscopic gastrostomy, and 37 had open gastrostomy procedures. The total major complication rates for endoscopic gastrostomy insertion, laparoscopic gastrostomy insertion, and open gastrostomy were 9.2%, 8.9%, and 8.1%, respectively. The most common major complication was gastroesophageal reflux requiring Nissen fundoplication (3.8%), and other complications included peritonitis (1.3%), hiatal hernia (1.3%), and bowel perforation (0.8%). Gastrostomy removal was successful in 8.6% and 5.0% of patients in the endoscopic and surgical gastrostomy groups, respectively. Gastrocutaneous fistula occurred in 60% of surgically inserted cases, requiring a second operation. Conclusion: This retrospective study was performed to review the outcome of gastrostomy insertion, as well as to introduce an algorithm that can be used for future cases. Further studies should be conducted to make a consensus on choosing the most appropriate method for gastrostomy insertion.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.244-248
• /
• 1987

The force/torque sensor for robot is developed. The compliance algorithm for peg-in-hole insertion task using the forec/troque sensor is developed. The system consists of an IBM PC, robot, force/torque sensor, strain meter, A/D board, and interface board. The IBM PC functions as a main processor and the robot controller as a slave processor. The sensor is constructed to measure $T_x$, $T_y$, $F_z$ which are necessary to precisely execute a peg-in-hole insertion task by SCARA type assembly robot. The outputs of sensor are analyzed. On the basis of the analysis, compliance algorithm for peg-in-hole insertion task is developed. Some comments concerning the development of wrist force/torque sensor and compliance algorithm are given.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.2
• /
• pp.160-170
• /
• 2009

This paper studies a vehicle routing problem variant which considers customers to require simultaneous delivery and pick-up under time windows(VRPSDP-TW). The objective of this paper is to minimize the total travel distance of routes that satisfy both the delivery and pick-up demand. We propose a heuristic algorithm for solving the VRPSDP-TW, based on the ant colony system(ACS). In route construction, an insertion algorithm based ACS is applied and the interim solution is improved by local search. Through iterative processes, the heuristic algorithm drives the best solution. Experiments are implemented to evaluate a performance of the algorithm on some test instances from literature.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.4
• /
• pp.268-271
• /
• 2001

In this paper, we propose a simplified pollution adaptive mesh generation algorithm using singular elements. The algorithm based on the element pollution error indicator concentrate on boundary nodes. The automatic mesh generation method is followed by either a node-relocation or a node-insertion method. The boundary node relocation phase is introduced to reduce pollution error estimates without increasing the boundary nodes. The node insertion phase greatly improves the error and the factor with the cost of increasing the node numbers. It is shown that the suggested r-h version algorithm combined with singular elements converges more quickly than the conventional one.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.2
• /
• pp.653-658
• /
• 2015

This paper deals with an efficient optimization design method of a compact ultra wideband (UWB) filter which can improve the characteristics of the filter. The Evolution Strategy (ES) algorithm is adopted for the optimization and modified to suppress the ripple by inserting an additional step to the ES scheme. The algorithm has the ability to control the ripple of an insertion loss in a passband as a modified approach. During the modified ES, a structure of initial shape is changed a lot, while includes the stepped impedance (SI) and the composite right/left handed transmission line (CRLH-TL). And an optimized filter satisfies the UWB specifications on the stopband and passband with an acceptable insertion loss. The filter achieves a much developed shape, the size of $15{\times}14mm$, the 3dB bandwidth from 2.7 to 10.8GHz, the flat insertion-loss less than 1dB, the wide stopband with 12~20GHz, and an acceptable return loss.