• Title/Summary/Keyword: Split Point

Search Result 222, Processing Time 0.029 seconds

STABILITY OF ORTHOGNATHIC SURGERY FOR CLEFT LIP AND PALATE PATIENTS (구순구개열환자에 대한 악교정수술후 안정성에 대한 연구)

  • Kwon, Tae-Geon;Mori, Yoshihide;Minami, Katsuhiro;Kim, Jong-Bae
    • Journal of the Korean Association of Oral and Maxillofacial Surgeons
    • /
    • v.26 no.4
    • /
    • pp.407-413
    • /
    • 2000
  • To evaluate the stability after orthognathic surgery in cleft lip and palate patients using rigid fixation, 20 patients underwent primary repair in childhood and later developed a jaw deformity and malocclusion that required orthognathic surgery were reviewed. Two groups, one of 10 patients performed Le Fort I osteotomy with sagittal split ramus osteotomy and one of 10 patients with sagittal split ramus osteotomy of the mandible, were evaluated. Each group had unilateral cleft only and all alveolar cleft sites had been grafted with autogeneous bone before the orthognathic surgery. The amount of surgical movement and relapse were compared in both horizontal and vertical dimensions. Two-jaw surgery group was more stable than mandibular surgery only group in mandibular position (p< 0.05). Statistically significant relapse was observed in mandibular skeletal point in mandibular surgery group (p<0.05). There was no statistically significant relapse in the skeletal point of two-jaw surgery group. However, the correlation between the horizontal surgical movement and relapse was detected (r = 0.88). This correlation indicates the need of overcorrection. The presence of scar tissues and relatively deficient maxillary bone could be attributed to this close relation between the surgical change and relapse.

  • PDF

A Method for Continuous k Nearest Neighbor Search With Partial Order (부분순위 연속 k 최근접 객체 탐색 기법)

  • Kim, Jin-Deog
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.1
    • /
    • pp.126-132
    • /
    • 2011
  • In the application areas of LBS(Location Based Service) and ITS(Intelligent Transportation System), continuous k-nearest neighbor query(CkNN) which is defined as a query to find the nearest points of interest to all the points on a given path is widely used. It is necessary to acquire results quickly in the above applications and be applicable to spatial network databases. It is also able to cope successfully with frequent updates of POI objects. This paper proposes a new method to search nearest POIs for moving query objects on the spatial networks. The method produces a set of split points and their corresponding k-POIs as results with partial order among k-POIs. The results obtained from experiments with real dataset show that the proposed method outperforms the existing methods. The proposed method achieves very short processing time(15%) compared with the existing method.

Detecting Road Intersections using Partially Similar Trajectories of Moving Objects (이동 객체의 부분 유사궤적 탐색을 활용한 교차로 검출 기법)

  • Park, Bokuk;Park, Jinkwan;Kim, Taeyong;Cho, Hwan-Gue
    • Journal of KIISE
    • /
    • v.43 no.4
    • /
    • pp.404-410
    • /
    • 2016
  • Automated road map generation poses significant research challenges since GPS-based navigation systems prevail in most general vehicles. This paper proposes an automated detecting method for intersection points using GPS vehicle trajectory data without any background digital map information. The proposed method exploits the fact that the trajectories are generally split into several branches at an intersection point. One problem in previous work on this intersection detecting is that those approaches require stopping points and direction changes for every testing vehicle. However our approach does not require such complex auxiliary information for intersection detecting. Our method is based on partial trajectory matching among trajectories since a set of incoming trajectories split other trajectory cluster branches at the intersection point. We tested our method on a real GPS data set with 1266 vehicles in Gangnam District, Seoul. Our experiment showed that the proposed method works well at some bigger intersection points in Gangnam. Our system scored 75% sensitivity and 78% specificity according to the test data. We believe that more GPS trajectory data would make our system more reliable and applicable in a practice.

