• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.2
• /
• pp.18-26
• /
• 2015

In this paper, we studied the method for analyzing and estimating the parameters that induce I/Q imbalance in the repeater using direct conversion RF. In repeater, amplitude, phase, and filter mismatch are generated in the receiving-end which converts RF signal to baseband signal. And amplitude and phase mismatch are generated in the transmitting-end which converts baseband signal to RF signal. Accordingly, we modeled the parameters that cause I/Q imbalance in the structure of the repeater in order, and proposed a feedback test structure from the transmitting-end to the receiving-end for estimating the corresponding parameters. By comparing the test transmitting signal and received signal, it is possible to estimate the I/Q imbalance parameters which occurred from mixed components of real and imaginary part. And it was confirmed that I/Q imbalance phenomenon has been properly compensated with estimated parameters at the direct conversion RF repeater.

• School Mathematics
• /
• v.11 no.1
• /
• pp.111-129
• /
• 2009

This paper is about didactical transposition, which is to transpose academic knowledge into practical knowledge intended to teach. The research questions are addressed as follows. 1. Are the 13 mathematics textbooks of the 10-Na level indisputable regarding with the didactical transposition, in terms that the order of arrangement and the way of explaining the knowledge of trigonometric functions being analyzed and that its logical construction and students' understandings are considered? 2. Can some transpositions for easier use of didactical manipulative, for more practical and for more principle based be proposed? To answer these questions, this research examined previous studies of mathematics education, specifically the organization of the textbook and the trigonometric functions, and also compared orders of arranging and ways of explaining trigonometric functions from the perspective of didactical transposition of 13 versions of the 10-Na level reorganized under the 7th curriculum. The paper investigated what lacks in the present textbook and sought a teaching guideline of trigonometric functions(especially about sector and graph, period, characters of trigonometric function, and sine rule).

• The Journal of the Korea Contents Association
• /
• v.8 no.4
• /
• pp.86-91
• /
• 2008

To present the design procedure of discretized 8-bit tent map executing the transformation of tent function which is one of the chaotic functions, first, the truth table of discretized tent map was written, and then according to the simplified Boolean algebra equations obtained from the truth table, the discretized map is implemented with the exclusive logic gate as a real hardware. The discretized tent map circuit which provides the feedback circuit for generating the period-8 states relevant to the 8-bit finite precision is also designed and presented in this paper. Furthermore, it might be used stream cipher system with a new key-stream circuit for generate of chaotic binary sequence.

• The KIPS Transactions:PartB
• /
• v.10B no.1
• /
• pp.111-118
• /
• 2003

The SMIL specification that is recently approved by the W3C and is meant to help deliver multimedia content to the Web, is widely used in these days and they have continuously emerged tools or softwares related with that. In this paper, I propose an algorithm to convert temporal scripts of RASP that is an experimental toolkit for computer animation that promotes interaction-based programming over time into a SMIL document. For making better use of SMIL documents, we can improve reusability of animation components. And, main contribution of this paper is that it verifies the sequence diagram generated for synchronization of documents by reconverting SMIL from UML sequence diagram.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.554-559
• /
• 2010

자율무인잠수정은 탐사 목적에 따라 다양한 임무를 수행해야 하며, 임무에 따라 자율무인잠수정 행동의 유형과 순서는 달라질 수 있다. 그러나 대부분의 자율무인잠수정은 한정된 임무에 대하여 프로그램 내부에 고정된 행동 유형으로 동작하며, 다른 유형의 임무를 수행해야 할 경우에는 프로그램을 수정해야 하는 문제점이 있다. 따라서 본 연구에서는 자율무인잠수정이 수행할 수 있는 다양한 임무를 명시할 수 있는 임무 언어를 개발하였다. 이 임무 언어는 명령어의 실행 순서를 제어할 수 있는 제어문과 자율무인잠수정의 행동을 지정하거나 자율무인잠수정의 상태를 입출력 할 수 있는 명령어, 그리고 변수 정의를 제공하기 때문에, 사용자가 자율무인잠수정의 임무를 자유롭게 표현하는 것이 가능하다. 임무 언어로 작성된 임무 파일은 전용 어셈블러에 의해 이진 형식의 실행이미지로 변환된 후에, 자율무인잠수정 내장 소프트웨어 내부의 가상기계 기억장치에 적재되어 실행된다. 실행이미지를 가상기계에서 해석하고 실행하는데 필요한 시스템의 자원을 최소화하기 위하여 임무 언어는 자율무인잠수정의 임무를 표현하기 위한 필수적인 부분만을 고려하여 설계되었으며, 문법은 ARM v5 어셈블리와 유사한 형태이다. 개발된 임무 언어는 한국해양연구원에서 개발한 이심이100 자율무인잠수정에 적용되었으며, 이후 개발할 6,000m급의 이심이6000 자율무인잠수정에도 사용될 예정이다.

