• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.488-493
• /
• 1989

In this paper, the structure of CMAC address mapping is first revisited, and the address hashing function and the random mapping is discussed in the conventional CMAC implementation. Then the effective size of CMAC memory is derived from the modulus property of the CMAC address vector, and a new hashing function for the effective memory mapping is proposed for a CMAC implementation with feasible memory size and no troublesome random mapping. Finally, the performance of the conventional CMAC learning algorithm and that of the proposed new CMAC scheme arc compared via simulations.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.05a
• /
• pp.438-442
• /
• 2006

Reasonably accurate estimation of the exposed population to the distinct levels of noise is essential to the efficient management of urban environmental noise. This study proposes a method of calculating the number of exposed people to industrial noise by using GIS tool and noise mapping. The exposed population of noise based on estimation of the number of people that lived in each building in urban area is compared with the one based on density of population. This study suggests the six step method that consists of gathering the fundamental data, extracting the property from the digital map, noise mapping based on the three dimensional topography, estimating population that lives in each building, merging the various results with GIS tool, and estimating exposed population to industrial noise through analyzing the noise map with GIS tools

• Journal of Mechanical Science and Technology
• /
• v.18 no.1
• /
• pp.92-105
• /
• 2004

A new algorithm for planning a collision-free path based on algebraic curve is developed and the concept of collision-free Path Space (PS) is introduced. This paper presents a Geometry Mapping (GM) based on two straight curves in which the intermediate connection point is organized in elliptic locus ($\delta$, $\theta$). The GM produces two-dimensional PS that is used to create the shortest collision-free path. The elliptic locus of intermediate connection point has a special property in that the total distance between the focus points through a point on ellipse is the same regardless of the location of the intermediate connection point on the ellipse. Since the radial distance, a, represents the total length of the path, the collision-free path can be found as the GM proceeds from $\delta$=0 (the direct path) to $\delta$=$\delta$$\_$max/(the longest path) resulting in the minimum time search. The GM of elliptic workspace (EWS) requires calculation of interference in circumferential direction only. The procedure for GM includes categorization of obstacles to .educe necessary calculation. A GM based on rectangular workspace (RWS) using Cartesian coordinate is also considered to show yet another possible GM. The transformations of PS among Circular Workspace Geometry Mapping (CWS GM) , Elliptic Workspace Geometry Mapping (EWS GM) , and Rectangular Workspace Geometry Mapping (RWS GM), are also considered. The simulations for the EWS GM on various computer systems are carried out to measure performance of algorithm and the results are presented.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.5
• /
• pp.451-460
• /
• 2004

The pilot bit pattern of W-CDMA system is used for the channel estimation and frame synchronization confirmation. This paper proposes the binary sequences for the frame synchronization for wideband code division multiple access (W-CDMA) system. We present the circuit for the generation of ideal frame synchronization property using the binary sequences called frame synchronization word(FSW). W-CDMA system uses compressed mode where up to 7 slots per one 10 msec frame are not transmitted to make measurements from another frequency without a full dual receiver terminal. It is shown that the proposed frame synchronization words also maintain the optimal frame synchronization property in the compressed mode by using the complementary mapping relationship of preferred pair. And we discuss the realization circuit for the generation of frame synchronization words by using the concept of preferred pairs, complementary mapping relationship, and maximal length sequence.

• Journal of information and communication convergence engineering
• /
• v.15 no.2
• /
• pp.97-103
• /
• 2017

Implementation of faster pairing calculation is the basis of efficient pairing-based cryptographic protocol implementation. Generally, pairing is a costly operation carried out over the extension field of degree $k{\geq}12$. But the twist property of the pairing friendly curve allows us to calculate pairing over the sub-field twisted curve, where the extension degree becomes k/d and twist degree d = 2, 3, 4, 6. The calculation cost is reduced substantially by twisting but it makes the discrete logarithm problem easier if the curve parameters are not carefully chosen. Therefore, this paper considers the most recent parameters setting presented by Barbulescu and Duquesne [1] for pairing-based cryptography; that are secure enough for 128-bit security level; to explicitly show the quartic twist (d = 4) and sextic twist (d = 6) mapping between the isomorphic rational point groups for KSS (Kachisa-Schaefer-Scott) curve of embedding degree k = 16 and k = 18, receptively. This paper also evaluates the performance enhancement of the obtained twisted mapping by comparing the elliptic curve scalar multiplications.

