• Title/Summary/Keyword: Time-matrix

Search Result 3,639, Processing Time 0.032 seconds

Stability Bounds of Delayed Time-varying Perturbations of Discrete Systems (이산시스템에서 시간지연을 갖는 시변 상태 지연 섭동의 안정 범위에 관한 연구)

  • Lee, Dal-Ho;Han, Hyung-Seok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.2
    • /
    • pp.147-153
    • /
    • 2007
  • The stability robustness problem of linear discrete-time systems with delayed time-varying perturbations is considered. Compared with continuous time system, little effort has been made for the discrete time system in this area. In the previous results, the bounds were derived for the case of non-delayed perturbations. There are few results for delayed perturbation. Although the results are for the delayed perturbation, they considered only the time-invariant perturbations. In this paper, the sufficient conditions for stability can be expressed as linear matrix inequalities(LMIs). The corresponding stability bounds are determined by LMI(Linear Matrix Inequality)-based algorithms. Numerical examples are given to compare with the previous results and show the effectiveness of the proposed results.

Motion Analysis of Two Floating Platforms with Mooring and Hawser Lines in Tandem Moored Operation by Combined Matrix Method and Separated Matrix Method

  • KOO BON-JUN;KIM MOO-HYUN
    • Journal of Ocean Engineering and Technology
    • /
    • v.19 no.5 s.66
    • /
    • pp.1-15
    • /
    • 2005
  • The motion behaviors including hydrodynamic interaction and mechanical coupling effects on multiple-body floating platforms are simulated by using a time domain hull/mooring/riser coupled dynamics analysis program. The objective of this study is to evaluate off-diagonal hydrodynamic interaction effects and mechanical coupling effects on tandem moored FPSO and shuttle taker motions. In the multiple-body floating platforms interaction, hydrodynamic coupling effects with waves and mechanical coupling effects through the connectors should be considered. Thus, in this study, the multiple-body platform motions are calculated by Combined Matrix Method (CMM) as well as Separated Matrix Method (SMM). The advantage of the combined matrix method is that it can include all the 6Nx6N full hydrodynamic and mechanical interaction effects among N bodies. Whereas, due to the larger matrix size, the calculation time of Combined Matrix Method (CMM) is longer than the Separated Matrix Method (SMM). On the other hand, Separated Matrix Method (SMM) cannot include the off-diagonal 6x6 hydrodynamic interaction coefficients although it can fully include mechanical interactions among N bodies. To evaluate hydrodynamic interaction and mechanical coupling effects, tandem moored FPSO and shuttle tanker is simulated by Combined Matrix Method (CMM) and Separated Matrix Method (SMM). The calculation results give a good agreement between Combined Matrix Method (CMM) and Separated Matrix Method (SMM). The results show that the Separated Matrix Method (SMM) is more efficient for tandem moored FPSO and shuttle tanker. In the numerical calculation, the hydrodynamic coefficients are calculated from a 3D diffraction/radiation panel program WAMIT, and wind and current forces are generated by using the respective coefficients given in the OCIMF data sheet.

In-depth Analysis and Performance Improvement of a Flash Disk-based Matrix Transposition Algorithm (플래시 디스크 기반 행렬전치 알고리즘 심층 분석 및 성능개선)

  • Lee, Hyung-Bong;Chung, Tae-Yun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.12 no.6
    • /
    • pp.377-384
    • /
    • 2017
  • The scope of the matrix application is so broad that it can not be limited. A typical matrix application area in computer science is image processing. Particularly, radar scanning equipment implemented on a small embedded system requires real-time matrix transposition for image processing, and since its memory size is small, a general matrix transposition algorithm can not be applied. In this case, matrix transposition must be done in disk space, such as flash disk, using a limited memory buffer. In this paper, we analyze and improve a recently published flash disk-based matrix transposition algorithm named as asymmetric sub-matrix transposition algorithm. The performance analysis shows that the asymmetric sub-matrix transposition algorithm has lower performance than the conventional sub-matrix transposition algorithm, but the improved asymmetric sub-matrix transposition algorithm is superior to the sub-matrix transposition algorithm in 13 of the 16 experimental data.

Additional degree of freedom in phased-MIMO radar signal design using space-time codes

  • Vahdani, Roholah;Bizaki, Hossein Khaleghi;Joshaghani, Mohsen Fallah
    • ETRI Journal
    • /
    • v.43 no.4
    • /
    • pp.640-649
    • /
    • 2021
  • In this paper, an additional degree of freedom in phased multi-input multi-output (phased-MIMO) radar with any arbitrary desired covariance matrix is proposed using space-time codes. By using the proposed method, any desired transmit covariance matrix in MIMO radar (phased-MIMO radars) can be realized by employing fully correlated base waveforms such as phased-array radars and simply extending them to different time slots with predesigned phases and amplitudes. In the proposed method, the transmit covariance matrix depends on the base waveform and space-time codes. For simplicity, a base waveform can be selected arbitrarily (ie, all base waveforms can be fully correlated, similar to phased-array radars). Therefore, any desired covariance matrix can be achieved by using a very simple phased-array structure and space-time code in the transmitter. The main advantage of the proposed scheme is that it does not require diverse uncorrelated waveforms. This considerably reduces transmitter hardware and software complexity and cost. One the receiver side, multiple signals can be analyzed jointly in the time and space domains to improve the signal-to-interference-plus-noise ratio.

