• Title/Summary/Keyword: Convergence order

Search Result 6,614, Processing Time 0.032 seconds

A convergence study on the effects of positive psychological capital on job performance and job satisfaction of hair beauty service workers (헤어미용 서비스 종사자의 긍정심리자본이 직무성과와 직무만족에 미치는 영향에 대한 융합적 연구)

  • Yi, Hyeon-Seo
    • Journal of the Korea Convergence Society
    • /
    • v.13 no.4
    • /
    • pp.477-485
    • /
    • 2022
  • This study was conducted to provide basic data to promote hair beauty service education by identifying the difference in the effect of positive psychological capital on job performance and job satisfaction of hair salon workers. For this purpose, in order to empirically verify the effect of positive psychological capital on job performance and job satisfaction of hair salon workers, 280 people engaged in hair salon workers in Gwangju, Daegu and Gyeongsangbuk-do were targeted. As a result of the study, positive psychological capital of hair and hair salon workers affects job performance and job satisfaction, and among the sub-factors of positive psychological capital, hope and optimism appear to affect both job performance and job satisfaction. Therefore, in order to strengthen the positive psychological capital of hair salon workers, it is necessary to develop a convergence program development and strategy that can enhance job performance and job satisfaction and apply it to the hair beauty service field.

Distributed Constrained Power Control with Fast Outage Convegence in CDMA systems

  • Lee, Moo-Young;Oh, Do-Chang;Kwon, Woo-Hyen
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2121-2125
    • /
    • 2003
  • This paper proposes a fast distributed constrained power control (FDCPC) with non-stationary relaxation factor to next power update in CDMA cellular power control system. We review unconstrained control algorithms, the distributed power control (DPC), unconstrained second order power control (USOPC) and DPC with stationary relaxation factor (DPCSRF). Under the unconstrained condition, the convergence analysis shows theoretically that the convergence rate of DPC is the fastest one. However, under the constrained control algorithms, DCPC is not the fastest one any more because of transmission power constraint. To improve the convergence speed, the DCPC with non-stationary relaxation factor (FDCPC) are proposed. Under the constrained condition, the convergence rate of FDCPC outperforms that of DCPC and CSOPC.

  • PDF

Orbit Determination Accuracy Improvement for Geostationary Satellite with Single Station Antenna Tracking Data

  • Hwang, Yoo-La;Lee, Byoung-Sun;Kim, Hae-Yeon;Kim, Hae-Dong;Kim, Jae-Hoon
    • ETRI Journal
    • /
    • v.30 no.6
    • /
    • pp.774-782
    • /
    • 2008
  • An operational orbit determination (OD) and prediction system for the geostationary Communication, Ocean, and Meteorological Satellite (COMS) mission requires accurate satellite positioning knowledge to accomplish image navigation registration on the ground. Ranging and tracking data from a single ground station is used for COMS OD in normal operation. However, the orbital longitude of the COMS is so close to that of satellite tracking sites that geometric singularity affects observability. A method to solve the azimuth bias of a single station in singularity is to periodically apply an estimated azimuth bias using the ranging and tracking data of two stations. Velocity increments of a wheel off-loading maneuver which is performed twice a day are fixed by planned values without considering maneuver efficiency during OD. Using only single-station data with the correction of the azimuth bias, OD can achieve three-sigma position accuracy on the order of 1.5 km root-sum-square.

  • PDF

Comparative Study on Structural Optimal Design Using Micro-Genetic Algorithm (마이크로 유전자 알고리즘을 적용한 구조 최적설계에 관한 비교 연구)

  • 한석영;최성만
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.12 no.3
    • /
    • pp.82-88
    • /
    • 2003
  • SGA(Single Genetic Algorithm) is a heuristic global optimization method based on the natural characteristics and uses many populations and stochastic rules. Therefore SGA needs many function evaluations and takes much time for convergence. In order to solve the demerits of SGA, ${\mu}GA$(Micro-Genetic Algorithm) has recently been developed. In this study, ${\mu}GA$ which have small populations and fast convergence rate, was applied to structural optimization with discrete or integer variables such as 3, 10 and 25 bar trusses. The optimized results of ${\mu}GA$ were compared with those of SGA. Solutions of ${\mu}GA$ for structural optimization were very similar or superior to those of SGA, and faster convergence rate was obtained. From the results of examples, it is found that ${\mu}GA$ is a suitable and very efficient optimization algorithm for structural design.

GENERATING SAMPLE PATHS AND THEIR CONVERGENCE OF THE GEOMETRIC FRACTIONAL BROWNIAN MOTION

  • Choe, Hi Jun;Chu, Jeong Ho;Kim, Jongeun
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.4
    • /
    • pp.1241-1261
    • /
    • 2018
  • We derive discrete time model of the geometric fractional Brownian motion. It provides numerical pricing scheme of financial derivatives when the market is driven by geometric fractional Brownian motion. With the convergence analysis, we guarantee the convergence of Monte Carlo simulations. The strong convergence rate of our scheme has order H which is Hurst parameter. To obtain our model we need to convert Wick product term of stochastic differential equation into Wick free discrete equation through Malliavin calculus but ours does not include Malliavin derivative term. Finally, we include several numerical experiments for the option pricing.

