• Journal of the Korean Wood Science and Technology
• /
• 제37권2호
• /
• pp.137-140
• /
• 2009

Chromated copper arsenate (CCA), a long history of successful preservative, have raised environmental concerns. Adsorption characteristics of domestic soils for chromium, copper, and arsenic were assessed by measuring distribution coefficient ($K_d$) values of these metal components in a laboratory scale. The results revealed that $K_d$ values were higher in chromium, followed by arsenic and copper in soil matrix. Different soil matrixes resulted in varying mobilities of CCA components. The values of $K_d$ for all three metals increased with organic matter contents. The results suggest that the mobility of metal components may be very limited to the surface area adjacent to CCA-treated wood due to their fairly large distribution coefficient ($K_d$). However, the metal components would be persistent and accumulated in the soil, resulting in high chemical concentration in service area of treated wood.

• 대한조선학회지
• /
• 제25권3호
• /
• pp.3-12
• /
• 1988

A natural or an artificial harbor can exhibit frequency(or period) dependent water surface oscillations when excited by incident waves. Such oscillations in harbors can cause significant damage to moored ships and adjacent structures. This can also induce undesirable current in harbors. Many previous investigators have studied various aspects of harbor resonance problem. In the percent paper, both a localizes finite element method(LFEM) which is based on the functional constructed by Chen & Mei(1974) and Bai & Yeung(1974) and an integral equation method which was used by Lee(1969) are applied to harbor resonance problem. The present method(LFEM) shows computationally more efficient than the integral equation method. Our test results shows good agreement compared with other results. This enhanced computational efficiency is due to the fact that the present method gives a banded symmetric coefficients matrix and requires much less computational time in the calculation of the influence coefficients matrix than the integral equation method involved with Green's function. To test the present numerical scheme, two models are treated here. The present method(LFEM) can be extended to a fully three dimensional harbor problem with the similar computational advantage.

• Journal of the Korean Data and Information Science Society
• /
• 제27권1호
• /
• pp.265-274
• /
• 2016

In this paper, we consider a diffusion risk process, in which, its surplus process behaves like a Brownian motion in-between adjacent epochs of claims. We assume that the claims occur following a Poisson process and their sizes are independent and exponentially distributed with the same intensity. Our main goal is to derive the exact formula of the joint moment generating function of the ruin time and the total amount of aggregated claim sizes until ruin in the diffusion risk process. We also provide a method for computing the related first and second moments using the joint moment generating function and the augmented matrix exponential function.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제50권2호
• /
• pp.93-99
• /
• 2001

A new type geometric and mathematical network reduction model is introduced. Large-scale network is analyzed with analytic approach. The graph has many nodes, branches and loops. Circuit equation are obtained from these elements and connection rule. In this paper, the analytic relation between voltage source has a mutual different graphic property. Node-reduction procedure is achieved with this circuit property. Consequently voltage source value is included into the adjacent node-analyzing equation. A resultant model equations are reduced as much as voltage source number. Matrix rank is (n-1-k), where n, k is node and voltage source number. The reduction procedure is described and verified with geometric principle and circuit theory. Matrix type circuit equation can be composed with this technique. The last results shall be calculated by using computer.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2014년도 춘계학술발표대회
• /
• pp.830-833
• /
• 2014

This paper proposes dynamic constraint parameter to filter out degenerate configurations (i.e. set of collinear or adjacent features) in RANSAC algorithm. We define five different groups of image based on the feature distribution pattern. We apply the same linear and distance constraints for every image, but we use different constraint parameter for every group, which will affect the filtering result. An evaluation is done by comparing the proposed dynamic CS-RANSAC algorithm with the classic RANSAC and regular CS-RANSAC algorithms in the calculation of a homography matrix. The experimental results show that dynamic CS-RANSAC algorithm provides the lowest error rate compared to the other two algorithms.

• Korean Journal of Mathematics
• /
• 제29권1호
• /
• pp.13-24
• /
• 2021

For a finite commutative ring R with identity 1 ≠ 0, the zero divisor graph ��(R) is a simple connected graph having vertex set as the set of nonzero zero divisors of R, where two vertices x and y are adjacent if and only if xy = 0. We find the signless Laplacian spectrum of the zero divisor graphs ��(ℤn) for various values of n. Also, we find signless Laplacian spectrum of ��(ℤn) for n = pz, z ≥ 2, in terms of signless Laplacian spectrum of its components and zeros of the characteristic polynomial of an auxiliary matrix. Further, we characterise n for which zero divisor graph ��(ℤn) are signless Laplacian integral.

