• 제목/요약/키워드: Random algorithm

검색결과 1,827건 처리시간 0.024초

FUZZY NONLINEAR RANDOM VARIATIONAL INCLUSION PROBLEMS INVOLVING ORDERED RME-MULTIVALUED MAPPING IN BANACH SPACES

  • Kim, Jong Kyu;Salahuddin, Salahuddin
    • East Asian mathematical journal
    • /
    • 제34권1호
    • /
    • pp.47-58
    • /
    • 2018
  • In this paper, we consider a fuzzy nonlinear random variational inclusion problems involving ordered RME-multivalued mapping in ordered Banach spaces. By using the random relaxed resolvent operator and its properties, we suggest an random iterative algorithm. Finally both the existence of the random solution of the original problem and the convergence of the random iterative sequences generated by random algorithm are proved.

유전알고리즘과 Random Tabu 탐색법을 조합한 최적화 알고리즘에 의한 배관지지대의 최적배치 (Optimum Allocation of Pipe Support Using Combined Optimization Algorithm by Genetic Algorithm and Random Tabu Search Method)

  • 양보석;최병근;전상범;김동조
    • 한국지능시스템학회논문지
    • /
    • 제8권3호
    • /
    • pp.71-79
    • /
    • 1998
  • 본 논문은 유전알고리즘과 random tabu 탐색법을 조합한 새로운 최적화 알고리즘을 제안한다. 유전알고리즘과 전역적인 최적해에 대한 탐색능력이 우수하고, random tabu 탐색법은 최적해에의 수렴속도가 매우 빠른 알고리즘이다. 본 논문에서는 이 두 알고리즘의 장점을 이용해서 수렴정도와 수렴속도가 더욱 향상된 최적알고리즘을 제안하여 알고리즘의 수렴성능을 조사하고, 실제 최적화문제로서 지진응답을 최소로 하기위한 배관지지대의 최적배치문제에 적용하여 기존의 방법과 비교를 통하여 유용성을 검토하였다.

  • PDF

Maximal overlap discrete wavelet transform-based power trace alignment algorithm against random delay countermeasure

  • Paramasivam, Saravanan;PL, Srividhyaa Alamelu;Sathyamoorthi, Prashanth
    • ETRI Journal
    • /
    • 제44권3호
    • /
    • pp.512-523
    • /
    • 2022
  • Random delay countermeasures introduce random delays into the execution flow to break the synchronization and increase the complexity of the side channel attack. A novel method for attacking devices with random delay countermeasures has been proposed by using a maximal overlap discrete wavelet transform (MODWT)-based power trace alignment algorithm. Firstly, the random delay in the power traces is sensitized using MODWT to the captured power traces. Secondly, it is detected using the proposed random delay detection algorithm. Thirdly, random delays are removed by circular shifting in the wavelet domain, and finally, the power analysis attack is successfully mounted in the wavelet domain. Experimental validation of the proposed method with the National Institute of Standards and Technology certified Advanced Encryption Standard-128 cryptographic algorithm and the SAKURA-G platform showed a 7.5× reduction in measurements to disclosure and a 3.14× improvement in maximum correlation value when compared with similar works in the literature.

ITERATIVE ALGORITHM FOR RANDOM GENERALIZED NONLINEAR MIXED VARIATIONAL INCLUSIONS WITH RANDOM FUZZY MAPPINGS

  • Faizan Ahmad, Khan;Eid Musallam, Aljohani;Javid, Ali
    • Nonlinear Functional Analysis and Applications
    • /
    • 제27권4호
    • /
    • pp.881-894
    • /
    • 2022
  • In this paper, we consider a class of random generalized nonlinear mixed variational inclusions with random fuzzy mappings and random relaxed cocoercive mappings in real Hilbert spaces. We suggest and analyze an iterative algorithm for finding the approximate solution of this class of inclusions. Further, we discuss the convergence analysis of the iterative algorithm under some appropriate conditions. Our results can be viewed as a refinement and improvement of some known results in the literature.

유전 알고리즘과 시뮬레이티드 어닐링이 적용된 적응 랜덤 신호 기반 학습에 관한 연구 (A Study on Adaptive Random Signal-Based Learning Employing Genetic Algorithms and Simulated Annealing)

  • 한창욱;박정일
    • 제어로봇시스템학회논문지
    • /
    • 제7권10호
    • /
    • pp.819-826
    • /
    • 2001
  • Genetic algorithms are becoming more popular because of their relative simplicity and robustness. Genetic algorithms are global search techniques for nonlinear optimization. However, traditional genetic algorithms, though robust, are generally not the most successful optimization algorithm on any particular domain because they are poor at hill-climbing, whereas simulated annealing has the ability of probabilistic hill-climbing. Therefore, hybridizing a genetic algorithm with other algorithms can produce better performance than using the genetic algorithm or other algorithms independently. In this paper, we propose an efficient hybrid optimization algorithm named the adaptive random signal-based learning. Random signal-based learning is similar to the reinforcement learning of neural networks. This paper describes the application of genetic algorithms and simulated annealing to a random signal-based learning in order to generate the parameters and reinforcement signal of the random signal-based learning, respectively. The validity of the proposed algorithm is confirmed by applying it to two different examples.

  • PDF

