• Smart Structures and Systems
• /
• v.26 no.3
• /
• pp.345-360
• /
• 2020

Modern swarm intelligence heuristic search methods are widely applied in the field of structural health monitoring due to their advantages of excellent global search capacity, loose requirement of initial guess and ease of computational implementation etc. To this end, a hybrid strategy is proposed based on butterfly optimization algorithm (BOA) and differential evolution (DE) with purpose of effective combination of their merits. In the proposed identification strategy, two improvements including mutation and crossover operations of DE, and dynamic adaptive operators are introduced into original BOA to reduce the risk to be trapped in local optimum and increase global search capability. The performance of the proposed algorithm, hybrid butterfly optimization and differential evolution algorithm (HBODEA) is evaluated by two numerical examples of a simply supported beam and a 37-bar truss structure, as well as an experimental test of 8-story shear-type steel frame structure in the laboratory. Compared with BOA and DE, the numerical and experimental results show that the proposed HBODEA is more robust to detect the reduction of stiffness with limited sensors and contaminated measurements. In addition, the effect of search space, two dynamic operators, population size on identification accuracy and efficiency of the proposed identification strategy are further investigated.

• International Journal of Advanced Culture Technology
• /
• v.7 no.4
• /
• pp.313-320
• /
• 2019

Nowadays, as the availability of tiny, low-cost microcomputer increases at a high level, mobile robots are experiencing remarkable enhancements in hardware design, software performance, and connectivity advancements. In order to control Turtlebot 2, several algorithms have been developed using the Robot Operating System(ROS). However, ROS requires to be run on a high-cost computer which increases the hardware cost and the power consumption to the robot. Therefore, design an algorithm based on low-cost hardware is the most innovative way to reduce the unnecessary costs of the hardware, to increase the performance, and to decrease the power consumed by the computer on the robot. In this paper, we present a path-finding algorithm for TurtleBot 2 based on low-cost hardware. We implemented the algorithm using Raspberry pi, Windows 10 IoT core, and RPLIDAR A2. Firstly, we used Raspberry pi as the alternative to the computer employed to handle ROS and to control the robot. Raspberry pi has the advantages of reducing the hardware cost and the energy consumed by the computer on the robot. Secondly, using RPLIDAR A2 and Windows 10 IoT core which is running on Raspberry pi, we implemented the path-finding algorithm which allows TurtleBot 2 to navigate from the starting point to the destination using the map of the area. In addition, we used C# and Universal Windows Platform to implement the proposed algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.10
• /
• pp.1849-1854
• /
• 2009

This paper describes the design, evaluation and implementation of a compensating algorithm for an iron-cored measurement current transformer (CT) that removes the effects of the hysteresis characteristics of the iron-core. The exciting current resulting from the hysteresis characteristics of the core causes an error of the CT. The proposed algorithm decomposes the exciting current into the core loss current and the magnetizing current and each of them is estimated. The core loss current is calculated from the secondary voltage and the voltage-core loss current curve. The core flux linkage is calculated and then inserted into the flux-magnetizing current curve to estimate the magnetizing current. The exciting current at every sampling interval is obtained by summing the core loss and magnetizing currents and then added to the measured current to obtain the correct secondary current. The voltage-core loss current curve and flux-magnetizing current curves, which are different from the conventional curves, are derived in this paper. The performance of the proposed algorithm is validated under various conditions using EMTP generated data. The experimental test results of an iron-core type electronic CT, which consists of the iron-core and the compensation board, are also included. The results indicate that the proposed algorithm can improve the accuracy of the measurement CT significantly, and thus reduce the size and the cost of the CT.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9A
• /
• pp.852-858
• /
• 2010

In this paper, the compensation algorithm for radiodetermination error using a concept of determination coordinator value of equivalent distance rate (CADE) is proposed, and the performance of the proposed algorithm is analyzed. As a result of the experiments, CADE improves the performance of the algorithm accuracy about 37.5% and 69.8% each in the inside and outside of 4 beacon nodes. Furthermore, the CADE is 76.3% excellent enough to compensate 2m or more of the radiodetermination error. It also confirms that CADE can be adapted to the wide range by installing only 4 beacon nodes according to the excellence of compensation performance besides the ranges of 4 beacon nodes. From the results, it is strongly considered that the proposed algorithm CADE can be used to the performance enhancement of radiodetermination systems using SDS-TWR.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.2
• /
• pp.83-92
• /
• 2013

RSA-CRT is a widely used algorithm that provides high performance implementation of the RSA-signature algorithm. Many previous studies on each operation step have been published to verify the physical leakages of RSA-CRT when used in smart devices. This paper proposes SAED (subtraction algorithm analysis on equidistant data), which extracts sensitive information using the event information of the subtraction operation in a reduction algorithm. SAED is an attack method that uses algorithm-dependent power signal changes. An adversary can extract a key using differential power analysis (DPA) of the subtraction operation. This paper indicates the theoretical rationality of SAED, and shows that its results are better than those of other methods. According to our experiments, only 256 power traces are sufficient to acquire one block of data. We verify that this method is more efficient than those proposed in previously published studies.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.57-67
• /
• 2013

