• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.427-431
• /
• 2010

Multidimensional scaling (MDS) is a widely used method for dimensionality reduction, of which purpose is to represent high-dimensional data in a low-dimensional space while preserving distances among objects as much as possible. MDS has mainly been applied to data visualization and feature selection. Among various MDS methods, the classical MDS is not readily applicable to data which has large numbers of objects, on normal desktop computers due to its computational complexity. More precisely, it needs to solve eigenpair problems on dissimilarity matrices based on Euclidean distance. Thus, running time and required memory of the classical MDS highly increase as n (the number of objects) grows up, restricting its use in large-scale domains. In this paper, we propose an efficient approximation algorithm for the classical MDS based on divide-and-conquer and CUDA. Through a set of experiments, we show that our approach is highly efficient and effective for analysis and visualization of data consisting of several thousands of objects.

• The Korean Journal of Applied Statistics
• /
• v.18 no.2
• /
• pp.421-434
• /
• 2005

Machine learning has been extensively studied in recent years as effective tools in pattern classification problem. Although there have been several approaches to machine learning, we focus on the mathematical programming (in particular, multi-objective and goal programming; MOP/GP) approaches in this paper. Among them, Support Vector Machine (SVM) is gaining much popularity recently. In pattern classification problem with two class sets, the idea is to find a maximal margin separating hyperplane which gives the greatest separation between the classes in a high dimensional feature space. However, the idea of maximal margin separation is not quite new: in 1960's the multi-surface method (MSM) was suggested by Mangasarian. In 1980's, linear classifiers using goal programming were developed extensively. This paper proposes a new family of SVM using MOP/GP techniques, and discusses its effectiveness throughout several numerical experiments.

• Nuclear Engineering and Technology
• /
• v.19 no.4
• /
• pp.233-241
• /
• 1987

Difficulties are encountered when the behavior of complex systems (i.e., fuel failure probability) that have unreliable deterministic models is predicted. For more realistic prediction of the behavior of complex systems with limited observational data, the present study was undertaken to devise an approach of combining predictions from the deterministic model and actual observational data. Predictions by this method of combining are inferred to be of higher reliability than separate predictions made by either model taken independently. A systematic method of hierarchical pattern discovery based on the method developed in the SPEAR was used for systematic search of weighting factors and pattern boundaries for the present method. A sample calculation was performed for prediction of CANDU fuel failures that had occurred due to power ramp during refuelling process. It was demonstrated by this sample calculation that there exists a region of feature space in which fuel failure probability from the PROFIT model nearly agree with that from observational data.

• Spatial Information Research
• /
• v.22 no.2
• /
• pp.31-44
• /
• 2014

According to the purpose of applications, the application program will utilize the most suitable data model and 3D modeling data would be generated based on the selected data model. In these reasons, there are various data sets to represent the same geographical features. The duplicated data sets bring serious problems in system interoperability and data compatibility issues, as well in finance issues of geo-spatial information industries. In order to overcome the problems, this study proposes a spatial data fusion method using topological relationships among spatial objects in the feature classes, called Topological Relation Model (TRM). The TRM is a spatial data fusion method implemented in application-level, which means that the geometric data generated by two different data models are used directly without any data exchange or conversion processes in an application system to provide indoor LBSs. The topological relationships are defined and described by the basic concepts of IndoorGML. After describing the concepts of TRM, experimental implementations of the proposed data fusion method in 3D GIS are presented. In the final section, the limitations of this study and further research are summarized.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.113-123
• /
• 2006

Flash memory has been increasingly used in handhold devices not only for data storage, but also for code storage. Because NAND flash memory only provides sequential access feature, a traditionally accepted solution to execute the program from NAND flash memory is shadowing. But, shadowing has significant drawbacks increasing a booting time of the system and consuming severe DRAM space. Demand paging has obtained significant attention for program execution from NAND flash memory. But. one of the issues is that there has been no effort to bound demand paging cost in flash memory and to analyze the worst case performance of demand paging. For the worst case timing analysis of programs running from NAND flash memory. the worst case demand paging costs should be estimated. In this paper, we propose two different WCRT analysis methods considering demand paging costs, DP-Pessimistic and DP-Accurate, depending on the accuracy and the complexity of analysis. Also, we compare the accuracy butween DP-Pessimistic and DP-Accurate by using the simulation.

• Journal of The Korean Astronomical Society
• /
• v.42 no.3
• /
• pp.61-69
• /
• 2009

