• 대한전기학회논문지:전력기술부문A
• /
• 제48권5호
• /
• pp.643-649
• /
• 1999

In this paper, we proposed that ｉ) noise-tolerant four kinds of AM(Amplitude Modulation)-FM(Frequency Modulation) demodulators are designed, ⅱ) we derived undersampling frequency through the product via energy operator of the monocomponent AM-FM signals separated form two-component AM-FM signals, and ⅲ) these four kinds of AM-FM demodulators detect respectively information signals of the IA(Instantaneous Amplitude) and IF(Instantaneous Frequency) by undersampling frequency to be different each other from the undersampled monocomponet AM-FM signals. Particularly, the proposed algorithm can control undersampling frequency by an integer factor. And these efficient AM-FM demodulators are well worked with the undersampled AM-FM signals.

• Kyungpook Mathematical Journal
• /
• 제60권1호
• /
• pp.53-69
• /
• 2020

Let (A, M) ⊂ (B, N) be commutative quasi-local rings. We consider the property that there exists a ring D such that A ⊆ D ⊂ B and the extension D ⊂ B is inert. Examples show that the number of such D may be any non-negative integer or infinite. The existence of such D does not imply M ⊆ N. Suppose henceforth that M ⊆ N. If the field extension A/M ⊆ B/N is algebraic, the existence of such D does not imply that B is integral over A (except when B has Krull dimension 0). If A/M ⊆ B/N is a minimal field extension, there exists a unique such D, necessarily given by D = A + N (but it need not be the case that N = MB). The converse fails, even if M = N and B/M is a finite field.

• 충청수학회지
• /
• 제23권4호
• /
• pp.845-852
• /
• 2010

