<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
        <title>Journal of Applied Mathematics, Statistics and Informatics Feed</title>
        <link>https://reference-global.com/journal/JAMSI</link>
        <description>Reference Global RSS Feed for Journal of Applied Mathematics, Statistics and Informatics</description>
        <lastBuildDate>Thu, 22 Oct 2026 02:24:19 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>https://github.com/jpmonette/feed</generator>
        <image>
            <title>Journal of Applied Mathematics, Statistics and Informatics Feed</title>
            <url>https://paradigm-files.s3.eu-central-1.amazonaws.com/JAMSI/cover-image.jpg</url>
            <link>https://reference-global.com/journal/JAMSI</link>
        </image>
        <copyright>All rights reserved 2026, University of Ss. Cyril and Methodius in Trnava</copyright>
        <atom:link href="https://reference-global.com/2/rss/journal/JAMSI" rel="self" type="application/rss+xml"/>
        <item>
            <title><![CDATA[Chiral bright, dark and singular Solitons for the Nonlinear Schrödinger Equation in (1+2) Dimensions]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2026-0001</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2026-0001</guid>
            <pubDate>Sat, 06 Jun 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[In this study, we employ two efficient analytical techniques, the simplest equation approach and the tanh-coth method to investigate the (1+2) dimensional nonlinear chiral Schrödinger’s equation. In condensed matter physics and nonlinear optics, this equation is essential, describing the propagation of light in materials with significant nonlinearities and chiral properties. By employing the simplest equation method, we derive exact solutions that reveal the complex relationship between nonlinearity and chirality. Additionally, the tanh-coth method yields exact soliton solutions, enhancing our understanding of soliton dynamics in chiral media. Our results provide new insights into the behavior of nonlinear waves in (1+2) dimensions and demonstrate the effectiveness of these methods in solving complex nonlinear equations. We present analytical solutions for bright and dark solitons. We also discuss the variables of the system in the following section and conditions enabling various solutions, including singular and periodic solitons.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[A Categorical Model of State Transformations in Programming Languages]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2026-0004</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2026-0004</guid>
            <pubDate>Sat, 06 Jun 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[Formal semantics of programming languages represents a basic formal method connecting theoretical foundations of computer science with the development of reliable software. It allows for rigorous analysis of the correctness and properties of programs independently of the implementation. When formulating it, it is necessary to respect the principles of the programming paradigm, which determines the basic abstractions of the language. At the same time, there are unifying formalisms that allow for systematic comparison of semantic definitions across paradigms. Category theory represents one of the most important such approaches. We formalize this perspective by introducing a general categorical model of state transformations and show how different programming paradigms can be uniformly represented and related within this framework via structure-preserving mappings.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Spectral properties of the Cartesian product of K3 □ Kg graphs.]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2026-0002</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2026-0002</guid>
            <pubDate>Sat, 06 Jun 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[This study explores the Laplacian spectral characteristics of the Cartesian product graph of K3 □ Kg, with particular emphasis on the trace, energy, and the coefficients of its characteristic polynomial. We establish general expressions for the trace of powers of the Laplacian matrix and develop recursive formulas for the Laplacian coefficients using trace-based identities. The findings are validated for various values of g, and generalized to arbitrary cases. Additionally, we derive upper bounds and lower bounds for the Laplacian eigenvalues of the graph K3 □ Kg]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Robust mean estimation in stratified sampling: A quantile regression approach]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2026-0003</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2026-0003</guid>
            <pubDate>Sat, 06 Jun 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[The presence of outliers can significantly reduce the reliability of conventional estimators, often resulting in biased estimation of the population mean. This challenge is particularly relevant in practical survey data, where irregular observations frequently occur. Although this issue is well-recognized, limited work has been done on population mean estimation under stratified random sampling when outliers are present, especially within a quantile regression framework. To address this gap, the present study introduces a new class of robust estimators based on quantile regression. The proposed estimators make use of non-conventional auxiliary information to improve estimation accuracy under a stratified random sampling scheme. By relying on quantile-based methods, the suggested approach provides greater resistance to the influence of outliers. The statistical properties of the proposed estimators are derived analytically, including measures of bias and mean squared error. In addition, their performance is examined through a real-life dataset. The findings indicate that the proposed estimators offer notable gains in efficiency and robustness compared to the adopted estimators, particularly in datasets affected by outliers.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Q-homotopy analysis transform technique for two-dimensional fractional diffusion equation]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2025-0006</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2025-0006</guid>
            <pubDate>Fri, 26 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[In this paper, we find the solution for two-dimensional fractional diffusion equation using an efficient scheme namely, q-homotopy analysis transform method (q-HATM). To validate the competence and applicability of the proposed scheme, we consider two examples. The proposed algorithm is the joint application of the homotopy analysis method and Laplace transform (LT). For the obtained series solution, the proposed method offers ¯h-curves that illustrate convergence region. The numerical behaviour is presented to ensure the reliability and accuracy of the proposed method. Further, the nature of the achieved results is presented for a diverse order of the fractional derivative. The achieved results show that, the considered method is easy to implement and very effective to study the behaviour of nonlinear models.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Coincidence fixed point results for (Θ,g)b-contraction maps]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2025-0007</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2025-0007</guid>
            <pubDate>Fri, 26 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[With the establishment of a new contraction known as fuzzy-(Θ,g)b -contraction, the primary goal of this work is to elaborate and develop an understanding of this new class of fuzzy contractive mappings and to investigate some coincidence point results by using (Θ,g)b-contractive setup. We establish certain conditions for the existence and uniqueness of fuzzy points of coincidence in fuzzy b-metric spaces.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Some results on deferred statistical convergence of double sequences in neutrosophic normed linear spaces]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2025-0008</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2025-0008</guid>
            <pubDate>Fri, 26 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[In this research, we extend the concept of statistical convergence by introducing the idea of deferred statistical convergence in the neutrosophic normed spaces. This work considers the deferred density proposed in 2016 by Küçükaslan and Yilmaztürk to define deferred statistical convergence of double sequences in neutrosophic normed spaces. We look into some of the core characteristics of the recently developed concept of deferred statistical convergence.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Dynamic sparkle rendering: photorealistic real-time visualization of glittering surfaces in interactive scenarios]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2025-0009</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2025-0009</guid>
            <pubDate>Fri, 26 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[The need for photorealistic rendering of glittery materials, motivated by applications in gaming, film, virtual reality, and particularly automotive visualization, requires real-time techniques to depict millions of minute flakes in paint coatings. Existing approaches often rely on a single grid for glint mapping, leading to repetitive patterns, aliasing, and noticeable popping during camera movement. Addressing these issues is essential for achieving convincing sparkle under varying lighting and viewpoints.We propose a new real-time method that integrates three procedurally generated microflake grids, each with multiple resolution levels, to ensure smooth transitions between levels of detail and eliminate tiling artifacts. Adaptive scaling dynamically adjusts sparkle size and brightness based on camera distance, while per-flake light-color interactions enhance reflection realism. Our custom shader framework, paired with an artist-friendly material editor, enables real-time adjustments to flake density, size, falloff, and color.Compared to single-grid or fixed-scale methods, our multi-grid approach delivers dense, non-repetitive sparkles with consistent quality across distances, albeit with higher GPU demands in complex scenes. The controllable and diverse output of our system also makes it well-suited for generating synthetic training data for AI models focused on material recognition, lighting estimation, or view-dependent appearance. Future work will explore deferred rendering, 3D noise textures, optimized shader branching, and temporal filtering to enhance performance and visual quality.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Development and characterization of a flexible three-parameter lifetime distribution: theoretical properties and real-world applications]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2025-0010</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2025-0010</guid>
            <pubDate>Fri, 26 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[In this article, we propose a new three-parameter lifetime distribution and derive some of its properties. This new distribution is suitable for analyzing failure time data with decreasing or unimodal-shaped hazard rates. Although the moment generating function of the distribution does not exist in closed-form, all moments exist and have closed-form expressions. The nice expressions for its density function, distribution function, hazard function, and quantile function make the distribution attractive to researchers in reliability and life testing experiments. Various structural properties, including moment generating function, mean deviations, entropy measures, tail behavior, and density-quantile function, are studied. The distribution can be classified as short- or long-tailed based on the density-quantile function. We first consider maximum likelihood and Bayesian methods of estimation for complete samples and study two different real-life applications. Then, we consider the maximum likelihood and Bayesian methods for censored samples with and without cure fraction, with and without covariates, and study one real-life application in this scenario.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Bayesian estimation and regularization techniques in categorical data analysis]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2025-0011</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2025-0011</guid>
            <pubDate>Fri, 26 Dec 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[This paper explores Bayesian estimation for categorical data, focusing on simple yet effective models that provide a foundation for applying more advanced methods accurately and reliably in real-world applications. We begin by revisiting Bayesian estimators for the binomial distribution and investigating their properties. Next, we develop hypothesis tests for categorical data (sign test, homogeneity test, symmetry test) based on regularized maximum likelihood estimates of the probabilities. Finally, we formulate regularized versions of common association measures for contingency tables and study the regularized version of mutual information, particular for the situation where the regularized version can effectively handle zero counts.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Distance-based correlation analysis for graph databases]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2025-0005</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2025-0005</guid>
            <pubDate>Wed, 04 Jun 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[Big data is often characterized by its volume, velocity, and variety, properties that entail the fact that the data contains values and relationships that are too complex to be stored using standard, relational, or document databases. Graph databases, commonly utilized for their capacity to model complex relationships between sets of objects, provide an effective framework for the processing and storing of such data. Afterwards, it is necessary to work with data further − analyse it using methods of descriptive statistics and statistical analysis, visualize it with the use of exploratory analysis techniques, and especially use this data to build analytical models for predictive and estimation purposes. The main objective of the presented study is the design and implementation of the predictive potential metric in graph databases, which is based on the structures found in the graph databases themselves. We focus on the examination of the correlation between the attribute values of individual database objects and the mutual distance of these objects in the defined graph space. The proposed metric is verified using standard prediction models built on a sizeable graph database.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[2-target pebbling number of graphs]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2025-0002</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2025-0002</guid>
            <pubDate>Wed, 04 Jun 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[Chung defined the pebbling move of a graph which involves choosing a vertex with at least two pebbles, discarding those two pebbles from that vertex and adding one pebble to a nearby vertex. The 2-target pebbling number of the vertices u,v in graph a G is the least number φ(G,u,v) has the characteristic that for every configuration of φ(G,u,v) pebbles on G, it is possible to move a pebble to u and v simultaneously by a sequence of pebbling moves. The 2-target pebbling number of graph G, denoted by φ(G), is the maximum φ(G,u,v) over all pairs of the vertices in G. In this paper, we discuss the 2-target pebbling number for some standard graphs.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[A stochastic model of area-biased Kpenadidum distribution with the characteristics and applications to real-lifetime data]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2025-0003</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2025-0003</guid>
            <pubDate>Wed, 04 Jun 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[In this present research, we explore the statistical characteristics of the Area-Biased Kpenadidum Distribution (ABKD), a novel probability model. The maximum likelihood method has been used to estimate the parameters, and the asymptotic findings have been explained. The new distribution was compared to the Shanker, Lindley, and Kpenadidum distributions. When the distribution was fitted to cancer data, a good fit was observed.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Improved estimation of population parameter in the existence of non-response using auxiliary information]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2025-0004</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2025-0004</guid>
            <pubDate>Wed, 04 Jun 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[In many domains, including healthcare, economics, and weather forecasting, estimating the finite population mean using non-response is an essential and practically useful task. The mean estimation is heavily used by actuaries and insurance analysts for the purpose of making insightful conclusions. To improve the precision of estimators in survey samples, auxiliary variables play a crucial role. Based on simple random sampling, this study suggests a novel family of estimators that are better designed for determining the population mean using data which include non-response. Efficiency requirements are determined by comparing the mean squared errors of the suggested class of estimators with existing counterparts. The empirical study makes use of both real life data sets and a simulation study. The empirical results show clearly that the proposed estimators are better than the existing estimators. The biases and mean square errors of these estimators, among their other attributes, have been thoroughly examined and explored through numerical and simulation studies. The recommended estimators perform well for the population mean in terms of minimum MSEs and higher percentage relative efficiency.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Numerical analysis of stochastic PDEs in traffic flow: Investigating density-flow relations]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2025-0001</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2025-0001</guid>
            <pubDate>Wed, 04 Jun 2025 00:00:00 GMT</pubDate>
            <description><![CDATA[Understanding traffic flow dynamics is crucial for modeling real-world scenarios, where stochastic factors often introduce variability and unpredictability. This study explores the impact of stochastic influences on traffic flow, focusing on the relationship between flow and density in both deterministic and stochastic models. Using the Lighthill-Whitham-Richards (LWR) framework, the study examines a stochastic partial differential equation (SPDE) to simulate traffic behavior under varying conditions. The lognormal random numbers are incorporated for the Brownian motion for stochasticity after analysing its normalitynusing various tests. Numerical solutions were obtained through Godunov’s scheme, incorporating boundary conditions to capture stochastic effects. The findings show that the stochastic approach enhances predictive accuracy by capturing real-world traffic uncertainties.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[On regular power fuzzy graphs]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2024-0011</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2024-0011</guid>
            <pubDate>Sun, 22 Dec 2024 00:00:00 GMT</pubDate>
            <description><![CDATA[In this paper, we define the notion of regular power fuzzy graph (RPFG), as a combination of regular properties and power fuzzy graphs. We also define totally regular power fuzzy graph as a special case of RPFG. A comparative study between regular and totally regular power fuzzy graphs is investigated. It is also proved that any power fuzzy graph containing a pendant vertex can be neither regular nor totally regular. A necessary condition for a total power fuzzy graph to be perfectly regular is that the vertex and edge membership functions are constants.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Control chart for generalized exponential distribution based on modified chain sampling]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2024-0007</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2024-0007</guid>
            <pubDate>Sun, 22 Dec 2024 00:00:00 GMT</pubDate>
            <description><![CDATA[In recent years, modern statistical process control has established higher concentration, and this approach is reinforced by new control charts to efficiently monitor the process. The goal of this article is to create a control chart based on a modified chain sampling plan (MchSP) when product quality dimensions are followed by a generalized exponential distribution. There was a brief overview of the generalized exponential distribution (GED) and the modified chain sampling strategy. The chart parameters were presented for several sample sizes at various average run length (ARL) values. A variety of tables were provided for the actual application of the produced control chart in industrial applications at various shift values of scale and form parameters. The real data set was used to demonstrate the application of the created MchSP control chart process. In addition, the proposed MchSP control chart process was developed using simulated data. The average run length (ARL) results of the established control chart for shifting both scale and shape parameters were computed for various sample sizes. The results show that when the shift constant (both scale and form) increases, the ARL values decrease. Also, it was discovered that ARL1 values tend to decrease as the shape parameter value increases.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Impact of random variations in the sampling period on the stability of embedded control systems]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2024-0010</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2024-0010</guid>
            <pubDate>Sun, 22 Dec 2024 00:00:00 GMT</pubDate>
            <description><![CDATA[Control of embedded systems is a key task in many industrial and technological applications, and their performance and stability are critically dependent on the ability to effectively implement control algorithms within limited computational and time resources. One of the main challenges in this area is the need to process data with a random variable that comes to processing randomly and with variable periodicity. This variability in the sampling period can cause a decrease in the quality of the control, which threatens the stability of the entire system. The article examines the limits to which this variability can be tolerated without losing the stability of the controlled system.The study includes an analysis of systems dynamics with a variable sampling period and determining the necessary period of system discretization. It is also essential to consider the impact of the random component of the sampling period on the system’s transient response. The proposal is based on determining the permissible limits of the period change based on analysis and simulation.The result of this research provides recommendations for the design and implementation of control systems that can maintain high-quality regulation even with unpredictable changes in sampling periodicity. The present article also opens space for further research in the field of control of systems with variable periodicity, especially regarding their practical implementation in real embedded devices.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[A new method to compute the determinantal polynomial coefficients of a matrix (Symmetric Normalized Kirchhoff matrix) of a complete graph]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2024-0008</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2024-0008</guid>
            <pubDate>Sun, 22 Dec 2024 00:00:00 GMT</pubDate>
            <description><![CDATA[In this article, we have calculated the coeffcients of the characteristic (determinantal) polynomial for a complete graph by considering the vertex number and using the eigenvalues of the normalized matrix. Additionally, we have obtained upper and lower bounds for the normalized eigenvalue of a complete graph. Furthermore, we present algorithms for these calculations.]]></description>
            <category>ARTICLE</category>
        </item>
        <item>
            <title><![CDATA[Determining chromatic index of cubic graph with the use of explainable classifiers: A comparative study]]></title>
            <link>https://reference-global.com/article/10.2478/jamsi-2024-0006</link>
            <guid isPermaLink="false">/article/10.2478/jamsi-2024-0006</guid>
            <pubDate>Sun, 22 Dec 2024 00:00:00 GMT</pubDate>
            <description><![CDATA[Proper edge 3-coloring of a cubic graph is an NP-complete problem, which can be used in order to model several interesting practical problems. A method for correct and efficient assigning of variables used in the program to registers of the system, scheduling of a set of tasks to a set of processors while each task has to be executed on a number of processors simultaneously, or frequency assignment of radio stations without interference are all typical instances of problems modelled by graph coloring. When considering cubic graphs, which consist of vertices incident to precisely three edges, we can identify two distinct graph groups divided by their chromatic index, a minimal number of colors needed for the proper coloring of such graph. In the research presented in this article, we conduct a comparative study of the effectiveness of machine learning classifiers in the task of determining the chromatic index of cubic graphs, present an evaluation of the accuracy and precision of these models, and use the Shapley Additive Explanations model for the identification of graph attributes and their values crucial in the models’ decision making.]]></description>
            <category>ARTICLE</category>
        </item>
    </channel>
</rss>