International Journal of Mathematical Sciences and Computing (IJMSC)

ISSN: 2310-9025 (Print)

ISSN: 2310-9033 (Online)

DOI: https://doi.org/10.5815/ijmsc

Website: https://www.mecs-press.org/ijmsc

Published By: MECS Press

Frequency: 4 issues per year

Number(s) Available: 48

(IJMSC) in Google Scholar Citations / h5-index

IJMSC is committed to bridge the theory and practice of mathematical sciences and computing. IJMSC publishes original, peer-reviewed, and high quality articles in the areas of mathematical sciences and computing. IJMSC is a well-indexed scholarly journal and is indispensable reading and references for people working at the cutting edge of mathematical sciences and computing applications.

 

IJMSC has been abstracted or indexed by several world class databases: Google Scholar, CrossRef, CNKI, Scilit, Baidu Scholar,  JournalTOCs, etc..

Latest Issue
Most Viewed
Most Downloaded

IJMSC Vol. 12, No. 3, Aug. 2026

REGULAR PAPERS

Optimizing Cybersecurity and Risk Management for Intrusion Mitigation in IoT Applications

By Mustapha Danjuma Suleiman

DOI: https://doi.org/10.5815/ijmsc.2026.03.01, Pub. Date: 8 Aug. 2026

This study presents a C*-algebraic framework for optimizing intrusion mitigation in Internet of Things (IoT) networks by integrating mathematical models for cyberattack propagation with optimization-based security strategies. Theoretical results demonstrate that the spectral radius of the attack operator ρ(A) governs the recovery of IoT networks under attack, where ρ(A) < 1 ensures system recovery, and ρ(A) ≥ 1 leads to persistent or growing attack impact. The framework combines blockchain-based trust, AI-driven intrusion detection systems (IDS), and Zero-Trust Architecture (ZTA) to provide a multi-layered, adaptive defence system. Unlike probabilistic models that simplify attack dynamics, this approach rigorously models threats using bounded linear operators, thereby offering scalability and robustness. Optimization ensures computational efficiency, making the model suitable for resource-constrained IoT environments, with the operator norm and the spectral radius acting as key constraints. Validation on real-world datasets such as CIC-IoT2023, UNSW-NB15, and BoT-IoT revealed that the AI-IDS models achieved near-perfect performance, while the unified model integrating blockchain, IDS, and ZTA showed an accuracy of 51.0

[...] Read more.
Software Reliability Allocation using FAHP and Trapezoidal Fuzzy Set Theory

By Ankita Deepak Kumar

DOI: https://doi.org/10.5815/ijmsc.2026.03.02, Pub. Date: 8 Aug. 2026

Reliability of a software system is an important attribute of software quality, and its importance has increased significantly due to the growing demand for high-quality software systems. Evaluating reliability during the design phase is essential for improving system performance and ensuring effective planning. At this stage, an important challenge is to identify suitable methods for achieving the desired reliability of the software system. Reliability allocation methods can be applied to assign reliability targets to individual components prior to the actual system design. To address this, a new hierarchical model is proposed that integrates the perspectives of users, software programmers, and software managers. The system is decomposed into multiple levels, including functions, programs, modules, and submodules, to enable systematic analysis. To handle uncertainty and vagueness in human judgments, the fuzzy analytic hierarchy process (FAHP) is employed, incorporating the geometric mean method with trapezoidal fuzzy numbers. The proposed approach determines reliable weights and effectively allocates reliability targets at each level. A comparison with the classical AHP method demonstrates that FAHP provides a more flexible and realistic representation by capturing uncertainty, making it more suitable for reliability allocation in complex software systems.

[...] Read more.
Linear Profile Decomposition for the Nonlinear Schrödinger Equation in Exterior Domains

By Rapheal Oladipo Fifelola Adedapo Kehinde Femi

DOI: https://doi.org/10.5815/ijmsc.2026.03.03, Pub. Date: 8 Aug. 2026

This paper establishes a linear profile decomposition for bounded sequences in the homogeneous Dirichlet–Sobolev space H ̇_D^1 (Ω), where Ω=R^3\O is the exterior of a smooth, compact obstacle O⊂R^3. Given a bounded sequence {fn}⊂H ̇_D^1 (Ω), we prove that, after passing to a subsequence, it decomposes as f_n=∑_(j=1)^J▒ϕ_n^j +w_n^J, where the profiles {ϕ_n^j} are asymptotically orthogonal and the remainder w_n^J vanishes in all Strichartz spaces L_t^q L_x^r as J→∞. The decomposition satisfies an exact energy identity ∥∇f_n ∥_(L^2)^2=∑_j^▒∥ ∇ϕ_n^j ∥_(L^2)^2+∥∇w_n^J ∥_(L^2)^2+o(1). Four distinct geometric concentration regimes are identified according to the behaviour of the scale sequence {λ_n^j} relative to the distance d(x_n^j ) to ∂Ω: profiles localised inside Ω; profiles dispersing to spatial infinity (limiting domain R^3); profiles concentrating deep inside Ω away from the boundary; and profiles concentrating near ∂Ω (limiting domain: a half-space). As an application, we prove small-data scattering in H ̇_D^1 (Ω) for the defocusing, energy-subcritical NLS i∂_t u+Δ_Ω u=|u|^(p-1) u with 1<p<5 and Dirichlet boundary condition. We emphasise that the NLS is a Hamiltonian (conservative) system: its energy is conserved, not decaying, and the scattering result follows from Strichartz estimates rather than from any dissipative mechanism. 

