• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2003년도 추계학술대회논문집
• /
• pp.1083-1088
• /
• 2003

This paper presents three algorithms of repetitive controller for compensation of the repeatable uncut in hard disk drive. The basic theory of the repetitive controller and the analysis of the disturbance in hard disk drive are introduced. The tracking controller is designed in order to design the "plug-in type" repetitive controller. Design of the repetitive controller is considered as the design of the filter, determination of Gain and design of additional compensation for the various types. Specially, trade-off relationship between stability and performance is important factor for the design. The thee kinds of "plug-in type" repetitive controllers are designed simulated and experimented. Performance and characteristic of them are compared by the analysis of the experimental results

• 전기학회논문지
• /
• 제58권12호
• /
• pp.2511-2519
• /
• 2009

In this paper, we introduce the methodological system design via feature selection using Principal Component Analysis and Particle Swarm Optimization algorithms. The overall methodological system design comes from three kinds of modules such as preprocessing module, feature extraction module, and recognition module. First, Histogram equalization enhance the quality of image by exploiting contrast effect based on the normalized function generated from histogram distribution values of 2D face image. Secondly, PCA extracts feature vectors to be used for face recognition by using eigenvalues and eigenvectors obtained from covariance matrix. Finally the feature selection for face recognition among the entire feature vectors is considered by means of the Particle Swarm Optimization. The optimized Polynomial-based Radial Basis Function Neural Networks are used to evaluate the face recognition performance. This study shows that the proposed methodological system design is effective to the analysis of preferred face recognition.

• Smart Structures and Systems
• /
• 제3권1호
• /
• pp.51-68
• /
• 2007

High-strength concrete (HSC) is becoming increasingly attractive for various construction projects since it offers a multitude of benefits over normal-strength concrete (NSC). Unfortunately, current design provisions for shear capacity of RC slender beams are generally based on data developed for NSC members having a compressive strength of up to 50 MPa, with limited recommendations on the use of HSC. The failure of HSC beams is noticeably different than that of NSC beams since the transition zone between the cement paste and aggregates is much denser in HSC. Thus, unlike NSC beams in which micro-cracks propagate around aggregates, providing significant aggregate interlock, micro-cracks in HSC are trans-granular, resulting in relatively smoother fracture surfaces, thereby inhibiting aggregate interlock as a shear transfer mechanism and reducing the influence of compressive strength on the ultimate shear strength of HSC beams. In this study, a new approach based on genetic algorithms (GAs) was used to predict the shear capacity of both NSC and HSC slender beams without shear reinforcement. Shear capacity predictions of the GA model were compared to calculations of four other commonly used methods: the ACI method, CSA method, Eurocode-2, and Zsutty's equation. A parametric study was conducted to evaluate the ability of the GA model to capture the effect of basic shear design parameters on the behaviour of reinforced concrete (RC) beams under shear loading. The parameters investigated include compressivestrength, amount of longitudinal reinforcement, and beam's depth. It was found that the GA model provided more accurate evaluation of shear capacity compared to that of the other common methods and better captured the influence of the significant shear design parameters. Therefore, the GA model offers an attractive user-friendly alternative to conventional shear design methods.

• 한국정보시스템학회지:정보시스템연구
• /
• 제29권3호
• /
• pp.119-144
• /
• 2020

Purpose Real estate usually takes charge of the highest proportion of physical properties which individual, organizations, and government hold and instability of real estate market affects the economic condition seriously for each economic subject. Consequently, practices for predicting the real estate market have attention for various reasons, such as financial investment, administrative convenience, and wealth management. Additionally, development of machine learning algorithms and computing hardware enhances the expectation for more precise and useful prediction models in real estate market. Design/methodology/approach In response to the demand, this paper aims to provide a framework for forecasting the real estate market with machine learning algorithms. The framework consists of demonstrating the prediction efficiency of each machine learning algorithm, interpreting the interior feature effects of prediction model with a state-of-art algorithm, LIME(Local Interpretable Model-agnostic Explanation), and comparing the results in different cities. Findings This research could not only enhance the academic base for information system and real estate fields, but also resolve information asymmetry on real estate market among economic subjects. This research revealed that macroeconomic indicators, real estate-related indicators, and Google Trends search indexes can predict real-estate prices quite well.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권4호
• /
• pp.843-859
• /
• 2024

