• International Journal of Control, Automation, and Systems
• /
• v.5 no.5
• /
• pp.479-491
• /
• 2007

This paper presents a new adaptive observer design method for a class of uncertain nonlinear systems by using spline approximation. This scheme leads to a simplified observer structure which requires only fixed number of integrations, regardless of the number of parameters to be estimated. This benefit can reduce the number of integrations of the observer filter dramatically. Moreover, the proposed adaptive observer automatically generates the required spline elements according to the varying output value and, as a result, does not requires the pre-knowledge of upper and lower bounds of the output. This is another benefit of our approach since the requirement for known output bounds have been one of the main drawbacks of practical universal approximation problems. Both of the benefits stem from the local support property, which is specific to splines.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.15-24
• /
• 2009

Compressed sensing addresses the recovery of a sparse vector from its few linear measurements. Recently, the success for the vector case has been extended to the matrix case. Compressed sensing of low-rank matrices solves the ill-posed inverse problem with fie low-rank prior. The problem can be formulated as either the rank minimization or the low-rank approximation. In this paper, we survey recently proposed efficient algorithms to solve these two formulations.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.13 no.2
• /
• pp.152-156
• /
• 2013

This paper presents a fast-lock dual-loop successive approximation register-controlled duty-cycle corrector (SARDCC) circuit using a mixed (binary+sequential) search algorithm. A wider duty-cycle correction range, higher operating frequency, and higher duty-cycle correction accuracy have been achieved by utilizing the dual-loop architecture and the binary search SAR that achieves the fast duty-cycle correcting property. By transforming the binary search SAR into a sequential search counter after the first DCC lock-in, the proposed dual-loop SARDCC keeps the closed-loop characteristic and tracks variations in process, voltage, and temperature (PVT). The measured duty cycle error is less than ${\pm}0.86%$ for a wide input duty-cycle range of 15-85 % over a wide frequency range of 0.5-2.0 GHz. The proposed dual-loop SARDCC is fabricated in a 0.18-${\mu}m$, 1.8-V CMOS process and occupies an active area of $0.075mm^2$.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.683-685
• /
• 1999

As a method of obtaining pulse transfer function. transfer function of discrete-time from input-output data, there are method of obtaining unknown parameter of pulse transfer function from estimated impulse response before(1-3). There is no need to approximate to several meanings because of not being established algebraical relations between impulse response for estimation error and parameter of transfer function exactly. In this paper, I inquire the method[4] of obtaining the optimal pulse transfer function as a meaning of Hankel norm approximation from impulse response data and examine estimated property as computer simulation from this method.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.807-816
• /
• 2007

For the stochastic differential inclusion on infinite dimensional space of the form $dX_t{\in}\sigma(X_t)dW_t+b(X_t)dt$, where ${\sigma}$, b are set-valued maps, W is an infinite dimensional Hilbert space valued Q-Wiener process, we prove the boundedness and continuity of solutions under the assumption that ${\sigma}$ and b are closed convex set-valued satisfying the Lipschitz property using approximation.

• East Asian mathematical journal
• /
• v.24 no.1
• /
• pp.57-65
• /
• 2008

The approximate solvability of a generalized system for non-linear variational inequality in Hilbert spaces was studied, based on the convergence of projection methods. But little research was done in Banach space. The primary reason was that projection mapping lacked preferably property in Banach space. In this paper, we introduced the generalized projection methods. By using these methods, the results presented in this paper extended the main results of S. S. Chang [3] from Hilbert spaces to Banach space.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.3
• /
• pp.781-802
• /
• 2020

For a fixed semi-Wakamatsu-tilting module _AT, we generalize the concepts of Auslander class, Bass class, and investigate many homological properties of such classes. Moreover, we establish an equivalence between the class of ∞-T-cotorsionfree modules and a subclass of the class of T-adstatic modules. Finally, a similar version of Auslander-Bridger approximation theorem and a nice property of relative cotranspose are obtained.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.1
• /
• pp.1-15
• /
• 1999

Gradient recovery techniques for the second order elliptic boundary value problem are well known. In particular, the Midpoint and the Vertex Recovery Operator have been studied by various authors and under suitable assumptions on the regularity of the unknown solution superconvergence property of these recovered gradients have been proved. In this paper we extend these results to the recovered gradient of the finite element approximation to a model initial-boundary value problem, and go on to prove superconvergence result for this recovered gradient in a discrete (in time) error norm.

• Journal of applied mathematics & informatics
• /
• v.2 no.2
• /
• pp.21-46
• /
• 1995

Congestion and memory occupancy in computer system may be reduced further if new jobs are admitted only when the num-ber of jobs queued at CPU is below CPU run queue cutoff (RQ). In this paper we prove that response time of a job is invariant with respect to RQ if jobs do not communicate each other. We also demonstrate this invariance property numerically using marix-geometric methods and present an approximate method for the delay due to context switch-ing under time slicing. The approximation suggests that time slicing with constant overhead yields a throughput similar to an FCFS system without overhead.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.5
• /
• pp.27-34
• /
• 1998

This paper is on the discrete model reduction method over disc-type analytic domains. We define hankel singular value over the disc that is mapped by standard bilinear mapping. And the generalized singular perturbation approximation and the direct truncation are generalized to GSPA and DT over a disc. Furthermore, it is shown that the reduced order model over a smaller domaing has a smaller .inf.-norm error bound. And the poposed reduction method is used to obtain the regional pole placement property.