• 제목/요약/키워드: General decomposition

검색결과 261건 처리시간 0.029초

영과잉 경시적 가산자료 분석을 위한 허들모형 (Hurdle Model for Longitudinal Zero-Inflated Count Data Analysis)

  • 진익태;이근백
    • 응용통계연구
    • /
    • 제27권6호
    • /
    • pp.923-932
    • /
    • 2014
  • 허들모형은 영이 과잉 가산자료를 분석하기 위해서 사용되어 왔다. 이 모형은 이산부분을 위한 로짓모형과 절삭된 가산부분을 위한 절삭된 포아송모형의 혼합모형이다. 이 논문에서 우리는 경시적 영과잉 가산자료를 분석하기 위해서 수정된 콜레스키 분해을 이용하여 일반적인 이분산성을 가지는 변량효과 공분산행렬을 제안한다. 수정된 콜레스키 분해는 변량효과 공분산행렬을 일반화자기상관 모수와 혁신분산모수로 분리되면, 이러한 모수들은 베이지안 일반화 선형모형을 통해 추정된다. 그리고 실제 자료분석을 통하여 설명한다.

Dynamic Precipitation and Substructure Stablility of Cu Alloy during High Temperature Deformation

  • Han, Chang-Suk;Choi, Dong-Nyeok;Jin, Sung-Yooun
    • 한국재료학회지
    • /
    • 제29권6호
    • /
    • pp.343-348
    • /
    • 2019
  • Structural and mechanical effects of the dynamical precipitation in two copper-base alloys have been investigated over a wide range of deformation temperatures. Basing upon the information gained during the experiment, also some general conclusion may be formulated. A one concerns the nature of dynamic precipitation(DP). Under this term it is commonly understood decomposition of a supersaturated solid solution during plastic straining. The process may, however, proceed in two different ways. It may be a homogeneous one from the point of view of distribution and morphological aspect of particles or it may lead to substantial difference in shape, size and particles distribution. The effect is controlled by the mode of deformation. Hence it seems to be reasonable to distinguish DP during homogeneous deformation from that which takes place in heterogeneously deformed alloy. In the first case the process can be analyzed solely in terms of particle-dislocation-particle interrelation. Much more complex problem we are facing in heterogeneously deforming alloy. Deformation bands and specific arrangement of dislocations in form of pile-ups at grain boundaries generate additional driving force and additional nucleation sites for precipitation. Along with heterogeneous precipitation, there is a homogeneous precipitation in areas between bands of coarse slip which also deform but at much smaller rate. This form of decomposition is responsible for a specially high hardening rate during high temperature straining and for thermally stable product of the decomposition of alloy.

SVD Pseudo-inverse를 이용한 영상 재구성 (SVD Pseudo-inverse and Application to Image Reconstruction from Projections)

  • 심영석;김성필
    • 대한전자공학회논문지
    • /
    • 제17권3호
    • /
    • pp.20-25
    • /
    • 1980
  • Singular value decomposition을 통한 pseudo-inverse를 단층영상 재구성에 이용하였다. 본 논문에서는 SVD pseudo-inverse를 이용한 truncated inverse filter와 Scalar Wiener filter에 대하여 검토하고 각각에 대하여 통계적 측면에서의 최적화가 연구되었다. 이러한 방법은 신호와 잡음문에 trade-off를 기함으로써 재구성 문제에 항상 뒤따르는 ill-conditioning 현상을 극복할 수 있다. 본 논문을 통하여 구성된 filter의 성능을 확인하기 위하여 컴퓨터를 이용한 simulation이 이루어졌으며 그 결과 재구성된 협상은 만족할 만 하였다.

  • PDF

텐세그러티 구조의 외력에 대한 적정 프리스트레스 결정 (Optimal prestress of Tensegrity Structures for External Load)

  • 안정태;이재홍
    • 한국공간구조학회논문집
    • /
    • 제13권1호
    • /
    • pp.59-67
    • /
    • 2013
  • This paper presents a new numerical method to analyse tensegrity structures by using singular value decomposition and force method. The tensegrity system consisting of compressive and tensle elements are pin-jointed system. Tensegrity structures, unlike the general structure should be preceded by form-finding. Tensegrity structures form-finding of the self-equilibrium stress stability, seeking to have the process. In this study, tensegrity structures when subjected to external loads, find the optimal pre-stress values was studied.

LEAST SQUARES SOLUTIONS OF THE MATRIX EQUATION AXB = D OVER GENERALIZED REFLEXIVE X

  • Yuan, Yongxin
    • Journal of applied mathematics & informatics
    • /
    • 제26권3_4호
    • /
    • pp.471-479
    • /
    • 2008
  • Let $R\;{\in}\;C^{m{\times}m}$ and $S\;{\in}\;C^{n{\times}n}$ be nontrivial unitary involutions, i.e., $R^*\;=\;R\;=\;R^{-1}\;{\neq}\;I_m$ and $S^*\;=\;S\;=\;S^{-1}\;{\neq}\;I_m$. We say that $G\;{\in}\;C^{m{\times}n}$ is a generalized reflexive matrix if RGS = G. The set of all m ${\times}$ n generalized reflexive matrices is denoted by $GRC^{m{\times}n}$. In this paper, an efficient method for the least squares solution $X\;{\in}\;GRC^{m{\times}n}$ of the matrix equation AXB = D with arbitrary coefficient matrices $A\;{\in}\;C^{p{\times}m}$, $B\;{\in}\;C^{n{\times}q}$and the right-hand side $D\;{\in}\;C^{p{\times}q}$ is developed based on the canonical correlation decomposition(CCD) and, an explicit formula for the general solution is presented.

  • PDF

