• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.10
• /
• pp.169-176
• /
• 2003

Genetic algorithm (GA), which has a powerful searching ability and is comparatively easy to use and also to apply, is in the spotlight in the field of the optimization for mechanical systems these days. However, it also contains some problems of slow convergence and low efficiency caused by a huge amount of repetitive computation. To improve the processing efficiency of repetitive computation, some papers have proposed paralleled GA these days. There are some cases that mention the use of gray code or suggest using gray code partially in GA to raise its slow convergence. Gray code is an encoding of numbers so that adjacent numbers have a single digit differing by 1. A binary gray code with n digits corresponds to a hamiltonian path on an n-dimensional hypercube (including direction reversals). The term gray code is open used to refer to a reflected code, or more specifically still, the binary reflected gray code. However, according to proposed reports, gray code GA has lower convergence about 10-20% comparing with binary code GA without presenting any results. This study proposes new Full gray code GA (FGGA) applying a gray code throughout all basic operation fields of GA, which has a good data processing ability to improve the slow convergence of binary code GA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.526-531
• /
• 2009

In this paper, we propose new novel technique (ILCT: Instruction-Level Correlation Technique) which can detect tempered instructions by software attacks or hardware attacks before their execution. In conventional works, due to both high complex computation of cipher process and low processing speed of cipher modules, existing secure processor architecture applying cipher technique can cause serious performance degradation. While, the secure processor architecture applying ILCT with FEC does not incur excessive performance decrease by complexity of computation and speed of tampering detection modules. According to experimental results, total memory overhead including parity are increased in average of 26.62%. Also, secure programs incur CPI degradation in average of $1.20%{\sim}1.97%$.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.11 no.8
• /
• pp.1297-1304
• /
• 2000

The full wave method requires a great number of computer memory and lasting long CPU time for the calculation of the discontinuity problems in microstrip structures. While the computation only for the transverse field components at those structures causes the both of time and memory reduction. For the case of the calculating only transverse components for the most of microstrip structures such as low-pass filter, branch coupler and patch antenna the computer memory and running time can be reduced to about 50% and 33%, comparing to the full wave computation. Consequently, the proposed method than that of TEM-mode has an advantages of higher speed and less memory than that of conventional FDTD analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7B
• /
• pp.886-891
• /
• 2011

Multicast has been a key routing service for efficient data dissemination in underwater acoustic sensor networks. In sensor networks, there are several multicast routing protocol which reflects sensor network nature. However, existing routing scheme was not targeted at underwater acoustic sensor networks which is hard to provide battery continually. Therefore, a specialized routing algorithm is essential for acoustic sensor networks. In this paper, we propose angle aided multicast routing algorithm for decreasing routing computation complexity, including virtual Euclidean Steiner point. Simulation results show better performance than exist routing Position Based Multicast, Geographic Multicast Routing. such as low computation capability and limited power consumption.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.812-817
• /
• 2005

The objective of the present work is to develop a time-domain numerical method of broadband noise in a cascade of airfoils. This paper focuses on dipole broadband noise sources, resulting from the interaction of turbulent inflows with the flat-plate airfoil cascade. The turbulence response of a two-dimensional cascade is studied by solving both of the linearised and full nonlinear Euler equations employing accurate higher order spatial differencing, time stepping techniques and non-reflecting inflow/outflow boundary condition. The time-domain result using the linearised Euler equations shows good agreement with the analytical solution using the modified LINSUB code. Through the comparison of the nonlinear time-domain result using the full nonlinear Euler equations with the linear, it is found that the acoustic mode amplitude of the nonlinear response is less than that of the linear response due to the energy cascade from low frequency components to the high frequency ones. Considering the merits of the time-domain methods over the typical time-linearised frequency-domain analysis, the current method is expected to be promising tools for analyzing the effects of the airfoil shapes, non-uniform background flow, linear-nonliear regimes on the broadband noise due to gust-cascade interaction.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2339-2355
• /
• 2021

