...
首页> 外文期刊>Numerical analysis and applications >Theoretical basis of the iterative process of the joint assessment of difficulties in tasks and levels of training students
【24h】

Theoretical basis of the iterative process of the joint assessment of difficulties in tasks and levels of training students

机译:联合评估作业难度和学生培训水平的迭代过程的理论基础

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we study the iterative process of the joint numerical assessment of levels of training students and difficulties in tasks of diagnostic tools using the dichotomous response matrix A of size N × M with allowance for the contribution of tasks of different difficulty to the assessments obtained. It is shown that not for any matrix A there exist infinite iterative sequences, and in the case of their existence, they do not always converge. A wide range of sufficient conditions for their convergence have been obtained, which are based on the following: (1) the matrix A contains at least three different columns; (2) if one places the columns of the matrix A in non-decreasing order of column sums, then for any position of the vertical dividing line between the columns there exists a row, which has at least one unity to the left of the line and at least one zero to the right of the line. It is established that the response matrix A obtained as a result of testing reliability satisfies these two conditions. The properties of such matrices have been studied. In particular, the equivalence of the above-mentioned conditions of primitiveness of the square matrix B of order M with the entries bij=∑?=1N(1?a?i)a?ibij=∑?=1N(1?a?i)a?i has been proved. Using the matrix analysis, we have proved that the primitiveness of the matrix B ensures the convergence of iterative sequences, as well as independence of their limits of the choice of the initial approximation. We have estimated the rate of convergence of these sequences and found their limits.
机译:在本文中,我们使用大小为N×M的二分响应矩阵A并考虑了不同难度的任务对评估的贡献,研究了联合数值评估对培训学生水平和诊断工具任务的困难进行联合迭代的过程。获得。结果表明,对于任何矩阵A都不存在无限的迭代序列,并且在存在它们的情况下,它们并不总是收敛。已经获得了广泛的充分条件来收敛,这些条件基于以下条件:(1)矩阵A至少包含三个不同的列; (2)如果将矩阵A的列以列总和的非降序排列,则对于列之间的垂直分隔线的任何位置,都存在一行,该行在行的左侧至少具有一个单位该行的右边至少有一个零。确定作为测试可靠性的结果而获得的响应矩阵A满足这两个条件。已经研究了这类基质的性质。特别地,上述的阶次为M的方阵B的原始性条件与条目bij = ∑α = 1N(1αaαi)aβibij= ∑α = 1N(1αaα)相等。我已经被证明了。使用矩阵分析,我们证明了矩阵B的原始性确保了迭代序列的收敛性,以及它们对初始近似选择的限制是独立的。我们估计了这些序列的收敛速度并找到了其极限。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号