• Journal of Power Electronics
• /
• v.16 no.6
• /
• pp.2212-2220
• /
• 2016

Based on the conventional PID algorithm and the adaptive PID (AD-PID) algorithm, a separate sampling adaptive PID (SSA-PID) algorithm is proposed to improve the transient response of digitally controlled DC-DC converters. The SSA-PID algorithm, which can be divided into an oversampled adaptive P (AD-P) control and an adaptive ID (AD-ID) control, adopts a higher sampling frequency for AD-P control and a conventional sampling frequency for AD-ID control. In addition, it can also adaptively adjust the PID parameters (i.e. $K_p$, $K_i$ and $K_d$) based on the system state. Simulation results show that the proposed algorithm has better line transient and load transient responses than the conventional PID and AD-PID algorithms. Compared with the conventional PID and AD-PID algorithms, the experimental results based on a FPGA indicate that the recovery time of the SSA-PID algorithm is reduced by 80% and 67% separately, and that overshoot is decreased by 33% and 12% for a 700mA load step. Moreover, the SSA-PID algorithm can achieve zero overshoot during startup.

• Structural Engineering and Mechanics
• /
• v.68 no.5
• /
• pp.549-561
• /
• 2018

Sobol method is applied as a powerful variance decomposition technique in the field of global sensitivity analysis (GSA). The paper is devoted to increase convergence speed of the extracted Sobol indices using a new proposed sampling technique called genetic based Latine hypercube sampling (GBLHS). This technique is indeed an improved version of restricted Latine hypercube sampling (LHS) and the optimization algorithm is inspired from genetic algorithm in a new approach. The new approach is based on the optimization of minimax value of LHS arrays using manipulation of array indices as chromosomes in genetic algorithm. The improved Sobol method is implemented to perform factor prioritization and fixing of an uncertain comprehensive high speed rotor-bearing system. The finite element method is employed for rotor-bearing modeling by considering Eshleman-Eubanks assumption and interaction of axial force on the rotor whirling behavior. The performance of the GBLHS technique are compared with the Monte Carlo Simulation (MCS), LHS and Optimized LHS (Minimax. criteria). Comparison of the GBLHS with other techniques demonstrates its capability for increasing convergence speed of the sensitivity indices and improving computational time of the GSA.

• Journal of the Semiconductor & Display Technology
• /
• v.14 no.3
• /
• pp.37-43
• /
• 2015

In this paper, a new background subtraction algorithm for video based fence monitoring surveillance systems is proposed. We adopt the sampling based background subtraction technique and focus on the two main issues: handling highly dynamic environment and handling the flickering nature of pulse based IR (infrared) lamp. Natural scenes from fence monitoring system are usually composed of several dynamic entities such as swaying trees, moving water, waves and rain. To deal with such dynamic backgrounds, we utilize the confidence factor for each background value of the input image. For the flickering IR lamp, the original sampling based technique is extended to handle double background models. Experimental results revealed that our method works well in real fence monitoring surveillance systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3889-3903
• /
• 2017

Fast and accurate localization of randomly deployed nodes is required by many applications in wireless sensor networks (WSNs). However, mobile nodes localization in WSNs is more difficult than static nodes localization since the nodes mobility brings more data. In this paper, we propose a Range-based Monte Carlo Box (RMCB) algorithm, which builds upon the Monte Carlo Localization Boxed (MCB) algorithm to improve the localization accuracy. This algorithm utilizes Received Signal Strength Indication (RSSI) ranging technique to build a sample box and adds a preset error coefficient in sampling and filtering phase to increase the success rate of sampling and accuracy of valid samples. Moreover, simplified Particle Swarm Optimization (sPSO) algorithm is introduced to generate new samples and avoid constantly repeated sampling and filtering process. Simulation results denote that our proposed RMCB algorithm can reduce the location error by 24%, 14% and 14% on average compared to MCB, Range-based Monte Carlo Localization (RMCL) and RSSI Motion Prediction MCB (RMMCB) algorithm respectively and are suitable for high precision required positioning scenes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.12
• /
• pp.1960-1963
• /
• 2021

In this paper, we propose a multiplay Thompson sampling algorithm in multipath communication system. Multipath communication system has advantages on communication capacity, robustness, survivability, and so on. It is important to select appropriate network path according to the status of individual path. However, it is hard to obtain the information of path quality simultaneously. To solve this issue, we propose Thompson sampling which is popular in machine learning area. We find some issues when the algorithm is applied directly in the proposal system and suggested some modifications. Through simulation, we verified the proposed algorithm can utilize the entire network paths. In summary, our proposed algorithm can be applied as a path allocation in multipath-based communications system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.600-619
• /
• 2015

We propose a cost-efficient hybrid algorithm for online location updates that efficiently combines feature point detection with the online trajectory-based sampling algorithm. Our algorithm is designed to minimize the average trajectory error with the minimal number of sample points. The algorithm is composed of 3 steps. First, we choose corner points from the map as sample points because they will most likely cause fewer trajectory errors. By employing the online trajectory sampling algorithm as the second step, our algorithm detects several missing and important sample points to prevent unwanted trajectory errors. The final step improves cost efficiency by eliminating redundant sample points on straight paths. We evaluate the proposed algorithm with real GPS trajectory data for various bus routes and compare our algorithm with the existing one. Simulation results show that our algorithm decreases the average trajectory error 28% compared to the existing one. In terms of cost efficiency, simulation results show that our algorithm is 29% more cost efficient than the existing one with real GPS trajectory data.

• 한국데이터정보과학회:학술대회논문집
• /
• 2003.10a
• /
• pp.239-247
• /
• 2003

Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, etc. CHAID(Chi-square Automatic Interaction Detector), is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose and CHAID algorithm by cube-based sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.1
• /
• pp.44-53
• /
• 2008

An interacting multiple model (IMM) estimation algorithm based on the mixing of the predicted state estimates is proposed in this paper for a right continuous jump-linear system model different from the left-continuous system model used to develop the existing IMM algorithm. The difference lies in the modeling of the mode switching time. Performance of the proposed algorithm is compared numerically with that of the existing IMM algorithm for noisy system identification. Based on the numerical analysis, the proposed algorithm is applied to target tracking with a large sampling period for performance comparison with the existing IMM.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.1
• /
• pp.24-32
• /
• 2010

This paper introduces a B-spline based branch & bound algorithm for global optimization. The branch & bound is a well-known algorithm paradigm for global optimization, of which key components are the subdivision scheme and the bound calculation scheme. For this, we consider the B-spline hypervolume to approximate an objective function defined in a design space. This model enables us to subdivide the design space, and to compute the upper & lower bound of each subspace where the bound calculation is based on the LHS sampling points. We also describe a search tree to represent the searching process for optimal solution, and explain iteration steps and some conditions necessary to carry out the algorithm. Finally, the performance of the proposed algorithm is examined on some test problems which would cover most difficulties faced in global optimization area. It shows that the proposed algorithm is complete algorithm not using heuristics, provides an approximate global solution within prescribed tolerances, and has the good possibility for large scale NP-hard optimization.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.9 no.2
• /
• pp.141-146
• /
• 2009

Support vector machine is a classification algorithm based on statistical learning theory. It has shown many results with good performances in the data mining fields. But there are some problems in the algorithm. One of the problems is its heavy computing cost. So we have been difficult to use the support vector machine in the dynamic and online systems. To overcome this problem we propose to use stratified sampling of statistical sampling theory. The usage of stratified sampling supports to reduce the size of training data. In our paper, though the size of data is small, the performance accuracy is maintained. We verify our improved performance by experimental results using data sets from UCI machine learning repository.