• Title/Summary/Keyword: random algorithm

Search Result 1,806, Processing Time 0.034 seconds

Adaptive Random Testing for Integrated System based on Output Distribution Estimation (통합 시스템을 위한 출력 분포 기반 적응적 랜덤 테스팅)

  • Shin, Seung-Hun;Park, Seung-Kyu;Choi, Kyung-Hee;Jung, Ki-Hyun
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.3
    • /
    • pp.19-28
    • /
    • 2011
  • Adaptive Random Testing (ART) aims to enhance the performance of pure random testing by detecting failure region in a software. The ART algorithm generates effective test cases which requires less number of test cases than that of pure random testing. However, all ART algorithms currently proposed are designed for the tests of monolithic system or unit level. In case of integrated system tests, ART approaches do not achieve same performances as those of ARTs applied to the unit or monolithic system. In this paper, we propose an extended ART algorithm which can be applied to the integrated system testing environment without degradation of performance. The proposed approach investigates an input distribution of the unit under a test with limited number of seed input data and generates information to be used to resizing input domain partitions. The simulation results show that our approach in an integration environment could achieve similar level of performance as an ART is applied to a unit testing. Results also show resilient effectiveness for various failure rates.

Random Sign Reversal Technique in Space Frequency Block Code for Single Carrier Modulation (단일 반송파 변조를 위한 공간 주파수 블록 코드의 난수 부호 반전 기법)

  • Jung, Hyeok-Koo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.27 no.5
    • /
    • pp.25-36
    • /
    • 2022
  • This paper proposes a random sign reversal technique in space frequency block code for single carrier modulation. The traditional space time and frequency block coding technique may be confronted with radio environments openly, severe radio hijacking problems are to be overcome. In order to avoid such an open radio issue, random coded data protection technique for space-time block code was proposed, but this algorithm can change channel combination per an Orthogonal Frequency Division Multiplexing block. This kind of slow switching increases the probability that nearby receivers will detect the transmitted data. This paper proposes a fast switching algorithm per data symbols' basis which is a random sign reversal technique in space frequency block code for Single Carrier Modulation. It is shown in simulation that the proposed one has a superior performance in comparison with the performance of the receiver which do not know the random timing sequence of sign reversal.

An Improved Backoff Algorithm for the Random Access Protocol for the Ranging Subchannel of IEEE 802.16 Networks (IEEE 802.16 환경의 레인징 부채널에서 랜덤액세스 프로토콜의 Backoff 알고리즘 성능 향상 기법)

  • Kwon, Jeong-Min;Lee, Hyong-Woo;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12A
    • /
    • pp.1267-1275
    • /
    • 2007
  • An improved backoff algorithm for retransmission randomization for OFDMA/CDMA/slotted ALOHA used in the ranging subchannel of IEEE 802.16 network is proposed. Exploiting the fact that a base station coordinates channel access using UL-/DL-MAP in the IEEE 802.16 networks, we propose a minor modification of the existing IEEE 802.16 in order to increase throughput, decrease delay variation and achieve a graceful performance degradation in case of overload channel condition of the random access protocol. The algorithm basically estimates the number of backlogged users and arrival rate using which, the BS calculates retransmission probability for the subscriber stations involved in a collision. Computer simulation is performed to demonstrate the effectiveness of the proposed algorithm and to compare the performance with existing binary exponential backoff algorithm.

Adaptive Noise Reduction on the Frequency Domain using the Sign Algorithm.

  • Lee, Jae-Kyung;Yoon, Dal-Hwan;Min, Seung-Gi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.57-60
    • /
    • 2003
  • We have proposed the adaptive noise reduction algorithm using the MDFT. The algorithm proposed use the linear prediction coefficients of the AR method based on Sign algorithm that is the modified LMS instead of the least mean square(LMS). The signals with a random noise tracking performance are examined through computer simulations and confirmed that the high speed adaptive noise reduction processing system is realized with rapid convergence.

  • PDF

The Migration Scheme between Groups in the Multi-population Genetic Algorithms (다개체군 유전자 알고리즘의 집단간 이주 기법)

  • 차성민;권기호
    • Proceedings of the IEEK Conference
    • /
    • 2000.11c
    • /
    • pp.9-12
    • /
    • 2000
  • Genetic algorithm is a searching method which based on the law of the survival of the fittest. Multi-population Genetic Algorithm is a modified form of Genetic Algorithm, which was devised for covering the defect of general genetic algorithm. The core of multi-population genetic algorithm is said to be the migration schemes. The fitness-based migration scheme and the random migration scheme are currently used. In this paper, a new migration scheme, ‘the migration scheme between groups’, is suggested, and compared to the general two migration schemes.

  • PDF

