http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
固定平面壁에 平行하게 運動하는 球의 假想質量變化에 관한 硏究
朴伊東,孫寬浩 成均館大學校 科學技術硏究所 1984 論文集 Vol.35 No.1
An exact solution for the three dimensional incompressible potential flow due to translation of a rigid sphere moving parallel to a rigid plane wall is presented. A bispherical coordinate system was used to simplify the boundary conditions. Also, bispherical coordinate system has been used to obtain exact solution on the velocity potential. The Laplace equation was solved by means of seperation of variables and the exact solution on the velocity potential was derived in infinite series form. The kinetic energy of a quiscently incompressible fluid perturbed by the motion of a rigid sphere was calculated from the velocity potential. And the exprsesion for the virtual mass of a rigid sphere was obtained from the formula which involved the term of the kinetic energy. According to the equation of the ratio of the virtual mass of a rigid sphere moving in the presence of a plane wall(M) to the virtual mass a rigid sphere moving in a infinite fluid(M_∞), the Vrtual mass of a rigid sphere increases significantly as it approach a rigid plane wall. When the ratio of the distance from wall to sphere center(H) to sphere radius (R) approaches 1, the ratio of the virtual mass of a rigid sphere moving in the presence of a plane wall (M) to the virtual mass a rigid sphere moving in a infinite fluid(M_∞) approaches 1.223. When the ratio of the distance from wall to sphere center(H) to sphere radius(R) is larger than about 8, the effect of a rigid plane wall on a rigid sphere is almost neglected.
이창순,권영직,손관호 대구대학교 산업기술연구소 1990 産業技術硏究 Vol.9 No.-
A multiplier structure is presented for multiplication of two arbitrary binary element in the GF(2^(m)). The multiplier which used normal basis is constructed with two m-stage feedback shift registers, maximum m² AND gate m² XOR gates. If we obtain a normal basis according to m, generate multiplication-matrix based the nomal basis and design a multiplier with using the matrix, we can implement a simple multiplier over GF(2^(m)). At every clock time two input elements is implied with parallel and the output bit is obtained serially. Therefore this circuit requires m clock times for the entire multiplication.