• Title/Summary/Keyword: 최대차수

Search Result 160, Processing Time 0.026 seconds

Evaluation of EGM2008 Earth Gravitational Model (EGM2008 지구중력장모델의 평가)

  • Lee, Suk-Bae;Kim, Jin-Soo;Kim, Cheol-Young
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2008.10a
    • /
    • pp.203-204
    • /
    • 2008
  • EGM96 지구중력장모델을 개선시킨 EGM2008 지구중력장모델이 미국 NGA에 의해 발표됨에 따라, 본 연구에서는 EGM2008지구중력장모델을 한반도 지역을 대상으로 최대차수 360으로 해석하여 기존의 지구중력장모델인 EGM96(360차수) 및 EIGEN-GL04C(360차수)와 비교하였다. 또한 EGM2008은 기존의 구면조화분석한계인 360차수를 뛰어넘고 있으므로 격자 간격 $30'{\times}30'$$15'{\times}15'$, 그리고 $10'{\times}10'$로 각각 해석하여 지오이드고를 계산하고 정확도를 평가하였다. 정확도 평가는 우리나라의 수준점에서 GPS측량을 실시한 464점의 GPS/leveling 데이터를 활용하였다. 평가결과 EGM2008(360차수)은 $-0.100{\pm}0.183m$를 나타내 EGM96(360차수)결과인 $0.156{\pm}0.238m$에 비해 상당한 정확도의 개선을 가져왔으며, 2190차수의 고차항으로 해석한 결과 $-0.069{\pm}0.140m$ 더욱 정확한 결과를 얻을 수 있음을 확인하였다.

  • PDF

