Results 11 to 20 of about 713,469 (282)
Secret sharing scheme with general access structure based on integer programming [PDF]
In order to simplify the access structure and ensure that all integer programming have solutions,a scheme is proposed to apply integer programming directly to the secret sharing of general access structure.By constructing integer programming,the secret ...
XIE Yang,MIAO Fuyou,BAI Jianfeng
doaj +1 more source
This note tackles the equivalence problem between the fractional and integer order diffusion models. Unlike existing approaches, the existence of a unique integral transformation mapping the solution of the integer order model to a solution of the ...
Claudia A. Pérez-Pinacho +1 more
doaj +1 more source
Branch-and-cut solution approach for multilevel mixed integer linear programming problems
A multilevel programming problem is an optimization problem that involves multiple decision makers, whose decisions are made in a sequential (or hierarchical) order. If all objective functions and constraints are linear and some decision variables in any
Ashenafi Awraris +2 more
doaj +1 more source
On integer solutions of Parsell–Vinogradov systems [PDF]
55 ...
Guo, Shaoming, Zhang, Ruixiang
openaire +3 more sources
The occurrence of prime numbers revisited
Based on an arithmetical and autocatalytic approach, the authors propose a solution for the occurrence of prime numbers. Exact arithmetical calculations are provided for: the closest prime to any given positive integer (or any number of bigger or ...
Ernesto Tapia Moore, José Tapia Yañez
doaj +3 more sources
Stationary solutions for integer‐valued autoregressive processes [PDF]
The purpose of this paper is to introduce and develop a family of ℤ+‐valued autoregressive processes of order p (INAR(p)) by using the generalized multiplication ⊙F of van Harn and Steutel (1982). We obtain various distributional and regression properties for these models.
Emad-Eldin A. A. Aly, Nadjib Bouzar
openaire +2 more sources
استخدام خوارزمية طريقة تطوير مو لد قطع المستوي لإيجاد الحل العددي لمسائل البرمجة الكسرية [PDF]
There are many methods for solving Fractional Programming problems thatgetting the optimal solution of the problem where the values of variables arefractional numbers not integer numbers, But when there are conditions in theproblem that requires the ...
doaj +1 more source
On minimum integer representations of weighted games [PDF]
We study minimum integer representations of weighted games, i.e., representations where the weights are integers and every other integer representation is at least as large in each component.
Beck +28 more
core +3 more sources
In this paper, we give a straightforward approach to obtaining the solution of the Diophantine equation 1w+1x+1y+1z=12 $\frac{1}{w} + \frac{1}{x} + \frac{1}{y} + \frac{1}{z} = \frac{1}{2}$. We also establish that the Diophantine equation 1w+1x+1y+1z=mn $\
Tingting Bai
doaj +1 more source
Existence Results for Langevin Equation Involving Atangana-Baleanu Fractional Operators
A new form of nonlinear Langevin equation (NLE), featuring two derivatives of non-integer orders, is studied in this research. An existence conclusion due to the nonlinear alternative of Leray-Schauder type (LSN) for the solution is offered first and ...
Dumitru Baleanu +2 more
doaj +1 more source

