• Coupled systems mechanics
• /
• v.13 no.1
• /
• pp.1-19
• /
• 2024

The effectiveness of coupling with a bolted rim is assessed in this research using a newly designed optimization algorithm. The current study, which is provided here, evaluates 10 contemporary metaheuristic approaches for enhancing the coupling with bolted rim design problem. The algorithms used are particle swarm optimization (PSO), crow search algorithm (CSA), enhanced honeybee mating optimization (EHBMO), Harmony search algorithm (HSA), Krill heard algorithm (KHA), Pattern search algorithm (PSA), Charged system search algorithm (CSSA), Salp swarm algorithm (SSA), Big bang big crunch optimization (B-BBBCO), Gradient based Algorithm (GBA). The contribution of the paper isto optimize the coupling with bolted rim problem by comparing these 10 algorithms and to find which algorithm gives the best optimized result. These algorithm's performance is evaluated statistically and subjectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1412-1430
• /
• 2024

The soft cancellation list (SCANL) decoding algorithm for polar codes runs L soft cancellation (SCAN) decoders with different decoding factor graphs. Although it can achieve better decoding performance than SCAN algorithm, it has high latency. In this paper, a fast simplified SCANL (Fast-SSCANL) algorithm that runs L independent Fast-SSCAN decoders is proposed. In Fast-SSCANL decoder, special nodes in each factor graph is identified, and corresponding low-latency decoding approaches for each special node is propose first. Then, syndrome check aided Fast-SSCANL (SC-Fast-SSCANL) algorithm is further put forward. The ordinary nodes satisfied the syndrome check will execute hard decision directly without traversing the factor graph, thereby reducing the decoding latency further. Simulation results show that Fast-SSCANL and SC-Fast-SSCANL algorithms can achieve the same BER performance as the SCANL algorithm with lower latency. Fast-SSCANL algorithm can reduce latency by more than 83% compared with SCANL, and SC-Fast-SSCANL algorithm can reduce more than 85% latency compared with SCANL regardless of code length and code rate.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.18 no.3
• /
• pp.284-292
• /
• 2008

The active control technique mostly uses the least-mean-square(LMS) algorithm, because the LMS algorithm can easily obtain the complex transfer function in real-time, particularly when the Filtered-X LMS(FXLMS) algorithm is applied to an active noise control(ANC) system. However, FXLMS algorithm has the demerit that stability of the control is decreased when the step size become larger but the convergence speed is faster because the step size of FXLMS algorithm is fixed. As a result, the system has higher probability which the divergence occurs. Thus the Co-FXLMS algorithm was developed to solve this problem. The Co-FXLMS algorithm is realized by using an estimate of the cross correlation between the adaptation error and the filtered input signal to control the step size. In this paper, the performance of the Co-FXLMS algorithm is presented in comparison with the FXLMS algorithm. Simulation and experimental results show that active noise control using Co-FXLMS is effective in reducing the noise in duct system.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.05a
• /
• pp.598-603
• /
• 2007

The active control technique mostly uses the Least-Mean-Square (LMS) algorithm, because the LMS algorithm can easily obtain the complex transfer function in real-time, particularly when the Filtered-X LMS (FXLMS) algorithm is applied to an active noise control (ANC) system. However, FXLMS algorithm has the demerit that stability of the control is decreased when the step size become larger but the convergence speed is faster because the step size of FXLMS algorithm is fixed. As a result, the system has higher probability which the divergence occurs. Thus the Co-FXLMS algorithm was developed to solve this problem. The Co-FXLMS algorithm is realized by using an estimate of the cross correlation between the adaptation error and the filtered input signal to control the step size. In this paper, the performance of the Co-FXLMS algorithm is presented in comparison with the FXLMS algorithm. Simulation results show that active noise control using Co-FXLMS is effective in reducing the noise in duct system.

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.8
• /
• pp.843-850
• /
• 2011

In this paper, an effective path generation algorithm for obstacle avoidance producing small amount of steering action as possible is proposed. The proposed path generation algorithm can reduce unnecessary steering because of the small lateral changes in generated waypoints when UGV (Unmanned Ground Vehicle) encounters obstacles during its waypoint navigation. To verify this, the proposed algorithm and $A^*$ algorithm are analyzed through the simulation. The proposed algorithm shows good performance in terms of lateral changes in the generated waypoint, steering changes of the vehicle while driving and execution speed of the algorithm. Especially, due to the fast execution speed of the algorithm, the obstacles that encounter suddenly in front of the vehicle within short range can be avoided. This algorithm consider the waypoint navigation only. Therefore, in certain situations, the algorithm may generate the wrong path. In this case, a general path generation algorithm like $A^*$ is used instead. However, these special cases happen very rare during the vehicle waypoint navigation, so the proposed algorithm can be applied to most of the waypoint navigation for the unmanned ground vehicle.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.12 no.6
• /
• pp.478-487
• /
• 2002

This paper presents a hybrid method to compute the solutions of an optimization Problem. The present hybrid algorithm is the synthesis of an artificial life algorithm and the random tabu search method. The artificial life algorithm has the most important feature called emergence. The emergence is the result of dynamic interaction among the individuals consisting of the system and is not found in an individual. The conventional artificial life algorithm for optimization is a stochastic searching algorithm using the feature of artificial life. Emergent colonies appear at the optimum locations in an artificial ecology. And the locations are the optimum solutions. We combined the feature of random-tabu search method with the conventional algorithm. The feature of random-tabu search method is to divide any given region into sub-regions. The enhanced artificial life algorithm (EALA) not only converge faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. The enhanced artificial life algorithm is applied to the optimum design of high-speed, short journal bearings and its usefulness is verified through an optimization problem.

• Journal of Korean Academy of Fundamentals of Nursing
• /
• v.24 no.1
• /
• pp.18-29
• /
• 2017

Purpose: The purpose of this study was to develop an algorithm for nursing care after percutaneous coronary intervention in order to improve patients' safety and prevent complications, because percutaneous coronary intervention is becoming a common treatment for coronary artery diseases. Methods: By reviewing related literatures and interviewing nurses, items and paths that were to be used in the algorithm for nursing care after percutaneous coronary intervention were drawn up and a draft algorithm was developed. The final algorithm was determined based on the results of the evaluation performed after clinical application. Results: According to the outcome after allowing nurses to apply the revised algorithm with 11 patients, suitability on items composing the algorithm were highly rated whereas promptness was lowly rated. Although the patients (n=11) to whom the algorithm was applied complained of less back pain (p=.001) and discomfort (p=.026) compared to the patients (n=17) to whom the algorithm was not applied, no significant difference in bleeding complication was found. Conclusion: The findings in the study support the clinical utilization of the algorithm for nursing care after percutaneous coronary intervention as the use of this algorithm reduced back pain and discomfort without increasing bleeding complications at the femoral puncture site.

• 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.

• Journal of Korean Society of Transportation
• /
• v.20 no.6
• /
• pp.99-113
• /
• 2002

The multi-class traffic assignment problem is the most typical one of the multi-solution traffic assignment problems and, recently formulation of the models and the solution algorithm have been received a great deal of attention. The useful solution algorithm, however, has not been proposed while formulation of the multi-class traffic assignment could be performed by adopting the variational inequality problem or the fixed point problem. In this research, we developed a hybrid solution algorithm which combines GA algorithm, diagonal algorithm and clustering algorithm for the multi-class traffic assignment formulated as a variational inequality Problem. GA algorithm and clustering algorithm are introduced for the wide area and small cost. We also performed an experiment with toy network(2 link) and tested the characteristics of the suggested algorithm.