• Title/Summary/Keyword: search method

Search Result 5,588, Processing Time 0.039 seconds

Optimization Study of a Helicopter Rotor Blade Section Using EDISON Ksec2D and Grid Search Method (EDISON Ksec2D와 Grid Search 법을 이용한 헬리콥터 블레이드 단면의 형상 최적화)

  • Na, Deok-Hwan;Hahm, Jae-Joon;Bae, Jae-Seong
    • Proceeding of EDISON Challenge
    • /
    • 2016.03a
    • /
    • pp.183-189
    • /
    • 2016
  • In this paper, an optimization study on a helicopter rotor blade cross-section was made. Generalization was made to the baseline cross-section to simplify the analysis. To have better performance in aeroelastic response, with the aerodynamic center being the origin of the baseline, the distance between aerodynamic center and shear center, and the distance between mass center and shear center of the blade were minimized. For efficient searching of optimum solutions over the design space, grid search method, which is a method of graphical search was used. Two design variables, radius of balancing weight at leading edge, and offset of the spar from leading edge were selected for the study. Cubic spline interpolation method was used to accommodate searching of the optimum solution. 2-Leveled searching system was devised in accordance with the interpolation method. Optimum solution was found to show 6% decrease in both distance between aerodynamic center and shear center, and mass center and shear center to the baseline.

  • PDF

Improvement of Detailed Fault Point Decision Using EMTP Analysis of Search Coil Method for HVDC Cables (Search Coil법의 EMTP 분석을 통한 HVDC 케이블 상세 고장지점 판정 정확도 개선)

  • Jung, Chae-Kyun;Park, Jin-Woo;Yang, Byeong-Mo;Kang, Ji-Won;Lee, Jong-Beom
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.9
    • /
    • pp.1656-1662
    • /
    • 2011
  • In a previous paper, the EMTP modeling technique using search coil test is established through various transient analysis including system grounding condition and grounding resistance for HVDC submarine cables. It was also proved by comparison with real test results. Based on this EMTP modeling technique, in this paper, it will be applied for modeling of ${\pm}180kV$ real HVDC submarine system(Jeju~Haenam). This paper variously analyses the effects of fault resistance including the resistance between core and sheath, the resistance between sheath and amore and the resistance between amore and sea water through EMTP modeling of search coil method. The results can contribute to the accuracy of detailed fault point prediction of search coil test for HVDC submarine cables.

Image Search Method Based on Bresenham Raster Algorithm for Omnidirectional Structured Light Image (전방향 구조광 영상을 위한 Bresenham 래스터 알고리즘 기반 영상 탐색 방법)

  • Shin, Jin;Yi, Soo-Yeong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.2
    • /
    • pp.145-148
    • /
    • 2011
  • In this paper, we proposed a search method for structured light pixels of omnidirectional structured light image. Since the omnidirectional structured light image is composed of several circular arc segments, the proposed algorithm searches the structured light pixels in radial direction rather than horizontal or vertical directions. The proposed search algorithm is based on the well-known Bresenham raster algorithm for line drawing in discrete integer space, thereby computation of the algorithm is very efficient. Comparison results between the proposed search algorithm and the conventional horizontal search are presented in experiments.

A new approach for k-anonymity based on tabu search and genetic algorithm

  • Run, Cui;Kim, Hyoung-Joong;Lee, Dal-Ho
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.10 no.4
    • /
    • pp.128-134
    • /
    • 2011
  • Note that k-anonymity algorithm has been widely discussed in the area of privacy protection. In this paper, a new search algorithm to achieve k-anonymity for database application is introduced. A lattice is introduced to form a solution space for a k-anonymity problem and then a hybrid search method composed of tabu search and genetic algorithm is proposed. In this algorithm, the tabu search plays the role of mutation in the genetic algorithm. The hybrid method with independent tabu search and genetic algorithm is compared, and the hybrid approach performs the best in average case.

  • PDF

Optimum design of geometrically non-linear steel frames with semi-rigid connections using a harmony search algorithm

  • Degertekin, S.O.;Hayalioglu, M.S.;Gorgun, H.
    • Steel and Composite Structures
    • /
    • v.9 no.6
    • /
    • pp.535-555
    • /
    • 2009
  • The harmony search method based optimum design algorithm is presented for geometrically non-linear semi-rigid steel frames. Harmony search method is recently developed metaheuristic algorithm which simulates the process of producing a musical performance. The optimum design algorithm aims at obtaining minimum weight steel frames by selecting from standard set of steel sections such as European wide flange beams (HE sections). Strength constraints of Turkish Building Code for Steel Structures (TS648) specification and displacement constraints were used in the optimum design formulation. The optimum design algorithm takes into account both the geometric non-linearity of the frame members and the semi-rigid behaviour of the beam-to-column connections. The Frye-Morris polynomial model is used to calculate the moment-rotation relation of beam-to-column connections. The robustness of harmony search algorithm, in comparison with genetic algorithms, is verified with two benchmark examples. The comparisons revealed that the harmony search algorithm yielded not only minimum weight steel frames but also required less computational effort for the presented examples.

