• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.3
• /
• pp.151-156
• /
• 2019

According to recent advances in technology, major robot technologies that have been developed and commercialized for industrial use are being applied to various fields in our everyday life such as guide robots and cleaning robots. Among them, the navigation based on the self localization has become an essential element technology of the robot. In the case of indoor environment, many high-priced sensors are used, which makes it difficult to activate the robot industry. In this paper, we propose a robotic platform and a moving algorithm that can travel by using Dijkstra algorithm. The proposed system can find a short route to the destination with its own position. Also, its performance is discussed through the experimentation of an actual robot.

• Journal of Power Electronics
• /
• v.19 no.3
• /
• pp.815-826
• /
• 2019

This paper discusses a simple control approach for a Unified Power Conditioner (UPC) system to achieve power quality compensation at the point of common coupling in distribution systems. The proposed Instantaneous Power Estimation Algorithm (IPEA) for shunt and series active power filters uses a simple mathematical concept that reduces the complexity in the design of the controller. The performance of a UPC is verified with a system subjected to voltage distortions, sags/swells and unbalanced loads using MATLAB/SIMULINK. The simulation study shows that a UPC with the proposed control algorithm can effectively compensate for voltage and current harmonics, unbalance and reactive power. The control algorithm is experimentally implemented using dSPACE DS1104 and its effectiveness has been verified.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.515-524
• /
• 2012

Fault attacks are a powerful side channel analysis extracting secret information by analyzing the result after injecting faults physically during the implementation of a cryptographic algorithm. First, this paper analyses vulnerable points of existing Digital Signature Algorithm (DSA) schemes secure against fault attacks. Then we propose a new signature algorithm immune to all fault attacks. The proposed DSA scheme is designed to signature by using two nonce and an error diffusion method.

• International Journal of Computer Science & Network Security
• /
• v.21 no.2
• /
• pp.88-92
• /
• 2021

A method and a mathematical algorithm for finding a quasi-optimal assignment plan with rectangular efficiency matrices are proposed. The developed algorithm can significantly reduce the time and computer memory consumption for its implementation in comparison with optimal methods.

• Earthquakes and Structures
• /
• v.22 no.2
• /
• pp.147-155
• /
• 2022

Regarding the importance of seismic pounding, the available standards and guidelines specify minimum separation distance between adjacent buildings. However, the rules in this field are generally based on some simple assumptions, and the level of confidence is uncertain. This is attributed to the fact that the relative response of adjacent structures is strongly dependent on the frequency content of the applied records and the Eigen frequencies of the adjacent structures as well. Therefore, this research aims at investigating the separation distance of the buildings through a probabilistic-based algorithm. In order to empower the algorithm, the record-to-record uncertainties, are considered by probabilistic approaches; besides, a wide extent of material nonlinear behaviors can be introduced into the structural model by the implementation of the hysteresis Bouc-Wen model. The algorithm is then simplified by the application of the linearization concept and using the response acceleration spectrum. By implementing the proposed algorithm, the separation distance in a specific probability level can be evaluated without the essential need of performing time-consuming dynamic analyses. Accuracy of the proposed method is evaluated using nonlinear dynamic analyses of adjacent structures.

• Journal of Platform Technology
• /
• v.11 no.2
• /
• pp.3-14
• /
• 2023

This paper proposes a big data sentiment analysis method and deep learning implementation method to provide a webtoon comment analysis web page for convenient comment confirmation and feedback of webtoon writers for the development of the cartoon industry in the video animation field. In order to solve the difficulty of automatic analysis due to the nature of Internet comments and provide various sentiment analysis information, LSTM(Long Short-Term Memory) algorithm, ranking algorithm, and word2vec algorithm are applied in parallel, and actual popular works are used to verify the validity. If the analysis method of this paper is used, it is easy to expand to other domestic and overseas platforms, and it is expected that it can be used in various video animation content fields, not limited to the webtoon field

• Journal of the Korea Institute of Building Construction
• /
• v.23 no.4
• /
• pp.485-496
• /
• 2023

Precise construction cost estimation is paramount to determining the total construction expense of a project prior to the initiation of the construction phase. Despite this, manual quantification and cost estimation methods, which continue to be widely used, may result in imprecise estimation and subsequent financial loss. Given the fast-paced and efficiency-demanding nature of the construction industry, trustworthy quantity and cost estimation is essential. To mitigate these obstacles, this research is focused on establishing an automated quantity estimation algorithm, particularly designed for the main rebar of beams which are recognized for their complicated reinforcement configurations. The exact quantity derived from the proposed algorithm is compared to the manually approximated quantity, reflecting a variance of 10.27%. As a result, significant errors and impending financial loss can be averted. The implementation of the findings from this research holds the potential to significantly assist construction firms in quickly and accurately estimating rebar quantities while adhering strictly to applicable specifications and regulatory requirements.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.637-639
• /
• 2021

As autonomous driving research is actively progressing, lane detection is an essential technology in ADAS (Advanced Driver Assistance System) to locate a vehicle and maintain a route. Lane detection is detected using an image processing algorithm such as Hough transform and RANSAC (Random Sample Consensus). This paper implements a linear shape detection algorithm using OpenCV on Raspberry Pi 3 B+. Thresholds were set through OpenCV Gaussian blur structure and Canny edge detection, and lane recognition was successful through linear detection algorithm.

• Journal of the Semiconductor & Display Technology
• /
• v.22 no.4
• /
• pp.59-65
• /
• 2023

Edge detection in image processing and computer vision is one of the most fundamental operations. Canny edge detection algorithm has excellent performance and is currently widely used. However, it is difficult to process the algorithm in real-time because the algorithm is complex. In this study, the equations required in the algorithm were simplified to facilitate hardware implementation, and the calculation speed was increased by using a parallel structure. In particular, the size and management of local buffers were selected in consideration of parallel processing and filter size so that data could be processed without bottlenecks. It was designed in verilog and implemented in FPGA to verify operation and performance.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.4
• /
• pp.81-86
• /
• 2003

Current growth of VLSI design depends critically on the research and development of automatic layout tool. Automatic layout is composed of placement assigning a specific shape to a block and arranging the block on the layout surface and routing finding the interconnection of all the nets. Algorithms performing placement and routing impact on performance and area of VLSI design. Switchbox routing is a problem interconnecting each terminals on all four sides of the region, unlike channel routing. In this paper we propose a genetic algorithm searching solution space for switchbox routing problem. We compare the performance of proposed genetic algorithm(GA) for switchbox routing with that of other switchbox routing algorithm by analyzing the results of each implementation. Consequently experimental results show that out proposed algorithm reduce routing length and number of the via over the other switchbox routing algorithms.