International Journal of Mathematical Analysis and Research
type: channel
description: International Journal of Mathematical Analysis and Research (IJMAR) is a scientific, double-blind, peer-reviewed international journal that typically focuses on advanced mathematical theories and techniques. In the area of mathematical analysis, the journal aims to offer a venue for the publishing of innovative research. The journal aims to foster intellectual exchange among mathematicians, researchers, and practitioners worldwide by showcasing the latest developments, innovative methods, and theoretical advancements in mathematical analysis. IJMAR aspires to contribute to the growth and dissemination of knowledge in mathematical analysis seeks to advance and spread novel concepts, approaches, and solutions, bridging the gap between pure and applied mathematics. It also seeks to highlight interdisciplinary connections, showcasing how advanced mathematical analysis can be employed to solve problems in science, engineering, computer sciences and technology.
language: en
publication name: International Journal of Mathematical Analysis and Research
items: Application of Hybrid Fixed Point Theorems for (α,β)-admissible Mappings in Nonlinear Integral Equations of Controlled Metric Spaces
items: Mathematical Optimization Techniques for AI-Enabled Resource Allocation in Cloud Platforms
items: Convex Optimization Methods for Privacy-Preserving Federated Learning
items: Chaos-Theoretic Analysis of Blockchain Consensus Mechanisms
items: Mathematical Statistics Approaches for Explainable Artificial Intelligence Models
items: Deep Learning-Based Numerical Solutions for Nonlinear Partial Differential Equations in Fluid Dynamics
items: Computational Mathematics Approaches for Dynamic Inventory Optimization
items: Development of a Reduced Fuzzy Soft Set Mathematical Framework for Transforming Fuzzified Acoustic Voice Data into Parameterized Diagnostic Structures
items: Exploring Fuzzy Associative Models: A Fuzzy Logic Approach to Handling Complex, Uncertain Data
items: Genetic Algorithm Optimized Fuzzy N-Policy Queue Using α-Cut based Performance Analysis
items: Data-Driven Software Quality Assurance: Leveraging Machine Learning for Risk Prediction and Test Optimization
items: A Mixed-Integer Linear Programming Model for Green Vehicle Routing Problems
items: Critical Analysis of Field Theory
items: Total Edge Irregularity Strength of Some Graphs
items: (1, 2)*-Weakly Delta Generalized Beta-Compactness and Connectedness in Bitopological Spaces
items: Edge Total Mean Labeling of Graphs
items: Multiobjective Optimization in Fractional Calculus: Theoretical and Computational Advances
items: Mathematical Modelling of Quantum Information Systems Using Operator Algebra Techniques
items: Analytical Framework for Hybrid Systems Using Discrete-Time Markov Chain Approaches
items: A Multi-Scale Computational Study on the Fracture Mechanics of Fiber-Reinforced Geopolymer Composites for Seismic Applications
items: A Hybrid Analytic-Numeric Framework For Optimization In Constrained Multivariate Systems

Application of Hybrid Fixed Point Theorems for (α,β)-admissible Mappings in Nonlinear Integral Equations of Controlled Metric Spaces
type: item
description: This paper introduces novel hybrid fixed point theorems for (α,β)-admissible mappings within the framework of controlled metric spaces. We establish the existence and uniqueness of fixed points for a special class of hybrid contractions that combine Ćirić-Reich-Rus type contractions with Suzuki-type conditions under weakened contraction hypotheses. The controlled metric space setting, being a significant abstraction of classical metric spaces, allows for more flexible distance measurements through control functions. Our main results extend many existing fixed point theorems in the literature and provide less restrictive sufficient conditions for the existence of fixed points. Furthermore, we demonstrate the applicability of our theoretical findings by establishing the existence and uniqueness of solutions to a special class of nonlinear Volterra-Fredholm integral equations arising in population dynamics and mathematical biology. Illustrative examples with numerical computations validate our theoretical results and demonstrate their practical utility.
subject: Articles
  topic: section
subject: Constraction
  topic: keywords
subject: Nonlinear
  topic: keywords
subject: Controlled Metric Space
  topic: keywords
subject: (α,β)-Admissible Mapping
  topic: keywords
subject: Hybrid Contraction
  topic: keywords
subject: Fixed Point Theorem
  topic: keywords
subject: Volterra-Fredholm Integral Equation
  topic: keywords
subject: Existence and Uniqueness
  topic: keywords
creator: SATISH KUMAR
rights: Copyright (c) 2026 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2026-08-05
publication date: 2026-08-05
starting page: 11
ending page: 16
doi: 10.64137/3108-2637/IJMAR-V2I3P102

