• Title/Summary/Keyword: randomization

Search Result 290, Processing Time 0.031 seconds

A Study on Randomization of Tining Space for Reducing Road Noise (도로소음 저감을 위한 타이닝 간격 랜덤화에 관한 연구)

  • Jung, Soon-Chul;Woo, Jong-Won;Kim, Yong-Soo;Lee, Jae-Eung
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.15 no.8 s.101
    • /
    • pp.897-903
    • /
    • 2005
  • When driving on uniformly tining concrete pavement road, the whine noise which has high spectrum at the specific frequency related to the uniform tining space exist. In this paper, a randomization method of tining space for concrete pavements is proposed to reduce the whine noise. The proposed method is developed based on the LCG(linear congruential generator) algorithm. The design parameters used in the method are number of different tining space, ratio of each tining space, total linings of each size. sequence of actual tining under given constant drag length and texture. Monte Carlo simulations are used to validate the proposed method.

Load-Balanced Routing Via Bounded Randomization (제한된 난수에 의한 트래픽 분산 라우팅 기법)

  • 인지형;박상만;홍충선;이대영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.11A
    • /
    • pp.1732-1739
    • /
    • 2000
  • 향후 컴퓨터 망은 버스트한 트래픽이 주종을 이룬다. OSPE 또는 RIP와 같은 최단경로 라우팅 프로토콜은 단일 경로의 라우팅으로 인해 병목을 초래하는 단점이 존재한다. 따라서, 발 착신사이 선택된 단일 경로는 높은 정체를 유발하는 반면 다른 다수의 경로는 낮은 활용도를 나타낸다. 따라서. 본 고체서는 제한된 난수(bound randomization)를 통해 전체 망에서 데이터 트래픽을 분산하는 라우팅 방법을 제안한다. 이 방법은 병목을 제거하므로서 망의 성능을 향상시킨다. 각각의 데이터 메시지는 원천 S에서 목적지 D로 전송되며 본 고에서는 라우팅 프로토콜은 선택되는 망노드 집합의 a로부터 중간노드 e를 무작위로 선책하고 데이터 메시지를 s에서 e까지의 최단 경로로 라우팅을 한다. 이어서, e에서 d까지의 최단경로를 통해 데이터 메시지를 라우팅 한다. 이는 각각의 원천과 목적지간 대역폭의 효율성을 증가시킨다. 본 고의 실험결과는 전체의 망에서 제안된 트래픽 분산 라우팅 프로토콜에서 기대치의 처리량(throughput), 메시지 손실과 메시지 지연에 따른 망성능 향상을 증명하고 있다. 그리고, 본 고의 알고리즘의 구현은 단지 최단경로 라우팅 프로토콜의 단순한 확장으로 가능하다.

  • PDF

A Study on the Vehicle Interior Noise for Tinning Randomization (타이닝 간격 변화에 따른 차량 실내소음 연구)

  • Yun, Dong-Hyok;Yo, Tae-Hwan;Jeong, Sun-Cheol;Cho, Yoon-Ho;Lee, Jae-Eung
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.770-773
    • /
    • 2006
  • In order to remove the whine noise which has high frequency spectrum related to the uniform tinning space in concrete pavements, randomization study of the tinning space has been done. One of the random tinning space proposed by the authors in the previous study has been applied to the certain region of tile Daegu-Pohang high way construction. In this study, the vehicle interior noise and vibration have been measured in the proposed random tinning road and compared with the data measured in the uniform tinning road. The results show that the magnitude of the peak spectrum is decreased by 18dB(A), and the overall noize level decreased by 4dB(A).

  • PDF

THE RANDOM SIGNALS SATISFYING THE PROPERTIES OF THE GAUSSIAN WHITE NOISE

  • Moon, Byung-Soo;Beasley, Leroy B.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.9 no.1
    • /
    • pp.9-16
    • /
    • 2005
  • The random signals defined as sums of the single frequency sinusoidal signals with random amplitudes and random phases or equivalently sums of functions obtained by adding a Sine and a Cosine function with random amplitudes, are used in the double randomization method for the Monte Carlo solution of the turbulent systems. We show that these random signals can be used for studying the properties of the Johnson noise by proving that constant multiples of these signals with uniformly distributed frequencies in a fixed frequency band satisfy the properties of the Gaussian white noise.

  • PDF

