Secondary trigeminal neuralgia (STN) results from an identifiable underlying pathology, including tumor compression, multiple sclerosis, arteriovenous malformations, hypertension, structural lesions, inflammation, trauma, or familial genetic conditions. This study, through a comprehensive review of the literature in PubMed, Google Scholar, Web of Science, and the Cochrane Library, explores the multifaceted aspects of STN. This study delves into the diverse etiological factors, focusing on the pathophysiological mechanisms that lead to trigeminal nerve dysfunction. The clinical manifestations of STN often overlap with those of primary trigeminal neuralgia, creating diagnostic challenges and necessitating a thorough evaluation that in

Purpose: To use the L25 Taguchi orthogonal array for optimizing the three main solvothermal parameters that affect the synthesis of metal-organic frameworks-5 (MOF-5). Methods: The L25 Taguchi methodology was used to study various parameters that affect the degree of crystallinity (DOC) of MOF-5. The parameters comprised temperature of synthesis, duration of synthesis, and ratio of the solvent, N,N-dimethyl formamide (DMF) to reactants. For each parameter, the volume of DMF was varied while keeping the weight of reactants constant. The weights of 1,4-benzodicarboxylate (BDC) and Zn(NO3)2.6H2O used were 0.390 g and 2.166 g, respectively. For each parameter investigated, five different levels were used. The MOF-5 samples were synthesi

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

The distribution of the expanded exponentiated power function EEPF with four parameters, was presented by the exponentiated expanded method using the expanded distribution of the power function, This method is characterized by obtaining a new distribution belonging to the exponential family, as we obtained the survival rate and failure rate function for this distribution, Some mathematical properties were found, then we used the developed least squares method to estimate the parameters using the genetic algorithm, and a Monte Carlo simulation study was conducted to evaluate the performance of estimations of possibility using the Genetic algorithm GA.

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonic

Digital image manipulation has become increasingly prevalent due to the widespread availability of sophisticated image editing tools. In copy-move forgery, a portion of an image is copied and pasted into another area within the same image. The proposed methodology begins with extracting the image's Local Binary Pattern (LBP) algorithm features. Two main statistical functions, Stander Deviation (STD) and Angler Second Moment (ASM), are computed for each LBP feature, capturing additional statistical information about the local textures. Next, a multi-level LBP feature selection is applied to select the most relevant features. This process involves performing LBP computation at multiple scales or levels, capturing textures at different

High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination