• 유체기계공업학회:학술대회논문집
• /
• 2005.12a
• /
• pp.517-524
• /
• 2005

An aerodynamic design for centrifugal compressor which was applied to medium speed diesel engine has done. First of all, exact compressor specifications must be defined by accurate engine system matching. This matching program has been developed. Using the mean1ine prediction method, geometric design and performance curve for compressor was done and verified by comparing three dimensional viscous CFD results. The deviation at the design point was about 2.3%. Combustor has been designed and manufactured for the performance test of medium speed diesel engine turbocharger. Fuel nozzle of combustor was designed and performed by PIV and PDPA test equipment. Through these results, spray characteristics were studied and flow coefficient equation was deduced.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.5-10
• /
• 2010

This paper introduces a new fast motion estimation based on estimating a block matching error (i.e., sum of absolute difference (SAD)) between blocks which can eliminate an impossible candidate block much earlier than a conventional partial distortion elimination (PDE) scheme. The basic idea of the proposed scheme is based on predicting the total SAD of a candidate block using its partial SAD. In particular, in order to improve prediction accuracy and computational efficiency, a sub-sample based block matching and a selective pixel-based approaches are employed. In order to evaluate the proposed scheme, several baseline approaches are described and compared. The experimental results show that the proposed algorithm can reduce the computations by about 44% for motion estimation at the cost of 0.0005 dB quality degradation versus the general PDE algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.667-674
• /
• 1987

In this paper an effective block matching algorithm is proposed to find the motion vector. There are two approaches to the estimation of the motion vector in MCC (motion compensated coding), i.e., pel(pixel element) recursive algorithm and block matching algorithm. The search algorithm in this paper is based on the block matching method. The advantage of a proposed algorithm using integral projections is the reduction of the computation time. While the conventional block matching methods have to be computed in 2-dimensional arrays, the proposed algorithm using integral projections can be computed in 1-dimensional arrays. In comparison with conventional block matching methods, a computer simulation shows that though the prediction error increases 0.23 db, it is not detectable for human eyes and the average reduction ratio of computation time obtained from the proposed algorithm is about 3-4.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.283-286
• /
• 2007

This paper proposes a genetic algorithm (GA) approach to instance selection in case-based reasoning (CBR) for the prediction of Korea Stock Price Index (KOSPI). CBR has been widely used in various areas because of its convenience and strength in complex problem solving. Nonetheless, compared to other machine learning techniques, CBR has been criticized because of its low prediction accuracy. Generally, in order to obtain successful results from CBR, effective retrieval of useful prior cases for the given problem is essential. However, designing a good matching and retrieval mechanism for CBR systems is still a controversial research issue. In this paper, the GA optimizes simultaneously feature weights and a selection task for relevant instances for achieving good matching and retrieval in a CBR system. This study applies the proposed model to stock market analysis. Experimental results show that the GA approach is a promising method for instance selection in CBR.

• 제어로봇시스템학회:학술대회논문집
• /
• 1999.10a
• /
• pp.157-160
• /
• 1999

A prediction method of conditional event matching pre-diction (EMP) for a purpose of predicting nonlinear phenomena of insulator pollution was proposed in this paper. The EMP was used if the conditional probability for increase of insulator pollution exceeded a threshold value. A performance of the EMP was strongly related to selection of database of events and a closeness function. By use of the prediction of the insulator pollution based on the conditional EMP, reliable decision making for the washing timing of the polluted insulators was e-valuated based on actual data in Kasatsu substation, Japan.

• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.75-88
• /
• 2022

With the development of the sharing economy, existing recommender services are changing from user-item recommendations to user-user recommendations. The most important consideration is that all users should have the best possible satisfaction. To achieve this outcome, the matching service adds information between users and items necessary for the existing recommender service and information between users, so higher-level data mining is required. To this end, this paper proposes a user-to-user matching service (UTU-MS) employing the prediction of mutual satisfaction based on learning. Users were divided into consumers and suppliers, and the properties considered for recommendations were set by filtering and weighting. Based on this process, we implemented a convolutional neural network (CNN)-deep neural network (DNN)-based model that can predict each supplier's satisfaction from the consumer perspective and each consumer's satisfaction from the supplier perspective. After deriving the final mutual satisfaction using the predicted satisfaction, a top recommendation list is recommended to all users. The proposed model was applied to match guests with hosts using Airbnb data, which is a representative sharing economy platform. The proposed model is meaningful in that it has been optimized for the sharing economy and recommendations that reflect user-specific priorities.

