• Title/Summary/Keyword: best-basis algorithm

Search Result 58, Processing Time 0.027 seconds

Computation of the Shortest distance and Forecasting movement distance for Y/T Multi-Cycle System (Multi-Cycle 작업을 위한 Y/T 최단거리 및 예상 이동거리 계산)

  • Park, Tae-jin;Kim, Han-soo;Kim, Cheeyong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.127-130
    • /
    • 2009
  • In this paper, we introduce a Y/T(Yard Tractor) Multi-Cycle System on the basis of RTLS that improves a low efficient loading and unloading. In the proposed approach, we apply the best suited algorithm looking for seeking of the optimum path and the shortest movement distance. In this paper, Our experiment results show that rate of a driving distance is reduced more than 12% compared to the average value, and that is reduced more than 23% compared to the maximum value.

  • PDF

Prediction of replacement period of shield TBM disc cutter using SVM (SVM 기법을 이용한 쉴드 TBM 디스크 커터 교환 주기 예측)

  • La, You-Sung;Kim, Myung-In;Kim, Bumjoo
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.21 no.5
    • /
    • pp.641-656
    • /
    • 2019
  • In this study, a machine learning method was proposed to use in predicting optimal replacement period of shield TBM (Tunnel Boring Machine) disc cutter. To do this, a large dataset of ground condition, disc cutter replacement records and TBM excavation-related data, collected from a shield TBM tunnel site in Korea, was built and they were used to construct a disc cutter replacement period prediction model using a machine learning algorithm, SVM (Support Vector Machine) and to assess the performance of the model. The results showed that the performance of RBF (Radial Basis Function) SVM is the best among a total of three SVM classification functions (80% accuracy and 10% error rate on average). When compared between ground types, the more disc cutter replacement data existed, the better prediction results were obtained. From this results, it is expected that machine learning methods become very popularly used in practice in near future as more data is accumulated and the machine learning models continue to be fine-tuned.

Frame Rate Conversion Algorithm Using Adaptive Search-based Motion Estimation (적응적 탐색기반 움직임 추정을 사용한 프레임 율 변환 알고리즘)

  • Kim, Young-Duk;Chang, Joon-Young;Kang, Moon-Gi
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.3
    • /
    • pp.18-27
    • /
    • 2009
  • In this paper, we propose a frame rate conversion algorithm using adaptive search-based motion estimation (ME). The proposed ME method uses recursive search, 3-step search, and single predicted search as candidates for search strategy. The best method among the three candidates is adaptively selected on a block basis according to the predicted motion type. The adaptation of the search method improves the accuracy of the estimated motion vectors while curbing the increase of computational load. To support the proposed ME method, an entire image is divided into three regions with different motion types. Experimental results show that the proposed FRC method achieves better image quality than existing algorithms in both subjective and objective measures.

A MOM-based algorithm for moving force identification: Part II - Experiment and comparative studies

  • Yu, Ling;Chan, Tommy H.T.;Zhu, Jun-Hua
    • Structural Engineering and Mechanics
    • /
    • v.29 no.2
    • /
    • pp.155-169
    • /
    • 2008
  • A MOM-based algorithm (MOMA) has been developed for moving force identification from dynamic responses of bridge in the companion paper. This paper further evaluates and investigates the properties of the developed MOMA by experiment in laboratory. A simply supported bridge model and a few vehicle models were designed and constructed in laboratory. A series of experiments have then been conducted for moving force identification. The bending moment and acceleration responses at several measurement stations of the bridge model are simultaneously measured when the model vehicle moves across the bridge deck at different speeds. In order to compare with the existing time domain method (TDM), the best method for moving force identification to date, a carefully comparative study scheme was planned and conducted, which includes considering the effect of a few main parameters, such as basis function terms, mode number involved in the identification calculation, measurement stations, executive CPU time, Nyquist fraction of digital filter, and two different solutions to the ill-posed system equation of moving force identification. It was observed that the MOMA has many good properties same as the TDM, but its CPU execution time is just less than one tenth of the TDM, which indicates an achievement in which the MOMA can be used directly for real-time analysis of moving force identification in field.

Data mining Algorithms for the Development of Sasang Type Diagnosis (사상체질 진단검사를 위한 데이터마이닝 알고리즘 연구)

  • Hong, Jin-Woo;Kim, Young-In;Park, So-Jung;Kim, Byoung-Chul;Eom, Il-Kyu;Hwang, Min-Woo;Shin, Sang-Woo;Kim, Byung-Joo;Kwon, Young-Kyu;Chae, Han
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.23 no.6
    • /
    • pp.1234-1240
    • /
    • 2009
  • This study was to compare the effectiveness and validity of various data-mining algorithm for Sasang type diagnostic test. We compared the sensitivity and specificity index of nine attribute selection and eleven class classification algorithms with 31 data-set characterizing Sasang typology and 10-fold validation methods installed in Waikato Environment Knowledge Analysis (WEKA). The highest classification validity score can be acquired as follows; 69.9 as Percentage Correctly Predicted index with Naive Bayes Classifier, 80 as sensitivity index with LWL/Tae-Eum type, 93.5 as specificity index with Naive Bayes Classifier/So-Eum type. The classification algorithm with highest PCP index of 69.62 after attribute selection was Naive Bayes Classifier. In this study we can find that the best-fit algorithm for traditional medicine is case sensitive and that characteristics of clinical circumstances, and data-mining algorithms and study purpose should be considered to get the highest validity even with the well defined data sets. It is also confirmed that we can't find one-fits-all algorithm and there should be many studies with trials and errors. This study will serve as a pivotal foundation for the development of medical instruments for Pattern Identification and Sasang type diagnosis on the basis of traditional Korean Medicine.

