• Title/Summary/Keyword: pseudo-points

Search Result 101, Processing Time 0.026 seconds

AN ITERATIVE SCHEME FOR EQUILIBRIUM PROBLEMS AND FIXED POINT PROBLEMS OF ASYMPTOTICALLY k-STRICT PSEUDO-CONTRACTIVE MAPPINGS

  • Wang, Ziming;Su, Yongfu
    • Communications of the Korean Mathematical Society
    • /
    • v.25 no.1
    • /
    • pp.69-82
    • /
    • 2010
  • In this paper, we propose an iterative scheme for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of an asymptotically k-strict pseudo-contractive mapping in the setting of real Hilbert spaces. We establish some weak and strong convergence theorems of the sequences generated by our proposed scheme. Our results are more general than the known results which are given by many authors. In particular, necessary and sufficient conditions for strong convergence of our iterative scheme are obtained.

WEAK AND STRONG CONVERGENCE THEOREMS FOR AN ASYMPTOTICALLY k-STRICT PSEUDO-CONTRACTION AND A MIXED EQUILIBRIUM PROBLEM

  • Yao, Yong-Hong;Zhou, Haiyun;Liou, Yeong-Cheng
    • Journal of the Korean Mathematical Society
    • /
    • v.46 no.3
    • /
    • pp.561-576
    • /
    • 2009
  • We introduce two iterative algorithms for finding a common element of the set of fixed points of an asymptotically k-strict pseudo-contraction and the set of solutions of a mixed equilibrium problem in a Hilbert space. We obtain some weak and strong convergence theorems by using the proposed iterative algorithms. Our results extend and improve the corresponding results of Tada and Takahashi [16] and Kim and Xu [8, 9].

AVERAGE SHADOWING PROPERTIES ON COMPACT METRIC SPACES

  • Park Jong-Jin;Zhang Yong
    • Communications of the Korean Mathematical Society
    • /
    • v.21 no.2
    • /
    • pp.355-361
    • /
    • 2006
  • We prove that if a continuous surjective map f on a compact metric space X has the average shadowing property, then every point x is chain recurrent. We also show that if a homeomorphism f has more than two fixed points on $S^1$, then f does not satisfy the average shadowing property. Moreover, we construct a homeomorphism on a circle which satisfies the shadowing property but not the average shadowing property. This shows that the converse of the theorem 1.1 in [6] is not true.

ITERATIVE APPROXIMATIONS OF FIXED POINTS FOR ASYMPTOTICALLY NONEXPANSIVE MAPPINGS IN BANACH SPACES

  • Chang, S.S;Park, J.Y;Cho, Y.J
    • Bulletin of the Korean Mathematical Society
    • /
    • v.37 no.1
    • /
    • pp.109-119
    • /
    • 2000
  • The purpose of this paper is to study the iterative approximations of fixed points for asymptotically pseudo-contractive mappings and asymptotically nonexpansive mappings in Banach spaces. The results presented in this paper extend and improve the main results in Geobel-Kirk [4], Liu [5] and Schu [7].

  • PDF

A GENERAL ITERATIVE ALGORITHM COMBINING VISCOSITY METHOD WITH PARALLEL METHOD FOR MIXED EQUILIBRIUM PROBLEMS FOR A FAMILY OF STRICT PSEUDO-CONTRACTIONS

  • Jitpeera, Thanyarat;Inchan, Issara;Kumam, Poom
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.3_4
    • /
    • pp.621-639
    • /
    • 2011
  • The purpose of this paper is to introduce a general iterative process by viscosity approximation method with parallel method to ap-proximate a common element of the set of solutions of a mixed equilibrium problem and of the set of common fixed points of a finite family of $k_i$-strict pseudo-contractions in a Hilbert space. We obtain a strong convergence theorem of the proposed iterative method for a finite family of $k_i$-strict pseudo-contractions to the unique solution of variational inequality which is the optimality condition for a minimization problem under some mild conditions imposed on parameters. The results obtained in this paper improve and extend the corresponding results announced by Liu (2009), Plubtieng-Panpaeng (2007), Takahashi-Takahashi (2007), Peng et al. (2009) and some well-known results in the literature.

A Study on CRM(Center of Rotation Method) based on MST(Minimum Spanning Tree) Matching Algorithm for Fingerprint Recognition

  • Kwon, Hyoung-Ki;Lee, Jun-Ho;Ryu, Young-Kee
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.55.5-55
    • /
    • 2001
  • The MST (Minimum Spanning Tree) matching algorithm had been used for searching the part accord points extracted from the gray level fingerprint image. The method, however, had some limitations. To obtain the relationship between enrolled and inputted fingerprint, the MST was used to generate the tree graph that represent the unique graph for given fingerprint data. From the graph, the accord points are estimated. However, the shape of the graph highly depends on the positions of the minutiae. If there are some pseudo minutiae caused by noise, the shape of the graph will be different In this paper, to overcome the limitations of the MST, we proposed CRM (Center of Rotation Method) algorithm that found the true part accord points. The proposed method is based on the assumption ...

  • PDF

