• Title/Summary/Keyword: random algorithm

Search Result 1,812, Processing Time 0.028 seconds

Optimal Degradation Experimental Design in Non-Linear Random Coefficients Models (비선형 확률계수모형을 고려한 최적 열화시험 설계)

  • Kim, Seong-Joon;Bae, Suk-Joo
    • Journal of Applied Reliability
    • /
    • v.9 no.1
    • /
    • pp.13-28
    • /
    • 2009
  • In this paper we propose a method for designing optimum degradation test based on nonlinear random-coefficients models. We use the approximated expression of the Fisher information matrix for nonlinear random-coefficients models. We apply the simplex algorithm to the inverse of the determinant of Fisher information matrix to satisfy the D-optimal criterion. By comparison of the results from PDP degradation data, we suggest a general guideline to obtain optimum experimental design for determining inspection intervals and number of samples in degradation testing.

  • PDF

Derivative Evaluation and Conditional Random Selection for Accelerating Genetic Algorithms

  • Jung, Sung-Hoon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.5 no.1
    • /
    • pp.21-28
    • /
    • 2005
  • This paper proposes a new method for accelerating the search speed of genetic algorithms by taking derivative evaluation and conditional random selection into account in their evolution process. Derivative evaluation makes genetic algorithms focus on the individuals whose fitness is rapidly increased. This accelerates the search speed of genetic algorithms by enhancing exploitation like steepest descent methods but also increases the possibility of a premature convergence that means most individuals after a few generations approach to local optima. On the other hand, derivative evaluation under a premature convergence helps genetic algorithms escape the local optima by enhancing exploration. If GAs fall into a premature convergence, random selection is used in order to help escaping local optimum, but its effects are not large. We experimented our method with one combinatorial problem and five complex function optimization problems. Experimental results showed that our method was superior to the simple genetic algorithm especially when the search space is large.

Efficient random number generation from extreme tail areas of a t-distribution (t 분포의 극단 꼬리부분으로부터의 효율적인 난수생성)

  • 오만숙;김나영
    • The Korean Journal of Applied Statistics
    • /
    • v.9 no.1
    • /
    • pp.165-177
    • /
    • 1996
  • It is often needed to generate random numbers from truncated t-distributions to carry out Bayesian inferences, especially in Monte Carlo integration for estimation of posterior densities of constrained parameters. However, when the restricted area is an extreme tail area with a small probability most existing random generation methods are not efficient. In this paper, we propose an efficient acceptance-rejection method to generate random numbers from extreme tail areas of a t-distribution. Using some simulation results, we compare the proposed algorithm with other popular methods.

  • PDF

Dynamic Random Channel Allocation Scheme For Supporting QoS In HIPERLAN/2

  • Park S. J;Kang J. E;Lee J. K
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.35-38
    • /
    • 2004
  • The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and AP (Access Point) can dynamically allocate the number of RCHs (Random CHannels). We propose a dynamic random channel allocation scheme improved by limiting the number of minimum RCHs. On a simulated scenario adopted practical Internet traffic, the proposed scheme is shown to achieve over $19\%$ lower delay than previously studied algorithm. This study will be a first step towards designing scope of RCHs for high-performance wireless packet network

  • PDF

Discrete Ray Tracing Techniques for Wave Propagation Characteristic of Random Rough Surfaces (불규칙 조면의 전파 특성 해석을 위한 이산 광선 추적법)

  • Yoon, Kwang-Yeol
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.3
    • /
    • pp.233-238
    • /
    • 2010
  • In this paper, we have proposed discrete ray tracing method (DRTM) for numerical analysis of characteristics of electromagnetic propagation along 2D random rough surfaces. The point of the present method is to discretize not only rough surface but also ray tracing. The former helps saving computer memories and the latter does simplifying ray searching algorithm resulting in saving computation time. Numerical calculations are carried out for 2D random rough surfaces, and electric field distributions are shown to check the effectiveness of the proposed DRTM.

Efficient Compression Schemes for Double Random Phase-encoded Data for Image Authentication

  • Gholami, Samaneh;Jaferzadeh, Keyvan;Shin, Seokjoo;Moon, Inkyu
    • Current Optics and Photonics
    • /
    • v.3 no.5
    • /
    • pp.390-400
    • /
    • 2019
  • Encrypted images obtained through double random phase-encoding (DRPE) occupy considerable storage space. We propose efficient compression schemes to reduce the size of the encrypted data. In the proposed schemes, two state-of-art compression methods of JPEG and JP2K are applied to the quantized encrypted phase images obtained by combining the DRPE algorithm with the virtual photon counting imaging technique. We compute the nonlinear cross-correlation between the registered reference images and the compressed input images to verify the performance of the compression of double random phase-encoded images. We show quantitatively through experiments that considerable compression of the encrypted image data can be achieved while security and authentication factors are completely preserved.

