• Title/Summary/Keyword: Linear Space Algorithm

Search Result 324, Processing Time 0.029 seconds

Linear-time algorithms for computing a maximal increasing subsequence (극대 증가 부분서열을 찾는 선형 알고리즘)

  • Joong Chae Na
    • Smart Media Journal
    • /
    • v.12 no.6
    • /
    • pp.9-14
    • /
    • 2023
  • The longest increasing subsequence is a fundamental problem which has been studied for a long time in computer science. In this paper, we consider the maximal increasing subsequence problem where the constraint is released from the longest to the maximal. For two kinds of increasing (monotone increasing and strictly increasing), we propose linear-time algorithms computing a maximal increasing subsequence of an input sequence from an alphabet Σ. Our algorithm for computing a maximal monotone increasing subsequence requires O(1) space and our algorithm for computing a maximal strictly increasing subsequence requires O(|Σ|) space.

Identification of Linear Model for Tandem Cold Mill Considering Interstand Interference (스탠드간 간섭현상을 고려한 연속 냉간압연기의 선형모델 규명)

  • Kim, In-Soo;Chang, Yu-Shin;Hwang, I-Cheol;Joo, Hyo-Nam;Lee, Man-Hyung
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.8
    • /
    • pp.78-86
    • /
    • 2000
  • This study identified a linear time-invariant mathematical model of each stand of a five-stand tandem cold mill. Two model identification methods are applied to construct a linear model of each stand of the tandem cold mill. For the model identification the input-output data that have interstand interference property in tandem cold rolling are obtained from a nonlinear simulator of the tandem cold mill. And a linear model of each stand is identified with N4SD(numerical algorithms for subspace state space system identification) method based on a state-space model and Least Square algorithm based on a transfer function. Furthermore a modeling error of the tandem cold mill is quantitatively analyzed from a maximum singular value plot of error function between an identified nominal model and uncertain model. In conclusion the comparison of the output signals between the existing Taylor linearized model the identified linear model and the nonlinear model of the tandem cold mill shows the accuracy and the applicability of the proposed identified model.

  • PDF

Development of 3D Mapping Algorithm with Non Linear Curve Fitting Method in Dynamic Contrast Enhanced MRI

  • Yoon Seong-Ik;Jahng Geon-Ho;Khang Hyun-Soo;Kim Young-Joo;Choe Bo-Young
    • Journal of the Korean Magnetic Resonance Society
    • /
    • v.9 no.2
    • /
    • pp.93-102
    • /
    • 2005
  • Purpose: To develop an advanced non-linear curve fitting (NLCF) algorithm for dynamic susceptibility contrast study of brain. Materials and Methods: The first pass effects give rise to spuriously high estimates of $K^{trans}$ in voxels with large vascular components. An explicit threshold value has been used to reject voxels. Results: By using this non-linear curve fitting algorithm, the blood perfusion and the volume estimation were accurately evaluated in T2*-weighted dynamic contrast enhanced (DCE)-MR images. From the recalculated each parameters, perfusion weighted image were outlined by using modified non-linear curve fitting algorithm. This results were improved estimation of T2*-weighted dynamic series. Conclusion: The present study demonstrated an improvement of an estimation of kinetic parameters from dynamic contrast-enhanced (DCE) T2*-weighted magnetic resonance imaging data, using contrast agents. The advanced kinetic models include the relation of volume transfer constant $K^{trans}\;(min^{-1})$ and the volume of extravascular extracellular space (EES) per unit volume of tissue $\nu_e$.

  • PDF

Design of nonlinear optimal regulators using lower dimensional riemannian geometric models

  • Izawa, Yoshiaki;Hakomori, Kyojiro
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.628-633
    • /
    • 1994
  • A new Riemannian geometric model for the controlled plant is proposed by imbedding the control vector space in the state space, so as to reduce the dimension of the model. This geometric model is derived by replacing the orthogonal straight coordinate axes on the state space of a linear system with the curvilinear coordinate axes. Therefore the integral manifold of the geometric model becomes homeomorphic to that of fictitious linear system. For the lower dimensional Riemannian geometric model, a nonlinear optimal regulator with a quadratic form performance index which contains the Riemannian metric tensor is designed. Since the integral manifold of the nonlinear regulator is determined to be homeomorphic to that of the linear regulator, it is expected that the basic properties of the linear regulator such as feedback structure, stability and robustness are to be reflected in those of the nonlinear regulator. To apply the above regulator theory to a real nonlinear plant, it is discussed how to distort the curvilinear coordinate axes on which a nonlinear plant behaves as a linear system. Consequently, a partial differential equation with respect to the homeomorphism is derived. Finally, the computational algorithm for the nonlinear optimal regulator is discussed and a numerical example is shown.

  • PDF

