• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.4
• /
• pp.317-326
• /
• 2021

Let K be an imaginary quadratic field other than ℚ(${\sqrt{-1}}$) and ℚ(${\sqrt{-3}}$), and let 𝒪_K be its ring of integers. Let N be a positive integer such that N = 5 or N ≥ 7. In this paper, we generate the ray class field modulo N𝒪_K over K by using a single x-coordinate of an elliptic curve with complex multiplication by 𝒪_K.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.4
• /
• pp.853-860
• /
• 2010

A class invariant is the value of a modular function that generates a ring class field of an imaginary quadratic number field such as the singular moduli of level 1. In this paper, using Shimura Reciprocity Law, we compute the Galois actions of a class invariant from a generalized Weber function $g_2$ over quadratic number fields with discriminant $D{\equiv}-3$ (mod 36).

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.188-194
• /
• 2011

The purpose of this paper is to explain the implementation method in order to enhance stability and reliability of embedded system. In this research, Texas Instrument (TI)'s TMS570 MCU(Micro Controller Unit) is used to satisfy the standard of stability that is IEC 61508. IEC 61508 suggest SIL(Safety Integrity Level) from 1 to 4 and TMS570 is satisfied SIL3. Also, TMS570 can provide several stability functions can be used in realtime system. To use such functions, this paper suggest the solution about the defect that can be used in realtime system. In basic way TMR(Triple Modular Redundancy) suggested in addition to explain about the way to improve safety and reliability. Also this paper will suggest the method that reinforce the stability of calculation by using multiplex voter and memory.

• Journal of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.945-954
• /
• 2015

Let ${\lambda}_f(n)$ denote the n-th normalized Fourier coefficient of a primitive holomorphic form f for the full modular group ${\Gamma}=SL_2({\mathbb{Z}})$. In this paper, we are concerned with ${\Omega}$-result on the summatory function ${\sum}_{n{\leqslant}x}{\lambda}^2_f(n^2)$, and establish the following result ${\sum}_{\leqslant}{\lambda}^2_f(n^2)=c_1x+{\Omega}(x^{\frac{4}{9}})$, where $c_1$ is a suitable constant.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1617-1623
• /
• 1989

The introduction of the fast Fourier transform(FFT),an efficient computational algorithm for the discrete Fourier transform(DFT) by Cooley and Tukey(1965), has brought to the limelight various other discrete transforms. Some of the analog functions from which these transforms have been derived date back to the early 1920's, for example, Walsh functions (Walsh, 1923) and Hadamard Transform(Enomoto et al, 1965). Fast algorithms developed for the forward transform are equally applicable, exept for minor changes, to the inverse transform. In this paper, we present a simple pipelined Hadamard matrix(HM) which is used to develop a fast algorithm for the Hadamard Processor (HP). The Fast Hadamard Transform(FHT) can be derived using matrix partitioning techniques. The HP system is incorporated through a modular design which permits tailoring to meet a wide range of video data link applications. Emphasis has been placed on a low cost, a low power design suitable for airbone system and video codec.

• Journal of information and communication convergence engineering
• /
• v.15 no.4
• /
• pp.212-216
• /
• 2017

In this paper, we introduce novel techniques to improve the high performance of AE functions on modern high-end IoT platforms (ARM-NEON), which support SIMD and cryptography instruction sets. For the Sophie Germain Counter Mode of operation (SGCM), counter modes of encryption and prime field multiplication are required. We chose the Montgomery multiplication for modular multiplication. We perform Montgomery multiplication in a parallel way by exploiting both the ARM and NEON instruction sets. Specifically, the NEON instruction performed 128-bit integer multiplication and the ARM instruction performed Montgomery reduction, simultaneously. This approach hides the latency for ARM in the NEON instruction set. For a high-speed counter mode of encryptions for both AE functions, we introduced two-level computations. When the tasks were large volume, we switched to the NEON instruction to execute the encryption operations. Otherwise, we performed the encryptions on the ARM module.

• Korean Journal of Remote Sensing
• /
• v.20 no.3
• /
• pp.189-196
• /
• 2004

This paper describes what an operational change detection tool requires and the software which was designed and developed according to the requirements. The top requirement for the application of the software to operational change detection was identified: minimization of false detections, missing detections and operational cost. In order to meet such a requirement, the software was designed with the concept that the ultimate decision and isolation of changes must be performed manually by visual interpretation and all automatic algorithms and/or visualization techniques must be defined as support functions. In addition, the modular structure of the proposed software enables the addition of a new support function with the minimum development cost and minimum change of the operational environment.

• Journal of the Korean Mathematical Society
• /
• v.60 no.1
• /
• pp.167-193
• /
• 2023

Let f be a self-dual primitive Maass or modular forms for level 4. For such a form f, we define N^s_f(T):=|{ρ ∈ ℂ : |𝕵(ρ)| ≤ T, ρ is a non-trivial simple zero of L_f(s)}|.. We establish an omega result for N^s_f(T), which is $N^s_f(T) = \Omega(T^{\frac{1}{6}-{\epsilon}})$ for any ∊ > 0. For this purpose, we need to establish the Weyl-type subconvexity for L-functions attached to primitive Maass forms by following a recent work of Aggarwal, Holowinsky, Lin, and Qi.

• Journal of the Economic Geographical Society of Korea
• /
• v.9 no.2
• /
• pp.243-260
• /
• 2006

The continuing enlargement, deepening integration of EU and penetration of extra-EU enterprise into EU market are forming a new geographical restructure of the production system. In this paper, I analyse the changing geography of the EU automotive production system. The globalization and regionalisation of production activity intensify a competition among the enterprise. The European automotive production system changes to a platform system and a modular system for a diminution of productive costs, a development of various products and a frequent innovation of products. The European automotive enterprise is restructuring geographically the production functions and products in order to promote efficiency on a new production system, enlarged production space and intensified economic integration. The European automotive industry tends to a spatial specialization and agglomeration according to the locational factors of production functions and products and the locational condition of regions. This intensifies the geographical hierarchic structure of production activity between the core and the periphery.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.9
• /
• pp.782-787
• /
• 2001

In this paper, we propose an growing and pruning algorithm to design the adaptive structure of modular wavelet neural network(MWNN) with F-projection and geometric growing criterion. Geometric growing criterion consists of estimated error criterion considering local error and angel criterion which attempts to assign wavelet function that is nearly orthogonal to all other existing wavelet functions. There criteria provide a methodology that a network designer can constructs wavelet neural network according to one s intention. The proposed growing algorithm grows the module and the size of modules. Also, the pruning algorithm eliminates unnecessary node of module or module from constructed MWNN to overcome the problem due to localized characteristics of wavelet neural network which is used to modules of MWNN. We apply the proposed constructing algorithm of the adaptive structure of MWNN to approximation problems of 1-D function and 2-D function, and evaluate the effectiveness of the proposed algorithm.