• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.11
• /
• pp.96-105
• /
• 1998

The effects of time-sampling to be considered in digital implementation of a nonlinear output regulator is investigated. It is found that the output regulatability of nonlinear systems is generally not robust with respect to time-sampling although the output regulatedness of nonlinear systems is preserved under time-sampling. Also, a certain class of nonlinear systems is clarified for which the preservation of the output regulatability under time-sampling can be decided without difficulty. These results imply that one needs to seek a better approximate sampled-data nonlinear output regulator since a digital output regulator resulting from discretizing the continuous-time nonlinear output regulator designed based on the underlying continuous-time nonlinear system model is nothing but a 1st order approximate one with respect to sampling-time.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2480-2482
• /
• 2005

This paper presents a complete solution to intelligent digital redesign problem (IDR) for sampled-data fuzzy systems. The IDR problem is the problem of designing a sampled-data state feedback controller such that the sampled-data fuzzy system is equivalent to the continuous-time fuzzy system in the sense of the state matching. Its solution is simply obtained by linear transformation. Under the proposed sampled-data controller, the states of the discrete-time model of the sampled-data fuzzy system completely matches the state of the discrete-time model of the closed-loop continuous-time fuzzy systems are completely matched at every sampling points.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.496-498
• /
• 2005

This paper presents intelligent digital redesign method of global approach for hybrid state space fuzzy-model-based controllers. For effectiveness and stabilization of continuous-time uncertain nonlinear systems under discrete-time controller, Takagi-Sugeno(TS) fuzzy model is used to represent the complex system. And global approach design problems viewed as a convex optimization problem that we minimize the error of the norm bounds between nonlinearly interpolated linear operators to be matched. Also by using the power series, we analyzed nonlinear system's uncertain parts more precisely. When a sampling period is sufficiently small, the conversion of a continuous-time structured uncertain nonlinear system to an equivalent discrete-time system have proper reason. Sufficiently conditions for the global state-matching of the digitally controlled system are formulated in terms of linear matrix inequalities (LMIs).

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

In this paper, we find the necessary and sufficient conditions of linearization of nonlinear discrete-time systems with 2 inputs using the restricted class of dynamic feedback. That is, this paper is the discrete version of [2]. The results we obtain for discrete-time nonlinear systems are, however, quite different from that of continuous-time case.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.581-585
• /
• 1992

A unified approach to continuous and discrete-time Nehari problems, based on recently developed results by the authors for the one-block and Hankel-norm model reduction problems, is proposed. First, we derive discrete-time solutions in delta domain where numerical error is small and then we show that the derived form becomes same as the continuous form when the sampling interval approaches to zero.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1726-1729
• /
• 1997

In general, the solvability of linear robust output regulation problem are not preserved under time-sampling. Thus, it is found that the digital regulator implemented by itme-sampling of anlog output regulator designed based on the continuous-time linear system model is nothing but a 1st order approximation with respect to time-sampling. By the way, one can design an improved sampled-data regulator with respect to sampling time by utilizing the intrinsic structure of the system. In this paper, we study the system structures which it is possible to design an improved sampled-data regulator with respect to sampling time.

• Restorative Dentistry and Endodontics
• /
• v.45 no.2
• /
• pp.22.1-22.10
• /
• 2020

Objectives: This study investigated the influence of glide path size and operating kinetics on the time to reach the working length and the fracture resistance of Twisted File (TF) and Endostar E3 files. Materials and Methods: A total of 120 mandibular single-rooted premolars were selected. Two methods of kinetic motion (TF adaptive and continuous rotary motion) and file systems (TF and Endostar E3) were employed. The files were used in root canals prepared to apical glide path sizes of 15, 20, and 25. The time taken to reach the working length and the number of canals used before the instrument deformed or fractured were noted. Fractured instruments were examined with scanning electron microscopy. Results: The TF system took significantly more time to reach the working length than the Endostar E3 system. Both systems required significantly more time to reach the working length at the size 15 glide path than at sizes 20 and 25. A greater number of TFs than Endostar E3 files exhibited deformation, and a higher incidence of instrument deformation was observed in adaptive than in continuous rotary motion; more deformation was also observed with the size 15 glide path. One TF was fractured while undergoing adaptive motion. Conclusions: No significant difference was observed between continuous rotary and adaptive motion. The TF system and adaptive motion were associated with a higher incidence of deformation and fracture. Apical glide path sizes of 20 and 25 required significantly less time to reach the working length than size 15.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.11a
• /
• pp.142-149
• /
• 2000

Most of supply chain simulation models have been developed on the basis of discrete-event simulation. Since supply chain systems are neither completely discrete nor continuous, the need of constructing a model with aspects of both discrete-event simulation and continuous is provoked, resulting in a combined discrete-continuous simulation. Continuous simulation concerns the modeling over time of a system by a representation in which the state variables change continuously with respect to time. In this paper, an architecture of combined modeling for supply chain simulation is proposed, which presents the equation of continuous part in supply chain and how these equations are used supply chain simulation models. A simple supply chain model is demonstrated the possibility and the capability of this approach.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.365-368
• /
• 1992

This paper presents an approach to the design of real time task scheduling for a line controller of continuous manufacturing process automation. The line controller has multiprocessor-based architecture with shared memory and is operated by firmware. This firmware contains menu-driven software supporting real-time database management and fuction-block control language. The multitasking line control processor performs the following three functions: 1) interprets the function block control language by virtue of shared memory in the database; 2) invokes an interupt service routine as required by external hardware; 3) detects errors and notifies the user. We propose real time task scheduling method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.2
• /
• pp.206-211
• /
• 2011

In this paper, the evolutionary algorithm was specifically formulated for optimization with continuous parameter space. The proposal was motivated by the fact that the genetic algorithms have been most intensively reported for parameter identification problems with continuous search space. The difference of primary characteristics between genetic algorithms and the proposed algorithm, discrete or continuous individual representation has made different areas to which the algorithms should be applied. Results obtained by optimization of some well-known test functions indicate that the proposed algorithm is superior to genetic algorithms in all the performance, computation time and memory usage for continuous search space problems.