• Title/Summary/Keyword: decision algorithm

검색결과 2,348건 처리시간 0.029초

Decision Support Tool for Evaluating Push and Pull Strategies in the Flow Shop with a Bottleneck Resource

  • Chiadamrong, N.;Techalert, T.;Pichalai, A.
    • Industrial Engineering and Management Systems
    • /
    • 제6권1호
    • /
    • pp.83-93
    • /
    • 2007
  • This paper gives an attempt to build a decision support tool linked with a simulation software called ARENA for evaluating and comparing the performance of the push and pull material driven strategies operating in the flow shop environment with a bottleneck resource as the shop's constraint. To be fair for such evaluation, the comparison must be made fairly under the optimal setting of both systems' operating parameters. In this study, an optimal-seeking heuristic algorithm, Genetic Algorithm (GA), is employed to suggest a systems' best design based on the economic consideration, which is the profit generated from the system. Results from the study have revealed interesting outcomes, letting us know the strength and weakness of the push and pull mechanisms as well as the effect of each operating parameter to the overall system's financial performance.

회전결정경계를 이용한 QPSK 복조용 자동주파수 제어 알고리즘 (A rotational decision-directed AFC algorithm for QPSK demodulation)

  • 황유모;박경배
    • 전자공학회논문지S
    • /
    • 제34S권11호
    • /
    • pp.16-24
    • /
    • 1997
  • In order to prevent the presence of the residual phase difference at the discriminator output by the existing AFC techniques, we propose a new automatic frequency control(AFC) tracking algorithm for QPSK demodulation at the digital direct broadcasting satellite(DBS) receiver, which we call a rotational decision-directed AFC(RDDAFC). The RDDAFC rotates the decision boundary for the kth received symbol by the frequency deterctor output of the (k-1)th received symbol. Tracking performances of carrier frequency offset by the proposed RDDAFC algorithm are evaluated through computer simulations under the practical DBS channel conditions with a carrier frequency offset of 2.3MHz when S/N equals 2dB. Test results show that the total pull-in time of the RDDAFC is 1.697msec for 10$^{-3}$ SER before forwared error correction at the receiver.

  • PDF

Fast Intra-Prediction Mode Decision Algorithm for H.264/AVC using Non-parametric Thresholds and Simplified Directional Masks

  • Kim, Young-Ju
    • Journal of information and communication convergence engineering
    • /
    • 제7권4호
    • /
    • pp.501-506
    • /
    • 2009
  • In the H.264/ AVC video coding standard, the intra-prediction coding with various block sizes offers a considerably high improvement in coding efficiency compared to previous standards. In order to achieve this, H.264/AVC uses the Rate-distortion optimization (RDO) technique to select the best intraprediction mode for a macroblock, and it brings about the drastic increase of the computation complexity of H.264 encoder. To reduce the computation complexity and stabilize the coding performance on visual quality, this paper proposed a fast intra-prediction mode decision algorithm using non-parametric thresholds and simplified directional masks. The use of nonparametric thresholds makes the intra-coding performance not be dependent on types of video sequences and simplified directional masks reduces the compuation loads needed by the calculation of local edge information. Experiment results show that the proposed algorithm is able to reduce more than 55% of the whole encoding time with a negligible loss in PSNR and bitrates and provides the stable performance regardless types of video sequences.

Industrial Waste Database Analysis Using Data Mining

  • 조광현;박희창
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 한국데이터정보과학회 2006년도 PROCEEDINGS OF JOINT CONFERENCEOF KDISS AND KDAS
    • /
    • pp.241-251
    • /
    • 2006
  • Data mining is the method to find useful information for large amounts of data in database It is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. The methods of data mining are decision tree, association rules, clustering, neural network and so on. We analyze industrial waste database using data mining technique. We use k-means algorithm for clustering and C5.0 algorithm for decision tree and Apriori algorithm for association rule. We can use these analysis outputs for environmental preservation and environmental improvement.

  • PDF

CHAID Algorithm by Cube-based Proportional Sampling

  • 박희창;조광현
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 한국데이터정보과학회 2004년도 춘계학술대회
    • /
    • pp.39-50
    • /
    • 2004
  • The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. CHAID(Chi-square Automatic Interaction Detector) uses the chi-squired statistic to determine splitting and is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose CHAID algorithm by cube-based proportional sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

  • PDF

CHAID Algorithm by Cube-based Proportional Sampling

  • Park, Hee-Chang;Cho, Kwang-Hyun
    • Journal of the Korean Data and Information Science Society
    • /
    • 제15권4호
    • /
    • pp.803-816
    • /
    • 2004
  • The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. CHAID uses the chi-squired statistic to determine splitting and is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose CHAID algorithm by cube-based proportional sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

  • PDF

Depth-of-interest-based Bypass Coding-unit Algorithm for Inter-prediction in High-efficiency Video Coding

  • Rhee, Chae Eun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제5권4호
    • /
    • pp.231-234
    • /
    • 2016
  • The next-generation video coding standard known as High-Efficiency Video Coding (HEVC) was developed with the aim of doubling the bitrate reduction offered by H.264/Advanced Video Coding (AVC) at the expense of an increase in computational complexity. Mode decision with motion estimation is still one of the most time-consuming computations in HEVC, as it is with H.264/AVC. Several schemes for a fast mode decision have been presented in reference software and in other studies. However, a possible speed-up in conventional schemes is sometimes insignificant for videos that have inhomogeneous spatial and temporal characteristics. This paper proposes a bypass algorithm to skip large-block-size predictions for videos where small block sizes are preferred over large ones. The proposed algorithm does not overlap with those in previous works, and thus, is easily used with other fast algorithms. Consequently, an independent speed-up is possible.

H.264/AVC를 위해 inter mode에 적용된 향상된 고속 모드 결정 알고리즘 (Advanced Fast Mode Decision Algorithm Applied to Inter Mode for H.264/AVC)

  • 양상봉;조상복
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.20-22
    • /
    • 2007
  • The H.264/AVC standard developed by the joint Video Team (JVT) provides better coding efficiency than previous standards. The new emerging H.264/AVC employs variable block size motion estimation using multiple reference frame with 1/4-pel MV(Motion Vector) accuracy. These techniques are a important feature to accomplish higher coding efficiency. However, these techniques are increased overall computational complexity. To overcome this problem, this paper proposes advanced fast mode decision suited for variable block size by classifying inter mode based on Rate Distortion Optimization(RDO) technique. Proposed algorithm is going to use to implement H/W structure for fast mode decision. The experimental results shows that the proposed algorithm provides significant reduction computational complexity without any noticeable coding loss and additional computation. Entire computational complexity is decreased about 30%.

  • PDF

퍼지 동정 알고리즘을 이용한 교차로 교통 신호등 제어의 최적 주기 결정 (Decision of Optimum Cycle of Traffic Junction Vehicle Signal Control using Fuzzy Identification Algorithm)

  • 진현수;김재필;김종원;홍완혜;김성환
    • 전자공학회논문지B
    • /
    • 제30B권6호
    • /
    • pp.100-108
    • /
    • 1993
  • In this paper, noticing the point of human's ability which appropriately cope with vague conditions, we design fuzzy traffic signal light controller similar to human's distinction ability and decide the optimum cycle most suited to any traffic junction using fuzzy identification algorithm. In this study, for the control output decision process we design fuzzy controller better than electronic vehicle actuated controller in performance. We propose the cycle decision method which is not limited by the variance of traffic junction vehicle number through overcoming the limit of Webster's method which is adopted by the fixed cycle controller. Simulated experimental results show that fuzzy controller and fuzzy identification algorithm are better than the existing electronic vehicle actuated controller and fixed cycle controller in delay time per vehicle.

  • PDF

계층화된 링크 - 상태 인터넷 라우팅에서 가상 링크 운용 최적화를 위한 다기준 유전자 알고리즘의 응용 (Optimal Operations of the Virtual Link System in Hierarchical Link-State Routing: A Multi-Criteria Genetic Algorithm Approach)

  • 김도훈
    • 산업공학
    • /
    • 제16권spc호
    • /
    • pp.14-20
    • /
    • 2003
  • This paper presents a multi-criteria decision model and Multi-Criteria Generic Algorithm(MCGA) approach to improve backbone topology by leveraging the Virtual Link(VL) system in an hierarchical Link-State(LS) routing domain. Given that the sound backbone topology structure has a great impact on the overall routing performance in an hierarchical LS domain, the importance of this research is evident. The proposed decision model is to find an optimal configuration of VLs that properly meets two-pronged engineering goals in installing and maintaining VLs: i.e., operational costs and network reliability. The experiment results clearly indicates that it is essential to the effective operations of hierarchical LS routing domain to consider not only engineering aspects but also specific benefits from systematical layout of VLs, thereby presenting the validity of the decision model and MCGA.