• Title/Summary/Keyword: adaptive weight

Search Result 450, Processing Time 0.033 seconds

Optimal Design of Electric Vehicle Cross Beam for Adaptive Design of Homogenized Structure (균질화된 구조의 적응설계를 위한 전동차 크로스 빔의 최적설계)

  • 백석흠;이경영;조석수;장득열;주원식
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.12 no.5
    • /
    • pp.85-93
    • /
    • 2004
  • Electric vehicle body has to be subjected to uniform load and requires auxiliary equipment such as air pipe and electric wire pipe. Especially, the cross beam supports the weight of passenger and electrical equipments. This need to use adaptive design in initial design stage to gain economy through interchangeability between many kinds of components. This study performs the topology optimization by the concept of homogenization based on optimality criteria method which is efficient for the problem with a number of boundary condition and design variable. Therefore this provides the method to determine the optimum position and the shape of circular hole in the cross beam and then can achieve the weight minimization of electric vehicle body.

Optimal Weight Design of Steel Structures Using Adaptive Simulated Annealing Algorithm (ASA알고리즘을 이용한 강구조물의 최적 중량 설계)

  • Bae, Jun-Seo;Hong, Seong-Uk;Cho, Young-Sang
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.12 no.5
    • /
    • pp.125-132
    • /
    • 2008
  • Structural optimization is widely adopted in the design of structures with the development of computer aided design and computer technique recently. By applying the structural optimization in the last decades, designers have gained the design scheme of structures more feasibly and easily. In this paper, an optimal design of one 30-story high rise steel structure is performed considering material non-linearity. Based on finite element analysis and adaptive simulated annealing algorithm, the optimal weight of structure is derived under constraints of allowable yield stress, shear stress and serviceability.

Evolutionary Neural Network based on Quantum Elephant Herding Algorithm for Modulation Recognition in Impulse Noise

  • Gao, Hongyuan;Wang, Shihao;Su, Yumeng;Sun, Helin;Zhang, Zhiwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.7
    • /
    • pp.2356-2376
    • /
    • 2021
  • In this paper, we proposed a novel modulation recognition method based on quantum elephant herding algorithm (QEHA) evolving neural network under impulse noise environment. We use the adaptive weight myriad filter to preprocess the received digital modulation signals which passing through the impulsive noise channel, and then the instantaneous characteristics and high order cumulant features of digital modulation signals are extracted as classification feature set, finally, the BP neural network (BPNN) model as a classifier for automatic digital modulation recognition. Besides, based on the elephant herding optimization (EHO) algorithm and quantum computing mechanism, we design a quantum elephant herding algorithm (QEHA) to optimize the initial thresholds and weights of the BPNN, which solves the problem that traditional BPNN is easy into local minimum values and poor robustness. The experimental results prove that the adaptive weight myriad filter we used can remove the impulsive noise effectively, and the proposed QEHA-BPNN classifier has better recognition performance than other conventional pattern recognition classifiers. Compared with other global optimization algorithms, the QEHA designed in this paper has a faster convergence speed and higher convergence accuracy. Furthermore, the effect of symbol shape has been considered, which can satisfy the need for engineering.

Routing Algorithm with Adaptive Weight Function based on Possible Available Wavelength in Optical WDM Networks

  • Pavarangkoon, Praphan;Thipchaksurat, Sakchai;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1338-1341
    • /
    • 2004
  • In this paper, we have proposed a new approach of routing and wavelength assignment algorithms, called Possible Available Wavelength (PAW) algorithm. The weight of a link is used as the main factor for routing decision in PAW algorithm. The weight of a link is defined as a function of hop count and available wavelengths. This function includes a determination factor of the number of wavelengths that are being used currently and are supposed to be available after a certain time. The session requests from users will be routed on the links that has the greatest number of link weight by using Dijkstra's shortest path algorithm. This means that the selected lightpath will has the least hop count and the greatest number of possible available wavelengths. The impact of proposed link weight computing function on the blocking probability and link utilization is investigated by means of computer simulation and comparing with the traditional mechanism. The results show that the proposed PAW algorithm can achieve the better performance in terms of the blocking probability and link utilization.

  • PDF

A Method toy Modifying Dynamically Measured Axle Load Using Tire model (타이어 모델을 이용한 계측 축중의 보상 방법)

  • 조일수;김성욱;이주형;박종연;이동훈;조동일
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.437-437
    • /
    • 2000
  • It is more difficult to accurately weigh vehicles in motion than to weigh standing vehicles. The difficulties in weighing vehicles result from sensor Limitations as well as dynamic effects induced by vehicle/pavement interactions, This paper presents a method for improving the accuracy of measured axle load information using the so-called adaptive footprint tire model. The total vehicle weight as well as individual axle weight information are obtained experimentally using two piezoelectric sensors. Results are obtained for a light car, mid-site passenger car, and 2 dump trucks with known weight experimental results show that the proposed method using the tire model is accurate.

  • PDF

