• Title/Summary/Keyword: scaling matrix

Search Result 114, Processing Time 0.018 seconds

Transfer Matrix Algorithm for Computing the Geometric Quantities of a Square Lattice Polymer

  • Lee, Julian
    • Journal of the Korean Physical Society
    • /
    • v.73 no.12
    • /
    • pp.1808-1813
    • /
    • 2018
  • I develop a transfer matrix algorithm for computing the geometric quantities of a square lattice polymer with nearest-neighbor interactions. The radius of gyration, the end-to-end distance, and the monomer-to-end distance were computed as functions of the temperature. The computation time scales as ${\lesssim}1.8^N$ with a chain length N, in contrast to the explicit enumeration where the scaling is ${\sim}2.7^N$. Various techniques for reducing memory requirements are implemented.

Development of a Robust Design Process Using a Robustness Index (강건성 지수를 이용한 강건설계 기법의 개발)

  • Hwang, Kwang-Hyeon;Park, Gyung-Jin
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.8
    • /
    • pp.1426-1435
    • /
    • 2003
  • Design goal is to find the one that has the highest probability of success and the smallest variation. A robustness index has been proposed to satisfy these conditions. The two-step optimization process of the target problem requires a scaling factor. The search process of a scaling factor is replaced with the making of the decoupled design between the mean and the standard deviation. The decoupled design matrix is formed from the sensitivity or the sum of squares. After establishing the design matrix, the robust design process has a new three-step one. The first is ″reduce variability,″ the second is ″make the candidate designs that satisfy constraints and move the mean on the target,″ and the final is ″select the best robust design using the proposed robustness index.″ The robust design process is verified by three examples and the results using the robustness index are compared with those of other indices.

The Comparison of Singular Value Decomposition and Spectral Decomposition

  • Shin, Yang-Gyu
    • Journal of the Korean Data and Information Science Society
    • /
    • v.18 no.4
    • /
    • pp.1135-1143
    • /
    • 2007
  • The singular value decomposition and the spectral decomposition are the useful methods in the area of matrix computation for multivariate techniques such as principal component analysis and multidimensional scaling. These techniques aim to find a simpler geometric structure for the data points. The singular value decomposition and the spectral decomposition are the methods being used in these techniques for this purpose. In this paper, the singular value decomposition and the spectral decomposition are compared.

  • PDF

Changing Image Resolution In A Block Transform Domain (임의의 직교 블록 변환 영역에서의 영상 크기 변환 방법)

  • Lee, Nam-Koo;Oh, Hyung-Suk;Kim, Won-Ha
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.1
    • /
    • pp.49-55
    • /
    • 2009
  • This paper develops a methodology for resizing the resolution of an image in an arbitrary block transform domain. To accomplish this, we represent the procedures resizing images in an orthogonal transform domain in the form of matrix multiplications from which the matrix scaling the image resolutions is produce. The experiments showed that the proposed method produces the reliable performances without increasing the computational complexity, compared to conventional methods when applied to various transforms.

The dynamic explicit analysis of auto-body panel stamping process and investigating parameter affects of dynamic analysis (차체판넬 스템핑공정의 동적 외연적해석과 동적해석에 미치는 영향인자 분석)

  • Jung, Dong-Won
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.22 no.2
    • /
    • pp.380-390
    • /
    • 1998
  • In the present work a finite element formulation using dynamic explicit time integration scheme is used for numerical analysis of auto-body panel stamping processes. The lumping scheme is employed for the diagonal mass matrix and linearizing dynamic formulation. A contact scheme is developed by combining the skew boundary condition and direct trial-and-error method. In this work, for economic analysis the faster punch velocity and the mass scaling method are introduced. To investigate the effects of punch velocity and mass scaling, the various values of punch velocity and the various mass scalings are used for numerical analysis. Computations are carried out for analysis of complicated auto-body panel stamping processes such as forming of an oil pan and a fuel tank.

Multidimensional Scaling of Asymmetric Distance Matrices

  • Huh, Myung-Hoe;Lee, Yong-Goo
    • The Korean Journal of Applied Statistics
    • /
    • v.25 no.4
    • /
    • pp.613-620
    • /
    • 2012
  • In most cases of multidimensional scaling(MDS), the distances or dissimilarities among units are assumed to be symmetric. Thus, it is not an easy task to deal with asymmetric distances. Asymmetric MDS developed so far face difficulties in the interpretation of results. This study proposes a much simpler asymmetric MDS, that utilizes the notion of "altitude". The analogy arises in mountaineering: It is easier (more difficult) to move from the higher (lower) point to the lower (higher). The idea is formulated as a quantification problem, in which the disparity of distances is maximally related to the altitude difference. The proposed method is demonstrated in three examples, in which the altitudes are visualized by rainbow colors to ease the interpretability of users.