STABILITY AFTER SURGICAL CORRECTION OF MANDIBULAR PROGNATHISM USING BILATERAL SAGGITAL SPLIT RAMUS OSTEOTOMY AND FIXATION WITH POLY-L/DL-LACTIDE COPOLYMER SCREWS ($BIOSORB^{TM}FX$) (하악지 시상 골절단술 이후 흡수성 나사를 사용하여 고정한 환자에서 술 후 안정성에 대한 연구)

  • Kwon, Taek-Kyun;Kim, Yong-Deok;Shin, Sang-Hun;Kim, Uk-Kyu;Kim, Jong-Ryoul;Chung, In-Kyo
    • Maxillofacial Plastic and Reconstructive Surgery
    • /
    • v.27 no.2
    • /
    • pp.160-163
    • /
    • 2005
  • This study was designed to assess skeletal stabilily after surgical correction of mandibular prognathism by bilateral saggital split ramus osteotomy(BSSRO) and fixation with absorbable screws. From July 2001 to September 2003, 30 patients with Class III malocclusion were treated with BSSRO and mandibular setback. They underwent fixation with Biosorb$^{TM}$ FX screws. Cephalograms were obtained preoperatibely, 2 or 3 days postoperatively, and about 12 months after the operation. Changes in the position of lower incisor tip, B point, and pogonion were examined on lateral cephalograms. The mean mandibular setback just after surgery was 10.6mm. 12 months after surgery, mean relapse at pogonion represented 17.9% and 15.1% at B point. Our results suggest that fixation of the bony segments with absorbable screws after BSSO may be used effectively in properly selected cases.

Robust GPU-based intersection algorithm for a large triangle set (GPU를 이용한 대량 삼각형 교차 알고리즘)

  • Kyung, Min-Ho;Kwak, Jong-Geun;Choi, Jung-Ju
    • Journal of the Korea Computer Graphics Society
    • /
    • v.17 no.3
    • /
    • pp.9-19
    • /
    • 2011
  • Computing triangle-triangle intersections has been a fundamental task required for many 3D geometric problems. We propose a novel robust GPU algorithm to efficiently compute intersections in a large triangle set. The algorithm has three stages:k-d tree construction, triangle pair generation, and exact intersection computation. All three stages are executed on GPU except, for unsafe triangle pairs. Unsafe triangle pairs are robustly handled by CLP(controlled linear perturbation) on a CPU thread. They are identified by floating-point filtering while exact intersection is computed on GPU. Many triangles crossing a split plane are duplicated in k-d tree construction, which form a lot of redundant triangle pairs later. To eliminate them efficiently, we use a split index which can determine redundancy of a pair by a simple bitwise operation. We applied the proposed algorithm to computing 3D Minkowski sum boundaries to verify its efficiency and robustness.

A Study on Unbiased Methods in Constructing Classification Trees

  • Lee, Yoon-Mo;Song, Moon Sup
    • Communications for Statistical Applications and Methods
    • /
    • v.9 no.3
    • /
    • pp.809-824
    • /
    • 2002
  • we propose two methods which separate the variable selection step and the split-point selection step. We call these two algorithms as CHITES method and F&CHITES method. They adapted some of the best characteristics of CART, CHAID, and QUEST. In the first step the variable, which is most significant to predict the target class values, is selected. In the second step, the exhaustive search method is applied to find the splitting point based on the selected variable in the first step. We compared the proposed methods, CART, and QUEST in terms of variable selection bias and power, error rates, and training times. The proposed methods are not only unbiased in the null case, but also powerful for selecting correct variables in non-null cases.

A study on the fracture toughness of dynamic interlaminar for CFRP composite laminates (선진복합재료 적층판의 동적 층간 파괴 인성평가)

  • 김지훈;김영남;양인영;심재기
    • Journal of the Korean Society of Safety
    • /
    • v.13 no.4
    • /
    • pp.41-48
    • /
    • 1998
  • In this paper, an investigation was performed on the dynamic interlaminar fracture toughness of CFRP(carbon fiber reinforcement plastics) composite laminates. Composite laminates used in this experimentation are CF/EPOXY and CF/PEEK laminated plates. In the experiments, Split Hopkinson's Bar(SHPE) test was applied to dynamic and notched flexure test. The mode Ⅱ fracture toughness of each unidirectional CFRP was estimated by the analyzed deflection of the specimen and J-integral with the measured impulsive load and reactions at the supported points. As an experimental result, the vibration amplitude of CF/PEEK laminates appear more than that of CF/EPOXY laminates for the J-integral and displacement velocity at a measuring point. Also, it is thought that the dynamic fracture toughness of two kind specimens(CFRP/EPOXY and CF/PEEK) with the in crease of displacement velocity becomes a little greater at a measuring point within the range of measurement.

  • PDF

