• 제목/요약/키워드: Original Benchmark

검색결과 64건 처리시간 0.026초

Quadratic 복수 컨테이너 적재 문제에 관한 연구 (A Study on the Quadratic Multiple Container Packing Problem)

  • 여기태;석상문;이상욱
    • 한국경영과학회지
    • /
    • 제34권3호
    • /
    • pp.125-136
    • /
    • 2009
  • The container packing problem Is one of the traditional optimization problems, which is very related to the knapsack problem and the bin packing problem. In this paper, we deal with the quadratic multiple container picking problem (QMCPP) and it Is known as a NP-hard problem. Thus, It seems to be natural to use a heuristic approach such as evolutionary algorithms for solving the QMCPP. Until now, only a few researchers have studied on this problem and some evolutionary algorithms have been proposed. This paper introduces a new efficient evolutionary algorithm for the QMCPP. The proposed algorithm is devised by improving the original network random key method, which is employed as an encoding method in evolutionary algorithms. And we also propose local search algorithms and incorporate them with the proposed evolutionary algorithm. Finally we compare the proposed algorithm with the previous algorithms and show the proposed algorithm finds the new best results in most of the benchmark instances.

Stability Improved Split-step Parabolic Equation Model

  • Kim, Tae-Hyun;Seong, Woojae
    • The Journal of the Acoustical Society of Korea
    • /
    • 제21권3E호
    • /
    • pp.105-111
    • /
    • 2002
  • The parabolic equation technique provides an excellent model to describe the wave phenomena when there exists a predominant direction of propagation. The model handles the square root wave number operator in paraxial direction. Realization of the pseudo-differential square root operator is the essential part of the parabolic equation method for its numerical accuracy. The wide-angled approximation of the operator is made based on the Pade series expansion, where the branch line rotation scheme can be combined with the original Pade approximation to stabilize its computational performance for complex modes. The Galerkin integration has been employed to discretize the depth-dependent operator. The benchmark tests involving the half-infinite space, the range independent and dependent environment will validate the implemented numerical model.

데이타 상관 증가에 의한 저전력 상위 수준 합성 (Low power high level synthesis by increasing data correlation)

  • 신동완;최기영
    • 전자공학회논문지C
    • /
    • 제34C권5호
    • /
    • pp.1-17
    • /
    • 1997
  • With the increasing performance and density of VLSI scircuits as well as the popularity of portable devices such as personal digital assitance, power consumption has emerged as an important issue in the design of electronic systems. Low power design techniqeus have been pursued at all design levels. However, it is more effective to attempt to reduce power dissipation at higher levels of abstraction which allow wider view. In this paper, we propose a simultaneous scheduling and binding scheme which increases the correlation between cosecutive inputs to an operation so that the switched capacitance of execution units is reduced in datapath-dominated circuits. The proposed method is implemented and integrated into the scheduling and assignment part of HYPER synthesis environment. Compared with original HYPER synthesis system, average power saving of 23.0% in execution units and 14.2% in the whole circuits, ar eobtained for a set of benchmark examples.

  • PDF

다양성을 유지하는 새로운 진화 프로그래밍 기법 (A New Diversity Preserving Evolutionary Programming Technique)

  • 신정환;진성일;최두현
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1999년도 추계종합학술대회 논문집
    • /
    • pp.1011-1014
    • /
    • 1999
  • In this paper, a new algorithm has been presented that helps to preserve diversity as well as to enhance the convergence speed of the evolutionary programming. This algorithm is based on the cell partitioning of search region for preserving the diversity. Until now, the greater part of researches is not concerned about preserving the diversity of individuals in a population but improving convergence speed. Although these evolutions are started from multi-point search at the early phase, but at the end those search points are swarming about a one-point, the strong candidate. These evolutions vary from the original idea in some points such as multi-point search. In most case we want to find the only one point of the best solution not several points in the vicinity of that. That is why the cell partitioning of search region has been used. By restricting the search area of each individual, the diversity of individual in solution space is preserved and the convergence speed is enhanced. The efficiency of the proposed algorithm has been verified through benchmark test functions.

  • PDF

