• Communications of the Korean Mathematical Society
• /
• v.14 no.2
• /
• pp.337-352
• /
• 1999

In this paper we find a geometric condition for the weaker principle of spatial averaging (PSA) for a class of polyhedral domains. Let \ulcorner be a polyhedron in R\ulcorner, n$\leq$3. If all dihedral angles of \ulcorner are submultiples of $\pi$, then there exists a parallelopiped \ulcorner generated by n linearily independent vectors {\ulcorner}\ulcorner in R\ulcorner containing \ulcorner so that solutions of $\Delta$u+λu=0 in \ulcorner with either the boundary condition u=0 or ∂u/∂n=0 are expressed by linear combinations of those of $\Delta$u+λn=0 in \ulcorner with periodic boundary condition. Moreover, if {\ulcorner}\ulcorner satisfies rational condition, we guarantee the weaker PSA for the domain \ulcorner.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.994-996
• /
• 2012

We constructed novel recombinant baculovirus vector system. This vector system contained coding genes for polyhedron promoter, vesicular stomatitis virus G (VSVG), polyA, cytomegalovirus (CMV) promoter, enhanced green fluorescent protein (EGFP), and protein transduction domain (PTD). We compared efficacy and rate of expression of this novel recombinant baculovirus vector system with other control vector system. From this result, we confirmed that this novel recombinant baculovirus vector system was superior to other control vector system.

• Journal for History of Mathematics
• /
• v.16 no.4
• /
• pp.91-106
• /
• 2003

We seek the possibility of application of ICT(Information ＆ Communication Technology) to the experience learning in mathematics. Especially we focused on regular polyhedron in the middle school mathematics and on geodesic dome. We investigate related historical tales about the subjects which seem quite helpful of motivating to understand them. Then by using them and by ICT we develop an experience learning program for geodesic dome as an application of regular polyhedron. Through the program we expect that students show positive attitude in mathematical tendency and curiosity about mathematics and that the application of ICT to the experience learning in mathematics is very effective to improve their learning skill in mathematics.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.977-980
• /
• 2014

A baculovirus vector systems including genes of polyhedron promoter, vesicular stomatitis virus G (VSVG), polyA, cytomegalovirus (CMV) promoter, enhanced green fluorescent protein (EGFP), and protein transduction domain (PTD) were constructed. These recombinant baculovirus vector systems were transfected into human foreskin fibroblast cells and various tissues and investigated gene transfer and expression of these vector systems with control vectors. From the study, these recombinant baculovirus vector systems were more effective and safe than control vector in view of gene transfer and expression.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.273-273
• /
• 1996

• Journal of Korea Multimedia Society
• /
• v.3 no.3
• /
• pp.298-308
• /
• 2000

We present an efficient algorithm for finding the sequence of extreme vortices of a moving regular convex polyhedron of with respect to a fixed plane H.. The algorithm utilizes the spherical Voronoi diagram that results from the outward unit normal vectors nF$_{i}$ 's of faces of P. It is well-known that the Voronoi diagram of n sites in the plane can be computed in 0(nlogn) time, and this bound is optimal. However. exploiting the convexity of P, we are able to construct the spherical Voronoi diagram of nF$_{i}$ ,'s in O(n) time. Using the spherical Voronoi diagram, we show that an extreme vertex problem can be transformed to a spherical point location problem. The extreme vertex problem can be solved in O(logn) time after O(n) time and space preprocessing. Moreover, the sequence of extreme vertices of a moving regular convex polyhedron with respect to H can be found in (equation omitted) time, where m$^{j}$ $_{k}$ (1$\leq$j$\leq$s) is the number of edges of a spherical Voronoi region sreg(equation omitted) such that (equation omitted) gives one or more extreme vertices.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.4
• /
• pp.335-341
• /
• 2009

In this paper, review of developed MLS-based finite elements and a proposal for their applications are described. The shape functions and their derivatives of MLS-based finite elements are constructed using Moving-Least Square approximation. In MLS-based finite element, using the adequate influence domain of weight function used in MLS approximation, kronecker delta condition could be satisfied at the element boundary. Moreover, because of the characteristics of MLS approximation, we could easily add extra nodes at an arbitrary position in MLS-based finite elements. For these reasons, until now, several variable-node elements(2D variable element for linear case and quadratic case and 3D variable-node elements) and finite crack elements are developed using MLS-based finite elements concept. MLS-based finite elements could be extended to 2D variable-node triangle element, 2D finite crack triangle element, variable-node shell element, finite crack shell element, and 3D polyhedron element. In this paper, we showed the feasibility of 3D polyhedron element at the case of femur meshing.

• Journal of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.371-387
• /
• 1995

Let X be a compact polyhedron, H a normal subgroup of the fundamental group $\pi_1(X)$ of X and $f : X \longrightarrow X$ a selfmap such that $f_piH \subset H$, where f_\pi : \pi_1(X) \longrightarrow \pi_1(X)$ is the induced homomorphism by f.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.613-617
• /
• 1990

This paper presents a method of calculating the position and orientation of a polyhedron arbitrarily placed in 3-D space using two cameras. We use key feature of the object and CAD data to solve the correspondence problem between two cameras' images.

• Communications of the Korean Mathematical Society
• /
• v.17 no.3
• /
• pp.495-503
• /
• 2002

We consider Holder estimates for ∂ in analytic polyhedra. In the case of dimension 2, it preserves exact Ho1der regularity, and it maps bounded (0,1)-forms into BMO with respect to volume measure.