Because many of the FOB key, anti-collision algorithm for a seamless multi-access is applied to the smart-key system. In this paper, we have designed and implemented improved anti-collision algorithm that dramatically reduces the communication response time required in the user authentication process immediately after by dynamically changing the order in which the request of the user ID as the user ID on immediately before in the smart key system for vehicles that use many of the FOB key. In order to evaluate the performance of the system the improved anti-collision algorithm is applied, we show the behavior of the algorithm implemented in the state actually mounted on the vehicle and verify that communication response time required for many of the FOB key was reduced by about 33% compared to existing algorithms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.5
• /
• pp.75-85
• /
• 2002

In using elliptic curves in cryptography, it is important to find a secure elliptic curve. The security of elliptic curve cryptosystem is dependent on the cardinality of the given curve. So, it is necessary to count the number of points of a given elliptic curve to obtain secure curve. It is hewn that when the charateristic is two, the most efficient algorithm finding secure curves is combining the Satoh-FGH algorithm with early-abort strategy$^[1]$. In［1］, the authors wrote that they modified SEA algorithm used in early-abort strategy, but they didn't describe the varaint of SEA algorithm. In this paper, we present some modifications of SEA algorithm and show the result of our implementation.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.5
• /
• pp.299-307
• /
• 2022

Harmony Search (HS) is a relatively recently developed meta-heuristic optimization algorithm, and various studies have been conducted on it. HS is based on the musician's improvisational performance, and the objective variables play the role of the instrument. However, each instrument is given only a sound range, and there is no concept of a scale that can be said to be the basis of music. In this study, the performance of the algorithm is improved by introducing a scale to the existing HS and quantizing the bandwidth. The introduced scale was applied to HM initialization instead of the existing method that was randomly initialized in the sound band. The quantization step can be set arbitrarily, and through this, a relatively large bandwidth is used at the beginning of the algorithm to improve the exploration of the algorithm, and a small bandwidth is used to improve the exploitation in the second half. Through the introduction of scale and bandwidth quantization, it was possible to reduce the algorithm performance deviation due to the initial value and improve the algorithm convergence speed and success rate compared to the existing HS. The results of this study were confirmed by comparing examples of optimization values for various functions with the conventional method. Specific comparative values were described in the simulation.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.3
• /
• pp.339-349
• /
• 2017

This paper proposes a four-stage algorithm for detecting lanes on a driving car. In the first stage, it extracts region of interests in an image. In the second stage, it employs a median filter to remove noise. In the third stage, a binary algorithm is used to classify two classes of backgrond and foreground of an input image. Finally, an image erosion algorithm is utilized to obtain clear lanes by removing noises and edges remained after the binary process. However, the proposed lane detection algorithm requires high computational time. To address this issue, this paper presents a parallel implementation of a real-time line detection algorithm on a multi-core architecture. In addition, we implement and simulate 8 different processing element (PE) architectures to select an optimal PE architecture for the target application. Experimental results indicate that 40×40 PE architecture show the best performance, energy efficiency and area efficiency.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.49-60
• /
• 2023

The amount of data generated by electronic systems through e-commerce, social networks, and data computation has risen. However, the security of data has always been a challenge. The problem is not with the quantity of data but how to secure the data by ensuring its confidentiality and privacy. Though there are several research on cloud data security, this study proposes a security scheme with the lowest execution time. The approach employs a non-linear time complexity to achieve data confidentiality and privacy. A symmetric algorithm dubbed the Non-Deterministic Cryptographic Scheme (NCS) is proposed to address the increased execution time of existing cryptographic schemes. NCS has linear time complexity with a low and unpredicted trend of execution times. It achieves confidentiality and privacy of data on the cloud by converting the plaintext into Ciphertext with a small number of iterations thereby decreasing the execution time but with high security. The algorithm is based on Good Prime Numbers, Linear Congruential Generator (LGC), Sliding Window Algorithm (SWA), and XOR gate. For the implementation in C, thirty different execution times were performed and their average was taken. A comparative analysis of the NCS was performed against AES, DES, and RSA algorithms based on key sizes of 128kb, 256kb, and 512kb using the dataset from Kaggle. The results showed the proposed NCS execution times were lower in comparison to AES, which had better execution time than DES with RSA having the longest. Contrary, to existing knowledge that execution time is relative to data size, the results obtained from the experiment indicated otherwise for the proposed NCS algorithm. With data sizes of 128kb, 256kb, and 512kb, the execution times in milliseconds were 38, 711, and 378 respectively. This validates the NCS as a Non-Deterministic Cryptographic Algorithm. The study findings hence are in support of the argument that data size does not determine the execution.