Parameter Calibration of the Nonlinear Muskingum Model using Harmony Search

  • Geem, Zong-Woo;Kim, Joong-Hoon;Yoon, Yong-Nam
    • Journal of Korea Water Resources Association
    • /
    • v.33 no.S1
    • /
    • pp.3-10
    • /
    • 2000
  • A newly developed heuristic algorithm, Harmony Search, is applied to the parameter calibration problem of the nonlinear Muskingum model. The Harmony Search could, mimicking the improvisation of music player, find better parameter values for in the nonlinear Muskingum model than five other methods including another heuristic method, genetic algorithm, in the aspect of SSQ(the sum of the square of the deviations between the observed and routed outflows) as well as in the aspects of SAD(the sum of the absolute value of the deviations), DPO(deviations of peak of routed and actual flows) and DPOT(deviatios of peak time of routed and actual outflow). Harmony Search also has the advantage that it does not require the process of asuming the initial values of desing parameters. The sensitivity analysis of Harmony Memory Considering Rate showed that relatively large values of Harmony Memory Considering Rate makes the Harmony Search converge to a better solution.

  • PDF

A Study on Image Segmentation and Tracking based on Intelligent Method (지능기법을 이용한 영상분활 및 물체추적에 관한 연구)

  • Lee, Min-Jung;Hwang, Gi-Hyun;Kim, Jeong-Yoon;Jin, Tae-Seok
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.311-312
    • /
    • 2007
  • This dissertation proposes a global search and a local search method to track the object in real-time. The global search recognizes a target object among the candidate objects through the entire image search, and the local search recognizes and track only the target object through the block search. This dissertation uses the object color and feature information to achieve fast object recognition. Finally we conducted an experiment for the object tracking system based on a pan/tilt structure.

  • PDF

Parameter Calibration o fthe Nonlinear Muskingum Model using Harmony Search

  • Geem, Jong-Woo;Kim, Joong-Hoon;Yoon, Yong-Nam
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2000.05a
    • /
    • pp.3-10
    • /
    • 2000
  • A newly developed heuristic algorithm, Harmony Search, is applied to the parameter calibration problem of the nonlinear Muskingum model. The Harmony Search could, mimicking the improvisation of music players, find better parameter values for in the nonlinear Muskingum model than five other methods including another heuristic method, genetic algorithm, in the aspect of SSQ (the sum of the square of the deviations between the observed and routed outflows) as well as in the aspects of SAD (the sum of the absolute value of the deviations), DPO (deviations of peak of routed and actual flows) and DPOT (deviations of peak time of rented and actual outflow). Harmony Search also has the advantage that it does not require the process of assuming the initial values of design parameters. The sensitivity analysis of Harmony Memory Considering Rate showed that relatively large values of Harmony Memory Considering Rate makes the Harmony Search converse to a better solution.

  • PDF

Robust architecture search using network adaptation

  • Rana, Amrita;Kim, Kyung Ki
    • Journal of Sensor Science and Technology
    • /
    • v.30 no.5
    • /
    • pp.290-294
    • /
    • 2021
  • Experts have designed popular and successful model architectures, which, however, were not the optimal option for different scenarios. Despite the remarkable performances achieved by deep neural networks, manually designed networks for classification tasks are the backbone of object detection. One major challenge is the ImageNet pre-training of the search space representation; moreover, the searched network incurs huge computational cost. Therefore, to overcome the obstacle of the pre-training process, we introduce a network adaptation technique using a pre-trained backbone model tested on ImageNet. The adaptation method can efficiently adapt the manually designed network on ImageNet to the new object-detection task. Neural architecture search (NAS) is adopted to adapt the architecture of the network. The adaptation is conducted on the MobileNetV2 network. The proposed NAS is tested using SSDLite detector. The results demonstrate increased performance compared to existing network architecture in terms of search cost, total number of adder arithmetics (Madds), and mean Average Precision(mAP). The total computational cost of the proposed NAS is much less than that of the State Of The Art (SOTA) NAS method.

Optimal Cutting Plan for 1D Parts Using Genetic Algorithm and Heuristics (유전자알고리즘 및 경험법칙을 이용한 1차원 부재의 최적 절단계획)

  • Cho, K.H.
    • Proceedings of the KSME Conference
    • /
    • 2001.06c
    • /
    • pp.554-558
    • /
    • 2001
  • In this study, a hybrid method is used to search the pseudo-optimal solution for the I-dimentional nesting problem. This method is composed of the genetic algorithm for the global search and a simple heuristic one for the local search near the pseudo optimal solution. Several simulation results show that the hybrid method gives very satisfactory results.

  • PDF