• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.621-628
• /
• 2005

Scalability of clustering algorithms is critical issues facing the data mining community. This is particularly true for computationally intense tasks such as data clustering. Random sampling of instances is one possible means of achieving scalability but a pervasive problem with this approach is how to deal with the noise that this introduces in the evaluation of the learning algorithm. This paper develops a new optimization based clustering approach using an algorithms specifically designed for noisy performance. Numerical results illustrate that with this algorithm substantial benefits can be achieved in terms of computational time without sacrificing solution quality.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.5
• /
• pp.789-796
• /
• 2012

Fingerprinting is a widely used positioning technology for received signal strength (RSS) based wireless local area network (WLAN) positioning system. Though spatial RSS variation is the key factor of the positioning technology, temporal RSS variation needs to be considered for more accuracy. To deal with the spatial and temporal RSS characteristics within a unified framework, this paper proposes an extended signal propagation mode (ESPM) and a fingerprint generation method. The proposed spatiotemporal fingerprint generation method consists of two algorithms running in parallel; Kalman filtering at several measurement-sampling locations and Kriging to generate location fingerprints at dense reference locations. The two different algorithms are connected by the extended signal propagation model which describes the spatial and temporal measurement characteristics in one frame. An experiment demonstrates that the proposed method provides an improved positioning accuracy.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.1
• /
• pp.87-98
• /
• 2002

A competitive coevolutionary algorithm is a probabilistic search method that imitates coevolution process through evolutionary arms race. The algorithm has been used to solve adversarial problems. In the algorithms, the selection of competitors is needed to evaluate the fitness of an individual. The goal of this study is to compare and analyze several competition strategies in terms of solution quality, convergence speed, balance between competitive coevolving species, population diversity, etc. With two types of test-bed problems, game problems and solution-test problems, extensive experiments are carried out. In the game problems, sampling strategies based on fitness have a risk of providing bad solutions due to evolutionary unbalance between species. On the other hand, in the solution-test problems, evolutionary unbalance does not appear in any strategies and the strategies using information about competition results are efficient in solution quality. The experimental results indicate that the tournament competition can progress an evolutionary arms race and then is successful from the viewpoint of evolutionary computation.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.909-912
• /
• 2006

In this paper a method for remotely-sensed assessment of eutrophication was experimented. The water samples were collected for analysis of COD (chemical oxygen demand) and nutrients concentration, and the remote sensing reflectance data at the sampling points were synchronously measured using above-water method in two cruises, which were conducted in the Pearl River Estuary in January 2003 and January 2004 respectively. Based on the in-situ data the local algorithms for estimation of concentration of nutrients (P and N) and COD were developed by Partial Least Squares (PLS) regression. The algorithms were then applied to atmospheric-corrected SeaWiFS data and the COD and nutrients concentration in Pearl River Estuary were estimated. And then the assessment of eutrophication was carried out by comparison of the estimated nutrients and COD value with the water quality standard. The results show that the whole estuary is seriously in eutrophication.

• The KIPS Transactions:PartA
• /
• v.8A no.1
• /
• pp.48-55
• /
• 2001

Using BDD, we can represent Boolean functions uniquely and compactly, Hence, BDD have become widely used for CAD applications, such as logic synthesis, formal verification, and etc. The size of the BDD representation for a function is very sensitive to the choice of orderings on the input variables. Therefore, it is very important to find a good variable ordering which minimize the size of the BDD. Since finding an optimal ordering is NP-complete, several heuristic algorithms have been proposed to find good variable orderings. In this paper, we propose a variable ordering algorithm based on the $\mu$O(microcanonical optimization). $\mu$O consists of two distinct procedures that are alternately applied : Initialization and Sampling. The initialization phase is to executes a fast local search, the sampling phase leaves the local optimum obtained in the previous initialization while remaining close to that area of search space. The proposed algorithm has been experimented on well known benchmark circuits and shows superior performance compared to a algorithm based on simulated annealing.

• 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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.289-290
• /
• 2012

This paper propose the distance measurement algorithms using the 3-axis accelermeter sensor. This algorithms is based on the human gait charateristic. The proposed algorithms used the sampling data from the 3-axis accelermeter sensor. We improved the error rate as less than eight-percent compare the real movement distance with measured distance to apply the threshold value and the additional value according to the change of the acceleration value.

• Industrial Engineering and Management Systems
• /
• v.8 no.3
• /
• pp.171-180
• /
• 2009

Population learning algorithm (PLA) is a population-based method that was inspired by the similarities to the phenomenon of social education process in which a diminishing number of individuals enter an increasing number of learning stages. The study aims to develop a framework that repeatedly applying the PLA to solve the discrete resource constrained project scheduling problem with two objectives: minimizing project makespan and renewable resource availability, which are two most common concerns of management when a project is being executed. The PLA looping framework will provide a number of near Pareto optimal schedules for the management to make a choice. Different improvement schemes and learning procedures are applied at different stages of the process. The process gradually becomes more and more sophisticated and time consuming as there are less and less individuals to be taught. An experiment with ProGen generated instances was conducted, and the results demonstrated that the looping framework using PLA outperforms those using genetic local search, particle swarm optimization with local search, scatter search, as well as biased sampling multi-pass algorithm, in terms of several performance measures of proximity. However, the diversity using spread metric does not reveal any significant difference between these five looping algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1A
• /
• pp.73-81
• /
• 2012

In this paper, we propose a high-speed synchronization method for Digital Radio Mondiale (DRM) receivers. In order to satisfy the high-speed synchronization requirement of DRM receivers, the proposed method eliminate the initial sampling frequency synchronization process in conventional synchronization methods. In the proposed method, sampling frequency tracking is performed after integer frequency synchronization and frame synchronization. Different correlation algorithms are applied to detect the first frame of the Orthogonal Frequency Division Multiplexing (OFDM) demodulation symbol with sampling frequency offset (SFO). A frame detection algorithm that is robust to SFO is selected based on the performance analysis and simulation. Simulation results show that the proposed method reduces the time spent for initial sampling frequency synchronization even if SFO is present in the DRM signal. In addition, it is verify that inter-cell differential correlation used between reference cells is roubst to the effect of initial SFO.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.3
• /
• pp.237-247
• /
• 2014

This paper describes a 2D discrete-time wavelet transform for which the Q-factor is easily specified. Hence, the transform can be tuned according to the oscillatory behavior of the image signal to which it is applied. The tunable Q-factor wavelet transform (TQWT) is a fully-discrete wavelet transform for which the Q-factor, Q, of the underlying wavelet and the asymptotic redundancy (over-sampling rate), r, of the transform are easily and independently specified. In particular, the specified parameters Q and r can be real-valued. Therefore, by tuning Q, the oscillatory behavior of the wavelet can be chosen to match the oscillatory behavior of the signal of interest, so as to enhance the sparsity of a sparse signal representation. The TQWT is well suited to fast algorithms for sparsity-based inverse problems because it is a Parseval frame, easily invertible, and can be efficiently implemented. The TQWT can also be used as an easily-invertible discrete approximation of the continuous wavelet transform. The transform is based on a real valued scaling factor (dilation-factor) and is implemented using a perfect reconstruction over-sampled filter bank with real-valued sampling factors. The transform is parameterized by its Q-factor and its oversampling rate (redundancy), with modest oversampling rates (e. g. 3-4 times overcomplete) being sufficient for the analysis/synthesis functions to be well localized. Therefore, This method services good performance in image processing fields.