The current research aimed to investigate the psychometric characteristics of the Arabic version of the Nomophobia scale for the Omani youth. The scale was administered to a random sample of students from public and private universities and colleges in Oman. The research sample consisted of 2507 students, of whom 868 males and 1639 females. The validity of the measure was first checked by presenting the scale to a group of experts in this field. Then the exploratory and confirmatory factor analysis was carried out. The exploratory factor analysis revealed the existence of three main factors: the fear of connectivity loss, the fear of communication loss with others, and the fear of network outages. These factors accounted for 65.6% of the

ABSTRACT Planetary Nebulae (PN) distances represent the fundamental parameter for the determination the physical properties of the central star of PN. In this paper the distances scale to Planetary Nebulae in the Galactic bulge were calculated re- lated to previous distances scales. The proposed distance scale was done by recalibrated the previous distance scale technique CKS/D82. This scale limited for nearby PN (D ≤ 3.5 kpc), so the surface fluxes less than other distance scales. With these criteria the results showed that the proposed distance scale is more accurate than other scales related to the observations for adopted sample of PN distances, also the limit of ionized radius (Rio) for all both optically thick and optically thin in

The convergence speed is the most important feature of Back-Propagation (BP) algorithm. A lot of improvements were proposed to this algorithm since its presentation, in order to speed up the convergence phase. In this paper, a new modified BP algorithm called Speeding up Back-Propagation Learning (SUBPL) algorithm is proposed and compared to the standard BP. Different data sets were implemented and experimented to verify the improvement in SUBPL.

A strong sign language recognition system can break down the barriers that separate hearing and speaking members of society from speechless members. A novel fast recognition system with low computational cost for digital American Sign Language (ASL) is introduced in this research. Different image processing techniques are used to optimize and extract the shape of the hand fingers in each sign. The feature extraction stage includes a determination of the optimal threshold based on statistical bases and then recognizing the gap area in the zero sign and calculating the heights of each finger in the other digits. The classification stage depends on the gap area in the zero signs and the number of opened fingers in the other signs as well as

Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.

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