• Title/Summary/Keyword: Matrix Structure

Search Result 2,559, Processing Time 0.032 seconds

Estimation of the Asymptotic Stability Region for the Uncertain Variable Structure Systems with Bounded Controllers (크기가 제한된 제어기를 갖는 가변구조제어 시스템의 점근 안정 영역 추정)

  • 최한호;국태용
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.8
    • /
    • pp.616-622
    • /
    • 2003
  • This paper deals with the problem of estimating the asymptotic stability region(ASR) of uncertain variable structure systems with bounded controllers. Using linear matrix inequalities(LMIs) we estimate the ASR and show the exponential stability of the closed-loop control system in the estimated ASR. We give a simple LMI-based algorithm to get estimates of the ASR. We also give a synthesis algorithm to design a switching surface which will make the estimated ASR big. Finally, we give numerical examples in order to show that our method can give better results than the previous ones for a certain class of uncertain variable structure systems with bounded controllers.

MIMO Variable Structure Control System with Sliding Sector (슬라이딩 섹터를 갖는 다중 입출력 가변 구조 제어 시스템)

  • Choi Han-Ho
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.6
    • /
    • pp.524-529
    • /
    • 2006
  • In this paper, we propose a method to design variable structure systems with sliding sector for multi-input multi-output systems with mismatched uncertainties in the state matrix. For the uncertain systems we define sliding sectors within which a norm of the state decreases with zero input despite of mismatched uncertainties. Using the notion of the sliding sector we give simple design algorithms of variable structure control laws that can reduce the chattering. Finally, we give a design example in order to show the effectiveness of our method.

Secure Outsourced Computation of Multiple Matrix Multiplication Based on Fully Homomorphic Encryption

  • Wang, Shufang;Huang, Hai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5616-5630
    • /
    • 2019
  • Fully homomorphic encryption allows a third-party to perform arbitrary computation over encrypted data and is especially suitable for secure outsourced computation. This paper investigates secure outsourced computation of multiple matrix multiplication based on fully homomorphic encryption. Our work significantly improves the latest Mishra et al.'s work. We improve Mishra et al.'s matrix encoding method by introducing a column-order matrix encoding method which requires smaller parameter. This enables us to develop a binary multiplication method for multiple matrix multiplication, which multiplies pairwise two adjacent matrices in the tree structure instead of Mishra et al.'s sequential matrix multiplication from left to right. The binary multiplication method results in a logarithmic-depth circuit, thus is much more efficient than the sequential matrix multiplication method with linear-depth circuit. Experimental results show that for the product of ten 32×32 (64×64) square matrices our method takes only several thousand seconds while Mishra et al.'s method will take about tens of thousands of years which is astonishingly impractical. In addition, we further generalize our result from square matrix to non-square matrix. Experimental results show that the binary multiplication method and the classical dynamic programming method have a similar performance for ten non-square matrices multiplication.

A New Sparse Matrix Analysis of DFT Similar to Element Inverse Jacket Transform (엘레멘트 인버스 재킷 변환과 유사한 DFT의 새로운 희소 행렬 분해)

  • Lee, Kwang-Jae;Park, Dae-Chul;Lee, Moon-Ho;Choi, Seung-Je
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.4C
    • /
    • pp.440-446
    • /
    • 2007
  • This paper addresses a new representation of DFT matrix via the Jacket transform based on the element inverse processing. We simply represent the inverse of the DFT matrix following on the factorization way of the Jacket transform, and the results show that the inverse of DFT matrix is only simply related to its sparse matrix and the permutations. The decomposed DFT matrix via Jacket matrix has a strong geometric structure that exhibits a block modulating property. This means that the DFT matrix decomposed via the Jacket matrix can be interpreted as a block modulating process.

A Random Matrix Theory approach to correlation matrix in Korea Stock Market (확률행렬이론을 이용한 한국주식시장의 상관행렬 분석)

  • Kim, Geon-Woo;Lee, Sung-Chul
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.4
    • /
    • pp.727-733
    • /
    • 2011
  • To understand the stock market structure it is very important to extract meaningful information by analyzing the correlation matrix between stock returns. Recently there has been many studies on the correlation matrix using the Random Matrix Theory. In this paper we adopt this random matrix methodology to a single-factor model and we obtain meaningful information on the correlation matrix. In particular we observe the analysis of the correlation matrix using the single-factor model explains the real market data and as a result we confirm the usefulness of the single-factor model.

Implementation of Matrix Receiving Structure for Versatile Multi-Mission LEO Operations (저궤도 다중위성 운용을 위한 매트릭스 구조의 수신 채널 구현)

  • Park, Durk-Jong;Yeom, Kyung-Whan
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.24 no.10
    • /
    • pp.1001-1007
    • /
    • 2013
  • In the case of multi-mission LEO(Low Earth Orbit) operations, depending on the orbit of each satellite, one ground site is supposed to be communicated with more than two satellites at the same time. On top of that, image data processing system is generally mission-specific and 1:1 backup configuration. For the reason, if ground site has smaller number of antenna than that of satellite, interface with image data processing system would be very complicated. In this paper, considering that two LEO satellites can be operating and image data recording unit in redundancy can be easily plug-in, the implementation of matrix receiving structure is described. This matrix receiving structure has been validated from KOMPSAT-2 and -3(KOrea Multi-Purpose SATellite-2 and -3) since KOMPSAT-3 was launched in May, 2012. This structure will be applied for the KOMPSAT-3A and -5 through its expandability.

