In an Open-Pit Production Scheduling (OPPS) problem, the goal is to determine the mining sequence of an orebody as a block model. In this article, linear programing formulation is used to aim this goal. OPPS problem is known as an NP-hard problem, so an exact mathematical model cannot be applied to solve in the real state. Genetic Algorithm (GA) is a well-known member of evolutionary algorithms...

In this paper we prove an existence and uniqueness result for the double phase Dirichlet problem when lowest exponent is equal to 1. Our solution a function of bounded variation that simultaneously lies in suitable weighted Sobolev space found as limit sequence solutions intermediate problems whose $p$ goes As that, our approach involves study some relevant properties generalized Orlicz-Sobolev...

A&ruct-Universal coding is any asymptotically opt imum method of block-to-block memoryless source coding for sources with unknown parameters. This paper considers noiseless coding for such sources, primarily in terms of variable-length coding, with performance measured as a function of the coding redundancy relative to the per-letter conditional source entropy given the unknown parameter. It is...

In this paper we study the almost universal convergence of weighted sums for sequence {x ,n } of negatively dependent (ND) uniformly bounded random variables, where a, k21 is an may of nonnegative real numbers such that 0(k ) for every ?> 0 and E|x | F | =0 , F = ?(X ,…, X ) for every n>l.

In many biomolecular database applications involving string/sequence data, it is common to have similarity search in the form of near neighbor queries or nearest neighbor queries. The similarity between strings/sequences are typically measured in terms of the least costly set of allowed edit operations that transform one string/sequence to another. In this survey, we briefly describe some of th...

‎We present some inequalities for operator space numerical radius of $2times 2$ block matrices on the matrix space $mathcal{M}_n(X)$‎, ‎when $X$ is a numerical radius operator space‎. ‎These inequalities contain some upper and lower bounds for operator space numerical radius.

In this paper, determining the operator norm, we give certain characterizations of matrix transformations from space $ \left\vert \overline N_p^{\phi }\right\vert _{k}$, all series summable by absolute weighted mean summability method, to one classical sequence spaces $c_{0},c,l_{\infty }.$ Also, obtain necessary and sufficient conditions for each in these classes be compact establish a number ...