• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.1 no.1
• /
• pp.29-34
• /
• 2001

This paper is devoted to investigating direct adaptive neural control of nonlinear systems with uncertain or unknown dynamic models. In the direct adaptive neural networks control area, theoretical issues of the existing backpropagation-based adaptive neural networks control schemes. The major contribution is proposing the variable index control approach, which is of great significance in the control field, and applying it to derive new stable robust adaptive neural network control schemes. This new schemes possess inherent robustness to system model uncertainty, which is not required to satisfy any matching condition. To demonstrate the feasibility of the proposed leaning algorithms and direct adaptive neural networks control schemes, intensive computer simulations were conducted based on the flexible joint robot systems and functions.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.3-8
• /
• 2013

We consider some adaptive iteration schemes that provide lower complexity of the iterative receiver by reducing unnecessary iterations. While conventional iterative receiver considers only fixed number of iterations, we apply adaptive iteration schemes, taking into account quality of the received frame. Based on simulation results, proposed schemes reduce average number of iterations while maintaining BER performance compared to the conventional scheme.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.1
• /
• pp.1-9
• /
• 1989

The convergence analysis of adavtive control schemes has been studied over the past decades, but the importance of structure to fast conversgece of adaptive control systems is still a controversial issue. This paper deals with the relative improvement of the exponential rate of convergence in adaptive error models. The Lyapunov's direct method is applied to adaptive control systems in order to improve the convergence rate by modifying the feedback structure of the error systems. Some simulation examples are illustrated to show fast convergence and robustness of these schemes.

• Journal of the Korean Statistical Society
• /
• v.27 no.3
• /
• pp.265-278
• /
• 1998

In this paper, we suggest two-phase adaptive cluster sampling schemes. The main feature of the two-phase sampling is that the information collected in the first phase sample is utilized in the selection of the second phase sample. The conventional two-phase sampling is, however, not sufficient to increase efficiency when the population of interest is rare and clustered. In the proposed sampling scheme, the first phase sample is selected with adaptive cluster sampling procedure and the second phase sample is selected by PPSWR and $\pi$PS sampling. We investigate unbiased estimators of population total and their variance for the proposed sampling schemes respectively. Finally we compare these suggested sampling schemes using numerical examples .

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.333-338
• /
• 1990

Most verification of improvements for adaptive control schemes are. dependent on computer simulations, but these computer simulations have much limitation, because (if complex actual conditions of system. This paper is concerned with the constructions of a thermal process system for experiments with various control schemes. This thermal process system is composed of a water tank, PC-XT, AD/DA converters power supply and thermal sensors. We estimate. the algorithms of pole-assignment adaptive control in the manifold disturbances and environments, changing system dynamics. The system equations for thermal press are included.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.16 no.28
• /
• pp.93-101
• /
• 1993

In this paper, two adaptive exponentially weighted moving avenge control chart schemes which available for real-time are proposed. The weighting coefficient is estimated using a recursive kalman filter algorithm. Simulated average run lengths indicate the proposed schemes are sensitive to process shifts And their performance is comparable to CUSUM control chart and customary EWMA control chart.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.316-328
• /
• 2003

In this paper, we propose and analyze two adaptive channel allocation schemes for supporting multimedia traffics in hierarchical cellular systems. It is guaranteed to satisfy the required quality of service of multimedia traffics according to their characteristics such as a mobile velocity for voice calls and a delay tolerance for multimedia calls. In the scheme 1, only slow-speed voice calls are allowed to overflow from macrocell to microcell and only adaptive multimedia calls can overflow from microcell to macrocell after reducing its bandwidth to the minimum channel bandwidth. In the scheme II, in addition to the first scheme, non-adaptive multimedia calls can occupy the required channel bandwidth through reducing the channel bandwidth of adaptive multimedia calls. The proposed scheme I is analyzed using 2-dimensional Markov model. Through computer simulations, the analysis model and the proposed schemes are compared with the fixed system and two previous studies. In the simulation result, it is shown that the proposed schemes yield a significant improvement in terms of the forced termination probability of handoff calls and the efficiency of channel usage.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.105-122
• /
• 2011

The fundamental design goal of wireless sensor MAC protocols is to minimize unnecessary power consumption of the sensor nodes, because of its stringent resource constraints and ultra-power limitation. In existing MAC protocols in wireless sensor networks (WSNs), duty cycling, in which each node periodically cycles between the active and sleep states, has been introduced to reduce unnecessary energy consumption. Existing MAC schemes, however, use a fixed duty cycling regardless of multi-hop communication and traffic fluctuations. On the other hand, there is a tradeoff between energy efficiency and delay caused by duty cycling mechanism in multi-hop communication and existing MAC approaches only tend to improve energy efficiency with sacrificing data delivery delay. In this paper, we propose two different MAC schemes (ADS-MAC and ELA-MAC) using closed-loop control in order to achieve both energy savings and minimal delay in wireless sensor networks. The two proposed MAC schemes, which are synchronous and asynchronous approaches, respectively, utilize an adaptive timer and a successive preload frame with closed-loop control for adaptive duty cycling. As a result, the analysis and the simulation results show that our schemes outperform existing schemes in terms of energy efficiency and delivery delay.

• Journal of Electrical Engineering and Technology
• /
• v.2 no.4
• /
• pp.420-427
• /
• 2007

This paper highlights the comparison of a proposed methods named adaptive undervoltage load shedding based PTSI techniques for undervoltage load shedding and two previous methods named Fixed Shed Fixed Delay (FSFD) and Variable Shed Variable Delay (VSVD) for avoiding voltage collapse. There are three main area considerations in load shedding schemes as the amount of load to be shed, the timing of load shedding event, and the location where load shed is to be shed. The proposed method, named as adaptive UVLS based PTSI seem to be most appropriate among the uncoordinated schemes. From the simulation result can be shown the Adaptive UVLS based PTSI give faster response, accurate and very sensitive control for the UVLS control technique. This technique is effectively when calculating the amount to be shed. Therefore, it is possible to bring the voltage to the threshold value in one step. Thus, the adaptive load shedding can effectively reduce the computational time for control strategy.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.1-7
• /
• 2013

Most of the provably-secure proxy signature schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, those schemes are insecure to quantum analysis algorithms, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. To make secure proxy signature schemes against quantum analysis, some lattice-based proxy signature schemes are suggested. However, none of the suggested lattice-based proxy signature schemes is proxy-protected in the adaptive security model. In the paper, we propose a provably-secure ID-based proxy signature scheme based on the lattice problems. Our scheme is proxy-protected in the adaptive security model.