• Title/Summary/Keyword: Incremental Algorithm

Search Result 371, Processing Time 0.026 seconds

Advanced Method for an Initial Pole Position Estimation of a PMLSM (PMLSM의 개선된 초기 자극위치 추정방법)

  • Lee Jin-Woo
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.10 no.2
    • /
    • pp.124-129
    • /
    • 2005
  • This paper presents an advanced method for an initial pole position estimation of a Permanent Magnet Linear Synchronous Motor(PMLSM) that has an accurate incremental encoder for servo applications but does not have Hall sensors as a magnetic pole sensor. By appropriately using the secant method as a numerical method the proposed algorithm finds either of two zero force positions and then the correct d-axis by applying a q-axis test current. It only requires the tuned current controller and the relative position information md so it can be simply applicable to a rotary PMSM. The experimental results show the validity of the proposed method, which has an excellent performance with respect to an accurate pole position estimation under the minimal moving distance(average of about 85㎛) during the estimation process.

An Incremental Clustering Technique of XML Documents using Cluster Histograms (클러스터의 히스토그램을 이용한 XML 문서의 점진적 클러스터링 기법)

  • Hwang, Jeong-Hee
    • Journal of KIISE:Databases
    • /
    • v.34 no.3
    • /
    • pp.261-269
    • /
    • 2007
  • As a basic research to integrate and to retrieve XML documents efficiently, this paper proposes a clustering method by structures of XML documents. We apply an algorithm processing the many transaction data to the clustering of XML documents, which is a quite different method from the previous algorithms measuring structure similarity. Our method performs the clustering of XML documents not only using the cluster histograms that represent the distribution of items in clusters but also considering the global cluster cohesion. We compare the proposed method with the existing techniques by performing experiments. Experiments show that our method not only creates good quality clusters but also improves the processing time.

Uncertainty Analysis in Hydrologic and Climate Change Impact Assessment in Streamflow of Upper Awash River Basin

  • Birhanu, Dereje;Kim, Hyeonjun;Jang, Cheolhee;Park, Sanghyun
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2019.05a
    • /
    • pp.327-327
    • /
    • 2019
  • The study will quantify the total uncertainties in streamflow and precipitation projections for Upper Awash River Basin located in central Ethiopia. Three hydrological models (GR4J, CAT, and HBV) will be used to simulate the streamflow considering two emission scenarios, six high-resolution GCMs, and two downscaling methods. The readily available hydrometeorological data will be applied as an input to the three hydrological models and the potential evapotranspiration will be estimated using the Penman-Monteith Method. The SCE-UA algorithm implemented in PEST will be used to calibrate the three hydrological models. The total uncertainty including the incremental uncertainty at each stage (emission scenarios and model) will be presented after assessing a total of 24 (=$2{\times}6{\times}2$) high-resolution precipitation projections and 72 (=$2{\times}6{\times}2{\times}3$) streamflow projections for the study basin. Finally, the primary causes that generate uncertainties in future climate change impact assessments will be identified and a conclusion will be made based on the finding of the study.

  • PDF

Incremental extended finite element method for thermal cracking of mass concrete at early ages

  • Zhu, Zhenyang;Zhang, Guoxin;Liu, Yi;Wang, Zhenhong
    • Structural Engineering and Mechanics
    • /
    • v.69 no.1
    • /
    • pp.33-42
    • /
    • 2019
  • Thermal cracks are cracks that commonly form at early ages in mass concrete. During the concrete pouring process, the elastic modulus changes continuously. This requires the time domain to be divided into several steps in order to solve for the temperature, stress, and displacement of the concrete. Numerical simulations of thermal crack propagation in concrete are more difficult at early ages. To solve this problem, this study divides crack propagation in concrete at early ages into two cases: the case in which cracks do not propagate but the elastic modulus of the concrete changes and the case in which cracks propagate at a certain time. This paper provides computational models for these two cases by integrating the characteristics of the extended finite element algorithm, compiles the corresponding computational programs, and verifies the accuracy of the proposed model using numerical comparisons. The model presented in this paper has the advantages of high computational accuracy and stable results in resolving thermal cracking and its propagation in concrete at early ages.