[...] Read more.
From Pixels to Processes: A Process Mining- Inspired Approach to Image Steganalysis

By Shikha Badhani Vinita Verma Manju Bhardwaj Sakeena Shahid Geetan Manchanda

DOI: https://doi.org/10.5815/ijmsc.2026.03.04, Pub. Date: 8 Aug. 2026

Steganography attempts to conceal messages in plain sight while steganalysis seeks to identify them or, more importantly, to extract the embedded data. Low-payload and spatially localized steganographic embedding is increasingly used to evade detection by classical steganalysis methods. While such strategies preserve global image statistics and remain visually imperceptible, they can disrupt natural pixel-level behavior. This work proposes a behavioral steganalysis framework inspired by process mining that detects image steganography by analyzing localized behavioral deviation using regional behavioral contrast and behavioral amplification. Experiments on lossless grayscale PNG images from the USC SIPI database and 10,000 images from the BOWS2 dataset using 1-bit LSB embedding show that the proposed framework reliably identifies steganographic embedding. On the USC SIPI dataset, conventional statistical detectors, including chi-square analysis and the StegExpose tool, showed limited detection capability under the evaluated localized embedding settings. Despite high perceptual quality of stego images (PSNR > 55 dB), significant behavioral deviation is consistently observed within embedded regions. These results demonstrate that the proposed process mining-inspired framework provides an interpretable and complementary direction for image steganalysis, particularly under low-payload and localized embedding scenarios.

[...] Read more.
CC-Shield: A Unified Confidential Computing Framework for Securing AI Model Training and Inference

By Gaurav Saxena

DOI: https://doi.org/10.5815/ijmsc.2026.03.05, Pub. Date: 8 Aug. 2026

Artificial-intelligence workloads increasingly process proprietary and personally identifiable data, yet conventional security controls protect data only at rest and in transit, leaving computation itself exposed. This paper presents CC-Shield, a five-layer confidential-computing architecture that combines hardware trusted execution environments (Intel SGX, AMD SEV-SNP), differentially private federated aggregation, remote attestation, encrypted model lifecycle management, and LSTM-based anomaly detection into a single, formally analysed defence-in-depth stack. We derive a closed-form leakage bound that jointly composes TEE side-channel capacity and differential-privacy noise, prove three attack-resistance theorems covering membership inference, model inversion, and active-adversary integrity, and connect security overhead to system throughput via a queuing-theoretic performance model. On ResNet-50/ImageNet, BERT-base/SST-2, and a clinical MLP on MIMIC-III, CC-Shield with differential privacy (ε=1) reduces membership-inference attack success to 51.8% (statistically indistinguishable from the 50% random-chance baseline at a 95% confidence half-width of approximately 1.0 percentage point over 10,000 attack queries), versus 71.3% for an unprotected baseline, while introducing only 11.9%-13.9% inference latency overhead – more than three orders of magnitude lower than a homomorphic-encryption baseline. A seven-dimension qualitative comparison against five prior frameworks shows CC-Shield is the only approach satisfying data-in-use protection, computation integrity, training- and inference-time protection, quantum resistance, sub-15% latency overhead, and a formal security proof simultaneously.

[...] Read more.
Fourier Transform Solution for a One-Dimensional Non-Homogeneous Wave Equation with Boundary and Initial Value Conditions

By Egbeja Johnson Sunday Yusuf Ibrahim

DOI: https://doi.org/10.5815/ijmsc.2026.03.06, Pub. Date: 8 Aug. 2026

