• Journal of applied mathematics & informatics
• /
• v.42 no.4
• /
• pp.749-759
• /
• 2024

In this manuscript, we formulate the notion of Ω(H, θ)-contraction on a self mapping f : W → W, this contraction based on the concept of Ω-distance mappings equipped on G-metric spaces together with the concept of H-simulation functions and the class of Θ-functions, we employ our new contraction to unify the existence and uniqueness of some new fixed point results. Moreover, we formulate a numerical example and a significant application to show the novelty of our results; our application is based on the significant idea that the solution of an equation in a certain condition is similar to the solution of a fixed point equation. We are utilizing this idea to prove that the equation, under certain conditions, not only has a solution as the Intermediate Value Theorem says but also that this solution is unique.

• Journal of Astronomy and Space Sciences
• /
• v.24 no.3
• /
• pp.203-208
• /
• 2007

We report the distance modulus of nearby dwarf elliptical galaxy NGC 147 estimated from the Tip of Red-giant Branch (TRGB) method applying to the color-magnitude diagrams and luminosity functions in the near-infrared JHK bands. Apparent magnitudes of TRGBs in each band are obtained by applying Savitzky-Golay filter to the luminosity functions, and the theoretical absolute magnitudes are estimated from Yonsei-Yale isochrones. The derived values of distance modulus to NGC 147 are $(m-M)=23.69{\pm}0.12,\;23.78{\pm}0.17,\;and\;23.85{\pm}0.22\;for\;J,\;H,\;and\;K$ bands, respectively. Distance modulus in bolometric magnitude is also derived as $(m-M)=23.87{\pm}0.11$. We compare the derived values of the TRGB distance modulus to NGC 147 in the near-infrared bands with the previous results in other bands.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.5
• /
• pp.543-554
• /
• 2000

In the conventional distance education systems, all functions for the distance education were processed by a server. Therefore, the system of high capacity was required and there were various restrictions to provide many classes in real-time simultaneously. The group-based distance education system proposed in this study reduces a load of the main server by distributing its functions to client PCs. In the group-based education system, the establishment of lecture or discussion rooms is executed by main server, but on the other hand, the functions of the conventional server are executed by a lecturer's PC or a discussion administrator's PC The test results of the system implemented in this study show that a lecturer's PC can afford to provide fifty trainees a lecture, though they depend on the specification of systems. Therefore, the proposed system in this study can afford to simultaneously provide with the various distance discussions and lectures by reducing a load concentrated to the server.

• Cartoon and Animation Studies
• /
• s.25
• /
• pp.87-108
• /
• 2011

Published comics are widely recognized as a popularity-gaining media as well as Soap opera and the movies, and it also has a established characteristic of category. However, compare to the multimedia such as the movies, soap opera and playes, the research on direction is not yet satisfactory This research mainly tries to investigate on, first, whether the theoretically classified functions do actually practice their parts or not, and else, what other additional functions should be considered, by classifying the set up of basic direction functions, angles and range, which the most-cited angle and distance notion of 'Ahn Su Cheol' in comic education field. First, although we tried to approach with the expectation of angle and distance set up that will have a high frequency of certain set ups according to the atmospheres of comics of genre, unlike the expectation, they are rather displayed depending on the personal taste of the writers. The functional aspects of angles and distance set up are the fixing that are only limited in the space of representation, and it is the set up of physical space that should come first as the function of expressing the intensity. As we investigate the characteristics of comic direction, this research will help the range of comic direction to be broadened.

• Honam Mathematical Journal
• /
• v.38 no.3
• /
• pp.553-581
• /
• 2016

The purpose of this paper is to prove some fixed point theorems in a complete metric space equipped with a partial ordering using w-distances together with the aid of an altering functions and new functions of admissible type.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.2
• /
• pp.395-405
• /
• 2023

In this manuscript, we establish the concept of 𝓗(ω, θ)-contraction which based on modified ω distance mappings which introduced by Alegre and Marin [4] in 2016 and 𝓗 simulation functions which introduced by Bataihah et.al. [14] in 2020 and we employ our contraction to prove the existence and uniqueness some new fixed point results. On the other hand, we create some examples and an application to show the importance of our results.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.4
• /
• pp.349-356
• /
• 2013

This paper presents formation control based on potential functions for unicycle robots. The unicycle robots move to formation position which is made from a reference point and neighboring robots. In the framework, a local minimum case occurred by combination of potential repulsed from neighboring robots and potential attracted from a formation line is presented, in which the robot escapes from a local minimum using a virtual escape point after recognizing trapped situation. As well, in the paper, potential functions are designed to keep the same distance between neighboring robots on a formation line, i.e. the relative distance between neighboring robots on a formation line is controlled by a potential function parameter. The simulation results show that the proposed approach can effectively construct straight line, V, and polygon formation for multiple robots.

• Journal of electromagnetic engineering and science
• /
• v.7 no.2
• /
• pp.59-63
• /
• 2007

This paper suggests a novel method to efficiently calculate the spatial-domain Green's functions of 2D electromagnetic problems Briefly speaking, this method combines spectral and spatial domain calculation schemes and prevents the Green's functions from poor convergence due to the singularities that complicate the process of the Method of Moment(MoM) applications For the validation of this proposed method, fields will be evaluated along the spatial distance including zero distance for 2D free-space and periodic homogeneous geometry The numerical results show the validity of the prosed method and correspondng physics.

• Proceedings of the KIEE Conference
• /
• 2006.10a
• /
• pp.133-134
• /
• 2006

In this paper, a novel method is presented for efficient calculation of the spatial-domain Green's functions of 2D electromagnetic problems. This method combines spectral and spatial domain calculation schemes and prevents the Green's functions from diverging at the singularities that complicate the process of the Method of Moment(MoM) application. For the validation of this proposed method, fields will be evaluated along the spatial distance including zero distance for 2D free-space and periodic homogeneous geometry. The numerical results show the validity of the prosed method and correspondng physics.

• Journal of the Chungcheong Mathematical Society
• /
• v.17 no.1
• /
• pp.47-56
• /
• 2004

The nonlinearity of a Boolean function f on $GF(2)^n$ is the minimum hamming distance between f and all affine functions on $GF(2)^n$ and it measures the ability of a cryptographic system using the functions to resist against being expressed as a set of linear equations. Finding out the exact value of the nonlinearity of given Boolean functions is not an easy problem therefore one wants to estimate the nonlinearity using extra information on given functions, or wants to find a lower bound or an upper bound on the nonlinearity. In this paper we extend the notion of auto-correlations of Boolean functions to vector Boolean functions and obtain upper bounds and a lower bound on the nonlinearity of vector Boolean functions in the context of their auto-correlations. Also we can describe avalanche characteristics of vector Boolean functions by examining the extended notion of auto-correlations.