• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2121-2125
• /
• 2003

This paper proposes a fast distributed constrained power control (FDCPC) with non-stationary relaxation factor to next power update in CDMA cellular power control system. We review unconstrained control algorithms, the distributed power control (DPC), unconstrained second order power control (USOPC) and DPC with stationary relaxation factor (DPCSRF). Under the unconstrained condition, the convergence analysis shows theoretically that the convergence rate of DPC is the fastest one. However, under the constrained control algorithms, DCPC is not the fastest one any more because of transmission power constraint. To improve the convergence speed, the DCPC with non-stationary relaxation factor (FDCPC) are proposed. Under the constrained condition, the convergence rate of FDCPC outperforms that of DCPC and CSOPC.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.11
• /
• pp.159-166
• /
• 1996

In this paper, the method for improving the speed of convergence and learning rate of back propagation algorithms is proposed which update the learning rate parameter and momentum term for each weight by generated error, changely the output layer of neural network generates a high value in the case that output value is far from the desired values, and genrates a low value in the opposite case this method decreases the iteration number and is able to learning effectively. The effectiveness of proposed method is verified through the simulation of X-OR and 3-parity problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.187-199
• /
• 2016

In this paper, we consider secure communications in multi-hop relaying systems, where multiple decode-and-forward (DF) relays are located at each individual hop and perform cooperative beamforming to improve physical layer security. In order to determine the cooperative relay beamformer at each hop, we propose an iterative beamformer update scheme using semidefinite relaxation and bisection techniques. Numerical results are presented to verify the secrecy rate performance of the proposed scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.295-300
• /
• 1999

In Wireless ATM Networks, the mobility management of that is used currently have been studying variously. In this paper, we show the properties of location registration, update, and handoff control mechanism of these first. And then, for frequent handoff occurring condition under minimized cellular environment by degrees, we did comparison and analysis focucing on handoff delay, call-blocking rate and call-dropping rate with communication break-time and velocity variation.

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

In this paper, we are concerned with a maneuver detection algorithm which uses the 'lost' measurements down-sampled for computation load saving when a target is in quiescent motion. In general applications of estimation, measurements are available at a relatively high rate, while the estimation processing equipment can only operate at a lower sampling rate. Furthermore, when a target is in nearly quiescent motion, the update of the tracking filter need not to be implemented with maxim urn process power of the filter since the states of the target vary relatively slowly. This does not give serious degradation on the estimation performance. We consider the maneuver detection problem at the case...

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.10
• /
• pp.1281-1286
• /
• 2014

This paper presents an iterative learning control (ILC) approach for tracking problems with specified data points that are desired points at certain time instants. To design ILC systems for such problems, unlike traditional ILC approaches, an algorithm which updates not only the control signal but also the reference trajectory at each trial will be developed. The relationship between the reference trajectory and ILC control in tracking problems where there are specified data points through which the system should pass is investigated as the rate of convergence. In traditional ILC, the desired data is stored in a tracking profile file. Due to the huge size of the data file containing the target points, it is important to reduce the computational cost. Finally, simulation results of the presented technique are mentioned and compared to other related works to confirm the effectiveness of proposed scheme.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.1
• /
• pp.39-46
• /
• 2006

Multipath diversity reception is applied to the compensation of the distortion of channel, which occurs in transmission of data at rapid speed. DS/BPSK systems are composed of the equipment with reception structure combined with a compensation algorithm to diversity branch. The efficiency of the system is evaluated from the point of view of average bit error rate according to SNR. In order to remove intersymbol interference, this algorithm is applied to time-invariant channel at every diversity branch with the number of L. As a result, the average bit error rate is saturated by $10^{-2}$ at the conventional compensation algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.451-465
• /
• 2017

This paper presents a novel discriminative visual tracking algorithm with an adaptive incremental extreme learning machine. The parameters for an adaptive incremental extreme learning machine are initialized at the first frame with a target that is manually assigned. At each frame, the training samples are collected and random Haar-like features are extracted. The proposed tracker updates the overall output weights for each frame, and the updated tracker is used to estimate the new location of the target in the next frame. The adaptive learning rate for the update of the overall output weights is estimated by using the confidence of the predicted target location at the current frame. Our experimental results indicate that the proposed tracker can manage various difficulties and can achieve better performance than other state-of-the-art trackers.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.661-663
• /
• 2002

This paper introduces a dynamic location management with hierarchical location area, which helps in reducing location update(LU) and paging cost and hence total location management cost. Users are assigned to appropriate location area level utilizing the call-to-mobility ratio(CMR) value. CMR values are calculated each time a user enters a new cell by computing its mobility rate and incoming call rate, which are the two key factors for defining the size of the location area.

• Proceedings of the Korean Reliability Society Conference
• /
• 2005.06a
• /
• pp.131-137
• /
• 2005

In this paper, we propose a Bayesian approach to determine the adaptive preventive maintenance(PM) policy for a general sequential imperfect PM model proposed by Lin, Zuo and Yam(2000) that PM not only reduces the effective age of the system but also changes the hazard rate function. Assuming that the failure times follow Weibull distribution, we adopt a Bayesian approach to update unknown parameters and determine the Bayesian optimal sequential PM policies. Finally, numerical examples of the optimal adaptive PM policy are presented for illustrative purposes.