The university course scheduling problem (UCSP) aims at optimally arranging courses to corresponding rooms, faculties, students, and timeslots with constraints. Previously, the university staff solved this thorny problem by hand, which is very time-consuming and makes it easy to fall into chaos. Even some meta-heuristic algorithms are proposed to solve UCSP automatically, while most only utilize one single algorithm, so the scheduling results still need improvement. Besides, they lack an in-depth analysis of the inner algorithms. Therefore, this paper presents a novel and practical approach based on Tabu search and simulated annealing algorithms for solving USCP. Firstly, the initial solution of the UCSP instance is generated by one construction heuristic algorithm, the first fit algorithm. Secondly, we defined one union move selector to control the moves and provide diverse solutions from initial solutions, consisting of two changing move selectors. Thirdly, Tabu search and simulated annealing (SA) are combined to filter out unacceptable moves in a parallel mode. Then, the acceptable moves are selected by one adaptive decision algorithm, which is used as the next step to construct the final solving path. Benefits from the excellent design of the union move selector, parallel tabu search and SA, and adaptive decision algorithm, the proposed method could effectively solve UCSP since it fully uses Tabu and SA. We designed and tested the proposed algorithm in one real-world (PKNU-UCSP) and ten random UCSP instances. The experimental results confirmed its effectiveness. Besides, the in-depth analysis confirmed each component's effectiveness for solving UCSP.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 A
• /
• pp.298-300
• /
• 2002

The design of a measurement system to perform Harmonic State Estimation (HSE) is a very complex problem. In particular, the number of available harmonic instruments(Continuous Harmonic Analysis in Real Time : CHART) is always limited. Therefore, a systematic procedure is needed to design the optimal placement of measurement points. This paper presents a new HSE algorithm which is based on an optimal placement of measurement points using Genetic Algorithms (GAs). This HSE has been applied to the New Zealand AC Power System for the validation of the new HSE algorithm. The study results have indicated an economical and effective method for optimal placement of measurement points using GAs in the HSE.

• 전자공학회논문지S
• /
• 제35S권10호
• /
• pp.34-41
• /
• 1998

본 논문에서는 155Mbps 급 ATM 고속위성 전송에 적합한 동기 요소기술을 제시하고 추적성능 개선을 위한 최적 알고리즘을 제안하였다. 이때 신호변조는 QPSK방식을 사용하였고 수신기는 버스트 모드로 동작함을 가정하였다. 이러한 점을 바탕으로 주파수동기(AFC), 위상동기(CR), 비트동기(STR)의 여러 요소기술 및 방식을 검토하고 문제점을 개선한 방안을 제시하였다. 또한 AWGN 채널 환경하에서 요구 심벌수, 정상상태 안정도, 그리고 하드웨어(H/W) 구현 난이도에 중점을 두어 제안한 각 동기 요소기술의 제반 성능평가를 수행하였다.

• 한국해양공학회:학술대회논문집
• /
• 한국해양공학회 2000년도 춘계학술대회 논문집
• /
• pp.96-103
• /
• 2000

This research is a new design method, which will be presented as a basic concept for a more efficient minimum weight design of grillages, as an attempt to describe true collapse mechanism in as overall search as possible. It serves as introduction to the numerical technique of Linear Programming(LP) and Automatic Modified Direct Plastic Frame Analysis(AMDPFA). Attention is directed to both analysis and design, and emphasis is placed on the physical significance of Systematic Searching Techniques(SST) involved. In weight minimum grillages design, the parameterisation study in optimum beam configuration which was carried out over the range of beam sections for a given plastic section modulus likely to occur in structures by suing an adaptive stochastic optimisation technique, Genetic Algorithms.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2004년도 하계학술대회 논문집 Vol.5 No.1
• /
• pp.33-36
• /
• 2004

The process modeling for the growth rate in pulsed laser deposition(PLD)-grown ZnO thin films is investigated using neural networks(NNets) and the process recipes is optimized via genetic algorithms(GAs). D-optimal design is carried out and the growth rate is characterized by NNets based on the back-propagation(BP) algorithm. GAs is then used to search the desired recipes for the desired growth rate. The statistical analysis is used to verify the fitness of the nonlinear process model. This process modeling and optimization algorithms can explain the characteristics of the desired responses varying with process conditions.

• 한국CDE학회논문집
• /
• 제11권2호
• /
• pp.97-106
• /
• 2006

Voronoi diagrams have been known for numerous important applications in science and engineering including CAD/CAM. Especially, the Voronoi diagram for 3D spheres has been known as very useful tool to analyze spatial structural properties of molecules or materials modeled by a set of spherical atoms. In this paper, we present two algorithms, the edge-tracing algorithm and the region-expansion algorithm, for constructing the Voronoi diagram of 3D spheres and applications to protein structure analysis. The basic scheme of the edge-tracing algorithm is to follow Voronoi edges until the construction is completed in O(mn) time in the worst-case, where m and n are the numbers of edges and spheres, respectively. On the other hand, the region-expansion algorithm constructs the desired Voronoi diagram by expanding Voronoi regions for one sphere after another via a series of topology operations, starting from the ordinary Voronoi diagram for the centers of spheres. It turns out that the region-expansion algorithm also has the worst-case time complexity of O(mn). The Voronoi diagram for 3D spheres can play key roles in various analyses of protein structures such as the pocket recognition, molecular surface construction, and protein-protein interaction interface construction.