Test Time Reduction for BIST by Parallel Divide-and-Conquer Method (분할 및 병렬 처리 방법에 의한 BIST의 테스트 시간 감소)

  • Choe, Byeong-Gu;Kim, Dong-Uk
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.49 no.6
    • /
    • pp.322-329
    • /
    • 2000
  • BIST(Built-in Self Test) has been considered as the most promising DFT(design-for-test) scheme for the present and future test strategy. The most serious problem in applying BIST(Built-in Self Test) into a large circuit is the excessive increase in test time. This paper is focused on this problem. We proposed a new BIST construction scheme which uses a parallel divide-and-conquer method. The circuit division is performed with respect to some internal nodes called test points. The test points are selected by considering the nodal connectivity of the circuit rather than the testability of each node. The test patterns are generated by only one linear feedback shift register(LFSR) and they are shared by all the divided circuits. Thus, the test for each divided circuit is performed in parallel. Test responses are collected from the test point as well as the primary outputs. Even though the divide-and-conquer scheme is used and test patterns are generated in one LFSR, the proposed scheme does not lose its pseudo-exhaustive property. We proposed a selection procedure to find the test points and it was implemented with C/C++ language. Several example circuits were applied to this procedure and the results showed that test time was reduced upto 1/2151 but the increase in the hardware overhead or the delay increase was not much high. Because the proposed scheme showed a tendency that the increasing rates in hardware overhead and delay overhead were less than that in test time reduction as the size of circuit increases, it is expected to be used efficiently for large circuits as VLSI and ULSI.

  • PDF

Use Impacts on Environmental Deteriorations of Trail and Campsite in Tokyusan National Park (덕유산 국립공원 등산로 및 야영장의. 환경훼손에 대한 이용영향)

  • 권태호;오구균;이준우
    • Korean Journal of Environment and Ecology
    • /
    • v.7 no.2
    • /
    • pp.241-251
    • /
    • 1994
  • Use impacts on environmental deteriorations were studied on the four major trails and a campsite of Tokyuksan National Park in 1993. The entire width, bare width, maximum depth and slope of trail as the trail condition were significantly greater on the more heavily used trail. Percentages of rock-exposed, deepening, root-exposed points as the deterioration types of trail which were surveyed at the total of 106 points were higher and trail conditions were significantly different from those of non-deteriorated points. On the Paekryon trail, the damaged area more severe than Class 4 reaches about 910$m^2$/km and the use impact and deterioration on campsites were accelerated. The dominant trees of the the upper and lower layer in trail edge vegetation could be Quercus serrata and Acer pseudo-sieboldianum for Paekryon trail, Q. mongolica and Tripterigium regelii for the other trails. A. pseudo-sieboldianum, Q. serrata, Rhus trichocarpa, Fraxinus sieboldiana, Lespedeza maximowiczii, Symplocos chinensis for Pilosa were classified for tolerant species to use impacts.

  • PDF

A STUDY ON κ-AP, κ-WAP SPACES AND THEIR RELATED SPACES

  • Cho, Myung Hyun;Kim, Junhui
    • Honam Mathematical Journal
    • /
    • v.39 no.4
    • /
    • pp.655-663
    • /
    • 2017
  • In this paper we define $AP_c$ and $AP_{cc}$ spaces which are stronger than the property of approximation by points(AP). We investigate operations on their subspaces and study function theorems on $AP_c$ and $AP_{cc}$ spaces. Using those results, we prove that every continuous image of a countably compact Hausdorff space with AP is AP. Finally, we prove a theorem that every compact ${\kappa}$-WAP space is ${\kappa}$-pseudoradial, and prove a theorem that the product of a compact ${\kappa}$-radial space and a compact ${\kappa}$-WAP space is a ${\kappa}$-WAP space.

A Study on Pseudo DC Discharging Electronic Bal lasts for Fluorescent Lamp (의사 DC 방전용 형광등 전자 안정기에 관한 연구)

  • 이범익;정화진;지철근
    • Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
    • /
    • 1992.11a
    • /
    • pp.11-15
    • /
    • 1992
  • Currently-using low-pressure lamps are usually drivel by the AC power supply. There are good and bad points according to high or low frequency in AC power driving type. For the low-pressure lamps, its efficiency increases and flicker decreases when it ignites at high frequency. So we already use the high-frequency electronic ballast of the low-pressure discharge lamps broadly. But there are EMI interference in high-frequency driving type because of giving the fluorescent lamp the high- frequency current. So recently, we have a tendency to compensate for that defects by DC driving method. As follows, we suggest pseudo DC discharging electronic bar lasts for fluorescent lamps which have the characteristics of high efficiency and no flicker by driving constant current boosted square wave.

  • PDF