• 제목/요약/키워드: Insertion Algorithm

검색결과 197건 처리시간 0.024초

구역화를 이용한 디지털 격자지형데이터의 단순화 알고리즘 (A Digital Terrain Simplification Algorithm with a Partitioning Method)

  • 강윤식;박우찬;양성봉
    • 한국정보처리학회논문지
    • /
    • 제7권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.

  • PDF

Cover-data의 유사성을 고려한 StegoWaveK (StegoWaveK based on the Correlation Relation)

  • 김영실;김영미;김륜옥;최진용
    • 융합보안논문지
    • /
    • 제2권2호
    • /
    • pp.155-164
    • /
    • 2002
  • 상용화된 Wave Steganography가 가지고 있는 Mask가 쉽게 필터링 될 수 있다는 문제점을 개선하고 Capacity를 높여 Cover-data 선택의 폭을 확장시킬 수 있는 $\delta$SAcc234bit Mask Data Insertion 알고리즘을 설계 구현하였다. 또한 Mask 의 보안수준을 향상시키기 위해 3-Tier 파일 암호화 알고리즘도 제안하고 적용하였다. 3-Tier 파일 암호화 알고리즘은 파일에 따라 Ciphertext에 특정한 패턴이 나타난다는 문제점을 개선한 알고리즘이다. 본 논문에서 제안한 $\delta$SAcc234bit Mask Data Insertion 알고리즘과 3-Tier 파일 암호화 알고리즘을 이용하여 Wave Steganography를 수행해주는 StegoWaveK 모델을 설계 구현하였다.

  • PDF

시간제약이 있는 외판원 문제를 위한 메타휴리스틱 기법 (An Iterative Insertion Algorithm and a Hybrid Meta Heuristic for the Traveling Salesman Problem with Time Windows)

  • 김병인
    • 대한산업공학회지
    • /
    • 제33권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.

SCHENSTED INSERTION AND DELETION ALGORITHMS FOR SHIFTED RIM HOOK TABLEAUX

  • Lee, Jaejin
    • Korean Journal of Mathematics
    • /
    • 제14권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$.

  • PDF

단일화된 게이트 프리징, 사이징 및 버퍼삽입에 의한 저 전력 최적화 알고리즘 (Gate Freezing, Gate Sizing, and Buffer Insertion for reducing Glitch Power Dissipation)

  • 이형우;신학건;김주호
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 하계종합학술대회 논문집(2)
    • /
    • 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.

  • PDF

Single Center Experience with Gastrostomy Insertion in Pediatric Patients: A 10-Year Review

  • Kim, Jiyoung;Koh, Hong;Chang, Eun Young;Park, Sun Yeong;Kim, Seung
    • Pediatric Gastroenterology, Hepatology & Nutrition
    • /
    • 제20권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.

조립용 로보트의 힘.토오크 센서 및 컴플라이언스 알고리즘의 개발 (Development of Force/Torque Sensor and Compliance Algorithm for Assembly Robots)

  • 고낙용;고명삼;하인중;이범희
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(I)
    • /
    • 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.

  • PDF

시간제약하 배달과 수거를 동시에 수행하는 차량경로문제를 위한 개미군집시스템 (Ant Colony System for Vehicle Routing Problem with Simultaneous Delivery and Pick-up under Time Windows)

  • 이상헌;김용대
    • 대한산업공학회지
    • /
    • 제35권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.

An Eeffective Mesh Generation Algorithm Using Singular Shape Functions

  • Yoo, Hyeong Seon;Jang, Jun Hwan;Pyun, Soo Bum
    • Transactions on Control, Automation and Systems Engineering
    • /
    • 제3권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.

  • PDF

An Optimal Design of the Compact CRLH-TL UWB Filter Using a Modified Evolution Strategy Algorithm

  • Oh, Seung-Hun;Wu, Chao;Chung, Tae Kyung;Kim, Hyeong-Seok
    • Journal of Electrical Engineering and Technology
    • /
    • 제10권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.