A nonlinear algebraic equation f(x) = 0 is considered to find a root with integer multiplicity $m{\geq}1$. A variant of Newton-secant method for a multiple root is proposed below: for n = 0, 1, $2{\cdots}$ $$x_{n+1}=x_n-\frac{f(x_n)^2}{f^{\prime}(x_n)\{f(x_n)-{\lambda}f(x_n-\frac{f(x_n)}{f^{\prime}(x_n)})\}$$, $$\lambda=\{_{1,\;if\;m=1.}^{(\frac{m}{m-1})^{m-1},\;if\;m{\geq}2$$ It is shown that the method has third-order convergence and its asymptotic error constant is expressed in terms of m. Numerical examples successfully verified the proposed scheme with high-precision Mathematica programming.

• 대한수학회지
• /
• 제58권3호
• /
• pp.643-702
• /
• 2021

Fix ℤ/2 is the prime field of two elements and write 𝒜₂ for the mod 2 Steenrod algebra. Denote by GL_d := GL(d, ℤ/2) the general linear group of rank d over ℤ/2 and by ${\mathfrak{P}}_d$ the polynomial algebra ℤ/2[x₁, x₂, …, x_d] as a connected unstable 𝒜₂-module on d generators of degree one. We study the Peterson "hit problem" of finding the minimal set of 𝒜₂-generators for ${\mathfrak{P}}_d$. Equivalently, we need to determine a basis for the ℤ/2-vector space $$Q{\mathfrak{P}}_d:={\mathbb{Z}}/2{\otimes}_{\mathcal{A}_2}\;{\mathfrak{P}}_d{\sim_=}{\mathfrak{P}}_d/{\mathcal{A}}^+_2{\mathfrak{P}}_d$$ in each degree n ≥ 1. Note that this space is a representation of GL_d over ℤ/2. The problem for d = 5 is not yet completely solved, and unknown in general. In this work, we give an explicit solution to the hit problem of five variables in the generic degree n = r(2^t - 1) + 2^ts with r = d = 5, s = 8 and t an arbitrary non-negative integer. An application of this study to the cases t = 0 and t = 1 shows that the Singer algebraic transfer of rank 5 is an isomorphism in the bidegrees (5, 5 + (13.2⁰ - 5)) and (5, 5 + (13.2¹ - 5)). Moreover, the result when t ≥ 2 was also discussed. Here, the Singer transfer of rank d is a ℤ/2-algebra homomorphism from GL_d-coinvariants of certain subspaces of $Q{\mathfrak{P}}_d$ to the cohomology groups of the Steenrod algebra, $Ext^{d,d+*}_{\mathcal{A}_2}$ (ℤ/2, ℤ/2). It is one of the useful tools for studying these mysterious Ext groups.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제50권2호
• /
• pp.135-148
• /
• 2011

We can say that the history of mathematics is the history on the development of the number system. The number starts from Natural number and is constructed to Integer number and Rational number. The Rational number is not the complete number analytically so that Real number is completed by the idea of the nested interval method. Real number is completed analytically, however, is not by algebra, so the algebraically completed type of the rational number, through the way that similar to the process of completing real number, is Complex number. The purpose of this study is to show the most appropriate way for the development of the human being thinking about the teaching and leaning of Complex number. To do this, We have to consider the proof of the existence of Complex number, the background of the introduction of Complex number and the background knowledge that the teachers to teach Complex number should have. Also, this study analyzes the knowledge to be taught of Complex number based on the anthropological theory of didactics and finally presents the teaching method of Complex number based on this theory.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제25권2호
• /
• pp.323-339
• /
• 2011

지수법칙에서 지수의 확장은 정수의 계산규칙과 마찬가지로 대수적 형식 불역의 원리에 의한 확장적 구성을 학생들에게 경험하게 할 수 있는 좋은 소재가 될 수 있다. 현행 교과서에서는 지수가 자연수에서 정수, 유리수, 실수 범위까지 확장할 수 있다고 기술하면서 학생들에게 지수가 실수로 확장해도 지수법칙이 성립함을 직관적으로 받아들이도록 하고 있다. 그러나, 지수법칙의 확장에서 유리수 지수나 무리수 지수의 값에 대한 자세한 설명이 없이 지나감으로 인하여 학생들은 이러한 값이 유리수인지 무리수인지 많은 의문을 가지고 있다. 이와 관련된 학생들의 질문에 대하여 대부분의 교사들은 자세한 답변 대신 현행 교과과정 밖의 내용이므로 대학가서 배운다라는 답변으로 그 질문에 대한 답올 대신하곤 한다. 따라서, 본 논문은 지수법칙의 확장에 대한 학생들의 궁금증의 원인을 찾기 위하여 지수법칙의 확장 단원에 대한 현행 고등학교 수학 I 교과서를 분석하여 지수법칙의 확장에 대한 학생들의 궁금증의 원인을 찾고, 지수법칙의 실수로의 확장에서 학생들이 자주 갖는 의문인 무리 지수를 갖는 수에 대한 예비교사들의 인식과 오류에 대하여 조사하여 예비교사 교육에 대한 시사점을 주고자 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권4호
• /
• pp.1624-1647
• /
• 2020

Vehicular network is one of the most important subjects for researchers in recent years. Anycast routing protocols have many applications in vehicular ad hoc networks. The aim of an anycast protocol is sending packets to at least one of the receivers among candidate receivers. Studies done on anycast protocols over vehicular networks, however, have capability of implementation on some applications; they are partial, and application specific. No need to say that the lack of a comprehensive study, having a strong analytical background, is felt. Mathematical modeling in vehicular networks is difficult because the topology of these networks is dynamic. In this paper, it has been demonstrated that vehicular networks can be modeled based on time-expanded networks. The focus of this article is on geographical anycast. Three different scenarios were proposed including sending geographic anycast packet to exactly-one-destination, to at-least-one-destination, and to K-anycast destination, which can cover important applications of geographical anycast routing protocols. As the proposed model is of MILP type, a decentralized heuristic algorithm was presented. The evaluation process of this study includes the production of numerical results by Branch and Bound algorithm in general algebraic modeling system (GAMS) software and simulation of the proposed protocol in OMNET++ simulator. The comprehension of the result of proposed protocol and model shows that the applicability of this proposed protocol and its reactive conformity with the presented models based on presented metrics.

• 대한수학회보
• /
• 제60권6호
• /
• pp.1651-1672
• /
• 2023

In 2010, Li-Ye [13, Theorem 0.1] proved that P(ζ(z), ζ'(z), . . . , ζ^(m)(z), Γ(z), Γ'(z), Γ"(z)) ≢ 0 in ℂ, where m is a non-negative integer, and P(u₀, u₁, . . . , u_m, v₀, v₁, v₂) is any non-trivial polynomial in its arguments with coefficients in the field ℂ. Later on, Li-Ye [15, Theorem 1] proved that P(z, Γ(z), Γ'(z), . . . , Γ⁽ⁿ⁾(z), ζ(z)) ≢ 0 in z ∈ ℂ for any non-trivial distinguished polynomial P(z, u₀, u₁, . . ., u_n, v) with coefficients in a set L_δ of the zero function and a class of nonzero functions f from ℂ to ℂ ∪ {∞} (cf. [15, Definition 1]). In this paper, we prove that P(z, ζ(z), ζ'(z), . . . , ζ^(m)(z), Γ(z), Γ'(z), . . . , Γ⁽ⁿ⁾(z)) ≢ 0 in z ∈ ℂ, where m and n are two non-negative integers, and P(z, u₀, u₁, . . . , u_m, v₀, v₁, . . . , v_n) is any non-trivial polynomial in the m + n + 2 variables u₀, u₁, . . . , u_m, v₀, v₁, . . . , v_n with coefficients being meromorphic functions of order less than one, and the polynomial P(z, u₀, u₁, . . . , u_m, v₀, v₁, . . . , v_n) is a distinguished polynomial in the n + 1 variables v₀, v₁, . . . , v_n. The question studied in this paper is concerning the conjecture of Markus from [16]. The main results obtained in this paper also extend the corresponding results from Li-Ye [12] and improve the corresponding results from Chen-Wang [5] and Wang-Li-Liu-Li [23], respectively.

• 전자공학회논문지
• /
• 제53권4호
• /
• pp.59-67
• /
• 2016

각종 계량기, 웨어러블 디바이스 등의 사물에 통신기능을 내장하여 인터넷에 연결하는 사물인터넷 (Internet of Things or IoT) 기술의 발전과 함께, 이에 사용 가능한 소면적 임베디드 프로세서에 대한 수요가 증가하고 있다. 본 논문에서는 이러한 사물인터넷 분야에 사용 가능한 소면적 32-bit 파이프라인 프로세서인 Juno를 소개한다. Juno는 즉치 값 확장이 편리한 EISC (extendable instruction set computer) 구조이며, 파이프라인의 데이터 의존성을 줄이기 위해 2/3단 파이프라인 구조를 택하였다. PC (program counter) 레지스터와 두 개의 파이프라인 레지스터만을 컨트롤함으로써 전체 파이프라인을 컨트롤할 수 있는 간단한 구조의 소면적 파이프라인 컨트롤러를 갖는다. 무선 통신에 필요한 암호화 등의 연산을 수행하기 위한 $32{\times}32=64$ 곱셈 연산, 64/32=32 나눗셈 연산, $32{\times}32+64=64$ MAC 연산, 32*32=64 Galois 필드 곱셈 연산을 모두 지원하지만, 모든 연산기를 선택적으로 구현하여 필요에 따라서는 면적을 줄이기 위해 일부 연산기를 제외하고도 프로세서를 재합성할 수 있다. 이 경우 정수 코어의 gate count는 12k~22k 수준이고, 0.57 DMIPS/MHz와 1.024 Coremark/MHz의 성능을 보인다.