• Title/Summary/Keyword: Optimal Convergence Rate

Search Result 260, Processing Time 0.033 seconds

An Optimal Feature Selection Method to Detect Malwares in Real Time Using Machine Learning (기계학습 기반의 실시간 악성코드 탐지를 위한 최적 특징 선택 방법)

  • Joo, Jin-Gul;Jeong, In-Seon;Kang, Seung-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.2
    • /
    • pp.203-209
    • /
    • 2019
  • The performance of an intelligent classifier for detecting malwares added to multimedia contents based on machine learning is highly dependent on the properties of feature set. Especially, in order to determine the malicious code in real time the size of feature set should be as short as possible without reducing the accuracy. In this paper, we introduce an optimal feature selection method to satisfy both high detection rate and the minimum length of feature set against the feature set provided by PEFeatureExtractor well known as a feature extraction tool. For the evaluation of the proposed method, we perform the experiments using Windows Portable Executables 32bits.

An Optimal Approach to Auto-tuning of Multiple Parameters for High-Precision Servo Control Systems (고정밀 서보 제어를 위한 다매개변수 자동 조정 방법)

  • Kim, Nam Guk
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.21 no.7
    • /
    • pp.43-52
    • /
    • 2022
  • Design of a controller for a high-precision servo control system has been a popular topic while finding optimal parameters for multiple controllers is still a challenging subject. In this paper, we propose a practical scheme to optimize multi-parameters for the robust servo controller design by introducing a new cost function and optimization scheme. The proposed design method provides a simple and practical tool for the systematic servo design to reduce the control error with guaranteeing robust stability of the overall system. The reduction of the position error by 24% along with a faster convergence rate is demonstrated using a typical hard disk drive servo controller with 41 parameters.

The Improvement of Convergence Rate in n-Queen Problem Using Reinforcement learning (강화학습을 이용한 n-Queen 문제의 수렴속도 향상)

  • Lim SooYeon;Son KiJun;Park SeongBae;Lee SangJo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.1
    • /
    • pp.1-5
    • /
    • 2005
  • The purpose of reinforcement learning is to maximize rewards from environment, and reinforcement learning agents learn by interacting with external environment through trial and error. Q-Learning, a representative reinforcement learning algorithm, is a type of TD-learning that exploits difference in suitability according to the change of time in learning. The method obtains the optimal policy through repeated experience of evaluation of all state-action pairs in the state space. This study chose n-Queen problem as an example, to which we apply reinforcement learning, and used Q-Learning as a problem solving algorithm. This study compared the proposed method using reinforcement learning with existing methods for solving n-Queen problem and found that the proposed method improves the convergence rate to the optimal solution by reducing the number of state transitions to reach the goal.

Research on RAM-C-based Cost Estimation Methods for the Supply of Military Depot Maintenance PBL Project (군직 창정비 수리부속 보급 PBL 사업을 위한 RAM-C 기반 비용 예측 방안 연구)

  • Junho Park;Chie Hoon Song
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.26 no.5
    • /
    • pp.855-866
    • /
    • 2023
  • With the rapid advancement and sophistication of defense weapon systems, the government, military, and the defense industry have conducted various innovative attempts to improve the efficiency of post-logistics support(PLS). The Ministry of Defense has mandated RAM-C(Reliability, Availability, and Maintainability-Cost) analysis as a requirement according to revised Total Life Cycle System Management Code of Practice in May 2022. Especially, for the project budget forecast of new PBL(Performance Based Logistics) business contacts, RAM-C is recognized as an obligatory factor. However, relevant entities have not officially provided guidelines or manuals for RAM-C analysis, and each defense contractor conducts RAM-C analysis with different standards and methods to win PBL-related business contract. Hence, this study aims to contribute to the generalization of the analysis procedure by presenting a cost analysis case based on RAM-C for the supply of military depot maintenance PBL project. This study presents formulas and procedures to determine requirements of military depot maintenance PBL project for repair parts supply. Moreover, a sensitivity analysis was conducted to find the optimal cost/utilization ratio. During the process, a correlation was found between supply delay and total cost of ownership as well as between cost variability and utilization rate. The analysis results are expected to provide an important basis for the conceptualization of the cost analysis for the supply of military depot maintenance PBL project and are capable of proposing the optimal utilization rate in relation to cost.

A Study on the Characteristics of Fast Distributed Power Control Schemes in Cellular Network under Dynamic Channel (셀룰러 네트워크의 동적채널에서 빠른 분산 전력 제어 기법의 특성에 대한 연구)

  • Lee, Young-Dae;Park, Hyun-Sook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.2
    • /
    • pp.49-55
    • /
    • 2008
  • To address the convergence issue of power control algorithms, a number of algorithms have been developed hat shape the dynamics of up-link power control for cellular network. Power algorithms based on fixed point iterations can be accelerated by the use of various methods, one of the simplest being the use of Newton iterations, however, this method has the disadvantage which not only needs derivatives of the cost function but also may be weak to noisy environment. we showed performance of the power control schemes to solve the fixed point problem under static or stationary channel. They proved goof performance to solve the fixed point problem due to their predictor based optimal control and quadratic convergence rate. Here, we apply the proposed power control schemes to the problem of the dynamic channel or to dynamic time varying link gains. The rigorous simulation results demonstrated the validity of our approach.

  • PDF

