Search results for “computer-science”

How to bring up a twenty-year-old Unix TCAD package under emulation on an ARM Mac, drive it from Jupyter, and parse its data formats in Python

This article is devoted to the problem of calculating an exact upper bound for the functionals of the generalization ability of a family of one-dimensional threshold decision rules. An algorithm is investigated that solves the stated problem and is polynomial in the total number of samples used for training and validation and in the number of training samples. A theorem is proved for calculating an estimate for the functional of expected overfitting and an estimate for the error rate of the method for minimizing empirical risk on a validation set. The exact bounds calculated using the theorem are compared with the previously known quick-to-compute upper bounds so as to estimate the orders of overestimation of the bounds and to identify the bounds that could be used in real problems.

The determinant of a square matrix — its meaning, minors and cofactors, Laplace expansion, and computation methods.

Nonsingular matrices, the invertibility criterion, the adjugate-matrix formula, and the Gauss–Jordan method.

International mathematics competition for pre-university students, held annually since 1959. Six problems over two days.

Why the definition of a filtered category insists on non-emptiness: the empty colimit fails to commute with the empty limit, and that is the only failure.

The basic properties of addition, scalar multiplication, transposition, and multiplication of matrices, with justifications.