• Title/Summary/Keyword: Algorithm Development

Search Result 6,987, Processing Time 0.034 seconds

The Development of Algorithm Method for 0-1 Knapsack Problem (0 - 1 배낭문제의 Algorithm 개발에 관한 연구)

  • 신현재
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.7 no.10
    • /
    • pp.29-33
    • /
    • 1984
  • Many methods have been developed to get a good Computation steps. I think that almost methods of them have been solved by using a theory of [Vj]. But I have thought that it Can be solved by an other method. This method is a way to get a Computations steps by using [Aj] instead of [Vj]. It requires less Computation time than [Vj]. So I think that method is an efficient Algorithm about "the Development of Algorithm method for the 0 - 1 Knapsack problem."

  • PDF

Genetic Algorithm Based Linear Region Extension for Multivariable Monopulse Tracking Systems (다변수 모노펄스 추적 시스템에서 유전 알고리즘 기반 선형구간 확장)

  • Jung, Jinwoo;Kim, Jaesin;Ryu, Young-Jae
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.20 no.2
    • /
    • pp.272-278
    • /
    • 2017
  • In this paper, we consider a single-channel amplitude comparison monopulse system(SCACMS). The monopulse ratio curve(MR-C) of the SCACMS can be controlled by an amplitude difference between sum and different signal, a phase difference and the coefficient of the signal processor. We first propose the SCACMS with multiple variables, and then apply a genetic algorithm to optimize the multiple variables in terms of minimizing a root mean square error. The simulation results show that when three variables of the SCACMS are jointly optimized, the linear region of the MR-C can be extended approximately 187 % compared to that of two variables.

Development of character recognition system for the mixed font style in the steel processing material

  • Lee, Jong-Hak;Park, Sang-Gug;Park, Soo-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1431-1434
    • /
    • 2005
  • In the steel production line, the molten metal of a furnace is transformed into billet and then moves to the heating furnace of the hot rolling mill. This paper describes about the development of recognition system for the characters, which was marked at the billet material by use template-marking plate and hand written method, in the steel plant. For the recognition of template-marked characters, we propose PSVM algorithm. And for the recognition of hand written character, we propose combination methods of CCD algorithm and PSVM algorithm. The PSVM algorithm need some more time than the conventional KLT or SVM algorithm. The CCD algorithm makes shorter classification time than the PSVM algorithm and good for the classification of closed curve characters from Arabic numerals. For the confirmation of algorithm, we have compared our algorithm with conventional methods such as KLT classifier and one-to-one SVM. The recognition rate of experimented billet characters shows that the proposing PSVM algorithm is 97 % for the template-marked characters and combinational algorithm of CCD & PSVM is 95.5 % for the hand written characters. The experimental results show that our proposing method has higher recognition rate than that of the conventional methods for the template-marked characters and hand written characters. By using our algorithm, we have installed real time character recognition system at the billet processing line of the steel-iron plant.

  • PDF

Development of an Algorithm for the Prevention and Management of Pressure Ulcers (입원 환자의 욕창예방과 중재를 위한 알고리즘 개발)

  • Kim, Jin-Mi;Park, Jeong-Sook
    • Korean Journal of Adult Nursing
    • /
    • v.22 no.4
    • /
    • pp.353-364
    • /
    • 2010
  • Purpose: The purpose of this study was to develop an algorithm for preventing and managing of pressure ulcer and to verify the its appropriateness. Methods: The first step was development of a pre-algorithm through a literature review and expert opinion. The second step was to establish content validity by submitting the algorithm questionnaires about the content to 12 experts. The third step was the revision of the algorithm. The fourth and last step was to establish the clinical validity of the algorithm with 25 experienced nurses. Results: For the ease of the practitioner the algorithm for prevention and the management of pressure ulcers was confined to one page depicting the main algorithm pathway and seven stepwise guidelines. The guidelines included skin care of pressure ulcer prevention, mechanical loading care, support surface care, reposition care of pressure ulcer, and Stages II, III and IV explanations along with debridement/wound irrigation and infection control. Most of all algorithm courses chosen more than 80% of agreement by expert index of content validity. The usefulness, appropriateness, and convenience of the algorithm were demonstrated through clinical validity with intensive care unit and ward nurses. Conclusion: The algorithm will improve the quality of pressure ulcer nursing care as it provides a model for decision making for clinical nurses as well as providing consistent and integrated nursing care for patients with pressure ulcer throughout an institution.

Design of Fuzzy IMM Algorithm based on Basis Sub-models and Time-varying Mode Transition Probabilities

  • Kim Hyun-Sik;Chun Seung-Yong
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.5
    • /
    • pp.559-566
    • /
    • 2006
  • In the real system application, the interacting multiple model (IMM) based algorithm requires less computing resources as well as a good performance with respect to the various target maneuverings. And it further requires an easy design procedure in terms of its structures and parameters. To solve these problems, a fuzzy interacting multiple model (FIMM) algorithm, which is based on the basis sub-models defined by considering the maneuvering property and the time-varying mode transition probabilities designed by using the mode probabilities as inputs of a fuzzy decision maker, is proposed. To verify the performance of the proposed algorithm, airborne target tracking is performed. Simulation results show that the FIMM algorithm solves all problems in the real system application of the IMM based algorithm.

