Nargiz MAMMADZADA

Ms. Nargiz MAMMADZADA

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 August 2026 in Information
Verified
Journal Article
Open access
PDF file
Vagif Alijavad GasimovVagif Alijavad Gasimov
Vagif Alijavad Gasimov
NMNargiz MAMMADZADA
Nargiz MAMMADZADA
EMEsmira Mustafayeva
Esmira Mustafayeva
JMJabir Mammadov
Jabir Mammadov
KAKamala Alieva
Kamala Alieva
This article proposes a linear-time correlation-controlled shuffling method that attenuates Pearson correlation by permuting one variable through local swaps on a random regular graph. Each round processes a fixed edge order and accepts only vertex-disjoint swaps, producing greedy matching rather than a standard interchange-process update. The analysis uses the induced first-moment operator. A uniform lower bound on edge acceptance yields a Laplacian-domination relation, while a lower bound on the probability that vertices remain unmatched controls the negative spectrum. Conditional on the loop-deleted realized graph being connected and having a spectral gap bounded away from zero, the absolute value of the expected correlation contracts exponentially. For every fixed same-sign attenuation target, an activation probability exists that attains the target in expectation. Finite-sample calibration uses a fixed-budget multi-resolution direct search without assuming monotonicity. Because the procedure applies only permutations, the marginal distribution is preserved exactly. Under fixed degree and fixed calibration budgets, both calibration and shuffling scale linearly with sample size. Experiments show small target errors, exact marginal preservation, and approximately linear runtime scaling. A matched-degree spectral ablation further shows that, with degree and edge count held fixed, the higher-gap random regular graph exhibits substantially faster decay of the mean correlation than the low-gap regular circulant graph.

1 June 2025 in Problems of Informatization and Management
Verified
Journal Article
Open access
PDF file
Vagif Alijavad GasimovVagif Alijavad Gasimov
Vagif Alijavad Gasimov
NMNargiz MAMMADZADA
Nargiz MAMMADZADA
JMJabir Mammadov
Jabir Mammadov
KAK.J. Aliyeva
K.J. Aliyeva
The article is devoted to the study and processing of methods for creating electronic document management systems of medical organizations, increasing the level of protection of documents and information stored and processed in this system. For this purpose, International and local experience in the field of legislation on the protection of documents containing personal and medical information of patients in medical organizations was commented in the article, the issue of creating a distributed structured electronic document management system for medical organizations was considered, various protection methods were used to ensure the confidentiality of personal and medical information of patients, it was proposed to use the authentication procedure and secure encryption methods.

28 August 2023
Verified
Conference Paper
Closed access
Vagif Alijavad GasimovVagif Alijavad Gasimov
Vagif Alijavad Gasimov
NMNargiz MAMMADZADA
Nargiz MAMMADZADA
JMJabir Mammadov
Jabir Mammadov
In this paper, we present a new matrix-based protocol for key exchange. This method is based on non-invertible matrices and the non-commutativity property of the matrix. Systems with non-invertible elements are mathematically non-trivial problems that are cryptographically convenient to use as one-way functions. The complexity of the protocol we present is rely on factorization of matrix, not discrete logarithms, unlike classical Diffie-Hellman. The accuracy of the proposed protocol has been verified with numerous of examples.