Русский язык
2024 year, volume 28, issue 2 (PDF)
When solving the nonlinear Benedict-Webb-Rubin equation, Newton’s method is usually used. In some areas of pressure and temperature, the equation has many roots; to find the root we need, we must carefully set the initial values for Newton’s method. To do this, it is proposed to use formulas that specify the densities of the gas and liquid phases at the equilibrium gas-liquid phase transition, which can be adjusted to the equation being solved. This approach makes it possible to construct a thermodynamically consistent model convenient for numerical solution, which increases the reliability of calculations.
Keywords: numerical algorithms, multiparameter equation of state, Benedict-Webb-Rubin equation.
An approach to improving methods for solving machine-learning problems based on ensembles of algorithms is considered using classification problem as an example. A method based on a greedy algorithm for choosing weak learners and building the selective ensemble is proposed. This approach is general and applicable in decision support systems and other expert systems.
Keywords: machine learning, weak learners, ensembling, boosting.
In this paper, estimates of the degrees of polynomials with real coeficients separating zeros and ones of Boolean functions for Post’s classes are obtained.
Keywords: Post’s classes, separating polynomial.
The present paper considers precomplete classes in the class of linear 2-adic automata. The paper provides the study of bases for each precomplete class.
Keywords: finite automaton, p-adic number, linear 2-adic automaton, compositional operations, feedback, completeness problem, basis.
This paper studies the property of linear realizability of mapping of the finite set into itself. This property is important from linear realizability of automata, namely linear realizability of the elements of the generating set of the automaton inner semigroup is the one of the necessary conditions for linear realizability of the automaton. Previously it was shown that every mapping of the finite set into itself is linear realizable via an encoding which code length is equal the finite set cardinality. In this paper this result will be improved and it will be shown that every mapping of the finite set into itself is linear realizable via an encoding which code length is equal the finite set cardinality minus one.
Keywords: Automata theory, semiautomata, transition systems, assignment, state encoding, complexity, boolean operator.