• Title/Summary/Keyword: 3 point method

Search Result 5,907, Processing Time 0.033 seconds

Direct Bonded (Si/SiO2∥Si3N4/Si) SIO Wafer Pairs with Four-point Bending (사점굽힘시험법을 이용한 이종절연막 (Si/SiO2||Si3N4/Si) SOI 기판쌍의 접합강도 연구)

  • Lee, Sang-Hyeon;Song, O-Seong
    • Korean Journal of Materials Research
    • /
    • v.12 no.6
    • /
    • pp.508-512
    • /
    • 2002
  • $2000{\AA}-SiO_2/Si(100)$ and $560{\AA}-Si_3N_4/Si(100)$ wafers, which are 10 cm in diameter, were directly bonded using a rapid thermal annealing method. We fixed the anneal time of 30 second and varied the anneal temperatures from 600 to $1200^{\circ}C$. The bond strength of bonded wafer pairs at given anneal temperature were evaluated by a razor blade crack opening method and a four-point bonding method, respectively. The results clearly slow that the four-point bending method is more suitable for evaluating the small bond strength of 80~430 mJ/$\m^2$ compared to the razor blade crack opening method, which shows no anneal temperature dependence in small bond strength.

A Study on the Constrained Dispatch Scheduling Using Affine Scaling Interior Point Method (Affine Scaling Interior Point Method를 이용한 제약급전에 관한 연구)

  • Kim, Kyung-Min;Han, Seok-Man;Chung, Koo-Hyung;Kim, Bal-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.55 no.3
    • /
    • pp.133-138
    • /
    • 2006
  • This paper presents an Optimal Power Flow (OPF) algorithm using Interior Point Method (IPM) to swiftly and precisely perform the five minute dispatch. This newly suggested methodology is based on Affine Scaling Interior Point Method which is favorable for large-scale problems involving many constraints. It is also eligible for OPF problems in order to improve the calculation speed and the preciseness of its resultant solutions. Big-M Method is also used to improve the solution stability. Finally, this paper provides relevant case studies to confirm the efficiency of the proposed methodology.

Method for Structural Vanishing Point Detection Using Orthogonality on Single Image (소실점의 직교성을 이용한 구조적인 소실점 검출 방법)

  • Jung, Sung-Gi;Lee, Chang-Hyung;Choi, Hyung-Il
    • Journal of Internet Computing and Services
    • /
    • v.18 no.5
    • /
    • pp.39-46
    • /
    • 2017
  • In this paper, we proposes method of vanishing point detection using orthogonality of vanishing point, under the "Manhattan World" assumption that the structure of the city is mostly grid and vanishing point are orthogonal to each other. The feature that the vanishing point are orthogonal to each other can be useful for inferring the missing point that are not detected among the three vanishing point, and prevent the vanishing point detected close to the other vanishing point. In this paper, we detect Vertical vanishing point through statistical approach and detect Horizontal and Front vanishing point through structural approach. Experimental results show that the proposed method improves the detection accuracy of the vanishing point compared with the existing method.

Power System Voltage Stability Classification Using Interior Point Method Based Support Vector Machine(IPMSVM)

  • Song, Hwa-Chang;Dosano, Rodel D.;Lee, Byong-Jun
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.9 no.3
    • /
    • pp.238-243
    • /
    • 2009
  • This paper present same thodology for the classification of power system voltage stability, the trajectory of which to instability is monotonic, using an interior point method based support vector machine(IPMSVM). The SVM based voltage stability classifier canp rovide real-time stability identification only using the local measurement data, without the topological information conventionally used.

Faster MapToPoint over $F_{3^m}$ for Pairing-based Cryptosystems (페어링 암호 시스템을 위한 $F_{3^m}$에서의 효율적인 MapToPoint 방법)

  • Park, Young-Ho;Cho, Young-In;Chang, Nam-Su
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.6
    • /
    • pp.3-12
    • /
    • 2011
  • A hashing function that maps arbitrary messages directly onto curve points (MapToPoint) has non-negligible complexity in pairing-based cryptosystems. Unlike elliptic curve cryptosystems, pairing-based cryptosystems require the hashing function in ternary fields. Barreto et al. observed that it is more advantageous to hash the message to an ordinate instead of an abscissa. So, they significantly improved the hashing function by using a matrix with coefficients of the abscissa. In this paper, we improve the method of Barreto et al. by reducing the matrix. Our method requires only 44% memory of the previous result. Moreover we can hash a message onto a curve point 2~3 times faster than Barreto's Method.

