• Title/Summary/Keyword: probabilistic scheme

Search Result 163, Processing Time 0.022 seconds

Evolutionary Algorithms with Distribution Estimation by Variational Bayesian Mixtures of Factor Analyzers (변분 베이지안 혼합 인자 분석에 의한 분포 추정을 이용하는 진화 알고리즘)

  • Cho Dong-Yeon;Zhang Byoung-Tak
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.11
    • /
    • pp.1071-1083
    • /
    • 2005
  • By estimating probability distributions of the good solutions in the current population, some researchers try to find the optimal solution more efficiently. Particularly, finite mixtures of distributions have a very useful role in dealing with complex problems. However, it is difficult to choose the number of components in the mixture models and merge superior partial solutions represented by each component. In this paper, we propose a new continuous evolutionary optimization algorithm with distribution estimation by variational Bayesian mixtures of factor analyzers. This technique can estimate the number of mixtures automatically and combine good sub-solutions by sampling new individuals with the latent variables. In a comparison with two probabilistic model-based evolutionary algorithms, the proposed scheme achieves superior performance on the traditional benchmark function optimization. We also successfully estimate the parameters of S-system for the dynamic modeling of biochemical networks.

Topology Optimization based on Monte Carlo Analysis (몬테카를로 해석 기반 확률적 위상최적화)

  • Kim, Dae Young;Noh, Hyuk Chun
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.30 no.2
    • /
    • pp.153-158
    • /
    • 2017
  • In this paper, we take into account topology optimization problems considering spatial randomness in the material property of elastic modulus. Based on 88 lines MATLAB Code, Monte Carlo analysis has been performed for MBB(messerschmidt-$b{\ddot{o}}lkow$-blohm) model using 5,000 random sample fields which are generated by using the spectral representation scheme. The random elastic modulus is assumed to be Gaussian in the spatial domain of the structure. The variability of the volume fraction of the material, which affects the optimum topology of the given problem, is given in terms of correlation distance of the random material. When the correlation distance is small, the randomness in the topology is high and vice versa. As the correlation distance increases, the variability of the volume fraction of the material decreases, which comply with the feature of the linear static analysis. As a consequence, it is suggested that the randomness in the material property is need to be considered in the topology optimization.

A Study of Efficient Viterbi Equalizer in FTN Channel (FTN 채널에서의 효율적인 비터비 등화기 연구)

  • Kim, Tae-Hun;Lee, In-Ki;Jung, Ji-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.6
    • /
    • pp.1323-1329
    • /
    • 2014
  • In this paper, we analyzed efficient decoding scheme with FTN (Faster than Nyquist) method that is transmission method faster than Nyquist theory and increase the throughput. we proposed viterbi equalizer model to minimize ISI (Inter-Symbol Interference) when FTN signal is transmitted. the proposed model utilized interference as branch information. In this paper, to decode FTN singal, we used turbo equalization algorithms that iteratively exchange probabilistic information between soft Viterbi equalizer (BCJR method) and LDPC decoder. By changing the trellis diagram in order to maximize Euclidean distance, we confirmed that performance was improved compared to conventional methods as increasing throughput of FTN signal.

Probabilistic Behavior of In-plane Structure due to Multiple Correlated Uncertain Material Constants (상호 상관관계가 있는 다중 재료상수의 불확실성에 의한 평면구조의 확률론적 거동)

  • Noh Hyuk-Chun
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.18 no.3
    • /
    • pp.291-302
    • /
    • 2005
  • Due to the importance of the parameter in structural response, the uncertain elastic modulus was located at the center of stochastic analysis, where the response variability caused by the uncertain system parameters is pursued. However when we analyze the so-called stochastic systems, as many parameters as possible must be included in the analysis if we want to obtain the response variability that can reach a true one, even in an approximate sense. In this paper, a formulation to determine the statistical behavior of in-plane structures due to multiple uncertain material parameters, i.e., elastic modulus and Poisson's ratio, is suggested. To this end, the polynomial expansion on the coefficients of constitutive matrix is employed. In constructing the modified auto-and cross-correlation functions, use is made of the general equation for n-th moment. For the computational purpose, the infinite series of stochastic sub-stiffness matrices is truncated preserving required accuracy. To demons4rate the validity of the proposed formulation, an exemplary example is analyzed and the results are compared with those obtained by means of classical Monte Carlo simulation, which is based on the local averaging scheme.

