• Korean Journal of Mathematics
• /
• v.21 no.2
• /
• pp.161-170
• /
• 2013

Bae and W. Park [3] proved the Hyers-Ulam stability of bi-homomorphisms and bi-derivations in $C^*$-ternary algebras. It is easy to show that the definitions of bi-homomorphisms and bi-derivations, given in [3], are meaningless. So we correct the definitions of bi-homomorphisms and bi-derivations. Under the conditions in the main theorems, we can show that the related mappings must be zero. In this paper, we correct the statements and the proofs of the results, and prove the corrected theorems.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.566-571
• /
• 1994

This paper presents in image-based visual servo control scheme for tracking a workpiece with a hand-eye coordinated robotic system using the fuzzy-neural-network. The goal is to control the relative position and orientation between the end-effector and a moving workpiece using a single camera mounted on the end-effector of robot manipulator. We developed a fuzzy-neural-network that consists of a network-model fuzzy system and supervised learning rules. Fuzzy-neural-network is applied to approximate the nonlinear mapping which transforms the features and theire change into the desired camera motion. In addition a control strategy for real-time relative motion control based on this approximation is presented. Computer simulation results are illustrated to show the effectiveness of the fuzzy-neural-network method for visual servoing of robot manipulator.

• Communications of the Korean Mathematical Society
• /
• v.27 no.1
• /
• pp.77-95
• /
• 2012

For a bounded linear operator T we prove the following assertions: (a) If T is algebraically (p, k)-quasihyponormal, then T is a-isoloid, polaroid, reguloid and a-polaroid. (b) If $T^*$ is algebraically (p, k)-quasihyponormal, then a-Weyl's theorem holds for f(T) for every $f{\in}Hol({\sigma}T))$, where $Hol({\sigma}(T))$ is the space of all functions that analytic in an open neighborhoods of ${\sigma}(T)$ of T. (c) If $T^*$ is algebraically (p, k)-quasihyponormal, then generalized a-Weyl's theorem holds for f(T) for every $f{\in}Hol({\sigma}T))$. (d) If T is a (p, k)-quasihyponormal operator, then the spectral mapping theorem holds for semi-B-essential approximate point spectrum $\sigma_{SBF_+^-}(T)$, and for left Drazin spectrum ${\sigma}_{lD}(T)$ for every $f{\in}Hol({\sigma}T))$.

• Journal of the Korean Mathematical Society
• /
• v.45 no.1
• /
• pp.29-40
• /
• 2008

In this paper, we introduce a modified three-step iteration scheme with errors for three classes of uniformly equi-continuous and asymptotically quasi-nonexpansive mappings in the framework of uniformly convex Banach spaces. We then use this scheme to approximate a common fixed point of these mappings. The results obtained in this paper extend and improve the recent ones announced by Khan, Fukhar-ud-di, Zhou, Cho, Noor and some others.

• East Asian mathematical journal
• /
• v.26 no.5
• /
• pp.671-680
• /
• 2010

A system of nonlinear variational inclusions involving general H-monotone operators in Banach spaces is introduced. Using the resolvent operator technique, we suggest an iterative algorithm for finding approximate solutions to the system of nonlinear variational inclusions, and establish the existence of solutions and convergence of the iterative algorithm for the system of nonlinear variational inclusions.

• East Asian mathematical journal
• /
• v.24 no.3
• /
• pp.305-315
• /
• 2008

The purpose of this paper is to study the existence and uniqueness of the fixed point of uniformly pseudo-contractive operator and the solution of equation with uniformly accretive operator, and to approximate the fixed point and the solution by the Mann iterative sequence in an arbitrary Banach space or an uniformly smooth Banach space respectively. The results presented in this paper show that if X is a real Banach space and A : X $\rightarrow$ X is an uniformly accretive operator and (I-A)X is bounded then A is a mapping onto X when A is continuous or $X^*$ is uniformly convex and A is demicontinuous. Consequently, the corresponding results which depend on the assumptions that the fixed point of operator and solution of the equation are in existence are improved.

• Korean Journal of Mathematics
• /
• v.27 no.2
• /
• pp.297-327
• /
• 2019

In this paper, we introduce and study a general iterative algorithm to approximate a common solution of split generalized equilibrium problem, variational inequality problem and fixed point problem for a finite family of nonexpansive mappings in real Hilbert spaces. Further, we prove a strong convergence theorem for the sequences generated by the proposed iterative scheme. Finally, we derive some consequences from our main result. The results presented in this paper extended and unify many of the previously known results in this area.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.6
• /
• pp.128-136
• /
• 1995

The problem addressed in this paper is that of the on-line computational burden of time-optimal control laws for quick, strongly nonlinear systems like revolute robots. It will be demonstrated that a large amount of off-line computation can be substituted for most of the on-line burden in cases of time optimization with constrained inputs if differential point-to- point specifications can be relaxed to cell-to-cell transitions. These cells result from a coarse discretization of likely swaths of state space into a set of nonuniform, contiguous volumes of relatively simple shapes. The cell boundaries approximate stream surfaces of the phase fluid and surfaces of equal transit times. Once the cells have been designed, the bang- bang schedules for the inputs are determined for all likely starting cells and terminating cells. The scheduling process is completed by treating all cells into which the trajectories might unex- pectedly stray as additional starting cells. Then an efficient-to-compute control law can be based on the resulting table of optimal strategies.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.103-108
• /
• 2005

The purpose of numerical analysis is to design an effective algorithm to realize some mathematical model on computer. In general the approximate value, which is obtained from computer operation, is not the same as the real value that is given by mathematical theory. Therefore the mr estimate measuring how approximate value is near to the real value, is the most significant task to evaluate the efficiency of algorithm. The limit of an error is used for mr estimation at the most case, but the exact mr evaluation could not be expected to get for there is no way to know the real value of the given problem. Wegmann's method has been researched, which is one of the solution to derive the numerical conformal mapping. We proposed an improved method for convergency by applying a low frequency filter to the Wegmann's method. In this paper we investigate error analysis based on some mathematical theory and propose an effective method which makes us able to estimate an error if the real value is not acquired. This kind of proposed method is also proved by numerical experiment.