ASPG Menu
search

American Scientific Publishing Group

Research Feed

Found 3701 matches for "All Articles"

An Efficient Learning Approach to Imbalanced Multinomial Classification

The presented methodology provides an innovative way to answer a question that is rarely observed in academic literature: How can complex data issues like multiple class imbalance be solved using the available models in a simple and efficient way? In this approach, observations are modeled without additional preprocessing. Several classification models including Random Forest (RF), Support Vector Machines (SVM), and Decision Tree (DT) are utilized for conducting the classification analysis. The parameters of these models and the cross-validation function are adjusted to each individual set of observations. This approach has not been researched in depth. We test it about class imbalance in the target variable. Our results demonstrate the benefits of the proposed method.  First, parameter tuning of ML models can be an effective strategy to handle class imbalance. Second, random shuffling prior to cross validation can be a key to resolving the bias coming from multiclass imbalance. Another important finding is that the best results can be achieved when random shuffling, cross validation and parameter tuning are combined. These findings are key to handling class imbalance in classification. Therefore, this research extends the opportunities to handle class imbalance in a simple, quick, and effective way in cases without adding additional complexity to the model.

groups
Ani Petkova mail -
Borislava Toleva mail -
Ivan Ivanov mail
link https://doi.org/10.54216/FPA.180215

Volume & Issue

Vol. Volume 18 / Iss. Issue 2

Details open_in_new

Survey of Research Opportunities that use Artificial Intelligence in Image Steganography

Steganography conceals ”secrets” within an convenient and expedient multimedia carrier. The carrier could be text (i.e., not plain text), images, audio and/or video files (i.e., carrier channels). The fact that concealed information is contained in the otherwise ordinary and mundane carrier file is known only by the sender-receiver pair. Only they share the existence of the secret. Images are the most popular (i.e., multimedia) carriers because of their inherent property that enables better obfuscation. Content adaptive image steganography is a new trend in the field for messaging secrets inside unsuspected image file transfers. As the name suggests, the embedding locations are altered adaptively depending on the image content that optimizes the decision of choosing a location inside the carrier so that an embedding is not discernible (i.e., additive distortion is minimized). Herein, we critique the various approaches used for content-adaptive image steganography which can be broadly categorized as CNNbased, GAN-based, along with minimizing additive distortion function-based. We provide a brief historical account toward better anticipating the future research opportunities in terms of properties, and evaluation metrics. A summary table of these past and future directions is provided. Moreover, we highlight trends along with their concomitant advantages and disadvantages toward identifying opportunity gaps.

groups
Ayyah Abdulhafidh Mahmoud Fadhl mail -
Bander Ali Saleh Al-rimy mail -
Sultan Ahmed Almalki mail -
Tami Abdulrahman Alghamdi mail -
Azan Hamad Alkhorem mail -
Frederick T. Sheldon mail
link https://doi.org/10.54216/FPA.180216

Volume & Issue

Vol. Volume 18 / Iss. Issue 2

Details open_in_new

On the Numerical Approximation and Optimization Techniques for Solving an Inverse Cauchy Problem of Viscous-Burgers’ Equation

This paper deals with some inverse problems for nonlinear time-dependent PDEs in one spatial dimension, we investigate an inverse Cauchy problem that is settled by the nonlinear viscous Burgers equation. The viscous Burgers equation is a partial differential equation that is encountered in fluid dynamics studies, particularly in the domain of upward flow. The simplified model of the viscous Burgers equation explains the behavior of incompressible viscous fluid. The inverse Burgers problem belongs to a class of problems called ill-posed problems, which implies that there may be multiple sets of initial and/or boundary conditions that result in the same solution of the Burgers equation. To obtain robust and reliable solutions, it is essential to use regularization and cross-validation methods. However, it is often difficult to solve analytically, so numerical approaches are developed to overcome this difficulty. Domain decomposition (DDM) was used with alternative iterative methods. We performed a numerical reconstruction of the velocity and normal stress tensor that were vanished on an inaccessible part of the boundary using the over-prescribed noisy data obtained on the other accessible part of the boundary.

groups
Mohammed A. Hilal mail -
Faris M. Alwan mail -
Alaa Adnan Auad mail
link https://doi.org/10.54216/IJNS.250428

Volume & Issue

Vol. Volume 25 / Iss. Issue 4

Details open_in_new

Subclass of uniformly starlike functions associated with a linear operator whose coefficients are the reciprocal Gamma function

This study, aims to consider the coefficients of the reciprocal Gamma function in order introduce a linear operator by the means of Hadamard product. Thus, we define a new subclass of uniformly starlike functions of order 𝛼, Γ−1(𝛼). Further, we obtain coefficient estimates, distortion theorems, convex linear combinations and radii of close-to-convexity, starlikeness and convexity for functions 𝑓∈Γ−1(𝛼). In addition, we investigate the inclusion conditions for the Hadamard product and the Integral transform.

groups
Jamal Salah mail
link https://doi.org/10.54216/IJNS.250429

Volume & Issue

