0

In this paper, we define a cubic positive implicative-ideal, a cubic implicative-ideal and a cubic commutative-ideal of a semigroup in KU-algebra as a generalization of a fuzzy (positive implicative-ideal, an implicative-ideal and a commutative-ideal) of a semigroup in KU-algebra. Some relations between these types of cubic ideals are discussed. Also, some important properties of these ideals are studied. Finally, some important theories are discussed. It is proved that every cubic commutative-ideal, cubic positive implicative-ideal, and cubic implicative-ideal are a cubic ideal, but not conversely. Also, we show that if Θ is a cubic positive implicative-ideal and a cubic commutative-ideal then Θ is a cubic implicative-ideal. Some example

The most prevalent chronic complication of diabetes mellitus is diabetic neuropathy. The pathogenesis of diabetic neuropathy is exacerbated by hyperglycemia-induced oxidative stress, which causes nerves to deteriorate in a programmed manner. Many clinical trials depend on supplement in an attempt to improve neuropathy symptoms such as (pain & tingling) and patient quality of life, one of them is Coenzyme Q10 which is reported to have an anti-inflammatory and antioxidant effects, and was totally nontoxic and non-reported side effects. This study aimed to evaluate using a Coenzyme Q10 supplement as an adjuvant therapy to gabapentin to improve the clinical symptoms of diabetic neuropathy in relation to its anti-inflammatory and antioxid

Among a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for evenly convex optimization problems defined in infinite dimensional spaces. The objective function of the primal problem is a family of (possible) infinite even convex functions. The strong duality conditions we present are based on the consideration of the epigraphs of the c-conjugate of the dual objective functions and the ε-c-subdifferential of the primal objective functions.

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

Researchers are increasingly using multimodal biometrics to strengthen the security of biometric applications. In this study, a strong multimodal human identification model was developed to address the growing problem of spoofing attacks in biometric security systems. Through the use of metaheuristic optimization methods, such as the Genetic Algorithm(GA), Ant Colony Optimization(ACO), and Particle Swarm Optimization (PSO) for feature selection, this unique model incorporates three biometric modalities: face, iris, and fingerprint. Image pre-processing, feature extraction, critical image feature selection, and multibiometric recognition are the four main steps in the workflow of the system. To determine its performance, the model wa

The Traveling Salesman Problem is a story application of Atom Swarm Optimizations in this research. We have developed several novel techniques intended for solving TSP with PSO. Additionally, we introduced the notions to Swap Operative and Swap Chronological sequence and redefining the remaining operatives their foundation; that way, the study created unique PSO. Research prove it can produce satisfactory outcomes. The aim of this paper be there to assess the functioning of particle swarm optimization, for the going salesman issue TSP. The solution to this trouble is common to be NP-hard, it has N! permutations. The study's goal is to examine the capacity of both algorithms to solve intercontinental and other benchmark problems. Overall, th

The purpose of this paper is to solve the stochastic demand for the unbalanced transport problem using heuristic algorithms to obtain the optimum solution, by minimizing the costs of transporting the gasoline product for the Oil Products Distribution Company of the Iraqi Ministry of Oil. The most important conclusions that were reached are the results prove the possibility of solving the random transportation problem when the demand is uncertain by the stochastic programming model. The most obvious finding to emerge from this work is that the genetic algorithm was able to address the problems of unbalanced transport, And the possibility of applying the model approved by the oil products distribution company in the Iraqi Ministry of Oil to m

Background and Purpose: Coronavirus has posed an unfamiliar threat to the world. Despite such circumstances, Malaysians continue to stay optimistic by keeping abreast with updates and mostly by seeking refuge in hopeful and consoling messages shared by fellow citizens. This study identified Facebook postings with positive messages, posted by Malaysians during the Movement Control Order (MCO) implemented by the Malaysian government as a form of prosocial behaviour.   Methodology: Through an analytic framework consisting of Positive Discourse Analysis and Critical Discourse Analysis, 15 Facebook postings related to COVID-19 were selected and identified as positive discourse, which were coded and categorised using a thematic analysi

This work aims to see the positive association rules and negative association rules in the Apriori algorithm by using cosine correlation analysis. The default and the modified Association Rule Mining algorithm are implemented against the mushroom database to find out the difference of the results. The experimental results showed that the modified Association Rule Mining algorithm could generate negative association rules. The addition of cosine correlation analysis returns a smaller amount of association rules than the amounts of the default Association Rule Mining algorithm. From the top ten association rules, it can be seen that there are different rules between the default and the modified Apriori algorithm. The difference of the obta