University of Wyoming Open Journals
Not a member yet
3193 research outputs found
Sort by
The Universal Design for Learning Academy for Faculty Across Disciplines
No full textThe Universal Design for Learning (UDL) academy is professional development for faculty focused on exploring and implementing the UDL framework with input from other faculty participants, and the academy instructor. The academy occurs over five, half-days (four hours each) in an in-person environment. The main learning outcome of the academy was to teach faculty about UDL and help them implement UDL in one or more courses. The academy includes inclusive design activities, UDL implementation worksheets, and technology-rich presentations. Faculty participants completed the activities and worksheets that led to self-reflection and implementation of UDL in one or more courses
Writing Effective Alt-text for Online Instructional Materials
No full textInstructional materials are increasingly created and made available within an online space. Engaging materials utilize various types of images to break up walls of text and enhance learning. Describing these images with effective alternative text (alt-text) is subjective and contextually-based, requiring a treatment and knowledge beyond a simple checklist. This lesson is aimed to support educators in becoming more accessibility-literate, and to build in robust alt-text at the moment of creation.
This lesson presents five different types of images. Each image type serves a distinct purpose within the context of online instructional materials. During the lesson, learners will work through each image type, with opportunities to practice examining HTML alternative tags and writing appropriate alt-text for each type of image
Designing Accessible Immersive Learning Experiences
No full textImmersive learning experiences are simulated real-world environments that allow learners to practice skills in low-stakes contexts. The following activity supports instructors in improving the accessibility of their designed immersive learning experiences. Instructors first reflect on their in-progress design using guiding questions. After the completion of the immersive learning design, the instructors self-evaluate to identify areas of improvement for potential revisions. Guidelines and criteria utilized within the process are adapted from the Web Content Accessibility Guidelines (WCAG) and Universal Design for Learning (UDL) principles. This approach can be used with immersive experiences designed for any age group
Universal Design for Learning: Increasing Inclusive Teaching for Graduate Students
No full textThis workshop seeks to equip Graduate Teaching Assistants (GTAs) with the Universal Design for Learning (UDL) framework, a set of standardized and widely accepted practices that enable Master's, Ph.D., and post-doctoral students to create a more inclusive teaching environment. This workshop is an updated and improved version of a previously conducted event. Participants will engage with the UDL framework, apply its principles in practical examples, and develop a learning activity tailored to their unique teaching practice. By integrating the UDL framework, GTAs will be equipped to create more inclusive learning environments for their students. This workshop will provide an opportunity to strengthen their teaching abilities
Graph degeneracy and orthogonal vector representations
No full textWe apply a technique of Sinkovic and van der Holst for constructing orthogonal vector representations of a graph whose complement has given treewidth to graphs whose complement has given degeneracy
Flat portions on the boundary of the numerical range of a 5 × 5 companion matrix
No full textThe number of flat portions on the boundary of the numerical range of companion matrices, both unitarily reducible and unitarily irreducible cases, is examined. The complete characterization on the number of flat portions of a unitarily reducible companion matrix is given. Also under some suitable conditions, it is shown that a unitarily irreducible companion matrix cannot have four flat portions on the boundary of its numerical range. This gives a partial affirmative answer to the conjecture given in [3] for . Numerical examples are provided to illustrate the results
A new method to improve the efficiency and accuracy of incremental singular value decomposition
No full textSingular value decomposition (SVD) has been widely used in machine learning. It lies at the root of data analysis, and it provides the mathematical basis for many data mining techniques. Recently, interest in incremental SVD has been on the rise because it is well suited to streaming data. In this paper, we propose a new algorithm of incremental SVD that is designed to improve both efficiency and accuracy during computation. More specifically, our proposed algorithm takes advantage of the special structures of arrowhead and diagonal-plus-rank-one matrices involved in updating SVD models to expedite the updating process. Moreover, because the singular values are computed independently, the proposed method can be easily parallelized. In addition, as this paper shows, increasing rank can lead to more accurate singular values in the updating process. Experimental results from synthetic and real data sets demonstrate gains in efficiency and accuracy in the updating process
The inverse Horn problem
No full textAlfred Horn's conjecture on eigenvalues of sums of Hermitian matrices was proved more than 20 years ago. In this note, the problem is raised of, given an -tuple in the solution polytope, constructing Hermitian matrices with the required spectra such that their sum has eigenvalues
A permanent inequality for positive semidefinite matrices
No full textIn this paper, we prove an inequality involving the permanent of a positive semidefinite matrix and its leading submatrices. We obtain a result in the similar spirit of Bapat-Sunder per-max conjecture
Extremal problems for the eccentricity matrices of complements of trees
No full textThe eccentricity matrix of a connected graph , denoted by , is obtained from the distance matrix of by keeping the largest nonzero entries in each row and each column and leaving zeros in the remaining ones. The -eigenvalues of are the eigenvalues of . The largest modulus of an eigenvalue is the -spectral radius of . The -energy of is the sum of the absolute values of all -eigenvalues of . In this article, we study some of the extremal problems for eccentricity matrices of complements of trees and characterize the extremal graphs. First, we determine the unique tree whose complement has minimum (respectively, maximum) -spectral radius among the complements of trees. Then, we prove that the -eigenvalues of the complement of a tree are symmetric about the origin. As a consequence of these results, we characterize the trees whose complement has minimum (respectively, maximum) least -eigenvalues among the complements of trees. Finally, we discuss the extremal problems for the second largest -eigenvalue and the -energy of complements of trees and characterize the extremal graphs. As an application, we obtain a Nordhaus-Gaddum-type lower bounds for the second largest -eigenvalue and -energy of a tree and its complement