• Journal of Information Technology Services
• /
• v.16 no.3
• /
• pp.103-111
• /
• 2017

The real time scheduling is a key research area in high performance computing and has been a source of challenging problems. A periodic task is an infinite sequence of task instance where each job of a task comes in a regular period. The RMS (Rate Monotonic Scheduling) algorithm has the advantage of a strong theoretical foundation and holds out the promise of reducing the need for exhaustive testing of the scheduling. Many real-time systems built in the past based their scheduling on the Cyclic Executive Model because it produces predictable schedules which facilitate exhaustive testing. In this work we propose hybrid scheduling method which combines features of both of these scheduling algorithms. The original rate monotonic scheduling algorithm didn't consider the uniform sampling tasks in the real time systems. We have enumerated some issues when the RMS is applied to our hybrid scheduling method. We found the scheduling bound for the hard real-time systems which include the uniform sampling tasks. The suggested hybrid scheduling algorithm turns out to have some advantages from the point of view of the real time system designer, and is particularly useful in the context of large critical systems. Our algorithm can be useful for real time system designer who must guarantee the hard real time tasks.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.5
• /
• pp.895-900
• /
• 2023

We study low-complexity graph sampling which selects a subset of nodes from graph nodes so as to reconstruct the original signal from the sampled one. To achieve complexity reduction, we propose a graph sampling algorithm with thresholding which selects a node with a cost lower than a given threshold at each step without fully searching all of the remaining nodes to find one with the minimum cost. Since it is important to find the threshold as close to a minimum cost as possible to avoid degradation of the reconstruction performance, we present a mathematical expression to compute the threshold at each step. We investigate the performance of the different sampling methods for various graphs, showing that the proposed algorithm runs 1.3 times faster than the previous method while maintaining the reconstruction performance.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.5
• /
• pp.1544-1550
• /
• 2014

In this paper, an adaptive optimization strategy utilizing Kriging model and genetic algorithm is proposed for the optimal design of electromagnetic devices. The ordinary Kriging assisted by the spherical covariance model is used to construct surrogate models. In order to improve the computational efficiency, the adaptive uniform sampling strategy is applied to generate sampling points in design space. Through several iterations and gradual refinement process, the global optimal point can be found by genetic algorithm. The proposed algorithm is validated by application to the optimal design of a switched reluctance motor, where the stator pole face and shape of pole shoe attached to the lateral face of the rotor pole are optimized to reduce the torque ripple.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.2
• /
• pp.177-183
• /
• 2013

We describe a new method for selecting design variables for shape optimization of high-voltage gas circuit breaker using a Kriging meta-model and a genetic algorithm. Firstly we sample balance design variables using the Latin Hypercube Sampling. Secondly, we build meta-model using the Kriging. Thirdly, we search the optimal design variables using a genetic algorithm. To obtain the more exact design variable, we adopt the boundary shifting method. With the proposed optimization frame, we can get the improved interruption design and reduce the design time by 80%. We applied the proposed method to the optimization of multivariate optimization problems as well as shape optimization of a high - voltage gas circuit breaker.

• Journal of Korean Society for Quality Management
• /
• v.24 no.4
• /
• pp.207-223
• /
• 1996

These days, customers have attached great importance to the function of product liability and quality assurance. In Korea, the single rectifying sampling inspection for attribute (KS A 3105) has been used. But this inspection plan given by tables (KS A 3105) has some defects. There are limitations in the range of applications and irrationality of approximate probability and the double rectifying sampling inspection is not mentioned. Moreover, ATI (average total inspection) does not reflect sampling costs and the loss of nonconforming item. Therefore, the objectives of this study is to develope new algorithms and computer program that provide the optimal sampling inspection plan based on minimum linear costs (single & double inspection plan). The result of this study revealed that the new algorithm is less than KS A 3105 in ATI and basically, double inspection plan is more economical. Also it comes over restrictions in KS A 3105. So, it is definite that the optimal solution can be obtained considering cost factors in manufacturing and sampling process, and costs can be saved in the long term.

• Communications for Statistical Applications and Methods
• /
• v.20 no.6
• /
• pp.427-438
• /
• 2013

Based on progressive Type II censored sampling which is an important method to obtain failure data in a lifetime study, we suggest a very general form of Bayesian prediction bounds from two parameters exponentiated Weibull distribution using the proper general prior density. For this, Markov chain Monte Carlo approach is considered and we also provide a simulation study.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.939-940
• /
• 2008

In this paper, we propose a novel image clustering method based on weighted sub-sampling to reduce clustering time and the number of clusters for target detection and tracking. Our proposed method first obtain sub-sampling image with specific weights which is the number of target pixels in sampling region. After performing clustering procedure, the cluster center position is properly obtained using weights of target pixels in the cluster. Therefore, our proposed method can not only reduce clustering time, but also obtain proper cluster center.

• Journal of the Korean Statistical Society
• /
• v.26 no.4
• /
• pp.493-505
• /
• 1997

The analysis of binary data appears to many areas such as statistics, biometrics and econometrics. In many cases, data are often collected in which some observations are incomplete. Assume that the missing covariates are missing at random and the responses are completely observed. A method to Bayesian analysis of the binary regression model with incomplete data is presented. In particular, the desired marginal posterior moments of regression parameter are obtained using Meterpolis algorithm (Metropolis et al. 1953) within Gibbs sampler (Gelfand and Smith, 1990). Also, we compare logit model with probit model using Bayes factor which is approximated by importance sampling method. One example is presented.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.48 no.9
• /
• pp.517-522
• /
• 1999

This paper addresses the issue of current sampling in a high performance AC drive system fed by a discontinuous PWM inverter. The effect of the sampling error due to the measurement delay produced by an input stage low pass filter and an A/D converter is described in the case of discontinuous PWM. To compensate for the sampling error, a method to estimate the delay time of the whole measurement system based on the measured current is proposed and its effectiveness is verified by experimental results. The proposed algorithm can automatically estimate the system delay introduced by the low pass filter and the A/D converter at the commissioning stage. By delaying the current sampling by the estimated value, experimental results indicate that more than 50% reduction of current ripple can be achieved.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.1
• /
• pp.27-34
• /
• 2013

Background subtraction is one of the key techniques for automatic video content analysis, especially in the tasks of visual detection and tracking of moving object. In this paper, we present a new sample-based technique for background extraction that provides background image as well as background model. To handle both high-frequency and low-frequency events at the same time, multiple interval background models are adopted. The main innovation concerns the use of a confidence factor to select the best model from the multiple interval background models. To our knowledge, it is the first time that a confidence factor is used for merging several background models in the field of background extraction. Experimental results revealed that our approach based on multiple interval sampling works well in complicated situations containing various speed moving objects with environmental changes.