EER-ASSL: Combining Rollback Learning and Deep Learning for Rapid Adaptive Object Detection

  • Ahmed, Minhaz Uddin;Kim, Yeong Hyeon;Rhee, Phill Kyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.12
    • /
    • pp.4776-4794
    • /
    • 2020
  • We propose a rapid adaptive learning framework for streaming object detection, called EER-ASSL. The method combines the expected error reduction (EER) dependent rollback learning and the active semi-supervised learning (ASSL) for a rapid adaptive CNN detector. Most CNN object detectors are built on the assumption of static data distribution. However, images are often noisy and biased, and the data distribution is imbalanced in a real world environment. The proposed method consists of collaborative sampling and EER-ASSL. The EER-ASSL utilizes the active learning (AL) and rollback based semi-supervised learning (SSL). The AL allows us to select more informative and representative samples measuring uncertainty and diversity. The SSL divides the selected streaming image samples into the bins and each bin repeatedly transfers the discriminative knowledge of the EER and CNN models to the next bin until convergence and incorporation with the EER rollback learning algorithm is achieved. The EER models provide a rapid short-term myopic adaptation and the CNN models an incremental long-term performance improvement. EER-ASSL can overcome noisy and biased labels in varying data distribution. Extensive experiments shows that EER-ASSL obtained 70.9 mAP compared to state-of-the-art technology such as Faster RCNN, SSD300, and YOLOv2.

Study on the effect of corrosion defects on VIV behavior of marine pipe using a new defective pipe element

  • Zhang, He;Xu, Chengkan;Shen, Xinyi;Jiang, Jianqun
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.12 no.1
    • /
    • pp.552-568
    • /
    • 2020
  • After long-term service in deep ocean, pipelines are usually suffered from corrosions, which may greatly influence the Vortex-Induced Vibration (VIV) behavior of pipes. Thus, we investigate the VIV of defective pipelines. The geometric nonlinearity due to large deformation of pipes and nonlinearity in vortex-induced force are simulated. This nonlinear vibration system is simulated with finite element method and solved by direct integration method with incremental algorithm. Two kinds of defects, corrosion pits and volumetric flaws, and their effects of depth and range on VIV responses are investigated. A new finite element is developed to simulate corrosion pits. Defects are found to aggravate VIV displacement response only if environmental flow rate is less than resonance flow rate. As the defect depth grows, the stress responses increase, however, the increase of the defect range reduces the stress response at corroded part. The volumetric flaws affect VIV response stronger than the corrosion pits.

An Efficient Approach for Single-Pass Mining of Web Traversal Sequences (단일 스캔을 통한 웹 방문 패턴의 탐색 기법)

  • Kim, Nak-Min;Jeong, Byeong-Soo;Ahmed, Chowdhury Farhan
    • Journal of KIISE:Databases
    • /
    • v.37 no.5
    • /
    • pp.221-227
    • /
    • 2010
  • Web access sequence mining can discover the frequently accessed web pages pursued by users. Utility-based web access sequence mining handles non-binary occurrences of web pages and extracts more useful knowledge from web logs. However, the existing utility-based web access sequence mining approach considers web access sequences from the very beginning of web logs and therefore it is not suitable for mining data streams where the volume of data is huge and unbounded. At the same time, it cannot find the recent change of knowledge in data streams adaptively. The existing approach has many other limitations such as considering only forward references of web access sequences, suffers in the level-wise candidate generation-and-test methodology, needs several database scans, etc. In this paper, we propose a new approach for high utility web access sequence mining over data streams with a sliding window method. Our approach can not only handle large-scale data but also efficiently discover the recently generated information from data streams. Moreover, it can solve the other limitations of the existing algorithm over data streams. Extensive performance analyses show that our approach is very efficient and outperforms the existing algorithm.

