although some 3d slope stability algorithms have been proposed in recent three decades, still role of pore pressures in three dimensional slope stability analyses and considering the effects of pore water pressure in 3d slope stability studies needs to be investigated. in this paper, a limit analysis formulation for investigation of role of the pore water pressure in three dimensional slope sta...

Let $L$ be a lattice in $ZZ^n$ of dimension $m$. We prove that there exist integer constants $D$ and $M$ which are basis-independent such that the total degree of any Graver element of $L$ is not greater than $m(n-m+1)MD$. The case $M=1$ occurs precisely when $L$ is saturated, and in this case the bound is a reformulation of a well-known bound given by several authors. As a corollary, we show t...

The tenacity of a graph G, T(G), is dened by T(G) = min{[|S|+τ(G-S)]/[ω(G-S)]}, where the minimum is taken over all vertex cutsets S of G. We dene τ(G - S) to be the number of the vertices in the largest component of the graph G - S, and ω(G - S) be the number of components of G - S.In this paper a lower bound for the tenacity T(G) of a graph with genus γ(G) is obtained using the graph's connec...

Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...

We extend the existing methodology in bound-to-bound data collaboration (B2BDC), an optimization-based deterministic uncertainty quantification (UQ) framework, to explicitly take into account model discrepancy. The discrepancy is represented as a linear combination of finite basis functions, and feasible set constructed according collection modified model-data constraints. Formulas for making p...

Accurate data on electric-dipole transition matrix elements (EDTMs) for bound-bound Rydberg-atom transitions have become increasingly important in science and technology. Here we compute radial EDTMs of rubidium length, velocity, acceleration forms electric-dipole-allowed between states with principal angular-momentum quantum numbers $n$ $\ensuremath{\ell}$ ranging from 15 to 100. Wave function...

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerfu...

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...