The process of digital transformation is considered one of the most influential matters in circulation at the present time, as it seeks to integrate computer-based technologies into the public services provided by companies or institutions. To achieve digital transformation, basics and points must be established, while relying on a set of employee skills and involving customers in developing this process. Today, all governments are seeking electronic transformation by converting all public services into digital, where changes in cybersecurity must be taken into account, which constitutes a large part of the priorities of nations and companies. The vulnerability to cyberspace, the development of technologies and devices, and the use

Interval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef

Wireless sensor applications are susceptible to energy constraints. Most of the energy is consumed in communication between wireless nodes. Clustering and data aggregation are the two widely used strategies for reducing energy usage and increasing the lifetime of wireless sensor networks. In target tracking applications, large amount of redundant data is produced regularly. Hence, deployment of effective data aggregation schemes is vital to eliminate data redundancy. This work aims to conduct a comparative study of various research approaches that employ clustering techniques for efficiently aggregating data in target tracking applications as selection of an appropriate clustering algorithm may reflect positive results in the data aggregati

Bragg Reflectors consist of periodic dielectric layers having an optical path length of quarter wavelength for each layer giving them important properties and makes them suitable for optoelectronics applications. The reflectivity can be increased by increasing the number of layers of the mirror to get the required value. For example for an 8 layers Bragg mirror (two layers for each dielectric pair), the contrast of the refractive index has to be equal to 0.275 for reaching reflectivity > 99%. Doubling the number of layers results in a reflectivity of 99.99%. The high reflectivity is purely caused by multiple-interference effects. It can be analyzed by using different matrix methods such as the transfer matrix method (TMM) which is the

ان الغرض من هذا البحث هو المزج بين القيود الضبابية والاحتمالية. كما يهدف الى مناقشة اكثر حالات مشكلات البرمجة الضبابية شيوعا وهي عندما تكون المشكلة الضبابية تتبع دالة الانتماء مرة دالة الاتنماء المثلثية مرة اخرى، من خلال التطبيق العملي والتجريبي. فضلا عن توظيف البرمجة الخطية الضبابية في معالجة مشكلات تخطيط وجدولة الإنتاج لشركة العراق لصناعة الأثاث، وكذلك تم استخدام الطرائق الكمية للتنبؤ بالطلب واعتماده

     We introduce and discuss the modern type of fibrewise topological spaces, namely fibrewise fuzzy topological spaces. Also, we introduce the concepts of fibrewise closed fuzzy topological spaces, fibrewise open fuzzy topological spaces, fibrewise locally sliceable fuzzy topological spaces and fibrewise locally sectionable fuzzy topological spaces. Furthermore, we state and prove several theorems concerning these concepts.

In this paper the research introduces a new definition of a fuzzy normed space then the related concepts such as fuzzy continuous, convergence of sequence of fuzzy points and Cauchy sequence of fuzzy points are discussed in details.

           This paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η) defined on a semigraph G^* in which σ : V → [0, 1], μ : VxV → [0, 1] and η : X → [0, 1] satisfy the conditions that for all the vertices u, v in the vertex set,  μ(u, v) ≤ σ(u) ᴧ σ(v) and  η(e) = μ(u₁, u₂) ᴧ μ(u₂, u₃) ᴧ … ᴧ μ(u_n-1, u_n) ≤ σ(u₁) ᴧ σ(u_n), if e = (u₁, u₂, …, u_n), n ≥ 2 is an edge in the semigraph G