• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 춘계학술대회 논문집
• /
• pp.389-394
• /
• 1997

Consider a tetrhedron is composed of six dihedral angles .phi.(i=1,2..., 6), and a vertex of a tetrahedron is also three dihedral angles. It will assume that a vertex A, for an example, is composed of there angles definded such as .alpha..betha. and .gamma. !. then there is a corresponding angle can be given as .phi1.,.phi2.,.phi3.. Here, in order to differentiate between a conventional triangle and dihedral angle, if a dihedral angle degined in this paper is symbolized as .phi..LAMBDA.,the value of cos.theta.of .phi./sab a/, in a trigonometric function rule,can be defined to tecos.phi..LAMBD/sab A/., and it is defined as a tetradedral cosine .phi. or simply called a tecos.phi.. Moreover, in a simillar method, the dihedral angle of tetrahedron .phi..LAMBDA. is given as : value of sin .theta. can defind a tetra-sin.phi..LAMBDA., and value of tan .theta. of .phi..LAMBDA. is a tetra-tan .phi..LAMBDA. By induction it can derive that a tetrahedral geometry on the basis of suggesting a geometric tetrahedron

• 한국의류산업학회지
• /
• 제9권4호
• /
• pp.425-430
• /
• 2007

This study was to present these results as basic data for the effects of Ayurvedic oil and the development of alopecia treatment programs. The results were as follows: 1) After Ayurvedic treatment, the hair density of vertex and occiput were 264.2 hair/$cm^2$ and 299.8 hair/$cm^2$ each. There was the increase of total 29.2% in hair density. 2) The hair growth rates on vertex and occiput after Ayurvedic treatment were 310.8 ${\mu}m$/day and 345.8 ${\mu}m$/day respectively, there was the increase of total 79% in hair growth.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.806-809
• /
• 2003

In this paper, extracting design information from arbitrary aspherical lens shape in reverse engineering is introduced. Deformation terms and sphere data equation with various variables compose asphere equation. Aspherical lens shape is expressed with complicated polynomial expression that includes deformation terms and sphere data. Deformation term and vertex curvature have direct influence on a geometric shape and an optical characteristics of aspherical lens. Hence, extracting these information mean that design information could be derived and analyzed from shape data of arbitrary aspherical lens. Furthermore, sharing designer's experience and knowledge for aspherical lens design could be expected.

• 제어로봇시스템학회논문지
• /
• 제18권12호
• /
• pp.1096-1100
• /
• 2012

Most of previous genetic algorithms for solving graph problems have used a vertex-based encoding. We proposed an edge encoding based new genetic algorithm using a spanning tree. Contrary to general edge-based encoding, a spanning tree-based encoding represents only feasible partitions. As a target problem, we adopted the MAX CUT problem, which is well known as a representative NP-hard problem, and examined the performance of the proposed genetic algorithm. The experiments on benchmark graphs are executed and compared with vertex-based encoding. Performance improvements of the spanning tree-based encoding on sparse graphs was observed.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 컴퓨터소사이어티 추계학술대회논문집
• /
• pp.247-250
• /
• 2003

This paper proposed to digital watermarking technique for architectural drawing using LINES and ARCs based on vertex in CAD system to prevent infringement of copyright from unlawfulness reproductions and distribution. After extract LINES and ARCs from designed drawing, we embed watermarks using adaptive algorithm in each characteristics. Watermarks robust to various attacks like as geometrical transformation as being embedded in LINE's length and ARC's angle information. Also, the proposed method satisfies enough transparency about watermarked drawing because have suitable embedding strength to each component. By experimental result, we confirmed robustness and invisibility of embedded watermarks in several conversions of architectural design drawing.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.435-440
• /
• 2006

Let G be a simple graph with vertex set V(G) and edge set E(G). A subset S of E(G) is called an edge cover of G if the subgraph induced by S is a spanning subgraph of G. The maximum number of edge covers which form a partition of E(G) is called edge covering chromatic number of G, denoted by X'c(G). It is known that for any graph G with minimum degree ${\delta},\;{\delta}-1{\le}X'c(G){\le}{\delta}$. If $X'c(G) ={\delta}$, then G is called a graph of CI class, otherwise G is called a graph of CII class. It is easy to prove that the problem of deciding whether a given graph is of CI class or CII class is NP-complete. In this paper, we consider the classification of nearly bipartite graph and give some sufficient conditions for a nearly bipartite graph to be of CI class.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2008년도 춘계학술대회논문집
• /
• pp.25-28
• /
• 2008

An aerodynamic calculation in hover of KUH main rotor blade is performed using a three-dimensional unstructured hybrid mesh viscous flow solver. The flow solver utilizes a vertex-centered finite-volume scheme that is based on the Roe's flux-difference splitting with an implicit Jacobi/Gauss-Seidel time integration. The eddy viscosity are estimated by the Spalart-Allmaras one-equation turbulence model. A solution-adaptive mesh refinement technique is used for efficient capturing of the tip vortex. Calculations are performed at several operating conditions with varying collective pitch setting for KUH main rotor blade in hover. Good agreements are obtained between the present and other results using HOST and CAMRAD II in overall rotor performance. It is demonstrated that the present vertex-centered flow solver is an efficient and accurate tool for the assessment of rotor performance in hover.

• 대한수학회지
• /
• 제51권6호
• /
• pp.1141-1154
• /
• 2014

A k-hypertournament H on n vertices, where $2{\leq}k{\leq}n$, is a pair H = (V,A), where V is the vertex set of H and A is a set of k-tuples of vertices, called arcs, such that for all subsets $S{\subseteq}V$ with |S| = k, A contains exactly one permutation of S as an arc. Recently, Li et al. showed that any strong k-hypertournament H on n vertices, where $3{\leq}k{\leq}n-2$, is vertex-pancyclic, an extension of Moon's theorem for tournaments. In this paper, we prove the following generalization of another of Moon's theorems: If H is a strong k-hypertournament on n vertices, where $3{\leq}k{\leq}n-2$, and C is a Hamiltonian cycle in H, then C contains at least three pancyclic arcs.

• 대한수학회보
• /
• 제57권3호
• /
• pp.739-750
• /
• 2020

A simple graph is called semisymmetric if it is regular and edge transitive but not vertex transitive. Let p be a prime. Folkman proved [J. Folkman, Regular line-symmetric graphs, Journal of Combinatorial Theory 3 (1967), no. 3, 215-232] that no semisymmetric graph of order 2p or 2p² exists. In this paper an extension of his result in the case of cubic graphs of order 34p³, p ≠ 17, is obtained.

• 대한수학회지
• /
• 제42권4호
• /
• pp.847-856
• /
• 2005

M. Junger, G. Reinelt, and W. R. Pulleyblank asked the following questions ([2]). (1) Is it true that every simple planar 2-edge connected bipartite graph has a 3-partition in which each component consists of the edge set of a simple path? (2) Does every simple planar 2-edge connected graph have a 3-partition in which every component consists of the edge set of simple paths and triangles? The purpose of this paper is to provide a positive answer to the second question for simple outerplanar 2-vertex connected graphs and a positive answer to the first question for simple planar 2-edge connected bipartite graphs one set of whose bipartition has at most 4 vertices.