An Orbit Robust Control Based on Linear Matrix Inequalities

  • Prieto, D.;Bona, B.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.454-459
    • /
    • 2004
  • This paper considers the problem of satellite's orbit control and a solution based in Linear Matrix Inequalities (LMI) is proposed for the case of Low Earth Orbiters (LEO). In particular, the modelling procedure and the algorithm for control law synthesis are tested using as study case the European Gravity Field and Ocean Circulation Explorer satellite (GOCE), to be launched by the European Space Agency (ESA) in the year 2006. The scientific objective of this space mission is the recovering of the Earth gravity field with high accuracy (less than 10${\mu}m$/${\mu}m$) and spatial resolution (better than 100km). In order to meet these scientific requirements, the orbit control must guarantee stringent specifications in terms of environmental disturbances attenuation (atmospheric drag forces) even in presence of high levels of model uncertainty.

  • PDF

An Exact Splitting Algorithm for a 4-Class-Based Dedicated Linear Storage Problem

  • Yang, Moon-Hee;Choi, Chang-Hwan;Kim, Hee
    • Management Science and Financial Engineering
    • /
    • v.17 no.2
    • /
    • pp.23-37
    • /
    • 2011
  • In this paper, we address a layout design problem for determining an optimal 4-class-based dedicated linear storage layout in a class of unit load storage systems. Assuming that space requirement for a class is the sum of the maximum inventory levels of products assigned to the class, and that one-way travel time is a linear function of storage index, we formulate a 4-class-based dedicated linear storage problem PTL[4] and provide an exact splitting algorithm with $O(n{\lceil}logn{\rceil})$. Our algorithms could be applied to more than a 4-class-based dedicated storage layout problem with slight modification in order to reduce computational execution time.

Improved Dynamic Programming in Local Linear Approximation Based on a Template in a Lightweight ECG Signal-Processing Edge Device

  • Lee, Seungmin;Park, Daejin
    • Journal of Information Processing Systems
    • /
    • v.18 no.1
    • /
    • pp.97-114
    • /
    • 2022
  • Interest is increasing in electrocardiogram (ECG) signal analysis for embedded devices, creating the need to develop an algorithm suitable for a low-power, low-memory embedded device. Linear approximation of the ECG signal facilitates the detection of fiducial points by expressing the signal as a small number of vertices. However, dynamic programming, a global optimization method used for linear approximation, has the disadvantage of high complexity using memoization. In this paper, the calculation area and memory usage are improved using a linear approximated template. The proposed algorithm reduces the calculation area required for dynamic programming through local optimization around the vertices of the template. In addition, it minimizes the storage space required by expressing the time information using the error from the vertices of the template, which is more compact than the time difference between vertices. When the length of the signal is L, the number of vertices is N, and the margin tolerance is M, the spatial complexity improves from O(NL) to O(NM). In our experiment, the linear approximation processing time was 12.45 times faster, from 18.18 ms to 1.46 ms on average, for each beat. The quality distribution of the percentage root mean square difference confirms that the proposed algorithm is a stable approximation.

A Study on the Parameter Estimation Algorithm for Nonlinear Systems (비선형 시스템의 계수추정 알고리즘 연구)

  • Lee, Dal-Ho;Seong, Sang-Man
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.7
    • /
    • pp.898-902
    • /
    • 1999
  • In this paper, we proposed an algorithm for estimating parameters of nonlinear continuous-discrete state-space system. This algorithm uses the conventional extended Kalman filter(EKF) for estimating state variables, and modifies the recursive prediction error method for parameter estimation of the nonlinear system. Simulation results for both linear and nonlinear measurements under the environment of process and measurement noises show a convincing performance of the proposed algorithm.

  • PDF

On the Visual Representation of Linear Programming Problem by a Projection Method (투영법에 의한 성형계획문제의 시각적 표현에 관하여)

  • 김우제;박순달
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.18 no.3
    • /
    • pp.101-111
    • /
    • 1993
  • The purpose of this paper is to show the graphic representation of a linear programming problem by a projection method. First, we develop a projection method which conserves the optimality in the projected space, and next we introduce an algorithm to visualize the feasible solution set and the solution process by the projection method. Finally, we give an example to represent a 4-dimensional linear programming problem graphically.

  • PDF

Study on the Optimal Selection of Rotor Track and Balance Parameters using Non-linear Response Models and Genetic Algorithm (로터 트랙 발란스(RTB) 파라미터 최적화를 위한 비선형 모델링 및 GA 기법 적용 연구)

  • Lee, Seong Han;Kim, Chang Joo;Jung, Sung Nam;Yu, Young Hyun;Kim, Oe Cheul
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.44 no.11
    • /
    • pp.989-996
    • /
    • 2016
  • This paper intends to develop the rotor track and balance (RTB) algorithm using the nonlinear RTB models and a real-coded hybrid genetic algorithm. The RTB response data computed using the trim solutions with variation of the adjustment parameters have been used to build nonlinear RTB models based on the quadratic interpolation functions. Nonlinear programming problems to minimize the track deviations and the airframe vibration responses have been formulated to find optimum settings of balance weights, trim-tab deflections, and pitch-link lengths of each blade. The results are efficiently resolved using the real-coded genetic algorithm hybridized with the particle swarm optimization techniques for convergence acceleration. The nonlinear RTB models and the optimized RTB parameters have been compared with those computed using the linear models to validate the proposed techniques. The results showed that the nonlinear models lead to more accurate models and reduced RTB responses than the linear counterpart.