• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.61-74
• /
• 2011

In this paper, we introduce a new iteration method based on the hybrid method in mathematical programming and the descent-like method for finding a common element of the solution set for a variational inequality and the set of common fixed points of a nonexpansive semigroup in Hilbert spaces. We obtain a strong convergence for the sequence generated by our method in Hilbert spaces. The result in this paper modifies and improves some well-known results in the literature for a more general problem.

• Journal of the Korean Mathematical Society
• /
• v.46 no.2
• /
• pp.271-279
• /
• 2009

Using an index theory for countably condensing maps, we show the existence of eigenvalues for countably k-set contractive maps and countably condensing maps in an infinite dimensional Banach space X, under certain condition that depends on the quantitative haracteristic, that is, the infimum of all $k\;{\geq}\;1$ for which there is a countably k-set-contractive retraction of the closed unit ball of X onto its boundary.

• Journal of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.187-200
• /
• 2012

In this paper, we introduced a new extended extragradient iteration algorithm for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of equilibrium problems for a monotone and Lipschitz-type continuous mapping. And we show that the iterative sequences generated by this algorithm converge strongly to the common element in a real Hilbert space.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.4
• /
• pp.721-734
• /
• 2014

The Reidemeister orbit set plays a crucial role in the Nielsen type theory of periodic orbits, much as the Reidemeister set does in Nielsen fixed point theory. Extending our work on Reidemeister orbit sets, we obtain algebraic results such as addition formulae for irreducible Reidemeister orbit sets. Similar formulae for Nielsen type irreducible essential orbit numbers are also proved for fibre preserving maps.

• Communications of the Korean Mathematical Society
• /
• v.19 no.4
• /
• pp.745-757
• /
• 2004

The Reidemeister orbit set plays a crucial role in the Nielsen type theory of periodic orbits, much as the Reidemeister set does in Nielsen fixed point theory. Let f : G $\longrightarrow$ G be an endomorphism between the fundamental group of the mapping torus. Extending Jiang and Ferrario's works on Reidemeister sets, we obtain algebraic results such as addition formulae for Reidemeister orbit sets of f relative to Reidemeister sets on suspension groups. In particular, if f is an automorphism, an similar formula for Reidemeister orbit sets of f relative to Reidemeister sets on given groups is also proved.

• Communications of the Korean Mathematical Society
• /
• v.26 no.2
• /
• pp.305-320
• /
• 2011

The relations among various types of continuity of fuzzy proper function on a fuzzy set and at fuzzy point belonging to the fuzzy set in the context of $\v{S}$ostak's I-fuzzy topological spaces are discussed. The projection maps are defined as fuzzy proper functions and their properties are proved.

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

In this paper, we propose a new modied Ishikawa iteration for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of 2-generalized hybrid mappings in a Hilbert space. Our results generalize and improve some existing results in the literature. A numerical example is given to illustrate the usability of our results.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.2
• /
• pp.521-535
• /
• 2023

In this work, some various types of Dissipativity in random dynamical systems are introduced and studied: point, compact, local, bounded and weak. Moreover, the notion of random Levinson center for compactly dissipative random dynamical systems presented and prove some essential results related with this notion.

• International Journal of CAD/CAM
• /
• v.5 no.1
• /
• pp.19-27
• /
• 2005

As three-dimensional range scanners make large point clouds a more common initial representation of real world objects, a need arises for algorithms that can efficiently process point sets. In this paper, we present a method for extracting smooth surfaces from dense point clouds. Given an unorganized set of points in space as input, our algorithm first uses principal component analysis to estimate the surface variation at each point. After defining conditions for determining the geometric compatibility of a point and a surface, we examine the points in order of increasing surface variation to find points whose neighborhoods can be closely approximated by a single surface. These neighborhoods become seed regions for region growing. The region growing step clusters points that are geometrically compatible with the approximating surface and refines the surface as the region grows to obtain the best approximation of the largest number of points. When no more points can be added to a region, the algorithm stores the extracted surface. Our algorithm works quickly with little user interaction and requires a fraction of the memory needed for a standard mesh data structure. To demonstrate its usefulness, we show results on large point clouds acquired from real-world objects.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.6 no.4
• /
• pp.234-239
• /
• 2006

In the past decade, several tools have been developed to automate the floating-point to fixed-point conversion for DSP systems. In the conversion process, a number of scaling shifts are introduced, and they inevitably alter the original code sequence. Recently, we have observed that a compiler can often be adversely affected by this alteration, and consequently fails to generate efficient machine code for its target processor. In this paper, we present an optimization technique that safely migrates scaling shifts to other places within the code so that the compiler can produce better-quality code. We consider our technique to be safe in that it does not introduce new overflows, yet preserving the original SQNR. The experiments on a commercial fixed-point DSP processor exhibit that our technique is effective enough to achieve tangible improvement on code size and speed for a set of benchmarks.