• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2369-2373
• /
• 2001

Usually the static scheduling algorithms such as DMS (Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm haying a solution to the priority inversion. In the proposed algorithm, the available bandwidth of network media can be checked dynamically by all nodes. Through the algorithm, arbitration delay causing the miss of their deadline can be avoided in advance. Also non real-time messages can be processed with their bandwidth allocation. The proposed algorithm can achieve full network utilization and enhance aperiodic responsiveness, still guaranteeing the transmission of periodic messages.

• Journal of Korean Port Research
• /
• v.14 no.2
• /
• pp.187-197
• /
• 2000

In this paper, an adaptive mechanism based on immune algorithm is designed and it is applied to the driving control of the autonomous guided vehicle(AGV). When the immune algorithm is applied to the PID controller, there exists the case that the plant is damaged by the abrupt change of PID parameters since the parameters are adjusted almost randomly. To solve this problem, a neural network used to model the plant and the parameter tuning of the model is performed by the immune algorithm. After the PID parameters are determined through this off-line manner, these parameters are then applied to the plant for the on-line control using immune adaptive algorithm. Moreover, even though the neural network model may not be accurate enough initially, the weighting parameters are adjusted more accurately through the on-line fine tuning. The experiment for the control of steering and speed of AGV is performed. The results show that the proposed controller provides better performances than other conventional controllers.

• Proceedings of the KIEE Conference
• /
• 2009.04b
• /
• pp.6-8
• /
• 2009

This paper presents the novel implementation of memetic algorithm with GA (Genetic Algorithm) and MADS (Mesh Adaptive Direct Search), which is applied for optimal design methodology of electric machine. This hybrid algorithm has been developed for obtaining the global optimum rapidly, which is effective for optimal design of electric machine with many local optima and much longer computation time. In particular, the proposed memetic algorithm has been forwarded to optimal design of direct-driven PM wind generator for maximizing the Annual Energy Production (AEP), of which design objective should be obtained by FEA (Finite Element Analysis). After all, it is shown that GA combined with MADS has contributed to reducing the computation time effectively for optimal design of PM wind generator when compared with purposely developed GA implemented with the parallel computing method.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.157-162
• /
• 2002

In this study, the secure Internet phone system using digital signature and data encryption with DES algorithm and EDE algorithm was implemented. And new key distribution algorithm was suggested utilizing the Diffie-bellman algorithm. For reducing processing time, a table combined with S-BOX and P-BOX of the DES was used. The proposed system was implemented with Java and the results showed the processing time using DES algorithm for encryption was 1.46 seconds and that of EDE algorithm was 3.25 seconds respectively. This system can be applied to Protect the copyright of sound products and data using internet.

• Journal of Information Processing Systems
• /
• v.16 no.4
• /
• pp.832-844
• /
• 2020

The degree of dispersion of a random variable can be described by the variance, which reflects the distance of the random variable from its mean. However, the time complexity of the traditional variance calculation algorithm is O(n), which results from full calculation of all samples. When the number of samples increases or on the occasion of high speed signal processing, algorithms with O(n) time complexity will cost huge amount of time and that may results in performance degradation of the whole system. A novel multi-step recursive algorithm for variance calculation of the time-varying data series with O(1) time complexity (constant time) is proposed in this paper. Numerical simulation and experiments of the algorithm is presented and the results demonstrate that the proposed multi-step recursive algorithm can effectively decrease computing time and hence significantly improve the variance calculation efficiency for time-varying data, which demonstrates the potential value for time-consumption data analysis or high speed signal processing.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.12
• /
• pp.43-48
• /
• 2018

In this paper, more efficient classification result could be obtained by applying the combination of the Hidden Markov Model and SVM Model to HMSV algorithm gene expression data which simulated the stochastic flow of gene data and clustering it. In this paper, we verified the HMSV algorithm that combines independently learned algorithms. To prove that this paper is superior to other papers, we tested the sensitivity and specificity of the most commonly used classification criteria. As a result, the K-means is 71% and the SOM is 68%. The proposed HMSV algorithm is 85%. These results are stable and high. It can be seen that this is better classified than using a general classification algorithm. The algorithm proposed in this paper is a stochastic modeling of the generation process of the characteristics included in the signal, and a good recognition rate can be obtained with a small amount of calculation, so it will be useful to study the relationship with diseases by showing fast and effective performance improvement with an algorithm that clusters nodes by simulating the stochastic flow of Gene Data through data mining of BigData.

• Journal of the Korean Society of Systems Engineering
• /
• v.14 no.2
• /
• pp.41-48
• /
• 2018

This paper describes the systems engineering development process for the Departure from Nucleate Boiling Ratio (DNBR) algorithm using FPGA. Current Core Protection Calculator System (CPCS) requirement and DNBR logic are analyzed in the reverse engineering phase and the new FPGA based DNBR algorithm is designed in the re-engineering phase. FPGA based DNBR algorithm is developed by VHSIC Hardware Description Language (VHDL) in the implementation phase and VHDL DNBR software is verified in the software Verification & Validation phase. Test cases are developed to perform the software module test for VHDL software modules. The APR 1400 simulator is used to collect the inputs data in 100%, 75%, and 50% reactor power condition. Test input signals are injected to the software modules following test case tables and output signals are compared with the expected test value. Minimum DNBR value from developed DNBR algorithm is validated by KEPCO E&C CPCS development facility. This paper summarizes the process to develop the FPGA-based DNBR calculation algorithm using systems engineering approach.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.5
• /
• pp.833-840
• /
• 2022

The precision of automation equipment and motors in factories is required, and global motor market has increased significantly. However, domestic motor technology lags behind foreign technology. In this thesis, the precision stability and efficiency were compared with a linear algorithm by applying a non-linear algorithm to a PLC servo motor and an Arduino step motor in order to improve the technology of the motor. The nonlinear algorithm was able to shorten the same driving reference time because the maximum speed of the motor was faster than the linear algorithm, and it was confirmed that the precision was improved due to the low curvature.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.2 no.1
• /
• pp.04-06
• /
• 1984

Representation of three dimensional objects on a CRT screen is usually done by means of a perspective view, hidden line removal enhances three dimensional effect and an algorithm based on existing methods is studied.Actual implementation was carried out on No.A 840 with Tektronix 4010 graphic display.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1997.11a
• /
• pp.274-288
• /
• 1997

본 논문에서는 무선 근거리 통신망의 프로토콜 구조를 분석한 후, 이를 바탕으로 무선 근거리 통신망에 적용 가능한 정보보호 규격을 제시하고, 관련 정보보호 메카니듬을 도출하며, 적용된 정보보호 메카니듬들을 C 언어로 시뮬레이션한다.