Development of Radiation Dose Assessment Algorithm for Arbitrary Geometry Radiation Source Based on Point-kernel Method (Point-kernel 방법론 기반 임의 형태 방사선원에 대한 외부피폭 방사선량 평가 알고리즘 개발)

  • Ju Young Kim;Min Seong Kim;Ji Woo Kim;Kwang Pyo Kim
    • Journal of Radiation Industry
    • /
    • v.17 no.3
    • /
    • pp.275-282
    • /
    • 2023
  • Workers in nuclear power plants are likely to be exposed to radiation from various geometrical sources. In order to evaluate the exposure level, the point-kernel method can be utilized. In order to perform a dose assessment based on this method, the radiation source should be divided into point sources, and the number of divisions should be set by the evaluator. However, for the general public, there may be difficulties in selecting the appropriate number of divisions and performing an evaluation. Therefore, the purpose of this study is to develop an algorithm for dose assessment for arbitrary shaped sources based on the point-kernel method. For this purpose, the point-kernel method was analyzed and the main factors for the dose assessment were selected. Subsequently, based on the analyzed methodology, a dose assessment algorithm for arbitrary shaped sources was developed. Lastly, the developed algorithm was verified using Microshield. The dose assessment procedure of the developed algorithm consisted of 1) boundary space setting step, 2) source grid division step, 3) the set of point sources generation step, and 4) dose assessment step. In the boundary space setting step, the boundaries of the space occupied by the sources are set. In the grid division step, the boundary space is divided into several grids. In the set of point sources generation step, the coordinates of the point sources are set by considering the proportion of sources occupying each grid. Finally, in the dose assessment step, the results of the dose assessments for each point source are summed up to derive the dose rate. In order to verify the developed algorithm, the exposure scenario was established based on the standard exposure scenario presented by the American National Standards Institute. The results of the evaluation with the developed algorithm and Microshield were compare. The results of the evaluation with the developed algorithm showed a range of 1.99×10-1~9.74×10-1 μSv hr-1, depending on the distance and the error between the results of the developed algorithm and Microshield was about 0.48~6.93%. The error was attributed to the difference in the number of point sources and point source distribution between the developed algorithm and the Microshield. The results of this study can be utilized for external exposure radiation dose assessments based on the point-kernel method.

Bounding volume estimation algorithm for image-based 3D object reconstruction

  • Jang, Tae Young;Hwang, Sung Soo;Kim, Hee-Dong;Kim, Seong Dae
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.2
    • /
    • pp.59-64
    • /
    • 2014
  • This paper presents a method for estimating the bounding volume for image-based 3D object reconstruction. The bounding volume of an object is a three-dimensional space where the object is expected to exist, and the size of the bounding volume strongly affects the resolution of the reconstructed geometry. Therefore, the size of a bounding volume should be as small as possible while it encloses an actual object. To this end, the proposed method uses a set of silhouettes of an object and generates a point cloud using a point filter. A bounding volume is then determined as the minimum sphere that encloses the point cloud. The experimental results show that the proposed method generates a bounding volume that encloses an actual object as small as possible.

Optimal Current Control Method of BLDC Motor Utilizing Maximum Torque Point

  • Park, Chang-Seok;Jang, Jung-Hoon;Jung, Tae-Uk
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.20 no.3
    • /
    • pp.213-220
    • /
    • 2017
  • This paper proposes an optimal current control method for improving efficiency of Brushless Direct Current (BLDC) motor. The proposed optimal current control method is based on the maximum torque point analysis of Finite Element Analysis (FEA). The proposed method can increase the effective voltage at the maximum torque point of BLDC motor and increase the output torque per unit current to increase the efficiency. In order to verify the proposed optimal current control method, have developed the prototype of a 50 [W] class motor drive and experimented by 20 [W] motor using the dynamometer set. This was verified.

Efficient Generation of Computer-generated Hologram Patterns Using Spatially Redundant Data on a 3D Object and the Novel Look-up Table Method

  • Kim, Seung-Cheol;Kim, Eun-Soo
    • Journal of Information Display
    • /
    • v.10 no.1
    • /
    • pp.6-15
    • /
    • 2009
  • In this paper, a new approach is proposed for the efficient generation of computer-generated holograms (CGHs) using the spatially redundant data on a 3D object and the novel look-up table (N-LUT) method. First, the pre-calculated N-point principle fringe patterns (PFPs) were calculated using the 1-point PFP of the N-LUT. Second, spatially redundant data on a 3D object were extracted and re-grouped into the N-point redundancy map using the run-length encoding (RLE) method. Then CGH patterns were generated using the spatial redundancy map and the N-LUT method. Finally, the generated hologram patterns were reconstructed. In this approach, the object points that were involved in the calculation of the CGH patterns were dramatically reduced, due to which the computational speed was increased. Some experiments with a test 3D object were carried out and the results were compared with those of conventional methods.

Rapid Inflection Point Method of Consolidation Testing (변곡점을 이용한 신속한 압밀시험에 관한 연구)

  • 민덕기;황광모;최규환
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2000.11a
    • /
    • pp.681-688
    • /
    • 2000
  • This study presented the new method for evaluating the coefficient of consolidation by using inflection point method which was based on the fact that time factor, T corresponding to the inflection point of a semilogarithmic plot of a time curve is fixed and equals to T = 0.405 at 70% consolidation. In the proposed method, the next load increment is applied as soon as the necessary time required to identify the inflection point. Thus, the coefficient of consolidation may be easily evaluated. The time required to complete the testing using this rapid consolidation method could be as low as 1.5-3 hours compared with 1 or 2 weeks in the case of the conventional consolidation test.

  • PDF