ORCID Profile
0000-0002-2253-1166
Current Organisation
UNSW Sydney
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: World Scientific Pub Co Pte Lt
Date: 30-06-2016
DOI: 10.1142/S0218127416501121
Abstract: In this work, we propose a class of public-key cryptosystems called multiplicative coupled cryptosystem, or MCC for short, as well as discuss its security within three different models. Moreover, we discuss a chaotic instance of MCC based on the first and the second types of Chebyshev polynomials over real numbers for these three security models. To avoid round-off errors in floating point arithmetic as well as to enhance the security of the chaotic instance discussed, the Chebyshev polynomials of the first and the second types over a finite field are employed. We also consider the efficiency of the proposed MCCs. The discussions throughout the paper are supported by practical ex les.
Publisher: Taru Publications
Date: 04-11-2019
Publisher: Armenian Green Publishing Co.
Date: 04-2018
DOI: 10.29252/ASTA.5.1.23
Publisher: World Scientific Pub Co Pte Lt
Date: 04-2019
DOI: 10.1142/S1793830919500204
Abstract: A set [Formula: see text] for the graph [Formula: see text] is called a dominating set if any vertex [Formula: see text] has at least one neighbor in [Formula: see text]. Fomin et al. [Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications, ACM Transactions on Algorithms (TALG) 5(1) (2008) 9] gave an algorithm for enumerating all minimal dominating sets with [Formula: see text] vertices in [Formula: see text] time. It is known that the number of minimal dominating sets for interval graphs and trees on [Formula: see text] vertices is at most [Formula: see text]. In this paper, we introduce the domination cover number as a new criterion for evaluating the dominating sets in graphs. The domination cover number of a dominating set [Formula: see text], denoted by [Formula: see text], is the summation of the degrees of the vertices in [Formula: see text]. Maximizing or minimizing this parameter among all minimal dominating sets has interesting applications in many real-world problems, such as the art gallery problem. Moreover, we investigate this concept for different graph classes and propose some algorithms for finding the domination cover number in trees and block graphs.
Publisher: Elsevier BV
Date: 08-2016
Publisher: IEEE
Date: 02-2018
Publisher: Taru Publications
Date: 28-03-2019
Publisher: IEEE
Date: 08-2022
Publisher: Springer Science and Business Media LLC
Date: 03-10-2023
Publisher: Springer Science and Business Media LLC
Date: 09-09-2019
Publisher: Tbilisi Centre for Mathematical Sciences
Date: 06-2016
Publisher: Elsevier BV
Date: 06-2019
Publisher: Unpublished
Date: 2012
Publisher: Institute of Advanced Engineering and Science
Date: 02-2020
DOI: 10.11591/IJEECS.V21.I2.PP1103-1112
Abstract: In this paper, we build a novel chaotic coupled lattice mapping with positive Lyapunov exponent, and introduce a novel chaotic image scrambling mechanism. Then, we propose a chaotic image encryption algorithm which uses the introduced chaotic coupled lattice mapping to apply permutation by iteratively applying the introduced chaotic image scrambling mechanism, and diffusing the pixel values. We use a sorting approach rather than quantizing the chaotic floating-point values to construct the diffusion matrix. We also study the security of the proposed algorithm concerning several security measures including brute-force attack, differential attack, key sensitivity, and statistical attacks. Moreover, the proposed algorithm is robust against data loss and noise attacks.
Publisher: Springer Science and Business Media LLC
Date: 23-12-2016
Publisher: Springer International Publishing
Date: 2018
Publisher: Chapman and Hall/CRC
Date: 08-09-2020
Publisher: Elsevier BV
Date: 07-2019
Publisher: Hindawi Limited
Date: 28-04-2014
DOI: 10.1155/2014/909684
Abstract: We intend to study a new class of algebraic approximations, called S -approximations, and their properties. We have shown that S -approximations can be used for applied problems which cannot be modeled by inclusion based approximations. Also, in this work, we studied a subclass of S -approximations, called S ℳ -approximations, and showed that this subclass preserves most of the properties of inclusion based approximations but is not necessarily inclusionbased. The paper concludes by studying some basic operations on S -approximations and counting the number of S -min functions.
Publisher: Springer Science and Business Media LLC
Date: 28-08-2020
Publisher: Elsevier BV
Date: 11-2018
Publisher: Unpublished
Date: 2012
Publisher: World Scientific Pub Co Pte Lt
Date: 04-2021
DOI: 10.1142/S021848852150013X
Abstract: The combination of identical S-approximation spaces, except with different decider mappings, is studied in this paper by considering the construction of more complex S-approximation spaces from simpler ones that use different decision criteria, e.g., due to levels of expertise. It can be used to model group decision making problems where each decider makes an independent decision based on a shared knowledge map, e.g., several doctors with the same knowledge and different, independent decision criteria decide on a possible disease(s) for a patient, based on the same set of observations. These results can formalize the management of distributed uncertainty and can be used to invent novel distributed uncertain data processing algorithms. Also, we introduce the decider significance concept to minimize the number of combinations to obtain the same effect as the original combination. We show that finding a minimum set of significant deciders is NP-hard. and give an illustrative ex le in a medical expert system.
Publisher: Springer Science and Business Media LLC
Date: 04-2016
Publisher: IEEE
Date: 23-02-2022
Publisher: The Institute for Research and Community Services (LPPM) ITB
Date: 16-10-2021
Publisher: Springer Science and Business Media LLC
Date: 13-02-2021
Publisher: Unpublished
Date: 2012
Location: Iran (Islamic Republic of)
Location: Iran (Islamic Republic of)
No related grants have been discovered for Ali Shakiba.