Performance Comparison of Spatial Split Algorithms for Spatial Data Analysis on Spark (Spark 기반 공간 분석에서 공간 분할의 성능 비교)

  • Yang, Pyoung Woo;Yoo, Ki Hyun;Nam, Kwang Woo
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.25 no.1
    • /
    • pp.29-36
    • /
    • 2017
  • In this paper, we implement a spatial big data analysis prototype based on Spark which is an in-memory system and compares the performance by the spatial split algorithm on this basis. In cluster computing environments, big data is divided into blocks of a certain size order to balance the computing load of big data. Existing research showed that in the case of the Hadoop based spatial big data system, the split method by spatial is more effective than the general sequential split method. Hadoop based spatial data system stores raw data as it is in spatial-divided blocks. However, in the proposed Spark-based spatial analysis system, there is a difference that spatial data is converted into a memory data structure and stored in a spatial block for search efficiency. Therefore, in this paper, we propose an in-memory spatial big data prototype and a spatial split block storage method. Also, we compare the performance of existing spatial split algorithms in the proposed prototype. We presented an appropriate spatial split strategy with the Spark based big data system. In the experiment, we compared the query execution time of the spatial split algorithm, and confirmed that the BSP algorithm shows the best performance.

Development of Market Growth Pattern Map Based on Growth Model and Self-organizing Map Algorithm: Focusing on ICT products (자기조직화 지도를 활용한 성장모형 기반의 시장 성장패턴 지도 구축: ICT제품을 중심으로)

  • Park, Do-Hyung;Chung, Jaekwon;Chung, Yeo Jin;Lee, Dongwon
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.4
    • /
    • pp.1-23
    • /
    • 2014
  • Market forecasting aims to estimate the sales volume of a product or service that is sold to consumers for a specific selling period. From the perspective of the enterprise, accurate market forecasting assists in determining the timing of new product introduction, product design, and establishing production plans and marketing strategies that enable a more efficient decision-making process. Moreover, accurate market forecasting enables governments to efficiently establish a national budget organization. This study aims to generate a market growth curve for ICT (information and communication technology) goods using past time series data; categorize products showing similar growth patterns; understand markets in the industry; and forecast the future outlook of such products. This study suggests the useful and meaningful process (or methodology) to identify the market growth pattern with quantitative growth model and data mining algorithm. The study employs the following methodology. At the first stage, past time series data are collected based on the target products or services of categorized industry. The data, such as the volume of sales and domestic consumption for a specific product or service, are collected from the relevant government ministry, the National Statistical Office, and other relevant government organizations. For collected data that may not be analyzed due to the lack of past data and the alteration of code names, data pre-processing work should be performed. At the second stage of this process, an optimal model for market forecasting should be selected. This model can be varied on the basis of the characteristics of each categorized industry. As this study is focused on the ICT industry, which has more frequent new technology appearances resulting in changes of the market structure, Logistic model, Gompertz model, and Bass model are selected. A hybrid model that combines different models can also be considered. The hybrid model considered for use in this study analyzes the size of the market potential through the Logistic and Gompertz models, and then the figures are used for the Bass model. The third stage of this process is to evaluate which model most accurately explains the data. In order to do this, the parameter should be estimated on the basis of the collected past time series data to generate the models' predictive value and calculate the root-mean squared error (RMSE). The model that shows the lowest average RMSE value for every product type is considered as the best model. At the fourth stage of this process, based on the estimated parameter value generated by the best model, a market growth pattern map is constructed with self-organizing map algorithm. A self-organizing map is learning with market pattern parameters for all products or services as input data, and the products or services are organized into an $N{\times}N$ map. The number of clusters increase from 2 to M, depending on the characteristics of the nodes on the map. The clusters are divided into zones, and the clusters with the ability to provide the most meaningful explanation are selected. Based on the final selection of clusters, the boundaries between the nodes are selected and, ultimately, the market growth pattern map is completed. The last step is to determine the final characteristics of the clusters as well as the market growth curve. The average of the market growth pattern parameters in the clusters is taken to be a representative figure. Using this figure, a growth curve is drawn for each cluster, and their characteristics are analyzed. Also, taking into consideration the product types in each cluster, their characteristics can be qualitatively generated. We expect that the process and system that this paper suggests can be used as a tool for forecasting demand in the ICT and other industries.

