• 제목/요약/키워드: sine-cosine process

검색결과 10건 처리시간 0.019초

Knee-driven many-objective sine-cosine algorithm

  • Hongxia, Zhao;Yongjie, Wang;Maolin, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권2호
    • /
    • pp.335-352
    • /
    • 2023
  • When solving multi-objective optimization problems, the blindness of the evolution direction of the population gradually emerges with the increase in the number of objectives, and there are also problems of convergence and diversity that are difficult to balance. The many- objective optimization problem makes some classic multi-objective optimization algorithms face challenges due to the huge objective space. The sine cosine algorithm is a new type of natural simulation optimization algorithm, which uses the sine and cosine mathematical model to solve the optimization problem. In this paper, a knee-driven many-objective sine-cosine algorithm (MaSCA-KD) is proposed. First, the Latin hypercube population initialization strategy is used to generate the initial population, in order to ensure that the population is evenly distributed in the decision space. Secondly, special points in the population, such as nadir point and knee points, are adopted to increase selection pressure and guide population evolution. In the process of environmental selection, the diversity of the population is promoted through diversity criteria. Through the above strategies, the balance of population convergence and diversity is achieved. Experimental research on the WFG series of benchmark problems shows that the MaSCA-KD algorithm has a certain degree of competitiveness compared with the existing algorithms. The algorithm has good performance and can be used as an alternative tool for many-objective optimization problems.

재귀형 최소 자승법을 이용한 자기 위치 센서의 실시간 보상 방법 (On-line Compensation Method for Magnetic Position Sensor using Recursive Least Square Method)

  • 김지원;문석환;이지영;장정환;김장목
    • 전기학회논문지
    • /
    • 제60권12호
    • /
    • pp.2246-2253
    • /
    • 2011
  • This paper presents the error correction method of magnetic position sensor using recursive least square method (RLSM) with forgetting factor. Magnetic position sensor is proposed for linear position detection of the linear motor which has tooth shape stator, consists of permanent magnet, iron core and linear hall sensor, and generates sine and cosine waveforms according to the movement of the mover of the linear motor. From the output of magnetic position sensor, the position of the linear motor can be detected using arc-tan function. But the variation of the air gap between magnetic position sensor and the stator and the error in manufacturing process can cause the variation in offset, phase and amplitude of the generated waveforms when the linear motor moves. These variations in sine and cosine waveforms are changed according to the current linear motor position, and it is very difficult to compensate the errors using constant value. In this paper, the generated sine and cosine waveforms from the magnetic position sensor are compensated on-line using the RLSM with forgetting factor. And the speed observer is introduced to reduce the effect of uncompensated harmonic component. The approaches are verified by some simulations and experiments.

Centralized Clustering Routing Based on Improved Sine Cosine Algorithm and Energy Balance in WSNs

  • Xiaoling, Guo;Xinghua, Sun;Ling, Li;Renjie, Wu;Meng, Liu
    • Journal of Information Processing Systems
    • /
    • 제19권1호
    • /
    • pp.17-32
    • /
    • 2023
  • Centralized hierarchical routing protocols are often used to solve the problems of uneven energy consumption and short network life in wireless sensor networks (WSNs). Clustering and cluster head election have become the focuses of WSNs. In this paper, an energy balanced clustering routing algorithm optimized by sine cosine algorithm (SCA) is proposed. Firstly, optimal cluster head number per round is determined according to surviving node, and the candidate cluster head set is formed by selecting high-energy node. Secondly, a random population with a certain scale is constructed to represent a group of cluster head selection scheme, and fitness function is designed according to inter-cluster distance. Thirdly, the SCA algorithm is improved by using monotone decreasing convex function, and then a certain number of iterations are carried out to select a group of individuals with the minimum fitness function value. From simulation experiments, the process from the first death node to 80% only needs about 30 rounds. This improved algorithm balances the energy consumption among nodes and avoids premature death of some nodes. And it greatly improves the energy utilization and extends the effective life of the whole network.

ESPI 에서의 이상적인 위상도 추출과 필터링 방법 (Ideal Phase map Extraction Method and Filtering of Electronic Speckle Pattern Interferometry)

  • 유원재;이주성;강영준;채희창
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2001년도 춘계학술대회 논문집
    • /
    • pp.235-238
    • /
    • 2001
  • Deformation phase can be obtained by using Least-Square Fitting. In extraction of phase values, Least-Square Fitting is superior to usual method like as 2, 3, 4-Bucket Algorithm. That can extract almost noise-free phase and retain 2$\pi$discontinuities. But more fringe in phase map, 2$\pi$ discontinuities is destroyed when that is filtered and reconstruction of deformation is not reliable. So, we adapted Least-Square Fitting using an isotropic window in dense fringe. using Sine-Cosine filter give us perfect 2$\pi$discontinuities information. We showed the process and result of extraction of phase map and filtering in this paper.

  • PDF

전자 스페클 간섭법에서의 이상적인 위상도 추출과 필터링 방법 (Ideal Phase map Extraction Method and Filtering of Electronic Speckle Pattern Interferometry)

  • 강영준;이주성;박낙규;권용기
    • 한국정밀공학회지
    • /
    • 제19권12호
    • /
    • pp.20-26
    • /
    • 2002
  • Deformation phase can be obtained by using Least-Square fitting. In extraction of phase values, Least-Square Fitting is superior to usual method such as 2, 3, 4-Bucket Algorithm. That can extract almost noise-free phase and retain 2 $\pi$ discontinuities. But more fringes in phase map, 2 $\pi$ discontinuities are destroyed when that are filtered and reconstruction of deformation is not reliable. So, we adapted Least-Square fitting using an isotropic window in dense fringe. Using Sine/cosine filter give us perfect 2 $\pi$ discontinuities information. We showed the process and result of extraction of phase map and filtering in this paper.