Transverse velocity vectors can be determined from a pair of images successively taken with a time interval using an optical flow technique. We have tested the performance of the new technique called NAVE (non-linear affine velocity estimator) recently implemented by Chae & Sakurai using real image data taken by the Narrowband Filter Imager (NFI) of the Solar Optical Telescope (SOT) aboard the Hinode satellite. We have developed two methods of estimating the errors in the determination of velocity vectors, one resulting from the non-linear fitting ${\sigma}_{\upsilon}$ and the other ${\epsilon}_u$ resulting from the statistics of the determined velocity vectors. The real error is expected to be somewhere between ${\sigma}_{\upsilon}$ and ${\epsilon}_u$. We have investigated the dependence of the determined velocity vectors and their errors on the different parameters such as the critical speed for the subsonic filtering, the width of the localizing window, the time interval between two successive images, and the signal-to-noise ratio of the feature. With the choice of $v_{crit}$ = 2 pixel/step for the subsonic filtering, and the window FWHM of 16 pixels, and the time interval of one step (2 minutes), we find that the errors of velocity vectors determined using the NAVE range from around 0.04 pixel/step in high signal-to-noise ratio features (S/N $\sim$ 10), to 0.1 pixel/step in low signa-to-noise ratio features (S/N $\sim$ 3) with the mean of about 0.06 pixel/step where 1 pixel/step corresponds roughly to 1 km/s in our case.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.29-35
• /
• 2012

In this paper, it is presented the method of image recovering which existing is only pixel processing, but suggesting method is concluding image clustering overlap degree after classfying around unit fixel to crowd pixel. Concluding overlap degree threshold value is after identifying pattern pixel and grasping geometry structure of sample pattern and deduction of deciding function. distinguishing feature space is above four dimension is reason of not visual observation of pattern structure. consideration of distribution structure is distance of center of crowd pixel, the number of each crowd pattern pixel and standard deviation. The over threshold value elimate the overlap image and the downward is recovered and established dynamic image. memory storage deduction of 20% and elevation of 15% performance is estimated in recovery of image.

• Journal of the Economic Geographical Society of Korea
• /
• v.9 no.3
• /
• pp.441-458
• /
• 2006

Culture is an indispensable element in modern society in improving the quality of life for city dwellers and stimulating the urbanization. The conspicuous emergence of cultural cities, which is a new paradigm, can be understood in that context. Global cities are pursuing cultural cities, and autonomous regions in Korea are also pushing ahead with the urbanization which combines cultural elements. Specifically, Nam-gu of Incheon has set an example of successful cultural city for other autonomous regions. The cultural environmental policy of Nam-gu is deemed to have retained the infrastructure, cultural urban landscape and living space, and a plenty of contents. The real significance of cultural city lies in the pursuit of sustainable urban development as a culture-friendly city. For that, the direction of cultural environmental city has to be firmly set, and related law and system should be strengthened. Above all, it is critical to pursue human-oriented cultural city by showing citizens what roles they have to play, setting the right direction, and improving the partnership.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.3
• /
• pp.233-238
• /
• 2016

In this paper, we propose the algorithms of processing the uncertainty data using data fusion for the next generation intrusion detection. In the next generation intrusion detection, a lot of data are collected by many of network sensors to discover knowledge from generating information in cyber space. It is necessary the data fusion process to extract knowledge from collected sensors data. In this paper, we have proposed method to represent the uncertainty data, by classifying where is a confidence interval in interval of uncertainty data through feature analysis of different data using inference method with Dempster-Shafer Evidence Theory. In this paper, we have implemented a detection experiment that is classified by the confidence interval using IRIS plant Data Set for anomaly detection of uncertainty data. As a result, we found that it is possible to classify data by confidence interval.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.9
• /
• pp.900-907
• /
• 2014

This paper proposes a MPC (Model Predictive Control) method for the torque and flux controls of induction motor. The proposed MPC method selects the optimized voltage vector for the matrix converter control using the predictive modeling equation of the induction motor and cost function. Hence, the reference voltage vector that minimizes the cost function of the torque and flux error within the control period is selected and applied to the actual system. As a result, it is possible to perform the torque and flux control of induction motor using only the MPC controller without a PI (Proportional-Integral) or hysteresis controller. Even though the proposed control algorithm is more complicated and has lots of computations compared with the conventional MPC, it can perform torque ripple reduction by synthesizing voltage vectors of various magnitude. This feature provides the reduction of amount of calculations and the improvement of the control performance through the adjustment of the number of the unit vectors n. The proposed control method is validated through the PSIM simulation.