Frequency domain elastic full waveform inversion using the new pseudo-Hessian matrix: elastic Marmousi-2 synthetic test (향상된 슈도-헤시안 행렬을 이용한 탄성파 완전 파형역산)

  • Choi, Yun-Seok;Shin, Chang-Soo;Min, Dong-Joo
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.329-336
    • /
    • 2007
  • For scaling of the gradient of misfit function, we develop a new pseudo-Hessian matrix constructed by combining amplitude field and pseudo-Hessian matrix. Since pseudo- Hessian matrix neglects the calculation of the zero-lag auto-correlation of impulse responses in the approximate Hessian matrix, the pseudo-Hessian matrix has a limitation to scale the gradient of misfit function compared to the approximate Hessian matrix. To validate the new pseudo- Hessian matrix, we perform frequency-domain elastic full waveform inversion using this Hessian matrix. By synthetic experiments, we show that the new pseudo-Hessian matrix can give better convergence to the true model than the old one does. Furthermore, since the amplitude fields are intrinsically obtained in forward modeling procedure, we do not have to pay any extra cost to compute the new pseudo-Hessian. We think that the new pseudo-Hessian matrix can be used as an alternative of the approximate Hessian matrix of the Gauss-Newton method.

  • PDF

Development of PMSG Wind Power System Model using Wind Turbine Simulator and Matrix Converter (풍력터빈시뮬레이터와 매트릭스 컨버터를 적용한 PMSG 풍력발전 시스템 모델 개발)

  • Yun, Dong-Jin;Han, Byung-Moon;Cha, Han-Ju;Li, Yu-Long;Choi, Nam-Sup
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.6
    • /
    • pp.1130-1137
    • /
    • 2009
  • This paper describes a scaled model development of PMSG wind power system using wind turbine simulator and matrix converter. The wind turbine simulator, which consists of an induction motor with vector drive, calculates the output torque of a specific wind turbine using simulation software and sends the torque signal to the vector drive after scaling down the calculated value. The operational feasibility of interconnected PMSG system with matrix converter was verified by computer simulations with PSCAD/EMTDC software. The feasibility of hardware implementation was conformed by experimental works with a laboratory scaled-model of wind power system. The simulation and experimental results confirm that matrix converter can be effectively applied for the PMSG wind power system.

IMAGE RESIZING IN AN ARBITRARY TRANSFORM DOMAIN

  • Oh, Hyung-Suk;Kim, Won-Ha
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.44-48
    • /
    • 2009
  • This paper develops a methodology for resizing image resolutions in an arbitrary block transform domain. To accomplish this, we represent the procedures resizing images in an arbitrary transform domain in the form of matrix multiplications from which the matrix scaling the image resolutions is produce. The experiments showed that the proposed method produces the reliable performances without increasing the computational complexity, compared to conventional methods when applied to various transforms.

  • PDF

Robust Image Hashing for Tamper Detection Using Non-Negative Matrix Factorization

  • Tang, Zhenjun;Wang, Shuozhong;Zhang, Xinpeng;Wei, Weimin;Su, Shengjun
    • Journal of Ubiquitous Convergence Technology
    • /
    • v.2 no.1
    • /
    • pp.18-26
    • /
    • 2008
  • The invariance relation existing in the non-negative matrix factorization (NMF) is used for constructing robust image hashes in this work. The image is first re-scaled to a fixed size. Low-pass filtering is performed on the luminance component of the re-sized image to produce a normalized matrix. Entries in the normalized matrix are pseudo-randomly re-arranged under the control of a secret key to generate a secondary image. Non-negative matrix factorization is then performed on the secondary image. As the relation between most pairs of adjacent entries in the NMF's coefficient matrix is basically invariant to ordinary image processing, a coarse quantization scheme is devised to compress the extracted features contained in the coefficient matrix. The obtained binary elements are used to form the image hash after being scrambled based on another key. Similarity between hashes is measured by the Hamming distance. Experimental results show that the proposed scheme is robust against perceptually acceptable modifications to the image such as Gaussian filtering, moderate noise contamination, JPEG compression, re-scaling, and watermark embedding. Hashes of different images have very low collision probability. Tampering to local image areas can be detected by comparing the Hamming distance with a predetermined threshold, indicating the usefulness of the technique in digital forensics.

  • PDF