• Title/Summary/Keyword: Cost Propagation Algorithm

Search Result 63, Processing Time 0.028 seconds

Reliability Optimization of Urban Transit Brake System For Efficient Maintenance (효율적 유지보수를 위한 도시철도 전동차 브레이크의 시스템 신뢰도 최적화)

  • Bae, Chul-Ho;Kim, Hyun-Jun;Lee, Jung-Hwan;Kim, Se-Hoon;Lee, Ho-Yong;Suh, Myung-Won
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.31 no.1 s.256
    • /
    • pp.26-35
    • /
    • 2007
  • The vehicle of urban transit is a complex system that consists of various electric, electronic, and mechanical equipments, and the maintenance cost of this complex and large-scale system generally occupies sixty percent of the LCC (Life Cycle Cost). For reasonable establishing of maintenance strategies, safety security and cost limitation must be considered at the same time. The concept of system reliability has been introduced and optimized as the key of reasonable maintenance strategies. For optimization, three preceding studies were accomplished; standardizing a maintenance classification, constructing RBD (Reliability Block Diagram) of VVVF (Variable Voltage Variable Frequency) urban transit, and developing a web based reliability evaluation system. Historical maintenance data in terms of reliability index can be derived from the web based reliability evaluation system. In this paper, we propose applying inverse problem analysis method and hybrid neuro-genetic algorithm to system reliability optimization for using historical maintenance data in database of web based system. Feed-forward multi-layer neural networks trained by back propagation are used to find out the relationship between several component reliability (input) and system reliability (output) of structural system. The inverse problem can be formulated by using neural network. One of the neural network training algorithms, the back propagation algorithm, can attain stable and quick convergence during training process. Genetic algorithm is used to find the minimum square error.

An integrated approach for optimum design of HPC mix proportion using genetic algorithm and artificial neural networks

  • Parichatprecha, Rattapoohm;Nimityongskul, Pichai
    • Computers and Concrete
    • /
    • v.6 no.3
    • /
    • pp.253-268
    • /
    • 2009
  • This study aims to develop a cost-based high-performance concrete (HPC) mix optimization system based on an integrated approach using artificial neural networks (ANNs) and genetic algorithms (GA). ANNs are used to predict the three main properties of HPC, namely workability, strength and durability, which are used to evaluate fitness and constraint violations in the GA process. Multilayer back-propagation neural networks are trained using the results obtained from experiments and previous research. The correlation between concrete components and its properties is established. GA is employed to arrive at an optimal mix proportion of HPC by minimizing its total cost. A system prototype, called High Performance Concrete Mix-Design System using Genetic Algorithm and Neural Networks (HPCGANN), was developed in MATLAB. The architecture of the proposed system consists of three main parts: 1) User interface; 2) ANNs prediction models software; and 3) GA engine software. The validation of the proposed system is carried out by comparing the results obtained from the system with the trial batches. The results indicate that the proposed system can be used to enable the design of HPC mix which corresponds to its required performance. Furthermore, the proposed system takes into account the influence of the fluctuating unit price of materials in order to achieve the lowest cost of concrete, which cannot be easily obtained by traditional methods or trial-and-error techniques.

Time Series Prediction Using a Multi-layer Neural Network with Low Pass Filter Characteristics (저주파 필터 특성을 갖는 다층 구조 신경망을 이용한 시계열 데이터 예측)

  • Min-Ho Lee
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.21 no.1
    • /
    • pp.66-70
    • /
    • 1997
  • In this paper a new learning algorithm for curvature smoothing and improved generalization for multi-layer neural networks is proposed. To enhance the generalization ability a constraint term of hidden neuron activations is added to the conventional output error, which gives the curvature smoothing characteristics to multi-layer neural networks. When the total cost consisted of the output error and hidden error is minimized by gradient-descent methods, the additional descent term gives not only the Hebbian learning but also the synaptic weight decay. Therefore it incorporates error back-propagation, Hebbian, and weight decay, and additional computational requirements to the standard error back-propagation is negligible. From the computer simulation of the time series prediction with Santafe competition data it is shown that the proposed learning algorithm gives much better generalization performance.

  • PDF

