Weibull Distribution is one of most important distribution and it is mainly used in reliability and in distribution of life time. The study handled two parameter and three-parameter Weibull Distribution in addition to five –parameter Bi-Weibull distribution. The latter being very new and was not mentioned before in many of the previous references. This distribution depends on both the two parameter and the three –parameter Weibull distributions by using the scale parameter (α) and the shape parameter (b) in the first and adding the location parameter (g)to the second and then joining them together to produce a distribution with five parameters.

The university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisfactorily solve UCTP. However, these approaches typically represent the instance-specific solutions. The hyper-heuristic framework adequately addresses this complex problem. This research proposed Particle Swarm Optimizer-based Hyper Heuristic (HH PSO) to solve UCTP efficiently. PSO is used as a higher-level method that selects low-level heuristics (LLH) sequence which further generates an optimal solution. The proposed a

This research aimed at identifying the factors that affecting in the recruitment of a teaching staff for the Massive Open Online Courses (MOOCs) in university teaching at the University of Khartoum. The descriptive method was followed. The questionnaire was used as a tool for data collection,, which was distributed directly to a sample of (181) respondent of the teaching staff members of the senate at University of Khartoum from those who were attend at the senate meeting No. (409) which was held on 22 August 2016 Of (272). The researcher followed for the distribution the chance method, where each questionnaire was distributed to each of a teaching staff from different faculties at the University of Khartoum, according to his willingness

Abstract

The aim of the current research is to prepare an integrated learning program based on mathematics standards for the next generation of the NYS and to investigate its impact on the development of the teaching performance of middle school mathematics teachers and the future thinking skills of their students. To achieve the objectives of the research, the researcher prepared a list of mathematics standards for the next generation, which were derived from a list of standards. He also prepared a list of the teaching competencies required for middle school mathematics teachers in light of the list of standards, as well as clarified the foundations of the training program and its objectives and the mathematical

conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation. 

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are

Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other