• Journal of Electrical Engineering and Technology
• /
• v.12 no.2
• /
• pp.926-936
• /
• 2017

The nonlinear behavior and the high performance requirement are the main problems that appear in the design of manipulator robots and their controllers. For that reason, the simulation, real-time execution and comparison of the performance of controllers applied to a robot with three degrees of freedom are presented. Five controllers are prepared to test the robot's dynamic model: predictive; hyperbolic sine-cosine; sliding mode; hybrid composed of a predictive + hyperbolic sine-cosine controller; and adaptive controller. A redundant robot, a communication and signal conditioning interface, and a simulator are developed by means of the MatLab/Simulink software, which allows analyzing the dynamic performance of the robot and of the designed controllers. The manipulator robot is made to follow a test trajectory which, thanks to the proposed controllers, it can do. The results of the performance of this manipulator and of its controllers, for each of the three joints, are compared by means of RMS indices, considering joint errors according to the imposed trajectory and to the controller used.

• Journal of Computing Science and Engineering
• /
• v.11 no.4
• /
• pp.152-159
• /
• 2017

Three-dimensional (3D) printing is applied to many areas of life, but 3D printing models are stolen by pirates and distributed without any permission from the original providers. Moreover, some special models and anti-weapon models in 3D printing must be secured from the unauthorized user. Therefore, 3D printing models must be encrypted before being stored and transmitted to ensure access and to prevent illegal copying. This paper presents a selective encryption algorithm for 3D printing models based on clustering and the frequency domain of discrete cosine transform. All facets are extracted from 3D printing model, divided into groups by the clustering algorithm, and all vertices of facets in each group are transformed to the frequency domain of a discrete cosine transform. The proposed algorithm is based on encrypting the selected coefficients in the frequency domain of discrete cosine transform to generate the encrypted 3D printing model. Experimental results verified that the proposed algorithm is very effective for 3D printing models. The entire 3D printing model is altered after the encryption process. The decrypting error is approximated to be zero. The proposed algorithm provides a better method and more security than previous methods.

• Wind and Structures
• /
• v.22 no.1
• /
• pp.43-63
• /
• 2016

In conventional buffeting theory, it is assumed that the aerostatic coefficients along a bridge deck follow the strip assumption. The validity of this assumption is suspect for a cable-stayed bridge in the construction stages, due to the effect of significant aerodynamic interference from the pylon. This situation may be aggravated in skew winds. Therefore, the most adverse buffeting usually occurs when the wind is not normal to bridge axis, which indicates the invalidity of the traditional "cosine rule". In order to refine the studies of static wind load on the deck of cable-stayed bridge under skew wind during its most adverse construction stage, a full bridge 'aero-stiff' model technique was used to identify the aerostatic loads on each deck segment, in smooth oncoming flow, with various yaw angles. The results show that the shelter effect of the pylon may not be ignored, and can amplify the aerostatic loading on the bridge deck under skew winds ($10^{\circ}-30^{\circ}$) with certain wind attack angles, and consequently results in the "cosine rule" becoming invalid for the buffeting estimation of cable-stayed bridge during erection for these wind directions.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.565-572
• /
• 2001

Analyzing functions with small values of the product of position and frequency uncertainties have many advantages in image processing and data compression. Until now, this values has been computed based on the uncertainty principle, but the computed frequency uncertainty is not practical the human visual filters which have on-zero peak response frequencies. A new metric for the frequency uncertainty is used to calculate a deviation about the frequency which has maximum response. The joint effective widths for various functions are derived. As the result of analysis, the joint uncertainty for many functions converges to 0.5 as the joint parameter increases. Furthermore. Gabor cosine function shows an excellent performance among the mentioned functions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.5058-5072
• /
• 2015

