• The Transactions of the Korean Institute of Power Electronics
• /
• v.12 no.3
• /
• pp.221-233
• /
• 2007

In this paper, a simple but effective position profile generation algorithm for single axis high dynamic linear machine drive system is presented. In the recent industrial application fields like as LCD/PDP and semiconductor factory, requirements for the high performance positioning system with optimal position profile generator are highly increased to reduce the overall processing time. There might be various solutions for position profile generating algorithm according to the application type. A square-wave Impact quantity(Jerk) based algorithm with minimal locomotion time is argued in this paper to minimize the total time of one movement under some specific constrains such as maximum speed limit and maximum acceleration limit. In order to reduce the calculation efforts and satisfy the minimal locomotion time condition, the time variants representing each profile sector and a simple condition comparison algorithm are adopted. Also, the actual implementation method for profile generation algorithm and it's real performance results are presented through commercial linear machine drive system.

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

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.2
• /
• pp.190-198
• /
• 2002

In general, we have used the Viterbi algorithm of Speech recognition for decoding. But a decoder in speaker verification has to recognize same word of every speaker differently. In this paper, we propose a noble decoding algorithm that could replace the typical Viterbi algorithm for the speaker verification system. We utilize for the proposed algorithm the speaker adaptation algorithms that transform feature vectors into the region of the client' characteristics in the speech recognition. There are many adaptation algorithms, but we take MLLR (Maximum Likelihood Linear Regression) and MAP (Maximum A-Posterior) adaptation algorithms for proposed algorithm. We could achieve improvement of performance about 30% of EER (Equal Error Rate) using proposed algorithm instead of the typical Viterbi algorithm.

• Structural Engineering and Mechanics
• /
• v.33 no.1
• /
• pp.15-30
• /
• 2009

In this study, the nonlinear vibrations of stepped beams having different boundary conditions were investigated. The equations of motions were obtained by using Hamilton's principle and made non dimensional. The stretching effect induced non-linear terms to the equations. Natural frequencies are calculated for different boundary conditions, stepped ratios and stepped locations by Newton-Raphson Method. The corresponding nonlinear correction coefficients are also calculated for the fundamental mode. At the second part, an alternative method is produced for the analysis. The calculated natural frequencies and nonlinear corrections are used for training an artificial neural network (ANN) program which has a multi-layer, feed-forward, back-propagation algorithm. The results of the algorithm produce errors less than 2.5% for linear case and 10.12% for nonlinear case. The errors are much lower for most cases except clamped-clamped end condition. By employing the ANN algorithm, the natural frequencies and nonlinear corrections are easily calculated by little errors, and the computational time is drastically reduced compared with the conventional numerical techniques.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.530-535
• /
• 2004

This paper considers a state set estimation (SSE) based model predictive control (MPC) for linear parameter- varying (LPV) systems with input constraint. We estimate, at each time instant, a feasible set of all states which are consistent with system model, measurements and a priori information, rather than the state itself. By combining a state-feedback MPC and an SSE, we design an SSE-based MPC algorithm that stabilizes the closed-loop system. The proposed algorithm is solved by semi-de�nite program involving linear matrix inequalities. A numerical example is included to illustrate the performance of the proposed algorithm.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2006.04a
• /
• pp.235-241
• /
• 2006

The demand of 3D terrain mapping techniques is increasing in many application fields such as CNS(Car Navigation System), web service system, DMB(Digital Multimedia Broadcasting) systems and etc To construct a 3D terrain map, it is a pre-requite step that register data collected from different surveying sources. This Paper Present the methodology to register airborne photo, LIDAR data, and digital map, which are major data sources to create a 3D terrain mao. For this purpose, we developed the generally applicable algorithm that uses linear features to register airborne photos and digital maps to LIDAR data. The algorithm explicitly formulates step-by-step methodologies to establish observation equations for transformation. The results clearly demonstrate the proposed algorithm is appropriate to register these data sources.

• International Journal of Precision Engineering and Manufacturing
• /
• v.4 no.1
• /
• pp.43-48
• /
• 2003

A linear laser-vision sensor called ‘Perception TriCam Contour' is mounted on an industrial robot and often used for various application of the robot such as the position correction and the inspection of a part. In this paper, a sensor center position calibration is presented for the most accurate use of the robot-Perceptron system. The obtained algorithm is suitable for on-site calibration in an industrial application environment. The calibration algorithm requires the joint sensor readings, and the Perceptron sensor measurements on a specially devised jig which is essential for this calibration process. The algorithm is implemented on the Hyundai 7602 AP robot, and Perceptron's measurement accuracy is increased up to less than 1.4mm.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.66-74
• /
• 1999

A linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. It , therefore, has been widely studied to develop efficient algorithms to execute operations related with quadtrees. In this paper, we present algorithm to find neighbor blocks of binary images represented by linear quadtrees, using three-dimensional n${\times}$n${\times}$n processors on RMESH(Reconfigurable MESH). Pur algorithm have O(1) time complexity.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.2
• /
• pp.272-278
• /
• 2017

In this paper, we consider a single-channel amplitude comparison monopulse system(SCACMS). The monopulse ratio curve(MR-C) of the SCACMS can be controlled by an amplitude difference between sum and different signal, a phase difference and the coefficient of the signal processor. We first propose the SCACMS with multiple variables, and then apply a genetic algorithm to optimize the multiple variables in terms of minimizing a root mean square error. The simulation results show that when three variables of the SCACMS are jointly optimized, the linear region of the MR-C can be extended approximately 187 % compared to that of two variables.

• Proceedings of the KIEE Conference
• /
• 1993.11a
• /
• pp.299-303
• /
• 1993

There can be two methods in control systems: one is to use a linear controller, the other is to use a nonlinear controller. The PID controller and the fuzzy controller can be said to belong the linear and the nonlinear controller respectively. In this paper, a new hybrid controller which is consist of the linear PID controller of which the gain is tuned and the nonlinear self tuning fuzzy controller is proposed. In the PID controller, an algorithm which parameterizes the proportional, the intergral, and the derivative gain as a single parameter is used to improve the performance of the PID controller. In the self tuning fuzzy controller, an algorithm which changes the shape of the triangle membership function and changes the scaling factor which is multiplied to the error and the error change. The evaluation of the performance of the suggested algorithm is carried on by the simulation for the Rhino XH-2 robot manipulator with 5 links revolute joints.