Mathematical Optimization Techniques for AI-Enabled Resource Allocation in Cloud Platforms
type: item
description: The explosive growth of cloud computing and artificial intelligence (AI) has driven demands for effective resource allocation mechanisms that can adapt to dynamic workloads, diverse infrastructure, and changing user patterns. Traditional resource allocation methods usually have difficulty in precisely utilizing computing resources while preserving quality service, minimizing operational expenses and following strict specification limits. To solve these problems in a systematic manner, we formulate resource allocation as an optimization problem where resource usage can be optimally managed while minimizing objectives such as the wastage of said resources or energy consumption, which impacts swiftness during computation (latency), and operational cost, hence maximizing performance and utilization against certain constraints using mathematical formulation techniques. In this research, we investigate the use of mathematical optimization methods in AI-based cloud resource allocation. AI models can enable workload predictions, and techniques such as linear programming, integer-based solutions (e.g., mixed-integer nonlinear optimization), convex-based non-linearoptimization problems or algorithm approaches, but also multi-objective optimizations to help guide decision-making or heuristic approaches. Prediction mechanisms powered by AI can help anticipate demand for resources over time, and optimization algorithms tell the system how to technically allocate virtual machines, containers, storage or network. With the synergy of these approaches, cloud platforms can now dynamically adapt their resource allocation to volatile workloads. The new framework lets cloud platforms intelligently and mathematically optimize their resource management, leading to a more efficient, scalable, reliable and sustainable system. Together, predictive AI capabilities with optimization-based decision-making can help the cloud providers achieve better workload balancing, leading to low energy cons…
subject: Articles
  topic: section
subject: Mathematical Optimization
  topic: keywords
subject: Artificial Intelligence
  topic: keywords
subject: Cloud Computing
  topic: keywords
subject: Resource Allocation
  topic: keywords
subject: AI-Enabled Resource Management
  topic: keywords
subject: Linear Programming
  topic: keywords
subject: Multi-Objective Optimization
  topic: keywords
subject: Workload Prediction
  topic: keywords
subject: Resource Utilization
  topic: keywords
subject: Cloud Platforms
  topic: keywords
subject: Energy Efficiency
  topic: keywords
subject: Quality of Service
  topic: keywords
creator: MOHAMED RIYAZ ASLAM
creator: JENILIYA
rights: Copyright (c) 2026 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2026-07-08
publication date: 2026-07-08
starting page: 01
ending page: 10
doi: 10.64137/3108-2637/IJMAR-V2I3P101

Convex Optimization Methods for Privacy-Preserving Federated Learning
type: item
description: Federated Learning (FL) has emerged as a revolutionary paradigm in distributed machine learning, enabling multiple decentralized clients to collaboratively train models without sharing their local raw data. Despite its inherent privacy-centric design, FL remains vulnerable to sophisticated privacy attacks, such as gradient leakage and membership inference, which can reconstruct sensitive user data from communicated model updates. In order to reduce these vulnerabilities, we integrate privacy-preserving mechanisms most notably Differential Privacy (DP) and Cryptographic Protocols into the training procedure. These privacy constraints, however, come with utility loss and convergence slowdown thus highlighting a basic conflict between (differential) privacy on one side and high-order model accuracy and efficiency at another. In our paper, we carefully examine how to use convex optimization methods systematically in terms of performing this rich multi-dimensional trade-off. We center around the rigorous implementation of privacy-preserving FL couched as a bounded convex optimization task, studying how traditional and state-of-the-art optimization algorithms retain strong convergence rates even under durable privacy constraints. We benchmark the performance of these primary optimization frameworks, such as FedAvg, FedProx, and Accelerated Gradient Methods, when adopted on different privacy budgets. Theoretically, we analyze the impact of differential privacy on gradient variance in algorithms and experimentally validate how adaptive optimization (Specifically by AMSGrad) and proximal regularization can account for this noise-induced increase to enable faster convergence with a tight guarantee of differential privacy. To summarize, this work provides a unified approach for aiding the design of state-of-the-art privacy-preserving distributed learning systems that are also utility-optimal and is an important step towards using such approaches in high-stakes domains like hea…
subject: Articles
  topic: section
subject: Federated Learning
  topic: keywords
subject: Convex Optimization
  topic: keywords
subject: Differential Privacy
  topic: keywords
subject: Proximal Gradient
  topic: keywords
subject: Convergence Analysis
  topic: keywords
subject: Privacy-Preserving Machine Learning
  topic: keywords
creator: M ANBARASAN
creator: NITISH KUMAR
rights: Copyright (c) 2026 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2026-06-01
publication date: 2026-06-01
starting page: 20
ending page: 26
doi: 10.64137/3108-2637/IJMAR-V2I2P104

Chaos-Theoretic Analysis of Blockchain Consensus Mechanisms
type: item
description: Distributed ledger technologies rely heavily on consensus mechanisms to maintain a synchronized, tamper-resistant, and decentralized state across a network of mutually untrusted nodes. Conventionally, analyses of these mechanisms concentrate on cryptographic security, equilibrium in game theory, and network latency but often consider system dynamics to be linear predictable or stationary. This paper applies chaos theory to provide an integrated complex systems framework for the nonlinear, dynamic behaviors of three classical blockchain consensus paradigms: Proof of Work (PoW), Proof-of-Stake (PoS), and Byzantine Fault Tolerance (BFT). Through nonlinear feedback loops modeling transaction flows, validator behaviors, and fork-generation processes under the right boundary conditions local computational or stake centralization, sudden network propagation delays, and targeted malicious adversarial perturbations- we prove that deterministic chaos is self-generating. Employing state-space reconstructions, sensitivity analyses to initial conditions, and qualitative descriptions of phase trajectories, this work charts the transition between stable decentralized consensus phases as echoed through chaotic divergence or quasi-permanent chain splits. Results identify major flaws in classical protocols and provide principles to design the next-generation robust chaos-tolerant distributed architectures.
subject: Articles
  topic: section