Vol. Volume 25 / Iss. Issue 4

Details open_in_new

Exploring Critical Path Solving Methods under Neutrosophic

Over the past few decades, the traditional critical path method and its various generalizations have become the most popular technique for managing complex projects. It plays a crucial role in differentiating between critical and non-critical tasks to enhance project schedules. For the first time in the literature, our proposed model implements two algorithms for the study of the critical path method, each addressing an advanced framework in the form of a single-valued triangular neutrosophic. The proposed algorithm 1 utilizes Python to extended Dijkstra’s algorithm under the neutrosophic framework, while the proposed algorithm 2 employs linear programming for optimality checks, which is solved using LINGO. Our comparison with previous research on the critical path method shows that the proposed algorithms are better at dealing with uncertainty, making project schedules more reliable and flexible. The findings lead to the proposed algorithm framework, combined with Python and LINGO, to enhance decision-making and improve the accuracy and efficiency of critical path identification in complex project environments.

groups
M. Navya Pratyusha mail -
Ranjan Kumar mail
link https://doi.org/10.54216/IJNS.250430

Volume & Issue

Vol. Volume 25 / Iss. Issue 4

Details open_in_new

New Higher-Order Implicit Method for Approximating Solutions of Boundary-Value Problems

This paper is devoted to introducing a novel numerical approach for approximating solutions to Boundary Value Problems (BVPs). Such an approach will be carried out by using a new version of the shooting method, which would convert the BVP into a linear system of two initial value problems. This system can then be solved by the so-called Obreschkoff approach. The numerical solution of the main BVP will ultimately be a linear combination of the solutions of the two system of equations. Two physical applications will be presented in order to confirm that the suggested numerical technique is valid.

groups
Iqbal M. Batiha mail -
Mohammad W. Alomari mail -
Iqbal H. Jebril mail -
Thabet Abdeljawad mail -
Nidal Anakira mail -
Shaher Momani mail
link https://doi.org/10.54216/IJNS.250432

Volume & Issue

Vol. Volume 25 / Iss. Issue 4

Details open_in_new

Fixed Points Results in Algebra Fuzzy Metric Space with an Application to Integral Equations

This paper introduces a new class of mappings termed (α̂,β̂)−Ω-contraction mapping (briefly, "(α̂,β̂)−Ω−CMap") and establishes certain fixed-point (FP) results in the framework of Algebra fuzzy metric space. Additionally, we expanded our results to include the existence of a nonlinear integral equation solution. Results from this study improve, expand and generalization certain previously published results in the literature.

groups
Raghad I. Sabri mail -
Jaafer Hmood Eidi mail -
Hussein S. ALallak mail
link https://doi.org/10.54216/IJNS.250433

Volume & Issue

Vol. Volume 25 / Iss. Issue 4

Details open_in_new

Investigating Workplace Challenges: A Neutrosophic Soft Set Analysis of Female Workers' Problems in Diverse Industries

This research proposes a novel approach to rank the problems faced by female employees in various sectors by utilizing the concept of the bipolar single-valued Neutrosophic soft set-in variable. The feature assessment used an enormous collection of multi-observer information as a basis for examining the issues encountered by women employed in a variety of sectors. An effective method for identifying the Neutrosophic domain's choice-making problem is the Neutrosophic Soft Set. The creation of similar tables has shaped the investigation into classification. In a Neutrosophic setting, grouping objects and persons according to their properties, capacities, the result, etc., is advantageous.

groups
John Jayaraj J. mail -
I. Paulraj Jayasimman mail -
N. Jose Parvin Praveena mail -
broumi said mail
link https://doi.org/10.54216/IJNS.250434

Volume & Issue

Vol. Volume 25 / Iss. Issue 4

Details open_in_new

Some New Results about Neutrosophic KU-Module

In this paper, we present new concept namely neutrosophic algebra. Some types of notions such as KU-module, KU-ideal and KU-submodule. We proved that if AI is minimal submodule, then AI ascending (descending) chain condition. On the other hand, more results about Neutrosophic exact sequence and Neutrosophic homomorphism KU-module have been presented.

groups
Mohammed N. Hamidy mail -
Majid Mohammed Abed mail
link https://doi.org/10.54216/IJNS.250435

Volume & Issue

Vol. Volume 25 / Iss. Issue 4

Details open_in_new

On a convex topological order and neutrosophic continuous sets

In this paper, we employ the classical topological preorder to introduce the concept of topologically bounded sets, in order to relate it to the Collatz conjecture problem. In addition, this preorder allows us to derive some results about topologically convex sets, showing that these form a convex structure. Finally, using this topological preorder, we define the neutrosophic continuous sets and establish the necessary conditions to identify the points that are connected to these sets, which form a topological convex set.

groups
Elvis Aponte mail -
Jorge Vielma mail -
Jos´e Sanabria mail -
Ennis Rosas mail
link https://doi.org/10.54216/IJNS.250436

Volume & Issue

Vol. Volume 25 / Iss. Issue 4

Details open_in_new