Forthcoming and Online First Articles

International Journal of Networking and Security

International Journal of Networking and Security (IJNSec)

Forthcoming articles have been peer-reviewed and accepted for publication but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

Online First articles are published online here, before they appear in a journal issue. Online First articles are fully citeable, complete with a DOI. They can be cited, read, and downloaded. Online First articles are published as Open Access (OA) articles to make the latest research available as early as possible.

Open AccessArticles marked with this Open Access icon are Online First articles. They are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.

Register for our alerting service, which notifies you by email when new issues are published online.

We also offer which provide timely updates of tables of contents, newly published articles and calls for papers.

(1 paper in press)

Regular Issues

  • PageRank-based approaches: a component-aware survey   Order a copy of this article
    by José Devezas, Sérgio Nunes 
    Abstract: PageRank is a random walk-based approach that was introduced in 1997 as Google's ranking algorithm. Since then, it has been studied and extended for multiple other applications. From query-dependent ranking to community detection and image ranking, PageRank has proven to be flexible, robust and useful in diverse contexts. In this survey, we provide an overview on different types of PageRank applications, covering several interpretations, components and calculation approaches that can be tinkered with to manipulate and model PageRank-based approaches. We provide a normalised notation, focusing on delivering out-of-the-box, power-iteration-ready equations for each type of PageRank we cover. In many cases, we have rewritten the original formulas to provide a vectorised alternative. This way, we aim to provide a comprehensive guide to PageRank, that can be directly used by anyone with access to a linear algebra framework.
    Keywords: PageRank; survey; Markov chains; power iteration; link analysis; search; node ranking; graph-based applications.
    DOI: 10.1504/IJNSEC.2021.10039004