The Performance Improvement of MCMA Adaptive Equalization in 16-QAM Signal using Dual Weight Vector (이중 가중치 벡터를 이용한 16-QAM 신호의 MCMA 적응 등화 성능 개선)

  • Yoon, Jae-Sun;Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.6
    • /
    • pp.41-47
    • /
    • 2011
  • This paper is concerned with the DW-MCMA(Dual Weight vector Modified Constant Modulus Algorithm) adaptive equalization algorithm using the dual weight vector in order to improve the convergence characteristic and residual inter-symbol interference which are used as the performance index for an adaptive equalizer. The equalizer is used to reduce the distortion caused by the inter-symbol interference on the wireless and the wired band-limited channel that connect the transmitting system and receiving system. The CMA is widely known as the representative algorithm for equalization. In order to transmitting the mass information with a high speed through the channels, a fast convergence speed in the equalizer performance that is able to minimize overhead needed for equalization is acquired. In this paper, By the computer simulation, we confirmed that the proposed DW-MCMA has the faster convergence speed and the smaller residual inter-symbol interference than the conventional CMA and MCMA.

General linearly constrained adaptive arrays (일반 선형제약 적응배열)

  • Chang, Byong Kun
    • The Journal of the Acoustical Society of Korea
    • /
    • v.36 no.3
    • /
    • pp.151-157
    • /
    • 2017
  • A general linearly constrained adaptive array is proposed to improve the nulling performance. The nulling performance is examined in the array weight vector space. It is shown that the constraint plane is shifted to the origin perpendicularly by the gain factor such that the increase of the gain factor results in the decrease of the distance from the constraint plane to the origin. Thus the variation of the gain factor has an effect on the extent of orthogonality between the weight vector and the steering vectors for the interferences such that the nulling performance of the general linearly constrained adaptive array is improved by the gain factor. It is observed that the proposed adaptive array with an optimum value of the gain factor yields a better nulling performance in coherent signal environment and a similar nulling performance in noncoherent signal environment compared to the conventional linearly constrained adaptive array.

Design and Implementation of Optimal Adaptive Generalized Stack Filter for Image Restoration Using Neural Networks (신경회로망을 이용한 영상복원용 적응형 일반스택 최적화 필터의 설계 및 구현)

  • Moon, Byoung-Jin;Kim, Kwang-Hee;Lee, Bae-Ho
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.7
    • /
    • pp.81-89
    • /
    • 1999
  • Image obtained by incomplete communication always include noise, blur and distortion, etc. In this paper, we propose and apply the new spatial filter algorithm, called an optimal adaptive generalized stack filter(AGSF), which optimizes adaptive generalized stack filter(AGSF) using neural network weight learning algorithm of back-propagation learning algorithm for improving noise removal and edge preservation rate. AGSF divides into two parts: generalized stack filter(GSF) and adaptive multistage median filter(AMMF), GSF improves the ability of stack filter algorithm and AMMF proposes the improved algorithm for reserving the sharp edge. Applied to neural network theory, the proposed algorithm improves the performance of the AGSF using two weight learning algorithms, such as the least mean absolute(LAM) and least mean square (LMS) algorithms. Simulation results of the proposed filter algorithm are presented and discussed.

  • PDF

A study on wideband adaptive beamforming based on WBRCB for passive uniform line array sonar (WBRCB 기반의 수동 선배열 소나 광대역 적응빔형성 기법 연구)

  • Hyun, Ara;Ahn, Jae-Kyun;Yang, In-Sik;Kim, Gwang-Tae
    • The Journal of the Acoustical Society of Korea
    • /
    • v.38 no.2
    • /
    • pp.145-153
    • /
    • 2019
  • Adaptive beamforming methods are known to suppress sidelobes and improve detection performance of weak signal by constructing weight vectors depending on the received signal itself. A standard adaptive beamforming like the MVDR (Minimum Variance Distortionless Response) is very sensitive to mismatches between weight vectors and actual signal steering vectors. Also, a large computational complexity for estimating a stable covariance matrix is required when wideband beamforming for a large-scale array is used. In this paper, we exploit the WBRCB (Wideband Robust Capon Beamforming) method for stable and robust wideband adaptive beamforming of a passive large uniform line array sonar. To improve robustness of adaptive beamforming performance in the presence of mismatches, we extract a optimum mismatch parameter. WBRCB with extracted mismatch parameter shows performance improvement in beamforming using synthetic and experimental passive sonar signals.

Improvement for Hearing Aids System Using Adaptive Beam-forming Algorithm (적응 빔포밍 기법을 적용한 보청기 시스템의 성능 향상에 관한 연구)

  • 이채욱;오신범
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5C
    • /
    • pp.673-682
    • /
    • 2004
  • The adaptive beam-forming is promising approach for noise reduction in hearing aids. This approach has come in the focus of interest only recently, because of the availability of new and powerful digital signal processors. The adaptation U using usually a Least Mean Squares algorithm, updates the weight vector. In this Paper, we propose a fast wavelet based adaptive algorithm using variable step size algorithm which varies adaptive constant by the change of signal environment. We compared the performance of the proposed algorithm with the known adaptive algorithm using computer simulation of multi channel adaptive bemformer in hearing aids. As the result the proposed algorithm is suitable for adaptive signal processing area using hearing aids and has advantages reducing computational complexity. And we show the beam-forming system using proposed algorithm converges stably in a sudden change of system environment.