In this paper, we introduce the concept of cubic bipolar-fuzzy ideals with thresholds (α,β),(ω,ϑ) of a semigroup in KU-algebra as a generalization of sets and in short (CBF). Firstly, a (CBF) sub-KU-semigroup with a threshold (α,β),(ω,ϑ) and some results in this notion are achieved. Also, (cubic bipolar fuzzy ideals and cubic bipolar fuzzy k-ideals) with thresholds (α,β),(ω ,ϑ) are defined and some properties of these ideals are given. Relations between a (CBF).sub algebra and-a (CBF) ideal are proved. A few characterizations of a (CBF) k-ideal with thresholds (α, β), (ω,ϑ) are discussed. Finally, we proved that a (CBF) k-ideal and a (CBF) ideal with thresholds (α, β), (ω,ϑ) of a KU-semi group are equivalent relations.

The purpose of this paper is to apply different transportation models in their minimum and maximum values by finding starting basic feasible solution and finding the optimal solution. The requirements of transportation models were presented with one of their applications in the case of minimizing the objective function, which was conducted by the researcher as real data, which took place one month in 2015, in one of the poultry farms for the production of eggs

Sickle cell disease (SCD) is a hereditary ailment that can cause severe pain and suffering to people who are affected. However, with continued investment in research and treatment options, we can make progress towards improving the lives of those with SCD. Over 40% of patients experience painful vaso-occlusive crises (VOCs), so we must work towards finding solutions and providing support for those living with this condition, These episodes, a hallmark of SCD, significantly contribute to morbidity, mortality, and a diminished quality of life, while also incurring substantial healthcare costs. Chronic pain particularly affects older adolescents and adults with SCD, with over half reporting daily discomfort. Opioid-based analgesics, though sti

Cryptography algorithms play a critical role in information technology against various attacks witnessed in the digital era. Many studies and algorithms are done to achieve security issues for information systems. The high complexity of computational operations characterizes the traditional cryptography algorithms. On the other hand, lightweight algorithms are the way to solve most of the security issues that encounter applying traditional cryptography in constrained devices. However, a symmetric cipher is widely applied for ensuring the security of data communication in constraint devices. In this study, we proposed a hybrid algorithm based on two cryptography algorithms PRESENT and Salsa20. Also, a 2D logistic map of a chaotic system is a

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith