In the current study, the definition of mapping of fuzzy neutrosophic generalized semi-continuous and fuzzy neutrosophic alpha has generalized mapping as continuous. The study confirmed some theorems regarding such a concept. In the following, it has been found relationships among fuzzy neutrosophic alpha generalized mapping as continuous, fuzzy neutrosophic mapping as continuous, fuzzy neutrosophic alpha mapping as continuous, fuzzy neutrosophic generalized semi mapping as continuous, fuzzy neutrosophic pre mapping as continuous and fuzzy neutrosophic γ mapping as continuous.

The optical absorption data of Hydrogenated Amorphous Silicon was analyzed using a Dunstan model of optical absorption in amorphous semiconductors. This model introduces disorder into the band-band absorption through a linear exponential distribution of local energy gaps, and it accounts for both the Urbach and Tauc regions of the optical absorption edge.Compared to other models of similar bases, such as the O’Leary and Guerra models, it is simpler to understand mathematically and has a physical meaning. The optical absorption data of Jackson et al and Maurer et al were successfully interpreted using Dunstan’s model. Useful physical parameters are extracted especially the band to the band energy gap , which is the energy gap in the a

A mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc

Diabetes imposes a substantial public health burden; according to the International Diabetes Federation, there were about 3.4 million diabetes related deaths worldwide in 2024, and in Iraq, the Federation reports that one in nine adults lives with diabetes in 2024, with 14,683 adult deaths attributable to diabetes and a total diabetes related health expenditure of 2,078 million United States dollars. The dataset analyzed in this study contains 1,000 records collected in 2020 from two Iraqi teaching hospitals and includes multiple clinical and laboratory measurements with three outcome classes, namely Non diabetic, Pre diabetic, and Diabetic, with a low prevalence of the Pre diabetic class and an imbalanced overall class distribution; the da

Traffic classification is referred to as the task of categorizing traffic flows into application-aware classes such as chats, streaming, VoIP, etc. Most systems of network traffic identification are based on features. These features may be static signatures, port numbers, statistical characteristics, and so on. Current methods of data flow classification are effective, they still lack new inventive approaches to meet the needs of vital points such as real-time traffic classification, low power consumption, ), Central Processing Unit (CPU) utilization, etc. Our novel Fast Deep Packet Header Inspection (FDPHI) traffic classification proposal employs 1 Dimension Convolution Neural Network (1D-CNN) to automatically learn more representational c

In general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot.  Simulation results, whi