• Journal of Sensor Science and Technology
• /
• v.28 no.4
• /
• pp.216-220
• /
• 2019

In this paper, we propose a finite memory filter (estimator) for discrete-time stochastic linear systems with delays in state and measurement. A novel filtering algorithm is designed based on finite memory strategies, to achieve high estimation accuracy and stability under parametric uncertainties. The new finite memory filter uses a set of recent observations with appropriately chosen initial horizon conditions. The key contribution is the derivation of Lyapunov-like equations for finite memory mean and covariance of system state with an arbitrary number of time delays. A numerical example demonstrates that the proposed algorithm is more robust and accurate than the Kalman filter against dynamic model uncertainties.

• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.603-618
• /
• 2022

In this paper, a numerical solution of the generalized diffusion equation with a delay has been obtained by a numerical technique based on the Galerkin finite element method by applying the cubic B-spline basis functions. The time discretization process is carried out using the forward Euler method. The numerical scheme is required to preserve the delay-independent asymptotic stability with an additional restriction on time and spatial step sizes. Both the theoretical and computational rates of convergence of the numerical method have been examined and found to be in agreement. As it can be observed from the numerical results given in tables and graphs, the proposed method approximates the exact solution very well. The accuracy of the numerical scheme is confirmed by computing L₂ and L_∞ error norms.

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.2
• /
• pp.273-283
• /
• 2000

In this paper we consider two delay equations with in-finite delay. We will give two sufficient conditions for the positive and zero equilibriums of these equations to be a global attractor respectively.

• ETRI Journal
• /
• v.18 no.3
• /
• pp.127-145
• /
• 1996

A new analytic framework based on a linear algebra approach is proposed for examining the performance of a direct sequence spread spectrum (DS/SS) slotted ALOHA wireless communication network systems with delay capture. The discrete-time Markov chain model has been introduced to account for the effect of randomized time of arrival (TOA) at the central receiver and determine the evolution of the finite population network performance in a single-hop environment. The proposed linear algebra approach applied to the given Markov problem requires only computing the eigenvector ${\prod}$ of the state transition matrix and then normalizing it to have the sum of its entries equal to 1. MATLAB computation results show that systems employing discrete TOA randomization and delay capture significantly improves throughput-delay performance and the employed analysis approach is quite easily and staightforwardly applicable to the current analysis problem.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.4
• /
• pp.1-14
• /
• 2020

Recently, M/G/1 priority queues with a finite buffer for high-priority customers and an infinite buffer for low-priority customers have applied to the analysis of communication systems with two heterogeneous traffics : delay-sensitive traffic and loss-sensitive traffic. However, these studies are limited to M/G/1 priority queues with finite and infinite buffers under a work-conserving priority discipline such as the nonpreemptive or preemptive resume priority discipline. In many situations, if a service is preempted, then the preempted service should be completely repeated when the server is available for it. This study extends the previous studies to M/G/1 priority queues with finite and infinite buffers under the preemptive repeat-different and preemptive repeat-identical priority disciplines. We derive the loss probability of high-priority customers and the waiting time distributions of high- and low-priority customers. In order to do this, we utilize the delay cycle analysis of finite-buffer M/G/1/K queues, which has been recently developed for the analysis of M/G/1 priority queues with finite and infinite buffers, and combine it with the analysis of the service time structure of a low-priority customer for the preemptive-repeat and preemptive-identical priority disciplines. We also present numerical examples to explore the impact of the size of the finite buffer and the arrival rates and service distributions of both classes on the system performance for various preemptive priority disciplines.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.6
• /
• pp.1035-1046
• /
• 2002

Time Delay Control(TDC) is a robust nonlinear control scheme using Time Delay Estimation(TDE) and also has a simple structure. To apply TDC to a real system, we must design Time Delay Controller to guarantee stability. The earlier research stated sufficient stability condition of TDC for general plants. In that research, it was assumed that time delay is infinitely small. But, it is impossible to implement infinitely small time delay in a real system. So, in this research we propose a new sufficient stability condition of TDC for general plants with finite time delay. And the simulation results indicate that the previous sufficient stability condition does not work even for small time delay, while our proposed condition works well.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.5
• /
• pp.961-965
• /
• 2010

A reduced order observer with finite time convergence characteristics is proposed for linear time invariant systems. The proposed finite time reduced order observer(FTROO) is a dual observer scheme in which two reduced order Luenberger observers with asymptotic convergence characteristics and a finite time delay element are employed. The FTROO can be constructed so as to converge in the designer specified finite time independent of the eigenvalues of the reduced order observers. A numerical example is given to show the finite-time convergence characteristics of the proposed FTROO.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.27.2-27
• /
• 2001

This paper proposes a receding horizon predictive control (RHPC) for nonlinear time-delay systems. The control law is obtained by minimizing finite horizon cost with a terminal weighting functional. An inequality condition on the terminal weighting functional is presented, under which the closed-loop stability of RHPC is guaranteed, A special class of nonlinear time-delay systems is introduced and a systematic method to find a terminal weighting functional satisfying the proposed inequality condition is given for these systems. Through a simulation example, it is demonstrated that the proposed RHPC has the guaranteed closed-loop stability for nonlinear time-delay systems.

• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.3
• /
• pp.221-234
• /
• 2021

We introduce high-order Hopfield neural networks with Leakage delays. Furthermore, we study the uniqueness and existence of Hopfield artificial neural networks having the weighted pseudo almost periodic forcing terms on finite delay. Our analysis is based on the differential inequality techniques and the Banach contraction mapping principle.

• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.507-513
• /
• 2022

In this paper, we investigate some results on complex delay-differential equations of the classical Malmquist theorem. A classic illustrations of their results states us that if a complex delay equation w(t + 1) + w(t - 1) = R(t, w) with R(t, w) rational in both arguments admits (concede) a transcendental meromorphic solution of finite order, then deg_wR(t, w) ≤ 2. Development and upgrade of such results are presented in this paper. In addition, Borel exceptional zeros and poles seem to appear in special situations.