• Communications of the Korean Mathematical Society
• /
• v.17 no.1
• /
• pp.37-51
• /
• 2002

Let X be a reflexive Banach space with a uniformly Gateaux differentiable norm, C a nonempty bounded open subset of X, and T a continuous mapping from the closure of C into X which is locally pseudo-contractive mapping on C. We show that if the closed unit ball of X has the fixed point property for nonexpansive self-mappings and T satisfies the following condition: there exists z $\in$ C such that ∥z-T(z)∥<∥x-T(x)∥ for all x on the boundary of C, then the trajectory tlongrightarrowz$_{t}$$\in$C, t$\in$[0, 1) defined by the equation z$_{t}$ = tT(z$_{t}$)+(1-t)z is continuous and strongly converges to a fixed point of T as t longrightarrow 1￣.ow 1￣.

• The Pure and Applied Mathematics
• /
• v.26 no.3
• /
• pp.111-131
• /
• 2019

We introduce (CLRg) property for hybrid pair $F:X{\times}X{\rightarrow}2^X$ and $g:X{\rightarrow}X$. We also introduce joint common limit range (JCLR) property for two hybrid pairs $F,G:X{\times}X{\rightarrow}2^X$ and $f,g:X{\rightarrow}X$. We also establish some common coupled fixed point theorems for hybrid pair of mappings under generalized (${\psi},{\theta},{\varphi}$)-contraction on a noncomplete metric space, which is not partially ordered. It is to be noted that to find coupled coincidence point, we do not employ the condition of continuity of any mapping involved therein. As an application, we study the existence and uniqueness of the solution to an integral equation. We also give an example to demonstrate the degree of validity of our hypothesis. The results we obtain generalize, extend and improve several recent results in the existing literature.

• East Asian mathematical journal
• /
• v.24 no.1
• /
• pp.57-65
• /
• 2008

The approximate solvability of a generalized system for non-linear variational inequality in Hilbert spaces was studied, based on the convergence of projection methods. But little research was done in Banach space. The primary reason was that projection mapping lacked preferably property in Banach space. In this paper, we introduced the generalized projection methods. By using these methods, the results presented in this paper extended the main results of S. S. Chang [3] from Hilbert spaces to Banach space.

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

In this paper, we consider the convergence of the shrinking projection method for quasi-$\phi$-nonexpansive mappings. Strong convergence theorems are established in a uniformly smooth and strictly convex Banach space which enjoys the Kadec-Klee property.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.4
• /
• pp.673-688
• /
• 2011

Let $n{\geq}2$ be an even integer. We investigate that if an odd mapping f : X ${\rightarrow}$ Y satisfies the following equation $2_{n-2}C_{\frac{n}{2}-1}rf\(\sum\limits^n_{j=1}{\frac{x_j}{r}}\)\;+\;{\sum\limits_{i_k{\in}\{0,1\} \atop {{\sum}^n_{k=1}\;i_k={\frac{n}{2}}}}\;rf\(\sum\limits^n_{i=1}(-1)^{i_k}{\frac{x_i}{r}}\)=2_{n-2}C_{{\frac{n}{2}}-1}\sum\limits^n_{i=1}f(x_i),$ then f : X ${\rightarrow}$ Y is additive, where $r{\in}R$. We also prove the stability in normed group by using shadowing property and the Hyers-Ulam stability of the functional equation in Banach spaces and in Banach modules over unital C-algebras. As an application, we show that every almost linear bijection h : A ${\rightarrow}$ B of unital $C^*$-algebras A and B is a $C^*$-algebra isomorphism when $h(\frac{2^s}{r^s}uy)=h(\frac{2^s}{r^s}u)h(y)$ for all unitaries u ${\in}$ A, all y ${\in}$ A, and s = 0, 1, 2,....