• Title/Summary/Keyword: estimation of distribution algorithms

Search Result 84, Processing Time 0.022 seconds

New iand use decision algorithm for distribution load forecast using $R\star$Tree Algorithm ($R\star$Tree 알고리즘을 이용한 배전부하 예측용 토지용도 판정 알고리즘 개발)

  • Park C. H.;Oh J. H.;Jung J. M.;Park S. M.;Chae W. K.
    • Proceedings of the KIEE Conference
    • /
    • summer
    • /
    • pp.135-137
    • /
    • 2004
  • This paper describes new land use estimation method for long term load forecast using $R\startree$ algorithm. Where $R\startree$ algorithms is a proposed method for efficient spatial search. An estimation result showed that execute time of the proposed method is prior to execute time of conventional method.

  • PDF

Direction Estimation of Multiple Sound Sources Using Circular Probability Distributions (순환 확률분포를 이용한 다중 음원 방향 추정)

  • Nam, Seung-Hyon;Kim, Yong-Hoh
    • The Journal of the Acoustical Society of Korea
    • /
    • v.30 no.6
    • /
    • pp.308-314
    • /
    • 2011
  • This paper presents techniques for estimating directions of multiple sound sources ranging from $0^{\circ}$ to $360^{\circ}$ using circular probability distributions having a periodic property. Phase differences containing direction information of sources can be modeled as mixtures of multiple probability distributions and source directions can be estimated by maximizing log-likelihood functions. Although the von Mises distribution is widely used for analyzing this kind of periodic data, we define a new class of circular probability distributions from Gaussian and Laplacian distributions by adopting a modulo operation to have $2{\pi}$-periodicity. Direction estimation with these circular probability distributions is done by implementing corresponding EM (Expectation-Maximization) algorithms. Simulation results in various reverberant environments confirm that Laplacian distribution provides better performance than von Mises and Gaussian distributions.

Integrated Chassis Control for the Driving Safety (주행 안전을 위한 통합 샤시 제어)

  • Cho, Wan-Ki;Yi, Kyong-Su;Chang, Nae-Hyuck
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.7
    • /
    • pp.646-654
    • /
    • 2010
  • This paper describes an integrated chassis control for a maneuverability, a lateral stability and a rollover prevention of a vehicle by the using of the ESC and AFS. The integrated chassis control system consists of a supervisor, control algorithms and a coordinator. From the measured and estimation signals, the supervisor determines the vehicle driving situation about the lateral stability and rollover prevention. The control algorithms determine a desired yaw moment for lateral stability and a desired longitudinal force for the rollover prevention. In order to apply the control inputs, the coordinator determines a brake and active front steering inputs optimally based on the current status of the subject vehicle. To improve the reliability and to reduce the operating load of the proposed control algorithms, a multi-core ECU platform is used in this system. For the evaluation of this system, a closed loop simulations with driver-vehicle-controller system were conducted to investigate the performance of the proposed control strategy.

A random forest-regression-based inverse-modeling evolutionary algorithm using uniform reference points

  • Gholamnezhad, Pezhman;Broumandnia, Ali;Seydi, Vahid
    • ETRI Journal
    • /
    • v.44 no.5
    • /
    • pp.805-815
    • /
    • 2022
  • The model-based evolutionary algorithms are divided into three groups: estimation of distribution algorithms, inverse modeling, and surrogate modeling. Existing inverse modeling is mainly applied to solve multi-objective optimization problems and is not suitable for many-objective optimization problems. Some inversed-model techniques, such as the inversed-model of multi-objective evolutionary algorithm, constructed from the Pareto front (PF) to the Pareto solution on nondominated solutions using a random grouping method and Gaussian process, were introduced. However, some of the most efficient inverse models might be eliminated during this procedure. Also, there are challenges, such as the presence of many local PFs and developing poor solutions when the population has no evident regularity. This paper proposes inverse modeling using random forest regression and uniform reference points that map all nondominated solutions from the objective space to the decision space to solve many-objective optimization problems. The proposed algorithm is evaluated using the benchmark test suite for evolutionary algorithms. The results show an improvement in diversity and convergence performance (quality indicators).

A Study on Analysis of NVP Reliability Using Genetic Algorithms (GA를 이용한 NVP 신뢰도 분석에 관한 연구)

  • Sin, Gyeong-Ae;Han, Pan-Am
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.2
    • /
    • pp.326-334
    • /
    • 1999
  • There are the fault tolerance technology and the fault avoidance technology to analyze and evaluate the performance of computer system. To improve the relibility of software The N-Version Programming (NVP) technology is known to be the most objective and quantitive. However, when discrete probability distribution is used as estimation model, the values of it's component reliability should be same. In this paper, to resolve this problem, we adapted the genetic algorithms to NVP technology and implement the optimized simulate. and the results were analyzed and estimated. Through this study, we could optimize the reliability of each component and estimate the optimum count in the system reliability.

  • PDF

