Training a Multimodal Neural Network to Determine the Authenticity of Images

Journal of Computer and Systems Sciences International - The identification of attempts to substitute images plays an important role in protecting biometric systems (authorization in mobile...     

An Average Polynomial Algorithm for Solving Antagonistic Games on Graphs

An algorithm that determines the winner in a cyclic game in polynomial time is proposed. The two-person game occurs continuously on the edges of a directed graph until a vertex visited earlier is reached. If the weight of the resulting cycle is nonnegative, then the maximizing player wins; if this cycle has a negative weight, then the minimizing player wins. A polynomial estimate of the expected algorithm execution time is obtained under the condition that the weights of the game’s graph edges are distributed uniformly. A brief justification of the time estimate of the algorithm is given. Such games have applications in the validating the correctness of parallel-distributed computer systems, including problems of making up a feasible schedule with logical precedence conditions and preprocessing possibilities.     

Absolute Zero as the Instability Point of Hydrodynamics Equations for Bose-Einstein Condensate

No Heading Absolute zero temperature is a singularity point in the case of classical hydrodynamics for Bose-Einstein condensate as well as in the case of two-fluid hydrodynamics equations that use the concept of the phonon gas. It results in instability of initial value problems with respect to small perturbations of temperature (entropy). In the first case, there are sharp peak density solutions, in the second case, the instability manifests itself in the growth of the normal component of the velocity up to about the sound velocity, i.e. formally there is a jump of the velocity to a finite value.     

Method of characteristic functions for classes of networks with fixed node degrees

Classes of networks with fixed node degrees and weights (capacities) of arcs and loops not exceeding a given parameter are studied. Characteristic functions are found that depend on vector components and a parameter; the nonnegativeness of this parameter is the network existence criterion, the degrees of its nodes are equal to vector components, and the arc weights do not exceed the parameter. The set of nodes of such networks are decomposed into two subsets. The sums of arc weights on each subset and the sum of arc weights incident upon the nodes of both subsets are considered as variables. Formulas for the upper and lower bounds for these variables are obtained. The results can be used for the calculation of flows in networks because since node partitioning determines the network cut.