scholarly journals 4. Organizing a Short Online Math Program Successfully by Daniel Glasscock, Claire Merriman, Donald Robertson, and Clifford Smyth

2021 ◽  
Vol 68 (06) ◽  
pp. 1
Author(s):  
Daniel Glasscock ◽  
Claire Merriman ◽  
Donald Robertson ◽  
Clifford Smyth
Keyword(s):  
2021 ◽  
Vol 26 (2) ◽  
Author(s):  
Samaher Marez

  The aim of this paper, a reliable iterative method is presented for resolving many types of Volterra - Fredholm Integro - Differential Equations of the second kind with initial conditions. The series solutions of the problems under consideration are obtained by means of the iterative method.  Four various problems are resolved with high accuracy to make evident the enforcement of the iterative method on such type of integro differential equations. Results were compared with the exact solution which exhibit that this technique has compatible with the right solutions, simple, effective and easy for solving such problems. To evaluate the results in an iterative process the MATLAB is used as a math program for the calculations.


2021 ◽  
Vol 27 ◽  
pp. 100222
Author(s):  
Lauren Zito ◽  
Jennifer L. Cross ◽  
Bambi Brewer ◽  
Samantha Speer ◽  
Michael Tasota ◽  
...  

2011 ◽  
Vol 03 (02) ◽  
pp. 245-252 ◽  
Author(s):  
VADIM E. LEVIT ◽  
EUGEN MANDRESCU

A maximum stable set in a graph G is a stable set of maximum cardinality. S is a local maximum stable set of G, and we write S ∈ Ψ(G), if S is a maximum stable set of the subgraph induced by S ∪ N(S), where N(S) is the neighborhood of S. Nemhauser and Trotter Jr. [Vertex packings: structural properties and algorithms, Math. Program.8 (1975) 232–248], proved that any S ∈ Ψ(G) is a subset of a maximum stable set of G. In [Levit and Mandrescu, A new greedoid: the family of local maximum stable sets of a forest, Discrete Appl. Math.124 (2002) 91–101] we have shown that the family Ψ(T) of a forest T forms a greedoid on its vertex set. The cases where G is bipartite, triangle-free, well-covered, while Ψ(G) is a greedoid, were analyzed in [Levit and Mandrescu, Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings, Discrete Appl. Math.132 (2004) 163–174], [Levit and Mandrescu, Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids, Discrete Appl. Math.155 (2007) 2414–2425], [Levit and Mandrescu, Well-covered graphs and greedoids, Proc. 14th Computing: The Australasian Theory Symp. (CATS2008), Wollongong, NSW, Conferences in Research and Practice in Information Technology, Vol. 77 (2008) 89–94], respectively. In this paper we demonstrate that if G is a very well-covered graph of girth ≥4, then the family Ψ(G) is a greedoid if and only if G has a unique perfect matching.


Math Horizons ◽  
2010 ◽  
Vol 17 (3) ◽  
pp. 18-21
Author(s):  
Reuben Hersh
Keyword(s):  

1978 ◽  
Vol 78 (2) ◽  
pp. 99-103
Author(s):  
Charles H. Dyer
Keyword(s):  

2020 ◽  
Author(s):  
◽  
Lisa J. Barabas

This qualitative study focused on one Mid-Missouri school district and was designed to collect and analyze teachers' and administrators' perceptions regarding the elementary math program for the purpose of program improvement. The district utilized ability grouping including acceleration for elementary math instruction. This study was analyzed using a constructivist framework and consideration was given to the theories of both Piaget and Vygotsky. Based on teachers' and administrators' perceptions, the accelerated math classes met the needs of the highest ability math students. Overall, according to teachers, the elementary math program did not meet the needs of the lowest students at the fourth and fifth grade levels where the accelerated math classes were being utilized.


2020 ◽  
pp. 7-23
Author(s):  
Tamara Sarangovna Khazykova

The article highlights the relevance of the problem of improving the elementary school children’s mathematical education. The analysis of psychological and pedagogical literature on the research problem is performed. The author defines the psychological and pedagogical foundations for elementary school children’s quantitative skills development, and also notes the main forms and types of extracurricular activities in mathematics. The study presents after-school math program, aimed at elementary school children’s quantitative skills development.


Author(s):  
René Brandenberg ◽  
Paul Stursberg

AbstractIn this paper, we present a new perspective on cut generation in the context of Benders decomposition. The approach, which is based on the relation between the alternative polyhedron and the reverse polar set, helps us to improve established cut selection procedures for Benders cuts, like the one suggested by Fischetti et al. (Math Program Ser B 124(1–2):175–182, 2010). Our modified version of that criterion produces cuts which are always supporting and, unless in rare special cases, facet-defining. We discuss our approach in relation to the state of the art in cut generation for Benders decomposition. In particular, we refer to Pareto-optimality and facet-defining cuts and observe that each of these criteria can be matched to a particular subset of parametrizations for our cut generation framework. As a consequence, our framework covers the method to generate facet-defining cuts proposed by Conforti and Wolsey (Math Program Ser A 178:1–20, 2018) as a special case. We conclude the paper with a computational evaluation of the proposed cut selection method. For this, we use different instances of a capacity expansion problem for the european power system.


2018 ◽  
Vol 6 (3) ◽  
pp. 365-372 ◽  
Author(s):  
Dian Mardiani

AbstrakTujuan dari penelitian ini adalah untuk mengetahui kesalahan konsep teori graf apa saja yang dapat terjadi ketika game “tantangan berhadiah point” diterapkan dalam perkuliahan matematika diskrit dengan tema sejarah dan teori graf. Subjek penelitian dari penelitian ini adalah kelas 2B Prodi Pendidikan Matematika tahun ajaran 2016/2017 berjumlah 34 mahasiswa. Penelitian ini merupakan penelitian deskriptif. Hasil analisa data penelitian ini, ditemukan ada tujuh jenis kesalahan yang terjadi. Mahasiswa salah  mengingat dalam menulis nama tokoh sejarah atau nama tempat dalam sejarah graf sebanyak 68%, kemudian 35% mahasiswa salah dalam menulis simbol derajat dari suatu simpul, 18% salah dalam memahami konsep derajat suatu simpul pada graf, 18% salah dalam memahami konsep sisi dan simpul pada graf, 15% mahasiswa salah dalam proses berhitung, 3% salah dalam mengingat informasi, 24% mahasiswa  salah memahami konsep derajat dari graf yang mengandung loop. Dari survey diperoleh 88% mahasiswa memberikan pendapat positif terhadap game ini, walaupun hanya 9% yang berhasil menjawab sempurna semua soal tes. Kesimpulannya game ini tidak menjamin efektifitas perkuliahan namun memberikan suasana belajar yang lebih positif. AbstractThe purpose of this study is to find out mistakes in learning Graph theory while applying the concept with games “Challenge made point” in Diskrit Math lecturing with theme: Story and Graph Theory. Subjects of this study are 34 students of Math Program class 2B year 2017-2018. This descriptive study found that there are seven mistakes occurred. Some students were false to remember in writing the name of Math expert or the name of history place of Graph theory about 68%, meanwhile 35% students were false to write symbol degree concept from a knot of Graph, 15% students were false in counting process, 3% students were false to remember information, and 24 % students were false to understand degree concept of Graph had loop. Meanwhile, from survey, it found that 88% students gave positive response toward this game, although only 9% student’s success to answer the test perfectly. The main point is, this game didn’t ensure effective lecturing, but it made more positive atmosphere while teaching and learning process.


Sign in / Sign up

Export Citation Format

Share Document