Digital Control for BUCK-BOOST Type Solar Array Regulator (벅-부스트 형 태양전력 조절기의 디지털 제어)

  • Yang, JeongHwan;Yun, SeokTeak;Park, SeongWoo
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.3
    • /
    • pp.135-139
    • /
    • 2012
  • A digital controller can simply realize a complex operation algorithm and power control process which can not be applied by an analog circuit for a solar array regulator(SAR). The digital resistive control(DRC) makes an equivalent input impedance of the SAR be resistive characteristic. The resistance of the solar array varies largely in a voltage source region and slightly in a current source region. Therefore when the solar array regulator is controlled by the DRC, the Advanced Incremental Conductance MPPT Algorithm with a Variable Step Size(AIC-MPPT-VSS) is suitable. The AIC-MPPT-VSS, however, using small signal resistance and large signal resistance of the solar array can not limit the absolute value of the solar array power. In this paper, the solar array power limiter is suggested and the BUCK-BOOST type SAR which is fully controlled by the digital controller is verified by simulation.

The Effect of Sample and Particle Sizes in Discrete Particle Swarm Optimization for Simulation-based Optimization Problems (시뮬레이션 최적화 문제 해결을 위한 이산 입자 군집 최적화에서 샘플수와 개체수의 효과)

  • Yim, Dong-Soon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.1
    • /
    • pp.95-104
    • /
    • 2017
  • This paper deals with solution methods for discrete and multi-valued optimization problems. The objective function of the problem incorporates noise effects generated in case that fitness evaluation is accomplished by computer based experiments such as Monte Carlo simulation or discrete event simulation. Meta heuristics including Genetic Algorithm (GA) and Discrete Particle Swarm Optimization (DPSO) can be used to solve these simulation based multi-valued optimization problems. In applying these population based meta heuristics to simulation based optimization problem, samples size to estimate the expected fitness value of a solution and population (particle) size in a generation (step) should be carefully determined to obtain reliable solutions. Under realistic environment with restriction on available computation time, there exists trade-off between these values. In this paper, the effects of sample and population sizes are analyzed under well-known multi-modal and multi-dimensional test functions with randomly generated noise effects. From the experimental results, it is shown that the performance of DPSO is superior to that of GA. While appropriate determination of population sizes is more important than sample size in GA, appropriate determination of sample size is more important than particle size in DPSO. Especially in DPSO, the solution quality under increasing sample sizes with steps is inferior to constant or decreasing sample sizes with steps. Furthermore, the performance of DPSO is improved when OCBA (Optimal Computing Budget Allocation) is incorporated in selecting the best particle in each step. In applying OCBA in DPSO, smaller value of incremental sample size is preferred to obtain better solutions.

The Study on Improvement of Cohesion of Clustering in Incremental Concept Learning (점진적 개념학습의 클러스터 응집도 개선)

  • Baek, Hey-Jung;Park, Young-Tack
    • The KIPS Transactions:PartB
    • /
    • v.10B no.3
    • /
    • pp.297-304
    • /
    • 2003
  • Nowdays, with the explosive growth of the web information, web users Increase requests of systems which collect and analyze web pages that are relevant. The systems which were develop to solve the request were used clustering methods to improve the duality of information. Clustering is defining inter relationship of unordered data and grouping data systematically. The systems using clustering provide the grouped information to the users. So, they understand the information efficiently. We proposed a hybrid clustering method to cluster a large quantity of data efficiently. By that method, We generate initial clusters using COBWEB Algorithm and refine them using Ezioni Algorithm. This paper adds two ideas in prior hybrid clustering method to increment accuracy and efficiency of clusters. Firstly, we propose the clustering method considering weight of attributes of data. Second, we redefine evaluation functions which generate initial clusters to increase efficiency in clustering. Clustering method proposed in this paper processes a large quantity of data and diminish of dependancy on sequence of input of data. So the clusters are useful to make user profiles in high quality. Ultimately, we will show that the proposed clustering method outperforms the pervious clustering method in the aspect of precision and execution speed.