• Journal of Educational Research in Mathematics
• /
• v.11 no.1
• /
• pp.223-238
• /
• 2001

Decimal fractions are the practical system of notations representing real numbers. The set of decimal fractions with the definition of comparison of decimal fractions and the identification of their double representations is essentially the field of real numbers. Therefore, we have to clarify the concept of decimal fractions. However, there are problematics that the aquisition of the concept of decimal fractions is not easy. In this paper, we attempt to eradicate the problematics relevant to the acquisition of decimal fractions discussed above and find the desirable direction of instruction of meaning for mathematical symbols: The case of decimal fractions. In J. Hiebert & decimal fractions. First of all, we clarify the essence of them - ratio, operator and linearity. And we compare and analyse the theories about decimal fractions of Resnick, Drexel, Brousseau and Hiebert and the contents of texts about decimal fractions in Korea. Finally, we suggest the efficient instruction methods which are faithful to the essence of decimal fractions and choose some methods among them to plan the classroom instruction and implement the methods in the classroom.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.10 no.3
• /
• pp.185-192
• /
• 2010

This paper presents a hardware-efficient auto-correlation scheme for the synchronization of MIMO-OFDM based wireless local area network (WLAN) systems, such as IEEE 802.11n. Carrier frequency offset (CFO) estimation for the frequency synchronization requires high complexity auto-correlation operations of many training symbols. In order to reduce the hardware complexity of the MIMO-OFDM synchronization, we propose an efficient correlation scheme based on time-multiplexing technique and the use of reduced samples while preserving the performance. Compared to a conventional architecture, the proposed architecture requires only 27% logic gates and 22% power consumption with acceptable BER performance loss.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.442-448
• /
• 2010

Cooperative relaying methods have attracted a lot of interest in the past few years. A conventional cooperative relaying scheme has a source, a destination, and a single relay. This cooperative scheme can support one symbol transmission per time slot, and is caned full rate transmission. However, existing fun rate cooperative relay approaches provide asymmetrical gain for different transmitted symbols. In this paper, we propose a cooperative relaying scheme that is assisted with dual relays and provides full transmission rate with the same macro-diversity to each symbol. We also address equalization for the dual relay transmission system in addition to addressing the issues concerning the improvement of system performance in terms of optimal power allocations.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.459-465
• /
• 2010

A new blind equalization algorithm that is based on maximizing the probability that the constant modulus errors concentrate near zero is proposed. The cost function of the proposed algorithm is to maximize the probability that the equalizer output power is equal to the constant modulus of the transmitted symbols. Two blind information-theoretic learning (ITL) algorithms based on constant modulus error signals are also introduced: One for minimizing the Euclidean probability density function distance and the other for minimizing the constant modulus error entropy. The relations between the algorithms and their characteristics are investigated, and their performance is compared and analyzed through simulations in multi-path channel environments. The proposed algorithm has a lower computational complexity and a faster convergence speed than the other ITL algorithms that are based on a constant modulus error. The error samples of the proposed blind algorithm exhibit more concentrated density functions and superior error rate performance in severe multi-path channel environments when compared with the other algorithms.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.558-560
• /
• 2003

최근 신문기사의 음성 서비스 등 음성합성 연구가 실용단계로 접어들고 있으나, 텍스트의 비-문자 처리에는 오류율이 높다. 본 연구는 신문 텍스트에 나타나는 비-문자 중 중의성이 높은 이음표의 문자화 유형을 6가지로 제시하고, 이음표를 포함한 어절의 패턴화된 구조 및 좌우 문맥 정보를 이용하여 이음표의 문자화 규칙을 알아본다. 제시된 이응표의 문자화 규칙과 이음표가 좌우 문맥 숫자의 문자화에 미치는 영향에 따른 숫자 읽기 방식을 포함하여 이음표 포함된 텍스트의 문자화 전사 시스템을 구현하였고, 2런치 J신문 텍스트를 코퍼스로 하여 이음표 문자화 시스템의 정확도를 측정하였다. 아울러 실험 결과에서 오류로 나타난 유형을 분석하여 정확도를 향상시킬 수 있는 방안을 제시하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.209-214
• /
• 1997

In this paper, we propose a new preorder tree method for binary images, named the Compact Complementary Quadtree (CCQ). In the proposed method we use type codes for representing nodes in the quadtree instead of using the symbols G, B, and W. From the experimental results, we have confirmed that the CCQ has a higher compression ratio than of the DF-expression. CCQ can be effectively applied to progressive transmission of binary images such as line drawings, geographical maps, and halftones.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.3
• /
• pp.241-247
• /
• 2006

We propose a character recognition system to extract the component reference names from printed circuit boards (PCBs) automatically. The names are written in horizontal, vertical, reverse-horizontal and reverse-vertical directions. Also various symbols and figures are included in PCBs. To recognize the character and orientation effectively, we divide the recognizer into two stages: character classification stage and orientation classification stage. The character classification stage consists of two sub-recognizers and a verifier. The rotaion-invarint features of input pattern are then used to identify the character independent of orientation. Each recognizer is implemented as a neural network, and the weight values of verifier are obtained by genetic algorithm. In the orientation classification stage, the input pattern is compared with reference patterns to identify the orientation. Experimental results are presented to verify the usefulness of the proposed system.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.225-228
• /
• 2001

DNA computing has been applied to the problem of getting an optimal solution since Adleman's experiment. DNA computing uses strings with various length and four-type bases that makes more useful for finding a global optimal solutions of the complex multi-modal problems. This paper presents DNA coding method for finding optimal solution of the multi-modal function and compares the efficiency of this method with the genetic algorithms (GA). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string and DNA coding method uses a tool of calculation or Information store with DNA molecules and four-type bases denoted by the symbols of A(Ademine), C(Cytosine), G(Guanine) and T(Thymine). The same operators, selection, crossover, mutation, are applied to the both DNA coding algorithm and genetic algorithms. The results show that the DNA based algorithm performs better than GA.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.66 no.4
• /
• pp.247-251
• /
• 2017

This paper proposes a low power transmission technique for single-carrier modulation with frequency domain equalization. As time domain signals and frequency domain signals have unique corresponding functions, inserting zeros after each symbol causes a repetition in other domain, so maximal ratio combining technique using repetitive transmission can be applied in the frequency domain. In this paper, we configure transmit signals to insert zeros after each symbols for single-carrier modulation with frequency domain equalization and maximal ratio receive combining block in the receiver structures, propose a structure for transmitter and receiver and show that its performance is better than the traditional algorithm by simulations.

• Communications of the Korean Mathematical Society
• /
• v.30 no.3
• /
• pp.253-267
• /
• 2015

Given a complex submanifoldM of the projective space $\mathbb{P}$(T), the hyperplane system R on M characterizes the projective embedding of M into $\mathbb{P}$(T) in the following sense: for any two nondegenerate complex submanifolds $M{\subset}\mathbb{P}$(T) and $M^{\prime}{\subset}\mathbb{P}$(T'), there is a projective linear transformation that sends an open subset of M onto an open subset of M' if and only if (M,R) is locally equivalent to (M', R'). Se-ashi developed a theory for the differential invariants of these types of systems of linear differential equations. In particular, the theory applies to systems of linear differential equations that have symbols equivalent to the hyperplane systems on nondegenerate equivariant embeddings of compact Hermitian symmetric spaces. In this paper, we extend this result to hyperplane systems on nondegenerate equivariant embeddings of homogeneous spaces of the first kind.