subject: Blockchain Consensus
  topic: keywords
subject: Chaos Theory
  topic: keywords
subject: Nonlinear Dynamics
  topic: keywords
subject: Proof Of Work
  topic: keywords
subject: Proof Of Stake
  topic: keywords
subject: Distributed Systems
  topic: keywords
subject: Network Resilience
  topic: keywords
creator: J. ANDERSON
rights: Copyright (c) 2026 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2026-06-07
publication date: 2026-06-07
starting page: 12
ending page: 19
doi: 10.64137/3108-2637/IJMAR-V2I2P103

Mathematical Statistics Approaches for Explainable Artificial Intelligence Models
type: item
description: Explainable Artificial Intelligence (XAI) has emerged as a critical research area for improving the transparency, interpretability, fairness, and reliability of machine learning systems. As artificial intelligence models become increasingly complex, especially deep learning architectures, understanding the statistical foundations behind model behavior becomes essential for trustworthy decision-making. This paper explores the role of mathematical statistics in developing and evaluating explainable AI models. The study examines statistical inference, probability theory, hypothesis testing, Bayesian methods, regression analysis, feature importance estimation, uncertainty quantification, and causal inference as fundamental tools for interpretability. Furthermore, the paper discusses how statistical techniques contribute to local and global explanations, model validation, fairness assessment, and robustness analysis. Several widely used XAI methods, including SHAP, LIME, partial dependence plots, and counterfactual explanations, are analyzed from a statistical perspective. The paper also highlights challenges such as interpretability–accuracy trade-offs, bias propagation, high-dimensional data complexity, and uncertainty in explanations. Finally, future directions involving probabilistic explainability, statistical learning theory, and human-centered AI are presented. This work aims to bridge the gap between mathematical statistics and explainable artificial intelligence by providing a comprehensive framework for statistically grounded and trustworthy AI systems.
subject: Articles
  topic: section
subject: Explainable Artificial Intelligence (XAI)
  topic: keywords
subject: Mathematical Statistics
  topic: keywords
subject: Statistical Inference
  topic: keywords
subject: Machine Learning Interpretability
  topic: keywords
subject: Bayesian Statistics
  topic: keywords
subject: Feature Importance
  topic: keywords
subject: SHAP
  topic: keywords
subject: LIME
  topic: keywords
subject: Uncertainty Quantification
  topic: keywords
subject: Causal Inference
  topic: keywords
subject: Transparent AI
  topic: keywords
subject: Trustworthy AI
  topic: keywords
subject: Model Explainability
  topic: keywords
subject: Statistical Learning
  topic: keywords
subject: Fairness in AI
  topic: keywords
creator: JENIFAR DEVASAGAYAM
rights: Copyright (c) 2026 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2026-03-27
publication date: 2026-03-27
starting page: 37
ending page: 43
doi: 10.64137/3108-2637/IJMAR-V2I1P105

Deep Learning-Based Numerical Solutions for Nonlinear Partial Differential Equations in Fluid Dynamics
type: item
description: Nonlinear partial differential equations (PDEs) play a vital role in modeling complex fluid dynamics phenomena such as turbulence, heat transfer, and flow instability. Traditional numerical approaches, including finite difference and finite element methods, often require extensive computational resources and may struggle with large-scale or real-time simulations. Recent advancements in deep learning have introduced efficient alternatives for solving nonlinear PDEs through data-driven and physics-informed approaches. This paper presents a comprehensive study of deep learning-based numerical solutions for nonlinear PDEs in fluid dynamics. The proposed framework integrates neural network architectures with physics informed constraints to accurately approximate fluid behavior while reducing computational complexity. Various deep learning models, including Physics-Informed Neural Networks (PINNs), Deep Operator Networks, and Fourier Neural Operators, are analyzed and compared with conventional numerical techniques. Experimental results demonstrate improved prediction accuracy, faster convergence, and enhanced scalability in solving complex fluid flow problems. The study further discusses practical applications, current limitations, and future research opportunities in AI-driven scientific computing for fluid dynamics.
subject: Articles
  topic: section
subject: Deep Learning
  topic: keywords
subject: Fluid Dynamics
  topic: keywords
subject: Nonlinear Partial Differential Equations
  topic: keywords
subject: Physics-Informed Neural Networks (PINNs)
  topic: keywords
subject: Numerical Simulation
  topic: keywords
subject: Navier Stokes Equations
  topic: keywords
subject: Scientific Computing
  topic: keywords
subject: Fourier Neural Operators
  topic: keywords
subject: Deep Operator Networks
  topic: keywords
subject: Computational Fluid Dynamics (CFD)
  topic: keywords
creator: M. SATHISH KUMAR
rights: Copyright (c) 2026 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2026-03-25
publication date: 2026-03-25
starting page: 27
ending page: 36
doi: 10.64137/3108-2637/IJMAR-V2I1P104