The Application of BP and RBF Neural Network Methods on Vehicle Detection in Aerial Imagery

  • Choi, Jae-Young;Jang, Hyoung-Jong;Yang, Young-Kyu
    • Korean Journal of Remote Sensing
    • /
    • v.24 no.5
    • /
    • pp.473-481
    • /
    • 2008
  • This paper presents an approach to Back-propagation and Radial Basis Function neural network method with various training set for automatic vehicle detection from aerial images. The initial extraction of candidate object is based on Mean-shift algorithm with symmetric property of a vehicle structure. By fusing the density and the symmetry, the method can remove the ambiguous objects and reduce the cost of processing in the next stage. To extract features from the detected object, we describe the object as a log-polar shape histogram using edge strengths of object and represent the orientation and distance from its center. The spatial histogram is used for calculating the momentum of object and compensating the direction of object. BPNN and RBFNN are applied to verify the object as a vehicle using a variety of non-car training sets. The proposed algorithm shows the results which are according to the training data. By comparing the training sets, advantages and disadvantages of them have been discussed.

A Study on High Resolution Ranging Algorithm for The UWB Indoor Channel

  • Lee, Chong-Hyun
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.21 no.4
    • /
    • pp.96-103
    • /
    • 2007
  • In this paper, we present a novel and numerically efficient algorithm for high resolution TOA(Time Of Arrival) estimation under indoor radio propagation channels. The proposed algorithm is not dependent on the structure of receivers, i.e, it can be used with either coherent or non-coherent receivers. The TOA estimation algorithm is based on a high resolution frequency estimation algorithm of Minimum-norm. The efficiency of the proposed algorithm relies on numerical analysis techniques in computing signal or noise subspaces. The algorithm is based on the two step procedures, one for transforming input data to frequency domain data and the other for estimating the unknown TOA using the proposed efficient algorithm. The efficiency in number of operations over other algorithms is presented. The performance of the proposed algorithm is investigated by means of computer simulations.. Throughout the analytic and computer simulation results, we show that the proposed algorithm exhibits superior performance in estimating TOA estimation with limited computational cost.

A Modified Error Function to Improve the Error Back-Propagation Algorithm for Multi-Layer Perceptrons

  • Oh, Sang-Hoon;Lee, Young-Jik
    • ETRI Journal
    • /
    • v.17 no.1
    • /
    • pp.11-22
    • /
    • 1995
  • This paper proposes a modified error function to improve the error back-propagation (EBP) algorithm for multi-Layer perceptrons (MLPs) which suffers from slow learning speed. It can also suppress over-specialization for training patterns that occurs in an algorithm based on a cross-entropy cost function which markedly reduces learning time. In the similar way as the cross-entropy function, our new function accelerates the learning speed of the EBP algorithm by allowing the output node of the MLP to generate a strong error signal when the output node is far from the desired value. Moreover, it prevents the overspecialization of learning for training patterns by letting the output node, whose value is close to the desired value, generate a weak error signal. In a simulation study to classify handwritten digits in the CEDAR [1] database, the proposed method attained 100% correct classification for the training patterns after only 50 sweeps of learning, while the original EBP attained only 98.8% after 500 sweeps. Also, our method shows mean-squared error of 0.627 for the test patterns, which is superior to the error 0.667 in the cross-entropy method. These results demonstrate that our new method excels others in learning speed as well as in generalization.

  • PDF

A Study on an Image Classifier using Multi-Neural Networks (다중 신경망을 이용한 영상 분류기에 관한 연구)

  • Park, Soo-Bong;Park, Jong-An
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.1
    • /
    • pp.13-21
    • /
    • 1995
  • In this paper, we improve an image classifier algorithm based on neural network learning. It consists of two steps. The first is input pattern generation and the second, the global neural network implementation using an improved back-propagation algorithm. The feature vector for pattern recognition consists of the codebook data obtained from self-organization feature map learning. It decreases the input neuron number as well as the computational cost. The global neural network algorithm which is used in classifier inserts a control part and an address memory part to the back-propagation algorithm to control weights and unit-offsets. The simulation results show that it does not fall into the local minima and can implement easily the large-scale neural network. And it decreases largely the learning time.

  • PDF

