University of Wyoming Open Journals
Not a member yet
3193 research outputs found
Sort by
The Plot Thickens: Literacy Through Computational Thinking
No full textIn this lesson, students analyzed word frequency, character interactions, and recurring themes in Frankenstein to predict how the novel unfolds before reading the next chapter. Students mapped a decision tree for Victor Frankenstein’s choices and predict alternative endings. This lesson utilized Plotting Plots (n.d.-a), created Dr. Tom Liam Lynch as a classroom resource that blends literature with data analysis. This tool leverages computational and quantitative approaches to understanding books by creating visual representations of literary data. The Much Ado About K-12 Computer Science: A Crash Course for ELA and English Teachers YouTube video playlist videos (Plotting Points, n.d.-c) are designed for secondary English Language Arts teachers to strategically map keywords and to support students’ exploration and inferences of what they could mean for the plot of the text
Fillmore's theorem and sums of nilpotent quaternion matrices
No full textFillmore's Theorem states that an nonscalar matrix over a field is similar to a matrix whose diagonal entries are provided that It is shown that an analog of Fillmore's Theorem holds for matrices over a quaternion division algebra. As a consequence, a matrix that is nonscalar over the underlying field and has zero reduced trace is a sum of at most three nilpotent matrices. The upper bound three is optimal since it is shown that there are matrices that are sums of exactly three nilpotent matrices. A characterization of sums of two square-zero real quaternion matrices is also presented
Groups of singular alternating sign matrices
No full textWe investigate multiplicative groups consisting entirely of singular alternating sign matrices (ASMs) and present several constructions of such groups. It is shown that every finite group is isomorphic to a group of singular ASMs, with a singular idempotent ASM as its identity element. The relationship between the size, the rank, and the possible multiplicative orders of singular ASMs is explored
Integrating CT/CS into a Teacher Education Program: A Year-Long PD
No full textThis grant-funded, year-long professional development (PD) for higher education faculty focused on integrating computational thinking (CT) and computer science (CS) in preservice teacher education courses. A full-day PD was followed-up by four 15-minute PD sessions held during the Teacher Education Department (TED) meetings, supporting all TED faculty. A PD spinoff initiative, “Focused Faculty,” supported five TED faculty in planning and implementing a CT/CS lesson in one of their courses in Spring 2024. Multiple materials and activities were utilized in this PD including Scratch Jr., Scratch, Code.org, micro:bits, unplugged activities, machine learning, makerspaces, and literacy integration
Erratum for the paper "Solution of symmetric positive semidefinite Procrustes problem'' [Electron. J. Linear Algebra 35 (2019) 543-554]
No full textWe give an example showing that the main result, i.e., Theorem 2.12, in the paper by Peng, Wang, Peng, and Chen [Electron. J. Linear Algebra 35 (2019) 543-554] is not correct. We also indicate where the mistake in the proof occurs
Scratch Day: Hands-On Computational Thinking Activites for Youth and Adults
No full textThis lesson engages K-12 students, educators, and parents in original Scratch Day activities developed for lower-level (K-5th grade), upper-level (6th-12th grade), and post-secondary (adult) audiences. These lessons targeted individuals with limited knowledge regarding computational thinking. Activities involved sequencing and algorithmic expressions using block-based coding on the ScratchJr and Scratch web apps. Participants engaged in collaborative conversation and problem-solving as they made creative design decisions and debugged when they encountered coding issues
Spectral extrema on graphs with given size forbidding small fans
No full textThe -fan is the graph obtained by taking the join of a vertex with a path order . Brualdi-Hoffman-Turán problem asks what is the maximal spectral radius of an -free graph on edges? Clearly, is a triangle, and is a book. Brualdi-Hoffman problems on triangles and books were solved by Nosal and Nikiforov. Recently, Yu, Li, and Peng showed that if is an -free graph of size , then , with equality if and only if is odd and. In this note, by pure spectral techniques, we show that if and , then contains a copy of unless . Our result not only determines the spectral extremal value of for both even and odd but also implies a result on -cycle-free graphs by Min, Lou, and Huang
Topics of Interest: Ungrading, Service Learning, and Ethics
No full textThe SoTL group has been a great educational, professional development and inspirational tool for my career. It has showed me how interdisciplinary SoTL is. Our small group covers a large breadth from agriculture, education to intercultural development all with direct applications to SoTL. I have grown and learned from this community as a “junior” faculty member working with senior faculty.
The importance of prioritizing, valuing and implementing SoTL for UW and it’s success as a land grant university is essential. UW should continue to pursue and strengthen SoTL to grow the foundation of teaching as research while improving UW for both students and faculty