Synopsis: This paper provides a framework of lower bounds on the minimum distance of cyclic codes. Root bounds depends solely on the den-ing set and the length of a cyclic code, and the BCH Bound, the Hartmann-Tzeng Bound, Bound A and several Boston Bounds are sown to belong to this family. Border bounds furthermore depends on the dening set of cyclic subcodes as well. The Schaub Bound, the Sin...

in this paper we give sharp upper bounds on the zagreb indices and characterize all trees achieving equality in these bounds. also, we give lower bound on first zagreb coindex of trees.

this paper investigate iranian tourism demand to malaysia using the recently developed autoregressive distributed lag (ardl) ‘bound test’ approach to cointegration for 2000:q1 to 2013:q4. the demand for tourism has been explained by macroeconomic variables, including income in iran, tourism prices in malaysia, tourism price substitute, travel cost and trade value between iran and malaysia. in a...

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...