Load-Balanced Routing via Bounded Randomization (제한된 난수에 의한 트래픽 분산 라우팅 기법)

  • 인치형;박상만;홍충선;이대영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.12A
    • /
    • pp.1879-1886
    • /
    • 2000
  • 향후 컴퓨터 망은 버스트한 트래픽이 주종을 이룬다. OSPF 또는 RIP와 같은 최단경로 라우팅 프로토콜은 단일 경로의 라우팅으로 인해 병목을 초래하는 단점이 존재한다. 따라서, 발, 착신 노드간에 선택된 단일경로는 높은 정체를 유발하는 반면 다른 다수의 경로는 낮은 활용도를 나타낸다. 따라서, 본 고에서는 제한된 난수(bounded randomization)를 통해 전체 망에서 데이터 트래픽을 분산하는 라우팅 방법을 제안한다. 이 방법은 병목을 제거함으로서 망의 성능을 향상시킨다. 각각의 데이터 메시지는 원천 s에서 목적지 d로 전송되며 본 고에서 라우팅 프로토콜은 선택되는 망노드 집합의 a로부터 중간 노드 e를 무작위로 선택하고 데이터 메시지를 s에서 e까지의 최단경로로 라우팅을 한다. 이어서, e에서 d까지의 최단경로를 통해 데이터 메시지를 라우팅한다. 이는 각각의 원천과 목적지간 대역폭의 효율성을 증가시킨다. 본 고의 실험결과는 전체의 망에서 제안된 트래픽 분산 라우팅 프로토콜에서 기대치의 처리량(throughput), 메시지 손실과 메시지 지연에 따른 망성능 향상을 증명하고 있다. 그리고, 본 고의 알고리즘의 구현은 단지 최단경로 라우팅 프로토콜의 단순한 확장으로 가능하다.

  • PDF

Analysis of Measurement Precisions Using Measurement Experimental Design for Split Plot (단일분할법 측정 실험계획을 이용한 정밀측정도 분석)

  • Choi, Sung-Woon;You, Jung-Sang
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.32 no.4
    • /
    • pp.223-227
    • /
    • 2009
  • The study presents two measurement split-plot models with a restricted randomization to save cost and time. Split-plot models are used to handle HTCM (Hard To Control Measurement) factors such as high temperature and long-time catalyst control. The models developed are represented by the processes for estimating the measurement precisions, that is, gauge R&R. The study also introduces three-step procedures to indentify resolution, improve R&R reduction, and evaluate the precision effect.

Design-based and model-based Inferences in Survey Sampling (표본조사에서 설계기반추론과 모형기반추론)

  • Kim Kyu-Seong
    • The Korean Journal of Applied Statistics
    • /
    • v.18 no.3
    • /
    • pp.673-687
    • /
    • 2005
  • We investigate both the design-based and model-based inferences, which are usual inferential methods in survey sampling. While the design-based inference is on the basis of randomization principle, The motel-based inference is based on likelihood principle as well as conditionality principle. There have been some disputes between two inferences for a long time and those have not yet been determined. In this paper we reviewed some issues on two inferences and compared their advantages and disadvantages in some viewpoints.

A New Space Vector Random Position PWM Scheme (새로운 공간벡터 Random Position PWM기법)

  • Kim, Hoe-Geun;Lim, Young-Cheol;Na, Seok-Hwan;Jung, Young-Gook
    • Proceedings of the KIEE Conference
    • /
    • 2001.10a
    • /
    • pp.168-174
    • /
    • 2001
  • In this paper, a new space vector RPPWM (Random Position PWM) is proposed. In the proposed RPPWM, each of three phase pulses is located randomly in each switching interval. Based on the space vector modulation technique, the duty ratio of the pulses is calculated. Along with the randomization of the PWM pulses, we can obtain the effects of spread spectra of voltage, current as in the case of randomly changed switching frequency. To verify the validity of the proposed RPPWM, simulation study was tried using Matlab/simulink. The main model described in Simulink block diagrams includes the space vector modulation block, pulse position randomization block, inverter block, 3 phase induction motor block, and so on. By the simulation study, the harmonics of the output voltage, and the current of inverter are predicted in different PWM methods- SVPWM, LLPWM, proposed RPPWM.

  • PDF

A study on randomization of tining space for concrete pavements (콘크리트 포장 타이닝 간격 랜덤화에 관한 연구)

  • Jung, Soon-Chul;Woo, Jong-Won;Kim, Yong-Soo;Lee, Jae-Eung
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2004.11a
    • /
    • pp.741-744
    • /
    • 2004
  • In concrete pavements with uniform tining space, the whine noise which has high frequency spectrum related to the uniform tining space exist. In this paper, randomization procedure of tining space for concrete pavements is proposed. The proposed procedure developed based on the LCG(Linear Congruential Generator) algorithm. And the factor concerned in the procedure are drag span length, number of different tining space, ratio of each tining space, total tinings of each size, sequence of actual tining.

  • PDF

Stochastic Initial States Randomization Method for Robust Knowledge Transfer in Multi-Agent Reinforcement Learning (멀티에이전트 강화학습에서 견고한 지식 전이를 위한 확률적 초기 상태 랜덤화 기법 연구)

  • Dohyun Kim;Jungho Bae
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.27 no.4
    • /
    • pp.474-484
    • /
    • 2024
  • Reinforcement learning, which are also studied in the field of defense, face the problem of sample efficiency, which requires a large amount of data to train. Transfer learning has been introduced to address this problem, but its effectiveness is sometimes marginal because the model does not effectively leverage prior knowledge. In this study, we propose a stochastic initial state randomization(SISR) method to enable robust knowledge transfer that promote generalized and sufficient knowledge transfer. We developed a simulation environment involving a cooperative robot transportation task. Experimental results show that successful tasks are achieved when SISR is applied, while tasks fail when SISR is not applied. We also analyzed how the amount of state information collected by the agents changes with the application of SISR.