Results 91 to 100 of about 4,479,316 (202)
DETECTION OF DEADLOCKS IN PARALLEL PROGRAMS AS SOLUTION OF LINEAR DIOPHANTINE EQUATIONS
Advanced Engineering Research, 2011 The method of detecting deadlocks in the distributed systems at the design stage of the system is considered. The system is presented in the form of a model through the formal specification by means of Petri nets.
Olga F. Babakhyan
doaj
Almost repdigits in balancing and Lucas-balancing sequences [PDF]
Notes on Number Theory and Discrete MathematicsIn this paper, we define the notion of almost repdigit as a positive integer whose digits are all equal except for at most one digit, and we search all terms of the balancing and Lucas-balancing sequences which are almost repdigits.
Manasi K. Sahukar, Hussain Basha
doaj +1 more source
An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations [PDF]
, 1994 In this paper, we describe an algorithm for solving systems of linear Diophantine equations based on a generalization of an algorithm for solving one equation due to Fortenbacher [3].
Herve Devie +2 more
core +1 more source
AN AUTHENTICATION METHOD BASED ON A DIOPHANTINE MODEL OF THE COIN BAG PROBLEM
Applied Computer ScienceThe article presents the so-called coin bag problem, which is modeled by linear Diophantine equations. The problem in question involves assessing the contents of a set of coins based on its weight.
Krzysztof NIEMIEC, Grzegorz BOCEWICZ
doaj +1 more source
Branes with brains: exploring string vacua with deep reinforcement learning
Journal of High Energy Physics, 2019 We propose deep reinforcement learning as a model-free method for exploring the landscape of string vacua. As a concrete application, we utilize an artificial intelligence agent known as an asynchronous advantage actor-critic to explore type IIA ...
James Halverson +2 more
doaj +1 more source
On novel security systems based on the 2-cyclic refined integers and the foundations of 2-cyclic refined number theory [PDF]
Journal of Fuzzy Extension and ApplicationsIntegers play a basic role in the structures of asymmetric crypto-algorithms. Many famous public key crypto-schemes use the basics of number theory to share keys and decrypt and encrypt messages and multimedia.
Mohammad Abobala +2 more
doaj +1 more source
On sums of k-generalized Fibonacci and k-generalized Lucas numbers as first and second kinds of Thabit numbers [PDF]
Notes on Number Theory and Discrete MathematicsLet (Fᵣ⁽ᵏ⁾)ᵣ≥2-k and (Lᵣ⁽ᵏ⁾)ᵣ≥2-k be generalizations of the Fibonacci and Lucas sequences, where k≥2. For these sequences the initial k terms are 0,0,...,0, 1 and 0,0,...,2,1, and each subsequent term is the sum of the preceding k terms.
Hunar Sherzad Taher, Saroj Kumar Dash
doaj +1 more source
Linear forms in logarithms and exponential Diophantine equations
, 2020 This paper aims to show two things. Firstly the importance of Alan Baker's work on linear forms in logarithms for the development of the theory of exponential Diophantine equations.
Rob Tijdeman, Tijdeman, Rob
core +1 more source
Discrete Mathematics, 1975 AbstractIn this paper we present necessary and sufficient conditions for the existence of solutions to more general systems of linear diophantine equations and inequalities than have previously been considered. We do this in terms of variants and extensions of generalized inverse concepts which also permit us to give representation of the set of all ...
Abraham Charnes, Frieda Granot
openaire +3 more sources
A note on equivalent systems of linear diophantine equations [PDF]
Zeitschrift für Operations Research, 1973 Another constructive proof is presented for the fact that a system of linear equations with integer coefficients in bounded integer variables is equivalent to a single equation, which is a linear combination of the original ones. The equation is obtained in a number of steps; in each step two equations are replaced by a single one.
openaire +3 more sources