• Title/Summary/Keyword: random algorithm

검색결과 1,806건 처리시간 0.03초

확률적 수요를 갖는 단일설비 다종제품의 동적 생산계획에 관한 연구 (A Study on Dynamic Lot Sizing Problem with Random Demand)

  • 김창현
    • 대한산업공학회지
    • /
    • 제31권3호
    • /
    • pp.194-200
    • /
    • 2005
  • A stochastic dynamic lot sizing problem for multi-item is suggested in the case that the distribution of the cumulative demand is known over finite planning horizons and all unsatisfied demand is fully backlogged. Each item is produced simultaneously at a variable ratio of input resources employed whenever setup is incurred. A dynamic programming algorithm is proposed to find the optimal production policy, which resembles the Wagner-Whitin algorithm for the deterministic case problem but with some additional feasibility constraints.

A Bayesian Wavelet Threshold Approach for Image Denoising

  • Ahn, Yun-Kee;Park, Il-Su;Rhee, Sung-Suk
    • Communications for Statistical Applications and Methods
    • /
    • 제8권1호
    • /
    • pp.109-115
    • /
    • 2001
  • Wavelet coefficients are known to have decorrelating properties, since wavelet is orthonormal transformation. but empirically, those wavelet coefficients of images, like edges, are not statistically independent. Jansen and Bultheel(1999) developed the empirical Bayes approach to improve the classical threshold algorithm using local characterization in Markov random field. They consider the clustering of significant wavelet coefficients with uniform distribution. In this paper, we developed wavelet thresholding algorithm using Laplacian distribution which is more realistic model.

  • PDF

센서 네트워크에서 멀티패스 라우팅 알고리즘의 시뮬레이션 (The Simulation of a Multipath Routing Algorithm in Sensor Networks)

  • 정원도;김기형;손영호
    • 한국시뮬레이션학회:학술대회논문집
    • /
    • 한국시뮬레이션학회 2005년도 춘계학술대회 논문집
    • /
    • pp.144-148
    • /
    • 2005
  • The sensor network consists of sensor nodes which communicate wirelessly. It requires energy-efficient routing protocols. We measure requirements in routing protocols by using simulation techniques. In this paper, we propose a random routing algorithm and evaluate it by simulation.

  • PDF

Efficient MCS for random vibration of hysteretic systems by an explicit iteration approach

  • Su, Cheng;Huang, Huan;Ma, Haitao;Xu, Rui
    • Earthquakes and Structures
    • /
    • 제7권2호
    • /
    • pp.119-139
    • /
    • 2014
  • A new method is proposed for random vibration anaylsis of hysteretic systems subjected to non-stationary random excitations. With the Bouc-Wen model, motion equations of hysteretic systems are first transformed into quasi-linear equations by applying the concept of equivalent excitations and decoupling of the real and hysteretic displacements, and the derived equation system can be solved by either the precise time integration or the Newmark-${\beta}$ integration method. Combining the numerical solution of the auxiliary differential equation for hysteretic displacements, an explicit iteration algorithm is then developed for the dynamic response analysis of hysteretic systems. Because the computational cost for a large number of deterministic analyses of hysteretic systems can be significantly reduced, Monte-Carlo simulation using the explicit iteration algorithm is now viable, and statistical characteristics of the non-stationary random responses of a hysteretic system can be obtained. Numerical examples are presented to show the accuracy and efficiency of the present approach.