Optimization of T/C Lifting Plan using Dependency Structure Matrix (DSM) (DSM을 활용한 타워크레인 양중계획 최적화에 관한 연구)

  • Kim, Seungho;Kim, Sangyong;Jean, Jihoon;An, Sung-Hoon
    • Journal of the Korea Institute of Building Construction
    • /
    • v.16 no.2
    • /
    • pp.151-159
    • /
    • 2016
  • Tower crane (T/C) is one of the major equipment that is highly demanded in construction projects. Especially, most high-rise building projects require T/C to perform lifting and hoisting activities of materials. Therefore, lifting plan of T/C needs to reduce construction duration and cost. However, most lifting plan of the T/C in construction sites has still performed depending on experience and intuition of the site manager without systematic process of rational work. Dependency structure matrix (DSM) is useful tool in planning the activity sequences and managing information exchanges unlike other existing tools. To improve lifting plan of T/C efficiently, this study presents a framework for the scheduling T/C using DSM through the case study in real world construction site. The results of case study showed that the scheduling T/C using DSM is useful to optimize the T/C lifting plan in terms of easiness, specially in the typical floor cycle lifting planning.

Feasibility study on an acceleration signal-based translational and rotational mode shape estimation approach utilizing the linear transformation matrix

  • Seung-Hun Sung;Gil-Yong Lee;In-Ho Kim
    • Smart Structures and Systems
    • /
    • v.32 no.1
    • /
    • pp.1-7
    • /
    • 2023
  • In modal analysis, the mode shape reflects the vibration characteristics of the structure, and thus it is widely performed for finite element model updating and structural health monitoring. Generally, the acceleration-based mode shape is suitable to express the characteristics of structures for the translational vibration; however, it is difficult to represent the rotational mode at boundary conditions. A tilt sensor and gyroscope capable of measuring rotational mode are used to analyze the overall behavior of the structure, but extracting its mode shape is the major challenge under the small vibration always. Herein, we conducted a feasibility study on a multi-mode shape estimating approach utilizing a single physical quantity signal. The basic concept of the proposed method is to receive multi-metric dynamic responses from two sensors and obtain mode shapes through bridge loading test with relatively large deformation. In addition, the linear transformation matrix for estimating two mode shapes is derived, and the mode shape based on the gyro sensor data is obtained by acceleration response using ambient vibration. Because the structure's behavior with respect to translational and rotational mode can be confirmed, the proposed method can obtain the total response of the structure considering boundary conditions. To verify the feasibility of the proposed method, we pre-measured dynamic data acquired from five accelerometers and five gyro sensors in a lab-scale test considering bridge structures, and obtained a linear transformation matrix for estimating the multi-mode shapes. In addition, the mode shapes for two physical quantities could be extracted by using only the acceleration data. Finally, the mode shapes estimated by the proposed method were compared with the mode shapes obtained from the two sensors. This study confirmed the applicability of the multi-mode shape estimation approach for accurate damage assessment using multi-dimensional mode shapes of bridge structures, and can be used to evaluate the behavior of structures under ambient vibration.

LAPLACIAN SPECTRA OF GRAPH BUNDLES

  • Kim, Ju-Young
    • Communications of the Korean Mathematical Society
    • /
    • v.11 no.4
    • /
    • pp.1159-1174
    • /
    • 1996
  • The spectrum of the Laplacian matrix of a graph gives an information of the structure of the graph. For example, the product of non-zero eigenvalues of the characteristic polynomial of the Laplacian matrix of a graph with n vertices is n times of the number of spanning trees of that graph. The characteristic polynomial of the Laplacian matrix of a graph tells us the number of spanning trees and the connectivity of given graph. in this paper, we compute the characteristic polynomial of the Laplacian matrix of a graph bundle when its voltage lie in an abelian subgroup of the full automorphism group of the fibre; in particular, the automorphism group of the fibre is abelian. Also we study a relation between the characteristic polynomial of the Laplacian matrix of a graph G and that of the Laplacian matrix of a graph bundle over G. Some applications are also discussed.

  • PDF

Free vibration analysis of asymmetric shear wall-frame buildings using modified finite element-transfer matrix method

  • Bozdogan, Kanat B.
    • Structural Engineering and Mechanics
    • /
    • v.46 no.1
    • /
    • pp.1-17
    • /
    • 2013
  • In this study, the modified finite element- transfer matrix methods are proposed for free vibration analysis of asymmetric structures, the bearing system of which consists of shear wall-frames. In the study, a multi-storey structure is divided into as many elements as the number of storeys and storey masses are influenced as separated at alignments of storeys. The shear walls and frames are assumed to be flexural and shear cantilever beam structures. The storey stiffness matrix is obtained by formulating the governing equation at the center of mass for the shear walls and the frames in the i.th floor. The system transfer matrix is constructed in the dimension of $6{\times}6$ by transforming the obtained stiffness matrix. Thus, the dimension, which is $12n{\times}12n$ in classical finite elements, is reduced to the dimension of $6{\times}6$. To study the suitability of the method, the results are assessed by solving two examples taken from the literature.