Computational Mathematics Approaches for Dynamic Inventory Optimization
type: item
description: Dynamic inventory optimization has become a critical research area in modern supply chain management due to fluctuating market demand, uncertain supply conditions, and increasing operational complexity. Computational mathematics provides powerful techniques for modeling, analyzing, and optimizing inventory systems in dynamic environments. This paper explores various computational mathematics approaches for dynamic inventory optimization, including linear programming, integer programming, dynamic programming, stochastic modeling, and metaheuristic algorithms. The study also examines the integration of machine learning and predictive analytics for improving demand forecasting and adaptive inventory control. A mathematical framework is proposed to minimize inventory-related costs while maintaining high service levels and operational efficiency. Experimental analysis and comparative evaluations demonstrate the effectiveness of computational optimization methods in reducing holding costs, avoiding stock shortages, and improving decision-making accuracy. The paper further discusses practical applications in retail, manufacturing, healthcare, and e-commerce sectors, along with current challenges and future research opportunities in intelligent inventory management systems.
subject: Articles
  topic: section
subject: Dynamic Inventory Optimization
  topic: keywords
subject: Computational Mathematics
  topic: keywords
subject: Supply Chain Management
  topic: keywords
subject: Linear Programming
  topic: keywords
subject: Dynamic Programming
  topic: keywords
subject: Inventory Control
  topic: keywords
subject: Metaheuristic Algorithms
  topic: keywords
subject: Machine Learning
  topic: keywords
subject: Demand Forecasting
  topic: keywords
creator: B. SHAFINA
rights: Copyright (c) 2026 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2026-03-23
publication date: 2026-03-23
starting page: 16
ending page: 26
doi: 10.64137/3108-2637/IJMAR-V2I1P103