The one-dimensional non-homogeneous wave equation subject to non-homogeneous boundary and initial conditions presents significant analytical challenges, particularly when external forcing and irregular boundary data are simultaneously present. Classical methods such as separation of variables are restricted to homogeneous settings and fail to accommodate non-homogeneous terms in a unified framework. This study employs the Fourier transform method to derive an exact analytical solution by decomposing the total wave displacement into two components: u(x,t) = V(x,t) + ψ(x), where V(x,t) is the oscillatory component satisfying the homogeneous wave equation and ψ(x) is the spatially adjusted component encoding the influence of non-homogeneous boundary conditions and external forcing. The analytical solution is verified by direct substitution and benchmarked against a second-order explicit finite-difference scheme on a grid of 500 spatial points, yielding a maximum point-wise absolute error below 8×10⁻³, consistent with the second-order truncation error of the numerical scheme. For the representative test case with unit wave speed, unit domain length, constant spatial forcing F(x) = 2, and initial displacement u₀(x) = sin(πx), the steady-state component is recovered exactly as ψ(x) = x − x², and the dominant Fourier coefficient is A₁ ≈ 0.742. A direct point-by-point comparison with published benchmark values further quantifies the sensitivity of wave solutions to boundary condition specification. The proposed framework accommodates both finite and infinite spatial domains and offers a systematic, closed-form alternative to purely numerical approaches for this class of wave propagation problems, with relevance to acoustics, structural dynamics, and materials science.

[...] Read more.
Exploring Approaches for Curve Similarity: A Comprehensive Review

By Shikha Mishra Namita Tiwari

DOI: https://doi.org/10.5815/ijmsc.2026.03.07, Pub. Date: 8 Aug. 2026

Curve similarity plays a crucial role in various domains where comparing functional or dynamic shapes is essential, including bioassay analysis, trajectory studies, spectroscopy, medical signal interpretation, and functional genomics. Despite its broad impact, research on curve similarity methods remains fragmented across statistical, computational geometry, and signal processing communities, leading to a lack of unified terminology and systematic comparison. To address this gap, this study adopts a structured literature review methodology, in which relevant studies are identified through a comprehensive search of major academic databases and selected based on predefined inclusion criteria, including peer-reviewed publications focusing on similarity measures for curves and time series. The review systematically examines mathematical and statistical approaches to curve similarity, focusing on their theoretical foundations, statistical properties, and practical applications. The selected methods are categorized into five groups: distance-based, alignment-based, topology-oriented, statistical and hypothesis testing, and learning-based approaches. For each category, key aspects such as mathematical formulation, invariance properties, robustness to sampling variability, and computational characteristics are analyzed. In addition, application domains, method comparisons, and common limitations are discussed, along with available software tools that support curve similarity analysis. By providing a structured and methodologically grounded synthesis, this review assists researchers in selecting appropriate techniques and highlights potential directions for developing more robust and scalable similarity assessment frameworks.

[...] Read more.
A Strategy and Application of Uncapacitated Facility Location Problem in Real Life under the Probabilistic Data

By Md. Mehedi Hasan Zannatul Ferdushie Sujon Chandra Sutradhar Md. Asaduzzaman

DOI: https://doi.org/10.5815/ijmsc.2026.03.08, Pub. Date: 8 Aug. 2026

This paper focuses on the methods for determining how uncertainties affect people in everyday life. Since almost nothing is deterministic, anything might become impractical in real life. We will encounter many difficulties if we lack anticipatory ideas. The business organizations are facing uncertainties in demand, supply, cost of raw materials, prices of finished products etc. in everyday life. To address these uncertainties, this study will analyse stochastic Linear Programming Problems (SLPs) aiming to bridge the gap between theoretical concepts and practical applications. This paper specifically explores the effects of assuming stochastic pricing and demand in the Uncapacitated Facility Location Problem (UCFLP), shedding light on the variations in profit. We will develop a stochastic UFLP for a company of Bangladesh known as Unilever Company of Bangladesh and it may use for any company in the world. For this, we will collect and analyse the data from the company in stochastic atmosphere. The model will help the company to be able to aware of how uncertainties of demand, supply and other factors can affect the profit and loss of the company. This approach underscores the importance of considering various factors, including demand patterns, cost-effectiveness, and regional dynamics. In the model, we will consider the data from five different regions of Bangladesh.

[...] Read more.
Performance Evaluation of Industrial and Commercial bank of China based on DuPont Analysis

By Qiaopeng Ma Xi Wang

DOI: https://doi.org/10.5815/ijmsc.2023.01.04, Pub. Date: 8 Feb. 2023

With the reform of Chinese economic system, the development of enterprises is facing many risks and challenges. In order to understand the state of operation of enterprises, it is necessary to apply relevant methods to evaluate the enterprise performance. Taking Industrial and Commercial Bank of China as an example, this paper selects its financial data from 2018 to 2021. Firstly, DuPont analysis is applied to decompose the return on equity into the product of profit margin on sales, total assets turnover ratio and equity multiplier. Then analyzes the effect of the changes of these three factors on the return on equity respectively by using the Chain substitution method. The results show that the effect of profit margin on sales on return on equity decreases year by year and tends to be positive from negative. The effect of total assets turnover ratio on return on equity changes from positive to negative and then to positive, while the effect of equity multiplier is opposite. These results provide a direction for the adjustment of the return on equity of Industrial and Commercial Bank of China. Finally, according to the results, some suggestions are put forward for the development of Industrial and Commercial Bank of China.

