• Journal of the Korean Data and Information Science Society
• /
• v.25 no.5
• /
• pp.1151-1160
• /
• 2014

In DNA microarray studies, the number of genes far exceeds the number of samples and the gene expression measures are highly correlated. Partial least squares regression (PLSR) is one of the popular methods for dimensional reduction and known to be useful for the classifications of microarray data by several studies. In this study, we suggest a modified version of the partial least squares regression to analyze gene expression data with survival information. The method is designed as a new gene selection method using PLSR with an iterative procedure of imputing censored survival time. Mean square error of prediction criterion is used to determine the dimension of the model. To visualize the data, plot for variables superimposed with samples are used. The method is applied to two microarray data sets, both containing survival time. The results show that the proposed method works well for interpreting gene expression microarray data.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.1 s.6
• /
• pp.1-13
• /
• 2005

For integrated transit networks operated with diverse transit modes, it is difficult to find related literatures on the provision of multiple travel time routes information. This study proposes a methodology on how to select K number of least time transit routes in the integrated transit network with two modes, bus and subway. In the Proposed method, three constraints usually (will be) encountered for decision by users-(1) service time constraints of travel modes, (2) maximum payment fare constraints under the integrated distance based fare system, and (3) maximum number of transfer constraints - are taken into consideration in the searched routes. The experimental studies shows that the proposed method properly provides K number of least time routes. In addition, it somehow proves that by combinatorially considering three constraints the proposed method can be evaluated as to enlarge the quality as well as the diversity of route information demanded by users.

• Journal of the Korean Society of Food Culture
• /
• v.10 no.2
• /
• pp.75-81
• /
• 1995

This study was attempted to standard Yukwa recipies by proposing optimal conditions for soaking time and the number of beating. Soaking time and the number of beating had effects on the number of peak, implying that 15 days of soaking time at $15^{\circ}C$ and 160 times of beating would be required. In Yukwa's microstructural image, the better groups were over 15 days of soaking time and as number of beating increased, the appearance improved. The longer soaking time, the better tenderness and expansion volume. The number of beating had significant effects on all sensory evaluation except volume. Response surface model showed that the optimal condition would be at least 15 days of soaking and 319 times of beating.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.8-18
• /
• 2016

In this paper, we propose a number of blind equalization approaches for time-varying andmulti-path channels. The approaches employ cost reference particle filter (CRPF) as the symbol estimator, and additionally employ either least mean squares algorithm, recursive least squares algorithm, or $H{\infty}$ filter (HF) as a channel estimator such that they are jointly employed for the strategy of "Rao-Blackwellization," or equally called "mixture filtering." The novel feature of the proposed approaches is that the blind equalization is performed based on direct channel estimation with unknown noise statistics of the received signals and channel state system while the channel is not directly estimated in the conventional method, and the noise information if known in similar Kalman mixture filtering approach. Simulation results show that the proposed approaches estimate the transmitted symbols and time-varying channel very effectively, and outperform the previously proposed approach which requires the noise information in its application.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.11a
• /
• pp.886-890
• /
• 2007

Machine fault prognosis techniques have been considered profoundly in the recent time due to their profit for reducing unexpected faults or unscheduled maintenance. With those techniques, the working conditions of components, the trending of fault propagation, and the time-to-failure are forecasted precisely before they reach the failure thresholds. In this work, we propose an approach of Least Square Regression Tree (LSRT), which is an extension of the Classification and Regression Tree (CART), in association with one-step-ahead prediction of time-series forecasting technique to predict the future conditions of machines. In this technique, the number of available observations is firstly determined by using Cao's method and LSRT is employed as prognosis system in the next step. The proposed approach is evaluated by real data of low methane compressor. Furthermore, the comparison between the predicted results of CART and LSRT are carried out to prove the accuracy. The predicted results show that LSRT offers a potential for machine condition prognosis.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.1
• /
• pp.72-80
• /
• 2016