SinGAN기반 데이터 증강과 random forest알고리즘을 이용한 고무 오링 결함 검출 시스템 (A rubber o-ring defect detection system using data augmentation based on the SinGAN and random forest algorithm)

  • 이용은;이한성;김대원;김경천
    • 한국가시화정보학회지
    • /
    • 제19권3호
    • /
    • pp.63-68
    • /
    • 2021
  • In this study, data was augmentation through the SinGAN algorithm using small image data, and defects in rubber O-rings were detected using the random forest algorithm. Unlike the commonly used data augmentation image rotation method to solve the data imbalance problem, the data imbalance problem was solved by using the SinGAN algorithm. A study was conducted to distinguish between normal products and defective products of rubber o-ring by using the random forest algorithm. A total of 20,000 image date were divided into transit and testing datasets, and an accuracy result was obtained to distinguish 97.43% defects as a result of the test.

임의 순서 차트 파싱 알고리즘 (Random Order Chart Parsing Algorithm)

  • 심광섭
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제37권6호
    • /
    • pp.446-454
    • /
    • 2010
  • 차트 파싱 알고리즘에서는 입력 문장의 왼쪽에서 오른쪽으로 파싱을 진행하여야 한다는 제약이 따른다. 본 논문에서는 이러한 제약을 없앤 임의 순서 차트 파싱 알고리즘을 제안한다. 제안한 알고리즘에서는 입력 문장의 각 단어에 대하여 어떤 순서로 파싱을 하더라도 무방하다. 입력 문장의 왼쪽에서 오른쪽으로 파싱을 진행하는 것은 임의 순서로 파싱을 진행하는 것의 특수한 형태이므로 임의 순서 차트파싱 알고리즘에서도 입력 문장의 왼쪽에서 오른쪽으로 파싱을 하는 것이 가능하다. 제안된 알고리즘은 차트 파싱 알고리즘을 확장한 것으로서 제어 구조가 매우 단순하며 구현도 용이하다.

향상된 인공생명 최적화 알고리듬의 개발과 소폭 저널 베어링의 최적설계 (Development of an Enhanced Artificial Life Optimization Algorithm and Optimum Design of Short Journal Bearings)

  • 양보석;송진대
    • 한국소음진동공학회논문집
    • /
    • 제12권6호
    • /
    • pp.478-487
    • /
    • 2002
  • This paper presents a hybrid method to compute the solutions of an optimization Problem. The present hybrid algorithm is the synthesis of an artificial life algorithm and the random tabu search method. The artificial life algorithm has the most important feature called emergence. The emergence is the result of dynamic interaction among the individuals consisting of the system and is not found in an individual. The conventional artificial life algorithm for optimization is a stochastic searching algorithm using the feature of artificial life. Emergent colonies appear at the optimum locations in an artificial ecology. And the locations are the optimum solutions. We combined the feature of random-tabu search method with the conventional algorithm. The feature of random-tabu search method is to divide any given region into sub-regions. The enhanced artificial life algorithm (EALA) not only converge faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. The enhanced artificial life algorithm is applied to the optimum design of high-speed, short journal bearings and its usefulness is verified through an optimization problem.

FUZZY GENERAL NONLINEAR ORDERED RANDOM VARIATIONAL INEQUALITIES IN ORDERED BANACH SPACES

  • Salahuddin, Salahuddin;Lee, Byung-Soo
    • East Asian mathematical journal
    • /
    • 제32권5호
    • /
    • pp.685-700
    • /
    • 2016
  • The main object of this work to introduced and studied a new class of fuzzy general nonlinear ordered random variational inequalities in ordered Banach spaces. By using the random B-restricted accretive mapping with measurable mappings ${\alpha},{\alpha}^{\prime}:{\Omega}{\rightarrow}(0,1)$, an existence of random solutions for this class of fuzzy general nonlinear ordered random variational inequality (equation) with fuzzy mappings is established, a random approximation algorithm is suggested for fuzzy mappings, and the relation between the first value $x_0(t)$ and the random solutions of fuzzy general nonlinear ordered random variational inequality is discussed.

HIPERLAN/2를 위한 적응적 랜덤 액세스 알고리즘 (Adaptive Random Access Algorithm for HIPERLAN/2)

  • 송영금;이정규
    • 한국통신학회논문지
    • /
    • 제30권5B호
    • /
    • pp.310-316
    • /
    • 2005
  • 본 논문에서는 HIPERLAN/2(HIgh PErformance Radio Local Area Network type 2)의 랜덤 액세스 과정에서 채널 환경을 고려함으로 처리 성능을 높이고 전송 지연을 개선한 적응적 랜덤 액세스 기법(ARAH : Adaptive Random Access algorithm for HIPERLAN/2)을 제안하고 기존 방식에 비해 성능이 향상됨을 검증하였다. 본 논문에서는 HIPERLAN/2에서 채널의 상태에 따라 OFDM(Orthogonal frequency Division Multiplexing) modulation scheme을 기반으로 제공하는 7가지 PHY(Physical) mode를 Good 그룹과 Bad 그룹으로 양분하고, Good 그룹에 속하는 단말들에게 랜덤 액세스 과정에서 우선순위를 갖게 함으로써 처리율을 높이도록 하는 방식을 취하고 있다. ARAH 방식에 대하여 성능을 평가한 결과, 처리율과 전송 지연에 대해 성능이 향상됨을 보이고 있다.