31 results
Search Results
Now showing 1 - 10 of 31
Article On the Image of the Limit Q-Durrmeyer Operator(Academic Press Inc Elsevier Science, 2026) Ostrovska, Sofiya; Turan, MehmetThe focus of this work is on the properties of the q-Durrmeyer operators Mn,q, n E N, and M infinity,q introduced, for q E (0, 1), by V. Gupta and H. Wang. First, it is shown that, for each f E C[0, 1], the sequence {Mn,q f}nEN converges to M infinity,q f uniformly on [0, 1] with a rate not slower than Cq, fqn, which refines the previously available result by V. Gupta and H. Wang, and implies the possibility of an analytic continuation for M infinity,q f into a neighbourhood of [0, 1]. Further investigation shows that M infinity,q f admits an analytic continuation as an entire function regardless of f E C[0, 1]. Finally, the growth estimates for these functions are received and applied to describe the point spectrum of M infinity,q. The paper also addresses the significant differences between the properties of M infinity,q and the previously (c) 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.Article Citation - WoS: 5Citation - Scopus: 5An Unrestricted Arnold's Cat Map Transformation(Springer, 2024) Turan, Mehmet; Goekcay, Erhan; Tora, HakanThe Arnold's Cat Map (ACM) is one of the chaotic transformations, which is utilized by numerous scrambling and encryption algorithms in Information Security. Traditionally, the ACM is used in image scrambling whereby repeated application of the ACM matrix, any image can be scrambled. The transformation obtained by the ACM matrix is periodic; therefore, the original image can be reconstructed using the scrambled image whenever the elements of the matrix, hence the key, is known. The transformation matrices in all the chaotic maps employing ACM has limitations on the choice of the free parameters which generally require the area-preserving property of the matrix used in transformation, that is, the determinant of the transformation matrix to be +/- 1.\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\pm 1.$$\end{document} This reduces the number of possible set of keys which leads to discovering the ACM matrix in encryption algorithms using the brute-force method. Additionally, the period obtained is small which also causes the faster discovery of the original image by repeated application of the matrix. These two parameters are important in a brute-force attack to find out the original image from a scrambled one. The objective of the present study is to increase the key space of the ACM matrix, hence increase the security of the scrambling process and make a brute-force attack more difficult. It is proved mathematically that area-preserving property of the traditional matrix is not required for the matrix to be used in scrambling process. Removing the restriction enlarges the maximum possible key space and, in many cases, increases the period as well. Additionally, it is supplied experimentally that, in scrambling images, the new ACM matrix is equivalent or better compared to the traditional one with longer periods. Consequently, the encryption techniques with ACM become more robust compared to the traditional ones. The new ACM matrix is compatible with all algorithms that utilized the original matrix. In this novel contribution, we proved that the traditional enforcement of the determinant of the ACM matrix to be one is redundant and can be removed.Article How Analytic Properties of Functions Influence Their Images Under the Limit q-Stancu Operator(Springer Basel AG, 2026) Gurel, Ovgu; Ostrovska, Sofiya; Turan, MehmetIn the study of various q-versions of the Bernstein polynomials, a significant attention is paid to their limit operators. The present work focuses on the impact of the limit q-Stancu operator Sq infinity,alpha on the analytic properties of functions when 0 < q < 1 and alpha > 0. It is shown that for every f is an element of C[0, 1], the function S-q,(alpha infinity)fadmits an analytic continuation into the disk {z : z+alpha/(1-q) < 1+ alpha/(1-q)}. In addition, it is proved that the more derivatives f has at x = 1, the wider this disk becomes. Further, if f is infinitely differentiable at x = 1, then the function S-q,(alpha infinity)fis entire. Finally, some growth estimates for (S-q,(alpha infinity)f)(z) are obtained.Article On the Moment-Determinacy of Power Lindley Distribution and Some Applications To Software Metrics(Acad Brasileira de Ciencias, 2021) Khalleefah, Mohammed; Ostrovska, Sofiya; Turan, MehmetThe Lindley distribution and its numerous generalizations are widely used in statistical and engineering practice. Recently, a power transformation of Lindley distribution, called the power Lindley distribution, has been introduced by M. E. Ghitany et at who initiated the investigation of its properties and possible applications. In this article, new results on the power Lindley distribution are presented. The focus of this work is on the moment-(in)determinacy of the distribution for various values of the parameters. Afterwards, certain applications are provided to describe data sets of software metrics.Conference Object Citation - WoS: 2The Limit q-bernstein Operators With Varying q(Springer international Publishing Ag, 2019) Almesbahi, Manal Mastafa; Ostrovska, Sofiya; Turan, Mehmet[No Abstract Available]Conference Object Density-Aware Outage in Clustered Ad Hoc Networks(Ieee, 2018) Eroglu, Alperen; Onur, Ertan; Turan, MehmetDensity of ad hoc networks may vary in time and space because of mobile stations, sleep scheduling or failure of nodes. Resources such as spectrum will be wasted if the network is not density-aware and -adaptive. Towards this aim, distributed and robust network density estimators are required. In this paper, we propose a novel cluster density estimator in random ad hoc networks by employing distance matrix. Monte-Carlo simulation results validate the proposed estimator. The accuracy of the estimator is impressive even under a high amount of distance measurement errors. We also propose a network outage model and a transmit power adaption technique that are density-aware. The results indicate the necessity of the density-aware solutions for making network performance better from capacity, coverage and energy conservation viewpoints.Article Citation - WoS: 1Citation - Scopus: 1On the q-moment Determinacy of Probability Distributions(Malaysian Mathematical Sciences Soc, 2020) Ostrovska, Sofiya; Turan, MehmetGiven 0Article Citation - WoS: 1Citation - Scopus: 1The Distance Between Two Limit q-bernstein Operators(Rocky Mt Math Consortium, 2020) Ostrovska, Sofiya; Turan, MehmetFor q is an element of (0, 1), let B-q denote the limit q-Bernstein operator. The distance between B-q and B-r for distinct q and r in the operator norm on C[0, 1] is estimated, and it is proved that 1 <= parallel to B-q - B-r parallel to <= 2, where both of the equalities can be attained. Furthermore, the distance depends on whether or not r and q are rational powers of each other. For example, if r(j) not equal q(m) for all j, m is an element of N, then parallel to B-q - B-r parallel to = 2, and if r = q(m) for some m is an element of N, then parallel to B-q - B-r parallel to = 2(m - 1)/m.Article Citation - WoS: 1Citation - Scopus: 1The Truncated q-bernstein Polynomials in the Case q > 1(Hindawi Ltd, 2014) Turan, MehmetThe truncated q-Bernstein polynomials B-n,B-m,B-q (f; x), n is an element of N, and m is an element of N-0 emerge naturally when the q-Bernstein polynomials of functions vanishing in some neighbourhood of 0 are considered. In this paper, the convergence of the truncated q-polynomials on [0, 1] is studied. To support the theoretical results, some numerical examples are provided.Article Qualitative results on the convergence of the q-Bernstein polynomials(North Univ Baia Mare, 2015) Ostrovska, Sofiya; Turan, MehmetDespite many common features, the convergence properties of the Bernstein and the q-Bernstein polynomials are not alike. What is more, the cases 0 < q < 1 and q > 1 are not similar to each other in terms of convergence. In this work, new results demonstrating the striking differences which may occur in those convergence properties are presented.