[...] Read more.
Numerical Investigation of the Incompressible Navier-Stokes Equations: Lid-Driven Cavity and Validation using the Ghia Benchmark

By Alok Naik

DOI: https://doi.org/10.5815/ijmsc.2026.02.07, Pub. Date: 8 Jun. 2026

This dissertation presents a numerical investigation of the two-dimensional incompressible Navier-Stokes equations, focusing on the classic Lid-Driven Cavity problem. The study develops a computational fluid dynamics (CFD) solver from first principles using the Finite Difference Method (FDM) on a structured Cartesian grid, providing a funda- mental understanding of the pressure-velocity coupling in viscous flows. The numerical framework employs the Projec- tion Method, originally proposed by Chorin, to enforce the incompressibility constraint. This operator-splitting technique solves an intermediate velocity field which is subsequently projected onto a divergence-free space via a Pressure Poisson Equation (PPE). The governing equations are discretized using second-order central differences for spatial derivatives and a first-order explicit Euler scheme for time integration. The solver is validated at a Reynolds number of Re = 100. The simulation results successfully capture the characteristic flow features, including the primary central vortex and the corner recirculation eddies. Quantitative validation is performed by comparing the vertical centerline velocity profiles against the established benchmark data of Ghia et al. The results demonstrate excellent agreement with the benchmark solutions, confirming that the developed solver correctly resolves the physics of wall-bounded shear flows. This work establishes a robust foundational framework for simulating viscous incompressible flows and highlights the efficacy of the Projection Method for fundamental CFD applications.

[...] Read more.
Evaluating the impact of Test-Driven Development on Software Quality Enhancement

By Md. Sydur Rahman Aditya Kumar Saha Uma Chakraborty Humaira Tabassum Sujana S. M. Abdullah Shafi

DOI: https://doi.org/10.5815/ijmsc.2024.03.05, Pub. Date: 8 Sep. 2024

In the software development industry, ensuring software quality holds immense significance due to its direct influence on user satisfaction, system reliability, and overall end-users. Traditionally, the development process involved identifying and rectifying defects after the implementation phase, which could be time-consuming and costly. Determining software development methodologies, with a specific emphasis on Test-Driven Development, aims to evaluate its effectiveness in improving software quality. The study employs a mixed-methods approach, combining quantitative surveys and qualitative interviews to comprehensively investigate the impact of Test-Driven Development on various facets of software quality. The survey findings unveil that Test-Driven Development offers substantial benefits in terms of early defect detection, leading to reduced costs and effort in rectifying issues during the development process. Moreover, Test-Driven Development encourages improved code design and maintainability, fostering the creation of modular and loosely coupled code structures. These results underscore the pivotal role of Test-Driven Development in elevating code quality and maintainability. Comparative analysis with traditional development methodologies highlights Test-Driven Development's effectiveness in enhancing software quality, as rated highly by respondents. Furthermore, it clarifies Test-Driven Development's positive impact on user satisfaction, overall product quality, and code maintainability. Challenges related to Test-Driven Development adoption are identified, such as the initial time investment in writing tests and difficulties adapting to changing requirements. Strategies to mitigate these challenges are proposed, contributing to the practical application of Test-Driven Development. Offers valuable insights into the efficacy of Test-Driven Development in enhancing software quality. It not only highlights the benefits of Test-Driven Development but also provides a framework for addressing challenges and optimizing its utilization. This knowledge is invaluable for software development teams, project managers, and quality assurance professionals, facilitating informed decisions regarding adopting and implementing Test-Driven Development as a quality assurance technique in software development.

[...] Read more.
Blockchain: A Comparative Study of Consensus Algorithms PoW, PoS, PoA, PoV

By Shahriar Fahim SM Katibur Rahman Sharfuddin Mahmood

DOI: https://doi.org/10.5815/ijmsc.2023.03.04, Pub. Date: 8 Aug. 2023

Since the inception of Blockchain, the computer database has been evolving into innovative technologies. Recent technologies emerge, the use of Blockchain is also flourishing. All the technologies from Blockchain use a mutual algorithm to operate. The consensus algorithm is the process that assures mutual agreements and stores information in the decentralized database of the network. Blockchain’s biggest drawback is the exposure to scalability. However, using the correct consensus for the relevant work can ensure efficiency in data storage, transaction finality, and data integrity. In this paper, a comparison study has been made among the following consensus algorithms: Proof of Work (PoW), Proof of Stake (PoS), Proof of Authority (PoA), and Proof of Vote (PoV). This study aims to provide readers with elementary knowledge about blockchain, more specifically its consensus protocols. It covers their origins, how they operate, and their strengths and weaknesses. We have made a significant study of these consensus protocols and uncovered some of their advantages and disadvantages in relation to characteristics details such as security, energy efficiency, scalability, and IoT (Internet of Things) compatibility. This information will assist future researchers to understand the characteristics of our selected consensus algorithms.

[...] Read more.
A Decision-Making Technique for Software Architecture Design

By Jubayer Ahamed Dip Nandi

DOI: https://doi.org/10.5815/ijmsc.2023.04.05, Pub. Date: 8 Dec. 2023

The process of making decisions on software architecture is the greatest significance for the achievement of a software system's success. Software architecture establishes the framework of the system, specifies its characteristics, and has significant and major effects across the whole life cycle of the system. The complicated characteristics of the software development context and the significance of the problem have caused the research community to build various methodologies focused on supporting software architects to improve their decision-making abilities. With these efforts, the implementation of such systematic methodologies looks to be somewhat constrained in practical application. Moreover, the decision-makers must overcome unexpected difficulties due to the varying software development processes that propose distinct approaches for architecture design. The understanding of these design approaches helps to develop the architectural design framework. In the area of software architecture, a significant change has occurred wherein the focus has shifted from primarily identifying the result of the architecting process, which was primarily expressed through the representation of components and connectors, to the documentation of architectural design decisions and the underlying reasoning behind them. This shift finally concludes in the creation of an architectural design framework. So, a correct decision- making approach is needed to design the software architecture. The present study analyzes the design decisions and proposes a new design decision model for the software architecture. This study introduces a new approach to the decision-making model, wherein software architecture design is viewed based on specific decisions.

[...] Read more.
Green Computing: An Era of Energy Saving Computing of Cloud Resources

By Shailesh Saxena Mohammad Zubair Khan Ravendra Singh

DOI: https://doi.org/10.5815/ijmsc.2021.02.05, Pub. Date: 8 Jun. 2021

Cloud computing is a widely acceptable computing environment, and its services are also widely available. But the consumption of energy is one of the major issues of cloud computing as a green computing. Because many electronic resources like processing devices, storage devices in both client and server site and network computing devices like switches, routers are the main elements of energy consumption in cloud and during computation power are also required to cool the IT load in cloud computing. So due to the high consumption, cloud resources define the high energy cost during the service activities of cloud computing and contribute more carbon emissions to the atmosphere. These two issues inspired the cloud companies to develop such renewable cloud sustainability regulations to control the energy cost and the rate of CO2 emission. The main purpose of this paper is to develop a green computing environment through saving the energy of cloud resources using the specific approach of identifying the requirement of computing resources during the computation of cloud services. Only required computing resources remain ON (working state), and the rest become OFF (sleep/hibernate state) to reduce the energy uses in the cloud data centers. This approach will be more efficient than other available approaches based on cloud service scheduling or migration and virtualization of services in the cloud network. It reduces the cloud data center's energy usages by applying a power management scheme (ON/OFF) on computing resources. The proposed approach helps to convert the cloud computing in green computing through identifying an appropriate number of cloud computing resources like processing nodes, servers, disks and switches/routers during any service computation on cloud to handle the energy-saving or environmental impact. 

[...] Read more.
A Review of Quantum Computing

By Arebu Dejen Murad Ridwan

DOI: https://doi.org/10.5815/ijmsc.2022.04.05, Pub. Date: 8 Oct. 2022

Quantum computing is a computational framework based on the Quantum Mechanism, which has gotten a lot of attention in the past few decades. In comparison to traditional computers, it has achieved amazing performance on several specialized tasks. Quantum computing is the study of quantum computers that use quantum mechanics phenomena such as entanglement, superposition, annealing, and tunneling to solve problems that humans cannot solve in their lifetime. This article offers a brief outline of what is happening in the field of quantum computing, as well as the current state of the art. It also summarizes the features of quantum computing in terms of major elements such as qubit computation, quantum parallelism, and reverse computing. The study investigates the cause of a quantum computer's great computing capabilities by utilizing quantum entangled states. It also emphasizes that quantum computer research requires a combination of the most sophisticated sciences, such as computer technology, micro-physics, and advanced mathematics.

[...] Read more.
Comparison of Fog Computing & Cloud Computing

By Vishal Kumar Asif Ali Laghari Shahid Karim Muhammad Shakir Ali Anwar Brohi

DOI: https://doi.org/10.5815/ijmsc.2019.01.03, Pub. Date: 8 Jan. 2019

Fog computing is extending cloud computing by transferring computation on the edge of networks such as mobile collaborative devices or fixed nodes with built-in data storage, computing, and communication devices. Fog gives focal points of enhanced proficiency, better security, organize data transfer capacity sparing and versatility. With a specific end goal to give imperative subtle elements of Fog registering, we propose attributes of this region and separate from cloud computing research. Cloud computing is developing innovation which gives figuring assets to a specific assignment on pay per utilize. Cloud computing gives benefit three unique models and the cloud gives shoddy; midway oversaw assets for dependable registering for performing required errands. This paper gives correlation and attributes both Fog and cloud computing differs by outline, arrangement, administrations and devices for associations and clients. This comparison shows that Fog provides more flexible infrastructure and better service of data processing by consuming low network bandwidth instead of shifting whole data to the cloud.

