• Title/Summary/Keyword: cube

Search Result 1,090, Processing Time 0.028 seconds

Machining of Corner-cube Pattern on Accumulated Cu-Thin Plates (적층된 구리 박판의 코너 큐브 패턴의 가공)

  • Lee, Joon-Yong;Bae, Chan-Yeol;Kim, Chang-Ho
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.15 no.3
    • /
    • pp.109-114
    • /
    • 2016
  • This study presents the optimal hardness range for a coated layer of a workpiece when the diamond tool cuts the corner-cube pattern on the coated plates using an ultra-precision diamond-turning machine. Two kinds of coated plates, which have the hardness range of 211~328 Vickers hardness, are used on the first experiments. The form accuracy for the corner-cube pattern could be achieved through the following experiments using the accumulated thin copper plates in second experiments, having optimal 265~275 Vickers hardness based on the basic first experiments without tool wear. When the number of machining adjustments was increased to seven times, having machining depth was reduced successively in second experiment, a fine surface could be achieved without tool wear.

The Improvement of RFM RPC Using Ground Control Points and 3D Cube

  • Cho, Woo-Sug;Kim, Joo-Hyun
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.1143-1145
    • /
    • 2003
  • Some of satellites such as IKONOS don't provide the orbital elements so that we can’ utilize the physical sensor model. Therefore, Rational Function Model(RFM) which is one of mathematical models could be a feasible solution. In order to improve 3D geopositioning accuracy of IKONOS stereo imagery, Rational Polynomial Coefficients(RPCs) of the RFM need to be updated with Ground Control Points(GCPs). In this paper, a method to improve RPCs of RFM using GCPs and 3D cube is proposed. Firstly, the image coordinates of GCPs are observed. And then, using offset values and scale values of RPC provided, the image coordinates and ground coordinates of 3D cube are initially determined and updated RPCs are computed by the iterative least square method. The proposed method was implemented and analyzed in several cases: different numbers of 3D cube layers and GCPs. The experimental results showed that the proposed method improved the accuracy of RPCs in great amount.

  • PDF

Numerical Study of Laminar Flow over a Protruding Surface (I) - Flow Analysis - (돌출된 표면 위의 충류유동에 대한 전산 해석적 연구 (I) -유동 해석-)

  • Hwang, Jong-Yeon;Yang, Kyung-Soo
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.23 no.11
    • /
    • pp.1418-1425
    • /
    • 1999
  • Flow over a protruding surface is investigated using numerical simulation. We consider flow between two parallel plates with a cube mounted on one side of the channel. As the flow approaches the cube, the adverse pressure gradient produces three-dimensional boundary-layer separation, resulting In the formation of horseshoe vortices. The objective of our study is to clarify both the steady and the unsteady characteristics of the vortex system. As the Reynolds number increases, the structure of the vortices near the cube becomes complex and the number of vortices increases. The distribution of skin friction on the cube-mounted wall reflects the effect of the horseshoe vortices. All these results are consistent with the experimental findings currently available.

Boolean Factorization (부울 분해식 산출 방법)

  • Kwon, Oh-Hyeong
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.3 no.1
    • /
    • pp.17-27
    • /
    • 2000
  • A factorization is an extremely important part of multi-level logic synthesis. The number of literals in a factored form is a good estimate of the complexity of a logic function. and can be translated directly into the number of transistors required for implementation. Factored forms are described as either algebraic or Boolean, according to the trade-off between run-time and optimization. A Boolean factored form contains fewer number of literals than an algebraic factored form. In this paper, we present a new method for a Boolean factorization. The key idea is to build an extended co-kernel cube matrix using co-kernel/kernel pairs and kernel/kernel pairs together. The extended co-kernel cube matrix makes it possible to yield a Boolean factored form. We also propose a heuristic method for covering of the extended co-kernel cube matrix. Experimental results on various benchmark circuits show the improvements in literal counts over the algebraic factorization based on Brayton's co-kernel cube matrix.

  • PDF

Two Types of Algorithms for Finding the Cube Root in Finite Fields (유한체상에서 세제곱근을 찾는 두 종류의 알고리즘)

  • Cho, Gook Hwa
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.5
    • /
    • pp.499-503
    • /
    • 2016
  • We study algorithms that can efficiently find cube roots by modifying Cipolla-Lehmer algorithm. In this paper, we present two type algorithms for finding cube roots in finite field, which improves Cipolla-Lehmer algorithm. If the number of multiplications of two type algorithms has a little bit of a difference, then it is more efficient algorithm which have less storage variables.

A study on the finite element modeling of femur based marching cube algorithm (Marching cube 알고리즘을 이용한 대퇴골의 유한요소 모델링에 관한 연구)

  • 곽명근;오택열;변창환;이은택;유용석
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.10a
    • /
    • pp.1074-1077
    • /
    • 2002
  • Biomechanical behavior of the human femur is very important in various clinical situations. In this study, the data of FE models based on DICOM file exported from Computed tomography(CT). We generated FE models(voxel model, tetra model) of human femur using CT slide image. We compared them with Yon Mises stress results derived from finite element analysis(FEA). Comparing the two models, we found a correlation of them. As a result, the tetra model based proposed marching cube algorithm is a valid and accurate method to predict parameters of the complex biomechanical behavior of human femur.

  • PDF

An Adaptive Wormhole Routhing using Virtual Channels in K-ary n-cubes (K-ary n-cubes에서 가상채널을 사용한 적응적 웜홀 라우팅)

  • Lee, Sung-Mok;Kim, Chagn-Soo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.11
    • /
    • pp.2732-2744
    • /
    • 1997
  • This paper is based on multicasting model in k-ary n-cubes, and Proposes an adaptive wormhole routing algorithm which allows faults and channel contention. The proposed algorithm only requires $2{\times}n$ virtual channels per physical channel which is proportional to the dimension n in order to allow (n-1) faults in a k-ary n-cube. This method uses smaller number of virtual channels than the previously Proposed adaptive routing algorithms [5, 18]. Through a chaos simulator, we have measured message delay considering fault-tolerant as well as message traffic to our adaptive routing algorithm.

  • PDF

Convection Heat Transfer Coefficient of a Meat Cube in a Continuous Flow Sterilizing System

  • Hong, Ji-Hyang;Han, Young-Joe;Chung, Jong-Hoon
    • Food Science and Biotechnology
    • /
    • v.14 no.3
    • /
    • pp.328-333
    • /
    • 2005
  • Finite difference model and dynamic thermal property evaluation system were developed to estimate convection heat transfer coefficient by modeling temperature-time profile of beef cube in continuous flow sterilizing system. As input parameters of the model, specific heat and thermal conductivity values of beef frankfurter meat were independently measured from 20 to $80^{\circ}C$. Convection heat transfer coefficient was estimated by comparing simulated and measured temperature-time profiles. Actual temperature-time profiles of meat cube were measured at flow rates of 15, 30, and 45 L/min and viscosities from 0 to 15 cp, and mean values of convection heat transfer coefficients ranged from 792 to $2107\;W/m^2{\cdot}K$. Convection heat transfer coefficient increased with increase in flow rate and decreased as viscosity increased.