• Korean Journal of Mathematics
• /
• v.31 no.3
• /
• pp.363-372
• /
• 2023

In this paper, we consider two functional equations: (1) h(𝓕(x, y, z) + 2x + y + z) + h(xy + z) + yh(x) + yh(z) = h(𝓕(x, y, z) + 2x + y) + h(xy) + yh(x + z) + 2h(z), (2) h(𝓕(x, y, z) - y + z + 2e) + 2h(x + y) + h(xy + z) + yh(x) + yh(z) = h(𝓕(x, y, z) - y + 2e) + 2h(x + y + z) + h(xy) + yh(x + z), without any regularity assumption for all x, y, z in a unital algebra A, where 𝓕 : A³ → A is defined by 𝓕(x, y, z) := h(x + y + z) - h(x + y) - h(z) for all x, y, z ∈ A. Also, we find general solutions of these equations in unital algebras. Finally, we prove the Hyers-Ulam stability of (1) and (2) in unital Banach algebras.

• Journal of Advanced Navigation Technology
• /
• v.10 no.1
• /
• pp.20-25
• /
• 2006

In these days, OFDM(Orthogonal Frequency Division Multiplexing) is adopted to support high-speed data communication based on multi-path RF channel, but it has some weak point. One of those is that it has a higher PAR(peak-to-average power ratio) compared with single-carrier method. If some PAR of the transmitted signal is high, nonlinear amplitude distortion has occurred when it pass through the HPA(high power amplifier). There is a solution to prevent nonlinear distortion using higher peak power HPA, but it makes inefficiency and a cost problem. In this paper, we choose the SLM(Selected Mapping) scheme, which transmit the lowest PAR signal after OFDM symbol mapping, in various schemes reducing PAR for OFDM system. And we derived the performances of SLM method in fading channel through computer simulations.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.23 no.6
• /
• pp.703-712
• /
• 1999

This paper suggests an automatic elliptic grid generation method that is well-suited for the numerical mapping of complex geometries which are easily obtained from general CAD programs. An LBLADI solver is used for the governing mapping equations to have the strong diagonal dominance. The full boundary control method is adopted to determine the control functions of the equations, which allows the control of the grid regarding spacing and angle control at all boundary surfaces. The solution method presented here provides the capability of mapping very complicated geometries by defining grid point locations only along the boundaries. In the automated elliptic grid generation procedure, it is showed that strong diagonal dominance is essential to achieve successful mapping irrespective of the initial grid condition provided. To demonstrate the robustness of this method, it is applied to the thermal flow like the natural convection between eccentric cylinders. The results agree well with others.

• Journal of the Korea Society for Simulation
• /
• v.14 no.2
• /
• pp.93-103
• /
• 2005

This paper presents characteristics of a virtual human's navigation using a limited perception-based mapping. Previous approaches to virtual human navigation have used an omniscient perception requiring full layout of a virtual environment in advance. However, these approaches have a limitation on being a fundamental solution for a human-likeness of a virtual human, because behaviors of humans are basically based on their limited perception instead of omniscient perception. In this paper, we integrated Hill's mapping algorithm with a virtual human to experiment virtual human's navigation with the limited perception. This approach does not require full layout of the virtual environment, 360-degree's field of view, and vision through walls. In addition to static objects such as buildings, we consider enemy emergence that can affect an virtual human's navigation. The enemy emergence is used as the variable on the experiment of this present research. As the number of enemies varies, the changes in arrival rate and time taken to reach the goal position were observed. The virtual human navigates by two conditions. One is to take the shortest path to the goal position, and the other is to avoid enemies when the virtual human encounters them. The acquired result indicates that the virtual human's navigation corresponds to a human cognitive process, and thus this research can be a framework for human-likeness of virtual humans.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2311-2319
• /
• 1999

We present two heuristic algorithms for the task allocation problem (NP-complete problem) in parallel computing. The problem is to find an optimal mapping of multiple communicating tasks of a parallel program onto the multiple processing nodes of a distributed-memory multicomputer. The purpose of mapping these tasks into the nodes of the target architecture is the minimization of parallel execution time without sacrificing solution quality. Many heuristic approaches have been employed to obtain satisfactory mapping. Our heuristics are based on genetic algorithms and simulated annealing. We formulate an objective function as a total computational cost for a mapping configuration, and evaluate the performance of our heuristic algorithms. We compare the quality of solutions and times derived by the random, greedy, genetic, and annealing algorithms. Our experimental findings from a simulation study of the allocation algorithms are presented.

• Journal of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.567-586
• /
• 2015

In this paper, we study optimal control problems for parabolic hemivariational inequalities of dynamic elasticity and investigate the continuity of the solution mapping from the given initial value and control data to trajectories. We show the existence of an optimal control which minimizes the quadratic cost function and establish the necessary conditions of optimality of an optimal control for various observation cases.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.155-159
• /
• 1993

In this paper, we consider the problem of a stochastic optimal switching control, which can be applied to the control of a system with uncertain demand such as a control problem of a power plant. The dynamic programming method is applied for the formulation of the optimal control problem. We solve the system of Quasi-Variational Inequalities(QVI) using an algoritlim which involves the finite difference approximation and contraction mapping method. A mathematical example of the optimal switching control is constructed. The actual performance of the algorithm is also tested through the solution of the constructed example.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.22 no.1
• /
• pp.100-106
• /
• 2013

This paper describes an integrated optimization design using multilevel decomposition technique on the base of the parametric distribution and independent axiom at the stages of lower level. Based on Pareto optimum solution, the detailed parameters at the lower level can be defined into the independent axiom. The suspension design is used as the simulation example.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.499-507
• /
• 2006

In this paper, we obtain the general solution and the stability of the hi-Jensen functional equation $$4f(\frac {x+y} 2,\;\frac {z+w} 2)=f(x,\;z)+f(x,\;w)+f(y,\;z)+f(y,\;w)$$.

• Communications of the Korean Mathematical Society
• /
• v.28 no.1
• /
• pp.191-207
• /
• 2013

In this paper, we introduce the shrinking projection method for hemi-relatively nonexpansive mappings to find a common solution of variational inequality problems and equilibrium problems in uniformly convex and uniformly smooth Banach spaces and prove some strong convergence theorems to the common solution by using the proposed method.