Development of a Reduced Fuzzy Soft Set Mathematical Framework for Transforming Fuzzified Acoustic Voice Data into Parameterized Diagnostic Structures
type: item
description: This paper analyses the development of a reduced fuzzy soft mathematical framework for modelling and detecting vocal disorder risk using clinical data. The paper presents a mathematically grounded fuzzy soft expert system for the quantitative assessment of vocal disorder risk based on acoustic and demographic parameters. Let = { denote a finite universe of patients and denote the parameter set comprising fundamental frequency, vocal perturbation index, and age. Clinical acoustic data were collected and represented as a dataset Linguistic variables were obtained by the process of fuzzification using the appropriate designed membership functions assessment model. For each, a fuzzy membership function is constructed using continuous triangular membership function to represent linguistic classifications. The fuzzified linguistic variables were further transformed into soft set using discrete α-cut levels. Discrete α-cut levels are employed to generate parameterized soft sets, which are subsequently reduced using redundancy elimination criteria derived from soft set theory. The reduced parameter sets preserve essential diagnostic information while minimizing computational complexity. The resulting mathematical framework provides a systematic method for organizing acoustic information without enforcing binary classification. The mathematical formulation preserves uncertainty, enables modelling of multiple parameter interaction and prepares the dataset for advanced diagnostic inference. The mathematically technique is consistent, scalable, and suitable for biomedical applications involving imprecise data.
subject: Articles
  topic: section
subject: Fuzzy- Soft Set Framework
  topic: keywords
subject: Vocal Disorder Assessment
  topic: keywords
subject: Fuzzification
  topic: keywords
subject: Clinical Acoustic Analysis
  topic: keywords
subject: Α-Cut Analysis
  topic: keywords
subject: Parameter Reduction
  topic: keywords
creator: OKIGBO C. J
creator: ONYEOZILI I. A
creator: ADENIJI A.O.
rights: Copyright (c) 2026 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2026-04-15
publication date: 2026-04-15
starting page: 6
ending page: 11
doi: 10.64137/3108-2637/IJMAR-V2I2P102

Exploring Fuzzy Associative Models: A Fuzzy Logic Approach to Handling Complex, Uncertain Data
type: item
description: Fuzzy Associative Models (FAMs) leverage fuzzy logic to effectively represent uncertain and imprecise knowledge in a compact, interpretable form. By accommodating the inherent ambiguity of real-world data, FAMs excel in applications where relationships between variables are complex, nonlinear, and uncertain. This makes them a powerful tool for handling real-world complexities, enabling more nuanced decision-making and problem-solving in fields like AI, data analysis, and beyond.
subject: Articles
  topic: section
subject: FAM
  topic: keywords
subject: AI
  topic: keywords
subject: Memory
  topic: keywords
subject: Data
  topic: keywords
subject: Output variables
  topic: keywords
creator: VENKATESAN C.
creator: VIMALA J.
rights: Copyright (c) 2026 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2026-04-12
publication date: 2026-04-12
starting page: 1
ending page: 5
doi: 10.64137/3108-2637/IJMAR-V2I2P101

Genetic Algorithm Optimized Fuzzy N-Policy Queue Using α-Cut based Performance Analysis
type: item
description: In real-life queueing systems, many parameters such as arrival rate and service rate are often uncertain or imprecise. To handle such uncertainty, fuzzy set theory provides an effective framework for modelling queueing systems. In this paper, an N-policy M/M/1 queueing model is studied in a fuzzy environment where system parameters are represented as fuzzy numbers. The α-cut approach is employed to transform the fuzzy parameters into interval values, allowing the evaluation of system performance measures such as the expected queue length and waiting time. To obtain the optimal operating policy, a Genetic Algorithm (GA) is applied to determine the optimal threshold value of that minimizes the total system cost. The proposed method combines fuzzy modeling with evolutionary optimization to improve decision-making under uncertainty. Numerical illustrations and graphical analysis are provided to demonstrate the effectiveness of the proposed approach. The results show that the integration of α-cut based fuzzy analysis with Genetic Algorithm optimization provides a flexible and efficient method for determining optimal policies in uncertain queueing environments.
subject: Articles
  topic: section
subject: Fuzzy Queueing System
  topic: keywords
subject: N-Policy
  topic: keywords
subject: Α-Cut Method
  topic: keywords
subject: Genetic Algorithm
  topic: keywords
subject: M/M/1 Queue
  topic: keywords
subject: Optimization
  topic: keywords
subject: Performance Measures
  topic: keywords
creator: NIDHI SHARMA
creator: NAVEEN KUMAR
rights: Copyright (c) 2026 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2026-03-20
publication date: 2026-03-20
starting page: 9
ending page: 15
doi: 10.64137/3108-2637/IJMAR-V2I1P102

Data-Driven Software Quality Assurance: Leveraging Machine Learning for Risk Prediction and Test Optimization
type: item
description: Software quality assurance is undergoing a structural transition from manually orchestrated verification toward continuously adaptive, data-driven assurance. Contemporary software systems evolve under tight release cadences, heterogeneous architectures, volatile workloads, and increasing security exposure, making uniform testing strategies economically unsustainable and technically inefficient. This paper develops a literature-grounded research framework for data-driven software quality assurance that integrates machine learning based risk prediction with intelligent test optimization. The central argument is that modern quality engineering should no longer treat defect prediction, regression testing, observability, and governance as separate activities. Instead, these capabilities should operate as a closed feedback system in which code, process, runtime, and business-context signals are fused to prioritize the highest-risk components and allocate testing effort dynamically. Building on prior work in software defect prediction, test prioritization, observability, AI governance, enterprise automation, and domain-specific intelligent systems, the paper proposes a multi-layer architecture that links feature engineering, risk scoring, test selection, feedback learning, and operational controls. It further shows that patterns demonstrated in cloud-native pharmacy, healthcare, manufacturing, finance, and cyber-physical settings provide transferable insights for software assurance, particularly around traceability, secure microservices, anomaly monitoring, and deployment optimization. The paper contributes a unified conceptual model, a risk-to-test prioritization formulation, an implementation-oriented pipeline, and a research agenda for robust, explainable, and operationally grounded machine learning in quality engineering. The framework is intended for practitioners and researchers seeking to improve defect discovery efficiency, reduce waste in testing, and align softwa…
subject: Articles
  topic: section
subject: Software Quality Assurance
  topic: keywords
subject: Software Defect Prediction
  topic: keywords
subject: Machine Learning
  topic: keywords
subject: Risk Prediction
  topic: keywords
subject: Test Optimization
  topic: keywords
subject: Regression Testing
  topic: keywords
subject: Observability
  topic: keywords
subject: Mlops
  topic: keywords
subject: Intelligent Automation
  topic: keywords
creator: NISHA VARMA
creator: ROHIT CHANDRA
creator: SANDEEP IYER
creator: POOJA NARAYANAN
rights: Copyright (c) 2026 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2026-01-02
publication date: 2026-01-02
starting page: 1
ending page: 8
doi: 10.64137/3108-2637/IJMAR-V2I1P101

A Mixed-Integer Linear Programming Model for Green Vehicle Routing Problems
type: item
description: The growing environmental impact of transportation and logistics has prompted increasing attention to sustainable routing practices. This study addresses the Green Vehicle Routing Problem (G-VRP) by developing a Mixed-Integer Linear Programming (MILP) model that simultaneously minimizes travel distance, fuel consumption, and carbon emissions while satisfying operational constraints such as vehicle capacity, route feasibility, and time windows. The proposed model is tested on benchmark instances and evaluated against traditional vehicle routing solutions, demonstrating substantial reductions in fuel use and environmental emissions without compromising service efficiency. Computational experiments highlight the trade-offs between operational efficiency and environmental sustainability, offering actionable insights for fleet managers seeking to implement eco-friendly routing strategies. The results also identify the scalability challenges and potential for integrating heuristic methods in larger transportation networks. This research contributes to both the theoretical understanding of green routing optimization and practical applications in sustainable logistics, providing a foundation for future studies on multi-objective, real-time, and electric vehicle routing systems.
subject: Articles
  topic: section
subject: Green Vehicle Routing Problem (G-VRP)
  topic: keywords
subject: Mixed-Integer Linear Programming (MILP)
  topic: keywords
subject: Sustainable Logistics
  topic: keywords
subject: Emission Reduction
  topic: keywords
subject: Fuel Consumption Optimization
  topic: keywords
subject: Eco-Friendly Routing
  topic: keywords
creator: SARANYA G
rights: Copyright (c) 2025 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2025-12-07
publication date: 2025-12-07
starting page: 32
ending page: 37
doi: 10.64137/31082637/IJMAR-V1I2P105

Critical Analysis of Field Theory
type: item
description: A detailed proof of the incorrectness of standard field theory (vector analysis) is proposed. The correct methodological basis for this proof is the unity of formal logic and rational dialectics. The unity of formal logic and rational dialectics is the only correct criterion of truth. The proof leads to the following irrefutable statement: standard field theory (vector analysis) is a gross error. Gross errors are as follows: (1) field theory is based on differential and integral calculus, which is an incorrect theory; (2) field theory is based on vector calculus, which is an incorrect theory; (3) field theory is formulated within the framework of a geometric coordinate system. But mathematical and physical quantities have no dimension “meter” and cannot be presented (be defined, exist) within the framework of a geometric coordinate system; (4) in the point of view of formal logic and dialectics, the concepts “field in abstracto” and “mathematical field” are identical and meaningless concepts. “Field in abstracto” and “mathematical field” have neither physical properties nor geometric properties; (5) the standard definition of a field is: “A field is a part of space, each point of which corresponds (conforms) to a certain value of some physical quantity”. In the point of view of formal logic, the term “correspondence” is meaningless. The subject-predicate conjunction in a definition must be either “is” or “is not”. Replacement of a dimensionless quantity in mathematical definitions and expressions by a dimensional quantity is an inadmissible operation; 6) a physical field has no points (i.e., values of a physical quantity) in a geometric coordinate system. A material point has coordinates, but a material point is not a point of a physical field. The error is in the assertion that the coordinates of a material point determine (define, identify) the value of a physical quantity; that the value of a physical quantity determines (defines, identifies) the coordinates of a…
subject: Articles
  topic: section