Roundness and Dimensional Accuracy Analysis using SNCM616 Alloy Still (SNCM616 합금강을 이용한 진원도와 치수정밀도 분석)

  • Choi, Chul-Woong;Kim, Jin-Su;Shin, Mi-Jung
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.22 no.6
    • /
    • pp.599-606
    • /
    • 2019
  • In this study, it was aimed to find the optimal cutting conditions by measuring and analyzing the dimensional accuracy of SNCM 616 alloy steel, which is commonly used in industry, by precision hole machining using Ø25 mm and 8-blade reamer in CNC-HBM to be. As a result of the roundness and dimensional accuracy, it was found that the spindle speed had a significant effect on the dimensional tolerance value. Optimum cutting conditions are spindle speed 25 rpm and feed rate 20 mm / min.

PSNR-based Initial QP Determination for Low Bit Rate Video Coding

  • Park, Sang-Hyun
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.3
    • /
    • pp.315-320
    • /
    • 2012
  • In H.264/AVC, the first frame of a group of pictures (GOP) is encoded in intra mode which generates a large number of bits. The number of bits for the I-frame affects the qualities of the following frames of a GOP since they are encoded using the bits remaining among the bits allocated to the GOP. In addition, the first frame is used for the inter mode encoding of the following frames. Thus, the initial quantization parameter (QP) affects the following frames as well as the first frame. In this paper, an adaptive peak signal to noise ratio (PSNR)-based initial QP determination algorithm is presented. In the proposed algorithm, a novel linear model is established based on the observation of the relation between the initial QPs and PSNRs of frames. Using the linear model and PSNR results of the encoded GOPs, the proposed algorithm accurately estimates the optimal initial QP which maximizes the PSNR of the current GOP. It is shown by experimental results that the proposed algorithm predicts the optimal initial QP accurately and thus achieves better PSNR performance than that of the existing algorithm.

Treatment of Dye-Processing Wastewater with Complex Chemical Coagulants (복합응집제를 이용한 염색가공 폐수의 처리)

  • Seo, Myung-Po;Kim, Byung-So
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.9 no.2
    • /
    • pp.111-116
    • /
    • 2006
  • This study provides the optimal conditions treating with the coagulation process and the other chemical treatment processes for dyeing wastewater, especially various dyeing complex wastewater. The results are shown as follows: 1. Optimum reaction condition of pH for ferrous sulfate was the range of 9 to 12. And when 3,000ppm(mg/l) of ferrous sulfate was dosed, the maximum $COD_{Mn}$ removal rate was approximately 40%. 2. In case of ferrous chloride and Bittern as coagulants, optimum pH range was 10 to 11. And maximum $COD_{Mn}$ removal rate was approximately 46% to 50% for dose of 2,000ppm(mg/l) to 6,000 ppm. 3. It is confirmed that the activated sludge process following coagulation precipitation method provides better treatment efficiency than the coagulation precipitation method following the activated sludge process. 4. The purpose of this study was to produce CGF (Cyanoguanidineformaldehyde resin) by organic compounds. 5. The complex coagulation agent by this study is the most economical coagulant with Alum(aluminum sulfate) and the removal efficiency is approximately 54% with 1,000ppm(mg/l) of pH range 6 to 7.

  • PDF

A Study on the Portfolio Performance Evaluation using Actor-Critic Reinforcement Learning Algorithms (액터-크리틱 모형기반 포트폴리오 연구)

  • Lee, Woo Sik
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.25 no.3
    • /
    • pp.467-476
    • /
    • 2022
  • The Bank of Korea raised the benchmark interest rate by a quarter percentage point to 1.75 percent per year, and analysts predict that South Korea's policy rate will reach 2.00 percent by the end of calendar year 2022. Furthermore, because market volatility has been significantly increased by a variety of factors, including rising rates, inflation, and market volatility, many investors have struggled to meet their financial objectives or deliver returns. Banks and financial institutions are attempting to provide Robo-Advisors to manage client portfolios without human intervention in this situation. In this regard, determining the best hyper-parameter combination is becoming increasingly important. This study compares some activation functions of the Deep Deterministic Policy Gradient(DDPG) and Twin-delayed Deep Deterministic Policy Gradient (TD3) Algorithms to choose a sequence of actions that maximizes long-term reward. The DDPG and TD3 outperformed its benchmark index, according to the results. One reason for this is that we need to understand the action probabilities in order to choose an action and receive a reward, which we then compare to the state value to determine an advantage. As interest in machine learning has grown and research into deep reinforcement learning has become more active, finding an optimal hyper-parameter combination for DDPG and TD3 has become increasingly important.

A Rapid Convergent Max-SINR Algorithm for Interference Alignment Based on Principle Direction Search

  • Wu, Zhilu;Jiang, Lihui;Ren, Guanghui;Wang, Gangyi;Zhao, Nan;Zhao, Yaqin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1768-1789
    • /
    • 2015
  • The maximal signal-to-interference-plus-noise ratio (Max-SINR) algorithm for interference alignment (IA) has received considerable attention for its high sum rate achievement in the multiple-input multiple-output (MIMO) interference channel. However, its complexity may increase dramatically when the number of users approaches the IA feasibility bound, and the number of iterations and computational time may become unacceptable. In this paper, we study the properties of the Max-SINR algorithm thoroughly by presenting theoretical insight into the algorithm and by providing the potential of reducing the overall computational cost. Furthermore, a novel IA algorithm based on the principle direction search is proposed, which can converge more rapidly than the conventional Max-SINR method. In the proposed algorithm, it searches along the principle direction, which is found to approximately point to the convergence values, and can approach the convergence solutions rapidly. In addition, the closed-form solution of the optimal step size can be formulated in the sense of minimal interference leakage. Simulation results demonstrate that the proposed algorithm outperforms the conventional minimal interference leakage and Max-SINR algorithms in terms of the convergence rate while guaranteeing the high throughput of IA networks.