• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.755-757
• /
• 1999

The operational properties of BPF(block-pulse functions) are much applied to the analysis of time-varying linear systems. The integral operational matrix of BPF converts the systems in the form of the differential equation into the algebraic problems. But the errors caused by using the integral operational matrix make it difficult that we exactly analyze time-varying linear systems. So, in this paper, to analyze time-varying linear systems we had used the recursive algorithm derived from the new integral operational matrix. And the usefulness of the proposed method is verified by the example.

• Journal of the Korean Society for Precision Engineering
• /
• v.6 no.2
• /
• pp.30-39
• /
• 1989

Variable structure control (VSC) systems control the state vectors using sliding regime (SR) constructed switching logic, switching plane and control law. Saturation function switching logic is used to improve the drawback which occurs in traditional sign function switching logic. Switching plane with time-varying parameter is proposed to improve the drawback which occurs in switching plane with constant parameter and it is suggested the control law which has time-varying parameter. The stability of VSC system controlled by proposed time-varying SR is discussed, and the good control behavior was shown through computer simulation using proposed SR.

• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.4
• /
• pp.255-261
• /
• 2000

This paper presents the results of the robust H(sub)$\infty$ FIR filtering for a class of nonlinear continuous time-varying systems subject to real norm-bounded parameter uncertainty and know Lipschitz nonlinearity under sampled measurements. We address the problem of designing filters, using sampled measurements, which guarantee a prescribed H(sub)$\infty$ performance in continuous time-varying context, irrespective of the parameter uncertainty and unknown initial states. The infinite horizon causal H(sub)$\infty$FIR filter are investigated using the finite moving horizon in terms of two Riccati equations with finite discrete jumps.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.913-916
• /
• 1988

Indirect adaptive pole assignment PID controllers for unknown systems with time varying delay, is proposed. Unknown system parameters are estimated by recursive least square method, and time varying delay is estimated using indirect predictors. Since the order of parameter vectors didn't increase, the computational burden is not largely increased in spite of using indirect adaptive control method with time varying delay estimation. Computer simulation is performed to illustrate the efficiency of the proposed method.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.61-76
• /
• 2002

The robust non-fragile guaranteed cost control problem is studied in this paper for class of uncertain linear large-scale systems with time-varying delays in subsystem interconnections and given quadratic cost functions. The uncertainty in the system is assumed to be norm-hounded arid time-varying. Also, the state-feedback gains for subsystems of the large-scale system are assumed to have norm-bounded controller gain variations. The problem is to design state feedback control laws such that the closed-loop system is asymptotically stable and the closed-loop cost function value is not more than a specified upper bound far all admissible uncertainties. Sufficient conditions for the existence of such controllers are derived based on the linear matrix inequality (LMI) approach combined with the Lyapunov method. A parameterized characterization of the robust non-fragile guaranteed cost contrellers is 7iven in terms of the feasible solution to a certain LMI. Finally, in order to show the application of the proposed method, a numerical example is included.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.3
• /
• pp.307-316
• /
• 2007

In real system application, the interacting multiple model (IMM) based algorithm operates with the following problems: it requires less computing resources as well as a good performance with respect to the various target maneuvering, it requires a robust performance with respect to the time-varying measurement noise, and further, it requires an easy design procedure in terms of its structures and parameters. To solve these problems, an adaptive fuzzy interacting multiple model (AFIMM) algorithm, which is based on the basis sub-models defined by considering the maneuvering property and the time-varying mode transition probabilities designed by using the mode probabilities as the inputs of the fuzzy decision maker whose widths are adjusted, is proposed. To verify the performance of the proposed algorithm, a radar target tracking is performed. Simulation results show that the proposed AFIMM algorithm solves all problems in the real system application of the IMM based algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.78.5-78
• /
• 2002

We propose an evolutionary reinforcement learning (RL) system with time-varying parameters that can deal with a dynamic environment. The proposed system has three characteristics: 1) It can deal easily with a dynamic environment by using time-varying parameters; 2) The division of state space is acquired evolutionarily by genetic algorithm (GA); 3) One does not have to design the rules constructing an agent in advance. So far many RL systems have been proposed. These systems adjust constant or non time-varying parameters; by those systems it is difficult to realize appropriate behavior in complex and dynamic environment. Hence, we propose the RL system whose parameters can vary temporally. T...

• Communications for Statistical Applications and Methods
• /
• v.23 no.4
• /
• pp.335-341
• /
• 2016

Interval censored failure time data often occurs in an observational study where a subject is followed periodically. Instead of observing an exact failure time, two inspection times that include it are made available. Several methods have been suggested to analyze interval censored failure time data (Sun, 2006). In this article, we are concerned with a binary time-varying covariate whose changing time is interval censored. A modified estimating equation is proposed by extending the approach suggested in the presence of a missing covariate. Based on simulation results, the proposed method shows a better performance than other simple imputation methods. ACTG 181 dataset were analyzed as a real example.

• Journal of IKEEE
• /
• v.18 no.3
• /
• pp.403-408
• /
• 2014

In this paper, we propose a rasterizer architecture using varying interpolator which process several pixels at a time. Proposed rasterizer is able to handle 16 pixel at a time and output the color of up to 64. It can reduce the redundancy of calculation by configuring a matrix transformation and matrix calculation for rasterization, and it can enhance the speed of rasterizer by increasing the reusability. As a result, proposed rasterizer has improve 11% in color interpolation, 17% in the processing speed of the rasterizer by comparing with conventional research.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.121-129
• /
• 2012

In this paper, we consider a source node that operates over a time varying channel with energy harvesting capability. The goal of the source is to maximize the average number of successfully delivered packets per time slot. The source is able to choose whether to transmit a packet or defer the transmission in each time slot. The decision which is chosen by the source depends on the channel information available and the length of the energy queue. We formulate the problem of finding the optimal policy as a Markovian decision problem. We show some properties of the value function that represents the discounted number of successfully delivered packets per time slot. We prove that the optimal policy is a threshold type policy depending on the state of the channel and the length of the energy queue. We also derive an upper bound for the average number of packets per time slots successfully received by the destination. We show using numerical results that this bound is a tight bound on the performance of the optimal policy. And we consider the case of time varying channel but without channel state information (CSI). Then, we study the impact of channel time varying nature and the availability of CSI. In this case, we show that the optimal policy is a greedy policy. The performance of this greedy policy is also calculated.