• 제목/요약/키워드: Optimal candidate

검색결과 380건 처리시간 0.027초

자동치부품(시트, 도어) 6축 진동 재현을 위한 가진 프로파일 생성 기법 (Generating Method of the Input Profile in the MAST System)

  • 이봉현;김기훈;김찬중
    • 한국소음진동공학회논문집
    • /
    • 제15권9호
    • /
    • pp.1070-1076
    • /
    • 2005
  • Vibration test using the MAST(multi axial simulation table) provide a more reliable testing environment than any conventional one. The multi axial simulation could be possible with a advanced control algorithm and hardware supports so that most of the operation is automatically conducted by MAST system itself except the input information that is synthesized by the measured response signals. That means the reliability of the vibration test is highly depended on the quality of the input profile. In this paper, the optimal algorithm based on the energy method is introduced to construct a best combination of candidated input PSD data could be constructed. Since the optimal algorithm renders time information, the nitration fatigue test is completely possible for any measured signals one wants. The proposed method is explained with representing acquired road signals from the candidate input PSD obtained from a proving ground.

부산항을 중심으로 한 동남아 항만 물동량의 최적 환적 거점 선정에 관한 연구 : 시뮬레이션 분석 방법으로 (Selection of the Optimal Transshipment Port Based on the Port Traffic of Southeast Asia)

  • 임세진;김경섭;박윤선;정석재
    • 산업경영시스템학회지
    • /
    • 제30권4호
    • /
    • pp.62-70
    • /
    • 2007
  • Recently, the increasing trend for the transshipment traffic of Busan port in Korea is slowing down because of the extensive development plan of domestic ports in china. For solving this problem, Korea is going on the project for preoccupying the transshipment port for attraction of port traffic from the newly potential markets(NPM) based on the Northeast Asia area. As a part of the project, this paper proposes the efficient methodology for selecting the optimal shipping network and strategic transshipment port within NPM using the mathematical models and simulation analysis. For that, we firstly find the alternative transshipment ports within NPM through the status analysis of the current port traffic and shipping network and then, we choose the candidate transshipment-ports in order of minimizing the transport costs through the mathematical approach. With the scenarios based on the selected transshipment-ports, we perform the simulation analysis for choosing the optimal transshipment-ports and the shipping network minimizing the total costs and times concurrently. We expect that the results of this paper will be used efficiently when korea select the strategic transshipment-port in the future.

특성 손실 평가를 통한 하이브리드 자동차 동력전달장치의 빠른 설계 최적화 (Computationally Effective Optimization of Hybrid Vehicle Powertrain Design Using Characteristic Loss Evaluation)

  • 박세호;안창선
    • 한국자동차공학회논문집
    • /
    • 제23권6호
    • /
    • pp.591-600
    • /
    • 2015
  • The efficiency of a powertrain system of hybrid vehicle is highly dependent on the design and control of the hybrid powertrain system. In other words, the optimal design of the powertrain systems is coupled with optimal control of the powertrain system. Therefore, the solution of an optimal design problem for hybrid vehicles is computationally and timely very expensive. For example, dynamic programming, which is a recursive optimization method, is usually used to evaluate the best fuel economy of certain hybrid vehicle design, and, thus, the evaluation takes tens of minutes to several hours. This research aims to accelerate the speed of efficiency evaluation of hybrid vehicles. We suggest a mathematical treat and a methodological treat to reduce the computational load. The mathematical treat is that the dynamics of system is discretized with sparse sampling time without loss of energy balance. The methodological treat is that the efficiency of the hybrid vehicle is inferred by characteristic loss evaluation that is computationally inexpensive. With the suggested methodology, evaluating a design candidate of hybrid powertrain system is taken few minutes, which was taken several hours when dynamic programming is used.