subject: Foundations of mathematics
  topic: keywords
subject: Vector and tensor analysis
  topic: keywords
subject: Field theory
  topic: keywords
subject: Foundations of theoretical physics
  topic: keywords
subject: Mathematical physics
  topic: keywords
subject: Philosophy of mathematics
  topic: keywords
creator: TEMUR Z. KALANOV
rights: Copyright (c) 2026 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2025-11-07
publication date: 2025-11-07
starting page: 21
ending page: 31
doi: 10.64137/31082637/IJMAR-V1I2P104

Total Edge Irregularity Strength of Some Graphs
type: item
description: An edge irregular total k-labeling of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any two different edges uv and u1v1 their weight and are distinct. The total edge irregularity strength, tes(G), is defined as the minimum k for which the graph G has an edge irregular total k-labeling. In this paper, we study the total edge irregularity strength of joint-Wheel graph WHn, < Wn : Wm > and path union of graph.
subject: Articles
  topic: section
subject: Irregularity Strength
  topic: keywords
subject: Total Edge Irregularity Strength
  topic: keywords
subject: Edge Irregular Total Labeling
  topic: keywords
creator: SUDHA A.
creator: JEYANTHI P.
rights: Copyright (c) 2025 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2025-11-05
publication date: 2025-11-05
starting page: 16
ending page: 20
doi: 10.64137/31082637/IJMAR-V1I2P103

(1, 2)*-Weakly Delta Generalized Beta-Compactness and Connectedness in Bitopological Spaces
type: item
description: In this chapter, the concepts of (1,2)*-weakly delta generalized beta-compactness and (1,2)*-weakly delta-generalized beta-connectedness are introduced, and some characterizations of (1,2)*-weakly delta-generalized beta-compactness and (1,2)*-weakly delta-generalized beta-connectedness are investigated. Also, their properties are discussed. Further, it is proven that (1,2)*-weakly delta-generalized beta-connectedness is preserved under (1,2)*-weakly delta-generalized beta-irresolute mappings.
subject: Articles
  topic: section
subject: (1,2)*-wδgβ-compactness
  topic: keywords
subject: (1,2)*-wδgβ-connectedness
  topic: keywords
subject: (1,2)*-wδgβ-irresolute map
  topic: keywords
creator: NANAMMAL C.
creator: ALLI K.
rights: Copyright (c) 2025 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2025-11-03
publication date: 2025-11-03
starting page: 10
ending page: 15
doi: 10.64137/31082637/IJMAR-V1I2P102

Edge Total Mean Labeling of Graphs
type: item
description: In this paper, we introduce a new labeling edge total mean labeling. An edge total mean labeling f: V ∪ E → {1, 2, ..., p + q} of a graph G = G(V, E) is a labeling of vertices and edges of a graph in such a way that for any two different edges uv and u' v' their mean and are distinct and the result in edge total means varies from 1,2,. . . ,q. A graph G is edge total mean graph if it admits edge total mean labeling. In this paper, we introduce a concept of edge total mean labeling of some graphs.
subject: Articles
  topic: section
subject: Mean labeling
  topic: keywords
subject: Total labeling
  topic: keywords
subject: Total mean labeling
  topic: keywords
subject: Edge total mean labeling
  topic: keywords
subject: Cycle
  topic: keywords
subject: Wheel
  topic: keywords
subject: Helm
  topic: keywords
subject: Closed helm
  topic: keywords
subject: Double wheel
  topic: keywords
subject: Fan
  topic: keywords
subject: Double fan
  topic: keywords