랜덤 포레스트 분류기 기반의 컨벌루션 뉴럴 네트워크를 이용한 속도제한 표지판 인식 (Speed-limit Sign Recognition Using Convolutional Neural Network Based on Random Forest)

  • 이은주;남재열;고병철
    • 방송공학회논문지
    • /
    • 제20권6호
    • /
    • pp.938-949
    • /
    • 2015
  • 본 논문에서는 외부압력에 의한 외형 손상이나 빛의 방향에 따른 색상 대비변화 등에 견고한 영상기반 속도 제한 표지판 인식 시스템 설계를 제안한다. 속도 제한 표지판 인식을 위해서 최근 패턴 인식 분야에서 뛰어한 성능을 보여주고 있는 CNN (Convolutional neural network)을 사용한다. 하지만 기존의 CNN은 특징 추출을 위해 다수의 은닉층이 사용되고 추출된 결과에 대해 MLP(Multi-layer perceptron) 등과의 완전 연결(fully-connected) 방식을 사용함으로 학습과 테스트 시간이 많이 걸리는 단점이 있다. 본 논문에서는 이러한 단점을 줄이기 위해 2계층의 CNN을 구성하고 패턴 분류를 위해 랜덤 포레스트(Random forest)를 결합하여 완전 연결이 아닌 랜덤 연결 방식을 적용하였다. GTSRB(German Traffic Sign Recognition Benchmark)데이터의 교통안전표지판 중에서 8개 속도 제한 표지판 데이터를 사용하여 제안하는 방식이 SVM (Support Vector Machine)이나 MLP 분류기를 적용할 때 보다 성능이 우수함을 입증하였다.

Structural reliability assessment using an enhanced adaptive Kriging method

  • Vahedi, Jafar;Ghasemi, Mohammad Reza;Miri, Mahmoud
    • Structural Engineering and Mechanics
    • /
    • 제66권6호
    • /
    • pp.677-691
    • /
    • 2018
  • Reliability assessment of complex structures using simulation methods is time-consuming. Thus, surrogate models are usually employed to reduce computational cost. AK-MCS is a surrogate-based Active learning method combining Kriging and Monte-Carlo Simulation for structural reliability analysis. This paper proposes three modifications of the AK-MCS method to reduce the number of calls to the performance function. The first modification is related to the definition of an initial Design of Experiments (DoE). In the original AK-MCS method, an initial DoE is created by a random selection of samples among the Monte Carlo population. Therefore, samples in the failure region have fewer chances to be selected, because a small number of samples are usually located in the failure region compared to the safe region. The proposed method in this paper is based on a uniform selection of samples in the predefined domain, so more samples may be selected from the failure region. Another important parameter in the AK-MCS method is the size of the initial DoE. The algorithm may not predict the exact limit state surface with an insufficient number of initial samples. Thus, the second modification of the AK-MCS method is proposed to overcome this problem. The third modification is relevant to the type of regression trend in the AK-MCS method. The original AK-MCS method uses an ordinary Kriging model, so the regression part of Kriging model is an unknown constant value. In this paper, the effect of regression trend in the AK-MCS method is investigated for a benchmark problem, and it is shown that the appropriate choice of regression type could reduce the number of calls to the performance function. A stepwise approach is also presented to select a suitable trend of the Kriging model. The numerical results show the effectiveness of the proposed modifications.

핫스팟 접근영역 인식에 기반한 바이너리 코드 역전 기법을 사용한 저전력 IoT MCU 코드 메모리 인터페이스 구조 연구 (Low-Power IoT Microcontroller Code Memory Interface using Binary Code Inversion Technique Based on Hot-Spot Access Region Detection)

  • 박대진
    • 대한임베디드공학회논문지
    • /
    • 제11권2호
    • /
    • pp.97-105
    • /
    • 2016
  • Microcontrollers (MCUs) for endpoint smart sensor devices of internet-of-thing (IoT) are being implemented as system-on-chip (SoC) with on-chip instruction flash memory, in which user firmware is embedded. MCUs directly fetch binary code-based instructions through bit-line sense amplifier (S/A) integrated with on-chip flash memory. The S/A compares bit cell current with reference current to identify which data are programmed. The S/A in reading '0' (erased) cell data consumes a large sink current, which is greater than off-current for '1' (programmed) cell data. The main motivation of our approach is to reduce the number of accesses of erased cells by binary code level transformation. This paper proposes a built-in write/read path architecture using binary code inversion method based on hot-spot region detection of instruction code access to reduce sensing current in S/A. From the profiling result of instruction access patterns, hot-spot region of an original compiled binary code is conditionally inverted with the proposed bit-inversion techniques. The de-inversion hardware only consumes small logic current instead of analog sink current in S/A and it is integrated with the conventional S/A to restore original binary instructions. The proposed techniques are applied to the fully-custom designed MCU with ARM Cortex-M0$^{TM}$ using 0.18um Magnachip Flash-embedded CMOS process and the benefits in terms of power consumption reduction are evaluated for Dhrystone$^{TM}$ benchmark. The profiling environment of instruction code executions is implemented by extending commercial ARM KEIL$^{TM}$ MDK (MCU Development Kit) with our custom-designed access analyzer.