Experimental Optimal Choice Of Initial Candidate Inliers Of The Feature Pairs With Well-Ordering Property For The Sample Consensus Method In The Stitching Of Drone-based Aerial Images

  • Shin, Byeong-Chun;Seo, Jeong-Kweon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권4호
    • /
    • pp.1648-1672
    • /
    • 2020
  • There are several types of image registration in the sense of stitching separated images that overlap each other. One of these is feature-based registration by a common feature descriptor. In this study, we generate a mosaic of images using feature-based registration for drone aerial images. As a feature descriptor, we apply the scale-invariant feature transform descriptor. In order to investigate the authenticity of the feature points and to have the mapping function, we employ the sample consensus method; we consider the sensed image's inherent characteristic such as the geometric congruence between the feature points of the images to propose a novel hypothesis estimation of the mapping function of the stitching via some optimally chosen initial candidate inliers in the sample consensus method. Based on the experimental results, we show the efficiency of the proposed method compared with benchmark methodologies of random sampling consensus method (RANSAC); the well-ordering property defined in the context and the extensive stitching examples have supported the utility. Moreover, the sample consensus scheme proposed in this study is uncomplicated and robust, and some fatal miss stitching by RANSAC is remarkably reduced in the measure of the pixel difference.

Sparse Signal Recovery via Tree Search Matching Pursuit

  • Lee, Jaeseok;Choi, Jun Won;Shim, Byonghyo
    • Journal of Communications and Networks
    • /
    • 제18권5호
    • /
    • pp.699-712
    • /
    • 2016
  • Recently, greedy algorithm has received much attention as a cost-effective means to reconstruct the sparse signals from compressed measurements. Much of previous work has focused on the investigation of a single candidate to identify the support (index set of nonzero elements) of the sparse signals. Well-known drawback of the greedy approach is that the chosen candidate is often not the optimal solution due to the myopic decision in each iteration. In this paper, we propose a tree search based sparse signal recovery algorithm referred to as the tree search matching pursuit (TSMP). Two key ingredients of the proposed TSMP algorithm to control the computational complexity are the pre-selection to put a restriction on columns of the sensing matrix to be investigated and the tree pruning to eliminate unpromising paths from the search tree. In numerical simulations of Internet of Things (IoT) environments, it is shown that TSMP outperforms conventional schemes by a large margin.

Model Predictive Torque Control of Surface Mounted Permanent Magnet Synchronous Motor Drives with Voltage Cost Functions

  • Zhang, Xiaoguang;Hou, Benshuai;He, Yikang;Gao, Dawei
    • Journal of Power Electronics
    • /
    • 제18권5호
    • /
    • pp.1369-1379
    • /
    • 2018
  • In this paper, a model predictive torque control (MPTC) without the use of a weighting factor for surface mounted permanent-magnet synchronous machine (SPMSM) drive systems is presented. Firstly, the desired voltage vector is predicted in real time according to the principles of deadbeat torque and flux control. Then the sector of this desired voltage vector is determined. The complete enumeration for testing all of the feasible voltage vectors is avoided by testing only the candidate vectors contained in the sector. This means that only two voltage vectors in the sector need to be tested for selecting the optimal voltage vector in each control period. Thus, the calculation time can be reduced when compared with the conventional enumeration method. On the other hand, a novel cost function that only includes the dq-axis voltage errors between the desired voltage and candidate voltage is designed to eliminate the weighting factor used in the conventional MPTC. Thus, the control complexity caused by the tuning of the weighting factor is effectively decreased when compared with the conventional MPTC. Simulation and experimental investigation have been carried out to verify the proposed method.

에러 강인성을 위한 모순 검증 기반 움직임 벡터 부-복호화 (Motion Vector Coding with Error Robustness Based on Contradiction Testing)

  • 원광현;양정엽;전병우
    • 방송공학회논문지
    • /
    • 제17권2호
    • /
    • pp.252-261
    • /
    • 2012
  • 본 논문은 에러 발생 가능한 예측 움직임 벡터를 제외한 후보 예측 움직임 벡터들 중 율-왜곡 관점에서 최적의 예측 움직임 벡터를 선택하고 그에 대한 인덱스 정보에 대해 모순 검증 기술을 적용한다. 이를 통하여 후보 예측 움직임 벡터 대상들 중 모순으로 판명된 일부를 대상 후보 집합에서 제외시켜 부호화 효율을 증가시키는 방법을 제안한다. 제안하는 모순 검증 기반 움직임 벡터 부호화 방법은 H.264/AVC 방법과 비교하여 최대 1.8%의 비트량을 절감시킨다.