subject: Gear
  topic: keywords
subject: Sun
  topic: keywords
subject: flower graphs
  topic: keywords
creator: SUDHA A.
rights: Copyright (c) 2025 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2025-10-22
publication date: 2025-10-22
starting page: 1
ending page: 9
doi: 10.64137/31082637/IJMAR-V1I2P101

Multiobjective Optimization in Fractional Calculus: Theoretical and Computational Advances
type: item
description: Multiobjective optimization in fractional calculus has made important developments, mainly due to the addition of fractional operators to complex optimization methods. Some recent research has applied fractional differential-difference operators to generalize traditional optimization ideas, forming new groups of functions known as local fractional Univex functions. As a result, people can build strong, weak, and converse duality theorems for multiobjective fractional problems, which provide advancement in solving mathematically complex non-convex and non-smooth optimization problems. Robust optimization methods have been applied to multiobjective fractional programming to consider uncertain data and to introduce conditions called ε-optimality and robust ε-saddle points for weakly efficient solutions. With regard to computation, using Branch-and-Cut methods has made it possible to speed up optimization on linear fractional functions by removing inadequate solutions from efficient sets of integer quadratic problems. Such numerical methods have made it easier to solve fractional derivatives with great precision and now support applications in wave propagation, models of viscoelastic materials, and machine learning. New optimization techniques make it easier to solve multiple challenges by lowering computational effort without sacrificing the accuracy of results. All these changes together join theory and practice, giving new tools to areas where mismatched objectives and fractional mathematics are important.
subject: Articles
  topic: section
subject: Multiobjective optimization
  topic: keywords
subject: Fractional calculus
  topic: keywords
subject: Duality theorems
  topic: keywords
subject: Branch-and-Cut
  topic: keywords
subject: Numerical methods
  topic: keywords
subject: Robust optimization
  topic: keywords
subject: Univex functions
  topic: keywords
subject: Spectral approximations
  topic: keywords
creator: BALAGANESAN M.
rights: Copyright (c) 2025 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2025-08-25
publication date: 2025-08-25
starting page: 38
ending page: 47
doi: 10.64137/31082637/IJMAR-V1I1P105

Mathematical Modelling of Quantum Information Systems Using Operator Algebra Techniques
type: item
description: Quantum information theory has become a central area in the two fields of quantum mechanics and information science. The focus of this work is mathematical modelling of quantum information with the use of operator algebras, in a way that accentuates the modelling, and acting or manipulation of observables and quantum states. The fundamental aim is to utilise C*-algebras, von Neumann algebras, and other frameworks in operator algebra to formally describe the behaviour of quantum systems, understand the nature of quantum entanglement, and support quantum error correction. Operator algebra usage provides a firm mathematical foundation that guarantees accuracy and contributes to the incorporation of topological mechanisms and algebraic rules necessary for explaining noncommutative concepts in quantum mechanics. In this paper, we will present some original notions of operator algebra and explain their usefulness when it comes to modeling the key dynamics, features of quantum states, measurement, and evolution. We will use a method that combines algebraic techniques to chart qubit interactions, entropic inequalities, and characterize transformations of level in unitary evolution. Through the use of Hilbert spaces and bounded linear operators, we build models in multi-qubit systems and see what the specifications have to say about quantum computing and quantum communication protocols. The paper provide a comprehensive discussion, including algebraic formulations, simulation outputs, and a critical comparison with traditional Hilbert space methods. It is quite notable that the operator algebras can say more about the non-local correlations and decoherence processes. There are extensive literature reviews, useful modelling tools, and implementation outcomes in the paper when symbolic computation tools have been utilised. This combination gives both theoretical strength and modelling instruments to develop quantum technologies in the future.
subject: Articles
  topic: section
subject: Quantum information systems
  topic: keywords
subject: Operator algebra
  topic: keywords
subject: C*-algebra
  topic: keywords
subject: von Neumann algebra
  topic: keywords
subject: Quantum entanglement
  topic: keywords
subject: Hilbert space
  topic: keywords
subject: Quantum computing
  topic: keywords
subject: Algebraic modelling
  topic: keywords
subject: Noncommutative geometry
  topic: keywords
creator: KIRUBAHARAN D.R.
rights: Copyright (c) 2025 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2025-08-22
publication date: 2025-08-22
starting page: 29
ending page: 37
doi: 10.64137/31082637/IJMAR-V1I1P104