오류 역전도 알고리즘의 학습속도 향상기법 (An Enhancement of Learning Speed of the Error - Backpropagation Algorithm)

  • 심범식;정의용;윤충화;강경식
    • 한국정보처리학회논문지
    • /
    • 제4권7호
    • /
    • pp.1759-1769
    • /
    • 1997
  • 다층신경회로망의 학습방법인 오류역전도 알고리즘은 연관기억장치, 음성인식, 패턴인식, 로보틱스등과 같은 다양한 응용분야에 널리 사용되고 있다. 그럼에도 불구하고 계속 많은 논문들이 역전도 알고리즘에 대해 발표되고 있는 실정이다. 이러한 연구 동향의 주된 이유는, 뉴런 갯수와 학습 패턴의 갯수가 큰 경우에 역전도 알고리즘의 학습속도가 상당히 느리다는 사실때문이다. 본 연구에서는 가변학습율, 가변모멘텀율, 그리고 시그모이드 함수의 가변기울기를 이용한 새로운 학습속도 가속기법을 개발하였다. 학습이 수행되는 도중에, 이러한 파라메터들은 전체 오류의 변화량에 따라 연속적으로 조정되며, 제안된 기법은 기존의 역전도 알고리즘에 비해 획기적으로 학습시간을 단축시키는 결과를 보였다. 제안된 기법의 효율성을 입증하기 위하여, 처음에는 난수발생기로 생성한 이진 데이터를 이용하여 에포크(epoch) 횟수를 비교할 때 훌륭한 속도 향상을 보였으며, 또한, 기계학습(machine learning)의 벤치마크 학습자료로 많이 사용되는 이진 Monk's data, 4, 5, 6, 7비트 패리티 검사 문제와 실수 Iris data에도 적용하였다.

  • PDF

Sparse reconstruction of guided wavefield from limited measurements using compressed sensing

  • Qiao, Baijie;Mao, Zhu;Sun, Hao;Chen, Songmao;Chen, Xuefeng
    • Smart Structures and Systems
    • /
    • 제25권3호
    • /
    • pp.369-384
    • /
    • 2020
  • A wavefield sparse reconstruction technique based on compressed sensing is developed in this work to dramatically reduce the number of measurements. Firstly, a severely underdetermined representation of guided wavefield at a snapshot is established in the spatial domain. Secondly, an optimal compressed sensing model of guided wavefield sparse reconstruction is established based on l1-norm penalty, where a suite of discrete cosine functions is selected as the dictionary to promote the sparsity. The regular, random and jittered undersampling schemes are compared and selected as the undersampling matrix of compressed sensing. Thirdly, a gradient projection method is employed to solve the compressed sensing model of wavefield sparse reconstruction from highly incomplete measurements. Finally, experiments with different excitation frequencies are conducted on an aluminum plate to verify the effectiveness of the proposed sparse reconstruction method, where a scanning laser Doppler vibrometer as the true benchmark is used to measure the original wavefield in a given inspection region. Experiments demonstrate that the missing wavefield data can be accurately reconstructed from less than 12% of the original measurements; The reconstruction accuracy of the jittered undersampling scheme is slightly higher than that of the random undersampling scheme in high probability, but the regular undersampling scheme fails to reconstruct the wavefield image; A quantified mapping relationship between the sparsity ratio and the recovery error over a special interval is established with respect to statistical modeling and analysis.

Application of simple adaptive control to an MR damper-based control system for seismically excited nonlinear buildings

  • Javanbakht, Majd;Amini, Fereidoun
    • Smart Structures and Systems
    • /
    • 제18권6호
    • /
    • pp.1251-1267
    • /
    • 2016
  • In this paper, Simple Adaptive Control (SAC) is used to enhance the seismic response of nonlinear tall buildings based on acceleration feedback. Semi-active MR dampers are employed as control actuator due to their reliability and well-known dynamic models. Acceleration feedback is used because of availability, cost-efficiency and reliable measurements of acceleration sensors. However, using acceleration feedback in the control loop causes the structure not to apparently meet some requirements of the SAC algorithm. In addition to defining an appropriate SAC reference model and using inherently stable MR dampers, a modification in the original structure of the SAC is proposed in order to improve its adaptability to the situation in which the plant does not satisfy the algorithm's stability requirements. To investigate the performance of the developed control system, a numerical study is conducted on the benchmark 20-story nonlinear building and the responses of the SAC-controlled structure are compared to an $H_2/LQG$ clipped-optimal controller under the effect of different seismic excitations. As indicated by the results, SAC controller effectively reduces the story drifts and hence the seismically-induced damage throughout the structural members despite its simplicity, independence of structural parameters and while using fewer number of dampers in contrast with the $H_2/LQG$ clipped-optimal controller.