Derivative Evaluation and Conditional Random Selection for Accelerating Genetic Algorithms

  • Jung, Sung-Hoon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.5 no.1
    • /
    • pp.21-28
    • /
    • 2005
  • This paper proposes a new method for accelerating the search speed of genetic algorithms by taking derivative evaluation and conditional random selection into account in their evolution process. Derivative evaluation makes genetic algorithms focus on the individuals whose fitness is rapidly increased. This accelerates the search speed of genetic algorithms by enhancing exploitation like steepest descent methods but also increases the possibility of a premature convergence that means most individuals after a few generations approach to local optima. On the other hand, derivative evaluation under a premature convergence helps genetic algorithms escape the local optima by enhancing exploration. If GAs fall into a premature convergence, random selection is used in order to help escaping local optimum, but its effects are not large. We experimented our method with one combinatorial problem and five complex function optimization problems. Experimental results showed that our method was superior to the simple genetic algorithm especially when the search space is large.

Structural Optimization Using Micro-Genetic Algorithm (마이크로 유전자 알고리즘을 이용한 구조 최적설계)

  • 한석영;최성만
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2003.04a
    • /
    • pp.9-14
    • /
    • 2003
  • SGA (Single Genetic Algorithm) is a heuristic global optimization method based on the natural characteristics and uses many populations and stochastic rules. Therefore SGA needs many function evaluations and takes much time for convergence. In order to solve the demerits of SGA, $\mu$GA(Micro-Genetic Algorithm) has recently been developed. In this study, $\mu$GA which have small populations and fast convergence rate, was applied to structural optimization with discrete or integer variables such as 3, 10 and 25 bar trusses. The optimized results of $\mu$GA were compared with those of SGA. Solutions of $\mu$GA for structural optimization were very similar or superior to those of SGA, and faster convergence rate was obtained. From the results of examples, it is found that $\mu$GA is a suitable and very efficient optimization algorithm for structural design.

  • PDF

Experimental Study on Bi-directional Filtered-x Least Mean Square Algorithm (양방향 Filtered-x 최소 평균 제곱 알고리듬에 대한 실험적인 연구)

  • Kwon, Oh Sang
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.3
    • /
    • pp.197-205
    • /
    • 2014
  • In applications of adaptive noise control or active noise control, the presence of a transfer function in the secondary path following the adaptive controller and the error path, been shown to generally degrade the performance of the Least Mean Square (LMS) algorithm. Thus, the convergence rate is lowered, the residual power is increased, and the algorithm can become unstable. In general, in order to solve these problems, the filtered-x LMS (FX-LMS) type algorithms can be used. But these algorithms have slow convergence speed and weakness in the environment that the secondary path and error path are varied. Therefore, I present the new algorithm called the "Bi-directional Filtered-x (BFX) LMS" algorithm with nearly equal computation complexity. Through experimental study, the proposed BFX-LMS algorithm has better convergence speed and better performance than the conventional FX-LMS algorithm, especially when the secondary path or error path is varied and the impulsive disturbance is flow in.

Individual Pig Detection using Fast Region-based Convolution Neural Network (고속 영역기반 컨볼루션 신경망을 이용한 개별 돼지의 탐지)

  • Choi, Jangmin;Lee, Jonguk;Chung, Yongwha;Park, Daihee
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.216-224
    • /
    • 2017
  • Abnormal situation caused by aggressive behavior of pigs adversely affects the growth of pigs, and comes with an economic loss in intensive pigsties. Therefore, IT-based video surveillance system is needed to monitor the abnormal situations in pigsty continuously in order to minimize the economic demage. Recently, some advances have been made in pig monitoring; however, detecting each pig is still challenging problem. In this paper, we propose a new color image-based monitoring system for the detection of the individual pig using a fast region-based convolution neural network with consideration of detecting touching pigs in a crowed pigsty. The experimental results with the color images obtained from a pig farm located in Sejong city illustrate the efficiency of the proposed method.

Pointwise Convergence for the FEM in Poisson Equations by a 1-Irregular Mesh (포아송 방정식에서 1-Irregular Mesh를 이용한 유한요소법의 수렴성에 관한 연구)

  • Lee, Hyoung;Ra, Sang-Dong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.11
    • /
    • pp.1194-1200
    • /
    • 1991
  • The FEM is a computer-aided mathematical technique for obtaining approximate solution to the differential equations. The pointwise convergence defines the relationship between the mesh size and the tolerance. This will play an important role in improving quality of finite element approximate solution. In the paper. We evaluate the convergence on a certain unknown point with a 1-irregular mesh refinement and spectral order enrichment. This means that the degree of freedom is minimized within a tolerance.

  • PDF