• Journal of the Chungcheong Mathematical Society
• /
• v.30 no.2
• /
• pp.259-272
• /
• 2017

In this paper we study the mapping properties of the finite field restricted averaging operators to various algebraic varieties. We derive necessary conditions for the boundedness of the generalized restricted averaging operator related to arbitrary algebraic varieties. It is shown that the necessary conditions are in fact sufficient in the specific case when the Fourier transform on varieties has enough decay estimates. Our work extends the known optimal result on regular varieties such as paraboloids and spheres to certain lower dimensional varieties.

• Journal for History of Mathematics
• /
• v.15 no.1
• /
• pp.83-92
• /
• 2002

Gator Szego was one of the most brilliant Mathematicians. Mathematical science owes him several fundamental contributions in such fields as theory of functions of a complex variables, conformal mapping, Fourier series, theory of orthogonal polynomials, and many others. He wrote the famous Polya-Szego Problems and Theorem in Analysis which is the two volume of concentrated mathematical beauty. In this paper, we mention Szego's life, Szego's work, and Szego reproducing kernel.

• Journal of information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.183-186
• /
• 2011

In this work, we consider imperfectness of feedback channels in the adaptive transmission scheme which was previously studied with an assumption of error-free feedback channels. New method of mapping the modulation index into the feedback channel symbols and quantifying feedback error over fading channels are proposed. The presented method and results are expected to offer valuable tools for the system designer to efficiently implement adaptive diversity schemes to compensate for the performance degradation due to feedback error.

• Journal of the Korean Magnetic Resonance Society
• /
• v.2 no.2
• /
• pp.106-112
• /
• 1998

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.229-231
• /
• 2006

NLPCA(Nonlinear Principal Component Analysis) is a novel technique for multivariate data analysis, similar to the well-known method of principal component analysis. NLPCA operates by a feedforward neural network called AANN(Auto Associative Neural Network) which performs the identity mapping. In this work, a sensor fault detection system based on NLPCA is presented. To verify its applicability, simulation study on the data supplied from sensor network is executed.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.92.2-92
• /
• 2002

Building autonomous robots have been a central objective of research in artificial intelligence. The development of techniques for autonomous navigation in real environment consist one of the main tendencies of the current researches about Robotics. An important problem in autonomous navigation is the necessity of dealing with a great amount of uncertainties inherent to the real environments. The paraconsistent logic has characteristics that make it become an adequate tool to solve this problem. In this work, it is proposed a technique of mapping the real world in the navigation of an autonomous robot using the paraconsistent logic.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.265-278
• /
• 2012

In this work we have considered several common fixed point results in metric spaces for weak compatible mappings. By applications of these results we establish some fixed point theorems in fuzzy metric spaces.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.468-471
• /
• 2003

The A＊ algorithm is usually used in game programming, mainly because it is fast in finding a optimal path to goal. In this paper. This algorithm was utilized for path finding, HIMM(Histogramic In-Motion Mapping) method is used in map-building. Map is updated continuously with range data sampled by PSD sensors From the map, A＊ algorithm finds a optimal path and sends subsequently the most suitable point to the Eyebot. A＊ algorithm has been tested on the Eyebot in various unknown maps of unknown and proved to work well. It could escape the local minimum, also.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.267-268
• /
• 2007

A dynamic range compression algorithm using Markov random field (MRF) modeling to display high dynamic range (HDR) images on low dynamic range (LDR) devices is proposed in this work. The proposed algorithm separates foreground objects from the background using the edge information, and then compresses the color differences across the edges based on the MRF modeling. By minimizing a cost function using belief propagation, the proposed algorithm can provide an effective LDR image. Simulation results show that the proposed algorithm provides good results.

• Communications of the Korean Mathematical Society
• /
• v.31 no.4
• /
• pp.729-743
• /
• 2016

In the current work, the intuitionistic fuzzy version of Hyers-Ulam stability for a nonic functional equation by applying a fixed point method is investigated. This way shows that some fixed points of a suitable operator can be a nonic mapping.