• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.813-823
• /
• 2013

In this paper, a new iterative algorithm involving quasi-nonexpansive mapping in Hilbert space is proposed and proved to be strongly convergent to a point which is simultaneously a fixed point of a quasi-nonexpansive mapping, a solution of an equilibrium problem and the set of solutions of a variational inequality problem. The results of the paper extend previous results, see, for instance, Takahashi and Takahashi (J Math Anal Appl 331:506-515, 2007), P.E.Maing $\acute{e}$ (Computers and Mathematics with Applications, 59: 74-79,2010) and other results in this field.

• East Asian mathematical journal
• /
• v.24 no.1
• /
• pp.81-95
• /
• 2008

Let E be a uniformly convex Banach space with a uniformly $G{\hat{a}}teaux$ differentiable norm, C a nonempty closed convex subset of E, and $T\;:\;C\;{\rightarrow}\;E$ a nonexpansive mapping satisfying the weak inwardness condition. Assume that every weakly compact convex subset of E has the fixed point property. For $f\;:\;C\;{\rightarrow}\;C$ a contraction and $t\;{\in}\;(0,\;1)$, let $x_t$ be a unique fixed point of a contraction $T_t\;:\;C\;{\rightarrow}\;E$, defined by $T_tx\;=\;tf(x)\;+\;(1\;-\;t)Tx$, $x\;{\in}\;C$. It is proved that if {$x_t$} is bounded, then $x_t$ converges to a fixed point of T, which is the unique solution of certain variational inequality. Moreover, the strong convergence of other implicit and explicit iterative schemes involving the sunny nonexpansive retraction is also given in a reflexive and strictly convex Banach space with a uniformly $G{\hat{a}}teaux$ differentiable norm.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.935-950
• /
• 2012

In this paper, we introduce and study a new system of generalized set-valued quasi-variational-like inclusions with (A, ${\eta}$)-accretive mapping in Banach spaces. By using the resolvent operator associated with (A, ${\eta}$)-accretive mappings, we construct a new iterative algorithm for approximating the solution of this system of variational inclusions. We also prove the existence of solutions and the convergence of the sequences generated by the algorithm in Banach spaces. The results presented in this paper extend and improve some known results in the literature.

• Korean Journal of Mathematics
• /
• v.22 no.4
• /
• pp.633-644
• /
• 2014

We get one theorem that there exists a unique solution for the fourth order semilinear elliptic Dirichlet boundary value problem when the number 0 and the coefficient of the semilinear part belong to the same open interval made by two successive eigenvalues of the fourth order elliptic eigenvalue problem. We prove this result by the contraction mapping principle. We also get another theorem that there exist at least two solutions when there exist n eigenvalues of the fourth order elliptic eigenvalue problem between the coefficient of the semilinear part and the number 0. We prove this result by the critical point theory and the variation of linking method.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.612-620
• /
• 2011

Recently, one of the problems with the Internet is the issue of scalability. To this end, locator/identifier separation protocol (LISP), which separates end-system identifiers and routing locators, has been proposed as a solution. In the LISP deployed network, the ingress and egress nodes of inter-AS traffic is determined by edge router selection (ERS) and endpoint identifier-routing locator mapping assignment (ERMA). In this paper, joint optimizations of ERS and ERMA for stub networks with and without predetermined link weights are studied and the mixed integer linear programming (MILP) formulations for the problems are given. To make the problem with optimizable link weights tractable, a revised local search algorithm is also proposed. Simulation results show that joint optimization of ERS and ERMA enables better network performance.

• East Asian mathematical journal
• /
• v.26 no.1
• /
• pp.25-38
• /
• 2010

In this paper, we introduce a hybrid iterative method for finding a common element of the set of solutions of a mixed equilibrium problem, the set of common mixed points of finitely many nonexpansive mappings and the set of solutions of the variational inequality for an inverse strongly monotone mapping in a Hilbert space. We show that the iterative sequences converge strongly to a common element of the three sets. The results extended and improved the corresponding results of L.-C.Ceng and J.-C.Yao.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2001.05a
• /
• pp.232-236
• /
• 2001

In this paper, we consider the problem of estimation of average radar cross section (RCS) for Swerling 1 fluctuation model, based on the maximum likelihood (ML) estimation method. In a mathematical development we take into account the event that target strength is lower than detection threshold, or the target is not detected. Our ML estimation for the SWR uses the score function that is the joint probability-pdf of the events and random variables. The solution to the ML estimation reduces to an expression in the from of a contraction mapping. The computational efficiency of the contraction mapping theorem is significant in computing the ML estimation as compared with other root-finding algorithms fur most radar tracking conditions.

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

The goal of a distributed simulation such as battle field simulation is to combine all kinds of simulations in the same synthetic environment and to make people interact at the same time. It is a key issue to share the same synthetic environment among simulations. To support reusability and affordability in the modeling and simulation area, DMSO(Defense Modeling and Simulation Office) of USA developed concepts such as HLA(High Level Architecture) and SEDRIS (Synthetic Environmental Data Representation and Interchange Specification). In the industrial simulation area, the digital manufacturing is the main stream. To reduce cost and to reuse simulation environment, the standardization becomes the focus of digital manufacturing. This study proposes to use SEDRIS to improve interoperability of manufacturing data. The simulation data of DELMIA, which is a leading commercial digital manufacturing solution, is mapped and translated into the SEDRIS transmittal format. Mapping of the manufacturing simulation data and the synthetic environment are implemented and verified through experiments.

• Kyungpook Mathematical Journal
• /
• v.53 no.3
• /
• pp.307-318
• /
• 2013

In this paper, we introduce and study a new system of variational inclusions with B-monotone operators in Banach spaces. By using the proximal mapping associated with B-monotone operator, we construct a new iterative algorithm for approximating the solution of this system of variational inclusions. We also prove the existence of solutions and the convergence of the sequences generated by the algorithm for this system of variational inclusions. The results presented in this paper extend and improve some known results in the literature.

• Journal of Korea Multimedia Society
• /
• v.24 no.12
• /
• pp.1693-1707
• /
• 2021

The purpose of this study was to improve the experience of visiting obstetrics and gynecology of single women. After analyzing previous studies on Korean single women's perception of visiting obstetrics and gynecology, Contextual Interviews and Cultural Probes were conducted on single women in their 20s who visited obstetrics and gynecology. Based on this, personas were constructed to solidify the direction of problem solving by identifying the behavioral patterns and characteristics of single women. In this study, factors that hinder unmarried women's visits to obstetrics and gynecology and improvement measures were derived based on the information obtained using service design tools such as User Journey Mapping and Stakeholders' Map. Afterwards, a preference survey was conducted to increase the persuasiveness of the proposed method. The follow-up research task is to produce and propose the derived solution as a prototype that can be used in the actual field, and then proceed with user evaluation.