Competitive Influence Maximization on Online Social Networks under Cost Constraint

  • Chen, Bo-Lun;Sheng, Yi-Yun;Ji, Min;Liu, Ji-Wei;Yu, Yong-Tao;Zhang, Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.4
    • /
    • pp.1263-1274
    • /
    • 2021
  • In online competitive social networks, each user can be influenced by different competing influencers and consequently chooses different products. But their interest may change over time and may have swings between different products. The existing influence spreading models seldom take into account the time-related shifts. This paper proposes a minimum cost influence maximization algorithm based on the competitive transition probability. In the model, we set a one-dimensional vector for each node to record the probability that the node chooses each different competing influencer. In the process of propagation, the influence maximization on Competitive Linear Threshold (IMCLT) spreading model is proposed. This model does not determine by which competing influencer the node is activated, but sets different weights for all competing influencers. In the process of spreading, we select the seed nodes according to the cost function of each node, and evaluate the final influence based on the competitive transition probability. Experiments on different datasets show that the proposed minimum cost competitive influence maximization algorithm based on IMCLT spreading model has excellent performance compared with other methods, and the computational performance of the method is also reasonable.

Optimized Station to Estimate Atmospheric Integrated Water Vapor Levels Using GNSS Signals and Meteorology Parameters

  • Beldjilali, Bilal;Benadda, Belkacem
    • ETRI Journal
    • /
    • v.38 no.6
    • /
    • pp.1172-1178
    • /
    • 2016
  • The atmospheric meteorology parameters of the earth, such as temperature, pressure, and humidity, strongly influence the propagation of signals in Global Navigation Satellite Systems (GNSSs). The propagation delays associated with GNSS signals can be modeled and explained based on the atmospheric temperature, pressure, and humidity, as well as the locations of the satellites and receivers. In this paper, we propose an optimized and simplified low cost GNSS base weather station that can be used to provide a global estimate of the integrated water vapor value. Our algorithm can be used to measure the zenith tropospheric delay based on the measured propagation delays in the received signals. We also present the results of the data measurements performed at our station located in the Tlemcen region of Algeria.

Multi-Hop Clock Synchronization Based on Robust Reference Node Selection for Ship Ad-Hoc Network

  • Su, Xin;Hui, Bing;Chang, KyungHi
    • Journal of Communications and Networks
    • /
    • v.18 no.1
    • /
    • pp.65-74
    • /
    • 2016
  • Ship ad-hoc network (SANET) extends the coverage of the maritime communication among ships with the reduced cost. To fulfill the growing demands of real-time services, the SANET requires an efficient clock time synchronization algorithm which has not been carefully investigated under the ad-hoc maritime environment. This is mainly because the conventional algorithms only suggest to decrease the beacon collision probability that diminishes the clock drift among the units. However, the SANET is a very large-scale network in terms of geographic scope, e.g., with 100 km coverage. The key factor to affect the synchronization performance is the signal propagation delay, which has not being carefully considered in the existing algorithms. Therefore, it requires a robust multi-hop synchronization algorithm to support the communication among hundreds of the ships under the maritime environment. The proposed algorithm has to face and overcome several challenges, i.e., physical clock, e.g., coordinated universal time (UTC)/global positioning system (GPS) unavailable due to the atrocious weather, network link stability, and large propagation delay in the SANET. In this paper, we propose a logical clock synchronization algorithm with multi-hop function for the SANET, namely multi-hop clock synchronization for SANET (MCSS). It works in an ad-hoc manner in case of no UTC/GPS being available, and the multi-hop function makes sure the link stability of the network. For the proposed MCSS, the synchronization time reference nodes (STRNs) are efficiently selected by considering the propagation delay, and the beacon collision can be decreased by the combination of adaptive timing synchronization procedure (ATSP) with the proposed STRN selection procedure. Based on the simulation results, we finalize the multi-hop frame structure of the SANET by considering the clock synchronization, where the physical layer parameters are contrived to meet the requirements of target applications.