• Journal of the Optical Society of Korea
• /
• v.20 no.1
• /
• pp.42-54
• /
• 2016

A hybrid color and grayscale images encryption scheme based on the quaternion Hartley transform (QHT), the two-dimensional (2D) logistic map, the double random phase encoding (DRPE) in gyrator transform (GT) domain and the three-step phase-shifting interferometry (PSI) is presented. First, we propose a new color image processing tool termed as the quaternion Hartley transform, and we develop an efficient method to calculate the QHT of a quaternion matrix. In the presented encryption scheme, the original color and grayscale images are represented by quaternion algebra and processed holistically in a vector manner using QHT. To enhance the security level, a 2D logistic map-based scrambling technique is designed to permute the complex amplitude, which is formed by the components of the QHT-transformed original images. Subsequently, the scrambled data is encoded by the GT-based DRPE system. For the convenience of storage and transmission, the resulting encrypted signal is recorded as the real-valued interferograms using three-step PSI. The parameters of the scrambling method, the GT orders and the two random phase masks form the keys for decryption of the secret images. Simulation results demonstrate that the proposed scheme has high security level and certain robustness against data loss, noise disturbance and some attacks such as chosen plaintext attack.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.4
• /
• pp.1600-1604
• /
• 2017

A new Complex Image Method based on Genetic Algorithm (GA) is proposed to calculate the Green's functions of CPW (coplanar waveguide)-type microwave components and antennas. The closed-forms of the spectral-domain integrals are obtained by the GA, avoiding the conventional procedures of the tedious linear algebra and the sampling conditions sensitive to the complex-variable sampling paths adopted in the Prony's and GPOF methods. The proposed method is compared with the numerical Sommerfeld Integral, which results in good agreement.

• Kyungpook Mathematical Journal
• /
• v.50 no.1
• /
• pp.1-5
• /
• 2010

Let P be a prime ideal of a commutative unital ring R; X an indeterminate; D := R/P; L the quotient field of D; F an algebraic closure of L; ${\alpha}$ ${\in}$ L[X] a monic irreducible polynomial; ${\xi}$ any root of in F; and Q = ${\alpha}$>, the upper to P with respect to ${\alpha}$. Then R[X]/Q is R-algebra isomorphic to $D[{\xi}]$; and is R-isomorphic to an overring of D if and only if deg(${\alpha}$) = 1.

• Journal of Educational Research in Mathematics
• /
• v.10 no.1
• /
• pp.85-102
• /
• 2000

The concept of variables is central to mathematics teaching and learning in junior and senior high school. Understanding the concept provides the basis for the transition from arithmetic to algebra and necessary for the meaningful use of all advanced mathematics. Despite the importance of the concept, however, much has been written in the last decade concerning students' difficulties with the concept. This Thesis is based on research to investigate the hypothesis that LOGO programming will contribute to 6th grader' learning of variables. The aim of the research were to; .investigate practice on pupils' understanding of variables before the activity with a computer; .identify functions of LOGO programming in pupils' using and understanding of variable symbols, variable domain and the relationship between two variable dependent expressions during the activity using a computer; .investigate the influence of pupils' mathematical belief on understanding and using variables. The research consisted predominantly of a case study of 6 pupils' discourse and activities concerning variable during their abnormal lessons and interviews with researcher. The data collected for this study included video recordings of the pupils'work with their spoken language.

• Bulletin of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.65-70
• /
• 1993

In this paper we will extend some notions of bounded linear operators to some unbounded linear operators. Let H be a complex separable Hilbert space and let B(H) denote the algebra of bounded linear operators. A closed densely defind linear operator S in H, with domain domS, is called subnormal if there is a Hilbert space K containing H and a normal operator N in K(i.e., $N^{*}$N=N $N^*/)such that domS .subeq. domN and Sf=Nf for f .mem. domS. we will show that the Radjavi and Rosenthal theorem holds for some unbounded subnormal operators; if $S_{1}$ and $S_{2}$ are unbounded subnormal operators on H with dom $S_{1}$= dom $S^{*}$$_{1}$ and dom $S_{2}$=dom $S^{*}$$_{2}$ and A .mem. B(H) is injective, has dense range and $S_{1}$A .coneq. A $S^{*}$$_{2}$, then $S_{1}$ and $S_{2}$ are normal and $S_{1}$.iden. $S^{*}$$_{2}$.2}$.X>.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.11-20
• /
• 1999