Estimation of Spectral Radiant Distribution of Illumination and Corresponding Color Reproduction According to Viewing Conditions (광원의 분광 방사 분포의 추정과 관찰조건에 따른 대응적 색재현)

  • 방상택;이철희;곽한봉;유미옥;안석출
    • Proceedings of the Korean Printing Society Conference
    • /
    • 2000.04a
    • /
    • pp.35-44
    • /
    • 2000
  • Because Image on the CRT change under different illuminants, human is difficult to see original color of object. If what is information of used illuminant on capturing object know, image can be transformed according to viewing condition using the linear matrix method. To know information of used illuminant at an image, the spectral radiance of illuminant can be estimated using the linear model of Maloney and Wandell form an image. And then image can be properly transformed it using color appearance model. In this paper, we predict the spectral radiance of illuminant using spectral power distribution of specular light and using surface spectral reflectance at maximum gray area. and then we perform visual experiments for the corresponding color reproduction according to viewing condition. In results, we ensure that the spectral radiance of illuminant at an image can be well estimated using above algorithms and that human visual system is 70% adapted to the monitor's white point and 30% to ambient light when viewing softcopy images.

Copula-based common cause failure models with Bayesian inferences

  • Jin, Kyungho;Son, Kibeom;Heo, Gyunyoung
    • Nuclear Engineering and Technology
    • /
    • v.53 no.2
    • /
    • pp.357-367
    • /
    • 2021
  • In general, common cause failures (CCFs) have been modeled with the assumption that components within the same group are symmetric. This assumption reduces the number of parameters required for the CCF probability estimation and allows us to use a parametric model, such as the alpha factor model. Although there are various asymmetric conditions in nuclear power plants (NPPs) to be addressed, the traditional CCF models are limited to symmetric conditions. Therefore, this paper proposes the copulabased CCF model to deal with asymmetric as well as symmetric CCFs. Once a joint distribution between the components is constructed using copulas, the proposed model is able to provide the probability of common cause basic events (CCBEs) by formulating a system of equations without symmetry assumptions. In addition, Bayesian inferences for the parameters of the marginal and copula distributions are introduced and Markov Chain Monte Carlo (MCMC) algorithms are employed to sample from the posterior distribution. Three example cases using simulated data, including asymmetry conditions in total failure probabilities and/or dependencies, are illustrated. Consequently, the copula-based CCF model provides appropriate estimates of CCFs for asymmetric conditions. This paper also discusses the limitations and notes on the proposed method.

Uniform Load Distribution Using Sampling-Based Cost Estimation in Parallel Join (병렬 조인에서 샘플링 기반 비용 예측 기법을 이용한 균등 부하 분산)

  • Park, Ung-Gyu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.6
    • /
    • pp.1468-1480
    • /
    • 1999
  • In database systems, join operations are the most complex and time consuming ones which limit performance of such system. Many parallel join algorithms have been proposed for the systems. However, they did not consider data skew, such as attribute value skew (AVS) and join product skew (JPS). In the skewness environments, performance of framework for a uniform load distribution and an efficient parallel join algorithm using the framework to handle AVS and JPS. In our algorithm, we estimate data distributions of input and output relations of join operations using the sampling methodology and evaluate join cost for the estimated data distributions. Finally, using the histogram equalization method we distribute data among nodes to achieve good load balancing among nodes in the local joining phase. For performance comparison, we present simulation model of our algorithm and other join algorithms and present the result of some simulation experiments. The results indicate that our algorithm outperforms other algorithms in the skewed case.

  • PDF

Block Matching Motion Estimation Using Fast Search Algorithm (고속 탐색 알고리즘을 이용한 블록정합 움직임 추정)

  • 오태명
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.36T no.3
    • /
    • pp.32-40
    • /
    • 1999
  • In this paper, we present a fast block matching motion estimation algorithm based on successive elimination algorithm (SEA). Based on the characteristic of center-biased motion vector distribution in the search area, the proposed method improves the performance of the SEA with a reduced the number of the search positions in the search area, In addition, to reduce the computational load, this method is combined with both the reduced bits mean absolute difference (RBMAD) matching criterion which can be reduced the computation complexity of pixel comparison in the block matching and pixel decimation technique which reduce the number of pixels used in block matching. Simulation results show that the proposed method provides better performance than existing fast algorithms and similar to full-search block motion estimation algorithm.

  • PDF

A New Parameter Estimation Method for a Zipf-like Distribution for Geospatial Data Access

  • Li, Rui;Feng, Wei;Wang, Hao;Wu, Huayi
    • ETRI Journal
    • /
    • v.36 no.1
    • /
    • pp.134-140
    • /
    • 2014
  • Many reports have shown that the access pattern for geospatial tiles follows Zipf's law and that its parameter ${\alpha}$ represents the access characteristics. However, visits to geospatial tiles have temporal and spatial popularities, and the ${\alpha}$-value changes as they change. We construct a mathematical model to simulate the user's access behavior by studying the attributes of frequently visited tile objects to determine parameter estimation algorithms. Because the least squares (LS) method in common use cannot obtain an exact ${\alpha}$-value and does not provide a suitable fit to data for frequently visited tiles, we present a new approach, which uses a moment method of estimation to obtain the value of ${\alpha}$ when ${\alpha}$ is close to 1. When ${\alpha}$ is further away from 1, the method uses the associated cache hit ratio for tile access and uses an LS method based on a critical cache size to estimate the value of ${\alpha}$. The decrease in the estimation error is presented and discussed in the section on experiment results. This new method, which provides a more accurate estimate of ${\alpha}$ than earlier methods, promises more effective prediction of requests for frequently accessed tiles for better caching and load balancing.