Re-auction happens when a bid winner defaults on the payment without making second in-line purchase declaration even after determining sales permission. This is a process of selling under the court's authority. Re-auctioning contract price of real estate is largely influenced by the real estate business, real estate value, and the number of bidders. This paper is designed to establish a statistical model that deals with the number of bidders participating especially in apartment re-auctioning. For these, diverse factors are taken into consideration, including ratio of minimum sales value from the point of selling to re-auctioning, number of bidders at the time of selling, investment value of the real estate, and so forth. As an attempt to consider ambiguous and vague factors, this paper presents a comparatively vague concept of real estate and bidders as trapezoid fuzzy number. Two different methods based on the least squares estimation are applied to fuzzy regression model in this paper. The first method is the estimating method applying substitution after obtaining the estimators of regression coefficients, and the other method is to estimate directly from the estimating procedure without substitution. These methods are provided in application for re-auction data, and appropriate performance measure is also provided to compare the accuracies.

• Smart Structures and Systems
• /
• v.14 no.5
• /
• pp.831-845
• /
• 2014

This paper proposed a discrete wavelet transform based method for time-varying physical parameter identification of shear type structures. The time-varying physical parameters are dispersed and expanded at multi-scale as profile and detail signal using discrete wavelet basis. To reduce the number of unknown quantity, the wavelet coefficients that reflect the detail signal are ignored by setting as zero value. Consequently, the time-varying parameter can be approximately estimated only using the scale coefficients that reflect the profile signal, and the identification task is transformed to an equivalent time-invariant scale coefficient estimation. The time-invariant scale coefficients can be simply estimated using regular least-squares methods, and then the original time-varying physical parameters can be reconstructed by using the identified time-invariant scale coefficients. To reduce the influence of the ill-posed problem of equation resolving caused by noise, the Tikhonov regularization method instead of regular least-squares method is used in the paper to estimate the scale coefficients. A two-story shear type frame structure with time-varying stiffness and damping are simulated to validate the effectiveness and accuracy of the proposed method. It is demonstrated that the identified time-varying stiffness is with a good accuracy, while the identified damping is sensitive to noise.

• The Journal of the Korea Contents Association
• /
• v.8 no.11
• /
• pp.57-64
• /
• 2008

The data grid computing provides geographically distributed storage resources to solve computational problems with large-scale data. Unlike cache replacement policies in virtual memory or web-caching replacement, an optimal file replacement policy for data grids is the one of the important problems by the fact that file size is very large. The traditional file replacement policies such as LRU(Least Recently Used), LCB-K(Least Cost Beneficial based on K), EBR(Economic-based cache replacement), LVCT(Least Value-based on Caching Time) have the problem that they have to predict requests or need additional resources to file replacement. To solve theses problems, this paper propose SBR-k(Sized-based replacement-k) that replaces files based on file size. The proposed policy considers file size to reduce the number of files corresponding to a requested file rather than forecasting the uncertain future for replacement. The results of the simulation show that hit ratio was similar when the cache size was small, but the proposed policy was superior to traditional policies when the cache size was large.

• Journal of Information Processing Systems
• /
• v.13 no.1
• /
• pp.104-113
• /
• 2017

In this paper, we present an approach to transmit data from the source to the destination through a minimal path (least-cost path) in a computer network of n nodes. The motivation behind our approach is to address the problem of finding a minimal path between the source and destination. From the work we have studied, we found that a Steiner tree with bounded Steiner vertices offers a good solution. A novel algorithm to construct a Steiner tree with vertices and bounded Steiner vertices is proposed in this paper. The algorithm finds a path from each source to each destination at a minimum cost and minimum number of Steiner vertices. We propose both the sequential and parallel versions. We also conducted a comparative study of sequential and parallel versions based on time complexity, which proved that parallel implementation is more efficient than sequential.

• Journal of information and communication convergence engineering
• /
• v.18 no.3
• /
• pp.147-154
• /
• 2020

In this study, we created a system that can determine the number of vehicles entering and departing a charging station in real time for solving waiting time problems during refueling. Accordingly, we use the You Only Look Once object detection algorithm to detect and count the number of vehicles in the charging station and send the data to the Firebase Realtime Database. The result is shown using an Android application that provides a map function with the Kakao Maps API at the user interface side. Our system has an accuracy of 91% and an average response time of 3.1 s. Therefore, this system can be used by drivers to determine the availability of a charging station and to identify the charging station with the least waiting time for charging their vehicle.