[...] Read more.
A LSB Based Image Steganography Using Random Pixel and Bit Selection for High Payload

By U. A. Md. Ehsan Ali Emran Ali Md. Sohrawordi Md. Nahid Sultan

DOI: https://doi.org/10.5815/ijmsc.2021.03.03, Pub. Date: 8 Aug. 2021

Security in digital communication is becoming more important as the number of systems is connected to the internet day by day. It is necessary to protect secret message during transmission over insecure channels of the internet. Thus, data security becomes an important research issue. Steganography is a technique that embeds secret information into a carrier such as images, audio files, text files, and video files so that it cannot be observed.  In this paper, based on spatial domain, a new image steganography method is proposed to ensure the privacy of the digital data during transmission over the internet. In this method, least significant bit substitution is proposed where the information embedded in the random bit position of a random pixel location of the cover image using Pseudo Random Number Generator (PRNG). The proposed method used a 3-3-2 approach to hide a byte in a pixel of a 24 bit color image. The method uses Pseudo Random Number Generator (PRNG) in two different stages of embedding process. The first one is used to select random pixels and the second PRNG is used select random bit position into the R, G and B values of a pixel to embed one byte of information. Due to this randomization, the security of the system is expected to increase and the method achieves a very high maximum hiding capacity which signifies the importance of the proposed method.

[...] Read more.
Some Measures of Picture Fuzzy Sets and Their Application in Multi-attribute Decision Making

By Nguyen Van Dinh Nguyen Xuan Thao

DOI: https://doi.org/10.5815/ijmsc.2018.03.03, Pub. Date: 8 Jul. 2018

To measure the difference of two fuzzy sets / intuitionistic sets, we can use the distance measure and dissimilarity measure between fuzzy sets. Characterization of distance/dissimilarity measure between fuzzy sets/intuitionistic fuzzy set is important as it has application in different areas: pattern recognition, image segmentation, and decision making. Picture fuzzy set (PFS) is a generalization of fuzzy set and intuitionistic set, so that it have many application. In this paper, we introduce concepts: difference between PFS-sets, distance measure and dissimilarity measure between picture fuzzy sets, and also provide the formulas for determining these values. We also present an application of dissimilarity measures in multi-attribute decision making.

[...] Read more.
Numerical Investigation of the Incompressible Navier-Stokes Equations: Lid-Driven Cavity and Validation using the Ghia Benchmark

By Alok Naik

DOI: https://doi.org/10.5815/ijmsc.2026.02.07, Pub. Date: 8 Jun. 2026

This dissertation presents a numerical investigation of the two-dimensional incompressible Navier-Stokes equations, focusing on the classic Lid-Driven Cavity problem. The study develops a computational fluid dynamics (CFD) solver from first principles using the Finite Difference Method (FDM) on a structured Cartesian grid, providing a funda- mental understanding of the pressure-velocity coupling in viscous flows. The numerical framework employs the Projec- tion Method, originally proposed by Chorin, to enforce the incompressibility constraint. This operator-splitting technique solves an intermediate velocity field which is subsequently projected onto a divergence-free space via a Pressure Poisson Equation (PPE). The governing equations are discretized using second-order central differences for spatial derivatives and a first-order explicit Euler scheme for time integration. The solver is validated at a Reynolds number of Re = 100. The simulation results successfully capture the characteristic flow features, including the primary central vortex and the corner recirculation eddies. Quantitative validation is performed by comparing the vertical centerline velocity profiles against the established benchmark data of Ghia et al. The results demonstrate excellent agreement with the benchmark solutions, confirming that the developed solver correctly resolves the physics of wall-bounded shear flows. This work establishes a robust foundational framework for simulating viscous incompressible flows and highlights the efficacy of the Projection Method for fundamental CFD applications.

[...] Read more.
Performance Evaluation of Industrial and Commercial bank of China based on DuPont Analysis

By Qiaopeng Ma Xi Wang

DOI: https://doi.org/10.5815/ijmsc.2023.01.04, Pub. Date: 8 Feb. 2023

With the reform of Chinese economic system, the development of enterprises is facing many risks and challenges. In order to understand the state of operation of enterprises, it is necessary to apply relevant methods to evaluate the enterprise performance. Taking Industrial and Commercial Bank of China as an example, this paper selects its financial data from 2018 to 2021. Firstly, DuPont analysis is applied to decompose the return on equity into the product of profit margin on sales, total assets turnover ratio and equity multiplier. Then analyzes the effect of the changes of these three factors on the return on equity respectively by using the Chain substitution method. The results show that the effect of profit margin on sales on return on equity decreases year by year and tends to be positive from negative. The effect of total assets turnover ratio on return on equity changes from positive to negative and then to positive, while the effect of equity multiplier is opposite. These results provide a direction for the adjustment of the return on equity of Industrial and Commercial Bank of China. Finally, according to the results, some suggestions are put forward for the development of Industrial and Commercial Bank of China.

