• Title/Summary/Keyword: Relaxed

Search Result 831, Processing Time 0.028 seconds

A Parallel Algorithm for Merging Relaxed Min-Max Heaps (Relaxed min-max 힙을 병합하는 병렬 알고리즘)

  • Min, Yong-Sik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.5
    • /
    • pp.1162-1171
    • /
    • 1998
  • This paper presents a data structure that implements a mergable double-ended priority queue : namely an improved relaxed min-max-pair heap. By means of this new data structure, we suggest a parallel algorithm to merge priority queues organized in two relaxed heaps of different sizes, n and k, respectively. This new data-structure eliminates the blossomed tree and the lazying method used to merge the relaxed min-max heaps in [9]. As a result, employing max($2^{i-1}$,[(m+1/4)]) processors, this algorithm requires O(log(log(n/k))${\times}$log(n)) time. Also, on the MarPar machine, this method achieves a 35.205-fold speedup with 64 processors to merge 8 million data items which consist of two relaxed min-max heaps of different sizes.

  • PDF

Merging Algorithm for Relaxed Min-Max Heaps Relaxed min-max 힙에 대한 병합 알고리즙

  • Min, Yong-Sik
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.1E
    • /
    • pp.73-82
    • /
    • 1995
  • This paper presents a data structure that implements a mergeable double-ended priority queue ; namely, an improved relaxed min-max-pair heap. It suggests a sequential algorithm to merge priority queues organized in two relaxed min-max heaps : kheap and nheap of sizes k and n, respecrively. This new data sturuture eliminates the blossomed tree and the lazying method used to merge the relaxed min-max heaps in [8]. As a result, the suggested method in this paper requires the time complexity of O(log(log(n/k))*log(k)) and the space complexity of O(n+), assuming that $k{\leq}{\lfloor}log(size(nheap)){\rfloor}$ are in two heaps of different sizes.

  • PDF

WEAKLY RELAXED $\alpha$-SEMI-PSEUDOMONOTONE SET- VALUED VARIATIONAL-LIKE INEQUALITIES

  • Lee, Byung-Soo;Lee, Bok-Doo
    • The Pure and Applied Mathematics
    • /
    • v.11 no.3
    • /
    • pp.231-242
    • /
    • 2004
  • In this paper, we introduce weakly relaxed $\alpha$-pseudomonotonicity and weakly relaxed $\alpha$-semi-pseudomonotonicity of set-valued maps. Using the KKM technique, we obtain existence of solutions to the variational-like inequalities with weakly relaxed $\alpha$-pseudomor.otone set-valued maps in reflexive Banach spaces. We also present the solvability of the variational-like inequalities with weakly relaxed $\alpha$-semi-pseudomonotone set-valued maps in arbitrary Banach spaces using Kakutani-Fan-Glicksberg fixed point theorem.

  • PDF

RELAXED PROXIMAL POINT ALGORITHMS BASED ON A-AXIMAL RELAXED MONOTONICITY FRAMEWORKS WITH APPLICATIONS

  • Agarwal, Ravi P.;Verma, Ram U.
    • East Asian mathematical journal
    • /
    • v.27 no.5
    • /
    • pp.545-555
    • /
    • 2011
  • Based on the A-maximal(m)-relaxed monotonicity frameworks, the approximation solvability of a general class of variational inclusion problems using the relaxed proximal point algorithm is explored, while generalizing most of the investigations, especially of Xu (2002) on strong convergence of modified version of the relaxed proximal point algorithm, Eckstein and Bertsekas (1992) on weak convergence using the relaxed proximal point algorithm to the context of the Douglas-Rachford splitting method, and Rockafellar (1976) on weak as well as strong convergence results on proximal point algorithms in real Hilbert space settings. Furthermore, the main result has been applied to the context of the H-maximal monotonicity frameworks for solving a general class of variational inclusion problems. It seems the obtained results can be used to generalize the Yosida approximation that, in turn, can be applied to first- order evolution inclusions, and can also be applied to Douglas-Rachford splitting methods for finding the zero of the sum of two A-maximal (m)-relaxed monotone mappings.

Relaxed multisplitting and relaxed nonstationary two-stage multisplitting methods

  • 윤재헌
    • Proceedings of the Korean Society of Computational and Applied Mathematics Conference
    • /
    • 2003.09a
    • /
    • pp.5.1-5
    • /
    • 2003
  • In this paper, we study the convergence of relaxed multisplitting and relaxed nonstationary two-stage multisplitting methods associated with a multisplitting which is obtained from the ILU factorizations for solving a linear system whose coefficient matrix is an H-matrix. Also, parallel performance results of relaxed nonstaionary two-stage multisplitting method using ILU factorizations as inner splittings on the IBM p690 supercomputer are provided to analyze theoretical results.

  • PDF