A partially occluded object recognition technique using a probabilistic analysis in the feature space (특징 공간상에서 의 확률적 해석에 기반한 부분 인식 기법에 관한 연구)

  • 박보건;이경무;이상욱;이진학
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.11A
    • /
    • pp.1946-1956
    • /
    • 2001
  • In this paper, we propose a novel 2-D partial matching algorithm based on model-based stochastic analysis of feature correspondences in a relation vector space, which is quite robust to shape variations as well as invariant to geometric transformations. We represent an object using the ARG (Attributed Relational Graph) model with features of a set of relation vectors. In addition, we statistically model the partial occlusion or noise as the distortion of the relation vector distribution in the relation vector space. Our partial matching algorithm consists of two-phases. First, a finite number of candidate sets areselected by using logical constraint embedding local and structural consistency Second, the feature loss detection is done iteratively by error detection and voting scheme thorough the error analysis of relation vector space. Experimental results on real images demonstrate that the proposed algorithm is quite robust to noise and localize target objects correctly even inseverely noisy and occluded scenes.

  • PDF

Approximate Multiplier With Efficient 4-2 Compressor and Compensation Characteristic (효율적인 4-2 Compressor와 보상 특성을 갖는 근사 곱셈기)

  • Kim, Seok;Seo, Ho-Sung;Kim, Su;Kim, Dae-Ik
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.1
    • /
    • pp.173-180
    • /
    • 2022
  • Approximate Computing is a promising method for designing hardware-efficient computing systems. Approximate multiplication is one of key operations used in approximate computing methods for high performance and low power computing. An approximate 4-2 compressor can implement hardware-efficient circuits for approximate multiplication. In this paper, we propose an approximate multiplier with low area and low power characteristics. The proposed approximate multiplier architecture is segmented into three portions; an exact region, an approximate region, and a constant correction region. Partial product reduction in the approximation region are simplified using a new 4:2 approximate compressor, and the error due to approximation is compensated using a simple error correction scheme. Constant correction region uses a constant calculated with probabilistic analysis for reducing error. Experimental results of 8×8 multiplier show that the proposed design requires less area, and consumes less power than conventional 4-2 compressor-based approximate multiplier.

RSM-based Probabilistic Reliability Analysis of Axial Single Pile Structure (축하중 단말뚝구조물의 RSM기반 확률론적 신뢰성해석)

  • Huh Jung-Won;Kwak Ki-Seok
    • Journal of the Korean Geotechnical Society
    • /
    • v.22 no.6
    • /
    • pp.51-61
    • /
    • 2006
  • An efficient and accurate hybrid reliability analysis method is proposed in this paper to quantify the risk of an axially loaded single pile considering pile-soil interaction behavior and uncertainties in various design variables. The proposed method intelligently integrates the concepts of the response surface method, the finite difference method, the first-order reliability method, and the iterative linear interpolation scheme. The load transfer method is incorporated into the finite difference method for the deterministic analysis of a single pile-soil system. The uncertainties associated with load conditions, material and section properties of a pile and soil properties are explicitly considered. The risk corresponding to both serviceability limit state and strength limit state of the pile and soil is estimated. Applicability, accuracy and efficiency of the proposed method in the safety assessment of a realistic pile-soil system subjected to axial loads are verified by comparing it with the results of the Monte Carlo simulation technique.