• Genomics & Informatics
• /
• v.17 no.4
• /
• pp.47.1-47.12
• /
• 2019

The achievements of genome-wide association studies have suggested ways to predict diseases, such as type 2 diabetes (T2D), using single-nucleotide polymorphisms (SNPs). Most T2D risk prediction models have used SNPs in combination with demographic variables. However, it is difficult to evaluate the pure additive contribution of genetic variants to classically used demographic models. Since prediction models include some heritable traits, such as body mass index, the contribution of SNPs using unmatched case-control samples may be underestimated. In this article, we propose a method that uses propensity score matching to avoid underestimation by matching case and control samples, thereby determining the pure additive contribution of SNPs. To illustrate the proposed propensity score matching method, we used SNP data from the Korea Association Resources project and reported SNPs from the genome-wide association study catalog. We selected various SNP sets via stepwise logistic regression (SLR), least absolute shrinkage and selection operator (LASSO), and the elastic-net (EN) algorithm. Using these SNP sets, we made predictions using SLR, LASSO, and EN as logistic regression modeling techniques. The accuracy of the predictions was compared in terms of area under the receiver operating characteristic curve (AUC). The contribution of SNPs to T2D was evaluated by the difference in the AUC between models using only demographic variables and models that included the SNPs. The largest difference among our models showed that the AUC of the model using genetic variants with demographic variables could be 0.107 higher than that of the corresponding model using only demographic variables.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1925-1938
• /
• 2001

In this paper, a new block-matching algorithm for standard video encoder is presented. The slice competition method is proposed as a new scheme, as opposed to a coarse-to-fine approach. The order of calculating the SAD(Sum of Absolute Difference) to fad the best matching block is changed from a raster order to a dispersed one. Based on this scheme, the increasing SAD curve during its calculation is more linear than that of other curves. Then, the candidates of low probability can be removed in the early stage of calculation. And new MV prediction technique with an adaptive search range scheme also assists the proposed block-matching algorithm. As a result, an average of 13% improvement in computational power is recorded by only the proposed MV prediction technique. Synthetically, the computational power is reduced by 3977∼77% than that of the conventional BMAs. The average MAD is always low in various sequences. The results are also very close to the MAD of the full search block-matching algorithm.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1097-1100
• /
• 1999

Due to the significant computation of full search in motion estimation, extensive research in fast motion estimation algorithms has been carried out. However, most of the algorithms have the degradation in predicted images compared with the full search algorithm. To reduce an amount of significant computation while keeping the same prediction quality of the full search, we propose a fast block-matching algorithm based on gradient magnitude of reference block without any degradation of predicted image. By using Taylor series expansion, we show that the block matching errors between reference block and candidate block are proportional to the gradient magnitude of matching block. With the derived result, we propose fast full search algorithm with adaptively determined scan direction in the block matching. Experimentally, our proposed algorithm is very efficient in terms of computational speedup and has the smallest computation among all the conventional full search algorithms. Therefore, our algorithm is useful in VLSI implementation of video encoder requiring real-time application.

• International Journal of Computer Science & Network Security
• /
• v.21 no.4
• /
• pp.214-222
• /
• 2021

Recently, the growth of e-commerce in Saudi Arabia has been exponential, bringing new remarkable challenges. A naive approach for product matching and categorization is needed to help consumers choose the right store to purchase a product. This paper presents a machine learning approach for product matching that combines deep learning techniques with standard artificial neural networks (ANNs). Existing methods focused on product matching, whereas our model compares products based on unstructured descriptions. We evaluated our electronics dataset model from three business-to-consumer (B2C) online stores by putting the match products collectively in one dataset. The performance evaluation based on k-mean classifier prediction from three real-world online stores demonstrates that the proposed algorithm outperforms the benchmarked approach by 80% on average F1-measure.