We define and study new ideas of fibrewise topological space namely fibrewise multi-topological space . We also submit the relevance of fibrewise closed and open topological space . Also fibrewise multi-locally sliceable and fibrewise multi-locally section able multi-topological space . Furthermore, we propose and prove a number of statements about these ideas. On the other hand, extend separation axioms of ordinary topology into fibrewise setting. The separation axioms are said to be fibrewise multi-T0. spaces, fibrewise multi-T1spaces, fibrewise multi-R0 spaces, fibrewise multi-Hausdorff spaces, fibrewise multi-functionally Hausdorff spaces, fibrewise multi-regular spaces, fibrewise multi-completely regular spaces, fibrewise multi-normal

In this thesis, we introduced some kinds of fibrewise topological spaces by using totally continuous function is called fibrewise totally topological spaces. We generalize some fundamental results from fibrewise topology into fibrewise totally topological spaces. We also introduce the concepts of fibrewise totally separation axioms, fibrewise totally compact and locally totally compact topological spaces. As well as fibrewise totally perfect topological spaces. We explain and discuss new notion of fibrewise topological spaces, namely fibrewise totally topological spaces. We, also introduce the concepts of fibrewise totally closed topological spaces, fibrewise totally open topological spaces, fibrewise locally sliceable and locally s

In the analysis of multiple linear regression, the problem of multicollinearity and auto-correlation drew the attention of many researchers, and given the appearance of these two problems together and their bad effect on the estimation, some of the researchers found new methods to address these two problems together at the same time. In this research a comparison for the performance of the Principal Components Two Parameter estimator (PCTP) and The (r-k) class estimator and the r-(k,d) class estimator by conducting a simulation study and through the results and under the mean square error (MSE) criterion to find the best way to address the two problems together. The results showed that the r-(k,d) class estimator is the best esti

Background: Orthodontic therapy often causes external root resorption. Serum vitamin D (VD) level is important for tooth mineralization and bone remodeling. This study aimed to test the impact of vitamin D (VD) supplements on bone and root remodelling in a vitamin D (VD) deficient rat model following orthodontic retention. Methods and Material: 30 male Wistar rats were divided into three groups: a control group of 10 rats and two experimental groups of 10 rats each with vitamin D deficiency (VDD) induced by a VD-free diet for 21 days. And a third group with VD supplementAll groups received orthodontic active treatment using a modified orthodontic appliance that applied 50 gm of force for 14 days to move the maxillary right first mol

Directional Compact Geographic Forwarding (DCGF) routing protocol promises a minimal overhead generation by utilizing a smart antenna and Quality of Service (QoS) aware aggregation. However, DCGF was tested only in the attack-free scenario without involving the security elements. Therefore, an investigation was conducted to examine the routing protocol algorithm whether it is secure against attack-based networks in the presence of Denial-of-Service (DoS) attack. This analysis on DoS attack was carried out using a single optimal attacker, A1, to investigate the impact of DoS attack on DCGF in a communication link. The study showed that DCGF does not perform efficiently in terms of packet delivery ratio and energy consumption even on a sin

Localization is an essential demand in wireless sensor networks (WSNs). It relies on several types of measurements. This paper focuses on positioning in 3-D space using time-of-arrival- (TOA-) based distance measurements between the target node and a number of anchor nodes. Central localization is assumed and either RF, acoustic or UWB signals are used for distance measurements. This problem is treated by using iterative gradient descent (GD), and an iterative GD-based algorithm for localization of moving sensors in a WSN has been proposed. To localize a node in 3-D space, at least four anchors are needed. In this work, however, five anchors are used to get better accuracy. In GD localization of a moving sensor, the algo

In this paper, we show that for the alternating group An, the class C of n- cycle, CC covers An for n when n = 4k + 1 > 5 and odd. This class splits into two classes of An denoted by C and C/, CC= C/C/ was found.