Analysis of Radiation Treatment Planning by Dose Calculation and Optimization Algorithm (선량계산 및 최적화 알고리즘에 따른 치료계획의 영향 분석)

  • Kim, Dae-Sup;Yoon, In-Ha;Lee, Woo-Seok;Baek, Geum-Mun
    • The Journal of Korean Society for Radiation Therapy
    • /
    • v.24 no.2
    • /
    • pp.137-147
    • /
    • 2012
  • Purpose: Analyze the Effectiveness of Radiation Treatment Planning by dose calculation and optimization algorithm, apply consideration of actual treatment planning, and then suggest the best way to treatment planning protocol. Materials and Methods: The treatment planning system use Eclipse 10.0. (Varian, USA). PBC (Pencil Beam Convolution) and AAA (Anisotropic Analytical Algorithm) Apply to Dose calculation, DVO (Dose Volume Optimizer 10.0.28) used for optimized algorithm of Intensity Modulated Radiation Therapy (IMRT), PRO II (Progressive Resolution Optimizer V 8.9.17) and PRO III (Progressive Resolution Optimizer V 10.0.28) used for optimized algorithm of VAMT. A phantom for experiment virtually created at treatment planning system, $30{\times}30{\times}30$ cm sized, homogeneous density (HU: 0) and heterogeneous density that inserted air assumed material (HU: -1,000). Apply to clinical treatment planning on the basis of general treatment planning feature analyzed with Phantom planning. Results: In homogeneous density phantom, PBC and AAA show 65.2% PDD (6 MV, 10 cm) both, In heterogeneous density phantom, also show similar PDD value before meet with low density material, but they show different dose curve in air territory, PDD 10 cm showed 75%, 73% each after penetrate phantom. 3D treatment plan in same MU, AAA treatment planning shows low dose at Lung included area. 2D POP treatment plan with 15 MV of cervical vertebral region include trachea and lung area, Conformity Index (ICRU 62) is 0.95 in PBC calculation and 0.93 in AAA. DVO DVH and Dose calculation DVH are showed equal value in IMRT treatment plan. But AAA calculation shows lack of dose compared with DVO result which is satisfactory condition. Optimizing VMAT treatment plans using PRO II obtained results were satisfactory, but lower density area showed lack of dose in dose calculations. PRO III, but optimizing the dose calculation results were similar with optimized the same conditions once more. Conclusion: In this study, do not judge the rightness of the dose calculation algorithm. However, analyzing the characteristics of the dose distribution represented by each algorithm, especially, a method for the optimal treatment plan can be presented when make a treatment plan. by considering optimized algorithm factors of the IMRT or VMAT that needs to optimization make a treatment plan.

  • PDF

Statistical Analysis for Risk Factors and Prediction of Hypertension based on Health Behavior Information (건강행위정보기반 고혈압 위험인자 및 예측을 위한 통계분석)

  • Heo, Byeong Mun;Kim, Sang Yeob;Ryu, Keun Ho
    • Journal of Digital Contents Society
    • /
    • v.19 no.4
    • /
    • pp.685-692
    • /
    • 2018
  • The purpose of this study is to develop a prediction model of hypertension in middle-aged adults using Statistical analysis. Statistical analysis and prediction models were developed using the National Health and Nutrition Survey (2013-2016).Binary logistic regression analysis showed statistically significant risk factors for hypertension, and a predictive model was developed using logistic regression and the Naive Bayes algorithm using Wrapper approach technique. In the statistical analysis, WHtR(p<0.0001, OR = 2.0242) in men and AGE (p<0.0001, OR = 3.9185) in women were the most related factors to hypertension. In the performance evaluation of the prediction model, the logistic regression model showed the best predictive power in men (AUC = 0.782) and women (AUC = 0.858). Our findings provide important information for developing large-scale screening tools for hypertension and can be used as the basis for hypertension research.

A Study on the Development of a Failure Simulation Database for Condition Based Maintenance of Marine Engine System Auxiliary Equipment (선박 기관시스템 보조기기의 상태기반 고장진단/예측을 위한 고장 모사 데이터베이스 구축)

  • Kim, Jeong Yeong;Lee, Tae Hyun;Lee, Song Ho;Lee, Jong Jik;Shin, Dong Min;Lee, Won kyun;Kim, Youg Jin
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.59 no.4
    • /
    • pp.200-206
    • /
    • 2022
  • This study is to develop database by an experimental method for the development of condition based maintenance for auxiliary equipment in marine engine systems. Existing ships have been performing regular maintenance, so the actual measurement data development is very incomplete. Therefore, it is best to develop a database on land tests. In this paper, a database developed by an experimental method is presented. First, failure case analysis and reliability analysis were performed to select a failure mode. For the failure simulation test, a test bed for land testing was developed. The failure simulation test was performed based on the failure simulation scenario in which the failure simulation test plan was defined. A 1.5TB failure simulation database has been developed, and it is expected to serve as a basis for ship failure diagnosis and prediction algorithm model development.