• Title/Summary/Keyword: PTAS

Search Result 19, Processing Time 0.02 seconds

A PTAS for nonsimultaneous parallel machine scheduling (가용시간이 서로 다른 병렬기계 스케줄링 문제에 대한 PTAS)

  • Hwang Hark-Chin
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.145-150
    • /
    • 2003
  • The parallel machine scheduling problem or assigning n jobs on m identical machines with the objective of minimizing makespan is considered. In this note, we apply the PTAS (Polynomial Time Approximation Scheme) or Hochbaum and Shmoys to our problem and show that it is still a PTAS for our problem.

  • PDF

Fast Construction of Three Dimensional Steiner Minimum Tree Using PTAS (PTAS를 이용한 3차원 스타이너 최소트리의 신속한 구성)

  • Kim, In-Bum
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.7
    • /
    • pp.87-95
    • /
    • 2012
  • In this paper, PTAS three-dimensional Steiner minimum tree connecting numerous input nodes rapidly in 3D space is proposed. Steiner minimum tree problem belongs to NP problem domain, and when properly devised heuristic introduces, it is generally superior to other algorithms as minimum spanning tree affiliated with P problem domain. But when the number of input nodes is very large, the problem requires excessive execution time. In this paper, a method using PTAS is proposed to solve the difficulty. In experiments for 70,000 input nodes in 3D space, the tree produced by the proposed 8 space partitioned PTAS method reduced 86.88% execution time, compared with the tree by naive 3D steiner minimum tree method, though increased 0.81% tree length. This affirms the proposed method can work well for applications that many nodes of three dimensions are need to connect swifty, enduring slight increase of tree length.

Efficient Construction of Large Scale Grade of Services Steiner Tree Using Space Locality and Polynomial-Time Approximation Scheme (공간 지역성과 PTAS를 활용한 대형 GOSST의 효과적 구성)

  • Kim, In-Bum
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.153-161
    • /
    • 2011
  • As the problem of GOSST building belongs to NP compete domain, heuristics for the problem ask for immense amount execution time and computations in large scale inputs. In this paper, we propose an efficient mechanism for GOSST construction using space locality PTAS. For 40,000 input nodes with maximum weight 100, the proposed space locality PTAS GOSST with 16 unit areas can reduce about 4.00% of connection cost and 89.26% of execution time less than weighted minimum spanning tree method. Though the proposed method increases 0.03% of connection cost more, but cuts down 96.39% of execution time less than approximate GOSST method (SGOSST) without PTAS. Therefore the proposed space locality PTAS GOSST mechanism can work moderately well to many useful applications where a greate number of weighted inputs should be connected in short time with approximate minimum connection cost.

Efficient Construction of Euclidean Minimum Spanning Tree Using Partial Polynomial-Time Approximation Scheme in Unequality Node Distribution (비 균등 노드 분포환경에서 부분 PTAS를 이용한 효과적인 유클리드 최소신장트리 생성)

  • Kim, In-Bum;Kim, Soo-In
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.6
    • /
    • pp.71-80
    • /
    • 2014
  • Employing PTAS to building minimum spanning tree for a large number of equal distribution input terminal nodes can be a effective way in execution time. But applying PTAS to building minimum spanning tree for tremendous unequal distribution node may lead to performance degradation. In this paper, a partial PTAS reflecting the scheme into specific node dense area is presented. In the environment where 90% of 50,000 input terminal nodes stand close together in specific area, approximate minimum spanning tree by our proposed scheme can show about 88.49% execution time less and 0.86%tree length less than by existing PTAS, and about 87.57%execution time less and 1.18% tree length more than by Prim's naive scheme. Therefore our scheme can go well to many useful applications where a multitude of nodes gathered around specific area should be connected efficiently as soon as possible.

Efficient Construction of Large Scale Steiner Tree using Polynomial-Time Approximation Scheme (PTAS를 이용한 대형 스타이너 트리의 효과적인 구성)

  • Kim, In-Bum
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.5
    • /
    • pp.25-34
    • /
    • 2010
  • By introducing additional nodes called Steiner points, the problem of Steiner Minimum Tree whose length can be shorter than Minimum Spanning Tree and which connects all input terminal nodes belongs to Non-Polynomial Complete domain. Though diverse heuristic methods can be applied to the problem, most of them may meet serious pains in computing and waiting for a solution of the problem with numerous input nodes. For numerous input nodes, an efficient PTAS approximation method producing candidate unit steiner trees with portals in most bottom layer, merging them hierarchically to construct their parent steiner trees in upper layer and building swiftly final approximation Steiner tree in most top layer is suggested in this paper. The experiment with 16,000 input nodes and designed 16 unit areas in most bottom layer shows 85.4% execution time improvement in serial processing and 98.9% in parallel processing comparing with pure Steiner heuristic method, though 0.24% overhead of tree length. Therefore, the suggested PTAS Steiner tree method can have a wide range applications to build a large scale approximation Steiner tree quickly.

Polynomial-Time Approximation Scheme for Efficient Construction of Grand-scale Multimedia Communication Network in Non-uniform Distribution of Nodes (비 균등 노드 분포 환경에서의 효과적인 대규모 멀티미디어 통신네트워크 구축을 위한 PTAS)

  • Kim, In-Bum
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2012.05a
    • /
    • pp.419-421
    • /
    • 2012
  • 멀티미디어 통신을 희망하는 수많은 노드들이 비 균등하게 분포되어 있는 환경에서 PTAS 기법을 사용하여 효과적으로 통신가능하게 하는 통신 네트워크 시스템의 구축이 가능하게 하는 방법을 제안한다.

  • PDF