In this paper, a joint probabilistic data association algorithm based on loss function (LJPDA) is proposed so that the computation load and accuracy of the multi-target tracking algorithm can be guaranteed simultaneously. Firstly, data association is divided in to three cases based on the relationship among validation gates and the number of measurements in the overlapping area for validation gates. Also the contribution coefficient is employed for evaluating the contribution of a measurement to a target, and the loss function, which reflects the cost of the new proposed data association algorithm, is defined. Moreover, the equation set of optimal contribution coefficient is given by minimizing the loss function, and the optimal contribution coefficient can be attained by using the Newton-Raphson method. In this way, the weighted value of each target can be achieved, and the data association among measurements and tracks can be realized. Finally, we compare performances of LJPDA proposed and joint probabilistic data association (JPDA) algorithm via numerical simulations, and much attention is paid on real-time performance and estimation error. Theoretical analysis and experimental results reveal that the LJPDA algorithm proposed exhibits small estimation error and low computation complexity.

• Journal of Information Processing Systems
• /
• v.19 no.2
• /
• pp.240-257
• /
• 2023

The industrial Internet of Things (IIoT) is characterized by intelligent connection, real-time data processing, collaborative monitoring, and automatic information processing. The heterogeneous IIoT devices require a high data rate, high reliability, high coverage, and low delay, thus posing a significant challenge to information security. High-performance edge and cloud servers are a good backup solution for IIoT devices with limited capabilities. However, privacy leakage and network attack cases may occur in heterogeneous IIoT environments. Cloud-based multi-party computing is a reliable privacy-protecting technology that encourages multiparty participation in joint computing without privacy disclosure. However, the default cloud selection method does not meet the heterogeneous IIoT requirements. The server can be dishonest, significantly increasing the probability of multi-party computation failure or inefficiency. This paper proposes a blockchain and smart contract-based optimized cloud node selection framework. Different participants choose the best server that meets their performance demands, considering the communication delay. Smart contracts provide a progressive request mechanism to increase participation. The simulation results show that our framework improves overall multi-party computing efficiency by up to 44.73%.

• Transactions on Semiconductor Engineering
• /
• v.2 no.1
• /
• pp.1-8
• /
• 2024

When processing depthwise separable convolution, low utilization of processing elements (PEs) is one of the challenges of systolic array (SA). In this study, we propose a new SA architecture to maximize throughput in depthwise convolution. Moreover, the proposed SA performs subsequent pointwise convolution on the idle PEs during depthwise convolution computation to increase the utilization. After the computation, we utilize unused PEs to boost the remaining pointwise convolution. Consequently, the proposed 128x128 SA achieves a 4.05x and 1.75x speed improvement and reduces the energy consumption by 66.7 % and 25.4 %, respectively, compared to the basic SA and RiSA in MobileNetV3.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1254-1264
• /
• 2000

In this paper, we propose a new turbo interleaver and an efficient iteration control method with low complexity for turbo decoding. Turbo codes has better performance as the number of iteration and the interleaver size increases. However, as the interleaver size is increased, it require much delay and computation for decoding. Thus we propose a new efficient turbo magic interleaver using the Magic square matrix. Simulation results show that the proposed interleaver realizes a good performance like GF, Mother interleaver proposed to IMT-2000. And as the decoding approaches the performance limit, any further iteration results in very little improvement. Therefore, we propose an efficient algorithm of decoding that can reduce the delay and computation. Just like the conventional stop criterion, it effectively stop the iteration process with very little performance degradation.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.31 no.3
• /
• pp.141-145
• /
• 2018

The paper presents a new dynamic displacement measurement system. The developed displacement measurement system consists of a sensor module, a base module and a computation module. The sensor module, which contains a force-balanced accelerometer and low-price RTK-GNSS, measures the high-precision acceleration with sampling frequency of 100Hz, the low-precision displacement and velocity with sampling frequency of 10Hz. The measured data is transferred to the computation module through LAN cable, and precise displacement is estimated in real-time with 100Hz sampling frequency through a two stage Kalman filter. The field test was conducted at San Francisco-Oaklmand Bay bridge, CA, USA to verify the precision of the developed system, and it showed the RMSE was 1.68mm.