• 방송공학회논문지
• /
• 제15권5호
• /
• pp.672-680
• /
• 2010

본 논문은 H.264 동영상 부호화를 위한 적응적인 양자화 행렬 선택방법을 제안한다. 기존의 H.264 양자화 방법은 각 프레임에 동일한 양자화 행렬을 적용하기 때문에 영상의 지역적 특성을 고려하지 못해 코딩 효율이 저하될 수 있다. 이러한 문제점을 개선하고자 프레임 전체에 동일한 양자화 행렬을 적용하는 대신 매크로블록 단위로 블록이 가지는 방향성을 이용해 적응적으로 양자화 행렬을 적용하는 방법을 제안한다. 먼저, 각 블록의 방향성을 공간적으로 인접 블록의 인트라 예측모드 특성을 이용하여 결정한다. 방향성이 존재하는 블록에 대해서는 제안한 방식의 가중치 양자화 행렬을 적용하고, 방향성이 존재하지 않는 블록에 대해서는 기존의 양자화 행렬을 적용한다. 가중치 양자화 행렬은 인트라 예측모드에 따라 블록의 변환 계수의 통계적인 분포를 기반으로 설계되었기 때문에, 예측모드의 특성에 적합하게 양자화된다. 실험 결과를 통해 제안한 알고리즘이 BD rate 측면에서 기존 방법 대비 약 2% 정도의 부호화 효율이 상승됨을 확인할 수 있다.

• 제어로봇시스템학회논문지
• /
• 제16권8호
• /
• pp.761-765
• /
• 2010

This paper presents the design of optimal fuzzy classifier for human detection by using genetic algorithms, one of the best-known meta-heuristic search methods. For this purpose, encoding scheme to search the optimal sequential intersection points between adjacent fuzzy membership functions is originally presented for the fuzzy classifier design for HOG (Histograms of Oriented Gradient) descriptors. The intersection points are sequentially encoded in the proposed encoding scheme to reduce the redundancy of search space occurred in the combinational problem. Furthermore, the fitness function is modified with the true-positive and true-negative of the confusion matrix instead of the total success rate. Experimental results show that the two proposed approaches give superior performance in HOG datasets.

• 한국주조공학회지
• /
• 제37권2호
• /
• pp.31-37
• /
• 2017

A new form of austenitic heat-resistant ductile iron was developed and its microstructures and elevated temperature properties were compared to those of Ductile Ni-Resist D5S. According to JMatPro calculations, it was predicted that Mo-rich carbides would be crystallized before the eutectic reaction starts in the developed alloy. At the austenite cell boundaries of the developed alloy, both Mo-rich carbides and Cr-rich carbides were found. In addition, Ni-silicides were found adjacent to Cr-rich carbides in D5S specimen and were identified as $Ni_2Si$. The developed alloy also had greater yield strength and lower tensile strength levels with less elongation due to the dissolution of Mo atoms into the austenite matrix and the precipitation of Mo-rich carbides. From the results of elevated temperature tensile tests and stress-rupture tests, it was found that the developed alloy had elevated temperature properties superior to those of D5S. This was due to the pinning effect of the dissolved Mo atoms in the austenite matrix.

• 한국통신학회논문지
• /
• 제29권10C호
• /
• pp.1363-1369
• /
• 2004

LDPC 부호의 검사행렬은 비트노드와 검사노드간의 이분 그래프로 표현된다. Tanner는 그래프상의 인접 행렬 (adjacency matrix) 고유값을 이용하여, 균일 LDPC 부호의 최소 거리 하한식(minimum 야stance bound)을 유도하였다. 본 논문에서는 Tanner의 결과를 일반화하여, 균일 및 블록 구조를 갖는 비균일 LDPC부호에 적용 가능한 두개의 최소 거리 하한식을 유도한다. 첫 번째는 최소 거리 부호어에 인접한 비트노드들의 관계를 통하여 유도되는 비트노드 기반 하한식이고, 두 번째는 최소 거리 부호어와 연접한 검사노드들의 관계에서 얻어지는 검사노드기반 하한식이다. 론 논문에서 유도한 하한식을 통하여 블록 구조를 갖는 비균일 LDPC부호의 거리 특성을 그래프의 고유값들과의 관계로 나타낼 수 있다.