An investigation on flow characteristics of two dimensional inclined wall attaching offset jet (단이 진 경사벽면에 부착되는 2차원 제트유동에 관한 연구)

  • 송흥복;심재경;윤순현
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.22 no.1
    • /
    • pp.52-66
    • /
    • 1998
  • An experimental study on the flow characteristics was performed for a two-dimensional turbulent wall attaching offset jet at different oblique angles to a surface. The flow characteristics were investigated by using a split film probe with the modified Stock's calibration method. The jet mean velocity, turbulent intensity, wall static pressure coefficient profiles, and time-averaged reattachment point were measured at the Reynolds number Re (based on the nozzle width, D) ranging from 17700 to 53200, the offset ratio H/D from 2.5 to 10, and the inclined angle .alpha. from 0.deg. C to 40.deg. C. The Correlations between the maximum pressure position, minimum pressure position, and reattachment point and offset ratios, and inclined angles are presented.

  • PDF

Effective Mobility Management of Split Point Selection Considering Candidate AP in SDN (SDN에서 후보 AP를 고려한 스플릿 포인트 선택의 효율적인 이동성 관리)

  • Kim, Bora;Yeoum, Sanggil;Choo, Hyunseung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.10a
    • /
    • pp.118-121
    • /
    • 2018
  • 끊김 없는 이동성은 멀티미디어가 풍부한 실시간 서비스를 지원하는 미래의 무선 네트워크에서 필수적이다. SDN (Software Defined Networking)은 중앙 집중식 컨트롤러를 통해 무선 네트워크에서 세밀한 플로우 수준의 이동성 관리를 제공할 수 있지만 핸드오버 지연의 새로운 네트워킹 패러다임이다. 스플릿 포인트 방식은 SDN 무선 네트워크에서 핸드오버 및 종단 간 전송 지연을 줄이는 효과적인 방법이다. 스플릿 포인트는 트래픽이 새로운 AP (Access Point)를 향하여 핸드오버 한 후에 기존 플로우 경로상에 존재하는 스위치이다. 본 논문에서는 MN-CN (Corresponding Node) 경로의 각 스위치의 가중치를 스위치와 후보 AP 사이의 평균 고리(홉)로 계산하고 최소 가중치를 갖는 스위치가 스플릿 포인트로 선택된다. 스플릿 포인트 선택 외에도 이 논문은 SDN 에서 제공하는 제어 및 데이터 플레인 분리를 이용하여 핸드오버 후 플로우에 대한 최적의 경로를 복원한다. 제안 아이디어의 수치 해석은 이전 솔루션과 비교하여 총 비용이 9.6 % ~ 13 % 향상되었음을 보여준다.

IMPACT OF FRACTIONAL CONFORMABLE DERIVATIVES ON A(H1N1) INFECTION MODEL

  • Hind Ali Ahmad Eid;Mohammed N Alkord
    • Nonlinear Functional Analysis and Applications
    • /
    • v.29 no.2
    • /
    • pp.597-620
    • /
    • 2024
  • In this study, the conformable fractional derivative(CFD) of order 𝝔 in conjunction with the LC operator of orderρ is used to develop the model of the transmission of the A(H1N1) influenza infection. A brand-new A(H1N1) influenza infection model is presented, with a population split into four different compartments. Fixed point theorems were used to prove the existence of the solutions and uniqueness of this model. The basic reproduction number R0 was determined. The least and most sensitive variables that could alter R0 were then determined using normalized forward sensitivity indices. Through numerical simulations carried out with the aid of the Adams-Moulton approach, the study also investigated the effects of numerous biological characteristics on the system. The findings demonstrated that if 𝝔 < 1 and ρ < 1 under the CFD, also the findings demonstrated that if 𝝔 = 1 and ρ = 1 under the CFD, the A(H1N1) influenza infection will not vanish.