[...] Read more.
Concepts of Bezier Polynomials and its Application in Odd Higher Order Non-linear Boundary Value Problems by Galerkin WRM

By Nazrul Islam

DOI: https://doi.org/10.5815/ijmsc.2021.01.02, Pub. Date: 8 Feb. 2021

Many different methods are applied and used in an attempt to solve higher order nonlinear boundary value problems (BVPs). Galerkin weighted residual method (GWRM) are widely used to solve BVPs. The main aim of this paper is to find the approximate solutions of fifth, seventh and ninth order nonlinear boundary value problems using GWRM. A trial function namely, Bezier Polynomials is assumed which is made to satisfy the given essential boundary conditions. Investigate the effectiveness of the current method; some numerical examples were considered. The results are depicted both graphically and numerically. The numerical solutions are in good agreement with the exact result and get a higher accuracy in the solutions. The present method is quit efficient and yields better results when compared with the existing methods. All problems are performed using the software MATLAB R2017a.

[...] Read more.
A Review of Quantum Computing

By Arebu Dejen Murad Ridwan

DOI: https://doi.org/10.5815/ijmsc.2022.04.05, Pub. Date: 8 Oct. 2022

Quantum computing is a computational framework based on the Quantum Mechanism, which has gotten a lot of attention in the past few decades. In comparison to traditional computers, it has achieved amazing performance on several specialized tasks. Quantum computing is the study of quantum computers that use quantum mechanics phenomena such as entanglement, superposition, annealing, and tunneling to solve problems that humans cannot solve in their lifetime. This article offers a brief outline of what is happening in the field of quantum computing, as well as the current state of the art. It also summarizes the features of quantum computing in terms of major elements such as qubit computation, quantum parallelism, and reverse computing. The study investigates the cause of a quantum computer's great computing capabilities by utilizing quantum entangled states. It also emphasizes that quantum computer research requires a combination of the most sophisticated sciences, such as computer technology, micro-physics, and advanced mathematics.

[...] Read more.
Blockchain: A Comparative Study of Consensus Algorithms PoW, PoS, PoA, PoV

By Shahriar Fahim SM Katibur Rahman Sharfuddin Mahmood

DOI: https://doi.org/10.5815/ijmsc.2023.03.04, Pub. Date: 8 Aug. 2023

Since the inception of Blockchain, the computer database has been evolving into innovative technologies. Recent technologies emerge, the use of Blockchain is also flourishing. All the technologies from Blockchain use a mutual algorithm to operate. The consensus algorithm is the process that assures mutual agreements and stores information in the decentralized database of the network. Blockchain’s biggest drawback is the exposure to scalability. However, using the correct consensus for the relevant work can ensure efficiency in data storage, transaction finality, and data integrity. In this paper, a comparison study has been made among the following consensus algorithms: Proof of Work (PoW), Proof of Stake (PoS), Proof of Authority (PoA), and Proof of Vote (PoV). This study aims to provide readers with elementary knowledge about blockchain, more specifically its consensus protocols. It covers their origins, how they operate, and their strengths and weaknesses. We have made a significant study of these consensus protocols and uncovered some of their advantages and disadvantages in relation to characteristics details such as security, energy efficiency, scalability, and IoT (Internet of Things) compatibility. This information will assist future researchers to understand the characteristics of our selected consensus algorithms.

[...] Read more.
Comparison on Trapezoidal and Simpson’s Rule for Unequal Data Space

By Md. Nayan Dhali Mohammad Farhad Bulbul Umme Sadiya

DOI: https://doi.org/10.5815/ijmsc.2019.04.04, Pub. Date: 8 Nov. 2019

Numerical integration compromises a broad family of algorithm for calculating the numerical value of a definite integral. Since some of the integration cannot be solved analytically, numerical integration is the most popular way to obtain the solution. Many different methods are applied and used in an attempt to solve numerical integration for unequal data space. Trapezoidal and Simpson’s rule are widely used to solve numerical integration problems. Our paper mainly concentrates on identifying the method which provides more accurate result. In order to accomplish the exactness we use some numerical examples and find their solutions. Then we compare them with the analytical result and calculate their corresponding error. The minimum error represents the best method. The numerical solutions are in good agreement with the exact result and get a higher accuracy in the solutions.

[...] Read more.
A LSB Based Image Steganography Using Random Pixel and Bit Selection for High Payload