Genetic association tests when a nuisance parameter is not identifiable under no association

  • Kim, Wonkuk;Kim, Yeong-Hwa
    • Communications for Statistical Applications and Methods
    • /
    • 제24권6호
    • /
    • pp.663-671
    • /
    • 2017
  • Some genetic association tests include an unidentifiable nuisance parameter under the null hypothesis of no association. When the mode of inheritance (MOI) is not specified in a case-control design, the Cochran-Armitage (CA) trend test contains an unidentifiable nuisance parameter. The transmission disequilibrium test (TDT) in a family-based association study that includes the unaffected also contains an unidentifiable nuisance parameter. The hypothesis tests that include an unidentifiable nuisance parameter are typically performed by taking a supremum of the CA tests or TDT over reasonable values of the parameter. The p-values of the supremum test statistics cannot be obtained by a normal or chi-square distribution. A common method is to use a Davies's upper bound of the p-value instead of an exact asymptotic p-value. In this paper, we provide a unified sine-cosine process expression of the CA trend test that does not specify the MOI and the TDT that includes the unaffected. We also present a closed form expression of the exact asymptotic formulas to calculate the p-values of the supremum tests when the score function can be written as a linear form in an unidentifiable parameter. We illustrate how to use the derived formulas using a pharmacogenetics case-control dataset and an attention deficit hyperactivity disorder family-based example.

개선된 퍼지 추론 규칙을 이용한 색채 정보 인식에 관한 연구 (A Study on Color Information Recognition with Improved Fuzzy Inference Rules)

  • 우승범;김광백
    • 한국콘텐츠학회:학술대회논문집
    • /
    • 한국콘텐츠학회 2009년도 춘계 종합학술대회 논문집
    • /
    • pp.105-111
    • /
    • 2009
  • RGB 모델을 통한 정적인 추론 규칙을 적용한 기존의 색채 정보 인식 방법은 RGB모델이 가지는 인간 시각과의 괴리감과 특정한 환경에서만 적용할 수 있는 문제점이 있다. 본 논문에서는 HSI 모델을 적용하여 색채에 대한 인간 인식 과정과 유사한 형태의 추론 방식과, 사용자에 의해서 추론규칙을 추가, 수정, 삭제 할 수 있는 방법을 제안한다. 본 논문에서는 H, S, I 각각의 소속구간에 대하여 H는 Sine, Cosine 함수를 사용하여 소속구간을 설계하였으며, S, I는 삼각 타입의 소속 함수로 설계하였다. 설계된 각각의 소속구간에 대하여 소속구간 병합을 적용하여 소속도를 계산하고, 계산된 결과들은 미리 제시된 추론규칙에 적용하여 색채를 추론한다. 제안된 두 가지 방법을 적용하여 실험한 결과, 기존의 방법보다 제안된 방법이 비교적 직관적이며 효율적인 형태로 결론을 도출할 수 있음을 확인하였다.

  • PDF

개선된 퍼지 추론 기법을 이용한 칼라 분석 (Color Analysis with Enhanced Fuzzy Inference Method)

  • 김광백
    • 한국컴퓨터정보학회논문지
    • /
    • 제14권8호
    • /
    • pp.25-31
    • /
    • 2009
  • RGB 모델을 통한 정적인 추론 규칙을 적용한 기존의 색채 정보 인식 방법은 RGB 모델이 가지는 인간 시각과의 괴리감과 특정한 환경에서만 적용할 수 있는 문제점이 있다. 본 논문에서는 HSI 모델을 적용하여 색채에 대한 인간 인식 과정과 유사한 형태의 추론 방식과, 사용자에 의해서 추론 규칙을 추가, 수정, 삭제 할 수 있는 방법을 제안한다. 본 논문에서는 각각의 H, S, I 소속 구간에 대하여 H는 Sine, Cosine 함수를 사용하여 소속 구간을 설계하며, S, I는 삼각형 타입의 소속 함수로 설계한다. 설계된 각각의 소속 구간에 대하여 소속 구간 병합을 적용하여 소속도를 계산하고, 계산된 결과들은 미리 제시된 추론 규칙에 적용하여 색채를 추론한다. 제안된 두가지 방법을 적용하여 실험한 결과, 기존의 방법보다 제안된 방법이 비교적 직관적이며 효율적인 형태로 결론을 도출할 수 있음을 확인하였다.

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
    • /
    • 제9권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

Machine learning-based design automation of CMOS analog circuits using SCA-mGWO algorithm

  • Vijaya Babu, E;Syamala, Y
    • ETRI Journal
    • /
    • 제44권5호
    • /
    • pp.837-848
    • /
    • 2022
  • Analog circuit design is comparatively more complex than its digital counterpart due to its nonlinearity and low level of abstraction. This study proposes a novel low-level hybrid of the sine-cosine algorithm (SCA) and modified grey-wolf optimization (mGWO) algorithm for machine learning-based design automation of CMOS analog circuits using an all-CMOS voltage reference circuit in 40-nm standard process. The optimization algorithm's efficiency is further tested using classical functions, showing that it outperforms other competing algorithms. The objective of the optimization is to minimize the variation and power usage, while satisfying all the design limitations. Through the interchange of scripts for information exchange between two environments, the SCA-mGWO algorithm is implemented and simultaneously simulated. The results show the robustness of analog circuit design generated using the SCA-mGWO algorithm, over various corners, resulting in a percentage variation of 0.85%. Monte Carlo analysis is also performed on the presented analog circuit for output voltage and percentage variation resulting in significantly low mean and standard deviation.