<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
<channel rdf:about="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6949">
<title>JAEM 2025, Vol 15, No 8</title>
<link>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6949</link>
<description>JAEM 2025, Vol 15, No 8 koleksiyonunu içerir.</description>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6971"/>
<rdf:li rdf:resource="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6970"/>
<rdf:li rdf:resource="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6969"/>
<rdf:li rdf:resource="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6968"/>
</rdf:Seq>
</items>
<dc:date>2026-04-09T07:49:28Z</dc:date>
</channel>
<item rdf:about="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6971">
<title>A study on bi-parametric potentials: inversion formulas utilizing wavelet-like transformations in weighted lebesgue spaces</title>
<link>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6971</link>
<description>A study on bi-parametric potentials: inversion formulas utilizing wavelet-like transformations in weighted lebesgue spaces
Yıldız, Güldane; Kahraman, Recep; Bayrakçı, Simten
We introduce a new family of wavelet-like transforms based on bi-parametric semigroups associated with the Laplace-Bessel differential operator. Using these transforms, we obtain new inversion formulas for bi-parametric potentials in the framework of weighted Lebesgue spaces.
</description>
<dc:date>2025-08-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6970">
<title>On a certaıin subclass of analytic functions defined by Rabotnov function</title>
<link>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6970</link>
<description>On a certaıin subclass of analytic functions defined by Rabotnov function
Lagad, Aditya; Ingle, R. N.; Thirupathi Reddy, Pinninti; Venkateswarlu, Bollineni
The study of the geometric properties of analytic functions and their numerous applications in a variety of mathematical fields, including fractional calculus, probability distributions, and special functions, has drawn significant and impressive attention to Geometric Function Theory (GFT), one of the most prominent branches of complex analysis, in recent years. The focus of this article is the introduction of a new subclass of analytic functions involving Rabotnov function and obtained coefficient inequalities, convex linear combination, radii properties, Integral means inequality and neighborhood result for this class.
</description>
<dc:date>2025-08-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6969">
<title>Optimizing queueing systems with metaheuristics: a comparative analysis of genetic algorithms and traffic flow inspired optimization</title>
<link>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6969</link>
<description>Optimizing queueing systems with metaheuristics: a comparative analysis of genetic algorithms and traffic flow inspired optimization
Hameed, Arshad; Hadi Rashid, Amal; Ibrahim Shahab, Ghaida; Mohammed, Shaimaa; Rabiu, Sani
Queueing system inefficiencies present critical operational challenges in service industries, particularly in healthcare where extended patient wait times and suboptimal resource utilization directly impact service quality and operational costs. While traditional analytical models (e.g., M/M/1, M/M/c) offer theoretical solutions, they frequently fail to accommodate dynamic real-world complexities. This study comparatively evaluates two metaheuristic approaches the established Genetic Algorithm (GA) and the novel Traffic Flow Inspired Optimization Algorithm (TFIOA), which models adaptive behaviors observed in transportation systems to optimize physician scheduling at Baquba Hospital’s Internal Medicine Clinic. Using empirical patient arrival and service time data collected over three-hour operational windows, we implemented both algorithms across three physician allocation scenarios (1-3 doctors). Performance was assessed through five metrics: patient waiting time, physician idle time, convergence rate, computational cost, and total operational expenditure. Results demonstrate TFIOA’s superior performance, achieving a 9.96% improvement in optimal solutions, 11.02% reduction in average costs, 33.6% faster convergence, and 17.1% higher success rate compared to GA. The dual objective cost function effectively balanced patient and physician time considerations, enabling practical policy evaluation. While TFIOA shows significant promise for realtime queue management, this study is limited by its single clinic focus and condensed observation period. Future research should validate these findings across diverse healthcare settings and extended timeframes.
</description>
<dc:date>2025-08-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6968">
<title>Fuzzified bisection method to find the root of an algebraic equation using n−polygonal fuzzy numbers</title>
<link>http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6968</link>
<description>Fuzzified bisection method to find the root of an algebraic equation using n−polygonal fuzzy numbers
Vable, Kalyani Nandu; Jadhav, Pravin Ganpat; Gaikwad, Shikishan Babu
In this paper, we introduce a fuzzified bisection method to find the root of an algebraic equation using n-polygonal fuzzy numbers. We present a new approach for finding the root of an algebraic equation with the n-polygonal fuzzy number. To solve the given algebraic equation, we consider a fuzzy interval, and the method iteratively reduces the interval containing the fuzzy root by evaluating the value of a function at each midpoint. We continue this process until the desired level of approximation is achieved. The fuzzified bisection method has broad applications in engineering, economics, and decision-making. The results demonstrate that the method provides a flexible and effective way to find root.
</description>
<dc:date>2025-08-01T00:00:00Z</dc:date>
</item>
</rdf:RDF>