By U. A. Md. Ehsan Ali Emran Ali Md. Sohrawordi Md. Nahid Sultan

DOI: https://doi.org/10.5815/ijmsc.2021.03.03, Pub. Date: 8 Aug. 2021

Security in digital communication is becoming more important as the number of systems is connected to the internet day by day. It is necessary to protect secret message during transmission over insecure channels of the internet. Thus, data security becomes an important research issue. Steganography is a technique that embeds secret information into a carrier such as images, audio files, text files, and video files so that it cannot be observed.  In this paper, based on spatial domain, a new image steganography method is proposed to ensure the privacy of the digital data during transmission over the internet. In this method, least significant bit substitution is proposed where the information embedded in the random bit position of a random pixel location of the cover image using Pseudo Random Number Generator (PRNG). The proposed method used a 3-3-2 approach to hide a byte in a pixel of a 24 bit color image. The method uses Pseudo Random Number Generator (PRNG) in two different stages of embedding process. The first one is used to select random pixels and the second PRNG is used select random bit position into the R, G and B values of a pixel to embed one byte of information. Due to this randomization, the security of the system is expected to increase and the method achieves a very high maximum hiding capacity which signifies the importance of the proposed method.

[...] Read more.
An Application of the Two-Factor Mixed Model Design in Educational Research

By O.A NUGA

DOI: https://doi.org/10.5815/ijmsc.2019.04.03, Pub. Date: 8 Nov. 2019

As with any ANOVA, a repeated measure ANOVA tests the equality of means. However, a repeated measure ANOVA is used when all members of a random sample are measured under a number of different conditions. As the sample is exposed to each condition in turn, the measurement of the dependent variable is repeated. Using a standard ANOVA in this case is not appropriate because it fails to model the correlation between the repeated measures: the data violate the ANOVA assumption of independence. Some ANOVA designs combine repeated measures factors and independent group factors. These types of designs are called mixed-model ANOVA and they have a split plot structure since they involve a mixture of one between-groups factor and one within-subjects factor.

   The work present an application of the mixed model factorial ANOVA, using scores obtained by 120 secondary school students in mathematics. The between group factor is the different categories of students (science, commercial humanities) with three levels while the within group factor is the three years spent in senior secondary School.

[...] Read more.
Predictive Analytics of Employee Attrition using K-Fold Methodologies

By V. Kakulapati Shaik Subhani

DOI: https://doi.org/10.5815/ijmsc.2023.01.03, Pub. Date: 8 Feb. 2023

Currently, every company is concerned about the retention of their staff. They are nevertheless unable to recognize the genuine reasons for their job resignations due to various circumstances. Each business has its approach to treating employees and ensuring their pleasure. As a result, many employees abruptly terminate their employment for no apparent reason. Machine learning (ML) approaches have grown in popularity among researchers in recent decades. It is capable of proposing answers to a wide range of issues. Then, using machine learning, you may generate predictions about staff attrition. In this research, distinct methods are compared to identify which workers are most likely to leave their organization. It uses two approaches to divide the dataset into train and test data: the 70 percent train, the 30 percent test split, and the K-Fold approaches. Cat Boost, LightGBM Boost, and XGBoost are three methods employed for accuracy comparison. These three approaches are accurately generated by using Gradient Boosting Algorithms.

[...] Read more.
Green Computing: An Era of Energy Saving Computing of Cloud Resources

By Shailesh Saxena Mohammad Zubair Khan Ravendra Singh

DOI: https://doi.org/10.5815/ijmsc.2021.02.05, Pub. Date: 8 Jun. 2021

Cloud computing is a widely acceptable computing environment, and its services are also widely available. But the consumption of energy is one of the major issues of cloud computing as a green computing. Because many electronic resources like processing devices, storage devices in both client and server site and network computing devices like switches, routers are the main elements of energy consumption in cloud and during computation power are also required to cool the IT load in cloud computing. So due to the high consumption, cloud resources define the high energy cost during the service activities of cloud computing and contribute more carbon emissions to the atmosphere. These two issues inspired the cloud companies to develop such renewable cloud sustainability regulations to control the energy cost and the rate of CO2 emission. The main purpose of this paper is to develop a green computing environment through saving the energy of cloud resources using the specific approach of identifying the requirement of computing resources during the computation of cloud services. Only required computing resources remain ON (working state), and the rest become OFF (sleep/hibernate state) to reduce the energy uses in the cloud data centers. This approach will be more efficient than other available approaches based on cloud service scheduling or migration and virtualization of services in the cloud network. It reduces the cloud data center's energy usages by applying a power management scheme (ON/OFF) on computing resources. The proposed approach helps to convert the cloud computing in green computing through identifying an appropriate number of cloud computing resources like processing nodes, servers, disks and switches/routers during any service computation on cloud to handle the energy-saving or environmental impact. 

[...] Read more.