An accelerated Levenberg-Marquardt algorithm for feedforward network

  • Kwak, Young-Tae
    • Journal of the Korean Data and Information Science Society
    • /
    • v.23 no.5
    • /
    • pp.1027-1035
    • /
    • 2012
  • This paper proposes a new Levenberg-Marquardt algorithm that is accelerated by adjusting a Jacobian matrix and a quasi-Hessian matrix. The proposed method partitions the Jacobian matrix into block matrices and employs the inverse of a partitioned matrix to find the inverse of the quasi-Hessian matrix. Our method can avoid expensive operations and save memory in calculating the inverse of the quasi-Hessian matrix. It can shorten the training time for fast convergence. In our results tested in a large application, we were able to save about 20% of the training time than other algorithms.

A Study on the Controlled Release of Naproxen from Hydrophilic Polymer Matrix (친수성고분자 매트릭스의 Naproxen 제어방출에 관한 연구)

  • 김종국;조은실
    • YAKHAK HOEJI
    • /
    • v.31 no.1
    • /
    • pp.25-32
    • /
    • 1987
  • The effect of loading dose, plasticiser and PVA molecular weight on naproxen release from hydrophilic polymer matrix was examined. Hydrophilic polymer matrix was prepared with PVA and PVP by adding glycerine as plasticiser. The release of naproxen from polymer matrix was determined in phosphate buffer medium. The release rate of naproxen from the polymer matrix increased as drug loading dose and plasticiser percentage increased. Raproxen released from the polymer matrix showed the time square root kinetics. Without changing the release-pattern, the release rate of naproxen could not be changed by varying molecular weight of PVA. Linearly released time range increased as drug loading dose increased, whereas decreased as plasticiser percentage increased up to 30%.

  • PDF

Applying A Matrix-Based Inference Algorithm to Electronic Commerce

  • Lee, Kun-Chang;Cho, Hyung-Rae
    • Proceedings of the Korea Database Society Conference
    • /
    • 1999.06a
    • /
    • pp.353-359
    • /
    • 1999
  • We present a matrix-based inference algorithm suitable for electronic commerce applications. For this purpose, an Extended AND-OR Graph (EAOG) was developed with the intention that fast inference process is enabled within the electronic commerce situations. The proposed EAOG inference mechanism has the following three characteristics. 1. Real-time inference: The EAOG inference mechanism is suitable for the real-time inference because its computational mechanism is based on matrix computation. 2. Matrix operation: All the subjective knowledge is delineated in a matrix form. so that inference process can proceed based on the matrix operation which is computationally efficient. 3. Bi-directional inference: Traditional inference method of expert systems is based on either forward chaining or backward chaining which is mutually exclusive in terms of logical process and computational efficiency. However, the proposed EAOG inference mechanism is generically bi-directional without loss of both speed and efficiency. We have proved the validity of our approach with several propositions and an illustrative EC example.

  • PDF

A systolic Array to Effectively Solve Large Sparce Matrix Linear System of Equations (대형 스파스 메트릭스 선형방정식을 효율적으로 해석하는 씨스톨릭 어레이)

  • 이병홍;채수환;김정선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.7
    • /
    • pp.739-748
    • /
    • 1992
  • A CGM iterative systolic algorithm to solve large sparse linear systems of equations is presented. For implementation of the algorithm, a systolic array using the stripe structure is proposed. The matrix A is decomposed into a strictly lower triangular matrix, a diagonal matrix, and a strictly up-per triangular matrix, and the two formers and the tatter· are concurrently computed by different linear arrays. Hence, the execution time of this approach Is reduced to half of the execution time of the that a linear array is used. computation of the Irregularly distributed sparse matrix can be executed effectively by using the stripe structure.

  • PDF

Kalman-Filter Estimation and Prediction for a Spatial Time Series Model (공간시계열 모형의 칼만필터 추정과 예측)

  • Lee, Sung-Duck;Han, Eun-Hee;Kim, Duck-Ki
    • Communications for Statistical Applications and Methods
    • /
    • v.18 no.1
    • /
    • pp.79-87
    • /
    • 2011
  • A spatial time series model was used for analyzing the method of spatial time series (not the ARIMA model that is popular for analyzing spatial time series) by using chicken pox data which is a highly contagious disease and grid data due to ARIMA not reflecting the spatial processes. Time series model contains a weighting matrix, because that spatial time series model influences the time variation as well as the spatial location. The weighting matrix reflects that the more geographically contiguous region has the higher spatial dependence. It is hypothesized that the weighting matrix gives neighboring areas the same influence in the study of the spatial time series model. Therefore, we try to present the conclusion with a weighting matrix in a way that gives the same weight to existing neighboring areas in the study of the suitability of the STARMA model, spatial time series model and STBL model, in the comparative study of the predictive power for statistical inference, and the results. Furthermore, through the Kalman-Filter method we try to show the superiority of the Kalman-Filter method through a parameter assumption and the processes of prediction.

Implementation and Experiments of Sparse Matrix Data Structure for Heat Conduction Equations

  • Kim, Jae-Gu;Lee, Ju-Hee;Park, Geun-Duk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.12
    • /
    • pp.67-74
    • /
    • 2015
  • The heat conduction equation, a type of a Poisson equation which can be applied in various areas of engineering is calculating its value with the iteration method in general. The equation which had difference discretization of the heat conduction equation is the simultaneous equation, and each line has the characteristic of expressing in sparse matrix of the equivalent number of none-zero elements with neighboring grids. In this paper, we propose a data structure for sparse matrix that can calculate the value faster with less memory use calculate the heat conduction equation. To verify whether the proposed data structure efficiently calculates the value compared to the other sparse matrix representations, we apply the representative iteration method, CG (Conjugate Gradient), and presents experiment results of time consumed to get values, calculation time of each step and relevant time consumption ratio, and memory usage amount. The results of this experiment could be used to estimate main elements of calculating the value of the general heat conduction equation, such as time consumed, the memory usage amount.