Skill set profile clustering: the empty K-means algorithm with automatic specification of starting cluster centers

While students’ skill set profiles can be estimated with formal cognitive diagnosis models [8], their computational complexity makes simpler proxy skill estimates attractive [1, 4, 6]. These estimates can be clustered to generate groups of similar students. Often hierarchical agglomerative clustering or k-means clustering is utilized, requiring, for K skills, the specification of 2^K clusters. The number of skill set profiles/clusters can quickly become computationally intractable. Moreover, not all profiles may be present in the population. We present a flexible version of k-means that allows for empty clusters. We also specify a method to determine efficient starting centers based on the Q-matrix. Combining the two substantially improves the clustering results and allows for analysis of data sets previously thought impossible

Skill set profile clustering based on student capability vectors computed from online tutoring data

In educational research, a fundamental goal is identifying which skills students have mastered, which skills they have not, and which skills they are in the process of mastering. As the number of examinees, items, and skills increases, the estimation of even simple cognitive diagnosis models becomes difficult. To address this, we introduce a capability matrix showing for each skill the proportion correct on all items tried by each student involving that skill. We apply variations of common clustering methods to this matrix and discuss conditioning on sparse subspaces. We demonstrate the feasibility and scalability of our method on several simulated datasets and illustrate the difficulties inherent in real data using a subset of online mathematics tutor data. We also comment on the interpretability and application of the results for teachers

Large Deviations of Extreme Eigenvalues of Random Matrices

We calculate analytically the probability of large deviations from its mean of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we show that the probability that all the eigenvalues of an (N\times N) random matrix are positive (negative) decreases for large N as \exp[-\beta \theta(0) N^2] where the parameter \beta characterizes the ensemble and the exponent \theta(0)=(\ln 3)/4=0.274653... is universal. We also calculate exactly the average density of states in matrices whose eigenvalues are restricted to be larger than a fixed number \zeta, thus generalizing the celebrated Wigner semi-circle law. The density of states generically exhibits an inverse square-root singularity at \zeta.Comment: 4 pages Revtex, 4 .eps figures included, typos corrected, published versio

A Formal, Resource Consumption-Preserving Translation of Actors to Haskell

We present a formal translation of an actor-based language with cooperative scheduling to the functional language Haskell. The translation is proven correct with respect to a formal semantics of the source language and a high-level operational semantics of the target, i.e. a subset of Haskell. The main correctness theorem is expressed in terms of a simulation relation between the operational semantics of actor programs and their translation. This allows us to then prove that the resource consumption is preserved over this translation, as we establish an equivalence of the cost of the original and Haskell-translated execution traces.Comment: Pre-proceedings paper presented at the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), Edinburgh, Scotland UK, 6-8 September 2016 (arXiv:1608.02534

The statistical mechanics of combinatorial optimization problems with site disorder

We study the statistical mechanics of a class of problems whose phase space is the set of permutations of an ensemble of quenched random positions. Specific examples analyzed are the finite temperature traveling salesman problem on several different domains and various problems in one dimension such as the so called descent problem. We first motivate our method by analyzing these problems using the annealed approximation, then the limit of a large number of points we develop a formalism to carry out the quenched calculation. This formalism does not require the replica method and its predictions are found to agree with Monte Carlo simulations. In addition our method reproduces an exact mathematical result for the Maximum traveling salesman problem in two dimensions and suggests its generalization to higher dimensions. The general approach may provide an alternative method to study certain systems with quenched disorder.Comment: 21 pages RevTex, 8 figure

Understanding Search Trees via Statistical Physics

We study the random m-ary search tree model (where m stands for the number of branches of a search tree), an important problem for data storage in computer science, using a variety of statistical physics techniques that allow us to obtain exact asymptotic results. In particular, we show that the probability distributions of extreme observables associated with a random search tree such as the height and the balanced height of a tree have a traveling front structure. In addition, the variance of the number of nodes needed to store a data string of a given size N is shown to undergo a striking phase transition at a critical value of the branching ratio m_c=26. We identify the mechanism of this phase transition, show that it is generic and occurs in various other problems as well. New results are obtained when each element of the data string is a D-dimensional vector. We show that this problem also has a phase transition at a critical dimension, D_c= \pi/\sin^{-1}(1/\sqrt{8})=8.69363...Comment: 11 pages, 8 .eps figures included. Invited contribution to STATPHYS-22 held at Bangalore (India) in July 2004. To appear in the proceedings of STATPHYS-2

Re-thinking flexibility in higher education: A shared responsibility of students and educators

In recent years, there has been a growing recognition of the importance of flexibility in higher education as a key factor that can contribute to enhancing student learning and accessibility. However, flexibility has previously been investigated through an institutional lens that fails to consider those directly involved—students and educators. Moreover, the majority of current research regarding flexibility is based on anecdotal evidence and theoretical frameworks; therefore, evidence-based research is lacking. This plenary session is presented from a student perspective, who found that often, the parts of her identity that she took pride in—middle eastern background, gender, and hearing loss—were also the cause of her struggles. In conversations with other students, it was revealed that their diversity or life circumstances hindered their ability to pursue education. Flexibility was identified as key to enhancing their academic experience. Thus, the presenter decided to focus her fourth year thesis on a project that investigated students’ and educators’ experiences surrounding flexibility to inform future policies about effective flexible practices that accurately represent both groups. This session will highlight similarities and differences between students’ and educators’ experiences, barriers educators face when implementing flexibility, and a current misalignment in perceptions of flexibility between students and educators. Engaging in transparent and reciprocal open conversations can enhance the student-educator bond and solidify both groups’ sense of belonging. This study was approved by Western’s Non-Medical Research Ethics Board

Physical Acoustics

Contains reports on four research projects.United States Navy, Office of Naval Research (Contract Nonr-1841(42)