• The Journal of Society for e-Business Studies
• /
• v.26 no.1
• /
• pp.127-140
• /
• 2021

Recently, sequence data containing time information, such as sensor measurement data and purchase history, has been generated in various applications. So far, many methods for finding sequences that are significantly different from other sequences among given sequences have been proposed. However, most of them have a limitation that they consider only the order of elements in the sequences. Therefore, in this paper, we propose a new anomalous sequence detection method that considers both the order of elements and the time interval between elements. The proposed method uses an extended LSTM autoencoder model, which has an additional layer that converts a sequence into a form that can help effectively learn both the order of elements and the time interval between elements. The proposed method learns the features of the given sequences with the extended LSTM autoencoder model, and then detects sequences that the model does not reconstruct well as anomalous sequences. Using experiments on synthetic data that contains both normal and anomalous sequences, we show that the proposed method achieves an accuracy close to 100% compared to the method that uses only the traditional LSTM autoencoder.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.27-36
• /
• 2007

Changeable biometrics identify a person using transformed biometric data instead of original biometric data in order to enhance privacy and security in biometrics when biometric data is compromised. In this paper, a novel scheme which generates changeable face templates for statistical appearance-based face recognition is proposed. Two different original face feature vectors are extracted from two different appearance-based approaches, respectively, each original feature vector is normalized, and its elements are re-ordered. Finally a changeable face template is generated by weighted addition between two normalized and scrambled feature vectors. Since the two feature vectors are combined into one by a two to one mapping, the original two feature vectors are not easily recovered from the changeable face template even if the combining rule is known. Also, when we need to make new changeable face template for a person, we change the re-ordering rule for the person and make a new feature vector for the person. Therefore, the security and privacy in biometric system can be enhanced by using the proposed changeable face templates. In our experiments, we analyze the proposed method with respect to performance and security using an AR-face database.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.3
• /
• pp.304-309
• /
• 2002

We propose the computation reduction method of real root method that is mainly used in the CELP (Code Excited Linear Prediction) vocoder. The real root method is that if polynomial equations have the real roots, we are able to find those and transform them into LSP. However, this method takes much time to compute, because the root searching is processed sequentially in frequency region. In this paper, to reduce the computation time of real root, we compare the real root method with two methods. In first method, we use the mal scale of searching frequency region that is linear below 1 kHz and logarithmic above. In second method, The searching frequency region and searching interval are ordered by each coefficient's distribution. In order to compare real root method with proposed methods, we measured the following two. First, we compared the position of transformed LSP (Line Spectrum Pairs) parameters in the proposed methods with these of real root method. Second, we measured how long computation time is reduced. The experimental results of both methods that the searching time was reduced by about 47% in average without the change of LSP parameters.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.173-181
• /
• 2009

This paper proposes an algorithm to transform RDF(Resource Description Framework) models for ontology into CPN(Colored Petri Net) models. The algorithm transforms the semantics of the RDF model into the topology of the CPN by mapping the classes and the properties of the RDF onto the places of the CPN model then reflects the RDF statements on the CPN by representing the relationships between them as token transitions on the CPN. The basic idea of reflecting the RDF statements on the CPN is to generate a token, which is an ordered pair consisting of two tokens (one from the place mapped into the subject and the other one from the place mapped into the object) and transfer it to the place mapped into the predicate. We have actually built CPN models for given RDF models on the CNPTools and inferred and extracted answers to the RDF queries on the CPNTools.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.297-304
• /
• 2004

In this paper, a mesh simplification algorithm based on wavelet transform and 2D planar sampling is proposed for efficient handling of 3D objects in computer applications. Since 3D vertices are directly transformed with wavelets in conventional mesh compression and simplification algorithms, it is difficult to solve tiling optimization problems which reconnect vertices into faces in the synthesis stage highly demanding vertex connectivities. However, a 3D mesh is sampled onto 2D planes and 2D polygons on the planes are independently simplified in the proposed algorithm. Accordingly, the transform of 2D polygons is very tractable and their connection information Is replaced with a sequence of vertices. The vertex sequence of the 2D polygons on each plane is analyzed with wavelets and the transformed data are simplified by removing small wavelet coefficients which are not dominant in the subjective quality of its shape. Therefore, the proposed algorithm is able to change the mesh level-of-detail simply by controlling the distance of 2D sampling planes and the selective removal of wavelet coefficients. Experimental results show that the proposed algorithm is a simple and efficient simplification technique with less external distortion.