مرور Volume 52, Issue 1 بر اساس تاریخ انتشار

  • A Note on Early Warning Systems for Monitoring the Inflation of Iran 

    Daadmehr, Elham؛ Habibi, Reza (University of Tehran, 2020-06-01)
    To check the financial stability, it is important to alarm the possibility of future potential financial crisis. In the literature, the early warning system (EWS) is designed to warn the occurrence of a financial crisis ...

  • On the optimization of Dombi non-linear programming 

    Ghodousian, A.؛ Elyasimohammadi, Fatemeh (University of Tehran, 2020-06-01)
    Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the parameter is ...

  • On computing total double Roman domination number of trees in linear time 

    Poureidi, Abolfazl (University of Tehran, 2020-06-01)
    Let $G=(V,E)$ be a graph. A doubleRoman dominating function (DRDF) on $G$ is a function$f:Vto{0,1,2,3}$ such that for every vertex $vin V$if $f(v)=0$, then either there is a vertex $u$ adjacent to $v$ ...

  • Edge-Tenacity 

    Moazzami, .Dara (University of Tehran, 2020-06-01)
    The edge-tenacity $T_e(G)$ of a graph G was defined asbegin{center} $T_e(G)=displaystyle min_{Fsubset E(G)}{frac{mid Fmid +tau(G-F)}{omega(G-F)}}$end{center}where the minimum is taken over all ...

  • A security aware workflow scheduling in hybrid cloud based on PSO algorithm 

    Mehravaran, Maedeh؛ Adibnia, Fazlollah؛ Pajoohan, Mohammad-Reza (University of Tehran, 2020-06-01)
    In real world, organization's requirements for high performance resources and high capacity storage devices encourage them to use resources in public clouds. While private cloud provides security and low cost ...

  • On Point-inclusion Test in Convex Polygons and Polyhedrons 

    Imanparast, Mahdi؛ Kazemi Torbaghan, Mehdi (University of Tehran, 2020-06-01)
    A new algorithm for point-inclusion test in convex polygons is introduced. The proposed algorithm answers the point-inclusion test in convex polygons in $mathcal{O}(log n)$ time without any preprocessing and with $mathcal{O}(n)$ ...