가변길이 그램의 역리스트 생성을 이용한 효율적인 유사 문자열 검색 기법 (An Efficient String Similarity Search Technique based on Generating Inverted Lists of Variable-Length Grams)

  • 김종익
    • 정보과학회 논문지
    • /
    • 제43권11호
    • /
    • pp.1275-1280
    • /
    • 2016
  • 유사 문자열 검색을 위해 기존의 기법들은 우선 후보 문자열 집합을 생성한 후에 후보 문자열을 검증하는 방법을 사용한다. 이때, 유사 문자열 검색의 성능을 결정짓는 가장 중요한 요소는 후보 생성 방법이다. 기존의 기법들은 질의 문자열로부터 고정길이 q-그램들을 선택하고, 선택된 q-그램에 해당하는 역리스트를 이용해 후보 문자열을 생성한다. 본 논문에서는 질의 문자열 내의 가변길이 그램들을 사용하여 후보 문자열을 생성할 수 있는 기법과 질의 문자열로부터 최적의 가변길이 그램들의 조합을 선택하는 동적 프로그래밍 알고리즘을 제안한다. 실험을 통해 제안하는 기법이 기존의 기법들 보다 유사 문자열 검색의 성능을 향상시킴을 보인다.

Optimal location planning to install wind turbines for hydrogen production: A case study

  • Mostafaeipour, Ali;Arabi, Fateme;Qolipour, Mojtaba;Shamshirband, Shahaboldin;Alavi, Omid
    • Advances in Energy Research
    • /
    • 제5권2호
    • /
    • pp.147-177
    • /
    • 2017
  • This study aims to evaluate and prioritize ten different sites in Iran's Khorasan provinces for the construction of wind farm. After studying the geography of the sites, nine criteria; including wind power, topography, wind direction, population, distance from power grid, level of air pollution, land cost per square meter, rate of natural disasters, and distance from road network-are selected for the analysis. Prioritization is performed using data envelopment analysis (DEA). The developed DEA model is validated through value engineering based on the results of brainstorming sessions. The results show that the order of priority of ten assessed candidate sites for installing wind turbines is Khaf, Afriz, Ghadamgah, Fadashk, Sarakhs, Bojnoord, Nehbandan, Esfarayen, Davarzan, and Roudab. Additionally, the outcomes extracted from the value engineering method identify the city of Khaf as the best candidate site. Six different wind turbines (7.5 to 5,000 kW) are considered in this location to generate electricity. Regarding an approach to produce and store hydrogen from wind farm installed in the location, the AREVA M5000 wind turbine can produce approximately $337ton-H_2$ over a year. It is an enormous amount that can be used in transportation and other industries.

강인한 손가락 끝 추출과 확장된 CAMSHIFT 알고리즘을 이용한 자연스러운 Human-Robot Interaction을 위한 손동작 인식 (A Robust Fingertip Extraction and Extended CAMSHIFT based Hand Gesture Recognition for Natural Human-like Human-Robot Interaction)

  • 이래경;안수용;오세영
    • 제어로봇시스템학회논문지
    • /
    • 제18권4호
    • /
    • pp.328-336
    • /
    • 2012
  • In this paper, we propose a robust fingertip extraction and extended Continuously Adaptive Mean Shift (CAMSHIFT) based robust hand gesture recognition for natural human-like HRI (Human-Robot Interaction). Firstly, for efficient and rapid hand detection, the hand candidate regions are segmented by the combination with robust $YC_bC_r$ skin color model and haar-like features based adaboost. Using the extracted hand candidate regions, we estimate the palm region and fingertip position from distance transformation based voting and geometrical feature of hands. From the hand orientation and palm center position, we find the optimal fingertip position and its orientation. Then using extended CAMSHIFT, we reliably track the 2D hand gesture trajectory with extracted fingertip. Finally, we applied the conditional density propagation (CONDENSATION) to recognize the pre-defined temporal motion trajectories. Experimental results show that the proposed algorithm not only rapidly extracts the hand region with accurately extracted fingertip and its angle but also robustly tracks the hand under different illumination, size and rotation conditions. Using these results, we successfully recognize the multiple hand gestures.