Propagation of non-uniformly modulated evolutionary random waves in a stratified viscoelastic solid

  • Gao, Q.;Howson, W.P.;Watson, A.;Lin, J.H.
    • Structural Engineering and Mechanics
    • /
    • 제24권2호
    • /
    • pp.213-225
    • /
    • 2006
  • The propagation of non-uniformly modulated, evolutionary random waves in viscoelastic, transversely isotropic, stratified materials is investigated. The theory is developed in the context of a multi-layered soil medium overlying bedrock, where the material properties of the bedrock are considered to be much stiffer than those of the soil and the power spectral density of the random excitation is assumed to be known at the bedrock. The governing differential equations are first derived in the frequency/wave-number domain so that the displacement response of the ground may be computed. The eigen-solution expansion method is then used to solve for the responses of the layers. This utilizes the precise integration method, in combination with the extended Wittrick-Williams algorithm, to obtain all the eigen-solutions of the ordinary differential equation. The recently developed pseudo-excitation method for structural random vibration is then used to determine the solution of the layered soil responses.

RANDOM SAMPLING AND RECONSTRUCTION OF SIGNALS WITH FINITE RATE OF INNOVATION

  • Jiang, Yingchun;Zhao, Junjian
    • 대한수학회보
    • /
    • 제59권2호
    • /
    • pp.285-301
    • /
    • 2022
  • In this paper, we mainly study the random sampling and reconstruction of signals living in the subspace Vp(𝚽, 𝚲) of Lp(ℝd), which is generated by a family of molecules 𝚽 located on a relatively separated subset 𝚲 ⊂ ℝd. The space Vp(𝚽, 𝚲) is used to model signals with finite rate of innovation, such as stream of pulses in GPS applications, cellular radio and ultra wide-band communication. The sampling set is independently and randomly drawn from a general probability distribution over ℝd. Under some proper conditions for the generators 𝚽 = {𝜙λ : λ ∈ 𝚲} and the probability density function 𝜌, we first approximate Vp(𝚽, 𝚲) by a finite dimensional subspace VpN (𝚽, 𝚲) on any bounded domains. Then, we prove that the random sampling stability holds with high probability for all signals in Vp(𝚽, 𝚲) whose energy concentrate on a cube when the sampling size is large enough. Finally, a reconstruction algorithm based on random samples is given for signals in VpN (𝚽, 𝚲).

Enhancing Internet of Things Security with Random Forest-Based Anomaly Detection

  • Ahmed Al Shihimi;Muhammad R Ahmed;Thirein Myo;Badar Al Baroomi
    • International Journal of Computer Science & Network Security
    • /
    • 제24권6호
    • /
    • pp.67-76
    • /
    • 2024
  • The Internet of Things (IoT) has revolutionized communication and device operation, but it has also brought significant security challenges. IoT networks are structured into four levels: devices, networks, applications, and services, each with specific security considerations. Personal Area Networks (PANs), Local Area Networks (LANs), and Wide Area Networks (WANs) are the three types of IoT networks, each with unique security requirements. Communication protocols such as Wi-Fi and Bluetooth, commonly used in IoT networks, are susceptible to vulnerabilities and require additional security measures. Apart from physical security, authentication, encryption, software vulnerabilities, DoS attacks, data privacy, and supply chain security pose significant challenges. Ensuring the security of IoT devices and the data they exchange is crucial. This paper utilizes the Random Forest Algorithm from machine learning to detect anomalous data in IoT devices. The dataset consists of environmental data (temperature and humidity) collected from IoT sensors in Oman. The Random Forest Algorithm is implemented and trained using Python, and the accuracy and results of the model are discussed, demonstrating the effectiveness of Random Forest for detecting IoT device data anomalies.