부분문제가 같은 블록대각형 선형계획문제의 효율적인 방볍 (An Efficient Algorithm for a Block Angular Linear Program with the Same Blocks)

  • 양병학;박순달
    • 한국경영과학회지
    • /
    • 제12권2호
    • /
    • pp.42-50
    • /
    • 1987
  • This objective of this paper is to develop an efficient method with small memory requirement for a feed-mixing problem on a micro computer. First this method uses the decomposition principle to reduce the memory requirement. Next, the decomposition principle is modified to fit the problem. Further four different variations in solving subproblems are designed in order to improve efficiency of the principle. According to the test with respect to the processing time, the best variation is such that the dual simplex method is used, and the optimal basis of a previous subproblem is used as an initial basis, and the master problem is (M +1) dimensional. In general, the convergence of solution becomes slower near the optimal value. This paper introduces a termination criterion for a sufficiently good solution. According to the test, 5%-tolerence is acceptable with respect to the relation between the processing time and optimal value.

  • PDF

GPGPU를 이용한 파데브-레브리어 알고리즘 구현 및 성능 분석 (Implementation and Performance Evaluation of the Faddev-Leverrier Algorithm using GPGPU)

  • 박용훈;김철홍;김종면
    • 대한임베디드공학회논문지
    • /
    • 제8권3호
    • /
    • pp.171-178
    • /
    • 2013
  • In this paper, we implement the Faddev-Leverier algorithm using GPGPU (General-Purpose Graphics Processing Unit) to accelerate singular value decomposition. In addition, we compare the performance of the algorithm using CPU and CPU plus GPGPU for eleven ${\times}n$ matrix sizes in order to decompose singular values, where =4, 8, 16, 32, 64, 128, 256, 512, 1,024, 2,048, and 4,096. Experimental results indicate that CPU achieves better performance than CPU plus GPGPU for $n{\leq}64$ because of a large number of read and write operations between CPU and GPGPU. However, CPU plus GPGPU outperforms CPU exponentially in the execution time for $n{\geq}64$.

서보 제어계 설계지원을 위한 퍼지추론 TOOL의 개발 (The development of fuzzy reasoning tool for the support design of servo system)

  • 노창주;홍순일
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제19권4호
    • /
    • pp.72-78
    • /
    • 1995
  • The diffusion of fuzzy logic techniques into real applications requires specific software supports which save development time and reduce the programming effort. But we has been lack of a tool devoted to support the design of fuzzy controllers. In this paper, on the basis of the general fuzzy set and .alpha.-cut set decomposition of fuzzy sets, a set of fuzzy reasoning tool(FRT) devoted to support the design of fuzzy dontroller for servo systems is developed. The major features of this tool are: 1) It supports users to analyze fuzzy ingerence status based on input deta and expected results by three-D graphic display. 2) It supports users to prepare input data and expected result. 3) It supports users to tuned scaling factor of membership functions, rules and fuzzy inference. The paper shows how the suggested design tools are suitable to give a consistent answer to the tuning of fuzzy control system. This FRT is expected to exert good performance and devoted to support which the design of fuzzy controller is illustrated in the servo systems.

  • PDF

A controller design using modal decomposition of matrix pencil

  • Shibasato, Koki;Shiotsuki, Tetsuo;Kawaji, Shigeyasu
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.492-492
    • /
    • 2000
  • This paper proposes LQ optimal controller design method based on the modal decomposition. Here, the design problem of linear time-invariant systems is considered by using pencil model. The mathematical model based on matrix pencil is one of the most general representation of the system. By adding some conditions the model can be reduced to traditional system models. In pencil model, the state feedback is considered as an algebraic constraint between the state variable and the control input variable. The algebraic constraint on pencil model is called purely static mode, and is included in infinite mode. Therefore, the information of the constant gain controller is included in the purely static mode of the augmented system which consists of the plant and the control conditions. We pay attention to the coordinate transformation matrix, and LQ optimal controller is derived from the algebraic constraint of the internal variable. The proposed method is applied to the numerical examples, and the results are verified.

  • PDF

Sparse Kernel Independent Component Analysis for Blind Source Separation

  • Khan, Asif;Kim, In-Taek
    • Journal of the Optical Society of Korea
    • /
    • 제12권3호
    • /
    • pp.121-125
    • /
    • 2008
  • We address the problem of Blind Source Separation(BSS) of superimposed signals in situations where one signal has constant or slowly varying intensities at some consecutive locations and at the corresponding locations the other signal has highly varying intensities. Independent Component Analysis(ICA) is a major technique for Blind Source Separation and the existing ICA algorithms fail to estimate the original intensities in the stated situation. We combine the advantages of existing sparse methods and Kernel ICA in our technique, by proposing wavelet packet based sparse decomposition of signals prior to the application of Kernel ICA. Simulations and experimental results illustrate the effectiveness and accuracy of the proposed approach. The approach is general in the way that it can be tailored and applied to a wide range of BSS problems concerning one-dimensional signals and images(two-dimensional signals).