Because conventional spatial databases process the spatial information that is valid at current time, it is difficult to manage historical information efficiently which has been changed from the past to current. Recently, there are rapid increasing of interest to solve this problem so that makes databases to support historical information as well as spatial management at the same time. It can be eventually used in a various application areas. The formal semantics in a database is used to represent database structures and operations in order to prove the correctiveness of them in terms or mathematics. It also plays an important role in database to design a database and database management system. So in this paper, we suggest spatiotemporal domain, object, data, and spatiotemporal geometric/topological operations. And we not only formalize relational algebra/calculus using formal semantics for a spatiotemporal data model, but also show the example of real orld with them.

• School Mathematics
• /
• v.9 no.2
• /
• pp.223-240
• /
• 2007

The purpose of this study was to investigate the degree to which the middle school mathematics curriculum matched the item difficulty levels of representative mathematics items. The items used in this study were developed for the National Assessment of Educational Achievement. Ranks for difficulty values of the 60 multiple-choice item were calculated via both Classical Test Theory and Item Response Theory and correlated with the rank order of the mathematics content and cognitive domains sequence. There are six content domains; number and operation, algebra, measurement, figure, pattern and function, and probability and statistics. The cognitive domains include computation, understanding, reasoning and problem-solving. Results suggest a congruence between cognitive domain's sequence and item difficulty levels of items based on that sequence. This finding indicates that the linear or hierarchical assumptions concerning the sequence appears to be reasonable. The characteristics of items that were exceptions to this trend were addressed.

• Journal of Computing Science and Engineering
• /
• v.7 no.1
• /
• pp.1-20
• /
• 2013

Over the past generation, data warehousing and online analytical processing (OLAP) applications have become the cornerstone of contemporary decision support environments. Typically, OLAP servers are implemented on top of either proprietary array-based storage engines (MOLAP) or as extensions to conventional relational DBMSs (ROLAP). While MOLAP systems do indeed provide impressive performance on common analytics queries, they tend to have limited scalability. Conversely, ROLAP's table oriented model scales quite nicely, but offers mediocre performance at best relative to the MOLAP systems. In this paper, we describe a storage and indexing framework that aims to provide both MOLAP like performance and ROLAP like scalability by essentially combining some of the best features from both. Based upon a combination of R-trees and bitmap indexes, the storage engine has been integrated with a robust OLAP query engine prototype that is able to fully exploit the efficiency of the proposed storage model. Specifically, it utilizes an OLAP algebra coupled with a domain specific query optimizer, to map user queries directly to the storage and indexing framework. Experimental results demonstrate that not only does the design improve upon more naive approaches, but that it does indeed offer the potential to optimize both query performance and scalability.

• Communications of the Korean Mathematical Society
• /
• v.35 no.4
• /
• pp.1095-1106
• /
• 2020

The purpose of this paper is to introduce a new class of rings that is closely related to the class of pseudo-Krull domains. Let 𝓗 = {R | R is a commutative ring and Nil(R) is a divided prime ideal of R}. Let R ∈ 𝓗 be a ring with total quotient ring T(R) and define 𝜙 : T(R) → R_Nil(R) by ${\phi}({\frac{a}{b}})={\frac{a}{b}}$ for any a ∈ R and any regular element b of R. Then 𝜙 is a ring homomorphism from T(R) into R_Nil(R) and 𝜙 restricted to R is also a ring homomorphism from R into R_Nil(R) given by ${\phi}(x)={\frac{x}{1}}$ for every x ∈ R. We say that R is a 𝜙-pseudo-Krull ring if 𝜙(R) = ∩ R_i, where each R_i is a nonnil-Noetherian 𝜙-pseudo valuation overring of 𝜙(R) and for every non-nilpotent element x ∈ R, 𝜙(x) is a unit in all but finitely many R_i. We show that the theories of 𝜙-pseudo Krull rings resemble those of pseudo-Krull domains.

• Journal of the Optical Society of Korea
• /
• v.20 no.3
• /
• pp.341-357
• /
• 2016

A novel asymmetric multiple-image encryption method using an octonion Fresnel transform (OFST) and a two-dimensional Sine Logistic modulation map (2D-SLMM) is presented. First, a new multiple-image information processing tool termed the octonion Fresneltransform is proposed, and then an efficient method to calculate the OFST of an octonion matrix is developed. Subsequently this tool is applied to process multiple plaintext images, which are represented by octonion algebra, holistically in a vector manner. The complex amplitude, formed from the components of the OFST-transformed original images and modulated by a random phase mask (RPM), is used to derive the ciphertext image by employing an amplitude- and phase-truncation approach in the Fresnel domain. To avoid sending whole RPMs to the receiver side for decryption, a random phase mask generation method based on SLMM, in which only the initial parameters of the chaotic function are needed to generate the RPMs, is designed. To enhance security, the ciphertext and two decryption keys produced in the encryption procedure are permuted by the proposed SLMM-based scrambling method. Numerical simulations have been carried out to demonstrate the proposed scheme's validity, high security, and high resistance to various attacks.