• Title/Summary/Keyword: Moore

Search Result 338, Processing Time 0.027 seconds

CERTAIN SUBGROUPS OF SELF-HOMOTOPY EQUIVALENCES OF THE WEDGE OF TWO MOORE SPACES

  • Jeong, Myung-Hwa
    • Communications of the Korean Mathematical Society
    • /
    • v.25 no.1
    • /
    • pp.111-117
    • /
    • 2010
  • For a based, 1-connected, finite CW-complex X, we denote by $\varepsilon(X)$ the group of homotopy classes of self-homotopy equivalences of X and by $\varepsilon_#\;^{dim+r}(X)$ the subgroup of homotopy classes which induce the identity on the homotopy groups of X in dimensions $\leq$ dim X+r. In this paper, we calculate the subgroups $\varepsilon_#\;^{dim+r}(X)$ when X is a wedge of two Moore spaces determined by cyclic groups and in consecutive dimensions.

SELF-HOMOTOPY EQUIVALENCES RELATED TO COHOMOTOPY GROUPS

  • Choi, Ho Won;Lee, Kee Young;Oh, Hyung Seok
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.2
    • /
    • pp.399-415
    • /
    • 2017
  • Given a topological space X and a non-negative integer k, we study the self-homotopy equivalences of X that do not change maps from X to n-sphere $S^n$ homotopically by the composition for all $n{\geq}k$. We denote by ${\varepsilon}^{\sharp}_k(X)$ the set of all homotopy classes of such self-homotopy equivalences. This set is a dual concept of ${\varepsilon}^{\sharp}_k(X)$, which has been studied by several authors. We prove that if X is a finite CW complex, there are at most a finite number of distinguishing homotopy classes ${\varepsilon}^{\sharp}_k(X)$, whereas ${\varepsilon}^{\sharp}_k(X)$ may not be finite. Moreover, we obtain concrete computations of ${\varepsilon}^{\sharp}_k(X)$ to show that the cardinal of ${\varepsilon}^{\sharp}_k(X)$ is finite when X is either a Moore space or co-Moore space by using the self-closeness numbers.

R. L. Moore's method and small group discover method (대학수학교육에서 발견학습법과 소그룹학습법)

  • Choi, Eun-Mi
    • Journal for History of Mathematics
    • /
    • v.22 no.3
    • /
    • pp.255-272
    • /
    • 2009
  • R. L. Moore's discovery methods are known to have been very effective with certain classes of students. However when the method was attempted by others at the undergraduate level, the results sometimes were disappointing. In this article we study the history of developing modified Moore methods with small group discovery method for the purpose of undergraduate education, and then we discuss some educational point of view in our universities.

  • PDF

SELF-HOMOTOPY EQUIVALENCES OF MOORE SPACES DEPENDING ON COHOMOTOPY GROUPS

  • Choi, Ho Won;Lee, Kee Young;Oh, Hyung Seok
    • Journal of the Korean Mathematical Society
    • /
    • v.56 no.5
    • /
    • pp.1371-1385
    • /
    • 2019
  • Given a topological space X and a non-negative integer k, ${\varepsilon}^{\sharp}_k(X)$ is the set of all self-homotopy equivalences of X that do not change maps from X to an t-sphere $S^t$ homotopically by the composition for all $t{\geq}k$. This set is a subgroup of the self-homotopy equivalence group ${\varepsilon}(X)$. We find certain homotopic tools for computations of ${\varepsilon}^{\sharp}_k(X)$. Using these results, we determine ${\varepsilon}^{\sharp}_k(M(G,n))$ for $k{\geq}n$, where M(G, n) is a Moore space type of (G, n) for a finitely generated abelian group G.

Parallelization and Performance Optimization of the Boyer-Moore Algorithm on GPU (Boyer-Moore 알고리즘을 위한 GPU상에서의 병렬 최적화)

  • Jeong, Yosang;Tran, Nhat-Phuong;Lee, Myungho;Nam, Dukyun;Kim, Jik-Soo;Hwang, Soonwook
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.2
    • /
    • pp.138-143
    • /
    • 2015
  • The Boyer-Moore algorithm is a single pattern string matching algorithm that is widely used in various applications such as computer and internet security, and bioinformatics. This algorithm is computationally demanding and requires high-performance parallel processing. In this paper, we propose a parallelization and performance optimization methodology for the BM algorithm on a GPU. Our methodology adopts an algorithmic cascading technique. This results in significant reductions in the mapping overheads for the threads participating in the parallel string matching. It also results in the efficient utilization of the multithreading capability of the GPU which improves the load balancing among threads. Our experimental results show that this approach achieves a 45-times speedup at maximum, in comparison with a serial execution.

A Change in the Students' Understanding of Learning in the Multivariable Calculus Course Implemented by a Modified Moore Method (Modified Moore 교수법을 적용한 다변수미적분학 수업에서 학습에 대한 학생들의 인식 변화)

  • Kim, Seong-A;Kim, Sung-Ock
    • Communications of Mathematical Education
    • /
    • v.24 no.1
    • /
    • pp.259-282
    • /
    • 2010
  • In this paper, we introduce a modified Moore Method designed for the multivariable calculus course, and discuss about the effective teaching and learning method by observing the changes in the understanding of students' learning and the effects on students' learning in the class implemented by this modified Moore Method. This teaching experiment research was conducted with the 15 students who took the multivariable calculus course offered as a 3 week summer session in 2008 at H University. To guide the students' active preparation, stepwise course materials structured in the form of questions on the important mathematical notions were provided to the students in advance. We observed the process of the students' small-group collaborative learning activities and their presentations in the class, and analysed the students' class journals collected at the end of every lecture and the survey carried out at the end of the course. The analysis of these results show that the students have come to recognize that a deeper understanding of the subjects are possible through their active process of search and discovery, and the discussion among the peers and teaching each other allowed a variety of learning experiences and reflective thinking.

개발도상국의 도서관 정기간행물

  • Kim, Yeong-Gwi
    • KLA journal
    • /
    • v.24 no.1
    • /
    • pp.9-16
    • /
    • 1983
  • 이 논문은 Nicholas L. Moore, 'Library periodicals from developing countries: coverage by major abstracting and indexing services,' Journal of Librarianship, V.13, No.1 (Jan. 1981), pp.37~45를 번역한 것이다. 자자 Nicholas L. Moore는 Library and Information Science Abstracts(LISA)의 편집자이다. Institute of Information Scientists의 회원이고 Institute of Printing의 회원이다. 그리고 Institute of Packaging의 회원이며 Library Association의 준회원이다.

  • PDF