Maximum Degree Vertex-Based Algorithm for Maximum Clique Problem (최대 클릭 문제에 관한 최대차수 정점 기반 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.1
    • /
    • pp.227-235
    • /
    • 2015
  • In this paper, I propose a linear time algorithm devised to produce exact solution to NP-complete maximum clique problem. The proposed algorithm firstly, from a given graph G=(V,E), sets vertex $v_i$ of the maximum degree ${\Delta}(G)$ as clique's major vertex. It then selects vertex $v_j$ of ${\Delta}(G)$ among vertices $N_G(v_i)$ that are adjacent to $v_i$, only to determine $N_G(v_i){\cap}N_G(v_j)$ as candidate cliques w and $v_k$. Next it obtains $w=w{\cap}N_G(v_k)$ by sorting $d_G(v_k)$ in the descending order. Lastly, the algorithm executes the same procedure on $G{\backslash}w$ graph to compare newly attained cliques to previously attained cliques so as to choose the lower. With this simple method, multiple independent cliques would also be attainable. When applied to various regular and irregular graphs, the algorithm proposed in this paper has obtained exact solutions to all the given graphs linear time O(n).

A Polynomial Time Algorithm for Edge Coloring Problem (간선 색칠 문제의 다항시간 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.11
    • /
    • pp.159-165
    • /
    • 2013
  • This paper proposes a O(E) polynomial-time algorithm that has been devised to simultaneously solve edge-coloring problem and graph classification problem both of which remain NP-complete. The proposed algorithm selects an edge connecting maximum and minimum degree vertices so as to determine the number of edge coloring ${\chi}^{\prime}(G)$. Determined ${\chi}^{\prime}(G)$ is in turn either ${\Delta}(G)$ or ${\Delta}(G)+1$. Eventually, the result could be classified as class 1 if ${\chi}^{\prime}(G)={\Delta}(G)$ and as category 2 if ${\chi}^{\prime}(G)={\Delta}(G)+1$. This paper also proves Vizing's planar graph conjecture, which states that 'all simple, planar graphs with maximum degree six or seven are of class one, closing the remaining possible case', which has known to be NP-complete.

The Degree Reduction of B-splines using Bzier Methods (Bzier 방법을 이용한 B-spline의 차수 감소)

  • Kim, Hyeok-Jin;Kim, Tae-Wan;Wi, Yeong-Cheol;Kim, Ha-Jin
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.8
    • /
    • pp.875-883
    • /
    • 1999
  • 서로 다른 기하학적 모델링 시스템에 사용되는 곡선 및 곡면의 자료 교환에서, 시스템이 지원하는 그 곡선 및 곡면의 최대 차수에 제한이 있을 때, 낮은 차수로의 차수 감소가 필요하다. 본 논문에서는 근사 변환에 의한 B-spline 곡선의 차수 감소 방법을 제시한다. 기존의 Bzier 곡선의 차수감소 방법들을 적용하고, 그 방법들을 비교 분석한다. B-spline 곡선의 knot 제거 알고리즘이 자료 감소를 위해 차수 감소 과정에 적용된다.Abstract The degree reduction of B-splines is required in exchanging parametric curves and surfaces of the different geometric modeling systems because some systems limit the supported maximal degree. We propose an approximate degree reduction method of B-spline curves using the existing Bzier degree reduction methods. Knot removal algorithm is used to reduce data in the degree reduction process.

An Experimental Analysis of Approximate Conversions for B-splines (B-spline에 대한 근사변환의 실험적 분석)

  • Kim Hyeock Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.1 s.33
    • /
    • pp.35-44
    • /
    • 2005
  • The degree reduction of B-splines is necessary in exchanging parametric curves and surfaces of the different geometric modeling systems because some systems limit the supported maximal degree. In this paper, We provide an our experimental results in approximate conversion for B-splines apply to degree reduction. We utilize the existing Bezier degree reduction methods, and analyze the methods. Also, knot removal algorithm is used to reduce data in the degree reduction Process.

  • PDF

On the Reconstruction of the Sound Field Using the Regularized Equivalent Source Method (정규화된 등가음원법을 이용한 음장의 재구성)

  • Jeon In-Youl;Ih Jeong-Guon
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • spring
    • /
    • pp.213-216
    • /
    • 2004
  • 본 연구에서는 복잡한 형상을 가진 음원으로부터 방사하는 음장을 등가음원법 (equivalent source method)을 이용하여 재구성한다. 일반적인 등가음원법의 기본 원리는 진동하는 물체의 표면 또는 내부에 등가음원을 분포시켜서 등가음원의 강도를 계산하는 방법이다. 각 등가음원의 강도는 음원의 경계 조건이나 측정된 음장 음압을 통해서 구할 수가 있으며 사용된 등가음원의 차수, 개수 그리고 위치 등은 고려되어야 할 중요한 변수들이다. 기존의 HELS (Helmholtz equation least square) 방법은 한 곳의 위치에 다양한 차수로 이루어진 등가음원을 사용하여 각 차수의 계수를 구하는 방법으로써 구형에 가까운 음원에 대해서 좋은 결과를 보이나 음장의 결과가 최대 차수의 선택에 따라서 큰 오차를 유발하는 문제점이 있다. 따라서 정규화 기법을 사용하여 음장을 재구성하기 위해 필요한 등가음원의 최적 차수를 구하고, 음원 내부에 최적 차수로 이루어진 등가음원을 여러 개의 점에 위치시켜서 재구성 정확도를 향상시켰다. 정규화된 등가음원법의 타당성 검증을 위하여 표면 일부가 진동하는 구에 대한 수치 해석 및 청소기 모델에 대한 음장 재구성 실험 을 수행하였다.

  • PDF

Approximate conversion using the degree reduction of NURBS (NURBS의 차수 감소 방법을 이용한 근사변환)

  • 김혁진
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.1
    • /
    • pp.7-12
    • /
    • 2003
  • Because some systems limit the supported maximal degree, the degree reduction of NURBS is necessary in Parametric curves and surfaces of the different geometric modeling systems. Therefore an approximate degree reduction method of NURBS curves was introduced in this research. Also the existing Eck's B$\'{e}$zier degree reduction method and knot removal algorithm were used to reduce data in the degree reduction process. Finally we found that this method was stable, efficient for implementations, and easy to use algorithms.

  • PDF

The Order Selection of Equalizer in Feedforward Power Amplifier Linearizer using Adaptive Equalizer (적응 등화기를 이용한 Feedforward 선형증폭기에서의 등화기 차수 결정)

  • Chung, Jee-Sung;Yoo, Kyung-Yul
    • Proceedings of the KIEE Conference
    • /
    • 1999.11c
    • /
    • pp.715-717
    • /
    • 1999
  • 본 논문에서는 feedforward 선형 증폭기에서의 지연 불일치에 의한 효과를 최소화하기 위한 등화기의 차수 결정에 관하여 수학적 접근과 모의실험을 하였다. 현재 feedforward 선형 증폭기에서 주로 사용하는 vector modulator는 지연 불일치에 확실한 개선을 이루지 못하고 있다. 이것을 극복하고자 vector modulator를 등화기로 대체하고 증폭기와 시지연선의 최대시간불일치와 sampling frequency와의 관계로 등화기의 차수를 결정하여 지연 불일치에 의한 오류 제거능력을 향상시켰다.

  • PDF

Degree Reduction and Computation of the Maximum Error of B$\'{e}$zier Curves (B$\'{e}$zier 곡선의 차수감소와 최대오차의 계산)

  • 김혁진
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.4
    • /
    • pp.25-33
    • /
    • 1999
  • Exchanging parametric curves and surfaces between different geometric modeling systems often require degree reductions to approximate the curves and surfaces to the degree of supporting systems within the given tolerance. This paper is a research for approximate conversion of a degree reduction methods for Bezier curves in the data exchange between the different systems. Our approximate conversion is implemented that shows the experimental results with the others to reduce the degree from the given degree n to n-1 for the Bezier curves about the different degree reductions.

  • PDF

Effect of a frontal impermeable layer on the excess slurry pressure during the shield tunnelling in the saturated sand (포화 사질토에서 전방 차수층이 쉴드터널 초과 이수압에 미치는영향)

  • Lee, Yong-Jun;Lee, Sang-Duk
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.13 no.4
    • /
    • pp.347-370
    • /
    • 2011
  • Slurry type shield would be very effective for the tunnelling in a sandy ground, when the slurry pressure would be properly adjusted. Low slurry pressure could cause a tunnel face failure or a ground settlement in front of the tunnel face. Thus, the stability of tunnel face could be maintained by applying an excess slurry pressure that is larger than the active earth pressure. However, the slurry pressure should increase properly because an excessively high slurry pressure could cause the slurry flow out or the passive failure of the frontal ground. It is possible to apply the high slurry pressure without passive failure if a horizontal impermeable layer is located in the ground in front of the tunnel face, but its location, size, and effects are not clearly known yet. In this research, two-dimensional model tests were carried out in order to find out the effect of a horizontal impermeable layer for the slurry shield tunnelling in a saturated sandy ground. In tests slurry pressure was increased until the slurry flowed out of the ground surface or the ground fails. Location and dimension of the impermeable layer were varied. As results, the maximum and the excess slurry pressure in sandy ground were linearly proportional to the cover depth. Larger slurry pressure could be applied to increase the stability of the tunnel face when the impermeable layer was located in the ground above the crown in front of the tunnel face. The most effective length of the impermeable grouting layer was 1.0 ~ 1.5D, and the location was 1.0D above the crown level. The safety factor could be suggested as the ratio of the maximum slurry pressure to the active earth pressure at the tunnel face. It could also be suggested that the slurry pressure in the magnitude of 3.5 ~4.0 times larger than the active earth pressure at the initial tunnel face could be applied if the impermeable layer was constructed at the optimal location.