Adaptive Bandwidth Algorithm for Optimal Signal Tracking of DGPS Reference Receivers

  • Park, Sang-Hyun;Cho, Deuk-Jae;Seo, Ki-Yeol;Suh, Sang-Hyun
    • Journal of Navigation and Port Research
    • /
    • v.31 no.9
    • /
    • pp.763-769
    • /
    • 2007
  • A narrow loop noise bandwidth method is desirable to reduce the error of raw measurements due to the thermal noise. However, it degrades the performance of GPS initial synchronization such as mean acquisition time. And it restricts the loop noise bandwidth to a fixed value determined by the lower bound of the allowable range of carrier-to-noise power ratio, so that it is difficult to optimally track GPS signal. In order to make up for the weak points of the fixed-type narrow loop noise bandwidth method and simultaneously minimize the error of code and carrier measurements, this paper proposes a stepwise-type adaptive bandwidth algorithm for DGPS reference receivers. In this paper, it is shown that the proposed adaptive bandwidth algorithm can provide more accurate measurements than those of the fixed-type narrow loop noise bandwidth method, in view of analyzing the simulation results between two signal tracking algorithms. This paper also carries out sensitivity analysis of the proposed adaptive bandwidth algorithm due to the estimation uncertainty of carrier-to-noise power ratio. Finally the analysis results are verified by the experiment using GPS simulator.

An Effective Threat Evaluation Algorithm for Multiple Ground Targets in Multi-target and Multi-weapon Environments

  • Yoon, Moonhyung;Park, Junho;Yi, Jeonghoon
    • International Journal of Contents
    • /
    • v.15 no.1
    • /
    • pp.32-38
    • /
    • 2019
  • In an environment where a large number of weapons are operated compared to a large number of ground targets, it is important to monitor and manage the targets to set up a fire plan, and through their multilateral analysis, to equip them with a priority order process for targets having a high threat level through the quantitative calculation of the threat level. Existing studies consider the anti-aircraft and anti-ship targets only, hence, it is impossible to apply the existing algorithm to ground weapon system development. Therefore, we proposed an effective threat evaluation algorithm for multiple ground targets in multi-target and multi-weapon environments. Our algorithm optimizes to multiple ground targets by use of unique ground target features such as proximity degree, sorts of weapons and protected assets, target types, relative importance of the weapons and protected assets, etc. Therefore, it is possible to maximize an engagement effect by deducing an effective threat evaluation model by considering the characteristics of ground targets comprehensively. We carried out performance evaluation and verification through simulations and visualizations, and confirmed high utility and effect of our algorithm.

Hybrid genetic-paired-permutation algorithm for improved VLSI placement

  • Ignatyev, Vladimir V.;Kovalev, Andrey V.;Spiridonov, Oleg B.;Kureychik, Viktor M.;Ignatyeva, Alexandra S.;Safronenkova, Irina B.
    • ETRI Journal
    • /
    • v.43 no.2
    • /
    • pp.260-271
    • /
    • 2021
  • This paper addresses Very large-scale integration (VLSI) placement optimization, which is important because of the rapid development of VLSI design technologies. The goal of this study is to develop a hybrid algorithm for VLSI placement. The proposed algorithm includes a sequential combination of a genetic algorithm and an evolutionary algorithm. It is commonly known that local search algorithms, such as random forest, hill climbing, and variable neighborhoods, can be effectively applied to NP-hard problem-solving. They provide improved solutions, which are obtained after a global search. The scientific novelty of this research is based on the development of systems, principles, and methods for creating a hybrid (combined) placement algorithm. The principal difference in the proposed algorithm is that it obtains a set of alternative solutions in parallel and then selects the best one. Nonstandard genetic operators, based on problem knowledge, are used in the proposed algorithm. An investigational study shows an objective-function improvement of 13%. The time complexity of the hybrid placement algorithm is O(N2).

Design of an Initial Fine Alignment Algorithm for Satellite Launch Vehicles

  • Song, Eun-Jung;Roh, Woong-Rae;Kim, Jeong-Yong;Oh, Jun-Seok;Park, Jung-Ju;Cho, Gwang-Rae
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.11 no.3
    • /
    • pp.184-192
    • /
    • 2010
  • In this paper, an initial fine alignment algorithm, which is developed for the strap-down inertial navigation systems of satellite launch vehicles, is considered. For fast and accurate alignment, a simple closed-loop estimation algorithm using a proportional-integral controller is introduced. Through computer simulation for the sway condition in the launch pad, it is shown that a simple filter structure can guarantee fast computational speed that is adequate for real-time implementation as well as the required alignment accuracy and robustness. In addition, its implementation results are presented for the Naro-1 flight test.