Comparison of Smart Phone Application Based Hearing Screening and Hearing Handicap Inventory (스마트 폰 애플리케이션 기반 청각선별과 설문 청각선별의 비교)

  • Heo, Seung-Deok;Park, Chan-Ho;Song, Byung-Seop
    • Journal of rehabilitation welfare engineering & assistive technology
    • /
    • v.11 no.1
    • /
    • pp.73-79
    • /
    • 2017
  • It is difficult to detect the adult hearing loss after the language acquisition because of its slow progression, which can be evaluated voluntarily and actively when the appropriate tools are provided. Smartphones are one of useful tools, and they can utilize surveys and/or applications for hearing screening. This study aims to verify the possibility as a tool discovering delayed acquired hearing losses by comparing the pure tone screening application (app_PTS) which was recently developed by our research team and hearing handciap inventory (HHI). The subjects were 22 people whose age ranges from 10s to 80s. For pure tone averages (PTAs), hearing threshold level was selected the best one in same frequency, in both ears. Sensitivity and specificity of HHI were confirmed based on self awareness of hearing loss and PTAs at 1, 2, 4 kHz. Comparisons of two tests were measured by analyzing simple regression of correlation between PTAs of App_PTS and HHI scores. Sensitivity and specificity were 1.000 in both criteria. There was a statistically significant relationship between the PTAs_4 kHz and HHI (R-square = .951, p = .000). Hearing screening by questionnaire showed high correlation with smart phones based on application. Therefore, it can be useful as a hearing screening tool for individual life cycle using an user-friendly tool.

Numerical Analysis of Curling Behavior of Prestressed Approach Slab Subjected to Environmental Loads (환경하중에 의한 교량 프리스트레스 접속슬래프의 컬링 거동 수치 해석적 분석)

  • Park, Hee-Beom;Eum, In-Sub;Kim, Seong-Min;Rhee, Suk-Keun
    • International Journal of Highway Engineering
    • /
    • v.13 no.3
    • /
    • pp.7-14
    • /
    • 2011
  • The numerical analyses were performed to investigate the curling behavior of the post-tensioned prestressed concrete approach slab (PTAS) under environmental loads. A technique to include properly the boundary conditions of one end of PTAS that was connected to the bridge abutment using hinges was proposed for the numerical model. The applicability of a simplified model not having hunches was also investigated. By using the developed models, the curling behavior of PTAS was analyzed when the foundation settlement occurred. The analysis results showed that the maximum tensile stress obtained from the simplified model involving a simplified hinge connection was very closed to that obtained from a rigorous model. When the slab curled up, the maximum tensile stress occurred in the model including no foundation settlement, but when the slab curled down, the maximum stress occurred in the model including partial settlement of the foundation. Therefore, the design of PTAS should be performed considering those maximum tensile stresses.

Surgical Complication and Its Management in Ischemic Stroke (허혈성뇌졸중의 수술치료시 동반되는 합병증과 관리)

  • Kim, Dal Soo;Yoo, Do Sung;Huh, Pil Woo;Cho, Kyoung Suok;Kang, Joon Ki
    • Journal of Korean Neurosurgical Society
    • /
    • v.29 no.8
    • /
    • pp.1107-1112
    • /
    • 2000
  • Recently various operative procedures including microsurgery or endovascular surgery have been increasing for the management of ischemic cerebrovascular diseases. Carotid endarterectomy(CEA), extracranial-intracranial(EC-IC) arterial bypass, embolectomy, decompressive craniectomy, arterial transposition, intravascular thrombolysis, and percutaneous transarterial angioplasty and stenting (PTAS) are available surgical modalities for ischemic stroke. This article focuses the complications and perioperative management of patients treated with CEA and carotid PTAS among various surgical managements for ischemic stroke.

  • PDF

Experimental Analysis of Prestressed Approach Slab Behavior (프리스트레스가 도입된 접속슬래브의 실험적 거동 분석)

  • Park, Hee-Beom;Eum, In-Sub;Kim, Seong-Min
    • International Journal of Highway Engineering
    • /
    • v.12 no.4
    • /
    • pp.157-164
    • /
    • 2010
  • This research was conducted to analyze the behavior of Single-PTAS (Single Post-Tensioned Approach Slab) under tensioning and environmental loads by performing field tests when the demonstration Single-PTAS was being constructed. The temperature measurement sensors were installed at different depths, and the displacements in the approach slab under environmental loads and tensioning were measured using displacement transducers. As an experimental result, an abrupt change in the longitudinal displacement due to tensioning was not observed. The daily temperature change in the approach slab was negligible where the depth is over about 35cm. The temperature gradient in the approach slab adjacent to bridge was smaller than that adjacent to pavement. The patterns and magnitudes of vertical displacements were directly related to the temperature gradient at the measuring location. The behavior of Single-PTAS was very similar to that of concrete pavement. Therefore, a new design methodology for approach slabs is needed to include the pavement concept and to overcome drawback of current design procedures based on the simple beam concept.