• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.320-325
• /
• 1999

An absolute type shaft encoder which utilized moire fringe will be presented in this paper. Linear moire fringe is commonly used to measure the displacement of the linear motion. However, an absolute encoder which measure the rotation angle of a shaft is operated usually with a code disk which the gray code pattern is printed on. Such encoder has inherently resolution limit because of the patterning mechanism and sensing mechanism. In order to measure the position of fringes which move as the code disk rotates, neural network was developed in this paper. Formerly fringe position is usually measured by a sophisticated software, which needs a little long calculation time. However, using neural network method can eliminate such calculation time, even though it needs learning job. The proposed method is verified through several experiments.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.419-425
• /
• 2008

For $q^5-q^3-q^2-q+1{\leq}d{\leq}q^5-q^3-q^2$, we prove the non-existence of a $[g_q(6,d),6,d]_q$ code and we give a $[g_q(6,d)+1,6,d]_q$ code by constructing appropriate 0-cycle in the projective space, where $g_q (k,d)={{\sum}^{k-1}_{i=0}}{\lceil}\frac{d}{q^i}{\rceil}$. Consequently, we have the minimum length $n_q(6,d)=g_q(6,d)+1\;for\;q^5-q^3-q^2-q+1{\leq}d{\leq}q^5-q^3-q^2\;and\;q{\geq}3$.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.365-366
• /
• 2022

The distributed code is a type of linear codes that can be used for coding and federated learning for privacy. In the distributed code, privacy or confidential information is not dependent to each other because the information of each code is not included with other codes. In this paper, we examine the properties of these distributed codes and present techniques for synthesizing new sets of distributed codes from previously known distributed codes. In addition, we propose several scenarios in which combined codes can be used.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.829-844
• /
• 2023

In this paper, we present a new construction for self-dual codes that uses the concept of double bordered construction, group rings, and reverse circulant matrices. Using groups of orders 2, 3, 4, and 5, and by applying the construction over the binary field and the ring F₂ + uF₂, we obtain extremal binary self-dual codes of various lengths: 12, 16, 20, 24, 32, 40, and 48. In particular, we show the significance of this new construction by constructing the unique Extended Binary Golay Code [24, 12, 8] and the unique Extended Quadratic Residue [48, 24, 12] Type II linear block code. Moreover, we strengthen the existing relationship between units and non-units with the self-dual codes presented in [10] by limiting the conditions given in the corollary. Additionally, we establish a relationship between idempotent and self-dual codes, which is done for the first time in the literature.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.4
• /
• pp.721-728
• /
• 2018

This paper introduces various linear block error correction code and compares performances of the correction circuits. As the risk of errors due to power noise has increased, ECC(: Error Correction Code) has been introduced to prevent the bit error. There are two representatives of ECC structures which are SEC-DED(: Single Error Correction Double Error Detection) and SEC-DED-DAEC(: Double Adjacent Error Correction). According to simulation results, the SEC-DED circuit has advantages of small area and short delay time compared to SEC-DED-DAEC circuits. In case of SED-DED-DAEC, there is no big difference between Dutta's and Pedro's from performance point of view. Therefore, Pedro's code is more efficient than Dutta' code since the correction rate of Pedro's code is higher than that of Dutta's code.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2002.05b
• /
• pp.137-140
• /
• 2002

EM(ElectroMagnetic) pump is used for the purpose of transporting liquid sodium coolant with electrical conductivity in the LMR(Liquid Metal Reactor). In the present study, computer program for the pilot annular linear EM pump has been developed for the maximum flowrate with 200 l/min and maximum developing pressure with 3 bar. Firstly, Balance equation is induced by the equivalent circuit method which is commonly employed to analyze linear induction machines and the calculation of the hydraulic pressure drop. Then, design equation is converted to the computer program and optimum pump variables are determined by this code. The code is verified by the comparative analysis with the characteristic of the commercialized pump.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.400-403
• /
• 2022

This paper propose a GPU-based N-body collision detection algorithm using LBVH (Linear Bounding Volume Hierarchy) technique. This algorithm introduces a new modified Morton code scheme where the codes use an information about how much each body takes a space in the screen space. This scheme improves the GPU sorting performance of the N-Body because it culls out invisible objects in natural manner. Through the experiments, we verifies that the proposed algorithms can have at least 15% performance improvement over the existing methods

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.4
• /
• pp.785-796
• /
• 2012

In this paper, we propose an effective Behavior-based detection technique using the frequency of system calls to detect malicious code, when the number of training data is fewer than the number of properties on system calls. In this study, we collect the Native APIs which are Windows kernel data generated by running program code. Then we adopt the normalized freqeuncy of Native APIs as the basic properties. In addition, the basic properties are transformed to new properties by GLDA(Generalized Linear Discriminant Analysis) that is an effective method to discriminate between malicious code and normal code, although the number of training data is fewer than the number of properties. To detect the malicious code, kNN(k-Nearest Neighbor) classification, one of the bayesian classification technique, was used in this paper. We compared the proposed detection method with the other methods on collected Native APIs to verify efficiency of proposed method. It is presented that proposed detection method has a lower false positive rate than other methods on the threshold value when detection rate is 100%.

• Advances in concrete construction
• /
• v.9 no.1
• /
• pp.23-31
• /
• 2020

Geometric nonlinearity can significantly affect load-carrying capacity of slender columns. Dependence of structural stability on columns necessitates the consideration of second-order effects in the design process of columns, appropriately. On the whole, the design codes present a simplified procedure for second order analysis of slender columns. In this approximate method, the end moments of columns resulted from linear analysis (first-order) are multiplied by the recommended moment amplification factors of codes to achieve magnified moments of the second-order analysis. In the other approach, the equilibrium equations are directly solved for the deformed configuration of structure, so the resulting moments and deflections contain the influence of slenderness and increase more rapidly than do loads. The aim of this study is to evaluate the accuracy of moment amplification factors of Iranian national building code whose provisions are similar to the ACI requirement. Herein, finite element method is used to achieve magnified end moments of reinforced concrete moment resisting frames, and the outcomes are compared with the moments acquired based on the proposed approximate method by Iranian national building code. The results show that the approximate method of Iranian code for calculating magnified moments has significant errors for both unbraced and braced columns.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.12-20
• /
• 2015

Convolutional codes which are terminated by direct truncation (DT) and zero tail termination provide unequal error protection. When DT terminated convolutional codes are used to encode short messages, they have interesting error protection properties. Such codes match the significance of the output bits of common quantizers and therefore lead to a low mean square error (MSE) when they are used to encode quantizer outputs which are transmitted via a noisy digital communication system. A code construction method that allows adapting the code to the channel is introduced, which is based on time-varying convolutional codes. We can show by simulations that DT terminated convolutional codes lead to a lower MSE than standard block codes for all channel conditions. Furthermore, we develop an MSE approximation which is based on an upper bound on the error probability per information bit. By means of this MSE approximation, we compare the convolutional codes to linear unequal error protection code construction methods from the literature for code dimensions which are relevant in analog to digital conversion systems. In numerous situations, the DT terminated convolutional codes have the lowest MSE among all codes.