the unsteady flow in porous medium of a viscous incompressible fluid bounded by two parallel porous plates is studied with heat transfer. a uniform and constant pressure gradient is applied in the axial direction whereas a uniform suction and injection are applied in the direction normal to the plates. the two plates are kept at constant and different temperatures and the viscous dissipation is...

We study Random 2-SAT problem, in which 2-CNFs are sampled from a wide range of non-uniform distributions, including heavy-tailed using random model that is quite different the standard uniform 2-SAT. This SAT so-called configuration model, given by distribution ξ for degree (or number occurrences) each variable. To generate formula variable , generating several clones Then 2-clauses created ch...

Integrals of optimal values of random optimization problems depending on a nite dimensional parameter are approximated by using empirical distributions instead of the original measure. Under fairly broad conditions, it is proved that uniform convergence of empirical approximations of the right hand sides of the constraints implies uniform convergence of the optimal values in the linear and conv...

Normally, random-number generators are designed to produce numbers with a uniform distribution. The sum of uniform random variates has a bell-curveshaped distribution. Using bell curves like wavelets, individual uniform random variables can be summed to produce arbitrary nonuniform distributions. The result is a simple, customizable non-uniform random-number generating algorithm that has been p...

We have numerically studied the behavior of one dimensional tunnel junction arrays when random background charges are included using the “orthodox” theory of single electron tunneling. Random background charge distributions are verified in both amplitude and density. The use of a uniform array as a transistor is discussed both with and without random background charges. An analytic expression f...

The random assignment problem is to minimize the cost of an assignment in a n×n matrix of random costs. In this paper we study this problem for some integer valued cost distributions. We consider both uniform distributions on 1, 2, . . . , m, for m = n or n, and random permutations of 1, 2, . . . , n for each row, or of 1, 2, . . . , n for the whole matrix. We find the limit of the expected cos...