• Title/Summary/Keyword: adjacent matrix

Search Result 184, Processing Time 0.025 seconds

Changes of Distribution Coefficients of Cu, Cr, and As in Different Soil Matrix in a Laboratory Scale

  • Kang, Sung-Mo;Ra, Jong-Bum;Kim, Suk-Kuwon
    • Journal of the Korean Wood Science and Technology
    • /
    • v.37 no.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.

Numerical Methods for Wave Response in Harbor (항만내의 파도 응답에 관한 수치 계산)

  • D.J.,Kim;K.J.,Bai
    • Bulletin of the Society of Naval Architects of Korea
    • /
    • v.25 no.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.

  • PDF

Moments of the ruin time and the total amount of claims until ruin in a diffusion risk process

  • Kim, Jihoon;Ahn, Soohan
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.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.

Node-reduction Model of Large-scale Network Grape (대형 회로망 그래프 마디축소 모델)

  • Hwang, Jae-Ho
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.50 no.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.

  • PDF

Automatic Determination of Constraint Parameter for Improving Homography Matrix Calculation in RANSAC Algorithm

  • Chandra, Devy;Lee, Kee-Sung;Jo, Geun-Sik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.04a
    • /
    • 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.

ON SIGNLESS LAPLACIAN SPECTRUM OF THE ZERO DIVISOR GRAPHS OF THE RING ℤn

  • Pirzada, S.;Rather, Bilal A.;Shaban, Rezwan Ul;Merajuddin, Merajuddin
    • Korean Journal of Mathematics
    • /
    • v.29 no.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.

Adaptive Selection of Weighted Quantization Matrix for H.264 Intra Video Coding (H.264 인트라 부호화를 위한 적응적 가중치 양자화 행렬 선택방법)

  • Cho, Jae-Hyun;Cho, Suk-Hee;Jeong, Se-Yoon;Song, Byung-Cheol
    • Journal of Broadcast Engineering
    • /
    • v.15 no.5
    • /
    • pp.672-680
    • /
    • 2010
  • This paper presents an adaptive quantization matrix selection scheme for H.264 video encoding. Conventional H.264 coding standard applies the same quantization matrix to the entire video sequence without considering local characteristics in each frame. In this paper, we propose block adaptive selection of quantization matrix according to edge directivity of each block. Firstly, edge directivity of each block is determined using intra prediction modes of its spatially adjacent blocks. If the block is decided as a directional block, new weighted quantization matrix is applied to the block. Otherwise, conventional quantization matrix is used for quantization of the non-directional block. Since the proposed weighted quantization is designed based on statistical distribution of transform coefficients in accordance with intra prediction modes, we can achieve high coding efficiency. Experimental results show that the proposed scheme can improve coding efficiency by about 2% in terms of BD bit-rate.

Evolutionary Design of Fuzzy Classifiers for Human Detection Using Intersection Points and Confusion Matrix (교차점과 오차행렬을 이용한 사람 검출용 퍼지 분류기 진화 설계)

  • Lee, Joon-Yong;Park, So-Youn;Choi, Byung-Suk;Shin, Seung-Yong;Lee, Ju-Jang
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.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.

Elevated Temperature Properties of Austenitic Heat-resistant Ductile Irons (오스테나이트계 내열 구상흑연주철의 고온 특성)

  • Choe, Kyeong-Hwan;Seo, Joung-Hyck;Kim, Su-Hwang
    • Journal of Korea Foundry Society
    • /
    • v.37 no.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.

Generalization of Tanner′s Minimum Distance Bounds for LDPC Codes (LDPC 부호 적용을 위한 Tanner의 최소 거리 바운드의 일반화)

  • Shin Min Ho;Kim Joon Sung;Song Hong Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.10C
    • /
    • pp.1363-1369
    • /
    • 2004
  • LDPC(Low Density Parity Check) codes are described by bipartite graphs with bit nodes and parity-check nodes. Tanner derived minimum distance bounds of the regular LDPC code in terms of the eigenvalues of the associated adjacency matrix. In this paper we generalize the Tanner's results. We derive minimum distance bounds applicable to both regular and blockwise-irregular LDPC codes. The first bound considers the relation between bit nodes in a minimum-weight codeword, and the second one considers the connectivity between parity nodes adjacent to a minimum-weight codeword. The derived bounds make it possible to describe the distance property of the code in terms of the eigenvalues of the associated matrix.