Optimum Design of journal Bearing by the Enhanced Artificial Life Optimization Algorithm (인공생명 알고리듬을 이용한 저널 베어링의 최적설계)

  • 송진대;양보석
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2004.05a
    • /
    • pp.400-403
    • /
    • 2004
  • This paper presents an optimum design of journal bearings using a hybrid method to find the solutions of optimization problem. The present hybrid algorithm, namely Enhanced Artificial Life Algorithm(EALA), is a synthesis of an artificial life algorithm(ALA) and the random tabu search(R-tabu) method. EALA is applied to the optimum design of journal bearings supporting simple rotor. The applicability of EALA to optimum design of rotor-bearing system is exemplified through this study.

  • PDF

An Efficient Evolutionary Algorithm for the Fixed Charge Transportation Problem (고정비용 수송문제를 위한 효율적인 진화 알고리듬)

  • Soak, Sang-Moon;Chang, Seok-Cheoul;Lee, Sang-Wook;Ahn, Byung-Ha
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.31 no.1
    • /
    • pp.79-86
    • /
    • 2005
  • The transportation problem (TP) is one of the traditional optimization problems. Unlike the TP, the fixed charge transportation problem (FCTP) cannot be solved using polynomial time algorithms. So, finding solutions for the FCTP is a well-known NP-complete problem involving an importance in a transportation network design. So, it seems to be natural to use evolutionary algorithms for solving FCTP. And many evolutionary algorithms have tackled this problem and shown good performance. This paper introduces an efficient evolutionary algorithm for the FCTP. The proposed algorithm can always generate feasible solutions without any repair process using the random key representation. Especially, it can guide the search toward the basic solution. Finally, we performed comparisons with the previous results known on the benchmark instances and could confirm the superiority of the proposed algorithm.

A New Embedded Compression Algorithm for Memory Size and Bandwidth Reduction in Wavelet Transform Appliable to JPEG2000 (JPEG2000의 웨이블릿 변환용 메모리 크기 및 대역폭 감소를 위한 새로운 Embedded Compression 알고리즘)

  • Son, Chang-Hoon;Song, Sung-Gun;Kim, Ji-Won;Park, Seong-Mo;Kim, Young-Min
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.1
    • /
    • pp.94-102
    • /
    • 2011
  • To alleviate the size and bandwidth requirement in JPEG2000 system, a new Embedded Compression(EC) algorithm with minor image quality drop is proposed. For both random accessibility and low latency, very simple and efficient hadamard transform based compression algorithm is devised. We reduced LL intermediate memory and code-block memory to about half size and achieved significant memory bandwidth reductions(about 52~73%) through proposed multi-mode algorithms, without requiring any modification in JPEG2000 standard algorithm.

Fast Anti-Collision Algorithm Using Pre-distributed Random Address (미리 분배된 난수를 이용하는 빠른 충돌방지 알고리즘)

  • Kang Jeon il;Park Ju sung;Nyang Dae hun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3A
    • /
    • pp.184-194
    • /
    • 2005
  • One of the most important factors that decide the overall performance of RFID system is anti-collision algorithm. By enhancing the anti-collision algorithm, we can increase the number of RFID tags that can be processed in unit time. Two anti-collision algorithms are most widely prevailed: one is ALOHA-based protocol and the other is a binary tree walking method, but these are still under research. In this paper, we suggest an anti-collision algorithm named AAC(Address Allocating and Calling) using pre-distributed random address, which is much faster and more efficient than existing ones. Finally, we evaluate our scheme using mathematical analysis and computer simulation.

Probabilistic Structural Safety Assessment Considering the Initial Shape and Non-linearity of Steel Cable-Stayed Bridges (강사장교의 초기형상과 비선형성을 고려한 확률론적 구조안전성 평가)

  • Bang, Myung-Seok;Han, Sung-Ho;Lee, Woo-Sang;Lee, Chin-Ok
    • Journal of the Korean Society of Safety
    • /
    • v.25 no.3
    • /
    • pp.91-99
    • /
    • 2010
  • In this study, the advanced numerical algorithm is developed which can performed the static and dynamic stochastic finite element analysis by considering the effect of uncertainties included in the member stiffness of steel cable-stayed bridges and seismic load. After conducting the linear and nonlinear initial shape analysis, the advanced numerical algorithm is the assessment tool which can performed structural the response analysis considering the static linearity and non-linearity of before or after induced intial tensile force, and examined the reliability assessment more efficiently. The verification of the developed numerical algorithm is evaluated by analyzing the regression analysis and coefficient of correlation using the direct monte carlo simulation. Also, the dynamic response characteristic and coefficient of variation of the steel cable-stayed bridge is calculated by considering the uncertainty of random variables using the developed numerical algorithm. In addition, the quantitative structural safety of the steel cable-stayed bridges is evaluated by conducting the reliability assessment based upon the dynamic stochastic finite element analysis result.