Quaternions have been commonly employed in color image processing, but when the existing pure quaternion representation for color images is used in perceptual hashing, it would degrade the robustness performance since it is sensitive to image manipulations. To improve the robustness in color image perceptual hashing, in this paper a full quaternion representation for color images is proposed by introducing the local image luminance variances. Based on this new representation, a novel Full Quaternion Discrete Cosine Transform (FQDCT)-based hashing is proposed, in which the Quaternion Discrete Cosine Transform (QDCT) is applied to the pseudo-randomly selected regions of the novel full quaternion image to construct two feature matrices. A new hash value in binary is generated from these two matrices. Our experimental results have validated the robustness improvement brought by the proposed full quaternion representation and demonstrated that better performance can be achieved in the proposed FQDCT-based hashing than that in other notable quaternion-based hashing schemes in terms of robustness and discriminability.

• Journal of the Korean School Mathematics Society
• /
• v.16 no.4
• /
• pp.927-941
• /
• 2013

In this paper, we investigate and analysis high school students' generalization of cosine rule using analogy, and we study teaching and learning methods improving students' analogical thinking ability to improve mathematical thinking process. When students can reproduce what they have learned through inductive reasoning process or analogical thinking process and when they can justify their own mathematical knowledge through logical inference or deductive reasoning process, they can truly internalize what they learn and have an ability to use it in various situations.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.11 no.4
• /
• pp.534-543
• /
• 2000

In this paper, when the current optical communication system is used for the DWDM. The FBG filter for the DWDN is able to reduce the interferences between the adjacent channels. In this paper, therefore, we find the relection spectrums for the three types of induced index changes, that is, uniform, Gaussian apodized, and raised-cosine apodized. From the obtained result in this paper, we can see that uniform FBG does not fit, and that the smaller the maximum induced index change $\sigma$ is and the larger the value of parameter C in the raised-cosine apodized FBG and G in the Gaussian apodized FBG are the fitter they are on the narrow filter for DWDM.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.2
• /
• pp.115-122
• /
• 2012

We present here a new class of activation functions for neural networks, which herein will be called CosGauss function. This function is a cosine-modulated gaussian function. In contrast to the sigmoidal-, hyperbolic tangent- and gaussian activation functions, more ridges can be obtained by the CosGauss function. It will be proven that this function can be used to aproximate polynomials and step functions. The CosGauss function was tested with a Cascade-Correlation-Network of the multilayer structure on the Tic-Tac-Toe game and iris plants problems, and results are compared with those obtained with other activation functions.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.4
• /
• pp.497-505
• /
• 2016

The two-dimensional (2D) Discrete Cosine Transform (DCT) is used widely in image and video processing systems. The perception of human visualization permits us to design approximate rather than exact DCT. In this paper, we propose a digital implementation of 16-point approximate 2D DCT architecture based on one-dimensional (1D) DCT and Modified Gate Diffusion Input (MGDI) technique. The 8-point 1D Approximate DCT architecture requires only 12 additions for realization in digital VLSI. Additions can be performed using the proposed 8 transistor (8T) MGDI Full Adder which reduces 2 transistors than the existing 10 transistor (10T) MGDI Full Adder. The Approximate MGDI 2D DCT using 8T MGDI Full adders is simulated in Tanner SPICE for $0.18{\mu}m$ CMOS process technology at 100MHZ.The simulation result shows that 13.9% of area and 15.08 % of power is reduced in the 8-point approximate 2D DCT, 10.63 % of area and 15.48% of power is reduced in case of 16-point approximate 2D DCT using 8 Transistor MGDI Full Adder than 10 Transistor MGDI Full Adder. The proposed architecture enhances results in terms of hardware complexity, regularity and modularity with a little compromise in accuracy.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.180-181
• /
• 2018

JPEG is a most widely used standard image compression technology. This research introduces the JPEG image compression algorithm and describes each step in the compression and decompression. Image compression is the application of data compression on digital images. The DCT (discrete cosine transform) is a technique for converting a time domain to a frequency domain. First, the image is divided into 8 by 8 pixel blocks. Second, working from top to bottom left to right, the DCT is applied to each block. Third, each block is compressed through quantization. Fourth, the array of compressed blocks that make up the image is stored in a greatly reduced amount of space. Finally if desired, the image is reconstructed through decompression, a process using IDCT (inverse discrete cosine transform).