Bringing effective, research-based literacy interventions into the classroom is challenging, especially given the cultural and linguistic diversity of today's classrooms. We examined the promise of Assessment-to-Instruction (A2i) technology redesigned to be used at scale to support teachers' implementation of the individualized student instruction…

Bringing effective, research-based literacy interventions into the classroom is challenging, especially given the cultural and linguistic diversity of today's classrooms. We examined the promise of Assessment-to-Instruction (A2i) technology redesigned to be used at scale to support teachers' implementation of the individualized student instruction…

Significant innovations in learning technologies are encouraging individuals, especially high school students, to seek enrichment learning opportunities that they normally are not able to take advantage of due to the limitation of traditional classroom offerings in low-income school districts. With the increase in learners seeking alternatives to…

This supplemental report provides technical documentation for the full report (published separately) concerning the 63% of AISD's Class of 2013 graduates who enrolled in a postsecondary institution the year after high school, and 74% of Class of 2012 graduates persisted in college for a second year. [For the full report, see ED626498.]

The Indian Institute of Science is proud to host the fully in-person sixteenth iteration of the International Conference on Educational Data Mining (EDM) during July 11-14, 2023. EDM is the annual flagship conference of the International Educational Data Mining Society. The theme of this year's conference is "Educational data mining for…

It is known that the Maxbet algorithm, which is an alternative to the method of generalized canonical correlation analysis and Procrustes analysis, may converge to local maxima. Discusses an eigenvalue criterion that is sufficient, but not necessary, for global optimality of the successive Maxbet algorithm. (SLD)

Developed a branch-and-bound algorithm that can be used to seriate a symmetric dissimilarity matrix by identifying a reordering of rows and columns of the matrix optimizing an anti-Robinson criterion. Computational results suggest that with respect to computational efficiency, the approach is generally competitive with dynamic programming. (SLD)

This paper is intended as an introduction to a number of problems connected with the description of algorithms and algorithmic languages, particularly the syntaxes and semantics of algorithmic languages. The terms "letter, word, alphabet" are defined and described. The concept of the algorithm is defined and the relation between the algorithm and…

Presents an algorithm for the production of a graphical diagram from a matrix formula in such a way that its components are logically and hierarchically arranged. The algorithm, which relies on the matrix equations of J. McArdle and R. McDonald (1984), calculates the individual path components of expected covariance between variables and…

Discussion of access methods and information retrieval algorithms focuses on the vertical counting approach. Determines the speedup gained from using the Hamming Distance Bit Vertical counter, evaluates the parameters that influence the speedup, and discusses the point that makes the vertical approach faster than the horizontal approach.…

Discusses XML and information retrieval and describes a query language, ELIXIR (expressive and efficient language for XML information retrieval), with a textual similarity operator that can be used for similarity joins. Explains the algorithm for answering ELIXIR queries to generate intermediate relational data. (Author/LRW)

Discussion of information retrieval focuses on the use of binary trees and how to compact it to use less memory and take less time. Explains retrieval algorithms and describes data structure and hierarchical structure. (LRW)

Presents an algorithm for computation of discrimination values in automatic construction of dictionaries for information retrieval. (Author/PF)

Comments on P. Arabie's article, "Concerning Monte Carlo Evaluations of Nonmetric Multidimensional Scaling Algorithms.", Psychometrika, 1973, 38, 607-8. (RC)

The indirect retrieval method proposed by Goffman is outlined and some similarities to other retrieval methods are indicated. The method is then evaluated and the results are compared with those obtained on the same document collection with cluster-based retrieval using single-link clustering. (Author)