Volume 53, Issue 1

 

ارسال های اخیر

  • BloomEclat: Efficient Eclat Algorithm based on Bloom filter 

    abbasi, sina؛ Moieni, Ali (University of Tehran, 2021-06-01)
    Eclat is an algorithm that finds frequent itemsets. It uses a vertical database and calculates item's support by intersecting transactions. However, Eclat suffers from the exponential time complexity of calculating the ...

  • A Survey on Tenacity ParameterPart I 

    Khoshnood, Asieh؛ Moazzami, Dara (University of Tehran, 2021-06-01)
    If we think of the graph as modeling a network, the vulnerability measurethe resistance of the network to disruption of operation after the failure of certainstations or communication links. In assessing the "vulnerability"of ...

  • Use of Digital Image Watermarking to Enhance the Security of Graphical Password Authentication 

    Sadeghi, Saeid؛ Manochehri, Kooroush؛ jahanshahi, mohsen (University of Tehran, 2021-06-01)
    There are several techniques for implement an authentication system for computers that most commonly use the clear text password. One of the security problems is the use of a text password, the lack of choosing a complicated ...

  • Pair Difference Cordiality of Some Snake and Butterfly Graphs 

    Ponraj, R؛ Gayathri, A؛ Somasundaram, S (University of Tehran, 2021-06-01)
    noindent Let $G = (V, E)$ be a $(p,q)$ graph.Define begin{equation*}rho =begin{cases}frac{p}{2} ,& text{if $p$ is even}frac{p-1}{2} ,& text{if $p$ is odd}end{cases}end{equation*} and $L = {pm1 ,pm2, pm3 , cdots ,pmrho}$ ...

  • A fast algorithm for the linear programming problem constrained with the Weighted power mean -- Fuzzy Relational Equalities (WPM-FRE) 

    Ghodousian, Amin؛ Zal, Sara (University of Tehran, 2021-06-01)
    In this paper, a linear programming problem is investigated in which the feasible region is formed as a special type of fuzzy relational equalities (FRE). In this type of FRE, fuzzy composition is considered as the weighted ...

  • On the Minimum of True Matches in Exact Graph Matching with Simulated Annealing 

    Ezzati, Hashem؛ Amintoosi, Mahmood؛ Tabasi, Hashem (University of Tehran, 2021-06-01)
    Graph matching is one of the most important problems in graph theory and combinatorial optimization, with many applications in various domains. Although meta-heuristic algorithms have had good performance on many NP-Hard ...

  • An Alternative Proof for a Theorem of R.L. Graham Concerning CHEBYSHEV Polynomials 

    Ramasamy, A.M.S..؛ Ponraj, R (University of Tehran, 2021-06-01)
    In this paper, an alternative proof is provided for a theorem of R.L.Graham concerning Chebyshev polynomials.  While studying the properties of a double star, R.L.Graham [2] proved a theorem concerning Chebyshev polynomials ...

  • Method for Eigensolution of Tridiagonal Matrices 

    Shojaei, Iman؛ Rahami, Hossein (University of Tehran, 2021-06-01)
    In this paper we have developed an iterative method to solve eigenproblem for non-repetitive tridiagonal matrices. The importance of eigensolution for tridiagonal matrices is that in many algorithms the eigneproblem for ...

  • $alpha$-Gap Greedy Spanner 

    Salami, Hosein؛ Nouri Baygi, Mostafa (University of Tehran, 2021-06-01)
    In this paper, we have introduced a new geometric spanner called $alpha$-Gap greedy spanner, which is a parametric approximation of the well-known Gap-greedy spanner. We will show theoretically and experimentally that this ...

  • $4$-total mean cordial labeling of special graphs 

    Ponraj, R؛ SUBBULAKSHMI, S؛ Somasundaram, S (University of Tehran, 2021-06-01)
    Let $G$ be a graph. Let $f:Vleft(Gright)rightarrow left{0,1,2,ldots,k-1right}$ be a function where $kin mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $fleft(uvright)=leftlceil frac{fleft(uright)+fleft(vright ...