• Proceedings of the KIEE Conference
• /
• 1994.11a
• /
• pp.322-325
• /
• 1994

Mareel and Bitmead proved the presence of chaotic signal in random noise by applying dead beat control theory to adaptive mechanism. In this paper robust adaptive theory is proposed. With the property of chaotic signal that has order and law, the proposed theory can enhance the control Performance by applying the recursive algorithm that uses dynamic relation which have small correlation. The performance of proposed algorithm is demonstrated with the computer simulation of position control of electric motor. In this simulation, the adaptive low is adopted to control electric motor and the Presence of chaotic signal in feedback signal is proved by using several method such as time series, fourier spectrum phase portrait method.

• Journal of Korean Society of Transportation
• /
• v.24 no.4 s.90
• /
• pp.149-159
• /
• 2006

Traditional trip tables are estimated through large-scale surveys such as household survey, roadside interviews, and license Plate matching. These methods are, however, expensive and time consuming. This paper presents two origin-destination (OD) trip matrix estimation methods from link traffic counts in stochastic assignment, which contains perceived errors of drivers for alternatives. The methods are formulated based on the relation between link flows and OD demands in logit formula. The first method can be expressed to minimize the difference between observed link flows and estimated flows, derived from traffic assignment and be solved by gradient method. The second method can be formulated based on dynamic process, which nay describe the daily movement patterns of drivers and be solved by a recursive equation. A numerical example is used for assessing the methods, and shows the performances and properties of the models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.3
• /
• pp.239-246
• /
• 2014

In the context of wireless sensor networks, one of major issues is energy conservation. For low power communication, by utilizing our experimental results for the relation between clock drift and synchronization interval, we designed a new protocol which can support a wide range of duty cycles for applications with very low traffic rate and insensitive delay. The transmission (TX) node in the protocol synchronizes with the reception (RX) node very before transmitting a packet, and it can adaptively estimate the synchronization error size according to the synchronization interval from minutes to hours. We conducted simulations and a testbed implementation to show the efficacy of the proposed protocol. We found that our protocol substantially outperforms other state-of-the-art protocols, resulting in order-of-magnitude increase in network lifetime over a variety of duty cycles.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.4
• /
• pp.1447-1454
• /
• 2013

In this study, we developed the equation of ship wave crests in intermediate as well as deep waters by extending Kelvin's (1887) theory using the recursive relation for the dispersion relation. The present equation can be applied for varying water depth as well as constant water depth. Using FLOW-3D we conducted numerical experiments to verify analytical prediction. The ship wave crest patterns became asymmetric on a plane slope when the ship propagates alongshore direction. That is, in shallower side, wave crests tend to be parallel to the coastline due to refraction and, in deeper side, wave crests tend to be orthogonal due to reverse refraction.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.75-83
• /
• 1999

recently, a new hypercube-like interconnection network, the Z-cube, was proposed. The Z-cube retains most good topological properties, however, its node degree is 3/4 of hypercube's one. Considering hardware implementations, the Z-cube is a good alternative to the hypercube. In this paper, we obtained the diameter, fault diameter and the average distance between two nodes to evaluate the communication performance of the Z-cube. The recursive structure, the shortest path between two nodes I Z-cube and recurrence relation on the average distance were deduced, and node disjoint path was introduced. Although it is generally expected that the communication performance in an interconnection network with reduced node degree falls as much as that, this paper shows that the Z-cube's diameter is the same as the hypercube's one and the average distance between two nodes in Z-cube is about 1.125 times the average distance between two nodes in the hypercube and the fault diameter of Z-cube ranges approximately from 1.4times to 1.7times the fault diameter of the hypercube.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.2
• /
• pp.331-346
• /
• 2009

Let ${\alpha}$ = (${\alpha}_1,\;{\alpha}_2$,...) and ${\beta}$ = (${\beta}_1,\;{\beta}_2$,...) be two sequences with ${\alpha}_1$ = ${\beta}_1$ and k and n be natural numbers. We denote by $A^{(k,{\pm})}_{{\alpha},{\beta}}(n)$ the matrix of order n with coefficients ${\alpha}_{i,j}$ by setting ${\alpha}_{1,i}$ = ${\alpha}_i,\;{\alpha}_{i,1}$ = ${\beta}_i$ for 1 ${\leq}$ i ${\leq}$ n and $${\alpha}_{i,j}=\{{\alpha}_{i-1,j-1}+{\alpha}_{i-1,j}\;if\;j{\equiv}$$2,3,4,..., k + 1 (mod 2k) $$\{{\alpha}_{i-1,j-1}-{\alpha}_{i-1,j}\;if\;j{\equiv}$$ k + 2,..., 2k + 1 (mod 2k) for 2 ${\leq}$ i, j ${\leq}$ n. The aim of this paper is to study the determinants of such matrices related to certain sequence ${\alpha}$ and ${\beta}$ and some natural numbers k.

• The Korean Journal of Applied Statistics
• /
• v.21 no.5
• /
• pp.727-738
• /
• 2008

If a cointegrating relation is affected by important economic and political events occurred in the sample period, the assumption of the time-invariant cointegrating vector is violated, which leads to the misrep-resentation of the actual relations between the variables. From such a viewpoint, this study utilizes the recursive estimation process in testing for the stability of the long-run equilibrium of the domestic stock market system and then attempts to develop the framework for stabilizing time-variant cointegraing relations by introducing the dummy variables where the structural changes are found to exist.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.248-251
• /
• 1999

We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-1, we may compute the updated estimate of this vector at i(oration n upon the arrival of new data. The RLS algorithm may be viewed as a special case of the Kalman filter. Indeed this special relationship between the RLS algorithm and the Kalman filter is considered. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. The resulting rate of convergence is therefore typically an order of magnitude faster than the simple LMS algorithm. This improvement in performance, however, Is achieved at the expensive of a large increase in computational complexity.

• Journal of Auto-vehicle Safety Association
• /
• v.13 no.1
• /
• pp.14-25
• /
• 2021

This paper presents a RLS based adaptive sliding mode observer (A-SMO) for unknown fault reconstruction in longitudinal autonomous driving. Securing the functional safety of autonomous vehicles from unexpected faults of sensors is essential for avoidance of fatal accidents. Because the magnitude and type of the faults cannot be known exactly, the RLS based A-SMO for unknown acceleration fault reconstruction has been designed with relationship function in this study. It is assumed that longitudinal acceleration of preceding vehicle can be obtained by using the V2V (Vehicle to Vehicle) communication. The kinematic model that represents relative relation between subject and preceding vehicles has been used for fault reconstruction. In order to reconstruct fault signal in acceleration, the magnitude of the injection term has been adjusted by adaptation rule designed based on MIT rule. The proposed A-SMO in this study was developed in Matlab/Simulink environment. Performance evaluation has been conducted using the commercial software (CarMaker) with car-following scenario and evaluation results show that maximum reconstruction error ratios exist within range of ±10%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.830-841
• /
• 2000

We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-1, we may compute the updated estimate of this vector at iteration a upon the arrival of new data. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. In this paper, we propose new tap weight updated RLS algorithm in adaptive transversal filter with data-recycling buffer structure. We prove that convergence speed of learning curve of RLS algorithm with data-recycling buffer is faster than it of exiting RL algorithm to mean square error versus iteration number. Also the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired sample is portion to increase to converge the specified value from the three dimension simulation result of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of convergence character in performance, is achieved at the (B+1)times of convergence speed of mean square error increase in data recycle buffer number with new proposed RLS algorithm.