Random sequence synchronization failure detection algorithm for synchronous stream cipher system using RMVD (RMVD를 이용하는 동기식 스트림 암호 데이터 통신시 난수동기 이탈 검출 알고리듬)

  • 박종욱
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.10 no.3
    • /
    • pp.29-36
    • /
    • 2000
  • It is very import role to increase communication quality that fast detection of random sequence synchronization fail in synchronous stream cipher system using initial synchronization mode. Generally it sends additional information to detect random sequency synchronization fail. But we can't transmit additional informations to decide synchronization fail in a system using RMVD to correct channel error. In this paper we propose a method to detect synchronization fail in the receiver even though a system using RMVD has no margin to send additional information, For detecting random sequency synchronization fail we decipher receiver data analyze probability of transition rate for pre-determined period and decide synchronization fail using calculated transition rate probability. This proposed method is fast very reliable and robust in noisy channel and is easily implemented with hardware.

A Random Forest Algorithm-based Accident Prediction to Prevent Marine Pilot Occupational Accidents

  • Gokhan Camliyurt;Won Sik Kang;Daewon Kim;Sangwon Park;Youngsoo Park
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2022.06a
    • /
    • pp.415-416
    • /
    • 2022
  • Marine pilot occupational accidents during transfer to/from the ship are at the top of the agenda after several safety campaigns by IMPA and individual attemptsThere is multiple transfer method for the marine pilot, but a most common way is to use the pilot cutter. This paper aims to predict marine pilot occupational accidents before it occurs by using historical data. Since the problem depends on several variables, this paper develops a model by using the random forest method to predict marine pilot accidents before happening with the random forest method by using RStudio software

  • PDF

An Efficient and Stable Congestion Control Scheme with Neighbor Feedback for Cluster Wireless Sensor Networks

  • Hu, Xi;Guo, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4342-4366
    • /
    • 2016
  • Congestion control in Cluster Wireless Sensor Networks (CWSNs) has drawn widespread attention and research interests. The increasing number of nodes and scale of networks cause more complex congestion control and management. Active Queue Management (AQM) is one of the major congestion control approaches in CWSNs, and Random Early Detection (RED) algorithm is commonly used to achieve high utilization in AQM. However, traditional RED algorithm depends exclusively on source-side control, which is insufficient to maintain efficiency and state stability. Specifically, when congestion occurs, deficiency of feedback will hinder the instability of the system. In this paper, we adopt the Additive-Increase Multiplicative-Decrease (AIMD) adjustment scheme and propose an improved RED algorithm by using neighbor feedback and scheduling scheme. The congestion control model is presented, which is a linear system with a non-linear feedback, and modeled by Lur'e type system. In the context of delayed Lur'e dynamical network, we adopt the concept of cluster synchronization and show that the congestion controlled system is able to achieve cluster synchronization. Sufficient conditions are derived by applying Lyapunov-Krasovskii functionals. Numerical examples are investigated to validate the effectiveness of the congestion control algorithm and the stability of the network.

Economic Life Assessment of Power Transformer using HS Optimization Algorithm (HS 최적화 알고리즘을 이용한 전력용 변압기의 경제적 수명평가)

  • Lee, Tae-bong;Shon, Jin-geun
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.66 no.3
    • /
    • pp.123-128
    • /
    • 2017
  • Electric utilities has been considered the necessity to introduce AM(asset management) of electric power facilities in order to reduce maintenance cost of existing facilities and to maximize profit. In order to make decisions in terms of repairs and replacements for power transformers, not only measuring by counting parts and labor costs, but comprehensive comparison including reliability and cost is needed. Therefore, this study is modeling input cost for power transformer during its entire life and also the life cycle cost (LCC) technique is applied. In particular, this paper presents an application of heuristic harmony search(HS) optimization algorithm to the convergence and the validity of economic life assessment of power transformer from LCC technique. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the proposed identification method has been demonstrated through an economic life assessment simulation of power transformer using HS optimization algorithm.