Analytical Framework for Hybrid Systems Using Discrete-Time Markov Chain Approaches
type: item
description: Continuous or discrete dynamics with their interaction have been called hybrid systems and are ubiquitous in the design of many complex systems today, including cyber-physical systems, automated control systems and real-time embedded systems. The twofold nature of such state evolution presents these systems with peculiar problems of verification, control, and analysis. Also in this paper, I present an analytical model that uses the Discrete-Time Markov Chains (DTMCs) to model, analyze and predict the behaviour of the hybrid systems. DTMCs offer a probabilistic modeling framework which is capable of describing the stochastic dynamics of discrete hybrids efficiently and in a very elegant manner. The framework suggests a new approach to discretizing the ongoing dynamics and incorporating them in a DTMC-based analysis framework. The suggested approach is building transition probability matrices, a probabilistic state-space description and verification with the help of model checking techniques. The framework also uses a method of partitioning the continuous state space, resulting in abstract states which become an input to the DTMC model. The relevance of the framework is proved, inter alia, by several case studies of building temperature control systems, robotic navigation, and fault detection of automated systems. The results of the simulation depict the high level of accuracy and efficiency of the simulations compared to the traditional methods of hybrid system solvers. The key contributions of the paper can be listed as the follows: (1) A generalization of DTMC-based modeling strategy to hybrid systems, (2) A probabilistic abstraction approach to continuous systems, (3) Probabilistic verification approaches using PCTL (Probabilistic Computation Tree Logic), and (4) A case study evaluation. The paper is a contribution towards the reconciliation of deterministic modeling of hybrid systems with probabilistic verification methods and is of use when put to practice by en…
subject: Articles
  topic: section
subject: Hybrid systems
  topic: keywords
subject: Discrete-time markov chain
  topic: keywords
subject: Probabilistic model checking
  topic: keywords
subject: Cyber-physical systems
  topic: keywords
subject: State-space partitioning
  topic: keywords
subject: PCTL
  topic: keywords
subject: System reliability
  topic: keywords
creator: ANBARASAN M.
creator: KIRUBAHARAN D.R.
rights: Copyright (c) 2025 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2025-08-15
publication date: 2025-08-15
starting page: 18
ending page: 28
doi: 10.64137/31082637/IJMAR-V1I1P103

A Multi-Scale Computational Study on the Fracture Mechanics of Fiber-Reinforced Geopolymer Composites for Seismic Applications
type: item
description: GPCs (geopolymer composites with fibers) are now being recognized as smart replacements for traditional cement products, especially in seismic situations that need more fracture resistance and energy absorption. To investigate the fracture behavior of fiber-reinforced GPCs, this study examines them through micro-scale simulations, meso-scale analysis and large-scale simulations. There is an assessment of steel, glass, polypropylene and hybrid fibers to understand their effect on how the matrix interacts, how Cracks Bridge and the failure patterns during cyclic loading. Experimental results are used to test if the simulation accurately predicts tensile strength, fracture energy and crack development. The impacts of fiber alignment, content and interface bonding on both stress and damage are simulated at a micro-scale. Meso-scale modeling points out that fiber pullout and bridging improve crack resistance, whereas macro-scale analysis measures how well structural elements deal with load and seismic pressure. The work includes using parametric analysis to explore the effects that different types of fibers have on the structure and proves the connection between its microstructure and how the structure functions. Data shows that fiber-reinforced GPCs perform much better under fracture than traditional concrete, making them suitable for earthquake-proof structures. Based on the findings, engineers can improve and design better sustainable composite materials used in civil engineering.
subject: Articles
  topic: section
subject: Fiber-reinforced geopolymer composites
  topic: keywords
subject: Fracture mechanics
  topic: keywords
subject: Multi-scale modeling
  topic: keywords
subject: Seismic performance
  topic: keywords
subject: Cohesive zone modeling
  topic: keywords
subject: Crack propagation
  topic: keywords
subject: Energy dissipation
  topic: keywords
subject: RVE analysis
  topic: keywords
subject: Structural simulation
  topic: keywords
subject: Sustainable construction materials
  topic: keywords
creator: RATHINABAGHYA P.
rights: Copyright (c) 2025 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2025-08-10
publication date: 2025-08-10
starting page: 9
ending page: 17
doi: 10.64137/31082637/IJMAR-V1I1P102

A Hybrid Analytic-Numeric Framework For Optimization In Constrained Multivariate Systems
type: item
description: This paper explains a method that uses both calculation and analysis to handle optimization problems in restricted multi-variable systems. By combining global stochastic methods with local algorithms, the framework takes advantage of the benefits of Bayesian optimization for global searching and interior-point algorithms for smooth convergence. Gaussian process regression is used to form surrogate models, which allows for exploring the design space probabilistically, while IPOPT is applied to refine candidate solutions that look promising. Making use of both global and local approaches helps resolve the obstacles of each (such as large costs for global and limited success for local approaches). Through case studies on both constrained Ackley functions and industrial energy systems, it is shown that the proposed framework performs exceptionally well, as it is 40% faster than traditional strategies. Penalty terms are used to process nonlinear constraints, and the method also uses nesting to reduce dimensions, allowing for fast processing of big data. These results support the view that Q-learning succeeds in managing how it learns new behaviors versus how it takes advantage of learned strategies in domains with both nonconvex goals and traces of boundaries.
subject: Articles
  topic: section
subject: Hybrid optimization
  topic: keywords
subject: Constrained multivariate systems
  topic: keywords
subject: Bayesian optimization
  topic: keywords
subject: Interior-point methods
  topic: keywords
subject: Gaussian process regression
  topic: keywords
subject: Global-local synergy
  topic: keywords
creator: SOWMIYA R.
rights: Copyright (c) 2025 https://creativecommons.org/licenses/by-nc-nd/4.0
date: 2025-08-05
publication date: 2025-08-05
starting page: 1
ending page: 8
doi: 10.64137/31082637/IJMAR-V1I1P101