Auditory impulse by Relaxed on Heart rate Pattern Guidance (청각 자극에 의한 안정화된 심박 패턴 유도)

  • Kim, Jea-Kyung;Park, Min-Ho;Jang, Gye-Sun;Jeong, Chan-Soon;Ko, Il-Ju
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.158-162
    • /
    • 2008
  • Heart rate has many effect by environment factor and body factor and mind factor. Experimental testing decide to make relaxed condition. so It want to get correct data peoples different time and condition in the day so medical mans think relaxed to low Heart rate. but normal heart different from peoples and time. there was noting standard. so Heart rate is really hard to relaxed heart rate. Heart rate pattern must have long time analysis for good result. if you get relaxed heart rate so you don't need long-time analysis. Relaxed heart pattern used for guidance of auditory impulse public got concentration and solve to stress. it chose MC Square and mozart music. Two kind of auditory impulse analysis to make a relaxed Heart rate and relaxed pattern. way of analysis is HRV and minute of heart bit rate. result It have find Guidance to Relaxed Heart rate.

  • PDF

THE CORES OF PAIRED-DOMINATION GAMES

  • KIM, HYE KYUNG
    • East Asian mathematical journal
    • /
    • v.31 no.5
    • /
    • pp.717-725
    • /
    • 2015
  • Velzen introduced the rigid and relaxed dominating set games and showed that the rigid game being balanced is equivalent to the relaxed game being balanced in 2004. After then various variants of dominating set games were introduced and it was shown that for each variant, a rigid game being balanced is equivalent to a relaxed game being balanced. It is natural to ask if for any other variant of dominating set game, the balancedness of a rigid game and the balancedness of a relaxed game are equivalent. In this paper, we show that the answer for the question is negative by considering the rigid and relaxed paired-domination games, which is considered as a variant of dominating set games. We characterize the cores of both games and show that the rigid game being balanced is not equivalent to the relaxed game being balanced. In addition, we study the cores of paired-dominations games on paths and cycles.

A Study on the Estimation of Stress Relaxed Zone around a Tunnel Periphery for the Design of 2-Arch Tunnel Lining (2-ARCH 터널의 라이닝 설계를 위한 터널굴착주변 응력이완 영역산정에 관한 연구)

  • You, Kwang-Ho
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.7 no.4
    • /
    • pp.343-352
    • /
    • 2005
  • In this study, the existing methods proposed to estimate the relaxed load due to a tunnel excavation are compared and analyzed. Also a new approach, by which the stress relaxed zone around an excavated tunnel periphery can be systematically estimated, was suggested for the design of 2-arch tunnel lining. To this end, local factors of safety are calculated from the redistributed stresses after the excavation of a tunnel. The height of the relaxed load is inferred based on the assumption that the stress relaxed zone might coincide with the region corresponding to the local safety factor of 2.0 or 3.0. The new approach proposed in this study has the advantage of estimating the height of the relaxed load independent of the shape of a tunnel and the ground conditions, Since the height of the relaxed load is estimated according to the local factor of safety, which is a relatively clear criterion, the designer's subjectivity involved in the design of concrete tunnel lining might be reduced.

  • PDF

CONVERGENCE OF RELAXED TWO-STAGE MULTISPLITTING METHOD USING AN OUTER SPLITTING

  • Yun, Jae-Heon
    • Bulletin of the Korean Mathematical Society
    • /
    • v.47 no.4
    • /
    • pp.727-741
    • /
    • 2010
  • In this paper, we study the convergence of relaxed two-stage multisplitting method using H-compatible splittings or SOR multisplitting as inner splittings and an outer splitting for solving a linear system whose coefficient matrix is an H-matrix. We also provide numerical experiments for the convergence of the relaxed two-stage multisplitting method.

CONVERGENCE OF RELAXED TWO-STAGE MULTISPLITTING METHOD USING M-SPLITTINGS OR SOR MULTISPLITTING

  • Oh, Se-Young;Yun, Jae-Heon
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.3_4
    • /
    • pp.489-500
    • /
    • 2009
  • In this paper, we study the convergence of relaxed two-stage multisplitting method using M-splittings or SOR multi splitting as inner splittings and an outer splitting for solving a linear system whose coefficient matrix is an M-matrix. We also provide numerical experiments for the convergence of the relaxed two-stage multisplitting method.

  • PDF