모바일환경에서 클라우드 컴퓨팅 보안을 위한 효율적인 암호화기술 (An Efficient Encryption Technique for Cloud-Computing in Mobile Environments)

  • 황재영;최동욱;정연호
    • 융합신호처리학회논문지
    • /
    • 제12권4호
    • /
    • pp.298-302
    • /
    • 2011
  • 본 연구에서는 보안 알고리즘을 구현하여 데이터에 대한 기밀성과 안정성을 확보하며 특히 클라우드 컴퓨팅 중 모바일 환경에 적합한 효율적인 암호화 기술을 제안하고자 한다. 이를 위해 PC 환경에서 알고리즘을 구현하고 기존의 암호화 알고리즘인 DES(Data Encryption Standard)와 비교 검증하였다. 기존 DES 암호화의 기밀성을 유지하기가 어려운 단점이 있다. 최근에는 이러한 DES 의 단점을 보완하기 위해 일반적으로 3중 DES 기법이 사용되나 암호화 시간이 길어지는 단점이 있다. 본 연구에서는 랜덤 인터리빙(random interleaving) 알고리즘을 적용하여 단순히 치환에 그치는 것이 아니라 의사 난수를 이용한 치환 테이블을 적용함으로써 기밀성을 높였으며, 기존의 3중 DES 에 비하여 암호화 속도가 빠르고 무선 환경에서 높은 안정성을 제공한다.

Boundary-RRT* Algorithm for Drone Collision Avoidance and Interleaved Path Re-planning

  • Park, Je-Kwan;Chung, Tai-Myoung
    • Journal of Information Processing Systems
    • /
    • 제16권6호
    • /
    • pp.1324-1342
    • /
    • 2020
  • Various modified algorithms of rapidly-exploring random tree (RRT) have been previously proposed. However, compared to the RRT algorithm for collision avoidance with global and static obstacles, it is not easy to find a collision avoidance and local path re-planning algorithm for dynamic obstacles based on the RRT algorithm. In this study, we propose boundary-RRT*, a novel-algorithm that can be applied to aerial vehicles for collision avoidance and path re-planning in a three-dimensional environment. The algorithm not only bounds the configuration space, but it also includes an implicit bias for the bounded configuration space. Therefore, it can create a path with a natural curvature without defining a bias function. Furthermore, the exploring space is reduced to a half-torus by combining it with simple right-of-way rules. When defining the distance as a cost, the proposed algorithm through numerical analysis shows that the standard deviation (σ) approaches 0 as the number of samples per unit time increases and the length of epsilon ε (maximum length of an edge in the tree) decreases. This means that a stable waypoint list can be generated using the proposed algorithm. Therefore, by increasing real-time performance through simple calculation and the boundary of the configuration space, the algorithm proved to be suitable for collision avoidance of aerial vehicles and replanning of local paths.

배깅과 부스팅 알고리즘을 이용한 핸드볼 결과 예측 비교 (Comparison of Handball Result Predictions Using Bagging and Boosting Algorithms)

  • 김지응;박종철;김태규;이희화;안지환
    • 한국융합학회논문지
    • /
    • 제12권8호
    • /
    • pp.279-286
    • /
    • 2021
  • 본 연구는 여자핸드볼 경기에서 발생되는 움직임 정보를 바탕으로 앙상블 기법의 배깅과 부스팅 알고리즘의 예측력을 비교하고, 움직임 정보의 활용가능성을 분석하는데 목적이 있다. 연구의 목적을 달성하기 위하여 15번의 연습경기에서 관성센서를 활용해 수집한 움직임 정보를 활용한 경기 결과예측을 랜덤포레스트와 Adaboost 알고리즘을 활용해 비교·분석하였다. 연구결과 첫째, 랜덤포레스트 알고리즘의 예측률은 66.9 ± 0.1%로 나타났으며, Adaboost 알고리즘의 예측률은 65.6 ± 1.6%로 나타났다. 둘째, 랜덤포레스트는 승리 결과는 모두 예측하였고, 패배의 결과는 하나도 예측하지 못하였다. 반면, Adaboost 알고리즘은 승리 예측 91.4%, 패배예측 10.4%라고 나타났다. 셋째, 알고리즘의 적합성 여부에서 랜덤포레스트는 과적합의 오류가 없었지만, Adaboost는 과적합의 오류가 나타났다. 본 연구결과를 바탕으로 스포츠경기를 예측할 때 움직임 정보도 활용 가능성을 확인하였으며, 랜덤포레스트 알고리즘이 보다 우수함을 확인하였다.