Task offloading scheme based on the DRL of Connected Home using MEC (MEC를 활용한 커넥티드 홈의 DRL 기반 태스크 오프로딩 기법)

  • Ducsun Lim;Kyu-Seek Sohn
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.6
    • /
    • pp.61-67
    • /
    • 2023
  • The rise of 5G and the proliferation of smart devices have underscored the significance of multi-access edge computing (MEC). Amidst this trend, interest in effectively processing computation-intensive and latency-sensitive applications has increased. This study investigated a novel task offloading strategy considering the probabilistic MEC environment to address these challenges. Initially, we considered the frequency of dynamic task requests and the unstable conditions of wireless channels to propose a method for minimizing vehicle power consumption and latency. Subsequently, our research delved into a deep reinforcement learning (DRL) based offloading technique, offering a way to achieve equilibrium between local computation and offloading transmission power. We analyzed the power consumption and queuing latency of vehicles using the deep deterministic policy gradient (DDPG) and deep Q-network (DQN) techniques. Finally, we derived and validated the optimal performance enhancement strategy in a vehicle based MEC environment.

An Efficient Flooding Algorithm for Position-based Wireless Ad hoc Networks (위치 기반 무선 애드 혹 네트워크에서의 효율적인 플러딩 기법)

  • JaeGal, Chan;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.10
    • /
    • pp.17-28
    • /
    • 2008
  • Rapid transmission of packets is important in mobile ad hoc networks. Therefore, a flooding algorithm which can guarantee a short delay is useful in various ways of packet transmission. Flooding algorithm is one of the packet transmission methods that broadcasts a packet to all nodes within a transmission range. It does not rebroadcast the same packet which is already received from other nodes. Basically, flooding algorithm's advantages are that it simply writes an address and a sequence number in a packet, and it can be adapted for topological changes easily. However, the basic flooding algorithm has a shortcoming that causes excessive traffic because all nodes transmit a packet at least once. To solve this problem, research about flooding algorithms that constrains duplicated transmission of packets based on probabilistic and geographical information is going on. However, the existing algorithm cannot guarantee short delay and low traffic. To reduce a delay, in this paper we propose a flooding scheme where a node which receives a broadcasted packet chooses and allocates a priority to one of its neighbor nodes and then the node transmits the packet promptly to the node to whom the priority was given. Moreover, we propose a totally fresh a roach to constrain duplicated transmission by searching a node that already received the same packet by using node's geographical position information. Lastly, we compare the performance of the proposed algorithm with the existing algorithm through simulation. The results show that the proposed algorithm can distribute packets through a lower number of total packet transmissions and faster delivery time than the existing algorithm.

Fast Bayesian Inversion of Geophysical Data (지구물리 자료의 고속 베이지안 역산)

  • Oh, Seok-Hoon;Kwon, Byung-Doo;Nam, Jae-Cheol;Kee, Duk-Kee
    • Journal of the Korean Geophysical Society
    • /
    • v.3 no.3
    • /
    • pp.161-174
    • /
    • 2000
  • Bayesian inversion is a stable approach to infer the subsurface structure with the limited data from geophysical explorations. In geophysical inverse process, due to the finite and discrete characteristics of field data and modeling process, some uncertainties are inherent and therefore probabilistic approach to the geophysical inversion is required. Bayesian framework provides theoretical base for the confidency and uncertainty analysis for the inference. However, most of the Bayesian inversion require the integration process of high dimension, so massive calculations like a Monte Carlo integration is demanded to solve it. This method, though, seemed suitable to apply to the geophysical problems which have the characteristics of highly non-linearity, we are faced to meet the promptness and convenience in field process. In this study, by the Gaussian approximation for the observed data and a priori information, fast Bayesian inversion scheme is developed and applied to the model problem with electric well logging and dipole-dipole resistivity data. Each covariance matrices are induced by geostatistical method and optimization technique resulted in maximum a posteriori information. Especially a priori information is evaluated by the cross-validation technique. And the uncertainty analysis was performed to interpret the resistivity structure by simulation of a posteriori covariance matrix.

  • PDF